- Boost-users - lists.preview.boost.org

Include line number in boost logs
by Florian Lindner 03 Sep '15

03 Sep '15

Hello, I try to implement that a log entry also logs its line number with boost::log. If any developer of it reads here, please also consider this a wishlist item... I think the best way to add an additional attribute for it core::get()->add_global_attribute( "Line", attributes::mutable_constant<size_t>(0) ); in my logger config that is called once at startup. #define logInfo(methodname, message) \ boost::log::core::get()->get_global_attributes()["Line"].set(__LINE__); \ BOOST_LOG_SEV(_log, boost::log::trivial::severity_level::trace) << message \ Is my idea, but boostlog.cpp:126:5: error: no member named 'set' in 'boost::log::v2_mt_posix::aux::attribute_set_reference_proxy' getting the attribute somehow seems to work, but how can I set the value of the attribute? Thanks! Florian

2 5

[Type Erasure] Ambiguous call with vs 2015 community
by Yuan Yao 02 Sep '15

02 Sep '15

Dear all, I try to use type erasure on the free function foo. However, VS 2015 failed to compile the following code, which is OK with GCC and CLang. ========================================================= #include <boost/type_erasure/any.hpp> #include <boost/type_erasure/free.hpp> #include <typeindex> std::type_index foo(int); BOOST_TYPE_ERASURE_FREE((HasGetField), foo, 1) using Type = boost::type_erasure::any< HasGetField<std::type_index(boost::type_erasure::_self const&)>, boost::type_erasure::_self const& >; std::type_index foo(int) { return typeid(int); } int main() { Type x{ 1 }; foo(x); return 0; } ========================================================= Source.cpp C:\Program Files\Microsoft Visual Studio 14.0\VC\INCLUDE\xlocale(341): warning C4530: C++ exception handler used, but unwind semantics are not enabled. Specify /EHsc Source.cpp(20): error C2668: 'boost::type_erasure::injectHasGetField<R (const boost::type_erasure::_self &),Base,boost::type_erasure::index_list<0>>::foo': ambiguous call to overloaded function with [ R=std::type_index, Base=boost::type_erasure::any_base<boost::type_erasure::any<HasGetField<std::type_index (const boost::type_erasure::_self &)>,boost::type_erasure::_self &&>> ] Source.cpp(7): note: could be 'std::type_index boost::type_erasure::injectHasGetField<R (const boost::type_erasure::_self &),Base,boost::type_erasure::index_list<0>>::foo(eval_if_c<0,boost::type_erasure::detail::maybe_const_this_param<const boost::type_erasure::_self &,Base>,boost::type_erasure::as_param<Base,const boost::type_erasure::_self &>>::type)' [found using argument-dependent lookup] with [ R=std::type_index, Base=boost::type_erasure::any_base<boost::type_erasure::any<HasGetField<std::type_index (const boost::type_erasure::_self &)>,boost::type_erasure::_self &&>> ] Source.cpp(7): note: or 'std::type_index boost::type_erasure::injectHasGetField<R (const boost::type_erasure::_self &),Base,boost::type_erasure::index_list<0>>::foo(eval_if_c<0,boost::type_erasure::detail::maybe_const_this_param<const boost::type_erasure::_self &,Base>,boost::type_erasure::as_param<Base,const boost::type_erasure::_self &>>::type)' [found using argument-dependent lookup] with [ R=std::type_index, Base=boost::type_erasure::any_base<boost::type_erasure::any<HasGetField<std::type_index (const boost::type_erasure::_self &)>,boost::type_erasure::_self &>> ] Source.cpp(7): note: or 'std::type_index boost::type_erasure::injectHasGetField<R (const boost::type_erasure::_self &),Base,boost::type_erasure::index_list<0>>::foo(eval_if_c<0,boost::type_erasure::detail::maybe_const_this_param<const boost::type_erasure::_self &,Base>,boost::type_erasure::as_param<Base,const boost::type_erasure::_self &>>::type)' [found using argument-dependent lookup] with [ R=std::type_index, Base=boost::type_erasure::any_base<boost::type_erasure::any<HasGetField<std::type_index (const boost::type_erasure::_self &)>,boost::type_erasure::_self>> ] Source.cpp(7): note: or 'std::type_index boost::type_erasure::injectHasGetField<R (const boost::type_erasure::_self &),Base,boost::type_erasure::index_list<0>>::foo(eval_if_c<0,boost::type_erasure::detail::maybe_const_this_param<const boost::type_erasure::_self &,Base>,boost::type_erasure::as_param<Base,const boost::type_erasure::_self &>>::type)' [found using argument-dependent lookup] with [ R=std::type_index, Base=boost::type_erasure::any_base<boost::type_erasure::any<HasGetField<std::type_index (const boost::type_erasure::_self &)>,const boost::type_erasure::_self &>> ] Source.cpp(14): note: or 'std::type_index foo(int)' Source.cpp(20): note: while trying to match the argument list '(Type)' ========================================================= Moreover, I wonder whether the declaration is a must? Thank you!

2 2

Re: [Boost-users] is it possible to group values with Boost's rtree?
by Andy Edwards 01 Sep '15

01 Sep '15

