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


btreeNext

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

This function returns the 'next' key in the given tree tree if possible, else both return values will be nil.

Again, note that the 'next' ordering is relative to an arbitrary hash, not relative to any interesting ordering.


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