athekunal 3 days ago

I built a project that implemented intervaltree in Rust and exposed PyO3 bindings as a drop-in replacement for Python's native intervaltree. It is significantly faster, and I will be adding more features, such as AVL and red-black trees for balancing.

  • eru 4 hours ago

    If you want balanced trees, have a look at what Rust's standard library does with BTreeMap.

    • jeffparsons 4 hours ago

      And with a little work you can even use them to map ranges of keys to values in a way that's reminiscent of interval trees — e.g. https://crates.io/crates/rangemap. (Disclosure: that's my crate.)

      • eru 3 hours ago

        Nice! I was only suggesting considering BTrees because they also play nice with caches, instead of the more conventional binary tree balancing mechanisms.

      • airstrike an hour ago

        I love that crate! Kudos

  • stefanka 4 hours ago

    Will you publish it as a crate too?

vswaroop04 2 hours ago

Pretty nice to have this in Rust could come in handy if I decide to migrate some functionality from TypeScript to Rust later on.

jonstewart an hour ago

In C++ there’s the Boost Interval Container Library, which has an excellent API: https://www.boost.org/doc/libs/latest/libs/icl/doc/html/inde...

Unfortunately it’s implemented on top of std::set/std::map and I’ve had problems with heap blow up on large maps. This project looks like it uses 32 bit indices into a vector for backing store.