qudt:AssociativeArray| Predicate | Object |
|---|---|
rdf:type |
owl:Class |
rdf:type |
rdfs:Class |
rdf:type |
sh:NodeShape |
dcterms:description |
An Associative Array (or Map) is an abstract data type composed of a collection of keys and a collection of values, where each key is associated with one value. The operation of finding the value associated with a key is called a lookup or indexing, and this is the most important operation supported by an associative array. The relationship between a key and its value is sometimes called a mapping or binding. |
rdfs:isDefinedBy |
http://qudt.org/3.5.2/schema/datatype |
rdfs:isDefinedBy |
http://qudt.org/3.5.2/schema/shacl/datatype |
rdfs:label |
“Associative Array” |
rdfs:seeAlso |
qudt:Map |
rdfs:subClassOf |
qudt:Array |