From: Art Stamness (artstamness_at_[hidden])
Date: 2007-02-02 19:47:19
As stated by another on the thread, these already exists for the
integral types. using boost::lowest_bit I added : find_first,
find_next functions. The website has been updated, and a new code
drop placed with those functions implemented.
As for "most_significant_bit_index" I have not done that yet. Can you
think of an example case where that would be helpful?
Thank you for the feedback.
On Feb 1, 2007, at 6:48 PM, Hervé Brönnimann wrote:
> I was surprised not to find the least_significant_ bit_index and
> most_significant_bit_index functions. These can be heavily optimized
> using binary search and logical and/or manips for integral types,
> compared to a loop, so it would be especially worth having in your
> Hervé Brönnimann
> On Jan 31, 2007, at 5:30 PM, Art Stamness wrote:
>> I have been working on a library that is used for low level bit
>> manipulation of integral types, and modeling of n-bit length types. I
>> have written it as a template library, for inclusion with the Boost
>> library ( hopefully).
>> This is my public request for interest to see if anyone would be
>> interested in such a library. This code runs under Visual Studio
>> and g++ ( linux, and Mac ) . I have posted a web page with
>> documentation ( still a work in progress ), of most all the
>> functionality in the library. There is also a tar ball there, that
>> has been tested with Boost 1.33.1 .
>> Documentation and source tar-ball can be found here :
>> Any feedback, positive, negative, suggestions is always appreciated.
>> Also if there is a better suggestion for a name, I am open to it. I
>> realize the Boost.Logic library has a very different purpose than
>> this one, and don't want them to be confused.
>> Unsubscribe & other changes: http://lists.boost.org/mailman/
> Unsubscribe & other changes: http://lists.boost.org/mailman/
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk