container/

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

Links

Open Source Insights

Directories ¶

Path	Synopsis
hashmap
hashring Package hashring provides a consistent hashing function.	Package hashring provides a consistent hashing function.
hashset
lru
set
slice A sequence of elements supporting sequential and parallel aggregate operations.	A sequence of elements supporting sequential and parallel aggregate operations.
stack stack is a [stack](http://en.wikipedia.org/wiki/Stack_(abstract_data_type%29) is a last-in last-out data structure.	stack is a [stack](http://en.wikipedia.org/wiki/Stack_(abstract_data_type%29) is a last-in last-out data structure.
stream A sequence of elements supporting sequential and parallel aggregate operations.	A sequence of elements supporting sequential and parallel aggregate operations.
op/find
op/match
op/reduce
op/terminal
op/while
traversal https://en.wikipedia.org/wiki/Breadth-first_search https://en.wikipedia.org/wiki/Depth-first_search https://en.wikipedia.org/wiki/Tree_traversal#In-order_(LNR) https://en.wikipedia.org/wiki/Tree_traversal#Out-order_(RNL) https://en.wikipedia.org/wiki/Tree_traversal#Post-order_(LRN) https://en.wikipedia.org/wiki/Tree_traversal#Post-order_(LRN)	https://en.wikipedia.org/wiki/Breadth-first_search https://en.wikipedia.org/wiki/Depth-first_search https://en.wikipedia.org/wiki/Tree_traversal#In-order_(LNR) https://en.wikipedia.org/wiki/Tree_traversal#Out-order_(RNL) https://en.wikipedia.org/wiki/Tree_traversal#Post-order_(LRN) https://en.wikipedia.org/wiki/Tree_traversal#Post-order_(LRN)
trie_tree
ternary_search_tree https://en.wikipedia.org/wiki/Ternary_search_tree In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two.	https://en.wikipedia.org/wiki/Ternary_search_tree In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two.

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL