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

version control choice
by Mihir Thakkar 12 Dec '13

12 Dec '13

Hey all, I am using Ubuntu and Git. Would it be alright if I work on Git? Is everything available on Git repository as well?

2 1

slow exception handling
by XIN LI 12 Dec '13

12 Dec '13

Hi, In my code, I add some protection to catch the exception from boost like "catch (boost::archive::archive_exception& ex)", strangely, it slow exception handling, causing one of our tests to go from around 30 seconds to greater than 5 minutes. I did profiling and found "linear_searc_fdes" spent too much time when process exception now. Does anyone have similar experience, why this happen, and how to fix the problem? Thanks a lot! Best wishes, Andy Li

3 4

How do I build libraries with binaries using two versions of the same toolset
by Ted Byers 11 Dec '13

11 Dec '13

On my OpenSuse box, version 12.3, the default version of gcc is 4.7. I just successfully built gcc 4.8.2, with the binary names ending with 48 (so I have gcc48, g++48, &c.). So, I have two versions of gcc on this machine, and I believe I can use either by setting CC to the one or the other in my make files. Hence my problem. I have built boost 1.55.0 on my Ubuntu 12.04 box (but with the default names, so that gcc -v tells me that I am using gcc 4.8.2: the default version of gcc on that version of Ubuntu is 4.6, which is too old for me to consider). So, a basic build of the boost libraries is simple, and something I have done before. But I do not know how to build boost twice, once with gcc 4.7 and once with gcc 4.8.2, and have them installed in such a way as to ensure that the two builds do not clash and so that if I set CC to the one or the other version of gcc, the right build of boost will automagically be selected (it would be appreciated if someone who knows Gnu make better than I do could show me how to effect that in my makefiles). Obviously I am assuming that a single build of boost will not work with both compilers (is that assumption correct?). Unfortunately, I have not yet found anything in the documentation that talks about building boost with different versions of a given toolset on the same machine. Any help would be appreciated. Thanks Ted

2 3

[spirit::karma | variant] Nested Variants
by Aaron_Wright＠selinc.com 11 Dec '13

11 Dec '13

I am trying to use spirit::karma to generate a CSV file. I want to output a vector of variants. Unfortunately, I also want to add one more type to the variant; a string. So I was thinking I could nest variants. I can get this code to compile, but only the strings print out. What am I doing wrong? template< typename Iterator > class Generator : public boost::spirit::karma::grammar< Iterator, std::vector< boost::variant< std::string, boost::variant< bool, int > > >() > { public: Generator() : Generator::base_type(start) { using boost::spirit::karma::string; using boost::spirit::karma::bool_; using boost::spirit::karma::int_; using boost::spirit::karma::eol; start = (string | bool_ | int_) % Separator() << eol; } boost::spirit::karma::rule< Iterator, Csv_generator_input() > start; }; int main(int argc, char** argv) { std::vector< boost::variant< std::string, boost::variant< bool, int > > > values; values.push_back(std::string("Hello")); values.push_back(true); values.push_back(false); values.push_back(10); values.push_back(std::string("World")); std::string generated; std::back_insert_iterator< std::string > sink(generated); boost::spirit::karma::generate(sink, Generaator(), values); // generated == "Hello,World", Expected "Hello,true,false,10,World" return 0; } --- Aaron Wright

1 0

Problem using a filtered graph in the Ressource constrained shortest path user defined extension and dominance functions
by Berit Dangaard Brouer 11 Dec '13

11 Dec '13

Hi, In our use of the boost ressource constrained shortest path from Boost BGL, we define problem specific ressource extension and dominance function on a user defined graph type mcf_graph (source code is posted below) Our problem is the use of a filtered graph into the resource function. The forfeited edge filter stated in the code below, tries to remove some of the edges in order to speed up the algorithm. It seems that the resource and extension functions do not know how to deal with the filtered graph (I am guessing because they are not template functions), although the filtered graph contains the same Edge and Vertex definitions as the MCF graph, it is not typewise recognised as an mcf_graph, because it also contains the filter map. Is there any way I can work around this? I tried making the resource and extension functions into templates, but this is a problem because my edge bundled properties are problem specific. I would truly appreciate any suggestions as a filter is preferable to copying the graph. mcf_graph.h #ifndef MCF_GRAPH_HPP #define MCF_GRAPH_HPP #include <boost/config.hpp> #include <boost/graph/adjacency_list.hpp> #include <iostream> using namespace boost; using namespace std; struct Port { Port(int index=-1, int type=-1, int port_code=0, string UN="NN", string name="NN", int service_id=-1 ): m_index(index), m_type(type), m_port_code( port_code), UNLOCODE(UN), m_name(name), m_service_id(service_id) {} int m_index; int m_type;//0 port, 1 port call, 2 transhipment int m_port_code; string UNLOCODE; string m_name; int m_service_id; }; struct Edge { Edge( int id=-1, int type=-1, double weight=0.0, double cost=0.0, double dual_cost=0.0, double util=0.0, double cap=0.0, double r_cap=0.0, double tt=0.0 , int rot=-1) : m_idx(id), m_type(type), m_weight(weight) , m_cost(cost), m_dual_cost(dual_cost), m_utilization(util), m_capacity(cap), m_res_cap(r_cap), m_transittime(tt), m_rot(rot) {} unsigned int m_idx; int m_type;//0 is load edge, 1 is voyage edge, 2 forfeited edge (commodity link), 3 transhipment edge, 4 transhipment ring edge double m_weight; //distance double m_cost; //cost - only on load/unload/transhipment edges double m_dual_cost; double m_utilization; double m_capacity; double m_res_cap; //residual capacity double m_transittime; // transit time on edge with current speed double m_rot; // current rotation }; //Graph typedef adjacency_list< vecS , vecS , bidirectionalS, Port, Edge> mcf_graph; //descriptor typedefs typedef boost::graph_traits<mcf_graph>::vertex_descriptor vertex_descriptor; typedef boost::graph_traits<mcf_graph>::edge_descriptor edge_descriptor; //iterator typedefs typedef boost::graph_traits<mcf_graph>::vertex_iterator Viterator; typedef boost::graph_traits<mcf_graph>::edge_iterator Eiterator; typedef boost::graph_traits<mcf_graph>::in_edge_iterator IEiterator; typedef boost::graph_traits<mcf_graph>::out_edge_iterator OEiterator; template <typename edge_type_map> struct forfeited_edge_type { forfeited_edge_type() { } forfeited_edge_type( edge_type_map type) : forfeited(type) { } bool operator()(const edge_descriptor& e) const { return forfeited[e]==2; } edge_type_map forfeited; }; #endif And resource_extension and dominance functions here in res_path.h #ifndef RESPATH_H_ #define RESPATH_H_ #include <boost/config.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/r_c_shortest_paths.hpp> #include <iostream> #include "mcf_graph.h" #include "data.h" #include <boost/graph/graphviz.hpp> namespace std { class respath { public: respath(mcf_graph & m, Eiterator & comm); virtual ~respath(); private: mcf_graph & m_res_graph; Eiterator & commodities; }; // data structures for shortest path problem with transit time constraints (spptt) // ResourceContainer model struct spp_spptt_res_cont { spp_spptt_res_cont( double c = 0, double t = 0 ) : cost( c ), time( t ) {} spp_spptt_res_cont& operator=( const spp_spptt_res_cont& other ) { if( this == &other ) return *this; this->~spp_spptt_res_cont(); new( this ) spp_spptt_res_cont( other ); return *this; } double cost; double time; }; bool operator==( const spp_spptt_res_cont& res_cont_1,const spp_spptt_res_cont& res_cont_2 ){ return ( res_cont_1.cost == res_cont_2.cost && res_cont_1.time == res_cont_2.time ); } bool operator<( const spp_spptt_res_cont& res_cont_1,const spp_spptt_res_cont& res_cont_2 ) { if( res_cont_1.cost > res_cont_2.cost ) return false; if( res_cont_1.cost == res_cont_2.cost ) return res_cont_1.time < res_cont_2.time; return true; } // ResourceExtensionFunction model class ref_spptt { static double maxtt; public: static void setmaxtt(double tt){ maxtt=tt; } inline bool operator()( const mcf_graph& g, spp_spptt_res_cont& new_cont, const spp_spptt_res_cont& old_cont, boost::graph_traits <mcf_graph>::edge_descriptor ed) const { const Edge& arc_prop = get( edge_bundle, g )[ed]; new_cont.cost = old_cont.cost + arc_prop.m_cost; new_cont.time=old_cont.time + arc_prop.m_transittime; double& i_time = new_cont.time; return i_time <= (maxtt) ? true : false; } }; double ref_spptt::maxtt=0; // Dominance Function class dom_spptt { public: inline bool operator()( const spp_spptt_res_cont& res_cont_1, const spp_spptt_res_cont& res_cont_2 ) const { return res_cont_1.cost <= res_cont_2.cost && res_cont_1.time <= res_cont_2.time; } }; } /* namespace std */ #endif /* RESPATH_H_ */ -- Best Regards, Ph.D. Berit Dangaard Brouer Post Doc. DTU Management Engineering, Management Science Technical University of Denmark Department of Management Engineering Produktionstorvet, Bygning 426 2800 Kgs. Lyngby blof(a)dtu.dk <mailto:blof@man.dtu.dk> www.ms.man.dtu.dk <http://www.ms.man.dtu.dk> http://www.maersk.com/innovation/leadingthroughinnovation/enerplan/ Please read about the ENERPLAN project here <http://www.maersk.com/innovation/leadingthroughinnovation/enerplan/>

1 0

multi_index in managed_shared_memory
by Sebastien Nobert 11 Dec '13

11 Dec '13

Hi All, I'm trying to build a multi_index in managed shared memory with two (or more) hashed index but I get an "is an amiguous base of" error. I've already done that with one hash_uniq and a sequenced index and everything work fine. With two hashed index i get. boost/interprocess/detail/mpl.hpp:74:55: error: > ‘boost::multi_index::detail::hashed_index_node_impl<boost::interprocess::allocator<char, > boost::interprocess::segment_manager<char, > boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family>, > boost::interprocess::iset_index> > >’ is an ambiguous base of > ‘boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<element, > boost::interprocess::allocator<element, > boost::interprocess::segment_manager<char, > boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family>, > boost::interprocess::iset_index> > > > >’ > static const bool value = sizeof(dispatch(trigger())) == > sizeof(true_t); > With a hashed and an ordered index i get. boost/multi_index_container.hpp:161:52: error: no type named > ‘final_allocator_type’ in ‘boost::multi_index::multi_index_container< ... > and it ask me to attach the preprocessed file to my bug report. This is compiled on linux with gcc version 4.8.2 20131017 (Red Hat 4.8.2-1) (GCC) Should I open a bug report ? Am I doing something wrong ? Thanks a lot. Seb

3 4

[Log] Attribute formatting tricks ineffective -- my enums are printed as numbers.
by Andres Jaan Tack 11 Dec '13

11 Dec '13

I'm having some trouble with attribute formatting in boost::log that I haven't managed to figure out on my own. The case seems basic: I want to format my own severity enum as a string, for which I've produced the following (failing) example. Tested on clang-3.3 and clang-3.4 with boost-1.54 from macports, the minimal failing test produces the following output: $ clang++ --std=c++11 -c -DBOOST_ALL_DYN_LINK -I/opt/local/include/boost fail.cxx $ g++ -o fail -L/opt/local/lib -lboost_log-mt -lboost_log_setup-mt -lboost_system-mt -lboost_thread-mt fail.o $ ./fail 1: Booo! I would have expected "INFO: Booo!" according to my code. I've attached the complete fail.cxx here, in which I do all of: 1) Employ BOOST_LOG_ATTRIBUTE_KEYWORD, 2) Overload operator<< (std::ostream&, const my::severity&), 3) Overload operator<< (logging::formatting_ostream&, const logging::to_log_manip<...>&), and 4) Invoke register_simple_formatter_factory I can't find any guidance in the documentation or elsewhere on the internet that has managed to solve this -- Am I missing something obvious, or have I found a failing test case? -- Andres

1 0

Introduction
by Mihir Thakkar 10 Dec '13

10 Dec '13

