Difference between revisions of "Template:Data structures"
Jump to navigation
Jump to search
(add Map as synonym for Associative Array) |
imported>Redrose64 (fix v-t-e links) |
||
| (9 intermediate revisions by 6 users not shown) | |||
| Line 1: | Line 1: | ||
{{Navbox | {{Navbox | ||
| name = Data structures | | name = Data structures | ||
| − | | title = [[ | + | | title = Notable [[data structure]]s |
| state = {{{state|autocollapse}}} | | state = {{{state|autocollapse}}} | ||
| bodyclass = hlist | | bodyclass = hlist | ||
| Line 13: | Line 13: | ||
| list2 = | | list2 = | ||
*[[Associative array]] | *[[Associative array]] | ||
| − | * | + | **[[Multimap]] |
| − | *[[ | ||
*[[List (abstract data type)|List]] | *[[List (abstract data type)|List]] | ||
| − | *[[ | + | *[[Stack (abstract data type)|Stack]] |
| − | *[[ | + | *[[Queue (abstract data type)|Queue]] |
| + | **[[Double-ended queue]] | ||
*[[Priority queue]] | *[[Priority queue]] | ||
| − | *[[ | + | **[[Double-ended priority queue]] |
*[[Set (abstract data type)|Set]] | *[[Set (abstract data type)|Set]] | ||
| − | **[[Set (abstract data type)#Multiset| | + | **[[Set (abstract data type)#Multiset|Multiset]] |
| − | *[[Disjoint-set data structure|Disjoint | + | **[[Disjoint-set data structure|Disjoint-set]] |
| − | |||
| group3 = [[Array data structure|Array]]s | | group3 = [[Array data structure|Array]]s | ||
| Line 32: | Line 31: | ||
*[[Hash table]] | *[[Hash table]] | ||
*[[Hashed array tree]] | *[[Hashed array tree]] | ||
| − | *[[Sparse | + | *[[Sparse matrix]] |
| group4 = [[Linked data structure|Linked]] | | group4 = [[Linked data structure|Linked]] | ||
| Line 46: | Line 45: | ||
*[[B-tree]] | *[[B-tree]] | ||
*[[Binary search tree]] | *[[Binary search tree]] | ||
| − | **[[AA tree | + | **[[AA tree]] |
| − | **[[AVL tree | + | **[[AVL tree]] |
| − | **[[Red–black tree | + | **[[Red–black tree]] |
| − | **[[Self-balancing binary search tree| | + | **[[Self-balancing binary search tree|Self-balancing tree]] |
| − | **[[Splay tree | + | **[[Splay tree]] |
*[[Heap (data structure)|Heap]] | *[[Heap (data structure)|Heap]] | ||
| − | **[[Binary heap | + | **[[Binary heap]] |
| − | **[[Binomial heap | + | **[[Binomial heap]] |
| − | **[[Fibonacci heap | + | **[[Fibonacci heap]] |
*[[R-tree]] | *[[R-tree]] | ||
| − | **[[R* tree | + | **[[R* tree]] |
| − | **[[R+ tree | + | **[[R+ tree]] |
| − | **[[Hilbert R-tree | + | **[[Hilbert R-tree]] |
*[[Trie]] | *[[Trie]] | ||
**[[Hash tree (persistent data structure)|Hash tree]] | **[[Hash tree (persistent data structure)|Hash tree]] | ||
| Line 66: | Line 65: | ||
*[[Binary decision diagram]] | *[[Binary decision diagram]] | ||
*[[Directed acyclic graph]] | *[[Directed acyclic graph]] | ||
| − | *[[Directed acyclic word graph]] | + | *[[Deterministic acyclic finite state automaton|Directed acyclic word graph]] |
| below = | | below = | ||
*[[List of data structures]] | *[[List of data structures]] | ||
}}<noinclude> | }}<noinclude> | ||
| + | {{doc|content= | ||
{{collapsible option}} | {{collapsible option}} | ||
| + | |||
[[Category:Computer science navigational boxes]] | [[Category:Computer science navigational boxes]] | ||
| + | }} | ||
</noinclude> | </noinclude> | ||
Latest revision as of 20:39, 10 November 2020
50px Template documentation
Initial visibility: currently defaults to autocollapse
To set this template's initial visibility, the |state= parameter may be used:
|state=collapsed:{{Data structures|state=collapsed}}to show the template collapsed, i.e., hidden apart from its title bar|state=expanded:{{Data structures|state=expanded}}to show the template expanded, i.e., fully visible|state=autocollapse:{{Data structures|state=autocollapse}}
If the |state= parameter in the template on this page is not set, the template's initial visibility is taken from the |default= parameter in the Collapsible option template. For the template on this page, that currently evaluates to autocollapse.
| Editors can experiment in this template's sandbox (create | mirror) and testcases (create) pages. Subpages of this template. |