- Boost - lists.preview.boost.org

[phoenix] 9111 and 9113
by Fletcher, John P 23 Jan '14

23 Jan '14

________________________________________ From: Boost [boost-bounces(a)lists.boost.org] on behalf of Mathias Gaunard [mathias.gaunard(a)ens-lyon.org] Sent: 21 January 2014 16:44 To: boost(a)lists.boost.org Subject: Re: [boost] [phoenix] New maintainer On 20/01/14 13:40, Fletcher, John P wrote: >> If you have any information on your problems with Phoenix, in particular any not already on the bug system, please let me know. >> > I filed bugs about warnings a while ago. (9111, 9113) > It shouldn't take much work to fix those and it would be great if I > could finally make my code compile without warnings. I have now pushed a fix for 9111 and some fixes for 9113 to the develop branch. The report on 9113 says there are others, so any other reports would be helpful. John _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

raw.github.com access from behind firewall
by Belcourt, Kenneth 22 Jan '14

22 Jan '14

Hi, When I try to run github hosted regression tests with run.py, access to raw.github.com times out even though it seems to be using the specified our proxy server. # Running regressions in /scratch/modular-boost... # Creating regression scripts at /scratch/modular-boost/tools_regression_src... # Dowloading regression scripts from https://raw.github.com/boostorg/boost/develop/tools/regression/src... --- http://wwwproxy.sandia.gov:80 What's interesting is that I'm able to clone from github.com just fine, as you can see here. -bash-4.1$ git clone https://github.com/boostorg/boost Initialized empty Git repository in /scratch/modular-boost/boost/.git/ remote: Counting objects: 180556, done. remote: Compressing objects: 100% (68339/68339), done. remote: Total 180556 (delta 111934), reused 180501 (delta 111879) Receiving objects: 100% (180556/180556), 68.21 MiB | 10.23 MiB/s, done. Resolving deltas: 100% (111934/111934), done. But we're not able to clone from raw. -bash-4.1$ git clone https://raw.github.com/boostorg/boost Initialized empty Git repository in /scratch/modular-boost/boost/.git/ error: The requested URL returned error: 403 while accessing https://raw.github.com/boostorg/boost/info/refs fatal: HTTP request failed which means this clone (https://raw.github.com/boostorg/boost/develop/tools/regression/src) will fail. Is this a known issue and / or is there a workaround for this? This is on RHE Linux with git 1.8.5.1. -- Noel Belcourt

3 9

[phoenix] bug 9111
by Fletcher, John P 22 Jan '14

22 Jan '14

