- Boost - lists.boost.org

Michael Herchel is ooo.
by Michael.Herchel＠rohde-schwarz.com 16 Jul '10

16 Jul '10

Ihre Nachricht betreffend: / Your Mail about: Boost Digest, Vol 2974, Issue 2 Ich werde ab 16.07.2010 nicht im Büro sein. Ich kehre zurück am 26.07.2010. Ich werde Ihre Nachricht nach meiner Rückkehr beantworten. I am on vacation and will be back in the office on 26.07.2010. I will reply your email as soon as I am back.

1 0

[gsoc] Pointer Plus Bits Behavior and Interface
by Brian Bartman 16 Jul '10

16 Jul '10

Hello, Pointer Plus Bits: Is a data structure which points to specifically aligned object such that the value of the address is divisible by a power of two (the power of two which it is divisible by is given as a template argument). The empty bits of the pointer are then used to store extra boolean values relating to something (This is of the programmers choosing but it would seem best practice to make it related to the object being pointed at). The technique is of storing extra bits inside of pointers is some times referred to as bit stuffing. Clang uses this technique for their QualType pointer: http://clang.llvm.org/doxygen/classclang_1_1QualType.html So here are some of the questions I would like to pose to the community about the behavior and interface of the pointer_plus_bits data structure: 1) Should the pointer_plus_bits have a pre and post increment and decrement ( what about supporting other arithmetic operations such as add, minus, add assign etc...) ? One could do this if the sizeof the type is evenly divisible by 2 to the number of bits being "stuffed". The next/previous object in the array being traversed could be correctly pointed at (assuming that the item being pointed at IS an array). 1.a) If this is a behavior supported by the pointer_plus_bits should it keep the bits being stuffed or set them to zero each time? 2) Should the bits being stuffed apply during comparison? 3) Should the pointer provide compatibility between itself and pointer of the same type that is being stuffed (the behavior of this would mean masking out the pointer so the stuffed bits won't apply during the comparison)? (ie Should pointer_plus_bits<T,2> be comparable to T* ?) (in pointer_plus_bits 2 is the number of bits being stuffed). -- thanks, Brian Bartman

11 33

Boost.Test - Looking for a gui.
by Giorgio Zoppi 16 Jul '10

16 Jul '10

Hi, i'm looking for a gui which it's able to launch tests and test suites for using with Boost.Test. Cheers, Giorgio. -- Quiero ser el rayo de sol que cada día te despierta para hacerte respirar y vivir en me. "Favola -Moda".

3 5

Michael Herchel is ooo.
by Michael.Herchel＠rohde-schwarz.com 16 Jul '10

16 Jul '10

Ihre Nachricht betreffend: / Your Mail about: Boost Digest, Vol 2974, Issue 1 Ich werde ab 16.07.2010 nicht im Büro sein. Ich kehre zurück am 26.07.2010. Ich werde Ihre Nachricht nach meiner Rückkehr beantworten. I am on vacation and will be back in the office on 26.07.2010. I will reply your email as soon as I am back.

1 0

bjam move in svn
by Vladimir Prus 15 Jul '10

15 Jul '10

I've just moved tools/jam into tools/build/v2/engine. This is a technical step towards unified packaging and release management of what is essentially a single tool, not two independent things. There are not other changes for now, but given that many folks might have tools/jam written in some scripts, I though I'd mention this. The change is on trunk only, so should not affect testing. Anyway, let me know if something breaks. Thanks, -- Vladimir Prus http://vladimir_prus.blogspot.com Boost.Build: http://boost.org/boost-build2

3 4

mpi test question
by Robert Ramey 15 Jul '10

15 Jul '10

I'm still struggling to get serialization verioning correct. Is there anyway I can run mpi serialization tests on my win32 machine w/o mpi installed? Robert Ramey

2 2

[lists] how to add a new boost mailing list?
by Eric Niebler 15 Jul '10

