Index 1.6 Billion Keys with Automata and Rust

It turns out that finite state machines are useful for things other than
expressing computation. Finite state machines can also be used to compactly
represent ordered sets or maps of strings that can be searched very quickly. Read more

Similar

This Week in Rust 196

Hello and welcome to another issue of This Week in Rust! Rust is a systems language pursuing the trifecta: safety, concurrency, and speed. This is a weekly summary of its progress and community. Want something mentioned? Tweet us at @ThisWeekInRust or sen... (more…)

Read more »

Rust Container Cheet Sheet

into_boxed_slice ptr T Legend 4/8 bytes Box<T> Vec<T> len cap ptr cap len ptr 4/8 bytes T T T Rc<T> ptr strong weak T Box<[T]> len ptr len T T T Box<Trait> T vtable size Arc<T> ptr strong weak T 4/8 bytes atomic allocat... (more…)

Read more »

24 days of Rust – nom, part 1

It's entirely possible that you're walking a happy road of a programmer who never had to write a parser by hand. That's not my case unfortunately. I remember incomprehensible indexing of hideous arrays of characters, a maddening cascade of unmaintainable ...

Read more »