A map is like an associative array where each element is made of a pair. A pair contains a key and a value. Key serves as an index. The entries in a map are automatically sorted based on key when data is entered. Map container provides the following functions: Following program demonstrates working with a map: Data is stored in a linear fashion. Each element is related to other elements by its position. Elements can be accessed using an iterator. Examples of sequence containers are: Vector, List, and Dequeue. Vector: Dynamic array that allows insertion and deletion of elements
The post How to work with Maps in Standard Template Library appeared first on Coding Security.
How to work with Maps in Standard Template Library
read more
Tidak ada komentar:
Posting Komentar