Noel wrote: > I had to do something similar packing 100k 3d objects into the smallest > number of groups, where each group contains only non-overlapping 3d > objects. I used the Boost Graph library with a smallest least ordering > graph coloring algorithm. Since this is a quasi-np hard problem, I know > the packing density is sub-optimal but still quite good for our > application. Perhaps that approach would work for you? Unfortunately > I?m not familiar with Boost rtree. > > ? Noel Belcourt Thanks for the tip Noel, but it sounds like I'll be able to accomplish it using Adam's suggestions (I don't need completely optimal packing density). Since I'll be using the rtree for spatial queries as well it's the best approach for me. Adam wrote: > It is possible though it isn't officially supported. Have a look at the > utilities in this directory: > > https://github.com/boostorg/geometry/tree/master/include/boost/geometry/ind… > > To traverse the rtree you must write a visitor similar to the > Boost.Variant visitor, defining operator() overloads taking nodes. There > is a boost::geometry::index::detail::rtree::utilities::view<> providing > read-only access to the rtree's internals, in particular to the > apply_visitor() method applying the visitor to the root node of the > rtree and depth() function returning the number of tree levels. To > access the node's elements container you may use > boost::geometry::index::detail::rtree::elements() function and to apply > the visitor to the child node you may call > boost::geometry::index::detail::rtree::apply_visitor() function. The > elements of an internal node are of type similar to std::pair<> where > the first member is a Box and the second member is a pointer to the > child node. The elements of a leaf node are of type value_type. This way > you may recursively traverse the rtree in depth-first order counting the > current level, create containers of values when some level is met and > then gather the values from leafs. See e.g. how the utilities in the > directory mentioned above are implemented. > > Regards, > Adam Thanks Adam! That sounds ideal. Glad I'll be able to use this! I wonder if a per-node predicate is planned for the public API in the future (rather than the value-only satisfies predicate)?

2 1

[boost] [afio] Formal review of Boost.AFIO
by Ahmed Charles 01 Sep '15

01 Sep '15

The formal review of the Boost.AFIO library starts, August 21st and ends on Monday August 31st. Boost.AFIO provides a portable API implementing synchronous and asynchronous race-free filesystem and scatter-gather file i/o. It requires a minimum of C++ 11. It has minimum dependencies on a Filesystem TS and a Networking TS implementation (e.g. Boost.Filesystem and Boost.ASIO). Backends are provided for the Windows NT kernel and POSIX. The utility of a portable library providing strong concurrent race guarantees about filesystem and file i/o can be seen in its tutorial where a transactional ACID key-value store is built from first principles. Boost.AFIO was brought to Boost as part of GSoC 2013 and Niall Douglas has continued to develop and improve the library since then, generating two internal implementation libraries Boost.APIBind and Boost.Monad which are expected to be separately brought for Boost review in 2016. The documentation can be found here: https://boostgsoc13.github.io/boost.afio/doc/html/afio.html The source code can be found here: https://github.com/BoostGSoC13/boost.afio/tree/boost-peer-review Online web compiler playpen can be found here: http://melpon.org/wandbox/permlink/DR8wCpu5Rl20GMdM? Please answer the following questions: 1. Should Boost.AFIO be accepted into Boost? Please state all conditions for acceptance explicity. 2. What is your evaluation of the design? 3. What is your evaluation of the implementation? 4. What is your evaluation of the documentation? 5. What is your evaluation of the potential usefulness of the library? 6. Did you try to use the library? With what compiler? Did you have any problems? 7. How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? 8. Are you knowledgeable about the problem domain?

9 17

[Interprocess] Problem with file_lock on Linux
by Jan Niklas Hasse 31 Aug '15

31 Aug '15

The following code #include <boost/interprocess/sync/file_lock.hpp> #include <iostream> #include <fstream> int main() { std::ofstream file("test.lock"); boost::interprocess::file_lock flock("test.lock"); std::cout << flock.try_lock(); std::cout << flock.try_lock() << std::endl; } outputs 10 on Windows and 11 on Linux. Shouldn't it also print 10 on Linux or am I missunderstanding file_lock? I've also tried locking from different threads, but no luck.

2 3

[SPAM] from: giridhar
by giridhar 30 Aug '15

30 Aug '15

Sup boost http://arheatingcooling.com/unlikely.php?rule=g94y8vfvqvgeu2 giridharms(a)gmail.com giridhar

1 0

[variant][mpl] silly mistake in make_variant_over usage?
by Nat Goodspeed 29 Aug '15

29 Aug '15

The following program fails to compile (148 lines of errors, will paste on request) with g++ (Ubuntu 4.9.2-0ubuntu1~14.04) 4.9.2 in -std=c++11 mode. This is using Boost 1.59.0. Command line: g++ -std=c++11 -I ~/boost_1_59_0 -o make_variant make_variant.cpp I assume I'm making a simple error. I would appreciate your pointing it out. Thank you! (Is there a simpler way to obtain a variant of the result types of passed functions? I was hoping I could just write: boost::variant< std::result_of<Fns>::type... >.) #include <boost/variant/variant.hpp> #include <boost/mpl/vector.hpp> #include <boost/mpl/transform.hpp> #include <type_traits> // std::result_of template < typename... Fns > typename boost::make_variant_over< boost::mpl::transform< boost::mpl::vector<Fns...>, std::result_of<boost::mpl::_1> > >::type multiplex(Fns && ... functions) { typedef typename boost::make_variant_over< boost::mpl::transform< boost::mpl::vector<Fns...>, std::result_of<boost::mpl::_1> > >::type return_t; // dummy for now return return_t(); } int main(int argc, char *argv[]) { boost::variant<int, char*> var = multiplex([argc](){ return argc; }, [argv](){ return argv[0]; }); return 0; }

2 2

is it possible to group values with Boost's rtree?
by Andy Edwards 27 Aug '15

27 Aug '15

Hi everyone, I need a way to take a collection of 3D objects and put them into disjoint minimally overlapping groups no bigger than some N. Can this be done with Boost's rtree or any other Boost libraries? I've done this by putting the objects in an R* tree and using the nodes at a certain level of the tree (for example, 2 levels up from the leaf level) to determine the groups. However, that was in my own Java R* tree implementation that provided read-only access to its internal nodes. I'd like to port this program to C++ using Boost's rtree, but it doesn't provide read-only access to its nodes, does it? Does anyone know if it would be possible to extend the rtree to provide this? Or would it be possible to write a custom predicate to get the groupings? Thanks! Andy

3 2

[filesystem] Relative Draft Proposal RFC
by Beman Dawes 27 Aug '15

27 Aug '15

There have been requests for a Filesystem library relative function for at least ten years. The requested functionality seems simple - given two paths with a common prefix, return the non-common suffix portion of one of the paths such that it is relative to the other path. In terms of the Filesystem library, path p("/a/b/c"); path base("/a/b"); path rel = relative(p, base); // the requested function cout << rel << endl; // outputs "c" assert(absolute(rel, base) == p); If that was all there was to it, the Filesystem library would have had a relative function years ago. Critical issues: Clashing requirements, symlinks, directory placeholders (dot, dot-dot), user-expectations, corner cases. A paper by Jamie Allsop, Additions to Filesystem supporting Relative Paths, is what broke my mental logjam. Much of [my proposal] is based directly on Jamie's analysis and proposal. The weakly_canonical function and aspects of the semantic specifications are my contributions. Mistakes, of course, are mine. The full proposal is at http://boostorg.github.io/filesystem/relative_proposal.html A preliminary implementation is available in the feature/relative2 branch of the Boost Filesystem Git repository. See github.com/boostorg/filesystem/tree/feature/relative2 The overall plan is to get feedback from boost developers, then merge to develop for boost 1.60, then propose to the C++ committee for addition to the Filesystem TS. Comments welcome. If you are one of the many people who have requested "relative" functionality, does this proposal meet your needs? If not, why? Thanks, --Beman

5 7

Avoid including path to BOOST into exe
by Pavel Seleznev 27 Aug '15

27 Aug '15

Hello, I have the same question as described here http://stackoverflow.com/questions/32141335/avoid-including-path-to-boost-i… I have built BOOST with the following command line: b2 --toolset=msvc-10.0 --stagedir=./stage/2010/win32 address-model=32 variant=release threading=multi link=static runtime-link=static then compiled a project with statically linked runtime and release configuration with NDEBUG, BOOST_DISABLE_ASSERTS defined. Compiler options: c++\advanced\use full paths (/FC) is off c++\general\debug information format (/ZI /Zi /Z7) is empty ...and still having the entries in my binary file: c:\work\boost/xpressive/basic_regex.hpp void __cdecl boost::xpressive::detail::throw_on_stack_error(bool) Regex stack space exhausted c:\work\boost/xpressive/detail/dynamic/parse_charset.hpp void __thiscall boost::xpressive::detail::char_overflow_handler::operator () How can I avoid this? Regards, Pavel

1 0

Using boost modified bessel functions with complex arguments
by Ross Kynch 27 Aug '15

27 Aug '15

Dear all, Does anyone know how to call boost's modified bessel function of the first kind using a complex argument? Specifically I want the positive half integer order with complex argument so I use: #include <boost/math/special_functions/bessel.hpp> std::complex<double> output = boost::math::cyl_bessel_i(double nhalf, std::complex<double> x); but this gives me a huge list of compiler errors which seems to suggest the std::complex<double> template isn't valid. I am able to call other boost math library functions so I don't believe my install is to blame here. Thanks for any help Ross

2 2

Asio io_service and Thread scheduler/executor
by Mikael Olenfalk 26 Aug '15

26 Aug '15

Hi, I am currently thinking about how to move our project at work from a set of specific threads (1 thread per module e.g.) and our own network library abstraction to Boost.Asio and Boost.Thread's scheduler/executors. Before I read about schedulers/executors I considered just using asio::io_service (with a pool of threads calling .run()) for quick-shot background offloading, but after looking at scheduler/executor I would prefer using it for background work. Does anybody have any experience how to combine boost::asio with boost::thread's scheduler/executors? In my preferred design I would only have one thread pool backing both asio work and background computational tasks (e.g. using boost::async(Executor&, F&&, ...) ) My initial gut feeling was to have a thread-pool calling boost::asio::io_service.run() and then wrap that in an executor. I guess what I am asking for if somebody has any previous experience to share with this or similar approaches. Kind regards, /M

2 1

Fw: Use of QMutex not as expected
by Don El Ron 26 Aug '15

26 Aug '15

3 2

Boost Social Event at CppCon
by Jon Kalb 25 Aug '15

25 Aug '15

Boosters, Because a lot of Boosters are going to be attending CppCon, we¹d like to arrange a social event for Boosters/C++Now regulars. http://cppcon.org/ If you are planning to attend CppCon or even If you are just going to be in or around Bellevue, Washington between September 20th and 25 and you¹d like to join us for dinner, please let us know so we can get a count. Please send mail to: social(a)boost.org Once we settle on a date, etc, we¹ll let everyone who responded know when and where, so please let us know, even if you are a ³maybe.² I hope to see you at CppCon. Jon

1 0

[Graph] Distributed edge insertion
by Sensei 25 Aug '15

25 Aug '15

Dear all, I am finding difficulties in understanding how distributed graphs work. My graph is simple, a string-valued property, with some edges, however, right now I have only one edge... if it works. Since each process will add its own nodes, is it possible to avoid communication when adding nodes, given that each node owns its own vertices, and no overlap is possible between processes? This would save some communication avoiding re-distribution of nodes. Can I add edges concurrently? Meaning, each process adds some edges. I've only seen examples with root adding edges, but that's limiting. My last question is maybe easy. I'm adding an edge that connects two nodes, owned by different processes. Doing this results in a crash. It seems I cannot access properties with operator[] when traversing processes. I'm posting the code below, along with the *crashing* output. I hope you can help getting a grasp on PBGL! Thanks! #include <iostream> #include <string> #include <vector> #include <cmath> #include <list> #include <functional> #include <boost/config.hpp> #include <boost/mpi.hpp> #include <boost/graph/use_mpi.hpp> #include <boost/graph/distributed/mpi_process_group.hpp> #include <boost/graph/distributed/adjacency_list.hpp> #include <boost/graph/iteration_macros.hpp> using namespace boost; using boost::graph::distributed::mpi_process_group; // Useless class class str { public: str(std::string s = std::string()) : s_(s) { // NOP } template<typename Archiver> void serialize(Archiver& ar, const unsigned int /*version*/) { ar & s_; } std::string s_; }; // Allow indexing and constructing namespace boost { namespace graph { // Index based on the str class template<> struct internal_vertex_name<str> { typedef multi_index::member<str, std::string, &str::s_> type; }; // Construct with str class template<> struct internal_vertex_constructor<str> { typedef vertex_from_name<str> type; }; } } // Handy typedef boost::adjacency_list<vecS, distributedS<mpi_process_group, vecS>, bidirectionalS, str> dgraph; typedef graph_traits<dgraph>::vertex_descriptor dvertex; // START ME UP int main(int argc, const char * argv[]) { boost::mpi::environment env; boost::mpi::communicator comm; std::cout << "RANK " << comm.rank() << std::endl; comm.barrier(); dgraph g; std::vector<dvertex> descriptors; // Each rank for(int i = 0; i < 10; i++) { str s(std::to_string(i + (comm.rank() + 1) * 100)); std::cout << "rank " << comm.rank() << " adding " << s.s_ << std::endl; descriptors.push_back( add_vertex(s, g) ); } BGL_FORALL_VERTICES(v, g, dgraph) { std::cout << "V @ " << comm.rank() << " " << g[v].s_ << " local " << v.local << " owner " << v.owner << std::endl; } std::cout << ">>> NUM VERTICES " << num_vertices(g) << " NUM EDGES " << num_edges(g) << std::endl; comm.barrier(); if(comm.rank() >= 0) { int from, dest; bool letsCrash = true; if (letsCrash) { from = 1; dest = 0; } else { from = 0; dest = 0; } std::cout << "rank " << comm.rank() << " adding edge owners " << descriptors[from].owner << " - " << descriptors[dest].owner << std::endl; add_edge(descriptors[from], descriptors[dest], g); } boost::synchronize(g); BGL_FORALL_EDGES(e, g, dgraph) { std::cout << "E @ " << comm.rank() << " " << g[boost::source(e, g)].s_ << " -> " << g[boost::target(e, g)].s_ << std::endl; } return 0; } RANK 0 RANK 1 rank 0 adding 100 rank 0 adding 101 rank 1 adding 200 rank 1 adding 201 rank 0 adding 102 rank 0 adding 103 rank 1 adding 202 rank 1 adding 203 rank 0 adding 104 rank 1 adding 204 rank 0 adding 105 rank 1 adding 205 rank 1 adding 206 rank 0 adding 106 rank 0 adding 107 rank 1 adding 207 rank 0 adding 108 rank 1 adding 208 rank 0 adding 109 rank 1 adding 209 V @ 0 100 local 0 owner 0 V @ 0 201 local 1 owner 0 V @ 0 102 local 2 owner 0 V @ 0 203 local 3 owner 0 V @ 0 104 local 4 owner 0 V @ 0 205 local 5 owner 0 V @ 1 200 local 0 owner 1 V @ 1 101 local 1 owner 1 V @ 1 202 local 2 owner 1 V @ 1 103 local 3 owner 1 V @ 1 204 local 4 owner 1 V @ 1 105 local 5 owner 1 V @ 1 206 local 6 owner 1 V @ 1 107 local 7 owner 1 V @ 1 208 local 8 owner 1 V @ 0 106 local 6 owner 0 V @ 0 207 local 7 owner 0 V @ 0 108 local 8 owner 0 V @ 0 209 local 9 owner 0 >>> NUM VERTICES 10 NUM EDGES 0 V @ 1 109 local 9 owner 1 >>> NUM VERTICES 10 NUM EDGES 0 rank 1 adding edge owners 0 - 1 rank 0 adding edge owners 1 - 0 Assertion failed: (v.owner == processor()), function operator[], file /usr/local/include/boost/graph/distributed/adjacency_list.hpp, line 1696. Assertion failed: (v.owner == processor()), function operator[], file /usr/local/include/boost/graph/distributed/adjacency_list.hpp, line 1696. E @ 0 201 -> E @ 1 101 -> [Senseis-MBP:40908] *** Process received signal *** [Senseis-MBP:40908] Signal: Abort trap: 6 (6)

1 1

boost::ptr_vector does not support const types
by Martin Gamwell Dawids 25 Aug '15

25 Aug '15

I would like to use a ptr_vector to hold a number of const values but it seems ptr_vector does not currently support the use of const value types. See this simple code example: #include "boost/ptr_container/ptr_vector.hpp" #include <vector> class X { const int i; public: X(int i) : i(i) {} int getI() const { return i; } }; int main() { boost::ptr_vector<X> bvx; boost::ptr_vector<const X> bvcx; std::vector<X*> svx; std::vector<const X*> svcx; bvx.push_back(new X(42)); bvcx.push_back(new X(42)); // does not compile svx.push_back(new X(42)); svcx.push_back(new X(42)); return 0; } I have tried this on MSVC 2005/8.0 and with g++ on Mac – i.e. Apple LLVM version 6.1.0 (clang-602.0.53) (based on LLVM 3.6.0svn). On both compilers, calling 'push_back()' on a 'boost::ptr_vector<const X>' does not compile and on g++/Mac it yields this error message: ../boost/boost/ptr_container/ptr_sequence_adapter.hpp:249:37: error: reference to type 'const value_type' (aka 'void *const') could not bind to an lvalue of type 'value_type' (aka 'const X *') this->base().push_back( x ); // strong, commit ^ ptr_vector_test.cpp:22:8: note: in instantiation of member function 'boost::ptr_sequence_adapter<const X, std::__1::vector<void *, std::__1::allocator<void *> >, boost::heap_clone_allocator>::push_back' requested here bvcx.push_back(x); ^ /Library/Developer/CommandLineTools/usr/bin/../include/c++/v1/vector:697:62: note: passing argument to parameter '__x' here _LIBCPP_INLINE_VISIBILITY void push_back(const_reference __x); ^ 1 error generated. So the problem occurs when the passed value of type 'const X*' needs to be pushed to the backing 'std::vector<void*>' – i.e. a non-const 'void*' element type. The same problem exists for push_front(). A simple fix for 'push_back()' (and similar for 'push_front()') is to modify the file 'ptr_sequence_adapter.hpp' adding a cast of the value before pushing is: --- a/include/boost/ptr_container/ptr_sequence_adapter.hpp +++ b/include/boost/ptr_container/ptr_sequence_adapter.hpp @@ -246,7 +246,7 @@ namespace ptr_container_detail this->enforce_null_policy( x, "Null pointer in 'push_back()'" ); auto_type ptr( x ); // notrow - this->base().push_back( x ); // strong, commit + this->base().push_back( (void*) x ); // strong, commit ptr.release(); // nothrow } I am using a C-style cast as neither 'const_cast' nor 'reinterpret_cast' can be used here. (I know the formatting of the comments should also be fixed, but that would make my diff here more difficult to read.) Is there another workaround for this or have I overlooked something? /Martin

2 3

[multi-index] multi-index type trait
by Elizabeta 22 Aug '15

22 Aug '15

Hi how to test if the first index of boost::multi-index is key based or sequence based at compile time. I need to write something like this : template<class T,class M> void f(T& object,typename boost::enable_if<first_index_is_sequence<T>>::type* dummy = 0) { M element; object.push_back(element); } template<class T,class M> void f(T& object,typename boost::enable_if<first_index_is_key<T>>::type* dummy = 0) { M element; object.insert(element); } -- View this message in context: http://boost.2283326.n4.nabble.com/multi-index-multi-index-type-trait-tp467… Sent from the Boost - Users mailing list archive at Nabble.com.

2 5

Missing thread symbols when compiling from source: join(), ~thread() and start_thread()
by Edward Kornkven 22 Aug '15

22 Aug '15

Hello, I am trying to build Boost for linking with an application. I do not have admin access and there is an existing older Boost version in the system area. My problem is that there are three thread symbols that do not get defined by my build process: undefined reference to `boost::thread::join()' undefined reference to `boost::thread::~thread()' undefined reference to `boost::thread::start_thread()' Google reveals that this problem has been around for a while but the usual remedy is to install some binary or other. I need to build from source but for the life of me I can't understand what I am doing wrong that these symbols are not being defined. I can search everything that is being built using "nm" and they just aren't there. I think I am using a pretty standard build process of first building Boost.Build, then the rest: ./bootstrap.sh --with-toolset=gcc ./b2 install --prefix=${PREFIX} ${PREFIX}/bin/b2 --prefix=${PREFIX} toolset=gcc install I have geared down to various forms of magic: stage and then install, --without-thread followed by --with-thread, but I must be missing something basic about these libraries which I do not have occasion to use routinely. The build scripts are a bit opaque but don't indicate any errors. I am a little surprised that this isn't in an FAQ somewhere but maybe not many of us build Boost from source. Thanks for any assistance. Ed

1 0

build boost with specific msvcrt.lib
by Abhay Mhatre 21 Aug '15

21 Aug '15

is it possible to provide specific msvcrt.lib while building boost. It uses default one and my build system uses the one specified in build system. this causes heap corruption at the end of program termination. thanks

5 8

Building Boost 1.59.0 on Solaris 11 with Solaris Studio 12.4
by Leo Carreon 21 Aug '15

21 Aug '15

Hi Boosters, I have been attempting to build Boost 1.59.0 on Solaris 11 using Solaris Studio 12.4 in C++11 mode. So far, I have managed to locate on the web solutions to 3 issues. Now I’m down to 22 targets failing to build. Has anyone else attempted to do the same? I would appreciate it if you could share some of your fixes if you have any. Has anyone reported that they have been able to cleanly build in this environment? Kind regards, Leo

2 7

Regarding dijkstra_shortest_path() in boost graph library
by Rohith Reddy 20 Aug '15

20 Aug '15

Hello there, I started using Boost graph library recently for one of my projects.I was trying to implement dijkstra's shortest path algorithm with the help of the following function, dijkstra_shortest_paths (G, vertex(a, G), distance_map(make_iterator_property_map(distance.begin(), vertex_id, distance[0])). predecessor_map(make_iterator_property_map(parent.begin(), vertex_id, parent[0])). visitor(make_dijkstra_visitor(copy_graph(G_copy, on_examine_edge())))); But while comparing the definition of the function as in http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/dijkstra_shortest_paths…, to the above written function,it doesnt make sense, especially the third argument of the above written function.Can anyone help me with this? Thanks in advance.

1 0

Encoding with read_xml()
by ashish g 20 Aug '15

20 Aug '15

Hi I was looking into using the function 'read_xml()' which parses an xml file and populates a ptree. However I had a couple of questions which I couldnt find documentation for. 1. Is the encoding of the xml file format preserverd when the data is stored into the ptree. i.e lets say I have an xml file in utf-8 format. Are the strings inside my ptree utf-8 encoded as well? Or is it converted to system default encoding? 2. Passing the locale information as an argument to read_xml(), what effect does it have? I believe it assumes the xml file is formatted using the locale encoding, or uses system locale encoding if no arg is passed. Is this true even if my xml 's first line explicitly states that it uses and encoding diff from the system encoding. for eg: lets say im on windows with 1252 encoding. My xml file is utf-8, and is specified on the first line. If i call read_xml() on this file, without passing a locale as arg, does it use system 1252 encoding to parse the file or utf-8? Any pointers would be very helpful. Thank you -- *Ashish Gudla*

1 0

[MSM] Stack blown with deferred events (1.59.0)
by Tom Gibson 20 Aug '15

20 Aug '15

Hi Boost-Users and Christophe, I'm having an issue when using MSM's deferred events feature. I've written a very basic example of a state machine, simulating batching upon receipt of events using the deferred message queue as a buffer, and then handling the events in another state once a watermark has been hit. This however, is not working as well as I'd hoped. I've made the batch size configurable with a constructor variable on the state machine, and am using guards in the transition table to do the checking. Whilst functionally this works, when I set a reasonably large batch size (10,000), the process cores. I've done a bit of digging in gdb, and it appears that the stack is being blown. `ulimit -s shows 8192` as my stack limit, raising this to 16384 with a 10k batch size works, although the performance is pretty bad. Raising the batch size to beyond the stack limit once again breaks MSM. I've attached my test program, and am compiling and running locally with: ``` clang++ -std=c++11 -o batcher -g batch_test.cpp ./batcher <batch size> [total events=100000] ``` To summarize, I've a few questions with my scenario. 1. Am I using the deferred events feature correctly? I believe I've followed the documentation, but it is entirely possible there's something I'm missing! 2. Is this a valid use case for the deferred events feature, or something that wouldn't be recommended? Handling of deferred events seems to be fine normally, but with a large number of events, the performance does seem to suffer significantly. For example, `time` shows a batch size of 10 taking 0.470s, with a batch size of 5000 taking 24.415s. This gap is closed significantly when built with with -02 due to inlining, but its still significant. 3. The stack blowing to me implies recursion when items are processed from the deferred events queue (rather than a linear iteration over the container (deque in my case)). I've tried to follow this in the MSM code, but it's heavy stuff. In this scenario, is it possible I would be better to implement my own queuing mechanism? Thanks, Tom

1 0

Errors and failed targets when building [filesystem]
by morbid code 19 Aug '15

19 Aug '15

Hi guys, I am extremely new at boost. I downloaded the latest version and I did the following: I am using windows7 64 bit and GCC 5.1. I opened command line, went to C:\boost\tools\build and ran the command: bootstrap gcc The output is: Bootstrapping the build engine execcmd.c: In function 'onintr': execcmd.c:120:5: warning: implicit declaration of function 'out_printf' [-Wimpli cit-function-declaration] out_printf( "...interrupted\n" ); ^ execnt.c: In function 'maxline': execnt.c:524:12: warning: type defaults to 'int' in declaration of 'result' [-Wi mplicit-int] static result; ^ make.c: In function 'make': make.c:132:13: warning: implicit declaration of function 'out_printf' [-Wimplici t-function-declaration] out_printf( "...found %d target%s...\n", counts->targets, ^ make.c: In function 'make0': make.c:735:13: warning: implicit declaration of function 'out_flush' [-Wimplicit -function-declaration] out_flush(); ^ modules/path.c: In function 'path_exists': modules/path.c:16:12: warning: implicit declaration of function 'file_query' [-W implicit-function-declaration] return file_query( list_front( lol_get( frame->args, 0 ) ) ) ? ^ Bootstrapping is done. To build, run: .\b2 --prefix=DIR install Then I ran: b2 --prefix=DIR toolset=gcc install According to the long output 322 targets have been updated. I put the path C:\boost\tools\build\DIR\bin to the environment variables. Lastly, I ran: b2 --build-dir=C:\boost-filesystem toolset=gcc --with-filesystem stage The output: ...found 8 targets... ...updating 5 targets... common.mkdir C:\boost-filesystem\boost common.mkdir C:\boost-filesystem\boost\architecture common.mkdir C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0 common.mkdir C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0\debug gcc.compile.c++ C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0\debug\32. o libs\config\checks\architecture\32.cpp:9:36: error: size of array 'test' is negative int test[sizeof(void*) == 4? 1 : -1]; ^ "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -c -o "C:\boost-fil esystem\boost\architecture\gcc-mingw-5.1.0\debug\32.o" "libs\config\checks\archi tecture\32.cpp" ...failed gcc.compile.c++ C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0 \debug\32.o... ...failed updating 1 target... ...updated 4 targets... Performing configuration checks - 32-bit : no ...found 2 targets... ...updating 1 target... gcc.compile.c++ C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0\debug\64. o ...updated 1 target... - 64-bit : yes ...found 2 targets... ...updating 1 target... gcc.compile.c++ C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0\debug\arm .o libs\config\checks\architecture\arm.cpp:13:2: error: #error "Not ARM" #error "Not ARM" ^ "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -c -o "C:\boost-fil esystem\boost\architecture\gcc-mingw-5.1.0\debug\arm.o" "libs\config\checks\arch itecture\arm.cpp" ...failed gcc.compile.c++ C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0 \debug\arm.o... ...failed updating 1 target... - arm : no ...found 2 targets... ...updating 1 target... gcc.compile.c++ C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0\debug\mip s1.o libs\config\checks\architecture\mips1.cpp:10:2: error: #error "Not MIPS1" #error "Not MIPS1" ^ "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -c -o "C:\boost-fil esystem\boost\architecture\gcc-mingw-5.1.0\debug\mips1.o" "libs\config\checks\ar chitecture\mips1.cpp" ...failed gcc.compile.c++ C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0 \debug\mips1.o... ...failed updating 1 target... - mips1 : no ...found 2 targets... ...updating 1 target... gcc.compile.c++ C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0\debug\pow er.o libs\config\checks\architecture\power.cpp:13:2: error: #error "Not PPC" #error "Not PPC" ^ "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -c -o "C:\boost-fil esystem\boost\architecture\gcc-mingw-5.1.0\debug\power.o" "libs\config\checks\ar chitecture\power.cpp" ...failed gcc.compile.c++ C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0 \debug\power.o... ...failed updating 1 target... - power : no ...found 2 targets... ...updating 1 target... gcc.compile.c++ C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0\debug\spa rc.o libs\config\checks\architecture\sparc.cpp:10:2: error: #error "Not SPARC" #error "Not SPARC" ^ "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -c -o "C:\boost-fil esystem\boost\architecture\gcc-mingw-5.1.0\debug\sparc.o" "libs\config\checks\ar chitecture\sparc.cpp" ...failed gcc.compile.c++ C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0 \debug\sparc.o... ...failed updating 1 target... - sparc : no ...found 2 targets... ...updating 1 target... gcc.compile.c++ C:\boost-filesystem\boost\architecture\gcc-mingw-5.1.0\debug\x86 .o ...updated 1 target... - x86 : yes ...found 3 targets... ...updating 3 targets... common.mkdir C:\boost-filesystem\boost\bin.v2 link.touch C:\boost-filesystem\boost\bin.v2\test-symlink-source link.mklink C:\boost-filesystem\boost\bin.v2\test-symlink symbolic link created for C:\boost-filesystem\boost\bin.v2\test-symlink <<===>> test-symlink-source ...updated 3 targets... - symlinks supported : yes ...found 1 target... ...updating 1 target... config-cache.write C:\boost-filesystem\boost\bin.v2\project-cache.jam ...updated 1 target... Component configuration: - atomic : not building - chrono : not building - container : not building - context : not building - coroutine : not building - coroutine2 : not building - date_time : not building - exception : not building - filesystem : building - graph : not building - graph_parallel : not building - iostreams : not building - locale : not building - log : not building - math : not building - mpi : not building - program_options : not building - python : not building - random : not building - regex : not building - serialization : not building - signals : not building - system : not building - test : not building - thread : not building - timer : not building - wave : not building ...patience... ...found 690 targets... ...updating 51 targets... common.mkdir stage common.mkdir stage\lib common.mkdir C:\boost-filesystem\boost\bin.v2\libs common.mkdir C:\boost-filesystem\boost\bin.v2\libs\system common.mkdir C:\boost-filesystem\boost\bin.v2\libs\system\build common.mkdir C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1.0 common.mkdir C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1.0\ debug common.mkdir C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1.0\ debug\link-static common.mkdir C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1.0\ debug\link-static\threading-multi gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1 .0\debug\link-static\threading-multi\error_code.o gcc.archive C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1.0\d ebug\link-static\threading-multi\libboost_system-mgw51-mt-d-1_59.a common.copy stage\lib\libboost_system-mgw51-mt-d-1_59.a C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1.0\debug\link-st atic\threading-multi\libboost_system-mgw51-mt-d-1_59.a 1 file(s) copied. common.mkdir C:\boost-filesystem\boost\bin.v2\libs\filesystem common.mkdir C:\boost-filesystem\boost\bin.v2\libs\filesystem\build common.mkdir C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw-5. 1.0 common.mkdir C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw-5. 1.0\debug common.mkdir C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw-5. 1.0\debug\link-static common.mkdir C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw-5. 1.0\debug\link-static\threading-multi gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\debug\link-static\threading-multi\codecvt_error_category.o gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\debug\link-static\threading-multi\operations.o gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\debug\link-static\threading-multi\path.o gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\debug\link-static\threading-multi\path_traits.o gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\debug\link-static\threading-multi\portability.o gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\debug\link-static\threading-multi\unique_path.o libs\filesystem\src\unique_path.cpp:28:0: warning: ignoring #pragma comment [-W unknown-pragmas] # pragma comment(lib, "Advapi32.lib") ^ gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\debug\link-static\threading-multi\utf8_codecvt_facet.o gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\debug\link-static\threading-multi\windows_file_codecvt.o gcc.archive C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw-5.1 .0\debug\link-static\threading-multi\libboost_filesystem-mgw51-mt-d-1_59.a common.copy stage\lib\libboost_filesystem-mgw51-mt-d-1_59.a C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw-5.1.0\debug\lin k-static\threading-multi\libboost_filesystem-mgw51-mt-d-1_59.a 1 file(s) copied. common.mkdir C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1.0\ release common.mkdir C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1.0\ release\link-static common.mkdir C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1.0\ release\link-static\threading-multi gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1 .0\release\link-static\threading-multi\error_code.o In file included from libs\system\src\error_code.cpp:16:0: ./boost/system/error_code.hpp:221:36: warning: 'boost::system::posix_category' d efined but not used [-Wunused-variable] static const error_category & posix_category = generic_category(); ^ ./boost/system/error_code.hpp:222:36: warning: 'boost::system::errno_ecat' defin ed but not used [-Wunused-variable] static const error_category & errno_ecat = generic_category(); ^ ./boost/system/error_code.hpp:223:36: warning: 'boost::system::native_ecat' defi ned but not used [-Wunused-variable] static const error_category & native_ecat = system_category(); ^ gcc.archive C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1.0\r elease\link-static\threading-multi\libboost_system-mgw51-mt-1_59.a common.copy stage\lib\libboost_system-mgw51-mt-1_59.a C:\boost-filesystem\boost\bin.v2\libs\system\build\gcc-mingw-5.1.0\release\link- static\threading-multi\libboost_system-mgw51-mt-1_59.a 1 file(s) copied. common.mkdir C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw-5. 1.0\release common.mkdir C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw-5. 1.0\release\link-static common.mkdir C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw-5. 1.0\release\link-static\threading-multi gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\release\link-static\threading-multi\codecvt_error_category.o gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\release\link-static\threading-multi\operations.o libs\filesystem\src\operations.cpp:688:26: warning: '{anonymous}::create_symboli c_link_api' defined but not used [-Wunused-variable] PtrCreateSymbolicLinkW create_symbolic_link_api = PtrCreateSymbolicLinkW( ^ gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\release\link-static\threading-multi\path.o gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\release\link-static\threading-multi\path_traits.o gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\release\link-static\threading-multi\portability.o gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\release\link-static\threading-multi\unique_path.o libs\filesystem\src\unique_path.cpp:28:0: warning: ignoring #pragma comment [-W unknown-pragmas] # pragma comment(lib, "Advapi32.lib") ^ gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\release\link-static\threading-multi\utf8_codecvt_facet.o gcc.compile.c++ C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw -5.1.0\release\link-static\threading-multi\windows_file_codecvt.o gcc.archive C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw-5.1 .0\release\link-static\threading-multi\libboost_filesystem-mgw51-mt-1_59.a common.copy stage\lib\libboost_filesystem-mgw51-mt-1_59.a C:\boost-filesystem\boost\bin.v2\libs\filesystem\build\gcc-mingw-5.1.0\release\l ink-static\threading-multi\libboost_filesystem-mgw51-mt-1_59.a 1 file(s) copied. ...updated 51 targets... So there are some warning while Bootstrapping the build engine, errors and failed targets when building the filesystem library. Should I be worried about them? What should I do?

1 0

Program Options and Filesystem ifstream
by Scott Morgan 19 Aug '15

19 Aug '15

Having a problem getting the following to compile under a Linux system (Mint 17.2, boost 1.54). It works okay with MSVC2010 and boost 1.57 though. **begin: main.cpp** #include <boost/filesystem/fstream.hpp> namespace fs = boost::filesystem; #include <boost/program_options.hpp> namespace po = boost::program_options; void test(fs::path& cfg_path, po::options_description& cfg_desc, po::variables_map& options) { po::store(po::parse_config_file(fs::ifstream(cfg_path), cfg_desc, true), options); } **end: main.cpp** Is this just a problem with 1.54's version of filesystem and/or program options? Scott **begin: GCC output** main.cpp: In function ‘void test(boost::filesystem::path&, boost::program_options::options_description&, boost::program_options::variables_map&)’: main.cpp:8:72: error: no matching function for call to ‘parse_config_file(boost::filesystem::ifstream, boost::program_options::options_description&, bool)’ po::store(po::parse_config_file(fs::ifstream(cfg_path), cfg_desc, true), options); ^ main.cpp:8:72: note: candidates are: In file included from /usr/include/boost/program_options.hpp:17:0, from main.cpp:3: /usr/include/boost/program_options/parsers.hpp:185:5: note: boost::program_options::basic_parsed_options<charT> boost::program_options::parse_config_file(std::basic_istream<charT>&, const boost::program_options::options_description&, bool) [with charT = char] parse_config_file(std::basic_istream<charT>&, const options_description&, ^ /usr/include/boost/program_options/parsers.hpp:185:5: note: no known conversion for argument 1 from ‘boost::filesystem::ifstream {aka boost::filesystem::basic_ifstream<char>}’ to ‘std::basic_istream<char>&’ /usr/include/boost/program_options/parsers.hpp:198:5: note: template<class charT> boost::program_options::basic_parsed_options<charT> boost::program_options::parse_config_file(const char*, const boost::program_options::options_description&, bool) parse_config_file(const char* filename, const options_description&, ^ /usr/include/boost/program_options/parsers.hpp:198:5: note: template argument deduction/substitution failed: main.cpp:8:72: note: cannot convert ‘boost::filesystem::basic_ifstream<char>((*(const boost::filesystem::path*)cfg_path))’ (type ‘boost::filesystem::ifstream {aka boost::filesystem::basic_ifstream<char>}’) to type ‘const char*’ po::store(po::parse_config_file(fs::ifstream(cfg_path), cfg_desc, true), options); ^ **end: GCC output**

2 3

multi_index member key extractors crash MSVC 2015
by Filip Konvička 19 Aug '15

19 Aug '15

Hi, it looks like using boost::multi_index::member<> crashes MSVC 2015 RTM when a const-qualified type is passed to it as the 2nd argument, but the member is actually non-const. #include <boost\multi_index_container.hpp> #include <boost\multi_index\member.hpp> #include <boost\multi_index\indexed_by.hpp> #include <boost\multi_index\ordered_index.hpp> struct X { int number; // non-const }; using namespace boost::multi_index; int main() { typedef multi_index_container<X, indexed_by<ordered_unique<member<X, const int, &X::number> > > > C; C c; c.find(1); // C1001 return 0; } ...\include\boost\multi_index\member.hpp(65): fatal error C1001: An internal error has occurred in the compiler. (compiler file 'f:\dd\vctools\compiler\utc\src\p2\main.c', line 246) I found the following on a related subject, but I'm not sure whether this is a separate issue or not. http://www.boost.org/development/tests/master/developer/output/teeks99-08l-… https://connect.microsoft.com/VisualStudio/feedback/details/1577162/vc-inte… https://groups.google.com/forum/#!topic/boost-devel-archive/gi-xGnCkvPI Thanks, Filip

2 1

[Asio] Measuring and improving SSL servier scalability
by Konrad Zemek 18 Aug '15

18 Aug '15

Hi all, I've built a few different Asio-based SSL servers in my career, but in my recent project the performance and resource-efficiency was paramount (as it's a library project), so I benchmarked it to make sure. Long story short, when benchmarking I found out that OpenSSL's error handling is a *very* serious bottleneck when scaling Asio+SSL over multiple threads. This can be "fixed", e.g. by using BoringSSL instead of OpenSSL, as BoringSSL uses thread-local storage for error data instead of locking a global mutex. As I didn't find any resources discussing bad Asio+SSL multithreaded performance (aside of one or two messages somewhere on this mailing list that complained about the problem; unfortunately I can't seem to find them right now), I've written up my knowledge into a blog post [1]. I believe it might be very useful to anyone who wants to build a multi-threaded SSL server/client on top of Asio. Konrad [1] https://konradzemek.com/2015/08/16/asio-ssl-and-scalability/

2 2

[units] implicit type conversions to specific unit quantity
by Michael Powell 17 Aug '15

17 Aug '15

Hello, I'd like to convert from an SI length quantity to a US inches quantity. I believe the following snippet will do what I want it to, but wanted to clarify if that was the case: http://www.boost.org/doc/libs/1_59_0/doc/html/boost_units/Quantities.html I am referencing the online docs, but needed some clarity in actually how to go about using it in practice: <code> using boost::units::si::meter_base_unit; using boost::units::us::inch_base_unit; // i.e. 0.3048 * 12 (inches/feet, feet/meter) BOOST_UNITS_DEFINE_CONVERSION_FACTOR(inch_base_unit, meter_base_unit, double, 3.6576); //... quantity<inch_unit> to_inches_length_quantity(quantity<length> const & L) { const quantity<inch_unit::unit_type> result_(L); return result_; } </code> Just besides that, there isn't a cleaner way of doing it? Some have mentioned going as far as creating a whole other system for my calculator's purposes, for example. Thank you... Best regards, Michael Powell

2 2

Re: [Boost-users] Building Boost 1.59.0 on Solaris 11 with Solaris Studio 12.4
by Leo Carreon 17 Aug '15

17 Aug '15

From: Leo Carreon Sent: Sunday, August 16, 2015 8:39 PM To: Boost Users Mailing List Subject: Building Boost 1.59.0 on Solaris 11 with Solaris Studio 12.4 >>Hi Boosters, >>I have been attempting to build Boost 1.59.0 on Solaris 11 using Solaris Studio 12.4 in C++11 mode. >>So far, I have managed to locate on the web solutions to 3 issues. >>Now I’m down to 22 targets failing to build. >>Has anyone else attempted to do the same? I would appreciate it if you could share some of your fixes if you have any. >>Has anyone reported that they have been able to cleanly build in this environment? >>Kind regards, >>Leo This is an update of my previous mail. I now have fixed 4 issues instead of 3. I also had a look at the build log generated from the above. It appears that the following issues are the cause of the remaining build problems which I haven’t figured out how to resolve yet: 1. ) "libs/thread/src/pthread/thread.cpp", line 103: Error: The operation "boost::shared_ptr<boost::detail::tss_cleanup_function> && bool" is illegal. "libs/thread/src/pthread/thread.cpp", line 144: Error: Overloading ambiguity between "boost::call_once<void(*)()>(boost::once_flag&, void(*)())" and "boost::call_once<void(&)()>(boost::once_flag&, void(&)())". "libs/thread/src/pthread/thread.cpp", line 150: Error: Overloading ambiguity between "boost::call_once<void(*)()>(boost::once_flag&, void(*)())" and "boost::call_once<void(&)()>(boost::once_flag&, void(&)())". "libs/thread/src/pthread/thread.cpp", line 803: Error: The operation "bool && boost::shared_ptr<boost::detail::tss_cleanup_function>" is illegal. "libs/thread/src/pthread/thread.cpp", line 807: Error: The operation "boost::shared_ptr<boost::detail::tss_cleanup_function> || bool" is illegal. "libs/thread/src/pthread/thread.cpp", line 817: Error: The operation "boost::shared_ptr<boost::detail::tss_cleanup_function> || bool" is illegal. 2.) "./boost/thread/detail/nullary_function.hpp", line 125: Error: Cannot use std::shared_ptr<boost::detail::nullary_function<void()>::impl_base> to initialize bool. "./boost/thread/detail/nullary_function.hpp", line 125: Error: An expression of scalar type was expected. 3.) "libs/coroutine/src/posix/stack_traits.cpp", line 56: Error: Overloading ambiguity between "boost::call_once<void(&)(unsigned long*), unsigned long*>(boost::once_flag&, void(&)(unsigned long*), unsigned long*&&)" and "boost::call_once<void(*)(unsigned long*), unsigned long*>(boost::once_flag&, void(*)(unsigned long*), unsigned long*)". "libs/coroutine/src/posix/stack_traits.cpp", line 64: Error: Overloading ambiguity between "boost::call_once<void(&)(rlimit*), rlimit*>(boost::once_flag&, void(&)(rlimit*), rlimit*&&)" and "boost::call_once<void(*)(rlimit*), rlimit*>(boost::once_flag&, void(*)(rlimit*), rlimit*)". 4.) "./boost/proto/detail/preprocessed/make_expr_.hpp", line 73: Error: type is not a member of boost::proto::transform<boost::proto::switch_<boost::phoenix::phoenix_generator, boost::proto::tag_of<boost::proto::_>()>, void>::result<boost::phoenix::phoenix_generator(boost::proto::exprns_::basic_expr<boost::proto::tagns_::tag::assign, boost::proto::argsns_::list2<boost::proto::exprns_::basic_expr<boost::proto::tagns_::tag::terminal, boost::proto::argsns_::term<boost::phoenix::argument<1>>, 0>, boost::phoenix::actor<boost::proto::exprns_::basic_expr<boost::proto::tagns_::tag::terminal, boost::proto::argsns_::term<boost::phoenix::argument<1>>, 0>>>, 2>)>. 5.) "libs/python/src/converter/builtin_converters.cpp", line 474: Error: Overloading ambiguity between "std::complex<double>::complex(double, double)" and "std::complex<double>::complex(complex double[2])". "libs/python/src/converter/builtin_converters.cpp", line 474: Error: Cannot return long from a function that should return std::complex<double>. 2 Error(s) detected. 6.) "./boost/thread/once.hpp", line 38: Error: Overloading ambiguity between "boost::call_once<void(*)()>(boost::once_flag&, void(*)())" and "boost::call_once<void(*)()&>(boost::once_flag&, void(*)()&)". 7.) "./boost/spirit/home/classic/core/non_terminal/impl/object_with_id.ipp", line 145: Error: Overloading ambiguity between "boost::call_once<void(*)()>(boost::once_flag&, void(*)())" and "boost::call_once<void(&)()>(boost::once_flag&, void(&)())". 8.) "./boost/spirit/home/classic/phoenix/closures.hpp", line 427: Error: Overloading ambiguity between "boost::call_once<void(*)()>(boost::once_flag&, void(*)())" and "boost::call_once<void(&)()>(boost::once_flag&, void(&)())". These remaining issues are preventing me from building my own library because it depends on some of the Boost libraries that are still failing to build.

