November 2012 - Boost - lists.preview.boost.org

[boost::context] reusing stacks
by Valentin Milea 27 Nov '12

27 Nov '12

Hi, I'm working on a tiny coroutine library based on boost::context. For performance reasons I'd rather keep a pool of stacks instead allocating/deallocating every time. Is it legal to reuse a stack for a different context? namespace ctx = boost::context; ctx::fcontext_t fcm, *fc; void f1(intptr_t) { std::cout << "f1" << std::endl; ctx::jump_fcontext(fc, &fcm, 0); } void f2(intptr_t) { std::cout << "f2" << std::endl; ctx::jump_fcontext(fc, &fcm, 0); } int main(int argc, char * argv[]) { ctx::guarded_stack_allocator alloc; std::size_t size = ctx::guarded_stack_allocator::default_stacksize(); void *sp = alloc.allocate(size); fc = ctx::make_fcontext(sp, size, f1); std::cout << "main: jump 1" << std::endl; ctx::jump_fcontext(&fcm, fc, 0); fc = ctx::make_fcontext(sp, size, f2); // legal? std::cout << "main: jump 2" << std::endl; ctx::jump_fcontext(&fcm, fc, 0); std::cout << "main: done" << std::endl; return 0; }

2 6

[boost-mpl] -Wall -Werror issue
by Belcourt, Kenneth 27 Nov '12

27 Nov '12

Hi, This code generates sign / unsigned compare warning with -Wall, could this please be cleaned up? enum { n = # if defined(__EDG_VERSION__) aux::dependent_unsigned<T>::value > -1 # else sizeof(T) > -1 # endif }; It appears that sizeof(T) > -1 yields zero for EDG, Gcc and Clang so perhaps this is just older (unused) code? -- Noel Belcourt

2 4

[math] boost::math::isfinite fails with --fast-math
by Gaetano Mendola 26 Nov '12

26 Nov '12

Hi all, I'm wandering if this is to be expected, the following code fails if compiled with --fast-math: //==================================================== #include <boost/math/special_functions/fpclassify.hpp> int main() { const float a = 0.0f/0.0f; assert(not boost::math::isfinite(a)); } //==================================================== Regards Gaetano Mendola

6 13

gcc 4.4.3 + boost optional 1.40 crash
by Gaetano Mendola 26 Nov '12

26 Nov '12

Hi all, after banging my head for an entire day I come out with this test case showing a possible bug in gcc 4.4.3 or in boost optional, the test crashes with a pure virtual method called only if compiled only with -O1, -O2, -O3. The same code in another machine with gcc 4.7.2 and boost 1.49 works fine. Regards Gaetano Mendola #include <boost/optional.hpp> #include <boost/noncopyable.hpp> class B : boost::noncopyable { //if the noncopyable is removed works public: virtual size_t bar() const = 0; }; class D : public B { public: D() :theBar(foo(10)) { } virtual size_t bar() const { return theBar; } private: static size_t foo(const boost::optional<size_t> a) { if (a) { //if this is a.is_initialized() then it works return a.get(); } return 2; } const size_t theBar; }; class Foo { public: Foo(const B& b) :theBar(b.bar() * b.bar()) { } private: const size_t theBar; }; int main() { { //if this section is removed works D d; try { Foo myCompound(d); } catch(...) {} } { D d; try { Foo myCompound(d); } catch(...) {} } }

6 15

[mpi] New dedicated mailing list for Boost.MPI discussions
by Matthias Troyer 25 Nov '12

25 Nov '12

Dear all, We have created a new sub list boost-mpi(a)lists.boost.org for discussion of Boost.MPI development. Those interested can visit http://lists.boost.org/mailman/listinfo.cgi/boost-mpi to sign up. Best regards Matthias

2 2

[Numeric Conversion] Documentation Notes/Questions
by Dave Abrahams 25 Nov '12

25 Nov '12

* First thing to note: the documentation makes this library less approachable than it could be. In order to even begin, one has to bury onesself in terminology (the "Definitions" section). A super-quick "hello, world" example and a very short tutorial at the beginning would help a *lot*. numeric_cast is arguably the most generally-useful interface of the whole library and yet it's not even discussed until the end of the docs. * It's not clear what the purpose of abt(x) is. In expressions, "x" usually means its value. When you introduce a mechanism like this, it would be a good idea to explain why it's needed. Most places, the use of "abstract" just seems to complicate things: "A ulp is a quantity whose abstract magnitude" what's wrong with "A ulp is a quantity whose magnitude" ?? The end of the section on "Range and Precision" begins to explain why you want "abstract," but it takes the reader a long time to get to it. * are next() and prev() always well-defined? Seems to me that an unlimited precision rational number type might not have them. Is that type not numeric? * How do size, width, and density relate to unlimited precision rationals? I imagine: size = infinity width = infinity density = ? * This is slightly ambiguous: "This definition allows for a concise definition of subranged as given in the last section." "final section" would be clearer. A link would help too. * This is unclear: "Abstract intervals are easier to compare and overlap since only boundary values need to be considered." an example would help. How can one kind of thing be "easier to overlap" than another? * Precision has a very non-generic description, being different for types with density 1 and other types. It's hard to see what use such a concept has, and as far as Google can tell it is not used anywhere outside the Definitions section * Description of unsigned types, I think, is wrong: Notice that a numeric type, such as a C++ unsigned type, can define that any V does not overflow by always representing not V itself but the abstract value U = [ V % (abt(h)+1) ], which is always in range. Seems to me that the abstract values represented by an unsigned integer type are not the set of whole numbers, but the set of whole numbers modulo whatever-the-max+1-is. That's a well-defined mathematical abstraction, isn't it? Is there a problem with that, such as multiplication not working properly (I don't think so)? * There seems to be a contradiction here: If V >= abt(l) and V <= abt(h), V is representable (can be represented) in the type T ... Given an abstract value V represented in the type T as v, the roundoff error of the representation is the abstract difference: ( abt(v)-V). If V is not representable in type T, can you write formulae using its representation in type T? Given what I read later, maybe you should have just said "exactly representable" in the first phrase. * s/at most/less than/?: Because a correctly rounded representation is always one of adjacents of the abstract value being represented, the roundoff is guaranteed to be at most 1ulp. * s/cannot be represented/cannot be exactly represented/ ?: The integer number -1 can be exactly represented in Int, Real and Whole, but cannot be represented in Cardinal, yielding negative overflow. * Uh-oh: Floating to Floating conversions are defined only if N is representable; if it is not, the conversion has undefined behavior. in many places you've used "representable" to mean "exactly representable," but I can't believe you mean that here; it would imply most double=>float conversions have undefined behavior. What does this mean, anyway? If an abstract value can be "inexactly representable," aren't all abstract values representable if there's at least one abstract value that's exactly representable? Just convert to that and you're done. I think you need to give some serious thought to the definition of "representable." * s/then/so/: R(X) & R(Y) == R(X), then X->Y is not subranged. Thus, all values of type X are representable in the type Y. (b) Y->X: R(Y) & R(X) == R(Y), then Y->X is not subranged. Thus, all * What's the difference between a policy and a "parameter that defines the conversion" in It can optionally take some policies which can be used to customize its behavior. The Traits parameter is not a policy but the parameter that defines the conversion. ?? -- Dave Abrahams BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

4 4

[Review] Review results for Coroutines
by Hartmut Kaiser 24 Nov '12

24 Nov '12

All, The review for the Coroutines library written by Oliver Kowalke started September 3rd 2012, and ended on September 12th 2012. I counted 7 votes, none of which were NO. All authors votes YES, some made additional requests. Overall, the verdict of the community was clear: Oliver Kowalke's Coroutines library is ACCEPTED The discussion was lively and it touched on several points. Design ------ The Coroutines library offers enormous potential for programming regimes such as communications software and embedded systems design. Oliver selected a sensible granularity for his design. This granularity allows for fine-tuning the implementations of cooperative scheduling mechanisms while avoiding the prohibitively heavy weight of preemptive scheduling that is found in POSIX and often in implementations of the C++11 thread support library. In particular, the separation of Coroutines from Context allows for porting to other systems with minimal effort and maximum reliability and code re-use. Some suggestion related to the API have been made during the review, most of which (if not all) have already been addressed. Oliver has a full list of things and works on integrating the suggestions. Here is a short list: - allow to specify the allocator to use for memory allocations inside the library - remove 'self' pointer and replace with TLS - add symmetric coroutines API - better support for generator functionality Naming ------ Some of the people participating in the discussions suggested not to use the abbreviated 'namespace coro', but to use the full 'namespace coroutines' instead. This again is not a precondition for acceptance. Documentation ------------- The consensus of almost everybody referring to the documentation was that it is terse but readable and sufficient. People suggested to integrate the docs of the old Coroutines library (written as an GSoC project by Giovanni P. Deretta) into the documentation of the reviewed library. I would like to thank all who participated in the discussions. Regards Hartmut --------------- http://www.cct.lsu.edu/~hkaiser http://stellar.cct.lsu.edu http://boost-spirit.com

1 0

Re: [boost] Countertree
by Leo Goodstadt 23 Nov '12

23 Nov '12

> On Tue, 20 Nov 2012, Vadim Stadnik <vadimstdk(a)gmail.com> wrote: > > On Mon, Nov 19, 2012 at 9:02 PM, Leo Goodstadt <leo.goodstadt(a)llew.org.uk>wrote: > > 1) For counter trees, the median is just the N/2-th value in the > > counter tree, where K is the size of the tree. > > The Nth-percentile can be calculated similarly. > > A rolling median with a fixed size window requires there to be an > > insertion and deletion for each (most!) new value, so I am guessing > > it should run in O(N log K) time, where N = size of data, K = size of > > window > > > > IIUC, it is better to avoid modifying original data (size N), the rolling > window of size K can be represented by a multiset based on an augmented > tree. This method guarantees complexity of obtaining 1st median value for > O(K log K) operations, which is the cost of construction of the rolling > window, every subsequent median value can be obtained for O(log K) > operations, when the window rolls. This approach should be more efficient. > Oops. Careless editing made me mix up my Ks and Ns, hopeless confusing everyone. So given a large data set of size N and we want to calculate medians across a rolling window of size K, we only need to create a counter tree of size K (the window size). The median is the K/2 value in the tree. As you point out, the entire operation runs in O(N log K) time. All sensible approaches to calculating medians I can think of take O(N log K) time. The question comes down to what the constants are. The great advantage of a counter tree is that we are not limited to medians (the 50%ile value). We can collect for example, the values at 25%, 50%, and, 75%, and so on, at only marginally extra cost. I presume that most of the cost lies in balancing the tree after insertions/deletions and updating the counters. The only shortcut is the trivial optimisation that if the value entering the window is the same as the one being removed at the other end, then the median obviously stays the same. Leo

