qudt:HomogeneousArray| Predicate | Object |
|---|---|
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:
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 |