Re: Persistent Binary Search Trees

2009/10/5 Dana Jansens <dana cg scs carleton ca>:
> 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.  First some background on what persistence means and
> why it would be nice to have available in an open source data
> structures library.

For those who were interested, I have opened a bug/feature request
with an implementation of a persistent GTree [1], and I would like to
invite any feedback.



[Date Prev][Date Next]   [Thread Prev][Thread Next]   [Thread Index] [Date Index] [Author Index]