Intervaltree with Rust Back End

https://github.com/Athe-kunal/intervaltree_rs

55•athekunal•3mo ago

Comments

athekunal•3mo 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•3mo ago

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

jeffparsons•3mo 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•3mo 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•3mo ago

I love that crate! Kudos

stefanka•3mo ago

Will you publish it as a crate too?

Epa095•3mo ago

What is the native intervaltree, is it [1] you mean? Do you also support the set operations? And can it be pickled safely?

1: https://pypi.org/project/intervaltree/

2Pacalypse-•3mo ago

Pretty cool to have this in Rust, might be useful if/when I decide to move some functionality from TS -> Rust.

In the meantime, I have this impelemented in TypeScript in case anyone else will find it useful: https://github.com/ShieldBattery/node-interval-tree

croemer•3mo ago

Did you intend this to be a comment on https://news.ycombinator.com/item?id=45821737 with the first line as a quote?

griffzhowl•3mo ago

The comment you're linking to is younger than the comment you're replying to.

Plus, the account of the one you're linking to only has that one comment in their comment history. So I think the shenanigans lie there

vswaroop04•3mo 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•3mo 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.

everybodyknows•3mo ago

It would be helpful to indicate in the README.md which variant of the data structure is used:

https://en.wikipedia.org/wiki/Interval_tree

Was going to share my work

Pitchfork: A devilishly good process manager for developers

You Are Here

Why social apps need to become proactive, not reactive

How patient are AI scrapers, anyway? – Random Thoughts

Vouch: A contributor trust management system

I built a terminal monitoring app and custom firmware for a clock with Claude

Tiny C Compiler

Y Combinator Founder Organizes 'March for Billionaires'

Ask HN: Need feedback on the idea I'm working on

OpenClaw Addresses Security Risks

Apple finalizes Gemini / Siri deal

Italy Railways Sabotaged

Emacs-tramp-RPC: high-performance TRAMP back end using MsgPack-RPC

Nintendo Wii Themed Portfolio

"There must be something like the opposite of suicide "

Ask HN: Why doesn't Netflix add a “Theater Mode” that recreates the worst parts?

Show HN: Engineering Perception with Combinatorial Memetics

Show HN: Steam Daily – A Wordle-like daily puzzle game for Steam fans

The Anthropic Hive Mind

Just Started Using AmpCode

LLM as an Engineer vs. a Founder?

Crosstalk inside cells helps pathogens evade drugs, study finds

Show HN: Design system generator (mood to CSS in <1 second)

Show HN: 26/02/26 – 5 songs in a day

Toroidal Logit Bias – Reduce LLM hallucinations 40% with no fine-tuning

Top AI models fail at >96% of tasks

The Science of the Perfect Second (2023)

Bob Beck (OpenBSD) on why vi should stay vi (2006)

Show HN: a glimpse into the future of eye tracking for multi-agent use