Performance of find methods, comparison with linear search

[Paul Harris]

attached

On Nov 20, 2007 9:38 PM, Renaud Detry <renaudjdetry at airpost.net> wrote:
> > Then I moved
> >  triplet nearest = random_points[0];
> > to above the for loop, and added a
> >   std::cout << "PCH: " << nearest << std::endl;
> > below the for loop... I got this result
> >
>
> I cannot see any difference when I make this change. Can you send the
> whole file?
>
>
> Renaud.
>
>
> _______________________________________________
> libkdtree-devel mailing list
> libkdtree-devel at lists.alioth.debian.org
> http://lists.alioth.debian.org/mailman/listinfo/libkdtree-devel
>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: test_kdtree.cpp
Type: text/x-c++src
Size: 6998 bytes
Desc: not available
Url : http://lists.alioth.debian.org/pipermail/libkdtree-devel/attachments/20071120/6eed2d5c/attachment.cpp