Subject: Re: [boost] Google Summer Of Code
From: Brian Bartman (bbartmanboost_at_[hidden])
Date: 2010-03-30 10:55:00
I was writing my proposal and going over some of the different ways to
suggest implementation for bit masks and utilities, and was wondering if it
would be alright to propose to do the work in C++0x which I have been
working in for the last two years or so.
The project would benefit from the following features in C++0x,
Varidic templates (a compact tupple)
static_assert (for preventing the user from causing a massive error with 0
width bit fields)
constexper s (not part of GCC but its been a couple of months since I last
On Thu, Mar 18, 2010 at 2:56 PM, vicente.botet <vicente.botet_at_[hidden]>wrote:
> ----- Original Message -----
> From: "Andrew Sutton" <andrew.n.sutton_at_[hidden]>
> To: <boost_at_[hidden]>
> Sent: Thursday, March 18, 2010 8:26 PM
> Subject: Re: [boost] Google Summer Of Code
> >> > Hello my name is Brian Bartman and I am an undergraduate at Kent State
> >> > University Majoring in computer science.
> > I don't know if you are interested in improving Boost.Bitfield. I had two
> >> features I wanted to add since long time but I had not time lastly
> >> them. You can find information related to Boost.Bitfield in
> >> .
> > Hi Vicente.
> > I think these would be great components of a "bit-based" proposal. I
> > I'd like to see a compact or compressed vector to replace the 1- and
> > color maps in Boost (and generalize the concept),
> Could you point me to the library is using this kind of maps? An example?
> > and a compact tuple, which
> > (I think) is basically what you described for the RGB structure.
> Yes I suppose we talk of the same thing.
> > I think the
> > pointer_plus_bits may make the project a bit extensive for the summer,
> > definitely something to think about as an extension.
> Maybe :(
> > On my part, I'd like to see compact_vector, compact_tuple and tools for
> > and bitmask manipulation, with the pointer space reuse being an optional
> > component.
> > Would you be willing to mentor?
> Who has posted the idea for Bits & Ints? is you?
> "Bits & Ints
> Boost could use a utility library that brings together and extends a number
> of existing data structrues and utilities for working with binary data. This
> library might include:
> a.. Multidimensional bitfields or dynamic_bitfields.
> b.. Compressed value array and vector (like vector<bool> but also for
> multi-bit values)
> c.. Programming utilities for bit and bitmask manipulation
> This may also cover a number of integral special functions, including:
> a.. Functions for getting carry bits from addition and the high-half of an
> integer multiply
> b.. Sign extension from a length of m bits to a length of n
> c.. Rounding right-shifts (correctly rounded integer divide by powers of
> d.. Saturating arithmetic operations
> e.. Multi-word shifts (used for things like inserting in the middle of a
> f.. Bit reversal
> g.. Two-word divide by one-word value (there is often a special
> instruction for that)
> h.. Bit-interleaved arithmetic operations (used for Morton
> order/cache-oblivious traversals of matrices and similar things)
> i.. Everything from chapter 5 of
> In order to mentor this program I will need to understand what is behind
> each line.
> Be free to contact me off line, and we will discuss of this subject.
> Unsubscribe & other changes:
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk