Difference between revisions of "Template:Data structures"

From blackwiki
Jump to navigation Jump to search
imported>Andreas Kaufmann
(Trie)
(flatlist)
Line 4: Line 4:
  
 
|group1  = Types
 
|group1  = Types
|list1  = [[Collection (computing)|Collection]]{{·}} [[Container (data structure)|Container]]
+
|list1  = {{flatlist|
 +
*[[Collection (computing)|Collection]]
 +
*[[Container (data structure)|Container]]
 +
}}
  
 
|group2  = [[Abstract data type|Abstract]]
 
|group2  = [[Abstract data type|Abstract]]
|list2  = [[List (computing)|List]]{{·}} [[Associative array]]{{·}} [[Multimap]]{{·}} [[Set (computer science)|Set]]{{·}} [[Set (computer science)#Multiset|Multiset]]{{·}} [[Double-ended queue]]{{·}} [[Queue (data structure)|Queue]]{{·}} [[Priority queue]]{{·}} [[Stack (data structure)|Stack]]
+
|list2  = {{flatlist|
 +
*[[List (computing)|List]]
 +
*[[Associative array]]
 +
*[[Multimap]]
 +
*[[Set (computer science)|Set]]
 +
*[[Set (computer science)#Multiset|Multiset]]
 +
*[[Double-ended queue]]
 +
*[[Queue (data structure)|Queue]]
 +
*[[Priority queue]]
 +
*[[Stack (data structure)|Stack]]
 +
}}
  
 
|group3  = [[Array data structure|Array]]s
 
|group3  = [[Array data structure|Array]]s
|list3  = [[Dynamic array]]{{·}} [[Sparse array]] {{·}} [[Circular buffer]] {{·}} [[Bit array]] {{·}} [[Hash table]]
+
|list3  = {{flatlist|
 +
*[[Dynamic array]]
 +
*[[Sparse array]]
 +
*[[Circular buffer]]
 +
*[[Bit array]]
 +
*[[Hash table]]
 +
}}
  
 
|group4  = [[Linked data structure|Linked]]
 
|group4  = [[Linked data structure|Linked]]
|list4  = [[Linked list]] {{·}} [[Unrolled linked list]] {{·}} [[XOR linked list]] {{·}}[[Skip list]]
+
|list4  = {{flatlist|
 +
*[[Linked list]]
 +
*[[Unrolled linked list]]
 +
*[[XOR linked list]]
 +
*[[Skip list]]
 +
}}
  
 
|group5  = [[Tree (data structure)|Trees]]
 
|group5  = [[Tree (data structure)|Trees]]
|list5  = [[B-tree]]{{·}} [[Binary search tree]] ([[Self-balancing binary search tree|self-balancing]]: [[AA tree|AA]], [[AVL tree|AVL]], [[Red-black tree|red-black]], [[Splay tree|splay]]){{·}} [[Heap (data structure)|Heap]] ([[Binary heap|binary]], [[Binomial heap|binomial]], [[Fibonacci heap|Fibonacci]]) {{·}} [[Trie]]
+
|list5  = {{flatlist|
 +
*[[B-tree]]
 +
*[[Binary search tree]] ([[Self-balancing binary search tree|self-balancing]]: [[AA tree|AA]], [[AVL tree|AVL]], [[Red-black tree|red-black]], [[Splay tree|splay]])
 +
*[[Heap (data structure)|Heap]] ([[Binary heap|binary]], [[Binomial heap|binomial]], [[Fibonacci heap|Fibonacci]])
 +
*[[Trie]]
 +
}}
  
 
|group6  = [[Graph (data structure)|Graphs]]
 
|group6  = [[Graph (data structure)|Graphs]]
|list6  = [[Directed graph]]{{·}} [[Directed acyclic graph]]{{·}}[[Binary decision diagram]] {{·}} [[Hypergraph]]
+
|list6  = {{flatlist|
 +
*[[Directed graph]]
 +
*[[Directed acyclic graph]]
 +
*[[Binary decision diagram]]
 +
*[[Hypergraph]]
 +
}}
  
 
|below  = [[List of data structures]]
 
|below  = [[List of data structures]]

Revision as of 22:34, 25 October 2011