Go to the first, previous, next, last section, table of contents.


btreeFirst

Function: btreeFirst { btree -> tOrNil key }
file: job.t
package: muf
status: alpha

This function returns 'first' key in btree if possible, else both return values will be nil.

Note that 'first' is relative to an arbitrary hashing order, not to any generally interesting sort order! If you want sorted results, you'll have to do that yourself.

See section |sort.


Go to the first, previous, next, last section, table of contents.