Search results
Jump to navigation
Jump to search
- ...h>\mathcal{V}</math>. An object of an implementation of this abstract data structure is repesented by: # This abstract data structure may be viewed as a specific, quite restricted type of [[Sets and sequences#2 KB (283 words) - 11:02, 7 November 2014
- [[Category:Abstract Data Structure]] # The abstract data structure '''sorted sequence''' implements sorted sequences as defined [[Sets and seq2 KB (270 words) - 13:06, 21 May 2015
- [[Category:Abstract Data Structure]] # The abstract data structure '''ordered sequence''' implements sorted sequences as defined [[Sets and se2 KB (252 words) - 12:52, 21 May 2015
- ...e types is deferred until the algorithm is called or an object of the data structure is created.2 KB (290 words) - 12:45, 21 May 2015
- [[Category:Abstract Data Structure]] # The abstract data structure '''priority queue''' implements [[Sets and sequences#Ordered and sorted seq3 KB (418 words) - 15:33, 4 October 2014
- [[Category:Data Structures]] ''' Abstract data structure:'''2 KB (353 words) - 06:14, 6 July 2015
- '''Abstract data structure:''' [[Index handler]]975 bytes (162 words) - 11:03, 7 November 2014
- [[Category:Abstract Data Structure]] # This abstract data structure is [[Genericity|generic]] and parameterized by a fixed '''key type''' <math3 KB (511 words) - 06:43, 19 October 2015
- [[Category:Abstract Data Structure]]1 KB (151 words) - 14:33, 17 October 2014
- [[Category:Data Structure]] '''Abstract data structure:''' [[Sorted sequence]]3 KB (541 words) - 13:49, 26 May 2015
- [[Category:Data Structures]] '''Abstract data structure:''' [[Bounded monotonous priority queue]].2 KB (304 words) - 09:57, 26 February 2015
- '''Abstract Data Structure:''' [[Ordered sequence]]1 KB (227 words) - 09:59, 21 September 2015
- [[Category: Method of an implementation of a data structure]] '''Auxiliary data:'''2 KB (369 words) - 23:12, 19 June 2015
- [[Category:Method of an implementation of a data structure]] '''Auxiliary data:'''3 KB (438 words) - 23:13, 19 June 2015
- [[Category:Data Structures]] '''Abstract Data Structure:''' [[Bounded priority queue]]3 KB (462 words) - 23:12, 19 June 2015
- [[Category: Method of an implementation of a data structure]] '''Auxiliary data:'''3 KB (477 words) - 23:13, 19 June 2015
- [[Category:Method of an implementation of a data structure]] ''' Auxiliary data:'''3 KB (584 words) - 23:12, 19 June 2015
- '''Auxiliary data:''' Pointers <math>p</math> and <math>p'</math> of type "pointer to a B-tre ...to verify that the [[B-Trees|implementation invariants of the B-tree data structure]] and the above-mentioned loop invariants of the insert procedure are fulfi7 KB (1,135 words) - 13:47, 3 March 2017
- [[Category:Method of an implementation of a data structure]] '''Auxiliary data:''' A natural number <math>\ell</math> denoting a position within the heap.4 KB (635 words) - 23:12, 19 June 2015
- '''Abstract Data Structure:''' [[Union-find]]3 KB (419 words) - 14:27, 20 June 2015
- '''Auxiliary data:''' ...to verify that the [[B-Trees|implementation invariants of the B-tree data structure]] and the above-mentioned loop invariants of the removal procedure are fulf10 KB (1,690 words) - 13:58, 3 March 2017
- '''Auxiliary data:''' #A [[union-find]] data structure <math>U F</math> on <math>V</math>.5 KB (812 words) - 18:31, 20 September 2015
- ...to its node or, alternatively, all lists are organized in a separate data structure, for example, an array or a [[Sets and sequences#Maps|map]] such that the l15 KB (2,712 words) - 14:47, 16 May 2015