When you do something like
Stack: makeHash --> myHash Stack: 12.3 --> myHash["mass"] Stack: 44.3 --> myHash["weight"]
Muq stores the properties on myIndex in a btree, a
standard computer data structure capable of handling anything
from a handful of values to millions of values with reasonable
efficiency.
The following functions provide low-level access to the in-server functions which build and access these btrees.
Most users will never have any reason to use them directly: The standard
high-level interface via objects is sufficient. Such users have no
reason to read this section: Just use makeHash to create an
object with key-val pairs stored in a hashed btree (accessible via
obj[key]) or makeIndex to create an object with
key-val pairs stored in a sorted btree (again accessible via
obj[key]).
See section makeHash. See section makeIndex.
Occasionally, however, it may prove useful to use disembodied btrees without associated parent objects, or to build similar btree functionality into other classes of objects: The following functions provide the low-level access to the in-server btree functionality needed in such cases.
Go to the first, previous, next, last section, table of contents.