3 4

[coroutine] update for intel/clang
by Oliver Kowalke 23 Nov '12

23 Nov '12

The lib compiles with gcc, intel, clang (bug fixed), msvc and mingw (statically linked) on Windows. The fixed version of boost.coroutine is available at: http://ok73.funpic.de/boost-coroutine.zip. The documentation is updated too: http://ok73.funpic.de/boost/libs/coroutine/doc/html/index.html Oliver

1 0

Re: [boost] [website] bcp link broken
by Brian Wood 22 Nov '12

22 Nov '12

>>> bcp. Get taken nowhere. Any clues? TIA, >> >> Some googling found the page[*]. There, I read this: >> >> Copyright ? 2209 John Maddock >> >> Year 2209?! Great scott!!! Doc Emmett just called. He wants his DeLorean >> back. ;-) > > DeLorean? Man that's so last millenium :) > Maybe some are noticing a back to the future element in C++? -- Brian Ebenezer Enterprises http://webEbenezer.net (651) 251-9384

1 0

[preprocessor] Maybe a improvement of BOOST_PP_IS_EMPTY
by Zhenghui Zhou 22 Nov '12

22 Nov '12

As I known, the undocument interface BOOST_PP_IS_EMPTY is not a general implementation to condider emptiness. There is a undefined behaviours when token concatenation return a invalid preprocessing token. Particularly, gcc restriction reports error. For example: #include <boost/preprocessor/ facilities/is_empty.hpp> BOOST_PP_IS_EMPTY() /* result: 1 */ BOOST_PP_IS_EMPTY(a) /* result: 0 */ BOOST_PP_IS_EMPTY(+a) /* error report here, for '+' cannot be pasted */ Here is a work around, it hasnot been tested enough, but does do under gcc. #define MY_IS_EMPTY(a) BOOST_PP_EQUAL(BOOST_PP_SEQ_ SIZE(MY_IS_EMPTY_II(MY_IS_EMPTY_I(a))), 2) #define MY_IS_EMPTY_I(a) (BOOST_PP_CAT(MY_IS_EMPTY_I_, BOOST_PP_SEQ_SIZE(a))) ) #define MY_IS_EMPTY_I_0 MY_IS_EMPTY_I_HELPER BOOST_PP_LPAREN() #define MY_IS_EMPTY_I_HELPER(a) )a( /* when a is empty, my may get more sequence elements of boost proprocessor */ #define MY_IS_EMPTY_II(a) BOOST_PP_CAT(MY_IS_EMPTY_II_, BOOST_PP_SEQ_SIZE(a)) ) #define MY_IS_EMPTY_II_1 ( #define MY_IS_EMPTY_II_2 ()( It uses a intermadiate result of BOOST_PP_SEQ_SIZE with wrong parameters, as: BOOST_PP_SEQ_SIZE(a) => 0 a ... I think it maybe better to allow any concatenation tokens in the language itselft. It's hard to avoid such thing when taking the preprocessor as a MPL. I just reported it on comp.std.c, https://groups.google.com/forum/#!topic/comp.std.c/7rgt8k6ILMM. There are more things and problems I did and I met. Hope for more response.

