Search Oryxen

Search tools, jump to categories, and open key destinations

Recorded alternatives

Alternatives to cache2go

Every candidate below sits in Developer Tools. 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.

#1 Developer ToolsUnknown

imcache — alternative #1 to cache2go

A generic in-memory cache Go library. It supports expiration, sliding expiration, max entries limit, eviction callbacks and sharding.

GitHub source
#2 Developer ToolsUnknown

nutsdb — alternative #2 to cache2go

Nutsdb is a simple, fast, embeddable, persistent key/value store written in pure Go. It supports fully serializable transactions and many da...

GitHub source
#3 Developer ToolsUnknown

gocache — alternative #3 to cache2go

A complete Go cache library with multiple stores (memory, memcache, redis, ...), chainable, loadable, metrics cache and more.

GitHub source
#4 Developer ToolsUnknown

GOKe — alternative #4 to cache2go

Data-Oriented (DOD), archetype-based ECS engine utilizing an L1 cache-aligned chunked SoA layout for predictable, stepless memory growth and...

GitHub source
#5 Developer ToolsFree

John the Ripper — alternative #5 to cache2go

CLI | John the Ripper jumbo - advanced offline password cracker, which supports hundreds of hash and cipher types, and runs on many operatin...

GitHub source
#6 Developer ToolsUnknown

libmdbx-rs — alternative #6 to cache2go

[mdbx-sys] - Bindings for MDBX, a "fast, compact, powerful, embedded, transactional key-value database, with permissive license". This is a...

GitHub source
#7 Developer ToolsUnknown

mdbx-sys — alternative #7 to cache2go

Bindings for MDBX, a "fast, compact, powerful, embedded, transactional key-value database, with permissive license"....

Catalogue source
#8 Developer ToolsUnknown

pocache — alternative #8 to cache2go

Pocache is a minimal cache package which focuses on a preemptive optimistic caching strategy.

GitHub source

Questions about this page

How were these alternatives selected?

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.

Are these alternatives ranked by payment?

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 cache2go directly — Oryxen records pricing classes, not live quotes.