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.

gods

9.8 8.6 go-mcache VS gods

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

9.5 0.0 go-mcache VS go-datastructures

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

Build time-series-based applications quickly and at scale.

InfluxDB is the Time Series Data Platform where developers build real-time applications for analytics, IoT and cloud-native services in less time with less code.

Promo www.influxdata.com

golang-set

8.7 6.4 go-mcache VS golang-set

A simple generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
gota

8.6 0.0 go-mcache VS gota

Gota: DataFrames and data wrangling in Go (Golang)
FSM for Go

8.4 4.2 go-mcache VS FSM for Go

Finite State Machine for Go
roaring

8.2 5.8 go-mcache VS roaring

Roaring bitmaps in Go (golang)
willf/bloom

8.2 7.0 go-mcache VS willf/bloom

Go package implementing Bloom filters
gocache

8.0 7.6 go-mcache VS gocache

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

7.9 0.0 go-mcache VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.6 4.9 go-mcache VS bitset

Go package implementing bitsets
cuckoofilter

7.4 1.4 go-mcache VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
hyperloglog

7.2 0.6 go-mcache VS hyperloglog

HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction)
gostl

7.2 1.9 go-mcache VS gostl

Data structure and algorithm library for go, designed to provide functions similar to C++ STL
trie

7.1 0.0 go-mcache VS trie

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

7.1 0.0 go-mcache VS algorithms

CLRS study. Codes are written with golang.
go-geoindex

6.6 0.0 go-mcache VS go-geoindex

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

6.6 0.0 go-mcache VS merkletree

A Merkle Tree implementation written in Go.
ttlcache

6.5 6.4 go-mcache VS ttlcache

An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
conjungo

6.2 0.0 go-mcache VS conjungo

A small flexible merge library in go
mafsa

6.0 0.0 go-mcache VS mafsa

MA-FSA implementation with Minimal Perfect Hashing
hilbert

6.0 0.0 go-mcache VS hilbert

Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
Bloomfilter

6.0 0.0 go-mcache VS Bloomfilter

Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go
goskiplist

6.0 0.0 go-mcache VS goskiplist

A skip list implementation in Go
go-adaptive-radix-tree

5.8 0.6 go-mcache VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
levenshtein

5.5 1.9 go-mcache VS levenshtein

Go implementation to calculate Levenshtein Distance.
cuckoo-filter

5.5 0.0 go-mcache VS cuckoo-filter

Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化
binpacker

5.5 0.0 go-mcache VS binpacker

A binary stream packer and unpacker
goconcurrentqueue

5.4 3.4 go-mcache VS goconcurrentqueue

Go concurrent-safe, goroutine-safe, thread-safe queue
bitmap

5.2 4.7 go-mcache VS bitmap

Simple dense bitmap index in Go with binary operators
iter

5.0 6.3 go-mcache VS iter

Go implementation of C++ STL iterators and algorithms.
bloom

5.0 0.0 go-mcache VS bloom

Bloom filters implemented in Go.
bit

4.9 0.0 go-mcache VS bit

Bitset data structure
encoding

4.8 0.0 go-mcache VS encoding

Integer Compression Libraries for Go
ring

4.6 0.0 go-mcache VS ring

Package ring provides a high performance and thread safe Go implementation of a bloom filter.
remember-go

4.5 0.0 go-mcache VS remember-go

Cache Slow Database Queries
skiplist

4.4 0.0 go-mcache VS skiplist

skiplist for golang
go-rquad

4.4 0.0 go-mcache VS go-rquad

:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go
deque

3.9 6.7 go-mcache VS deque

A highly optimized double-ended queue
set

3.8 0.0 go-mcache VS set

A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
crunch

3.7 3.5 go-mcache VS crunch

take bytes out of things easily ✨🍪
nan

3.5 3.7 go-mcache VS nan

Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers
goset

3.5 0.0 go-mcache VS goset

Set is a useful collection but there is no built-in implementation in Go lang.
memlog

3.4 5.2 go-mcache VS memlog

A Kafka log inspired in-memory and append-only data structure
count-min-log

3.3 0.0 go-mcache VS count-min-log

Go implementation of Count-Min-Log
hide

3.2 0.0 go-mcache VS hide

ID type with marshalling to/from hash to prevent sending IDs to clients.
ptrie

3.1 2.5 go-mcache VS ptrie

A prefix tree implementation in go
timedmap

3.1 0.0 go-mcache VS timedmap

A thread safe map which has expiring key-value pairs.
pipeline

3.0 0.0 go-mcache VS pipeline

Pipelines using goroutines
cmap

2.8 2.3 go-mcache VS cmap

a thread-safe concurrent map for go
go-tuple

2.6 5.0 go-mcache VS go-tuple

Go 1.18 generic tuples

Do you think we are missing an alternative of go-mcache or a related project?

Add another 'Data Structures' Package

Popular Comparisons

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)