3 4

[website] bcp link broken
by Eric Niebler 22 Nov '12

22 Nov '12

Go here: <http://www.boost.org/doc/tools.html>. Click on the link to bcp. Get taken nowhere. Any clues? TIA, -- Eric Niebler BoostPro Computing http://www.boostpro.com

4 4

[dynamic_bitset] expression template?
by Ben Coates 21 Nov '12

21 Nov '12

dynamic_bitset currently allocates temporary vectors for most operations, and all the allocating and deallocating can easily dominate the running time for a program that makes heavy use of them. You can work around some of it with careful use of named temporaries around loops but some operations like intersection of 3 sets ( (a & b & c).any() ) result in a lot of unwanted copies and allocations. I've had good results converting it to use expression templates for intermediary operations, with the outcome of being able to do arbitrary non-resizing operations without allocating. Is there any interest in changing the boost version to do this?

2 2

Should the clang, c++11 and libstdc++ configuration supported?
by Vicente J. Botet Escriba 21 Nov '12

21 Nov '12

Hi, clang compiler is not delivered with a C++11 standard library. When compiling on c++11 mode, some boost libraries (in particular, Boost.Thread, Boost.SmartPtr, Boost.Test) are expecting to have a C++11 standard library. This mean that the user needs to install the latest version of libc++. Could we state clearly in the release notes if the combination clang+ -std=c++11 + libstdc++ is not supported. Otherwise these libraries should update their code so that the user can use this combination. Best, Vicente

