Difference between revisions of "Template:Data structures"
Jump to navigation
Jump to search
Template documentation
(Added red-black tree to trees.) |
imported>Redrose64 (fix v-t-e links) |
||
| (47 intermediate revisions by 30 users not shown) | |||
| Line 1: | Line 1: | ||
{{Navbox | {{Navbox | ||
| − | |name | + | | name = Data structures |
| − | |title | + | | title = Notable [[data structure]]s |
| + | | state = {{{state|autocollapse}}} | ||
| + | | bodyclass = hlist | ||
| − | |group1 | + | | group1 = Types |
| − | |list1 | + | | list1 = |
| + | *[[Collection (abstract data type)|Collection]] | ||
| + | *[[Container (abstract data type)|Container]] | ||
| − | |group2 | + | | group2 = [[Abstract data type|Abstract]] |
| − | |list2 | + | | list2 = |
| + | *[[Associative array]] | ||
| + | **[[Multimap]] | ||
| + | *[[List (abstract data type)|List]] | ||
| + | *[[Stack (abstract data type)|Stack]] | ||
| + | *[[Queue (abstract data type)|Queue]] | ||
| + | **[[Double-ended queue]] | ||
| + | *[[Priority queue]] | ||
| + | **[[Double-ended priority queue]] | ||
| + | *[[Set (abstract data type)|Set]] | ||
| + | **[[Set (abstract data type)#Multiset|Multiset]] | ||
| + | **[[Disjoint-set data structure|Disjoint-set]] | ||
| − | |group3 | + | | group3 = [[Array data structure|Array]]s |
| − | |list3 | + | | list3 = |
| + | *[[Bit array]] | ||
| + | *[[Circular buffer]] | ||
| + | *[[Dynamic array]] | ||
| + | *[[Hash table]] | ||
| + | *[[Hashed array tree]] | ||
| + | *[[Sparse matrix]] | ||
| − | |group4 | + | | group4 = [[Linked data structure|Linked]] |
| − | |list4 | + | | list4 = |
| + | *[[Association list]] | ||
| + | *[[Linked list]] | ||
| + | *[[Skip list]] | ||
| + | *[[Unrolled linked list]] | ||
| + | *[[XOR linked list]] | ||
| − | |group5 | + | | group5 = [[Tree (data structure)|Trees]] |
| − | |list5 | + | | list5 = |
| + | *[[B-tree]] | ||
| + | *[[Binary search tree]] | ||
| + | **[[AA tree]] | ||
| + | **[[AVL tree]] | ||
| + | **[[Red–black tree]] | ||
| + | **[[Self-balancing binary search tree|Self-balancing tree]] | ||
| + | **[[Splay tree]] | ||
| + | *[[Heap (data structure)|Heap]] | ||
| + | **[[Binary heap]] | ||
| + | **[[Binomial heap]] | ||
| + | **[[Fibonacci heap]] | ||
| + | *[[R-tree]] | ||
| + | **[[R* tree]] | ||
| + | **[[R+ tree]] | ||
| + | **[[Hilbert R-tree]] | ||
| + | *[[Trie]] | ||
| + | **[[Hash tree (persistent data structure)|Hash tree]] | ||
| − | |below | + | | group6 = [[Graph (abstract data type)|Graphs]] |
| + | | list6 = | ||
| + | *[[Binary decision diagram]] | ||
| + | *[[Directed acyclic graph]] | ||
| + | *[[Deterministic acyclic finite state automaton|Directed acyclic word graph]] | ||
| + | | below = | ||
| + | *[[List of data structures]] | ||
}}<noinclude> | }}<noinclude> | ||
| − | + | {{doc|content= | |
| + | {{collapsible option}} | ||
| − | [[ | + | [[Category:Computer science navigational boxes]] |
| − | + | }} | |
</noinclude> | </noinclude> | ||
Latest revision as of 20:39, 10 November 2020
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. |