You are welcome to contribute code or ideas to this repo! There are still two details we can do to make this database system better:
- Make the B Tree & hash table store keys of ID, not pointers to the
person
objects. - Refine the Residual Increment part as shown in the presentation, i.e., upgrade the information in the presentation.
- Forked the repo to private account and continue maintainess.
- Uploaded
/presentation
folder, with illustrations and demonstrations.
- Upgraded user interface.
- Refined project system.
- Decomposed classes and according functions.
- Increased
sleep()
funcitonality. - Added robustness check system.
-
Read (Google C++ Format)[http://www.cppblog.com/converse/archive/2010/05/29/116689.html] first.
-
Read the Schedule and hold on to it.
-
Keep communicating with each other.
-
Prepare for each meeting.
-
Give results for each meeting.
Welcome to Computing Assignment 2! We use the same workspace as Computing Assignment 1, but we branch on something else than front-end, Fibonacci Heap, and relevant things. Here are what you need to be careful about.
- Pull before modifying ANYTHING.
- ALWAYS wait for front-end unit test to pass, then push.
- Work on your branch instead of the main branch. Only after your branch is tested WITHOUT ANY BUGS, merge it with the main branch.
- Note that whenever you want to do ANYTHING to the main branch, make sure that you’ve tried pull.
- Keep ENERGETIC!