Popularity
3.6
Growing
Activity
0.0
-
60
3
9
Programming language: Go
License: MIT License
Tags:
Data Structures
go-mcache alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view go-mcache alternatives based on common mentions on social networks and blogs.
-
gocache
A complete Go cache library with mutiple stores (memory, memcache, redis, ...), chainable, loadable, metrics cache and more. -
hyperloglog
HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction. -
Bloomfilter
Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go -
merkletree
Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures. -
hilbert
Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. -
gostl
Data structure and algorithm library for go, designed to provide functions similar to C++ STL. -
go-adaptive-radix-tree
A Go implementation of Adaptive Radix Tree. -
remember-go
A universal interface for caching slow database queries (backed by redis, memcached, ristretto, or in-memory). -
count-min-log
A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory). -
nan
Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers.
Get performance insights in less than 4 minutes
Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.
Sponsored
scoutapm.com
Do you think we are missing an alternative of go-mcache or a related project?
Popular Comparisons
-
go-mcachevsgota
-
go-mcachevsmerkletree
-
go-mcachevsgostl
-
godsvsgo-datastructures
-
golang-setvsgods
|
SaaSHub - Software Alternatives and Reviews
Sponsored
www.saashub.com
|
README
MCache library
go-mcache - this is a fast key:value storage. Its major advantage is that, being essentially a thread-safe .
map[string]interface{}
with expiration times, it doesn't need to serialize, and quick removal of expired keys.
Installation
~ $ go get -u github.com/OrlovEvgeny/go-mcache
Example a Pointer value (vary fast method)
type User struct {
Name string
Age uint
Bio string
}
func main() {
//Start mcache instance
MCache = mcache.New()
//Create custom key
key := "custom_key1"
//Create example struct
user := &User{
Name: "John",
Age: 20,
Bio: "gopher 80 lvl",
}
//args - key, &value, ttl (or you need never delete, set ttl is mcache.TTL_FOREVER)
err := MCache.Set(key, user, time.Minute*20)
if err != nil {
log.Fatal(err)
}
if data, ok := MCache.Get(key); ok {
objUser:= data.(*User)
fmt.Printf("User name: %s, Age: %d, Bio: %s\n", objUser.Name, objUser.Age, objUser.Bio)
}
}
Performance Benchmarks
goos: darwin
goarch: amd64
BenchmarkWrite-4 200000 7991 ns/op
BenchmarkRead-4 1000000 1716 ns/op
BenchmarkRW-4 300000 9894 ns/op
What should be done
- [x] the possibility of closing
- [x] r/w benchmark statistics
- [ ] rejection of channels in safeMap in favor of sync.Mutex (there is an opinion that it will be faster)
License:
[MIT](LICENSE)
*Note that all licence references and agreements mentioned in the go-mcache README section above
are relevant to that project's source code only.