A collection of C++ STL features (functions/libraries) which can be learned in 30 seconds or less
- algorithm β¨
- list π
- map πΊοΈ
- queue π΅
- set β‘
- stack π
- unordered_map πΊοΈ
- vector
βοΈ
View contents
accumulate
adjacent_find
all_of
any_of
binary_search
copy
copy_backward
copy_if
copy_n
count
count_if
find
find_first_of
find_if
find_if_not
for_each
for_each_n
generate
includes
iota
is_sorted
lower_bound
lower_bound
max
max_element
merge
min
min_element
minmax
minmax_element
mismatch
none_of
remove
remove_copy
remove_copy_if
remove_if
replace
replace_copy
replace_copy_if
replace_if
reverse
set_difference
set_intersection
set_union
sort
upper_bound
View contents
View contents
Join other C++ enthusiasts on
Experience 30 Seconds of C++ as a Web Extension built by Stefan Petrovic
Name | Profile |
---|---|
TANIYA GUPTA | thetaniyagupta |
Saumya Agnihotri | saumyaagnihtori |
shan7030 | shan7030 |
Sonkeng Maldini | sdmg15 |
Pranav Khurana | Pranav-Khurana |
Rickey Patel | rickey90 |
Kyle Johnson | kydojo |
Timothy Itodo | itodotimothy6 |
Pankaj Raghav | Panky-codes |
Thamara Andrade | thamara |
darksider3 | Darksider3 |
Harsh Raj | harshraj22 |
samuels96 | samuels96 |
- A big thanks to Shriam Kaushik for the lovely new logo β€οΈ
π€ Bhupesh Varshney
- Twitter: @bhupeshimself
- DEV: bhupesh
This project is licensed under the MIT License. See the LICENSE file for details.
Please read the updated CONTRIBUTING for the process for submitting pull requests to us.