QUDT logo

qudt:HomogeneousArray

http://qudt.org/schema/qudt/HomogeneousArray
All OWL view SHACL view
Types: owl:Class, rdfs:Class, sh:NodeShape
PredicateObject
rdf:type owl:Class
rdf:type rdfs:Class
rdf:type sh:NodeShape
dcterms:description

An Array> is a data structure that stores a collection of elements, typically of the same type, in a contiguous block of memory. Each element in an array is identified by an index or key, which is typically a numerical identifier, either starting at '0' or '1'.

The key considerations for an Array are:

  1. Fixed Size: The size of an array may be pre-determined when it is created and cannot be changed;
  2. Index-Based Access: Elements can be accessed, updated, or modified using their index;
  3. Homogeneous Elements: all elements in an array must be of the same datatype;
  4. Contiguous Memory Allocation: The elements are stored in consecutive memory locations, which allows efficient access using the index.

An Array is represented as ordered entries of values arranged according to its dimensionality. The number of dimensions is specified in the attribute 'dimensionality'.

The property 'qudt:datatype' refers to the datatype of the elements.

An array can be multi-dimensional. Multiple indices are used but they are treated as extensions of the same structure. For Example: for a 2D array arr[2][3], indices refer to the row and column positions. A 2D array is still represented as a list, where each member of the list is a list.

Higher dimensional arrays can be represented as nested lists. For each dimension a new nested list is defined.

rdfs:isDefinedBy http://qudt.org/3.5.2/schema/datatype
rdfs:isDefinedBy http://qudt.org/3.5.2/schema/shacl/datatype
rdfs:label “Homogeneous Array”
rdfs:subClassOf qudt:Array
Generated 2026-09-22T13:15:48.343+00:00