[ianbutler]

I appreciate the concept, I had my own black triangle recently when I finished writing my own implementation of an adaptive radix tree that is highly concurrent and keeps hot paths in an LRU and loads everything else from disk.

Now when I circle back to my full text search extension for Postgres I can do so knowing I can replace my naive inverted index with something that gives like a 10% performance gain but more importantly significantly reduced and CONSTANT memory profile.

On it's own however, it doesn't seem to do much and unless you're in the space you won't appreciate why this is an interesting implementation.

[jacquesm]

I like such projects. They're the programming equivalent of making jewelry. Is your code public?

[ianbutler]

Thanks for your interest! It was definitely rewarding though I’m sure I can optimize a few things still.

The code is public: https://github.com/iantbutler01/dart

[jacquesm]

So, I had a look at it, very nice and tight code, relatively easy to follow even for someone who doesn't really know rust (I think I picked up more rust from your code than I did from any other source about rust).

I especially like the very clean and simple interface that abstracts away all of the complexity underneath.

Thank you for putting this out there, rust needs more projects like this, quiet and effective, showing rather than telling.

[ianbutler]

Thank you so much! :)

[jacquesm]

Neat, thank you. I will give it a read later tonight.