TSMultiTree.st
changeset 3667 f1a59ae2e064
parent 3250 e1ae9376992c
child 3811 b820b2fcda5e
--- a/TSMultiTree.st	Fri Dec 18 11:30:56 2015 +0100
+++ b/TSMultiTree.st	Fri Dec 18 11:31:03 2015 +0100
@@ -1,5 +1,7 @@
 "{ Package: 'stx:libbasic2' }"
 
+"{ NameSpace: Smalltalk }"
+
 TSTree subclass:#TSMultiTree
 	instanceVariableNames:''
 	classVariableNames:''
@@ -11,6 +13,13 @@
 
 documentation
 "
+    A bunch of collection classes that are useful for building large indices of things. 
+    It's especially geared towards people using OODBs like GOODS, but can be used it in the image too: 
+    the BTree class is great for when you need to select numeric keys by range, 
+    and TSTree makes a solid basis for full-text search. 
+    TreeSet has an interesting optimized #intersection: that lets you compare two collections without 
+    looking at every item of either. 
+
     TSMultiTree is pretty much like TSTree but it can store multiple
     (different) values per key. Uses equality compare (=) to search for 
     the occurrence.
@@ -41,10 +50,10 @@
 !TSMultiTree class methodsFor:'documentation'!
 
 version
-    ^ '$Header: /cvs/stx/stx/libbasic2/TSMultiTree.st,v 1.1 2014-04-26 11:13:06 vrany Exp $'
+    ^ '$Header$'
 !
 
 version_CVS
-    ^ '$Header: /cvs/stx/stx/libbasic2/TSMultiTree.st,v 1.1 2014-04-26 11:13:06 vrany Exp $'
+    ^ '$Header$'
 ! !