- Boost - lists.preview.boost.org

[boost-build] Android support
by Antony Polukhin 25 Mar '13

25 Mar '13

Greetings, There is a project at github, that has a series of patches for Android support. It contains android.jam and android.py files for bjam, and those files have Boost license https://github.com/MysticTreeGames/Boost-for-Android. Why don't we adopt those patches to boost trunk? This will help a lot of people, who use boost under Android. -- Best regards, Antony Polukhin

3 4

Re: [boost] License of endian and limits in Boost detail
by Phil Endecott 25 Mar '13

25 Mar '13

Philip Bennefall wrote: > For my project, I am trying to stick exclusively to the Boost Software > license. I wanted to use boost/cstdint.hpp, which pulls in a lot of > content (boost/config.hpp is the one that includes the most). Among > the things it includes I see boost/detail/endian.hpp and > boost/detail/limits.hpp. limits.hpp says: // Copyright 2001 John Maddock // Distributed under the Boost Software License, Version 1.0. (See accompany- // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) /* * Copyright (c) 1997 * Silicon Graphics Computer Systems, Inc. * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Silicon Graphics makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. */ Is John Maddock reading this? What is the story? Clearly it's not possible to take the SGI-licensed code and to re-license it under the Boost licence without either (a) getting permission or (b) knowing that the licences are compatible, which isn't true in this case in this direction. Has this really been broken for 12 years? Phil.

9 29

Boost compatibility with Interix
by Andrin K. Foster 25 Mar '13

25 Mar '13

Hello all, When including the boost libraries on a Windows XP SP3 machine via Interix v3.5 using gcc 3.4.6 I would receive a number of pre-compiler errors complaining that boost threads were "unavailable on this platform". I resolved this issue by prepending the following code to the first inclusion of a boost library: #ifdef ARCH_Interix // an internal definition # include <boost/config.hpp> # define BOOST_HAS_THREADS # define BOOST_HAS_PTHREADS #endif There must be a more eloquent way of setting the thread definitions for Interix from within files such as /boost/thread/detail/platform.hpp or boost/thread/detail/config.hpp but I'll leave that to the development teams prerogative. In any case, making the boost libraries comparable with Interix should not be overly complex. Please let me know if I can provide more information. Thanks, AKF

3 2

[system][filesystem] Could I merge ticket 7278 to release branch?
by Vicente J. Botet Escriba 24 Mar '13

24 Mar '13

Le 24/03/13 10:52, Boost C++ Libraries a écrit : > #7278: Add noexcept to conform with C++11 > -------------------------------+-------------------------------------------- > Reporter: viboes | Owner: bemandawes > Type: Feature Requests | Status: closed > Milestone: Boost 1.54.0 | Component: system > Version: Boost 1.51.0 | Severity: Problem > Resolution: fixed | Keywords: > -------------------------------+-------------------------------------------- > Changes (by viboes): > > * milestone: To Be Determined => Boost 1.54.0 > > > Comment: > > Could I merge this ticket to release branch? > > svn merge -c 81808 "^/trunk" > svn merge -c 83197 "^/trunk" > -- > Ticket URL:<https://svn.boost.org/trac/boost/ticket/7278#comment:8> P.S. Note that the ASIO part was already merged and adapted, so no change is needed. Best, Vicente

2 2

Contributing to Boost
by Sathyam Vellal 24 Mar '13

24 Mar '13

Hello. I'm Sathyam, an undergraduate student pursuing B.E. in Computer Science. I've always liked C++ and would really be a wonderful experience for me to contribute to this community! I'm very keen on addressing the challenges listed for the Boost Graph library, presented in Boost Graph Library challenges ( http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/challenge.html) I'd be glad if you could guide me on how to proceed contributing to this community. Thank you -- Sathyam M Vellal, Computer Science and Engineering, P.E.S. Institute of Technology, Bangalore, India

5 5

[multi-array] compiler errors with visual studio 2012
by nfarnsworth＠web.de 23 Mar '13

23 Mar '13

Hello, have this c++ example which compiles with Visual Studio 2010 but with Visual Studio 2012 I got this compiler errors: 1>------ Build started: Project: MultiArrayDemo, Configuration: Debug Win32 ------ 1> MultiArrayDemo.cpp 1>d:\sandbox\multiarraydemo\multiarraydemo\multiarraydemo.cpp(11):error C2059: syntax error : '<' 1> d:\sandbox\multiarraydemo\multiarraydemo\multiarraydemo.cpp(25) : see reference to class template instantiation 'Data<T>' being compiled 1>d:\sandbox\multiarraydemo\multiarraydemo\multiarraydemo.cpp(11):error C2238: unexpected token(s) preceding ';' ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== The example uses the boost 1.53 version. Here is the example code: #include "stdafx.h" #include <boost/multi_array.hpp> const int rows = 3; const int cols = 5; template<class T> struct Data { typedef boost::multi_array<T,2> data_type; typedef typename data_type::array_view<1>::type view_type; //here is the first error typedef typename data_type::index_range range; Data() :A(boost::extents[rows][cols]) { double tmp[] = {1.0,2.0,3.0,4.0,5.0,6.0,7.0,8.0,9.0,10.0,11.0,12.0,13.0,14.0,15.0}; A.assign(tmp,tmp+ (rows * cols)); } data_type A; }; int _tmain(int argc, _TCHAR* argv[]) { Data<double>* data = new Data<double>(); Data<double>::view_type myView = data->A[boost::indices[0][Data<double>::range()]]; delete data; return 0; } Does anybody know how to solve this problem? Best regards and thank you in advance Niklas

1 0

[gil] GIL_FORCEINLINE replaced with BOOST_FORCEINLINE?
by Mateusz Loskot 22 Mar '13

22 Mar '13

Hi, In boost/gil/gil_config.hpp, there is GIL_FORCEINLINE defined, but there is no easy way to undef/redefine it. Would it be a good idea to replace GIL_FORCEINLINE with BOOST_FORCEINLINE defined in boost/config/suffix.hpp? Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

4 6

Re: [boost] GSOC 2013
by Gottlob Frege 22 Mar '13

22 Mar '13

On Mon, Mar 4, 2013 at 10:42 AM, Mateusz Loskot <mateusz(a)loskot.net> wrote: > On 4 March 2013 15:28, David Bellot <david.bellot(a)gmail.com> wrote: > > The best thing is that you guys write a nice description on the web page > for > > students to know about it. > > So far, we already 3 of them. Great ! > > It may look overwhelming for students too. > As it has been pointed already, few projects that qualify to Boost > are actually feasible within GSoC time frame. > > Something feasible could possibly be done with moving pieces of Adobe's ASL into Boost. http://stlab.adobe.com/index.html Sean Parent has always encouraged Boost to take whatever they wanted from ASL. Tony

4 4

[thread] boost::async and launch::deferred - Runtime Error + PATCH
by Fernando Pelliccioni 22 Mar '13

22 Mar '13

Hi Vicente, hi all, The following code snippet throws an exception at runtime boost::future<int> f1 = boost::async( boost::launch::deferred, []() { return 123; }); int x= f1.get(); //exception thrown I am using Boost Trunk revision 83512 I attached a patch, but I'm not sure that's correct, I had no time to see the full future.hpp code I noticed that according to N3558, the future::is_ready() function should be called "ready". http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2013/n3558.pdf What do you think? Thanks and regards, Fernando.

2 2

Abstract STL Container Adaptors
by Andy Jost 21 Mar '13

21 Mar '13

Hi Boosters, Is there any interest in an abstract container adaptor library (I'll describe what I mean below)? I'm a little surprised if this has never come up in the context of Boost, but I couldn't find anything on the archives. I did find something on stack overflow (http://stackoverflow.com/questions/5329555/abstract-wrapper-for-stl-contain…) but it did not uncover an existing solution. Motivation: Sometimes we want to write functions that take a container as an argument. For instance, say I have a graph object implemented in terms of ``class Node``. I may expose an algorithm like this: void my_algorithm(Node & root, std::set<Node const *> const & marked); In this case, ``root`` is the root of a graph, and ``marked`` is a set of marked nodes. The problem with this approach is that it forces a particular choice of the set implementation onto the caller. He may, for example, prefer to use ``tr1::unordered_set``. We could get around that limitation by using a template parameter, like this: template<typename Set> void my_algorithm(Node & root, Set const & marked); The problem here is that it forces the implementer of ``my_algorithm`` to expose that code and, potentially, recompile it many times (for different Set types). In some cases, particularly when compile times are more critical than execution times, it would be preferable to let the caller choose the set implementation without losing the advantages of separate compilation. A simple solution is to write an adaptor that mimics the interface of ``set``. With that, the function call would appear as shown here: void my_algorithm(Node & root, abstract_set<Node const *> const & marked); Here, abstract_set<Node const *> is implicitly convertible from any type having the interface of std::set<Node const *>. It internally holds a reference to some implementation of a suitable set-like object and mediates interactions with the outside world through virtual methods. It seems the implementation of this would be a straightforward application of type erasure. It seems too easy, in fact, which makes me wonder whether I'm missing something. In any case, is this a good idea? -Andy

15 34

Re: [boost] [config] consexpr workaround
by Krzysztof Czainski 21 Mar '13

21 Mar '13

2010/11/13 vicente.botet <vicente.botet(a)wanadoo.fr> > Hi, > > in order to make easier the introduction of constexpr in a portable way I > would like we add a Boost Config workarround. We can define some macros > depending on whether BOOST_NO_CONSTEXPR is defined or not. > > #if defined(BOOST_NO_CONSTEXPR) > #define BOOST_CONSTEXPR > #define BOOST_CONSTEXPR_OR_CONST const > #else > #define BOOST_CONSTEXPR constexpr > #define BOOST_CONSTEXPR_OR_CONST constexpr > #endif > Hi, Could/should BOOST_CONSTEXPR expand to inline in C++03? If not, could a macro BOOST_CONSTEXPR_OR_INLINE be added? For one thing, constexpr functions are usually (but maybe not always?) good candidates for inlines. But also please consider the following example. Suppose we put the following code in a header file: struct X { BOOST_CONSTEXPR int fun() const; }; BOOST_CONSTEXPR int X::fun() const { return 0; } Now if this file is included in multiple .cpp files, this will fail at link time in C++03 with message "multiple definition of `X::fun()", and it will link fine in C++11. But when BOOST_CONSTEXPR is inline in C++03, the above works. Would making BOOST_CONSTEXPR expand to inline in C++03 do any harm? Cheers, Kris

3 9

Re: [boost] GSOC 2013
by Boris Schaeling 21 Mar '13

21 Mar '13

On Wed, 27 Feb 2013 11:59:31 +0100, David Bellot <david.bellot(a)gmail.com> wrote: > Only 2 projects have been proposed so far for GSOC 2013: wake up Boost ! > > https://svn.boost.org/trac/boost/wiki/SoC2013 Google has started to accept applications from mentoring organizations. I'll have to submit our application in the coming days. If you want Boost to become a mentoring organization for GSoC 2013, please add projects to https://svn.boost.org/trac/boost/wiki/SoC2013 now! Boris

5 5

[container][intrusive] Treap for Boost.Container?
by Phil Endecott 20 Mar '13

20 Mar '13

Dear All, I have been playing with boost::intrusive::treap, and it seems like a useful thing. I think it would be helpful to create a boost::container::treap, i.e. a non-intrusive treap container, implemented using the intrusive version. That could make this useful data structure available to users who wouldn't otherwise need to learn how to use Boost.Intrusive. (While I'm here.... does anyone know about a list-like container that has lower memory overhead when the data type is small, i.e. ints or chars? I was considering something using chunks like a std::list< std::vector<T> >, but insertion would invalidate other iterators in the same chunk, which is unacceptable. Any ideas?) Regards, Phil.