15 Jul '10

I'd like to set up proto(a)lists.boost.org for use by myself and a few other folks interested in discussing Proto and DSEL design issues. I could just use Google Groups (the Spirit lists use lists.SF.net, I see), but lists.boost.org would be better IMO. Does anybody know how to do this? -- Eric Niebler BoostPro Computing http://www.boostpro.com

1 1

Bits and Ints: Intention Request
by Murilo Adriano Vasconcelos 15 Jul '10

15 Jul '10

Hi, I am working on GSoC Bits and Ints project wich is a library with functions for integral data types. The motivation for this library is to provide integer algorithms and utilities optimized by doing binary manipulations so that it uses less CPU cycles, memory access and conditional branches. This library contains some classical integer algorithms such as population count, reversing bits, sign extension and bit interleaving. Would be great to Boost to incorporate this library because its functions can be used on a widely types of applications that needs to perform fast operations on integral types. Since one of slowest operations perfomed by the CPU is conditional braching (it involves pipelining, recaching, etc) this library avoid it. For the runtime versions, conditional branch is not used (if, switch, for, while, etc). Other motivation to adopt this library is the integration with Boost.MPL. Almost every function implemented have it MPL and non-MPL static version. For example: // Runtime int pop_count(uintmax_t value); // non-MPL metafunction template <uintmax_t Value> struct static_pop_count {}; // MPL template <typename IC> struct pop_count : integral_c<int, static_pop_count<IC::value>::value> {}; The contents of this library is inside of boost/integer folder and can be viewed in [0]. The static and MPL compatible metafunctions are declared on headers with static_ prefix. The partial documentation can be viewed in [1]. What already is implemented (underlined are out of proposal) - Sign extension from a length of m bits to a length of n - Bit reversal - Bit-interleaving and uninterleaving - Programming utilities for bit and bitmask manipulation - Sign function - Transfer of sign - Clear Least-Significant Nonzero Bit - Round Up or Down to Next Power of 2 - Count Trailing Zeros - Population Count - *Integer Log2* - *Count Leading Zeros* - Compile time MPL compatible abs - Compile time MPL compatible lcm - Compile time MPL compatible gcd - Safe average functions - Swap without a temporary - Templated class is_integral_constant<> My plan is to implement these functions: - Run-time GCD - Run-time LCM - Functions for getting carry bits from addition and the high-half of an integer multiply - Rounding right-shifts - Saturating arithmetic operations - Multi-word shifts - Two-word divide by one-word value - Bounds Checking - Power of 2 Crossing - Find First String of 1-Bits of a Given Length - Incrementing a Reversed Integer - Decoding a “Zero Means 2n” Field - Integer Log Base 10 I want to know wich functions you think that it is interesting to implement in this library. Also, comments and suggestions are appreciated. [0] - http://svn.boost.org/svn/boost/sandbox/SOC/2010/bits_and_ints/boost/integer/ [1] - http://svn.boost.org/svn/boost/sandbox/SOC/2010/bits_and_ints/libs/integer/… References: http://aggregate.org/MAGIC/ http://graphics.stanford.edu/~seander/bithacks.html http://bits.stephan-brumme.com/ http://www.boost.org/doc/libs/1_35_0/libs/integer/index.html Hacker's Delight / Henry S. Warren, Jr Regards, -- Murilo Adriano Vasconcelos http://murilo.wordpress.com

3 5

Is svn.boost.org down?
by Marshall Clow 14 Jul '10

14 Jul '10

I can't get to Trac. I can't check out from SVN. [ 0810 PDT ] -- Marshall

2 1

[uuid] - test fail for gcc-mingw-4.3.3
by Andy Tompkins 14 Jul '10

14 Jul '10

Hi, I'm hoping someone can help me figure out why the following test fails. See http://tinyurl.com/2w796gq It appears that it compiles but there is such little information I don't know what it wrong. Thanks Andy.

2 2