ttlcache
An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache] (by ReneKroon)
gods
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more (by emirpasic)
| ttlcache | gods | |
|---|---|---|
| 2 | 9 | |
| 388 | 15,454 | |
| - | - | |
| 6.4 | 2.8 | |
| about 2 years ago | 20 days ago | |
| Go | Go | |
| MIT License | GNU General Public License v3.0 or later |
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.
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.
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.
-
Easy and Simple in-memory cache in Golang
And the library that will be used to cache our application data is ttlcache, because it is easy to use and has an immensely intuitive API.
-
Lazy cache with an interface as a key
My favourite form of caching is one that expires auto-magically https://github.com/ReneKroon/ttlcache
gods
Posts with mentions or reviews of gods.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-01-05.
-
How do you go about the lack of built in data structure like stack, queue for LeetCode
for len(stack) > 0 { n := len(stack) - 1 // Top element fmt.Print(stack[n]) stack = stack[:n] // Pop } ``` Another solution would be to import a package like https://github.com/emirpasic/gods
-
Go Structures - Custom made generic data structures for Golang
What is the goal of this project? A learning exercise? There are many fairly matured solutions already available like https://github.com/emirpasic/gods. It also does not look implemented effectively. For example Stack uses for its push/pop operations costly List methods.
- Golang & Data Structures
-
Hash Array Mapped Trie (HAMT) implemented in Go (1.18+ generics)
Doesn't say why it's here instead of trying to get into GoDS or something else.
-
Are there implementations of data structures with generics? Are they needed?
I've found GoDS (https://github.com/emirpasic/gods) but it is not using generics, it's using "interface{}" as a type for everything.
- Gods Go Data Structures
- Experimental generic implementations of various data structures (map, b-tree, AVL tree, rope, and more)
-
Have you used a trie in Go?
You may want to try this implementation
What are some alternatives?
When comparing ttlcache and gods you can also consider the following projects:
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
levenshtein - Go implementation to calculate Levenshtein Distance.
gomarkdoc - Generate markdown documentation for Go (golang) code
count-min-log - Go implementation of Count-Min-Log
gota - Gota: DataFrames and data wrangling in Go (Golang)
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
bit - Bitset data structure
encoding - Integer Compression Libraries for Go