https://github.com/j-hui/order-maintenance

Totally-ordered priorities in Rust.
https://github.com/j-hui/order-maintenance

Last synced: about 1 month ago
JSON representation

Totally-ordered priorities in Rust.

• Host: GitHub
• URL: https://github.com/j-hui/order-maintenance
• Owner: j-hui
• License: mit
• Created: 2023-09-15T03:02:14.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2023-12-15T14:31:08.000Z (about 1 year ago)
• Last Synced: 2024-10-31T12:08:17.921Z (about 2 months ago)
• Language: Rust
• Size: 70.3 KB
• Stars: 2
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Order Maintenance

[![Continuous integration](https://github.com/j-hui/order-maintenance/actions/workflows/ci.yaml/badge.svg)](https://github.com/j-hui/order-maintenance/actions/workflows/ci.yaml)

**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](src/tag_range.rs) algorithm

-   Dietz & Sleator (1987)'s [list-range relabeling](src/list_range.rs) algorithm

-   Naive rational number priorities with [`usize` numerators](src/naive.rs) (limited insertion depth, prone to panicking)

-   Naive rational number priorities with [`BigUint` numerators](src/big.rs) (extremely inefficient for non-fork-join patterns)