Order Maintenance

This crate is still under development and may contain nasty bugs! No stability is guaranteed as we still are focused on testing and benchmarking.

Totally-ordered priorities for the order maintenance problem.

Will support no_std environments out of the box, though it will require alloc to be available.

Available implementations:

• Bender et al. (2002)'s tag-range relabeling algorithm
• Dietz & Sleator (1987)'s list-range relabeling algorithm
• Naive rational number priorities with usize numerators (limited insertion depth, prone to panicking)
• Naive rational number priorities with BigUint numerators (extremely inefficient for non-fork-join patterns)