Single dimension search

[Andrew Leung]

Hi All,

I've attached some code which modifies the kdtree++ libraries to 
implement serialization functions and queries over any dimension 
combination. The goal of the serialization is speed and preserving 
order, so the tree doesn't need to be re-balanced after its read from disk.

The code not really documented but there are not too many changes to the 
existing kdtree++ library files. A simple 'make' should build 
everything. Any comments, questions, or ways to improve/speed up the 
code would be welcome. Thanks for all of your help.

Andrew

Paul Harris wrote:
> On 23/01/2008, Andrew Leung <anwleung at gmail.com> wrote:
>   
>> Hi,
>>
>> I was wondering if any serialization libraries have been written for
>> libkdtree. I am looking to serialize an entire tree to disk and will
>> likely use the boost::serialization libraries. I'm just curious if
>> anything similar has already been done.
>>
>>     
>
> Not that I'm aware of.
>
>   
>> Also, has the library ever been run through valgrind? I ran it through
>> with test_kdtree.cpp and found 40ish errors, but no memory leaks. Thanks.
>>     
>
> I think I did a while ago, might be time to double check things.
>
> Let me know what you come up with!
>
> cheers!
> Paul
>
>   

-------------- next part --------------
A non-text attachment was scrubbed...
Name: kdtree.tar.gz
Type: application/x-gzip
Size: 19325 bytes
Desc: not available
Url : http://lists.alioth.debian.org/pipermail/libkdtree-devel/attachments/20080129/8f7133c4/attachment.bin