forked from lxn/walk
-
Notifications
You must be signed in to change notification settings - Fork 0
/
actionlist.go
190 lines (143 loc) · 3.38 KB
/
actionlist.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
// Copyright 2010 The Walk Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// +build windows
package walk
type actionListObserver interface {
onInsertedAction(action *Action) error
onRemovingAction(action *Action) error
onClearingActions() error
}
type nopActionListObserver struct{}
func (nopActionListObserver) onInsertedAction(action *Action) error {
return nil
}
func (nopActionListObserver) onRemovingAction(action *Action) error {
return nil
}
func (nopActionListObserver) onClearingActions() error {
return nil
}
type ActionList struct {
actions []*Action
observer actionListObserver
}
func newActionList(observer actionListObserver) *ActionList {
if observer == nil {
panic("observer == nil")
}
return &ActionList{observer: observer}
}
func (l *ActionList) Add(action *Action) error {
return l.Insert(len(l.actions), action)
}
func (l *ActionList) AddMenu(menu *Menu) (*Action, error) {
return l.InsertMenu(len(l.actions), menu)
}
func (l *ActionList) At(index int) *Action {
return l.actions[index]
}
func (l *ActionList) Clear() error {
if err := l.observer.onClearingActions(); err != nil {
return err
}
for _, a := range l.actions {
a.release()
}
l.actions = l.actions[:0]
return nil
}
func (l *ActionList) Contains(action *Action) bool {
return l.Index(action) > -1
}
func (l *ActionList) Index(action *Action) int {
for i, a := range l.actions {
if a == action {
return i
}
}
return -1
}
func (l *ActionList) indexInObserver(action *Action) int {
var idx int
for _, a := range l.actions {
if a == action {
return idx
}
if a.Visible() {
idx++
}
}
return -1
}
func (l *ActionList) Insert(index int, action *Action) error {
l.actions = append(l.actions, nil)
copy(l.actions[index+1:], l.actions[index:])
l.actions[index] = action
if err := l.observer.onInsertedAction(action); err != nil {
l.actions = append(l.actions[:index], l.actions[index+1:]...)
return err
}
action.addRef()
if action.Visible() {
return l.updateSeparatorVisibility()
}
return nil
}
func (l *ActionList) InsertMenu(index int, menu *Menu) (*Action, error) {
action := NewAction()
action.menu = menu
if err := l.Insert(index, action); err != nil {
return nil, err
}
return action, nil
}
func (l *ActionList) Len() int {
return len(l.actions)
}
func (l *ActionList) Remove(action *Action) error {
index := l.Index(action)
if index == -1 {
return nil
}
return l.RemoveAt(index)
}
func (l *ActionList) RemoveAt(index int) error {
action := l.actions[index]
if action.Visible() {
if err := l.observer.onRemovingAction(action); err != nil {
return err
}
}
action.release()
l.actions = append(l.actions[:index], l.actions[index+1:]...)
if action.Visible() {
return l.updateSeparatorVisibility()
}
return nil
}
func (l *ActionList) updateSeparatorVisibility() error {
var hasCurVisAct bool
var curVisSep *Action
for _, a := range l.actions {
if visible := a.Visible(); a.IsSeparator() {
toggle := visible != hasCurVisAct
if toggle {
visible = !visible
if err := a.SetVisible(visible); err != nil {
return err
}
}
if visible {
curVisSep = a
}
hasCurVisAct = false
} else if visible {
hasCurVisAct = true
}
}
if !hasCurVisAct && curVisSep != nil {
return curVisSep.SetVisible(false)
}
return nil
}