treap VS ttlcache

Compare treap vs ttlcache and see what are their differences.

treap

golang persistent immutable treap sorted sets (by perdata)

ttlcache

An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache] (by ReneKroon)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
treap ttlcache
- 2
26 388
- -
0.0 6.4
over 4 years ago about 2 years ago
Go Go
MIT License MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

treap

Posts with mentions or reviews of treap. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning treap yet.
Tracking mentions began in Dec 2020.

ttlcache

Posts with mentions or reviews of ttlcache. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-08-25.

What are some alternatives?

When comparing treap and ttlcache you can also consider the following projects:

trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.

gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches

go-geoindex - Go native library for fast point tracking and K-Nearest queries

golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.

fsm - Finite State Machine for Go

gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more

algorithms - CLRS study. Codes are written with golang.

levenshtein - Go implementation to calculate Levenshtein Distance.

go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.

count-min-log - Go implementation of Count-Min-Log

boomfilters - Probabilistic data structures for processing continuous, unbounded streams.