An Entity of Type: Abstraction100002137, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In computing, associative containers refer to a group of class templates in the standard library of the C++ programming language that implement ordered associative arrays. Being templates, they can be used to store arbitrary elements, such as integers or custom classes. The following containers are defined in the current revision of the C++ standard: set, map, multiset, multimap. Each of these containers differ only on constraints placed on their elements.

Property Value
dbo:abstract
  • In computing, associative containers refer to a group of class templates in the standard library of the C++ programming language that implement ordered associative arrays. Being templates, they can be used to store arbitrary elements, such as integers or custom classes. The following containers are defined in the current revision of the C++ standard: set, map, multiset, multimap. Each of these containers differ only on constraints placed on their elements. The associative containers are similar to the unordered associative containers in C++ standard library, the only difference is that the unordered associative containers, as their name implies, do not order their elements. (en)
  • 关联容器是指C++标准模板库中的一套类模板,实现了有序关联数组。可用于存放任意数据类型的元素。C++标准中定义的关联容器有: set, map, multiset, multimap。 关联容器类似于C++中的无序关联容器。差别为: * 关联容器是红黑树实现,无序关联容器是哈希表实现。 * 关联容器保证按键值有序遍历,因此可以做范围查找,而无序关联容器不可以。关联支持一些导航类的操作,如求出给定键最邻近的键,最大键、最小键操作。 * 关联容器的迭代器不会失效,除非所指元素被删除。无序关联容器的iterator在修改元素时可能会失效。所以对关联容器的遍历与修改在一定程度上可并行 * 哈希表查找时候要算hash,这个最坏时间复杂度是O(key的长度);基于比较的有序关联容器通常只使用头几个字符进行比较 (zh)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 33977314 (xsd:integer)
dbo:wikiPageLength
  • 19327 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1063674462 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • 关联容器是指C++标准模板库中的一套类模板,实现了有序关联数组。可用于存放任意数据类型的元素。C++标准中定义的关联容器有: set, map, multiset, multimap。 关联容器类似于C++中的无序关联容器。差别为: * 关联容器是红黑树实现,无序关联容器是哈希表实现。 * 关联容器保证按键值有序遍历,因此可以做范围查找,而无序关联容器不可以。关联支持一些导航类的操作,如求出给定键最邻近的键,最大键、最小键操作。 * 关联容器的迭代器不会失效,除非所指元素被删除。无序关联容器的iterator在修改元素时可能会失效。所以对关联容器的遍历与修改在一定程度上可并行 * 哈希表查找时候要算hash,这个最坏时间复杂度是O(key的长度);基于比较的有序关联容器通常只使用头几个字符进行比较 (zh)
  • In computing, associative containers refer to a group of class templates in the standard library of the C++ programming language that implement ordered associative arrays. Being templates, they can be used to store arbitrary elements, such as integers or custom classes. The following containers are defined in the current revision of the C++ standard: set, map, multiset, multimap. Each of these containers differ only on constraints placed on their elements. (en)
rdfs:label
  • Associative containers (en)
  • 关联性容器 (zh)
rdfs:seeAlso
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License