Can you list the main containers from the standard STL library and their features?

Main containers from the standard library STL (Standard Template Library) in C++:

• vector — dynamic array, provides fast access by index and efficient appending of elements at the end.
• list — doubly linked list, allows efficient insertion and deletion of elements anywhere, but slow access by index.
• deque — double-ended queue, supports fast insertions and deletions at both ends.
• set — a collection that stores unique sorted elements, provides fast search.
• map — associative array (dictionary), stores key-value pairs with unique keys, sorted by key.
• unordered_set and unordered_map — hash tables for set and map respectively, provide amortized constant-time access but without order.

Each container is optimized for specific tasks, and the choice depends on requirements for access speed, insertion, deletion, and the need for ordering.