calgagi / cp_gen Goto Github PK

Also include a data structure for matrices :)

Or abstract it to n-dimensional

Include friend class avlTester that is only compiled if CP_GEN_TESTS is defined.

Also probably should get rid of a few of Node's member variables in order to decrease memory usage.

Might not do history tracking, but definitely want lazy propagation

This will allow you to not include #include "../lib/.hpp" at the top of every test file.

This can be done via checking if the Tester file exists...
If it does, we run the tests.
If it doesn't, we don't run tests.

Reason for this: Allows users to not include tests if they don't want to. That way, forks of this repo can be created.

closest_gt would be basically be synonymous to std::upper_bound.

closest_lt would be the opposite of closest_gt: it would grab the closest item in the tree that is less than val.

• string hashing
• input parsing (probably just until() function?)

This should be able to be completed in O(logn)

We could implement cp::graph to be a basic graph data structure...

Then, we could have bfs/dfs/max_flow/least_common_ancestor libraries each that have the cp::graph dependency. I'd have to implement dependency tracking in the main program, but might be cool

Sometimes you just need a bigint! This would probably be 128 bit integer