cpp-work/62STL.cpp at master · Aenansh/cpp-work · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
/*
        STL : STANDARD TEMPLATE LIBRARY

            -A collection of pre-defined template classes and functions.
            -Competitive use.

            -STL is used for faster work and not waste time in "reinventing the wheel".

        Components : Containers  -> Stores data, uses template classes
                     Algorithms  -> Perform tasks like sorting and searching, uses template functions
                     Iterators   -> Objects pointing to an element in the container, just like pointers

                     They work in unison,
                                        -Containers store data,
                                        -Iterator points at an element in the container
                                        -Algorithm orders the iterator or instructs where to point

                   [ STL = Containers + Algorithms + Iterators ]
                                ^           ^           ^
                                |           |           |
                          Object which  Procedure to   Object which points
                          Stores Data   process data   to an element of a container

                          _ Sequence Containers : stores data in linear fashion
                         |                       Eg : Vector, List, Dequeue
 TYPES OF CONTAINERS -   |_ Associative Containers : Direct Access in tree fashion
                         |                       Eg : Set, Multi-set, Map, Multi-map
                         |_ Derived Containers : They are derived from any of the above two types, real world modelling
                                                 Eg : Stack, queue, priority queue

*/