Popularity

2.1

Stable

Activity

0.0

Stable

Stars 18

Watchers 2

Forks 5

Last Commit about 4 years ago

Programming language: Go

License: MIT License

Tags: Data Structures

go-ef alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view go-ef alternatives based on common mentions on social networks and blogs.

gods

9.7 0.0 go-ef VS gods

GoDS (Go Data Structures). Containers (Sets, Lists, Stacks, Maps, Trees), Sets (HashSet, TreeSet, LinkedHashSet), Lists (ArrayList, SinglyLinkedList, DoublyLinkedList), Stacks (LinkedListStack, ArrayStack), Maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), Trees (RedBlackTree, AVLTree, BTree, BinaryHeap), Comparators, Iterators, Enumerables, Sort, JSON
go-datastructures

9.5 3.9 go-ef VS go-datastructures

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

Scout APM: A developer's best friend. Try free for 14-days

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.

Promo scoutapm.com

golang-set

8.5 0.1 go-ef VS golang-set

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

8.4 5.8 go-ef VS gota

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

8.2 1.3 go-ef VS FSM for Go

Finite State Machine for Go
willf/bloom

8.0 5.5 go-ef VS willf/bloom

Go package implementing Bloom filters
roaring

7.9 7.6 go-ef VS roaring

Roaring bitmaps in Go (golang)
boomfilters

7.9 1.2 go-ef VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
gocache

7.6 7.2 go-ef VS gocache

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

7.4 3.0 go-ef VS bitset

Go package implementing bitsets
cuckoofilter

7.3 1.9 go-ef VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
hyperloglog

7.2 2.0 go-ef VS hyperloglog

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

7.1 0.0 go-ef VS algorithms

CLRS study. Codes are written with golang.
trie

7.0 0.0 go-ef VS trie

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

6.6 0.0 go-ef VS go-geoindex

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

6.3 0.3 go-ef VS gostl

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

6.2 0.0 go-ef VS conjungo

A small flexible merge library in go
ttlcache

6.1 6.8 go-ef VS ttlcache

An in-memory string-interface{} map with various expiration options for golang
merkletree

6.1 0.0 go-ef VS merkletree

A Merkle Tree implementation written in Go.
Bloomfilter

6.0 0.0 go-ef VS Bloomfilter

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

6.0 0.0 go-ef VS mafsa

MA-FSA implementation with Minimal Perfect Hashing
goskiplist

6.0 0.0 go-ef VS goskiplist

A skip list implementation in Go
hilbert

5.9 0.0 go-ef VS hilbert

Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
go-adaptive-radix-tree

5.5 0.1 go-ef VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
binpacker

5.5 1.1 go-ef VS binpacker

A binary stream packer and unpacker
levenshtein

5.0 3.0 go-ef VS levenshtein

Go implementation to calculate Levenshtein Distance.
cuckoo-filter

5.0 6.0 go-ef VS cuckoo-filter

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

5.0 0.0 go-ef VS bloom

Bloom filters implemented in Go.
iter

4.7 0.0 go-ef VS iter

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

4.7 0.0 go-ef VS goconcurrentqueue

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

4.6 0.0 go-ef VS encoding

Integer Compression Libraries for Go
bit

4.6 0.0 go-ef VS bit

Bitset data structure
ring

4.5 0.0 go-ef VS ring

Package ring provides a high performance and thread safe Go implementation of a bloom filter.
skiplist

4.4 0.0 go-ef VS skiplist

skiplist for golang
go-rquad

4.4 0.0 go-ef VS go-rquad

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

4.3 1.2 go-ef VS remember-go

Cache Slow Database Queries
bitmap

4.1 7.2 go-ef VS bitmap

Simple dense bitmap index in Go with binary operators
go-mcache

4.0 0.0 go-ef VS go-mcache

Fast in-memory key:value store/cache with TTL
set

3.7 0.0 go-ef VS set

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

3.4 3.3 go-ef VS crunch

take bytes out of things easily ✨🍪
goset

3.2 0.0 go-ef VS goset

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

3.1 2.7 go-ef VS nan

Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers
count-min-log

3.1 0.0 go-ef VS count-min-log

Go implementation of Count-Min-Log
hide

2.9 1.0 go-ef VS hide

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

2.7 0.0 go-ef VS ptrie

A prefix tree implementation in go
pipeline

2.6 0.0 go-ef VS pipeline

Pipelines using goroutines
timedmap

2.5 5.6 go-ef VS timedmap

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

2.5 0.0 go-ef VS deque

A highly optimized double-ended queue
null

2.1 1.0 go-ef VS null

Nullable Go types that can be marshalled/unmarshalled to/from JSON.
dict

2.0 0.3 go-ef VS dict

Python-like dictionaries for Go

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

Add another 'Data Structures' Package

Popular Comparisons

README

go-ef

A Go implementation of the Elias-Fano encoding

cover.run go

Example

package main
import (
    "fmt"
    "github.com/amallia/go-ef"
    "os"
)

func main() {
    array := []uint64{1,5,10}
    size := len(array)
    max := array[size-1]
    obj := ef.New(max, size)

    obj.Compress(array)

    v, err := obj.Next()
    if err != nil {
        fmt.Println(err)
        os.Exit(1)
    }
    fmt.Println(v) // 1

    obj.Next()
    fmt.Println(obj.Value()) // 5
}