Subject: [boost] GSoC idea - interval trees, binary indexed trees, permutation
From: Brestin Seby (razyelx_at_[hidden])
Date: 2011-04-01 10:08:23
Hello, my name is Sebastian Brestin. I am a student from Romania.
While reading Boost documentation, and reviews on XInt, I though about the possibility of implementing for Boost some new data structures that are not yet implemented not even in STL like interval trees, binary indexed trees.
I also have an other idea about implementing (Boost:Permutation) a Permutation Class that allows operations on permutations.
What do you think?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk