 Directories
      ¶
      Directories
      ¶
    
    | Path | Synopsis | 
|---|---|
| Package hashring provides a consistent hashing function. | Package hashring provides a consistent hashing function. | 
| A sequence of elements supporting sequential and parallel aggregate operations. | A sequence of elements supporting sequential and parallel aggregate operations. | 
| 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. | 
| A sequence of elements supporting sequential and parallel aggregate operations. | A sequence of elements supporting sequential and parallel aggregate operations. | 
| https://en.wikipedia.org/wiki/Breadth-first_search | https://en.wikipedia.org/wiki/Breadth-first_search | 
| 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. | 
 Click to show internal directories. 
   Click to hide internal directories.