https://github.com/tjensen42/42-ft_containers

In this 42 core curriculum project, I implemented a few container (vector, stack, map, set) of the C++ standard template library.
https://github.com/tjensen42/42-ft_containers

cpp cpp98 map stack stl-containers vector

Last synced: 27 days ago
JSON representation

In this 42 core curriculum project, I implemented a few container (vector, stack, map, set) of the C++ standard template library.

• Host: GitHub
• URL: https://github.com/tjensen42/42-ft_containers
• Owner: tjensen42
• Created: 2022-08-23T10:21:21.000Z (about 2 years ago)
• Default Branch: master
• Last Pushed: 2022-10-10T11:35:02.000Z (about 2 years ago)
• Last Synced: 2024-09-28T23:40:55.268Z (about 1 month ago)
• Topics: cpp, cpp98, map, stack, stl-containers, vector
• Language: C++
• Homepage:
• Size: 21.5 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# 42-ft_containers

## Resources

1. https://cplusplus.com/reference/stl/

2. https://github.com/gcc-mirror/gcc/tree/master/libstdc%2B%2B-v3/include/bits

3. https://github.com/llvm-mirror/libcxx/tree/master/include

- https://en.cppreference.com/w/cpp/types/enable_if

- https://eli.thegreenplace.net/2014/sfinae-and-enable_if/

## Red–black tree

* https://edutechlearners.com/download/Introduction_to_algorithms-3rd%20Edition.pdf

* https://algorithmtutor.com/Data-Structures/Tree/Red-Black-Trees/

* https://www.youtube.com/watch?v=qvZGUFHWChY&list=PLwyTr3n29dXRDviK2r4fcF_9lr8pL1tlr

* specific type of balanced binary search trees

**Rules:**

* a node is either red or black

* root and leaves (NIL) are black

* if a node is red, its children are black

* all paths from a node to its NIL descendants contain the same number of black nodes

- longest path is no more than twice the length of the shortest path

    - shortest: all black nodes

    - longest: alternating red and black

**Operations:**

- all operations have a time complexity of O(log n)

* Search

* Insert, require rotation

* Remove, require rotation