|
gptkbp:instanceOf
|
C++ Standard Library container
|
|
gptkbp:allocator_type
|
Allocator
|
|
gptkbp:beginFunction
|
begin
|
|
gptkbp:clearFunction
|
clear
|
|
gptkbp:commonIn
|
gptkb:red-black_tree
|
|
gptkbp:comparisonOperators
|
==, !=, <, <=, >, >=
|
|
gptkbp:compatibleWith
|
duplicate elements
|
|
gptkbp:const_iterator
|
supported
|
|
gptkbp:countFunction
|
gptkb:Count
|
|
gptkbp:defaultComparator
|
std::less
|
|
gptkbp:defaultSortOrder
|
ascending
|
|
gptkbp:elementAccess
|
no at() method
no operator[]
|
|
gptkbp:emptyFunction
|
empty
|
|
gptkbp:endFunction
|
end
|
|
gptkbp:equal_rangeFunction
|
equal_range
|
|
gptkbp:eraseFunction
|
erase
|
|
gptkbp:findFunction
|
find
|
|
gptkbp:headerFile
|
<set>
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
STL set
|
|
gptkbp:insertFunction
|
insert
|
|
gptkbp:introducedIn
|
gptkb:C++98
|
|
gptkbp:iteratorInvalidation
|
erasure invalidates only erased element's iterator
insertion does not invalidate iterators
|
|
gptkbp:iteratorType
|
bidirectional
|
|
gptkbp:key_compare
|
Compare
|
|
gptkbp:key_type
|
Key
|
|
gptkbp:lower_boundFunction
|
lower_bound
|
|
gptkbp:max_sizeFunction
|
max_size
|
|
gptkbp:memoryOverhead
|
higher than vector
|
|
gptkbp:namespace
|
std
|
|
gptkbp:numberOfLocations
|
sorted elements
unique elements
|
|
gptkbp:parameter
|
Key
Allocator
Compare
|
|
gptkbp:partOf
|
gptkb:C++_Standard_Template_Library
|
|
gptkbp:provides
|
O(log n) deletion
O(log n) insertion
O(log n) search
|
|
gptkbp:relatedContainer
|
STL multiset
STL unordered_set
|
|
gptkbp:reverse_iterator
|
supported
|
|
gptkbp:sizeFunction
|
size
|
|
gptkbp:swapFunction
|
swap
|
|
gptkbp:threadSafe
|
not thread-safe
|
|
gptkbp:underlyingDataStructure
|
balanced binary search tree
|
|
gptkbp:upper_boundFunction
|
upper_bound
|
|
gptkbp:uses
|
fast lookup of unique elements
ordered collection without duplicates
|
|
gptkbp:value_type
|
Key
|
|
gptkbp:bfsParent
|
gptkb:red-black_tree
|
|
gptkbp:bfsLayer
|
7
|