|Represents criteria to be matched against tuples. More...|
A tuplestore is fixed in size and always fully populated so that every entry has a tuple. When first created it contains 2^64 empty tuples, which is why you don't need 2^64 * x bytes of storage to create a tuplestore -- it's a sparse array in which empty tuples needn't be physically stored.
In addition a tuplestore allocates IDs, on demand it will return IDs that have never been allocated before and never will again. This lets us add new data to a tuplestore without overwriting IDs that have already been used.
The class ZTS defines an API for reading and writing entries in a tuplestore. Generally though you'll use a Tuplebase or a Tuplesoup instance, depending on whether you want transactional database-like features, or the more UI-friendly soup access.