4 3

[units] c++11 features to speed up compilation times
by Oliver Esser 20 Mar '13

20 Mar '13

Hi, I was wondering if there was a policy for boost including C++11 features into the libraries. Obviously there might be many projects out there that do not (yet) have access to a compiler implementing the new standard or choosing not to use such a compiler. Anyways I was looking for a dimensional analysis library for compile time units checking and found Boost.Units to be quite slow at compile time even for the relatively small example code in the quickstart documentation. So I've written a bit of code that follows the approach of Boost.Units but uses C++11 features (constexpr, variadic templates, suffix operator, auto). It is not a complete library that I would use in a production environment, but it looks promising, since compilation times are about a factor 2-3 faster on my machine. It would be great if some of you could take a look. https://github.com/legento/units Maybe one could add an implementation like that to Boost.Units as a C++11 compiler detected feature to speed things up. Maybe I am totally wrong and it is some coincidence that this compiles faster on my platform. I did just minimalistic 'ok it seems to work' testing and was about as thorough with measurements. So see this as an implementation sketch. Regards Oliver

3 2

C++Now 2013 is full [ 53 days before the conference ]
by Marshall Clow 19 Mar '13

19 Mar '13

Whoa. In the immortal words of W.C. Fields, "I expected this, but not so soon" We've set up a wait list in case we get any cancellations. -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

1 0

Re: [boost] [range][iterator] contiguous iterators
by Stefan Strasser 19 Mar '13

19 Mar '13

From [boost-users]: Am 18.03.2013 16:06, schrieb Jeffrey Lee Hellrung, Jr.: > On Sat, Mar 16, 2013 at 7:42 AM, Stefan Strasser <strasser(a)uni-bremen.de > is there any way to generically determine at compiletime whether an > iterator or a boost range refers to contiguous memory? > > is_contiguous<T *>::value == true > is_contiguous<vector<T>::iterator>::value == true > is_contiguous<std::list<T>::iterator>::value == false > AFAIK, not presently, but this has been discussed quite a bit in several > past threads on the Boost developers list. Then I'd like to suggest this again to the maintainers of Boost.Iterator and Boost.Range. I'd also like to suggest another addition to Boost.Range: a RangeOutputIterator, i.e. an OutputIterator that doesn't only accept single values, but assignment of ranges: template<class RangeOutputIterator> ... (...RangeOutputIterator out){ *out=range; where range can be any Boost.Range. You can find an implementation of this concept here, in the form of an back insert iterator that can insert entire ranges into a vector: http://pastebin.com/9M5rPDh9 Using these two things together can make generic algorithms as efficient as is possible, e.g. if the container that is being written to is a vector and the value type is a POD, there's one call to std::memcpy. think e.g. about file or database operations like database.get(1024*1024,out); This is in my "namespace detail" right now and I'd be willing to help make it public and document it. Stefan

2 8

Idea for O(1) hash-table
by Rani Sharoni 19 Mar '13

19 Mar '13

