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: 3 months ago
JSON representation

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

• Host: GitHub
• URL: https://github.com/Bhupesh-V/30-seconds-of-cpp
• Owner: Bhupesh-V
• License: mit
• Archived: true
• Created: 2018-11-26T16:54:40.000Z (almost 6 years ago)
• Default Branch: master
• Last Pushed: 2023-11-08T06:39:59.000Z (about 1 year ago)
• Last Synced: 2024-04-13T21:57:45.222Z (7 months ago)
• Topics: 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
• Language: C++
• Homepage: https://bhupesh-v.github.io/30-Seconds-of-C++/
• Size: 1.56 MB
• Stars: 1,419
• Watchers: 29
• Forks: 615
• Open Issues: 124
• Metadata Files:
  • Readme: README.md
  • Contributing: CONTRIBUTING.md
  • Funding: .github/FUNDING.yml
  • License: LICENSE
  • Code of conduct: CODE_OF_CONDUCT.md

Awesome Lists containing this project

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



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




### List 

View contents



assign

back

begin

cbegin

cend

clear

crbegin

crend

emplace

emplace_back

empty

end

erase

front

insert

max_size

merge

pop_front

rbegin

remove

rend

resize

reverse

size

sort

splice

swap

unique




### Map 

View contents



begin

cbegin

cend

clear

contains

count

crbegin

crend

emplace

emplace_hint

empty

end

erase

find

insert

lower_bound

max_size

rbegin

rend

size

swap

upper_bound




### Queue 

View contents



back

emplace

empty

front

pop

push

queue

size

swap




### Set 

View contents



begin

cbegin

cend

clear

contains

count

emplace

emplace_hint

empty

end

equal_range

erase

find

insert

lower_bound

max_size

rbegin

rend

size

swap

upper_bound




### Stack 

View contents



emplace

empty

pop

push

size

swap

top




### Unordered_map 

View contents



count

erase

find

insert

size




### Vector 

View contents



Vector

assign

at

back

begin

capacity

cbegin

cend

clear

crbegin

data

emplace

emplace_back

empty

end

erase

front

get_allocator

insert

max_size

pop_back

push_back

rbegin

rend

reserve

resize

shrink_to_fit

size

sort

swap




## :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.