int main() {
PNG imgIn, imgOut;
imgIn.readFromFile("in.png");
// test constructor, decompress
Quadtree halfTree(imgIn, 128);
imgOut = halfTree.decompress();
imgOut.writeToFile("outHalf.png");
// now for the real tests
Quadtree fullTree;
fullTree.buildTree(imgIn, 256);
// you may want to experiment with different commands in this section
// test pruneSize and idealPrune (slow in valgrind, so you may want to
// comment these out when doing most of your testing for memory leaks)
cout << "fullTree.pruneSize(0) = " << fullTree.pruneSize(0) << endl;
cout << "fullTree.pruneSize(100) = " << fullTree.pruneSize(100) << endl;
cout << "fullTree.pruneSize(1000) = " << fullTree.pruneSize(1000) << endl;
cout << "fullTree.pruneSize(100000) = " << fullTree.pruneSize(100000) << endl;
cout << "fullTree.idealPrune(1000) = " << fullTree.idealPrune(1000) << endl;
cout << "fullTree.idealPrune(10000) = " << fullTree.idealPrune(10000) << endl;
// Test some creation/deletion functions
Quadtree fullTree2;
fullTree2 = fullTree;
imgOut = fullTree2.decompress();
imgOut.writeToFile("outCopy.png");
//test clockwiseRotate
fullTree.clockwiseRotate();
imgOut = fullTree.decompress();
imgOut.writeToFile("outRotated.png");
// test prune
fullTree = fullTree2;
fullTree.prune(1000);
imgOut = fullTree.decompress();
imgOut.writeToFile("outPruned.png");
// test several functions in succession
Quadtree fullTree3(fullTree2);
fullTree3.clockwiseRotate();
fullTree3.prune(10000);
fullTree3.clockwiseRotate();
fullTree3.clockwiseRotate();
fullTree3.clockwiseRotate();
imgOut = fullTree3.decompress();
imgOut.writeToFile("outEtc.png");
// ensure that printTree still works
Quadtree tinyTree(imgIn, 32);
cout << "Printing tinyTree:\n";
tinyTree.prune(100);
tinyTree.printTree();
return 0;
}
int main() {
BMP imgIn, imgOut,soln_img;
imgIn.ReadFromFile("in.bmp");
//print soln
soln_img.ReadFromFile("soln_outPruned.bmp");
Quadtree soln_tree(soln_img,128);
// soln_tree.printTree();
// test constructor, decompress
Quadtree halfTree(imgIn,128);
imgOut = halfTree.decompress();
/* cout<<endl<<endl;
for(int y=0;y<8;y++){
for(int x=0;x<8;x++){
cout<<(int)imgIn(x,y)->Red<<","<<(int)imgIn(x,y)->Green<<","<<(int)imgIn(x,y)->Blue;
if (x%8==0)
cout<<endl;
else
cout<<"||";
}
}
cout<<endl;
*/
imgOut.WriteToFile("outHalf.bmp");
// now for the real tests
Quadtree fullTree;
fullTree.buildTree(imgIn, 256);
// you may want to experiment with different commands in this section
// test pruneSize and idealPrune (slow in valgrind, so you may want to
// comment these out when doing most of your testing for memory leaks)
cout << "fullTree.pruneSize(0) = " << fullTree.pruneSize(0) << endl;
cout << "fullTree.pruneSize(100) = " << fullTree.pruneSize(100) << endl;
cout << "fullTree.pruneSize(1000) = " << fullTree.pruneSize(1000) << endl;
cout << "fullTree.pruneSize(100000) = " << fullTree.pruneSize(100000) << endl;
cout << "fullTree.idealPrune(1000) = " << fullTree.idealPrune(1000) << endl;
cout << "fullTree.idealPrune(10000) = " << fullTree.idealPrune(10000) << endl;
cout << "fullTree.idealPrune(449) = " << fullTree.idealPrune(1000) << endl;
/*
// Test some creation/deletion functions
Quadtree fullTree2;
fullTree2 = fullTree;
imgOut = fullTree2.decompress();
// imgOut = fullTree.decompress();
imgOut.WriteToFile("outCopy.bmp");
// test clockwiseRotate
fullTree.clockwiseRotate();
imgOut = fullTree.decompress();
imgOut.WriteToFile("outRotated.bmp");
// test prune
fullTree = fullTree2;
fullTree.prune(1000);
// fullTree.printTree();
imgOut = fullTree.decompress();
Quadtree prunetree(imgOut,128);
// prunetree.printTree();
imgOut.WriteToFile("outPruned.bmp");
// test several functions in succession
Quadtree fullTree3(fullTree2);
fullTree3.clockwiseRotate();
fullTree3.prune(10000);
fullTree3.clockwiseRotate();
fullTree3.clockwiseRotate();
fullTree3.clockwiseRotate();
imgOut = fullTree3.decompress();
imgOut.WriteToFile("outEtc.bmp");
// ensure that printTree still works
Quadtree tinyTree(imgIn, 32);
cout << "Printing tinyTree:\n";
tinyTree.prune(100);
tinyTree.printTree();
*/
return 0;
}