Hi All, I hope that you will find the following idea interesting. I have been using hash-table with, AFAICT, unique implementation and I thought that it might be handy for boost. The hash table is O(1) *non-amortized* lookup via extremely balanced buckets (for example, max 6 entries per bucket). The implementation itself is absurdly simple ;-) The hash-table is basically variation of linear addressing using double-hashing hash-table with special re-insert strategy. Algorithm for linear addressing (easy to adjust for chained hashing): Consider a two dimensional N*K array – N buckets with up to K elements per bucket. Assume that the zero-key is marking an empty entry. Lookup(key): for (hash = key, I = 0 ; I < K ;++i) { hash = HASH(hash); // double-hashing if (A[hash % N][i] == key) return found; } return not-found; Insert(key): for (hash = key, I = 0 ; I < K ;++i) { hash = HASH(hash); // double-hashing if (A[hash % N][i] == 0) { A[hash % N][i] = key; return true; } } return false; The above insert is basically a bounded double-hashing and as-is it has a low utilization (a bit similar to bloom filter). For example, for 100K buckets and K=6 - insert will fail when the table has less than 50% utilization (i.e. fail to insert though most entries are empty). The trick is to perform “re-insert”: Pick some random element, key1, from failed insert phase, replace it with the new key, and (re) Insert(key1). Retrying up to, say, 12 rounds of re-insert improves the utilization, of N=100K/K=6, to ~97%! Table resize is done (if needed) when such repetitive re-insert fails. Altogether this implementation trade-off insert for fast lookup which is very appealing to caches (i.e. insert done in the expensive path - only after a cache miss). Just for comparison, hash-table using naïve liner probing (A[HASH(key)%N][i]) has only ~80% utilization even when using K=128 (i.e. deep buckets)! Such unbalanced behavior is also typical classical hash-tables with link-lists (chained-hashing) since statistically some buckets will outgrow the average. The performance of the classic double-hashing algorithm itself is quite poor when the table is highly utilize since many steps are required to find empty entries. Though this hash-table is general purposed it has some interesting properties: 1) O(1) non-amortized with very low chance for collisions (each key has its own unique “virtual” bucket). 2) Can be implemented on continuous memory without pointers and with excellent utilization 3) Allow wait free implementation of caches (i.e. no lock or even interlocked needed). 4) Allow caches on shared memory – corruption safe/hazard algorithm (assuming at least 64 bit keys). 5) Allow persistent using direct memory to file mapping (i.e. disk representation is same as in-memory one). 6) Average 50% LRU eviction for caches (i.e. on average entry half from the oldest is evicted) BTW – there is little chance for patenting this algorithm since I already published similar idea in the public domain ;-) Thanks, Rani

4 4

[math] Extended float in C++ : Was : Support for libquadmath/ __float128
by Christopher Kormanyos 19 Mar '13

19 Mar '13

There has been some recent discussion on extended floating-point types in C++. >>> So the only way to add Q or q suffixes would be to find a way to query >>> the environment if it is supported. I wonder if GCC with >>> --enable-libquadmath has a kind of query for this. >> I haven't found one - gcc-4.7.2 has all sorts of __SIZEOF_XXX__ >> defines for every last type *except* >> __float128 and __float80 :-( > It won't help now, but is 'more precise types' an issue to > raise with WG21 for the next C++ standard? > Or is Multiprecision the way to go? Is there any definitive interest in adding more precise floating-point types to C++ in the next draft? Here, I am talking about floating-point types with fixed precision such as 24, 54, 113 or more binary digits, and possibly even extending beyond these to potential multiprecision types. See also Boost.Multiprecision. Consider the C language in ISO/IEC 9899:2011 (in other words C11). Extended precision is not specified, but there is a remark in Section 6.11.1: "Future standardization may include additional floating-point types, including those with greater range, precision, or both than long double." Recent specification of fixed-size integer types in C99, C11 and C++11 has drastically improved integer algorithm portability and range. Similar specification of fixed-size floating-point types could potentially improve the C++ language significantly, especially in the scientific and engineering communities. One could envision two ways to go: * Types such as float24_t, float53_t, float113_t, ... * Types such as float32_t, float64_t, float128_t, ...The first set above is intuitively coined from IEE754:2008. It is also consistent with the gist of std::uint32_t, et al --- in so far as the number of binary digits of precision is contained within the name of the data type. Is there any interest in committing to this project? Specification takes a long time and requires a coalition of collaborators. I could potentially contribute to this project as a subordinate author. But I don't feel confident enough to champion such a cause. Best regards, Chris.

2 1

Libaries accepted by not in Boost release yet - suitable for GSoC?
by Paul A. Bristow 19 Mar '13

19 Mar '13

I note there are some libraries that have been accepted but are not yet in a Boost release - and development seems to be stalled. This seems unfortunate - much effect from many people has gone into the whole process but we are not quite there yet - so a lot of work may be wasted? No doubt authors have other more pressing priorities J I spotted "Constrained value" and "endian" for example. Are any accepted but unfinished libraries suitable for Google Summer of Code students - with the task being to knock them into final shape? Is anyone willing to mentor these? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

5 5

[local_function] End scope function name declaration makes code hard to read.
by Mostafa 18 Mar '13

18 Mar '13

(This is a feature request/inquiry.) I'm just now seriously starting to use local_function, and I'm finding that having to "visually parse" until the end of scope to determine the local function name makes the code much harder to read. Is it possible to declare the function name at the beginning of the scope? (I don't mind having to also register the function name at the end of the scope.) Something like: BLF2(add, (int), (int lhs, int rhs)) { return lhs + rhs; } BLF2_REGISTER(add); Having said, I don't see why needing an "ending macro" for the local function scope is a requirement (albeit my understanding of the library internals is limited to implementation annex of the documentation). Can't the start macro just expand to something like: //----------------------------- //Macro Generated Output Start. //----------------------------- //Local class definition. //Local class instance registration. //Out of class method definition starts here: inline void local_add::body(int& sum, const int& factor, const int& num) //----------------------------- //Macro Generated Output End. //----------------------------- //User generated content starts here: { return lhs + rhs; } Thanks, Mostafa

4 8

[docs] How to install boost documentation?
by Mostafa 18 Mar '13

18 Mar '13

I'm having a real hard time trying to figure out how to install boost documentation. Can't find any instructions on boost.org nor any on google. Am I missing something really obvious?

2 3

[gil] Pixel arithmetic operations.
by Harg Tholan 18 Mar '13

18 Mar '13

Hi, Has it ever been considered to overload arithmetic operators for "pixel"? In many situations it may be useful to add, sub or divide the value of two or more pixels. Thanks.

2 1

Re: [boost] [gil] What is the status of the Gil extension numeric?
by Krzysztof Czainski 18 Mar '13

18 Mar '13

2013/2/21 Krzysztof Czainski <1czajnik(a)gmail.com> > Hello, > > During my first steps wit Boost.Gil I bumped onto an example [1], that > uses the numeric extension. For this extension, the the example [1] and a > ling from Boost.Gil docs [4] point to [2], where I couldn't find any Gil > extensions to download. Most Google links pointed to the same page, but I > finally found [3]. > > So my questions are: > a) Is there a plan to add the extension numeric to Boost? > b) Is [3] the newest version? And could the Boost.Gil docs be updated to > point to the right place? > c) I corrected a few bugs in boost/gil/extension/numeric/sampler.hpp -- is > this list the right place to discuss modifications to the numeric extension? > > Regards, > Kris > > [1] http://www.boost.org/doc/libs/1_53_0/libs/gil/example/resize.cpp > [2] http://opensource.adobe.com/gil > [3] http://code.google.com/p/gil-contributions/ > [4] http://www.boost.org/doc/libs/1_53_0/libs/gil/doc/index.html > Hello, Any word about above questions? Regards, Kris

3 14

[test] Any dependency on Boost.Test requires C++11 ?
by John Maddock 18 Mar '13

18 Mar '13

At present any test in Boost.Math that depends on Boost.Test fails for GCC prior to 4.5 because the build script for Boost.Test has: <toolset>gcc:<cxxflags>-std=gnu++0x Is this really required? It looks wrong headed to me: * We already have testers that test both C++03 and C++11 modes - so we don't need this to test C++11 support. * It's presence makes testing gcc in C++03 mode impossible if the library uses Boost.Test - so there may be C++03 breakages that we don't know about because of this. * As mentioned above, this is a hard error for GCC prior to 4.5, so those compilers can't be tested either. Can this be safely removed? Many thanks, John.

4 4

[boost.thread] Documentation code error
by Philip Bennefall 16 Mar '13

16 Mar '13

Hello, In the chapter about synchronization in the boost.thread documentation, where the hello world example with the bank account is being shown, I see a small problem in the class: int GetBalance() { mtx_.lock(); int b = balance_; mtx_.unlock(); return balance_; } I believe it should be: int GetBalance() { mtx_.lock(); int b = balance_; mtx_.unlock(); return b; } Kind regards, Philip Bennefall

1 0

Re: [boost] Help in setupping regression tests on ARM
by Antony Polukhin 16 Mar '13

16 Mar '13

Now it fails with the following error: # Running Boost.Build tests # Using bjam binary in '/home/pi/boost_maintain/run_trunk/tools_bjam/bin.linuxarm' # Getting test case results out of "/home/pi/boost_maintain/run_trunk/results/bjam.log"... terminate called after throwing an instance of 'std::runtime_error' what(): locale::facet::_S_create_c_locale name not valid Aborted Traceback (most recent call last): File "run.py", line 60, in <module> runner(root) File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 205, in __init__ self.main() File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 566, in main getattr(self,action_m)() File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 531, in command_regression self.command_test() File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 333, in command_test self.command_test_process() File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 393, in command_test_process self.regression_log ) File "/home/pi/boost_maintain/run_trunk/tools_regression/xsl_reports/utils/checked_system.py", line 21, in checked_system raise Exception( 'Command sequence "%s" failed with return code %d' % ( commands, rc ) ) Exception: Command sequence "['"/home/pi/boost_maintain/run_trunk/tools_regression/build/bin/gcc-4.6/release/process_jam_log" "/home/pi/boost_maintain/run_trunk/results" <"/home/pi/boost_maintain/run_trunk/results/bjam.log"']" failed with return code 34304 Any ideas how to fix it? -- Best regards, Antony Polukhin

1 1

[detail][lightweight_test.hpp] Proposal to add BOOST_TEST_THROWS to boost/detail/lightweight_test.hpp
by Ion Gaztañaga 16 Mar '13

16 Mar '13

Hi, In my tests I use boost/detail/lightweight_test.hpp as it has nearly all I need to test my libraries with very little overhead. However I needed a simple utility to check if an expression throws an exception and I think it can be added to this header with very little code. See attached patch. Do you find this a good idea? Ok to commit? Best, Ion

4 8

comparing-the-c-standard-and-boost
by Neal Becker 15 Mar '13

15 Mar '13

http://slashdot.org/topic/bi/comparing-the-c-standard-and-boost/

1 0

Re: [boost] [type_traits] Some traits are missing
by Antony Polukhin 15 Mar '13

15 Mar '13

2013/2/28 John Maddock <boost.regex(a)virgin.net>: >> I've created ticket https://svn.boost.org/trac/boost/ticket/8189 >> I can take care of it, so may I commit to trunk to type_triats directly? > > > OK sure, go for it. All the regression tests passed well, documentation updated. Boost.Variant was moved to new type trait and works well (not committed to trunk yet). If all the changes are OK, please merge type traits it to release branch and close #8189. -- Best regards, Antony Polukhin

2 2

Re: [boost] "Re: boost_svn_expor"
by DongInn Kim 15 Mar '13

15 Mar '13

Hi Rene, I am sorry for answering late. I did not know that I disabled receiving the boost mails. > It runs as part of the testing process if a tester has configured things to > not use the svn client directly. Disabling it causes some testers to stop > working. I don't know what the problem is with the cpu usage though as it > should be a rarely executed program as there are a small number of testers > and this would run only a small number of times in a day. > > On Wed, Mar 13, 2013 at 3:37 PM, DongInn Kim <dikim_at_[hidden]> wrote: > > I disabled the script /home/grafik/ > > www.boost.org/boost_svn_export_archive.sh for now. I have no idea what > > invokes the script but it seems that I could not find any troubles with the > > disabled script. > > > > Please let me know if you find anything wrong with the boost web services > > including the svn service. > > > > Regards, > > > > -- > > - DongInn > > > Can you tell me exactly what your test program does? It clearly invoked 4 or 5 apache processes which used almost all the resources. Does it create the 4 ~ 5 apache processes whenever you run the test program? Did you or your cronjob run it at that time? How could it run? Regards, -- - DongInn

2 1

Review Wizard Status Report for March 2013
by Ronald Garcia 14 Mar '13

14 Mar '13

============================================== Review Wizard Status Report for March 2013 ============================================== News ==== 1. Boost 1.52.0 Released. No New Libraries. 2. Boost 1.53.0 Released. New Libraries: Atomic, Coroutine, Lockfree, Multiprecision, Odeint. Open Issues =========== The following libraries have review managers, but have not yet been scheduled for review: * Range Extensions - added May 2012; review manager: Neil Groves. The following libraries have been reviewed and await reports from their review managers: * Predef - reviewed February 2012; review manager: Joel Falcou. The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * Constrained Value - accepted September 2010; author: Robert Kawulak. * GIL.IO - accepted January 2011; author: Christian Henning. * Contract - accepted September 2012; author: Lorenzo Caminiti. The following libraries have been accepted and submitted to SVN, but have not yet appeared in a release: * Type Traits Introspection - accepted August 2011; author: Edward Diener. * Type Erasure - accepted August 2012; author: Steven Watanabe The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Endian - accepted provisionally November 2011; author: Beman Dawes. * Log - accepted provisionally March 2010; author: Andrey Semashev. General Announcements ===================== As always, we need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot cmu dot edu" and "phillips at pacific dot mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Pimpl (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Variadic Macro Data (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Range Extensions * Nowide (M) * Array (M) * TypeIndex (M) * STL Extensions (M) * Countertree (M) * Process (M) ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: https://github.com/boost-vault/Miscellaneous/blob/master/Pimpl.zip :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: https://github.com/boost-vault/Sorting :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Variadic Macro Data ------------------- :Author: Edward Diener :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__ :Description: This library adds support and functionality for variadic macros to Boost as well as integrating variadic macros with the Boost PP library without changing the latter library in any way. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/block_ptr/ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Singularity ----------- :Author: Ben Robinson :Review Manager: Needed :Download: https://github.com/cppmaven/Singularity :Description: The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. Extended Complex Numbers ------------------------ :Author: Matthieu Schaller :Review Manager: Needed :Download: http://code.google.com/p/cpp-imaginary-numbers/ :Description: The library is an extension of the std::complex class addressing two issues: 1. The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. 2. Some calculation where pure imaginary numbers (i.e. multiples of sqrt(-1)) appear are unnecessarily slowed down due to the lack of support for these numbers. The code I submit contains two interleaved classes boost::complex and boost::imaginary which can be instantiated with any type T provided T overloads the usual arithmetic operators and some basic (real) mathematical functions depending on which complex function will be used. It is thus an extended version of Thorsten Ottosen's n1869 proposal (http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1869.html) Metaparse --------- :Author: Abel Sinkovics :Review Manager: Needed :Download: http://abel.web.elte.hu/metaparse/metaparse.zip :Description: Metaparse is a library for constructing parsers parsing at compile-time based on template metaprogramming. The parsers built with the library take boost::mpl::strings as input and can produce - types - objects (types with public static members) - callable C++ functions (types with public static method) - template metafunction classes as output (based on the input being parsed). On compilers supporting constexpr the library provides the following syntactic sugar for writing the input of the parsers: BOOST_STRING("this is a string") The library can be used for implementing DSLs in C++, including DSLs making C++ template metaprogramming easier (see examples). Range Extensions ---------------- :Author: Akira Takahashi :Review Manager: Neil Groves :Download: https://github.com/faithandbrave/OvenToBoost :Description: This project adds some features of the Oven Range Library to Boost.Range. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Nowide ------ :Author: Artyom Beilis :Review Manager: Needed :Download: http://cppcms.com/files/nowide/ :Description: This library makes cross platform Unicode aware programming easier. It provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. Array ----- :Author: Brian Smith :Review Manager: Needed :Download: https://github.com/BrianJSmith/Array :Description: The array class is a C++11 compatible implementation of static multidimensional arrays. TypeIndex --------- :Author: Antony Polukhin :Review Manager: Needed :Download: https://github.com/apolukhin/type_index :Description: TypeIndex is an extended C++11 type_index library, that * works with disabled RTTI * can store const-volatile-reference info about types (if user requested it) * has all the functionality of std::type_index * has portable across compilers and platforms functionality for getting demangled type names * works across modules/shared libraries * does not require C++11 to work STL Extensions -------------- :Author: Vadim Stadnik :Review Manager: Needed :Download: https://github.com/vstadnik/stl_ext_adv_review :Description: The proposed library [stl_ext_adv] offers augmented array based B+ trees and STL containers that support the interfaces of the C++03 sequences and associative containers. The library offers a number of extensions and performance improvements that are not available in C++03 and C++11 standard containers. Countertree ----------- :Author: Francisco Jose Tapia :Review Manager: Needed :Download: https://dl.dropbox.com/u/8437476/works/countertree_code_doc.zip :Description: 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. COUNTERTREE This kind of trees 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. With unordered information we have a vector with the same speed inserting and deleting in any position (O(log N)). With ordered information, we have the classes set, multiset, map and multimap, with identical interface than the STL classes, with the plus of access to the elements by position, like in a vector. The iterators are random access , and you can subtract them. SUBALLOCATOR The suballocator is a layer between the allocator and the data structures, compatible with any allocator with the STL definition. The suballocator replace to the allocator in the allocation of equal size elements. It provides speed, return the unused memory and decrease the memory used by the program and improve the cache performance due to the data locality improvement ( 30% of improvement of speed respect the std::allocator with GCC 4.7) Process ------- :Author: Boris Schaeling :Download: http://www.highscore.de/boost/process0.5/process.zip :Description: Boost.Process is a library to manage system processes. It can be used to: * create child processes * setup streams for child processes * communicate with child processes through streams (synchronously or asynchronously) * wait for processes to exit (synchronously or asynchronously) * terminate processes Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

Re: [boost] [support.osuosl.org #20948] Transition of Boost's bug tracking system
by DongInn Kim 14 Mar '13

14 Mar '13

Hi Olaf, Thanks for the update. I have never heard about transitioning from SVN to Git on the boost server machine. I am wondering how the transition could happen without the sysadmin's access though. To the boost group people, do you have any specific plan for this transition? Regards, -- - DongInn On Mar 14, 2013, at 12:04 PM, Olaf van der Spek <ml(a)vdspek.org> wrote: > Hi, > > AFAIK Boost is currently transitioning to Git for version control. I > hit some roadblocks when trying the conversions of Trac to Chili or > Redmine and thought it'd be better to wait until the transition to Git > is complete. > Simplest thing to do might be to move Trac without conversion to the > new host if the old server gets too old. > > Olaf > > On Wed, Mar 13, 2013 at 3:38 PM, DongInn Kim via RT <support(a)osuosl.org> wrote: >> Hi, >> >> What is the status of the transition of Boost's bug tracking system? The current server is quite old and my boss and I need to decide what to do pretty soon. >> >> Regards, >> >> -- >> - DongInn >> >> On Dec 11, 2012, at 8:28 PM, Olaf van der Spek via RT <support(a)osuosl.org> wrote: >> >>> On Wed, Dec 12, 2012 at 1:36 AM, Daniel Takamori via RT >>> <support(a)osuosl.org> wrote: >>>> Added your public key to your user account on boost.osuosl.org It should work >>>> now. >>> >>> Thanks. Given that I don't have a password, how do I use sudo? >>> >>> $ sudo -s >>> >>> We trust you have received the usual lecture from the local System >>> Administrator. It usually boils down to these three things: >>> >>> #1) Respect the privacy of others. >>> #2) Think before you type. >>> #3) With great power comes great responsibility. >>> >>> [sudo] password for boostadmin: >>> >>> $ passwd >>> Changing password for user boostadmin. >>> Changing password for boostadmin. >>> (current) UNIX password: >>> passwd: Authentication token manipulation error >>> $ >>> >>> >>> >>> >>> >>> -- >>> Olaf >>> >> >> > > > > -- > Olaf

1 0

[gil] IMC4 Pixel format
by Harg Tholan 14 Mar '13

14 Mar '13

Hey, I've been trying to find a definition for the IMC4<http://www.fourcc.org/yuv.php#IMC4>pixel format for GIL with no success, not even anything similar (planar pixel formats in which some of the channels are sub-sampled). I've spent many hours already trying to figure out how could I create such pixel format, and I am totally lost... The question is how can I specify that a pixel format is planar, and planes have different sizes due to sub-sampling!....I guess I'll have to override some operator[] operator++, operator-- Or to make a specialization of some classes. But how and where? planar_pixel_iterator? channel_iterator? I need some aid! please! Thanks is advance. H4rg.

3 4

[graph] Archetype's redundant members (Re: [graph]Direct Edge Access)
by Takatoshi Kondo 14 Mar '13

14 Mar '13

Hi Jeremiah, Thanks for your advice. I studied about archetypes. If I understood the minimal archetype requirements based on concepts correctly, some graph archetypes seems to have redundant members. In addition, vertex_list_graph_archetype::degree_size_type should inherit from incidence_graph_archetype. So, I wrote a patch. After applying the patch, all Boost.Graph tests passed. Could you check the patch? -- Takatoshi Kondo On Thu, Mar 7, 2013 at 4:41 PM, Jeremiah Willcock <jewillco(a)osl.iu.edu> wrote: > On Thu, 7 Mar 2013, Takatoshi Kondo wrote: > >> Hi Jeremiah, >> >> Thank you for your reply. I'm relieved that I understand correctly. I >> come up with a related question. >> I think that general graph algorithm developers should test two >> different things. >> >> One is concepts. If function my_algo() required >> VertexAndEdgeListGraphConcept for the parameter g, it should be >> checked as follows: >> >> #include <boost/graph/graph_concepts.hpp> >> >> template <typename Graph> >> void my_algo(Graph g) { >> BOOST_CONCEPT_ASSERT(( boost::VertexAndEdgeListGraphConcept<Graph> )); >> >> boost::edge(0, 1, g); // accidental invalid use ... Line A >> } >> >> But this test cannot detect out of concepts functions usage as Line A >> if class Graph accidentally provide them. >> So, these problems should be detected the following test: >> >> void my_algo_test() { >> typedef /* Only satisfies VertexAndListGraphConcept*/ Graph; // ... >> Line B >> Graph g; >> my_algo(g); >> } >> >> How do I define the type that is only satisfied specific concepts? > > > Those are called "archetypes" in the terminology of the Boost Concept Check > Library > (http://www.boost.org/doc/libs/1_53_0/libs/concept_check/concept_check.htm) > There is a set of them for Boost.Graph concepts in > <boost/graph/graph_archetypes.hpp>. They do not appear to have > documentation, but example uses include most files with the name pattern > *_cc.cpp in libs/graph/test (e.g., bfs_cc.cpp). > > > -- Jeremiah Willcock > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

1 1

boost_svn_expor
by DongInn Kim 13 Mar '13

13 Mar '13

Hi, Can anyone tell me what boost_svn_expor does? I did not look up the program and who is running it yet but I thought someone in the boost group may already have answer for this. > [root@wowbagger dikim]# pstree 8271 > httpd─┬─59*[httpd] > └─httpd───boost_svn_expor─┬─boost_svn_expor─┬─boost_svn_expor───svn > │ ├─boost_svn_expor───boost_svn_expor > │ ├─bzip2 > │ ├─cut > │ ├─star───star > │ ├─tar───tar───bzip2 > │ └─tee > └─cat > [root@wowbagger dikim]# ps -ef | grep boost_svn > apache 23534 23510 0 15:40 ? 00:00:00 /bin/sh /home/grafik/www.boost.org/boost_svn_export_archive.sh trunk > apache 23543 23534 0 15:40 ? 00:00:00 /bin/sh /home/grafik/www.boost.org/boost_svn_export_archive.sh trunk > apache 23544 23543 0 15:40 ? 00:00:00 /bin/sh /home/grafik/www.boost.org/boost_svn_export_archive.sh trunk > apache 23552 23543 0 15:40 ? 00:00:00 /bin/sh /home/grafik/www.boost.org/boost_svn_export_archive.sh trunk > root 23809 23332 0 15:42 pts/1 00:00:00 grep boost_svn > [root@wowbagger dikim]# This program almost kills the boost server. Its loadaverage is > 30 now. :-( Regards, -- - DongInn

2 2

[spirit] hold_any invalid assignment to destructed object?
by Rob Desbois 13 Mar '13

13 Mar '13

Hi, The boost::spirit::hold_any implementation includes the following functions defined in the detail sub-namespace: // member of fxns<mpl::true_> specialisation, line 99 static void move(void* const* src, void** dest) { reinterpret_cast<T*>(dest)->~T(); *reinterpret_cast<T*>(dest) = *reinterpret_cast<T const*>(src); } // member of fxns<mpl::false_> specialisation, line 99 static void move(void* const* src, void** dest) { (*reinterpret_cast<T**>(dest))->~T(); **reinterpret_cast<T**>(dest) = **reinterpret_cast<T* const*>(src); } As I understand it, the object is destroyed _and then assigned to_; does it not need to be constructed at this point, i.e. have something like this (for the first specialisation): new (reinterpret_cast<T*>(dest)) T( *reinterpret_cast<T const*>(src) ); Thanks & apologies if I've misunderstood --rob <http://theotherbranch.wordpress.com/>

2 3

Meeting C++ 2013 - Call for Papers
by Jens Weller 12 Mar '13

12 Mar '13

Hello C++ & boost Community! Today, the 2nd Edition of the Meeting C++ conference has been announced! We will meet in Düsseldorf again at the 2nd November Weekend for two days full of C++! Call for Papers: http://www.meetingcpp.com/index.php/newsreader/items/call-for-papers-124.ht… Announcement with further Details on the conference: http://www.meetingcpp.com/index.php/newsreader/items/meeting-cpp-2013-annou… Talks about boost, C++11/14 are very welcome to the conference! kind regards, Jens Weller

1 0

[BGL] ticket 6780
by Fernando Vilas 12 Mar '13

12 Mar '13

Hi, I am still working on a few studies involving maximum adjacency search. How close is ticket 6780 to being accepted? The test cases for Stoer-Wagner now pass again on my computer. -- Thanks, Fernando Vilas fvilas(a)iname.com

1 0

[log] Release candidate 1
by Andrey Semashev 11 Mar '13

11 Mar '13

Hi, I've finished the docs update and released the RC1 of Boost.Log v2. The code can be downloaded here: http://sourceforge.net/projects/boost-log/files/boost-log-2.0-RC1-r847.zip/… The code can also be checked out from SVN: svn co https://boost-log.svn.sourceforge.net/svnroot/boost-log/trunk/boost-log The updated docs are available online: http://boost-log.sourceforge.net/libs/log/doc/html/index.html Aside from the docs updates there were a few changes I made as a part of the reviewing process (some were pointed out by users): - The add_attr manipulator was renamed to add_value. The new name better follows the terminology of the library. - The attribute value visitation API no longer forwards the result of the visitor. This feature is rarely needed but it slows down compilation significantly. To acquire the result one can use the new save_result function object wrapper. - Formatter and sink factories for settings parsers are now classes rather than simple function objects. This follows the pattern set by filter factories, which were classes before. - Fixed a few bugs and compilation problems. Sadly, there was almost no discussion of the library in this list. I received a few private emails on the library, mostly concerning some problems here and there and porting issues from v1. While valuable, this feedback can hardly replace a good review of the Boost community. I encourage everyone interested to take a look at the library, however deep you like, and provide your feedback. I don't plan to make any significant changes to the code, except maybe some include optimization and fixing the problems. If everything's fine, I'm going to post a request for permission to merge to trunk in a week or two.

6 25

Re: [boost] [log] Release candidate 1 usage question
by Alex Perry 11 Mar '13

11 Mar '13

Hi, I've been following with interest the development of this Log v2 code which looks very useful. However having read through the documentation I can't see any easy way of solving the following issue. I'm wondering if I'm just missing something obvious so thought I'd ask. I was hoping to replace some existing logging in an application which has been built on top of log4cpp - as far as I can see all the functionality of log4cpp we use is included (or some equivalent behaviour) in the boost log v2 and in a much more "natural looking" C++ idiom. However I can't see any easy way of solving the main problem we have with our current logging which is why I am looking to change it in the first place. The application is delivered as a group of related processes rather than as a single individual process - the logging is currently configured for this group and so messages need to be formatted with a source pid as well as a source tid - then grouped together and output to the appropriately configured streams (be it to a rolling file appender or syslog appender to use log4cpp names). Currently this is implemented by having one process taking the role of logging-server which is responsible for reading and managing the configuration for log4cpp, setting up the appropriate named loggers and appenders, then reading output from a shared memory circular buffer. The other logging-client processes then simply write their log output to this shared memory. Other than a bit of faffing around with timestamps to make sure that the timestamp recorded for a log message is the one when the message was written to the shared memory rather than when it was written to the log4cpp layer by the server, the server simply reads the shared memory and outputs the log messages to the current log4cpp configuration. The biggest issue with this setup is supporting the "filtering" required of log messages - obviously there is quite a large overhead in formatting a log message, locking the shared memory and writing to it. To avoid this overhead the server process writes the maximum severity of messages required for a "named log stream" to the shared memory - in the client processes this severity is checked before proceeding with the formatting of the log message. However unfortunately there is currently only support for a fixed number of these "named streams" - this actually means in practise (though wasn't the original design intention) that all logging output is written to one of 2 named log streams "trace" and/or "audit". Whilst this has worked well enough up to now enabling "trace" at "DEBUG" level can generate huge amounts of logging information which can be very time-consuming to parse when diagnosing a problem. I would like to go to a much more granular approach in the logging - so each component or sub-process, particularly for the general purpose "trace", "DEBUG" log messages, has its own name and may be switched on independently - preferably dynamically rather than by being loaded from some static configuration file. Having looked through the boost.log documentation I can't see anything that directly supports this type of multi-process logging. Whilst I'd be very happy to write a sink backend which writes to some shared memory in a similar manner to our current implementation and a custom log source to read from this and write in one "elevated" process , I'm not quite sure that this is the correct design. It appears to me that I really want to share the majority of the configuration of the logging "core" between the processes. Ie the configuration of filtering in particular needs to be shared between the processes. I see that support for loading the configuration of the core from a boost.ptree already exists. Would a good approach be to get the "server" process to write the configuration into a ptree which is then serialised and passed to the other processes by some mechanism (+some way of signalling that a change to logging configuration has occurred)? Or is there some way that the logging core could be maintained in boost interprocess containers or some such avoiding complex message passing between the processes (actually probably a bad idea - how do you avoid locking contention in the filtering check)? I can't imagine that I'm the only one ever to want this sort of "logger server/daemon" behaviour however what is other peoples experience with this sort of logging? Is it just simpler to let each process write to its own separate log for debug tracing? Whilst this will make for more searching when diagnosing issues (which process actually fulfilled the particular request I'm interested in) the simplicity will win out provided that more general "audit" messages are collated and in a single output to make finding which log output to search possible. Alex

2 1

Re: [boost] [sandbox] [tree_node] Major update
by Cromwell Enage 11 Mar '13

11 Mar '13

On Monday, March 4, 2013 at 5:36 AM, Vadim Stadnik wrote: > After reading your blog and documentation I think that the name of the > project [tree_node] is not sufficiently informative. It does not say > anything that the tree is an augmented data structure that can support many > useful algorithms. I should clarify that the blog isn't mine. The project simply addresses the use cases mentioned there. Nevertheless, I'll do my best to provide the clarifications you requested. > Does this tree support multiple synchronized augmenting: both by counter of > nodes and by "input values"? Yes. The basic data structures are binary_node<>, nary_node<>, and associative_node<>. You can augment any of them with a counter, e.g.: typedef with_count<binary_node_base_gen<>,SomeDataType> BinaryNodeWithCount; You can augment them with your own statistical properties (as long as they model Boost.Accumulators concepts), e.g.: typedef with_accumulation<nary_node_base_gen<>,SomeDataType,accumulation_key<boost::accumulators::tag::max> > NaryNodeWithMaxValue; And of course, it's possible to combine augmentations: typedef with_count< with_accumulation_base_gen<associative_node_base_gen<>,accumulation_key<> > , SomeKeyType , SomeDataType> AssociativeNodeWithCountAndSum; > Does this variant of augmented tree support logarithmic time operations: > split, join and splice? I've just added undocumented splice functionality to nary_node<>. The range variant works with most underlying containers supported by the container_gen<> metafunction. (I'm having some trouble with stable_vector<> and deque<> from Boost.Container.) The single-element variant is a little more buggy: it currently doesn't work on random-access containers. No splitting or joining yet, sorry. > Are you planning the development of augmented trees that support interfaces > of STL containers and iterators? Yes. Currently the library provides binode_container<> and binode_associative_container<>. Next step in this vein will be n_node_associative_container<>, with which I could conceivably emulate a B-tree. Ultimately I would like to come up with a back-end implementation of Rene Rivera's tree proposal: <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2101.html> Cromwell D. Enage

1 0

[test] spurious clang complier warnings
by Ian Emmons 10 Mar '13

10 Mar '13

When I compile my test code with clang on Macintosh (now Apple's default compiler), I get the two compiler warnings listed below. Could these be suppressed, please? I know this is a low priority item, but I expect it's pretty easy to fix. -Ian Emmons ============================== In file included from MyTest.cpp:6: In file included from ./MyTest.h:7: In file included from /Users/iemmons/dev/boost_1_53_0/boost/test/unit_test.hpp:19: In file included from /Users/iemmons/dev/boost_1_53_0/boost/test/test_tools.hpp:21: /Users/iemmons/dev/boost_1_53_0/boost/test/floating_point_comparison.hpp:251:25: warning: unused variable 'check_is_close' [-Wunused-variable] check_is_close_t const& check_is_close = unit_test::ut_detail::static_constant<check_is_close_t>::value; ^ /Users/iemmons/dev/boost_1_53_0/boost/test/floating_point_comparison.hpp:273:25: warning: unused variable 'check_is_small' [-Wunused-variable] check_is_small_t const& check_is_small = unit_test::ut_detail::static_constant<check_is_small_t>::value; ^ 2 warnings generated.

4 3

boost::interprocess::unique_ptr vs Boost.SmartPtr
by Adam Romanek 09 Mar '13

09 Mar '13

Hi! If I'm correct then the first "serious" implementation of unique_ptr for C++03 was written by Howard Hinnant, which was later adopted to Boost.Interprocess library. Unfortunately, I suppose not many people are aware of the fact that unique_ptr for C++03 is available in Boost. Even worse, I know people who are aware of it but who are afraid of using it just because it is provided by Boost.Interprocess, not by Boost.SmartPtr. Therefore, here's my proposal: - boost::interprocess::unique_ptr could be pulled into the top-level boost namespace - Boost.SmartPtr could provide a header file for unique_ptr that would pull the implementation from Boost.Interprocess; such a header file could also be placed in the top-level boost directory so that it could be accessed more easily - boost::unique_ptr could be documented in the documentation for Boost.SmartPtr library, providing use cases, emulation limitations etc. I believe that would make unique_ptr for C++03 available to wider audience. What do you think about this idea? With best regards, Adam Romanek

3 2

Context support for power architecture and mach-o ABI
by John Gleeson 09 Mar '13

09 Mar '13

I am interested in developing *ppc*_macho_gas.S implementations for the Boost.Context library. Has anyone already done some work on this combination? Any suggestions are welcome. I have prior experience in assembly programming and some understanding of processor scheduling concepts, but I have not done any work in these areas for a long time. I expect my re-learning curve to be steep. Thanks, John

1 0

[Serialization] Link issue on Mac OSX 10.8 (Mountain lion)
by Sean Farrow 08 Mar '13

08 Mar '13

Hi, I'm currently working with a client and we are facing an issue where by we can successfully build the boost libraries using the version of gcc that comes with xcode 4.6. However when we try to compile a project including serialization, the library and hence symbols cannot be found. We are using the latest mac os (mountain lion) and xcode 4.6. The strange thing is that this all worked under SnowLepard. If anyone can help this would be much appreciated. Moving to clang is not an option due to other dependencies. The entire log is as follows: Ld /Users/tim/Library/Developer/Xcode/DerivedData/SurfaceReader-fwryryuvfvwihnglkuymbbjtxpac/Build/Products/Debug/SurfaceReader.app/Contents/MacOS/SurfaceReader normal x86_64 cd /Users/tim/Developer/SurfaceReader setenv MACOSX_DEPLOYMENT_TARGET 10.8 /Applications/Xcode.app/Contents/Developer/usr/bin/llvm-g++-4.2 -arch x86_64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.8.sdk -L/Users/tim/Library/Developer/Xcode/DerivedData/SurfaceReader-fwryryuvfvwihnglkuymbbjtxpac/Build/Products/Debug -L/usr/local/lib -L/Users/tim/Developer/SurfaceReader/../Libraries/cryptopp561 -F/Users/tim/Library/Developer/Xcode/DerivedData/SurfaceReader-fwryryuvfvwihnglkuymbbjtxpac/Build/Products/Debug -filelist /Users/tim/Library/Developer/Xcode/DerivedData/SurfaceReader-fwryryuvfvwihnglkuymbbjtxpac/Build/Intermediates/SurfaceReader.build/Debug/SurfaceReader.build/Objects-normal/x86_64/SurfaceReader.LinkFileList -mmacosx-version-min=10.8 -L/Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib -framework IOKit -framework Carbon -framework Cocoa -framework AudioToolbox -framework System -framework OpenGL /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_osx_cocoau_xrc-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_osx_cocoau_webview-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_osx_cocoau_qa-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_baseu_net-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_osx_cocoau_html-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_osx_cocoau_adv-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_osx_cocoau_core-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_baseu_xml-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_baseu-2.9.a -framework WebKit -lexpat -lwxregexu-2.9 -lwxtiff-2.9 -lwxjpeg-2.9 -lwxpng-2.9 -lz -lpthread -liconv -stdlib=libc++ -fobjc-arc -fobjc-link-runtime -lboost_filesystem -lboost_iostreams -lboost_serialization -lboost_system -lcryptopp -framework CoreMIDI -framework CoreAudio -framework Cocoa -o /Users/tim/Library/Developer/Xcode/DerivedData/SurfaceReader-fwryryuvfvwihnglkuymbbjtxpac/Build/Products/Debug/SurfaceReader.app/Contents/MacOS/SurfaceReader Undefined symbols for architecture x86_64: "boost::filesystem::path_traits::convert(wchar_t const*, wchar_t const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> >&, std::codecvt<wchar_t, char, __mbstate_t> const&)", referenced from: void boost::filesystem::path_traits::dispatch<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >(std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> >&, std::codecvt<wchar_t, char, __mbstate_t> const&)in SurfaceFrame.o "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_start(char const*)", referenced from: void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::serialization::nvp<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >(boost::serialization::nvp<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::vector<long, std::allocator<long> > >(boost::serialization::nvp<std::vector<long, std::allocator<long> > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, MessageDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, MessageDefinition> > > >(boost::serialization::nvp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, MessageDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, MessageDefinition> > > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, DisplayDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, DisplayDefinition> > > >(boost::serialization::nvp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, DisplayDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, DisplayDefinition> > > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > > > > > >(boost::serialization::nvp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > > > > > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >(boost::serialization::nvp<std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > const&, int)in SurfaceFrame.o ... "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override(boost::archive::version_type&, int)", referenced from: void boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load_override<boost::archive::version_type>(boost::archive::version_type&, int)in SurfaceFrame.o "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override(boost::archive::class_id_type&, int)", referenced from: void boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load_override<boost::archive::class_id_type>(boost::archive::class_id_type&, int)in SurfaceFrame.o "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override(boost::archive::tracking_type&, int)", referenced from: void boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load_override<boost::archive::tracking_type>(boost::archive::tracking_type&, int)in SurfaceFrame.o "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override(boost::archive::object_id_type&, int)", referenced from: void boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load_override<boost::archive::object_id_type>(boost::archive::object_id_type&, int)in SurfaceFrame.o "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_end(char const*)", referenced from: void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::serialization::nvp<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >(boost::serialization::nvp<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::vector<long, std::allocator<long> > >(boost::serialization::nvp<std::vector<long, std::allocator<long> > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, MessageDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, MessageDefinition> > > >(boost::serialization::nvp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, MessageDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, MessageDefinition> > > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, DisplayDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, DisplayDefinition> > > >(boost::serialization::nvp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, DisplayDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, DisplayDefinition> > > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > > > > > >(boost::serialization::nvp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > > > > > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >(boost::serialization::nvp<std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > const&, int)in SurfaceFrame.o ... "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_start(char const*)", referenced from: void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<bool>(boost::serialization::nvp<bool> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<boost::serialization::collection_size_type>(boost::serialization::nvp<boost::serialization::collection_size_type> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<boost::serialization::item_version_type const>(boost::serialization::nvp<boost::serialization::item_version_type const> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<long const>(boost::serialization::nvp<long const> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<unsigned char const>(boost::serialization::nvp<unsigned char const> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<unsigned char>(boost::serialization::nvp<unsigned char> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::serialization::nvp<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > const&, int)in SurfaceFrame.o ... "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::end_preamble()", referenced from: void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, bool>(boost::archive::xml_woarchive&, bool const&)in SurfaceFrame.o void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, boost::serialization::collection_size_type>(boost::archive::xml_woarchive&, boost::serialization::collection_size_type const&)in SurfaceFrame.o void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, boost::serialization::item_version_type>(boost::archive::xml_woarchive&, boost::serialization::item_version_type const&)in SurfaceFrame.o void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, long>(boost::archive::xml_woarchive&, long const&)in SurfaceFrame.o void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, unsigned char>(boost::archive::xml_woarchive&, unsigned char const&)in SurfaceFrame.o void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::archive::xml_woarchive&, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > const&)in SurfaceFrame.o void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >(boost::archive::xml_woarchive&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)in SurfaceFrame.o ... "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::version_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::version_type const>(boost::archive::version_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::class_id_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::class_id_type const>(boost::archive::class_id_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::tracking_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::tracking_type const>(boost::archive::tracking_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::object_id_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::object_id_type const>(boost::archive::object_id_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::class_name_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::class_name_type const>(boost::archive::class_name_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::object_reference_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::object_reference_type const>(boost::archive::object_reference_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::class_id_optional_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::class_id_optional_type const>(boost::archive::class_id_optional_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::class_id_reference_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::class_id_reference_type const>(boost::archive::class_id_reference_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_end(char const*)", referenced from: void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<bool>(boost::serialization::nvp<bool> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<boost::serialization::collection_size_type>(boost::serialization::nvp<boost::serialization::collection_size_type> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<boost::serialization::item_version_type const>(boost::serialization::nvp<boost::serialization::item_version_type const> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<long const>(boost::serialization::nvp<long const> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<unsigned char const>(boost::serialization::nvp<unsigned char const> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<unsigned char>(boost::serialization::nvp<unsigned char> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::serialization::nvp<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > const&, int)in SurfaceFrame.o ... "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::~basic_xml_oarchive()", referenced from: boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::~xml_woarchive_impl()in SurfaceFrame.o boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::~xml_woarchive_impl()in SurfaceFrame.o boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::~xml_woarchive_impl()in SurfaceFrame.o "boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load_override(boost::archive::class_name_type&, int)", referenced from: boost::archive::xml_wiarchive& boost::archive::detail::interface_iarchive<boost::archive::xml_wiarchive>::operator>><boost::archive::class_name_type>(boost::archive::class_name_type&)in SurfaceFrame.o "boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load(std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >&)", referenced from: void boost::archive::load_access::load_primitive<boost::archive::xml_wiarchive, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::archive::xml_wiarchive&, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >&)in SurfaceFrame.o "boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load(std::basic_string<char, std::char_traits<char>, std::allocator<char> >&)", referenced from: void boost::archive::load_access::load_primitive<boost::archive::xml_wiarchive, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >(boost::archive::xml_wiarchive&, std::basic_string<char, std::char_traits<char>, std::allocator<char> >&)in SurfaceFrame.o "boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::xml_wiarchive_impl(std::basic_istream<wchar_t, std::char_traits<wchar_t> >&, unsigned int)", referenced from: boost::archive::xml_wiarchive::xml_wiarchive(std::basic_istream<wchar_t, std::char_traits<wchar_t> >&, unsigned int)in SurfaceFrame.o "boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::~xml_wiarchive_impl()", referenced from: boost::archive::xml_wiarchive::xml_wiarchive(std::basic_istream<wchar_t, std::char_traits<wchar_t> >&, unsigned int)in SurfaceFrame.o boost::archive::xml_wiarchive::~xml_wiarchive()in SurfaceFrame.o boost::archive::xml_wiarchive::~xml_wiarchive()in SurfaceFrame.o "boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::save(std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > const&)", referenced from: void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::archive::xml_woarchive&, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > const&)in SurfaceFrame.o "boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::save(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)", referenced from: void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >(boost::archive::xml_woarchive&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)in SurfaceFrame.o "boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::xml_woarchive_impl(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >&, unsigned int)", referenced from: boost::archive::xml_woarchive::xml_woarchive(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >&, unsigned int)in SurfaceFrame.o "boost::archive::basic_text_oprimitive<std::basic_ostream<wchar_t, std::char_traits<wchar_t> > >::~basic_text_oprimitive()", referenced from: boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::~xml_woarchive_impl()in SurfaceFrame.o boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::~xml_woarchive_impl()in SurfaceFrame.o boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::~xml_woarchive_impl()in SurfaceFrame.o ld: symbol(s) not found for architecture x86_64 collect2: ld returned 1 exit status Regards Sean.

1 0

[unordered_map] assert fail
by Steve Lorimer 08 Mar '13

08 Mar '13

I got an assert fail on a call to: return _map.insert(std::make_pair(newKey, value.second)); The assertion was in delete_buckets() BOOST_ASSERT(!this->size_); Here is a stack trace: #0 0x00007f3b7c645945 in raise () from /lib64/libc.so.6 #1 0x00007f3b7c646f21 in abort () from /lib64/libc.so.6 #2 0x00007f3b7c63e810 in __assert_fail () from /lib64/libc.so.6 #3 0x000000000075d59f in boost::unordered::detail::buckets<std::allocator<std::pair<char const* const, Spl::Market::Symbol*> >, boost::unordered::detail::ptr_bucket, boost::unordered::detail::ptr_node<std::pair<char const* const, Spl::Market::Symbol*> >, boost::unordered::detail::mix64_policy<unsigned long> >::delete_buckets (this=0x7f3b772ac0b0) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/detail/buckets.hpp:834 #4 0x000000000075d125 in boost::unordered::detail::buckets<std::allocator<std::pair<char const* const, Spl::Market::Symbol*> >, boost::unordered::detail::ptr_bucket, boost::unordered::detail::ptr_node<std::pair<char const* const, Spl::Market::Symbol*> >, boost::unordered::detail::mix64_policy<unsigned long> >::~buckets (this=0x7f3b772ac0b0, __in_chrg=<optimized out>) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/detail/buckets.hpp:805 #5 0x000000000075cebe in boost::unordered::detail::table_impl<boost::unordered::detail::map<std::allocator<std::pair<char const* const, Spl::Market::Symbol*> >, char const*, Spl::Market::Symbol*, Spl::String::Map<Spl::Market::Symbol*>::HashFunction, Spl::String::Map<Spl::Market::Symbol*>::Predicate> >::rehash_impl (this=0xfd1670, num_buckets=64) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/detail/unique.hpp:746 #6 0x000000000075c915 in boost::unordered::detail::table<boost::unordered::detail::map<std::allocator<std::pair<char const* const, Spl::Market::Symbol*> >, char const*, Spl::Market::Symbol*, Spl::String::Map<Spl::Market::Symbol*>::HashFunction, Spl::String::Map<Spl::Market::Symbol*>::Predicate> >::reserve_for_insert (this=0xfd1670, size=33) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/detail/table.hpp:413 #7 0x000000000075c48b in boost::unordered::detail::table_impl<boost::unordered::detail::map<std::allocator<std::pair<char const* const, Spl::Market::Symbol*> >, char const*, Spl::Market::Symbol*, Spl::String::Map<Spl::Market::Symbol*>::HashFunction, Spl::String::Map<Spl::Market::Symbol*>::Predicate> >::emplace_impl<std::pair<char const* const, Spl::Market::Symbol*> >(char const* const&, std::pair<char const* const, Spl::Market::Symbol*>&&) (this=0xfd1670, k=@0x7f3b772ac360: 0x10f0da40 "XJO.5025P13.AX") at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/detail/unique.hpp:464 #8 0x000000000075c0a1 in boost::unordered::detail::table_impl<boost::unordered::detail::map<std::allocator<std::pair<char const* const, Spl::Market::Symbol*> >, char const*, Spl::Market::Symbol*, Spl::String::Map<Spl::Market::Symbol*>::HashFunction, Spl::String::Map<Spl::Market::Symbol*>::Predicate> >::emplace<std::pair<char const* const, Spl::Market::Symbol*> >(std::pair<char const* const, Spl::Market::Symbol*>&&) (this=0xfd1670) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/detail/unique.hpp:430 #9 0x000000000075bebf in boost::unordered::unordered_map<char const*, Spl::Market::Symbol*, Spl::String::Map<Spl::Market::Symbol*>::HashFunction, Spl::String::Map<Spl::Market::Symbol*>::Predicate, std::allocator<std::pair<char const* const, Spl::Market::Symbol*> > >::emplace<std::pair<char const* const, Spl::Market::Symbol*> >(std::pair<char const* const, Spl::Market::Symbol*>&&) (this=0xfd1670) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/unordered_map.hpp:239 #10 0x000000000075bcf0 in boost::unordered::unordered_map<char const*, Spl::Market::Symbol*, Spl::String::Map<Spl::Market::Symbol*>::HashFunction, Spl::String::Map<Spl::Market::Symbol*>::Predicate, std::allocator<std::pair<char const* const, Spl::Market::Symbol*> > >::insert(std::pair<char const* const, Spl::Market::Symbol*>&&) (this=0xfd1670, x=...) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/unordered_map.hpp:388

2 1

Re: [boost] [compute] GPGPU Library - Request For Feedback
by Evgeny Panasyuk 08 Mar '13

08 Mar '13

03.03.2013 2:25, Kyle Lutz: > The library is built around the OpenCL framework > which allows it to be portable across many types of devices (GPUs, CPUs, > and accelerator cards) from many different vendors (NVIDIA, Intel, AMD). It looks like this library is some kind of abstraction around OpenCL. But as I can see, it does not offer ways to abstract from OpenCL kernels syntax in general way: https://github.com/kylelutz/compute/blob/master/example/monte_carlo.cpp . I.e. not just simple things like boost::compute::sqrt, or simple lambda expressions like "_1 * 3 - 4". Kernel description can be abstracted in several ways: 1) Approach similar to Boost.Phoenix - generate OpenCL kernel code based on gathered expression tree. 2) Approach similar to TaskGraph library: http://www3.imperial.ac.uk/pls/portallive/docs/1/45421696.PDF - describe kernel in terms of special function calls, macros, expression templates and so on. Actual kernel is generated when that description code is "executed". Here is small demo - http://ideone.com/qQ4Pvo (check output at bottom). -- Evgeny Panasyuk

2 1

[graph]Direct Edge Access
by Takatoshi Kondo 08 Mar '13

08 Mar '13

Hello, I'm using Boost.Graph version 1.53.0. I'm trying to write some graph algorithms and I want to minimize the requirements of the input graph. I have a question about Boost.Graph concepts. I wrote a very simple code as follows: typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS> G; int main() { G g; boost::add_edge(0, 1, g); auto res = boost::edge(0, 1, g); // Why can I call it? std::cout << std::boolalpha << res.second << std::endl; boost::graph_traits<G>::edge_descriptor e = res.first; std::cout << boost::source(e, g) << "," << boost::target(e, g) << std::endl; } It works, but I don't understand why I can call boost::edge(). According to the following document, AdjacencyMatrix concept provides Direct Edge Access functionality, so I can call edge(u,v,g) : http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/AdjacencyMatrix.html The class template adjacency_list is a model of VertexAndEdgeListGraph, MutablePropertyGraph, CopyConstructible, Assignable, and Serializable. http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/adjacency_list.html So, adjacency_list is not satisfied AdjacencyMatrix concept. I checked which function template is called, then I found the following function is called: boost/graph/detail/adjacency_list.hpp:1582 template <class Config, class Base> inline std::pair<typename Config::edge_descriptor, bool> edge(typename Config::vertex_descriptor u, typename Config::vertex_descriptor v, const adj_list_helper<Config, Base>& g_) { typedef typename Config::graph_type Graph; typedef typename Config::StoredEdge StoredEdge; const Graph& cg = static_cast<const Graph&>(g_); typedef typename Config::out_edge_iterator out_edge_iterator; const typename Config::OutEdgeList& el = cg.out_edge_list(u); typename Config::OutEdgeList::const_iterator it = graph_detail:: find(el, StoredEdge(v)); return std::make_pair( typename Config::edge_descriptor (u, v, (it == el.end() ? 0 : &(*it).get_property())), (it != el.end())); } Also, I found the following document: http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/using_adjacency_list.ht… This document describes that: edge() The time complexity for this operation is O(E/V) when the OutEdgeList type is a Sequence and it is O(log(E/V)) when the OutEdgeList type is an AssociativeContainer. It seems that edge() is a part of the public interface of adjacency_list. But I think that it is not a part of any graph concepts. If I want to write an algorithm that depends on several graph concepts, not actual classes such as adjancency_list, I can use edge(u,v,g) only if the input graph class satisfies AdjacencyMatrix concept. Am I understanding correctly? Thanks, Taka

2 3

Re: [boost] [locale] Memory leaks?
by Artyom Beilis 07 Mar '13

07 Mar '13

You had mistaken "reachable" code with memory leaks... Especially if some std::locale::global remains etc. It is not a bug nor even a problem. Artyom Beilis -------------- CppCMS - C++ Web Framework: http://cppcms.com/ CppDB - C++ SQL Connectivity: http://cppcms.com/sql/cppdb/ >________________________________ > From: Jookia <166291(a)gmail.com> >To: boost(a)lists.boost.org >Sent: Sunday, March 3, 2013 10:19 PM >Subject: [boost] [locale] Memory leaks? > >Hello! > >I've been debugging my application that uses Boost.Locale for the past five hours or so, and I've found it curious that it leaks memory. > >In order to stop it, I have to do a couple of weird things, such as including ICU in to my projects and calling u_cleanup at the end of my application. I also have to disable certain facets. I've put all this together in some source code, that by default won't leak, but uncommenting various parts will cause it to leak: > >// ---- BEGIN CODE ---------------------------------------------------- > >#include <boost/locale.hpp> >#include <unicode/uclean.h> >#include <iostream> > >using namespace boost::locale; >using namespace std; > >int main() >{ > generator gen; > gen.categories( > convert_facet | > //collation_facet | // Various errors. > //formatting_facet | // Various errors. > //parsing_facet | // Various errors. > message_facet | > //codepage_facet | // Various errors. > boundary_facet | > calendar_facet | > information_facet); > > locale newLoc = gen("zh_CN.GB18030"); > > locale::global(newLoc); > cout.imbue(newLoc); > > // ios_info::get doesn't clean up after itself. > //cout << as::date << time(0) << endl; > > // Do this at the end of the program to clean up resources. > locale::global(std::locale("C")); > cout.imbue(std::locale("C")); > u_cleanup(); >} > >// ---- END CODE ------------------------------------------------------ > >Dumping this as 'hello.cpp' and running this is how I'm debugging it: > >g++ hello.cpp -lboost_locale -licuuc && valgrind --leak-check=full --show-reachable=yes ./a.out > >Thanks, >Jookia. > >_______________________________________________ >Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > >

2 5

[interprocess] leaked named mutexes
by Eric Niebler 07 Mar '13

07 Mar '13

I recently discovered that a process can very easily leave a named mutex dangling. Consider the following: #include <cstdlib> #include <iostream> #include <boost/interprocess/sync/named_mutex.hpp> #include <boost/interprocess/sync/scoped_lock.hpp> namespace ip = boost::interprocess; char const *name = "mynamedmutex"; int main(int argc, char*argv[]) { ip::named_mutex mtx(ip::open_or_create, name); std::cout << "acquiring named mutex" << std::endl; ip::scoped_lock<ip::named_mutex> lock(mtx); std::cout << "acquired" << std::endl; exit(EXIT_FAILURE); // whoops } On my Linux box, this runs fine the first time, but the second time it hangs waiting to acquire the mutex. I have to manually delete the semaphore in /dev/shm/. This will happen whenever the process exits without calling destructors of locals; for instance: - std::exit - std::quick_exit - std::abort - std::terminate - a crash - assert failure - an unhandled exception - etc.. I find I can handle *some* of this by registering a terminate handler, an exit handler (and on C++11, a quick_exit handler) that calls boost::interprocess::named_mutex::remove. This raises a few questions, though... - Is there a better way? - Is it safe to `remove` the same named mutex multiple times? - Does this clean up only this process's use of the named_mutex, or does it nuke it from the system, even if another process is using it? (The docs suggest the latter, which is not what I want, is it?) Thanks, -- Eric Niebler Boost.org

5 5

[Graph][Parallel][PBGL] Bug deleting self loop edges
by bminano 07 Mar '13

07 Mar '13

Hello, I think I found a bug in the graph parallel library. I have a bidirectional adjacency list which has some self loop edges. When I try to delete them with remove_edge_if (or remove_out_edge_if or remove_in_edge_if) the edges are deleted, but it seems that some reference gets broken in the graph. If I iterate over the in_edges a reference to a self loop is found. But it does not happen if I iterate over the out_edges. If the graph is written in a graphviz file the self loop edges does not appear. I think there is some broken reference into the adjacency list that keeps the in_edges. I have two different pieces of code (one with pbgl and the other with bgl). They do the same, create a graph, delete the self-edges and print the in_edges. Could someone have a look at this problem? We want to use this library in our research but with this problem will not be possible. Thank you pbgl_in_edges.cpp <http://boost.2283326.n4.nabble.com/file/n4643903/pbgl_in_edges.cpp> bgl_in_edges.cpp <http://boost.2283326.n4.nabble.com/file/n4643903/bgl_in_edges.cpp> -- View this message in context: http://boost.2283326.n4.nabble.com/Graph-Parallel-PBGL-Bug-deleting-self-lo… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Re: [boost] [math] Support for libquadmath/ __float128
by John Maddock 07 Mar '13

07 Mar '13

>> Including that header will only work (as in not generate a compiler >> error) >> if the compiler supports __float128 as a native type, which is what we >> want >> to work out... basically whether the GCC build was configured to support >> it >> or not. > > The current libstdc++ headers define _GLIBCXX_USE_FLOAT128 if > __float128 is supported, but that's an implementation detail and > shouldn't be relied on (relying on _GLIBCXX_HAS_GTHREADS broke > Boost.Threads recently when GCC 4.7 stopped defining it.) I've added minimal __float128 support in Boost.Math Trunk: it's enabled whenever BOOST_MATH_USE_FLOAT128 is set, which it is automatically when the above macro is detected (which I note libstdc++ doesn't seem to use anywhere itself). Also filed a gcc bug report on the lack of a __SIZEOF__ macro for __float128: http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56540 HTH, John.

2 1

make_shared causes stack overflow with large objects
by Gregor Jasny 07 Mar '13

07 Mar '13

Hello, the bug described in #7965 causes stack overflows and sometimes hard to track crashes. I'd really appreciate if anyone could have a look. Thanks, Gregor

2 3

Re: [boost] [compute] GPGPU Library - Request For Feedback
by Hartmut Kaiser 07 Mar '13

07 Mar '13

> On Sun, Mar 3, 2013 at 6:39 PM, Hartmut Kaiser <hartmut.kaiser(a)gmail.com> > wrote: > > > > Also, do you have asynchronous versions for all algorithms? > > As of now only copy_async() is implemented (as it is the most important > for achieving good performance by overlapping memory transfers with > computation). However, I am not sure if this is the best interface to be > extended to all the other algorithms. > > I've been thinking about moving towards an asynchronous execution function > like std::async() which would be passed the algorithm function along with > its arguments. However, I've encountered problems with overloading and > having to explicitly specify the argument template types. This is one > point where I'd like to get some feedback/ideas from the community. I > would also like to have a > <algorithm>_async_after() version which would take the algorithms > parameters along with a list of futures/events to wait for before > beginning execution. My dilemma is that extending these different versions > would increase the size of the API by a factor of three. > > Any feedback/ideas/comments would be very helpful. I'd strongly suggest not to add <foo>_async_after(). All we need is a) a function/algorithm producing a future b) composable futures (see N3428, http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3428.pdf) But for this to be universally applicable we should try to find a way to converge onto ONE future type. Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

2 1

Re: [boost] [compute] GPGPU Library - Request For Feedback
by Jeffrey Lee Hellrung, Jr. 06 Mar '13

06 Mar '13

On Mon, Mar 4, 2013 at 6:25 PM, Kyle Lutz <kyle.r.lutz(a)gmail.com> wrote: > On Sun, Mar 3, 2013 at 6:39 PM, Hartmut Kaiser <hartmut.kaiser(a)gmail.com> > wrote: > > > > Also, do you have asynchronous versions for all algorithms? > > As of now only copy_async() is implemented (as it is the most > important for achieving good performance by overlapping memory > transfers with computation). However, I am not sure if this is the > best interface to be extended to all the other algorithms. > > I've been thinking about moving towards an asynchronous execution > function like std::async() which would be passed the algorithm > function along with its arguments. However, I've encountered problems > with overloading and having to explicitly specify the argument > template types. This is one point where I'd like to get some > feedback/ideas from the community. I would also like to have a > <algorithm>_async_after() version which would take the algorithms > parameters along with a list of futures/events to wait for before > beginning execution. My dilemma is that extending these different > versions would increase the size of the API by a factor of three. > > Any feedback/ideas/comments would be very helpful. > This sounds vaguely similar to Google's Flume framework: http://dl.acm.org/citation.cfm?id=1806638 - Jeff

1 0

Re: [boost] [compute] GPGPU Library - Request For Feedback
by Hartmut Kaiser 06 Mar '13

06 Mar '13

> > That's excellent (sorry I have not seen this in the docs before). > > However I think it's not a good idea to create your own futures. This > > does not scale well nor does it compose with std::future or > > boost::future. Is there a way to use whatever futures (or more > > specifically, threading implementation) the user decides to use? > > The boost::compute::future class wraps a cl_event object which is used to > monitor the progress of a compute kernel. I'm not sure how to achieve this > with std::future or boost.thread's future (or even which to chose for the > API). Any pointers (or example code) would be greatly appreciated. Yes, that's exactly the problem. It is nothing specific to your particular library but a general issue to solve. In the library we develop (HPX, https://github.com/STEllAR-GROUP/hpx/) we face the same issue of having to rely on our own synchronization primitives which makes it impossible to reuse std::future (or boost::future). Any suggestion on how to create specialization/customization points allowing to make boost::future universally applicable would be most appreciated. Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

1 0

Re: [boost] [compute] GPGPU Library - Request For Feedback
by Ioannis Papadopoulos 06 Mar '13

06 Mar '13

On 3/4/2013 8:47 PM, Kyle Lutz wrote: > On Sun, Mar 3, 2013 at 9:15 PM, Ioannis Papadopoulos > <ipapadop(a)cse.tamu.edu> wrote: >> A comparison would be nice. Moreover, why not piggy-back on the libraries >> that are already available (and they probably have better optimizations in >> place) and simply write a nice wrapper around them (and maybe, crazy idea, >> allow a single codebase to use both AMD and nVidia GPUs at the same time)? > > Boost.Compute does allow you to use both AMD and nVidia GPUs at the > same time with the same codebase. In fact you can also throw in your > multi-core CPU, Xeon Phi accelerator card and even a Playstation 3. > Not such a crazy idea after all ;-). > > -kyle > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > Thanks for the comparison. The only issue I see with Boost.Compute is that it will have problems supporting well the well-known architectures. Basically, it takes all the optimizations that have been researched and developed for maximum efficiency and throws them out of the window. For example, there is a wealth of CUDA algorithms highly optimized for nVidia GPUs. These will have to be reimplemented in OpenCL. And tuned (ouch); possibly for each device (ouch x 2). I see it as a massive task for a single person or a small group of people that are doing that in their spare time. However, if Boost.Compute implements something similar to Boost.Multiprecision's multi-backend approach, then you can use underneath thrust, Bolt, whatever else there is and only fall-back to the OpenCL code if there is nothing else (or the user explicitly requires it). They way I'd see something with the title Boost.Compute is as an algorithm selection library - you have multiple backends, which you may choose from based on automatic configuration at compile time and at run time based on type and input size of your input data. Starting from multiple backends is a good start.

1 0

Re: [boost] License of endian and limits in Boost detail
by Philip Bennefall 06 Mar '13

06 Mar '13

----- Original Message ----- From: "Rob Stewart" <robertstewart(a)comcast.net> To: <boost(a)lists.boost.org> Sent: Wednesday, March 06, 2013 12:12 AM Subject: Re: [boost] License of endian and limits in Boost detail On Mar 5, 2013, at 2:29 AM, Philip Bennefall <philip(a)blastbay.com> wrote: > * Permission to use, copy, modify, distribute and sell this software > * and its documentation for any purpose is hereby granted without fee, > * provided that the above copyright notice appear in all copies and > * that both that copyright notice and this permission notice appear > * in supporting documentation. > > This looks to me like it enforces inclusion of the above text in object > code distributions, IANAL, but I read that as only requiring the copyright notice in copies of the source and in the documentation, not in the binaries. Do you mean the end user documentation accompanying binaries (e.g. the documentation of a derivative work)? That is the part I want to avoid. Philip Bennefall ___ Rob _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

7 8