- Boost - lists.preview.boost.org

[phoenix] Test failures on clang
by Andrey Semashev 18 Apr '14

18 Apr '14

Hi, I'm seeing Boost.Log test failures on clang. The errors come from Boost.Phoenix/Boost.Proto: http://www.boost.org/development/tests/develop/developer/output/marshall-ma… It seems like actor assignment operator got broken recently.

2 1

Benchmarks comparing JSON libraries - including JSon Spirit
by Klaim - Joël Lamotte 17 Apr '14

17 Apr '14

http://blog.thousandeyes.com/efficiency-comparison-c-json-libraries/ I think this benchmark (with sources) might interest people who were recently planning to make an official Boost library for JSON parsing. In particular, this benchmark include JSon Spirit which is based on Boost Spirit. These benchmark might be useful for future tests.

4 5

Help with a shared_ptr problem on Android (ARM)
by Peter Dimov 17 Apr '14

17 Apr '14

https://svn.boost.org/trac/boost/ticket/9912 reports that spinlock_gcc_arm.hpp segfaults on a Nexus 7. Unfortunately, I know next to nothing about ARM or Android, so I wonder if someone can help with that.

3 4

Application : Question about Review/Review Manager
by Renato Forti 17 Apr '14

17 Apr '14

Hi All, The proposed Boost.Application is on review schedule. http://www.boost.org/community/review_schedule.html I have one question! How get a Review Manager? Anyone can help in this process? How this work? Thanks

2 1

[algorithm] Split that appends
by Sebastian Karlsson 17 Apr '14

17 Apr '14

