some amount of cleanup to README/removing suspects note file
This commit is contained in:
parent
ae0b45df73
commit
5963998902
2 changed files with 22 additions and 2 deletions
23
README.md
23
README.md
|
|
@ -1 +1,22 @@
|
|||
[](https://classroom.github.com/a/KQPFWPgN)
|
||||
# `std::map` impl for CS440
|
||||
|
||||
This repo contains the results of an assignment I completed as a part of my CS 440 class.
|
||||
|
||||
The assignment in question was to implement much of the interface that `std::map` without using `std::map` with a performance bound requiring the usage of a red-black tree or comparably performant data structure.
|
||||
|
||||
The implementation is in the `Map.hpp` file with testing of that implementation occuring in `t.cpp`, `ta.cpp`, `minimal.cpp`, `morseex.cpp`, `test.cpp` `test-kec.cpp` `test-scaling.cpp`.
|
||||
|
||||
## Building
|
||||
|
||||
All `.cpp` files can be built into executables on Linux via the makefile albeit the makefile is currently written to use g++ even though this implementation should work with other C++ compilers (I've only tested building with `g++ (GCC) 15.2.1 20260103`)
|
||||
|
||||
## What is is implemented
|
||||
|
||||
The following is implemented.
|
||||
|
||||
- default, copy and move constructors and assignment operators
|
||||
- initializer list constructor
|
||||
- Mutable, Const and Reverse Iterators
|
||||
- finding a value in the map `O(log(N))` time given the key both const and mutably
|
||||
- insertion, modification and erasure of values via various methods
|
||||
- and comparison operators
|
||||
|
|
|
|||
1
suspects
1
suspects
|
|
@ -1 +0,0 @@
|
|||
rotation is definitely wrong somewhere, knowing me rotate_root, somehow 1 ended up right of 2
|
||||
Loading…
Reference in a new issue