https://github.com/talyx/containers
Implementation of STL library containers.
https://github.com/talyx/containers
21school binarytree containers stl template-design
Last synced: 21 days ago
JSON representation
Implementation of STL library containers.
- Host: GitHub
- URL: https://github.com/talyx/containers
- Owner: talyx
- Created: 2022-03-07T12:26:35.000Z (over 3 years ago)
- Default Branch: master
- Last Pushed: 2022-04-11T14:06:49.000Z (over 3 years ago)
- Last Synced: 2025-08-07T01:31:40.912Z (about 2 months ago)
- Topics: 21school, binarytree, containers, stl, template-design
- Language: C++
- Homepage:
- Size: 105 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# containers
Implementation of STL library containers.
Example implementation of the following containers:
- [stack](https://en.cppreference.com/w/cpp/container/stack)
- [vector](https://en.cppreference.com/w/cpp/container/vector)
- [map](https://en.cppreference.com/w/cpp/container/map)
Additionally implemented, [conditional](https://en.cppreference.com/w/cpp/types/conditional),
[enable_if](https://en.cppreference.com/w/cpp/types/enable_if), [less](https://en.cppreference.com/w/cpp/utility/functional/less),
[pair](https://en.cppreference.com/w/cpp/utility/pair),
[iterator_traits](https://en.cppreference.com/w/cpp/iterator/iterator_traits),
[bidirectional iterator (for trees)](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator),
[random access iterator](https://en.cppreference.com/w/cpp/named_req/RandomAccessIterator),
[reverse iterator](https://en.cppreference.com/w/cpp/iterator/reverse_iterator).
A binary search tree is used as the data structure for the map.