First of all I think it's a bit unintuitive that boost::algorithm::split swaps with target, I would've assumed it appended. The fact that it in effect clears target makes it cumbersome to incrementally split into a destination, as you need a new temporary for every call to split, and then explicitly transfer everything over to your final destination. The docs do mention the behavior as a note ( which I presume is precisely because it's a bit unintuitive ). My question then naturally becomes why does split behave like this? As changing the behavior would be a breaking change, do you think it would be unreasonable to have a split_append? Kind regards, Sebastian Karlsson

5 5

[property_tree] xml_parser::read_xml() and write_xml() are limited to std::string keys
by Alexander Bogdashevsky 17 Apr '14

17 Apr '14

boost::property_tree::xml_parser and json_parser are hardcoded to work only with keys of std::string type. The following code will fail to compile: boost::property_tree::basic_ptree<boost::container::string, boost::container::string> pt; std::string filename("123.xml"); boost::property_tree:xml_parser::read_xml(filename, pt); I have prepared a patch that removes this limitation. Please consider pulling https://github.com/sanderbog/property_tree/commit/8af8b6bf3b65fa59792d849b5… Kind Regards, Alexander Bogdashevsky

1 0

[math] & [random] distribution object compatibility
by Thijs van den Berg 16 Apr '14

16 Apr '14

Boost [random] has probability distribution objects for drawing random samples of those distributions. Boost [math] also has probability distributions, those provide free functions for computing properties of the distributions, like mean, pdf etc. I like the free function design of math variant e.g. it uses pdf(distribution,x) and I was wondering why this hasn’t been adopt in C++11 for <random>? To me a free function syntax like random(distribution,engine) would make sense. It would align with the fact that C++11 has added begin(container) and end(container) free functions. I think it’s a bit inconvenient to have two libs that both contain probability distributions. Especially since I’m hoping that boost/math would some day en up in the standard? One way we could integrate the two libs is by adding a random(distribution,engine) free function to the math lib which would accept both distribution objects from the random lib and the math lib. This however could stimulate users in writing less C++11 portable code. My questions are: * Why wasn’t the free function syntax adopted in C++11? Perhaps because of performance options? * Is there an effort to integrate the distributions in math and random within boost? * Are there concrete plans to add elements of math to the C++ standard? We already have <random> now, I would love more.

3 5

clang++ isn't getting the BOOST_NO_CXX11_HDR_FUNCTIONAL flag that it needs
by Chris Cooper 16 Apr '14

16 Apr '14

Trying to build & run the regression tests for boost 1.55 on my Mac using the clang++ that comes with Xcode 5.1 ("Apple LLVM version 5.1 (clang-503.0.38) (based on LLVM 3.4svn)”), it can’t build config_test.cpp because BOOST_NO_CXX11_HDR_FUNCTIONAL isn’t set, and libs/config/test/boost_no_ccx_hdr_functional.ipp definitely doesn’t build (after renaming it to .cpp of course). If I set CXXFLAGS to "-std=c++11 -stdlib=libc++” everything is fine, but I also need a build of boost that _doesn’t_ use c++11, and it’s the non-c++-11 version that is failing. I can get around this by manually setting CXXFLAGS to “-DBOOST_NO_CXX11_HDR_FUNCTIONAL” but it seems like the correct way to do this is to add a test to boost/config/compiler/clang.hpp that tests … something… and then sets BOOST_NO_CXX11_HDR_FUNCTIONAL if appropriate. 1. Would you agree that’s the right place to set BOOST_NO_CXX11_HDR_FUNCTIONAL (when appropriate)? 2. Any suggestions on the correct test to determine whether BOOST_NO_CXX11_HDR_FUNCTIONAL is needed? It looks like the _has_feature() macro is the preferred method, but I can’t figure out which feature to check for … Thanks, Chris p.s. The text of the 3 errors (when trying to compile boost_no_cxx_hdr_functional) is exceedingly lengthy, but to summarize: usr/bin/../lib/c++/v1/__functional_base_03:962:22: error: no matching function for call to '__invoke' typedef decltype(__invoke(_VSTD::declval<_Fp>())) type; usr/bin/../lib/c++/v1/__config:496:32: note: expanded from macro 'decltype' #define decltype(x) __typeof__(x) usr/bin/../lib/c++/v1/__functional_base_03:1019:14: note: in instantiation of template class 'std::__1::__invoke_return<int &, false>' requested here typename __invoke_return<type&>::type ./boost_no_cxx_hdr_functional.ipp:22:4: note: in instantiation of template class 'std::__1::reference_wrapper<int>' requested here std::ref(i); usr/bin/../lib/c++/v1/__functional_base_03:962:22: error: no matching function for call to '__invoke' typedef decltype(__invoke(_VSTD::declval<_Fp>())) type; usr/bin/../lib/c++/v1/__config:496:32: note: expanded from macro 'decltype' #define decltype(x) __typeof__(x) usr/bin/../lib/c++/v1/__functional_base_03:1019:14: note: in instantiation of template class 'std::__1::__invoke_return<const int &, false>' requested here typename __invoke_return<type&>::type ./boost_no_cxx_hdr_functional.ipp:23:4: note: in instantiation of template class 'std::__1::reference_wrapper<const int>' requested here std::cref(i); ./boost_no_cxx_hdr_functional.ipp:36:9: error: no member named 'bind' in namespace 'std'; did you mean 'find'? std::bind(f, std::placeholders::_1, 0.0f);

3 2

[GIT] Access
by Artyom Beilis 16 Apr '14

16 Apr '14

I hadn't committed changes for a while. >From what I've read in the mailing list there was a move to GIT and svn was closed. However I can't find information on the GIT at the boost site. Are we still using SVN? Artyom Beilis -------------- CppCMS - C++ Web Framework: http://cppcms.com/ CppDB - C++ SQL Connectivity: http://cppcms.com/sql/cppdb/

3 2

Re: [boost] -serialization- segfault on startup
by Biddiscombe, John A. 16 Apr '14

16 Apr '14

Andrey Thanks for the info. I purged every stray lib I could find - double checked all ld_library_path entries and discovered there was a shared lib from a previous build on my path which was almost certainly the culprit in this case. However, now the filesystem error has gone and I'm left with a very similar one which previously was bothering me from boost.serialization. This one I can't make disappear by cleaning paths because there's nothing bad left that might be a problem. I tried this time with boost_1.54 just to see if anything changed. does this stack trace look familiar to anyone? thanks JB #0 0x00000080a0b272f4 in ._dl_fixup () from /lib64/ld64.so.1 #1 0x00000080a0b2fd78 in ._dl_runtime_resolve () from /lib64/ld64.so.1 #2 0x00000fffb689869c in ._ZN5boost13serialization9singletonINS_7archive6detail22archive_serializer_mapIN3hpx4util24portable_binary_oarchiveEEEE12get_instanceEv () at /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_54_0/include/boost-1_54/boost/serialization/singleton.hpp:128 #3 0x00000fffb3a93008 in ._Z41__static_initialization_and_destruction_0ii () at /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_54_0/include/boost-1_54/boost/serialization/singleton.hpp:149 #4 0x00000fffb3a93064 in ._GLOBAL__sub_I_portable_binary_oarchive.cpp () at /gpfs/bbp.cscs.ch/home/biddisco/src/hpx/src/util/portable_binary_oarchive.cpp:207 #5 0x00000fffb3a969f8 in .__do_global_ctors_aux () from /gpfs/bbp.cscs.ch/home/biddisco/bgas/gcc/build/hpx/lib/hpx/libhpx_serializationd.so.0 #6 0x00000fffb3a89ae4 in ._init () from /gpfs/bbp.cscs.ch/home/biddisco/bgas/gcc/build/hpx/lib/hpx/libhpx_serializationd.so.0 #7 0x00000080a0b27bf0 in ._dl_init_internal () from /lib64/ld64.so.1 #8 0x00000080a0b154dc in ._dl_start_user () from /lib64/ld64.so.1

1 0

filesystem segfault on startup
by Biddiscombe, John A. 16 Apr '14

16 Apr '14

I’m using a BGQ machine and have compiled boost 1_55 using gcc4.8.2, the application I am testing does not use filesystem itself, but the libraries it pulls in do. On startup I have segfaults with a stack trace like this (below) Can anyone tell what is going wrong (lots of locale related problems on this machine it seems). I have no knowledge of boost.filesystem internals and I would like to work around this if possible. Thanks JB #0 0x00000080a0b272f4 in ._dl_fixup () from /lib64/ld64.so.1 #1 0x00000080a0b2fd78 in ._dl_runtime_resolve () from /lib64/ld64.so.1 #2 0x00000fffb6ef9384 in ._ZN5boost10filesystem18directory_iteratorC1Ev () at /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_55_0/include/boost/filesystem/operations.hpp:676 #3 0x00000fffb3aace44 in ._Z41__static_initialization_and_destruction_0ii () at libs/filesystem/src/operations.cpp:248 #4 0x00000fffb3aacf2c in ._GLOBAL__sub_I_operations.cpp () at libs/filesystem/src/operations.cpp:2230 #5 0x00000fffb3ab8a78 in .__do_global_ctors_aux () from /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_55_0/lib/libboost_filesystem.so.1.55.0 #6 0x00000fffb3aa32e4 in ._init () from /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_55_0/lib/libboost_filesystem.so.1.55.0 #7 0x00000080a0b27bf0 in ._dl_init_internal () from /lib64/ld64.so.1 #8 0x00000080a0b154dc in ._dl_start_user () from /lib64/ld64.so.1

2 1

filesystem segfault on startup
by Biddiscombe, John A. 16 Apr '14

16 Apr '14

I'm using a BGQ machine and have compiled boost 1_55 using gcc4.8.2, the application I am testing does not use filesystem itself, but the libraries it pulls in do. On startup I have segfaults with a stack trace like this (below) Can anyone tell what is going wrong (lots of locale related problems on this machine it seems). I have no knowledge of boost.filesystem internals and I would like to work around this if possible. Thanks JB #0 0x00000080a0b272f4 in ._dl_fixup () from /lib64/ld64.so.1 #1 0x00000080a0b2fd78 in ._dl_runtime_resolve () from /lib64/ld64.so.1 #2 0x00000fffb6ef9384 in ._ZN5boost10filesystem18directory_iteratorC1Ev () at /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_55_0/include/boost/filesystem/operations.hpp:676 #3 0x00000fffb3aace44 in ._Z41__static_initialization_and_destruction_0ii () at libs/filesystem/src/operations.cpp:248 #4 0x00000fffb3aacf2c in ._GLOBAL__sub_I_operations.cpp () at libs/filesystem/src/operations.cpp:2230 #5 0x00000fffb3ab8a78 in .__do_global_ctors_aux () from /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_55_0/lib/libboost_filesystem.so.1.55.0 #6 0x00000fffb3aa32e4 in ._init () from /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_55_0/lib/libboost_filesystem.so.1.55.0 #7 0x00000080a0b27bf0 in ._dl_init_internal () from /lib64/ld64.so.1 #8 0x00000080a0b154dc in ._dl_start_user () from /lib64/ld64.so.1 -- John Biddiscombe, email:biddisco @.at.@ cscs.ch http://www.cscs.ch/ CSCS, Swiss National Supercomputing Centre | Tel: +41 (91) 610.82.07 Via Trevano 131, 6900 Lugano, Switzerland | Fax: +41 (91) 610.82.82

1 0

[align] Review.
by Mostafa 15 Apr '14

15 Apr '14

For easier tracking by the Review Manager I am going to break up my review into multiple parts which will be top-level responses to this post.

3 10

[algorithm] any_of does not call std::find - bad performance
by Albert Yiamakis 15 Apr '14

15 Apr '14

Hello, Is there a particular reason why Boost.Algorithm's any_of does not call std::find? I have devised a simple benchmark that shows it to perform much worse (compiling with gcc): http://pastebin.com/nrgtTfPX boost::find is almost as fast as std::find - no surprises, as it calls it. any_of is considerably slower, whatever the optimization level. I have not dug in the implementation of std::find to determine why; perhaps the compiler recognizes this is a sorted range, perhaps it's even capable of doing the calculation at compile time. Whatever the case however, surely any_of should also call std::find to reap the same benefits? Albert

1 2

Re: [boost] [serialization] proposed improvements: forward-compatibility of serialization
by Andrzej Horoszczak 15 Apr '14

15 Apr '14

-------- Original Message -------- > From: Sohail Somani <sohail(a)taggedtype.net> > > This was a problem that interested me a few years ago so I made a > solution that worked with any archive and I presented it at BoostCon > (now CppNow). It was inefficient, hacky and required no modifications to > existing archives but forward compatibility did work so I know it is > completely possible. Do you have a specific link handy ? or do you perhaps remember project name so I could google it? > >My immediate question would be whether you already have released code >for the products in question which complicates things a bit. Fortunately we still have about 4-6 weeks before general release (-; > The proposal itself doesn't seem impossible, at a > glance. Thanks - that's promising (-; I believe that this approach should be more efficient and more elegant that Google's Protocol Buffers. And for us minimizing network traffic is of paramount importance. Andrew _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

[serialization] proposed improvements: forward-compatibility of serialization
by Andrzej Horoszczak 15 Apr '14

15 Apr '14

Hello Everybody, (it seems that my previous post had contained only title - so I repeat the full posting below) We've started (again) using boost::serialization in our multi-platform distributed application about one year ago. However, we have arrived at a road block with forward-compatibility of serialization - which of major importance to us since we cannot force users to upgrade to the same/newer version of application all at the same time. Firstly, question is: perhaps you or someone that you know of - would be interested in such improvement work? We are small company rushed against some die-or-prosper deadlines - and simply do not have enough resources to do it on our own in time avialable - but we could sponsor such work. Secondly, the problem is: To avoid ambiguity I have put together the following description and our own suggestion for solution: The project requirement is centred on improving multi-version class compatibility in binary archives e.g. more flexibility in a situation when we are reading or transferring modified class in C++ code. We need to go beyond what current version of object versioning in boost offers: http://www.boost.org/doc/libs/1_55_0/libs/serialization/doc/tutorial.html#v… Specifically we need to add ability to skip reading unknown or unexpected fields in a non-XML archives we are parsing. Specific example: Version of the application (newer one) that saved the archive has the following code: struct extensionClass { std::string moreInfo; time_t date; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & moreInfo; ar & date; } } class gps_position { public: template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & degrees; ar & minutes; ar & seconds; ar & new_field } int degrees; int minutes; float seconds; extensionClass new_field; gps_position(){}; }; And now the version of the software that needs to read the archive is an older application that has the code that implements the gps_position class in the following way: class gps_position { public: template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & degrees; ar & minutes; ar & seconds; } int degrees; int minutes; float seconds; gps_position(){}; }; The purpose of the project is to gracefully allow for serialization in older version of application to continue reading the archive, by simply omitting information related to extensionClass new_field; e.g. to properly advance the read position to the beginning of next class in the archive. It is desirable to add to programming interface information that there was incompatibility detected, for further escalation to either to user interface, or higher level code logic that might decide, for instance, to change communication protocol. It is critically important for us to optimize archive size while adding this capability. We prefer to use eos::portable_iarchive which provides varinteger support for multi-OS compatibility (size of int, little vs big endian), therefore we prefer solution which would accept any archive, however, we will be ok with standard boost binary archive solution. Thirdly, the proposal is: The most promising solution that we envisage is to add recursive size information associated with the number identifying class (already placed in front of every data object). By recursive size information I mean size not in terms of bytes for raw data, but in terms of number of fields/objects in the class. The size information would than be expanded until it can be expressed in terms of C++11 standard predefined POD sizes. For instance for simple class example: class SimplePODs { uint32_t firstField, uint64_t int secondField; float thirdField; } The associated (leading) size information for the SimplePODs class is 3. Than within the class itself we already have identifiers of each field types. Since they are POD we can maintain global (and for the archive) dictionary of sizes for each identifier in this case: 4 than 8 and 4 And than it follows: class AggregateClass { SimplePODs first_field; char second_field; } In this case the size information (in the global dictionary) for identifier associated with AggregateClass is 2. Than within the class itself sizes for first_field would be 3 and for second_field it is of course 1. I believe this can be done as part of the version and object tracking process so the performance would still be high and most importantly, the incremental size overhead both in memory and in the archive will be relatively small (only one size information per each type of object contained in the archive - and no size overhead for POD fields). By the way this approach would also increase multi-OS compatibility for instance class on the source computer might be 32-bit compilation of : class CrossPlatform { int idont_care_about_size; } And during saving that field: idont_care_about_size would actually be saved and identified as uint32_t The same CrossPlatform class on destination machine would be compiled as 64-bit application - but since target int would be larger that source we can do silent promotion. Of course the other way around, we can throw exception if the actual value contained within idont_care_about_size exceeds the targets' compilation POD size. OK - I hope that my explanation is clear and I would appreciate any feedback that you might have. And finally let me state that we do greatly appreciate (and use) a lot of boost work and in particular, we consider boost.serialization approach to be probably the best possible under the current constrains of the language. Best regards, Andrew Horoszczak

6 5

[algorithm] LSD radix sort
by Jeremy Murphy 15 Apr '14

15 Apr '14

Dear community, I humbly offer you for perusal and review, LSD radix sort (and counting sort): https://github.com/jeremy-murphy/algorithm/tree/radix_sort The tests and docs are unfinished but the library code is as complete as I can manage without comment from others. The new files of interest are in include/boost/algorithm/integer_sort. I have more code with a speed test and CMake files in a separate repository: https://github.com/jeremy-murphy/integer-sort But perhaps I should move all those files into a branch off my Boost.Algorithm fork? Probably. Anyway, thanks in advance for any feedback and comments. Cheers. Jeremy

2 6

Amusing git pseudo-documentation
by Nat Goodspeed 15 Apr '14

15 Apr '14

Warning: this is not real. It just tickles me. http://git-man-page-generator.lokaltog.net/#72a7d7ff89dc3b268c857e3b2ddabff6 Apologies for the noise...

3 2

Application 0.4.6 with global_context.
by Renato Forti 15 Apr '14

15 Apr '14

Hi, thanks for your comments. >> If the main usage is likely to be 'daemonic', then Boost.Daemon would still be a good name. About the name 'application'. I chose this name because the library can support many kinds of application, see: http://www.dokfile.com/appbeta4/docs/libs/application/doc/html/boost_applic… >> From the current name, one would be unlikely to guess that it could do daemon work? The name 'Daemon' is usual in POSIX world. In Windows world the usual is 'Service'. I could call it as 'server', but it would also be wrong due to support for common application. In future the library can support other kinds of application (e.g. apache httpd modules) Thus I think that the name 'application' is more suitable. Let me know your thoughts. Thanks for help ReTF

1 0

[git] github cheat sheet
by Philippe Vaucher 15 Apr '14

15 Apr '14

Hello, I think this might be useful for many people: a list of overall tips n' tricks about github and git. https://github.com/tiimgreen/github-cheat-sheet Hope it helps, Philippe

1 0

[algorithm] Review Request: edit_distance
by Erik Erlandson 15 Apr '14

15 Apr '14

I would like to request a formal review for inclusion of the edit_distance() function. Description: The edit distance is the length of the shortest (or least-cost) edit script from one sequence to another, where an edit script is defined as a sequence of insertion, deletion and (optionally) substitution operations. The function implementing the edit distance is named edit_distance. This function will return the edit distance between two sequences, where sequences may be any valid range object supporting forward iteration. The edit_distance function will also, if requested, return the edit script. http://en.wikipedia.org/wiki/Edit_distance Documentation: http://erikerlandson.github.io/algorithm/libs/algorithm/doc/html/algorithm/… Code resides on a branch of my fork of Boost.Algorithm: https://github.com/erikerlandson/algorithm/tree/edit_distance The feature branch above includes the doc, unit tests and examples that are integrated via Jamfiles. The new dev resides specifically in this subdir: https://github.com/erikerlandson/algorithm/tree/edit_distance/sequence I have built the tests and examples on gcc and clang, with and without c++11 mode. I don't have access to a windows/MSVC build env, so I am definitely curious if it compiles properly in that env. My concept is that boost::algorithm::sequence can eventually serve as a home to additional related algorithms, for example other sequence comparison algorithms or perhaps other categories of sequence-related algorithms.

9 31

[graph] Are you interested in the Route Inspection Problems and Vehicle Routing Problems?
by Ciro Santilli 14 Apr '14

14 Apr '14

Are you interested in implementations for the following problems: - Route Inspection Problems: http://en.wikipedia.org/wiki/Route_inspection_problem - classic: find shortest path for undirected graph possibly repeating edges. O(n^3). If Eulerian path exists, it is the min. - mixed graphs. NP-complete. AKA Chinese postman problem. - k-Chinese postman problem. N postmen. - Vehicle routing problem: http://en.wikipedia.org/wiki/Vehicle_routing_problem Generalization of Route Inspection. NP-complete. Many variants: edges have one ore more weights, and multiple constraints are possible: - carrying capacity of each truck - time to travel an edge and delivery windows for each edge All of those problems have extensive literature, and obvious practical applications. Why don't you use GitHub's Issue tracker instead of the mailing list? It integrates better with the code tracking and merge requests, and is much easier to search. That would greatly reduce contribution barriers to new devs.

3 2

[variant] Why no move emulation with Boost.Move for C++03?
by Andrzej Krzemienski 14 Apr '14

14 Apr '14

Hi, I am trying to figure out what the best way to enable move semantics in Boost.Optional. I tried to pick at how Boost.Variant does it. If I understand correctly, move operations are only defined if compiler supports rvalue references. I wonder why it doesn't use Boost.Move, which would enable move semantics even for compilers w/o rvalue references. Is there any reason for this (that I should also take into account for Boost.Optional)? Regards, &rzej

7 7

Application 0.4.6 with global_context.
by Renato Forti 14 Apr '14

14 Apr '14

Hi All, I'd like to share this simple article on CP about 'Application 0.4.6'. http://www.codeproject.com/Articles/756866/Build-a-Server-Application-using… This version removes Boost.Singularity dependence and add a global context. Let me know your comments. Source: https://github.com/retf/Boost.Application ReTF

4 3

Call for Papers for Meeting C++ 2014 - one more week
by Jens Weller 13 Apr '14

13 Apr '14

Hello boost community, there is one week left to submit your talk to Meeting C++ 2014: http://meetingcpp.com/index.php/submit-your-talk.html Newsentry at Meeting C++ http://meetingcpp.com/index.php/newsreader/items/call-for-papers-one-more-w… So far 20 talks are submitted, a few of them also cover boost, most C++11/Modern C++. I also could announce the keynotes yesterday: Opening Keynote - Scott Meyers Closing Keynote - Hartmut Kaiser thanks, Jens

1 0

[BoostDocs] Need help with getting started with BoostDocs
by Andrzej Krzemienski 12 Apr '14

12 Apr '14

Hi Everyone, Perhaps someone in this list can help me generate html documentation from qbk sources. I am using MinGW on Windows and try to build the docs. I use the instructions form the following links. https://svn.boost.org/trac/boost/wiki/BoostDocs/GettingStarted http://www.boost.org/doc/libs/1_55_0/doc/html/quickbook/install.html#quickb… I am not sure if they are up to date. I downloaded all the necessary components, and when I try to run b2 on my doc folder, I get the following error messages: runtime error: file > file:///C:/_data/cpp/optional/boptional/quickbook/docbook-xsl/html/chunkfast.xsl > line 23 element variable > Recursive definition of chunks > runtime error: file > file:///C:/_data/cpp/optional/boptional/quickbook/docbook-xsl/html/chunkfast.xsl > line 32 element variable > Variable 'chunks' has not been declared. > xmlXPathCompiledEval: evaluation failed > runtime error: file > file:///C:/_data/cpp/optional/boptional/quickbook/docbook-xsl/html/chunkfast.xsl > line 32 element variable > Failed to evaluate the expression of variable 'div'. > I am not sure exactly where they are coming from. But they look like an error from the tool, rather than my qbk sources. Perhaps anyone here experienced a similar problem and knows a solution? Or perhaps there is a newer version of the instructions? Regards, &rzej

4 15

Application 0.4.6 with global_context
by Renato Forti 12 Apr '14

12 Apr '14

>> It actually provide a way to make a non-daemon application (mentionned in the part about launching the app). Yes, this is true! Officially the lib supports 2 kind (modes) of application. But user can define a new type, for sample this article, show how create a new application mode. In this case the mode is a apache httpd server module extension. http://www.codeproject.com/Articles/695937/Creating-a-New-Application-Mode

1 0

Application 0.4.6 with global_context.
by Renato Forti 12 Apr '14

12 Apr '14

>> I find the idea, to have a cross-platform way of creating daemons/services, worthwhile. >> I would like to suggest that the name be changed from Application, which is far too generic for just creating a computer program, to something more appropriate, maybe 'daemon'. Thanks for your sugestion, i will think in that. >> I have never used the Mac, but does this extend to that OS ? Yes, on mac (OSX) a daemons is generated. Thanks

1 0

Status of Boost.Test library maintenance
by Kamil Witecki 11 Apr '14

11 Apr '14

Hello, I would like to ask what is current status of Boost.Test library. Looking at Trac there is number of open issues that are pending and not much is being done about these, even patches were proposed. Is the library not maintained anymore, what would be sad, or I just got false impression? In case of former what is the process of handing over maintenance of library so that it won't become abandoned? Pozdrawiam, Kamil Witecki.

1 0

Compile-time string comparing
by Anton Bikineev 11 Apr '14

11 Apr '14

Hi all. I think it's frequently asked question. If so, I'm sorry. Is there anything feature in Boost that allows to compare strings at compile-time? I know that it is easy-implemented with generalized constant expressions, but I'm primarily interested in compatibility of compilers. Thanks.

3 3

[align] Are you rewriting history with every push?
by Mostafa 11 Apr '14

11 Apr '14

Glen, Are you rewriting history or force pushing commits to "https://github.com/glenfe/align". I have a local repo set to track your remote and every time I pull to update to your new commits I get merge conflicts. In fact a new clone shows that the history for master has only one commit, the most recent one, when it should show at least three. Can you avoid doing this in the future? Thanks, Mostafa

2 1

boost::optional -- updates for C++11 move semantics
by Diggory Hardy 10 Apr '14

10 Apr '14

Dear list, I wanted something like boost::optional, but with support for move- construction/assignment, so I went ahead and had a go at patching it. Attached is based on boost 1.49 (Ubuntu package). Could someone please review? I've not contributed to boost before. The changes at least aren't too complicated, but: 1) I'm not entirely sure if the move constructor (line 636) and swap function (line 1046) are implemented in the best way (also see line 279), 2) and I have no idea how is_[not_]reference_tag (line 486) works. 3) There should maybe also be a unit test. Of course, I am happy for my contributions to be published under the boost licence. Regards, Diggory

6 8

[Range] contains() for unsorted ranges?
by Albert Yiamakis 10 Apr '14

10 Apr '14

Hello, Wouldn't the library be well served by providing a contains() algorithm - with the same overloads/versions as find - for unsorted ranges? Surely, having to test against the range's end ruins the otherwise expressive syntax offered; especially when adaptors are involved and one has to test against the adapted range's end. Perhaps I am missing an obvious reason why not? Albert -- kojirion.github.io

4 4

[FWD: [serialization] anybody interested in freelancing? - forward-compatibility improvement needed
by Andrzej Horoszczak 10 Apr '14

10 Apr '14

1 0

Re: [boost] [graph/adjacency_list] edge have many costs
by Jeremiah Willcock 10 Apr '14

10 Apr '14

On Tue, Apr 8, 2014 6:59 AM PDT aymen kaabi wrote: >Good morning, > > >I want to create a graph that their egdes have array of cost ( i dont mean >bundle property) because i want to create this graph and try dijikstra for >every cost values . >can i have an example. > >example: graph have 2 edge 1->2 ( cost 1,2,3,4,7) > 2->3(cost 2,5,3,8,9) > >thanks for your helps Edges can have arbitrary properties, so you can create a graph whose edge weight property is a container type. What are you planning to use the multiple weights for? For some uses, parallel edges between the same vertices might make sense to consider as well. -- Jeremiah Willcock

2 1

Re: [boost] [BGL] Visual Studio 12 finish_edge() failure, general BOOST_TTI_HAS_MEMBER_FUNCTION failure?
by Jeremiah Willcock 10 Apr '14

10 Apr '14

On Tue, Apr 1, 2014 1:12 PM PDT Michael Behrns-Miller wrote: >On 4/1/2014 8:45 AM, Edward Diener wrote: >> On 4/1/2014 4:50 AM, Michael Behrns-Miller wrote: >> On 4/1/2014 4:40 AM, Michael Behrns-Miller wrote: >>> On 3/31/2014 6:30 PM, Edward Diener wrote: >>> On 3/31/2014 1:27 PM, Michael Behrns-Miller wrote: >>>> ... >>>> Here's how BGL defines it: >>>> >>>> ------------- >>>> >>>> BOOST_TTI_HAS_MEMBER_FUNCTION(finish_edge) >>>> >>>> template <bool IsCallable> struct do_call_finish_edge { >>>> template <typename E, typename G, typename Vis> >>>> static void call_finish_edge(Vis& vis, const E& e, const G& g) { >>>> vis.finish_edge(e, g); >>>> } >>>> }; >>>> >>>> template <> struct do_call_finish_edge<false> { >>>> template <typename E, typename G, typename Vis> >>>> static void call_finish_edge(Vis&, const E&, const G&) {} >>>> }; >>>> >>>> template <typename E, typename G, typename Vis> >>>> void call_finish_edge(Vis& vis, const E& e, const G& g) { // Only >>>> call if method exists >>>> do_call_finish_edge<has_member_function_finish_edge<Vis, >>>> void>::value>::call_finish_edge(vis, e, g); >>>> } >>> >>> The invocation of has_member_function_finish_edge has to match the >>> member function signature which you are invoking. If the member >>> function signature for finish_edge is: >>> >>> void finish_edge(const E&, const G&); >>> >>> then your invocation for do_call_finish_edge must be: >>> >>> do_call_finish_edge >>> < >>> has_member_function_finish_edge >>> < >>> Vis, >>> void, >>> boost::mpl::vector >>> < >>> const E&, >>> const G& >>> > >>> > >>> ::value >>> >::call_finish_edge(vis, e, g); >>> >>> or >>> >>> do_call_finish_edge >>> < >>> has_member_function_finish_edge >>> < >>> void Vis::* (const E&,const G&) >>> > >>> ::value >>> >::call_finish_edge(vis, e, g); >>> >>> >>> _______________________________________________ >>> Unsubscribe & other changes: >>> http://lists.boost.org/mailman/listinfo.cgi/boost >>> >>> Thank you Edward. >>> >>> The instantiation code was not mine, that is what is done by the BGL, >>> here: >>> >>> boost\graph\depth_first_search.hpp >>> >>> The instantiation code does not seem to match your recommendation. >>> This simple DFS test fails: >>> >>> https://svn.boost.org/trac/boost/attachment/ticket/9770/test.cc >>> >>> So it sounds like BGL needs some patching to match your format. It >>> should change from... >>> >>> do_call_finish_edge<has_member_function_finish_edge<Vis, >>> void>::value>::call_finish_edge(vis, e, g); >>> >>> to... >>> >>> do_call_finish_edge<has_member_function_finish_edge<void Vis::* (const >>> E&,const G&)>::value>::call_finish_edge(vis, e, g); >>> >>> Does that sound correct? >> >> On the newer code, Visual Studio 12 gives me: >> >> boost_1_55_0/boost/graph/depth_first_search.hpp(86): error C2182: >> 'abstract declarator' : illegal use of type 'void' >> >> I am the developer for TTI. In your test case the actual VIZ struct has templated member functions, so I do not think has_member_function will find your templated functions. TTI is a compile-time mechanism for producing compile-time code. But even if it does not find the member functions at compile-time TTI should not produce a compile-time error so I definitely want to look at this situation. >> >> As to why Visual Studio 12 gives that error I need to be able to reproduce your compile steps. I am an absolute novice with the Boost graph library. I think I need to build the library first, then run your test against it. >> >> Jeremiah Willcock produced the changes in graph using TTI so he may have had a very good reason for using the original has_member_function signature, although it looks wrong to me on purely a TTI basis. Hopefully he will chime in on his change. >> >> >> >> _______________________________________________ >> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > >Thanks Edward, appreciate the feedback, I'll be monitoring. In the meantime my workaround of making finish_edge() non-optional is working for me. But of course I'd prefer not to have to change boost code before using. :-) > >Sure appreciate all you guys do to develop and maintain the libraries, boost is just fantastic. I wanted a way to test for equivalent signatures for the finish_edge member (copy vs. const ref, for example). I probably believed/saw somewhere that the syntax I used would do that. Is there a way to get a general "call ability" test for a member function using TTI? -- Jeremiah Willcock

2 1

Error running ip_multicast (and ip_multicast_select) regression tests
by Chris Cooper 09 Apr '14

09 Apr '14

When I run the ip_multicast (and ip_multicast_select) regression tests for boost 1.55 on my Mac, they fail with these errors: ip/multicast.cpp:165: error in "ip_multicast_runtime::test": 49, Can't assign requested address ip/multicast.cpp:181: error in "ip_multicast_runtime::test": 49, Can't assign requested address I’m new to IPv6, but it looks like the regression test is making sure that IPv6 is available (multicast.cpp lines 128-132), and then it’s trying to join a IPv6 multicast group (lines 163-165) and leave it (lines 179-181), and failing both times. I’m not sure how to check whether multicast is enabled for IPv6 on this machine (which I’ve seen online as a possible reason for this failure), but then it seems like the regression test is not so great if it can fail due to the environment of the host computer instead of an actual bug in the boost library. Are there other reasons why this test would fail? Is there a way I can check whether multicast over IPv6 is allowed on this machine? Is there a recommended way to disable one particular subtest like this one? A #ifdef kind of thing? Thanks, Chris

1 0

[context] Don't hard-code the assembler
by Steven Watanabe 09 Apr '14

09 Apr '14

AMDG This commit: https://github.com/boostorg/context/commit/7534fe5d1c01e7f543d86607770e9c46… makes it impossible for me to run b2 --with-context msvc-12.0 outside of the visual studio command prompt. Please just use the assembler that the toolset provides. In Christ, Steven Watanabe

8 22

Boost Parallel Graph Library: remove_vertex gives unexpected results
by Alok Kumbhare 09 Apr '14

09 Apr '14

Hi All, i need some help with parallel boost graph library. Sorry if this is not the right list to post. Posting here since it looks like it might be a but. In particular, i am trying to modify the structure of the graph (distributed adjacency list) after it is loaded. The code snippet is at http://pastebin.com/erizQ0Sf. The problem is that clear_vertex(v,g) and remove_vertex(v,g) does not seem to operate on the same vertex in the graph. Here is a sample graph in metis format: http://pastebin.com/qxy2w6aw (I use the default vertex distribution for this example) The graph_viz output is available here for different scenarios: https://onedrive.live.com/redir?resid=C3CDB6EFBD31B4A8!20818&authkey=!AJqEF…<https://onedrive.live.com/redir?resid=C3CDB6EFBD31B4A8!20818&authkey=!AJqEF…> As you can see in the above figure: The first image is the original graph split into two partitions (mpirun -np 2 ./test) The second image is after clear_vertex is called for one of the vertices. Notice vertex "0". All the edges are removed as expected. The third image is after remove_vertex is called (which is called after clear_vertex, as mentioned in the documentation here: http://www.boost.org/doc/libs/1_55_0/libs/graph_parallel/doc/html/distribut…) Notice here that the vertex "2" is removed instead of vertex "0" even when using the same vertex descriptor for both calls. One thing i noted is that the remove_vertex seems to remove the "last" vertex in that partition irrespective of the input. e.g. if i use v = vertex(1,g) in the above code, i still see that the vertex "2" is removed and the edges rearranged for that. Is this a bug or am i doing something wrong. Your help will be greatly appreciated. Thanks, Alok Kumbhare

1 1

[wrapper]
by Alexandra 09 Apr '14

09 Apr '14

HI, I have Ubuntu 13.10 with a Processor Intel Pentium CPU P6100 2.00GHz x 2. I download the boost library for linux, extract and install boostrap.sh. When I try to do ./b2 on terminal, the result is this: MPI auto-detection failed: unknown wrapper compiler mpic++ Please report this error to the Boost mailing list: http://www.boost.org You will need to manually configure MPI support. /home/alexandra/boost_1_55_0/tools/build/v2/tools/gcc.jam:148: in gcc.init from module gcc error: toolset gcc initialization: error: no command provided, default command 'g++' not found error: initialized from project-config.jam:12 /home/alexandra/boost_1_55_0/tools/build/v2/build/toolset.jam:41: in toolset.using from module toolset /home/alexandra/boost_1_55_0/tools/build/v2/build/project.jam:1007: in using from module project-rules project-config.jam:12: in modules.load from module project-config /home/alexandra/boost_1_55_0/tools/build/v2/build-system.jam:249: in load-config from module build-system /home/alexandra/boost_1_55_0/tools/build/v2/build-system.jam:412: in load-configuration-files from module build-system /home/alexandra/boost_1_55_0/tools/build/v2/build-system.jam:524: in load from module build-system /home/alexandra/boost_1_55_0/tools/build/v2/kernel/modules.jam:289: in import from module modules /home/alexandra/boost_1_55_0/tools/build/v2/kernel/bootstrap.jam:139: in boost-build from module /home/alexandra/boost_1_55_0/boost-build.jam:17: in module scope from module On user-config.jam i wrote # ------------------ # MPI configuration. # ------------------ using mpi ; in the final line. You can help me? THank you Alexandra

5 7

[filesystem] path noncopyable error with boost 1.55.0 and g++ 4.5.1
by Richard Hadsell 09 Apr '14

09 Apr '14

I am trying to upgrade from Boost 1.52 to 1.55. Everything is fine with Clang 3.3, but I get this error with G++ 4.5.1: In file included from /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.55.0/Include/libboost/boost/system/error_code.hpp:18:0, from /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.55.0/Include/libboost/boost/filesystem/path_traits.hpp:23, from /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.55.0/Include/libboost/boost/filesystem/path.hpp:25, from bssConfig.h:24, from bssConfig.cc:13: /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.55.0/Include/libboost/boost/noncopyable.hpp:27:37: error: 'boost::noncopyable_::noncopyable::noncopyable()' declared with non-public access cannot be defaulted in the class body /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.55.0/Include/libboost/boost/noncopyable.hpp:28:22: error: 'boost::noncopyable_::noncopyable::~noncopyable()' declared with non-public access cannot be defaulted in the class body The OS is Linux Fedora 14. The compiler is gcc version 4.5.1 20100924 (Red Hat 4.5.1-4). I am compiling with these flags: -march=core2 -msse4.1 -m64 -mpc64 -std=c++0x -pedantic-errors -mieee-fp -fPIC -pthread -O2 -g -fno-strict-aliasing -fno-tree-ccp -- Dick Hadsell 203-992-6320 Fax: 203-992-6001 Reply-to: hadsell(a)blueskystudios.com Blue Sky Studioshttp://www.blueskystudios.com 1 American Lane, Greenwich, CT 06831-2560 Follow Blue Sky Studios on Facebook <http://www.facebook.com/BlueSkyStudios> and Twitter <http://twitter.com/#%21/blueskystudios>

3 4

Reboot all the CREST server machines to apply the updated openssl lib
by Kim, DongInn 09 Apr '14

09 Apr '14

Dear All, I am advised to reboot all our CREST servers to fully apply the updated OpeeSSL library. The new OpenSSL library was patched to RHEL 6 (RedHat Enterprise Linux 6) packages yesterday and they were installed on all the CREST server machines at around 10am Apr 8, 2014. (Note: all the CREST server machines are setup with RHEL6). The OpenSSL bug is serious and we needed to take immediate actions. http://heartbleed.com Even though our server seem to be safe with the new OpenSSL library now, I would like to make sure that there is no any leaking spots in our server machines by refreshing all the systems with the new OpenSSL library. I would like to setup a schedule to reboot all the CREST server machines at 9am tomorrow (Apr 10, 2014). Date: April 10, 2014 Time: 6:00am-7:00am Pacific US time 7:00am-8:00am Mountain US time 8:00am-9:00am Central US time 9:00am-10:00am Eastern US time 1:00pm-2:00pm GMT Please let me know if you have any questions or concerns about rebooting our servers. Regards, -- - DongInn

1 0

Compile error on function.mem_fun_cxx98 regression test
by Chris Cooper 09 Apr '14

09 Apr '14

I’m trying to get all of the regression tests to work on my Mac which is running OSX 10.9.2 with Xcode 5.1. "clang++ —version” reports “Apple LLVM version 5.1 (clang-503.0.38) (based on LLVM 3.4svn)”. I’m building the boost libraries for c++11. I realize boost 1.55 doesn’t officially support this compiler (yet) so I’m out on the bleeding edge, but it’s almost working. I am cheating a little by manually applying a few of the post-1.55 patches, and if I need to do that to get the regression tests to build that’s fine. When I try to compile function.mem_fun_cxx98 it gives me this error: mem_fun_cxx98.cpp:34:46: error: invalid operands to binary expression ('std::__1::basic_ostream<char>' and 'ostream' (aka 'basic_ostream<char>')) BOOST_TEST(f2(&x, boost::ref(std::cout)) == std::cout); ../../../boost/detail/lightweight_test.hpp:186:28: note: expanded from macro 'BOOST_TEST' #define BOOST_TEST(expr) ((expr)? (void)0: ::boost::detail::test_failed_impl(#expr, __FILE__, __LINE__, BOOST_CURRENT_FUNCTION)) 1 error generated. The error looked to me like a stdlib vs. libc++ kind of thing, so I double-checked the compiler options. For the regression test, bjam is calling the compiler like so: "clang++" -x c++ -std=c++11 -stdlib=libc++ -O3 -O3 -finline-functions -Wno-inline -Wall -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"../../.." -c -o "/tmp/boost/bin.v2/libs/function/test/mem_fun_cxx98.test/clang-darwin-4.2.1/release/link-static/threading-multi/libs/function/test/mem_fun_cxx98.o” “[SNIP]/mem_fun_cxx98.cpp" The boost libraries are build by calling the compiler: "clang++" -x c++ -std=c++11 -stdlib=libc++ -O3 -O3 -finline-functions -Wno-inline -Wall -DBOOST_ALL_NO_LIB=1 -DBOOST_COROUTINES_SOURCE -DBOOST_SYSTEM_STATIC_LINK=1 -DNDEBUG -I"." -c -o “[SNIP]/bin/boost/bin.v2/libs/coroutine/build/clang-darwin-4.2.1/release/link-static/threading-multi/exceptions.o" "libs/coroutine/src/exceptions.cpp" Whether I bootstrap for toolset clang or darwin doesn’t seem to change anything. Building the library and regression test using clang++ without the c++11 flags works correctly. Is this a known problem that has already been patched for the 1.56 release (I can’t find it if so)? Any suggestions on why this might be happening? Thanks, Chris

2 1

[graph/adjacency_list] edge have many costs
by aymen kaabi 08 Apr '14

08 Apr '14

Good morning, I want to create a graph that their egdes have array of cost ( i dont mean bundle property) because i want to create this graph and try dijikstra for every cost values . can i have an example. example: graph have 2 edge 1->2 ( cost 1,2,3,4,7) 2->3(cost 2,5,3,8,9) thanks for your helps

1 0

[serialization] proposed improvements: forward-compatibility of serialization
by Andrzej Horoszczak 08 Apr '14

08 Apr '14

1 0

phoenix bind vs boost bind?
by Robert Dailey 07 Apr '14

07 Apr '14

First of all, I'm using boost 1.55.0 on MSVC9. I've been using boost::phoenix in various places in my code base for easier usage of std::for_each and friends. However, I do not create lazy functions for a lot of the functions I bind to because they are only needed in one place most of the time. As a result, I use boost::phoenix::bind the same as I'd use boost::bind(). However I have read in various places that boost::bind is being deprecated. I'm not sure if there is truth to this, but is there a reason to choose one over the other? Is phx::bind() basically an "upgrade" to boost::bind? If I intermingle them, I have a lot of issues out of placeholder ambiguities that results in more boilerplate code (i.e. using boost::phoenix::placeholders::_1 everywhere). Any tips? I haven't used boost in a few years so I just want to make sure I'm not using it incorrectly. Thanks in advance.

1 0

Re: [boost] [container] Vector-like container, which takes, feedback for Jeremy M.
by Alexander Kuprijanov 07 Apr '14

07 Apr '14

> Message: 3 > Date: Sun, 6 Apr 2014 09:59:20 +1000 > From: Jeremy Murphy <jeremy.william.murphy(a)gmail.com> > On 6 April 2014 00:45, Alexander Kuprijanov <alexkupri(a)gmail.com> wrote: > >> Hi, everybody! >> The most important feature of my container is performance. However, other >> features will appear later. >> https://github.com/alexkupri/array/blob/master/description/description.txt >> Today I compared my container with rope. My container outperformed it 10 >> times. > > > Hi Alex, > > could you include a build file (I recommend CMake)? My cursory attempt to > compile main.cpp spewed lots of errors. Thanks, cheers. > > Jeremy > Hi, Jeremy! Well, I provided makefiles, but I'm not sure if they help. The line: g++ -O3 main.cpp worked well. If you still have problems, be specific and tell, which project (trunk or performance), which errors and which system. "trunk" should be compiled, because I checked it on Linux and Windows; performance is more platform specific and uses __gnu_cxx::rope. Best regards, A.K.

1 0

Network change of the Boost main web/mail server (wowbagger)
by Kim, DongInn 07 Apr '14

07 Apr '14

Dear All, The boost server machine (wowbagger.crest.iu.edu) is requested to change its subnet and I am planning to switch its IP address for the change of the subnet. I have arranged the schedule to update the DNS information of the following hostnames in wowbagger. - www.boost.org - svn.boost.org - lists.boost.org - boostcon.boost.org - beta.boost.org - www.boostcon.org - wiki.boost.org The IP transition date and time: April 07, 2014 6:00am-7:00am Pacific US time 7:00am-8:00am Mountain US time 8:00am-9:00am Central US time 9:00am-10:00am Eastern US time 1:00pm-2:00pm GMT The list of services that may not be available: - Web services: www.boost.org svn.boost.org lists.boost.org ... - Mail services including mailing lists: boost(a)lists.boost.org boost-users(a)lists.boost.org … - Subversion svn.boost.org The old IP address: 129.79.13.33 The new IP address: 129.79.39.203 I have already prepared the IP transition on wowbagger to make the new IP address provide the same services on it so that I hope that there is no actual outage of the services other than the rebooting time. If you happened to use the IP address on your cronjob or programs, please make sure that you switch it with the new one. IMPORTANT ========================================= wowbagger will need to reboot to kick in a new kernel and mount the NFS space with the new IP address at the same time. ========================================== Please let me know if you have any questions or concerns about this IP transition. Regards, -- - DongInn

1 1

[spirit][testing] ICE in gcc 4.8.2 in tests
by Andrey Semashev 07 Apr '14

07 Apr '14

Hi, I'm seeing ICE in a test on BP x86_64 C++11: http://www.boost.org/development/tests/develop/developer/output/BP%20x86_64… This seems to be happening only in develop. I cannot reproduce this with my local gcc 4.8.1. Does anyone know what could be the problem?

2 4

[integer] Is BOOST_HAS_INTPTR_T documentation missing?
by Mostafa 06 Apr '14

06 Apr '14

Is BOOST_HAS_INTPTR_T documentation missing in Boost.Integer?

2 2

[containers] Vector-like container, which takes O(log(N)) > for insert/erase, question to Adam Wulkiewicz about iterators
by Alexander Kuprijanov 06 Apr '14

06 Apr '14

Hi, again, Adam! > > Date: Sat, 05 Apr 2014 16:59:18 +0200 > From: Adam Wulkiewicz <adam.wulkiewicz(a)gmail.com> > And I strongly dissagree with the statement that your container should > be the first choice. std::vector<> will outperform it in most of the > real-life use-cases. Vector outperforms it only (roughly) 2 times on small arrays (when it contains only one leaf) on all operations, only (roughly) 3 times on iterating access on all sizes and only log(N) times on random access. But it severely (N/log(N)) outperforms vector in all insert/erase cases. See my explained test results. I still believe it's close to first choise. > Also, IMHO the most important feature of std::list<> is insert() and > erase() not invalidating other iterators. AFAIU in your container > iterators may be invalid after insert()? That is very interesting question. Currently such sort of persistent iterators (I call them bookmarks) are not implemented. PLEASE PLEASE PLEASE, EVERYBODY, give me an example of the task when such iterators are necessary. Will this feature add feature to my container, if implemented? Best regards, A.K.

1 0

[container] Vector-like container, which takes O(log(N)) for insert/erase, response to Adam Wulkiewicz about performance
by Alexander Kuprijanov 06 Apr '14

06 Apr '14

Hi, Adam! > Date: Sat, 05 Apr 2014 16:59:18 +0200 > From: Adam Wulkiewicz <adam.wulkiewicz(a)gmail.com> > Again, the times you measure are too small to reasonably tell which one > is faster. You could perform each test 10k more times to keep the > results around 1s. I believe my calculations are reliable. I'm sorry I did not explained it earlier and did not provide clarification on github. Firstly, the output is time per one operations in milliseconds. E.g., if it says 1.00e-4, it means 1e-7 seconds or 0. 000 000 1 seconds per one operation. The operation performed many times and result is divided. Secondly, in each operation there are many calculations, by both repeating and array growing. If the line before array says "averaged on 500 measurements" and in array size is 1024, it meant that it was 500 arrays and each of them growed from 512 elements to 1024 elements, giving 256000 atomic additions. Each of them took 1.17e-04 ms in average, they all took about 30 ms. Granularity of Linux timer (which is used in test) is 1 ms, so tolerance in the case is 3%. > Instead of comparing it with a different implementation I guess it would > be sufficient to contain only 2 children in the internal nodes. > Well, I in fact found that numbers 14/28 are near optimum. (There are several optimums for different operations.) Theory agrees with practice, the best performance is when leaf/branch fits one cache line. (In fact, my container allows minimum L=4 M=4, each branch and leaf may have from 2 to 4 items. It behaves worse generally.) I tried to compare it with rope because I was asked to do so. I'll compare it with other similar containers as well. Rope has other problems such as balancing when critical and so on. Best regards, A.K.

1 0

Proposal: Vector-like container, which takes O(log(N)) for insert/erase, response to Bjorn Reese about copy-on-write
by Alexander Kuprijanov 06 Apr '14

06 Apr '14

> Date: Fri, 04 Apr 2014 19:24:53 +0200 > From: Bjorn Reese <breese(a)mail1.stofanet.dk> > To: boost(a)lists.boost.org > Subject: Re: [boost] Proposal: Vector-like container, which takes > O(log(N)) for insert/erase (Glen Fernandes) > Message-ID: <533EEAE5.2040304(a)mail1.stofanet.dk> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 04/04/2014 02:10 PM, Lars Viklund wrote: > >> As for the Copy-on-Write semantics, isn't the general consensus that CoW >> is a horrible horrible thing and is very hard to get right+fast in the >> modern world with concurrency? > > Yes: > > http://www.gotw.ca/publications/optimizations.htm > Hi, Bjorn, 1) Proposed Copy-on-Write (CoW) optimization will be only option. Developer will chose, which container he or she wants: a) without CoW, b) with CoW with internal locks, c) with CoW without internal locks (very dangerous). Option "a" will be the first choise. Option "c" is used either in single-threaded apps or if he/she knows that all shallow copies are maintained in the single thtread or behind single semaphore which protects all shallow copies. 2) The article states mostly that there are ineffective optimizations of CoW. CoW by itself is not that bad. Citation: Plain 1726ms Plain_FastAlloc 642ms COW_Unsafe 1629ms COW_AtomicInt 1949ms COW_CritSec 10660ms COW_Mutex 33298ms e.g., the AtomicInt is 10-15% slower than plain, while Mutex 33 times. 3) There are situations where it's worth. Firstly, mobile/embedded devices are memory greedy. Secondly, small changes in very large arrays, such as text editors. Thirdly, no need to implement "undo" command in text editors, that reduces development time. But I see that community does not appreciate this feature so I do it in the end of my priority list. Best regards, A.K.

1 0

[git] Near future.. How do we deal with git-native libraries?
by Rene Rivera 05 Apr '14

05 Apr '14

As the owner of the Predef library which exists originally in github and not svn.. I'm wondering about some things for the near future (as in this coming week): 1. Where will the git repo live for a library? Will the repo need to stay in the boostorg organization? Or is it possible/desirable to use the existing repo that's part of my user account? 2. I notice that there's a ".gitattributes" file in the svn imported version of the Predef repo. Will I need to add that file to my actual Predef git repo? And if so, is there a single canonical version of that file I should use? And a followup.. In the future if that file changes, does it need to change for all repos consistently? Rene. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

9 31

[asio] Bug: Handlers execute on the wrong strand.
by Greg Barron 04 Apr '14

04 Apr '14

Hi All, I would like to refer you to this bug report: https://svn.boost.org/trac/boost/ticket/9203 I won't paste the full contents of the bug report into this message. The executive summary is that the allocation algorithm for the implementation of asio::strand can and does allocate the implementation of an existing strand to strands that are subsequently allocated. This can have the effect that handlers wrapped in strand (b) will actually be executed on strand (a). I consider this to be a bug but if there is something that I'm misunderstanding about the operation of strands it would be great if you could help me clear it up. If the consensus is that this is a bug, what are the chances for it to be included in the 1.56 release? It is probably too late to be included in the 1.55 release. I've implemented a work around which could only be described as a hack and would be embarrassed to show it to anybody. But it gets me over my hump :). Thanks! -- Greg

5 4

Re: [boost] Proposal: Vector-like container, which takes O(log(N)) for insert/erase (Glen Fernandes)
by Alexander Kuprijanov 04 Apr '14

04 Apr '14

Hi, again, I've implemented a container which should replace vector and have O(log(N)) for insert/delete. Please review. https://github.com/alexkupri/array/blob/master/description/description.txt The code is small, the description is verbose. Best regards, A.K.

6 5

Boost.asio avoid the use of pipe
by Thomas Heller 03 Apr '14

03 Apr '14

Hi list, I'm currently trying to get a asio based software to run on CNK (a very lightweight kernel) which only implements a subset of the POSIX functions. One of the functions which is not implement is pipe. However, asio uses this in the epoll and select reactor. Is there any possibility to avoid that pipe is used? What options do I have? Cheers, Thomas

2 3

[typeof] failed to compile under dependent context
by feverzsj 03 Apr '14

03 Apr '14

hi, list here is some code failed to compile with msvc9. Not sure if it is wrong use case or bug. template<class T> struct A { static T apply() { return T(); } }; template<class T> struct B { typedef BOOST_TYPEOF_TPL(A<T>::apply()) type; // error C2064: term does not evaluate to a function taking 0 arguments }; template<class T> BOOST_TYPEOF_TPL(A<T>::apply()) foo2() // error C2064: term does not evaluate to a function taking 0 arguments { } template<class T> void foo1() { BOOST_TYPEOF_TPL(A<T>::apply()) t; // ok } Regards, zsj -- View this message in context: http://boost.2283326.n4.nabble.com/boost-typeof-failed-to-compile-under-dep… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

Boost.Geometry selected for MySQL
by Barend Gehrels 03 Apr '14

03 Apr '14

Hi, Recent news which is published this week (actually today): Boost.Geometry will be used for MySQL 's spatial database features. http://mysqlserverteam.com/building-mysql-with-boost/ This also means MySQL (server) will now use Boost libraries from now on. Regards, Barend

4 4

[BGL] Visual Studio 12 finish_edge() failure, general BOOST_TTI_HAS_MEMBER_FUNCTION failure?
by Michael Behrns-Miller 01 Apr '14

01 Apr '14

Hello boost! In the BGL, finish_edge() is a visitor function of DFS, but it is optional. It is made optional via BOOST_TTI_HAS_MEMBER_FUNCTION. Here's how BGL defines it: ------------- BOOST_TTI_HAS_MEMBER_FUNCTION(finish_edge) template <bool IsCallable> struct do_call_finish_edge { template <typename E, typename G, typename Vis> static void call_finish_edge(Vis& vis, const E& e, const G& g) { vis.finish_edge(e, g); } }; template <> struct do_call_finish_edge<false> { template <typename E, typename G, typename Vis> static void call_finish_edge(Vis&, const E&, const G&) {} }; template <typename E, typename G, typename Vis> void call_finish_edge(Vis& vis, const E& e, const G& g) { // Only call if method exists do_call_finish_edge<has_member_function_finish_edge<Vis, void>::value>::call_finish_edge(vis, e, g); } ------------- In all my efforts, the Visual Studio 12 compiler fails to call finish_edge(). I've tried templated versions, direct versions, virtual versions, with and without const params, inline and not inline. In every case, VS says "code will not be hit, no executable code is associated with this line. possible causes: preprocessor directives or compiler/linker optimizations". I'm in debug mode with minimal optimizations, and there's no preprocessor wrapper. It's possible there's a problem with the way I'm calling it, but it happens when I use a simple example from another user. This ticket includes very simple sample code that should fire the finish_edge() function. It does not work for me using VS 12: https://svn.boost.org/trac/boost/ticket/9770 https://svn.boost.org/trac/boost/attachment/ticket/9770/test.cc I have a large project depending on the BGL, which has been great otherwise. I've coded a workaround by using the other non-optional visitor functions. But there are edge cases (sorry, no pun intended! ha) that fail with my workaround. The only possible solution is to get finish_edge() to fire. I'd like to do it the intended way, rather than rewrite BGL code to make finish_edge() non-optional. I'll go try this with a recent version of gcc now... Thanks for any input at all! Michael Behrns-Miller

2 6

[git] Creating merge bases.
by Daniel James 01 Apr '14

01 Apr '14

Hi, After creating a merge base for iostreams last night, I thought I might do it for some other modules where I can find a good merge base. I won't do it for any modules with post-subversion commits on master, and I won't change any content without a pull request, so this shouldn't be disruptive. Does this sound okay? It should help anyone wishing to work on a module, as they can get a better idea of what hasn't been merged to master, and it should make it easier to merge changes. Daniel

1 0

Proposal: Vector-like container, which takes O(log(N)) for insert/erase
by Alexander Kuprijanov 01 Apr '14

01 Apr '14

Hi, everybody! I've implemented a container, which has interface similar to vector and takes O(log(N)) for inserting/erasing. Shortly speaking, it has BTrees inside and intrusive leaves, and exploits idea of so-called "rope". I would like to name it alex_kupriianov_array (after myself) and add it to boost. Please tell me who is the coordinator of containers and what is the procedure of adding something to boost. If the community finds it useful, I'll add more features. Among them: 1) non-intrusive version of the container; 2) shallow/partial/lazy copying; if you copy an array and then modify small part of it (for example, beginning), it will keep different beginnings and common end; 3) bookmarks - sort of sticky iterators, which are sticky to a certain element, no matter if there are insertions/deletions before them. Contact me: alexkupri at gmail dot com

6 5

[align] [review] Pre-review comments
by Steven Watanabe 31 Mar '14

31 Mar '14

AMDG I saw the announcement of the review and decided to take a look at the library today. All the following is based on: commit 0d361143c18254efddacfd48775a2776ca7d5e11 Author: Glen Fernandes <glenfe(a)live.com> Date: Thu Mar 27 17:45:12 2014 -0700 Documentation: align: "alignment shall be a fundamental alignment value or an extended alignment value and a power of two." Please define these terms. Also warning: suggest parentheses around ‘and’ within ‘or’ [-Wparentheses] aligned_alloc: I notice that alignment is only required to be a power of two. Is there a reason this is different from align? aligned_allocator: template<class T, size_t Alignment = 1> class aligned_allocator; I'd really like to see the requirements on Alignment written out somewhere, even if we can deduce it from the fact that it calls aligned_alloc. Also, does the standard guarantee that all alignments are powers of 2? Otherwise lcm(2^k, alignof(T)) is not guaranteed to be a power of 2. If it is guaranteed, then lcm(2^k, alignof(T)) == max(2^k, alignof(T)) This is probably worth noting. aligned_allocator notes: "Specifying minimum alignment is generally only suitable for containers such as vector and undesirable with other, node-based, containers." I had to think about this for a few seconds. If you're going to say this, you should probably explain why. aligned_allocator_adaptor: template<class A> aligned_allocator_adaptor(A&& alloc); Not explicit? Should aligned_allocator_adaptor really be convertible from anything? template<class U> aligned_allocator_adaptor(const aligned_allocator_adaptor<U, Alignment>& other); Requires: Allocator shall be constructible from A. Copy/paste error. There is no A here. pointer allocate(size_type n, const_void_pointer hint = 0); Requires: hint is a value obtained by calling allocate(), or else nullptr. Calling allocate on what? Not just this object, but any equivalent aligned_allocator_adaptor, should work. aligned_allocator_adaptor notes "This adaptor class can be used with any C++11 or C++03 allocator including those allocators whose pointer type is a smart pointer." I don't see how this could possibly work with a smart pointer when aligned_allocator_adaptor explicitly uses raw pointers. Your tests pass for we with msvc 9.0-12.0, gcc-mingw-4.6.2, and clang-3.4 on Windows and with gcc 4.7.2 on Linux. aligned_allocator.hpp:100 aligned_free(memory); This is vulnerable to ADL if std::aligned_free is ever created (or my_ns::aligned_free for that matter). (Note that the corresponding aligned_alloc is safe becase std::size_t has no associated namespaces) aligned_allocator.hpp:104 enum { Size = static_cast<std::size_t>(-1) / sizeof(T) }; There's absolutely no reason to use an enum as far as I can see. You can just return this value. aligned_allocator.hpp:139 memory->~U(); I seem to recall msvc warning that memory is unused in cases like this. You may need to supress the warning. detail/align.hpp:28 if (n1 <= space && size <= space - n1) You might add a comment about avoiding overflow, so that no one is tempted to refactor it into an simpler "equivalent" test. test/Jamfile.v2: This is a lot more verbose than it needs to be. Try just: import testing ; run align_test.cpp ; run aligned_alloc_test.cpp ; ... test-suite is obsolete (it just groups all the targets under a single name, which is completely pointless when that's all you have in the Jamfile) and the braces just create a compound statement (like in C++) test/align_test.cpp: You need to test the following: - There is not enough space in the buffer. - In particular, you need to validate the exact boundaries where align starts to return 0. test/aligned_alloc_test.cpp: You need tests for the following conditions: - size == 0 - size < alignment - size > alignment && gcd(size, alignment) != alignment - the allocation fails because size is too large. - Also write to the allocated memory to (hopefully) verify that the data structure used by aligned_alloc is safely outside this region. test/aligned_allocator_adaptor_test.cpp: You're only testing allocate/deallocate. You also need tests for the other members. - rebind - copy constructor/copy assignment operator - construct/destroy - allocate with a hint - allocate with 0 size test/aligned_allocator_test.cpp: same as aligned_allocator_adaptor_test.cpp. test/is_aligned_test.cpp You need tests for: - is_aligned returns false. Your entire test suite would pass with bool is_aligned(...) { return true; } In Christ, Steven Watanabe

3 5

symbolic link missing in modular-boost/boost/numeric
by David Bellot 31 Mar '14

31 Mar '14

Hi, it seems the symbolic link to ublas is missing in "modular-boost"/boost/numeric. I would be very grateful if someone with more admin rights than me could add it and commit it please ? Many thanks. Best regards, David

2 2

[git][iostreams] Forking without an established merge point
by Bjorn Reese 31 Mar '14

31 Mar '14

If I look at the develop branch of Boost.Iostreams then GitHub says that "This branch is 253 commits ahead and 91 commits behind master". It appears that Boost.Iostreams has not established a merge point between master and develop as described in: https://svn.boost.org/trac/boost/wiki/PostCvtMergePoint I am trying to fork Boost.Iostreams to create some patches for it. Normally I would need to work off the develop branch (or a branch originating from develop), but if I do so my pull-requests will include the entire commit history of the component. If I look at the network graph of Iostreams, it appears that everybody else branches off the master branch. How do I proceed?

2 2

[GSOC 2014] Boost.Thread / Work-Stealing-Thread-Pool
by Shuxiong Ye 30 Mar '14

30 Mar '14

Hi boost community, My name is Shuxiong Ye, and I am applying GSOC2014. My proposal is here[1]. There are very few comments on it. Any suggestions or questions will be welcome to improve it. Thanks. [1] https://google-melange.appspot.com/gsoc/proposal/review/student/google/gsoc… Shuxiong Ye

2 3

New numeric data type proposal
by Damian Alberto Vicino 30 Mar '14

30 Mar '14

Hi, I work in a simulation tools' research group and we developed a basic data type for handling time representation that we want to share. The data type is kind of a mix between MultiPresicionFloatingPoint and Rational. We are using this kind of data type in concrete simulator implementations because of a theoretic problem with the formalisms we implement, in which the floating point error can not be bounded. We published a paper in Simutools14 a few days ago explaining how this unbound errors are reached under a specific formalism (DEVS) and why they are not easy to detect. I can share the paper if someone interested in the details, or provide some toy examples to discuss. And we are working in showing same kind of errors in other formalisms. A simplified version of the proposed data type is: Number<N, D, M, E> where in the common case the four are some integer-like type. The number can be interpreted as N/D * M * 2^E where N and D are never modified unless required for operation of compatibility. Compatibility operation is called when an operation between 2 numbers having different N/D happens. It can also be thought as a variable radix MPFP. We choose this implementation because when used as replacement of integer or float, it doesn’t decrease significantly the performance. It only decrease significantly when operating with values that were not representable in any of those (if we simplify N/D). I will love to discuss implementation details, alternative ideas to handle the problem (this one worked for us, but sure there is other options too that may be more generic or performant in generic scenarios). Also, I’m up to code the whole thing, and to share the naive implementation we got in our simulator so far to start the discussion. Best regards, Damian Vicino

3 11

[spirit] How to detect Spirit.Qi expressions?
by Andrey Semashev 30 Mar '14

30 Mar '14

Hi, Is there a way to detect at compile time that a certain type is a Boost.Spirit.Qi parser? That includes template expressions and grammars. Basically, I want to detect if qi::parse(b, e, expr) would be a sensible thing to do. I tried this: boost::is_same< typename proto::domain_of< ExpressionT >::type, spirit::qi::domain > But domain_of returns default_domain for Boost.Spirit.Qi template expressions.

2 2

Getting fully uptodate
by Paul A. Bristow 29 Mar '14

29 Mar '14

Sync SHA-1: 44d48257a7eb39837880afb81ceb2153e86e5a8c * Changed Boost.Log to Boost.Sync in the supported compilers section. Fixes #9388. Current HEAD detached, you are working on (no branch). Do you want to create branch now? Chose "no" [detached HEAD 3a9d142] deletions 37 files changed, 4971 deletions(-) delete mode 100644 include/boost/sync/condition_variables/condition_variable.hpp delete mode 100644 include/boost/sync/condition_variables/cv_status.hpp delete mode 100644 include/boost/sync/condition_variables/notify_all_at_thread_exit.hpp delete mode 100644 include/boost/sync/detail/condition_variables/basic_condition_variable_windows.h pp delete mode 100644 include/boost/sync/detail/condition_variables/condition_variable_posix.hpp delete mode 100644 include/boost/sync/detail/condition_variables/condition_variable_windows.hpp delete mode 100644 include/boost/sync/detail/config.hpp delete mode 100644 include/boost/sync/detail/footer.hpp delete mode 100644 include/boost/sync/detail/header.hpp delete mode 100644 include/boost/sync/detail/interlocked.hpp delete mode 100644 include/boost/sync/detail/link_config.hpp delete mode 100644 include/boost/sync/detail/mutexes/basic_mutex_windows.hpp delete mode 100644 include/boost/sync/detail/mutexes/mutex_posix.hpp delete mode 100644 include/boost/sync/detail/mutexes/mutex_windows.hpp delete mode 100644 include/boost/sync/detail/pthread.hpp delete mode 100644 include/boost/sync/detail/system_error.hpp delete mode 100644 include/boost/sync/detail/throw_exception.hpp delete mode 100644 include/boost/sync/detail/time_traits.hpp delete mode 100644 include/boost/sync/detail/time_units.hpp delete mode 100644 include/boost/sync/detail/tss.hpp delete mode 100644 include/boost/sync/detail/waitable_timer.hpp delete mode 100644 include/boost/sync/detail/weak_linkage.hpp delete mode 100644 include/boost/sync/exceptions/lock_error.hpp delete mode 100644 include/boost/sync/exceptions/resource_error.hpp delete mode 100644 include/boost/sync/exceptions/runtime_exception.hpp delete mode 100644 include/boost/sync/exceptions/wait_error.hpp delete mode 100644 include/boost/sync/locks/lock_guard.hpp delete mode 100644 include/boost/sync/locks/lock_guard_fwd.hpp delete mode 100644 include/boost/sync/locks/lock_options.hpp delete mode 100644 include/boost/sync/locks/shared_lock.hpp delete mode 100644 include/boost/sync/locks/shared_lock_fwd.hpp delete mode 100644 include/boost/sync/locks/unique_lock.hpp delete mode 100644 include/boost/sync/locks/unique_lock_fwd.hpp delete mode 100644 include/boost/sync/locks/upgrade_lock.hpp delete mode 100644 include/boost/sync/locks/upgrade_lock_fwd.hpp delete mode 100644 include/boost/sync/mutexes/mutex.hpp delete mode 100644 include/boost/sync/traits/is_condition_variable_compatible.hpp Success (78 ms @ 29-Mar-14 15:49:53) All appears OK, I:\modular-boost\libs\sync>git status HEAD detached from 44d4825 nothing to commit, working directory clean but the Tortoise GIT folder icon for /libs/sync is still red (Red ! icon means "modified"?) so I have committed to develop and it is still red :-( Fumbling, I have tried a git.exe submodule update --init -- "libs/sync" No submodule mapping found in .gitmodules for path 'libs/sync' git did not exit cleanly (exit code 1) (875 ms @ 29-Mar-14 17:09:10) Suggestions as to what I am misunderstanding/doing wrong to get develop branch to a fully uptodate state? Paul PS I have a similar problem with /tools/regression/build where there appear to be no modifications and nothing to revert, but the build folder icon is red, leaving me uneasy that a red face will follow ;-) I've added the build vcide folder items and committed and finally the icon is green. This doesn't feel something that I should have to do in order to get uptodate... so I must be missing something. It would be quicker to clone from scratch! Paul A. Bristow Prizet Farmhouse Kendal UK LA8 8AB +44 01539 561830 07714330204

2 2

Post-git forking process
by Sohail Somani 29 Mar '14

29 Mar '14

Hey all, Often, I find bugs in Boost that I need to patch manually before the next release. What I used to do before was keep a copy of Boost in my source tree which made this easier: just patch it directly. This made it easy to modify, but annoying to post patches and honestly, they just got lost most of the time. With Git, it should become easier to contribute said patches as well as pull in whichever particular changes I need. However when I attempted such a fork recently, I was a bit lost. As I understood it, the process should have been: 1. Create a fork of https://github.com/boostorg/boost and use this fork in my project 2. Create a fork of the library/libraries I wanted to patch 3. Update the submodules in my boostorg/boost fork to point to my forked libraries 4. Post a pull request for the respective libraries. Once the changes have been accepted, point back to the official boostorg repo I failed terribly, no doubt due to PEBKAC. Is there a chance that someone could write a tutorial or a how-to guide for the recommended process of forking Boost with Git? The main thing I need is the ability to have a patched version of Boost that I can use while the patches are being reviewed/accepted/rejected. Thanks, Sohail

6 20

[variant] assign and access the assigned value simultaneously
by feverzsj 28 Mar '14

28 Mar '14

hi list, for common case: boost::variant<Val,...> var; var = val; Val& v = boost::get<Val>(var); why not supply a interface like: Val& v = var.assign(val); for simplity, and the unnecessary "get" is also elimited. regards -- View this message in context: http://boost.2283326.n4.nabble.com/variant-assign-and-access-the-assigned-v… Sent from the Boost - Dev mailing list archive at Nabble.com.

5 5

1.56 release
by Barend Gehrels 27 Mar '14

27 Mar '14

Hi, The last message about the release schedule was (if I see it correctly) at January 15, and the calendar is empty. Is there more news about the release planning? I'm especially interested in the planning for the 1.56 release. Thanks, Barend Gehrels

9 16

[Parallel Algorithms] Queries regarding the Boost. Thread / Parallel Algorithms
by Naveen 27 Mar '14

27 Mar '14

Hi, I am look into various available reduction algorithms available to make a performance comparison for boost threads. I made a decent search on all the documents available for various reduction algorithms. If there are any specific implementations, please share the details. Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

1 0

Creating a new(-ish) library in modular boost ?
by Paul A. Bristow 26 Mar '14

26 Mar '14

I have fumbled (and stumbled) trying to create a revised-possibly-to-be-proposed for Boost library in the new modular boost format. So far I have created a folder /modular-boost/svg_plot And copied all the files into it in the new modular format and got the library working OK (compiling, tests, examples, docs etc). Then I created my repository by doing I:\modular-boost\libs>git init svg_plot Initialized empty Git repository in I:/modular-boost/libs/svg_plot/.git/ Then I GIT Added various files, and committed these to my repository. (Should I have pushed?) I tried to tell git to ignore some files like log files, etc (but I don't get a .gitignore file when I think I should - the Tortoise GIT window has various options like .gitignore in the repos root, but no 'OK' button, just a close??? I have a .gitignore at /modular-boot/ but it does not contain the files to ignore (and I would not expect it to). I've set the GITHub default storage directory to \modular-boost\libs but a scan for repos only find modular-boost I went to my GITHUB page and followed the invitation to drag the svg_plot repository onto the page. Some files are listed (but ones I want to ignore) and then all options are unresponsive or greyed out and eventually GITHUB hangs and then crashes :-( So both GIT and I are confused ! Can anyone suggest what sequence of actions I should take to set this up? Thanks Paul Paul A. Bristow Prizet Farmhouse Kendal UK LA8 8AB +44 01539 561830 07714330204

2 2

[range] Proposal: addition of front(), back(), at(), operator[]
by Adam Wulkiewicz 26 Mar '14

26 Mar '14

Hi, I propose to add the functions described below to the Boost.Range. I found the use of those very convenient WRT the corresponding use of begin() and end(), and a lot more readable. 1. front() returning the reference to the first element precondition (assert): !empty(rng) return *begin(rng); 2. back() returning the reference to the last element precondition (assert): !empty(rng) For BidirectionalRange return *(--end(rng)); For SinglePassRange it could iterate over the range and return the reference to the last element 3. at() returning the reference to the i-th element of the range precondition (throw std::out_of_range or assert): index < size(rng) For RandomAccessRange return *(begin(rng) + index); For SinglePassRange it could iterate over the range and return the required element For me, non-throwing at() would be more useful however this behavior won't be intuitive. So the following should also be provided: 4. sub(), subscript(), el(), element(), at_index(), at_(), index(), indexed(), access(), operator[], ...? the implementation of indexing operator[] same as 3 but instead of throwing an assert would be used The use of operator[] could be similar to this: { using boost::range::subscript_operator; rng[index]; } So not very convenient. But maybe you have a better idea? Regards, Adam

6 14

Re: [boost] [Parallel Algorithms] Queries regarding the Boost.Thread / Parallel algorithms
by Naveen 26 Mar '14

26 Mar '14

Hi, In my previous mail, I was speaking about the compiler optimization dependencies while creating a parallel version of the following code: DO J = 1, 100 DO I = 1, 100 DO K = 1, 100 C(I,J) = C(I,J) + A(I,K) * B(K,J) END DO END DO END DO As you know, the above code is the 2D-Matrix multiplication logic. I tested the above logic using various compiler optimization levels from -o0, -o1, -o2 and -o3. There were no problems due to the compiler optimizations. I have used pthreads to convert the serial code to its parallel version. Initially, the serial version took 72sec to execute and the parallel version with 4 threads took around 16sec. Please have a look at the attachment for the complete working source code. The question now is, I have used the threads as shown in the pseudo code below: int main() { create_pthreads(assign_thread_ID, call the function); join_threads(thread_ID); destroy_threads(); } function_called_by_each_thread(thread_ID) { all_computations; } All thread documentation reaches to some sort of options like this. Is this the correct way to approach the problem for creating parallel algorithms for boost threads. Please clarify, whether there are any alternative approaches available to achieve parallelism using threads. PS: Please have a look at the code for further details Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

2 1

Re: [boost] [Parallel Algorithms] Queries regarding the Boost.Thread / Parallel algorithms
by Naveen 26 Mar '14

26 Mar '14

Hi, Based on understanding the proposal, I'm just curious to know how we are gonna use the compiler optimizations when creating the parallel_xxx functions. Say any normal loop would be optimized by the compiler using any of the loop transformations like loop interchange, loop unrolling, loop fusion etc., let us consider a sample FORTRAN code to : DO J = 1, 100 DO I = 1, 100 DO K = 1, 100 C(I,J) = C(I,J) + A(I,K) * B(K,J) END DO END DO END DO which may or may not be optimized by the compiler into something like this DO K = 1, 100 DO I = 1, 100 DO J = 1, 100 C(I,J) = C(I,J) + A(I,K) * B(K,J) END DO END DO END DO so, when we try to introduce our parallel algorithm in to the loop containing J, it may be interchanged depending upon the compiler properties. So, should we plan for such scenarios. When we try to introduce our parallel functions the only way possible is to make the compiler optimizations temporarily inactive on those tasks. But, by doing so the performance of the application will be affected. Should we really tackle this scenario or am i looking into a completely irrelevant picture? Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

3 2

[bind] BOOST_BIND_NO_PLACEHOLDERS and unspecified-placeholder-type's
by Joaquín Mª López Muñoz 25 Mar '14

25 Mar '14

Hello, The non-documented BOOST_BIND_NO_PLACEHOLDERS macro suppresses the definition of (anonymous namespace)::_1, (anonymous namespace)::_2, etc., presumably to cope with potential clashes with other libs' placeholders such as Boost.Lambda's when in the presence of using directives. The problem with this is that using Boost.Bind without placeholder names requires writing code such as bind(f,boost::arg<1>(),boost::arg<2>()); but boost::arg<> is not documented!! (in fact, Boost.Bind synopsis explicitly defines _1, _2 etc. as having undocumented types unspecified-placeholder-type-1, unspecified-placeholder-type-2 and so on). Maybe Boost.Bind documentation can be changed so that BOOST_BIND_NO_PLACEHOLDERS and boost::arg<> are documented? Thank you, Joaquín M López Muñoz Telefónica Digital ________________________________ Este mensaje se dirige exclusivamente a su destinatario. Puede consultar nuestra política de envío y recepción de correo electrónico en el enlace situado más abajo. This message is intended exclusively for its addressee. We only send and receive email on the basis of the terms set out at: http://www.tid.es/ES/PAGINAS/disclaimer.aspx

4 5

[ANN] CppCon 2014 Call for Submissions
by Boris Kolpackov 25 Mar '14

25 Mar '14

Hi, CppCon is the annual, week-long face-to-face gathering for the entire C++ community. The conference is organized by the C++ community for the community and so we invite you to present. Have you learned something interesting about C++, maybe a new technique possible in C++11? Or perhaps you have implemented something cool related to C++, maybe a new C++ library? If so, consider sharing it with other C++ enthusiasts by giving a talk at CppCon 2014. Submissions deadline is May 15 with decisions sent by June 13. For topic ideas, possible formats, and submission instructions, see the Submissions page: http://cppcon.org/submissions/ Hope to hear you speak! Boris

1 0

[Fusion] Can repetitive_view support "at" function?
by TONGARI J 25 Mar '14

25 Mar '14

I know it's a bit weird for asking repetitive_view which cannot model BidirectionalSequence to support the functionality of RandomAccessSequence, but it seems quite reasonable to support "at" when the underlying sequence models RandomAccessSequence even though repetitive_view cannot model RandomAccessSequence itself. Thoughts?

2 2

[algorithm] Test failure in C++14
by Ben Pope 25 Mar '14

25 Mar '14

"clang++-3.4" -c -x c++ -std=c++1y -stdlib=libc++ -O0 -g -fno-inline -Wall -g -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_TEST_DYN_LINK=1 -DBOOST_TEST_NO_AUTO_LINK=1 -I".." -o "/home/ben/development/boost/test/build/results/boost/bin.v2/libs/algorithm/test/is_permutation_test1.test/clang-linux-3.4~c14_libc++/debug/is_permutation_test1.o" "../libs/algorithm/test/is_permutation_test1.cpp" In file included from ../libs/algorithm/test/is_permutation_test1.cpp:13: ../boost/algorithm/cxx11/is_permutation.hpp:178:6: error: declaration conflicts with target of using declaration already in scope bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ^ /usr/include/c++/v1/algorithm:1374:1: note: target of using declaration is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, ^ ../boost/algorithm/cxx11/is_permutation.hpp:104:12: note: using declaration using std::is_permutation; // Section 25.2.12 ^ ../boost/algorithm/cxx11/is_permutation.hpp:205:6: error: declaration conflicts with target of using declaration already in scope bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ^ /usr/include/c++/v1/algorithm:1361:1: note: target of using declaration is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, ^ ../boost/algorithm/cxx11/is_permutation.hpp:104:12: note: using declaration using std::is_permutation; // Section 25.2.12 ^ 2 errors generated. I haven't looked in detail, but it looks like those two overloads were added in C++14 and need guarding with a suitable #if __cplusplus >= C++1Y_version_here Ben

3 5

[GSoC 14] Request community to rank proposals
by Niall Douglas 24 Mar '14

24 Mar '14

Dear Boost Community, The Google Summer of Code 2014 proposals for Boost are in, and we would deeply appreciate the community's help in ranking the proposals according to merit before the 1st of April. To vote, the process is easy: 1. Go to this page https://www.google-melange.com/gsoc/homepage/google/gsoc2014 and click the "Log in" button under Mentors and Administrators. 2. Now click "Create Profile" on the same page. Note that even if you registered last year, you must register again in 2014. Fill in the form. Note that after submitting it drops you at "Edit Profile", which is confusing. 3. Click "My Dashboard", then "Connect with organisations". 4. Choose "Boost C++ Libraries". 5. In the message box, write this: "I am a member of the Boost community and the email(s) I normally post to boost mailing lists with is <email>" filling in the email address(es) you normally use to post to boost mailing lists. This lets us verify that you are indeed a long standing member of the Boost community. 6. Once we approve your request, you will get an email with the subject "Welcome as organisation member". You can now return to the Dashboard on the GSoC website where there will be a new item "Proposals". 7. Work your way through as many of the 42 proposals as you can. You can score them using the stars at the bottom of each proposal page, taking care to read any comments by the mentors and students if present. PLEASE try to rank some of the lowest scored proposals, every year we get a lot of people who only rank the top five and don't bother with the rest. Try to score on the basis of (i) proposal quality and your best estimate of the student's capability (ii) if the student came early to the mailing lists to ask for help writing the proposal (the mentors who helped them with their proposals have usually indicated this in the private comments) (iii) usefulness/appropriateness of the feature or work being proposed. Remember a good GSoC is more about getting promising new engineers into Boost and C++ than necessarily getting code to pass Boost peer review in a single summer. 8. Optional: If a proposal looks especially great to you and you feel able to mentor a student this year, please slide the "wish to mentor" button. Just because a proposal already has willing mentors does NOT mean you should not add yourself - we have at least two mentors with many attached very highly ranked proposals and we really don't want to have to reject an outstanding proposal just because we can't find the mentors for it as no mentor can realistically mentor more than two projects simultaneously. As you know, Google Summer of Code is usually worth $35,000 - $50,000 to Boost each year, and a successful GSoC raises our visibility and reputation in the wider open source community. Our thanks to you in advance for taking the time to vote. Niall Douglas Boris Schäling --- Boost C++ Libraries Google Summer of Code 2014 admin https://svn.boost.org/trac/boost/wiki/SoC2014

1 0

[build][testing] Auto-generated tests not present in reports
by Andrey Semashev 24 Mar '14

24 Mar '14

Hi, Recently I added auto-generation of compile tests which basically check that every Boost.Log public header is self-contained (i.e. can be included on its own, does not have any missing includes etc.) This is done in the test/Jamfile.v2 as follows: rule test_all { local all_rules = ; local file ; local headers_path = [ path.make $(BOOST_ROOT)/libs/log/include/boost/log ] ; for file in [ path.glob-tree $(headers_path) : *.hpp ] { local rel_file = [ path.relative-to $(headers_path) $(file) ] ; if ! [ MATCH "detail/(.*)" : $(rel_file) ] { #ECHO $(rel_file) ; all_rules += [ compile compile/self_contained_header.cpp : <define>"BOOST_LOG_TEST_HEADER=$(rel_file)" : self_contained_header/$(rel_file) ] ; } } ... other test targets are also generated here return $(all_rules) ; } This rule also generates targets for other tests, including compile tests. It works locally, I can see the generated tests for all headers being compiled. However, I made this change quite some time ago but still I don't see these tests in the test reports table. I can see other tests which are generated by the same test_all rule, so it works. What could be the problem? Any ideas? Thanks.

2 3

[Boost][Range] Non-mutating algorithm on non const qualified range
by Albert Yiamakis 24 Mar '14

24 Mar '14

Hello, In the users mailing list I have remarked that this piece of code: https://gist.github.com/Kojirion/9714131 will fail to compile, without providing 'mutable' iterators. I have since found out it will also compile by simply const qualifying the dummy object. (ie const Dummy dummy;) The reason is that without it this: is_const<Dummy> gets evaluated to false, resulting in boost::mpl::eval_if_c<false, boost::range_const_iterator<Dummy>, boost::range_mutable_iterator<Dummy> > Surely this is not intended behavior and it should be possible to use a range that has only const iterators in a non-mutating algorithm without const qualifying it? Albert

2 1

[GSoC 2014] Boost.Binaries Proposal (was " Boost.Binaries")
by Antony Polukhin 23 Mar '14

23 Mar '14

2014-03-21 16:31 GMT+04:00 Flavius Condrea <flavius.condrea(a)gmail.com>: > Hi everyone, > > I am very excited to have the opportunity to contribute to Boost C++ > Libraries. This is my proposal for GSoC 2014: > > https://docs.google.com/file/d/0B93eH9bi8ER0UHQtdDdFNFNoRGc/edit > I'd like to mention that Flavius Condrea has successfully done the test task for that that project and has shown a good knowledge of a problem domain. I've already recommended to make optional the "implement specific encrypt/decrypt algo" part of proposal, put more efforts into work with binaries and thinking of additional functionality. I have enough free time to mentor student during this GSOC. I wish to mentor this project if there'll be no objections. Any ideas,comments and additions to proposal are welcomed. -- Best regards, Antony Polukhin

3 2

[config] std::regex unusable on gcc?
by Andrey Semashev 23 Mar '14

23 Mar '14

Hi, I'm trying to use std::regex and it's failing with even the simplest patterns: #include <regex> int main(int, char* argv[]) { std::regex rex("\\d"); return std::regex_match("1", rex); } g++ -std=c++11 rex_test.cpp -o rex_test ./rex_test terminate called after throwing an instance of 'std::regex_error' what(): regex_error Aborted (core dumped) GCC version: gcc version 4.8.1 (Ubuntu/Linaro 4.8.1-10ubuntu9). GCC 4.7.3 exhibits the same behavior. Replacing "\\d" pattern with "[0-9]" results in the same failure. It works with Boost.Regex, Boost.Xpressive and with clang 3.4 & libc++. Am I doing something wrong? If my use of std::regex is correct then for me this basically means that std::regex is unusable. In this case, could we define BOOST_NO_CXX11_HDR_REGEX in Boost.Config for all versions of libstdc++?

3 3

[algorithm] How to contribute?
by Maciej Poleski 23 Mar '14

23 Mar '14

Hello I want to spend some time working on Boost. I saw this: https://svn.boost.org/trac/boost/wiki/SoC2014#Algorithms. I have some "algorithms and data structures" knowledge and I think about implementing something that would be valuable to Boost users and give me opportunity to dig a bit into Boost. I think about something simple to start with (like Radix sort). If everything go ok, I will try something more complex (parallel algorithms?). Let me know if this piece of work would make sense. Feel free to give another propositions if something different is more important. Maciej Poleski

2 1

[GSoC 2014] Boost.Fixed-Point Proposal
by Nikhar Agrawal 22 Mar '14

22 Mar '14

Hello everyone, Kindly find my proposal for Boost.Fixed-Point on the following link. http://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2014/… I have been in touch with the potential mentors of this project for quite some time now. The proposal is a result of my discussions with them. Do let me know what you think of it. Any feedback would be invaluable. If there are any visibility issues, kindly let me know. Thank you. Nikhar

6 10

Boost.Binaries
by Flavius Condrea 21 Mar '14

21 Mar '14

Hi everyone, I am very excited to have the opportunity to contribute to Boost C++ Libraries. This is my proposal for GSoC 2014: https://docs.google.com/file/d/0B93eH9bi8ER0UHQtdDdFNFNoRGc/edit Best regards, Flavius Condrea

1 0

Teeks GCC test failures - multiprecision, spirit and others
by John Maddock 21 Mar '14

21 Mar '14

There are a lot of inscrutable failures from the Teeks machines running GCC on linux that I'm unable to reproduce (and aren't reproduced by other testers), for example: http://www.boost.org/development/tests/develop/developer/output/teeks99-03d… All the failures refer to is_convertible, and have an instantiation back trace that leads nowhere (a line that doesn't instantiate anything, and which refers to Boost.Range which multiprecision doesn't use). I see similar failures in the spirit tests as well. Is anyone able to reproduce these? Any ideas what may be going on? The failures are on the master branch as well if that helps. Many thanks, John.

5 5

[mpl] Merging 'develop' to 'master'
by Edward Diener 21 Mar '14

21 Mar '14

I would like to merge the mpl 'develop' changes to mpl 'master'. The develop changes have cycled long enough IMO for the merge to take place, without any problems showing up in the changes. There are two changes of my own and a number of Stephen Kelly eliminating support for very old compiler versions. The changes will clean up many obsolete workarounds for older versions of compilers that no one doing template metaprogramming should seriously use anymore. My own two changes fix some minor problems I ran into when testing clang with VC++ RTL on Windows. The changes make the MPL easier to understand. If there are no objections to the merge I will be glad to carefully do it myself, or Dave Abrahams/Alex Gurtovoy or others who have write access to MPL can do it. But I think it is important to get these changes into 'master', and tested in the 'master' regression tests, before the next Boost release.

3 6

Re: [boost] Boost.Binaries Project
by Antony Polukhin 21 Mar '14

21 Mar '14

Good! Now look, you need to write an officail proposal. here's a template: https://svn.boost.org/trac/boost/wiki/SoCSubmissionTemplate Send it to the boost(a)lists.boost.org. After that I'll tell the list that you have the qualification, finished test task and I'm willing to mentor you. Get hurry! March 21 is a deadline for student application. A few thoughts about the Binary project: Signing/shifrating a whole section is good idea, I like it. The very initial idea was to allow user specify code block or variable location to shifrate/checksum. That's what for the task with PUT_HELLO_THERE_IN_BINARY was meant for. Inserting markers into binary we'll be able to find code blocks later (find(binary, "Hello there!")). As you've mentioned compiler eliminates dead code, however there is a way to bypass it: if we put the jmp instruction directly in assembly block, compiler will not eliminate it (at least 3 years ago it was not eliminating). Binary library must consist of two parts: postprocessing: tools to find markers, modify marked variables, change sections and entry point... core: markers for code, markers for variables, functions to do something at code block enter/leave. 2014-03-20 20:43 GMT+04:00 Flavius Condrea <flavius.condrea(a)gmail.com>: > Hi Antony, > > > I solved the task you gave me. I attached the source code where you will > find a comment, too. > > I worked last summer at Bitdefender as a full-time Malware Researcher. I > studied a lot of reverse engineering, Windows API and basic Python. While > working there, I made researches on several malwares, developing detection > and cleaning algorithms. > > Also, using Pin library, developed by Intel, I created a C++ > information-revealing application when running a binary file, such as: > > - For each call it obtains information about the instruction > call address , the procedure address, the procedure parameters including > the parameters values. > > - It shows if the function writes in memory and in case it does > the application obtains these information from memory > > - It reveals if a new process or thread is created > > Then I developed a plugin (written in Python) for IDA Disassembler > Application. The plugin inserts strategically-placed comments with the > information mentioned in above. This way, it can be done an easier > binary-file analysis. I attached a few print screens for seeing clearly > what actually my tool does. > > In the same time, if a binary file has encrypted code (most of the > malwares have this), the developed application dumps the image from memory > (in the memory the code is decrypted) and restore the PE Header and > imported functions for an easier IDA analysis of the malware. > > > Best regards, > > Flavius Condrea > > > PS: About this task: should I include it in the application form? > > > 2014-03-20 9:13 GMT+02:00 Antony Polukhin <antoshkka(a)gmail.com>: > > 2014-03-19 21:17 GMT+04:00 Flavius Condrea <flavius.condrea(a)gmail.com>: >> >>> Hi Antony, >>> >> >> Hi and welcome! >> >> >>> I was thinking to apply for Boost.Binaries project. Therefore lately >>> I made researches about what does this involve. I thought of a way to >>> encrypt an executable file and decrypt itself at runtime. I have the >>> following solution for this: >>> >>> 1. Create an encryption key and a decryption key (public or >>> private) >>> >>> 2. Iterate each section and see if it contains executable code and >>> then encrypt that section with the key from point one. >>> >>> 3. Create a new section that will contain the Original Entry >>> Point(OEP) and decryption algorithm that will be executed at runtime. The >>> decryption algorithm will contain (at the end) a jmp to the Original Entry >>> Point. The decryption key will be delivered separately. >>> >>> 4. Change the executable header (PE Header) so that makes it valid >>> after the effectuated changes (this involves modifying the entry point to >>> point to the decryption algorithm and other things) >>> >> Sounds pretty good. Looks like you've done some investigations and know >> what you are talking about. >> >> >> >>> Besides these things I am willing to add other features according to >>> your wishes. >>> >>> I am waiting for your opinion. >>> >> >> You've got a good start, but there is a requirement in community to give >> some small tasks for the student. >> If you are willing to start Boost.Binary project, then you need to make >> a main.cpp file, that contains the following >> >> #include <iostream> >> >> int main() { >> std::cout << "Hello "; >> goto foo; >> PUT_HELLO_THERE_IN_BINARY >> foo: >> std::cout << "World"; >> } >> >> There you must define PUT_HELLO_THERE_IN_BINARY macro to some code, that >> will put the "Hello there!" string between two calls to operator << in >> binary file. In disassembly there must be something like this: >> >> ... >> call basic_ostream::operator<< >> jmp foo >> 48 65 6c 6c 6f 20 74 68 65 72 65 21 ; 'Hello there!' in raw view >> foo: >> ... >> call basic_ostream::operator<< >> >> If you'll make your solution portable between MSVC and GCC compilers - >> you're almost certanly in :) >> >> >> -- >> Best regards, >> Antony Polukhin >> > > -- Best regards, Antony Polukhin

1 0

[git] Jamfile in repository
by Karsten Ahnert 20 Mar '14

20 Mar '14

Hi, can we put a Jamfile and/or a Jamroot in git repository of a boost library? We develop odeint in a separate github repository and we have a Jamroot there to build the library without the boost super-project. To merge our changes into the official boost odeint repository we want to pull from the development repository. I am a bit afraid that this Jamfile/Jamroot might disturb the build process of boost.

2 1

[Range] Are pull request in github being considered?
by Gonzalo BG 20 Mar '14

20 Mar '14

There are 3 pull-request in github with zero comments, none closed, and the oldest is 3 months old (one is from me). Are they being considered or should one submit patches for Boost.Range over trac? The FAQ doesn't say anything about the preferred way to submit patches and the modular boost documentation mentions pull-request as valid options, but I would like to be sure that I sent my patch through the preferred channel. Bests, Gonzalo BG

3 3

Standard c++ XML parser API (Boost.XML)
by Saksham Maheshwari 20 Mar '14

20 Mar '14

Hey guys, As part of this year's GSOC, I am interested in developing a Standard c++ XML parser for Boost (Boost.XML project in Ideas Page). What I have encountered till now, there are many libraries which could be used for parsing XML file, but there is no Standard XML API in c++ to do the same, contrary to other languages like Java or python. I think this is an appropriate place to discuss about this API and then develop it. Since a past couple of days, I have been reading and understanding the existing Boost.xml (sandbox project) and Arabica project. What I think now is that there is no need to develop such an API from scratch, it would just be a wastage of our resources, else we could use the existing codes to develop such an API. We can use multiple backends supported in Arabica API and merge it with out existing Boost.XML to make such a standard API, so that it can adapted to a wide range of existing XML libraries. Also, the SAX implementation of Boost.XML has to be changed and it has to be implemented/modified (i.e. reader API), comparing it with Arabica::SAX. DOM API is working very fine. So, according to me, the possible tasks will be 1. To enhance or change the SAX implementation of Boost.XML 2. To provide multiple backends to this API. But for now, I want to know what you guys think about the idea. Thanks, Saksham Maheshwari PS: I want to develop an API, not a library :-)

5 10

GSoC14: Projects currently needing potential mentors
by Niall Douglas 20 Mar '14

20 Mar '14

Dear Boost, The following GSoC 14 project proposals are currently lacking potential mentors. If you'd like to mentor one of these proposals, please go to https://www.google-melange.com/gsoc/homepage/google/gsoc2014, register as a mentor using the bottom link and ask the Boost C++ org for a role. 1. Suffix array Data Structure by Prabhat Kumar 2. Path Planner Library by Pritam Khan 3. Boost.Fixed-Point by Nikhar Agrawal Thanks, Niall --- Boost C++ Libraries Google Summer of Code 2014 admin https://svn.boost.org/trac/boost/wiki/SoC2014

2 2

Boost.Odeint Proposal GSoC 2014
by Animesh Gaitonde 20 Mar '14

20 Mar '14

Hi everyone, I have added my proposal on melange.Kindly have a look at it.I will be glad to receive a feedback regarding my proposal Here is a link to my proposal :-https://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2014/animesh371/5629499534213120 Let me know if there are any visibility issues. Regards & Thanks Animesh Gaitonde 4th year Undergraduate Bits-Pilani Goa Campus

1 0

[admin] Communicating with other write access contributors to a library
by Edward Diener 19 Mar '14

19 Mar '14

What is the proper way to communicate with other contributors of a library with write access under modular-boost in GitHub ? Is there a list of all write access members for a particular Boost library ?

2 2

[Parallel Algorithms] Queries regarding the Boost.Thread / Parallel algorithms
by NAVEEN NAMASHIVAYAM 19 Mar '14

19 Mar '14

Hi, I am interested in the implementation of parallel algorithms. From given documentation in http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2012/n3429.pdf I could understand the basic crux of the project. But the part which I was not able to figure from the documentation are these; 1. The type of network layer or the communication layer to be used. Can we make use of GASNet or ARMCI as the communication layer and build of ideas on it? Or do we have any specific library to work on this? 2. And the implementation of parallel_for and parallel_for_each, are we trying to mimic the available functionality from the parallel programming models like OpenMP? How far are these functions different from them. 3. Should we analyze about compiler optimizations. Because once these external parallel libraries are called; this necessarily means all the compiler optimizations within this parallel region should be excluded or else the complexity of the parallel library would be increased. Please confirm whether, my understanding is correct or am i looking at the project in a completely unrelated way. Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

2 1

Boost.BLAS
by Ashrith H Chinivar 19 Mar '14

19 Mar '14

Hey, This is Ashrith and I have a few queries related to the development of Boost.uBLAS library. I am currently undergoing a course on Linear Algebra and Matrices in my 3rd year of college and I would like to apply this in making kernel subroutines for Basic Linear Algebra under Boost.uBLAS. I hope to contribute by adding matrix multiplication, inversion algorithms and various other operations into the Boost. Please do let me know if I am missing something. I feel I may have over-seen some obvious prerequisites. Thank you, Ashrith

2 1

GSoC 2014: Boost Radix Sort
by Shahamat Mehdi 19 Mar '14

19 Mar '14

I am very interested in contributing to the radix sort algorithm in this year GSoC. I am currently studying Algorithms course and i have studied the radix sort algorithm and i really want it to be implemented. I want to ask from mentors weather we will be implementing it only on integers? or will it be a template function. I can think of doing it on integers, strings and doubles. But if there are others on which radix sort will perform better than count sort please let me know so that i could start thinking about that too. Thank you Shahamat Mehdi

1 0

setting option specific for compiler in Jamfile
by Oliver Kowalke 19 Mar '14

19 Mar '14

How can I apply an option in Jamfile which applies only for toolset-version onward? instead of writing: <toolset>gcc-4.7:<cxxflags>-fxyz <toolset>gcc-4.8:<cxxflags>-fxyz <toolset>gcc-4.9:<cxxflags>-fxyz I'd like to have a single line. <toolset>gcc-greater-eqal-4.7:<cxxflags>-fxyz best regards, Oliver

1 0

[git] Super-project workflow
by Brian Ravnsgaard Riis 19 Mar '14

19 Mar '14

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, According to https://svn.boost.org/trac/boost/wiki/SuperProjectWorkflow the super project should be loosely based on git-flow, which would mean that branch 'master' should currently reflect 1.55. There should be a branch 'latest', which maps to develop of all submodules, and a branch 'develop', which maps to master of all submodules. A quick glance at 'master' shows commits within the last day, updating submodule references. Also, quite a bit of pre-1.56 work has been done. Should this not happen on 'develop'? Or are we using a completely different workflow after all? How do I get 1.55 from the git repo atm? /Brian Riis -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.12 (GNU/Linux) Comment: Using GnuPG with Thunderbird - http://www.enigmail.net/ iQEcBAEBAgAGBQJTKEFjAAoJEFES4N8QrEodPysIAJKyI9d10uqHSsO1qqIRWJCA Xktr5Nfu4cZGtp59q7m8ydAZWTHK4r0dzdl0MB20Zb6Sn5fJ0LGrARb8GOse9CS/ IZ5dtIZBQ4w4X++yLdxqKmeM8Scm4CHI/uyQtK3x4jn+AYAHWIXcbLQXw2ESNFJ7 vVazOLdrWKV408C1f6tko5dycseeizlah1Svx0WGvmUkRrGUCxRL44AOhl1Nj0eL DLuMZ99a6YjKYE253pO63F4s32s8SMC542kl9RqLI10SzlEVHc9ed97/Qqab3xmn BYgYT3wIHCMNsKG6qBWH+3m3vqGczVCqi11uYeAazTgqsEmJ4p3XQZIABFvrsr8= =YJha -----END PGP SIGNATURE-----

2 2

[fusion] Feature Request: alias templates
by Joe Gottman 19 Mar '14

19 Mar '14

I recently started using boost::fusion, and one feature that would make it much more user friendly is template aliases like the ones that were added for the standard type traits in C++14. For example, template <typename I> using deref_t = typename result_of::deref<I>::type; Joe Gottman

1 0

[GSoC][Trie][Radix sort]
by matijas9 19 Mar '14

19 Mar '14

Hello, On list of items for Google Summer of Code is "Trie data structure, extending the work done during GSoC 2013". I would like to know what exactly mean "extending the work", i.e. what is to do in implementation of trie from previous GSoC. Secondly, I would like to add to my proposition of project for GSoC radix sort algorithm. I would like to know how generalized can be types of input datas for radix sort. Elements of sequences which are sorted must belong to some finite universe and should be comparable in constant time, so in my opinion radix sort can sort only sequences of natural numbers well. Therefore I think about preparing version of radix sort sorting sequences of numbers and another version sorting strings (which can be interpreted as sequences of numbers). Can someone think of some other, usefull types of objects that can be sorted using radix sort? Best Regards, Mateusz Wasylkiewicz

2 1

[Parallel Algorithms] Queries regarding the Boost.Thread / Parallel algorithms
by Naveen 18 Mar '14

18 Mar '14

Hi, I am interested in the implementation of parallel algorithms. From given documentation in http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2012/n3429.pdf I could understand the basic crux of the project. But the part which I was not able to figure from the documentation are these; 1. The type of network layer or the communication layer to be used. Can we make use of GASNet or ARMCI as the communication layer and build of ideas on it? Or do we have any specific library to work on this? 2. And the implementation of parallel_for and parallel_for_each, are we trying to mimic the available functionality from the parallel programming models like OpenMP? How far are these functions different from them. 3. Should we analyze about compiler optimizations. Because once these external parallel libraries are called; this necessarily means all the compiler optimizations within this parallel region should be excluded or else the complexity of the parallel library would be increased. Please confirm whether, my understanding is correct or am i looking at the project in a completely unrelated way. Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

1 0

Queries regarding the Boost.Thread / Parallel algorithms
by Naveen 18 Mar '14

18 Mar '14

Hi, I am interested in the implementation of parallel algorithms. From given documentation in http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2012/n3429.pdf I could understand the basic crux of the project. But the part which I was not able to figure from the documentation are these; 1. The type of network layer or the communication layer to be used. Can we make use of GASNet or ARMCI as the communication layer and build of ideas on it? Or do we have any specific library to work on this? 2. And the implementation of parallel_for and parallel_for_each, are we trying to mimic the available functionality from the parallel programming models like OpenMP? How far are these functions different from them. 3. Should we analyze about compiler optimizations. Because once these external parallel libraries are called; this necessarily means all the compiler optimizations within this parallel region should be excluded or else the complexity of the parallel library would be increased. Please confirm whether, my understanding is correct or am i looking at the project in a completely unrelated way. Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

1 0

Re: [boost] Welcome as organization member - HELP !!!!!
by Vicente J. Botet Escriba 18 Mar '14

18 Mar '14

Hi, I have reached to see the projects now, Thanks, Vicente Le 18/03/14 22:27, Niall Douglas a écrit : > Ability to assign mentors opened today, I've assigned all the mentors > to projects in so far as I know which. > > Niall > > > On 18 Mar 2014 at 20:56, Boris Schäling wrote: > >> >>> -----Original Message----- >>> From: Niall Douglas [mailto:s_sourceforge@nedprod.com] >>> Sent: Dienstag, 18. März 2014 02:04 >>> To: Vicente J. Botet Escriba >>> Cc: Boris Schäling >>> Subject: Re: Welcome as organization member - HELP !!!!! >> Hi Niall, >> >>> It's possible. I am unable to accept proposals, so if you can't see >>> proposals until I accept them, that would explain it. >>> >>> I assume that only after submission closes will I be allowed to >>> accept proposals and then you can see them? Boris: you were admin >>> last year, do you know the answer? >> Vicente is a registered mentor but can't see any proposals? Unfortunately I >> don't remember anymore whether that was the case for us last year, too, >> while we were still in the student application period. Can you assign >> Vicente as a possible mentor to a proposal (the one he is interested in)? >> >> Boris >> >>> [...] > > --- > Boost C++ Libraries Google Summer of Code 2014 admin > https://svn.boost.org/trac/boost/wiki/SoC2014 > >

1 0

[GSoC 2014] Boost.odeint application
by Razvan Florea 18 Mar '14

18 Mar '14

Hello, I have added on google melange the first version of my application for Boost.odeint library. You can find it here: [1]. Please take a look on it and give me feedback in order to change the weakest parts. [1]: https://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2014… Best regards, Razvan Florea

1 0

GSoC Summer Project Queries.
by Ashrith H Chinivar 18 Mar '14

18 Mar '14

Hey, This is Ashrith and I have a few queries related to the development of Boost.uBLAS library and the general expectation for the proposal with respect to the algorithmic implementation for Google SoC 2014. I hope the reply will help me narrow down on my options for this year's GSoC. The linear algebra library for Boost which expects the developer to perform Matrix multiplication and various mathematical actions w.r.t the vector spaces and matrix multiplication. Can this be done in C++ with no prior knowledge of MATLAB? I am however, very interested in contributing to the project from algorithmic point of view and including RADIX sort and various other algorithms or short-cuts that would facilitate C++. I am currently undergoing a course on Linear Algebra and Matrices. So I would e happy to consider this as the option to apply for this year's GSoC. So please reply regarding the Boost.uBLAS and other possible implementaions that is expected or which I can submit through my synopsis/proposal. I would be glad to join in on the IRC if that is possible. Thank you, Ashrith H C

1 0

GSoC 2014: boost radix sort
by Shahamat Mehdi 18 Mar '14

18 Mar '14

I have studied radix sort and it does not seem to be a very difficult task. I want to know what exactly will be required from me in this task. It will be highly appreciated if i get a link to the work that is already done so i could understand how to take it ahead. Thanks

1 0

Re: [boost] Arithmetic (opaque) type without implicit conversions
by Gonzalo BG 18 Mar '14

18 Mar '14

> What is the Arithmetic concept? Types that supports all operations provided by integral and floating point types "model" the Arithmetic "constraint" (better than the word concept in this context), as checked by std::is_arithmetic<T> [0], which is defined as std::is_integral<T> || std::is_floating_point<T>. I don't static_assert(std::is_arithmetic<T>) to allow other types that might be viable but for which there is not a specialization of std::is_integral/std::is_floating_point. [0] http://en.cppreference.com/w/cpp/types/is_arithmetic On Tue, Mar 18, 2014 at 5:38 PM, Robert Ramey <robertmacleranramey(a)gmail.com > wrote: > > > On Tuesday, March 18, 2014 8:42:02 AM UTC-7, Gonzalo BG wrote: >> >> Arithmetic<T, U = void> is a type that: >> - models the Arithmetic concept, >> > > What is the Arithmetic concept? > > >> - wraps a T that also models the arithmetic concept, and >> - can be used as a strong/opaque typedef for T. >> >> It is thus similar to Boost.Serialization's BOOST_STRONG_TYPEDEF, >> - but without any implicit conversions (only explicit ones), and >> - it supports move semantics and C++14 constexpr. >> >> The code is here: https://github.com/gnzlbg/arithmetic_type >> The Readme.md is brief, so I refer you to there for more information. >> There are also some tests, although it could use some more. >> >> The LoungeC++ and Morwen(a)codereview.stackexchange deserve credit for >> some >> improvements on the implementation. >> The remaining mistakes are only mine. >> So please, destroy my implementation if you find any mistakes. >> >> I find it useful to strongly type interfaces that involve indices, e.g. >> in >> an octree implementation where child/neighbor indices for a node with >> different types result in clear compilation errors if mixed. >> >> I hope you find it useful too. >> >> Bests, >> Gonzalo BG >> >> _______________________________________________ >> Unsubscribe & other changes: http://lists.boost.org/ >> mailman/listinfo.cgi/boost >> >

1 0

GSoC boost help
by Shahamat Mehdi 18 Mar '14

18 Mar '14

I want to work on radix sort algorithm for boost in this GSoC. Please tell me how can I contact a mentor. I have a some questions before i can submit my proposal. So, please help me.

2 1

Arithmetic (opaque) type without implicit conversions
by Gonzalo BG 18 Mar '14

18 Mar '14

Arithmetic<T, U = void> is a type that: - models the Arithmetic concept, - wraps a T that also models the arithmetic concept, and - can be used as a strong/opaque typedef for T. It is thus similar to Boost.Serialization's BOOST_STRONG_TYPEDEF, - but without any implicit conversions (only explicit ones), and - it supports move semantics and C++14 constexpr. The code is here: https://github.com/gnzlbg/arithmetic_type The Readme.md is brief, so I refer you to there for more information. There are also some tests, although it could use some more. The LoungeC++ and Morwen(a)codereview.stackexchange deserve credit for some improvements on the implementation. The remaining mistakes are only mine. So please, destroy my implementation if you find any mistakes. I find it useful to strongly type interfaces that involve indices, e.g. in an octree implementation where child/neighbor indices for a node with different types result in clear compilation errors if mixed. I hope you find it useful too. Bests, Gonzalo BG

1 0

[ANN] Registration for CppCon 2014 is Open
by Boris Kolpackov 18 Mar '14

18 Mar '14

CppCon, The C++ Conference Opening Keynote by Bjarne Stroustrup September 7–12, 2014 Bellevue, Washington, USA Registration is now open for CppCon 2014 to be held September 7–12, 2014 at the Meydenbauer Center in Bellevue, Washington, USA. This year the conference starts with the keynote by Bjarne Stroustrup titled "Make Simple Tasks Simple!" CppCon is the annual, week-long face-to-face gathering for the entire C++ community. The conference is organized by the C++ community for the community. You will enjoy inspirational talks and a friendly atmosphere designed to help attendees learn from each other, meet interesting people, and generally have a stimulating experience. Taking place this year in the beautiful Seattle neighborhood and including multiple diverse tracks, the conference will appeal to anyone from C++ novices to experts. What you can expect at CppCon: * Invited talks and panels: CppCon keynote by Bjarne Stroustrup will start off a week full of insight from some of the world’s leading experts in C++. Still have questions? Ask them at one of CppCon's panels featuring those at the cutting edge of the language. * Presentations by the C++ community: What do embedded systems, game development, high frequency trading, and particle accelerators have in common? C++, of course! Expect talks from a broad range of domains focused on practical C++ techniques, libraries, and tools. * Lightning talks: Get informed at a fast pace during special sessions of short, informal talks. Never presented at a conference before? This is your chance to share your thoughts on a C++-related topic in an informal setting. * Evening events and "unconference" time: Relax, socialize, or start an impromptu coding session. CppCon’s goal is to encourage the best use of C++ while preserving the diversity of viewpoints and experiences, but other than that it is non-partisan and has no agenda. The conference is a project of the Standard C++ Foundation, a not-for-profit organization whose purpose is to support the C++ software developer community and promote the understanding and use of modern, standard C++ on all compilers and platforms. For more information about the conference and to register, visit: http://cppcon.org

1 0

Boost.Compute v0.1 Released
by Kyle Lutz 18 Mar '14

18 Mar '14

I'm proud to announce the initial release (version 0.1) of Boost.Compute! It is available on GitHub [1] and instructions for using the library can be found in the documentation [2]. Boost.Compute is a GPGPU and parallel-programming library based on OpenCL. It provides an STL-like API and implements many common containers (e.g. vector<T>, array<T, N>) as well as many common algorithms (e.g. sort(), accumulate(), transform()). A full list can be found in the header reference [3]. I hope to propose Boost.Compute for review in the next few months but for I'm looking for more wide-spread testing and feedback from the Boost community (please note the FAQ [4] and design rationale [5] where I hope to have answered some common questions). Thanks, Kyle [1] https://github.com/kylelutz/compute [2] http://kylelutz.github.io/compute/ [3] http://kylelutz.github.io/compute/compute/reference.html [4] http://kylelutz.github.io/compute/boost_compute/faq.html [5] http://kylelutz.github.io/compute/boost_compute/design.html

9 11

[math] Extensive warnings when compiling with clang
by Brian Ravnsgaard Riis 18 Mar '14

18 Mar '14

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I realise these are not that serious, just annoying. See example below. I'm building with clang++, modified to default in C++11 mode. /Brian Riis clang-linux.compile.c++.with-pch bin.v2/libs/math/build/clang-linux-3.4/release/link-static/threading-multi/fminf.o In file included from <built-in>:168: In file included from <command line>:4: In file included from /home/brian/programming/boost/libs/math/build/../src/tr1/pch.hpp:9: In file included from ./boost/math/special_functions.hpp:15: In file included from ./boost/math/special_functions/airy.hpp:10: In file included from ./boost/math/special_functions/bessel.hpp:18: In file included from ./boost/math/special_functions/detail/bessel_jy.hpp:14: In file included from ./boost/math/special_functions/gamma.hpp:28: In file included from ./boost/math/special_functions/lanczos.hpp:1288: ./boost/math/special_functions/detail/lanczos_sse2.hpp:54:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d vx = _mm_load1_pd(&x); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:55:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d sum_even = _mm_load_pd(coeff); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:56:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d sum_odd = _mm_load_pd(coeff+2); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:57:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d nc_odd, nc_even; ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:57:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d nc_odd, nc_even; ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:58:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d vx2 = _mm_mul_pd(vx, vx); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:139:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d vx = _mm_load1_pd(&x); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:140:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d sum_even = _mm_load_pd(coeff); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:141:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d sum_odd = _mm_load_pd(coeff+2); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:142:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d nc_odd, nc_even; ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:142:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d nc_odd, nc_even; ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:143:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d vx2 = _mm_mul_pd(vx, vx); ^~~~~~~~~ 12 warnings generated. -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.12 (GNU/Linux) Comment: Using GnuPG with Thunderbird - http://www.enigmail.net/ iQEcBAEBAgAGBQJTKAqhAAoJEFES4N8QrEodTJ4H/1Hl2vyJ/Ki7JCK+YZsgwLvr MztU3H4IFfaUf4+EXPjnJbhu5f19Fhupn7RH6PLIJElUBYQGvKSEp2DRNddalrDK vKZVxGe25pDAD1HOsPRKH+74xXqSfeAAbYi/PvwusXLwhS2kYH+k6KzdXn6POsEe PrdweMusGLp9TH36DYNM59+SU16oGPdOj53acZSG06ftG8+1FcFXtb2jTMZY7fZX l/3gUBkQ7kl7ZkAoezNNlKcb/r+dIXNfb2oaV7TwSUGD+7ioQvvsSFjr2ytl3cb8 q01hLY4ih2mjMkrvCfflbAwGXH6noyEm/ySmjAxxekyCyP4na/W648+hAhnlimg= =vvz8 -----END PGP SIGNATURE-----

2 2

GSoC '14 - Boost.Compute
by Roshan 18 Mar '14

18 Mar '14

Hey, I wish to propose a project regarding Boost.Compute. I would love to hear your views on it. Here is a link to my proposal: Dropbox Link <https://www.dropbox.com/s/tkpdomvoxpzisg7/GSoC.pdf> Thanks. -- Warm regards Roshan

1 0

GSoC Boost/Monads
by Дмитрий Карпов 17 Mar '14

17 Mar '14

Hello! My name is Dmitry. I have submitted my prorposal in GSoC. But I'd like change it little bit. What is your expectation from this project? I'd like: - to implement common monad's interface: - functions for async and futures (then(), is_ready and I hope I will have enough time to implement some others) - make some experiment with Either and Maybe monads to implement fmap() for smart pointers and containers Should I keep in my mind some other tasks? Can you advise something about State monad? What should be it used for, input/output or, maybe, for secure operation with implicit type conversion or for something else? This is link to my proposal: http://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2014/… -- Best regards, Dmitry Karpov Cell phone: +7 905 271 94 14

2 1

[Boost.Functional][GSoC] Boost.Functional / Monad project proposal
by Benjamin, John C. (MU-Student) 17 Mar '14

17 Mar '14

Name: John Benjamin College/University?: University of Missouri - Columbia Course/Major?: Computer Science Degree Program (B.Sc., M, Sc., PhD, etc.) M.S. Email: jcb638(a)mail.missouri.edu Homepage: github.com/jchbenjamin Availability: How much time do you plan to spend on your GSoC? 30-40 hours per week What are your intended start and end dates? May 16 - August 19 What other factors affect your availability (exams, courses, moving, work, etc.)? I will be doing 3 credit hours of research Background Information I am a master's student in computer science. I've been hacking and programming computers since I was in Junior High. Please summarize your educational background (degrees earned, courses taken, etc.). I have a B.S. in economics from the University of Kansas. Between Spring 2012 and Spring 2013 I did post-baccalaureate study in Computer Science. I have the equivalent coursework for an undergraduate major in Computer Science. Please summarize your programming background (OSS projects, internships, jobs, etc.). I work for a lab associated with the government on campus where we perform remote sensing work across large sets of satellite data. The focus is on high-performance computing and database design. There is a large SVN repository of C++ code for which I am a regular contributor. Please tell us a little about your programming interests. Please tell us why you are interested in contributing to the Boost C++ Libraries. I am interested in Boost because I have been working with Boost for my work and for many classes. Boost has always been the most satisfying library. It is general purpose, always fast, and really attuned to the needs of the programmer. It is an amazing blend of practical use, solid theory, and good engineering. It would be a huge honor to be able to work with this project. What is your interest in the project you are proposing? I am interested in helping to implement a common monad framework for Boost. Have you done any previous work in this area before or on similar projects? I have worked with Haskell for a year with Prof. William Harrison at my school. Last summer I did research with Haskell and wrote a nifty little program that uses a state monad. What are your plans beyond this Summer of Code time frame for your proposed work?. I hope to continue contributing with this work and to help foster awareness and use of monads. I think that Haskell is on to something with some of its language features. Features like lambdas are already becoming part of the new way of structuring programs. I think monads are a powerful way to reason about and understand the properties of a program. But I don't think a full-blown functional language is practical or necessary for most problems. When typical programmers see that Monads can fit into a language used in industry and that builds on what they already know and expect of the behavior of a language they will be more open to thinking about higher level structural concepts from Category Theory. Please rate, from 0 to 5 (0 being no experience, 5 being expert), your knowledge of the following languages, technologies, or tools: C++ :: 4 C++ Standard Library :: 4 Boost C++ Libraries :: 3 Subversion :: 3 What software development environments are you most familiar with (Visual Studio, Eclipse, KDevelop, etc.)? Eclipse, gnu autotools What software documentation tool are you most familiar with (Doxygen, DocBook, Quickbook, etc.)? Doxygen Project Proposal The proposal is not too creative, just what is described in Boost.Functional / Monads Please provide a description of your proposed work. I will work to make sure the Monad implementation meets the actual description of a monad. One thing I think is important is to be able to have recursive monads that are efficient. The IO monad for example is particularly amenable to recursive structures that allow for easy sanitation of input and output. Proposed Milestones and Schedule Rough draft of milestones and schedules: May 19 - June 2 : review Monads and Category Theory. Understand the current state of Boost.Functional / Monad. Read through Pure and discuss how our implementation is different. June 2 - June 30 : Propose, discuss, and finalize working prototype which implements all the required existing instances of monads and meets syntactic conventions. Begin coding July 1 - July 21 : Implement finalized proposal and prepare for testing July 21- end of summer : test and document my work Please provide any feedback. If you need more information or a more specific proposal please let me know. John Benjamin?

2 1

GSoC 2014 proposal for Boost.Chrono/Date
by Arun Sori 17 Mar '14

17 Mar '14

Hey all, I am interested in the Boost.Chrono/Date project for this year's GSoC. I've made a proposal here<https://docs.google.com/document/d/1jzqAuVh_GZL2TihIlMlG6qX6IfMfOrRw1hOfUre…>, with some good help from the project's mentor. It's open for reviews. Please have a look and point out any mistakes,typos or anything else I am missing. Any feedback is much appreciated. Thanks, Arun

1 0

[GSoC 2014] Http Server Proposal
by Vinícius dos Santos Oliveira 17 Mar '14

17 Mar '14

Hi guys, I'm interested in develop an asynchronous HTTP server for Boost as part of GSoC. The design would be inspired from Node.js without the facilities or inspirations that were created to overcome JavaScript quirks and limitations. The library would be modular to the point where you can use only small parts of it and you could also replace components that you don't like. The library should have a small overhead to be used on embedded projects, but the modular design will allow you to use higher abstractions when such concerns don't exist. Of course it's difficult to find the "right" answer to the problem, then I'll limit the higher-abstractions to "proven" techniques and avoid controversial features. I hope to give more details in the middle of the next week. The library will not be about writing template-driven web pages, but it will be about HTTP and you will be able to do things like video live stream via HTTP (try to do that with Django or PHP). I also intend to allow a efficient use in multithreaded environment with high-load of data (although network applications are usually I/O bound and not CPU bound). Of course it'll be possible to use WebSocket with this library too. Another thing I want to allow is to mock HTTP requests and transparently replace parts of the stack without affecting already written code. The purpose of this feature is to allow other transport mechanism such as FastCGI and also provide a future-proof approach by better allowing HTTP/2.0 when released. I would implement such library on top of Boost ASIO and I'd include facilities that I'm sure would work on long-term. Because the success of such project is very sensible to the chosen design, I'd limit its scope to things that I know it will work long-term. If the implementation project end up being too small, I can also implement WebSocket support (I had implemented it before and it wouldn't be such challenge for me), where the implementation effort is higher than the interface effort. I'm not sure about the deliverables (yet!), but I hope to give more details soon, once I have written nice texts. I'm particularly interested in an elegant way to represent some data structures, but I'll detail the plans soon (lots of text to write, ideas to explain and references to convince, among other). The text was a bit long, but it's because I already have something in mind. I hope to deliver a proposal explaining all the design, why I think it would work and other matters in the middle of the next week. I'm also open to suggestions and modifications in the not-yet-presented-proposal. I can provide background about my experiences later, but for now I want to know what do you guys think about the idea. TL;DR: For now I want to know what do you guys think about having a core HTTP server library in Boost. -- Vinícius dos Santos Oliveira https://about.me/vinipsmaker

7 23

Library metadata
by Daniel James 17 Mar '14

17 Mar '14

Hi, I'm starting to add metadata to modules for updating the website, and hopefully other uses in the future. I added the metadata to Boost.Unordered and Boost.Functional to give you an idea of what this will look like: https://github.com/boostorg/functional/tree/develop/meta https://github.com/boostorg/unordered/tree/develop/meta You can see several libraries listed in the Boost.Functional file. I'll write some documentation soon, but it should be fairly easy to understand. I basically took what was in the website library list and split it up into modules. Quick summary of the fields: key - Used to be the website to identify each library. Don't change it, or the website will think it's a new library. boost-version - The version in which the library was released. name - The name of the library. authors - The authors of the library - will probably add a 'maintainers' field later. description - Library description - this is used in the library list, so keep it short. std-proposal - Is the library proposed for the standard. std-tr1 - Is the library part of TR1. category - The categories the library belongs to. one element for each category. The documentation will include a list of available categories. documentation - Path to the documentation. The documentation field is optional. If it isn't included, it'll use the default path: /libs/module-name/. If it is included, relative paths are resolved relative to the module directory, absolute paths from boost root - although I'd suggest you always use a path within the module, and if there's only a single library in a module, use the default path. This isn't the final format - I think the standards status fields could do with an overhaul to support C++11 etc. You also don't need to write the initial files yourself, I'll generate them and create pull requests once this is settled. Let me know what you think. thanks, Daniel

8 15

Submitting Proposal
by Pulkit Mendiratta 17 Mar '14

17 Mar '14

Hello! I am not able to find a link to submit my proposal. After logging in to google-melange, and requesting a role from boost community, i am not able to find a link to submit it. -- Cheers, Pulkit Mendiratta

2 2

Possible problem in boost::enable_if_c or MSVC 11
by Emil Dotchevski 17 Mar '14

17 Mar '14

I've noticed that for some reason some of the tests of the QVM library (which is in the queue for Boost review) are failing on MSVC 11. The tests that fail use boost::enable_if_c. Before I investigate further, I'm wondering if anyone else has had problems with enable_if_c and MSVC 11 (this code works with earlier versions of MSVC and with GCC.) Thanks, Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

1 0

Boost.odeint Applicant Test
by Zeshawn Shaheen 16 Mar '14

16 Mar '14

Hi, I am Zeshawn Shaheen, a junior at the University of the Pacific in Stockton, CA, US. I am a double major in computer science and mathematics and was interested in partaking in developing implicit routines for Boost.odeint. I've read in the Boost Developers Archive that a small test is given regarding the applicant's coding skills and the odeint library. I would appreciate it if I could be given the test. Thank you. Sincerely, Zeshawn Shaheen

1 0

[GSoC 2014] [Computation of generalized hypergeometric functions]
by Cosmin Boaca 16 Mar '14

16 Mar '14

Hello, I am Cosmin Boaca, and I want to contribute to boost during GSoC 2014. Here is my proposal [0] . Please give me some feedback about it. [0] https://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2014… Thank you, Cosmin Boaca

4 6

Re: [boost] [GSoC] Boost.Thread executors proposal
by Ian Forbes 15 Mar '14

15 Mar '14

>First provide in addition a static polymorphic interface. The template >functions submit_at and submit_after would accept any chrono >`time_point` and `duration`. Is this with respect to the granularity of the time point? e.g. nano/micro/mille etc? If it is I'm assuming this would take an executor and then convert the time point to the desired granularity (nanoseconds by default) then add it to the executor. >Second, provide an adaptor that wraps an scheduled executor and makes it >a polymorphic one. Polymorphic with respect to what? >Third, provide an adaptor that wraps an executor, manage the time based >operations using a specific thread and forward all the operations to the >wrapped executor. So this would take a reference to an executor or a shared_ptr then spawn a single thread that would loop and add the submitted closures at the desired time to the given executor? Ian, ________________________________________ From: Boost [boost-bounces(a)lists.boost.org] on behalf of Vicente J. Botet Escriba [vicente.botet(a)wanadoo.fr] Sent: Friday, March 14, 2014 3:34 AM To: boost(a)lists.boost.org Subject: Re: [boost] [Boost.Thread][GSoC] Boost.Thread executors proposal Le 13/03/14 04:59, Ian Forbes a écrit : > Hi, > > Here is my GSoC proposal for working on the scheduled executors classes. It can be found here: www.cs.mcgill.ca/~iforbe/ > > This proposal mainly deals with the implementation of classes extending the `scheduled_executor` interface. I have already written thread pool implementations with very similar functionality to the ones proposed. > > I feel that the current proposal could use a little bit of touching up so please feel free to leave comments/criticisms. > > I would also be willing to take on any other work related to executors such the the dynamic/work-stealing thread pool implementation or the parallel algorithms library and add it into my proposal. > > Hi, I like your proposal on scheduled_executor and possibly extend it to a priority thread pool. I would let the work-stealing outside the proposal. Just to note that the closure would not be a std::function<void()> as this class doesn't accept a movable only function. Boost.Thread would include (version 1.56) a boost::executors::work as a type-erased class for closures. I'm looking for a different approach respect to scheduled work of the N3785 proposal. First provide in addition a static polymorphic interface. The template functions submit_at and submit_after would accept any chrono `time_point` and `duration`. Second, provide an adaptor that wraps an scheduled executor and makes it a polymorphic one. Third, provide an adaptor that wraps an executor, manage the time based operations using a specific thread and forward all the operations to the wrapped executor. What do you think of this approach? Best, Vicente _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

Re: [boost] [GSoC] pipelines questions
by Thaler Benedek 14 Mar '14

14 Mar '14

> I'm interested in the Boost.Pipelines proposal of GSoC 2014. [snip] Hi, I created a preview [0] with a working example. Please see the readme file and example/hello.cpp. This demo does not have parallel abilities and supports only 1-to-1 transformations in the pipeline. The purpose of this is to showcase my programming abilities and ask your opinions regarding the design and implementation. I intend to have this repository as a supplement of my proposal. Thanks, Benedek [0]: https://github.com/erenon/pipeline

3 7

Permissions in boost::iostreams::mapped_file output
by Patrick Reynolds 14 Mar '14

14 Mar '14

Boost folks, Working with mapped_files in a project, I recently discovered that the files were being written to disk with unexpected permissions on the linux systems. I discussed this further in a pull request here: https://github.com/boostorg/iostreams/pull/2 Is this the proper avenue for making such a contribution? If not, where can I go to get started. Thanks, Patrick

1 1

[modular-boost] Errors on submodule update
by Marcel Raad 14 Mar '14

14 Mar '14

Hi, I'm using TortoiseGit 1.8.7 with msysgit 1.8.5.2 on Windows and have checked out the develop branch of the boost repository. On every submodule update, I get the following errors. Is the submodule configuration corrupt? Git seems to believe that there are msm and polygon submodules which are not in the libs directory: ... git.exe submodule update -- "libs/msm" ... git.exe submodule update -- "libs/polygon" ... git.exe submodule update -- "msm" error: pathspec 'msm' did not match any file(s) known to git. Did you forget to 'git add'? git.exe submodule update -- "polygon" error: pathspec 'polygon' did not match any file(s) known to git. Did you forget to 'git add'? ...

1 0

[Boost.Thread][GSoC] Boost.Thread executors proposal
by Ian Forbes 14 Mar '14

14 Mar '14

Hi, Here is my GSoC proposal for working on the scheduled executors classes. It can be found here: www.cs.mcgill.ca/~iforbe/ This proposal mainly deals with the implementation of classes extending the `scheduled_executor` interface. I have already written thread pool implementations with very similar functionality to the ones proposed. I feel that the current proposal could use a little bit of touching up so please feel free to leave comments/criticisms. I would also be willing to take on any other work related to executors such the the dynamic/work-stealing thread pool implementation or the parallel algorithms library and add it into my proposal. Thank, Ian

3 2

[GSoC] [RFC] Proposal: A C++11 enabled TMP library
by Louis Dionne 14 Mar '14

14 Mar '14

Hi, As suggested earlier on this list, I am posting my GSoC proposal here in an attempt to gather comments and to improve the proposal. Basically, if you would not give the proposal 10/10, then I would like to know the reason so I can change it accordingly. I am strongly motivated with this project and I want to maximize my chances of getting in. The proposal is written in Markdown because that's easier to read than plain text; it is available here (secret gists are just hidden from search engines): http://gist.github.com/ldionne/d05528280db79105e30d Please post all constructive comments that come to your mind. Thank you, Louis Dionne

2 8

GSoC Proposal for Boost.numeric.uBLAS (Review Request)
by Ganesh Prasad 13 Mar '14

13 Mar '14

Hi I have tried to write a feasible proposal for uBLAS, but I am not exactly sure about the time line I have proposed. I have considered my own efficiency and estimated the time considering the dependencies among the proposed algorithms. I will be glad to receive some advice regarding this project. Best Wishes Ganesh Prasad

1 0

[atomic] gcc-atomic.hpp errors with Clang 3.4
by Richard Hadsell 12 Mar '14

12 Mar '14

I am trying to build Boost 1.55 libraries with Clang 3.4 using g++ 4.8.2 as the toolchain on CentOS 6.5. I think these errors arise from trying to initialize 128-bit integers with 0: clang-linux.compile.c++.without-pth bin.v2/libs/atomic/build/clang-linux-3.4/release/address-model-64/instruction-set-core2/link-static/threading-multi/lockpool.o In file included from libs/atomic/src/lockpool.cpp:3: In file included from ./boost/atomic.hpp:12: In file included from ./boost/atomic/atomic.hpp:17: In file included from ./boost/atomic/detail/platform.hpp:22: ./boost/atomic/detail/gcc-atomic.hpp:961:64: error: no matching constructor for initialization of 'storage_type' (aka 'boost::atomics::detail::storage128_type') explicit base_atomic(value_type const& v) BOOST_NOEXCEPT : v_(0) ^ ~ ./boost/atomic/detail/gcc-atomic.hpp:932:28: note: candidate constructor (the implicit copy constructor) not viable: no known conversion from 'int' to 'const boost::atomics::detail::storage128_type' for 1st argument struct BOOST_ALIGNMENT(16) storage128_type ^ ./boost/atomic/detail/gcc-atomic.hpp:932:28: note: candidate constructor (the implicit default constructor) not viable: requires 0 arguments, but 1 was provided ./boost/atomic/detail/gcc-atomic.hpp:968:22: error: no viable conversion from 'int' to 'storage_type' (aka 'boost::atomics::detail::storage128_type') storage_type tmp = 0; ^ ~ ./boost/atomic/detail/gcc-atomic.hpp:932:28: note: candidate constructor (the implicit copy constructor) not viable: no known conversion from 'int' to 'const boost::atomics::detail::storage128_type &' for 1st argument struct BOOST_ALIGNMENT(16) storage128_type ^ Similar errors follow these. I think the initializations to 0 are superfluous, because they are followed by memcpy calls that overwrite them. I will try that fix myself, but I am looking for an official fix that will get into the next release. -- Dick Hadsell 203-992-6320 Fax: 203-992-6001 Reply-to: hadsell(a)blueskystudios.com Blue Sky Studioshttp://www.blueskystudios.com 1 American Lane, Greenwich, CT 06831-2560 Follow Blue Sky Studios on Facebook <http://www.facebook.com/BlueSkyStudios> and Twitter <http://twitter.com/#%21/blueskystudios>

2 1

[1.55.0] link.jam: No such file or directory
by Richard Hadsell 12 Mar '14

12 Mar '14

I am trying to build Boost 1.55 libraries with Clang 3.4 using g++ 4.8.2 as the toolchain on CentOS 6.5. When I run the command that I used for building 1.52.0, I get a message that seems to be harmless but indicates something has changed in the bjam options: bin/bjam --user-config=user-config.LINUX_C65 threading=multi instruction-set=core2 address-model=64 variant=release link=static,shared --stagedir=stageC65 stage link.jam: No such file or directory ... What's up with that? -- Dick Hadsell 203-992-6320 Fax: 203-992-6001 Reply-to: hadsell(a)blueskystudios.com Blue Sky Studioshttp://www.blueskystudios.com 1 American Lane, Greenwich, CT 06831-2560 Follow Blue Sky Studios on Facebook <http://www.facebook.com/BlueSkyStudios> and Twitter <http://twitter.com/#%21/blueskystudios>

3 2

[function] Multi-signature function?
by TONGARI J 12 Mar '14

12 Mar '14

Hi folks, I know it'd be better to say "overload", but I choose the word carefully because I'm aware of Boost.OverloadedFunction, which is not what I'm talking here (it's complementary, though). What I want is to have std/boost::function support multi-signature itself, instead of relying on some external wrapper which is less efficient. For example: struct A { int operator()() const; int operator()(int val) const; }; function<int(), int(int)> f(A{...}); f can store one instance of A internally, compared to the external approach, in which case each overload holds a standalone instance, plus the control data. I know Boost.Function has its baggage from C++98/03, so changing the interface may not be appropriate, in that case a new library can be considered (Boost.Overload?). A sample C++11 implementation can be found here: https://gist.github.com/jamboree/9489193 What do you think?

2 3

[type_erasure] any_cast to a base class?
by Phil Endecott 12 Mar '14

12 Mar '14

Dear Experts, Can boost::type_erasure::any_cast cast to a base class? For example: class Base {}; class Derived: public Base {}; Derived d; any< ??? > a (d); Base* b = any_cast<Base*>(&a); assert(b); I know that this isn't possible with Boost.Any, but was hoping that Boost.TypeErasure would include some "magic" to make it possible. Failing that, are there any other options? (What I'd really like to do is to store a weak_ptr<Derived> and retrieve a shared_ptr<Base>, and other similar combinations, but I get stuck before I get that far.) Thanks, Phil.

2 1

[spirit] hold_any missing assignment operator?
by Robert Carlsen 12 Mar '14

12 Mar '14

I ran into trouble when trying to do assignments between hold_any objects. The problem seems to be fixed by adding a missing assignment operator to basic_hold_any: basic_hold_any& operator=(basic_hold_any const& x) { return assign(x); } Here is some code that demonstrates the problem: int main(int argc, char* argv[]) { boost::spirit::hold_any v1 = std::string("val1"); { boost::spirit::hold_any v2 = std::string("val2"); v1 = v2; } return 0; } When executing that function, I get: *** Error in `./foo': double free or corruption (fasttop): 0x0000000001a50040 *** ======= Backtrace: ========= /usr/lib/libc.so.6(+0x731ff)[0x7f4800a331ff] /usr/lib/libc.so.6(+0x789ae)[0x7f4800a389ae] /usr/lib/libc.so.6(+0x796b6)[0x7f4800a396b6] /usr/lib/libstdc++.so.6(_ZNSsD1Ev+0x1f)[0x7f480133956f] ./foo[0x400e74] ./foo[0x400e10] ./foo[0x400cb7] /usr/lib/libc.so.6(__libc_start_main+0xf5)[0x7f48009e1b05] ./foo[0x400b04] ======= Memory map: ======== 00400000-00402000 r-xp 00000000 08:01 16813021 /home/robert/foo 00402000-00403000 rw-p 00001000 08:01 16813021 /home/robert/foo 01a50000-01a71000 rw-p 00000000 00:00 0 [heap] 7f48009c0000-7f4800b5e000 r-xp 00000000 08:01 6163783 /usr/lib/libc-2.19.so 7f4800b5e000-7f4800d5e000 ---p 0019e000 08:01 6163783 /usr/lib/libc-2.19.so 7f4800d5e000-7f4800d62000 r--p 0019e000 08:01 6163783 /usr/lib/libc-2.19.so 7f4800d62000-7f4800d64000 rw-p 001a2000 08:01 6163783 /usr/lib/libc-2.19.so 7f4800d64000-7f4800d68000 rw-p 00000000 00:00 0 7f4800d68000-7f4800d7d000 r-xp 00000000 08:01 6191352 /usr/lib/libgcc_s.so.1 7f4800d7d000-7f4800f7d000 ---p 00015000 08:01 6191352 /usr/lib/libgcc_s.so.1 7f4800f7d000-7f4800f7e000 rw-p 00015000 08:01 6191352 /usr/lib/libgcc_s.so.1 7f4800f7e000-7f480107e000 r-xp 00000000 08:01 6163651 /usr/lib/libm-2.19.so 7f480107e000-7f480127d000 ---p 00100000 08:01 6163651 /usr/lib/libm-2.19.so 7f480127d000-7f480127e000 r--p 000ff000 08:01 6163651 /usr/lib/libm-2.19.so 7f480127e000-7f480127f000 rw-p 00100000 08:01 6163651 /usr/lib/libm-2.19.so 7f480127f000-7f4801365000 r-xp 00000000 08:01 6191360 /usr/lib/libstdc++.so.6.0.19 7f4801365000-7f4801564000 ---p 000e6000 08:01 6191360 /usr/lib/libstdc++.so.6.0.19 7f4801564000-7f480156c000 r--p 000e5000 08:01 6191360 /usr/lib/libstdc++.so.6.0.19 7f480156c000-7f480156e000 rw-p 000ed000 08:01 6191360 /usr/lib/libstdc++.so.6.0.19 7f480156e000-7f4801583000 rw-p 00000000 00:00 0 7f4801583000-7f48015a3000 r-xp 00000000 08:01 6163762 /usr/lib/ld-2.19.so 7f4801778000-7f480177e000 rw-p 00000000 00:00 0 7f48017a1000-7f48017a3000 rw-p 00000000 00:00 0 7f48017a3000-7f48017a4000 r--p 00020000 08:01 6163762 /usr/lib/ld-2.19.so 7f48017a4000-7f48017a5000 rw-p 00021000 08:01 6163762 /usr/lib/ld-2.19.so 7f48017a5000-7f48017a6000 rw-p 00000000 00:00 0 7fff64671000-7fff64692000 rw-p 00000000 00:00 0 [stack] 7fff646a2000-7fff646a4000 r-xp 00000000 00:00 0 [vdso] ffffffffff600000-ffffffffff601000 r-xp 00000000 00:00 0 [vsyscall] Aborted (core dumped)

1 0

Boost summer of formal reviews
by Borislav Stanimirov 12 Mar '14

12 Mar '14

Hello, This is a (half-)joke suggestion. There are currently 19 libraries in the review schedule ( http://www.boost.org/community/review_schedule.html ) which need a review manager (yes, including mine). Some of them have been there for years. Instead of focusing on getting people to write new libraries, which could potentially end up stuck in the review schedule (like AFIO), why don't we focus on getting the reviews for the ones that are already there. Or at least revising the review process. For example, I would be willing to review some of these libraries, but I am not qualified to be a review manager (since I am not very active in the community). I am not saying that most (or any) of the libraries stuck in review limbo, should pass the process, but some of them at least deserve a look (again, like AFIO). -- Borislav

7 19

[GSoC 2014] [ Hypergeometric functions ] [ Complex Numbers Calculations ]
by Cosmin Boaca 11 Mar '14

11 Mar '14

Hello, I am Cosmin Boaca and I want to work during GSoC 2014 at the hypergeometric functions project. The project aims to approximate some hypergeometric functions for real values of their parameters. Even though the final result of the computation will be a real floating point number, some intermediate results would require complex numbers calculations such as the real power of a negative number, the square root of a negative number and also basic operations with complex numbers. My first question is : is there a way to do this operations using boost::multiprecision types such as cpp_dec_float and cpp_bin_float in order to store the real and the imaginary part of the complex number ? The second question is : Can I use the complex functions from the cstdfloat branch of Boost.math ? Thank you, Cosmin Boaca

2 1

Boost.Align review manager approved
by Glen Fernandes 11 Mar '14

11 Mar '14

On February 25, 2014 Glen Fernandes wrote: >Ahmed, many thanks. :-) > >Some information about the role of a review manager: >http://www.boost.org/community/reviews.html#Review_Manager > >The next step, after you verify the submission code/documentation is >complete, would be to get in touch with the review wizard, Ron, > and finalize a date for the review. Ahmed, Ron just listed you as the review manager for Align. :-) Thanks again for volunteering. Glen

1 0

Fwd: Regarding GSoc'14 Boost.odeint idea
by Rishav Agrawal 11 Mar '14

11 Mar '14

Sir/Mam, I, Rishav Agarwal, am a sophomore studing at the Indian Institute of Technology, Kanpur, India. I am interested in the working on implementing implicit routine for solving ODEs. I have done a semeser long on Numerical Methods in my third semester and am quite familiar with the algorithms used. Although I do not have much experience working with the Boost library, I am well aquaited with C++ and Python and can pick up the libraries easily. I would appreciate if the probable mentor could guide me through the application process and tell me about any pre-requisite/tests that I need to clear which could strengthen my proposal. A list of my previous projects can be found here <http://github.com/rra94>. Sincerely, Rishav Raj Agarwal I.I.T.Kanpur

4 7

Standard C++ [Boost.Document] API
by pritesh vikram 11 Mar '14

11 Mar '14

Hello guys, As of having interested in Participating this year's Google Summer of Code Program. I am interested in developing Library which allow integration with spreadsheet application. Situation: As there is need for an API which understands all currently available formats of office applications running in different platforms. So API has to be aware of all formats available to all the platforms. There will be support for interconversion between these document formats.As well as classes and functions supporting to these operations.Conversion to portable formats like PDF. Proposed Solution: Separate components withing the library would be needed for Word processor, Spreadsheet, Presentation application.And also conversion code for each of these components with respect to different formats. Steps Involved: 1. Design all necessary components needed for the proposed solution. 2. Keeping informed to the mentor for the proposed design. 3. Implement using C/C++ as a language for the integration with the existing boost library. 4. Testing the Implemented model. 5. Getting the implemented code approved with the mentor. 6. Proceeding with the full implementation of the API. Benefits: 1. Help existing boost library users to take advantage of the creation, modification,conversion features for office documents. 2. No need for the users to look for another API for getting support for manipulation with office documents. As there is no existing work going on relating to this API.I am aware that all the libraries and components must be developed from scratch. I will move foreword with my above specified proposal for the project. If there is any more details to be included in the API i would like to informed for the additional details needed for this project to be fully integrated with all necessary components. If my proposal is effective then i would like to be appreciated that i am good to go for proposed layout with google summer of code program. Thanks, Pritesh Vikram

2 1

boost::iterator_range does not work in boost::variant in boost 1.55
by Jon Biggar 11 Mar '14

11 Mar '14

If I try to put a boost::iterator_range into a boost::variant, it breaks the variant, because something in boost::iterator_range doesn't allow variant to use SFINAE deduction. My best guess at the problem is the declarations in boost/range/iterator_range_core.hpp that have a 'class ForwardRange' template argument are insufficiently constrained and accept almost anything as a possible ForwardRange type. I'm guessing that putting the correct enable_if<> template constraints on the templates that use 'ForwardRange' will fix the issue, but I'm having trouble identifing the correct metafunction test to use, since concept FowardRange concept doesn't have too many good targets. I'd like to test a candidate FowardRange type to see if boost::begin() and boost::end() can be successfully called on it, but I haven't figured out how to do that yet. Any suggestions? Known fixes or workarounds? I know about the has_range_iterator metafunction, but it can't be used here due to circular definition issues... Exmaple: #include <boost/variant.hpp> #include <boost/range.hpp> #include <boost/mpl/vector.hpp> using namespace boost; enum E { e1, e2, e3 }; typedef mpl::vector<E, std::string > args; typedef boost::make_variant_over<args>::type OkVariant; typedef mpl::vector<boost::iterator_range<std::string::iterator>, args> args1; typedef boost::make_variant_over<args1>::type BrokenVariant; int main(int argc, char **argv) { OkVariant ok; ok = e1; ok = ""; BrokenVariant broken; std::string s; broken = boost::iterator_range<std::string::iterator>(s.begin(), s.end()); broken = e2; broken = ""; } Yields errors on the last two assignments to 'broken' in g++4.8.2: test.cpp:27:12: required from here ./boost/mpl/eval_if.hpp:60:31: error: no type named 'type' in 'boost::mpl::eval_if_c<true, boost::range_const_iterator<E>, boost::range_mutable_iterator<const E> >::f_ {aka struct boost::range_const_iterator<E>}' typedef typename f_::type type; I've attached the full error log and my project-config.jam. -- Jon Biggar jon(a)floorboard.com jon(a)biggar.org jonbiggar(a)gmail.com

2 2

Boost.Thread project for GSoC 2014
by Haoyue Wang 11 Mar '14

11 Mar '14

Hi, I am Haoyue, a PhD student in geophysics at MIT. I used C++11 to write parallel finite element codes in my research and had some coursework on concurrent programming. Boost is such a powerful and efficient library. I sincerely hope I could contribute to it this summer and beyond. I am interested in the standalone GSoC Projects under Boost.Thread. Particularly, the Work-Stealing-Thread-Pool project is a great one that I expect to learn a lot from. I understand that there could be much more to discuss once I have a preliminary proposal. Here I just want to ask if I am heading in the right direction. I think a good point to start is chapter 6, 7, and 9 of the book C++ Concurrency in Action: Practical Multithreading and the Executors and Schedulers revision 3 from http://www.open-std.org/. I haven't used Executor before but I am ware of its existence in Java for a while. Maybe I could go through some Executor and fork/join Java examples to see how they are used in practice. Finally, I will read and understand the executors codes on GitHub. I hope I could put up a good first draft proposal next Monday. If there is any advice, please let me know. Haoyue Wang

3 10

Review Request: Convert V2
by Vladimir Batov 11 Mar '14

11 Mar '14

I think I've addressed all comments/suggestions received so far. So, to keep things moving I would like to request a formal review of the library. Location: https://github.com/yet-another-user/boost.convert.git Short Description: The main purpose of the framework is to unify and to deploy various conversion facilities through one consistent interface, to provide generic consistent behavior -- one of the factors in improving productivity and code-correctness in commercial s/w development environment. / Boost.Convert/ builds on the /boost::lexical_cast/ experience and takes those conversion/transformation-related ideas further * to be applicable to a wider range of conversion-related deployment scenarios, * to provide a more flexible, extensible and configurable type-conversion framework. Thank you.

1 0

speed of light from universal_constants Boost.Units
by Roger Martin 10 Mar '14

10 Mar '14

Hi, I've tried and tried and just not understanding or can't muddle my way through the boost units(looks powerful though). For a start, just trying to get at the speed of light in boost/units/systems/si/codata/universal_constants.hpp boost::units::si::constants::codata::c boost::units<boost::units::si>::constants::codata::c.value() and massive errors; especially if I try to multiplying with something. I use boost::math::constants::pi<double>() from #include "boost/math/constants/constants.hpp" But the universals allude me; and example? where is my brain stuck?

2 2

Regression test failures on the develop branch
by Neil Groves 10 Mar '14

10 Mar '14

Hi! I've been doing some work on Boost.Range and have been ignoring complete failures from the following machines: teeks99* *jc-bell jasonr-Ubuntu13.04-intel-13.0.1 I'm concerned that the errors have been present for a couple of weeks. We are almost without MSVC coverage on the develop branch. I have taken to going off-process and after cycling the other platforms pushing to master to get coverage of MSVC. Of course I completely understand the difficulties balancing our busy schedules to devote time to Boost. This isn't a complaint. I wondered if there was already a plan to fix these and if there was anything I could do to help. Do we need more machines covering Microsoft compilers and platforms? Should we be approaching companies that use Boost with Microsoft that might be willing to donate some equipment and/or time? I don't think the risk is unacceptable at present since the new branching model means that at this stage of the schedule a hiccup on master can be quickly reverted without a total train wreck. I think we should probably get on top of this before we reach the final phase of the next release. Please let me know if I can help in any way. Regards, Neil Groves

5 5

[GSOC] Mentors for a C++11 TMP-related project
by Louis Dionne 10 Mar '14

10 Mar '14

Hi, I am a student considering to apply for GSOC 2014. Short story =========== I would like to know if someone is interested to mentor a project whose aim is boldly to: - Document the current state of the art in C++11 template metaprogramming. - Propose modifications to the current Boost.MPL or perhaps write a TMP library as a successor to the MPL. Full story ========== I have been working on a C++11 TMP library[1] for a while now, and I will present the state of my work at C++Now 2014. In the process of writing the library, I experiment with several TMP techniques, which I document and benchmark. The goal is to propose a new library that improves over the current MPL in a measurable way (i.e. it's not just my preference). That library could be seen as a C++11 successor to the MPL and new code could use that instead of the MPL. Now, while I expect the library to be fairly advanced by the beginning of the summer, there will certainly be criticism when I present it publicly. I see two possibilities here: (1) Input is negative enough that the idea to propose it is dropped. In that case, I could work on improvements to the current MPL during the summer. The kind of improvements I'm talking about range from documentation to bugfixes to support for C++11 when available. (2) Input is generally positive and the library is proposed circa the beginning of the summer. If the library is refused, then I'm back to (1). Otherwise, I can work on improvements and modifications required for the library to officially make it in. In both cases, the scope of the project seems reasonable to me. There is nothing similar in the list of proposed GSOC projects, so if someone is interested in mentoring this project, please speak up. I will then go through the normal process for proposing GSOC projects and include a more detailed description of it, and we'll see what happens. Regards, Louis Dionne [1]: http://github.com/ldionne/mpl11

5 18

[thread] Address sanitizer failures on marshall-mac
by Andrey Semashev 09 Mar '14

09 Mar '14

Hi, I'm observing Boost.Log and Boost.Atomic test failures on marshall-mac with AddressSanitizer enabled. http://www.boost.org/development/tests/develop/developer/output/marshall-ma… http://www.boost.org/development/tests/develop/developer/output/marshall-ma… The error messages don't contain function names but the backtraces have Boost.Thread on top. I can also see similar failures in Boost.Thread: http://www.boost.org/development/tests/develop/developer/output/marshall-ma… Is this a known problem in Boost.Thread? Can the backtraces be deciphered so that function names are shown?

5 18

[thread, async] Mini design review requested for a generic extensible Boost monadic continuations framework
by Niall Douglas 09 Mar '14

09 Mar '14

Dear Boost, I've been working on a Boost generalisation framework for N3857 "Improvements to std::future<T> and Related APIs" (Jan 2014). It's also an extension of Vicente's N3865 "More Improvements to std::future<T>" (Jan 2014), though slightly incompatible with it. I would appreciate the Boost community's feedback on what is essentially pure exploratory prototype code before I commit any major design flaws in a proper implementation. The proposed design is specifically intended to allow proposed Boost.AFIO's async_io_op future-like object to seamlessly interoperate with any other future-like object e.g. std::future<T> or boost::future<T>. The design is intended to be extensible to any other third party future-like object, even including ones whose implementation is completely external (e.g. Qt). I would like to thank some people whose off-list discussions helped inform this design: to Bjorn Reese who has done so much to help me knock the kinks out of AFIO; to Vicente J. Botet Escriba for engaging with me pitching this proposal to him (he disagrees with it by the way); to Artur Laksberg and Niklas Gustafsson for continuing to reply to my criticisms and thoughts of the papers which precede N3857. What N3857 proposes for reference: * future<T> and shared_future<T> gain a .then(R(prec_future_type<T>)) method. Callable will be called with the signalling future after the future signals. Return type is a future<R>. * A new when_all(...) can be used to compose a future which signals when all input futures are signalled. Inputs can be futures of heterogeneous types, in which case a future<tuple<...>> is returned. * A new when_any(...) composes a future which signals when any of its input futures signals. Inputs can be futures of heterogeneous types, in which case a future<tuple<...>> is returned. To avoid the linear scan on return, for a homogeneous types a when_any_swapped(...) swaps the last item in the return value with the ready item. Note there is no way in N3857 to avoid a when_any() linear scan when input types are heterogenous (something I feel is a deficiency, all you need to return is an index!). * A new executor base class, with subclass thread_pool are added. Executors allow adding a std::function<void()> for asynchronous execution. These are detailed by N3785 "Executors and schedulers, revision 3" (Oct 2013). I haven't mentioned in detail here, but N3857 specifies overloads for .then(executor, ...) to send some continuation to some executor. You will note the below framework makes it possible to use tag dispatch instead which looks much cleaner and is easier to write, nevertheless this explicit form is intended to be preserved. I won't mention executor support again for brevity. Where I find issue with a naïve implementation of N3857 (and Vicente's N3865 mentions some of these same issues): * N3857 only understands std::future<> and std::shared_future<>. That means the following code will not compile: std::future<int> &a; boost::future<int> &b; boost::afio::async_io_op &c; std::future<std::tuple<int, int, std::shared_ptr<async_io_handle>>> f=when_all(a, b, c); This is unhelpful for interoperation. It doesn't just affect Boost: imagine mashing up Qt async objects and C++17 objects for example, or even WinRT Task<T> objects and C++17 objects. Most C++ (and C) libraries of any complexity supply their own async notification objects, and this problem of writing never ending boilerplate to get some async object from library X to work with library Y is very tedious considering the compiler can do it for you. * As I mentioned earlier, when_any() is suboptimal when called with heterogenous types. I don't particularly like the when_any_swapped() hack either - a better solution would solve when_any() of all kinds optimally. * The .then(R(prec_future_type<T>)) is not tremendously useful in practice because it's too limited. Witness the very common use pattern of this form: auto ret=openedfile .then(write({ "He", "ll", "o ", "Wo", "rl", "d\n" }, 0)) .then(sync()); .then(write({ "He", "ll", "o ", "Wo", "rl", "d\n" }, 12)) .then(sync()); This sequence of code is clearly a *transaction* i.e. the programmer intends the set of continuations as a contained group of operations, and indeed some async i/o providers may guarantee atomic rollback (hint: forthcoming TripleGit does exactly this). A big additional problem is the lack of error handling logic: if say the second write() fails, you may wish to undo the first write, or do something custom. The problem with N3857 is that only the state of the first sync() is passed into the second write, and it may be the case that in generic code sync() needs to always sync irrespective of its preceding operation and therefore might pass through a garbage state. N3857 provides no easy method for a later .then() to inspect preceding .then()'s and do something about them (e.g. rewinding until it finds a valid open file handle rather than error states), other than by declaring special wrapper lambdas to pass through state. I personally think that is ugly. * Vicente mirrors my point above in N3865 by pointing out that having .then(R(prec_future_type<T>)) push the error handling into the callable makes your callables unnecessarily boilerplate. N3865 proposes adding .next(R(prec_future_type<T>)) for when a preceding operation succeeds and .recover(R(exception_ptr)) for when a preceding operation fails, with .fallback_to(value) as a way of default setting the return from an errored future. I think Vicente's argument here is a good one: but it's not generic enough in my opinion. I think continuations should be able to _filter_ outputs from preceding continuations in a really generic and customisable way. What I'd really like is this: continuations::thenable_get_placeholder<-1> last; auto ret=openedfile .then(write({ "He", "ll", "o ", "Wo", "rl", "d\n" }, 0)) .then(if_error(last, [](future<...> f){ do something with last; })) .then(sync()); .then(write({ "He", "ll", "o ", "Wo", "rl", "d\n" }, 12)) .then(if_error(last, [](thenable<...> t){ do something more with everything; })) .then(sync()); Which treats the continuation as a functional transformation. In other words, Vicente's .recover(R(exception_ptr)) becomes tag dispatched instead of explicitly specified, so it's very easy for the programmer to transform state according to state. What I am proposing instead: a generic extensible Boost monadic continuations framework which via metaprogramming lets the compiler assemble the right code from N3857 like syntax. A quick summary of the proposed generic extensible Boost monadic continuations framework follows: * Future-like behaviours such as .valid(), .then(), .get(), .wait() and .share() have functional mixin classes of the form (simplified for brevity, but you get the picture): namespace boost { namespace continuations { // Indicates the derived type provides a future compatible valid() template<class I> struct validable : public I { bool valid() const; }; // Indicates the derived type provides a future compatible then() template<class I, class... Types> struct thenable : public I { template<class F> thenable<decltype(F(...))>, Types..., I> then(F &&f); }; // Indicates the derived type provides a future compatible get() template<class T, class I> struct gettable: public I { T get(); }; // Indicates the derived type provides a future compatible wait() template<class I> struct waitable: public I { void wait() const; template<class Rep, class Period> std::future_status wait_for(const std::chrono::duration<Rep,Period> &timeout_duration) const; template<class Clock, class Duration> std::future_status wait_until(const std::chrono::time_point<Clock,Duration> &timeout_time) const; }; } } To mark up a type as being future-like, one might use: namespace boost { namespace continuations { template<class T> using monad = thenable<waitable<gettable<T, validable<std::future<T>>>>>; // Do all the partial specialisations of the internal machinery // for this type to hook it into the metaprogramming } } // Voila, boost::continuations::monad<T> is now an interoperable // form of std::future<T> * .then() can now take callables of the following forms: 1. R() and R(prec_future_type<T>) for compatibility with N3857. 2. R(..., continuations::thenable_get_placeholder<idx>, ...) inserts an item from the continuation chain into the call. thenable_get_placeholder can be fed a negative number to wrap from the bottom, so thenable_get_placeholder<-1> is the most recently preceding operation. Therefore R(prec_future_type<T>) from above is actually implemented as R(continuations::thenable_get_placeholder<-1>). This can be used to insert error processing filters as illustrated earlier which can view a preceding chunk of chain at once, and act. 3. R(thenable<...> &&) which gives a continuation access to the entire continuation chain, just for those people who really need it. You saw this in the example above. 4. Any specially treated prototype depending on what the metaprogramming has extended for some future_type. For example, if one does async_io_op.then(void(const boost::system::error_code& error, size_t bytes_transferred)) - which is the ASIO callback spec - then AFIO would emulate the ASIO callback calling convention for the completion of some i/o. This only happens if and only if the item being .then() is an async_io_op i.e. such custom extensions are type specific. * future_type<T>.then(R()) now returns a thenable<future_type<R>, future_type<T>> which auto decays to a future_type<R> on demand for compatibility with N3857. Similarly a future_type<T>.then(R()).then(S()) would return a thenable<future_type<S>, future_type<T>, future_type<R>> and so on. You can convert a thenable<T, ...> into a std::tuple<..., T> using an overload of the make_tuple() function. * when_all() and when_any() gain overloads for thenable<...>. These simply convert the tuple taken out of a thenable chain into a future with the results - AFIO will implement this generically using its closure engine, but a more intelligent solution might decompose all inputs into HANDLEs and do an asynchronous WaitForMultipleObjects() for example. Note this is a BREAKING CHANGE from N3857: If you do a when_all() under N3857 on a .then() chain, you will get a future to the last then() return, whereas under this proposal you will get a future to all the returns from all the then()s. This breaking change may still actually compile and work as expected - however when_any() actually now has completely different behaviour: when_any() under N3857 will be the same effect as when_all() on a .then() chain under N3857, whereas under this proposal when_any() will signal when any of the then() chain signals (I would assume the first item). I personally doubt this breaking change would affect any real world code, but it's worth noting. Note the following: 1. The proposed continuations framework, despite being monadic, is separate from the mooted Boost.Functional/Monads framework. This continuations framework could be implemented using such a Boost.Functional/Monads framework, but I suspect there wouldn't be much gain except interoperability with other monadic patterns. Continuation monads are a very limited specialisation of general monads, especially under the tight constraints of the N3857 requirements, so reuse of any Boost.Functional/Monads I suspect would be minimal. 2. The proposed framework is 100% compatible with N3857 apart from the when_all()/when_any() breakages which I would assume shouldn't turn up in real world code, and it should be viewed as a Boost-specific extension which may get standardised later if it proves popular. Here is the very rough prototype code: https://github.com/BoostGSoC/boost.afio/blob/monadic_continuations/lib s/afio/test/tests/monadic_continuations_test.cpp. It compiles using VS2013 only. It probably doesn't work, but it's simply there to demonstrate the viability of the concept and to help those confused by my unclear explanation above. Thoughts regarding the design much appreciated! My thanks in advance. Niall -- Currently unemployed and looking for work in Ireland. Work Portfolio: http://careers.stackoverflow.com/nialldouglas/

2 5

Segment Tree Implementation for GSoC 2014
by Kevin Zuniga Garate 09 Mar '14

09 Mar '14

Hello everyone, I'm Kevin and I'd like to contribute to Boost in this SoC. I enjoy coding in C++ and participate a lot in competitive programming sites such as TopCoder, Codeforces, etc. A data structure I have learn from participating in those contests is segment tree. A segment tree is a data structure for storing data and querying and updating it in intervals, I haven't found a segment tree library in C++, so I thought it may be a good data structure for Boost. Do you think that would be a good addition for Boost? If not, what other data structure would you like to see implemented? Greetings. -- Kevin

4 9

Multi-methods and type switch
by Camille GILLOT 08 Mar '14

08 Mar '14

Hello, SoC2014 page on trac mentions interest for an implementation of type-switch for C++. For now, I have implemented a toy library for open multiple dispatch. It is based on compressed dispatch tables. It still just supports single inheritance and needs to attach integer tags to the dispatched class hierarchy. Is there any interest for further development of this library ? What would be the typical use cases ? Note : Although I opened with a reference to SoC2014, I do not intend to write a GSoC proposal for this work. Best regards, Camille Gillot

3 5

[tuple] any interest in a unique_tuple<...>?
by Hui Li 08 Mar '14

08 Mar '14

Testing the water, see if anyone might find this useful. Any comments/suggestions are absolutely welcome and appreciated! unique_tuple<T...>, where types in <T...> may themselves be other unqiue_tupe<...>'s, contains exactly one copy of each of the "finally nested" element types in <T...>, regardless of how many times a type appears in the type parameter pack, or how deeply it is nested inside one or more unique_tuple's in <T...>. unique_tuple<T...> differs from std::tuple<T...> and boost::fusion::set<T...> etc in that nested unique_tuple's are effectively "flattened", and elements contained are unique no matter how complex the nesting gets, or how many times or how deeply nested the element type is in <T...>. unique_tuple<T...> in a way emulates virtual inheritance, but at compile time. The implementation does NOT use virtual inheritance. implementation is available at: https://www.dropbox.com/sh/f7ur7j6jetabovj/MuhhhNWU0K/unique_tuple.h and some demonstration of uses at (tested with "clang-3.5 -std=c++1y" on mac osx/macport) https://www.dropbox.com/sh/f7ur7j6jetabovj/cy_cvpPIYc/main.cpp In the following example, t1,t2,t3 all contain exactly one A, and exactly one B: struct A{}; struct B{}; unique_tuple<A,B,A,B> t1(A{},B{}); unique_tuple<A,unique_tuple<B>,unique_tuple<A,B>> t2{B{},A{}}; // order doesn't matter in constructor // B is default constructed, empty unique_tuple (possibly nested) doesn't matter unique_tuple<A,unique_tuple<unique_tuple<>>,unique_tuple<A,B,unique_tuple<A,B,unique_tuple<A,B>>>> t3{A{}}; // unique_tuple<A,B> t4(A{},B{},A{}); // doesn't compile because more than one A is supplied // unique_tuple<A,B> t5(A{},B{},1.0); // doesn't compile because double doesn't belong There are helper classes and functions, e.g.: A& a = get<A>(t0); auto x = make_unique_tuple(A{},B{},1,1.0); // unique_tuple<A,B,int,double> static_assert( is_unique_tuple<decltype(t0)>::value, "t0 is a unique_tuple type" ); static_assert( is_element_of<A,decltype(t1)>::value, "A is an element in t1" ); static_assert( is_subset_of<decltype(t1),decltype(x)>::value, "<A,B> is a subset of <A,B,int,double>" ); static_assert( unique_tuple_size<decltype(t3)>::value == 2, "there are 2 elements in t3: A and B" ); Equality comparason exists for two unique_tuple<...>s that contain the same element types, e.g., t0 == t2 && t1 != t3; Mixed operations with std::tuple are available if std::get<typename>(std::tuple<...>) exists (c++14), which effectively requires that the element types are all unique in the std::tuple<...>. synopsis: template < typename... T > struct unique_tuple { template < typename... U > explicit constexpr unique_tuple(U&&...); template < typename... U > explicit constexpr unique_tuple(const std::tuple<U...>&); template < typename... U > explicit constexpr unique_tuple(std::tuple<U...>&&); // allocator extended constructors template < typename Alloc, typename... U > unique_tuple(std::allocator_arg_t, const Alloc& a, U&&...); template < typename Alloc, typename... U > unique_tuple(std::allocator_arg_t, const Alloc& a, const unique_tuple<U...>&); template < typename Alloc, typename... U > unique_tuple(std::allocator_arg_t, const Alloc& a, unique_tuple<U...>&&); template < typename Alloc, typename... U > unique_tuple(std::allocator_arg_t, const Alloc& a, const std::tuple<U...>&); template < typename Alloc, typename... U > unique_tuple(std::allocator_arg_t, const Alloc& a, std::tuple<U...>&&); // assign template < typename... U > unique_tuple& operator=(const unique_tuple<U...>&); template < typename... U > unique_tuple& operator=(unique_tuple<U...>&&); template < typename... U > unique_tuple& operator=(const std::tuple<U...>&); template < typename... U > unique_tuple& operator=(std::tuple<U...>&&); // swap template < typename... U > void swap(unique_tuple<U...>&); template < typename... U > void swap(std::tuple<U...>&); }; // helpers template < typename... T > unique_tuple<typename std::decay<T>::type...> make_unique_tuple(T&&... t); template < typename... T > struct unique_tuple_size<unique_tuple<T...>>; // number of unique elements template < typename T > struct is_unique_tuple; template < typename T, typename... U > struct is_element_of<T,unique_tuple<U...>>; template < typename... T, typename... U > struct is_subset_of<unique_tuple<T...>,unique_tuple<U...>>; // element access template < typename T, typename... U > T& get<T>(unique_tuple<U...>&); template < typename T, typename... U > const T& get<T>(const unique_tuple<U...>&); template < typename T, typename... U > T&& get<T>(unique_tuple<U...>&&); // equality compare template < typename... T, typename... U > bool operator==(const unique_tuple<T...>&, const unique_tuple<U...>&); template < typename... T, typename... U > bool operator==(const unique_tuple<T...>&, const std::tuple<U...>&); template < typename... T, typename... U > bool operator==(const std::tuple<T...>&, const unique_tuple<U...>&); template < typename... T, typename... U > bool operator!=(const unique_tuple<T...>&, const unique_tuple<U...>&); template < typename... T, typename... U > bool operator!=(const unique_tuple<T...>&, const std::tuple<U...>&); template < typename... T, typename... U > bool operator!=(const std::tuple<T...>&, const unique_tuple<U...>&); // swap template < typename... T, typename... U > void swap(unique_tuple<T...>&, unique_tuple<U...>&); template < typename... T, typename... U > void swap(unique_tuple<T...>&, std::tuple<U...>&); template < typename... T, typename... U > void swap(std::tuple<T...>&, unique_tuple<U...>&);

2 2

Re: [boost] testing potential GSOC students
by Ganesh Prasad 08 Mar '14

08 Mar '14

( (c) TM (R) Will Smith) --> (The man in BLACK ) ... The actor one ??? I love that guy. Not sure if I would go competitive against him. :D

1 0

Re: [boost] testing potential GSOC students
by Ganesh Prasad 07 Mar '14

07 Mar '14

As this year the main focus of UBLAS will be compile time optimizations, and I wish to submit a proposal for this project, I would like to show the compile time library Gns::META_LISCPP , written by me. In reference to *Boost Digest, Vol 4288, Issue 3, Message :3 ,* I am sending this library by me for evaluation. Though I have not implemented a minimal Vector library over it yet , still it demonstrates, I optimally guess, my understandings of the generic meta programming paradigm. And I guess, I might come up with some vector processing features for it soon. Here is the github url to the repository : *https://github.com/GnsP/GNS--META_LISCPP/ <https://github.com/GnsP/GNS--META_LISCPP/>* Looking forward to your responses. Best Wishes Ganesh Prasad

3 2

Re: [boost] [Re] [Re] JSON Parsing Library for GSoC 14
by Sebastian Theophil 07 Mar '14

07 Mar '14

There are many libraries that parse JSON to maps and vectors. IIRC Microsoft’s REST SDK includes a JSON library as well (http://casablanca.codeplex.com) There are at least 15 other C++ libraries like that and we don’t need to write another one. But there are only two libraries AFAIK that parse JSON to C++ structs using serialization adaptors: - https://github.com/Loki-Astari/ThorsSerializer - http://fossil.wanderinghorse.net/repos/nosjob/index.cgi/index I consider the ability to read and write C++ structs essential for any library admitted to boost. Shouldn't such a library be an extension to boost.serialization? Boost.Serialization already defines a way for each data structure to define which data should be written/read. The Boost.Serialization docs say that the library even offers methods & macros to output a class member together with its member variable name as a name value pair. Exactly what a JSON library would need. There has been a discussion about last year’s GSoC mentioning further desirable properties of a JSON library: http://boost.2283326.n4.nabble.com/JSON-Parser-GSoC-2013-td4645117.html Regards Sebastian -- Dr. Sebastian Theophil | stheophil(a)think-cell.com Senior Software Engineer We are looking for C++ Developers: http://www.think-cell.com/career think-cell Software GmbH | Chausseestr. 8/E | 10115 Berlin | Germany http://www.think-cell.com | phone +49 30 666473-10 | US phone +1 800 891 8091 Amtsgericht Berlin-Charlottenburg, HRB 85229 | European Union VAT Id DE813474306 Directors: Dr. Markus Hannebauer, Dr. Arno Schödl

3 4

[GSoC] pipelines questions
by Thaler Benedek 06 Mar '14

06 Mar '14

Hi, I'm interested in the Boost.Pipelines proposal of GSoC 2014. [0] I'd like to ask the stakeholder (Vicente J. Botet Escriba ?) the following: * Is this supposed to be built from scratch or rather to be some kind of improvement over the already existing google implementation? [1] * If the former is true, should be n3534 [2] considered as a strict requirement or as a vague suggestion? * If the later is true, which features should be the main distinctive ones? I think about things like using Boost libraries (e.g: Boost.Atomic) instead of custom solutions, cross platform support, comply to Boost coding standard, etc. Are there any areas of improvement identified in the reference implementation? * I understand it might take quite a long time for a proposal to make it to Boost, therefore it's not a requirement. Is there any objective milestone that a successful project should reach anyway? Thanks, Benedek [0]: https://svn.boost.org/trac/boost/wiki/SoC2014#Boost.Pipelines [1]: https://code.google.com/p/google-concurrency-library/source/browse/include/… [2]: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3534.html#Proposal

3 4

[uuid] sequential_generator / comb_generator / utc_generator / timestamp_generator
by Adam Walling 06 Mar '14

06 Mar '14

For personal use, I've created a few generators that create sequential and time-based uuids. However there does not seem to be a single standard for these kinds of algorithms. While tidying up this code, I've run into some obstacles with generalization of the logic. Although some applications like SQL Server will use GUIDs and lexicographically compare based on the least significant bytes of Data4 for boost::uuids' purposes we can simply assume a block of 16 bytes. The generic approach is to combine (basic_comb_generator) a number of bytes from a sequential source, filling the rest of the bytes with random data. What concerns me is the choice of source and the number of bytes to use. And additionally the value which specifies the variant / version. The usual choices seem to be 8 or 6 bytes. The source is also usually UTC Unix time. However the original uuid version used nanosecond intervals and the MAC address. Am I worrying too much about extensibility? As it is now my basic_comb_generator has a template param for a source, a number of bytes of the source to use, and a UniformRandomNumberGenerator to fill the rest. Since resolution may be a second if using Unix time they may not be consistently sequential but generally so, hence my hesitation to name the generator typedef as sequential. Of course it is possible to use even higher resolution. I suppose I am gauging interest in this feature, as well as asking if there are any thoughts or suggestions on how others would likely use this, and alternative or standard algorithms defined. Once I have some feedback I intend to complete the code and bounce it back on here for any further comments before lobbying to include anything within the library. It seems like commonly needed functionality at least! Nilsson article here for SQL Server: http://www.informit.com/articles/article.aspx?p=25862&seqNum=7 CouchDB's uuid generation algorithms: https://wiki.apache.org/couchdb/HttpGetUuids

2 1

[signals2] Test failure in C++11 (trivial fix for incorrect usage of boost::optional)
by Ben Pope 06 Mar '14

06 Mar '14

I have the following errors: "clang++-3.4" -c -x c++ -std=c++11 -stdlib=libc++ -O0 -g -fno-inline -Wall -g -DBOOST_ALL_NO_LIB=1 -DBOOST_TEST_NO_AUTO_LINK=1 -I".." -o "/home/ben/development/boost/test/build/results/boost/bin.v2/libs/signals2/test/signal_test.test/clang-linux-3.4~c11_libc++/debug/link-static/signal_test.o" "../libs/signals2/test/signal_test.cpp" ../libs/signals2/test/signal_test.cpp:32:16: error: invalid operands to binary expression ('boost::optional<int>' and 'int') if(max == false) max = *first; ~~~ ^ ~~~~~ "clang++-3.4" -c -x c++ -std=c++11 -stdlib=libc++ -O0 -g -fno-inline -Wall -g -DBOOST_ALL_NO_LIB=1 -DBOOST_TEST_NO_AUTO_LINK=1 -I".." -o "/home/ben/development/boost/test/build/results/boost/bin.v2/libs/signals2/test/track_test.test/clang-linux-3.4~c11_libc++/debug/link-static/track_test.o" "../libs/signals2/test/track_test.cpp" ../libs/signals2/test/track_test.cpp:36:14: error: invalid operands to binary expression ('boost::optional<int>' and 'int') if(max == false) Richard smith explains the problem here: http://llvm.org/bugs/show_bug.cgi?id=18180#4 "OK, I see what's happening -- in Clang 3.3 and GCC 4.8, 'false' is being treated as a null pointer constant. boost::optional implicitly converts to an "unspecified-bool-type" that happens to be a pointer-to-member type, and thus can be compared against a null pointer constant via the built-in operator!=(pointer-to-member, pointer-to-member) overload. In C++11 onwards, 'false' isn't a null pointer constant any more, so this comparison is no longer valid. Clang 3.3 and GCC 4.8 don't implement that rule; Clang 3.4 does." The trivial fix is to change the if statements at: ../libs/signals2/test/signal_test.cpp:32:16: ../libs/signals2/test/track_test.cpp:36:14: to if(!max) rather than if(max == false). Ben

7 19

[range][documentation] - best practice for generating documentation?
by Neil Groves 05 Mar '14

05 Mar '14

Hi, I'm currently the suitably ashamed owner of numerous documentation trac issues for Boost.Range. I would like to address these issues but I'm unclear about what our strategy is for generating documentation since our move to modular Boost. I anticipate that if I continue to commit the generated html as I had done previously that I will be in for a "world of pain" when it comes to merge to master. I've searched and found several pages about document best-practice but the pages contain references to the subversion repository which leads me to believe that this must be out-of-date. I'd like some advice to ensure that my commits are aligned with what is wanted. If there is a temporary workflow I can use that will not end in a merge disaster then I'd like to put small documentation fixes in quickly before major re-factoring of the documentation generation process. I apologise in advance if my search skills have been deficient. Sending a link accompanied with abuse is entirely acceptable! Thanks, Neil Groves

2 3

[offtopic] Wonders of C++ syntax
by Andrey Semashev 05 Mar '14

05 Mar '14

Maybe this experience will be interesting to someone... I'm currently trying to write a simple parser for function signatures for Boost.Log and collecting different curious use cases. The parser is supposed to extract the function name from the compiler-generated string with the signature (i.e. BOOST_CURRENT_FUNCTION). Now the interesting case I've stumbled upon is a conversion operator to a function pointer: namespace namespc { struct my_class2 { typedef char (*pfunc_t)(double); operator pfunc_t () const { std::cout << BOOST_CURRENT_FUNCTION << std::endl; return 0; } }; } I first tried to imagine how this could be written without the typedef, but my brain broke soon enough. Then I decided to ask the compiler, and naturally different compilers gave different answers. GCC nicely sidestepped the problem altogether: namespc::my_class2::operator pfunc_t() const MSVC was more creative: __cdecl namespc::my_class2::operator char (__cdecl *)(double)(__cdecl *(void) const)(double) Frankly, my brain can't parse this one either and it looks incorrect to me since the function pointer type is duplicated. So it seems, there's no syntax for expressing the operator without a typedef, is that right? In that case, I wonder what to do with MSVC output...

2 2

changelog for 1.56
by Oliver Kowalke 05 Mar '14

05 Mar '14

I tried to add comments to the change log of 1.56 - but I've no permission to push the commit. is feed/history/boost_1_56_0.qbk the correct place and can I get permission to push commits?

2 1

libcpp.hpp always defines BOOST_NO_CXX11_HDR_ATOMIC
by Peter Dimov 05 Mar '14

05 Mar '14

The libc++ config header, libcpp.hpp, always defines BOOST_NO_CXX11_HDR_ATOMIC, but the libc++ that - I presume - ships with "Apple LLVM version 5.0 (clang-500.2.79) (based on LLVM 3.3svn)" appears to have a functional <atomic>.

6 22

Getting started with Boost( GSOC)
by M. Lalit 05 Mar '14

05 Mar '14

Hi Guys, I'm new to Open-Source Development.I want to contribute to Boost this year through GSOC-2014.I looked at the suggested projects this year at https://svn.boost.org/trac/boost/wiki/SoC2014 and liked Boost.Document Project and therefore I would like to work on it for this years GSOC.Please help me guys on how to get started for developing that project.I mean basically what codebase to understand etc.

2 5

Formal review request: Boost.Mixin
by Borislav Stanimirov 05 Mar '14

05 Mar '14

Hello, I'd like to request a formal review of Boost.Mixin. Code is here: https://github.com/iboB/boost.mixin Documentation is here: http://ibob.github.io/boost.mixin/ In short, the library allows you to dynamically compose and mutate polymorphic types from existing C++ classes. Thanks, -- Borislav

2 3

Re: [boost] Review request for Boost.Align
by Glen Fernandes 05 Mar '14

05 Mar '14

On 2014-02-22, Ron Garcia wrote: > Hello, > > I have recieved your request and will add this library to the review schedule. > > Best, > Ron Description updated below. Code and documentation also updated. Code: http://github.com/glenfe/align/ Docs: http://glenfe.com/align/doc/ Description: This library provides function boost::align() for implementations which do not have the C++11 standard library std::align() function available. It provides allocation functions boost::aligned_alloc() and boost::aligned_free() as their functionality is not yet available in the C++ standard library. They use platform specific functions, such as posix_memalign(), aligned_malloc(), memalign(), if available, or use standard library functions in conjunction with boost::align(). It provides C++ allocators, class templates boost::aligned_allocator and boost::aligned_allocator_adaptor, which respect alignment. - The first is a replacement for the standard default allocator and uses boost::aligned_alloc() and boost::aligned_free(). - The second turns an existing allocator into one that supports alignment by using the allocator in conjunction with boost::align. It supports all C++03 and C++11 allocators, including C++11 allocators whose 'pointer' type is a smart pointer, and C++11 minimal allocators. It also provides function boost::is_aligned() to test the alignment of a pointer. -- end Glen

1 0

DRYing BOOST_FUSION_ADAPT_STRUCT with decltype/Boost.TypeOf ?
by Damien Buhl 05 Mar '14

05 Mar '14

Hi dear Boost Fusion developers, I was asking myself if there were already plan to improve BOOST_FUSION_ADAPT_STRUCT to benefit from C++11 features like decltype ? This would be interesting to avoid the risk encountered that the types definitions can get out-of-sync. And would avoid typing type declarations twice. Currently there is BOOST_FUSION_DEFINE_STRUCT to avoid repeating the type information for each field. However this is something that makes most developer I know unhappy, as it obliges to modify the readable C++ aggregate types definition (i.e. Could be public headers) with this macro. Then there is the nice choice of BOOST_FUSION_ADAPT_STRUCT which obliges retyping the type and adds the risk that some field type information could get out-of-sync between the struct definition and the BOOST_FUSION_ADAPT_STRUCT listing. I think it would be valuable to add macros that would enable to select the fields that we want to adapt to a Random Access Sequence without requiring to repeat the type information. I would find more comfortable to write the example provided here http://www.boost.org/doc/libs/1_55_0/libs/fusion/doc/html/fusion/adapted/ad… as follow : namespace demo { struct employee { std::string name; int age; }; } // demo::employee is now a Fusion sequence BOOST_FUSION_ADAPT_STRUCT_EXT( demo::employee, (name) (age)) And a naïve implementation of BOOST_FUSION_ADAPT_STRUCT_EXT could be: #include <boost/typeof/typeof.hpp> #include <boost/fusion/include/adapt_struct.hpp> #include <boost/preprocessor/seq/for_each.hpp> #define ATTRIBUTE_DEFINITION(r, data, elem) \ (BOOST_TYPEOF(data::elem), elem) \ #define BOOST_FUSION_ADAPT_STRUCT_EXT(NAME, ATTRIBUTES) \ BOOST_FUSION_ADAPT_STRUCT(NAME, \ BOOST_PP_SEQ_FOR_EACH(ATTRIBUTE_DEFINITION, NAME, ATTRIBUTES)) #endif The same could certainly be achieved for BOOST_FUSION_ADAPT_TPL_STRUCT, while I didn't check. Thanks for the really great job done in Boost.Fusion. Cheers, -- Damien Buhl alias daminetreg

3 7

Boost.odeint project for GSoC 2014
by Camille GILLOT 04 Mar '14

04 Mar '14

Hello, I am Camille Gillot. I am a student in French Ecole d'ingenieurs Ecole Polytechnique. I have been programming in C++ for a couple years now, and I would like to take part in boost development through GSoC this summer. I have taken a deep look on the GSoC proposals on boost trac, and I am very interested in working on the boost.odeint or the funtional/'invoke' project. May I have deeper informations on the expected work ? It is the first time I applied to a GSoC project and I worked on boost development, so I need some help about it. Regards, Camille Gillot

2 1

Boost.Align aligned_allocator_adaptor review
by Glen Fernandes 04 Mar '14

04 Mar '14

Changing e-mail subject from 'Re: [boost] Boost.Align review request'. On Fri, Feb 28, 2014, Glen Fernandes wrote: > > On Fri, Feb 28, 2014, Mathias Gaunard wrote: > > It has functions to adapt any memory allocating scheme or C++ allocator into > > an aligned version. > > Related to the first point, I recently implemented class > template boost::aligned_allocator_adaptor to complement > boost::aligned_allocator, but I think I could improve the > implementation. I've improved the implementation of aligned_allocator_adaptor; it does two things that I believe SIMD's version does not do yet: 1. It supports C++11 minimal allocators which do not need to provide all typedefs beyond value_type 2. It supports C++11 allocators which have 'pointer' as a smart pointer (or otherwise non-raw pointer) type Code: http://github.com/glenfe/align/blob/master/include/boost/align/aligned_allo… I'd be happy to contribute this functionality to SIMD's allocator adaptor, via a patch or pull request, if you're interested. Glen

1 0

A new Graph Generator library for GSoC 14
by Khaled Ammar 04 Mar '14

04 Mar '14

Hi every one, I would like to propose an idea for GSoC. boost has only R-Mat graph generator which is not flexible and does not preserve real graph properties. There is another graph generator called RTG which is developed by the same professor (as R-Mat) in CMU. The generator is available on Matlab only but I developed it in C++ and successfully generated graphs with tera edges. I also added a few more functionality to it and added some flexibility in my paper recently accepted in a BigData Benchmark workshop. I would like to make this code available for the graph library in boost. Would anyone endorse this project? -- Thanks, Khaled www.khaledammar.com

2 1

[testing][teeks99] Missing headers in boost checkout
by Andrey Semashev 04 Mar '14

04 Mar '14

Hi, I'm seeing test compilation errors saying that some headers are missing. For example: http://www.boost.org/development/tests/develop/developer/output/teeks99-01a… says that boost/smart_ptr/intrusive_ptr.hpp does not exist. There are other missing headers. The tester is teeks99-01a-win2008-64on64. Is this a known problem?

4 5

Getting started with Boost for GSoC 2014
by Yasas Charitha 04 Mar '14

04 Mar '14

Hi, I'm Yasas and quite new to Open source development. First off little bit of introduction of myself. I'm an M.Sc student in University of Moratuwa, Sri Lanka and I completed my B.Sc degree in Computer Engineering in University of Peradeniya. I'm looking forward to participating in GSoC this year with Boost. I'm very much interest about C++ development and I'm familiar with C++ development on windows. I browsed through the ideas page and I found Boost.Document and Boost.Binaries and Boost.Math Generalized Hypergeometric Functions are quite interesting project ideas. As a beginner for the GSoC I'm kind of confused and excited what to do next etc. Any help is very much appreciated. -- Regards, Yasas C. Perera, E mail - yasas.b(a)gmail.com Tel - (+94) 712 667 122 - (+94) 777 851 619 "Fellowship for Humanity"

2 1

Re: [boost] [GSoC 2014] Http Server Proposal
by Damien Buhl 03 Mar '14

03 Mar '14

Hi Vinícius, Perhaps it's not bad to look at what Artyom Beilis does with cppcms : [http://cppcms.com/wikipp/en/page/main ](http://cppcms.com/wikipp/en/page/main)And others things like [https://github.com/metagoto/fcgixx](https://github.com/metagoto/fcgixx). And considering http, it could perhaps be valuable to look at SPDY / HTTP 2.0, because even if it will be as compatible as possible with HTTP 1.1 I believe that features like server push transactions should be taken into account in your library API. As you spoke about websockets you should have thought to something similar. You spoke about embedded, having facilities or an API which abstracts protocols like CoAP translation from/to HTTP would also be nice in my opinion. Cheers, -- Damien Buhl Em Sáb, 2014-03-01 às 11:46 +0000, Niall Douglas escreveu: > Algorithmically an async HTTP server is not challenging. Yes, I know that. The most challenging part in a HTTP server (in my opinion) is the interface, not event the implementation. That's why I'm considering WebSocket support too, but I have to investigate further about the full scope of the proposal. > Look into > Python's Twisted. Do what they do. I studied several web solutions to serve as inspiration, but I haven't checked Python's Twisted or Boost.AFIO. I'll surely check them now. Thanks for pointing me them out. It may improve my proposal already. :) > Disclaimer: I designed proposed Boost.AFIO. Then I know who I shall bug for questions. :) -- Vinícius dos Santos Oliveira https://about.me/vinipsmaker

3 2

Getting Started with Boost - GSOC 2014
by Harika Matha 03 Mar '14

03 Mar '14

Hi I am Matha Harika. I have received my bachelor's degree in Electronics and Communication Engineering and currently pursuing Masters in CS from IIIT Hyderabad. I am quite comfortable programming in C++. I have checked the proposed project list of Boost and am very excited to contribute(hopefully in GSOC 2014). I have successfully built the Boost libraries. Could anyone please guide me in getting started with the code? Thank You

1 0

Boost.Convert. Take 2.
by Vladimir Batov 03 Mar '14

03 Mar '14

Another day I came across a topic called "String to T conversions - getting it right this time <http://groups.google.com/a/isocpp.org/group/std-proposals/t/a9905ba8e4f33f3e>" on the "ISO C++ Standard - Future Proposals <https://groups.google.com/a/isocpp.org/forum/#%21forum/std-proposals>" that got me interested/curious. Unfortunately, it seemed more of a discussion rather than a proposed/deployable solution to the string conversion issue. Then, I searched Boost archives to see if there was any development in that string-to-type conversion domain since my unsuccessful proposal about three years ago: From: Edward Diener <eldiener <at> tropicsoft.com> Subject: [Review] Boost.Convert, review manager analysis <http://news.gmane.org/find-root.php?message_id=iq12fm%24k6c%241%40dough.gma…> Newsgroups: gmane.comp.lib.boost.devel <http://news.gmane.org/gmane.comp.lib.boost.devel>, gmane.comp.lib.boost.user <http://news.gmane.org/gmane.comp.lib.boost.user> Date: 2011-05-06 15:01:06 GMT (2 years, 39 weeks, 6 days, 23 hours and 47 minutes ago) Unfortunately I was not able to find anything. Apologies if I missed something major/serious (I was not exactly closely monitoring the list). Is anyone aware of any work done in the area? If not, then I am thinking if we could revisit the issue the original (and failed) Boost.Convert tried to address. I am not sure about others but for me that quite essential and seemingly simple task is still quite important. I was watching the development of the lexical_cast but did not see it going beyond its original frugal design. So, maybe we might have another look at the code that Boost.Convert has become and that I've been using/working on?.. Convert V2... From past experience calling it Boost.Convert seems quite premature. :-) I only put Boost.Convert in the title as a reminder for those who participated in the original review. So, the code is at https://github.com/yet-another-user/boost.xtra. The docs are old (from the original proposal) so, if anyone interested, I'd suggest jumping right to the test/example code in libs/convert/test. Apologies for the inconvenience but for now I'll try to see if I should put any effort updating the docs for possible submission. The main difference from the original proposal is that the complicated blob was split in to two separate components -- Convert API facade and a converter. Here it seems very similar to (same as?) boost::lexical_cast which provides a uniform API facade which in turn deploys additional functionality (op<<, op>>). Similarly, Convert V2 requires a converter to be specified for conversion: boost::cstringstream_based_converter ccnv; // char converter boost::wstringstream_based_converter wcnv; // wchar_t converter Then, int a000 = convert<int>::from(not_int_str, -1, ccnv); int a001 = convert<int>::from(std_str, -1, ccnv); int a002 = convert<int>::from(c_str, -1, ccnv); int a003 = convert<int>::from(wstd_str, -1, wcnv); int a004 = convert<int>::from(wc_str, -1, wcnv); Now all the configuration (formatting, locales, etc.) is separate from the API facade and provided (or not) by the plugged in converter. The only available converter tringstream_based_converter allows something like: std::locale rus_locale (rus_locale_name); std::locale eng_locale (""); // Set locale, case, precision, ccnv(std::setprecision(4))(std::scientific)(std::nouppercase); string double_rus = convert<string>::from(double_v01, ccnv(rus_locale)).value(); string double_eng = convert<string>::from(double_v01, ccnv(eng_locale)).value(); Gosh, it's getting too long... cutting it short. The above is probably sufficient for those who participated in the original review. Those who did not might have a look at the (original and old) docs and the test/example code. V.

9 45

testing potential GSOC students
by David Bellot 02 Mar '14

02 Mar '14

Hi Boost mentors, I'd like to know how you test your potential students to see if they have a sufficient level in C++. It's totally different than doing a C++ interview, because they have plenty of time to answer questions and they can use help from google or any other source. For Boost.uBLAS, I ask them to write a little vector library (vector in the sense of linear algebra) using expression templates. It's the bare minimum they have to know. I ask different features to each student. They we talk about their code and I ask them to modify it to introduce new features for example. And you ? Best regards, David

3 2

Re: [boost] [Re] [Re] JSON Parsing Library for GSoC 14
by Ganesh Prasad 01 Mar '14

01 Mar '14

Yeah, the parser generator can be easily implemented using Boost.spirit.qi . So, implementing that would not be much for GSoC. But I have another (a bit complex) idea in this field. Rather than writing a tool to generate tag based DSEL parsers, I can work on one abstraction level up... A tool to generate formal grammars themselves. Why not a library that would take Two level Grammar (Ex : Van Wijngaarden Grammar ) and build parser for the resulting CFG ... It's established that two level grammars are more powerful than single level CFGs and that two level grammars are Turing Complete themselves. So, if we can just implement them in a proper way (maybe I am day dreaming), we might end up with something like the discovery of metaprogramming. I daresay, this dream of mine is feasible, but right now, vague. Provided with some intellectual help, I may come up with a design for such a library in a matter of days. Best wishes Ganesh Prasad

3 2

[Re] [Re] JSON Parsing Library for GSoC 14
by Ganesh Prasad 01 Mar '14

01 Mar '14

So basically, the idea of generalization is like this : -- A compile time library to work just like parser building tools (ex: yacc). -- The library is to generate small sized fast and embed-able parsers for tag based/markup languages like XML, TeX etc. -- The parsing mechanism of the library is to be simpler than that of mainstream DCFG parsing tools, yet powerful enough to generate parsers for all kinds of tag based languages. -- An event handling mechanism. When an tag/end-of-tag is encountered an event is generated and this event is to be handled. The library is to provide features for this. -- Mechanism to bind functions/function objects to events.

2 1

[assert] Assert library? - Was: [regression] Where's boost/assert.hpp ??
by Klaim - Joël Lamotte 01 Mar '14

01 Mar '14

On Sat, Feb 22, 2014 at 9:39 PM, Andrey Semashev <andrey.semashev(a)gmail.com>wrote: > It's been moved to a new Boost.Assert library (libs/assert submodule). Is there a discussion or documentation about what is this new library exactly? Is it just to isolate the assert.hpp header or are there other plans? (I'm secretly hoping that someone would propose an implementation of n3877[1] to boost, as I don't have the time to do it myself) [1] http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3877.pdf

5 17

Review request for Boost.Align
by Glen Fernandes 28 Feb '14

28 Feb '14

Source: http://github.com/glenfe/align Documentation: http://glenfe.com/align/doc/ Motivation: Tiny library to be used for all common alignment related chores found in a few Boost libraries. (e.g. we have some in Boost.Smart_Ptr). Provides: 1. Function boost::align, a pointer alignment function, for implementations that do not yet provide std::align. (Uses std::align if available) 2. Functions boost::aligned_alloc and boost::aligned_free, for aligned allocation and deallocation. (Use platform specific functions, such _aligned_malloc or posix_memalign, or otherwise uses std::malloc with the above boost::align) 3. Class template boost::aligned_allocator as a replacement for std::allocator that respects over-aligned types. (Up to the extent the implementation supports over-alignment) Many thanks to Peter Dimov for his feedback on the design and implementation of this library. Notes: Small enough that it might satisfy the requirements for a fast-track review. Glen

9 24

JSON Parsing Library for GSoC 14
by Ganesh Prasad 28 Feb '14

28 Feb '14

I already have done some work over such a library, but this library by me has limited features and need to be improvised. And hence, I am thinking about doing this work during this GSoC 14. But I have certain questions about it. 1) Who will be taking the design decisions for the development of the library ? Whether the student or the mentor will be responsible for the decisions ? 2) To which formats should the library parse the JSON ? The current library by me parses JSON to Maps and Vectors. I am intending to provide flexibility, but if some specifications will be available it'll be helpful. 3) Is the library to be kept as simple as possible in terms of User Interface ? Or, should we use factory patterns to provide more flexibility to the advanced users ? Have a nice day, everybody. Best wishes Ganesh Prasad

5 5

Re: [boost] Review request for Boost.Align
by Glen Fernandes 28 Feb '14

28 Feb '14

Rob Stewart wrote: > Actually, you need Review Wizard approval as a review manager, and then the rest follows. *Nod*. I let Ronald know that Ahmed was kind enough to volunteer to be the review manager, and inquired about his approval, a few days ago. Hoping to hear back soon. Glen

1 0

clang support for __sync_* intrinsics
by Peter Dimov 28 Feb '14

28 Feb '14

Does anyone know what is the earlier version of Clang that supports the __sync_* intrinsics?

2 2

contributing to boost.ublas in gsoc 2014
by Rishabh Kumar 28 Feb '14

28 Feb '14

hello, myself Rishabh Kumar .currently I am pursuing my masters in applied mathematics from iit roorkee. I have a firm knowledge of c++ and python. i would like to contribute to boost.ublas and aspire to be one of the students of gsoc 2014.To start with , i have been following your ideas page for quite some time and i found the linear algebra vision very tempting. i have started working the library . looking forward for a good discussion on the idea and guidance from the respective mentor.

1 0

[GSoC-2014] Has Boost been retained?
by Vicente J. Botet Escriba 28 Feb '14

28 Feb '14

Hi, all is in the title, Vicente

4 4

[mpl] Pull request - Add constexpr to conversion operator for integral constants
by pfultz2 28 Feb '14

28 Feb '14

Hi, I added constexpr to conversion operator for integral constants, so the type traits will more closely match the type traits in C++14. Here is the pull request: https://github.com/boostorg/mpl/pull/1 Thanks, Paul Fultz II -- View this message in context: http://boost.2283326.n4.nabble.com/mpl-Pull-request-Add-constexpr-to-conver… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

[interprocess] windows_intermodule_singleton breaks when calling a Debug dll from a Release executable
by Lars Hagström 27 Feb '14

27 Feb '14

Some time ago I reported this bug https://svn.boost.org/trac/boost/ticket/9262. Any ideas? /Lars

2 1

Problem in thread or chrono: boost::this_thread::sleep_for() sometimes returns immediately on win32
by Lars Hagström 27 Feb '14

27 Feb '14

Hi, As I've just described in https://svn.boost.org/trac/boost/ticket/9720 I've had a problem with boost::this_thread::sleep_for. I'm guessing that this could be a problem with either chrono or thread. Just thought I'd post here since I don't know how much the devs check the tickets. Cheers Lars

1 0

BGL in shared memory
by Alexandre Motin 27 Feb '14

27 Feb '14

Hello, I would like to know if BGL works in a shared memory environement. I would like to build a graph (with BGL) in a shared memory area in order to enable multiple processes to access the graph. Best regards, Alexandre Motin

3 3

GSoC 2014 Implementation of Algorithms for Boost.
by Tejas Nikumbh 27 Feb '14

27 Feb '14

Hi Guys, I am Tejas Nikumbh, a Senior UG at IIT Bombay. I am very much interested in contributing to Boost this year. I'm primarily interested in implementing Algorithms and Data Structures or both. I have considerable experience template based data structures as well as algorithms. I'll shortly post a link to the relevant code as this discussion goes on further. Besides the traditional DS and Algos I also have in mind implementation of certain awesome data structures (like say, KDTree) to extend the Boost Libraries capabilities. I found the following algorithms to be of importance to Boost [as from the ideas page on SVN] - Radix sort - Approximate string matching - Full text search - Near Duplicate Detection (shingling) - Parallel algorithms (sort, for_each) - Algorithms for gpgpu - Kinetic scrolling I know some of the algorithms in this list and would research and provide a in depth proposal for implementation of these into boost. As of now, I'd like to know about the potential mentors for this kind of project and whether it is something that Boost is looking forward to. I am pretty enthusiastic about this project so I would like to know how high the project is on Boost's priority list. Also, I wish to start early and get a head start by implementing one simple algorithm for Boost before GSoC so that I increase my chances of being selected. Please let me know what you guys think. -- Tejas Nikumbh, Fourth Year Undergraduate, Electrical Engineering Department, IIT Bombay.

3 10

GSoC 2014 Boost.odeint project
by SHANTANU SHAHANE 26 Feb '14

26 Feb '14

Hello, I am a pre-final year engineering student. I am interested in the project of developing implicit routines in odeint library as a part of GSoc 2014. I have experience of C++ programming and also, I have studied basic numerical methods like Euler and Runge-Kutta. I would be grateful if someone would guide me as how to proceed further as in if I need to read some reference or to code some small problem etc. Thanks in advance. Regards: Shantanu Shahane, Fourth Year Undergraduate, Dept. of Mechanical Engineering, Indian Institute of Technology Bombay, Powai, Mumbai-400076 (India). Mobile No.: 9967330927, 9370029097

2 3

Can we consider BOOST_DEDUCED_TYPENAME deprecated?
by Neil Groves 26 Feb '14

26 Feb '14

Hi! I'm finally getting around to spending some decent time tackling tickets on Boost.Range and I'm finding the rather verbose BOOST_DEDUCED_TYPENAME to be considerably worsening the readability of my new code. I believe this existed to cope with very old compilers which we no longer officially support in new versions of Boost. Should I continue to put this in, or is it reasonably to drop a painful workaround for such an old compiler issue? Neil Groves

2 1

[GitHelp] (Mis-)Understanding merge
by Edward Diener 26 Feb '14

26 Feb '14

I was following Modular Boost document "Establishing a merge point after SVN Conversion" (https://svn.boost.org/trac/boost/wiki/PostCvtMergePoint) and everything appeared to go well. I did my 'merge', 'commit', and 'push' specified at the end of the document and things seemed pretty good so I was confident I had established a correct merge point. Knowing that the latest 'develop' had been pushed and tested I determined to update 'master' with the latest 'develop' prior to pushing it. So I did a merge from 'develop' to 'master' and after carefully fixing a few minor conflicts in favor of the 'develop' versions the merge was successful. Yet when I looked at the files involved I noticed that a file which was in 'develop' was not in 'master'. How can this be ? If I merge from 'develop' to 'master' are not any files in 'develop' which are not in 'master' added automatically to 'master' ? If this is not the case it seems that a 'merge' is not doing what I expect it to do. Am I really expected to have to manually add files to 'master' which are in 'develop' and not in 'master' prior to the merge, or I have I missed some 'merge' functionality that would have done this for me automatically ?

3 8

[gsoc14] About "Boost.Functional / Monads"
by Manasij Mukherjee 26 Feb '14

26 Feb '14

Hello everyone, I am interested in working on the Monad idea posted on the project ideas page. I have some academic experience with functional languages like SML and Haskell and find monads interesting. Should I come up with some proof of concept code to show how I'd design it before submitting a proposal when it is time? Or would it be preferrable to follow boost style (which I do not have much idea about) from before starting? In that case, I'd like some pointers to boost code implementing similar stuff. Manasij Mukherjee

2 2

[Boost-users][icl] Icl broken for c++11's hint semantics. Fix provided.
by Joachim Faulhaber 25 Feb '14

25 Feb '14

Dear Icl users, due to a subtle effect of the changed hint semantics for associative containers, the icl library is broken in versions <= 1.55.0 when used with new STL-libraries that implement the new c++11 standard. This bug is fixed in the upcoming Boost 1.56.0. (see regression tests at http://www.boost.org/development/tests/master/developer/icl.html) Since the release of boost 1.56.0 seems to take longer than planned due to restructuring efforts for modular-boost, users of Boost.Icl affected by the problem may choose to pull the fixed Boost.Icl directly from the git repository and replace your_boost_1_55_0/boost/icl with the new code. The libs/icl part does not need an update. Another possibility is to apply the patch-file diff_icl_1_55_0_and_master.patch that is attached to this post to your local boost library 1.55.0: 1. cd to your_boost_1_55_0 root directory. your_boost_1_55_0> 2. From the command line type your_boost_1_55_0> patch -p2 < diff_icl_1_55_0_and_master.patch You may check the patched library by moving to your_boost_1_55_0/libs/icl/test and run your_boost_1_55_0/libs/icl/test> bjam Sorry for the inconvenience. Best regards, Joachim P.S.: For those interested in details of the issue here is a report: The semantics of insertion with hint in associative containers changed in c++11 form insert-after-hint (c++98/03) to insert-before-hint (c++11) see e.g. proposal N1780: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1780.html so for an associative container c of type C, a value x and an iterator hint c.insert(hint, x); //tries to insert x right after hint in c++98 c.insert(hint, x); //tries to insert x before hint in c++11 In accordance with this behavior, if using the insert function std::pair<bool, iterator> C::insert(value_type const& x); (success, hint) = c.insert(x); the iterator hint of unsuccessful insertion is the matching hint, pointing to [c++98] the last element y in c that is not greater x, so x can be inserted *after* that hint. [c++11] the first element z in c that is greater than x, so x can be inserted *before* that hint. In Boost.Icl I used the returned hint-iterator of the insert function, that always returned the last overlapping interval y for an inserted interval x given the interval's exclusive-less ordering under c++98. With the changed hint semantics, this returned hint-iterator did not point to the last interval y overlapping x anymore but to the first interval z not overlapping x. Therefore the code was broken and returned false results. -- Interval Container Library [Boost.Icl] http://www.joachim-faulhaber.de

1 0

[testing][jc-bell] Test compilation output truncated
by Andrey Semashev 25 Feb '14

25 Feb '14

Hi, I'm facing the problem with the too low limit for the compiler output size. See here: http://www.boost.org/development/tests/develop/developer/output/FBSD-64%20j… The output contains 2 warnings and part of what may be the actual error. This log is not really helpful, so I have 2 questions: 1. Can this limit be increased? 2. Can I get the full output somehow? Thanks.

2 4

[data-structure] uncompleted data-structure/Algorithm projects
by Prabhat Kumar 23 Feb '14

23 Feb '14

Hello, I'm new to boost community and I don't know where I can find uncompleted projects on data-structure/Algorithms to work on. Please tell where I can find them and how to contribute to those projects. Thanks, Prabhat Kumar

2 1

Boost.Odeint GSoc 2014
by Animesh Gaitonde 23 Feb '14

23 Feb '14

Hi everyone , I am Animesh Gaitonde , 4th year student from Bits-Pilani,India.My major is Electronics & Instrumentation Engineering and I am interested in contributing to Boost during GSoC 2014.I have gone through the different GSoC projects and idea's on Boost' C++ Libraries' homepage for the Summer of Code(SoC). I found the numerical library Boost.Odeint interesting.I have completed a course on Numerical Analysis and also used Boost.Odeint for algorithmic assignments.Moreover,I have been using C++ for around 3 years and I am familiar with STL and to some extent with numerical algorithms. I have gone through the documentation of Odeint and learnt about its structure.I solved a few examples and used different explicit Steppers for solving the ODE's.Currently since Odeint supports only explicit methods it would be better to expand it by adding implicit routines and also to make the existing implicit methods(Euler and Rosenbrock) independent of Boost.uBlas to have greater flexibility.I am learning about the different numeric algorithms for solving ODE's,their implementation in Odeint and along with it solving the ordinary differential equations whose solution cannot be determined analytically. I would like to get in touch with Mario Mulansky or Karsten Ahnert , the mentors for this project to provide me with further pointers for developing the proposal and any tasks which they would like to give me so that I get familiar with Odeint. Regards Animesh Gaitonde 4th year Undergraduate Bits-Pilani,Goa Campus

1 0