January 2014 - Boost - lists.preview.boost.org

[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

[graph][BGL][PBGL] Proposed patches
by bminano 15 Jan '14

15 Jan '14

Hi, I found two problems using the graph library, concretely using it in parallel. Swimming into the code I think I found possible solutions to that. I proposed two patches in boost Trac at tickets #9549 and #8250, but I had no response. I am afraid the tickets were not revised, so I think publishing here would be a good idea. Maybe the maintainers of the library want to apply that patches for future releases. I hope so, as I am working in a project that will select boost graph as a masterpiece of graph simulations. I the responsible wants to ask me about the bugs I'll be glad to answer. -- View this message in context: http://boost.2283326.n4.nabble.com/graph-BGL-PBGL-Proposed-patches-tp465789… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Re: [boost] GSoC 2014
by Christopher Kormanyos 15 Jan '14

15 Jan '14

> hi sir, > i m deepak, i want to apply for GSOC 2014 . i am good in c++, mathematics > and having proficient knowledge of algorithms. > i have a special interest for following boost libraries > - Boost.Math Generalized Hypergeometric Functions Well, that's a cool one for sure :-) Thank you for your interest, deepak. It's still a bit early in the game because we have not yet found an organization administrator. Nor have we formally applied as an organization for GSoC 2014. So keep an eye on the progress and base your actions accordingly. > Boost.Multiprecision > new data structures and algorithms I do not believe that we will be working on Multiprecision in this year's GSoC. Some of the things are already done, and others, quite honestly have too much novel research character for GSoC. This is an area for independent research at the moment. > i want to know if i could start early or work with boost trac or you tell me what to do As I mentioned, keep an eye on our progress. If Boost applies, and if Boost gets nominated for GSoC, then you may apply. It is a worldwide competition, so it always helps to apply early, ask questions on the board, write a good proposal, and generally do your best. Good luck. Chris. On Tuesday, January 14, 2014 8:45 PM, deepak goel <deepakgoel7514(a)gmail.com> wrote: On Monday, January 13, 2014 2:08:39 AM UTC+5:30, Christopher Kormanyos wrote: >> I have just added a page for GSoC 2014 here >> https://svn.boost.org/trac/ boost/wiki/SoC2014 > >Thank you Vicente. > >I have added "Boost.Math Generalized Hypergeometric Functions". > >Sincerely, Chris. > > > > > >On Sunday, January 12, 2014 6:45 PM, Vicente J. Botet Escriba <vicent...(a)wanadoo.fr> wrote: > >Le 12/01/14 18:20, Christopher Kormanyos a écrit : > >>> Deadline for registering as a mentoring organization for GSoC 2014 is 14 >>> Feb 2014. >>> Should we start collecting ideas? >> I believe we have several good ideas. We need to get moving. >> >> Does anyone know how to put up the skeleton of this kind >> of page? (Or can anyone point me in the right direction on >> how to do it?) >> >> https://svn.boost.org/trac/ boost/wiki/SoC2013 >> >> The hard part, I believe, will be finding one or more org admins. >> The guys did a great job last year, and set the bar pretty high. >> >> * I can probably mentor a student. >> * I can help collecting and writing the ideas on SVN trac. >> * I could also help writing the GSoC 2014 proposal and with recruiting. >> >> But org admin would potentially be too much of a commitment for me. >> >> Is anyone interested in being org admin for GSoC 2014? >> >Hi, > >I have just added a page for GSoC 2014 here >https://svn.boost.org/trac/ boost/wiki/SoC2014. > >Be free to add your projects and ideas. >Vicente > > hi sir, i m deepak, i want to apply for GSOC 2014 . i am good in c++, mathematics and having proficient knowledge of algorithms. i have a special interest for following boost libraries - Boost.Math Generalized Hypergeometric Functions Boost.Multiprecision new data structures and algorithms i want to know if i could start early or work with boost trac or you tell me what to do ______________________________ _________________ >Unsubscribe & other changes: http://lists.boost.org/ mailman/listinfo.cgi/boost > > >______________________________ _________________ >Unsubscribe & other changes: http://lists.boost.org/ mailman/listinfo.cgi/boost >

2 1

Regression test results starting to become available
by Beman Dawes 15 Jan '14

15 Jan '14

http://beta.boost.org/development/tests/master/developer/summary.html http://beta.boost.org/development/tests/develop/developer/summary.html Only a few of the testers have cycled. Some testers are only reporting results for 15 or so libraries. That's an artifact of getting started; these testers cycle the full tests will appear. --Beman

5 6

[git] annotated SVN synchronization for boost.test (example only)
by Peter A. Bigot 15 Jan '14

15 Jan '14

Below is an annotated sequence of (bash) command-line git operations that I used in a local copy of Boost.Test to understand what was happening in it, with no intention of proposing this be what the maintainers actually do with the module. Boost.Test is particularly interesting because master has been essentially unchanged for four years, while there are significant modifications pending in develop. A few of the changes on master make the SVN synchronization step tricky. People who want to hone their git-fu might find it workwhile to follow these steps in a local workspace to see how they work. I make no claim that they're the only way the same goal could be reached. I also have not used this for further development, so there the resulting structure may be flawed or contrary to strict git-flow expectations. WARNING: DO NOT paste the entire sequence into a shell window: at a couple of places you must manually do what the comment says (e.g., edit the contents of files to resolve conflicts) in order to reach a successful state. # Revert to a clean state where local branches match the origin, and the # working branches from any previous run of the script have been # removed. git fetch origin git checkout master git reset --hard origin/master git checkout develop git reset --hard origin/develop git branch -D synch/master synch/develop basis # git-merge-base identifies the commit to be used when merging things. # We're looking for something better, so no need to go beyond that one. MERGE_BASE=$(git merge-base develop master) # 635b1e38dd643af264c2ea8f0ba08dfb58337e37 echo ${MERGE_BASE} # Examine the history along master and develop, finding the most recent # SVN revision merged from develop into master. This only works if all # previous SVN revisions were also merged; if only select ones were # merged, it's probably best to skip them and keep looking. For # example, master on Boost.Test merged 81913, 63640, 62426, and a couple # others, but the last version that incorporated most prior fixes was # 57993 merged in ${MST_MP_SHA1}. git log ${MERGE_BASE}..master MST_MP_SHA1=2e4f64197956ccb94b24be4ed32abf25ee4b9dd1 # Now find the develop commit that most recently preceded that one in # SVN history. Basically, this is reviewing the log of differences # for the last commit with a SVN revision less than the one selected in # the previous step. BEWARE: If the revision you picked above doesn't # correspond to a develop branch change (e.g., if you picked 81913 which # didn't go into develop until 82756) you will create pain for yourself. git log ${MERGE_BASE}..develop # Here it's commit 57864 in ${DEV_MP_SHA1} DEV_MP_SHA1=fd8d9b3e4e4ab9656b0d880e8c519eabd134638a # Now take a look at what's different between those versions. That's # what'll get lost in a "-s ours" merge if it subsequently appeared in # develop. git diff ${DEV_MP_SHA1}..${MST_MP_SHA1} # There's some whitespace differences, some casts and error messages, # file permission changes, and two small changes from r81913 that we'll # talk about later. # Here's where my technique differs: You could do an "-s ours" merge # from the selected develop commit into master's HEAD as recommended at # https://svn.boost.org/trac/boost/wiki/StartModMaint#Firstpost-svnconversion… # but if you do you might lose cherry-pick commits on master that are # also on develop. Instead, we'll create a new merge point on master at # the synchronization point, and merge from develop. git checkout -b basis ${MST_MP_SHA1} git merge -s ours -m 'SVN merge basis preserving master' ${DEV_MP_SHA1} # Verify that the differences are the ones we accepted earlier: git diff basis..${DEV_MP_SHA1} # Now, let's do some cleanup, and get master and develop branches that # actually fork at the merge point, rather than simply assume the merge # point is identical. This indirectly helps manage the differences that # we threw away with "-s ours". git checkout -b synch/master master git rebase basis # This should show no differences, because we just inserted a commit # that records parentage but changes no content. git diff master synch/master # Do the same at develop. Here we're going to have to resolve any # conflicts between the selected merge point git checkout -b synch/develop develop git rebase basis # 66 patches in we hit one of the differences: git stat # (MANUAL STEP) There's whitespace at the end of build/Jamfile.v2. Edit # the file to remove the diff markers, stage the changes, and tell # rebase to continue. git add -u git rebase --continue # After 204 patches there's another. git stat # (MANUAL STEP) Here you'll see everything is clean except # include/boost/test/impl/framework.ipp. Search for <<<<<< and edit to # keep the one with the upper-case TUT_SUITE. git add -u git rebase --continue # And we're done. Now let's see what changed: git diff develop synch/develop # Some of the differences between master and develop at the SVN merge # point have gone away; these are the ones I suspect but have not # confirmed would have been lost had we merged to master's HEAD instead # of to the base version. A few changes remain that were in master but # not in develop. # You have a choice at this point. If the repository wasn't already # public, I'd reset master (develop) to synch/master (synch/develop) and # move on. But since they were public, merge them; keeps history, # and makes future actions cleaner. git checkout master git merge -m 'Merge in rebased master' synch/master git checkout develop git merge -m 'Merge in rebased develop' synch/develop # Finally, what would happen if we merged develop into master now? git checkout -b test master git merge develop # Very nearly a clean merge. See what's not staged: git stat -u | grep '^.[^ ]' # ## test # UU include/boost/test/utils/runtime/cla/parameter.hpp # UU include/boost/test/utils/runtime/env/variable.hpp # # Again, open the files and look for the diff markers: one uses m!=0 and # the other !!m. Which is right? Use git-blame: git blame origin/master include/boost/test/utils/runtime/cla/parameter.hpp # The master change came in 954d3ab6 which was SVN commit r81913 by # Vicente J. Botet Escriba. Show the change: git log -p 954d3ab6^! git blame origin/develop include/boost/test/utils/runtime/cla/parameter.hpp # The develop change came in 4f7fc06c which was SVN commit r82756 by # Gennadiy Rozental. Show the change: git log -p 4f7fc06c^! # Note that if, back when selecting the SVN merge point, we'd gone with # r81913 things would be completely bolluxed at this point since the # corresponding change didn't come from the develop branch. # (MANUAL STEP) It's Rozental's project, so pick the develop solution # (!!m). Then stage the changes and commit, editing the message to # indicate how you resolved the conflict. git add -u git commit

5 7

[any] Equality
by Bjorn Reese 15 Jan '14

15 Jan '14

I noticed that boost::any does not have an operator== for comparing two boost::any objects. Is this a deliberate choice? Currently I have to (1) compare the types, and (2) convert the values with any_cast (and probably catch bad_any_cast exceptions) and compare them.

4 4

[context] compile failure
by Jürgen Hunold 15 Jan '14

15 Jan '14

Hi Oliver, Boost.Context fails to compile since commit 5f52abd82fb6fb32d7d79575e48b3f26bfff6d27 Author: Oliver Kowalke <oliver.kowalke(a)gmx.de> Date: Thu Jan 9 17:39:59 2014 +0100 add support for 'combined' architeture on MacOS X with error message: - 32-bit : no - 64-bit : no error: at /ive/hunold/src/devel/boost/tools/build/src/kernel/modules.jam:107 error: Unable to find file or target named error: '/boost/architecture//combined' error: referred to from project at error: '/ive/hunold/src/devel/boost/libs/context/build' It seems that config/ is missing the combined.cpp needed for the architecture check. Could you please add it? Tip: Use git config --global status.showuntrackedfiles all to always show new file with "git status". This is from http://qt-project.org/wiki/Setting-up-Gerrit but maybe should be in our wiki,too. Thanks! Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu ! Germany

2 4

Re: [boost] Prefix Trie
by Arash Partow 14 Jan '14

14 Jan '14

On Wed, Jan 15, 2014, Michael Conlen wrote: > > I recently discovered that there seems to be a lack of good Prefix Tries in C++. blah blah blah. > I highly doubt your assertion. In fact I'd go so far as to say, the only language one can find decent-to-excellent implementations of the various algorithms is C++. eg: https://code.google.com/p/patl/

1 0

Adding cstdfloat.hpp - wheres the best place?
by John Maddock 14 Jan '14

14 Jan '14

Folks, Christopher Kormanyos has coded up a version of cstdfloat.hpp for Boost.Math: https://github.com/boostorg/math/blob/bernoulli-tgamma/include/boost/math/t… This header is proposed for C++14, and the C language folks are doing something similar: it provides similar functionality for floating point types that <cstdint> does for integer types: Typedefs: floatN_t float_leastN_t float_fastN_t floatmax_t Macros: BOOST_FLOATN_C(x) // floating point constant of width N. BOOST_FLOAT_N_MIN BOOST_FLOAT_N_MAX BOOST_FLOAT_FASTN_C(x) BOOST_FLOAT_LEASTN_MIN BOOST_FLOAT_FASTN_MIN BOOST_FLOAT_LEASTN_MAX BOOST_FLOAT_FASTN_MAX BOOST_FLOATMAX_C(x) BOOST_FLOATMAX_MIN BOOST_FLOATMAX_MAX Where N is one of 16, 32, 64, 128 and correspond to the IEEE half, single, double and quad types respectively. So... the question is where to best place this? Does anyone object if it goes under boost/cstdfloat.hpp to sit alongside cstdint.hpp? Where should it best be documented and tested? We can obviously add it under the Math lib, but is there a better more "discoverable" place? cstdint.hpp is under integer BTW so it can't go there ;-) Thanks in advance, John.

2 1

[TortoiseGit] New release fixes submodule problem bothering some Boosters
by Beman Dawes 14 Jan '14

14 Jan '14

TortoiseGit release 1.8.7.0 fixes the Submodule Update... crash that was one of the few problems that forced TortoiseGit users to switch to the command line. Thanks to the TortoiseGit folks for jumping on the Boost bug report immediately, and the libgit2 folks who in turn fixed a problem with their library. --Beman

1 0