Skip to content

GoMapLLRB is a Go package that implements an in-memory key/value store using LLRB(Left-Leaning Red-Black) algorithm.

License

Notifications You must be signed in to change notification settings

wolkykim/GoMapLLRB

Repository files navigation

GoMapLLRB [Left-leaning red-black tree in Go]

CI Status Code Coverage Go Report Card API Reference

GoMapLLRB is a Go package that implements an in-memory key/value store using LLRB algorithm. LLRB(Left-Leaning Red-Black) is a self-balancing binary search tree that keeps the keys in order, allowing ordered iteration and finding the nearest keys.

This is a GoLang version of the C implementation in qLibc library.

GoMapLLRB vs Built-in map

GoMapLLRB Built-in map
Data structure Binary Tree Hash Table
Iteration Order Ordered Random
Find nearest key Yes No
Performance O(log n) O(1)
Memory overhead O(n) O(n)

Usages API Reference

Simple Example

import "github.com/wolkykim/gomapllrb"

t := gomapllrb.New[string]()
t.Put("foo", "Hello World")
fmt.Println(t.Get("foo"))
t.Delete("foo")

[Output]
Hello World

[Play the code]

Other getter methods: Exist(), Min(), Max(), Bigger(), Smaller(), EqualOrBigger(), EqualOrSmaller(), ... See API documents for details.

Iteration

t := New[int]()
for _, k := range []int{7, 1, 3, 9, 5} {
    t.Put(k, k*10)
}

for it := t.Iter(); it.Next(); {
    fmt.Printf("%d=%d ", it.Key(), it.Val())
}

for it := t.Range(3, 8); it.Next(); {
    fmt.Printf("%d:%d ", it.Key(), it.Val())
}

[Output]
1=10 3=30 5=50 7=70 9=90 3:30 5:50 7:70

[Play the code]

Students on DSA course

fmt.Println(t, t.Stats())

[Output]
    ┌──[9]
┌───7
│   └──[5]
3
└───1
 Variant:LLRB234, Put:5, Delete:0, Get:0, Rotate:0.80, Flip:0.20

[Play the code]

Performance 2-3-4 LLRB Vs. 2-3 LLRB

For anyone curious, here's the performance test result between 2-3-4 LLRB and 2-3 LLRB. Tested on 2021 Apple M1 Pro 10-core MacBook. GoMapLLRB supports 2-3-4 and 2-3 LLRB and ships by default to balance the tree structure in the 2-3-4 variant.

2-3-4 LLRB 2-3 LLRB 2-3-4 LLRB 2-3 LLRB 2-3-4 LLRB 2-3 LLRB
Workload 1 million 1 million 3 million 3 million 10 million 10 million
Insert 602ms 654ms 2838ms 3185ms 13065ms 13412ms
Lookup 376ms 391ms 1860ms 1869ms 9480ms 10647ms
Delete 693ms 702ms 3201ms 3166ms 14199ms 15594ms
Rotations(Ins) 1.08 1.19 1.08 1.19 1.08 1.19
Rotations(Del) 16.46 19.45 17.43 21.77 18.64 23.53
Flips(Ins) 0.57 0.75 0.57 0.75 0.57 0.75
Flips(Del) 3.31 15.33 3.44 17.42 3.58 18.45

Copyright

GoMapLLRG is published under 2-clause BSD license known as Simplified BSD License. Please refer the LICENSE document included in the package for more details.

Wanna thank me? Give it a star to this project if it helps. That'll do it! https://github.com/wolkykim/GoMapLLRB

About

GoMapLLRB is a Go package that implements an in-memory key/value store using LLRB(Left-Leaning Red-Black) algorithm.

Resources

License

Stars

Watchers

Forks

Packages

No packages published