8 21

[stl_ext_adv] comparison with Boost.Container and string algorithms
by Vadim Stadnik 21 Nov '12

21 Nov '12

Hi all, In response to the previously made suggestion, I have added to the documentation the comparison of new proposed STL containers with Boost.Container. Please let me know if some of my statements concerning Boost.Container are incorrect, I will update the documentation. >From a user perspective an augmented array based B+ tree of the new library can be regarded as a segmented vector that offers several more efficient operations than std::vector: logarithmic time insertion, erasure, splice and split. One such data structure can support interfaces of all C++03 standard sequences and associative containers. This is why new containers offer a higher level of uniformity and generalization of the C++ standard containers. Unlike std::vector, the new array based containers do not have the problem of exponential storage growth and manual shrinking storage to the optimal capacity. The comparison section also includes simple tests of performance. One test shows the advantage of the wide set of efficient operations of new containers. None of the C++ standard and Boost containers can outperform new containers in the test with just two operations: move an iterator to a specified position and then insert a new element. The other test shows that new containers have good locality of reference. In sequential processing they perform much better than containers using dynamically allocated data structures. String algorithms The new sequence container that implements the union of interfaces of std::vector, std::list and std::deque is particularly beneficial for string algorithms. A container, such as std_ext_adv::sequence<char>, efficiently supports all main editing string operations: cut, copy, paste, delete, find, replace, etc. In terms of computational complexity this new container provides general and equally efficient support for both copy and move semantics operations. The move semantics functions splice() and split() can be used to replace inefficient copy semantics functions insert() and erase() to achieve significant performance improvements. The examples section and code shows how to concatenate two strings and extract a sub-string in logarithmic time using the move semantics functions. These operations do not require that user algorithms count moved characters. This functionality and efficiency are not possible with linked lists and basic search trees. The efficient calculation of statistical parameters and numerical integration in logarithmic time are the other practically important applications of the new containers. They are discussed in the examples section. Project (source code and documentation): https://github.com/vstadnik/stl_ext_adv_review Documentation: http://dl.dropbox.com/u/51041088/stl_ext_adv_review/doc/index.html Regards, Vadim Stadnik

1 0

Re: [boost] [Boost-build] [VxWorks] Updating boost/config/platform/vxworks.hpp for VxWorks 6.9
by Vicente J. Botet Escriba 20 Nov '12

20 Nov '12

Le 20/11/12 15:30, Brockamp, Peter a écrit : > Hello everybody, > > I'm new to the Boost.Build mailing list, so please forgive me any newbie > mistakes. I hope this is the right place for my post, if not please > redirect me to where it belongs! > I'm replied to the boost dev ML as most of the patches concern Boost.Config. > OK, some time ago I had to realize that the platform configuration for > VxWorks boost/config/platform/vxworks.hpp appears to be badly outdated > and doesn't work with the actual version 6.9. I started to modify this > platform header and after a while managed to get Boost compile and run > under VxWorks 6.9, at least as far as we use it here today. I could > offer to the community to update the existing header if this is desired > (I suppose it is). If so should I post the source code here or how to > proceed? Yep, a newbie question. You can start by creating a ticket on the Trac system https://svn.boost.org/trac/boost/newticket. You could add a patch associated with the ticket. > > My modifications surely aren't perfect/complete but it might be a fresh > start for this OS: > > - I have only tested it under RTP (Real Time Process) of VxWorks, not > DKM (Downloadable Kernel Module), due to lack of time. DKM has many > limitations compared to RTP, so this might cause problems! > > - Equally, due to time constraints, I tested GCC only, not the > diab-compiler, as we don't use it here. Same as above applies here, > problems might arise and I could not guarantee I might be able to fix > them. > > - And I tested x86 only, as we actually don't develop for ARM, etc. > > - I could test with V6.9 only, as we are not using the prior versions, > so maybe there will be other problems yet unknown. But at least I could > confirm that it is impossible to get Boost running under early versions > of VxWorks (V5.x and older). These versions are lacking a couple of > library functions required by Boost, they come with a library which is > partially non-ANSI-conforming (especially the STL) and the compiler (GCC > 2.96) is outdated beyond believe and lacks some functionality (mainly > template stuff) needed by Boost. So some OS-version checking scheme > would have to be added to vxworks.hpp, bailing out in case of obsolete, > unsupported versions. > > - A support guy from WRS (Wind River System) mentioned that they are > thinking of including Boost into their OS, so they might do some > adaption work in the future. But until now it doesn't appear to me > there's much activity from WRS, that's why I decided to offer what I > have done so far. > > - When compiling Boost for VxWorks I didn't use the build-system, as > VxWorks does a cross compile for the destination platform and I didn't > manage to figure out how to auto build this. Instead I manually pulled > all of Boost's files into a Workbench Project (Workbench is the eclipse > based IDE of VxWorks). So there would be some work left to get this up & > running as well. > > - My work is based mainly on modifying and supplementing most parts of > vxworks.hpp. Anyway, during the tests I did I stumbled upon some > problems in other files, e. g. caused by missing #ifdef's for VxWorks, > and even errors in a few of Boost's files, which I fixed as well. Should > all these fixes be posted here, or what's the right way to do it? > > > So, if you see some potential use in what I have done, despite the > incompleteness pictured above, please someone responsible mail me with > further instructions. > Best, Vicente