Hello! I am new to open source, I know c++ and i am learning neural networks. I would like to contribute to boost c++ libraries. Please help me to get started. :)

2 1

Problem with linking files using boost::log with CMake Buildfile
by David Georg Reichelt 10 Dec '13

10 Dec '13

Hi, I've got problems compiling a program using boost with CMake (using Windows and MinGW 4.7.2, with -G "MinGW Makefiles"). Boost is compiled normaly with b2.exe --toolset=gcc --prefix=C:\cppLib\boost_1_55_0 and the folder seems to contain the right files. The original CMake-File compiled fine using Ubuntu. I've got a code using only boost::log and a CMake File containing the following boost-related-code: ADD_DEFINITIONS("-std=c++0x") SET(BOOST_ROOT "C:/cppLib/boost_1_55_0/") link_libraries (${Boost_LIBRARIES}) find_package( Boost 1.54.0 COMPONENTS log) if(Boost_FOUND) MESSAGE("Boost found") include_directories(${Boost_INCLUDE_DIRS}) add_executable(Hasselbrack ${AUTO_SOURCES}) endif() This code works right, but when I call make, I get the following errors: In file included from C:/cppLib/boost_1_55_0/boost/log/expressions/formatters/c_decorator.hpp:21:0, from C:/cppLib/boost_1_55_0/boost/log/expressions/formatters.hpp:29, from C:/cppLib/boost_1_55_0/boost/log/expressions.hpp:26, from C:\Users\DaGeRe\cpp\Minimalprojekt\main.cpp:3: C:/cppLib/boost_1_55_0/boost/log/detail/snprintf.hpp:45:9: Fehler: ╗::swprintf½ wurde nicht deklariert C:/cppLib/boost_1_55_0/boost/log/detail/snprintf.hpp:46:9: Fehler: ╗::vswprintf½ wurde nicht deklariert In file included from C:/cppLib/boost_1_55_0/boost/log/expressions/formatters.hpp:29:0, from C:/cppLib/boost_1_55_0/boost/log/expressions.hpp:26, from C:\Users\DaGeRe\cpp\Minimalprojekt\main.cpp:3: C:/cppLib/boost_1_55_0/boost/log/expressions/formatters/c_decorator.hpp: In statischer Elementfunktion ╗static std::size_t boost::log::v2s_mt_nt5::exp ressions::aux::c_decorator_traits<wchar_t>::print_escaped(wchar_t (&)[N], wchar_t)½: C:/cppLib/boost_1_55_0/boost/log/expressions/formatters/c_decorator.hpp:110:43: Fehler: ╗swprintf½ ist kein Element von ╗boost::log::v2s_mt_nt5::aux½ I tried to figure it out, the lines in snprintf are the following: using ::snprintf; using ::vsnprintf; but I can't find an error in this. The Include in the beginning of the file: #ifdef BOOST_LOG_USE_WCHAR_T #include <wchar.h> #endif // BOOST_LOG_USE_WCHAR_T seems to be exectued right (according to http://pubs.opengroup.org/onlinepubs/7990989775/xsh/wchar.h.html, snprintf is declared here). If I don't use ADD_DEFINITIONS("-std=c++0x"), I got the following errors: CMakeFiles\Hasselbrack.dir/objects.a(main.cpp.obj):main.cpp:(.text+0x12c): undefined reference to `boost::log::v2s_mt_nt5::core::get()' CMakeFiles\Hasselbrack.dir/objects.a(main.cpp.obj):main.cpp:(.text+0x143): undefined reference to `boost::log::v2s_mt_nt5::core::set_filter(boost::log ::v2s_mt_nt5::filter const&)' CMakeFiles\Hasselbrack.dir/objects.a(main.cpp.obj):main.cpp:(.text+0x1c7): undefined reference to `boost::log::v2s_mt_nt5::trivial::logger::get()' CMakeFiles\Hasselbrack.dir/objects.a(main.cpp.obj):main.cpp:(.text+0x20b): undefined reference to `boost::log::v2s_mt_nt5::trivial::logger::get()' CMakeFiles\Hasselbrack.dir/objects.a(main.cpp.obj):main.cpp:(.text+0x2e7): undefined reference to `std::ios_base::Init::~Init()' CMakeFiles\Hasselbrack.dir/objects.a(main.cpp.obj):main.cpp:(.text+0x308): undefined reference to `std::ios_base::Init::Init()' c:/mingw/bin/../lib/gcc/mingw32/4.7.2/../../../../mingw32/bin/ld.exe: CMakeFiles\Hasselbrack.dir/objects.a(main.cpp.obj): bad reloc address 0x1b in se ction `.text$_ZN5boost6detail15sp_counted_base7releaseEv[__ZN5boost6detail15sp_counted_base7releaseEv]' c:/mingw/bin/../lib/gcc/mingw32/4.7.2/../../../../mingw32/bin/ld.exe: final link failed: Invalid operation But nevertheless, boost is found and I can't figure out CMake seems to be unable to link it. The output of $(Boost_LIBRARIES) from CMake also seems correct: C:/cppLib/boost_1_55_0/stage/lib/libboost_log-mgw47-mt-1_55.dll . So I got no clue anymore what I could try. Has anybody an hint how to solve this? Best Regards, DaGeRe

4 8

Is the following use of boost::function<> safe?
by David Goodenough 10 Dec '13

10 Dec '13

Let me preface this with the note that the whole idea behind what I'm trying to do is invoke an arbitrary function in a new thread, optionally delaying the invocation by some number of milliseconds That said, ----- threadrun.h ----- #ifndef _THREADRUN_H_ #define _THREADRUN_H_ #include <boost/function.hpp> namespace Thread { void ThreadRun(boost::function<void()> const &job); void ThreadDelayedRun(boost::function<void()> const &job, unsigned int delay); }; #endif ----- threadrun.h ----- ----- threadrun.cpp ----- #include "threadrun.h" static void DelayedRun(boost::function<void()> job, unsigned int delay) { Sleepms(delay); // Routine available elsewhere that simply sleeps for delay ms job(); } namespace Thread { void ThreadRun(boost::function<void()> const &job) { boost::thread thr = boost::thread(job); thr.detach(); // Not really necessary, but it does make it explicit that we'll never wait for the thread to finish } void ThreadDelayedRun(boost::function<void()> const &job, unsigned int delay) { boost::thread thr = boost::thread(boost::bind(DelayedRun, job, delay)); thr.detach(); // Not really necessary, but it does make it explicit that we'll never wait for the thread to finish } }; ----- threadrun.cpp ----- Use cases would be: void myFunc(int a, int b) { ... } int myFunc1(int a, int b) { ... return x } Thread::ThreadRun(boost::bind(myFunc, 1000, 17)); Thread::ThreadDelayedRun(boost::bind(myFunc1, 2000, 42), 5000); This appears to work correctly, I'm currently using boost 1.54 - haven't build 1.55 yet, but will do so in the near future. My only concern is the second case where I have myFunc1() whose return type is int, yet in the prototype for ThreadDelayedRun() I'm making it look a whole lot like it's void. The return type ultimately doesn't matter since this is specifically designed to be a "fire and forget" system, which means that any return value will be lost, there's no way for the invoking thread to recover it. So, is there anything dangerous about what I'm doing?

3 2

Boost logo
by Oodini 10 Dec '13

10 Dec '13

Hello, I plan to do training about Boost, and so wanted to use the Boost logo on my slides. 1. Am I authorized to use the Boost logo ? 2. If so, where can I find it in a size larger from what I can see/find on the Boost site (ideally in a vectorial format) ? Thanks.

3 2

mixing c++98 with c++11
by Chris Stankevitz 09 Dec '13

09 Dec '13

Hello, Please consider the following: application A depends on boost compiled libraries application A depends on library B library B depends on boost compiled libraries Q1: Will I have a problem if: application A is compiled with gcc c++11 library B is compiled with gcc c++98 boost compiled with gcc c++98 Q2: Will I have a problem if: application A is compiled with gcc c++11 library B is compiled with gcc c++11 boost compiled with gcc c++98 My concern is that boost produces different code in its headers based on whether or not the compiler supports c++11. Thank you, Chris

3 4

Re: [Boost-users] [boost] [variant] Warning: variadic templates in boost::variant
by Igor R 09 Dec '13

09 Dec '13

> Development version of Boost.Variant library now uses C++11 variadic > templates when possible. > This leads to more compact binaries, more readable compiler error messages > and faster compilation times. Will it support MSVC12 (i.e. VS2013)? In particular, won't it be affected by the following bug: http://tinyurl.com/o2psdj5 ?

2 1

[boost] [variant] Warning: variadic templates in boost::variant
by Antony Polukhin 09 Dec '13

09 Dec '13

Development version of Boost.Variant library now uses C++11 variadic templates when possible. This leads to more compact binaries, more readable compiler error messages and faster compilation times. However this: * breaks ABI (now variant is declared as `template <typename T0, typename... TN> class variant`) * breaks user code that was explicitly using BOOST_VARIANT_LIMIT_TYPES Code that was using BOOST_VARIANT_ENUM_PARAMS and BOOST_VARIANT_ENUM_SHIFTED_PARAMS macro *must* work correctly without any modifications. To disable variadic templates usage in variant define BOOST_VARIANT_DO_NOT_USE_VARIADIC_TEMPLATES. When all the tests will pass successfully changes will be merged to master branch, so there is a high chance that variadic templates will be supported by Boost 1.56. In case of appearance of hard to fix variadic templates errors in Boost libraries dependent on Boost.Variant - report them in this letter and I'll help in resolving issues. -- Best regards, Antony Polukhin

1 0

C++Now 2014: Call for Submissions, Updated deadlines
by Hartmut Kaiser 09 Dec '13

09 Dec '13

Updated submission dates! Please see below! ============================================== C++ Now Conference 2014 Aspen CO, USA, May 12-17, 2014, www.cppnow.org ============================================== For the full announcement online, please see here: http://cppnow.org/2013/10/21/2014-call-for-submissions/ Call for Submissions -------------------- We invite you to submit session proposals to the 3rd annual C++Now Conference (Aspen CO, USA, May 12-17, 2014). Building upon the resounding success of C++Now 2013 and five years of BoostCon, C++Now 2014 will present leading speakers from the whole C++ community. The C++Now Conference is dedicated to discussion and education about C++, an open and free language and standard. Our Conference will focus on discussion and education about open source software usage and developments in the C++ developer and user community. To reflect the breadth of the C++ and Boost communities, the conference includes sessions aimed at three constituencies: C++ and Boost end-users, hard-core Boost library and tool developers, and researchers pushing the boundaries of computation. The program fosters interaction and engagement within and across those groups, with an emphasis on hands-on, participatory sessions. As a multi-paradigm language, C++ is a melting pot where the most compelling ideas from other programming communities are blended in powerful ways. Historically, some of the most popular sessions at C++Now have highlighted these concepts, from DSLs to functional programming to transactional memory and more. Bring your C#, Python, Ruby or Haskell influences to bear in an environment that will broaden their exposure. At C++Now 2014 we would like to focus on the now established C++11 standard and the new, upcoming C++14 and how those standards are and will shape C++'s future. However, by no means is this intended to restrict the topics of proposals we hope to see. Any other topic related to C++ as outlined below is perfectly fine for submission. Important dates --------------- New proposal submissions due: December 22th, 2013. Proposals decisions sent (tentative program available): February 15th, 2014. Fully scheduled program available: February 28th, 2014. Best Presentation Awards ------------------------ We know how much effort it takes to prepare talks for our conference. For this reason we will award the best The awards will be given based on the audience's voting. Each award will include the author's name listed on the cover of the C++Now website for that year and a plaque containing all the C++Now conference information. Session topics -------------- Topics of interest include, but are not restricted to, the following: * C++11/14 and how it changes life for users and library writers * General tutorial sessions on C++11/14, the C++11/14 Standards library, and one or more Boost libraries * Parallelism in the new C++11/14 standard * Parallel, distributed and GPGPU topics relating to C++ * In-depth sessions on using specific Boost libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Software development tools and their application to C++ and or Boost * Other topics likely to be of great interest to C++ users and developers Interactive and collaborative sessions are encouraged, as this is the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. Session formats --------------- Presentations Presentations focus on a practitioner's ideas and experience with anything relevant to C++11 or C++14, Boost and users. Panels Panels feature three or four people presenting their ideas and experiences relating to C++11 or C++14 and Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials Tutorials are sessions at which instructors teach conference participants specific skills relevant to C++11 or C++14 and Boost. Workshops Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems in Boost libraries. Tool Vendors Presentations We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. Submitting a proposal --------------------- Standard sessions are 90 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 90 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other. * A paragraph or two describing the topic covered, suitable for the conference web site. * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half day, full day. * Alternate lengths, if you are willing to make adjustments: 10-20 minute short-talks, 45 minutes, 90 minutes, half-day, full day. * Audience: users, developers, both. * Level: basic, intermediate, advanced. * A biography, suitable for the conference web site. * A photo of about 150 x 150 * Your public contact information (twitter handle, blog, website, google plus, etc.) * Your contact information (will not be made public). Submission details ------------------ All submissions should be made through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=cppnow2014. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited (but are not required) to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted proposals will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the C++ Now website and will be available to attendees. For general information on the C++ Now 2014 paper submission or the scope of technical papers solicited; please refer to the conference website at www.cppnow.org. For any other questions about the submission process or paper format, please contact the Program Committee at cppnow2014(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to C++ Now. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) Joel Falcou, email: joel.falcou(a)lri.fr (Program Committee Co-Chair) Jon Kalb, , email: jon(a)kalbweb.com (Conference Chair) Dave Abrahams, dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

Thread synchronization
by Gonzalo Garramuno 08 Dec '13

08 Dec '13

I have an application (a video player), that uses three threads to play videos (one thread handles decoding, another video display, and another audio). These threads have a thread barrier to wait until all 3 threads finish. This works fine. Now, my video player supports playing back two movies at the same time (to have one as a background and one as a foreground). Currently this is done with the same code for both. My problem is that there's no sync between the two movies and I am puzzled on how to achieve synchronism. I am unsure whether a thread barrier can be waited twice by two threads or whether I should have a single barrier that waits on the 6 threads ( 2 decode, 2 video, 2 audio ). If someone has any insight, it would be appreciated.

2 3

boost::iostreams::copy - sink - ENOSPC (No space left on device) error handling
by Dino Korah 07 Dec '13

07 Dec '13

Platform: GCC on Linux; boost 1.55. In the code fragment below, is there a way to handle ENOSPC? #include <fstream> #include <iostream> #include <boost/iostreams/filtering_streambuf.hpp> #include <boost/iostreams/copy.hpp> #include <boost/iostreams/filter/bzip2.hpp> // open input file stream of the bzip2 file std::ifstream ifs("file.bz2"); // open output stream to the "full" device // full device is a "utility-device" to check how applications handle ENOSPC // more details in "man full" std::ofstream ofs("/dev/full"); // Setup the iostreams filter boost::iostreams::filtering_streambuf<boost::iostreams::output> filters; filters.push(boost::iostreams::bzip2_decompressor()); filters.push(ofs); // "run" the filter boost::iostreams::copy(ifs, filters); If I do strace of the compiled binary, the code seem to infinitely call writev() with the same data and returns ENOSPC error. writev(4, [{NULL, 0}, {"DATA DATA "..., 4096}], 2) = -1 ENOSPC (No space left on device) How can this error be handled or made thrown as an error from boost::iostreams::copy() Is it possible to set appropriate exceptions() on the ofstream object? I tried ofs.exceptions(std::ios::badbit | std::ios::failbit) but it didn't make any difference.

2 1

one memory leak
by XIN LI 06 Dec '13

06 Dec '13

Hi there, I use boost version 1.49.0. I meet a memory leak for below sentences: boost::filesystem::path tmp = input.stem(); string strDir = tmp.normalize().string(); Valgrind report memory leak as below: ==18299== 56 bytes in 1 blocks are still reachable in loss record 26 of 61 ==18299== at 0x16DF68B8: malloc (vg_replace_malloc.c:270) ==18299== by 0x3F64FEC: operator new(unsigned long) (in /home/lixin/work/prj/hotfix/13q2_ehf1/src/prosim/dist/Debug_64/GNU-Linux-x86/nanospice) ==18299== by 0x3F5B8F1: stlp_std::priv::__acquire_category(char const*&, char*, _Locale_name_hint*, char const* (*)(char const*, char*, _Locale_name_hint*, int*), void* (*)(char const*, _Locale_name_hint*, int*), char const* (*)(char*), stlp_std::hash_map<stlp_std::basic_string<char, stlp_std::char_traits<char>, stlp_std::allocator<char> >, stlp_std::pair<void*, unsigned long>, stlp_std::hash<stlp_std::basic_string<char, stlp_std::char_traits<char>, stlp_std::allocator<char> > >, stlp_std::equal_to<stlp_std::basic_string<char, stlp_std::char_traits<char>, stlp_std::allocator<char> > >, stlp_std::allocator<stlp_std::pair<stlp_std::basic_string<char, stlp_std::char_traits<char>, stlp_std::allocator<char> > const, stlp_std::pair<void*, unsigned long> > > >**, int*) (in /home/lixin/work/prj/hotfix/13q2_ehf1/src/prosim/dist/Debug_64/GNU-Linux-x86/nanospice) ==18299== by 0x3F5BD04: stlp_std::priv::__acquire_ctype(char const*&, char*, _Locale_name_hint*, int*) (in /home/lixin/work/prj/hotfix/13q2_ehf1/src/prosim/dist/Debug_64/GNU-Linux-x86/nanospice) ==18299== by 0x3F3F502: stlp_std::_Locale_impl::insert_ctype_facets(char const*&, char*, _Locale_name_hint*) (in /home/lixin/work/prj/hotfix/13q2_ehf1/src/prosim/dist/Debug_64/GNU-Linux-x86/nanospice) ==18299== by 0x3F3DC3C: stlp_std::locale::locale(char const*) (in /home/lixin/work/prj/hotfix/13q2_ehf1/src/prosim/dist/Debug_64/GNU-Linux-x86/nanospice) ==18299== by 0x458FFFE: boost::filesystem3::path::wchar_t_codecvt_facet() (in /home/lixin/work/prj/hotfix/13q2_ehf1/src/prosim/dist/Debug_64/GNU-Linux-x86/nanospice) ==18299== by 0x4591806: boost::filesystem3::path::begin() const (in /home/lixin/work/prj/hotfix/13q2_ehf1/src/prosim/dist/Debug_64/GNU-Linux-x86/nanospice) ==18299== by 0x4592844: boost::filesystem3::path::m_normalize() (in /home/lixin/work/prj/hotfix/13q2_ehf1/src/prosim/dist/Debug_64/GNU-Linux-x86/nanospice) ==18299== by 0x21019EB: boost::filesystem3::path::normalize() (path.hpp:430) Because my program need run thousands of time and very sensitive for the memory leak. Could anyone help to suggest one way to avoid such memory leak? Thanks a lot! Best wishes, Andy Li

2 1

[log] Sink format is ignored
by Igor R 06 Dec '13

06 Dec '13

Hello, I'm setting up a sink like this: boost::shared_ptr<sinks::text_file_backend> backend = boost::make_shared<sinks::text_file_backend> ( keywords::file_name = fileName, keywords::rotation_size = maxSize, keywords::format = "[%TimeStamp%][%LineID%]: %Message%", keywords::auto_flush = true ); typedef sinks::synchronous_sink<sinks::text_file_backend> file_sink; boost::shared_ptr<file_sink> sink = boost::make_shared<file_sink>(backend); sink->set_filter(!expr::has_attr(serv_attr)); logging::core::get()->add_sink(sink); logging::add_common_attributes(); However, it seems that keywords::format parameter is just ignored. What am I doing wrong?

3 3

Re: [Boost-users] [graph] Compilation problem using depth_first_visit with a listS as a VertexListS
by Simon Bozonnet 06 Dec '13

06 Dec '13

Thanks Alex, I finally understood that using std::vec and std::list is different in the way that we need to specify an index for the edges/nodes while using such a routine like depth_first_visit. Thanks for your help! Simon > From that I isolated the following code which compiles without any problem: > > typedef adjacency_list < vecS, vecS, bidirectionalS, GraphvizVertexProperty,GraphvizEdgeProperty, GraphvizGraphProperty > Graph; > ... > depth_first_visit(_graph2, loop_head, default_dfs_visitor(), make_iterator_property_map(reachable_from_head.begin(),get(vertex_index, _graph2), c)); > So this works fine! > Then, I would like to change the type of graph, so more precisely, to use a std::list (or listS) instead of a std..vector (vecS) for the VertexListS > So the first line declaration becomes: > typedef adjacency_list < vecS, listS, bidirectionalS,GraphvizVertexProperty,GraphvizEdgeProperty, GraphvizGraphProperty > Graph; > //only the 2nd argument changes > But then when I compile the code, I get 1 error during the compilation as described hereafter. "If the VertexList of the graph is vecS, then the graph has a builtin vertex indices accessed via the property map for the vertex_index_t property." (http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/adjacency_list.html <http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/adjacency_list.html>) So when you use listS instead you have to supply your own vertex index map.

1 0

Fwd: support for bjam projects in IDE
by Witold E Wolski 06 Dec '13

06 Dec '13

Hi, I will have to work on bjam based project (rather big). I normally use QT Creator for programming and work with cmake based project. I could't find any hint how to set up an bjam project to work with QT neither information about any IDE which supports bjam. Do boost developer use vim and debug using gdb only? Actually the other guys on the project wrote some python scripts which parse bjam output to generated vcproj files :-@ I would be happy to hear from someone who are happy using bjam with qtcreator or any other IDE for larger projects and how to set this up. All my searches so far regarding bjam return almost exclusively FUD (http://en.wikipedia.org/wiki/Fear,_uncertainty_and_doubt) but looking at the Jamroot.jam file of the project (more than 1000 lines) I am inclinded to believe it. ;-( -- Witold Eryk Wolski -- Witold Eryk Wolski

2 2

Await the result of several futures to chain another task
by Kaspar Fischer 06 Dec '13

06 Dec '13

Hi, If I have two futures f1 and f2, can I compose them to a future that completes with the result of f1 and f2 when both f1 and f2 have finished? I'd like to have a future so that I can use the then()<http://www.boost.org/doc/libs/1_55_0/doc/html/thread/synchronization.html#t…>method to run another transformation. I see method wait_for_all()<http://www.boost.org/doc/libs/1_55_0/doc/html/thread/synchronization.html#t…>but this method blocks. Best, Kaspar

2 2

[serialization] How to deserialize only a part of an XML archive?
by luca 05 Dec '13

05 Dec '13

This is my scenario: I've got a shared library in which these classes are defined: class base { ... serialize() ... } class parent: public base { ... serialize(...) {...serialize base. and itselft too!} ... } the shared lib is used by a computational application that re-implements class parent in an extended version - this because the app is a Qt application that does visualization etc...: class grandParent: public parent { //it also defines some specific serialization capabilities: serialize (...) {serialize parent and also itself} } Now if I serialize into an XML archive an instance of grandParent I am clarly able to deserialize it in a grandParent object, but what about to deserialize it as a parent object? if I serialize from grandParent I would get something like: <grandParent> <parent> <base> </base> </parent> </grandParent> I would need to deserialize only the parent part: <parent> <base> </base> </parent> In practice I would like to be able to deserialize an XML archive to a base class instead that to the derived. But in this case the derived class is not accessible by boost (that thus complains about it) In this way I would get the better inter-operability between my application and the underlaying lib, that must be able to run without the app itself... Many thanks! Luca

1 0

Re: [Boost-users] [graph] Compilation problem using depth_first_visit with a listS as a VertexListS
by alex 05 Dec '13

05 Dec '13

> From that I isolated the following code which compiles without any problem: > > typedef adjacency_list < vecS, vecS, bidirectionalS,GraphvizVertexProperty,GraphvizEdgeProperty, GraphvizGraphProperty > Graph; > ... > depth_first_visit(_graph2, loop_head, default_dfs_visitor(), make_iterator_property_map(reachable_from_head.begin(),get(vertex_index, _graph2), c)); > So this works fine! > Then, I would like to change the type of graph, so more precisely, to use a std::list (or listS) instead of a std..vector (vecS) for the VertexListS > So the first line declaration becomes: > typedef adjacency_list < vecS, listS, bidirectionalS,GraphvizVertexProperty,GraphvizEdgeProperty, GraphvizGraphProperty > Graph; > //only the 2nd argument changes > But then when I compile the code, I get 1 error during the compilation as described hereafter. "If the VertexList of the graph is vecS, then the graph has a builtin vertex indices accessed via the property map for the vertex_index_t property." (http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/adjacency_list.html) So when you use listS instead you have to supply your own vertex index map.

1 0

[log] ThreadID attribute is empty
by Igor R 05 Dec '13

05 Dec '13

Hello, I'm formatting a sink like this: sink->set_formatter ( expr::stream << expr::attr<boost::posix_time::ptime>("TimeStamp") << " T:" << expr::attr<boost::thread::id>("ThreadID") << ":" << expr::smessage ); logging::add_common_attributes(); For some reason ThreadID is empty. I tried to register the attribute explicitly: logging::core::get()->add_global_attribute("ThreadID", logging::attributes::current_thread_id()); but it doesn't help. The program is mutithreaded and linked with mt static libs. Thanks.

1 0

Having trouble compiling interval_map
by Daniel Rubi 05 Dec '13

05 Dec '13

Hi, I'm trying to implement an interval map where the keys are close_interval<long> an the values are set<string>. I modified the party example according to my needs, and came up with this short code: #include <boost/icl/interval.hpp> #include <boost/icl/interval_map.hpp> #include <boost/compressed_pair.hpp> using namespace std; using namespace boost::icl; typedef std::set<string> ids; int main(int argc, char* argv[]) { ids ids1; ids1.insert("T1"); ids ids2; ids2.insert("T2"); interval_map<closed_interval<long>, ids> mymap; closed_interval<long> i1 = closed_interval<long>(2, 7); closed_interval<long> i2 = closed_interval<long>(3, 8); mymap.insert(std::pair<closed_interval<long>, ids>(i1,ids1)); mymap.insert(std::pair<closed_interval<long>, ids>(i2,ids2)); return 0; } However, I get this compilation error: call of overloaded ‘insert(std::pair<boost::icl::closed_interval<long int>, std::set<std::basic_string<char> > >)’ is ambiguous mymap.insert(std::pair<closed_interval<long>, ids>(i2,ids2)); This is after getting compiation errors trying ti use: mymap += make_pair(i1,ids1); Any idea what's wrong?

1 0

[Any] inconsistent return types of any_cast overloads
by Arne Vogel 04 Dec '13

04 Dec '13

Hello Boost Users, Code like the following used to work with Boost 1.53 on x86-64 Linux using GCC 4.7 and -std=c++11: boost::any makeVec() { return std::vector<int>{ 1, 2, 3 }; } void foo() { const auto& vec = boost::any_cast<std::vector<int>>(makeVec()); for ( auto value : vec ) { // ... } } The same code is likely to cause a segmentation violation using Boost 1.55. According to the online documentation *1, any_cast has two overloads accepting reference arguments: template<typename ValueType> ValueType any_cast(any&); template<typename ValueType> ValueType any_cast(const any&); If these were indeed the only overloads accepting reference arguments, there is no reason why the example code shouldn't work. ValueType any_cast(const any&) should be the preferred overload and it returns a vector<int> temporary whose lifetime is then extended to the end of the block by being bound to a local const reference, as required by the C++ standard. However, in any.hpp, I discovered the following overload, which is only declared if the macro BOOST_NO_CXX11_RVALUE_REFERENCES is not set. I suppose this overload was added since 1.53, or that, previously, it was by default omitted. template<typename ValueType> ValueType&& any_cast(any&&); This has higher precedence binding to the temporary returned from makeVec, and returns an rvalue reference to the vector<int> contained in said temporary, which is then implicitly converted to a const lvalue reference as by the usual language rules. Since the lifetime of the temporary returned by makeVec is NOT extended - this only works for temporaries directly bound to a local const reference, whereas the result of makeVec is "hidden" inside the call to any_cast - the temporary is destroyed before the start of the for loop, which renders vec invalid and the code a denizen of undefined behavior land. So much for the analysis, now for my actual question. :-) Why does the new overload return by reference when the old ones return by value? The rationale for the old overloads was, I believe, "you should have to ask for a reference if you want one", which makes sense given precisely that using references tends to be more error prone if temporaries are involved. So this would be the very reason why Any does not declare: template<typename ValueType> const ValueType& any_cast(const any&); even though it could be implemented as easily as the actual overload. If I really wanted to get an const reference out of any_cast, I could write something like boost::any_cast<const ValueType&>(var); I can't think of a reason to be inconsistent in this regard and return a reference if a temporary is passed to any_cast, instead of requiring a user who really wants any_cast to return an rvalue reference to write any_cast<ValueType&&>(...). That the overload breaks existing code and (due to being undocumented and not checked at compile time *2), silently so, whereas using ValueType any_cast(any&&) would at least fail to do any harm, is, in my opinion, another reason to be sceptical of the current solution. Furthermore, there is a usability reason for preferring ValueType(any &&): If ValueType &&(any &&) is declared and I do NOT want a reference, I need to write more verbose and inelegant code than in the opposite case: // Name the temporary const auto &vecAny = makeVec(); // Now, ValueType&& any_cast(any&&) is eliminated from candidate set (no conversion from an lvalue to an rvalue reference) const auto& vec = boost::any_cast<std::vector<int>>(vecAny); Note that the const is accidental here, using a mutable lvalue would work as well. Looking forward to your opinions, Arne Vogel *1) http://www.boost.org/doc/libs/1_55_0/doc/html/boost/any_cast_idp25247624.ht… *2) A compiler may issue a warning. However, I found that GCC 4.8.1 does not warn, even with -Wall and the definition of any_cast being known at the point of use.

5 6

boost::regex Character set including braces
by Tobias 04 Dec '13

04 Dec '13

Dear boost-users, in the post http://stackoverflow.com/questions/20351369/regular-expression-cant-find-seq uence-of-numbers I discovered that if one uses an closing bracket as the first character of a character class the character class includes this bracket. This works with the standard setting of boost::regex (i.e., perl-regular expressions) but it is not documented in the manual page http://www.boost.org/doc/libs/1_55_0/libs/regex/doc/html/boost_regex/syntax/ perl_syntax.html#boost_regex.syntax.perl_syntax.character_sets Is this an undocumented feature, a bug or did I misinterpret something in the manual? The version information in version.hpp is: #define BOOST_LIB_VERSION "1_53" Info: I tried this specification of the bracket in the character set because I am used to it from emacs regular expressions. In the remainder there follows a program for reproduction of the phenomenon: #include <string> #include <boost/regex.hpp> #include <iostream> using namespace std; int main() { std::cout << "main()\n"; string s = "98[2]00"; string exp = "^[][0-9]*$"; const boost::regex e(exp); bool isSequence = boost::regex_match(s,e); //isSequence is boolean and should be equal to 1 cout << isSequence << endl; return 0; } /** Local Variables: compile-command: "g++ -g test.cc -o test.exe -lboost_regex-mt; ./test.exe" End: */ Best regards / Mit freundlichen Grüßen Tobias Zawada Engineering / Software Development ______________________________ ITI Events We say Thank you! for an outstanding ITI Symposium 2013! Make sure you save the date for next year: November 3-5, 2014 www.itisim.com ITI GmbH Schweriner Straße 1 01067 Dresden Germany T +49 (351) 26050 147 F +49 (351) 260 50 155 mailto:Zawada@itisim.com Managing Director/Geschäftsführer Jens O. Schindler · Dr. Andreas Uhlig Commercial Register/Handelsregister Amtsgericht Dresden · HRB 2331 USt.-IdNr.: DE140297717 Diese E-Mail ist streng vertraulich und nur für den Empfänger bestimmt. Sie kann Informationen enthalten, die rechtliche, geschäftliche oder andere Vergünstigungen bedeuten. Sollten Sie nicht der ausdrückliche Empfänger sein, dürfen Sie diese Informationen nicht benutzen, veröffentlichen oder vervielfältigen. The information in this e-mail is strictly confidential, is intended solely for the addressee, and may be privileged. If you are not the intended addressee you must not disclose, print or take action based upon this transmission and should delete it from your system.

2 1

[Filesystem] [Locale] Unicode filenames doc example error
by Egor Tensin 04 Dec '13

04 Dec '13

Why doesn't this simple code from the Boost.Locale docs work? #include <boost/filesystem.hpp> #include <boost/filesystem/fstream.hpp> #include <boost/locale.hpp> #include <exception> #include <iostream> int main() { try { std::locale::global(boost::locale::generator().generate("")); boost::filesystem::path::imbue(std::locale()); boost::filesystem::ofstream hello("привет.txt"); } catch (const std::exception& e) { std::cerr << e.what() << std::endl; } return 0; } Compiled with >cl /EHsc /D _UNICODE /D UNICODE b.cpp /I%BOOST_ROOT% /MD /link /LIBPATH:%BOOST_ROOT%\stage\lib it gives me >b.exe boost::filesystem::path codecvt to wstring: error Could someone please explain what's the problem there and how do I handle Unicode file names on Windows using Boost.Filesystem & Boost.Locale? I'm using Boost 1.55.0 & compiling with MS Visual C++ 2010 compiler v.16.00.30319.01.

1 0

[log] connecting a logger to a specific sink
by Igor R 04 Dec '13

04 Dec '13

Hello, I'm integrating Boost.Log to my project, and have a couple of questions. First of all, I'd like each instance of some class to write its log to a separate rotating file. I understand how to setup such a sink, but can't find a way to connect a particular source (logger) to the sink. Is it possible? Besides, when setting up the file, I configure it with: keywords::format = "[%TimeStamp%]: %Message%" but %TimeStamp% doesn't seem to get recognized, so I get empty [ ] in the file. Do I miss some header file? Thanks.

2 4

Print boost graph with custom vertex label
by Saha, Shambwaditya 04 Dec '13

04 Dec '13

Hi All, I want to print a Boost Graph having custom(string) vertex labels instead of the default vertex numbering label 0,1,2... I have initialized the graph as : typedef adjacency_list <vecS, vecS, directedS, property<vertex_name_t,string>> Graph; Graph g; set<string> names; map<string,Graph::vertex_descriptor> vertex ; for(auto it = names.begin() ; it != names.end(); ++it ) vertex[*it] = add_vertex(*it,g) ; Now how should I print this graph such that I get edges of the form abc -> xyz; instead of 1->2; Thanks and Regards, Shambwaditya

1 0

[phoenix][spirit] catch_all issues in V3
by Igor R 03 Dec '13

03 Dec '13

Hello, The following code doesn't compile (MSVC10, Boost 1.55). If I modify "catch_all" line like this: query = id[phx::try_[qi::_val = phx::bind(&string2test, qi::_1)].catch_all [ qi::_pass = false ], qi::_val = qi::_val ]; ...it compiles, but doesn't seem to invoke the semantic action in runtime. It there a workaround that would both compile and work? Thanks! #define BOOST_SPIRIT_USE_PHOENIX_V3 #include <string> #include <boost/spirit/include/qi.hpp> #include <boost/spirit/include/phoenix_core.hpp> #include <boost/spirit/include/phoenix_operator.hpp> #include <boost/phoenix/bind/bind_function.hpp> #include <boost/phoenix/statement/try_catch.hpp> namespace qi = boost::spirit::qi; namespace phx = boost::phoenix; struct test { }; test string2test(const std::string &str) { if (str == "throw") throw "exception!"; return test(); } template <typename Iterator = std::string::const_iterator> struct test_parser : qi::grammar<Iterator, test(), qi::blank_type> { test_parser() : test_parser::base_type(query) { query = id[phx::try_[qi::_val = phx::bind(&string2test, qi::_1)].catch_all [ qi::_pass = false ] ]; id = qi::lexeme[*qi::char_("a-zA-Z_0-9")]; } qi::rule<Iterator, test(), qi::blank_type> query; qi::rule<Iterator, std::string(), qi::blank_type> id; }; int main() { const std::string input = "qwerty"; test_parser<> p; test output; bool ok = phrase_parse(input.begin(), input.end(), p, qi::blank, output); } // 1> boost\boost\proto\traits.hpp(297): error C2338: 0 == Expr::proto_arity_c 1> boost\boost\mpl\eval_if.hpp(63) : see reference to class template instantiation 'boost::proto::result_of::value<Expr>' being compiled 1> with 1> [ 1> Expr=boost::phoenix::try_catch_actor<boost::proto::exprns_::basic_expr<boost::phoenix::tag::try_catch,boost::proto::argsns_::list2<boost::phoenix::try_catch_actor<boost::proto::exprns_::basic_expr<boost::phoenix::tag::try_catch,boost::proto::argsns_::list1<boost::phoenix::actor<boost::proto::exprns_::expr<boost::proto::tagns_::tag::assign,boost::proto::argsns_::list2<boost::proto::exprns_::expr<boost::proto::tagns_::tag::terminal,boost::proto::argsns_::term<boost::spirit::attribute<0>>,0>,boost::phoenix::actor<boost::proto::exprns_::basic_expr<boost::phoenix::detail::tag::function_eval,boost::proto::argsns_::list2<boost::proto::exprns_::basic_expr<boost::proto::tagns_::tag::terminal,boost::proto::argsns_::term<boost::phoenix::detail::function_ptr<1,test,test (__cdecl *)(const std::string &)>>,0>,boost::phoenix::actor<boost::spirit::argument<0>>>,2>>>,2>>>,1>>,boost::proto::exprns_::basic_expr<boost::phoenix::tag::catch_all,boost::proto::argsns_::list1<boost::phoenix::actor<boost::proto::exprns_::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<3>>,0>,boost::phoenix::actor<boost::proto::exprns_::expr<boost::proto::tagns_::tag::terminal,boost::proto::argsns_::term<bool>,0>>>,2>>>,1>>,2>> 1> ]

2 3

[graph] Compilation problem using depth_first_visit with a listS as a VertexListS
by Simon Bozonnet 03 Dec '13

03 Dec '13

Hi There, I am struggling with BOOST while trying to link them with my code. Actually I start while using "loops_dfs.cpp" as an example. >From that I isolated the following code which compiles without any problem: typedef adjacency_list < vecS, vecS, bidirectionalS,GraphvizVertexProperty,GraphvizEdgeProperty, GraphvizGraphProperty > Graph; Graph _graph2; typedef color_traits < default_color_type > Color; typedef graph_traits < Graph >::vertex_descriptor VertexType; typedef graph_traits < Graph >::edge_descriptor EdgeType; EdgeType back_edge;//ok I know it is empty but it just to try the compilation!! VertexType loop_head, loop_tail; loop_tail = source(back_edge, _graph2); loop_head = target(back_edge, _graph2); std::vector < default_color_type > reachable_from_head(num_vertices(_graph2), Color::white()); default_color_type c; depth_first_visit(_graph2, loop_head, default_dfs_visitor(), make_iterator_property_map(reachable_from_head.begin(),get(vertex_index, _graph2), c)); So this works fine! Then, I would like to change the type of graph, so more precisely, to use a std::list (or listS) instead of a std..vector (vecS) for the VertexListS So the first line declaration becomes: typedef adjacency_list < vecS, listS, bidirectionalS,GraphvizVertexProperty,GraphvizEdgeProperty, GraphvizGraphProperty > Graph; //only the 2nd argument changes But then when I compile the code, I get 1 error during the compilation as described hereafter. Since I am fighting for more than one day now on this problem, I would **really** appreciate if someone can give me more explanations and/or advice to solve my problem... Thanks in advance, Simon 1>boost/property_map.hpp(351) : error C2679: binary '+' : no operator found which takes a right-hand operand of type 'boost::detail::error_property_not_found' 1>(or there is no acceptable conversion) 1> C:\Program Files (x86)\Microsoft Visual Studio 8\VC\include\vector(366): could be 'std::_Vector_iterator<_Ty,_Alloc> std::_Vector_iterator<_Ty,_Alloc>::operator +(__w64 int) const' 1> with 1> [ 1> _Ty=boost::default_color_type, 1> _Alloc=std::allocator<boost::default_color_type> 1> ] 1> while trying to match the argument list '(const std::_Vector_iterator<_Ty,_Alloc>, boost::detail::error_property_not_found)' 1> with 1> [ 1> _Ty=boost::default_color_type, 1> _Alloc=std::allocator<boost::default_color_type> 1> ] 1> \inc\boost/property_map.hpp(351) : while compiling class template member function 'boost::default_color_type boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>::operator [](void *) const' 1> with 1> [ 1> RandomAccessIterator=std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>, 1> IndexMap=boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,LatticeNode,LatticeArc>,boost::detail::error_property_not_found,boost::detail::error_property_not_found &,boost::vertex_index_t>, 1> T=boost::default_color_type, 1> R=boost::default_color_type & 1> ] 1> ..\test.cpp(18) : see reference to class template instantiation 'boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>' being compiled 1> with 1> [ 1> RandomAccessIterator=std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>, 1> 1> IndexMap=boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,LatticeNode,LatticeArc>,boost::detail::error_property_not_found,boost::detail::error_property_not_found &,boost::vertex_index_t>, 1> T=boost::default_color_type, 1> R=boost::default_color_type & 1> ]

1 0

[ANN] C++Now 2014: 5 Days to Submissions Deadline
by Boris Kolpackov 03 Dec '13

03 Dec '13

Hi, Only 5 days left before the submissions deadline for C++Now 2014! C++Now is a general C++ conference for C++ experts and enthusiasts. It is not specific to any library/framework or compiler vendor and has three tracks with presentations ranging from hands-on, practical tutorials to advanced C++ design and development techniques. For more information about C++Now, see the conference's website: http://cppnow.org/about/ Have you learned something interesting about C++ (e.g., a new technique possible in C++11)? Or maybe you have implemented something cool related to C++ (e.g., a C++ library)? If so, consider sharing it with other C++ enthusiasts by giving a talk at C++Now 2014. For more information on possible topics, formats, etc., see the call for submissions: http://cppnow.org/2013/10/21/2014-call-for-submissions/ Boris

1 0

Re: [Boost-users] [Thread] Using thread accross libraries
by Sébastien Gallou 02 Dec '13

02 Dec '13

> > You are linking to the static Boost.Thread library. This means that > you've got two distinct Boost.Thread libraries loaded into your process, > one into the executable and one in the DLL. Thanks Lars, you solve my problem. Effectively, I was linking with the static lib. When I was looking how to build shared libs, I found in the boost documentation that shared build should be the default. http://www.boost.org/boost-build2/doc/html/bbv2/tutorial/linkage.html I'm under Windows, and without add link=shared to the b2 command line, the build is static. Next was the problem to link my app with boost. It was necessary to define BOOST_ALL_DYN_LINK in boost\config\user.hpp, while the comment just above says that it should not be needed for boost_thread : "Forces all libraries [...] to be linked as dll's rather than static libraries on Microsoft Windows. [...] Note that there may be some libraries that can only [...] be dynamically linked (Boost.Threads for example), in these cases this macro has no effect." Is something I didn't well understand ? Anyway, it now works, Thank you again Lars, Sebastien Gallou

1 0

Re: [Boost-users] Boost-users Digest, Vol 3643, Issue 1
by Damien Kick 02 Dec '13

02 Dec '13

On Dec 1, 2013, at 11:00 AM, boost-users-request(a)lists.boost.org wrote: > Date: Sun, 1 Dec 2013 20:38:32 +0530 > From: Rahul Mathur <srivmuk(a)gmail.com> > Subject: [Boost-users] ZeroMQ integration with Boost-v1.54 > Message-ID: > <CALtf4sBn6Dh0WVOgAfaXvSj4obMiMw335w88xDj5vguPOoHMaw(a)mail.gmail.com> […] > BTW, How do I proceed to have ZeroMQ integrated with Boost-v1.54 with > GCC on Linux platform? Here is some code that I've been using to integrate Boost.Asio and 0MQ. The OP question asked for GNU/Linux only but this code has been working for me on both Windows and POSIX. Most of this comes from comments on various Internet forums but integrates together a few things which I personally found less than obvious on my first few attempts. For example, most of the code snippets I found only mentioned POSIX and I had to beat my head against a few walls to get something that worked on both, though YMMV. ==> config.hpp.in <== #ifndef INCLUDE_SHOR_DM_CONFIG_HPP #define INCLUDE_SHOR_DM_CONFIG_HPP // Boost C++ headers #include <boost/filesystem.hpp> // C++ headers #include <string> #ifndef _WIN32_WINNT # define _WIN32_WINNT 0x0601 #endif #ifdef _MSC_VER # define SHOR_DM_CONSTEXPR # define SHOR_DM_DEFAULT_CTOR(expr) expr { } # define SHOR_DM_DEFAULT_COPY(expr) # define SHOR_DM_DEFAULT_DTOR(expr) expr { } # define SHOR_DM_DEFAULT_ASSIGN(expr) # define SHOR_DM_DELETE(expr) expr # define SHOR_DM_NOEXCEPT throw() #else # define SHOR_DM_CONSTEXPR constexpr # define SHOR_DM_DEFAULT_CTOR(expr) expr = default # define SHOR_DM_DEFAULT_COPY(expr) expr = default # define SHOR_DM_DEFAULT_DTOR(expr) expr = default # define SHOR_DM_DEFAULT_ASSIGN(expr) expr = default # define SHOR_DM_DELETE(expr) expr = delete # define SHOR_DM_NOEXCEPT noexcept #endif #endif ==> zee/basic_zmq_fd.hpp <== #ifndef INCLUDE_SHOR_DM_ZEE_BASIC_ZMQ_FD_HPP #define INCLUDE_SHOR_DM_ZEE_BASIC_ZMQ_FD_HPP // 0MQ headers #include <zmq.hpp> namespace shor { namespace dm { namespace zee { template<typename Native_handle> struct Basic_zmq_fd { typedef Native_handle native_handle_type; typedef native_handle_type value_type; private: zmq::socket_t& zmq_socket_; Native_handle zmq_fd_; public: explicit Basic_zmq_fd(zmq::socket_t& zmq_socket) : zmq_socket_(zmq_socket), zmq_fd_() { std::size_t zmq_fd_size = sizeof(zmq_fd_); zmq_socket_.getsockopt(ZMQ_FD, &zmq_fd_, &zmq_fd_size); } value_type operator () () const { return zmq_fd_; } }; } // namespace zee } // namespace dm } // namespace shor #endif ==> zee/handler.hpp <== #ifndef INCLUDE_SHOR_DM_ZEE_HANDLER_HPP #define INCLUDE_SHOR_DM_ZEE_HANDLER_HPP // DM headers #include "dm/zee/msg.hpp" // Boost C++ headers #include <boost/system/error_code.hpp> #include <boost/function.hpp> // C++ headers #include <functional> namespace shor { namespace dm { namespace zee { typedef std::function< void (const boost::system::error_code& err, shor::dm::zee::Msg& msg) > Async_recv_handler; } // namespace zee } // namespace dm } // namespace shor #endif ==> zee/lossy_service.hpp <== #ifndef INCLUDE_SHOR_DM_ZEE_LOSSY_SERVICE_HPP #define INCLUDE_SHOR_DM_ZEE_LOSSY_SERVICE_HPP // Boost C++ headers #include <boost/asio.hpp> namespace shor { namespace dm { namespace zee { template<typename Service> struct Lossy_service : public Service { explicit Lossy_service(boost::asio::io_service& ios) : Service(ios) { } void destory(typename Service::implementation_type& impl) { } }; } // namespace zee } // namespace dm } // namespace shor #endif ==> zee/msg.cpp <== #include "dm/zee/msg.hpp" shor::dm::zee::detail::Msg::Frame::Frame( Frame&& that) : that_(std::move(that.that_)) { } shor::dm::zee::detail::Msg::Frame::Frame( zmq::message_t&& that) : that_(std::move(that)) { } shor::dm::zee::detail::Msg::Frame::Frame( const std::string& the_other) : that_(the_other.size()) { std::copy(the_other.begin(), the_other.end(), static_cast<char*>(that_.data())); } shor::dm::zee::detail::Msg::Frame& shor::dm::zee::detail::Msg::Frame::operator = ( Frame&& that) { that_ = std::move(that.that_); return *this; } shor::dm::zee::detail::Msg::Frame& shor::dm::zee::detail::Msg::Frame::operator = ( const std::string& the_other) { that_.rebuild(the_other.size()); std::copy(the_other.begin(), the_other.end(), static_cast<char*>(that_.data())); return *this; } shor::dm::zee::detail::Msg::Msg( Msg&& that) : frames_(std::move(that.frames_)) { } shor::dm::zee::detail::Msg& shor::dm::zee::detail::Msg::operator = ( Msg&& that) { frames_ = std::move(that.frames_); return *this; } ==> zee/msg.hpp <== #ifndef INCLUDE_SHOR_DM_ZEE_MSG_HPP #define INCLUDE_SHOR_DM_ZEE_MSG_HPP // My header #include "dm/zee/msg_fwd.hpp" // DM headers #include "dm/config.hpp" // 0MQ headers #include <zmq.hpp> // C++ headers #include <deque> namespace shor { namespace dm { namespace zee { namespace detail { struct Msg { class Frame { zmq::message_t that_; public: SHOR_DM_DEFAULT_CTOR(Frame()); Frame(Frame&& that); Frame(zmq::message_t&& that); Frame(const std::string& the_other); SHOR_DM_DEFAULT_DTOR(~Frame()); Frame& operator = (Frame&& that); Frame& operator = (const std::string& the_other); operator zmq::message_t& (); operator const zmq::message_t& () const; zmq::message_t& get(); const zmq::message_t& cget() const; const zmq::message_t& get() const; private: SHOR_DM_DELETE(Frame(const Frame& that)); SHOR_DM_DELETE(Frame& operator = (const Frame& that)); }; typedef std::deque<Frame> Frames; private: Frames frames_; public: SHOR_DM_DEFAULT_CTOR(Msg()); Msg(Msg&& that); SHOR_DM_DEFAULT_DTOR(~Msg()); Msg& operator = (Msg&& that); Frames& frames(); const Frames& frames() const; private: SHOR_DM_DELETE(Msg(const Msg& that)); SHOR_DM_DELETE(Msg& operator = (const Msg& that)); }; } // namespace detail typedef detail::Msg Msg; } // namespace zee } // namespace dm } // namespace shor #include "dm/zee/msg.ipp" #endif ==> zee/msg.ipp <== #ifndef INCLUDE_SHOR_DM_ZEE_MSG_IPP #define INCLUDE_SHOR_DM_ZEE_MSG_IPP // My header #include "dm/zee/msg.hpp" inline shor::dm::zee::detail::Msg::Frame::operator zmq::message_t& () { return that_; } inline shor::dm::zee::detail::Msg::Frame::operator const zmq::message_t& () const { return that_; } inline zmq::message_t& shor::dm::zee::detail::Msg::Frame::get() { return that_; } inline const zmq::message_t& shor::dm::zee::detail::Msg::Frame::cget() const { return that_; } inline const zmq::message_t& shor::dm::zee::detail::Msg::Frame::get() const { return that_; } inline shor::dm::zee::detail::Msg::Frames& shor::dm::zee::detail::Msg::frames() { return frames_; } inline const shor::dm::zee::detail::Msg::Frames& shor::dm::zee::detail::Msg::frames() const { return frames_; } #endif ==> zee/msg_fwd.hpp <== #ifndef INCLUDE_SHOR_DM_ZEE_MSG_FWD_HPP #define INCLUDE_SHOR_DM_ZEE_MSG_FWD_HPP namespace shor { namespace dm { namespace zee { namespace detail { struct Msg; } // namespace detail typedef detail::Msg Msg; } // namespace zee } // namespace dm } // namespace shor #endif ==> zee/posix_zmq_socket.cpp <== // My header #include "dm/zee/posix_zmq_socket.hpp" // DM headers #include "dm/zee/handler.hpp" // Boost C++ headers #include <boost/bind.hpp> struct shor::dm::zee::detail::Posix_zmq_socket::Read_handler { typedef Posix_zmq_socket::implementation_type Io_type; typedef Posix_zmq_socket::Base_read_handler Base_read_handler; private: Io_type& io_; Base_read_handler read_handler_; Async_recv_handler recv_handler_; public: Read_handler( Io_type& io, Base_read_handler read_handler, Async_recv_handler recv_handler) : io_(io), read_handler_(read_handler), recv_handler_(recv_handler) { } void operator () ( const boost::system::error_code& err, std::size_t /*bytes_transferred*/) { read_handler_(*this, err, recv_handler_); } void operator () () { io_.async_read_some(boost::asio::null_buffers(), *this); } }; shor::dm::zee::detail::Posix_zmq_socket::Posix_zmq_socket( boost::asio::io_service& ios, zmq::context_t& zenv, const int zmq_socket_type) : Zmq_socket_base(ios, zenv, zmq_socket_type), zmq_fd_(Zmq_socket_base::zmq_socket()), io_(ios, zmq_fd_()), io_release_(&io_, Release()) { } void shor::dm::zee::detail::Posix_zmq_socket::async_recv( Async_recv_handler recv_handler) { const auto base_read_handler_fn = boost::bind( &Posix_zmq_socket::read_handler, this, _1, _2, _3); Read_handler read_handler( std::ref(io_), base_read_handler_fn, recv_handler); read_handler(); } void shor::dm::zee::detail::Posix_zmq_socket::close_ext() { this->cancel(); // TODO: reset zmq_fd_ io_.release(); } ==> zee/posix_zmq_socket.hpp <== #ifndef INCLUDE_SHOR_DM_ZEE_POSIX_ZMQ_SOCKET_HPP #define INCLUDE_SHOR_DM_ZEE_POSIX_ZMQ_SOCKET_HPP // Base class header #include "dm/zee/zmq_socket_base.hpp" // DM headers #include "dm/zee/handler.hpp" #include "dm/zee/lossy_service.hpp" #include "dm/zee/basic_zmq_fd.hpp" // Boost C++ headers #include <boost/asio/posix/basic_stream_descriptor.hpp> #include <boost/asio/posix/stream_descriptor_service.hpp> #include <boost/asio.hpp> namespace shor { namespace dm { namespace zee { namespace detail { class Posix_zmq_socket : public Zmq_socket_base { using Stream_descriptor_service = boost::asio::posix::stream_descriptor_service; template<typename Service> using Basic_stream_descriptor = boost::asio::posix::basic_stream_descriptor<Service>; // Borrowed from <http://preview.tinyurl.com/n6jh2ne> but it // doesn't seem to work; i.e. I was still finding that the file // descriptor was being closed, causing a crash at shutdown. // Because of this, I (re)introduced Release (see below). typedef Lossy_service<Stream_descriptor_service> service_type; typedef Basic_stream_descriptor<service_type> implementation_type; struct Read_handler; struct Release { void operator () (implementation_type* ptr) { if (ptr->is_open()) { ptr->release(); } } }; Basic_zmq_fd<int> zmq_fd_; implementation_type io_; std::unique_ptr<implementation_type, Release> io_release_; public: Posix_zmq_socket( boost::asio::io_service& ios, zmq::context_t& zenv, int zmq_socket_type); SHOR_DM_DEFAULT_DTOR(~Posix_zmq_socket()); void async_recv(Async_recv_handler handler); void cancel(); private: SHOR_DM_DELETE(Posix_zmq_socket(const Posix_zmq_socket& that)); SHOR_DM_DELETE( Posix_zmq_socket& operator = (const Posix_zmq_socket& that)); virtual void close_ext() override; }; } // namespace detail typedef detail::Posix_zmq_socket Posix_zmq_socket; } // namespace zee } // namespace dm } // namespace shor #include "dm/zee/posix_zmq_socket.ipp" #endif ==> zee/posix_zmq_socket.ipp <== #ifndef INCLUDE_SHOR_DM_ZEE_POSIX_ZMQ_SOCKET_IPP #define INCLUDE_SHOR_DM_ZEE_POSIX_ZMQ_SOCKET_IPP // My header #include "dm/zee/posix_zmq_socket.hpp" inline void shor::dm::zee::detail::Posix_zmq_socket::cancel() { io_.cancel(); } #endif ==> zee/windows_zmq_socket.cpp <== // My header #include "dm/zee/windows_zmq_socket.hpp" // DM headers #include "dm/zee/handler.hpp" // Boost C++ headers #include <boost/system/error_code.hpp> #include <boost/system/system_error.hpp> #include <boost/asio/error.hpp> #include <boost/bind.hpp> struct shor::dm::zee::detail::Windows_zmq_socket::Read_handler { typedef Windows_zmq_socket::implementation_type Io_type; typedef Windows_zmq_socket::Base_read_handler Base_read_handler; private: Io_type& io_; Base_read_handler read_handler_; Async_recv_handler recv_handler_; public: Read_handler( Io_type& io, Base_read_handler read_handler, Async_recv_handler recv_handler) : io_(io), read_handler_(read_handler), recv_handler_(recv_handler) { } void operator () (const boost::system::error_code& err) { read_handler_(*this, err, recv_handler_); } void operator () () { io_.async_wait(*this); } }; shor::dm::zee::detail::Windows_zmq_socket::Windows_zmq_socket( boost::asio::io_service& ios, zmq::context_t& zenv, const int zmq_socket_type) : Zmq_socket_base(ios, zenv, zmq_socket_type), zmq_fd_(Zmq_socket_base::zmq_socket()), io_(ios) { auto zfd_event = CreateEvent( nullptr, // default security settings false, // auto reset false, // initial state: unsignalled nullptr); // anonymous object if (!zfd_event) { const boost::system::error_code an_error_code( GetLastError(), boost::asio::error::get_system_category()); throw boost::system::system_error(an_error_code, "CreateEvent"); } io_.assign(zfd_event); if (WSAEventSelect(zmq_fd_(), zfd_event, FD_READ) == SOCKET_ERROR) { const boost::system::error_code an_error_code( WSAGetLastError(), boost::asio::error::get_system_category()); throw boost::system::system_error( an_error_code, "WSAEventSelect"); } } void shor::dm::zee::detail::Windows_zmq_socket::async_recv( Async_recv_handler recv_handler) { const auto base_read_handler_fn = boost::bind( &Windows_zmq_socket::read_handler, this, _1, _2, _3); Read_handler read_handler( std::ref(io_), base_read_handler_fn, recv_handler); read_handler(); } void shor::dm::zee::detail::Windows_zmq_socket::close_ext() { this->cancel(); // TODO: reset zmq_fd_ io_.close(); } ==> zee/windows_zmq_socket.hpp <== #ifndef INCLUDE_SHOR_DM_ZEE_WINDOWS_ZMQ_SOCKET_HPP #define INCLUDE_SHOR_DM_ZEE_WINDOWS_ZMQ_SOCKET_HPP // Base class header #include "dm/zee/zmq_socket_base.hpp" // DM headers #include "dm/zee/basic_zmq_fd.hpp" #include "dm/zee/handler.hpp" // Boost C++ headers #include <boost/asio/windows/object_handle.hpp> #include <boost/asio.hpp> namespace shor { namespace dm { namespace zee { namespace detail { class Windows_zmq_socket : public Zmq_socket_base { typedef boost::asio::windows::object_handle implementation_type; struct Read_handler; Basic_zmq_fd<SOCKET> zmq_fd_; implementation_type io_; public: Windows_zmq_socket( boost::asio::io_service& ios, zmq::context_t& zenv, int zmq_socket_type); SHOR_DM_DEFAULT_DTOR(~Windows_zmq_socket()); void async_recv(Async_recv_handler handler); void cancel(); private: SHOR_DM_DELETE(Windows_zmq_socket(const Windows_zmq_socket& that)); SHOR_DM_DELETE( Windows_zmq_socket& operator = (const Windows_zmq_socket& that)); virtual void close_ext() override; }; } // namespace detail typedef detail::Windows_zmq_socket Windows_zmq_socket; } // namespace zee } // namespace dm } // namespace shor #include "dm/zee/windows_zmq_socket.ipp" #endif ==> zee/windows_zmq_socket.ipp <== #ifndef INCLUDE_SHOR_DM_ZEE_WINDOWS_ZMQ_SOCKET_IPP #define INCLUDE_SHOR_DM_ZEE_WINDOWS_ZMQ_SOCKET_IPP // My header #include "dm/zee/windows_zmq_socket.hpp" inline void shor::dm::zee::detail::Windows_zmq_socket::cancel() { io_.cancel(); } #endif ==> zee/zmq_socket.hpp <== #ifndef INCLUDE_SHOR_DM_ZEE_ZMQ_SOCKET_HPP #define INCLUDE_SHOR_DM_ZEE_ZMQ_SOCKET_HPP // My header #include "dm/zee/zmq_socket_fwd.hpp" // Conditional headers #ifndef _MSC_VER # include "dm/zee/posix_zmq_socket.hpp" #else # include "dm/zee/windows_zmq_socket.hpp" #endif // Boost C++ headers #include <boost/asio.hpp> namespace shor { namespace dm { namespace zee { #ifndef _MSC_VER typedef Posix_zmq_socket Zmq_socket; #else typedef Windows_zmq_socket Zmq_socket; #endif } // namespace zee } // namespace dm } // namespace shor #endif ==> zee/zmq_socket_base.cpp <== // My headers #include "dm/zee/zmq_socket_base.hpp" // C++ headers #include <cassert> shor::dm::zee::detail::Zmq_socket_base::Opts::Opts( zmq::socket_t& zmq_socket) : zmq_socket_(zmq_socket) { } shor::dm::zee::detail::Zmq_socket_base::Zmq_socket_base( boost::asio::io_service& ios, zmq::context_t& zenv, const int zmq_socket_type) : ios_(ios), zenv_(zenv), zmq_socket_(zenv, zmq_socket_type), opts_(zmq_socket_) { opts_.linger(0); } bool shor::dm::zee::detail::Zmq_socket_base::send( Msg msg) { if (msg.frames().empty()) { auto frame = Msg::Frame(); const auto send_p = zmq_socket_.send(frame); static_cast<void>(opts_.events()); return send_p; } const auto first = msg.frames().begin(); const auto last = std::prev(msg.frames().end()); for (auto pos = first; pos != last; ++pos) { const auto send_p = zmq_socket_.send(*pos, ZMQ_SNDMORE); static_cast<void>(opts_.events()); if (!send_p) { return false; } } const auto send_p = zmq_socket_.send(msg.frames().back(), 0); static_cast<void>(opts_.events()); return send_p; } shor::dm::zee::Msg shor::dm::zee::detail::Zmq_socket_base::recv() { Msg my_value; int more_p = 0; do { zmq::message_t frame; const int flags = 0; zmq_socket_.recv(&frame, flags); static_cast<void>(opts_.events()); my_value.frames().push_back(std::move(frame)); more_p = opts_.rcvmore(); } while (more_p); return my_value; } void shor::dm::zee::detail::Zmq_socket_base::read_handler( std::function<void ()> io_fn, const boost::system::error_code& err, const Async_recv_handler recv_handler) { if (err == boost::asio::error::operation_aborted) { auto msg = Msg(); recv_handler(err, msg); } else if (opts_.events() & ZMQ_POLLIN) { do { auto msg = this->recv(); recv_handler(err, msg); } while (opts_.events() & ZMQ_POLLIN); } else { io_fn(); } } ==> zee/zmq_socket_base.hpp <== #ifndef INCLUDE_SHOR_DM_ZEE_ZMQ_SOCKET_BASE_HPP #define INCLUDE_SHOR_DM_ZEE_ZMQ_SOCKET_BASE_HPP // DM headers #include "dm/zee/handler.hpp" #include "dm/zee/msg.hpp" // 0MQ headers #include <zmq.hpp> // Boost C++ headers #include <boost/asio.hpp> // C++ headers #include <string> namespace shor { namespace dm { namespace zee { namespace detail { struct Zmq_socket_base { class Opts { zmq::socket_t& zmq_socket_; public: explicit Opts(zmq::socket_t& zmq_socket); SHOR_DM_DEFAULT_DTOR(~Opts()); void linger(int value); void subscribe(const std::string& value); int events() const; int linger() const; int rcvmore() const; private: template<typename Opt_value> Opt_value getsockopt(int opt_name) const; void setsockopt(int opt_name, const std::string& opt_value); template<typename Opt_value> void setsockopt(int opt_name, const Opt_value& opt_value); SHOR_DM_DELETE(Opts(const Opts& that)); SHOR_DM_DELETE(Opts& operator = (const Opts& that)); }; private: boost::asio::io_service& ios_; zmq::context_t& zenv_; zmq::socket_t zmq_socket_; Opts opts_; public: void bind(const char* addr); void bind(const std::string& addr); void close(); void connect(const char* addr); void connect(const std::string& addr); boost::asio::io_service& get_io_service(); Opts& opts(); bool send(Msg msg); Msg recv(); bool connected() const; const boost::asio::io_service& get_const_io_service() const; const boost::asio::io_service& get_io_service() const; const Opts& opts() const; protected: typedef std::function<void ()> Void_fn; typedef std::function< void (Void_fn, const boost::system::error_code& err, Async_recv_handler recv_handler) > Base_read_handler; Zmq_socket_base( boost::asio::io_service& ios, zmq::context_t& zenv, int zmq_socket_type); SHOR_DM_DEFAULT_DTOR(virtual ~Zmq_socket_base()); void read_handler( std::function<void ()> io_fn, const boost::system::error_code& err, Async_recv_handler handler); zmq::context_t& zenv(); zmq::socket_t& zmq_socket(); const zmq::context_t& const_zenv() const; const zmq::socket_t& const_zmq_socket() const; const zmq::context_t& zenv() const; const zmq::socket_t& zmq_socket() const; private: SHOR_DM_DELETE(Zmq_socket_base(const Zmq_socket_base& that)); SHOR_DM_DELETE( Zmq_socket_base& operator = (const Zmq_socket_base& that)); virtual void close_ext() = 0; }; } // namespace detail typedef detail::Zmq_socket_base Zmq_socket_base; } // namespace zee } // namespace dm } // namespace shor #include "dm/zee/zmq_socket_base.ipp" #endif ==> zee/zmq_socket_base.ipp <== #ifndef INCLUDE_SHOR_DM_ZEE_ZMQ_SOCKET_BASE_IPP #define INCLUDE_SHOR_DM_ZEE_ZMQ_SOCKET_BASE_IPP // My header #include "dm/zee/zmq_socket_base.hpp" inline void shor::dm::zee::detail::Zmq_socket_base::Opts::linger( const int value) { this->setsockopt(ZMQ_LINGER, value); } inline void shor::dm::zee::detail::Zmq_socket_base::Opts::subscribe( const std::string& value) { this->setsockopt(ZMQ_SUBSCRIBE, value); } inline int shor::dm::zee::detail::Zmq_socket_base::Opts::events() const { return this->getsockopt<int>(ZMQ_EVENTS); } inline int shor::dm::zee::detail::Zmq_socket_base::Opts::linger() const { return this->getsockopt<int>(ZMQ_LINGER); } inline int shor::dm::zee::detail::Zmq_socket_base::Opts::rcvmore() const { return this->getsockopt<int>(ZMQ_RCVMORE); } template<typename Opt_value> Opt_value shor::dm::zee::detail::Zmq_socket_base::Opts::getsockopt( const int opt_name) const { Opt_value opt_value; std::size_t opt_size = sizeof(Opt_value); zmq_socket_.getsockopt(opt_name, &opt_value, &opt_size); return opt_value; } inline void shor::dm::zee::detail::Zmq_socket_base::Opts::setsockopt( const int opt_name, const std::string& opt_value) { zmq_socket_.setsockopt(opt_name, opt_value.c_str(), opt_value.size()); } template<typename Opt_value> inline void shor::dm::zee::detail::Zmq_socket_base::Opts::setsockopt( const int opt_name, const Opt_value& opt_value) { const std::size_t opt_size = sizeof(Opt_value); zmq_socket_.setsockopt(opt_name, &opt_value, opt_size); } inline void shor::dm::zee::detail::Zmq_socket_base::bind( const char* addr) { zmq_socket_.bind(addr); } inline void shor::dm::zee::detail::Zmq_socket_base::bind( const std::string& addr) { zmq_socket_.bind(addr.c_str()); } inline void shor::dm::zee::detail::Zmq_socket_base::close() { this->close_ext(); zmq_socket_.close(); } inline void shor::dm::zee::detail::Zmq_socket_base::connect( const char* addr) { zmq_socket_.connect(addr); } inline void shor::dm::zee::detail::Zmq_socket_base::connect( const std::string& addr) { zmq_socket_.connect(addr.c_str()); } inline boost::asio::io_service& shor::dm::zee::detail::Zmq_socket_base::get_io_service() { return ios_; } inline shor::dm::zee::detail::Zmq_socket_base::Opts& shor::dm::zee::detail::Zmq_socket_base::opts() { return opts_; } inline bool shor::dm::zee::detail::Zmq_socket_base::connected() const { // This function should have been const in zmq::socket_t return const_cast<zmq::socket_t&>(zmq_socket_).connected(); } inline const boost::asio::io_service& shor::dm::zee::detail::Zmq_socket_base::get_const_io_service() const { return ios_; } inline const boost::asio::io_service& shor::dm::zee::detail::Zmq_socket_base::get_io_service() const { return ios_; } inline zmq::context_t& shor::dm::zee::detail::Zmq_socket_base::zenv() { return zenv_; } inline zmq::socket_t& shor::dm::zee::detail::Zmq_socket_base::zmq_socket() { return zmq_socket_; } inline const zmq::context_t& shor::dm::zee::detail::Zmq_socket_base::const_zenv() const { return zenv_; } inline const zmq::socket_t& shor::dm::zee::detail::Zmq_socket_base::const_zmq_socket() const { return zmq_socket_; } inline const zmq::context_t& shor::dm::zee::detail::Zmq_socket_base::zenv() const { return zenv_; } inline const zmq::socket_t& shor::dm::zee::detail::Zmq_socket_base::zmq_socket() const { return zmq_socket_; } #endif ==> zee/zmq_socket_fwd.hpp <== #ifndef INCLUDE_SHOR_DM_ZEE_ZMQ_SOCKET_FWD_HPP #define INCLUDE_SHOR_DM_ZEE_ZMQ_SOCKET_FWD_HPP namespace shor { namespace dm { namespace zee { namespace detail { #ifndef _MSC_VER class Posix_zmq_socket; #else class Windows_zmq_socket; #endif } // namespace detail #ifndef _MSC_VER typedef detail::Posix_zmq_socket Posix_zmq_socket; typedef Posix_zmq_socket Zmq_socket; #else typedef detail::Windows_zmq_socket Windows_zmq_socket; typedef Windows_zmq_socket Zmq_socket; #endif } // namespace zee } // namespace dm } // namespace shor #endif ________________________________ This e-mail and any attachments are confidential. If it is not intended for you, please notify the sender, and please erase and ignore the contents.

1 0

ZeroMQ integration with Boost-v1.54
by Rahul Mathur 02 Dec '13

02 Dec '13

All, Looking to have ZeroMQ integration with Boost-v1.54. I am familiar with Boost.ASIO client and Server model. BTW, How do I proceed to have ZeroMQ integrated with Boost-v1.54 with GCC on Linux platform?

3 2

Ask for material about the algorithm of boost::polygon in detail
by rogy liu 02 Dec '13

02 Dec '13

Hi all, I want to optimize the performance of the boolean operation of boost::polygon with CUDA. I want to speedup it at the source code level, and I found it is hard to speedup the hot spot because of dependency & container. Then, I want to evaluate the feasibility from the algorithm. I have found the article "Industrial strength polygon clipping - A novel algorithm with applications in VLSI CAD", but I think it is hard to understand. Do you have more material for study? Thanks, Rogy

1 0

[MSM] Best place to execute an action with return value
by Daniele Barzotti 02 Dec '13

02 Dec '13

Hi, I'm diving into this very useful piece of code which is MSM and I'm modelling a state machine for a gsm modem. When I have to perform a call I need to move from the IDLE state to WAITING_RESPONSE and, in the transaction action I have to call the MakeCall() method on my GSM object. This method has a return value and a non 0 value means it is failed. In this situation the SM don't have to move on to the next state but remains in the IDLE one, so... Since the Actions has no return value, I have to use a Guard instead or I have to add another state called MAKE_CALL? Thanks in advance, Daniele.

2 4

[OT] Boost Programming forum
by Daniele Barzotti 30 Nov '13

30 Nov '13

Hi, I'm sorry for this off-topic but... I received an email which informs me that I was been registered into this forum: http://www.boostprogramming.com/forum/index.php So, since I'm not register myself, I would ask if this site has some relation with boost community. Regards, Daniele.

2 1

[Multi-Index] Skip-Scan "virtual" ordered-non-unique index on top of composite ordered-unique index
by Dominique Devienne 29 Nov '13

29 Nov '13

We have BMIs of entries with complex composite "natural-keys". For example: typedef boost::multi_index_container< FooIdPtr, // FYI: boost::shared_ptr<FooId> bmi::indexed_by< EntityIndex<ByUid>::unique, // FYI: Surrogate/Primary Key EntityIndex<ByNKey>::of<FooId>::unique, // FYI: Natural Key // additional indexes by type, name and parent EntityIndex<ByType>::non_unique, EntityIndex<ByName>::non_unique, EntityIndex<ByParent>::non_unique > > Impl; The EntityIndex template utility simply factors the index definitions used in several BMIs. For example template <> struct EntityIndex<ByNKey> { template <typename T_IDENT> struct of { typedef hashed_unique< // natural key (logical primary key) tag<ByNKey>, identity< shared_ptr<T_IDENT> >, EntityIdHash<T_IDENT>, EntityIdPred<T_IDENT> > unique; }; }; template <> struct EntityIndex<ByParent> { typedef hashed_non_unique< tag<ByParent>, BOOST_MULTI_INDEX_CONST_MEM_FUN( EntityId, const Uid&, parent_uid // FYI: EntityId is the base class of FooId and co. ) > non_unique; }; After recently reading http://www.sqlite.org/draft/optoverview.html#skipscan and its Skip-Scan optimization, I wondered about changing my ByNKey unique index from hashed to ordered, and thought that in theory, I could perhaps avoid the maintenance and memory cost of the additional type+name+parent indexes, since all three are subsets of the ByNKey unique index, and using a similar skip-scan strategy, which might/would still provide reasonable performance, at least better than no index at all (i.e. a full scan). I know BMI does not provide this of course, but do you think Joaquin that it would be possible to one-day add such "virtual" ordered non-unique indexes on top of an existing ordered (possibly unique) composite index? Of course in this case, the composite'ness is hidden inside FooId, and not exposed to BMI (it used to be a true BMI composite index, but modeling the identity as an object made more sense and simplified things), so whether an index is a subset of another would need to be "configurable" in some way, to yield a "compatible key" with the right "prefix" keys to skip to the next "sub-range" to scan (hopefully that makes sense...). I think I would be able to write custom code on top of a ByNKey ordered-non-unique index to implement a subset of the functionality a true BMI ordered non-unique index provides, for my own needs (with some difficulty, but feasible nonetheless), but the kind of template meta-programming BMI uses to implements its indexes is beyond my current skill level, which is why I'm posting to see what the experts (i.e. Joaquin) thinks about this Skip-Scan virtual indexes idea. Thanks, --DD

2 4

Serialization problem with cyclic references (pointers)
by krisdamato 29 Nov '13

29 Nov '13

Try steppin through this code where the deserialization takes place. On every machine I've tried this (and I've tried it with two different Boost builds as well) parent stays null every time. Can anyone point out the reason why? This is giving me a headache :( I suspect it's got something to do with there being cyclic references between parent and child... #include <boost\archive\binary_oarchive.hpp> #include <boost\archive\binary_iarchive.hpp> #include <boost\serialization\vector.hpp> #include <fstream> #include <memory> #include <vector> class A { public: A() { parent = nullptr; someInt = 0; } template <class Archive> void serialize(Archive& archive, const unsigned int version) { archive & someInt; archive & parent; archive & children; } int someInt; A* parent; std::vector<A*> children; }; int main() { A* newA = new A(); A* newPtr = new A(); newPtr->someInt = 5; newPtr->parent = newA; newA->children.push_back(newPtr); // Save. std::ofstream outputFile("test", std::fstream::out | std::fstream::binary); if (outputFile.is_open()) { boost::archive::binary_oarchive outputArchive(outputFile); // Serialize objects. outputArchive << newA; outputArchive << newPtr; outputFile.close(); } delete newA; delete newPtr; newA = nullptr; newPtr = nullptr; // Load.| std::ifstream inputFile("test", std::fstream::binary | std::fstream::in); if (inputFile && inputFile.good() && inputFile.is_open()) { boost::archive::binary_iarchive inputArchive(inputFile); // Load objects. inputArchive >> newA; inputArchive >> newPtr; inputFile.close(); } return 0; } -- View this message in context: http://boost.2283326.n4.nabble.com/Serialization-problem-with-cyclic-refere… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

[Exception] How do I inherit custom exception hierarchy from std::runtime_error rather than from std::exception?
by Egor Tensin 29 Nov '13

29 Nov '13

Hi, The issue that's confusing me arose from my intention of inheriting my exception classes from std::runtime_error rather than from std::exception. It seemed logical to me, as my exceptions are really runtime errors; getting something meaningful via what() also seemed like a good idea. However, this doesn't compile: #include <iostream> #include <stdexcept> #include <boost/exception/all.hpp> typedef boost::error_info<struct tag_foo_info, unsigned long> foo_info; struct foo_error : virtual boost::exception, virtual std::runtime_error { explicit foo_error(const char *const what) : std::runtime_error(what) { } explicit foo_error(const std::string& what) : std::runtime_error(what) { } }; static void foo() { BOOST_THROW_EXCEPTION(foo_error("foo error") << foo_info(42)); } int main(int argc, char *argv[]) { try { foo(); } catch (const std::exception& e) { std::cerr << boost::diagnostic_information(e); return 1; } return 0; } It says that there's no default constructor available for std::runtime_error. How do I fix this or should I use the idiomatic approach? The interesting thing is that if I erase the "virtual" keyword, the program compiles flawlessly. I wonder what is the reason for that, e.g. why the original code doesn't work and why the new code does, what are the consequences of making boost::exception and std::runtime_error base (non-virtual) classes, etc. I'm confused as the docs clearly recommends I build exception classes hierarchy using virtual inheritance. Could somebody please give me an insight into the inner workings of the library & inheritance mechanisms? Thank you in advance, Egor.

4 7

[Bind & Function] c function pointers
by Matthijs Möhlmann 29 Nov '13

29 Nov '13

Hello all, It was pointed out to me that the subject line was not correct, so I resent this mail with a correct subject line. I'm not sure if this is possible at all, but let me explain: I have the following function signature: typedef int (*sasl_callback_ft)(void); That function in question gets called with unknown amount of parameters (usually 3 or 4) Now I want to assign a member function to it: class admin { public: int callback_fun(void *context, int id, const char **result, unsigned *len); } boost::function<int(void *, int, const char **, unsigned *)> callback = boost::bind(&admin::callback_fun, this, _1, _2, _3, _4); Obviously the compiler doesn't allow to assign callback to a sasl_callback_ft var sasl_callback_ft fun = callback; I get compiler errors like: matthijs@hammer:~/t2$ clang++ -o main -std=c++11 main.cpp main.cpp:22:19: error: no viable conversion from 'boost::function<int (void *, int, const char **, unsigned int *)>' to 'sasl_callback_ft' (aka 'int (*)()') sasl_callback_ft cbfun = cb; ^ ~~ /usr/include/boost/function/function_template.hpp:894:5: note: candidate function operator safe_bool () const ^ 1 error generated. Attached the testcase I made for this. Regards, Matthijs

2 2

Re: [Boost-users] [Thread] Using thread accross libraries
by Sébastien Gallou 29 Nov '13

29 Nov '13

Antony, Thanks a lot for your answer. But I check the configuration of each project, and same runtime-library is used (/MDd) in both cases. So my problem doesn't come from here. If you have another idea... Thanks for your help, Sébastien

2 1

[Multi-Index] performance difference between lower_bound() and upper_bound()
by Dominique Devienne 29 Nov '13

29 Nov '13

I have a multi-index BMI (Boost 1.44), with an ordered_non_unique index on a"name" string field, which is lexicographically ordered. I'm searching for the range of values of the form "$prefix $integer", i.e. "foo 1", "foo 99", etc... to obtain this "range", I initially used (pseudo-code): auto begin = by_name_index().lower_bound(prefix + " 0"); auto end = by_name_index().upper_bound(prefix + " 9"); and within the range I test the suffix for its number'ness and keep the largest number. But I was surprised to see it performed badly for large number of calls. I switched to using instead: auto begin = by_name_index().lower_bound(prefix + " 0"); auto end = by_name_index().lower_bound(prefix + " :"); And this performs much better (20x). The "corpus" of names of this particular test may be skewing the results, since entries are added to the BMI with monotonically increasing number suffixes, and all entries have the prefix I'm looking for, yet I'm very surprised of such a large performance difference between the lower/upper version, and the lower/lower version. Anyone has a clue what could be going on? Thanks, --DD PS: I'm assuming the two versions are equivalent. Let me know if I'm mistaken please. This is not yet thoroughly tested.

3 6

Put the Library Name in the Subject Line (was: boost and c function pointers)
by Mateusz Loskot 29 Nov '13

29 Nov '13

On 29 November 2013 09:29, Matthijs Möhlmann <matthijs(a)cacholong.nl> wrote: > boost::function<int(void *, int, const char **, unsigned *)> callback = > boost::bind(&admin::callback_fun, this, _1, _2, _3, _4); Please, Put the Library Name in the Subject Line [1], it will save people's time. Name Boost refers to a *collection of libraries, hence Boost has nothing to do with C function pointers. [1] http://www.boost.org/community/policy.html#subject-line Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

1 0

boost and c function pointers
by Matthijs Möhlmann 29 Nov '13

29 Nov '13

Hello all, I'm not sure if this is possible at all, but let me explain: I have the following function signature: typedef int (*sasl_callback_ft)(void); That function in question gets called with unknown amount of parameters (usually 3 or 4) Now I want to assign a member function to it: class admin { public: int callback_fun(void *context, int id, const char **result, unsigned *len); } boost::function<int(void *, int, const char **, unsigned *)> callback = boost::bind(&admin::callback_fun, this, _1, _2, _3, _4); Obviously the compiler doesn't allow to assign callback to a sasl_callback_ft var sasl_callback_ft fun = callback; I get compiler errors like: matthijs@hammer:~/t2$ clang++ -o main -std=c++11 main.cpp main.cpp:22:19: error: no viable conversion from 'boost::function<int (void *, int, const char **, unsigned int *)>' to 'sasl_callback_ft' (aka 'int (*)()') sasl_callback_ft cbfun = cb; ^ ~~ /usr/include/boost/function/function_template.hpp:894:5: note: candidate function operator safe_bool () const ^ 1 error generated. Attached the testcase I made for this. Regards, Matthijs

1 0

[mpl][fusion] How to transform vector_c into std::vector?
by Mostafa 29 Nov '13

29 Nov '13

How does one transform an mpl:vector_c into a regular std::vector? Sample input: typedef mpl::vector<int, int_<10>, int_<11>, int_<12> > some_vector_c; Thanks, Mostafa

3 5

Where can I get ml64.exe
by niXman 28 Nov '13

28 Nov '13

Hi, I trying to build boost-1.55 using MinGW-W64 for x86_64 arch. boost.context library requires ml64.exe for building, but I can't find it. I have found ml.exe (it's for i686 arch) on MSDN site[1], but I can't find ml64.exe. The question is where can I get it? Thanks. [1] http://www.microsoft.com/en-us/download/details.aspx?id=12654 -- Regards, niXman ___________________________________________________ Dual-target(32 & 64-bit) MinGW-W64 compilers for 32 and 64-bit Windows: http://sourceforge.net/projects/mingw-w64/ ___________________________________________________ Another online IDE: http://liveworkspace.org/

3 3