memlog — alternative #1 to dqueue
An easy to use, lightweight, thread-safe and append-only in-memory data structure inspired by Apache Kafka.
Search tools, jump to categories, and open key destinations
Recorded alternatives
Every candidate below sits in Other. 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 easy to use, lightweight, thread-safe and append-only in-memory data structure inspired by Apache Kafka.
A Protocol-Oriented NotificationCenter which is type safe, thread safe and with memory safety.
Type-safe generic wrapper for sync.Map with full method parity and zero dependencies.
Customizable dependency injection container with the global mode, cascade initialization and panic-safe finalization.
A generic, thread-safe doubly linked list with full iterator support and an intrusive singly linked list for embedded use; a feature-rich re...
A minimalistic, thread safe, non-boilerplate and super easy to use version of Active Record on Core Data. Simply all you need for doing Core...
"Zerocopy makes zero-cost memory manipulation effortless. We write unsafe so you don’t have to."
Visualize dependency graphs as physical tower structures, inspired by XKCD #2347.
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 dqueue directly — Oryxen records pricing classes, not live quotes.