README
¶
mds
This repository defines generic data structures in Go.
Data Structures
- heapq a heap-structured priority queue (package docs)
- mapset a basic map-based set implementation (package docs)
- mlink basic linked sequences (stack, queue, list, ring) (package docs)
- stree self-balancing binary-search tree (package docs)
Utilities
- slice helpful functions for manipulating slices (package docs)
Directories
¶
| Path | Synopsis |
|---|---|
|
Package heapq implements a generic heap-structured priority queue.
|
Package heapq implements a generic heap-structured priority queue. |
|
Package mapset implements a basic set type using a built-in map.
|
Package mapset implements a basic set type using a built-in map. |
|
Package mlink implements basic linked container data structures.
|
Package mlink implements basic linked container data structures. |
|
Package slice implements some useful functions for slices.
|
Package slice implements some useful functions for slices. |
|
Package stree implements the Scapegoat Tree, an approximately-balanced binary search tree.
|
Package stree implements the Scapegoat Tree, an approximately-balanced binary search tree. |
|
Package value defines comparisons and adapters for value types.
|
Package value defines comparisons and adapters for value types. |
Click to show internal directories.
Click to hide internal directories.