Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

Commit 6c10fca

Browse files
committed
Improve descriptions of additional containers
1 parent 35c6349 commit 6c10fca

File tree

1 file changed

+6
-4
lines changed

1 file changed

+6
-4
lines changed

07-strings-containers-and-views.md

Lines changed: 6 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -693,15 +693,17 @@ There are some other containers and *container adaptors* implemented in the Stan
693693

694694
* `std::bitset` also stores binary bits, but has its size fixed at compile-time
695695

696-
* `std::deque` (pronounced "deck") implements a double-ended FIFO similar to `std::vector`
696+
* `std::deque` (pronounced "deck") implements a double-ended container similar to `std::vector`, but with additional operations such as `push_front()`
697697

698-
* `std::stack` implements a LIFO
698+
* `std::stack` implements a LIFO (Last In First Out)
699699

700-
* `std::queue` implements a FIFO
700+
* `std::queue` implements a FIFO (First In First Out)
701701

702702
* `std::priority_queue` implements a FIFO that sorts by age and priority
703703

704-
* `std::flat_map` implements an unordered map essentially as two vectors
704+
* `std::flat_set` implements a sorted container of unique values, typically implemented as a vector
705+
706+
* `std::flat_map` implements a sorted associative container, typically implemented as two vectors (one for keys and one for values)
705707

706708
A brief Tutorial such as this is not the place to delve into these, and indeed the other containers covered in this Chapter have much more detail to discover. As a go-to for both tutorial and reference I can highly recommend [CppReference.com](https://en.cppreference.com)[^1] and [Josuttis, "The C++ Standard Library"](http://cppstdlib.com)[^2].
707709

0 commit comments

Comments
 (0)