From: Boost [boost-bounces(a)lists.boost.org] on behalf of Mathias Gaunard [mathias.gaunard(a)ens-lyon.org] Sent: 21 January 2014 16:44 To: boost(a)lists.boost.org Subject: (was Re: [boost] [phoenix] New maintainer > I filed bugs about warnings a while ago. (9111, 9113) > It shouldn't take much work to fix those and it would be great if I > could finally make my code compile without warnings. I have looked at the code for no 9111 and it looks like this: template <int M, typename RhsRT, typename RhsFP> bool operator==(function_ptr<M, RhsRT, RhsFP> const & rhs) const { return false; } For some reason that specialized case is always returning false, which is why rhs is unused. I need to look into why that is the case, or else do some dummy operation on rhs which will suppress the warning. John

2 2

[config] BOOST_NOINLINE on nvcc
by Mathias Gaunard 22 Jan '14

22 Jan '14

Hi, I noticed that I had some problems with some nvcc (NVIDIA CUDA) versions and BOOST_NOINLINE. The logic for defining BOOST_NOINLINE seems to be the same as that of BOOST_FORCEINLINE, which does work correctly, so it seems to be a nvcc bug that's not fully compatible with GCC despite claiming to be. What would be the correct way to fix that?

3 4

[git] boost + git flow
by Oliver Kowalke 22 Jan '14

22 Jan '14

does boost follows the git-flow schema, e.g. merging the changes from branch develop into master is not required by the library developer (this is done by the release manager)?! Oliver

5 4

[testing] Reports that lead nowhere?
by John Maddock 22 Jan '14

22 Jan '14

While we're updating and fixing testing issues, I notice the report generator is still creating content-free failures, for example this one: http://www.boost.org/development/tests/develop/developer/marshall-mac-regex… Ultimately leads nowhere :-( Thanks, John.

4 4

[regex] Need some help with msvc-11/12
by John Maddock 22 Jan '14

22 Jan '14

Can anyone with access to msvc-11 or 12 tell me what's causing this failure: http://www.boost.org/development/tests/develop/developer/output/DrWeb_vc12_… You will probably need to build and run under the debugger to find out I suspect... Many thanks in advance, John.

3 4

Support for Android
by Vicente J. Botet Escriba 22 Jan '14

22 Jan '14

Hi, I see that there are some trouble with Boost and Android: https://svn.boost.org/trac/boost/ticket/9082 http://www.boost.org/development/tests/develop/developer/output/apolukhin-A… Could someone state what is the Boost approach to support Android? Should the user build with NDK r8e? Does bjam supports a specific android platform? Best, Vicente

4 11

[wave] preprocessor directives in output
by Eric Niebler 22 Jan '14

22 Jan '14

I'm looking at automating the regeneration of Fusion's preprocess headers with the wave tool. Currently, it's impossible because of stuff like this (from container\vector\vector.hpp): #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) vector(vector&& rhs) : vec(std::forward<vector_n>(rhs.vec)) {} #endif When the wave driver is run, either BOOST_NO_CXX11_RVALUE_REFERENCES is defined, in which case the block of code gets left out, or else it isn't, in which case the block of code is left in. Both are wrong. What should happen is that the #if and #else directives should be present in wave's output. I can keep wave from expanding certain named macros with the -N switch, but there doesn't seem to be a way to selectively keep wave from evaluating #if/#else directives. Or is there? Any help appreciated. Eric

8 18

[variant] Breaking change introduced by variadic support
by Agustín K-ballo Bergé 22 Jan '14

22 Jan '14

The recent changes to introduce variadic support to `variant` introduce breaking changes in the documented macros. When variadic support is detected, `BOOST_VARIANT_LIMIT_TYPES` is not defined and `BOOST_VARIANT_ENUM_[SHIFTED_]PARAMS` uses variadic templates instead of enumerating parameters. This is a breaking change in the documented interface, and one that requires all but the simplest use cases to be rewritten. For instance, this breaks _Boost.Spirit_ support of `variant` (https://svn.boost.org/trac/boost/ticket/9238) requiring two different implementations to be provided. Is this the preferred path to take? I would suggest instead to keep the macros as documented at all times, and let the user handle the variadic case manually. This would allow users to support both variadic and non-variadic `variant`s up to a certain limit with a single code case (without breaking the documented interface), and result in cleaner code for those cases that only target compilers with variadic support. There's no point in using a macro if it won't work for both cases. Regards, -- Agustín K-ballo Bergé.- http://talesofcpp.fusionfenix.com

3 8

[phoenix] New maintainer
by Fletcher, John P 21 Jan '14

21 Jan '14

I have just agreed to play a part in the maintenance of Boost Phoenix. I am working with a lot of help from Joel, Thomas and Eric. I have been looking at the bugs logged on the system and it seems as though there are a number of reported problems which need to be tackled, in particular 9362 and 9363. Please bear with me as I learn the modular-boost system and look for fixes for the problems. If you have any information on your problems with Phoenix, in particular any not already on the bug system, please let me know. Best wishes John

3 3

Reboot the CREST server machines
by DongInn Kim 21 Jan '14

21 Jan '14

Dear All, The current CREST servers need to reboot to kick in a new kernel and to mount a NFS server with a new IP address. If things are not too critical nowadays, I would like to reboot the following server machines next Tuesday (Jan 21st). - lion.crest.iu.edu - tiger.crest.iu.edu - wowbagger.crest.iu.edu - leopard.crest.iu.edu - jaguar.crest.iu.edu Date: Jan 21st, Tuesday Time: 6:00am-6:30am Pacific US time 7:00am-7:30am Mountain US time 8:00am-8:30am Central US time 9:00am-9:30am Eastern US time 12:00pm-12:30pm GMT The list of services that may not be available: - NFS - Web services www.crest.iu.edu www.open-mpi.org www.boost.org svn.crest.iu.edu/svnmanager ... - Mailing lists - Subversion - LDAP authentication (login to the Linux workstations and cutter cluster) Please let me know if you have any questions or concerns about this booting schedule. Regards, -- - DongInn

1 1

bjamming that used to work before modular-boost
by Paul A. Bristow 20 Jan '14

20 Jan '14

I have a jamfile.v2 in a sandbox project that used to work before. I have started using modular-boost, and after some fumbling, I'm using that OK-ish. The message is: Unable to find the Boost source tree in the locations searched. Try setting the environment variable BOOST to point to your Boost tree, or else invoke bjam with the --boost=path option. The Boost include path will not be automatically set. The paths searched were I:\boost-sandbox\guild/../boost I:\boost-sandbox\guild/../Trunk But the file LICENSE_1_0.txt was not found in any of them Unable to find the Boost.Build source tree in the locations searched. Try setting the environment variable BOOST_BUILD to point to your Boost.Build tree, or else invoke bjam with the --boost-build=path option. The paths searched were i:\modular-boost\tools\build\v2 But bootstrap.jam was not found in any of these More failures will very likely follow... (And they did ;-( ) I've tried some guesses at parameters including b2 --boost=i:\modular-boost --boost-build=i:\modular-boost\tools\build -a html without success. I have boost-build.jam at I:\modular-boost Suggestions please. Paul PS I'd like to change environment variables if possible to avoid changing lots of .bat files that call b2. --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

4 8

Forthcoming Boost.Fiber review
by Nat Goodspeed 20 Jan '14

20 Jan '14

Hi all, The review of Boost.Fiber by Oliver Kowalke is scheduled from Monday, January 6th to January 12th. ----------------------------------------------------- About the library: Boost.Fiber provides a framework for micro-/userland-threads (fibers) scheduled cooperatively. The API contains classes and functions to manage and synchronize fibers similar to Boost.Thread. Each fiber has its own stack. A fiber can save the current execution state, including all registers and CPU flags, the instruction pointer, and the stack pointer and later restore this state. The idea is to have multiple execution paths running on a single thread using a sort of cooperative scheduling (versus threads, which are preemptively scheduled). The running fiber decides explicitly when it should yield to allow another fiber to run (context switching). Boost.Fiberinternally uses coroutines from Boost.Coroutine <http://ok73.funpic.de/boost/libs/coroutine/index.html>; the classes in this library manage, schedule and, when needed, synchronize those coroutines. A context switch between threads usually costs thousands of CPU cycles on x86, compared to a fiber switch with a few hundred cycles. A fiber can only run on a single thread at any point in time. docs: http://ok73.funpic.de/boost/libs/fiber/doc/html/index.html<http://ok73.ok.funpic.de/boost/libs/coroutine/doc/html/> git: https://github.com/olk/boost-fiber src: http://ok73.ok.funpic.de/boost.fiber.zip<http://ok73.ok.funpic.de/boost.coroutine.zip> --------------------------------------------------- Naturally, you need not wait until the review formally opens to start reviewing the Fiber library. Please always state in your review whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Nat Goodspeed Boost.Fiber Review Manager ------------------------------

6 8

GSoC 2014
by Bjorn Reese 20 Jan '14

20 Jan '14

Deadline for registring as a mentoring organization for GSoC 2014 is 14 Feb 2014. Should we start collecting ideas?

13 20

[build] referring to a tool from an external project
by Eric Niebler 20 Jan '14

20 Jan '14

I'm trying to write a jamfile in an external project that uses boost. The jamfile should invoke the wave tool to preprocess some code as a build action. I have this: actions do_wave { $(>[2]) -o- --config-file wave.cfg $(>[1]) } W = /boost/libs/wave/tool/build//wave ; make preprocess : preprocess.cpp $(W) : do_wave ; I get: > error: Unable to find file or target named > error: '/boost/libs/wave/tool/build//wave' > error: referred to from project at > error: '.' > error: could not resolve project reference '/boost/libs/wave/tool/build' If I use this instead: W = /boost//wave ...it builds the wave dlls, not the command-line tool. So how do I tell it to build the tool? -- Eric Niebler Boost.org http://www.boost.org

3 5

[Math] Permutations?
by Vee Kay 19 Jan '14

19 Jan '14

Hello, Would it be useful for Boost to provide a permutation class? The standard provides a couple of relevant functions (is_permutation, next_permutation) and Boost.Iterator offers a permutation_iterator adaptor. But as far as I can tell, no class that can be manipulated similarly to the mathematical object, something like this: https://gist.github.com/Kojirion/8503800 I admit I do not have many use cases in mind, just the impression this is a useful tool. As an example, once in a gui application I wished to animate the rearranging of a table; writing a permutation class made it easy to get the sequence of transpositions of rows and columns that would yield the desired result. (note though the above api doesn't include an asTranspositions() because I 'm not sure what is the most useful way to represent a transposition). I 'd be happy to hear your thoughts, Albert

2 1

STL::MAP: Printing values only once ..
by Rahul Mathur 18 Jan '14

18 Jan '14

Hi, I have a input.txt file seperator by pipe '|' as - 40147|181|ORANGE|MIKE|XX||1000397900|3500 40148|373|ORANGE|BOB|XX||1078889400|4500 40149|673|ORANGE|TREY|XX||1095159900|5500 I only wish to have all the FIRST(ID=40147) and LAST FIELD(PRICE=3500) to be printed for three lines as given above. I am reading as - -- #include <iostream> #include <fstream> #include <sstream> #include <string> #include <boost/algorithm/string.hpp> using namespace std; struct FILE_INPUT { int ID; int Asset_ID; char T_Name[]; char Symbol[]; char Series[]; char Gap; int Date; int price; }; int main() { typedef std::map<int, int> unordmap; unordmap ask; FILE_INPUT fl_inp; memset( &fl_inp, 0, sizeof(fl_inp) ); ifstream in ("input.txt"); string s; const char delimiter = '|'; while ( getline (in, s) ) { trim( s ); if ( !s.empty() ) { stringstream strm( s ); string item; getline( strm, item ); stringstream stra( item ); string tmp; getline( stra, tmp, delimiter ); { stringstream strb( tmp ); strb >> fl_inp.ID; } getline( stra, tmp, delimiter ) { stringstream strb( tmp ); strb >> fl_inp.price; } ask.insert( std::make_pair((fl_inp.ID),(fl_inp.price)) ); unordmap::iterator pos = ask.begin(); for (pos = ask.begin(); pos != ask.end(); ++pos) { std::cout << "ID: " << pos->first << "\t" << "Price: " << pos->second << std::endl; } std::cout << " " << endl; } } } -- The map is being inserted with both ID as key and price as value but while printing it prints the values thrice as - ID: 40147 Price: 3500 ID: 40147 Price: 4500 ID: 40148 Price: 5500 ID: 40147 Price: 3500 ID: 40148 Price: 4500 ID: 40149 Price: 5500 The MAP should print all values together only once as - ID: 40147 Price: 3500 ID: 40148 Price: 4500 ID: 40149 Price: 5500 -- Can I maintain some checks to print all values simply once. Thanks.

5 4

Re: [boost] Request for comments on super-project workflow doc
by Peter Dimov 18 Jan '14

18 Jan '14

Robert Ramey wrote: > John Maddox brought up the question of "bridge libraries" (?) . An > example would be the serialization library includes tests for boost > variant but doesn't use boost variant itself. So if one includes just the > modules which the serialization library uses to build - you'll get one set > of modules which won't include the ability to run the test set. If you > include all the modules which test set requires, you're going to include > half of boost. Yes, in general, there are three sets of dependencies: what the library headers depend on, what the library sources depend on, and what the library tests depend on, each a superset of the previous one. This doesn't make such a tool worthless or impossible though. And - FWIW - bridge libraries are something else, I think. The problem there is that, f.ex. a library X may not depend on the serialization library but making X's types serializable would. A bridge library XS could solve this by depending on both X and serialization and providing the necessary support. In principle, I've always argued that libraries should be designed in such a way so that adding support should not require including a header, but that's not the path of least resistance and if one doesn't specifically keep that requirement in mind, it's rare to see it satisfied. (And it's not always possible.) For example, here's how the smart pointers provide hash support without including anything: namespace boost { // hash_value template< class T > struct hash; template< class T > std::size_t hash_value( boost::intrusive_ptr<T> const & p ) { return boost::hash< T* >()( p.get() ); } } // namespace boost and this is how a type may be specified to be a (boost::bind) placeholder, again without any inclusions: namespace boost { template<class T> struct is_placeholder; template<int I> struct is_placeholder< my_placeholder<I> > { BOOST_STATIC_CONSTANT( int, value = I ); }; } // namespace boost

3 3

Prefix Trie
by Michael Conlen 18 Jan '14

18 Jan '14

I recently discovered that there seems to be a lack of good Prefix Tries in C++. There are many basic ones and I think a C implementation ran all of 12 lines of code, but something with a nice interface and iterator seemed lacking. (Stop me if I'm missing something here) So I'm interested in developing Prefix (and possibly a Radix) Trie containers in C++. I could see a use for both sequence and map containers; however this would be a learning experience for me. If there's interest in such a creature I'm happy to go through the review process as necessary. Having said that, is there interest in having such a library and if so what are the pointers on what would be expected (particularly any boost-isms)? -- Mike

3 2

[lockfree] Faster ring-buffer queue implementation
by Alexander Krizhanovsky 16 Jan '14

16 Jan '14

Hello, some time ago I've implemented lock-free multi-producer multi-consumer queue on ring buffer and recently I've compared it's performance with current (Boost 1.55.0) boost::lockfree::queue - it shows 50% better performance. I've made just a quick glance on the Boost implementation and noticed that it uses CAS operations which is basically slower than simple RMW (atomic increment in our case) on modern x86-64 hardware. Maybe I've made some mistake in boost::lockfree::queue usage. If so then I'll be obliged for pointing me out the problem in my benchmark. Otherwise I'm wondering if it has sense to integrate the queue implementation into boost::lockfree? The algorithm description is available at http://www.linuxjournal.com/content/lock-free-multi-producer-multi-consumer… The source code of the queue with the benchmark for boost::lockfree::queue: https://github.com/krizhanovsky/NatSys-Lab/blob/master/lockfree_rb_q.cc And the benchmark results are available here: http://natsys-lab.blogspot.ru/2014/01/natsys-lock-free-queue-in-comparison.… Thanks! -- Alexander Krizhanovsky NatSys Lab. (http://natsys-lab.com) tel: +7 (916) 717-3899, +7 (499) 747-6304 e-mail: ak(a)natsys-lab.com

3 4

[Fibers] asio handler not respecting scheduler
by Eugene Yakubovich 16 Jan '14

16 Jan '14

While working on factoring out the scheduling algorithm, I noticed that when fibers are used with asio, the completion handler manually invokes the fiber: boost-fiber/include/boost/fiber/asio/detail/yield.hpp: In yield_handler<T>: void operator()( T t) { * ec_ = boost::system::error_code(); * value_ = t; fiber_->set_ready(); boost::fibers::detail::scheduler::instance()->spawn( fiber_); boost::fibers::detail::scheduler::instance()->run(); } Why does it call spawn? Shouldn't the scheduler (run method that follows) decide which fiber to run next? What happens if there's another fiber with a higher priority that's ready? A similar issue also comes up when launching a new fiber. The documentation supports the implementation in that the control immediately is transferred to the new fiber. However, shouldn't the scheduling algorithm decide when the new fiber should run? As an unrelated issue, I think this maybe a bug -- it's setting the active fiber to ready instead of waiting: void round_robin::yield() { <snip> // set active fiber to state_waiting active_fiber_->set_ready(); <snip> } Same issue in round_robin_ws and asio/round_robin. Regards, Eugene

3 4

[Boost.Sync] no master branch?
by Eric Niebler 16 Jan '14

16 Jan '14

What is Boost.Sync and why doesn't its repository have a master branch? -- Eric Niebler Boost.org http://www.boost.org

7 14

1.56 release schedule?
by Tim Blechmann 15 Jan '14

15 Jan '14

hi all, according to the website, the 1.56 beta was scheduled on dec 31st and the release date is feb 3rd ... maybe the release managers could update the release schedule? shifting the dates by a month could be realistic, or what do other people think? cheers, tim

5 7

Re: [boost] [Fibers] Performance
by Brian Wood 15 Jan '14

15 Jan '14

Oliver Kowalke wrote: 2014/1/13 Hartmut Kaiser <hartmut.kaiser(a)gmail.com> >> >> Ping? Any news? I'd make my vote depend on the outcome of the performance >> tests. >> > > I'll add performance tests but I doubt that I could finish to implement the > tests till Wednesday. > I've to look through the tests provided by the HPX-project, select some and > try to understand > what they are doing. Maybe a few weeks could be given to Oliver to do the testing. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

2 1