ft_containers

School 42's project "ft_containers" implementation.

Content

Passes mli's tester with flying colors. (except for a relational_ope test that complains about my own ft::swap())
Passes mleblanc's tester with flying colors, including the benchmarks.
Check the Annihilation List at the root repository for some tricky cases and remarks so you can fail as many people as possible during the evaluation process!

"Introduction to Algorithms," aka CLRS, or the Bible of Algorithms, 3rd edition, for the red-black tree implementation, Chapter 13.
"Data Structures & Algorithms in Java," 6th edition, for rbtree::lower_bound() and rbtree::upper_bound(), Chapter 11.1.
libstdc++-v3 official STL implementation, for deque, and other containers' memory allocation and template resolution processes.

Name		Name	Last commit message	Last commit date
Latest commit History 68 Commits
Makefile		Makefile
README.md		README.md
algorithm.hpp		algorithm.hpp
annihilation.md		annihilation.md
deque.hpp		deque.hpp
functional.hpp		functional.hpp
iterator.hpp		iterator.hpp
list.hpp		list.hpp
main.cpp		main.cpp
map.hpp		map.hpp
memory.hpp		memory.hpp
multimap.hpp		multimap.hpp
multiset.hpp		multiset.hpp
pair.hpp		pair.hpp
queue.hpp		queue.hpp
rbtree.hpp		rbtree.hpp
set.hpp		set.hpp
stack.hpp		stack.hpp
type_traits.hpp		type_traits.hpp
utility.hpp		utility.hpp
vector.hpp		vector.hpp