README
¶
mds
This repository defines generic data structures in Go.
Data Structures
Most of the types in this module share common behaviors:
- A
Clearmethod that discards all the contents of the container. - A
Peekmethod that returns an order statistic of the container. - An
Eachmethod that iterates the container in its natural order (usable as a range function). - An
IsEmptymethod that reports whether the container is empty. - A
Lenmethod that reports the number of elements in the container.
Packages
- heapq a heap-structured priority queue (package docs)
- mapset a basic map-based set implementation (package docs)
- mlink basic linked sequences (list, queue) (package docs)
- omap ordered key-value map (package docs)
- queue an array-based FIFO queue (package docs)
- ring a circular doubly-linked sequence (package docs)
- stack an array-based LIFO stack (package docs)
- stree self-balancing binary-search tree (package docs)
Utilities
- cache an in-memory key/value cache (package docs)
- distinct a probabilistic distinct-elements counter (CVM) (package docs)
- slice helpful functions for manipulating slices (package docs)
- mbits helpful functions for manipulating bits and bytes (package docs)
- mdiff supports creating textual diffs (package docs, example)
- mstr helpful functions for manipulating strings (package docs)
- mtest a support library for writing tests (package docs)
- shell POSIX shell quoting and splitting (package docs)
- value helpful functions for basic values and pointers (package docs)
Directories
¶
| Path | Synopsis |
|---|---|
|
Package cache implements a keyed cache for arbitrary values.
|
Package cache implements a keyed cache for arbitrary values. |
|
internal/cachetest
Package cachetest implements a test harness for cache implementations.
|
Package cachetest implements a test harness for cache implementations. |
|
Package compare contains support functions for comparison of values.
|
Package compare contains support functions for comparison of values. |
|
Package distinct implements the probabilistic distinct-elements counter algorithm of Chakraborty, Vinodchandran, and Meel as described in the paper "Distinct Elements in Streams" ([CVM]).
|
Package distinct implements the probabilistic distinct-elements counter algorithm of Chakraborty, Vinodchandran, and Meel as described in the paper "Distinct Elements in Streams" ([CVM]). |
|
Package heapq implements a generic heap-structured priority queue.
|
Package heapq implements a generic heap-structured priority queue. |
|
internal
|
|
|
mdtest
Package mdtest includes some internal utilities for testing.
|
Package mdtest includes some internal utilities for testing. |
|
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 mbits provides functions for manipulating bits and bytes.
|
Package mbits provides functions for manipulating bits and bytes. |
|
Package mdiff supports creating textual diffs.
|
Package mdiff supports creating textual diffs. |
|
Package mlink implements basic linked container data structures.
|
Package mlink implements basic linked container data structures. |
|
Package mstr defines utility functions for strings.
|
Package mstr defines utility functions for strings. |
|
Package mtest is a support library for writing tests.
|
Package mtest is a support library for writing tests. |
|
Package omap implements a map-like collection on ordered keys.
|
Package omap implements a map-like collection on ordered keys. |
|
Package queue implements an array-based FIFO queue.
|
Package queue implements an array-based FIFO queue. |
|
Package ring implements a doubly-linked circular chain of data items, called a "ring".
|
Package ring implements a doubly-linked circular chain of data items, called a "ring". |
|
Package shell supports splitting and joining of shell command strings.
|
Package shell supports splitting and joining of shell command strings. |
|
Package slice implements some useful functions for slices.
|
Package slice implements some useful functions for slices. |
|
Package stack implements an array-based LIFO stack.
|
Package stack implements an array-based LIFO stack. |
|
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 adapters for value types.
|
Package value defines adapters for value types. |
Click to show internal directories.
Click to hide internal directories.