Basic data structures and operations written in Go which golang.org/pkg/container don't support such as stack, queue, etc.
list |
done |
trie |
๐ |
bitmap |
๐ |
bloom filter |
๐ |
lru |
๐ |
heap |
๐ |
stack |
๐ |
queue |
๐ |
dfs |
๐ |
bfs |
๐ |
union and find |
๐ |
skiplist |
โ |
b |
โ |
graph |
โ |
dancing Links |
โ |
segment tree |
โ |
huffman tree |
โ |
package main
import(
"github.com/googege/godata"
)
func main(){
// stack
stack := godata.NewStack(5)
stack.Push(1)
stack.Length()
stack.Top()
stack.Pop()
// trie
trie := NewTrie()
trie.Insert("hello world")
trie.Insert("hello China")
trie.Insert("hello My dear")
trie.Search("hello world")
trie.StartWith("he")
trie.Image("he")
}