1 0

Boost.Thread 1.52 vs 1.51 - g++ 4.7.2
by Jose 20 Nov '12

20 Nov '12

When including thread.hpp (1.52) I get the error below. Same setup but Boost 1.51 works ok. Does anybody know what is the issue ? thanks # g++ -c test.cpp In file included from /usr/include/boost/thread.hpp:24:0, from test.cpp:1: /usr/include/boost/thread/future.hpp:139:26: error: expected ‘;’ at end of member declaration /usr/include/boost/thread/future.hpp:139:32: error: ‘BOOST_THREAD_NOEXCEPT_OR_THROW’ does not name a type /usr/include/boost/thread/future.hpp:139:19: error: looser throw specifier for ‘virtual const char* boost::future_error::what() const’ In file included from /usr/include/boost/thread/exceptions.hpp:21:0, from /usr/include/boost/thread/pthread/thread_data.hpp:10, from /usr/include/boost/thread/thread.hpp:17, from /usr/include/boost/thread.hpp:13, from test.cpp:1: /usr/lib/gcc/x86_64-redhat-linux/4.7.2/../../../../include/c++/4.7.2/stdexcept:70:5: error: overriding ‘virtual const char* std::logic_error::what() const throw ()’

2 1

Graph Algorithm Advice
by J Birch 20 Nov '12

20 Nov '12

This isn't a Boost Graph problem per se, just a graph algorithm question. Let's say I have the following graph: I want to represent this graph in a certain way. In the small legend box above, there are 2 versions of a correct answer. I want to print out each vertex followed by it's immediate adjacent vertex. If it has more than one, then each path from that point should be wrapped in a '()'. Currently, I am using the Ruby RGL package and have tried both a directed and an undirected graph using a depth first search traversal, and have yet to hit on an algorithm that takes every edge case. Anyone out there have some pointers on how to do this? Thanks! Birch

2 3

Failing to build Boost.Test library using Clang 3.1 on Netbeans
by Paul A. Bristow 20 Nov '12

20 Nov '12

