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_difference
adjacent_find
all_of
any_of
binary_search
clamp
copy
copy_backward
copy_if
copy_n
count
count_if
equal
equal_range
fill
fill_n
find
find_first_of
find_if
find_if_not
for_each
for_each_n
generate
includes
iota
is_heap
is_permutation
is_sorted
iter_swap
lexicographical_compare
linear_search
lower_bound
make_heap
max
max_element
merge
min
min_element
minimax_element
minmax
minmax_element
mismatch
move
next_permutation
none_of
nth_element
partition
pop_heap
prev_permutation
push_heap
random_shuffle
remove
remove_copy
remove_copy_if
remove_if
replace
replace_copy
replace_copy_if
replace_if
reverse
reverse_copy
rotate
search
search_n
set_difference
set_intersection
set_union
shuffle
sort
stable_sort
swap
transform
transform_reduce
unique
upper_bound
View contents
View contents
View contents
View contents
Experience 30 Seconds of C as a Web Extension built by Stefan Petrovic
- 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.