Sequences(3)

🌸 NAME 🌸

Hey bestie!! Welcome to Sequences(3) from the Library Functions Manual — yes, the libstdc++ sequence-container squad is here, and it is literally giving organized linear order energy 💖

Sequences is the page for the sequence containers. Here’s the whole iconic lineup:

🎀 Classes 🎀

• struct std::array< _Tp, _Nm > — A standard container for storing a fixed size sequence of elements. fixed size means fixed size, bestie 💅
• class std::basic_string< _CharT, _Traits, _Alloc > — Managing sequences of characters and character-like objects. character-like objects have entered the chat ✨
• class std::deque< _Tp, _Alloc > — A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end. both ends stay speedy 🦋
• class std::forward_list< _Tp, _Alloc > — A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence. linear access, fixed-time insert/delete 🎀
• class std::list< _Tp, _Alloc > — A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence. same energy as forward_list, different container 🌸
• class std::priority_queue< _Tp, _Sequence, _Compare > — A standard container automatically sorting its contents. it sorts itself, main character behavior fr fr 👑
• class std::queue< _Tp, _Sequence > — A standard container giving FIFO behavior. first in, first out, no cap 🍓
• class std::stack< _Tp, _Sequence > — A standard container giving FILO behavior. first in, last out, iconic 🧚
• class std::vector< _Tp, _Alloc > — A standard container which offers fixed time access to individual elements in any order. fixed-time access, any order ⭐
• class std::vector< bool, _Alloc > — A specialization of vector for booleans which offers fixed time access to individual elements in any order. yes, booleans get their own vector moment 💀

💫 Detailed Description 💫

Sequences arrange a collection of objects into a strictly linear order. Periodt.

The differences between sequences are usually due to one or both of the following:

• memory management
• algorithmic complexity

As an example of the first case, vector is required to use a contiguous memory layout, while other sequences such as deque are not. contiguous vs not-contiguous: the vibe check 🫶

The prime reason for choosing one sequence over another should be based on the second category of differences, algorithmic complexity. For example, if you need to perform many inserts and removals from the middle of a sequence, list would be ideal. But if you need to perform constant-time access to random elements of the sequence, then list should not be used. bestie, please do not use list for that 😭

All sequences must meet certain requirements, summarized in tables. tables have entered the group chat ✨

👑 Author 👑

Generated automatically by Doxygen for libstdc++ from the source code. the robot author did its thing 🤖💅

Bye bestie — this page is brought to you by libstdc++, dated 21 Apr 2009, and filed under Sequences(3). slay and read the docs 💖✨🎀