1 0

Re: [Boost-users] [boost] Making the Windows binaries 'official'
by Tom Kent 15 Aug '15

15 Aug '15

On Fri, Aug 14, 2015 at 8:34 PM, Glen Fernandes <glen.fernandes(a)gmail.com> wrote: > On Fri, Aug 14, 2015 at 9:03 PM, Tom Kent wrote: > > Is this something the community would be in favor of? I know that many of > > the people on these lists don't use windows and if they do are generally > > capable of building the windows binaries themselves, however there is a > > large group out there that prefers to just get the installer for them > (like > > they do for other projects like Qt, wxWidgets, etc). > > > > Thoughts? > > While I have not been a MSVC user for a while now: I think it's a good > thing for our VC users that binaries are available to them. > > Is (1) necessary? I was under the impression binaries becoming > available a few days after a source release is not uncommon. > This is basically how it is now....if people don't think it is necessary we can stick with this. However, I think it would be more professional if we change, hence my e-mail to the list. > SourceForge raises the usual concern: Can you trust a Windows > executable or DLL that you get from sourceforge.net anymore? > The .7z file and installers are SHA-256 hashed, and the list of hashes is signed with my GPG key. That said, I think we need to start planning an alternative to sourceforge for releases. It is not clear to me that it will still be around in a few years. That's a whole different thread though. > > Also, how do you cater to users who want variants that you're not > providing? i.e. Already you probably have Debug/Release * > 32-bit/64-bit * MT/MD/MTd/MDd * LIB/DLL (per 6 compiler versions). > What happens if someone wants /Gz or /Gv instead of /Gd etc. > I provide whatever bjam specifies with --build-type=complete. The bigger question is external libraries. I link with zlib, and bzip2 but not MPI for instance. I have had users ask for different version numbers of those libraries, but my answer is then that you're on your own for building anything else. These kind of questions are only relevant to far less than 1% of the people who download the binaries. Tom

2 1

[type_erasure] BOOST_TYPE_ERASURE_MEMBER with template?
by Nat Goodspeed 15 Aug '15

15 Aug '15

The code with which I'm working has two similar template classes: they have a common subset of 8 methods that could be used on an instance of either. For performance reasons, these methods are not virtual. As far as the compiler knows, the two template classes are unrelated. Naturally we can write a template function to accept an instance of either template class, as long as it uses only methods from the common subset. I also want to support runtime polymorphism, permitting a non-template function to accept an instance of either template class. Obviously that will incur some performance hit, but the coder can decide whether or not his/her function is performance-critical. If so, s/he can write that function to accept one or the other specific template class -- or write a template function. We want to incur the performance hit only when the coder deems that an acceptable tradeoff. The classic solution would be to derive both template classes from a common base class and make the common methods virtual -- but then that penalizes every consumer. I haven't yet used Boost.TypeErasure, but it seems to me potentially applicable to this problem. I see the example[0] illustrating use of BOOST_TYPE_ERASURE_MEMBER(). I was going to define requirements for each of the 8 common methods ... but then I became confused. Our common methods use a template parameter from the parent template class as a method parameter type. Can I invoke BOOST_TYPE_ERASURE_MEMBER in a generic way that would support all valid template parameters? Two of the 8 common methods are template methods, accepting a parameter whose type is a template parameter for the method rather than the containing class. I don't know whether that introduces further complexity. Thank you for any help you can provide! [0] http://www.boost.org/doc/libs/1_59_0/doc/html/boost_typeerasure/basic.html

2 1

Making the Windows binaries 'official'
by Tom Kent 15 Aug '15

15 Aug '15

