README
¶
Algorithms and Data Structures
This is a repo of useful Algorithms and Data Structures in Go, with Generic support. Algorithms and data structures are grouped into package and each package has its own README.md and examples.
Data Structures
Algorithms
Contributions
Directories
¶
| Path | Synopsis |
|---|---|
|
generator
|
|
|
tree
tree package defines methods that generates tree of specified shape.
|
tree package defines methods that generates tree of specified shape. |
|
Package maglevhash implements Maglev Hash algorithm from the paper [Maglev: A Fast and Reliable Software Network Load Balancer](https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/44824.pdf) Maglev hash break down the key space to slots and assign slots to nodes.
|
Package maglevhash implements Maglev Hash algorithm from the paper [Maglev: A Fast and Reliable Software Network Load Balancer](https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/44824.pdf) Maglev hash break down the key space to slots and assign slots to nodes. |
|
Package priority_map implements a key-value store where key-value pairs can be accessed either by key or the order of values.
|
Package priority_map implements a key-value store where key-value pairs can be accessed either by key or the order of values. |
|
Package priority_queue implements Priority Queue with four methods 1.
|
Package priority_queue implements Priority Queue with four methods 1. |
|
Package rmq implements a range-minimum-query data structure that 1.
|
Package rmq implements a range-minimum-query data structure that 1. |
Click to show internal directories.
Click to hide internal directories.