Search results

Jump to navigation Jump to search
  • Auto-populated based on [[Special:WhatLinksHere/Data structure]]. Needs checking by a human.
    713 bytes (97 words) - 16:01, 4 August 2024
  • {{r|Data structure}}
    704 bytes (92 words) - 16:00, 21 October 2024
  • {{r|Data structure}}
    984 bytes (125 words) - 11:01, 23 August 2024
  • * [[data structure|data structures]]
    3 KB (541 words) - 16:00, 21 October 2024
  • {{r|Data structure}}
    905 bytes (122 words) - 16:00, 21 October 2024
  • {{r|Data structure}}
    983 bytes (135 words) - 16:00, 8 July 2024
  • ...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 bina
    5 KB (700 words) - 06:00, 13 October 2024
  • ...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]], it
    8 KB (1,257 words) - 11:00, 13 August 2024
  • % to serialize a data structure.
    5 KB (786 words) - 06: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,409 words) - 11:01, 12 September 2024
  • *record - the standard erlang data structure
    6 KB (903 words) - 14: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 (836 words) - 06:00, 26 August 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 example
    4 KB (551 words) - 08: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 a
    6 KB (958 words) - 21: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. However
    21 KB (3,203 words) - 11:01, 4 September 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 repl
    9 KB (1,429 words) - 11:37, 7 August 2024
  • ...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 prog
    10 KB (1,577 words) - 16:00, 21 October 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 records
    46 KB (7,006 words) - 06:01, 26 September 2024
  • ...ver instances, can still be cheaper than in-house server farms because the data structure infrastructure is shared.
    57 KB (8,403 words) - 16:01, 29 July 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, veloci
    94 KB (13,590 words) - 11:00, 24 October 2024
View ( | ) (20 | 50 | 100 | 250 | 500)