2009/10/5 Dana Jansens :
> Hello,
>
> I am interested in contributing code for persistent binary search
> trees to the GLib project. This would actually count as credit
> towards a grad level data structures class for me, but I have a lot of
> experience working with GLi
Dana Jansens writes:
> There are 2 other BSTs that would work effectively to provide a
> persistent BST, while also maintaining a very efficient implementation
> for when persistence is not used. They are:
> - Treaps
> - Red-Black Trees
> Treaps can be expected to outperform Red-Black Trees f
2009/10/5 Mikkel Kamstrup Erlandsen :
> 2009/10/5 Dana Jansens :
>> 2009/10/5 Mikkel Kamstrup Erlandsen :
>>> Don't let that hold you back. As far as I can imagine I don't have any
>>> use case ready, but that is probably because I've never had a
>>> persistent BST at hand :-)
>>>
>>> If I where yo
On Mon, Oct 5, 2009 at 3:05 PM, Dana Jansens wrote:
> Hello,
>
> I am interested in contributing code for persistent binary search
> trees to the GLib project. This would actually count as credit
> towards a grad level data structures class for me, but I have a lot of
> exper
2009/10/5 Dana Jansens :
> 2009/10/5 Mikkel Kamstrup Erlandsen :
>> Don't let that hold you back. As far as I can imagine I don't have any
>> use case ready, but that is probably because I've never had a
>> persistent BST at hand :-)
>>
>> If I where you I'd probably just develop on out-of-tree lib
2009/10/5 Mikkel Kamstrup Erlandsen :
> Don't let that hold you back. As far as I can imagine I don't have any
> use case ready, but that is probably because I've never had a
> persistent BST at hand :-)
>
> If I where you I'd probably just develop on out-of-tree library for
> the datastructure, ke
2009/10/5 Dana Jansens :
> Hello,
>
> I am interested in contributing code for persistent binary search
> trees to the GLib project. This would actually count as credit
> towards a grad level data structures class for me, but I have a lot of
> experience working with GLi
Hello,
I am interested in contributing code for persistent binary search
trees to the GLib project. This would actually count as credit
towards a grad level data structures class for me, but I have a lot of
experience working with GLib in the past, and developing C-based open
source projects
