Knowing when the tree fails and we're stuck with a linear search is useful for performance testing too
Knowing when the tree fails and we're stuck with a linear search is
useful for performance testing too



git-svn-id: ffc1bc5b3feaf8644044862cc38c386ade156493@4595 434f946d-2f3d-0410-ba4c-cb9f52fb0dbf

certik/libmesh,certik/libmesh,certik/libmesh,certik/libmesh,certik/libmesh,certik/libmesh,certik/libmesh