treat searches for 1 nearest neighbor differently in kd_tree
treat searches for 1 nearest neighbor differently in gaussian_process
treat searches for 1 nearest neighbor differently in gp_wrapper
print out timing for solo nnsrches in aps.cpp
added box source files from old M_APS repository
removed kptr from box source code
added box.o to Makefile
gave gp a bptr member; intialize it when initializing kptr
gp::preduct uses bptr instead of kptr
gp adds to bptr when it add to kptr
initialize bptr as NULL
box keeps track of time spent searching
gp knows about time spent searching in boxes
gp knows about biggest and smallest box
gpWrapper knows about boxes
print box timing info in aps.cpp
silly error in predict
simplification
min per box is 10
add matrix inversion time to bptr search time