`qudt:Map`

http://qudt.org/schema/qudt/Map

Incoming relations

Types: owl:Class, rdfs:Class, sh:NodeShape

Predicate	Object
`rdf:type`	`owl:Class`
`rdf:type`	`rdfs:Class`
`rdf:type`	`sh:NodeShape`
`dcterms:description`	“A Map Type is an abstract data type that defines the properties of map data structures. A Map (or Associative Array) is an abstract data structure 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`	“Map Type”
`rdfs:seeAlso`	`qudt:AssociativeArray`
`rdfs:subClassOf`	`qudt:Collection`

Generated 2026-09-22T13:15:48.343+00:00