Next: DirectedMessage, Previous: DelayedAdaptor, Up: Base classes [Index]
I implement a dictionary, which is an object that is indexed by unique objects (typcially instances of Symbol), and associates another object with that index. I use the equality operator = to determine equality of indices.
In almost all places where you would use a plain Dictionary, a LookupTable would be more efficient; see LookupTable’s comment before you use it. I do have a couple of special features that are useful in certain special cases.
| • Dictionary class-instance creation: | (class) | |
| • Dictionary-accessing: | (instance) | |
| • Dictionary-awful ST-80 compatibility hacks: | (instance) | |
| • Dictionary-compilation: | (instance) | |
| • Dictionary-dictionary enumerating: | (instance) | |
| • Dictionary-dictionary removing: | (instance) | |
| • Dictionary-dictionary testing: | (instance) | |
| • Dictionary-namespace protocol: | (instance) | |
| • Dictionary-printing: | (instance) | |
| • Dictionary-rehashing: | (instance) | |
| • Dictionary-removing: | (instance) | |
| • Dictionary-storing: | (instance) | |
| • Dictionary-testing: | (instance) |