Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

https://github.com/Bhupesh-V/30-seconds-of-cpp

30 Seconds of C++ (STL in C++). Read More about 30C++ here 👉
https://github.com/Bhupesh-V/30-seconds-of-cpp

30-seconds-of-code 30-seconds-of-cpp algorithms cpp11 cpp14 cpp17 queue standard-template-library stl stl-algorithms stl-container stl-containers stl-vector vector

Last synced: about 2 months ago
JSON representation

30 Seconds of C++ (STL in C++). Read More about 30C++ here 👉

Lists

README 

        
# 30 Seconds of C++

>### 30 Seconds Of Standard Template Library in C++





    

        

    

    


    


    A collection of C++ STL features (functions/libraries) which can be learned in 30 seconds or less






[![Codacy Badge](https://api.codacy.com/project/badge/Grade/72e93df05bce4d7598f222676bfb511c)](https://app.codacy.com/app/Bhupesh-V/30-Seconds-Of-STL?utm_source=github.com&utm_medium=referral&utm_content=Bhupesh-V/30-Seconds-Of-STL&utm_campaign=Badge_Grade_Dashboard)

[![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg?style=flat-square)](http://makeapullrequest.com)

[![LICENSE](https://img.shields.io/github/license/Bhupesh-V/30-seconds-of-cpp?color=blue)](https://github.com/Bhupesh-V/30-Seconds-Of-STL/blob/master/LICENSE)

[![Build Status](https://travis-ci.org/Bhupesh-V/30-seconds-of-cpp.svg?branch=master)](https://travis-ci.org/Bhupesh-V/30-seconds-of-cpp)

[![CodeFactor](https://www.codefactor.io/repository/github/bhupesh-v/30-seconds-of-cpp/badge)](https://www.codefactor.io/repository/github/bhupesh-v/30-seconds-of-cpp)

[![Open Source Helpers](https://www.codetriage.com/bhupesh-v/30-seconds-of-cpp/badges/users.svg)](https://www.codetriage.com/bhupesh-v/30-seconds-of-cpp)

[![GitHub contributors](https://img.shields.io/github/contributors/Bhupesh-V/30-seconds-of-cpp)](https://github.com/Bhupesh-V/30-seconds-of-cpp/graphs/contributors)




### Header Files



* [algorithm](#algorithm) :sparkles:

* [list](#list) :page_with_curl:

* [map](#map) :world_map: 

* [queue](#queue) :large_blue_circle:

* [set](#set) :zap:

* [stack](#stack) :books:

* [unordered_map](#unordered_map) :world_map:

* [vector](#vector) :arrow_upper_right:



---



### Algorithm 

View contents

    

  1. accumulate
    2. 

  2. adjacent_difference
    3. 

  3. adjacent_find
    4. 

  4. all_of
    5. 

  5. any_of
    6. 

  6. binary_search
    7. 

  7. clamp
    8. 

  8. copy
    9. 

  9. copy_backward
    10. 

  10. copy_if
    11. 

  11. copy_n
    12. 

  12. count
    13. 

  13. count_if
    14. 

  14. equal
    15. 

  15. equal_range
    16. 

  16. fill
    17. 

  17. fill_n
    18. 

  18. find
    19. 

  19. find_first_of
    20. 

  20. find_if
    21. 

  21. find_if_not
    22. 

  22. for_each
    23. 

  23. for_each_n
    24. 

  24. generate
    25. 

  25. includes
    26. 

  26. iota
    27. 

  27. is_heap
    28. 

  28. is_permutation
    29. 

  29. is_sorted
    30. 

  30. iter_swap
    31. 

  31. lexicographical_compare
    32. 

  32. linear_search
    33. 

  33. lower_bound
    34. 

  34. make_heap
    35. 

  35. max
    36. 

  36. max_element
    37. 

  37. merge
    38. 

  38. min
    39. 

  39. min_element
    40. 

  40. minimax_element
    41. 

  41. minmax
    42. 

  42. minmax_element
    43. 

  43. mismatch
    44. 

  44. move
    45. 

  45. next_permutation
    46. 

  46. none_of
    47. 

  47. nth_element
    48. 

  48. partition
    49. 

  49. pop_heap
    50. 

  50. prev_permutation
    51. 

  51. push_heap
    52. 

  52. random_shuffle
    53. 

  53. remove
    54. 

  54. remove_copy
    55. 

  55. remove_copy_if
    56. 

  56. remove_if
    57. 

  57. replace
    58. 

  58. replace_copy
    59. 

  59. replace_copy_if
    60. 

  60. replace_if
    61. 

  61. reverse
    62. 

  62. reverse_copy
    63. 

  63. rotate
    64. 

  64. search
    65. 

  65. search_n
    66. 

  66. set_difference
    67. 

  67. set_intersection
    68. 

  68. set_union
    69. 

  69. shuffle
    70. 

  70. sort
    71. 

  71. stable_sort
    72. 

  72. swap
    73. 

  73. transform
    74. 

  74. transform_reduce
    75. 

  75. unique
    76. 

  76. upper_bound
    77. 





### List 

View contents

    

  1. assign
    2. 

  2. back
    3. 

  3. begin
    4. 

  4. cbegin
    5. 

  5. cend
    6. 

  6. clear
    7. 

  7. crbegin
    8. 

  8. crend
    9. 

  9. emplace
    10. 

  10. emplace_back
    11. 

  11. empty
    12. 

  12. end
    13. 

  13. erase
    14. 

  14. front
    15. 

  15. insert
    16. 

  16. max_size
    17. 

  17. merge
    18. 

  18. pop_front
    19. 

  19. rbegin
    20. 

  20. remove
    21. 

  21. rend
    22. 

  22. resize
    23. 

  23. reverse
    24. 

  24. size
    25. 

  25. sort
    26. 

  26. splice
    27. 

  27. swap
    28. 

  28. unique
    29. 





### Map 

View contents

    

  1. begin
    2. 

  2. cbegin
    3. 

  3. cend
    4. 

  4. clear
    5. 

  5. contains
    6. 

  6. count
    7. 

  7. crbegin
    8. 

  8. crend
    9. 

  9. emplace
    10. 

  10. emplace_hint
    11. 

  11. empty
    12. 

  12. end
    13. 

  13. erase
    14. 

  14. find
    15. 

  15. insert
    16. 

  16. lower_bound
    17. 

  17. max_size
    18. 

  18. rbegin
    19. 

  19. rend
    20. 

  20. size
    21. 

  21. swap
    22. 

  22. upper_bound
    23. 





### Queue 

View contents

    

  1. back
    2. 

  2. emplace
    3. 

  3. empty
    4. 

  4. front
    5. 

  5. pop
    6. 

  6. push
    7. 

  7. queue
    8. 

  8. size
    9. 

  9. swap
    10. 





### Set 

View contents

    

  1. begin
    2. 

  2. cbegin
    3. 

  3. cend
    4. 

  4. clear
    5. 

  5. contains
    6. 

  6. count
    7. 

  7. emplace
    8. 

  8. emplace_hint
    9. 

  9. empty
    10. 

  10. end
    11. 

  11. equal_range
    12. 

  12. erase
    13. 

  13. find
    14. 

  14. insert
    15. 

  15. lower_bound
    16. 

  16. max_size
    17. 

  17. rbegin
    18. 

  18. rend
    19. 

  19. size
    20. 

  20. swap
    21. 

  21. upper_bound
    22. 





### Stack 

View contents

    

  1. emplace
    2. 

  2. empty
    3. 

  3. pop
    4. 

  4. push
    5. 

  5. size
    6. 

  6. swap
    7. 

  7. top
    8. 





### Unordered_map 

View contents

    

  1. count
    2. 

  2. erase
    3. 

  3. find
    4. 

  4. insert
    5. 

  5. size
    6. 





### Vector 

View contents

    

  1. Vector
    2. 

  2. assign
    3. 

  3. at
    4. 

  4. back
    5. 

  5. begin
    6. 

  6. capacity
    7. 

  7. cbegin
    8. 

  8. cend
    9. 

  9. clear
    10. 

  10. crbegin
    11. 

  11. data
    12. 

  12. emplace
    13. 

  13. emplace_back
    14. 

  14. empty
    15. 

  15. end
    16. 

  16. erase
    17. 

  17. front
    18. 

  18. get_allocator
    19. 

  19. insert
    20. 

  20. max_size
    21. 

  21. pop_back
    22. 

  22. push_back
    23. 

  23. rbegin
    24. 

  24. rend
    25. 

  25. reserve
    26. 

  26. resize
    27. 

  27. shrink_to_fit
    28. 

  28. size
    29. 

  29. sort
    30. 

  30. swap
    31. 





## :globe_with_meridians: 30 Seconds of Knowledge

> Experience *30 Seconds of C++* as a [Web Extension](https://chrome.google.com/webstore/detail/30-seconds-of-knowledge/mmgplondnjekobonklacmemikcnhklla?hl=en) built by [Stefan Petrovic](https://github.com/petrovicstefanrs)



- A big thanks to [Shriam Kaushik](https://github.com/shriamkaushik) for the lovely new logo :heart:



## Author



:bust_in_silhouette: **Bhupesh Varshney**



- Twitter: [@bhupeshimself](https://twitter.com/bhupeshimself)

- DEV: [bhupesh](https://dev.to/bhupesh)



## :memo: License



This project is licensed under the MIT License. See the [LICENSE](LICENSE) file for details.



## :wave: Contributing



Please read the *updated* [CONTRIBUTING](CONTRIBUTING.md) for the process for submitting pull requests to us.