file: job.t package: muf status: alpha
The makeSortedBtree function constructs and
returns a new nullSortedBtree instance. This is
an immediate value (it takes no space beyond the
return slot itself).
All the other btree functions operate equally well on hashed or sorted btrees.
Sorted trees are preferred if you need to be able to iterate over the keys in a sensible order, or if your keys are small immediate values such as integers of 62 bits or less.
Hashed trees are preferred if you want efficient lookup on keys which are expensive to compare, such as long strings.
See section makeHashedBtree.
Go to the first, previous, next, last section, table of contents.