<history> After the boostpro.com organization dissolved, there was never an official place to go to get pre-built binaries for the releases. Some random components were made available on the sourceforge download page and I had been hosting them on my own website (http://boost.teeks99.com) since I started building them around the release of 1.37. A couple years ago, before the release of 1.54, I asked the community if they would like my builds to be hosted on the sourceforge site, and the answer was positive: http://lists.boost.org/Archives/boost/2013/04/202460.php Since the 1.54 release, I've generally been uploading the windows binaries based on the RCs and enabling the downloads just a few minutes after the release notice goes out. </history> I would now like to propose that we make these libraries an official part of each Boost release. I don't think this entails much, just the following: 1) Have the release team coordinate with me to ensure that the binaries are ready before announcing the release. 2) Include a link to them in the release announcement. 3) Link to them from the website. It would also be good to get others who can run the scripts to perform the build, if I am someday unable to do this. The biggest hurdle here is having a (virtual) machine with all six versions of visual studio on it. Is this something the community would be in favor of? I know that many of the people on these lists don't use windows and if they do are generally capable of building the windows binaries themselves, however there is a large group out there that prefers to just get the installer for them (like they do for other projects like Qt, wxWidgets, etc). Thoughts? Tom Kent

1 0

[Graph] Descriptor invalidation on remove_vertex() with adjacency_list VL=vecS
by Chris Dellin 14 Aug '15

14 Aug '15

Hello, The documentation for the adjacency_list [0] is clear that if the vertex list container is vecS, then calling remove_vertex() will invalidate any vertex/edge descriptors into the graph. However, I was wondering if this is actually the case if the removed vertex was the one most recently added, that is, remove_vertex(vertex(num_vertices(g)-1)). In this case, I would think that no shifting of vertex data or adjustment of edge source/target indices would be necessary, and existing descriptors are guaranteed to be still valid. Is this safe to do with the current implementation? If not, why not? Thanks, - Chris Dellin [0] http://www.boost.org/doc/libs/1_59_0/libs/graph/doc/adjacency_list.html

2 1

[shared_ptr] boost::shared_ptr deleter question
by Tamas.Ruszkai＠leica-geosystems.com 14 Aug '15

14 Aug '15

Hi All, I wonder when the shared_ptr deleter is destroyed. I have a shared_ptr with a custom deleter. I would expect when the last shared pointer to the object is gone then not only the deleter method will be called, but the deleter function object is also released. As I see the deleter is taken by value and stored by value in the reference counter, so I do not understand what is going on. How is the deleter mean to be freed? Thanks, Tamas struct MyClassDeleter { ~MyClassDeleter() { // Break point is set here } void operator()(MyClass* item) { // Break point is set here } } { auto sharedPtr = boost::shared_ptr<MyClass>(new MyClass, MyClassDeleter) } // shared_ptr leaves the scope here, the custom deleter is called (parenthesis operator) // the deleter instance is however not destroyed, the breakpoint in the destructor does not hit

2 2

Log: Overwrite format of sink
by Florian Lindner 14 Aug '15

14 Aug '15

Hello, I have a console sink: boost::log::add_console_log(std::cout, keywords::format = fmtStream); with fmtStream being an expressions stream. After setting up the sinks I load a configuration file: std::ifstream file("log.settings"); init_from_stream(file); Is there a way to overwrite the format of this sink from within in the configuration file. Or, alternatively disable this sink. What I want to achieve is that a user have the option to modify the format without having two console outputs... Thanks, Florian

1 0

Query regarding interest in my submitting plf::colony to Boost
by Soul Studios 14 Aug '15

14 Aug '15

Hi all, I've had some expressions of support outside of the Boost community for submission of the plf::colony container and it's associated container plf::stack, mainly from the review judges for my cppcon submission on the same topic (topic didn't make it through to the finals but got a positive response). I'd like to guage reactions here to see whether it is worth spending the time necessary to port it to Boost, with all the associated reviews etc. plf::colony is a container for unordered data, where erasure and addition do not cause iterator/pointer invalidation, with superior performance characteristics to all std:: containers when either (a) Pointers and iterators which point to container elements must stay valid regardless of container additions and deletions and/or (b) Additions to or deletions from the container will be occurring in performance-critical code. Erasure performance in particular can be in advance of 6000x of vectors, while still being faster than lists, maps, deques etc for add and iteration. Full details and benchmarks across four compilers are here: http://www.plflib.org/colony.htm#benchmarks It has been thoroughly tested, including integrating it into the game engine I constructed last year as well as the usual unit tests. It supports both C++0x and C++11, and has been tested on the following compilers so far: Clang 3.4, GCC 4.6, 4.7, 4.8, 4.9 and 5.1 (both 32-bit and 64-bit), MS Visual C++ 2010 & 2013 (2015 supported but untested as yet). Internally a colony is a combination of a linked-list of increasingly-larger memory blocks combined with boolean erasure fields, combined with a custom memory location recycle stack. The most common comment I get is "that sounds kinda like a deque", so to save some time here are the differences (from the FAQ): "A double-ended queue requires a very different internal framework. It may or may not use a linked-list of memory blocks, dependent on the compiler, and has no comparable performance characteristics. Deque element erasure is very slow, similar to a vector, and it does not free unused memory blocks to the OS once they are empty, unlike a colony. In addition a deque invalidates references to subsequent container elements when erasing elements, which a colony does not. A colony never invalidates pointers/iterators to elements unless the element being referred to is erased." The rest of the faq is here and I would appreciate it if people read it before casting judgement: http://www.plflib.org/colony.htm I am aware that it will be a lot of work to port colony to Boost, so I will only undertake this if there is genuine interest. In addition, plf::stack - which colony must use internally - is a std::stack equivalent container but with much better performance characteristics, which can be used outside of plf::colony. Asides from the performance characteristics, colonies have the following positive and negative properties: Positive: Lack of pointer/iterator invalidation makes interrelating between collections of data easier, without the cache misses associated with vectors of pointers to dynamically-allocated objects. Negative: Due to the additional overhead, performance can be worse for scalar types. Thanks in advance- Matt B

5 13

[units] Conversions from quantities
by Michael Powell 14 Aug '15

14 Aug '15

Hello, Just wanted to clarify something. These should convert from given quantities to the desired units? double unit_conversion::from_length_to_inches(quantity<length> const & L) { const quantity<inch_base_unit::unit_type> result_(L); return result_.value(); } double unit_conversion::from_mass_to_pounds(quantity<mass> const & M) { const quantity<ounce_base_unit::unit_type> result_(M); return result_.value(); } >From an earlier post, I think maybe so, but I was interested in expert opinions, as well. https://groups.google.com/forum/#!topic/boost-list/YDJoMcu1Xx4 Thank you... Best regards, Michael Powell

4 4

Boost 1.59.0 has been released
by Marshall Clow 13 Aug '15

13 Aug '15

Release 1.59.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains two new libraries and numerous enhancements and bug fixes for existing libraries. New Libraries * Convert: An extendible and configurable type-conversion framework, from Vladimir Batov. * Coroutine2: from Oliver Kowalke For details, including download links, see http://www.boost.org/users/news/version_1.59.0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.59.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Vladimir Prus Rene Rivera Marshall Clow Eric Niebler Daniel James Beman Dawes

3 2

[Interprocess][Container] nested containers and scoped allocators
by Malko 13 Aug '15

13 Aug '15

Hi, First of all my setup: I am compiling on redhat 6 with clang 3.4 in C++03, using boost_1_58. In a project of mine I am using a map<int, vector<int>> (types to be stored in shared memory and I am using the proper allocators as per interprocess documentation). If mymap is an instance of such a type, then mymap[0] is an invalid syntax because of issues that, to the best of my understanding, are related to the fact that the map tries to use the default constructor (with the default allocator) for the nested type as operator[] also accounts for the case in which the entry is missing and must be constructed. Using at() instead of operator[] makes the whole thing compile. On construction, I give the usual instance of allocator<void, segment_manager> to mymap. According to what I read in Boost.Container docs: http://www.boost.org/doc/libs/1_58_0/doc/html/container/Cpp11_conformance.h… It would seem to me that a scoped allocator is a mechanism by which the allocator I gave to mymap is passed down to the nested vector. In which case I would expect operator[] to try to use such allocator instead of the default one. But then again, I always do mymap.insert(std::pair<const int, vector<int,...>>(0, vector<...>(my_void_alloc))) to add an element to the map, since I need to specify the allocator (and the examples in interprocess use this syntax). Given all of this, I would be grateful for any insight into the following: 1. If the scoped allocator is meant to be passed from the map to the vector, why can I not use operator[] and I necessarily need to use insert() to create a new vector in the map? Have I misunderstood what a scoped allocator is? Thanks in advance. -- View this message in context: http://boost.2283326.n4.nabble.com/Interprocess-Container-nested-containers… Sent from the Boost - Users mailing list archive at Nabble.com.

1 1

1.59.0 rc3 is now available
by Marshall Clow 13 Aug '15

13 Aug '15

New Release candidate files for 1.59.0 are available at: http://boost.cowic.de/rc/ RC3 should fix the problem with VC14 and MSPDB140.DLL. As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: MD5 (boost_1_59_0_rc3.7z) = 0a2e512844f3e30a6240f8139ee983f3 MD5 (boost_1_59_0_rc3.tar.bz2) = 6aa9a5c6a4ca1016edd0ed1178e3cb87 MD5 (boost_1_59_0_rc3.tar.gz) = 51528a0e3b33d9e10aaa311d9eb451e3 MD5 (boost_1_59_0_rc3.zip) = 08d29a2d85db3ebc8c6fdfa3a1f2b83c Thanks! -- The release managers P.S. Release notes are here: http://www.boost.org/users/history/version_1_59_0.html

5 4

[statechart] Events forwarding and orthogonal states
by lucaghera 13 Aug '15

13 Aug '15

Hi all, I've a problem similar to the one discussed in this old post: http://boost.2283326.n4.nabble.com/statechart-Broadcasting-events-to-orthog… I have a state, let's call it A, which contains two orthogonal regions. State X is the initial state of region 0 and state Y is the initial state of region 1. Both state A and state Y have a custom reaction for event E. State Y execute some computation based on event E while state A simply keeps track of how many times the event E is triggered. State A discard the event at the end of the custom reaction, while state Y forward it (the goal would be to forward it to the state A). >From the old post I think I have understood how the statechart library works and why the state Y never receives the event E. I guess that in my case state X is chosen as first state to process event E. Given that X is not interested in event E, the event is forwarded to state A, which process it and discard it. I see few possible solutions (with drawbacks) but I would like to know how this problem should be addressed. 1) I could do the counting directly in the state Y and remove the custom reaction to E from state A. This would work, however if tomorrow I will define a third state Z interested in E, I would have to duplicate the event counting code, which would work only if I assume that the Z and Y are not active at the same time (otherwise the event would be counted twice). 2) I could define an event that is listened only by state A and is triggered by the state Y after processing E. This doesn't seem really elegant and if multiple states are interested in E I have to be careful to not count the event twice. -- View this message in context: http://boost.2283326.n4.nabble.com/statechart-Events-forwarding-and-orthogo… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[variant] Possible regression from 1.55 to 1.58
by Mario Lang 12 Aug '15

12 Aug '15

Hi. I just upgraded my Boost from 1.55 to 1.58. My project doesn't build anymore, it fails on the following pattern, which used to work with 1.55: ---<snip>--- #include <algorithm> #include <boost/variant.hpp> #include <string> #include <iostream> #include <vector> struct visitor : boost::static_visitor<std::ostream &> { result_type operator() (int) { return std::cout; } result_type operator() (std::string) const { return std::cout; } }; int main() { std::vector< boost::variant<int, std::string> > v; visitor vis; foreach(v.begin(), v.end(), boost::apply_visitor(vis)); return 0; } ---<snip>--- The example is a bit silly, since foreach discards the return value of apply_visitor anyway. So my solution was to change the visitor to define result_type as void. This works. However, I am wondering why delayed_visitor does no longer work in this situation? Is it because I am trying to return a reference? -- CYa, ⡍⠁⠗⠊⠕

4 4

Problem accessing boost trac
by Leo Carreon 12 Aug '15

12 Aug '15

Hi Boosters, Sorry to be posting this here but I’m trying to access boost trac and I’m getting a certificate error. Does anyone know how to resolve this issue? Regards, Leo

2 1

[intrusive_ptr] Strange ternary op behavior with MSVC14
by TONGARI J 12 Aug '15

12 Aug '15

Hi, I found a strange bug while debugging: This is the minimal example that shows the problem: (the nullptr will be some other meaningful thing in real case) ```c++ #include <iostream> #include <boost/smart_ptr/intrusive_ptr.hpp> #include <boost/smart_ptr/intrusive_ref_counter.hpp> template<class T> struct wrapper { wrapper() = default; wrapper(boost::intrusive_ptr<T> const& p) : _p(p) {} boost::intrusive_ptr<T> const& get_ptr() const { #if 0 // This is OK. if (_p) return _p; return nullptr; #else // Strange behavior. return _p ? _p : nullptr; #endif } private: boost::intrusive_ptr<T> _p; }; struct W : boost::intrusive_ref_counter<W> { }; template<class T1, class T2> inline void test(wrapper<T1> const& s1, wrapper<T2> const& s2) { auto tup = std::make_tuple(s1.get_ptr(), s2.get_ptr()); std::cout << 0 << ":" << (void*)std::get<0>(tup).get() << "\n"; std::cout << 1 << ":" << (void*)std::get<1>(tup).get() << "\n"; } int main() { wrapper<W> a(new W), b(new W); test(a, b); return 0; } ``` If compiled with MSVC14, you'll see the 2 addresses are the same while they shouldn't. If if-stmt is used instead, the problem won't be shown. I also replaced intrusive_ptr with std::shared_ptr and the problem isn't shown as well. The same code works well with g++. It seems intrusive_ptr & MSVC14 specific but I can't reason about... Any idea?

3 5

[Boost.ASIO] [asio] Scaling TCP Server
by Sarvagya Pant 11 Aug '15

11 Aug '15

I have created a TCP server that can receive two types of message from client. 1. "Heartbeat" : If this is found and "first_fetch" is 1, send some config in Json format else send {"config_changed" : "true"} 2. "Message" : If this is found, send {"success" : "true"} The async server is here => https://gist.github.com/mesarvagya/a73f2428417cb10336ef and the client is given here => https://gist.github.com/mesarvagya/90d764c749d18d9c5184 While both works fine, but the server is slower than expected. If one sees, I have used ~3kb message in client. When the client and server are connected, I did a preliminary benchmarking and the result were as follows: 1. For 50K messages, the time was 6 seconds. 2. For 100K messages, the time was 11 seconds. 3. For 200K messages, the time was 36 seconds. 3. For 500K messages, the time was 82 seconds 3. For 1million messages, the time was 174 seconds. The server is not working as expected. Currently it works at ~6K message/seconds in localhost. I would like to optimize the current server to receive at-least 100K messages per second. How should I begin with optimizing the server code? Is it possible to receive such high message/seconds in boost.ASIO and if so, how should I approach with the server design? -- *Sarvagya Pant* *Kathmandu, Nepal* *+9779803468257*

4 5

building boost 1.54 thread
by W. Miah 11 Aug '15

11 Aug '15

Hello, I am having trouble building the threaded version of boost (version 1.54). I require version 1.54 only. I am getting the below error message. Any help will be greatly appreciated. Regards, Wadud. [root@bengal boost_1_54_0]# g++ --version g++ (GCC) 4.9.2 20150212 (Red Hat 4.9.2-6) Copyright (C) 2014 Free Software Foundation, Inc. [root@bengal boost_1_54_0]# ./bootstrap.sh --prefix=/usr/local/boost-1.54 --with-libraries=thread Building Boost.Build engine with toolset gcc... tools/build/v2/engine/bin.linuxx86_64/b2 Unicode/ICU support for Boost.Regex?... /usr Generating Boost.Build configuration in project-config.jam... Bootstrapping is done. To build, run: ./b2 To adjust configuration, edit 'project-config.jam'. Further information: - Command line help: ./b2 --help - Getting started guide: http://www.boost.org/more/getting_started/unix-variants.html - Boost.Build documentation: http://www.boost.org/boost-build2/doc/html/index.html [root@bengal boost_1_54_0]# ./b2 install Component configuration: - atomic : not building - chrono : not building - context : not building - coroutine : not building - date_time : not building - exception : not building - filesystem : not building - graph : not building - graph_parallel : not building - iostreams : not building - locale : not building - log : not building - math : not building - mpi : not building - program_options : not building - python : not building - random : not building - regex : not building - serialization : not building - signals : not building - system : not building - test : not building - thread : building - timer : not building - wave : not building ...patience... ...patience... ...found 21612 targets... ...updating 38 targets... common.mkdir bin.v2 common.mkdir bin.v2/libs common.mkdir bin.v2/libs/system common.mkdir bin.v2/libs/system/build common.mkdir bin.v2/libs/system/build/gcc-4.9.2 common.mkdir bin.v2/libs/system/build/gcc-4.9.2/release common.mkdir bin.v2/libs/system/build/gcc-4.9.2/release/threading-multi gcc.compile.c++ bin.v2/libs/system/build/gcc-4.9.2/release/threading-multi/error_code.o In file included from ./boost/system/error_code.hpp:15:0, from libs/system/src/error_code.cpp:19: ./boost/cstdint.hpp:300:49: warning: use of C++11 long long integer constant [-Wlong-long] # elif (defined(ULLONG_MAX) && ULLONG_MAX == 18446744073709551615ULL) || (defined(ULONG_LONG_MAX) && ULONG_LONG_MAX == 18446744073709551615ULL) || (defined(ULONGLONG_MAX) && ULONGLONG_MAX == 18446744073709551615ULL) ^ ./boost/cstdint.hpp:300:123: warning: use of C++11 long long integer constant [-Wlong-long] # elif (defined(ULLONG_MAX) && ULLONG_MAX == 18446744073709551615ULL) || (defined(ULONG_LONG_MAX) && ULONG_LONG_MAX == 18446744073709551615ULL) || (defined(ULONGLONG_MAX) && ULONGLONG_MAX == 18446744073709551615ULL) ^ In file included from ./boost/system/error_code.hpp:15:0, from libs/system/src/error_code.cpp:19: ./boost/cstdint.hpp:300:195: warning: use of C++11 long long integer constant [-Wlong-long] # elif (defined(ULLONG_MAX) && ULLONG_MAX == 18446744073709551615ULL) || (defined(ULONG_LONG_MAX) && ULONG_LONG_MAX == 18446744073709551615ULL) || (defined(ULONGLONG_MAX) && ULONGLONG_MAX == 18446744073709551615ULL) ^ gcc.link.dll bin.v2/libs/system/build/gcc-4.9.2/release/threading-multi/libboost_system.so.1.54.0 common.copy /usr/local/boost-1.54/lib/libboost_system.so.1.54.0 ln-UNIX /usr/local/boost-1.54/lib/libboost_system.so common.mkdir bin.v2/libs/thread common.mkdir bin.v2/libs/thread/build common.mkdir bin.v2/libs/thread/build/gcc-4.9.2 common.mkdir bin.v2/libs/thread/build/gcc-4.9.2/release common.mkdir bin.v2/libs/thread/build/gcc-4.9.2/release/threading-multi common.mkdir bin.v2/libs/thread/build/gcc-4.9.2/release/threading-multi/pthread gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.9.2/release/threading-multi/pthread/thread.o In file included from ./boost/bind/bind.hpp:29:0, from ./boost/bind.hpp:22, from ./boost/thread/detail/thread.hpp:29, from ./boost/thread/thread_only.hpp:22, from libs/thread/src/pthread/thread.cpp:11: ./boost/bind/arg.hpp: In constructor ‘boost::arg::arg(const T&)’: ./boost/bind/arg.hpp:37:22: warning: typedef ‘T_must_be_placeholder’ locally defined but not used [-Wunused-local-typedefs] typedef char T_must_be_placeholder[ I == is_placeholder<T>::value? 1: -1 ]; ^ In file included from ./boost/atomic.hpp:12:0, from ./boost/thread/pthread/once_atomic.hpp:20, from ./boost/thread/once.hpp:20, from libs/thread/src/pthread/thread.cpp:17: ./boost/atomic/atomic.hpp: At global scope: ./boost/atomic/atomic.hpp:202:16: error: ‘uintptr_t’ was not declared in this scope typedef atomic<uintptr_t> atomic_uintptr_t; ^ ./boost/atomic/atomic.hpp:202:25: error: template argument 1 is invalid typedef atomic<uintptr_t> atomic_uintptr_t; ^ ./boost/atomic/atomic.hpp:202:43: error: invalid type in declaration before ‘;’ token typedef atomic<uintptr_t> atomic_uintptr_t; ^ In file included from ./boost/system/system_error.hpp:14:0, from ./boost/thread/exceptions.hpp:22, from ./boost/thread/pthread/thread_data.hpp:10, from ./boost/thread/thread_only.hpp:17, from libs/thread/src/pthread/thread.cpp:11: ./boost/system/error_code.hpp:222:36: warning: ‘boost::system::posix_category’ defined but not used [-Wunused-variable] static const error_category & posix_category = generic_category(); ^ ./boost/system/error_code.hpp:223:36: warning: ‘boost::system::errno_ecat’ defined but not used [-Wunused-variable] static const error_category & errno_ecat = generic_category(); ^ ./boost/system/error_code.hpp:224:36: warning: ‘boost::system::native_ecat’ defined but not used [-Wunused-variable] static const error_category & native_ecat = system_category(); ^ "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pedantic -pthread -fPIC -Wextra -Wno-long-long -Wno-variadic-macros -Wunused-function -pedantic -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_THREAD_BUILD_DLL=1 -DBOOST_THREAD_DONT_USE_CHRONO -DBOOST_THREAD_POSIX -DNDEBUG -I"." -c -o "bin.v2/libs/thread/build/gcc-4.9.2/release/threading-multi/pthread/thread.o" "libs/thread/src/pthread/thread.cpp" ...failed gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.9.2/release/threading-multi/pthread/thread.o... gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.9.2/release/threading-multi/pthread/once.o In file included from ./boost/bind/bind.hpp:29:0, from ./boost/bind.hpp:22, from ./boost/thread/pthread/once_atomic.hpp:19, from ./boost/thread/once.hpp:20, from libs/thread/src/pthread/./once_atomic.cpp:9, from libs/thread/src/pthread/once.cpp:8: ./boost/bind/arg.hpp: In constructor ‘boost::arg::arg(const T&)’: ./boost/bind/arg.hpp:37:22: warning: typedef ‘T_must_be_placeholder’ locally defined but not used [-Wunused-local-typedefs] typedef char T_must_be_placeholder[ I == is_placeholder<T>::value? 1: -1 ]; ^ In file included from ./boost/atomic.hpp:12:0, from ./boost/thread/pthread/once_atomic.hpp:20, from ./boost/thread/once.hpp:20, from libs/thread/src/pthread/./once_atomic.cpp:9, from libs/thread/src/pthread/once.cpp:8: ./boost/atomic/atomic.hpp: At global scope: ./boost/atomic/atomic.hpp:202:16: error: ‘uintptr_t’ was not declared in this scope typedef atomic<uintptr_t> atomic_uintptr_t; ^ ./boost/atomic/atomic.hpp:202:25: error: template argument 1 is invalid typedef atomic<uintptr_t> atomic_uintptr_t; ^ ./boost/atomic/atomic.hpp:202:43: error: invalid type in declaration before ‘;’ token typedef atomic<uintptr_t> atomic_uintptr_t; ^ "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pedantic -pthread -fPIC -Wextra -Wno-long-long -Wno-variadic-macros -Wunused-function -pedantic -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_THREAD_BUILD_DLL=1 -DBOOST_THREAD_DONT_USE_CHRONO -DBOOST_THREAD_POSIX -DNDEBUG -I"." -c -o "bin.v2/libs/thread/build/gcc-4.9.2/release/threading-multi/pthread/once.o" "libs/thread/src/pthread/once.cpp" ...failed gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.9.2/release/threading-multi/pthread/once.o... gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.9.2/release/threading-multi/future.o ...skipped <pbin.v2/libs/thread/build/gcc-4.9.2/release/threading-multi>libboost_thread.so.1.54.0 for lack of <pbin.v2/libs/thread/build/gcc-4.9.2/release/threading-multi>pthread/thread.o... ...skipped <p/usr/local/boost-1.54/lib>libboost_thread.so.1.54.0 for lack of <pbin.v2/libs/thread/build/gcc-4.9.2/release/threading-multi>libboost_thread.so.1.54.0... ...skipped <p/usr/local/boost-1.54/lib>libboost_thread.so for lack of <p/usr/local/boost-1.54/lib>libboost_thread.so.1.54.0... common.mkdir bin.v2/libs/system/build/gcc-4.9.2/release/link-static common.mkdir bin.v2/libs/system/build/gcc-4.9.2/release/link-static/threading-multi gcc.compile.c++ bin.v2/libs/system/build/gcc-4.9.2/release/link-static/threading-multi/error_code.o In file included from ./boost/system/error_code.hpp:15:0, from libs/system/src/error_code.cpp:19: ./boost/cstdint.hpp:300:49: warning: use of C++11 long long integer constant [-Wlong-long] # elif (defined(ULLONG_MAX) && ULLONG_MAX == 18446744073709551615ULL) || (defined(ULONG_LONG_MAX) && ULONG_LONG_MAX == 18446744073709551615ULL) || (defined(ULONGLONG_MAX) && ULONGLONG_MAX == 18446744073709551615ULL) ^ ./boost/cstdint.hpp:300:123: warning: use of C++11 long long integer constant [-Wlong-long] # elif (defined(ULLONG_MAX) && ULLONG_MAX == 18446744073709551615ULL) || (defined(ULONG_LONG_MAX) && ULONG_LONG_MAX == 18446744073709551615ULL) || (defined(ULONGLONG_MAX) && ULONGLONG_MAX == 18446744073709551615ULL) ^ In file included from ./boost/system/error_code.hpp:15:0, from libs/system/src/error_code.cpp:19: ./boost/cstdint.hpp:300:195: warning: use of C++11 long long integer constant [-Wlong-long] # elif (defined(ULLONG_MAX) && ULLONG_MAX == 18446744073709551615ULL) || (defined(ULONG_LONG_MAX) && ULONG_LONG_MAX == 18446744073709551615ULL) || (defined(ULONGLONG_MAX) && ULONGLONG_MAX == 18446744073709551615ULL) ^ gcc.archive bin.v2/libs/system/build/gcc-4.9.2/release/link-static/threading-multi/libboost_system.a common.copy /usr/local/boost-1.54/lib/libboost_system.a common.mkdir bin.v2/libs/thread/build/gcc-4.9.2/release/link-static common.mkdir bin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi common.mkdir bin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi/pthread gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi/pthread/thread.o In file included from ./boost/bind/bind.hpp:29:0, from ./boost/bind.hpp:22, from ./boost/thread/detail/thread.hpp:29, from ./boost/thread/thread_only.hpp:22, from libs/thread/src/pthread/thread.cpp:11: ./boost/bind/arg.hpp: In constructor ‘boost::arg::arg(const T&)’: ./boost/bind/arg.hpp:37:22: warning: typedef ‘T_must_be_placeholder’ locally defined but not used [-Wunused-local-typedefs] typedef char T_must_be_placeholder[ I == is_placeholder<T>::value? 1: -1 ]; ^ In file included from ./boost/atomic.hpp:12:0, from ./boost/thread/pthread/once_atomic.hpp:20, from ./boost/thread/once.hpp:20, from libs/thread/src/pthread/thread.cpp:17: ./boost/atomic/atomic.hpp: At global scope: ./boost/atomic/atomic.hpp:202:16: error: ‘uintptr_t’ was not declared in this scope typedef atomic<uintptr_t> atomic_uintptr_t; ^ ./boost/atomic/atomic.hpp:202:25: error: template argument 1 is invalid typedef atomic<uintptr_t> atomic_uintptr_t; ^ ./boost/atomic/atomic.hpp:202:43: error: invalid type in declaration before ‘;’ token typedef atomic<uintptr_t> atomic_uintptr_t; ^ In file included from ./boost/system/system_error.hpp:14:0, from ./boost/thread/exceptions.hpp:22, from ./boost/thread/pthread/thread_data.hpp:10, from ./boost/thread/thread_only.hpp:17, from libs/thread/src/pthread/thread.cpp:11: ./boost/system/error_code.hpp:222:36: warning: ‘boost::system::posix_category’ defined but not used [-Wunused-variable] static const error_category & posix_category = generic_category(); ^ ./boost/system/error_code.hpp:223:36: warning: ‘boost::system::errno_ecat’ defined but not used [-Wunused-variable] static const error_category & errno_ecat = generic_category(); ^ ./boost/system/error_code.hpp:224:36: warning: ‘boost::system::native_ecat’ defined but not used [-Wunused-variable] static const error_category & native_ecat = system_category(); ^ "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pedantic -pthread -Wextra -Wno-long-long -Wno-variadic-macros -Wunused-function -pedantic -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_STATIC_LINK=1 -DBOOST_THREAD_BUILD_LIB=1 -DBOOST_THREAD_DONT_USE_CHRONO -DBOOST_THREAD_POSIX -DNDEBUG -I"." -c -o "bin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi/pthread/thread.o" "libs/thread/src/pthread/thread.cpp" ...failed gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi/pthread/thread.o... gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi/pthread/once.o In file included from ./boost/bind/bind.hpp:29:0, from ./boost/bind.hpp:22, from ./boost/thread/pthread/once_atomic.hpp:19, from ./boost/thread/once.hpp:20, from libs/thread/src/pthread/./once_atomic.cpp:9, from libs/thread/src/pthread/once.cpp:8: ./boost/bind/arg.hpp: In constructor ‘boost::arg::arg(const T&)’: ./boost/bind/arg.hpp:37:22: warning: typedef ‘T_must_be_placeholder’ locally defined but not used [-Wunused-local-typedefs] typedef char T_must_be_placeholder[ I == is_placeholder<T>::value? 1: -1 ]; ^ In file included from ./boost/atomic.hpp:12:0, from ./boost/thread/pthread/once_atomic.hpp:20, from ./boost/thread/once.hpp:20, from libs/thread/src/pthread/./once_atomic.cpp:9, from libs/thread/src/pthread/once.cpp:8: ./boost/atomic/atomic.hpp: At global scope: ./boost/atomic/atomic.hpp:202:16: error: ‘uintptr_t’ was not declared in this scope typedef atomic<uintptr_t> atomic_uintptr_t; ^ ./boost/atomic/atomic.hpp:202:25: error: template argument 1 is invalid typedef atomic<uintptr_t> atomic_uintptr_t; ^ ./boost/atomic/atomic.hpp:202:43: error: invalid type in declaration before ‘;’ token typedef atomic<uintptr_t> atomic_uintptr_t; ^ "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pedantic -pthread -Wextra -Wno-long-long -Wno-variadic-macros -Wunused-function -pedantic -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_STATIC_LINK=1 -DBOOST_THREAD_BUILD_LIB=1 -DBOOST_THREAD_DONT_USE_CHRONO -DBOOST_THREAD_POSIX -DNDEBUG -I"." -c -o "bin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi/pthread/once.o" "libs/thread/src/pthread/once.cpp" ...failed gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi/pthread/once.o... gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi/future.o ...skipped <pbin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi>libboost_thread.a(clean) for lack of <pbin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi>pthread/thread.o... ...skipped <pbin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi>libboost_thread.a for lack of <pbin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi>pthread/thread.o... ...skipped <p/usr/local/boost-1.54/lib>libboost_thread.a for lack of <pbin.v2/libs/thread/build/gcc-4.9.2/release/link-static/threading-multi>libboost_thread.a... ...failed updating 4 targets... ...skipped 6 targets... ...updated 28 targets... [root@bengal boost_1_54_0]#

1 0

Reusing expressions::stream
by Florian Lindner 11 Aug '15

11 Aug '15

Hello, with boost log I have: using namespace boost::log; add_file_log ( "sample.log", keywords::format = ( expressions::stream << expressions::format_date_time<boost::posix_time::ptime>("TimeStamp", "%H:%M:%S") << " [Rank: "<< expressions::attr<int>("Rank") << "]" << ": " << expressions::message ) ); which works fine. Now that may be a maximum stupid questions. But when I want to reuse the format expressions for other uses, e.g. another sink, how can I do that? i.e. how to declare and use a variable that holds that expressions? :-/ Thanks, Florian

1 0

Dijkstra Algorithm Implementation Details
by Mayank Bakshi 11 Aug '15

11 Aug '15

2 1

Install header-only libraries
by Gonzalo BG 11 Aug '15

11 Aug '15

I'm trying to find in the docs what is the right way to install only the header-only libraries from a boost distribution without any luck. That is, I want to install everything that can be installed without having to compile anything. Is there an argument for `bootstrap.sh` or `b2` that does this? Best regards, Gonzalo

2 3

[units] Dimensionless? expecting length+length
by Michael Powell 11 Aug '15

11 Aug '15

Hello, I am working on some trajectory calculations, and having a strange compiler error. First, great that I should get a compiler error at all! Second, what am I missing? quantity<acceleration> g() { static const auto gValue = static_cast<double>(9.812); static const auto metersPerSecondPerSecond = meters / second / second; static const quantity<acceleration> g = gValue*metersPerSecondPerSecond; return g; } double Class1::CalculateZeta(double timeMilliseconds, double heightMeters) { static const auto two = static_cast<double>(2); static const auto milliseconds = milli*seconds; const auto t = timeMilliseconds*milliseconds; const auto h = heightMeters*meters; const auto g_ = g(); auto result = -(g_ / two)*(t*t) + h; return result.value(); } Just if I did the dimensional analysis, I might expect the time components (i.e. T^2) to cancel themselves out, which should leave me with length+length, no? This is exposed via a C++ CLR (VS2013), but the Boost.Units are done internally. What am I missing here? I need to normalize the units, say to meters, etc? Best regards, Michael Powell Errors: Error 4 error C2676: binary '+' : 'boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<Derived,boost::units::static_rational<1,1>>,boost::units::dimensionless_type>,boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<boost::units::si::meter_base_unit,boost::units::static_rational<1,1>>,boost::units::dimensionless_type>,boost::units::list<boost::units::dim<Derived,boost::units::static_rational<1,1>>,boost::units::dimensionless_type>,boost::units::list<boost::units::scale_list_dim<Scale>,boost::units::dimensionless_type>>>,void>,double>' does not define this operator or a conversion to a type acceptable to the predefined operator I:\Source\Spikes\Kingdom.Physics\src\Kingdom.Physics.Calculators\Class1.cpp 43 1 Kingdom.Physics.Calculators Error 2 error C2784: 'add_typeof_helper<boost::units::unit<Dim1,System1,void>,boost::units::unit<Dim2,System2,void>>::type boost::units::operator +(const boost::units::unit<Dim1,System1,void> &,const boost::units::unit<Dim2,System2,void> &)' : could not deduce template argument for 'const boost::units::unit<Dim1,System1,void> &' from 'boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<Derived,boost::units::static_rational<1,1>>,boost::units::dimensionless_type>,boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<boost::units::si::meter_base_unit,boost::units::static_rational<1,1>>,boost::units::dimensionless_type>,boost::units::list<boost::units::dim<Derived,boost::units::static_rational<1,1>>,boost::units::dimensionless_type>,boost::units::list<boost::units::scale_list_dim<Scale>,boost::units::dimensionless_type>>>,void>,double>' I:\Source\Spikes\Kingdom.Physics\src\Kingdom.Physics.Calculators\Class1.cpp 43 1 Kingdom.Physics.Calculators Error 3 error C2893: Failed to specialize function template 'add_typeof_helper<boost::units::quantity<Unit1,X>,boost::units::quantity<Unit2,Y>>::type boost::units::operator +(const boost::units::quantity<Unit1,X> &,const boost::units::quantity<Unit2,Y> &)' I:\Source\Spikes\Kingdom.Physics\src\Kingdom.Physics.Calculators\Class1.cpp 43 1 Kingdom.Physics.Calculators 5 IntelliSense: no operator "+" matches these operands operand types are: boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::length_base_dimension, boost::units::static_rational<1L, 1L>>, boost::units::dimensionless_type>, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<boost::units::si::meter_base_unit, boost::units::static_rational<1L, 1L>>, boost::units::dimensionless_type>, boost::units::list<boost::units::dim<boost::units::length_base_dimension, boost::units::static_rational<1L, 1L>>, boost::units::dimensionless_type>, boost::units::list<boost::units::scale_list_dim<boost::units::scale<10L, boost::units::static_rational<-6L, 1L>>>, boost::units::dimensionless_type>>>, void>, double> + const boost::units::quantity<boost::units::unit<boost::units::length_dimension, boost::units::si::system, void>, double> i:\Source\Spikes\Kingdom.Physics\src\Kingdom.Physics.Calculators\Class1.cpp 43 49 Kingdom.Physics.Calculators

3 7

Weighted graph file for Dijkstra algorithm
by Mayank Bakshi 11 Aug '15

11 Aug '15

1 0

[units] Calculating air density
by Michael Powell 10 Aug '15

10 Aug '15

Hello, I'd like to calculate air density at altitude. Studying some notes on wikipedia: https://en.wikipedia.org/wiki/Density_of_air Symbol is typically Greek Rho, whose dimensions are generally M/L^3; units will probably be kg/m^3, although I am also reading about slugs/ft^3. Which incorporates a gas constant value: http://en.wikipedia.org/wiki/Gas_constant Whose units appear to be Joules/(Volume*Temp). I'm not seeing anything too terribly exotic there; all these units / dimensions are present in Boost.Units? As is usually the case, it is interesting to see how the units library "reduces" the units during code writing, compilation. Very impressive indeed. Thank you... Best regards, Michael Powell

1 4

[units] github issues
by Michael Powell 10 Aug '15

10 Aug '15

Hello Units community, Please enable the Github issues. I've a clone of the repo and done so for mine. Also see reported issue as an example how to visualize: https://github.com/mwpowellhtx/units/issues/1 Kudos to http://latex.codecogs.com/ for a neat looking presentation. Thank you... Best regards, Michael Powell

1 0

1.59.0 rc2 is now available
by Marshall Clow 08 Aug '15

08 Aug '15

Release candidate files for 1.59.0 are available at: http://boost.cowic.de/rc/ (rc1 failed a smoke test) As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: MD5 (boost_1_59_0_rc2.7z) = 1854999b8d32ba89acbf4384fe55e0ab MD5 (boost_1_59_0_rc2.tar.bz2) = 1783f07dd4736ffd9fc97874ce4ef4bf MD5 (boost_1_59_0_rc2.tar.gz) = 47e6db09fd7e1265b9b7046f654e9a72 MD5 (boost_1_59_0_rc2.zip) = 9061c5bbc3399f3f220036e896c202aa Thanks! -- The release managers P.S. Release notes are here: http://www.boost.org/users/history/version_1_59_0.html

3 4

[units] Units-only git submodule usage
by Michael Powell 07 Aug '15

07 Aug '15

Hello, Here's a crazy question. I am exploring what to do with a simulation calculator, for dimensional analysis, dimensional safety, and potentially adopting Boost.Unit to help with that. What with the decomposition of Boost into Git Submodules, and since Boost.Units is header only (yes?), do I really need the whole library, or I could just adopt a Boost.Unit submodule and include it as appropriate? Thanks in advance... Best regards, Michael Powell

1 1

[signals2] can a combiner return the slot iterator range?
by Nick Stokes 06 Aug '15

06 Aug '15

I'd like a combiner to return the slot iterator as a range. 1. What is the type of the iterator? (any exposed meta function to get this? I couldn't see in the docs) 2. Are the itertors valid after the combiner returns? 3. Is this already possible without a custom combiner? E.g. template<class T> struct MyRangeCombiner { typedef boost::iterator_range< some_meta<T>::type > result_type; template<class It> result_type operator()(It begin, It end) const { return boost::make_iterator_range(begin,end); } }; class ComboSlot { public: void method1(int i) {..} void method2(double d) {..} }; boost::signals2::signal< ComboSlot&() , MyRangeCombiner<ComboSlot> > sig; // in use for( ComboSlot& cs : sig() ) { cs.method1(3); cs.method2(3.14); } A broader picture is the following: More often than not I have a family of events (signals). The slots are connected in groups, such as the the ComboSlot above. One straightforward implementation is to maintain different signals for every method: ComboSlot cs; boost::signals2::signal< void(int) > sigMethod1; boost::signals2::signal< void(double) > sigMethod2; sigMethod1.connect( &ComboSlot::method1, _1 ); sigMethod2.connect( &ComboSlot::method2, _1 ); ... There is quite a bit of waste associated with above. Not only it requires more code, but also we know for sure that if method1 is connected, so will method2, and they will be connected to slots who calls the corresponding method on the same ComboSlot. One other alternative is to write a combiner which loops and calls the method within operator(). Returning a range would be a better alternative. Thanks Nick

2 5

Bad interaction between lexical_cast and MPL with VS2013
by Roger Leigh 06 Aug '15

06 Aug '15

Hi folks, I have some code making use of both Boost MPL (and Variant) with occasional use of lexical_cast in some translation units. This is working fine on Linux/Unix/MacOS X with a wide range of GCC and clang versions. However, when porting to Windows with MS Visual Studio 2013 and Boost 1.58, I've encountered an unexpected and subtle interaction with the MPL and Boost headers. If I include them in the "wrong" order it leads to bizarre compile errors. After many hours of testing, I've reduced the failure down to the minimal testcase below. In the code sample below, there are two #includes for boost/lexical_cast.hpp. If the first is uncommented, compiling fails. If this is commented and the second is uncommented, compiling succeeds! The odd thing: the critical place is before and after defining BOOST_MPL_LIMIT_VECTOR_SIZE. In the failure case the limit size is 20, when succeeding it's 40. The code below requires more than 20 to successfully compile. While it's fairly obvious with hindsight that lexical_cast is indirectly including boost/mpl/limits/vector.hpp which is defaulting the limit to 20, the fact that the behaviour is differing between compilers is a bit unexpected, particularly since I don't want to mess with the limit if already set in case the users of my library need a higher limit, but they might have used lexical_cast themselves. Has anyone else run into this type of problem before? It's also made me realise that using variant with MPL lists might be problematic if the end user changes the limit and this changes the underlying type? Should I just use vector40.hpp and ignore the limit? If I did this, do I need to worry about the intermediate types in the code below, or do I just need to use vector40 in place of vector<> (or in place of vector0<>)--I'm unsure how insert_range knows which type to use or is it vector0 in this case and I should be "allocating" space by using a different type? [I am using vector<> in reality but tried vector0 here to see if it made a difference] Thanks all, Roger ----source-------------------------------------------------------------- #include <string> #include <vector> #include <cstdint> # ifndef BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS /// Disable MPL header preprocessing (to allow the following macros to be modified). # define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS # endif #include <boost/lexical_cast.hpp> # ifndef BOOST_MPL_LIMIT_VECTOR_SIZE /// MPL vector size limit increase. # define BOOST_MPL_LIMIT_VECTOR_SIZE 40 # endif //#include <boost/lexical_cast.hpp> # ifndef BOOST_MPL_LIMIT_LIST_SIZE /// MPL list size limit increase. # define BOOST_MPL_LIMIT_LIST_SIZE 40 # endif #include <boost/mpl/insert_range.hpp> #include <boost/mpl/joint_view.hpp> #include <boost/mpl/transform_view.hpp> #include <boost/mpl/vector.hpp> #include <boost/mpl/vector/vector0.hpp> #include <boost/version.hpp> #if BOOST_VERSION >= 105800 # include <boost/type_traits/remove_cv.hpp> #endif typedef boost::mpl::vector<std::string, bool> non_numeric_types; typedef boost::mpl::vector<uint8_t, uint16_t, uint32_t, uint64_t, int8_t, int16_t, int32_t, int64_t> integer_types; typedef boost::mpl::vector<float, double, long double> float_types; typedef boost::mpl::joint_view<integer_types, float_types>::type numeric_types_view; typedef boost::mpl::joint_view<non_numeric_types, numeric_types_view>::type basic_types_view; template<typename T> struct make_vector { typedef std::vector<T> type; }; typedef boost::mpl::transform_view<basic_types_view, make_vector<boost::mpl::_1> >::type list_types_view; typedef boost::mpl::joint_view<basic_types_view, list_types_view> all_types_view; typedef boost::mpl::insert_range<boost::mpl::vector0<>, boost::mpl::end<boost::mpl::vector0<> >::type, all_types_view>::type discriminated_types; ------------------------------------------------------------------------ ----error log----------------------------------------------------------- 1> Environment Variables passed to tool: 1> VS_UNICODE_OUTPUT=1500 1> C:\Program Files (x86)\Microsoft Visual Studio 12.0\VC\bin\x86_amd64\CL.exe /c /I"D:\bioformats\cpp\cmake\..\ext\gtest-1.7.0\include" /ID:\bioformats\cpp\lib /I"D:\bioformats\v1\bioformats-build\cpp\lib" /I"D:\bioformats\v1\superbuild-install\include\boost-1_58" /I"D:\bioformats\v1\superbuild-install\include" /Zi /nologo /W3 /WX- /Od /Ob0 /D WIN32 /D _WINDOWS /D _DEBUG /D BOOST_ALL_DYN_LINK /D BOOST_ALL_NO_LIB /D _CRT_SECURE_NO_WARNINGS /D "CMAKE_INTDIR=\"Debug\"" /D _MBCS /Gm- /EHsc /RTC1 /MDd /GS /fp:precise /Zc:wchar_t /Zc:forScope /GR /Fo"testinclude.dir\Debug\\" /Fd"testinclude.dir\Debug\vc120.pdb" /Gd /TP /errorReport:prompt /bigobj "D:\bioformats\cpp\test\ome-bioformats\testinclude.cpp" 1> Tracking command: 1> C:\Program Files (x86)\MSBuild\12.0\bin\Tracker.exe /d "C:\Program Files (x86)\MSBuild\12.0\bin\FileTracker.dll" /i D:\bioformats\v1\bioformats-build\cpp\test\ome-bioformats\testinclude.dir\Debug\testinclude.tlog /r D:\BIOFORMATS\CPP\TEST\OME-BIOFORMATS\TESTINCLUDE.CPP /b MSBuildConsole_CancelEventa3d26d0a2f3141fdad0e9cdd682fa900 /c "C:\Program Files (x86)\Microsoft Visual Studio 12.0\VC\bin\x86_amd64\CL.exe" /c /I"D:\bioformats\cpp\cmake\..\ext\gtest-1.7.0\include" /ID:\bioformats\cpp\lib /I"D:\bioformats\v1\bioformats-build\cpp\lib" /I"D:\bioformats\v1\superbuild-install\include\boost-1_58" /I"D:\bioformats\v1\superbuild-install\include" /Zi /nologo /W3 /WX- /Od /Ob0 /D WIN32 /D _WINDOWS /D _DEBUG /D BOOST_ALL_DYN_LINK /D BOOST_ALL_NO_LIB /D _CRT_SECURE_NO_WARNINGS /D "CMAKE_INTDIR=\"Debug\"" /D _MBCS /Gm- /EHsc /RTC1 /MDd /GS /fp:precise /Zc:wchar_t /Zc:forScope /GR /Fo"testinclude.dir\Debug\\" /Fd"testinclude.dir\Debug\vc120.pdb" /Gd /TP /errorReport:prompt /bigobj "D:\bioformats\cpp\test\ome-bioformats\testinclude.cpp" 1> testinclude.cpp 1>D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/push_front_impl.hpp(45): error C2664: 'int boost::mpl::assertion_failed<false>(boost::mpl::assert<false>::type)' : cannot convert argument 1 from 'boost::mpl::failed ************(__cdecl boost::mpl::push_front_impl<boost::mpl::aux::vector_tag<20>>::apply<Sequence,T>::REQUESTED_PUSH_FRONT_SPECIALIZATION_FOR_SEQUENCE_DOES_NOT_EXIST::* ***********)(Sequence)' to 'boost::mpl::assert<false>::type' 1> with 1> [ 1> Sequence=boost::mpl::vector20<signed char,short,int,__int64,float,double,long double,std::vector<std::basic_string<char,std::char_traits<char>,std::allocator<char>>,std::allocator<std::basic_string<char,std::char_traits<char>,std::allocator<char>>>>,std::vector<bool,std::allocator<bool>>,std::vector<unsigned char,std::allocator<unsigned char>>,std::vector<unsigned short,std::allocator<char16_t>>,std::vector<unsigned int,std::allocator<char32_t>>,std::vector<unsigned __int64,std::allocator<unsigned __int64>>,std::vector<signed char,std::allocator<signed char>>,std::vector<short,std::allocator<short>>,std::vector<int,std::allocator<int>>,std::vector<__int64,std::allocator<__int64>>,std::vector<float,std::allocator<float>>,std::vector<double,std::allocator<double>>,std::vector<long double,std::allocator<long double>>> 1> , T=unsigned __int64 1> ] 1> No constructor could take the source type, or constructor overload resolution was ambiguous 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/push_front.hpp(32) : see reference to class template instantiation 'boost::mpl::push_front_impl<boost::mpl::aux::vector_tag<20>>::apply<Sequence,T>' being compiled 1> with 1> [ 1> Sequence=boost::mpl::vector20<signed char,short,int,__int64,float,double,long double,std::vector<std::basic_string<char,std::char_traits<char>,std::allocator<char>>,std::allocator<std::basic_string<char,std::char_traits<char>,std::allocator<char>>>>,std::vector<bool,std::allocator<bool>>,std::vector<unsigned char,std::allocator<unsigned char>>,std::vector<unsigned short,std::allocator<char16_t>>,std::vector<unsigned int,std::allocator<char32_t>>,std::vector<unsigned __int64,std::allocator<unsigned __int64>>,std::vector<signed char,std::allocator<signed char>>,std::vector<short,std::allocator<short>>,std::vector<int,std::allocator<int>>,std::vector<__int64,std::allocator<__int64>>,std::vector<float,std::allocator<float>>,std::vector<double,std::allocator<double>>,std::vector<long double,std::allocator<long double>>> 1> , T=unsigned __int64 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/push_front.hpp(47) : see reference to class template instantiation 'boost::mpl::push_front<T1,T2>' being compiled 1> with 1> [ 1> T1=boost::mpl::vector20<signed char,short,int,__int64,float,double,long double,std::vector<std::basic_string<char,std::char_traits<char>,std::allocator<char>>,std::allocator<std::basic_string<char,std::char_traits<char>,std::allocator<char>>>>,std::vector<bool,std::allocator<bool>>,std::vector<unsigned char,std::allocator<unsigned char>>,std::vector<unsigned short,std::allocator<char16_t>>,std::vector<unsigned int,std::allocator<char32_t>>,std::vector<unsigned __int64,std::allocator<unsigned __int64>>,std::vector<signed char,std::allocator<signed char>>,std::vector<short,std::allocator<short>>,std::vector<int,std::allocator<int>>,std::vector<__int64,std::allocator<__int64>>,std::vector<float,std::allocator<float>>,std::vector<double,std::allocator<double>>,std::vector<long double,std::allocator<long double>>> 1> , T2=unsigned __int64 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/apply_wrap.hpp(145) : see reference to class template instantiation 'boost::mpl::push_front<boost::mpl::na,boost::mpl::na>::apply<T1,T2,boost::mpl::na,boost::mpl::na,boost::mpl::na>' being compiled 1> with 1> [ 1> T1=boost::mpl::vector20<signed char,short,int,__int64,float,double,long double,std::vector<std::basic_string<char,std::char_traits<char>,std::allocator<char>>,std::allocator<std::basic_string<char,std::char_traits<char>,std::allocator<char>>>>,std::vector<bool,std::allocator<bool>>,std::vector<unsigned char,std::allocator<unsigned char>>,std::vector<unsigned short,std::allocator<char16_t>>,std::vector<unsigned int,std::allocator<char32_t>>,std::vector<unsigned __int64,std::allocator<unsigned __int64>>,std::vector<signed char,std::allocator<signed char>>,std::vector<short,std::allocator<short>>,std::vector<int,std::allocator<int>>,std::vector<__int64,std::allocator<__int64>>,std::vector<float,std::allocator<float>>,std::vector<double,std::allocator<double>>,std::vector<long double,std::allocator<long double>>> 1> , T2=unsigned __int64 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/apply.hpp(154) : see reference to class template instantiation 'boost::mpl::apply_wrap2<boost::mpl::lambda<F,boost::mpl::void_>::type,T1,T2>' being compiled 1> with 1> [ 1> F=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> , T1=boost::mpl::vector20<signed char,short,int,__int64,float,double,long double,std::vector<std::basic_string<char,std::char_traits<char>,std::allocator<char>>,std::allocator<std::basic_string<char,std::char_traits<char>,std::allocator<char>>>>,std::vector<bool,std::allocator<bool>>,std::vector<unsigned char,std::allocator<unsigned char>>,std::vector<unsigned short,std::allocator<char16_t>>,std::vector<unsigned int,std::allocator<char32_t>>,std::vector<unsigned __int64,std::allocator<unsigned __int64>>,std::vector<signed char,std::allocator<signed char>>,std::vector<short,std::allocator<short>>,std::vector<int,std::allocator<int>>,std::vector<__int64,std::allocator<__int64>>,std::vector<float,std::allocator<float>>,std::vector<double,std::allocator<double>>,std::vector<long double,std::allocator<long double>>> 1> , T2=unsigned __int64 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(151) : see reference to class template instantiation 'boost::mpl::apply2<BackwardOp,boost::mpl::vector20<T,short,int,__int64,float,double,long double,std::vector<std::basic_string<char,std::char_traits<char>,std::allocator<char>>,std::allocator<_Ty>>,std::vector<bool,std::allocator<bool>>,std::vector<unsigned char,std::allocator<unsigned char>>,std::vector<unsigned short,std::allocator<char16_t>>,std::vector<unsigned int,std::allocator<char32_t>>,std::vector<unsigned __int64,std::allocator<unsigned __int64>>,std::vector<T,std::allocator<signed char>>,std::vector<short,std::allocator<short>>,std::vector<int,std::allocator<int>>,std::vector<__int64,std::allocator<__int64>>,std::vector<float,std::allocator<float>>,std::vector<double,std::allocator<double>>,std::vector<long double,std::allocator<long double>>>,unsigned __int64>' being compiled 1> with 1> [ 1> BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> , T=signed char 1> , _Ty=std::basic_string<char,std::char_traits<char>,std::allocator<char>> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(149) : see reference to class template instantiation 'boost::mpl::aux::reverse_fold_impl<-1,boost::mpl::joint_iter<L1,L1,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,3>,boost::mpl::v_iter<Vector,8>,I2>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,0>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,0>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,0>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>, 2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mp l ::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>>,Last,boost::mpl::vector0<boost::mpl::na>,BackwardOp,ForwardOp>' being compiled 1> with 1> [ 1> L1=boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0> 1> , T0=std::string 1> , T1=bool 1> , Vector=boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t> 1> , I2=boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,0> 1> , T2=long double 1> , F=make_vector 1> , Tag=boost::mpl::void_ 1> , Last=boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<make_vector,boost::mpl::void_>,boost::mpl::arg<1>>,0>>>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<make_vector,boost::mpl::void_>,boost::mpl::arg<1>>,0>>>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>> 1> , BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> , ForwardOp=boost::mpl::arg<1> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(149) : see reference to class template instantiation 'boost::mpl::aux::reverse_fold_impl<-1,boost::mpl::joint_iter<L1,L1,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,2>,boost::mpl::v_iter<Vector,8>,I2>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,0>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,0>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,0>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>, 2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mp l ::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>>,Last,boost::mpl::vector0<boost::mpl::na>,BackwardOp,ForwardOp>' being compiled 1> with 1> [ 1> L1=boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0> 1> , T0=std::string 1> , T1=bool 1> , Vector=boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t> 1> , I2=boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,0> 1> , T2=long double 1> , F=make_vector 1> , Tag=boost::mpl::void_ 1> , Last=boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<make_vector,boost::mpl::void_>,boost::mpl::arg<1>>,0>>>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<make_vector,boost::mpl::void_>,boost::mpl::arg<1>>,0>>>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>> 1> , BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> , ForwardOp=boost::mpl::arg<1> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(149) : see reference to class template instantiation 'boost::mpl::aux::reverse_fold_impl<-1,boost::mpl::joint_iter<L1,L1,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,1>,boost::mpl::v_iter<Vector,8>,I2>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,0>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,0>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,0>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>, 2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mp l ::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<Vector,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,T2>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>>,Last,boost::mpl::vector0<boost::mpl::na>,BackwardOp,ForwardOp>' being compiled 1> with 1> [ 1> L1=boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0> 1> , T0=std::string 1> , T1=bool 1> , Vector=boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t> 1> , I2=boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,0> 1> , T2=long double 1> , F=make_vector 1> , Tag=boost::mpl::void_ 1> , Last=boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<make_vector,boost::mpl::void_>,boost::mpl::arg<1>>,0>>>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<make_vector,boost::mpl::void_>,boost::mpl::arg<1>>,0>>>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>> 1> , BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> , ForwardOp=boost::mpl::arg<1> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(149) : see reference to class template instantiation 'boost::mpl::aux::reverse_fold_impl<-1,boost::mpl::joint_iter<L1,L1,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,I2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,0>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,0>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,0>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>>,Last,boost::mpl::vector0<boost::mpl::na>,BackwardOp,ForwardOp>' being compiled 1> with 1> [ 1> L1=boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0> 1> , T0=std::string 1> , T1=bool 1> , I2=boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,0>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,0>> 1> , T2=uint32_t 1> , T3=uint64_t 1> , T4=int8_t 1> , T5=int16_t 1> , T6=int32_t 1> , T7=int64_t 1> , F=make_vector 1> , Tag=boost::mpl::void_ 1> , Last=boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<make_vector,boost::mpl::void_>,boost::mpl::arg<1>>,0>>>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<make_vector,boost::mpl::void_>,boost::mpl::arg<1>>,0>>>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>> 1> , BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> , ForwardOp=boost::mpl::arg<1> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(149) : see reference to class template instantiation 'boost::mpl::aux::reverse_fold_impl<-1,boost::mpl::joint_iter<L1,L1,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<Vector,1>,boost::mpl::v_iter<Vector,2>,I2>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,2>,boost::mpl::v_iter<Vector,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<Vector,0>,boost::mpl::v_iter<Vector,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,0>,boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,0>>>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,2>,boost::mpl::v_iter<Vector,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<Vector,2>,boost::mpl::v_iter<Vector,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,2>,boost::mpl::v_iter<Vector,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<Vector,2>,boost::mpl::v_iter<Vector,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<Vector,2>,boost::mpl::v_iter<Vector,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<T0,T1,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>>,Last,boost::mpl::vector0<boost::mpl::na>,BackwardOp,ForwardOp>' being compiled 1> with 1> [ 1> L1=boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0> 1> , Vector=boost::mpl::vector2<std::string,bool> 1> , I2=boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,0>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,0>> 1> , T0=uint8_t 1> , T1=uint16_t 1> , T2=uint32_t 1> , T3=uint64_t 1> , T4=int8_t 1> , T5=int16_t 1> , T6=int32_t 1> , T7=int64_t 1> , F=make_vector 1> , Tag=boost::mpl::void_ 1> , Last=boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<make_vector,boost::mpl::void_>,boost::mpl::arg<1>>,0>>>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::v_iter<boost::mpl::vector2<std::string,bool>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector8<uint8_t,uint16_t,uint32_t,uint64_t,int8_t,int16_t,int32_t,int64_t>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<make_vector,boost::mpl::void_>,boost::mpl::arg<1>>,0>>>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>> 1> , BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> , ForwardOp=boost::mpl::arg<1> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/reverse_fold.hpp(41) : see reference to class template instantiation 'boost::mpl::aux::reverse_fold_impl<-1,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,0>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,0>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,0>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,0>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,0>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,0>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::joint_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::aux::transform_iter<boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::v_iter<boost::mpl::vector2<T0,T1>,2>,boost::mpl::joint_iter<boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector8<unsigned char,unsigned short,T2,T3,T4,T5,T6,T7>,8>,boost::mpl::v_iter<boost::mpl::vector3<float,double,long double>,3>>>,boost::mpl::protect<boost::mpl::bind1<boost::mpl::quote1<F,Tag>,boost::mpl::arg<1>>,0>>>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>>,State,BackwardOp,ForwardOp>' being compiled 1> with 1> [ 1> T0=std::string 1> , T1=bool 1> , T2=uint32_t 1> , T3=uint64_t 1> , T4=int8_t 1> , T5=int16_t 1> , T6=int32_t 1> , T7=int64_t 1> , F=make_vector 1> , Tag=boost::mpl::void_ 1> , State=boost::mpl::vector0<boost::mpl::na> 1> , BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> , ForwardOp=boost::mpl::arg<1> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/copy.hpp(49) : see reference to class template instantiation 'boost::mpl::reverse_fold<Sequence,boost::mpl::vector0<boost::mpl::na>,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>,boost::mpl::arg<1>>' being compiled 1> with 1> [ 1> Sequence=boost::mpl::joint_view<boost::mpl::iterator_range<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>,boost::mpl::joint_view<all_types_view,boost::mpl::iterator_range<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>>> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/copy.hpp(54) : see reference to class template instantiation 'boost::mpl::aux::reverse_copy_impl<P1,P2>' being compiled 1> with 1> [ 1> P1=boost::mpl::joint_view<boost::mpl::iterator_range<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>,boost::mpl::joint_view<all_types_view,boost::mpl::iterator_range<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>>>> 1> , P2=boost::mpl::front_inserter<boost::mpl::clear_impl<boost::mpl::aux::vector_tag<0>>::apply<boost::mpl::vector0<boost::mpl::na>>::type> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/insert_range_impl.hpp(56) : see reference to class template instantiation 'boost::mpl::reverse_copy<boost::mpl::joint_view<boost::mpl::iterator_range<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,Pos>,boost::mpl::joint_view<Range,boost::mpl::iterator_range<boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,Pos>>>,boost::mpl::front_inserter<boost::mpl::clear_impl<boost::mpl::aux::vector_tag<0>>::apply<Sequence>::type>>' being compiled 1> with 1> [ 1> Pos=boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0> 1> , Range=all_types_view 1> , Sequence=boost::mpl::vector0<boost::mpl::na> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/insert_range.hpp(33) : see reference to class template instantiation 'boost::mpl::insert_range_impl<boost::mpl::aux::vector_tag<0>>::apply<Sequence,Pos,Range>' being compiled 1> with 1> [ 1> Sequence=boost::mpl::vector0<boost::mpl::na> 1> , Pos=boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0> 1> , Range=all_types_view 1> ] 1> D:\bioformats\cpp\test\ome-bioformats\testinclude.cpp(63) : see reference to class template instantiation 'boost::mpl::insert_range<boost::mpl::vector0<boost::mpl::na>,boost::mpl::v_iter<boost::mpl::vector0<boost::mpl::na>,0>,all_types_view>' being compiled 1>D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(151): error C2039: 'type' : is not a member of 'boost::mpl::apply2<BackwardOp,boost::mpl::vector20<T,short,int,__int64,float,double,long double,std::vector<std::basic_string<char,std::char_traits<char>,std::allocator<char>>,std::allocator<_Ty>>,std::vector<bool,std::allocator<bool>>,std::vector<unsigned char,std::allocator<unsigned char>>,std::vector<unsigned short,std::allocator<char16_t>>,std::vector<unsigned int,std::allocator<char32_t>>,std::vector<unsigned __int64,std::allocator<unsigned __int64>>,std::vector<T,std::allocator<signed char>>,std::vector<short,std::allocator<short>>,std::vector<int,std::allocator<int>>,std::vector<__int64,std::allocator<__int64>>,std::vector<float,std::allocator<float>>,std::vector<double,std::allocator<double>>,std::vector<long double,std::allocator<long double>>>,unsigned __int64>' 1> with 1> [ 1> BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> , T=signed char 1> , _Ty=std::basic_string<char,std::char_traits<char>,std::allocator<char>> 1> ] 1>D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(151): error C3203: 'type' : unspecialized class template can't be used as a template argument for template parameter 'T1', expected a real type 1>D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/push_front.hpp(31): error C2903: 'apply' : symbol is neither a class template nor a function template 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/push_front.hpp(47) : see reference to class template instantiation 'boost::mpl::push_front<T1,T2>' being compiled 1> with 1> [ 1> T1=int 1> , T2=unsigned int 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/apply_wrap.hpp(145) : see reference to class template instantiation 'boost::mpl::push_front<boost::mpl::na,boost::mpl::na>::apply<T1,T2,boost::mpl::na,boost::mpl::na,boost::mpl::na>' being compiled 1> with 1> [ 1> T1=int 1> , T2=unsigned int 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/apply.hpp(154) : see reference to class template instantiation 'boost::mpl::apply_wrap2<boost::mpl::lambda<F,boost::mpl::void_>::type,T1,T2>' being compiled 1> with 1> [ 1> F=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> , T1=int 1> , T2=unsigned int 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(151) : see reference to class template instantiation 'boost::mpl::apply2<BackwardOp,int,unsigned int>' being compiled 1> with 1> [ 1> BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> ] 1>D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/push_front.hpp(31): error C2039: 'apply' : is not a member of 'boost::mpl::push_front_impl<boost::mpl::non_sequence_tag>' 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/push_front_impl.hpp(66) : see declaration of 'boost::mpl::push_front_impl<boost::mpl::non_sequence_tag>' 1>D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/push_front.hpp(31): error C2955: 'boost::mpl::apply' : use of class template requires template argument list 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/apply.hpp(188) : see declaration of 'boost::mpl::apply' 1>D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/push_front.hpp(31): error C2143: syntax error : missing ',' before '<' 1>D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(151): error C2039: 'type' : is not a member of 'boost::mpl::apply2<BackwardOp,int,unsigned int>' 1> with 1> [ 1> BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/push_front_impl.hpp(66) : see declaration of 'boost::mpl::push_front_impl<boost::mpl::non_sequence_tag>' 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/apply.hpp(188) : see declaration of 'boost::mpl::apply' 1>D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(151): error C2039: 'type' : is not a member of 'boost::mpl::apply2<BackwardOp,int,unsigned short>' 1> with 1> [ 1> BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/push_front_impl.hpp(66) : see declaration of 'boost::mpl::push_front_impl<boost::mpl::non_sequence_tag>' 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/apply.hpp(188) : see declaration of 'boost::mpl::apply' 1>D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(151): error C2039: 'type' : is not a member of 'boost::mpl::apply2<BackwardOp,int,unsigned char>' 1> with 1> [ 1> BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/push_front_impl.hpp(66) : see declaration of 'boost::mpl::push_front_impl<boost::mpl::non_sequence_tag>' 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/apply.hpp(188) : see declaration of 'boost::mpl::apply' 1>D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(151): error C2039: 'type' : is not a member of 'boost::mpl::apply2<BackwardOp,int,bool>' 1> with 1> [ 1> BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> ] 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/push_front_impl.hpp(66) : see declaration of 'boost::mpl::push_front_impl<boost::mpl::non_sequence_tag>' 1> D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/apply.hpp(188) : see declaration of 'boost::mpl::apply' 1>D:\bioformats\v1\superbuild-install\include\boost-1_58\boost/mpl/aux_/reverse_fold_impl_body.hpp(151): error C2039: 'type' : is not a member of 'boost::mpl::apply2<BackwardOp,int,std::basic_string<char,std::char_traits<char>,std::allocator<char>>>' 1> with 1> [ 1> BackwardOp=boost::mpl::push_front<boost::mpl::na,boost::mpl::na> 1> ] 1> The command exited with code 2. ------------------------------------------------------------------------

2 3

[Interprocess] or [Container]: Error with internally in rbtree_best_fit deallocation
by David Schneider 05 Aug '15

05 Aug '15

Hello, I've been upgrading a Windows 3.0 industrial control suite that relies heavily on GlobalAlloc() etc. I've used Boost's IPC functions to create a replacement that works very, very well for multiple applications so far. I'm using Boost 1.57 or 1.58, both exhibit the same behavior, across Windows 7, 8.1 & 10 64-bit, with 32-bit applications, compiled in Visual Studio 2013. All code displayed is from 1.58 but I don't see it being materially different from 1.57 in this case. Unfortunately, I've come up against an issue I can't best. 6 or 7 of the applications are working more or less without hitches, but I've come to port the last one and rbtree_best_fit is messing up pretty badly. It happens during a destruct operation on a vector. It always, always happens on the same vector, and I can even watch all operations on it by pre-allocating it large because rbtree_best_fit will reliably assign the same address (in every application, a 64mb memory pool is mapped into the same address space) What happens is the vector gets constructed with a UUID generated by Boost as its identifier. (A handle including a pointer to said vector goes into an interprocess map, but that's another story). Here's the typedefs used to create the memory pool & vector: namespace ipc = boost::interprocess; typedef ipc::managed_windows_shared_memory managed_pool_t; typedef managed_pool_t::segment_manager managed_pool_segment_manager_t; typedef ipc::allocator < char, managed_pool_segment_manager_t > managed_pool_allocator_t; typedef ipc::vector< char, managed_pool_allocator_t > GLE_handle_vector_t; How it is constructed: GLE_handle_vector_t *foo; foo = _managed_pool->construct<GLE_handle_vector_t>(uuid_str)(_managed_pool->get_segment_manager()); foo->resize((GLE_handle_vector_t::size_type)dwBytes); // dwBytes has some added to it in this case to prevent the need to re-allocate the vector's data buffer Later on it is resized at least 12 times: mvector->resize(dwBytes); Then something goes to free it. _managed_pool->destroy<GLE_handle_vector_t>(UUID); Keep in mind that this has worked for 6 other programs all sharing memory at the same time over at least a hundred hours of running-time so far. Yes, I have checked that the UUID is correct. I get, of course, an extremely long template error. I'll include it at the end. The relevant part is this: > w16gle.dll!boost::interprocess::operator<(const boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl & a, const boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl & b) Line 126 C++ The offending line is: { return a.m_size < b.m_size; } Going into the immediate window, &a 0x700a434c {...} boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::SizeHolder: {m_prev_size=??? m_size=??? m_prev_allocated=??? ...} boost::intrusive::generic_hook<boost::intrusive::rbtree_algorithms<boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1> >,boost::intrusive::dft_tag,0,3>: {...} &b 0x3f09bed8 {...} boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::SizeHolder: {m_prev_size=0 m_size=513 m_prev_allocated=1 ...} boost::intrusive::generic_hook<boost::intrusive::rbtree_algorithms<boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1> >,boost::intrusive::dft_tag,0,3>: {...} B's address is correct. I have no idea where it is getting A's address, especially since it is passed by reference. Inspecting the memory all around that location reveals that it is not allocated. My understanding is that at this point the code is trying to merge this block with the next free one, but that's as far as I got understanding it. I've tried tracing the call stack thoroughly but it goes through some "external code" on the call stack just before this error. w16gle.dll!boost::interprocess::operator<(const boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl & a, const boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl & b) Line 126 C++ *_[External Code]_* w16gle.dll!boost::intrusive::detail::key_nodeptr_comp<std::less<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl>,boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3> >::operator()<boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0>,boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> >(const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & key1, const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & key2) Line 78 C++ _I would be happy to just use the simple_seq_fit allocator to avoid this bug_, since it would do fine for this, but when I typedef it... namespace boost { namespace interprocess { typedef basic_managed_windows_shared_memory<char, simple_seq_fit<mutex_family>, iset_index> managed_windows_shared_seq_memory; } } and use it, I get compilation errors: c:\boost\include\boost-1_58\boost\interprocess\managed_windows_shared_memory.hpp(45): error C2027: use of undefined type 'boost::interprocess::simple_seq_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,ptrdiff_t,size_t,0>>' 1> c:\boost\include\boost-1_58\boost\interprocess\managed_windows_shared_memory.hpp(70) : see reference to class template instantiation 'boost::interprocess::ipcdetail::wshmem_open_or_create<AllocationAlgorithm>' being compiled 1> with .... there's over 100 of them. No way I'm figuring that out. Please help me. Is there some way to troubleshoot what rbtree_best_fit is doing wrong? If a Boost developer wants to have a private discussion with me on the matter please feel free to contact me, since there's obviously a bug somewhere, I might be open to that. Alternatively, how do I get the seq_best_fit to work? Thank you for your help! Here is the whole call stack during the access violation with rbtree_best_fit that I referred to above. > w16gle.dll!boost::interprocess::operator<(const boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl & a, const boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl & b) Line 126 C++ [External Code] w16gle.dll!boost::intrusive::detail::key_nodeptr_comp<std::less<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl>,boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3> >::operator()<boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0>,boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> >(const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & key1, const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & key2) Line 78 C++ w16gle.dll!boost::intrusive::bstree_algorithms<boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1> >::insert_equal_lower_bound_check<boost::intrusive::detail::key_nodeptr_comp<std::less<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl>,boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3> > >(const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & h, const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & new_node, boost::intrusive::detail::key_nodeptr_comp<std::less<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl>,boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3> > comp, boost::intrusive::insert_commit_data_t<boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> > & commit_data, unsigned int * pdepth) Line 1692 C++ w16gle.dll!boost::intrusive::bstree_algorithms<boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1> >::insert_equal_check<boost::intrusive::detail::key_nodeptr_comp<std::less<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl>,boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3> > >(const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & header, const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & hint, const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & new_node, boost::intrusive::detail::key_nodeptr_comp<std::less<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl>,boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3> > comp, boost::intrusive::insert_commit_data_t<boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> > & commit_data, unsigned int * pdepth) Line 1657 C++ w16gle.dll!boost::intrusive::bstree_algorithms<boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1> >::insert_equal<boost::intrusive::detail::key_nodeptr_comp<std::less<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl>,boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3> > >(const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & h, const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & hint, const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & new_node, boost::intrusive::detail::key_nodeptr_comp<std::less<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl>,boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3> > comp, unsigned int * pdepth) Line 1121 C++ w16gle.dll!boost::intrusive::rbtree_algorithms<boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1> >::insert_equal<boost::intrusive::detail::key_nodeptr_comp<std::less<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl>,boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3> > >(const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & header, const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & hint, const boost::interprocess::offset_ptr<boost::intrusive::compact_rbtree_node<boost::interprocess::offset_ptr<void,int,unsigned int,0> >,int,unsigned int,0> & new_node, boost::intrusive::detail::key_nodeptr_comp<std::less<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl>,boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3> > comp) Line 374 C++ w16gle.dll!boost::intrusive::bstree_impl<boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3>,void,unsigned int,1,5,void>::insert_equal(boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3>,1> hint, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl & value) Line 1039 C++ w16gle.dll!boost::intrusive::multiset_impl<boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3>,void,unsigned int,1,void>::insert(boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl,boost::intrusive::rbtree_node_traits<boost::interprocess::offset_ptr<void,int,unsigned int,0>,1>,0,boost::intrusive::dft_tag,3>,1> hint, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::block_ctrl & value) Line 656 C++ w16gle.dll!boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::priv_deallocate(void * addr) Line 1390 C++ w16gle.dll!boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>::deallocate(void * addr) Line 1321 C++ w16gle.dll!boost::interprocess::segment_manager_base<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0> >::deallocate(void * addr) Line 227 C++ w16gle.dll!boost::interprocess::allocator<char,boost::interprocess::segment_manager<char,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>,boost::interprocess::iset_index> >::deallocate(const boost::interprocess::offset_ptr<char,int,unsigned int,0> & ptr, unsigned int __formal) Line 159 C++ w16gle.dll!boost::container::container_detail::vector_alloc_holder<boost::interprocess::allocator<char,boost::interprocess::segment_manager<char,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>,boost::interprocess::iset_index> >,boost::container::container_detail::integral_constant<unsigned int,2> >::~vector_alloc_holder<boost::interprocess::allocator<char,boost::interprocess::segment_manager<char,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>,boost::interprocess::iset_index> >,boost::container::container_detail::integral_constant<unsigned int,2> >() Line 395 C++ w16gle.dll!boost::container::vector<char,boost::interprocess::allocator<char,boost::interprocess::segment_manager<char,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>,boost::interprocess::iset_index> > >::~vector<char,boost::interprocess::allocator<char,boost::interprocess::segment_manager<char,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>,boost::interprocess::iset_index> > >() Line 985 C++ [External Code] w16gle.dll!boost::interprocess::ipcdetail::placement_destroy<boost::container::vector<char,boost::interprocess::allocator<char,boost::interprocess::segment_manager<char,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>,boost::interprocess::iset_index> > > >::destroy_n(void * mem, unsigned int num, unsigned int & destroyed) Line 61 C++ w16gle.dll!boost::interprocess::segment_manager<char,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>,boost::interprocess::iset_index>::priv_generic_named_destroy<char>(const char * name, boost::interprocess::iset_index<boost::interprocess::ipcdetail::index_config<char,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0> > > & index, boost::interprocess::ipcdetail::in_place_interface & table, boost::interprocess::ipcdetail::bool_<1> is_intrusive_index) Line 975 C++ w16gle.dll!boost::interprocess::segment_manager<char,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>,boost::interprocess::iset_index>::destroy<boost::container::vector<char,boost::interprocess::allocator<char,boost::interprocess::segment_manager<char,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>,boost::interprocess::iset_index> > > >(boost::interprocess::ipcdetail::char_ptr_holder<char> name) Line 538 C++ w16gle.dll!boost::interprocess::ipcdetail::basic_managed_memory_impl<char,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>,boost::interprocess::iset_index,8>::destroy<boost::container::vector<char,boost::interprocess::allocator<char,boost::interprocess::segment_manager<char,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void,int,unsigned int,0>,0>,boost::interprocess::iset_index> > > >(const char * name) Line 568 C++ w16gle.dll!global_mem::GlobalFree(void * hMem, bool ignore_invalid) Line 904 C++ w16gle.dll!GLEGlobalFree(void * hMem, bool ignore_invalid) Line 175 C++ w_menu32.dll!CreateVUBreakTabList(HWND__ * hWnd, unsigned short Index, unsigned short BreakTabAant) Line 723 C++ w_comm.exe!TestNieuweTabel() Line 163 C++ w_comm.exe!CommTimer(HWND__ * hWnd) Line 552 C++ w_comm.exe!WndProc(HWND__ * hWnd, unsigned int message, unsigned int wParam, long lParam) Line 365 C++ [External Code] [Frames below may be incorrect and/or missing, no symbols loaded for user32.dll] w_bars32.dll!CallOldProc(HWND__ * Wnd, unsigned int Msg, unsigned int wParam, long lParam, long hookkey) Line 126 C++ w_bars32.dll!SubclassParWndProc(HWND__ * Wnd, unsigned short Msg, unsigned int wParam, long lParam) Line 104 C++ [External Code] w_comm.exe!WinMain(HINSTANCE__ * hInstance, HINSTANCE__ * hPrevInstance, char * lpCmdLine, int nCmdShow) Line 191 C++ [External Code]

1 0

[Boost.Iterator] transform_iterator equivalent for output iterators
by dariomt＠gmail.com 05 Aug '15

05 Aug '15

Here is my problem: for any given algorithm that writes its output into an output iterator, I'd like to apply a transformation *before* writing to the output iterator. e.g. inside the algorithm the output iterator is dereferenced and incremented to write each result, typically like this: *output++ = ith_result; I'd like to wrap the output iterator with a unary function func such that the effect is equivalent to: *output++ = func( ith_result ); I'm looking at the adaptors in Boost.Iterator but I cannot find a suitable one. Am I missing anything? Is there a better approach? Regards

7 8

Inability to print LINE, FILE, FUNCTION in Boost.Log?
by Robert Dailey 05 Aug '15

05 Aug '15

I find the simplest things the most frustrating to accomplish in Boost.Log. I know that some compilers have predefined preprocessor macros to provide information. MSVC for example has __LINE__, __FILE__, etc. I need Boost.Log to print line, file, and function information for me in a platform agnostic way. The documentation is not easy to navigate through and find the information I need. Also examples on this are sparse. I've seen some people calling BOOST_LOG_NAMED_SCOPE manually prior to each log statement. This seems unintuitive. How can I simply print this contextual information with each log line in an automated way? Can't Boost.Log piggy-back on compiler features available to it?

2 1

string_ref and modifying underlying data
by james 04 Aug '15

04 Aug '15

Hi, I'm curious about the decision taken to not allow string_ref to modify the data it represents. I'm modifying our JSON parser to use it, and sometimes I need to normalise a field to uppercase or lowercase. Obviously I cannot now do this without making a copy of the normalised field somewhere with either std::string or boost::string_ref. I notice Jeffrey Yaskin's proposal for a standard implementation ( http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3442.html) has also taken this design decision, which is disappointing. James

2 1

[graph] Example parallel BGL
by Sensei 03 Aug '15

03 Aug '15

Dear all, I'd like to play with Parallel BGL (with MPI), and I'd like to see some example code. I've followed the Overview and the Adjacency List example, but I cannot compile my code. Right now, I'd like to create a graph, and then fill in with some nodes. Then, access the nodes belonging to a single process, but I wish I had an error there My error concerns the definition of the graph: No template named 'bsp_process_group' in namespace 'boost::parallel'; did you mean 'boost::process_group'? The code follows. What am I doing wrong here? I may have forgotten some header... Is there any distributed (complete) example code that I might read? Thanks & Cheers! #include <iostream> #include <string> #include <vector> #include <boost/mpi.hpp> #include <boost/graph/use_mpi.hpp> #include <boost/graph/distributed/mpi_process_group.hpp> #include <boost/graph/distributed/adjacency_list.hpp> int main(int argc, const char * argv[]) { boost::mpi::environment env; boost::mpi::communicator comm; typedef boost::adjacency_list<boost::vecS, boost::distributedS<boost::parallel::bsp_process_group, boost::vecS>, boost::directedS> graph; typedef boost::erdos_renyi_iterator<boost::minstd_rand, graph> generator; if (comm.rank() == 0) { boost::add_edge(1, 2); boost::add_edge(2, 2); boost::add_edge(2, 3); boost::add_edge(3, 4); boost::add_edge(4, 5); boost::add_edge(5, 1); // access ***only rank 0 nodes*** } return 0; }

2 2

Connected components not working Boost Graph library
by Choppin, Simon 03 Aug '15

03 Aug '15

Hello all, I hope you can help me, I'm trying to group 3D point data in clusters according to the distance between points. I.e. different groups (or components) are separated by a minimum threshold distance. To do this I am creating a boost graph (using the Boost Graph library), adding vertices (with 3D point information) and adding edges between nodes of the graph that are within my threshold distance. However, when I find the connected components on the resulting graph I'm getting an incorrect answer. The vertices of the graph are not grouped correctly. I am comparing my results with a Matlab script (and their proprietary programs) which correctly separates the points. I have a stackoverflow post with more detail (and no answers) http://stackoverflow.com/questions/27001402/connected-components-boost-c. If you are able to help in any way I'd be very appreciative. I really don't want to use compiled Matlab for this solution. Thanks Simon Choppin

3 9

Details of boost parallel graph implementation
by Mayank Bakshi 03 Aug '15

03 Aug '15

3 5

Emulating Python class variables in C++
by Will Hall 03 Aug '15

03 Aug '15

Hi there, I am porting a Python library to C++ - and re-exposing back to Python with boost (suffice to say the Python API is fixed). I am having problems emulating class variables from boost as C++ static data members using inheritance. Here's an example: using namespace boost::python; using namespace std; struct A { static string value; }; struct B : public A { static string value; }; string A::value("A"); string B::value("B"); BOOST_PYTHON_MODULE(test) { class_<A>("A") .def_readonly("value", &A::value); class_("B") .def_readonly("value", &B::value); } If I don't specify inheritance using bases<>, then this works. But I need inheritance, so I write: BOOST_PYTHON_MODULE(test) { class_<A>("A") .def_readonly("value", &A::value); class_<B, bases<A> >("B"); } But now in Python, I only have access to A: >>> from test import A, B >>> A.value 'A' >>> B.value 'A' If try and overload B::value, I get an error: BOOST_PYTHON_MODULE(test) { class_<A>("A") .def_readonly("value", &A::value); class_<B, bases<A> >("B") .def_readonly("value", &B::value); } >>> from test import A, B Traceback (most recent call last): File "<stdin>", line 1, in <module> AttributeError: can't set attribute I've also tried switching .def_readwrite, but now the error is: >>> from test import A, B Traceback (most recent call last): File "<stdin>", line 1, in <module> Boost.Python.ArgumentError: Python argument types in None.None(Boost.Python.StaticProperty) did not match C++ signature: None(std::string) So, to summarise, any idea how to provide polymorphic Python class variables in boost::python? Thanks in advance for your help.

3 2

Structure size when compiling with and without -std=c++11
by Miloslav Marik 03 Aug '15

03 Aug '15

Hi, I would like to share my experience with boost when combining with c++11. I hope it might help someone. Suppose a simple program: #include <boost/asio.hpp> #include <iostream> using boost::asio::detail::atomic_count; struct Test { // Whether the task has been interrupted. bool task_interrupted_; // The count of unfinished work. atomic_count outstanding_work_; }; int main () { std::cout << "Size is " << sizeof(Test) << std::endl; return 0; } And here is the story: $ /opt/gcc-4.8.4/bin/g++ -std=c++11 -I /opt/boost-1.58.0/include/ -L /opt/boost-1.58.0/lib -lboost_system b.cpp $ ./a.out Size is 16 $ /opt/gcc-4.8.4/bin/g++ -I /opt/boost-1.58.0/include/ -L /opt/boost-1.58.0/lib -lboost_system b.cpp $ ./a.out Size is 8 It means that c++11 program cannot be linked with boost libraries compiled without "-std=c++11" option. It was asio in my case and the program was linked with libboost_log.so.1.58.0. I would really appreciate a short warning somewhere at "Getting Started on Unix Variants" page. It may safe someone a few hours of life. Best Regards, Slavek

3 2

Boost 1_59_0_b1_rc1 is available for testing
by Marshall Clow 02 Aug '15

02 Aug '15

Release candidate files for 1.59.0 beta 1 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: MD5 (boost_1_59_0_b1_rc1.7z) = f54a97e5ee7f8e3d04cd9af8396e30f9 MD5 (boost_1_59_0_b1_rc1.tar.bz2) = 9804305aae0c9de9f8cfc02e3de75167 MD5 (boost_1_59_0_b1_rc1.tar.gz) = e584770bd76885c123a0426d24466fe2 MD5 (boost_1_59_0_b1_rc1.zip) = ee34f223aa789a6b3f727cb9480651ed Thanks! -- The release managers

12 17

Need sample for CMakelist.txt with BOOST.test
by Abhay Mhatre 01 Aug '15

01 Aug '15

Hi, I am newbie, and struggling with testing project that is build in CMakeList.txt for using Boost.Test. project builds successfully and runs too, only problem is when unit test fails BOOST_REQUIRE exits without printing fatal exception message on console. It also doesn't show next failure. I tired compiling same library with g++ command and everything works as expected. however with CMakeList project there is no output I tried setting explicit boost::unit_test::unit_test_log_t::instance().set_threshold_level(boost::unit_test::log_all_errors) also tried with setting # define BOOST_TEST_LOG_LEVEL all but there is no output except fatal error on console. also it doesn't show fatal error for multiple tests/ Can some one please suggest some way to investigate this further/ provide sample CMakeList.txt file that I can compare and see if I am missing anything thanks in advance, Abhay

4 4

cannot get graph object deserialized
by breadbread1984 01 Aug '15

01 Aug '15

I am using boost graph library. I need to serialize a graph object and read it out later. But I found my program cant work properly with xml archiver. It always throws exception saying XML start/end tag mismatch - position. I did not define a tag named position in my serialization code. I dont know how to solve it. [Here] (http://www.rapidshare.com.cn/i1cvbXM) is a demo of the problem. Please help me. Thanks!

1 0

Map runtime value to type
by dariomt＠gmail.com 31 Jul '15

31 Jul '15

Hi all, Say I have a compile-time map of <value,type> pairs, and I need to access the correct element given a value at runtime and do something with that type. That something would be the same for any of the mapped types (e.g. calling an overloaded function that would then do the right thing depending on the type). The value would typically be an enum. Is there anything in the Boost libraries to help with this? If I used C++11, would there be a simple solution to this? Regards PS: I cannot use Boost.Variant

6 6

Re: [Boost-users] output boost graph parallel issue
by Mayank Bakshi 31 Jul '15

31 Jul '15

1 0

output boost graph parallel issue
by Mayank Bakshi 31 Jul '15

31 Jul '15

1 0

[Asio] [Boost.ASIO] async_read cannot read full data from client
by Sarvagya Pant 30 Jul '15

30 Jul '15

** I have a server created using Boost.ASIO (thanks to sehe from Stackoverflow). The server is supposed to received message from client, parse it as json and correspondingly send the message back to client. To make life easier, i have considered very simple cases: (i) Client can send {"hello":"client"}, server should send response {"hello":"server"} (ii) Client can send {"message" : "Some Message"}, server should send {"response" : "OK"} The server runs, accepts data from client but cannot call the handler of async_read. The doc states that The asynchronous operation will continue until one of the following conditions is true: 1. The supplied buffers are full. That is, the bytes transferred is equal to the sum of the buffer sizes. 2. An error occurred. I think in my case the buffer is not full, thus the handler function is not getting called. How should I change my code so that server can read the message sent by client, process it and send back correct response.? PS: If the code is not attached, http://pastebin.com/pi192t6i is the link to file. *-- Sarvagya PantKathmandu, Nepal+9779803468257*

2 4

how to know which xml_iarchive is parsing
by breadbread1984 30 Jul '15

30 Jul '15

my program serializing and deserializing an object has some problem. I am debugging it. I found it was so hard to debug the code without knowing which line the xml_iarchive is parsing. Is there any way to know which line the xml_iarchive is working on? Thx!

1 0

unsupported version problem of serialization of graph
by breadbread1984 30 Jul '15

30 Jul '15

I am using boost graph library. I can serialize the graph successfully. But when deserialized a graph from the file, an unsupported version exception was throwed out. I created a minimum runnable example and posted it [here] (http://www.rapidshare.com.cn/Bq95n2v) The serialized graph file is enclosed as well. The file is generated with the same version of graph library. Could anyone help me to find the problem? thx!

2 1

problem of deserializing from a xml file
by breadbread1984 30 Jul '15

30 Jul '15

I am having problem deserializing from a file of a serialized object. An exception of input stream error always occurs. The class of the object is pasted [here] (http://pastebin.com/6XEBybWV) The xml file is pasted [here] (http://pastebin.com/e2Ka2kVH) I tried debugging the program. The top few frames of the back trace of the exception is as follows #0 0x00007f8f9be4c267 in __GI_raise (sig=sig@entry=6) at ../sysdeps/unix/sysv/linux/raise.c:55 #1 0x00007f8f9be4deca in __GI_abort () at abort.c:89 #2 0x00007f8f9c76006d in __gnu_cxx::__verbose_terminate_handler() () from /usr/lib/x86_64-linux- gnu/libstdc++.so.6 #3 0x00007f8f9c75dee6 in ?? () from /usr/lib/x86_64-linux-gnu/libstdc++.so.6 #4 0x00007f8f9c75df31 in std::terminate() () from /usr/lib/x86_64-linux-gnu/libstdc++.so.6 #5 0x00007f8f9c75e149 in __cxa_throw () from /usr/lib/x86_64-linux-gnu/libstdc++.so.6 #6 0x00007f8f9e661734 in void boost::serialization::throw_exception<boost::archive::archive_exception>(boost::archiv e::archive_exception const&) () from /usr/lib/x86_64-linux- gnu/libboost_serialization.so.1.55.0 #7 0x00007f8f9e67e2f7 in boost::archive::basic_xml_iarchive<boost::archive::xml_iarchive>::load_start(char const*) () from /usr/lib/x86_64-linux-gnu/libboost_serialization.so.1.55.0 #8 0x0000000000486ab4 in boost::archive::basic_xml_iarchive<boost::archive::xml_iarchive>::load_override<std::m ap<int, std::deque<Observation, std::allocator<Observation> >, std::less<int>, std::allocator<std::pair<int const, std::deque<Observation, std::allocator<Observation> > > > > > (this=0x7ffe12327440, t=...) at /usr/include/boost/archive/basic_xml_iarchive.hpp:85 It seems the problem occurs when the std::map<int, std::deque<Observation, std::allocator<Observation> > in Status is loaded. I can't step into frame #7 to checkout the detail of the exception. Could anyone give a hint of the problem. Thanks!

2 1

math.quaternion design issues
by Matwey V. Kornilov 29 Jul '15

29 Jul '15

Hello, I am facing the following performance issues due to internals of quaternion. abs(q) function is quite slow, and most of the time (according to callgrind) is taken to create valarray which is easily unnecessarily here. valarray requires doing malloc and free, because it is dynamic container, at the same time the size of quaternion is 4 and it is fixed. So, was was the purpose to use std::valarray internally?

3 2

input stream error exception during deserializing
by breadbread1984 29 Jul '15

29 Jul '15

I am using xml_oarchive/iarchive to serialize and deserialize a graph. I can serialize successfully but cant deserialize from the output file. An exception of input stream error is throwed out when I deserialize from the file. I paste a small program which can reproduce the problem [here] (http://www.rapidshare.com.cn/jHQIrOv) How could I solve the problem. Thx in advance.

1 0

boost ptree XML parsing for special character
by Uthpal Urubail 29 Jul '15

29 Jul '15

Experts, I am looking for the help in parsing special characters in XML using boost. Original Text: <module>'Admin'</module> Exported Text: <module>'Admin'</module> Using the below code: ptree xmlTree; read_xml("org.txt",xmlTree,boost::property_tree::xml_parser::trim_whitespace); std::string filePath("outFile.txt"); xml_writer_settings<char> settings(' ', 4); boost::property_tree::write_xml(filePath, xmlTree, std::locale(),settings); Any help is highly appreciated Regards, UJ

1 0

building & testing boost with Visual Studio 2015
by Danny K 28 Jul '15

28 Jul '15

I've built boost 1.58 for Visual Studio 2015 RTM. I would like to run the regression tests and submit the results. I am unsure how to do the tests Would someone point me to the documentation about these steps or just let me know what they are? Boost build doesn't know the compiler name. Where do I add that in the bjam scripts? Respectfully, Danny

2 1

Boost.DLL formal review result
by Vladimir Prus 28 Jul '15

28 Jul '15

The Boost.DLL library is accepted. Congratulations to Antony, and thanks for everybody who reviewed the library! The votes were as follows: - Ralf Globisch - Yes - Klaim - Joël Lamotte - Yes - Niall Douglas - Yes, conditionally - John P Fletcher - Yes - Bjorn Reese - Yes - Edward Diener - Yes - Rodrigo Madera - Yes - Richard - Yes I'd like to also thank Thomas Trummer, Rob Stewart and Ion Gaztañaga for their contribution to review. The key suggestions from the review are listed below. None is critical enough to become a formal prerequisite, or require a mini-review. The library can be added when Antony feels its ready. Naming ----------- There was a concern that "DLL" might sound windows specific, and search for best terminology. This does not seem all that important, as soon as documentation introduces the terminology it uses, and is consistent. OSX support ------------------- The library was found not to work on OSX; I believe this issue was already fixed off-list with help from Rodrigo. Documentation ---------------------- Several people requested improvements. Bjorn and John, in particular, pointed out specific issues. This seems to be the post important change prior to adding the library. Dependencies on Boost and system headers ---------------------------------------------------------------- It was suggested that the library does not depend on other Boost C++ Libraries. While it might be helpful to some users, I find it logically impossible for a Boost formal review to request that dependencies on Boost libraries be removed. It was also mentioned that Boost.DLL is header-only library and includes system headers that can bring a lot of symbols and maybe macros. I don't think an actual problem was reported, though, and there is no way to avoid the problem while staying header-only. It's up to the author to consider these suggestions and do something, or don't do anything. Continuous integration -------------------------------- There was a recommendation from Niall to improve CI of the library, including static analysis, valgrind, Windows CI, showing CI status in documentation and so forth. These are good suggestions. At the same time, they are not specific to Boost.DLL, and it's not the goal of a formal review to create new generic development process requirements. Many existing libraries of indisputably high quality do not have these requested mechanisms. Therefore, the author can act on these suggestions as he sees fit. Thanks, -- Vladimir Prus http://vladimirprus.com

4 3

Re: [Boost-users] unsupported version problem of serialization of graph
by breadbread1984 28 Jul '15

28 Jul '15

I created a minimum runnable example and posted it [here] (http://www.rapidshare.com.cn/Bq95n2v) The serialized graph file is enclosed as well. The file is generated with the same version of graph library. Could you help to find the problem? thx! > Date: Tue, 28 Jul 2015 10:51:36 +0000 > From: Marcin Zalewski <marcin.zalewski(a)gmail.com> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] unsupported version problem of > serialization of graph > Message-ID: > <CAB8upqL05cQ9GruRGnujo6vczg6_7CJZe=bxbGaQqDt=eNDw3w(a)mail.gmail.com> > Content-Type: text/plain; charset="utf-8" > > Could you post a minimum runnable example? > > On Tue, Jul 28, 2015 at 6:47 AM breadbread1984 <breadbread1984(a)163.com> > > wrote: > > I am using boost graph library. I can serialize the graph successfully. > > But > > when deserialized a graph from the file, an unsupported version exception > > was > > throwed out. The Graph structure is pasted [here] > > (http://codepad.org/m7F21t4j) what shall I do to solve the problem. Thx! > > > > _______________________________________________ > > Boost-users mailing list > > Boost-users(a)lists.boost.org > > http://lists.boost.org/mailman/listinfo.cgi/boost-users > >

1 0

Problem with boost::asio and boost::coroutine.
by Иван Бобев 28 Jul '15

28 Jul '15

This is my first post so sorry if it is not in the appropriate form. I have trouble with specific *boost::asio* and *boost::coroutine *usage pattern. I have a multi-thread application which uses *boost::asio* and *boost::coroutine* via its integration in *boost::asio*. Every thread has its own *io_service* object. The only shared state between threads are connection pools which are locked with *mutex* when connection is get or returned from/to the connection pool. When there is not enough connections in the pool I push infinite *asio::steady_tiemer *in internal structure of the pool and asynchronously waiting on it and I yielding from the couroutine function. When other thread returns connection to the pool it checks whether there is waiting timers, it gets waiting timer from the internal structure, it gets its *io_service* object and posts a lambda which wakes up the timer to resume the suspended coroutine. I have random crashes in the application. I try to investigate the problem with *valgrind*. It founds some issues but I cannot understand them because they happen in *boost::coroutine* and *boost::asio *internals. I posted two questions in *stckoverflow *with extract from my code and from valgrind and *GDB* output. The first link is with original question with extracts from my source and the second one contains proof of concept application aimed to investigate the problem in isolation. Can someone help me explaining what is my mistake which causes those problems? http://stackoverflow.com/questions/31610415/what-causes-a-random-crash-in-b… http://stackoverflow.com/questions/31639888/whats-wrong-with-this-boostasio…

1 2

Filesystem library and virtual
by Olivier Tristan 28 Jul '15

28 Jul '15

Hi Guys, I'm wondering if the possibility to handle custom filesystem is planned at some point in the Filesystem library ? My goal is to manage a virtual filesystem contained in a "big file" or in an archive in a transparent way with the other files on the system. Thanks, -- Olivier Tristan Research & Development www.uvi.net

4 4

Betweenness Centrality Test
by Mayank Bakshi 28 Jul '15

28 Jul '15

2 1

unsupported version problem of serialization of graph
by breadbread1984 28 Jul '15

28 Jul '15

I am using boost graph library. I can serialize the graph successfully. But when deserialized a graph from the file, an unsupported version exception was throwed out. The Graph structure is pasted [here] (http://codepad.org/m7F21t4j) what shall I do to solve the problem. Thx!

2 1

Boost.Log
by Leon Mlakar 27 Jul '15

27 Jul '15

Hi, I've started looking into Boost.Log as one of the possible solutions for out multi-platform project with, alas, Microsoft Windows being one of the them platforms. While the solution is multi-threaded, we are trying to avoid any thread synchronization on common resources by using sequential task queues associated with these resources. The resulting internal architecture is thus fully asynchronous with no synchronization points between worker threads. So I'm trying to fit Boost.Log into this, and the documentations, while exhaustive, still leaves some questions unanswered. Or perhaps I missed them. For instance, as far as the sources go, the library offers two logger flavors ... thread safe (I'm assuming guarded by mutex) and single threaded variants. I'm inclined towards using the latter (obviously, don't want to sync on mutex) but that would mean creating thousands of logger instances and I don't have a feeling how heavy or lightweight the logger is. Hence the first questions: 1. How heavy the logger is and what would it mean to have thousands of them around? 2. Why is there a need for _mt variants? Solely to protect logger internal data or to synchronize operations towards the core? 3. Is there anything else the loggers do apart from storing source specific attributes and associating them with the record, and serving as an open/push frontend to the core? And since the alternative is to directly use the core rather than going through the loggers, this immediately raises the next question: 4. are the following core operations internally synchronized: core::get(), core::open_record(), core::push_record()? And the final question: 5. If we were to go with using the core directly, would it be better to store shared pointer obtained via core::get() or to call core::get() for each log (basically, whether is it okay to store shared pointers to core up until the start of the end of the destruction sequence of the process? I think the sinks are more thoroughly covered in the docs. I'm unsure at the moment whether to use one of those already available in the library with the asynchronous frontend, or go for the unlocked frontend with the own backend associated with the task queue. While I'm aware I did not provide enough information to directly ask the question, any thoughts on this would nevertheless be welcome. Thank you and best regards, Leon

1 0

Boost release 1.59.0 beta 1 is now available from SourceForge
by Marshall Clow 25 Jul '15

25 Jul '15

Boost release 1.59.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/boost/1.59.0.beta.1/ For details of what's in the release, see http://www.boost.org/users/history/version_1_59_0.html. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team

7 8

[filesystem] problem: is_regular_file and deduplified files (reparse+sparse)
by Paul Harris 24 Jul '15

24 Jul '15

Hi guys, I'm seeing a lot of failures all of a sudden, its a serious problem. I imagine some of you may start seeing the same failures too very soon. I'm seeing it with boost 1.58.0. There is a related bug already entered here: https://svn.boost.org/trac/boost/ticket/11057 I can't seem to log on and update this ticket. But the problem extends further than that ticket. Windows Server 2003 support has been dropped by Microsoft, and a lot of IT depts around the world are switching over to the latest Windows Server. With this server comes the new "dedup" feature, that can automatically deduplify files. This happens on a schedule, eg 2am saturday. So suddenly we are getting messages of failures of software from all over the place, due to fs::is_regular_file() Deduped files have the REPARSE and SPARSE flag set. On the command line, you can run FSUTIL REPARSEPOINT QUERY and the "Reparse Tag Value" is 0x80000013 Which is a relatively new flag known as IO_REPARSE_TAG_DEDUP https://msdn.microsoft.com/en-us/library/windows/desktop/aa365740%28v=vs.85… These files act as normal files, you can fopen and fread them, so I assume they should be treated almost like symlink by boost... perhaps not quite a symlink because I assume the "lstat" link properties are identical to the file's stat properties. Typically, I iterate over directories and only process files if fs::is_regular_file(filename) is true. I wrote some code to check what the properties were on these files, and its not any of the possible enums detected by file_status::type(). ideas? Best regards, Paul

2 5

Re: [Boost-users] problem of getting vertex_index_t property
by breadbread1984 24 Jul '15

24 Jul '15

Thx for your reply. But I use vecS to store vertices instead of setS. The setS is for storing edges. There should be something else going wrong. 在 2015年7月23日星期四 10:32:28，boost-users-request@lists.boost.org 写道： > Send Boost-users mailing list submissions to > boost-users(a)lists.boost.org > > To subscribe or unsubscribe via the World Wide Web, visit > http://lists.boost.org/mailman/listinfo.cgi/boost-users > or, via email, send a message with subject or body 'help' to > boost-users-request(a)lists.boost.org > > You can reach the person managing the list at > boost-users-owner(a)lists.boost.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Boost-users digest..." > > > Today's Topics: > > 1. Re: [interval] Errors using transc.hpp WAS: Power (Sensei) > 2. problem of getting vertex_index_t property with BGL > (breadbread1984) > 3. Re: problem of getting vertex_index_t property with BGL > (Jeremiah Willcock) > 4. Re: Boost.DateTime and leap year/leap seconds (Auer, Jens) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Thu, 23 Jul 2015 10:03:47 +0200 > From: Sensei <senseiwa(a)gmail.com> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [interval] Errors using transc.hpp WAS: > Power > Message-ID: <55B09FE3.20108(a)gmail.com> > Content-Type: text/plain; charset=utf-8; format=flowed > > Dear all, > > I've tried to move beyond simple exp/log functions, but this problem > > > /usr/local/include/boost/numeric/interval/transc.hpp:47:42: No member > > named 'log_down' in 'boost::numeric::interval_lib::rounded_math<double>' > > > > /usr/local/include/boost/numeric/interval/transc.hpp:34:16: No member > > named 'exp_down' in 'boost::numeric::interval_lib::rounded_math<double>' > > arises with *all* of the functions contained in transc.hpp, and I don't > know what I'm doing wrong here. > > Can anyone help me? > > > Thanks! > > > ------------------------------ > > Message: 2 > Date: Thu, 23 Jul 2015 18:25:39 +0800 > From: breadbread1984 <breadbread1984(a)163.com> > To: boost-users(a)lists.boost.org > Subject: [Boost-users] problem of getting vertex_index_t property with > BGL > Message-ID: <2807116.uu1eRmarTQ@xieyi-paf4> > Content-Type: text/plain; charset="utf-8" > > I am using boost graph library. I found there is a built in property > vertex_index_t corresponding to every vertex from the document > [here](http://www.boost.org/doc/libs/1_58_0/libs/graph/doc/adjacency_list.h > tml). But when I get the vertex_index_t property the compiler prompt the > following error: > > CooperativeGraph.h:59:36: required from here > /usr/include/boost/graph/detail/adjacency_list.hpp:2498:29: error: forming > reference to void typedef value_type& reference; > ^ > /usr/include/boost/graph/detail/adjacency_list.hpp:2499:35: error: forming > reference to void typedef const value_type& const_reference; > ^ > /usr/include/boost/graph/detail/adjacency_list.hpp:2502:47: error: forming > reference to void <Graph, value_type, reference, Tag> type; > ^ > /usr/include/boost/graph/detail/adjacency_list.hpp:2504:53: error: forming > reference to void <Graph, value_type, const_reference, Tag> const_type; > ^ > CooperativeGraph.cpp: In member function ?void > CooperativeGraph::getProperties()?: CooperativeGraph.cpp:384:35: error: no > matching function for call to ?get(boost::vertex_index_t, Graph&)? > vertex_index = get(vertex_index,g); > ^ > I defined the data structure as follows > > typedef property<vertex_BatteryLevel_t,int, > property<vertex_ObservationHistory_t,deque<Observation>, > property<vertex_name_t,uuid> > > > vertex_state; > > typedef property<edge_QFunction_t,QTable, > property<edge_Eligibility_t,Eligibility> > > > edge_qfunction; > > typedef adjacency_list< > vecS,setS,directedS, > vertex_state, > edge_qfunction > > > Graph; > > Does anyone know what I am doing wrong? Why can't I get the vertex_index_t > property. Thanks! > > > > ------------------------------ > > Message: 3 > Date: Thu, 23 Jul 2015 14:06:03 +0000 (UTC) > From: Jeremiah Willcock <jewillco(a)yahoo.com> > To: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org> > Subject: Re: [Boost-users] problem of getting vertex_index_t property > with BGL > Message-ID: > <983493185.1183146.1437660363876.JavaMail.yahoo(a)mail.yahoo.com> > Content-Type: text/plain; charset=UTF-8 > > >________________________________ > > > > From: breadbread1984 <breadbread1984(a)163.com> > > > >To: boost-users(a)lists.boost.org > >Sent: Thursday, July 23, 2015 4:25 AM > >Subject: [Boost-users] problem of getting vertex_index_t property with BGL > > > > > >I am using boost graph library. I found there is a built in property > >vertex_index_t corresponding to every vertex from the document > >[here](http://www.boost.org/doc/libs/1_58_0/libs/graph/doc/adjacency_list. > >html). But when I get the vertex_index_t property the compiler prompt the > >following error: > > > >CooperativeGraph.h:59:36: required from here > >/usr/include/boost/graph/detail/adjacency_list.hpp:2498:29: error: forming > >reference to void> > > typedef value_type& reference; > > > > ^ > > > >/usr/include/boost/graph/detail/adjacency_list.hpp:2499:35: error: forming > >reference to void> > > typedef const value_type& const_reference; > > > > ^ > > > >/usr/include/boost/graph/detail/adjacency_list.hpp:2502:47: error: forming > >reference to void> > > <Graph, value_type, reference, Tag> type; > > > > ^ > > > >/usr/include/boost/graph/detail/adjacency_list.hpp:2504:53: error: forming > >reference to void> > > <Graph, value_type, const_reference, Tag> const_type; > > > > ^ > > > >CooperativeGraph.cpp: In member function ?void > >CooperativeGraph::getProperties()?: CooperativeGraph.cpp:384:35: error: no > >matching function for call to ?get(boost::vertex_index_t, Graph&)?> > > vertex_index = get(vertex_index,g); > > > > ^ > > > >I defined the data structure as follows > > > >typedef property<vertex_BatteryLevel_t,int, > > > > property<vertex_ObservationHistory_t,deque<Observation>, > > > > property<vertex_name_t,uuid> > >> > >> vertex_state; > > > >typedef property<edge_QFunction_t,QTable, > > > > property<edge_Eligibility_t,Eligibility> > >> > >> edge_qfunction; > > > >typedef adjacency_list< > > > > vecS,setS,directedS, > > vertex_state, > > edge_qfunction > >> > >> Graph; > > > >Does anyone know what I am doing wrong? Why can't I get the vertex_index_t > >property. Thanks! > Your graph type has setS as its vertex container. Try using vecS instead to > get the vertex_index property to be present. > > -- Jeremiah Willcock > > > ------------------------------ > > Message: 4 > Date: Thu, 23 Jul 2015 14:31:51 +0000 > From: "Auer, Jens" <jens.auer(a)cgi.com> > To: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org> > Subject: Re: [Boost-users] Boost.DateTime and leap year/leap seconds > Message-ID: > <E47848702ADBE04EA7ECF45E05F60B6DF98E840C(a)SE-EX020.groupinfra.com> > Content-Type: text/plain; charset="utf-8" > > Hi Howard, > > Thank you very much. That basically made my day! > > We have no restrictions on the compiler, currently I'm using gcc 4.9 in > C++-14 mode. I think I can also justify using a time handling library, so > the chances are very good that we will use your library. > > Many thanks and best wishes, > Jens > > -- > Dr. Jens Auer | CGI | Software Engineer > CGI Deutschland Ltd. & Co. KG > Rheinstra?e 95 | 64295 Darmstadt | Germany > T: +49 6151 36860 154 > jens.auer(a)cgi.com > Unsere Pflichtangaben gem?? ? 35a GmbHG / ?? 161, 125a HGB finden Sie unter > de.cgi.com/pflichtangaben. > > CONFIDENTIALITY NOTICE: Proprietary/Confidential information belonging to > CGI Group Inc. and its affiliates may be contained in this message. If you > are not a recipient indicated or intended in this message (or responsible > for delivery of this message to such person), or you think for any reason > that this message may have been addressed to you in error, you may not use > or copy or deliver this message to anyone else. In such case, you should > destroy this message and are asked to notify the sender by reply e-mail. > > -----Original Message----- > From: Boost-users [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Howard Hinnant Sent: 22 July 2015 21:29 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Boost.DateTime and leap year/leap seconds > > I?ve been following this thread with interest. > > On Jul 22, 2015, at 8:59 AM, Auer, Jens <jens.auer(a)cgi.com> wrote: > > Reading the documentation I think that will not be correct when there were > > leap seconds. > Correct. As Jeff said earlier, leap second support is not in the current > library, but might be a feature in a future boost date-time 2.0. > > If you are using a C++11 or C++14 compiler, there is a library that will > handle this problem with leap seconds taken into account for you: > > http://howardhinnant.github.io/tz.html > > I doubt you can use this library as the space industry equates up-to-date > compilers with increased risk. However I mention it, as it is open source > and perhaps you can crib some of its ideas onto the current boost date-time > library. > > In a nutshell, this C++11/14 library handles leap seconds along the lines of > what Jeff suggested. Though in this case it creates a std::chrono - > compatible clock which is leap second aware: > > class utc_clock > { > public: > using duration = > std::chrono::system_clock::duration; using rep = > duration::rep; > using period = duration::period; > using time_point = > std::chrono::time_point<utc_clock>; static constexpr bool is_steady = true; > > static time_point now() noexcept; > > template <class Duration> > static > std::chrono::time_point<utc_clock, > typename std::common_type<Duration, > std::chrono::seconds>::type> > sys_to_utc(std::chrono::time_point<std::chrono::system_clock, Duration> t); > > template <class Duration> > static > std::chrono::time_point<std::chrono::system_clock, > typename std::common_type<Duration, > std::chrono::seconds>::type> utc_to_sys(std::chrono::time_point<utc_clock, > Duration> t); }; > > and includes conversions to and from std::chrono::system_clock::time_point > (which like boost date-time is based on Unix time). These conversions are > simply lookups into an ordered list of leap second transitions, resulting > in the addition or subtraction of the proper number of leap seconds. > > This could be used like so: > > struct CCSDS > { > std::uint16_t days; > std::uint32_t ms; > std::uint16_t us; > }; > > CCSDS > to_CCSDS(date::year y, std::chrono::microseconds us) > { > using namespace date; > using namespace std::chrono; > auto utc = utc_clock::sys_to_utc(day_point(y/jan/1)) + us; > auto sys = utc_clock::utc_to_sys(utc); > auto dp = floor<days>(sys); > auto d = dp - day_point(1958_y/jan/1); > us = utc - utc_clock::sys_to_utc(dp); > auto ms = duration_cast<milliseconds>(us); > us -= ms; > return {static_cast<std::uint16_t>(d.count()), > static_cast<std::uint32_t>(ms.count()), > static_cast<std::uint16_t>(us.count())}; > } > > The variable utc holds the ?year + us? as a time point with microseconds > precision. This time point counts microseconds, including leap seconds, > since 1970-01-01 00:00:00 UTC. > > The next step is find when the day started that is associated with utc. To > do this one must convert utc back to ?Unix time?, and then truncate that > time point to a precision of days, resulting in the variable dp. dp is a > count of days since 1970-01-01. Since your epoch is 1958-01-01, this is > taken into account in creating ?d?, the first value needed in your return > type. > > Now the number of microseconds since the start of the day needs to be > computed. The start of the day, dp, is converted back into the leap-second > aware system, and subtracted from the microsecond time point: utc. The > variable us is reused to hold ?microseconds since midnight?. Now it is a > simple computation to split this into milliseconds since midnight, and > microseconds since the last millisecond. > > This has all been tested with: > > void > test_to_CCSDS() > { > using namespace std::chrono; > using namespace date; > for (auto d = days{179}; d <= days{181}; ++d) > { > auto start = d + 86399s + 999999us + 0us; > for (auto us = start; us <= start + 3s; us += 1s) > { > auto t = to_CCSDS(2015_y, us); > std::cout << t.days << ' ' << t.ms << ' ' << t.us << '\n'; > } > std::cout << '\n'; > } > } > > which yields: > > 20998 86399999 999 > 20999 999 999 > 20999 1999 999 > 20999 2999 999 > > 20999 86399999 999 > 20999 86400999 999 > 21000 999 999 > 21000 1999 999 > > 21000 86398999 999 > 21000 86399999 999 > 21001 999 999 > 21001 1999 999 > > Interpretation: On 2015-06-29 23:59:59.999999 we are 1us away from the next > day. 1s later we are well into 2015-06-30. > > 24hrs later, we see a different pattern as the leap second is inserted. The > last microsecond of the day is 1s later at 2015-06030 23:59:60.999999. > > 24hrs later we are back to days with only 86400s. > > Assuming you have some conversion data to test against, this will hopefully > match up with those test cases. > > Howard > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > ------------------------------ > > Subject: Digest Footer > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > ------------------------------ > > End of Boost-users Digest, Vol 4202, Issue 3 > ********************************************

2 1

question about vertex_index_t property of graph
by breadbread1984 24 Jul '15

24 Jul '15

I am using boost graph library. I want to know whether the value of vertex_index_t property is assigned and updated automatically? If I serialize a graph to a file and deserialize it, will the value of vertex_index_t property remain?

2 1

Boost.DateTime and leap year/leap seconds
by Auer, Jens 23 Jul '15

23 Jul '15

Hi, I am considering using Boost.DateTime in one of my projects, and there have been some concerns about handling leap seconds on the customers side. The documentation says that other libraries do not handle leap seconds correctly, but it does not state that Boost.DateTime does. I found only one mail from 2009 on the mailing list asking about leap seconds, but this does not give an answer. Does anybody have some information on this? The computations I intend to do are actually rather limited. I will be given a year and a number microseconds, and have to compute the day in the year that this describes from the start of the year, together with microseconds and milliseconds in the day. So what I want to implement is a function tuple<days, milliseconds, microsends> convertTime(year, microseconds). Best wishes, Jens -- Dr. Jens Auer | CGI | Software Engineer CGI Deutschland Ltd. & Co. KG Rheinstraße 95 | 64295 Darmstadt | Germany T: +49 6151 36860 154 jens.auer(a)cgi.com<mailto:jens.auer@cgi.com> Unsere Pflichtangaben gemäß § 35a GmbHG / §§ 161, 125a HGB finden Sie unter de.cgi.com/pflichtangaben<http://de.cgi.com/pflichtangaben>. CONFIDENTIALITY NOTICE: Proprietary/Confidential information belonging to CGI Group Inc. and its affiliates may be contained in this message. If you are not a recipient indicated or intended in this message (or responsible for delivery of this message to such person), or you think for any reason that this message may have been addressed to you in error, you may not use or copy or deliver this message to anyone else. In such case, you should destroy this message and are asked to notify the sender by reply e-mail.

3 6

problem of getting vertex_index_t property with BGL
by breadbread1984 23 Jul '15

23 Jul '15

I am using boost graph library. I found there is a built in property vertex_index_t corresponding to every vertex from the document [here](http://www.boost.org/doc/libs/1_58_0/libs/graph/doc/adjacency_list.ht…. But when I get the vertex_index_t property the compiler prompt the following error: CooperativeGraph.h:59:36: required from here /usr/include/boost/graph/detail/adjacency_list.hpp:2498:29: error: forming reference to void typedef value_type& reference; ^ /usr/include/boost/graph/detail/adjacency_list.hpp:2499:35: error: forming reference to void typedef const value_type& const_reference; ^ /usr/include/boost/graph/detail/adjacency_list.hpp:2502:47: error: forming reference to void <Graph, value_type, reference, Tag> type; ^ /usr/include/boost/graph/detail/adjacency_list.hpp:2504:53: error: forming reference to void <Graph, value_type, const_reference, Tag> const_type; ^ CooperativeGraph.cpp: In member function ‘void CooperativeGraph::getProperties()’: CooperativeGraph.cpp:384:35: error: no matching function for call to ‘get(boost::vertex_index_t, Graph&)’ vertex_index = get(vertex_index,g); ^ I defined the data structure as follows typedef property<vertex_BatteryLevel_t,int, property<vertex_ObservationHistory_t,deque<Observation>, property<vertex_name_t,uuid> > > vertex_state; typedef property<edge_QFunction_t,QTable, property<edge_Eligibility_t,Eligibility> > edge_qfunction; typedef adjacency_list< vecS,setS,directedS, vertex_state, edge_qfunction > Graph; Does anyone know what I am doing wrong? Why can't I get the vertex_index_t property. Thanks!

2 1

[interval] Power
by Sensei 23 Jul '15

23 Jul '15

Dear all, I am defining a "scalar" type for a project, and this scalar I'd like to be an interval. Among the operations, already provided by boost interval, I need pow(interval, interval). Since there is no pow() function, but log() and exp() are defined, I mistakenly defined power as the obvious: typedef boost::numeric::interval<double> scalar; scalar p(1.0, 1.0), q(4, 100); log << "^ " << boost::numeric::exp(p * boost::numeric::log(q)) << std::endl; Unfortunately, it won't work, and it gives me this error: /usr/local/include/boost/numeric/interval/transc.hpp:47:42: No member named 'log_down' in 'boost::numeric::interval_lib::rounded_math<double>' /usr/local/include/boost/numeric/interval/transc.hpp:34:16: No member named 'exp_down' in 'boost::numeric::interval_lib::rounded_math<double>' Is there any "correct" pow() function I can implement? Is something wrong with the definition of scalar? Thank you!

2 3

Re: [Boost-users] Subject:[atomic] why atomic<>::store method can not support memory_order_consum memory_order_acquire and memory_order_acq_rel these memory_orders?
by class7class＠163.com 23 Jul '15

23 Jul '15

Your explanation is very detailedand useful, I think I understood. Thank you very much! class7class(a)163.com From: boost-users-request Date: 2015-07-23 09:04 To: boost-users Subject: Boost-users Digest, Vol 4201, Issue 4 Send Boost-users mailing list submissions to boost-users(a)lists.boost.org To subscribe or unsubscribe via the World Wide Web, visit http://lists.boost.org/mailman/listinfo.cgi/boost-users or, via email, send a message with subject or body 'help' to boost-users-request(a)lists.boost.org You can reach the person managing the list at boost-users-owner(a)lists.boost.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Boost-users digest..." Today's Topics: 1. Re: Boost release 1.59.0 beta 1 is now available from SourceForge (Ben Pope) 2. Re: Boost release 1.59.0 beta 1 is now available from SourceForge (Vicky Vergara) 3. Re: Subject:[atomic] why atomic<>::store method can not support memory_order_consum memory_order_acquire and memory_order_acq_rel these memory_orders? (Gavin Lambert) 4. [filesystem] problem: is_regular_file and deduplified files (reparse+sparse) (Paul Harris) 5. Re: Subject:[atomic] why atomic<>::store method can not support memory_order_consum memory_order_acquire and memory_order_acq_rel (Isaac To) ---------------------------------------------------------------------- Message: 1 Date: Thu, 23 Jul 2015 05:20:39 +0800 From: Ben Pope <benpope81(a)gmail.com> To: boost-users(a)lists.boost.org Cc: boost(a)lists.boost.org Subject: Re: [Boost-users] Boost release 1.59.0 beta 1 is now available from SourceForge Message-ID: <mop1f7$6dg$1(a)ger.gmane.org> Content-Type: text/plain; charset=windows-1252; format=flowed On Thursday, July 23, 2015 02:23 AM, Marshall Clow wrote: > On Thu, Jul 16, 2015 at 6:16 AM, Marshall Clow <mclow.lists(a)gmail.com > <mailto:mclow.lists@gmail.com>> wrote: > > > Boost release 1.59.0 beta 1 is now available from SourceForge > See http://sourceforge.net/projects/boost/files/boost/1.59.0.beta.1/ > For details of what's in the release, see > http://www.boost.org/users/history/version_1_59_0.html. > Note that the links to files on this web page are for the final > release - use the SourceForge link above to get the beta files. > Please download the beta, give it a try, and report any problems you > encounter. > > > Has anyone tried the beta release with new compilers? > > Specifically, I'm thinking about: > * GCC 5.2 > * VS2015 > * Clang 3.7rc1 For clang 3.7 rc1, the tests for master are up on the ftp, but they won't be published because I haven't submitted a pull request for them to be published on the test site, since I don't run them regularly. The dev results should be up on the test matrix at some point soon, but the entire run of dev and release takes a couple of days (which feels slow) and is still in progress. I intend to publish the results of asan, msan, tsan runs at some point but I haven't got round to figuring out the right way to present them yet, if you want the raw xml results and don't have access to the ftp, contact me. I'll probably run for gcc 5.2 when it arrives on Ubuntu's launchpad. Ben ------------------------------ Message: 2 Date: Wed, 22 Jul 2015 17:53:17 -0500 From: Vicky Vergara <vicky_vergara(a)hotmail.com> To: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org> Subject: Re: [Boost-users] Boost release 1.59.0 beta 1 is now available from SourceForge Message-ID: <BAY177-W30049CC41A57EE28144AA18A830(a)phx.gbl> Content-Type: text/plain; charset="iso-8859-1" We re working on the release of pgRouting. We use Boost.Graph. My Question is: Waht changes I have to do in Github travis to check that pgRouting is compatible with this beta release? Here is our travis file: https://github.com/pgRouting/pgrouting/blob/develop_2_1_0/.travis.yml Right now it runs with boost 1.46.1 https://travis-ci.org/pgRouting/pgrouting/jobs/72064827#L1834 Thanks > To: boost-users(a)lists.boost.org > From: benpope81(a)gmail.com > Date: Thu, 23 Jul 2015 05:20:39 +0800 > CC: boost(a)lists.boost.org > Subject: Re: [Boost-users] Boost release 1.59.0 beta 1 is now available from SourceForge > > On Thursday, July 23, 2015 02:23 AM, Marshall Clow wrote: > > On Thu, Jul 16, 2015 at 6:16 AM, Marshall Clow <mclow.lists(a)gmail.com > > <mailto:mclow.lists@gmail.com>> wrote: > > > > > > Boost release 1.59.0 beta 1 is now available from SourceForge > > See http://sourceforge.net/projects/boost/files/boost/1.59.0.beta.1/ > > For details of what's in the release, see > > http://www.boost.org/users/history/version_1_59_0.html. > > Note that the links to files on this web page are for the final > > release - use the SourceForge link above to get the beta files. > > Please download the beta, give it a try, and report any problems you > > encounter. > > > > > > Has anyone tried the beta release with new compilers? > > > > Specifically, I'm thinking about: > > * GCC 5.2 > > * VS2015 > > * Clang 3.7rc1 > > For clang 3.7 rc1, the tests for master are up on the ftp, but they > won't be published because I haven't submitted a pull request for them > to be published on the test site, since I don't run them regularly. > > The dev results should be up on the test matrix at some point soon, but > the entire run of dev and release takes a couple of days (which feels > slow) and is still in progress. > > I intend to publish the results of asan, msan, tsan runs at some point > but I haven't got round to figuring out the right way to present them > yet, if you want the raw xml results and don't have access to the ftp, > contact me. > > I'll probably run for gcc 5.2 when it arrives on Ubuntu's launchpad. > > Ben > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users -------------- next part -------------- HTML attachment scrubbed and removed ------------------------------ Message: 3 Date: Thu, 23 Jul 2015 12:20:28 +1200 From: Gavin Lambert <gavinl(a)compacsort.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Subject:[atomic] why atomic<>::store method can not support memory_order_consum memory_order_acquire and memory_order_acq_rel these memory_orders? Message-ID: <mopc0e$6ph$1(a)ger.gmane.org> Content-Type: text/plain; charset=windows-1252; format=flowed On 22/07/2015 14:43, class7class(a)163.com wrote: > I am a SE and I program based on boost library, I have one question to > ask as below: > > When I use the atomic library included boost , I coded as following: > atomic<bool> flag; //declare the var > flag.store(true,boost::memory_order_acq_rel); // use > store method to change the value of flag > > but BOOST_ASSERT failed,and I read the code of base_atomic<> template > class,I found the the store() method can not support several > memory_orders metioned in the subject , and the other methods can not > support all memory_orders,such as: > 1.the load method can not support memory_order_release and > memory_order_acq_rel > 2. the compare_exchange_strong method can not support > memory_order_release and memory_order_acq_rel > 3. the compare_exchange_weak method can not support > memory_order_release and memory_order_acq_rel > > I really want to know the reason that why the methods of atomic can not > support all memory_orders. Because this is mandated by the standard, and because doing otherwise doesn't really make sense. Loads can't release, and stores can't acquire. Therefore those memory orders are nonsensical. memory_order_acq_rel exists for RMW operations such as compare_exchange. The "acq" applies to the load and the "rel" to the store. It's not sensible for a store alone. > If I need the methods of the atomic<> support all memory_orders,how > can i do? You can re-read the standard memory model and discover why that doesn't make sense. Memory ordering can be tricky to get your head around at first -- it's a good idea to run any atomic algorithm you implement through a sanity checker such as RRD or ThreadSanitizer to help catch subtle bugs. If in doubt, stick with seq_cst memory ordering (the default). On x86/x64 there is very little performance difference between seq_cst and the weaker orders -- cacheline sharing tends to be more problematic. ------------------------------ Message: 4 Date: Thu, 23 Jul 2015 08:56:21 +0800 From: Paul Harris <harris.pc(a)gmail.com> To: boost-users <boost-users(a)lists.boost.org> Subject: [Boost-users] [filesystem] problem: is_regular_file and deduplified files (reparse+sparse) Message-ID: <CAMSUDdZL95bnn3Ec=3pKGkKRdtMk2i7=PL6e7aK6u4J9GBVpZg(a)mail.gmail.com> Content-Type: text/plain; charset="utf-8" Hi guys, I'm seeing a lot of failures all of a sudden, its a serious problem. I imagine some of you may start seeing the same failures too very soon. I'm seeing it with boost 1.58.0. There is a related bug already entered here: https://svn.boost.org/trac/boost/ticket/11057 I can't seem to log on and update this ticket. But the problem extends further than that ticket. Windows Server 2003 support has been dropped by Microsoft, and a lot of IT depts around the world are switching over to the latest Windows Server. With this server comes the new "dedup" feature, that can automatically deduplify files. This happens on a schedule, eg 2am saturday. So suddenly we are getting messages of failures of software from all over the place, due to fs::is_regular_file() Deduped files have the REPARSE and SPARSE flag set. On the command line, you can run FSUTIL REPARSEPOINT QUERY and the "Reparse Tag Value" is 0x80000013 Which is a relatively new flag known as IO_REPARSE_TAG_DEDUP https://msdn.microsoft.com/en-us/library/windows/desktop/aa365740%28v=vs.85… These files act as normal files, you can fopen and fread them, so I assume they should be treated almost like symlink by boost... perhaps not quite a symlink because I assume the "lstat" link properties are identical to the file's stat properties. Typically, I iterate over directories and only process files if fs::is_regular_file(filename) is true. I wrote some code to check what the properties were on these files, and its not any of the possible enums detected by file_status::type(). ideas? Best regards, Paul -------------- next part -------------- HTML attachment scrubbed and removed ------------------------------ Message: 5 Date: Thu, 23 Jul 2015 09:04:57 +0800 From: Isaac To <isaac.to(a)gmail.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Subject:[atomic] why atomic<>::store method can not support memory_order_consum memory_order_acquire and memory_order_acq_rel Message-ID: <CAOArY3UmCXoCcWPntHo2GufdmAy1mSNceFGUwdoZt4_Kd5D2EA(a)mail.gmail.com> Content-Type: text/plain; charset="utf-8" On Thu, Jul 23, 2015 at 12:00 AM, "class7class(a)163.com" <class7class(a)163.com > wrote: > I found the the store() method can not support several memory_orders > metioned in the subject , and the other methods can not support all > memory_orders,such as: > 1.the load method can not support memory_order_release and > memory_order_acq_rel > 2. the compare_exchange_strong method can not support > memory_order_release and memory_order_acq_rel > 3. the compare_exchange_weak method can not support memory_order_release > and memory_order_acq_rel > > I really want to know the reason that why the methods of atomic can not > support all memory_orders. > > If I need the methods of the atomic<> support all memory_orders,how can i > do? > You are asking into the area of C++ where the fewest people in the world understand, namely relaxed atomics. Before I tell my limited understanding of the issue, I have an advice: - Use mutexes like boost::mutex to ensure all your accesses to variables shared among threads are not accessed concurrently, and you'll be fine. If your circumstance forces you to ignore the above advice (like me, e.g., when you cannot afford the scheduling overheads of mutexes), here is yet another advice which may save your life: - Make all your variables that can be accessed concurrently from multiple threads (with at least one thread writing) atomic. (This makes your program "data race free".) - Always use the default memory_order_seq_cst memory ordering for accesses to your atomics, never use anything else. If your circumstance forces you to ignore the above advices (unlike me, I just learn them because I haven't heard about the second advice before; you'll have to be writing for old ARM (i.e., ones without the LDA and STL instructions) or POWER for you to have a real reason to use relaxed atomics, I write for neither), here is what I have learnt. tl;dr The boost atomic doesn't support all memory ordering because the C++11 standard doesn't support all of them. The C++ standard doesn't support all memory ordering because not all make sense in the "memory model" supported by C++. It is not likely to change in the near future, i.e., unless some genius devises some novel memory model which changes the status quo. Here "memory model" means what "loads" from memory is allowed to return. Because of compiler and hardware optimization, writes (including atomic writes) to memory locations may be reordered, so the load doesn't always return "the last value stored". Special hardware instructions are necessary to ensure a particular ordering that the programmer needs. The easiest way to understand a program is that "All memory operations by all threads looks as if they are done one after another, interleaving among threads". But it proves to be too tricky for hardware to provide any reasonable performance for this model. The C++ memory model without relaxed atomics is essentially "All *atomic* memory operations by all threads looks as if they are done one after another, interleaving among threads. All other memory operations of each thread looks as if they are completely done between adjacent atomic memory operations. But the programmer guarantees not to write a data race. The compiler uses this assumption in all its work, and your program can break in all mysterious ways if you break this rule." This is essentially the illusion provided by sequential consistency. Everybody should want it. Except some don't, because in some architectures it is essentially impossible to provide sequential consistency efficiently. To do sequential consistency, one has to ensure that (1) the compiler doesn't reorder the statements written by the programmer, which is controllable by compiler writer; and (2) the hardware doesn't reorder the instructions generated by the compiler, which is damn hard. It usually means the compiler must insert memory fences before and after memory accesses (i.e., tell the CPU "don't return to me until everything I do up to this point are visible by all other CPUs" or "don't return to me until everything other CPUs do up to this point are visible by me"), which is very slow. It is particularly bad because for these architectures, fences must be inserted not just for atomic stores, but for the supposedly fast atomic loads as well. (Recent architectures do better because they link the requirement into the accesses of the particular memory location: the "particular memory location" here limits the scope where the "fences" have to do, and this makes a big difference in performance.) That's why relaxed atomics (i.e., memory_order_acq, etc) exists in the standard. They allow those architectures to perform better than using full sequential consistency in some common cases. Because different architectures require different sort of fences, it doesn't make sense for these to mean "insert a fence after the load". Instead, the C++ standard uses a more programmer centric view when defining relaxed memory ordering: - If a thread X stores a value with release semantics into an atomic variable, and another thread Y loads this value with acquire semantics from that same atomic variable, then everything done by thread X before this releasing store are guaranteed to be visible to thread Y after this acquiring load. There is no other semantics attached to the acquire and release. This is why acquiring stores and releasing loads are meaningless: they are not assigned any semantics. But the deeper reason for the lack is that the computer industry cannot find a way to give additional guarantee without incurring hefty performance overheads. And at the same time, sequentially consistent atomics are not so expensive in the new architectures. As for what to do if you want more than the above release-acquire guarantee: Simple, just use sequentially consistent atomic operations. Regards, Isaac -------------- next part -------------- HTML attachment scrubbed and removed ------------------------------ Subject: Digest Footer _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users ------------------------------ End of Boost-users Digest, Vol 4201, Issue 4 ********************************************

1 0

Can Boot MultiIndex help me?
by Paolo Bolzoni 23 Jul '15

23 Jul '15

Dear list, I needed a data structure such that: - a list of POD structs (with an Id and other fields) stays in contiguous memory. This is required because I need to pass this block of memory to a C function. - the order of this POD structs is irrelevant. - I need to access to each element from the Id quickly. So I implemented a class using std::map and std::vector; the vector contains the structs and the map associate between the ids and the vector position. The vector ensures C memory layout and the map gives the elements from the Id quickly. To delete an element I copy the last element in its position, update the map, and pop the vector back (of course there are some special cases, like deleting the last element... but you got the point) To add an element I push it back to the vector and update the map. It works fine, but a colleague mentioned that boost multiindex can do a similar job. I checked the documentation, but I am not sure I can build an index on a vector. Is that possible? Thanks. Your faithfully, Paolo

3 2

Re: [Boost-users] Subject:[atomic] why atomic<>::store method can not support memory_order_consum memory_order_acquire and memory_order_acq_rel
by Isaac To 23 Jul '15

23 Jul '15

On Thu, Jul 23, 2015 at 12:00 AM, "class7class(a)163.com" <class7class(a)163.com > wrote: > I found the the store() method can not support several memory_orders > metioned in the subject , and the other methods can not support all > memory_orders,such as: > 1.the load method can not support memory_order_release and > memory_order_acq_rel > 2. the compare_exchange_strong method can not support > memory_order_release and memory_order_acq_rel > 3. the compare_exchange_weak method can not support memory_order_release > and memory_order_acq_rel > > I really want to know the reason that why the methods of atomic can not > support all memory_orders. > > If I need the methods of the atomic<> support all memory_orders,how can i > do? > You are asking into the area of C++ where the fewest people in the world understand, namely relaxed atomics. Before I tell my limited understanding of the issue, I have an advice: - Use mutexes like boost::mutex to ensure all your accesses to variables shared among threads are not accessed concurrently, and you'll be fine. If your circumstance forces you to ignore the above advice (like me, e.g., when you cannot afford the scheduling overheads of mutexes), here is yet another advice which may save your life: - Make all your variables that can be accessed concurrently from multiple threads (with at least one thread writing) atomic. (This makes your program "data race free".) - Always use the default memory_order_seq_cst memory ordering for accesses to your atomics, never use anything else. If your circumstance forces you to ignore the above advices (unlike me, I just learn them because I haven't heard about the second advice before; you'll have to be writing for old ARM (i.e., ones without the LDA and STL instructions) or POWER for you to have a real reason to use relaxed atomics, I write for neither), here is what I have learnt. tl;dr The boost atomic doesn't support all memory ordering because the C++11 standard doesn't support all of them. The C++ standard doesn't support all memory ordering because not all make sense in the "memory model" supported by C++. It is not likely to change in the near future, i.e., unless some genius devises some novel memory model which changes the status quo. Here "memory model" means what "loads" from memory is allowed to return. Because of compiler and hardware optimization, writes (including atomic writes) to memory locations may be reordered, so the load doesn't always return "the last value stored". Special hardware instructions are necessary to ensure a particular ordering that the programmer needs. The easiest way to understand a program is that "All memory operations by all threads looks as if they are done one after another, interleaving among threads". But it proves to be too tricky for hardware to provide any reasonable performance for this model. The C++ memory model without relaxed atomics is essentially "All *atomic* memory operations by all threads looks as if they are done one after another, interleaving among threads. All other memory operations of each thread looks as if they are completely done between adjacent atomic memory operations. But the programmer guarantees not to write a data race. The compiler uses this assumption in all its work, and your program can break in all mysterious ways if you break this rule." This is essentially the illusion provided by sequential consistency. Everybody should want it. Except some don't, because in some architectures it is essentially impossible to provide sequential consistency efficiently. To do sequential consistency, one has to ensure that (1) the compiler doesn't reorder the statements written by the programmer, which is controllable by compiler writer; and (2) the hardware doesn't reorder the instructions generated by the compiler, which is damn hard. It usually means the compiler must insert memory fences before and after memory accesses (i.e., tell the CPU "don't return to me until everything I do up to this point are visible by all other CPUs" or "don't return to me until everything other CPUs do up to this point are visible by me"), which is very slow. It is particularly bad because for these architectures, fences must be inserted not just for atomic stores, but for the supposedly fast atomic loads as well. (Recent architectures do better because they link the requirement into the accesses of the particular memory location: the "particular memory location" here limits the scope where the "fences" have to do, and this makes a big difference in performance.) That's why relaxed atomics (i.e., memory_order_acq, etc) exists in the standard. They allow those architectures to perform better than using full sequential consistency in some common cases. Because different architectures require different sort of fences, it doesn't make sense for these to mean "insert a fence after the load". Instead, the C++ standard uses a more programmer centric view when defining relaxed memory ordering: - If a thread X stores a value with release semantics into an atomic variable, and another thread Y loads this value with acquire semantics from that same atomic variable, then everything done by thread X before this releasing store are guaranteed to be visible to thread Y after this acquiring load. There is no other semantics attached to the acquire and release. This is why acquiring stores and releasing loads are meaningless: they are not assigned any semantics. But the deeper reason for the lack is that the computer industry cannot find a way to give additional guarantee without incurring hefty performance overheads. And at the same time, sequentially consistent atomics are not so expensive in the new architectures. As for what to do if you want more than the above release-acquire guarantee: Simple, just use sequentially consistent atomic operations. Regards, Isaac

1 0

Subject:[atomic] why atomic<>::store method can not support memory_order_consum memory_order_acquire and memory_order_acq_rel these memory_orders?
by class7class＠163.com 23 Jul '15

23 Jul '15

Hello ! I am a SE and I program based on boost library, I have one question to ask as below: When I use the atomic library included boost , I coded as following: atomic<bool> flag; //declare the var flag.store(true,boost::memory_order_acq_rel); // use store method to change the value of flag but BOOST_ASSERT failed,and I read the code of base_atomic<> template class,I found the the store() method can not support several memory_orders metioned in the subject , and the other methods can not support all memory_orders,such as: 1.the load method can not support memory_order_release and memory_order_acq_rel 2. the compare_exchange_strong method can not support memory_order_release and memory_order_acq_rel 3. the compare_exchange_weak method can not support memory_order_release and memory_order_acq_rel I really want to know the reason that why the methods of atomic can not support all memory_orders. If I need the methods of the atomic<> support all memory_orders,how can i do? thank you very much! class7class(a)163.com

2 1

[Graph] Warning with boost 1.54, but not with 1.46.1 or 1.55
by Vicky Vergara 22 Jul '15

22 Jul '15

I have, with this code: 100: graph_traits<graph_t>::edge_iterator ei, eend; 101: for (tie(ei, eend) = boost::edges(graph); ei != eend; ei++) { I know this is not a major problem, as for the final release I will remove the -Wall flag from the compilation But then my question is why is the difference? Using boost 1.54 under Ubuntu 14.04 this warning shows on line 100 about variable ei /home/woodbri/work/pgrouting/src/apsp_johnson/src/apsp_johnson_boost_wrapper.cpp:100:40: warning: '*((void*)(& ei)+32).__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, Edge>*, std::vector<boost::detail::stored_edge_property<long unsigned int, Edge>, std::allocator<boost::detail::stored_edge_property<long unsigned int, Edge> > > >:: _M_current' may be used uninitialized in this function [-Wmaybe-uninitialized] graph_traits<graph_t>::edge_iterator ei, eend; the complete code can be found : https://github.com/pgRouting/pgrouting/blob/develop/src/apsp_johnson/src/ap… in the cmake the compiler flags are set like this: set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fPIC -O2 -g -Wall -std=c++0x -frounding-math -Wno-deprecated") Complete setup can be found: https://github.com/pgRouting/pgrouting/blob/develop_2_1_0/CMakeLists.txt#L2… This is a test that has boost 1.46.1, no warning shows I also don't get a warning with boost 1.55 https://travis-ci.org/pgRouting/pgrouting/jobs/72064827#L1834 The complete conversation of the problem can be found here: https://github.com/pgRouting/pgrouting/issues/373#issuecomment-123749888

1 0

Help with voronoi diagram
by rehouma 22 Jul '15

22 Jul '15

<http://boost.2283326.n4.nabble.com/file/n4678233/voronoi.png> I work on a project were I needed to generate the voronoi diagram (dashed lines = voronoi diagram). I used boost successfully. Now, I need to determine the coordinates of the output point e11 from the coordinates of the input point e1 and determine the coordinates of the other input point e12. Please help me, how can I do this. Thanks. -- View this message in context: http://boost.2283326.n4.nabble.com/Help-with-voronoi-diagram-tp4678233.html Sent from the Boost - Users mailing list archive at Nabble.com.

1 0