3250
|
1 |
"{ Package: 'stx:libbasic2' }"
|
|
2 |
|
3667
|
3 |
"{ NameSpace: Smalltalk }"
|
|
4 |
|
3250
|
5 |
TSTree subclass:#TSMultiTree
|
|
6 |
instanceVariableNames:''
|
|
7 |
classVariableNames:''
|
|
8 |
poolDictionaries:''
|
|
9 |
category:'Collections-Ordered-Trees'
|
|
10 |
!
|
|
11 |
|
|
12 |
!TSMultiTree class methodsFor:'documentation'!
|
|
13 |
|
|
14 |
documentation
|
|
15 |
"
|
3667
|
16 |
A bunch of collection classes that are useful for building large indices of things.
|
|
17 |
It's especially geared towards people using OODBs like GOODS, but can be used it in the image too:
|
|
18 |
the BTree class is great for when you need to select numeric keys by range,
|
|
19 |
and TSTree makes a solid basis for full-text search.
|
|
20 |
TreeSet has an interesting optimized #intersection: that lets you compare two collections without
|
|
21 |
looking at every item of either.
|
|
22 |
|
3250
|
23 |
TSMultiTree is pretty much like TSTree but it can store multiple
|
|
24 |
(different) values per key. Uses equality compare (=) to search for
|
|
25 |
the occurrence.
|
|
26 |
|
|
27 |
[author:]
|
|
28 |
Jan Vrany <jan.vrany@fit.cvut.cz>
|
|
29 |
|
|
30 |
[instance variables:]
|
|
31 |
|
|
32 |
[class variables:]
|
|
33 |
|
|
34 |
[see also:]
|
|
35 |
|
|
36 |
"
|
|
37 |
! !
|
|
38 |
|
3811
|
39 |
!TSMultiTree class methodsFor:'queries'!
|
3250
|
40 |
|
3811
|
41 |
treeNodeClass
|
|
42 |
^ TSMultiTreeNode
|
3250
|
43 |
! !
|
|
44 |
|
|
45 |
!TSMultiTree class methodsFor:'documentation'!
|
|
46 |
|
|
47 |
version
|
3667
|
48 |
^ '$Header$'
|
3250
|
49 |
!
|
|
50 |
|
|
51 |
version_CVS
|
3667
|
52 |
^ '$Header$'
|
3250
|
53 |
! !
|
|
54 |
|