Popularity
4.3
Growing
Activity
0.0
Stable
70
7
15
Programming language: Go
Tags:
Data Structures
skiplist alternatives and similar packages
Based on the "Data Structures" category
-
hyperloglog
HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction. -
gocache
A complete Go cache library with mutiple stores (memory, memcache, redis, ...), chainable, loadable, metrics cache and more. -
hilbert
Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. -
merkletree
Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures. -
Bloomfilter
Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go -
go-adaptive-radix-tree
A Go implementation of Adaptive Radix Tree. -
gostl
Data structure and algorithm library for go, designed to provide functions similar to C++ STL. -
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).
Do you think we are missing an alternative of skiplist or a related project?
Popular Comparisons
-
skiplistvsgo-geoindex
-
skiplistvstrie
-
skiplistvsgolang-set
-
skiplistvscount-min-log
-
skiplistvsgo-adaptive-radix-tree
|
SaaSHub - Software Alternatives and Reviews
View more from us
|
README
skiplist
reference from redis zskiplist
Usage
package main
import (
"fmt"
"github.com/gansidui/skiplist"
"log"
)
type User struct {
score float64
id string
}
func (u *User) Less(other interface{}) bool {
if u.score > other.(*User).score {
return true
}
if u.score == other.(*User).score && len(u.id) > len(other.(*User).id) {
return true
}
return false
}
func main() {
us := make([]*User, 7)
us[0] = &User{6.6, "hi"}
us[1] = &User{4.4, "hello"}
us[2] = &User{2.2, "world"}
us[3] = &User{3.3, "go"}
us[4] = &User{1.1, "skip"}
us[5] = &User{2.2, "list"}
us[6] = &User{3.3, "lang"}
// insert
sl := skiplist.New()
for i := 0; i < len(us); i++ {
sl.Insert(us[i])
}
// traverse
for e := sl.Front(); e != nil; e = e.Next() {
fmt.Println(e.Value.(*User).id, "-->", e.Value.(*User).score)
}
fmt.Println()
// rank
rank1 := sl.GetRank(&User{2.2, "list"})
rank2 := sl.GetRank(&User{6.6, "hi"})
if rank1 != 6 || rank2 != 1 {
log.Fatal()
}
if e := sl.GetElementByRank(2); e.Value.(*User).score != 4.4 || e.Value.(*User).id != "hello" {
log.Fatal()
}
}
/* output:
hi --> 6.6
hello --> 4.4
lang --> 3.3
go --> 3.3
world --> 2.2
list --> 2.2
skip --> 1.1
*/
License
MIT
*Note that all licence references and agreements mentioned in the skiplist README section above
are relevant to that project's source code only.