eecs584 Adaptive Routing Tree

Files: Range.h Node.h Node.cpp RoutingTree.h RoutingTree.cpp

To compile: make

To run test case: make run < test1.in

The test case should be written in the format similar to test1.in: (lower1, upper1) shardID1,shartdID2,.... (lower2, upper2) shardID3,shartdID4,.... ... END
The output of the testcase will only print out the level of the current node
and will be similar to following:

Range: (5,10) parentNode before insertion: ... size: 1 (10,20) --> After Insertion: ... IDs: [1,2,3,4,5] size: 2 (5,10) --> 1 2 3 4 5 (10,20) --> ======================

Name		Name	Last commit message	Last commit date
Latest commit History 56 Commits
ART.cpp		ART.cpp
ART.h		ART.h
Makefile		Makefile
Node.cpp		Node.cpp
Node.cpp~		Node.cpp~
Node.h		Node.h
Node.h~		Node.h~
README.md		README.md
README.txt		README.txt
READMEduplicate.txt		READMEduplicate.txt
Range.h		Range.h
Range.h~		Range.h~
RoutingTree.cpp		RoutingTree.cpp
RoutingTree.cpp~		RoutingTree.cpp~
RoutingTree.h		RoutingTree.h
RoutingTree.h~		RoutingTree.h~
install.txt		install.txt
test1.in		test1.in
test_RoutingTree.cpp		test_RoutingTree.cpp
test_insert.cpp		test_insert.cpp
test_node		test_node
test_node.cpp		test_node.cpp
test_range.cpp		test_range.cpp
test_search		test_search
test_search.cpp		test_search.cpp
test_search.cpp~		test_search.cpp~

yny/eecs584