As many of you know, we are starting the development of libcds2, this
is an almost-complete rewrite of the library, keeping in mind that we
want it to work in 64bits, allowing to represent more data. The first
version does not allow to build big structures (the limit depends on
the structure, but it's certainly below the amount of information we
want to manage nowadays).
So far three people have volunteered to contribute to the library:
- Alex Bowe
- Rodrigo Canovas
- Antonio Farina
- Diego Seco
Antonio and Diego will join later during this term (deadlines). But in
the meanwhile I don't think we will code that much either, since we
still want to define some things.
Regarding what I mentioned in the private email, a simple way to have
bug tracking and code review modules is to use github, also supported
by Alex, so I created the project there. Give me your usernames and I
will add you to the project so you can commit. If you want to
volunteer to take the responsibility for a given data type, this is
the time to speak. I'm interested in maintaining bitsequences and
sequences, more than one maintainer per type is ok (I think 2 is the
optimal number :-).
The data types we are planning to include for the first release:
- BitSequence
- Sequence
- Permutation
- Tree
- Buffer (rename of CompressedSequence, it fits better what it does)
- BinaryRelation
It would be good to also have, but I think we can leave this one for later:
- LabeledBinaryRelation
We also have to discuss whether we want to include TextIndex and SuffixTree.
Another issue is regarding dynamic data structures, we don't have
anybody implementing any of them.
Any suggestions you have, just go ahead, don't be shy ;-)
Cheers,
Francisco.
--
Francisco Claude
fcl...@cs.uwaterloo.ca -- fcl...@gmail.com (GTalk/MSN)
http://www.recoded.cl/