Scribd
Upload
6 views

Containers in OOP

Uploaded by

aniketbhosale3747
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Containers in OOP

Uploaded by

aniketbhosale3747
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Standard Template Library (STL)

Introduction to STL, STL Components, Containers- Sequence container and associative


containers, container adapters, Application of Container classes: vector, list,
Algorithms- basic searching and sorting algorithms, min-max algorithm, set operations, heap
sort, Iterators- input, output, forward, bidirectional and random access. Object Oriented
Programming – a road map to future

Containers

A container is a holder object that stores a collection of other objects (its elements). They are
implemented as class templates, which allows a great flexibility in the types supported as elements.
The container manages the storage space for its elements and provides member functions to access
them, either directly or through iterators (reference objects with similar properties to pointers).
Sequence containers
Sequence containers implement data structures which can be accessed sequentially.
 array: Static contiguous array (class template)
 vector: Dynamic contiguous array (class template)
 deque: Double-ended queue (class template)
 forward_list: Singly-linked list (class template)
 list : Doubly-linked list (class template)

Associative containers

Associative containers implement sorted data structures that can be quickly searched (O(log n)
complexity).
 Set: Collection of unique keys, sorted by keys
(class template)
 Map: Collection of key-value pairs, sorted by keys, keys are unique (class template).
 multiset: Collection of keys, sorted by keys (class template)
 multimap: Collection of key-value pairs, sorted by keys
(class template)
Unordered associative containers
Unordered associative containers implement unsorted (hashed) data structures that can be quickly
searched (O(1) amortized, O(n) worst-case complexity).
 unordered_set: Collection of unique keys, hashed by keys. (class template)
 unordered_map: Collection of key-value pairs, hashed by keys, keys are unique. (class template)
 unordered_multiset: Collection of keys, hashed by keys (class template)
 unordered_multimap: Collection of key-value pairs, hashed by keys (class template)
Container adaptors
Container adaptors provide a different interface for sequential containers.
 stack: Adapts a container to provide stack (LIFO data structure) (class template).
 queue: Adapts a container to provide queue (FIFO data structure) (class template).
 priority_queue: Adapts a container to provide priority queue (class template).

You might also like