Class: TreeSet

• Inheritance
• Description
• Class protocol
  • as yet unclassified
• Instance protocol
  • initialize-release
  • plugs
  • private
  • public

Inheritance:

   Object
   |
   +--Collection
      |
      +--TreeSet

Package:

stx:libbasic2

Category:

Collections-Ordered

Version:

rev: ? date: ? ?

user: ?

file: ? directory: libbasic2

module: stx stc-classLibrary: libbasic2

Author:

Avi Bryant

Description:

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. 
I'm also going to be rolling some code in here from Benjamin Pollack specifically aimed at indexing 
by date ranges, which lets you do quick queries of all the events that overlap with a specific week, 
for instance. 


[license:]
    Dual licensed under both SqueakL and MIT. 
    This enables both base Squeak inclusion and 100% reuse.

Class protocol:

 keys: aBtreeKeys sortSelector: aSymbol

 new

 sortBy: aSymbol

Instance protocol:

 initializeWithKeys: aBtreeKeys sortSelector: aSymbol

 keyForValue: anObject

 value: anObject matches: otherObject

 bucket: anArray includes: anObject

 tree

 add: anObject

 do: aBlock

 includes: anObject

 intersection: aCollection

 remove: anObject

 sortSelector