Search results
Jump to navigation
Jump to search
Page title matches
- Based solely on the access functions provided by the data structure interface one can roughly distinguish three main kinds: ...this is not possible because the actual representation of the data in the data structure has an important role in the problem to solve e.g. in [[parse tree|parse tr7 KB (1,246 words) - 17:24, 31 July 2008
- 12 bytes (1 word) - 08:18, 26 September 2007
- 118 bytes (16 words) - 17:55, 1 June 2008
- Auto-populated based on [[Special:WhatLinksHere/Data structure]]. Needs checking by a human.566 bytes (76 words) - 15:51, 11 January 2010
Page text matches
- in computer science, is an unordered, dictionary-like data structure that provides very efficient insertion, deletion or lookup of elements.176 bytes (22 words) - 04:54, 6 January 2010
- ...consistent [[data structure]]. Thus an algorithm is the recipe, while the data structure is the well-stored ingredients on which the recipe is designed to operate.2 KB (286 words) - 07:49, 10 February 2021
- {{r|Data structure}}296 bytes (36 words) - 08:57, 15 September 2009
- ''Main Articles:'' [[data structure]] and [[abstract data type]] ...may be redefined, they are the fundamentally mutability that allows for a data structure to change over time.5 KB (695 words) - 20:34, 21 January 2009
- A '''linked list''' is a simple [[data structure]] in which each [[object]] (or ''[[node]]'') contains a link (or reference)2 KB (422 words) - 16:03, 30 July 2009
- * [[Data_structure#Tree|Tree (data structure)]]: In design of computer software627 bytes (86 words) - 21:50, 29 September 2020
- {{r|Data structure}}222 bytes (25 words) - 12:25, 11 November 2009
- Based solely on the access functions provided by the data structure interface one can roughly distinguish three main kinds: ...this is not possible because the actual representation of the data in the data structure has an important role in the problem to solve e.g. in [[parse tree|parse tr7 KB (1,246 words) - 17:24, 31 July 2008
- {{r|Data structure}}522 bytes (70 words) - 18:06, 11 January 2010
- {{r|Data structure}}505 bytes (65 words) - 19:36, 11 January 2010
- {{r|Data structure}}559 bytes (73 words) - 17:06, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Data structure]]. Needs checking by a human.566 bytes (76 words) - 15:51, 11 January 2010
- Data structure options include:2 KB (313 words) - 07:07, 8 August 2009
- {{r|Data structure}}606 bytes (79 words) - 20:34, 11 January 2010
- will give the fastest access time of most any alternative data structure.1 KB (155 words) - 07:07, 8 August 2009
- ...t [[file]]. A [[hierarchical data structure|hierarchical]] or [[relational data structure]] may contain several data tables, and hence be regarded as comprising seve ...age, whether or not the program really stored the data table as a relevant data structure ([[array]], [[matrix]], [[vector]] of records, complex [[object]]...).10 KB (1,620 words) - 01:14, 7 June 2012
- Typically this occurs with referential [[data structure|data structures]] like [[linked list|linked lists]] if the elements are spr4 KB (634 words) - 04:17, 9 March 2010
- {{r|Data structure}}794 bytes (107 words) - 13:40, 29 April 2011
- {{r|Data structure}}2 KB (247 words) - 17:28, 11 January 2010
- * [[data structure|data structures]]3 KB (537 words) - 00:36, 9 February 2010
- ...developed important data structures such as the [[Fibonacci heap]] (a heap data structure consisting of a forest of trees), and the splay tree (a self-adjusting bina5 KB (696 words) - 22:43, 11 February 2010
- ...finding that a bit has changed in transmission or storage, corrupting the data structure containing it. In some cases, such as [[Voice over Internet Protocol]], it8 KB (1,253 words) - 03:23, 14 February 2010
- % to serialize a data structure.5 KB (786 words) - 07:07, 8 August 2009
- ...s its name from "List Processing", since one of its prominently featured [[data structure|data structures]] is the [[linked list]]. Lisp is still used, and sometime * [[Source code as a data structure]]9 KB (1,405 words) - 08:29, 2 March 2024
- *record - the standard erlang data structure6 KB (903 words) - 15:28, 24 August 2009
- ...[computer science]], a '''hash table''' is an unordered, dictionary-like [[data structure]] that provides very efficient insertion, deletion or lookup of elements.5 KB (832 words) - 13:00, 16 January 2008
- ...art-of-slot delay further increases the data transfer rate to the packed-4 data structure. In standard mode, the participant sends 1 word; 2 words in packed-2, and 314 KB (2,111 words) - 16:23, 30 March 2024
- A pattern matches if it has the same "shape" or "data structure" as the term being matched, and atoms encountered are the same. For example4 KB (551 words) - 09:35, 5 May 2024
- ...ndard procedure for the programmer. If you've ever wished you could pass a data structure to a procedure, and have it be tested for being empty from the inside, go a6 KB (958 words) - 22:25, 25 January 2011
- This is a data structure used to protect the data during traversal for modification of an array. With CopyOnWriteArraySet, any changes in the data structure during traversal result in a copy being made for the modification. However22 KB (3,300 words) - 20:57, 22 September 2010
- ...loader]], launches programs by creating a [[process]] (a set of special [[data structure|data structures]] by which an operating system tracks the running of a prog10 KB (1,573 words) - 11:37, 6 February 2024
- ...If the FIB is smaller than the RIB, and the FIB uses a hash table or other data structure that does not easily update, the existing FIB might be invalidated and repl9 KB (1,432 words) - 15:01, 20 March 2024
- {{Image|B TREE DIAGRAM.jpg|right|400px|B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, In a second type of data structure called a [[B-Tree (data structure)|B-tree]], data would be organized like a tree with branches, with records46 KB (7,002 words) - 07:32, 18 September 2010
- ...ver instances, can still be cheaper than in-house server farms because the data structure infrastructure is shared.57 KB (8,399 words) - 17:39, 13 March 2024
- ...SPaSM (and presumably in similar particle-based codes) by replacing the C data structure for atoms (consisting of properties such as particle type, position, veloci94 KB (13,588 words) - 18:21, 24 November 2013