lru — alternative #1 to enum-map
An implementation of an LRU cache with O(1) put, get, get_mut, and pop operations.
Search tools, jump to categories, and open key destinations
Recorded alternatives
Every candidate below sits in Video. What ends up on this page is decided entirely by a recorded score — not by bidding, not by editor taste. Review both records, check current vendor terms, then decide.
An implementation of an LRU cache with O(1) put, get, get_mut, and pop operations.
[lru] - An implementation of an LRU cache with O(1) put, get, get_mut, and pop operations.
[undoredo] - Undo/Redo pattern implementation for arbitrary data structures. Supports delta-based (sparse diffs), snapshot-based, and comman...
Free up to 2000 translations, Unlimited translators, ten languages/project, 1000 translatable assets/project
[malevich] - Terminal plotting: line, scatter, bar, histogram, heatmap, box plot, violin and more, with automatic axes
Each candidate is a live catalogue record in the same primary category, picked by a deterministic score that Oryxen records in its catalogue: how many meaningful words the two listings share, whether their pricing classes oppose (a paid product against a free one), whether both are open source, and whether either record is featured. The same catalogue state always produces the same list — no randomness, no manual ranking.
No. Rows are ordered only by the recorded score, highest first, with alphabetical ties — payment never influences the order, nothing here is paid placement, and Oryxen charges no listing or placement fee.
Always verify current terms with enum-map directly — Oryxen records pricing classes, not live quotes.