Vocabulary

Section 21.17 Vocabulary

associative container 🔗: A container in which elements are accessed by key values rather than by position. Examples include set and map.
🔗
container 🔗: A data structure that holds multiple values, such as a vector, set, or map.
🔗
dictionary 🔗: Another name for a map, an associative container that stores key-value pairs.
🔗
functor 🔗: An object that can be treated as if it is a function, typically by defining the operator() method.
🔗
key 🔗: A value used to access elements in an associative container, such as a set or map.
🔗
lambda 🔗: An anonymous function defined using the []() syntax, often used for short, inline functions.
🔗
map 🔗: An associative container that stores key-value pairs. The keys are unique and used to look up their associated values. Also known as a dictionary.
🔗
random access 🔗: The ability to access any element in a container directly using its index or key, without needing to traverse other elements first. Examples of containers that support random access include vector and map.
🔗
regular expression 🔗: A sequence of characters that defines a search pattern, often used for string matching and manipulation.
🔗
set 🔗: An associative container that stores unique elements.
🔗
sequence container 🔗: A container that orders elements in a specific sequence, such as a vector or list.
🔗

You have attempted of activities on this page.