SettingsArrays
Array data structure
In computer science, an array data structure or simply array is a data structure consisting of a collection of elements (values or variables), each identified by at least one array i...
In computer science, an array data structure or simply array is a data structure consisting of a collection of elements (values or variables), each identified by at least one array i...
Array data type
In computer science, an array type is a data type that is meant to describe a collection of elements (values or variables), each selected by one or more indices that can be computed at r...
In computer science, an array type is a data type that is meant to describe a collection of elements (values or variables), each selected by one or more indices that can be computed at r...
Array slicing
In computer programming, array slicing is an operation that extracts certain elements from an array and packages them as another array, possibly with different number of indices (or dimensions) ...
In computer programming, array slicing is an operation that extracts certain elements from an array and packages them as another array, possibly with different number of indices (or dimensions) ...
BANG file
A BANG file (balanced and nested grid file) is a point access method which divides space into a nonperiodic grid.
A BANG file (balanced and nested grid file) is a point access method which divides space into a nonperiodic grid.
Bit array
A bit array is an array data structure that compactly stores individual bits.
A bit array is an array data structure that compactly stores individual bits.
Bounds checking
In computer programming, bounds checking is any method of detecting whether a variable is within some bounds before its use.
In computer programming, bounds checking is any method of detecting whether a variable is within some bounds before its use.
C-list (computer security)
In capability-based computer security, a C-list is an array of capabilities, usually associated with a process and maintained by the kernel.
In capability-based computer security, a C-list is an array of capabilities, usually associated with a process and maintained by the kernel.
Circular buffer
A circular buffer, cyclic buffer or ring buffer is a data structure that uses a single, fixed-size buffer as if it were connected end-to-end.
A circular buffer, cyclic buffer or ring buffer is a data structure that uses a single, fixed-size buffer as if it were connected end-to-end.
Dope vector
In computer programming, a dope vector is a data structure used to hold information about a data object, e.g. an array, especially its memory layout.
In computer programming, a dope vector is a data structure used to hold information about a data object, e.g. an array, especially its memory layout.
Dynamic array
In computer science, a dynamic array, growable array, resizable array, dynamic table, or array list is a random access, variable-size list data structure that allows elem...
In computer science, a dynamic array, growable array, resizable array, dynamic table, or array list is a random access, variable-size list data structure that allows elem...
Gap buffer
A gap buffer In computer science is a dynamic array that allows efficient insertion and deletion operations clustered near the same location.
A gap buffer In computer science is a dynamic array that allows efficient insertion and deletion operations clustered near the same location.
Grid file
In computer science, a grid file or bucket grid is a point access method which splits a space into a non-periodic grid where one or more cells of the grid refer to a small set of points.
In computer science, a grid file or bucket grid is a point access method which splits a space into a non-periodic grid where one or more cells of the grid refer to a small set of points.
Hashed array tree
In computer science, a hashed array tree is a dynamic array data-structure published by Edward Sitarski in 1996, maintaining an array of separate memory fragments to store the data elements, unl...
In computer science, a hashed array tree is a dynamic array data-structure published by Edward Sitarski in 1996, maintaining an array of separate memory fragments to store the data elements, unl...
Iliffe vector
In computer programming, an Iliffe vector, also known as a display, is a data structure used to implement multi-dimensional arrays.
In computer programming, an Iliffe vector, also known as a display, is a data structure used to implement multi-dimensional arrays.
Index mapping
Index mapping is a computer science term (also known as a "trivial hash function") that is used to describe the mapping of raw data, used directly as in array index, for an array.
Index mapping is a computer science term (also known as a "trivial hash function") that is used to describe the mapping of raw data, used directly as in array index, for an array.
Irregular matrix
An irregular matrix, or ragged matrix, can be described as a matrix that has a different number of elements in each row.
An irregular matrix, or ragged matrix, can be described as a matrix that has a different number of elements in each row.
Judy array
In computer science and software engineering, a Judy array is a data structure that has high performance, low memory usage and implements an associative array.
In computer science and software engineering, a Judy array is a data structure that has high performance, low memory usage and implements an associative array.
Lookup table
In computer science, a lookup table is a data structure, usually an array or associative array, often used to replace a runtime computation with a simpler array indexing operation.
In computer science, a lookup table is a data structure, usually an array or associative array, often used to replace a runtime computation with a simpler array indexing operation.
Matrix representation
Matrix representation is a method used by a computer language to store matrices of more than one dimension in memory.
Matrix representation is a method used by a computer language to store matrices of more than one dimension in memory.
Parallel array
In computing, a parallel array is a data structure for representing arrays of records.
In computing, a parallel array is a data structure for representing arrays of records.
Rank (computer programming)
In computer programming, rank with no further specifications is usually a synonym for (or refers to) "number of dimensions"; thus, a bi-dimensional array has rank two, a three-dimensional ar...
In computer programming, rank with no further specifications is usually a synonym for (or refers to) "number of dimensions"; thus, a bi-dimensional array has rank two, a three-dimensional ar...
Row-major order
In computing, row-major order and column-major order describe methods for storing multidimensional arrays in linear memory.
In computing, row-major order and column-major order describe methods for storing multidimensional arrays in linear memory.
Sparse array
In computer science, a sparse array is an array in which most of the elements have the same value.
In computer science, a sparse array is an array in which most of the elements have the same value.
Stride of an array
In computer programming, the stride of an array refers to the number of locations in memory between beginnings of successive array elements, measured in bytes or in units of the size of the arra...
In computer programming, the stride of an array refers to the number of locations in memory between beginnings of successive array elements, measured in bytes or in units of the size of the arra...
Suffix array
In computer science, a suffix array is an array of integers giving the starting positions of suffixes of a string in lexicographical order.
In computer science, a suffix array is an array of integers giving the starting positions of suffixes of a string in lexicographical order.
Variable-length array
In programming, a variable-length array (or VLA) is an array data structure of automatic storage duration whose length is determined at run time (instead of at compile time).
In programming, a variable-length array (or VLA) is an array data structure of automatic storage duration whose length is determined at run time (instead of at compile time).
VList
In computer science, the VList is a persistent data structure designed by Phil Bagwell in 2002 that combines the fast indexing of arrays with the easy extension of cons-based linked lists.
In computer science, the VList is a persistent data structure designed by Phil Bagwell in 2002 that combines the fast indexing of arrays with the easy extension of cons-based linked lists.