|
458
|
1 |
"
|
|
|
2 |
COPYRIGHT (c) 1997 by eXept Software AG / Claus Gittinger
|
|
|
3 |
All Rights Reserved
|
|
|
4 |
|
|
|
5 |
This software is furnished under a license and may be used
|
|
|
6 |
only in accordance with the terms of that license and with the
|
|
|
7 |
inclusion of the above copyright notice. This software may not
|
|
|
8 |
be provided or otherwise made available to, or used by, any
|
|
|
9 |
other person. No title to or ownership of the software is
|
|
|
10 |
hereby transferred.
|
|
|
11 |
"
|
|
|
12 |
|
|
|
13 |
|
|
|
14 |
|
|
|
15 |
Model subclass:#SelectionInTree
|
|
496
|
16 |
instanceVariableNames:'root list selection showRoot'
|
|
458
|
17 |
classVariableNames:''
|
|
|
18 |
poolDictionaries:''
|
|
|
19 |
category:'Interface-Support-Models'
|
|
|
20 |
!
|
|
|
21 |
|
|
|
22 |
!SelectionInTree class methodsFor:'documentation'!
|
|
|
23 |
|
|
|
24 |
copyright
|
|
|
25 |
"
|
|
|
26 |
COPYRIGHT (c) 1997 by eXept Software AG / Claus Gittinger
|
|
|
27 |
All Rights Reserved
|
|
|
28 |
|
|
|
29 |
This software is furnished under a license and may be used
|
|
|
30 |
only in accordance with the terms of that license and with the
|
|
|
31 |
inclusion of the above copyright notice. This software may not
|
|
|
32 |
be provided or otherwise made available to, or used by, any
|
|
|
33 |
other person. No title to or ownership of the software is
|
|
|
34 |
hereby transferred.
|
|
|
35 |
"
|
|
|
36 |
|
|
|
37 |
|
|
|
38 |
!
|
|
|
39 |
|
|
|
40 |
documentation
|
|
|
41 |
"
|
|
|
42 |
list and selection holder for hierarchical list structures. Used
|
|
|
43 |
to buildup file-trees, class tress etc.
|
|
|
44 |
|
|
|
45 |
Especially suited for use with SelectionInTreeView.
|
|
|
46 |
|
|
|
47 |
[See also:]
|
|
|
48 |
TreeItem
|
|
|
49 |
SelectionInTreeView
|
|
|
50 |
|
|
|
51 |
[Author:]
|
|
|
52 |
W. Olberding
|
|
|
53 |
Claus Atzkern
|
|
|
54 |
"
|
|
|
55 |
! !
|
|
|
56 |
|
|
|
57 |
!SelectionInTree methodsFor:'accessing'!
|
|
|
58 |
|
|
|
59 |
list
|
|
|
60 |
"get list oc currently shown objects
|
|
|
61 |
"
|
|
|
62 |
^ list
|
|
|
63 |
!
|
|
|
64 |
|
|
|
65 |
root
|
|
|
66 |
"get the root node
|
|
|
67 |
"
|
|
|
68 |
^ root
|
|
|
69 |
!
|
|
|
70 |
|
|
509
|
71 |
root:aRoot
|
|
|
72 |
"set a new root
|
|
458
|
73 |
"
|
|
515
|
74 |
(root := aRoot) notNil ifTrue:[
|
|
|
75 |
root parent:nil
|
|
|
76 |
].
|
|
496
|
77 |
self recomputeList.
|
|
|
78 |
|
|
|
79 |
! !
|
|
491
|
80 |
|
|
496
|
81 |
!SelectionInTree methodsFor:'accessing behavior'!
|
|
|
82 |
|
|
|
83 |
showRoot
|
|
|
84 |
"list with or without root
|
|
|
85 |
"
|
|
|
86 |
^ showRoot
|
|
491
|
87 |
!
|
|
|
88 |
|
|
496
|
89 |
showRoot:aState
|
|
|
90 |
"list with or without root
|
|
491
|
91 |
"
|
|
496
|
92 |
aState ~~ showRoot ifTrue:[
|
|
|
93 |
showRoot := aState.
|
|
491
|
94 |
|
|
496
|
95 |
root notNil ifTrue:[
|
|
|
96 |
aState ifTrue:[list addFirst:root]
|
|
|
97 |
ifFalse:[list removeFirst].
|
|
491
|
98 |
|
|
496
|
99 |
self changed:#list.
|
|
491
|
100 |
].
|
|
|
101 |
].
|
|
458
|
102 |
! !
|
|
|
103 |
|
|
|
104 |
!SelectionInTree methodsFor:'accessing hierarchy'!
|
|
|
105 |
|
|
|
106 |
collapse:something
|
|
|
107 |
"collapse a node or collection of nodes
|
|
|
108 |
"
|
|
|
109 |
|invalidate|
|
|
|
110 |
|
|
|
111 |
self each:something do:[:aNode|
|
|
|
112 |
aNode isCollapsable ifTrue:[
|
|
|
113 |
aNode collapse.
|
|
|
114 |
invalidate := true
|
|
|
115 |
]
|
|
|
116 |
].
|
|
|
117 |
invalidate == true ifTrue:[self recomputeList]
|
|
|
118 |
!
|
|
|
119 |
|
|
509
|
120 |
expand
|
|
|
121 |
"expand the root
|
|
|
122 |
"
|
|
|
123 |
self expand:root
|
|
|
124 |
!
|
|
|
125 |
|
|
458
|
126 |
expand:something
|
|
|
127 |
"expand a node or collection of nodes
|
|
|
128 |
"
|
|
|
129 |
|invalidate|
|
|
|
130 |
|
|
|
131 |
self each:something do:[:aNode|
|
|
|
132 |
aNode isExpandable ifTrue:[
|
|
|
133 |
aNode expand.
|
|
|
134 |
invalidate := true
|
|
|
135 |
]
|
|
|
136 |
].
|
|
|
137 |
invalidate == true ifTrue:[self recomputeList]
|
|
|
138 |
! !
|
|
|
139 |
|
|
|
140 |
!SelectionInTree methodsFor:'adding & removing'!
|
|
|
141 |
|
|
|
142 |
add:something after:aChild
|
|
|
143 |
"add a node or collection of nodes to parent after a child
|
|
|
144 |
"
|
|
|
145 |
"add a node or collection of nodes to after a child
|
|
|
146 |
"
|
|
|
147 |
aChild notNil ifTrue:[
|
|
|
148 |
aChild parent add:something after:aChild.
|
|
|
149 |
self recomputeList
|
|
|
150 |
]
|
|
|
151 |
!
|
|
|
152 |
|
|
|
153 |
add:something afterIndex:anIndex below:aParent
|
|
|
154 |
"add a node or collection of nodes to parent after an index
|
|
|
155 |
"
|
|
|
156 |
aParent add:something afterIndex:anIndex.
|
|
|
157 |
self recomputeList
|
|
|
158 |
|
|
|
159 |
!
|
|
|
160 |
|
|
|
161 |
add:something before:aChild
|
|
|
162 |
"add a node or collection of nodes to before a child
|
|
|
163 |
"
|
|
|
164 |
aChild notNil ifTrue:[
|
|
|
165 |
aChild parent add:something before:aChild.
|
|
|
166 |
self recomputeList
|
|
|
167 |
]
|
|
|
168 |
!
|
|
|
169 |
|
|
|
170 |
add:something beforeIndex:anIndex below:aParent
|
|
|
171 |
"add a node or collection of nodes to parent before an index
|
|
|
172 |
"
|
|
|
173 |
aParent add:something beforeIndex:anIndex.
|
|
|
174 |
self recomputeList
|
|
|
175 |
|
|
|
176 |
!
|
|
|
177 |
|
|
|
178 |
add:something below:aParent
|
|
|
179 |
"add a node or collection of nodes to parent
|
|
|
180 |
"
|
|
|
181 |
aParent add:something.
|
|
|
182 |
self recomputeList
|
|
|
183 |
|
|
|
184 |
!
|
|
|
185 |
|
|
|
186 |
remove:something
|
|
|
187 |
"remove a node or collection of nodes
|
|
|
188 |
"
|
|
|
189 |
|invalidate|
|
|
|
190 |
|
|
|
191 |
self each:something do:[:aNode|
|
|
|
192 |
aNode parent notNil ifTrue:[
|
|
|
193 |
aNode parent remove:aNode.
|
|
|
194 |
invalidate := true
|
|
|
195 |
]
|
|
|
196 |
].
|
|
|
197 |
invalidate == true ifTrue:[self recomputeList].
|
|
|
198 |
^ something
|
|
|
199 |
!
|
|
|
200 |
|
|
|
201 |
removeIndex:something
|
|
|
202 |
"remove a node at index or collection of indexed nodes
|
|
|
203 |
"
|
|
|
204 |
|invalidate node|
|
|
|
205 |
|
|
|
206 |
something isCollection ifFalse:[
|
|
|
207 |
(something isNil or:[something == 0]) ifFalse:[
|
|
|
208 |
^ self remove:(list at:something)
|
|
|
209 |
].
|
|
|
210 |
^ nil
|
|
|
211 |
].
|
|
|
212 |
|
|
|
213 |
(SortedCollection withAll:something) reverseDo:[:anIndex|
|
|
|
214 |
node := list at:anIndex.
|
|
|
215 |
|
|
|
216 |
node parent notNil ifTrue:[
|
|
|
217 |
node parent remove:node.
|
|
|
218 |
invalidate := true
|
|
|
219 |
]
|
|
|
220 |
].
|
|
|
221 |
invalidate == true ifTrue:[self recomputeList].
|
|
|
222 |
!
|
|
|
223 |
|
|
|
224 |
removeSelection
|
|
|
225 |
"remove selected nodes
|
|
|
226 |
"
|
|
|
227 |
self removeIndex:(self selectionIndex).
|
|
|
228 |
self selectionIndex:nil
|
|
|
229 |
! !
|
|
|
230 |
|
|
758
|
231 |
!SelectionInTree methodsFor:'change & update'!
|
|
|
232 |
|
|
|
233 |
invalidate
|
|
|
234 |
"called; something changed what requires a redraw but no recomputation.
|
|
|
235 |
for example a name
|
|
|
236 |
"
|
|
|
237 |
self dependents do:[:aDependent|
|
|
|
238 |
aDependent isView ifTrue:[ aDependent invalidate ]
|
|
|
239 |
].
|
|
|
240 |
|
|
|
241 |
|
|
|
242 |
! !
|
|
|
243 |
|
|
458
|
244 |
!SelectionInTree methodsFor:'enumerating'!
|
|
|
245 |
|
|
|
246 |
each:something do:aBlock
|
|
|
247 |
"evaluate a block for something or in case of a collection for each
|
|
|
248 |
element in the collection
|
|
|
249 |
"
|
|
|
250 |
something notNil ifTrue:[
|
|
|
251 |
something isCollection ifTrue:[something do:[:el|aBlock value:el]]
|
|
|
252 |
ifFalse:[aBlock value:something]
|
|
|
253 |
]
|
|
|
254 |
|
|
|
255 |
! !
|
|
|
256 |
|
|
496
|
257 |
!SelectionInTree methodsFor:'initialization'!
|
|
|
258 |
|
|
|
259 |
initialize
|
|
|
260 |
super initialize.
|
|
|
261 |
showRoot := true.
|
|
|
262 |
! !
|
|
|
263 |
|
|
458
|
264 |
!SelectionInTree methodsFor:'private'!
|
|
|
265 |
|
|
|
266 |
recomputeList
|
|
|
267 |
"Travers the tree and build a new list."
|
|
|
268 |
|
|
|
269 |
list := OrderedCollection new.
|
|
|
270 |
|
|
|
271 |
root notNil ifTrue:[
|
|
496
|
272 |
showRoot ifTrue:[
|
|
|
273 |
list add:root
|
|
|
274 |
].
|
|
458
|
275 |
root recomputeList:list
|
|
|
276 |
].
|
|
585
|
277 |
self changed:#list.
|
|
458
|
278 |
! !
|
|
|
279 |
|
|
|
280 |
!SelectionInTree methodsFor:'selection'!
|
|
|
281 |
|
|
|
282 |
selection
|
|
|
283 |
"get the selection or nil
|
|
|
284 |
"
|
|
|
285 |
^ self selectionIndex
|
|
|
286 |
!
|
|
|
287 |
|
|
|
288 |
selection:indexesOrNil
|
|
|
289 |
"set the selection
|
|
|
290 |
"
|
|
|
291 |
self selectionIndex:indexesOrNil
|
|
|
292 |
!
|
|
|
293 |
|
|
|
294 |
selectionIndex
|
|
|
295 |
"get the selection or nil
|
|
|
296 |
"
|
|
|
297 |
^ selection
|
|
|
298 |
!
|
|
|
299 |
|
|
|
300 |
selectionIndex:indexesOrNil
|
|
|
301 |
"set the selection
|
|
|
302 |
"
|
|
496
|
303 |
|oldSel|
|
|
|
304 |
|
|
|
305 |
oldSel := selection.
|
|
|
306 |
self setSelectionIndex:indexesOrNil.
|
|
|
307 |
|
|
|
308 |
oldSel = selection ifFalse:[
|
|
585
|
309 |
self changed:#selectionIndex
|
|
496
|
310 |
]
|
|
|
311 |
!
|
|
|
312 |
|
|
|
313 |
setSelection:indexesOrNil
|
|
|
314 |
"set the selection without raising a notification
|
|
|
315 |
"
|
|
|
316 |
self setSelectionIndex:indexesOrNil
|
|
|
317 |
!
|
|
|
318 |
|
|
|
319 |
setSelectionIndex:indexesOrNil
|
|
|
320 |
"set the selection without raising a notification
|
|
|
321 |
"
|
|
458
|
322 |
|indexes|
|
|
|
323 |
|
|
|
324 |
indexes := indexesOrNil.
|
|
|
325 |
|
|
|
326 |
indexes size == 0 ifTrue:[
|
|
|
327 |
(indexes isCollection or:[indexes == 0]) ifTrue:[
|
|
|
328 |
indexes := nil
|
|
|
329 |
]
|
|
|
330 |
].
|
|
496
|
331 |
selection := indexes
|
|
458
|
332 |
|
|
|
333 |
! !
|
|
|
334 |
|
|
|
335 |
!SelectionInTree class methodsFor:'documentation'!
|
|
|
336 |
|
|
|
337 |
version
|
|
758
|
338 |
^ '$Header: /cvs/stx/stx/libwidg2/SelectionInTree.st,v 1.8 1998-02-13 13:56:35 ca Exp $'
|
|
458
|
339 |
! !
|