Associate containers u map, multimap An entry is a pair<key, value>, key is an index K V Internal implementation is searching tree, quite K V efficient K V For map, key must be unique; for multimap, kv there could be duplicate ones Could be used as hash table set, multiset KK—K—K An entry is only a key For set, key must be unique; for multiset, there could be duplicate onesAssociate Containers ◼ map, multimap ◼ An entry is a pair<key, value>, key is an index ◼ Internal implementation is searching tree, quite efficient ◼ For map, key must be unique; for multimap, there could be duplicate ones ◼ Could be used as hash table ◼ set, multiset ◼ An entry is only a key ◼ For set, key must be unique; for multiset, there could be duplicate ones K V K V K V K V K K K K