|
||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||
| Class Summary | |
| ActualArray | |
| ActualHashTable | The HashTable is an implementation class that is intended to provide the weakest Position->Object mapping. |
| ActualIntegerTable | The IntegerTable class is intended to provide an integer indexed table which is not constrained to be zero based. |
| COWIntegerTable | |
| HashTable | |
| ImmuTable | ImmuTable are to ScruTables much like ImmuSets are to ScruSets. |
| ImmuTableOnMu | |
| IntegerScruTable | |
| IntegerTable | The IntegerTable class is used for tables that have arbitrary XuInteger keys in their domain. |
| MuArray | The class XuArray is intended to model zero-based arrays with integer keys (indices). This makes them like the array primitive in C and C++. |
| MuTable | MuTable represents the base class for all side-effectable tables. |
| OberIntegerTable | |
| OffsetImmuTable | |
| OffsetScruArray | |
| OffsetScruTable | |
| Pair | Sometimes you just want to pass around two things where the language only makes it convenient to pass around one. |
| ScruTable | Please read class comment for ScruSet first. Like Sets, Tables represent collections of Heapers, and provide protocol for storing, retrieving, and iterating over the collection. |
|
||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||