Hacker GitHub

← All repos

indexmap-rs/indexmap

View on GitHub ↗ ★ 2,456 Rust

A hash table with consistent order and fast iteration; access items by key or sequence index

5 mentions on Hacker News by 4 people: 0 stories, 5 comments · first 2017-02-27 · latest 2017-09-01

Mentions per year 5 mentions · busiest year 2017 (5)
20082026
AllStoriesComments NewestTopOldest
  1. Good Map implemented on top of Vec: https://github.com/bluss/ordermap
    comment by __s · 2017-09-01 · in Announcing Rust 1.20
  2. https://github.com/bluss/ordermap is 100% safe rust and pretty fast I believe the stdlib one could be refactored, but I'm not sure. There are a lot of optimizations in that one. IMO "no unsafe code" is a stretch. "no unnecessary unsafe…
    comment by Manishearth · 2017-05-05 · in The Rust Libs Blitz
  3. …not prescriptive: > Experimental hash table implementation in just Rust (stable, no unsafe code). https://github.com/bluss/ordermap
    comment by burntsushi · 2017-02-27 · in New Rust hash table leads Benchmarks Game
  4. …program which reached the top of k-n does not use the standard library's hashmap, it uses ordermap: https://github.com/bluss/ordermap Though that's also an open addressed map.
    comment by masklinn · 2017-02-27 · in New Rust hash table leads Benchmarks Game
  5. No. The Rust program uses https://github.com/bluss/ordermap which is an implementation/variant[0] of Hettinger's naturally ordered hash map.
    comment by masklinn · 2017-02-27 · in New Rust hash table leads Benchmarks Game