Target: i686-w64-mingw32 Thread model: posix) (This is Ruben's mingw64 build) on Netbeans 7.2 on Windows 7. The compilation stage goes OK (but with many warnings In file included from i:/boost-trunk/libs/test/src/test_tools.cpp:16: In file included from i:/boost-trunk\boost/test/impl/test_tools.ipp:23: i:/boost-trunk\boost/test/tree/test_unit.hpp:164:7: warning: 'dllexport' attribute only applies to variables and functions class BOOST_TEST_DECL master_test_suite_t : public test_suite { ^ i:/boost-trunk\boost/test/detail/config.hpp:106:29: note: expanded from macro 'BOOST_TEST_DECL' # define BOOST_TEST_DECL BOOST_SYMBOL_EXPORT ^ i:/boost-trunk\boost/config/platform/win32.hpp:30:42: note: expanded from macro 'BOOST_SYMBOL_EXPORT' # define BOOST_SYMBOL_EXPORT __declspec(dllexport) ^ <built-in>:150:38: note: expanded from macro '__declspec' #define __declspec(a) __attribute__((a)) but the link stage to build the library fails with many Cannot export boost::test_tools::tt_detail::check_impl(boost::test_tools::predicate_result const&, boost::unit_test::lazy_ostream const&, boost::unit_test::basic_cstring<char const>, unsigned int, boost::test_tools::tt_detail::tool_level, boost::test_tools::tt_detail::check_type, unsigned int, ...): symbol not found (full output window message attached). I have also failed to build using bjam (missing <cstddef> so missing the right stdlib?) and I wonder if both these are connected with lack of a suitable boost/config.hpp which caters for Clang *on this configuration*. Where would/should __clang__ be defined in order to select this compiler? My user-config.jam contains (in an attempt to cure ) # Clang compiler using mingw32 dw2 Ruben's release. using clang : 3.1 : "C:/mingw32-dw2/bin/clang++.exe" : <cxxflags>-v <cxxflags>-std="c++11" <cflags>-nostdinc # Do not include MSVC C headers. #<cflag>-c-include-dirs=??? <cxxflags>-nostdinc++ # Do not include MSVC C++ headers. # Use mingw-dw2 for includes <cxxflags>-cxx-include-arch="C:/mingw32-dw2/i686-w64-mingw32" <cxxflags>-cxx-include-32bit-dir=32 <cxxflags>-cxx-include-root="C:/mingw32-dw2/include/c++/4.6.3" <cxxflags>-stdlib=libc++ #<compileflags>-std=gnu++11 #<define>BOOST_STDLIB_CONFIG="i:/boost-trunk/boost/config/stdlib/libstdcpp3.hpp" <linkflags>-stdlib=libc++ ; Any views on my woes? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

2 7

Re: [boost] Graph Algorithm Advice
by J Birch 19 Nov '12

19 Nov '12

Sorry, I had pasted it in the client. it is attached now. Thanks! Birch On Nov 19, 2012, at 5:03 PM, Jeremiah Willcock <jewillco(a)osl.iu.edu> wrote: > (off list) > > I don't see your attachment on there. > > -- Jeremiah Willcock > > On Mon, 19 Nov 2012, J Birch wrote: > >> This isn't a Boost Graph problem per se, just a graph algorithm question. Let's say I have the following graph: >> >> >> >> I want to represent this graph in a certain way. In the small legend box above, there are 2 versions of a correct answer. I want to print out each vertex followed by it's immediate adjacent vertex. If it has more than one, then each path from that point should be wrapped in a '()'. Currently, I am using the Ruby RGL package and have tried both a directed and an undirected graph using a depth first search traversal, and have yet to hit on an algorithm that takes every edge case. >> >> Anyone out there have some pointers on how to do this? >> >> Thanks! >> Birch >> >> _______________________________________________ >> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost >>

1 0

Re: [boost] Countertree
by Leo Goodstadt 19 Nov '12

19 Nov '12

On 17 November 2012 19:44, Francisco Jos? Tapia <fjtapia(a)gmail.com> wrote: > 2012/11/16 Vadim Stadnik <vadimstdk(a)gmail.com> > > On Sat, Nov 17, 2012 at 4:25 AM, Leo Goodstadt <leo.goodstadt(a)llew.org.uk wrote: > > > > > > Project location ( zip file with code and documentation) : > > > > https://dl.dropbox.com/u/8437476/works/countertree_code_doc.zip > > > > > > > > Quick view of documentation with code download : > > > > https://dl.dropbox.com/u/8437476/works/countertree/index.html > > > > > > > > This library is an implementation of a binary red-black counter tree. > > > > This tree have an additional counter in each leaf. This permit the access to > > > > the elements by the position, like in a vector. It is a random access > > > > container with random access iterators > > > > > > > > > Among other things, countertree would allow the boost Statistical > > > Accumulators Library to support rolling median and rolling quantiles > > > efficiently. This would be very useful. > > > > > > I had previously had to hack the tree class in the Policy-Based Data > > > Structures part of the gnu c++ library. > > > (see http://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/tree_order_statistics_nod… ) > > As far as I know, this support is not yet available in countertree project, > > although this is possible in principle. > > About the compatibility with the boost Statistical Accumulators Library, I > didn't thought about it, but it would be useful. I will try to implement, > but I need to examine in deep for to provide you a well founded opinion. > 1) For counter trees, the median is just the N/2-th value in the counter tree, where K is the size of the tree. The Nth-percentile can be calculated similarly. A rolling median with a fixed size window requires there to be an insertion and deletion for each (most!) new value, so I am guessing it should run in O(N log K) time, where N = size of data, K = size of window 2) The alternative is to use two multisets corresponding to values smaller and larger than the current median (or the Nth percentile). This should also have O(N log K) complexity. 3) With the special case where the data consists of integers in a fixed range, we can use a segment tree where the complexity would be O(N log R) where R = the size of the fixed range of data values. This can result in considerable speed ups. The best bit about counter trees are their flexibility, we can calculate multiple Nth-percentiles at the same time (e.g. all the quartiles). As to the actual rather than theoretical speed, I think we need bench-marking.... Leo

2 1

[boostcon12]Trouble with tuples very compiler dependent
by Larry Evans 19 Nov '12

19 Nov '12

This thread is a continuation of that started here: http://article.gmane.org/gmane.comp.lib.boost.devel/235427 It's been renamed because the new name is more topical. The tree_builder benchmarks mentioned here: http://article.gmane.org/gmane.comp.lib.boost.devel/235386 were refactored into: tuple_benchmark.tree_builder.cpp tuple_impl.bcon12_horizontal.hpp tuple_impl.bcon12_vertical.hpp and various other .hpp files. The benchmark was run as shown in the attached filt.compilation. The output after line: :filt_dr= shows with compiler=gcc4_8, the bcon12_horizontal implementation is slower than the bcon12_vertical. This agrees, at least qualitatively, with the page 12 bar chart from Eric's boostcon12 pdf file: trouble_with_tuples.pdf downloadable from here: https://github.com/boostcon/cppnow_presentations_2012/zipball/master and in the mon directory. The variadic bar in the pag12 bar chart corresponds to the: tuple_impl.bcon12_horizontal.hpp tuple implementation in the sandbox slim/test directory. The unrolled bar in the pag12 bar chart corresponds to the: tuple_impl.bcon12_vertical.hpp In contrast to the gcc4_8 compiler, with the clangxx compiler, the relative qualitative performance, is just the opposite. IOW, the bcon12_horizontal implementation is faster than the bcon12_vertical implementation. In fact, the rate of change of the performance difference accelerates as tree depth goes from 2 to 4. The rate of change is so stark that it suggests, at least to me, there may be some bug in clang. Of course that conclusion is based on almost no knowledge, on my part, of the clang implementation. The tuple_benchmark_filt.py can be modified to filter out other parts of the benchmark run output, which is here: http://svn.boost.org/svn/boost/sandbox/variadic_templates/sandbox/slim/test… In conclusion, whether it's best to use vertical or horizontal tuple implementation depends on the compiler. -regards, Larry

2 3

Build errors with msvc/release/pdb
by Christoph Macheiner 19 Nov '12

19 Nov '12

The following libraries generate errors when using msvc, building for release and generating the program debug database: date_time, locale, math (all), thread, wave. Except for math, this seems to be caused by having at least one directory specified in the /Fd option. Also, there are 251 .pdb files in the boost root directory instead of their respective output directory (presumably from serialization, unit_test, math, and most probably others). The command-line is: bjam link=shared runtime-link=shared variant=release --layout=system --stagedir=.\stage stage debug-symbols=on debug-store=database I am at a loss on how to fix this. Can someone help? On a related note, the .pdb files are automatically generated when building for debug. Is there an easy switch somewhere in the sources, so that I can turn this on globally also for release as a work-around? For reference, below is the output for the first file for each library, plus contents of the corresponding .rsp file Thanks, Christoph. ======================================== compile-c-c++ bin.v2\libs\date_time\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\gregorian\greg_month.obj greg_month.cpp libs\date_time\src\gregorian\greg_month.cpp : fatal error C1033: cannot open program database 'd:\dev\boost_1_52_0\gregorian\greg_month.pdb' call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\date_time\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\gregorian\greg_month.obj.rsp" ---------------------------------------- "libs\date_time\src\gregorian\greg_month.cpp" -Fo"bin.v2\libs\date_time\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\gregorian\greg_month.obj" /Fd"gregorian\greg_month.pdb" -TP /O2 /Zi /Ob2 /W3 /GR /MD /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_DYN_LINK=1 -DBOOST_ALL_NO_LIB=1 -DDATE_TIME_INLINE -DNDEBUG "-I." ======================================== compile-c-c++ bin.v2\libs\locale\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\encoding\codepage.obj codepage.cpp libs\locale\src\encoding\codepage.cpp : fatal error C1033: cannot open program database 'd:\dev\boost_1_52_0\encoding\codepage.pdb' call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\locale\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\encoding\codepage.obj.rsp" ---------------------------------------- "libs\locale\src\encoding\codepage.cpp" -Fo"bin.v2\libs\locale\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\encoding\codepage.obj" /Fd"encoding\codepage.pdb" -TP /O2 /Zi /Ob2 /W3 /GR /MD /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_NO_LIB=1 -DBOOST_LOCALE_DYN_LINK=1 -DBOOST_LOCALE_NO_POSIX_BACKEND=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_THREAD_NO_LIB=1 -DNDEBUG "-I." ======================================== compile-c-c++ bin.v2\libs\math\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\assoc_laguerre.obj assoc_laguerre.cpp libs\math\build\..\src\tr1\assoc_laguerre.cpp(6) : error C2858: command-line option 'program database name (/Fdd:\dev\boost_1_52_0\assoc_laguerre.pdb)' inconsistent with precompiled header, which used '/Fdd:\dev\boost_1_52_0\vc110.pdb' libs\math\build\..\src\tr1\assoc_laguerre.cpp(6) : error C2859: d:\dev\boost_1_52_0\assoc_laguerre.pdb is not the pdb file that was used when this precompiled header was created, recreate the precompiled header. call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\math\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\assoc_laguerre.obj.rsp" ---------------------------------------- "libs\math\build\..\src\tr1\assoc_laguerre.cpp" -Fo"bin.v2\libs\math\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\assoc_laguerre.obj" /Fd"assoc_laguerre.pdb" -Yu"pch.hpp" -Fp"bin.v2\libs\math\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\pch.pch" -TP /O2 /Zi /Ob2 /W3 /GR /MD /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_NO_LIB=1 -DBOOST_BUILD_PCH_ENABLED -DBOOST_MATH_TR1_DYN_LINK=1 -DNDEBUG "-I." "-Ilibs\math\src\tr1" ======================================== compile-c-c++ bin.v2\libs\thread\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\win32\thread.obj thread.cpp libs\thread\src\win32\thread.cpp : fatal error C1033: cannot open program database 'd:\dev\boost_1_52_0\win32\thread.pdb' call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\thread\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\win32\thread.obj.rsp" ---------------------------------------- "libs\thread\src\win32\thread.cpp" -Fo"bin.v2\libs\thread\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\win32\thread.obj" /Fd"win32\thread.pdb" -TP /O2 /Zi /Ob2 /W4 /GR /MD /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_SYSTEM_NO_DEPRECATED -DBOOST_THREAD_BUILD_DLL=1 -DBOOST_THREAD_DONT_USE_CHRONO -DBOOST_THREAD_THROW_IF_PRECONDITION_NOT_SATISFIED -DNDEBUG "-I." ======================================== compile-c-c++ bin.v2\libs\wave\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\cpplexer\re2clex\aq.obj aq.cpp libs\wave\src\cpplexer\re2clex\aq.cpp : fatal error C1033: cannot open program database 'd:\dev\boost_1_52_0\cpplexer\re2clex\aq.pdb' call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\wave\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\cpplexer\re2clex\aq.obj.rsp" ---------------------------------------- "libs\wave\src\cpplexer\re2clex\aq.cpp" -Fo"bin.v2\libs\wave\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\cpplexer\re2clex\aq.obj" /Fd"cpplexer\re2clex\aq.pdb" -TP /O2 /Zi /Ob2 /W3 /GR /MD /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_DYN_LINK=1 -DBOOST_ALL_NO_LIB=1 -DNDEBUG -D_CRT_SECURE_NO_DEPRECATE -D_SCL_SECURE_NO_DEPRECATE "-I." ========================================

2 1

User config commands needed to find Clang tools ar and ranlib
by Paul A. Bristow 19 Nov '12

19 Nov '12

I am trying to use the Clang compiler to build a Boost.Test library and have now found the necessary user-config.jam to select the compiler (thanks Jurgen Hunold) , but the link stage tools are not being found. Can anyone suggest what bjam incantation is needed ? Thanks Paul clang-linux.archive i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\th reading-multi\libboost_prg_exec_monitor-clang31-mt-sd-1_53.lib '"ar"' is not recognized as an internal or external command, operable program or batch file. '"ranlib"' is not recognized as an internal or external command, operable program or batch file. "ar" rc "i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\t hreading-multi\libboost_prg_exec_monitor-clang31-mt-sd-1_53.lib" "i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\t hreading-multi\execution_monitor.obj" "i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\t hreading-multi\debug.obj" "i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\t hreading-multi\cpp_main.obj" "ranlib" "i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\t hreading-multi\libboost_prg_exec_monitor-clang31-mt-sd-1_53.lib" ...failed clang-linux.archive i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\th reading-multi\libboost_prg_exec_monitor-clang31-mt-sd-1_53.lib... My user-config.jam contains using clang : #version 3.1 : # compiler "C:/mingw32-dw2/bin/clang++.exe" #"C:/mingw32-dw2/bin/ar.exe" <<<< actual locations of tools #"C:/mingw32-dw2/bin/ranlib.exe" <<<< actual locations of tools : # options <cxxflags>-v # verbose for testing. <cxxflags>-IC:/mingw32-dw2/include/c++/4.6.3 # for stdlib? #e:/dev/apps/mingw64/include/c++/4.7.2 <cxxflags>-IC:/mingw32-dw2/i686-w64-mingw32/include #e:/dev/apps/mingw64/include/c++/4.7.2/x86_64-w64-mingw32 # <cxxflags>-std="c++11" <root>"C:/mingw32-dw2/bin" # attempt to find the link tools ; --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

[container] Missing image
by Klaim - Joël Lamotte 19 Nov '12

19 Nov '12

Hi, I thought I pointed it already last year but there is at least one missing important image in the boost container documentation: http://www.boost.org/doc/libs/1_52_0/doc/html/container/non_standard_contai… Joel Lamotte

1 0