Awesome
30 Seconds of C++
<p align="center"> <a href="https://github.com/Bhupesh-V/30-Seconds-of-cpp"> <img src="https://github.com/Bhupesh-V/30-Seconds-of-cpp/blob/master/logo/new_logo_2.jpg" height=auto weight=100%> </a> <br> <hr> <strong>A collection of C++ STL features (functions/libraries) which can be learned in 30 seconds or less</strong> </p> <hr>30 Seconds Of Standard Template Library in C++
Header Files
- algorithm :sparkles:
- list :page_with_curl:
- map :world_map:
- queue :large_blue_circle:
- set :zap:
- stack :books:
- unordered_map :world_map:
- vector :arrow_upper_right:
Algorithm
<details><summary>View contents</summary> <ol> <li><a href="algorithm/accumulate.md"><code>accumulate</code></a></li> <li><a href="algorithm/adjacent_difference.md"><code>adjacent_difference</code></a></li> <li><a href="algorithm/adjacent_find.md"><code>adjacent_find</code></a></li> <li><a href="algorithm/all_of.md"><code>all_of</code></a></li> <li><a href="algorithm/any_of.md"><code>any_of</code></a></li> <li><a href="algorithm/binary_search.md"><code>binary_search</code></a></li> <li><a href="algorithm/clamp.md"><code>clamp</code></a></li> <li><a href="algorithm/copy.md"><code>copy</code></a></li> <li><a href="algorithm/copy_backward.md"><code>copy_backward</code></a></li> <li><a href="algorithm/copy_if.md"><code>copy_if</code></a></li> <li><a href="algorithm/copy_n.md"><code>copy_n</code></a></li> <li><a href="algorithm/count.md"><code>count</code></a></li> <li><a href="algorithm/count_if.md"><code>count_if</code></a></li> <li><a href="algorithm/equal.md"><code>equal</code></a></li> <li><a href="algorithm/equal_range.md"><code>equal_range</code></a></li> <li><a href="algorithm/fill.md"><code>fill</code></a></li> <li><a href="algorithm/fill_n.md"><code>fill_n</code></a></li> <li><a href="algorithm/find.md"><code>find</code></a></li> <li><a href="algorithm/find_first_of.md"><code>find_first_of</code></a></li> <li><a href="algorithm/find_if.md"><code>find_if</code></a></li> <li><a href="algorithm/find_if_not.md"><code>find_if_not</code></a></li> <li><a href="algorithm/for_each.md"><code>for_each</code></a></li> <li><a href="algorithm/for_each_n.md"><code>for_each_n</code></a></li> <li><a href="algorithm/generate.md"><code>generate</code></a></li> <li><a href="algorithm/includes.md"><code>includes</code></a></li> <li><a href="algorithm/iota.md"><code>iota</code></a></li> <li><a href="algorithm/is_heap.md"><code>is_heap</code></a></li> <li><a href="algorithm/is_permutation.md"><code>is_permutation</code></a></li> <li><a href="algorithm/is_sorted.md"><code>is_sorted</code></a></li> <li><a href="algorithm/iter_swap.md"><code>iter_swap</code></a></li> <li><a href="algorithm/lexicographical_compare.md"><code>lexicographical_compare</code></a></li> <li><a href="algorithm/linear_search.md"><code>linear_search</code></a></li> <li><a href="algorithm/lower_bound.md"><code>lower_bound</code></a></li> <li><a href="algorithm/make_heap.md"><code>make_heap</code></a></li> <li><a href="algorithm/max.md"><code>max</code></a></li> <li><a href="algorithm/max_element.md"><code>max_element</code></a></li> <li><a href="algorithm/merge.md"><code>merge</code></a></li> <li><a href="algorithm/min.md"><code>min</code></a></li> <li><a href="algorithm/min_element.md"><code>min_element</code></a></li> <li><a href="algorithm/minimax_element.md"><code>minimax_element</code></a></li> <li><a href="algorithm/minmax.md"><code>minmax</code></a></li> <li><a href="algorithm/minmax_element.md"><code>minmax_element</code></a></li> <li><a href="algorithm/mismatch.md"><code>mismatch</code></a></li> <li><a href="algorithm/move.md"><code>move</code></a></li> <li><a href="algorithm/next_permutation.md"><code>next_permutation</code></a></li> <li><a href="algorithm/none_of.md"><code>none_of</code></a></li> <li><a href="algorithm/nth_element.md"><code>nth_element</code></a></li> <li><a href="algorithm/partition.md"><code>partition</code></a></li> <li><a href="algorithm/pop_heap.md"><code>pop_heap</code></a></li> <li><a href="algorithm/prev_permutation.md"><code>prev_permutation</code></a></li> <li><a href="algorithm/push_heap.md"><code>push_heap</code></a></li> <li><a href="algorithm/random_shuffle.md"><code>random_shuffle</code></a></li> <li><a href="algorithm/remove.md"><code>remove</code></a></li> <li><a href="algorithm/remove_copy.md"><code>remove_copy</code></a></li> <li><a href="algorithm/remove_copy_if.md"><code>remove_copy_if</code></a></li> <li><a href="algorithm/remove_if.md"><code>remove_if</code></a></li> <li><a href="algorithm/replace.md"><code>replace</code></a></li> <li><a href="algorithm/replace_copy.md"><code>replace_copy</code></a></li> <li><a href="algorithm/replace_copy_if.md"><code>replace_copy_if</code></a></li> <li><a href="algorithm/replace_if.md"><code>replace_if</code></a></li> <li><a href="algorithm/reverse.md"><code>reverse</code></a></li> <li><a href="algorithm/reverse_copy.md"><code>reverse_copy</code></a></li> <li><a href="algorithm/rotate.md"><code>rotate</code></a></li> <li><a href="algorithm/search.md"><code>search</code></a></li> <li><a href="algorithm/search_n.md"><code>search_n</code></a></li> <li><a href="algorithm/set_difference.md"><code>set_difference</code></a></li> <li><a href="algorithm/set_intersection.md"><code>set_intersection</code></a></li> <li><a href="algorithm/set_union.md"><code>set_union</code></a></li> <li><a href="algorithm/shuffle.md"><code>shuffle</code></a></li> <li><a href="algorithm/sort.md"><code>sort</code></a></li> <li><a href="algorithm/stable_sort.md"><code>stable_sort</code></a></li> <li><a href="algorithm/swap.md"><code>swap</code></a></li> <li><a href="algorithm/transform.md"><code>transform</code></a></li> <li><a href="algorithm/transform_reduce.md"><code>transform_reduce</code></a></li> <li><a href="algorithm/unique.md"><code>unique</code></a></li> <li><a href="algorithm/upper_bound.md"><code>upper_bound</code></a></li> </ol> </details>List
<details><summary>View contents</summary> <ol> <li><a href="list/assign.md"><code>assign</code></a></li> <li><a href="list/back.md"><code>back</code></a></li> <li><a href="list/begin.md"><code>begin</code></a></li> <li><a href="list/cbegin.md"><code>cbegin</code></a></li> <li><a href="list/cend.md"><code>cend</code></a></li> <li><a href="list/clear.md"><code>clear</code></a></li> <li><a href="list/crbegin.md"><code>crbegin</code></a></li> <li><a href="list/crend.md"><code>crend</code></a></li> <li><a href="list/emplace.md"><code>emplace</code></a></li> <li><a href="list/emplace_back.md"><code>emplace_back</code></a></li> <li><a href="list/empty.md"><code>empty</code></a></li> <li><a href="list/end.md"><code>end</code></a></li> <li><a href="list/erase.md"><code>erase</code></a></li> <li><a href="list/front.md"><code>front</code></a></li> <li><a href="list/insert.md"><code>insert</code></a></li> <li><a href="list/max_size.md"><code>max_size</code></a></li> <li><a href="list/merge.md"><code>merge</code></a></li> <li><a href="list/pop_front.md"><code>pop_front</code></a></li> <li><a href="list/rbegin.md"><code>rbegin</code></a></li> <li><a href="list/remove.md"><code>remove</code></a></li> <li><a href="list/rend.md"><code>rend</code></a></li> <li><a href="list/resize.md"><code>resize</code></a></li> <li><a href="list/reverse.md"><code>reverse</code></a></li> <li><a href="list/size.md"><code>size</code></a></li> <li><a href="list/sort.md"><code>sort</code></a></li> <li><a href="list/splice.md"><code>splice</code></a></li> <li><a href="list/swap.md"><code>swap</code></a></li> <li><a href="list/unique.md"><code>unique</code></a></li> </ol> </details>Map
<details><summary>View contents</summary> <ol> <li><a href="map/begin.md"><code>begin</code></a></li> <li><a href="map/cbegin.md"><code>cbegin</code></a></li> <li><a href="map/cend.md"><code>cend</code></a></li> <li><a href="map/clear.md"><code>clear</code></a></li> <li><a href="map/contains.md"><code>contains</code></a></li> <li><a href="map/count.md"><code>count</code></a></li> <li><a href="map/crbegin.md"><code>crbegin</code></a></li> <li><a href="map/crend.md"><code>crend</code></a></li> <li><a href="map/emplace.md"><code>emplace</code></a></li> <li><a href="map/emplace_hint.md"><code>emplace_hint</code></a></li> <li><a href="map/empty.md"><code>empty</code></a></li> <li><a href="map/end.md"><code>end</code></a></li> <li><a href="map/erase.md"><code>erase</code></a></li> <li><a href="map/find.md"><code>find</code></a></li> <li><a href="map/insert.md"><code>insert</code></a></li> <li><a href="map/lower_bound.md"><code>lower_bound</code></a></li> <li><a href="map/max_size.md"><code>max_size</code></a></li> <li><a href="map/rbegin.md"><code>rbegin</code></a></li> <li><a href="map/rend.md"><code>rend</code></a></li> <li><a href="map/size.md"><code>size</code></a></li> <li><a href="map/swap.md"><code>swap</code></a></li> <li><a href="map/upper_bound.md"><code>upper_bound</code></a></li> </ol> </details>Queue
<details><summary>View contents</summary> <ol> <li><a href="queue/back.md"><code>back</code></a></li> <li><a href="queue/emplace.md"><code>emplace</code></a></li> <li><a href="queue/empty.md"><code>empty</code></a></li> <li><a href="queue/front.md"><code>front</code></a></li> <li><a href="queue/pop.md"><code>pop</code></a></li> <li><a href="queue/push.md"><code>push</code></a></li> <li><a href="queue/queue.md"><code>queue</code></a></li> <li><a href="queue/size.md"><code>size</code></a></li> <li><a href="queue/swap.md"><code>swap</code></a></li> </ol> </details>Set
<details><summary>View contents</summary> <ol> <li><a href="set/begin.md"><code>begin</code></a></li> <li><a href="set/cbegin.md"><code>cbegin</code></a></li> <li><a href="set/cend.md"><code>cend</code></a></li> <li><a href="set/clear.md"><code>clear</code></a></li> <li><a href="set/contains.md"><code>contains</code></a></li> <li><a href="set/count.md"><code>count</code></a></li> <li><a href="set/emplace.md"><code>emplace</code></a></li> <li><a href="set/emplace_hint.md"><code>emplace_hint</code></a></li> <li><a href="set/empty.md"><code>empty</code></a></li> <li><a href="set/end.md"><code>end</code></a></li> <li><a href="set/equal_range.md"><code>equal_range</code></a></li> <li><a href="set/erase.md"><code>erase</code></a></li> <li><a href="set/find.md"><code>find</code></a></li> <li><a href="set/insert.md"><code>insert</code></a></li> <li><a href="set/lower_bound.md"><code>lower_bound</code></a></li> <li><a href="set/max_size.md"><code>max_size</code></a></li> <li><a href="set/rbegin.md"><code>rbegin</code></a></li> <li><a href="set/rend.md"><code>rend</code></a></li> <li><a href="set/size.md"><code>size</code></a></li> <li><a href="set/swap.md"><code>swap</code></a></li> <li><a href="set/upper_bound.md"><code>upper_bound</code></a></li> </ol> </details>Stack
<details><summary>View contents</summary> <ol> <li><a href="stack/emplace.md"><code>emplace</code></a></li> <li><a href="stack/empty.md"><code>empty</code></a></li> <li><a href="stack/pop.md"><code>pop</code></a></li> <li><a href="stack/push.md"><code>push</code></a></li> <li><a href="stack/size.md"><code>size</code></a></li> <li><a href="stack/swap.md"><code>swap</code></a></li> <li><a href="stack/top.md"><code>top</code></a></li> </ol> </details>Unordered_map
<details><summary>View contents</summary> <ol> <li><a href="unordered_map/count.md"><code>count</code></a></li> <li><a href="unordered_map/erase.md"><code>erase</code></a></li> <li><a href="unordered_map/find.md"><code>find</code></a></li> <li><a href="unordered_map/insert.md"><code>insert</code></a></li> <li><a href="unordered_map/size.md"><code>size</code></a></li> </ol> </details>Vector
<details><summary>View contents</summary> <ol> <li><a href="vector/vector.md"><code>Vector</code></a></li> <li><a href="vector/assign.md"><code>assign</code></a></li> <li><a href="vector/at.md"><code>at</code></a></li> <li><a href="vector/back.md"><code>back</code></a></li> <li><a href="vector/begin.md"><code>begin</code></a></li> <li><a href="vector/capacity.md"><code>capacity</code></a></li> <li><a href="vector/cbegin.md"><code>cbegin</code></a></li> <li><a href="vector/cend.md"><code>cend</code></a></li> <li><a href="vector/clear.md"><code>clear</code></a></li> <li><a href="vector/crbegin.md"><code>crbegin</code></a></li> <li><a href="vector/data.md"><code>data</code></a></li> <li><a href="vector/emplace.md"><code>emplace</code></a></li> <li><a href="vector/emplace_back.md"><code>emplace_back</code></a></li> <li><a href="vector/empty.md"><code>empty</code></a></li> <li><a href="vector/end.md"><code>end</code></a></li> <li><a href="vector/erase.md"><code>erase</code></a></li> <li><a href="vector/front.md"><code>front</code></a></li> <li><a href="vector/get_allocator.md"><code>get_allocator</code></a></li> <li><a href="vector/insert.md"><code>insert</code></a></li> <li><a href="vector/max_size.md"><code>max_size</code></a></li> <li><a href="vector/pop_back.md"><code>pop_back</code></a></li> <li><a href="vector/push_back.md"><code>push_back</code></a></li> <li><a href="vector/rbegin.md"><code>rbegin</code></a></li> <li><a href="vector/rend.md"><code>rend</code></a></li> <li><a href="vector/reserve.md"><code>reserve</code></a></li> <li><a href="vector/resize.md"><code>resize</code></a></li> <li><a href="vector/shrink_to_fit.md"><code>shrink_to_fit</code></a></li> <li><a href="vector/size.md"><code>size</code></a></li> <li><a href="vector/sort.md"><code>sort</code></a></li> <li><a href="vector/swap.md"><code>swap</code></a></li> </ol> </details>:globe_with_meridians: 30 Seconds of Knowledge
Experience 30 Seconds of C++ as a Web Extension built by Stefan Petrovic
- A big thanks to Shriam Kaushik for the lovely new logo :heart:
Author
:bust_in_silhouette: Bhupesh Varshney
- Twitter: @bhupeshimself
- DEV: bhupesh
:memo: License
This project is licensed under the MIT License. See the LICENSE file for details.
:wave: Contributing
Please read the updated CONTRIBUTING for the process for submitting pull requests to us.