September 2016 - Boost - lists.preview.boost.org

Re: [boost] [fiber] Suggestions regarding asio
by Tatsuyuki Ishi 27 Sep '16

27 Sep '16

It would be better if you used "Reply to All", since I disabled the delivery from the list. > When considering using multiple threads with an io_service passed to a custom Boost.Fiber scheduler, I keep bumping into the problem that a given fiber scheduler instance must always run on its original thread -- but I know of no way to give an Asio handler "thread affinity." How do we get processor cycles to the scheduler on the thread whose fibers it is managing? Since we only poll on one master thread, we can easily get affinity. Maybe pseudocode is easier: * We have two class, one for main polling, others waiting for job. * The first one, polls from asio using the same way as the example (poll, or run_one). while(true) { if(!run_one()) stop_other_threads(); // No more work in asio, give up waiting poll(); // flush the queue // Now we should have some fibers in the queue. yield(); // continue execution } * Other threads, uses condvar to wait on the ready queue. awakened(){queue.push_back(f); cv.notify_[one,all](); iosvc.post([]{});} pick_next(){while(!jobs_available){cv.wait();} return job;}

5 7

Code complexity
by Vard Antinyan 27 Sep '16

27 Sep '16

Dear Boost developers, We have undertaken a task to assess code complexity triggers and generate recommendations for developing simple and understandable code. Our intension is to share the results with you, developers, so everyone can learn the triggers behind complex software. We need your help for rigorous results. My request to you is - if you get 5-10 min. time, would you please consider to answer the questions of this survey on code complexity? https://goo.gl/forms/h9WXZ8VSEw7BUyHg1 You are welcome to learn preliminary results through this link: https://www.facebook.com/SoftwareCodeQuality/photos/?tab=album&album_id=163… The results will be shared in a public webpage and everyone possible will be invited to learn and discuss them. Your knowledge and experience is vital for achieving substantial and generalizable results, and your effort is much appreciated! Sincerely Vard Antinyan PhD candidate in University of Gothenburg, Sweden Tel: 0046317725707

2 1

(Boost) Synapse update
by Emil Dotchevski 27 Sep '16

27 Sep '16

(Synapse is not part of Boost. I appreciate feedback as well as looking for someone willing to volunteer as review manager when Synapse is submitted for formal review.) Synapse is a signal-programming library similar to the Qt signal/slot system and Boost Signals 2. The difference is that Synapse is non-intrusive: any object of any static type whatsoever can serve as an emitter. I've just updated Synapse with support for interthread communication. It is available on github: http://zajo.github.io/boost-synapse/index.html. Thanks, Emil

3 5

Need help with errors while building boost for clang on android NDK
by Robert Dailey 26 Sep '16

26 Sep '16

I'm using NDK r11 and I'm setting up project-config.jam to build boost using clang + llvm STL. I'm running into a few errors that I do not know how to solve. I will post my config file at the bottom. First problem is that boost does not know where to find tools 'ar' and 'ranlib': clang-linux.archive bin.v2\libs\container\build\clang-linux-android\release\link-static\runtime-link-static\target-os-linux\threading-multi\libboost_container-clang-mt-s-1_61.a '"ar"' is not recognized as an internal or external command, operable program or batch file. '"ranlib"' is not recognized as an internal or external command, operable program or batch file. How can I explicitly specify the NDK path to these executables? Second problem is related to some assembler stuff, I think. I get these errors while compiling boost thread: clang-linux.compile.asm bin.v2\libs\context\build\clang-linux-android\release\link-static\runtime-link-static\target-os-linux\threading-multi\asm\make_i386_ms_pe_gas.o libs\\context\\src\\asm\\make_i386_ms_pe_gas.asm:30:1: error: unknown directive .def _make_fcontext; .scl 2; .type 32; .endef ^ libs\\context\\src\\asm\\make_i386_ms_pe_gas.asm:30:22: error: unknown directive .def _make_fcontext; .scl 2; .type 32; .endef ^ libs\\context\\src\\asm\\make_i386_ms_pe_gas.asm:30:36: error: expected identifier in directive .def _make_fcontext; .scl 2; .type 32; .endef ^ libs\\context\\src\\asm\\make_i386_ms_pe_gas.asm:30:40: error: unknown directive .def _make_fcontext; .scl 2; .type 32; .endef ^ libs\\context\\src\\asm\\make_i386_ms_pe_gas.asm:136:1: error: unknown directive .def __exit; .scl 2; .type 32; .endef ^ How can I solve this? I have no idea at this point. I'm invoking the build using: b2 --without-python threading=multi link=static runtime-link=static toolset=gcc-android target-os=linux threadapi=pthread --stagedir=android stage And my project-config.jam looks like: import option ; option.set keep-going : false ; androidNDKRoot = E:/android/ndk ; androidAbiVer = 4.9 ; androidPlatform = windows-x86_64 ; using clang : android : $(androidNDKRoot)/toolchains/llvm/prebuilt/$(androidPlatform)/bin/clang++ : <compileflags>--sysroot=$(androidNDKRoot)/platforms/android-15/arch-arm <compileflags>-Os <compileflags>-fno-strict-aliasing <compileflags>-O2 <compileflags>-DNDEBUG <compileflags>-g <compileflags>-I$(androidNDKRoot)/sources/cxx-stl/llvm-libc++abi/libcxxabi/include <compileflags>-I$(androidNDKRoot)/sources/cxx-stl/llvm-libc++/libcxx/include <compileflags>-I$(androidNDKRoot)/sources/cxx-stl/llvm-libc++/libs/armeabi-v7a <compileflags>-I$(androidNDKRoot)/sources/android/support/include <compileflags>-DANDROID <compileflags>-D__ANDROID__ <compileflags>-D__arm__ <compileflags>-D_REENTRANT ;

1 1

[Math/Special Functions] Is there any interest in the Lambert W function?
by Balázs Cziráki 26 Sep '16

26 Sep '16

Greetings! I'm working on a C++ implementation of the Lambert W (a.k.a. product logarithm or Omega function) and I wanted to ask the Boost developer community if there is interest in adding it to the library. The current version can be found on GitHub: https://github.com/CzB404/lambert_w/ I've successfully tested it with Cygwin GCC v5.4, v6.2 and with MinGW GCC that is supplied with Code::Blocks, and also on Visual Studio 2015. A test on a Linux based OS (probably Ubuntu) is also going to happen. Any suggestions or constructive criticism is welcome. Best regards, Balázs Cziráki

4 5

[range] sub_range of istream_range
by Andrew Hundt 26 Sep '16

26 Sep '16

I’m trying to iterate through a file using sub_ranges of an istream_range of an ifstream. However, it seems if I construct sub ranges of various subsets of the full istream_range, try to adjust the limits with advance_begin and advance_end, and then access them I get null dereferences. Any thoughts? I can produce an example if needed. Cheers! Andrew Hundt

1 0

markable -- informal review request
by Andrzej Krzemienski 24 Sep '16

24 Sep '16

Hi Everyone, I would like to ask your opinion, suggestions, and perhaps an informal review of the 'markable' library. An alternative to boost::optional when performance really matters. It is the second incarnation of the 'compact_optional' library that I have presented last year. The main differences from the previous version: * name change: it is called 'markable' so that it is not confused with 'optional'. It uses "mark values" and mark policies" * it has the ability to mark an empty state even for the types with strong invariants, by marking a bit pattern rather than any proper value of T (an idea by Matt Calabrese) An example use case: typedef markable<mark_int<int, -1>> opt_int; opt_int oi; opt_int o2 (2); assert (!oi.has_value());assert (o2.has_value());assert (o2.value() == 2); static_assert (sizeof(opt_int) == sizeof(int), ""); The github repository: https://github.com/akrzemi1/markable And documentation therein: https://github.com/akrzemi1/markable/tree/master/documentation Any comments, suggestions or critique are most welcome. Regards, &rzej;

4 8

[fiber] Suggestions regarding asio
by Tatsuyuki Ishi 22 Sep '16

22 Sep '16

The current example seems non-flexible and very hacky. 1. The timer handler has no problem, since it's expected to be called from any thread. (Description in "Deeper Dive into asio" is meaningless) 2. Possible alternatives: * A post(empty lambda) is a little bit waste but solves the threading problem. It wakes up one thread by doing interrupt of epoll etc. Maybe adding a interrupt method to asio codebase could be more efficient. * One thread doing event polling and the other doing condvar is enough. Since we're not expecting a slow handler (most times, it just make a fiber ready), this should be sufficient. Correct me if I'm wrong.

2 1

[interprocess] Improved shared_memory lifetime using file locks?
by Sebastian Theophil 21 Sep '16

21 Sep '16

Hi, coming from Windows, the filesystem persistence of basic_managed_shared_memory is giving us headaches. When we have N processes accessing the same shared memory, and one of them crashes, the other N-1 are in an undefined state. That’s the same on Windows and POSIX platforms and is ok for us. On Windows, the problem resolves itself when the other N-1 processes are all closed and then restarted, because Windows deletes the shared memory automatically. On POSIX systems, I think we can use file locks to make sure that the shared memory is reinitialized by the first process to access it. I’d appreciate any feedback, especially if it points out the problems with this approach: - basic_managed_shared_memory(boost::interprocess::open_or_create, …) opens the backing file with flags O_CREAT | O_EXLOCK | O_NONBLOCK - if that succeeds: - we are the first - (re-) initialize shared memory - also a good time to unlink/open the named POSIX semaphore that’s hanging around in an invalid state too! - degrade exclusive lock using flock(LOCK_SH) - else - open file with flag O_SHLOCK (open only, and blocking!) - when that succeeds, open shared memory Problems I can see: - Only works when (advisory) shared and exclusive locking and the degradation of one to the other is supported (at least flock not supported on Windows, e.g.) - What about other file systems? NFS? - Somebody could lock all your files. (OTOH, sb could also delete all my backing files all the time. My application would run, but not have any shared memory. Might be an advantage that my application does *not* run when the file is locked.) - What else? Is this worth implementing in boost.interprocess? I appreciate any feedback, Sebastian PS: I’ve googled previous discussions about shared memory lifetime in boost.interprocess. I don’t claim that my proposal gives the same semantics as Windows shared memory. It doesn’t and it seems impossible to achieve. I’m looking for, erm, usable semantics on POSIX systems. Clearly, everybody has to implement some lifetime tracking. It would be nice if boost.interprocess provided one or more solutions. -- Dr. Sebastian Theophil | stheophil(a)think-cell.com Senior Software Engineer We are looking for C++ Developers: https://www.think-cell.com/career think-cell Software GmbH | Chausseestr. 8/E | 10115 Berlin | Germany https://www.think-cell.com | phone +49 30 666473-10 | US phone +1 800 891 8091 Amtsgericht Berlin-Charlottenburg, HRB 180042 Directors: Dr. Markus Hannebauer, Dr. Arno Schödl

1 0

[release] 1.62.0 Master branch is closed
by Rene Rivera 21 Sep '16

21 Sep '16

The master branch is now closed for all changes, except by permission from a release manager. Thanks, The Release Team -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

1 0

[release] Boost 1.62.0. Beta 2
by Rene Rivera 20 Sep '16

20 Sep '16

The packages for 1.62.0 beta 2 are now available: <https://sourceforge.net/projects/boost/files/boost/1.62.0.beta.2/> The SHA256 checksums are as follows: 95feae3620b3e604e93f14d97195fc04a4b67063692859af8df19657d41b82d5 boost_1_62_0_b2.7z 27bc9b328ff73d7dbf80cd9d4b5f79b0878221e5d8e4b6c47444b135edc1080a boost_1_62_0_b2.tar.bz2 3939d5efa683449e87b374d7e92e3eeb6490063ddb2877919f0fad26e3a0f53e boost_1_62_0_b2.tar.gz cff9ab5db0928244c4c836cf3da5140e6e93db7756e2791ba99a21104ad3aa72 boost_1_62_0_b2.zip As always, the release managers would appreciate it if you download the archive of your choice and give building and using it a try. Please report both success and failure, and anything else that is noteworthy. Thanks! -- The release managers -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

4 9

Re: [boost] first steps to submitting - boost :: observers
by Bjorn Reese 19 Sep '16

19 Sep '16

On 09/17/2016 08:10 PM, Robert McInnis wrote: > https://github.com/tiny/boost_observers.git What are the advantages of this library over Boost.Signals2 [1]? Same question with regards to the Boost.Synapse [2] proposal. My impression from a brief look at your repository is that you need to focus more on thread-safety. Is there any way to avoid the overhead of thread synchronization in a single-threaded application? Observers are invoked while the mutex is locked, so observers cannot make calls on the subject. How does the lock-free mutex perform, especially when congested? Why is the lock-free mutex recursive? There are several member variables that are used as if they are atomic but they are not declared as such, e.g. Subject::_block, Numeric<T>::_x (think T == long long.) The Scope template can be replaced by lock_guard if you model the LockFreeMutex after the BasicLockable concept [3]. The thread_self() and thread_pid() functions can be replaced by this_thread::get_id(). Replace the hAtomic macro with a type alias. Use <cstdint> instead of <stdint.h> to reduce polution of the global namespace. [1] http://www.boost.org/doc/html/signals2.html [2] http://zajo.github.io/boost-synapse/ [3] http://en.cppreference.com/w/cpp/concept/BasicLockable

4 6

[density] version 7
by Giuseppe Campana 19 Sep '16

19 Sep '16

Hi to all, I’ve just merged to the master branch a major review of density, an header-only library of heterogeneous dense containers. Unfortunately this update includes some renamings. Anyway the new names are simpler and more explicative: heterogeneous_array, heterogeneous_queue, function_queue, lifo_array. The update consists of fixes and optimizations. The results of the benchmarks are included in the documentation. The container function_queue gives the best results, being many times faster than an std::queue of std::function’s (http://peggysansonetti.it/tech/density/html/func_queue_bench.html). The library is not yet ready for asking a formal review, but hopefully it will be in a few months. Html overview (now a little more schematic) and reference doc at http://peggysansonetti.it/tech/density/html/index.html Repository at https://github.com/giucamp/density/tree/master Giuseppe Campana.

1 0

Fuzzy string search to the Boost String Algortihm
by Зайцев Александр 19 Sep '16

19 Sep '16

Hello. I want to discuss about some proposals. I am working on Levenshtein distance and Damerau-Levenshtein distance algortihms. I hope, that these implementations will be pulled to the Boost String library. But i think that we can add to the Boost String Library some more algorithms for fuzzy searhing. I mean these algortihms: Levenshtein distance Damerau-Levenshtein distance Bitap algorithm with modifications by Wu and Manber Spell-checker method N-gram method Signature hashing method BK-trees What do you think about this idea? If you think that it can be implemented to the Boost String Algo, i will start work on this list immediately. Best regards, Zaitsev Alexander.

2 2

first steps to submitting - boost :: observers
by Robert McInnis 19 Sep '16

19 Sep '16

G'afternoon, This is my first time submitting to a public repo, please be gentle I'd like to submit a series of classes I have been using since '90. The initial set implements a thread safe subject/observer pattern. I have included a handful of example programs, two fairly trivial and the third more in-depth. All examples are single file examples to make compilation trivial. This is the first re-work of my original tools, making them more boost-friendly. I expect to add more default observer templates and observable objects, but that will come with time. WHY? -- The reason for these classes is to help insure the mathematical integrity of your data model in relation to your business rules. If at any time you were to change one of your data elements without updating all those dependent on it, then your data integrity would be compromised. These classes look to solve that. As an example: -- using namespace boost::observers ; Numeric<long> x, y, z ; // rules: y = x + 2; z = y * 3 ; x = 5 ; printf( "%d \n", z ) ; x = 1 ; printf( "%d \n", z ) ; -- Setting the rules properly, the classes allow for 'z' to be correct each time it's printed using code almost exactly like this. This will remove the possibility of accidently forgetting to trigger the rule update. WHERE? -- The repo can be found here: git clone https://github.com/tiny/boost_observers.git Any input on how to continue from this point would also be much appreciated. I have skype and ventrilo servers available if that helps. Thanks in advance, Rob -- Robert McInnis

5 7

[release] Boost 1.62.0 - One week to close.
by Rene Rivera 16 Sep '16

16 Sep '16

Reminder.. Next week, on the 21st, the release will close for all changes. Except for extra ordinary and approved changes. Please exercise caution when merging changes to master branches. Remember that changes need to be well tested on the develop branches before going into master. And that changes at this point should be for critical problems. Thanks, the Release Team. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

2 2

[uuid] PR to remove auto-linking to advapi32 when BOOST_ALL_NO_LIB is defined
by Edward Diener 15 Sep '16

15 Sep '16

I don't know how to resolve a PR for uuid ( https://github.com/boostorg/uuid/pull/11 ). If a library exists only as a DLL and not as a static library should BOOST_ALL_NO_LIB still be considered in effect ? My viewpoint is 'no' but the person who created the PR believes that the BOOST_ALL_NO_LIB config macro should turn off any #pragma auto-linking in code even when their is no other way to use a library other than as a shared library. What I am afraid of is breaking user code even if BOOST_ALL_NO_LIB is defined by producing link errors. But perhaps I am wrong and this should be considered justified when BOOST_ALL_NO_LIB is being used.

5 7

[algorithm] Musser-Nishanov sequence search algorithm
by Jeremy Murphy 15 Sep '16

15 Sep '16

Dear Boost community, most of you are probably familiar with Dave Musser, well known for his work on generic programming, introsort and more. What you maybe didn't know, and I didn't until not that long ago, is that he and Gor Nishanov also designed (based off KMP) and wrote a generic sequence search algorithm to compete with Boyer-Moore, etc, which apart from being competitively fast is ostensibly more generic than the others. You can read for yourself on Dave Musser's website: http://www.cs.rpi.edu/~musser/gp/algorithms.html By "more generic" I mean it has a fallback algorithm if the corpus does not have random-access iterators, and its behaviour can easily be tuned for the alphabet size to dramatic effect. (I haven't looked into the 'tunability' of BM, BMH, KMP, etc, so I'm not sure if this is a unique feature.) But at face value, it appears to have powerful features that the others lack without compromising performance, which is pretty neat. So I've been in contact with the original authors and with their permission am just playing the messenger to bring the algorithm to wider attention with the expectation that it is something we could really benefit from. What I hope for now is to have discussion on whether indeed it is an algorithm that we want, presumably alongside the others in Boost.Algorithm. My slightly more controversial thought is that, if no shortcomings or weaknesses are revealed, this could up being the superior search algorithm. I've opened a pull request on Boost.Algorithm with the code so everyone can play around with it if they want. https://github.com/boostorg/algorithm/pull/25 Looking forward to hearing what everyone thinks. Cheers. Jeremy

1 0

[uuid][rational] Pushed bug fixes to 'master'
by Edward Diener 15 Sep '16

15 Sep '16

I pushed some bug fixes from 'develop' to 'master' for the uuid and rational libraries. The fixes had been tested on the 'develop' branch for a long time and the results showed that the fixes were fine. While none of the fixes were major I felt that the fixes were important enough to go in the upcoming Boost release if they are going to be picked up. I, and probably other members of CMT, should have been more proactive in pushing these fixes to 'master' sooner, once they showed green on the develop test matrix.

2 3

Final Call for Extended Abstracts and Posters: International Conference on Information Society (i-Society 2016), Technical Co-Sponsored by IEEE UK/RI Chapter!
by David Brown, i-Society 2016 14 Sep '16

14 Sep '16

1 0

[log] Boost 1.62 cannot compile log with Oracle Developer Studio 12.5
by Aparna Kumta 14 Sep '16

14 Sep '16

Compiling Boost.log with Oracle Developer Studio 12.5, we see the following failure: % "CC" -std=c++11 -library=stdcpp,CrunG3 -xO4 -mt -erroff=%none -m32 -KPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_ATOMIC_DYN_LINK=1 -DBOOST_CHRONO_DYN_LINK=1 -DBOOST_DATE_TIME_DYN_LINK=1 -DBOOST_FILESYSTEM_DYN_LINK=1 -DBOOST_LOG_BUILDING_THE_LIB=1 -DBOOST_LOG_DLL -DBOOST_LOG_HAS_PTHREAD_MUTEX_ROBUST -DBOOST_LOG_WITHOUT_DEBUG_OUTPUT -DBOOST_LOG_WITHOUT_EVENT_LOG -DBOOST_SPIRIT_USE_PHOENIX_V3=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_SYSTEM_NO_DEPRECATED -DBOOST_THREAD_BUILD_DLL=1 -DBOOST_THREAD_DONT_USE_CHRONO=1 -DBOOST_THREAD_POSIX -DBOOST_THREAD_USE_DLL=1 -DDATE_TIME_INLINE -DNDEBUG -D_XOPEN_SOURCE=500 -D__EXTENSIONS__ -D__STDC_CONSTANT_MACROS -D__typeof__=__typeof__ -I"../../.." -I"../../../libs/log/src" -c -o "../../../bin.v2/libs/log/build/sun/release/stdlib-gnu/threading-multi/posix/ipc_reliable_message_queue.o" "../../../libs/log/src/posix/ipc_reliable_message_queue.cpp" "../../../libs/log/src/posix/ipc_reliable_message_queue.cpp", line 61: Error: #error Boost.Log: Native 32-bit atomic operations are required but not supported by Boost.Atomic on the target platform. This seems to be a configuration issue. The following changes seems to work: 1) In boost/atomic/detail/platform/platform.hpp % !diff diff ./platform.hpp ./platform.hpp_orig 46c46 < #elif (defined(__GNUC__) || (__SUNPRO_CC >= 0x5130)) && (defined(__i386__) || defined(__x86_64__)) --- > #elif defined(__GNUC__) && (defined(__i386__) || defined(__x86_64__)) 68c68 < #elif (defined(__GNUC__) || (__SUNPRO_CC >= 0x5130)) && defined(__sparc) --- > #elif defined(__GNUC__) && defined(__sparc_v9__) The above change causes the compilation to proceed further, however, it fails again with another configuration issue causing failure to build atomic library "CC" -std=c++11 -library=stdcpp,CrunG3 -xO4 -mt -erroff=%none -m32 -KPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_ATOMIC_DYN_LINK=1 -DBOOST_ATOMIC_SOURCE -DNDEBUG -I"../../.." -c -o "../../../bin.v2/libs/atomic/build/sun/release/stdlib-gnu/threading-multi/lockpool.o" "../../../libs/atomic/src/lockpool.cpp" "../../../boost/atomic/detail/ops_gcc_sparc.hpp", line 69: Error: The function "fence_before_store" must have a prototype. In boost/atomic/detail/ops_gcc_sparc.hpp, the following change seems to resolve the issue % !diff % diff ./ops_gcc_sparc.hpp ./ops_gcc_sparc.hpp_orig 69c69 < fence_before(order); --- > fence_before_store(order); 71c71 < fence_after(order); --- > fence_after_store(order); 110c110 < fence_before(order); --- > base_type::fence_before(order); 118c118 < fence_after(order); --- > base_type::fence_after(order); I will submit a PR for this change. Thanks, Aparna

1 0

[filesystem] How to remove specific files from a directory?
by Andrzej Krzemienski 14 Sep '16

14 Sep '16

Hi, I wonder what is boost::filesystem recommendation for solving the following problem. I want to remove all files from a given directory that satisfy a certain predicate, e.g., only these whose names start with letter "s". It is my understanding that the calling filesystem::remove may invalidate the iterator, and therefore the following solution is incorrect: fsys::directory_iterator it{path}, itEnd{}; for ( ; it != itEnd ; ++it ) { if (predicate(*it)) fsys::remove(it->path()); } But, is the following guaranteed to work?: fsys::directory_iterator it{path}, itEnd{}; for ( ; it != itEnd ; ) { if (predicate(*it)) fsys::remove((it++)->path()); else ++it; } If not, does there exist a dedicated solution for solving this problem that would not require of me N traversals through the directory? Thanks, &rzej;

6 11

[release] Boost 1.62.0 Beta 1
by Rene Rivera 14 Sep '16

14 Sep '16

The first beta packages for 1.62.0 beta 1 are now available: <https://sourceforge.net/projects/boost/files/boost/1.61.0.beta.1/> The SHA256 checksums are as follows: f7cc83e6a3b03cd7aa8822992aa3e36422cc2214644d69277ef55a4db51f44bd boost_1_62_0_b1.7z 4057993811e40b1fd4719675e44c2550b6c2379546192da2299c17fec9a3dddf boost_1_62_0_b1.tar.bz2 fb0c10b625c5ec47cc837b54740540e400c59571b2eabf427c00f32bffc6ca70 boost_1_62_0_b1.tar.gz b38ef21c43c5ff814a2144bc23871c134164e7f51c71672d0f49a44636fb50b5 boost_1_62_0_b1.zip As always, the release managers would appreciate it if you download the archive of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. Thanks! -- The release managers -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

4 4

Re: [boost] [Boost-users] [release] Boost 1.62.0 Beta 1
by Rene Rivera 13 Sep '16

13 Sep '16

On Mon, Sep 12, 2016 at 12:44 AM, Oliver Kowalke <oliver.kowalke(a)gmail.com> wrote: > 2016-09-12 0:00 GMT+02:00 Tom Kent <lists(a)teeks99.com>: > >> Since the fiber build was a failure, >> > > should be fixed > Could someone try a build of the master snapshot to see if it's really fixed? I'm still in favor of a beta 2 build to make sure that gets flushed out >> before going to RCs. >> > > +1 > We can certainly do that. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

2 1

[math] Undefined reference to promote_args
by Florian Lindner 13 Sep '16

13 Sep '16

Hello, when compiling a file that uses float_distance from #include <boost/math/special_functions/relative_difference.hpp> I get a linking error: undefined reference to `boost::math::tools::promote_args<double, double, float, float, float, float>::type boost::math::float_distance<double, double>(double const&, double const&)' I try to add all boost_math libs I could find, but none helped: -lboost_system -lboost_filesystem -lboost_math_tr1 -lboost_math_c99 -lboost_math_c99 Since float_distance is not a C99 / TR1 function, shouldn't boost.math work as header only? What is the problem here? Thanks, Florian

2 1