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

help with boost/numeric/operators.hpp
by Robert Ramey 03 Jan '12

03 Jan '12

I'm haveing some problems figuring out how to use boost/numeric/operators library. OK - I understand how to use template<class T> struct my_type : boost::numeric::operators<T> { T & operator+=(T & rhs); // automatically generate operator+, etc // ... }; so that one can use my_type<int> x, y, z; z = x + y; // etc.. There is a simple example like this in the documentation. So far so good. Now given: int & operator+=(int & lhs, my_type<int>); I want to use operators<T, U> to generate int operator+(int & lhs, my_type<int>); // etc. After studying the documenation, examples and code, the best I can come up with is: template<class T, class U> class helper : public boost::operators<T, U>{ }; T operator+(T & lhs, U & rhs){ helper<T, U>::operator+(lhs, rhs); // automatically generated + operator } // other non member operators forwarding to helper Am I doing this corrrectly? How did the authors of operators.hpp intend the two argument versions to be used? Robert Ramey

2 1

[C++ Now! 2012] Reminder: Call for Submissions, deadline is January 10th, 2012
by Hartmut Kaiser 03 Jan '12

03 Jan '12

INAUGURAL C++ NOW! CONFERENCE 2012 Aspen CO, USA, May 14-18, 2012, www.cppnow.org CALL FOR SUBMISSIONS We invite you to submit session proposals to the Inaugural C++ Now! Conference: C++Now! 2012 (Aspen CO, USA, May 14 - 18, 2012). Based on the successful traditions of 5 years of BoostCon, which was the main face-to-face event for all things C++ and Boost (www.boost.org) C++Now! 2012 will present leading speakers from the whole C++ community. The conference name is changing to C++ Now! to reflect the current value of the language, the focus on its new state (from the new Standard), and the need to continually look to the future so the language remains useful to the C++ community. The focus of this conference will be the new C++11 language Standard and as usual Boost: what's new in C++, its Standard library, and in the Boost libraries, how to write and maintain them, how to evangelize or to deploy Boost within your organization. The new C++ Standard, but also the infrastructure and process of Boost, its vision and mission - no matter what you are interested in, it all comes together in the C++Now! sessions. Meet the colleagues, and feel the inspiration to support your work with C++ and Boost for the next year. 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. IMPORTANT DATES New proposal submissions due: January 10th, 2012. Proposals decisions sent (tentative program): February 17th, 2012. Fully scheduled program available: February 25th, 2012. Session materials due: April 15th, 2012. BEST PRESENTATION AWARDS We know how much effort it takes to prepare talks for our conference. For this reason we will award the best presentations in the following categories: Best Presentation, Best Short Presentation, Best Tutorial, and Best Workshop. 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 and how it changes life for users and library writers * General tutorial sessions on C++11, the C++11 Standardslibrary, and one or more Boost libraries * 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 Boost 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, Boost and users. Panels Panels feature three or four people presenting their ideas and experiences relating to C++11 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 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 These were introduced at BoostCon 2008, and were a great Presentations 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 We actively encourage tool vendors and ISP's to submit presentations 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 60 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 60 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned 90 minute, 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. * 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=cppnow2012. 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! 2012 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 cppnow2012(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) Dave Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

property type trait
by Amir Yazdanbakhsh 02 Jan '12

02 Jan '12

Hi, I new to boost graph library. The thing that I have in my mind is to find the type of property that passed to a function and execute something based on that. I implemented two bundled properties each for vertex and edge. I want to implement a general function, say print a property, if the passed property is a vertex property the function should iterate over vertices and print out them and if it's edge property it should iterate over edges. Is it any way to do that? Thanks Best Regards, A. Yazdanbakhsh >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> PhD. Student School of Electrical and Computer Engineering University of Wisconsin-Madison E-mail: yazdanbakhsh(a)wisc.edu <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<

2 1

[multi_array]bug in strides calculation with some storage orderings
by Larry Evans 02 Jan '12

02 Jan '12

If I understand correctly, the multi_array storage order determines which strides are larger than others. In short: if( order[I]>order[I+1]) then stride[I]>stride[I+1] However, the output from the attached code shows that this is not always true. In the attached code, the mono_tonic_print function tests the conditions and prints out the results. The following partial output: :count=3 :permut_v={ 1, 2, 0} :permut_i={ 2, 0, 1} :ma.ordering(*)==permut_v=1 :multi_array_strides:strides()={ 12, 1, 3} :monotonically increasing={ 0, 0} :is_mono_tonic=0 :expected_strides:{ 4, 8, 1} :monotonically increasing={ 1, 1} :is_mono_tonic=1 :count=4 :permut_v={ 2, 0, 1} :permut_i={ 1, 2, 0} :ma.ordering(*)==permut_v=1 :multi_array_strides:strides()={ 4, 8, 1} :monotonically increasing={ 0, 0} :is_mono_tonic=0 :expected_strides:{ 12, 1, 3} :monotonically increasing={ 1, 1} :is_mono_tonic=1 shows that the multi_array code fails this monotonic constrait when the order is one of: :permut_v={ 1, 2, 0} :permut_v={ 2, 0, 1} The code also shows a possible solution. This possible solution uses the inverse permutation instead of the original permutation to calculate the strides, as shown in the expected_strides function. There's also a macro, NO_INVERT_PERMUT, which, if defined, has expected_strides reproduce the multi_array strides, which may help narrow down the source of the error in multi_array's stride calculation. The output is also attached. If macro INDENT_OUTPUT is defined, the code requires: http://svn.boost.org/svn/boost/sandbox/variadic_templates/boost/iostreams/f… http://svn.boost.org/svn/boost/sandbox/variadic_templates/boost/iostreams/u… http://svn.boost.org/svn/boost/sandbox/variadic_templates/boost/utility/tra… http://svn.boost.org/svn/boost/sandbox/variadic_templates/boost/utility/ind… If you don't want to download those, then the output will not be nicely indented as shown in the attached output. HTH. -regards, Larry

1 1

iterate over vertices with special propoerty
by Amir Yazdanbakhsh 01 Jan '12

01 Jan '12

Hi, I want to write an iterator which returns the vertices with a special property. For example have an functions which takes a graph and a string and returns an iterator over all the vertices that have this string as their name. Thanks Best Regards, A. Yazdanbakhsh >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> PhD. Student School of Electrical and Computer Engineering University of Wisconsin-Madison E-mail: yazdanbakhsh(a)wisc.edu <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<

2 1

[inteprocess] timed_lock absolute time
by Edward Diener 01 Jan '12

01 Jan '12

Is the "absolute time" mentioned when using a mutex and timed_lock a local time or a UTC time ? I am guessing a local time but I just want to make sure.

2 5

Re: [Boost-users] Problem with Interpocess offset_ptr
by mike＠tesla.rcub.bg.ac.rs 30 Dec '11

30 Dec '11

Thank you Ion, it solved my problem. Qtree now works good and fast!

1 0

Build error on Solaris 10
by İhsan Doğan 30 Dec '11

30 Dec '11

Hi, I'm new to Boost and while trying to build it on Solaris 10 using the sun Toolset and the and Sun Studio 12.1 compiler I'm running into this issue: sun.archive bin.v2/libs/exception/build/sun/release/link-static/stdlib-sun-stlport/threading-multi/libboost_exception.a "CC" -xar -o "bin.v2/libs/exception/build/sun/release/link-static/stdlib-sun-stlport/threading-multi/libboost_exception.a" "bin.v2/libs/exception/build/sun/release/link-static/stdlib-sun-stlport/threading-multi/clone_current_exception_non_intrusive.o" common.copy stage/lib/libboost_exception.a cp "bin.v2/libs/exception/build/sun/release/link-static/stdlib-sun-stlport/threading-multi/libboost_exception.a" "stage/lib/libboost_exception.a" ...failed updating 4 targets... I'm kinda stuck here. What could be the reason for this error? Ihsan -- ihsan(a)dogan.ch http://blog.dogan.ch/

1 0

tcp error “more data is available”
by herzl&revital sham 29 Dec '11

29 Dec '11

I build a sync udp server via boost::asio follow bellow I bind to interface Socket.open(EndPoint.protocol()); Socket.set_option(boost::asio::ip::udp::socket::reuse_address(true)); Socket.bind(EndPoint); and read char mybuffer[1450]; Socket.async_receive_from( boost::asio::buffer(mybuffer, 1450), senderEndpoint_, boost::bind(&MsgReceiver::HandleReceive, this, boost::asio::placeholders::error, buffer, boost::asio::placeholders::bytes_transferred) ); then i send data to this server like below: yes "AAAAAAAAAAAAAAAAAaaAAAAAAA" | nc -u 172.16.0.12 1234 I get "more data is available" error message in HandleReceive and my system Crashes. I debugger this is all io_services status 0 > 5768 Worker Thread _threadstartex boost::asio::detail::win_iocp_io_service::work_finished Normal 0

1 0

boost::interprocess::string
by Josmon Paul 29 Dec '11

29 Dec '11

2 1

Problem with Interpocess offset_ptr
by mike＠tesla.rcub.bg.ac.rs 29 Dec '11

29 Dec '11

Hi, I need to store in the shared memory structure for Quadtree. It is a class with 4 pointers for tree regions and vector of points: class CNode4 { ... CNode4* node0; CNode4* node1; CNode4* node2; CNode4* node3; vector<vec2> pointArray; }; I have tried with class CNode4 { ... offset_ptr<CSNode4> node0; ... }; and using as: typedef allocator<void, managed_shared_memory::segment_manager> void_allocator; const void_allocator alloc_void(segment.get_segment_manager()); CSNode4* rootNode = segment.construct<CSNode4> (_RootNode) (alloc_void); rootNode->node0 = new CSNode4(alloc_void,...); this works until I try to static_cast node0 offset_ptr<CSNode4> N1 = static_cast<CSNode4*>(rootNode->node0); I get: (MSVC 2010, boost 1.42) error C2440: 'static_cast' : cannot convert from 'boost::interprocess::offset_ptr<PointedType>' to 'CSNode4 *' what am I doing wrong? Thanks, Ivan

2 1

Build boost with Apple's LLVM 3.0
by Daniel Dilts 29 Dec '11

29 Dec '11

I am building boost on OS X 10.7.2. Using ./bootstrap.sh ./b2 sudo ./b2 install it appears to build with the GCC 4.2.1 toolchain. How would I change this so that it builds using the LLVM 3.0 toolchain?

2 2

Using the /RTC option without specifying a debug runtime will lead to linker errors
by Sleat, Ben 28 Dec '11

28 Dec '11

Hi I'm trying to track down a very nasty stack corruption bug in my release code and therefore I would like to enabled the Visual C++ RTCs option to enable runtime stack checks in my release build, however when I try to do this I get an "Incompatible build options" error from the boost libraries. Specifically I get this from boosts AutoLink.hpp: #if defined(__MSVC_RUNTIME_CHECKS) && !defined(_DEBUG) # pragma message("Using the /RTC option without specifying a debug runtime will lead to linker errors") # pragma message("Hint: go to the code generation options and switch to one of the debugging runtimes") # error "Incompatible build options" #endif It seems to be suggesting that in order to use /RTC I need to do a Debug build, buts that's exactly what I don't want to do... I need to enable Runtime Checks in the Release build! Is there any way to get this to work in a release build that uses boost? Does anyone know the details of the incompatibility? Surely /RTC doesn't require all linked in DLLs also to be compiled with /RTC? Thanks in advance. Ben This email is from Verint Systems UK Ltd and is confidential. If you have received it in error, please advise us and then delete the original and any attachments it may have contained. Verint Systems UK Ltd does not accept any responsibility for viruses. Verint Systems UK Ltd is a limited company registered in England and Wales at 241 Brooklands Road, Weybridge, Surrey KT13 0RH ,registration number 2602824. VAT registration number GB566153238.

3 5

boost::asio::buffer + std::wstring
by Luke Walker 28 Dec '11

28 Dec '11

Hi, I'm sending unicode text over a socket using boost::asio::async_write and boost::asio::buffer however only 1/4 of the string ends up at the receiver. What must I do so that all bytes are sent? Thanks!

2 6

[Python] Wrapping Visitor Pattern and Object Slicing
by Alex Olivas 27 Dec '11

27 Dec '11

Hey All, I'm trying to wrap a third party lib that uses the visitor pattern and their own smart pointers ('ref_ptr' below), which manages objects that inherit from 'Referenced'. I've put together a simple example that illustrates the problem. Code for python bindings : http://codepad.org/wq47m5CI Simple test script : http://codepad.org/Jfme3U6U Output for two cases : http://codepad.org/gbFBxy04 Case 1) 'apply' override is commented out in the python class Case 2) 'apply' override exists The problem that I'm having is that the 'apply' method ( lines 83 - 86 ) slices everything to base unless I use boost::ref(). However this only works for wrapped classes and in this lib several classes use derived visitors that are not part of the public API ( which I modeled as HelperVisitor in the above example ). Is there anyway to prevent object slicing for both wrapped and unwrapped objects in this scenario? I'm building against boost 1.47 and if anyone's interested in digging deeper the 3rd party lib is Open Scene Graph 3.0.1. Thanks, Alex.

1 0

Re: [Boost-users] filesystem::path threadsafe ?? (1.48) Options
by Aris Basic 27 Dec '11

27 Dec '11

Here is the sample code that crashes every time i compile project as multibyte and not unicode and ahve user wchar_t as default type #include <boost/thread.hpp> #include <boost/filesystem.hpp> int main(void) { std::string sPath("c:\\Development"); boost::thread_group tg; for(int i = 0; i < 10; i++) { tg.create_thread([&sPath](){ boost::this_thread::sleep(boost::posix_time::milliseconds(10)); boost::filesystem::path p(sPath); boost::filesystem::directory_iterator di(p), end; while(di != end) std::cout << (*di).path().string() << std::endl; }); } tg.join_all(); }

3 3

Boost.Container string operator+ problem
by dave_chp 27 Dec '11

27 Dec '11

Using boost 1.48 and vs2010 gives me an error when trying to use boost::container::string. #include <boost/container/string.hpp> int main( int, char *[] ) { using boost::container::string; string hello = "hello "; string world = "world"; string hello_world = hello + world; } 1>d:\sdk\boost_1_48_0\boost\container\string.hpp(2368): error C2248: 'boost::container::containers_detail::basic_string_base ::alloc' : cannot access protected member declared in class 'boost::container::containers_detail::basic_string_base ' 1> with 1> [ 1> A=std::allocator<char> 1> ] 1> d:\sdk\boost_1_48_0\boost\container\string.hpp(214) : see declaration of 'boost::container::containers_detail::basic_string_base ::alloc' 1> with 1> [ 1> A=std::allocator<char> 1> ] 1> d:\tmp\xxx.cpp(15) : see reference to function template instantiation 'boost::container::basic_string<CharT,Traits,A> boost::container::operator +<char,std::char_traits<char>,std::allocator<_Ty>>(const boost::container::basic_string<CharT,Traits,A> &,const boost::container::basic_string<CharT,Traits,A> &)' being compiled 1> with 1> [ 1> CharT=char, 1> Traits=std::char_traits<char>, 1> A=std::allocator<char>, 1> _Ty=char 1> ] 1> d:\tmp\xxx.cpp(20) : see reference to function template instantiation 'void hello_world_test<boost::container::string>(void)' being compiled 1> template <class CharT, class Traits, class A> inline basic_string<CharT,Traits,A> operator+(const basic_string<CharT,Traits,A>& x, const basic_string<CharT,Traits,A>& y) { ... str_t result(reserve, x.size() + y.size(), x.alloc()); ... } should this maybe be x.get_allocator() instead of x.alloc()? -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Container-string-operator-problem-… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

[smart_ptr] Inclusion of unique_ptr
by Szymon Gatner 27 Dec '11

27 Dec '11

Hi, as suggested by Dave Abrahams I am now turning here with proposition of including unique_ptr<> to smart_ptr library. Newly accepted boost.move enables portable implementation and move-aware containers in boost.container allow to take full advantage of this now standard pointer type. Attaching proposed implementation. -- Szymon Gatner The Lordz Games Studio www.thelordzgamesstudio.com

3 2

whitebox testing with boost unit test framework?
by Chris Cleeland 26 Dec '11

26 Dec '11

I'm using the boost unit test framework to implement unit tests for code. I'm wondering if there is a best-practice for doing white-box testing/internal state inspection of types under test. My hack right now is to strip out "protected" and "private" from the header, but I hold my nose as I do that. Thoughts/suggestions? -- Chris Cleeland

7 16

A* heuristic
by giridhar 24 Dec '11

24 Dec '11

Hello All, I have a question about defining A* heuristic. I am trying to implement an algorithm in a paper using BGL. Here authors have used A* Dijkstra's to calculate shortest route with an additional constraint of route length should be no longer than a threshold value t. I think due to this threshold constraint they are using A* instead of normal Dijkstra's algorithm. I came to know A* is already there in Boost Graph Library. I just have a basic knowledge about A* algorithm that it finds the shortest route based on the heuristic H. I tried to look into the example in BGL, but I did not get any hint to define a heuristic. Can anybody give me some hints or some useful links of how can I define a heuristic for this particular scenario of finding the shortest path between nodes that is no longer than threshold t through A* Dijkstra. This would be really helpful for me to proceed further. -- Regards, Giridhar

5 5

Problem with boost ::interprocess::string
by Josmon Paul 23 Dec '11

23 Dec '11

3 2

filesystem::path threadsafe ?? (1.48)
by Aris Basic 22 Dec '11

22 Dec '11

is filesystem::path threadsafe ? i think im seeing issues related to conversion of std::string to std::wstring (that is being used by path on windows) (so thats put blame onto string to wstring conversion) did anyone see anything like that ? if not ill try to create a small sample app that recreates the issue. code portion <similar code run in multiple threads> std::string spath("c:\\somefolder"); fs::path path(spath); // i get crash within this call seems like conversion is using static instance of codecvt and it breaks on call in (do_in) maybe its just windows codecvt issue

1 0

Using boost::uuids::uuid as a map index
by Tim Burgess 22 Dec '11

22 Dec '11

Hi, I'm new to using boost and have hit a problem using UUID. I have a set of classes that have UUID variables to provide unique identifiers. I wish to achieve two things: 1 - Allow objects to reference each other based on their UUID values (imagine the usual databasing student/teacher/course models); 2 - Maintain std::map collections of objects of the same class. Initially, I made the mistake of creating a class instance containing my UUID then inserting it into a map: Std::map <boost::uuid::uid, myClass> myMap; The index of the entry was set as follows: Std::pair <boost::uuids::uuid, myClass> myPair; myPair = std::make_pair( myClassInstance.UUIDField, myClassInstance); myMap.insert( myPair); All look-ups within the map based on the UUID then fail, as adding the object to the map is essentially a copy operation and UUID is non-copyable, so new unique identifiers were generated. I then tried: Std::map <boost::uuids::uuid *, myClass*> myMap; I thought that this should work as the actual UUID value would only ever be held in a single instance of myClass and the relationships between objects could be maintained by following the pointers. Unfortunately, look-ups using this scheme also fail and I can't see where I'm going wrong. Can anybody advise, please? Best wishes. Tim Burgess Raised Bar Ltd Phone: +44 (0)1827 719822 Don't forget to vote for improved access to music and music technology at http://www.raisedbar.net/petition.htm -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Cromwell Enage Sent: 10 December 2011 05:42 To: boost-users(a)lists.boost.org Subject: [Boost-users] [boost-users][container] associative placement insertion Hi, all! I'm wondering how placement insertion works for pair-associative Boost.Container types. For example, given: //[ex_code struct D { D(char,char) {} // Insert Boost.Move awareness here... }; boost::container::map<int,D> my_map; //] Will my_map.emplace(0, 't', 'p') call D('t', 'p') and move the object into the map? Will Boost.Unordered work the same way? TIA! Cromwell D. Enage _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

3 4

boost::polygon::polygon_set
by Egon Schaal 22 Dec '11

22 Dec '11

Hello I have a question to use the function template <typename T, typename coord_type> T& simplify(T& polygon_set, distance_type threshold) How must I define the parameter distance_type My typedefs are set to typedef boost::polygon::point_data<double> point; typedef boost::polygon::polygon_set_data<double> polygon_set; typedef boost::polygon::polygon_with_holes_data<double> polygonwh; typedef boost::polygon::polygon_data<double> polygon; I think the distance_type must be a double. Mit freundlichen Grüßen / Best regards Egon Schaal ///////////////////////////////////////////////// Egon Schaal CAD-Consulting, Softwareerstellung Aspacherstr. 15 71522 Backnang Email egon.schaal(a)cad-cons.net Web http://www.cad-cons.com Tel (+49)7191-84498 Fax (+49)7191-71410 SteuerNr: 51336/01006 /////////////////////////////////////////////////

1 0

Please help me to choose a container
by Jayden Shui 21 Dec '11

21 Dec '11

Hi All, I have a number of named objects of type B whose name can be accessed by B::Name(). B is polymorphic. D1, D2 and so on are derived from B. I want to put them in a set or map-like container ordered by their names. They are referenced by other objects, such as of type C. If the objects in the container are changed by its type (from type D1 to D2) or value, their users can know it automatically, i.e. those information is shared among owners and users. To erase an object in the container, first we need to ensure it is not be used by other objects. Please help me on choose a proper container with smart pointers. I am struggling with it by trying multi-index-container, pointer container, standard container, and cannot find a good way. Thanks a lot ! ! Best regards, Jayden

4 5

How to make multi_index_container work with std::unique_ptr?
by Jayden Shui 21 Dec '11

21 Dec '11

Hi All, If the elements of a multi_index_container are std::unique_ptr, it doesn't seem to work because the assignment operator of std::unique_ptr is private. Any way to let it work? If I change unique_ptr to shared_ptr, it works. But I need a good performance. Or is there anyway to work around to get pointer container performance with multi index power? Thanks a lot! Jayden

3 10

ASIO + SSL + no shared cipher
by Luke Walker 21 Dec '11

21 Dec '11

Hi All,I've taken the SSL server example "as is" but when I attempt to send a request from (Safari, Firefox, Chrome or IE) the handshake fails with "no shared cipher". I've researched the issue for several days and made a few changes. I use OpenSSL_add_all_algorithms and SSL_CTX_set_cipher_list to attempt to satisfy the cipher's but I get the same error. I also used OpenSSL > s_client to try and negotiate a cipher but it fails as well. One assumption I've assembled is that Chrome, Safari and NSURLRequest (Cocoa API) all use the same cipher list. Again I am using the ssl server example and have changed the context SSL Version but still no success. Any help would be greatly appreciated. Luke

1 0

Selecting a random neighbor
by George Bezerra 21 Dec '11

21 Dec '11

Hi, I'm totally new to BGL. I would like to know what is the best way to select a random neighbor of a vertex in an undirected graph without having to iterate through all neighbors. Can anyone help me with that? Thanks! George. -- George Bezerra Doctoral Student Department of Computer Science University of New Mexico, USA

2 1

[Regex] anyone seeing performance dip w/regex matching moving from 1.47->1.48 w/gcc?
by Kopet, Gary 20 Dec '11

20 Dec '11

Hi, I just pulled down boost regex 1.48 and built it with gcc 4.3 on CentOS 5.5. My internal regex performance tests are showing > 30% performance degradation between versions 1.47 and 1.48. I wanted to ask if anyone else has seen anything like this? We've been using the same makefile to built boost regex for a long time, and we haven't converted to bjam. So I am wondering if this could be due to our particular build environment? TIA, Gary Protected by Websense Hosted Email Security -- www.websense.com

2 2

boost test framework logging xml to file
by Jarosław Bober 20 Dec '11

20 Dec '11

Hello, is there a way to get test case name from global fixture? What I would like to have is separate xml file report for every test case. I'd like to do it this way: #include <string> #include <fstream> struct LogToFile { LogToFile() { std::string logFileName(boost::unit_test:: framework::master_test_suite().p_name); logFileName = current_test_case_name ; logFile.open(logFileName.c_str(), std::ios_base::app); boost::unit_test::unit_test_log.set_stream(logFile); } ~LogToFile() { logFile << "</TestLog>" << std::flush; logFile.close(); boost::unit_test::unit_test_log.set_stream(std::cout); } std::ofstream logFile; }; BOOST_GLOBAL_FIXTURE(LogToFile); Can I do that? Regards

2 1

[Interprocess] managed_shared_memory problem in 64-bit windows (v. 1.48.0)
by Michel Lestrade 20 Dec '11

20 Dec '11

Hi, I am trying to make a shared memory block between 2 Intel Fortran programs and thought to use a small C/C++ lib file to accomplish this: Fortran can use the ISO_C_BINDING module to make its pointers point to C objects but not vice versa and there is a vast Fortran code base which we have no intention of porting. There is a native pipe mechanism but given the amount of data I will be exchanging, disk access is something I want to avoid. The application is FEM modeling and the sparse matrix can be several hundred MBs; as the program evolves and the matrix changes, I expect hundreds of GBs of data in total I/O. Seems like it would be better to have a shared memory region and let the OS manage things as much as possible. Starting small to test the idea, I am running into trouble with something which seems easy enough to do in the examples but which only seems to work in 32-bit. Here is an incomplete fragment (got stuck early): #include <string> #include <boost/interprocess/managed_shared_memory.hpp> using namespace boost::interprocess; struct shm_remove { shm_remove(const char *input) { name = std::string(input); shared_memory_object::remove(name.c_str()); } ~shm_remove() {shared_memory_object::remove(name.c_str());} std::string name; } *remover; extern "C" void alloc_mumps(const int n, const int nnz, const char *name) { int size_shm = sizeof(int)*(2+2*nnz) + sizeof(double)*(nnz+2*n); remover = new shm_remove(name); managed_shared_memory managed_shm(create_only,name,size_shm); // Trying to do the equivalent of *i = new int int *i = managed_shm.construct<int>(anonymous_instance)[1](n); } Calling the function with n=3 and nnz=6 (a very small value compared to my final application) works OK when the application is compiled under 32-bit. Compiling under 64-bit produces an access violation error in win32_api.hpp: inline long interlocked_compare_exchange(long volatile *addr, long val1, long val2) { return BOOST_INTERLOCKED_COMPARE_EXCHANGE(addr, val1, val2); } values in debugger: addr=0, val1=1 val2=0. I do not know enough about Boost to know whether this is a design limitation, a bug or just an issue with my initial build. Just for reference, this is what I used: bjam --toolset=msvc-9.0 address-model=64 --build-type=complete stage Any suggestions ? Michel Lestrade Crosslight Software

2 2

[Boost] [Program Options]: Special character # in configuration file
by Bruno Matos 20 Dec '11

20 Dec '11

Hi, There is any way to use # in a configuration parameter value without being interpreted as comment initiator? Example: url=http://www.example.com/#sometopic Tia. Regards. -- Bruno Matos

1 0

help figuring out msg
by Jacques C. Richard 20 Dec '11

20 Dec '11

Can anyone help decipher this message? Is it really trying to allocate that size? Is gcc really using malloc under all these boost code? :) malloc: *** mmap(size=380554168512811008) failed (error code=12) *** error: can't allocate region *** set a breakpoint in malloc_error_break to debug terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc [jacques-richards-mac-mini:00700] *** Process received signal *** [jacques-richards-mac-mini:00700] Signal: Abort trap (6) [jacques-richards-mac-mini:00700] Signal code: (0) [jacques-richards-mac-mini:00700] [ 0] 2 libSystem.B.dylib 0x00007fff8449b1ba _sigtramp + 26 [jacques-richards-mac-mini:00700] [ 1] 3 ??? 0x0030303700837a50 0x0 + 13563811672062544 [jacques-richards-mac-mini:00700] [ 2] 4 libstdc++.6.dylib 0x00007fff809c65d2 __tcf_0 + 0 [jacques-richards-mac-mini:00700] [ 3] 5 libobjc.A.dylib 0x00007fff84609b4d _objc_terminate + 120 [jacques-richards-mac-mini:00700] [ 4] 6 libstdc++.6.dylib 0x00007fff809c4ae1 _ZN10__cxxabiv111__terminateEPFvvE + 11 [jacques-richards-mac-mini:00700] [ 5] 7 libstdc++.6.dylib 0x00007fff809c4b16 _ZN10__cxxabiv112__unexpectedEPFvvE + 0 [jacques-richards-mac-mini:00700] [ 6] 8 libstdc++.6.dylib 0x00007fff809c4bfc _ZL23__gxx_exception_cleanup19_Unwind_Reason_CodeP17_Unwind_Exception + 0 [jacques-richards-mac-mini:00700] [ 7] 9 libstdc++.6.dylib 0x00007fff809c4efb _Znwm + 87 [jacques-richards-mac-mini:00700] [ 8] 10 Mg 0x0000000100113608 _ZN9__gnu_cxx13new_allocatorI12lattice_typeE8allocateEmPKv + 70 [jacques-richards-mac-mini:00700] [ 9] 11 Mg 0x000000010011362f _ZNSt12_Vector_baseI12lattice_typeSaIS0_EE11_M_allocateEm + 37 [jacques-richards-mac-mini:00700] [10] 12 Mg 0x0000000100113658 _ZNSt6vectorI12lattice_typeSaIS0_EE20_M_allocate_and_copyIPS0_EES4_mT_S5_ + 38 [jacques-richards-mac-mini:00700] [11] 13 Mg 0x000000010011376a _ZNSt6vectorI12lattice_typeSaIS0_EE7reserveEm + 114 [jacques-richards-mac-mini:00700] [12] 14 Mg 0x0000000100113881 _ZNK5boost13serialization3stl11reserve_impISt6vectorI12lattice_typeSaIS4_EEEclERS6_m + 33 [jacques-richards-mac-mini:00700] [13] 15 Mg 0x000000010011738b _ZN5boost13serialization3stl15load_collectionINS_3mpi15packed_iarchiveESt6vectorI12lattice_typeSaIS6_EENS1_17archive_input_seqIS4_S8_EENS1_11reserve_impIS8_EEEEvRT_RT0_ + 189 [jacques-richards-mac-mini:00700] [14] 16 Mg 0x000000010011740c _ZN5boost13serialization4loadINS_3mpi15packed_iarchiveE12lattice_typeSaIS4_EEEvRT_RSt6vectorIT0_T1_EjN4mpl_5bool_ILb0EEE + 32 [jacques-richards-mac-mini:00700] [15] 17 Mg 0x0000000100117438 _ZN5boost13serialization4loadINS_3mpi15packed_iarchiveE12lattice_typeSaIS4_EEEvRT_RSt6vectorIT0_T1_Ej + 42 [jacques-richards-mac-mini:00700] [16] 18 Mg 0x0000000100117471 _ZN5boost13serialization11free_loaderINS_3mpi15packed_iarchiveESt6vectorI12lattice_typeSaIS5_EEE6invokeERS3_RS7_j + 55 [jacques-richards-mac-mini:00700] [17] 19 Mg 0x0000000100117496 _ZN5boost13serialization10split_freeINS_3mpi15packed_iarchiveESt6vectorI12lattice_typeSaIS5_EEEEvRT_RT0_j + 35 [jacques-richards-mac-mini:00700] [18] 20 Mg 0x00000001001174bb _ZN5boost13serialization9serializeINS_3mpi15packed_iarchiveE12lattice_typeSaIS4_EEEvRT_RSt6vectorIT0_T1_Ej + 35 [jacques-richards-mac-mini:00700] [19] 21 Mg 0x00000001001174f4 _ZN5boost13serialization13serialize_adlINS_3mpi15packed_iarchiveESt6vectorI12lattice_typeSaIS5_EEEEvRT_RT0_j + 55 [jacques-richards-mac-mini:00700] [20] 22 Mg 0x0000000100117529 _ZNK5boost7archive6detail11iserializerINS_3mpi15packed_iarchiveESt6vectorI12lattice_typeSaIS6_EEE16load_object_dataERNS1_14basic_iarchiveEPvj + 51 [jacques-richards-mac-mini:00700] [21] 23 libboost_serialization.dylib 0x0000000100533eb9 _ZN5boost7archive6detail14basic_iarchive11load_objectEPvRKNS1_17basic_iserializerE + 473 [jacques-richards-mac-mini:00700] [22] 24 Mg 0x00000001001178e3 _ZN5boost7archive6detail21load_non_pointer_typeINS_3mpi15packed_iarchiveEE13load_standard6invokeISt6vectorI12lattice_typeSaIS9_EEEEvRS4_RKT_ + 45 [jacques-richards-mac-mini:00700] [23] 25 Mg 0x000000010011790c _ZN5boost7archive6detail21load_non_pointer_typeINS_3mpi15packed_iarchiveEE6invokeISt6vectorI12lattice_typeSaIS8_EEEEvRS4_RT_ + 39 [jacques-richards-mac-mini:00700] [24] 26 Mg 0x0000000100117930 _ZN5boost7archive4loadINS_3mpi15packed_iarchiveESt6vectorI12lattice_typeSaIS5_EEEEvRT_RT0_ + 34 [jacques-richards-mac-mini:00700] [25] 27 Mg 0x000000010011795a _ZN5boost7archive6detail15common_iarchiveINS_3mpi15packed_iarchiveEE13load_overrideISt6vectorI12lattice_typeSaIS8_EEEEvRT_i + 40 [jacques-richards-mac-mini:00700] [26] 28 Mg 0x000000010011797f _ZN5boost3mpi15packed_iarchive13load_overrideISt6vectorI12lattice_typeSaIS4_EEEEvRT_iN4mpl_5bool_ILb0EEE + 35 [jacques-richards-mac-mini:00700] [27] 29 Mg 0x00000001001179ac _ZN5boost3mpi15packed_iarchive13load_overrideISt6vectorI12lattice_typeSaIS4_EEEEvRT_i + 42 [jacques-richards-mac-mini:00700] [28] 30 Mg 0x00000001001179d8 _ZN5boost7archive6detail18interface_iarchiveINS_3mpi15packed_iarchiveEErsISt6vectorI12lattice_typeSaIS8_EEEERS4_RT_ + 42 [jacques-richards-mac-mini:00700] [29] 31 Mg 0x0000000100117a0c _ZN5boost3mpi6detail21serialized_irecv_dataISt6vectorI12lattice_typeSaIS4_EEE11deserializeERNS0_6statusE + 40 [jacques-richards-mac-mini:00700] *** End of error message *** mpirun noticed that job rank 0 with PID 699 on node jacques-richards-mac-mini.local exited on signal 15 (Terminated). 1 additional process aborted (not shown) jacques-richards-mac-mini:SBF_T jacques$ Suspected cause: reqs.push_back( world.isend( Sender , SendTag , &Neighbor2Proc ) ) ; where std::vector< T > Neighbor2Proc ; Thanks!

3 4

Handler requirement for Asynchronous Operations in boost::asio
by Tu Hoang Do 20 Dec '11

20 Dec '11

It is specified in http://www.boost.org/doc/libs/1_47_0/doc/html/boost_asio/reference/AcceptHa… that a handler for `async_accept()` must satisfy the following function signature: void accept_handler( const boost::system::error_code& ec) { ... } However, in the `Daytime.3` example, using boost::bind, the handler can be specified as much parameter as desired, as long as it does not exceed the limit of `boost::bind` (which is 9 arguments at maximum): class tcp_server { public: tcp_server(boost::asio::io_service& io_service) : acceptor_(io_service, tcp::endpoint(tcp::v4(), 13)) { start_accept(); } private: void start_accept() { tcp_connection::pointer new_connection = tcp_connection::create(acceptor_.get_io_service()); acceptor_.async_accept(new_connection->socket(), boost::bind(&tcp_server::handle_accept, this, new_connection, boost::asio::placeholders::error)); } void handle_accept(tcp_connection::pointer new_connection, const boost::system::error_code& error) { if (!error) { new_connection->start(); } start_accept(); } tcp::acceptor acceptor_; }; Why is that possible? I thought even with `boost::bind`, the exact function signature still has to be matched. Notice the `handle_accept()` funciton and how it is used in `async_accept()`. The full code listing is here: http://www.boost.org/doc/libs/1_48_0/doc/html/boost_asio/tutorial/tutdaytim…

2 2

LINK : fatal error LNK1561: entry point must be defined
by ankit master 20 Dec '11

20 Dec '11

Hello, I am trying to run this simple example and I run into issues, could somebody please help me understand what am I doing incorrect here. #include <boost/test/unit_test.hpp> using namespace boost::unit_test; //____________________________________________________________________________// // you could easily implement test cases as a free functions // this test case will need to be explecetely registered in test tree void free_test_function() { // reports 'error in "free_test_function": test 2 == 1 failed' BOOST_CHECK(2 == 1); // non-critical test => continue after failure // reports 'unknown location(0): fatal error in "free_test_function": memory access violation // d:\source code\boost\libs\test\example\unit_test_example_02.cpp(25): last checkpoint' int* p = (int*)0x01; BOOST_CHECK( *p == 0 ); } //____________________________________________________________________________// test_suite* init_unit_test_suite( int, char* [] ) { framework::master_test_suite().p_name.value = "Unit test example 02"; // register the test case in test tree and specify number of expected failures so // this example will pass at runtime. We expect 2 errors: one from failed check and // one from memory acces violation framework::master_test_suite().add( BOOST_TEST_CASE( &free_test_function ), 2 ); return 0; } 1>------ Build started: Project: unitTestPrac2, Configuration: Debug Win32 ------ 1>Linking... 1>LINK : fatal error LNK1561: entry point must be defined 1>Build log was saved at "file://c:\Users\amaster\Desktop\AVM_Documents\CppPractise\unitTestPrac2\unitTestPrac2\Debug\BuildLog.htm" 1>unitTestPrac2 - 1 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== Thank you Ankit -- >From the withered tree, a flower blooms. - Zen -- >From the withered tree, a flower blooms. - Zen

1 0

Re: [Boost-users] Did he misunderstand you?
by John Wiegley 19 Dec '11

19 Dec '11

>>>>> Wayne Johnson <wjohnsonga(a)gmail.com> writes: > I'm new to the Boost libraries and becoming reacquainted with C++ after many > years of using other languages. As recommended in section 5.1 of the > "Getting Started on Windows", I visited the BoostPro website to find a > Windows 7 installer for v1.48.0 to use with VS C++ 2010. In response to a > followup message to BoostPro sales about the lack of an installer for the > latest version, I was told: >> "We don't have an installer at this time, and we are shortly about to >> remove that section from our website. The Boost build instructions can be >> found here ..." > Will there be no more Windows binary installers for the libraries or did I > misunderstand? Hi Wayne, What BoostPro does not have for 1.48 -- and has never made free to the public for any version -- are 64-bit installers for Windows. That was a paid service which we are now discontinuing. We may choose to make 64-bit installers freely available, time permitting, but we haven't finalized that decision yet. It's a bit of work to provide that service, and our plates have been overfull with paying work recently. -- John Wiegley BoostPro Computing http://www.boostpro.com

1 0

BoostPro (or any) installer for v1.48.0 on Windows 7/Visual Studio C++ 2010?
by Wayne Johnson 19 Dec '11

19 Dec '11

I'm new to the Boost libraries and becoming reacquainted with C++ after many years of using other languages. As recommended in section 5.1 of the "Getting Started on Windows", I visited the BoostPro website to find a Windows 7 installer for v1.48.0 to use with VS C++ 2010. In response to a followup message to BoostPro sales about the lack of an installer for the latest version, I was told: "We don't have an installer at this time, and we are shortly about to remove that section from our website. The Boost build instructions can be found here ..." Will there be no more Windows binary installers for the libraries or did I misunderstand? - wjohnson

3 3

Re: [Boost-users] [boost] [constrained_value] Constrained Value reviewresults
by Robert Ramey 19 Dec '11

19 Dec '11

Gordon Woodhull wrote: > Greetings, ... a report which sounded like an acceptance. My question is - what happened to this? What is the current status? Robert Ramey

3 2

boost::thread liker error in Release mode
by herzl&revital sham 18 Dec '11

18 Dec '11

I am write a program that use boost::thread like below class RPCClientManagment { boost::thread *pThread_; void RunSendRequestStatus() { boost::posix_time::seconds interval(30); while (bRunSendRequestStatus_) { SendRequestStatus(); boost::this_thread::sleep(interval); } } void StartRequestStatus() { bRunSendRequestStatus_ = true; pThread_ = new boost::thread(&RPCClientManagment::RunSendRequestStatus, this); } }; when I compile it in rlease mode I receive bleow error: 1>c:\program files (x86)\boost\boost_1_44\boost\asio\placeholders.hpp(91) : fatal error C1001: `An internal error has occurred in the compiler.` 1>(compiler file 'f:\dd\vctools\compiler\utc\src\p2\main.c[0x62542D7F:0x00000028]', line 182) 1> To work around this problem, try simplifying or changing the program near the locations listed above. 1>Please choose the Technical Support command on the Visual C++ 1> Help menu, or open the Technical Support help file for more information 1>LINK : fatal error LNK1000: Internal error during IMAGE::BuildImage 1> Version 9.00.21022.08 1> E when I comment this row error message hide //pThread_ = new boost::thread(&RPCClientManagment::RunSendRequestStatus, this); in debug mode I don't see this problem at all. I use vc++ 9

2 3

lexical cast: changesign is not a member of boost::math
by Philipp Münzel 18 Dec '11

18 Dec '11

Hi folks, I'm trying to compile the http server example of boost::asio: http://www.boost.org/doc/libs/1_48_0/doc/html/boost_asio/example/http/serve… I'm using gcc 4.6 on ubuntu Linux 11.10. When compiling the reply.cpp, I get the following error: In file included from reply.cpp:13:0: /usr/local/include/boost/lexical_cast.hpp: In function ‘bool boost::detail::parse_inf_nan_impl(const CharT*, const CharT*, T&, const CharT*, const CharT*, const CharT*, const CharT*, CharT, CharT)’: /usr/local/include/boost/lexical_cast.hpp:676:31: error: ‘changesign’ is not a member of ‘boost::math’ /usr/local/include/boost/lexical_cast.hpp:693:31: error: ‘changesign’ is not a member of ‘boost::math’ /usr/local/include/boost/lexical_cast.hpp: In function ‘bool boost::detail::lcast_ret_float(T&, const CharT*, const CharT*)’: /usr/local/include/boost/lexical_cast.hpp:1025:50: error: ‘changesign’ is not a member of ‘boost::math’ I remember having compiled this example some time ago with boost 1.46 or so. Is there some regression in 1.48 that prevents this from compiling? Regards, Philipp

2 1

lexical_cast throws when used with empty vector (1.48.0)
by Braden Northington McDaniel 18 Dec '11

18 Dec '11

Boost 1.48.0's lexical_cast throws bad_lexical_cast when used with an empty vector. This is observable in the following program: #include <boost/lexical_cast.hpp> #include <cassert> #include <iostream> #include <iterator> #include <string> #include <vector> std::ostream & operator<<(std::ostream & out, const std::vector<long> & v) { std::ostream_iterator<long> it(out); std::copy(v.begin(), v.end(), it); assert(out); return out; } int main() { std::vector<long> v; //v.push_back(1); std::cout << boost::lexical_cast<std::string>(v); } If the commented line is uncommented (making the vector nonempty), the program runs without an exception. Is this the intended behavior? -- Braden McDaniel e-mail/Jabber IM: braden(a)endoframe.com http://endoframe.com

1 0

[Range] Generating a singular range.
by Robert Jones 17 Dec '11

17 Dec '11

Hi All Is there an easy and obvious way to construct a single element range from a value_type of that range? Thx - Rob.

3 2

[boost-users][container] associative placement insertion
by Cromwell Enage 17 Dec '11

17 Dec '11

Hi, all! I'm wondering how placement insertion works for pair-associative Boost.Container types. For example, given: //[ex_code struct D { D(char,char) {} // Insert Boost.Move awareness here... }; boost::container::map<int,D> my_map; //] Will my_map.emplace(0, 't', 'p') call D('t', 'p') and move the object into the map? Will Boost.Unordered work the same way? TIA! Cromwell D. Enage

1 1

[call_traits] Having trouble with call traits combined with type deduction
by Rhys Ulerich 17 Dec '11

17 Dec '11

'Afternoon, I have a quick question on call traits and template argument deduction. I want to use call_traits' value_type and param_type to deduce a signature like double desired_result(double const& x); given an argument of type double. Is there any way to get type deduction working on a snippet like lousy_attempt (below) to produce my desired_result? #include <boost/call_traits.hpp> template<typename Scalar> typename boost::call_traits<Scalar>::value_type lousy_attempt(typename boost::call_traits<Scalar>::param_type x) { return x; } int main() { double y = 5; // Works... lousy_attempt<double>(y); // "No matching function call to lousy_attempt(double&)" lousy_attempt(y); return 0; } Thanks in advance, Rhys

2 2

[MPI] compilation with c++0x and gcc-4.6
by tcb 17 Dec '11

17 Dec '11

hi, I have a problem compiling simple boost mpi programs with gcc4.6 on osx. The broadcast_test.cpp from libs/mpi/test compiles just fine with the -std=gnu++98, but when I use -std=gnu++0x I get a compilation error which seems to implicate boost::serialization. The code compiles just fine with gcc-4.4 and gcc-4.7 with the -std=gnu++0x flags. There is no c++0x specific code in the test file itself. Any ideas what the problem is with gcc-4.6 and -std=gnu++0x? $ OMPI_CXX=g++-mp-4.6 openmpic++ -std=c++0x -m64 -o broadcast_test broadcast_test.cpp -lboost_mpi-mt -lboost_serialization-mt In file included from /opt/local/include/boost/mpi/collectives.hpp:21:0, from /opt/local/include/boost/mpi/collectives_fwd.hpp:19, from /opt/local/include/boost/mpi/collectives/broadcast.hpp:11, from broadcast_test.cpp:8: /opt/local/include/boost/mpi/communicator.hpp:1633:58: error: specialization of 'boost::mpi::status boost::mpi::communicator::recv(int, int, T&) const [with T = boost::mpi::packed_iarchive]' after instantiation /opt/local/include/boost/mpi/communicator.hpp:1668:65: error: specialization of 'boost::mpi::request boost::mpi::communicator::isend(int, int, const T&) const [with T = boost::mpi::packed_oarchive]' after instantiation In file included from /opt/local/include/gcc46/c++/vector:64:0, from /opt/local/include/gcc46/c++/bits/random.h:34, from /opt/local/include/gcc46/c++/random:50, from /opt/local/include/gcc46/c++/bits/stl_algo.h:67, from /opt/local/include/gcc46/c++/algorithm:63, from /opt/local/include/boost/optional/optional.hpp:19, from /opt/local/include/boost/optional.hpp:15, from /opt/local/include/boost/mpi/communicator.hpp:18, from /opt/local/include/boost/mpi/collectives.hpp:21, from /opt/local/include/boost/mpi/collectives_fwd.hpp:19, from /opt/local/include/boost/mpi/collectives/broadcast.hpp:11, from broadcast_test.cpp:8: /opt/local/include/gcc46/c++/bits/stl_uninitialized.h: In function 'void std::__uninitialized_default_n_a(_ForwardIterator, _Size, _Allocator&) [with _ForwardIterator = char*, _Size = long unsigned int, _Allocator = boost::mpi::allocator<char>]': /opt/local/include/gcc46/c++/bits/vector.tcc:474:8: instantiated from 'void std::vector<_Tp, _Alloc>::_M_default_append(std::vector<_Tp, _Alloc>::size_type) [with _Tp = char, _Alloc = boost::mpi::allocator<char>, std::vector<_Tp, _Alloc>::size_type = long unsigned int]' /opt/local/include/gcc46/c++/bits/stl_vector.h:592:4: instantiated from 'void std::vector<_Tp, _Alloc>::resize(std::vector<_Tp, _Alloc>::size_type) [with _Tp = char, _Alloc = boost::mpi::allocator<char>, std::vector<_Tp, _Alloc>::size_type = long unsigned int]' /opt/local/include/boost/mpi/detail/packed_oprimitive.hpp:96:46: instantiated from here /opt/local/include/gcc46/c++/bits/stl_uninitialized.h:576:6: error: no matching function for call to 'boost::mpi::allocator<char>::construct(char*)' /opt/local/include/gcc46/c++/bits/stl_uninitialized.h:576:6: note: candidate is: /opt/local/include/boost/mpi/allocator.hpp:168:8: note: void boost::mpi::allocator<T>::construct(boost::mpi::allocator<T>::pointer, const T&) [with T = char, boost::mpi::allocator<T>::pointer = char*] /opt/local/include/boost/mpi/allocator.hpp:168:8: note: candidate expects 2 arguments, 1 provided In file included from /opt/local/include/boost/serialization/extended_type_info_typeid.hpp:37:0, from /opt/local/include/boost/archive/detail/oserializer.hpp:38, from /opt/local/include/boost/mpi/detail/mpi_datatype_oarchive.hpp:14, from /opt/local/include/boost/mpi/detail/mpi_datatype_cache.hpp:13, from /opt/local/include/boost/mpi/datatype.hpp:27, from /opt/local/include/boost/mpi/communicator.hpp:20, from /opt/local/include/boost/mpi/collectives.hpp:21, from /opt/local/include/boost/mpi/collectives_fwd.hpp:19, from /opt/local/include/boost/mpi/collectives/broadcast.hpp:11, from broadcast_test.cpp:8: /opt/local/include/boost/serialization/access.hpp: In static member function 'static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::mpi::packed_oarchive, T = boost::mpi::packed_oarchive]': /opt/local/include/boost/serialization/serialization.hpp:69:5: instantiated from 'void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::mpi::packed_oarchive, T = boost::mpi::packed_oarchive]' /opt/local/include/boost/serialization/serialization.hpp:128:9: instantiated from 'void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::mpi::packed_oarchive, T = boost::mpi::packed_oarchive]' /opt/local/include/boost/archive/detail/oserializer.hpp:148:5: instantiated from 'void boost::archive::detail::oserializer<Archive, T>::save_object_data(boost::archive::detail::basic_oarchive&, const void*) const [with Archive = boost::mpi::packed_oarchive, T = boost::mpi::packed_oarchive]' broadcast_test.cpp:153:1: instantiated from here /opt/local/include/boost/serialization/access.hpp:118:9: error: 'class boost::mpi::packed_oarchive' has no member named 'serialize' /opt/local/include/boost/serialization/access.hpp: In static member function 'static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::mpi::packed_iarchive, T = boost::mpi::packed_iarchive]': /opt/local/include/boost/serialization/serialization.hpp:69:5: instantiated from 'void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::mpi::packed_iarchive, T = boost::mpi::packed_iarchive]' /opt/local/include/boost/serialization/serialization.hpp:128:9: instantiated from 'void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::mpi::packed_iarchive, T = boost::mpi::packed_iarchive]' /opt/local/include/boost/archive/detail/iserializer.hpp:188:5: instantiated from 'void boost::archive::detail::iserializer<Archive, T>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const [with Archive = boost::mpi::packed_iarchive, T = boost::mpi::packed_iarchive]' broadcast_test.cpp:153:1: instantiated from here /opt/local/include/boost/serialization/access.hpp:118:9: error: 'class boost::mpi::packed_iarchive' has no member named 'serialize'

1 0

Re: [Boost-users] [BGL] Issue using connected_components
by Nicolas Saunier 16 Dec '11

16 Dec '11

Hi everyone, I finally found a solution by myself to get connected_components from a graph of type adjacency_list<listS, listS, undirectedS> with bundled properties for the vertices and edges. So I will post it here so that others can find it, to get feedback and make sure I am doing it right: #include <boost/graph/adjacency_list.hpp> #include <boost/graph/connected_components.hpp> using namespace boost; using namespace std; struct FeatureConnection { float minDistance; float maxDistance; }; struct VertexInformation { int featureId; int index; }; typedef adjacency_list<listS, listS, undirectedS, VertexInformation, FeatureConnection> UndirectedGraph; int main() { UndirectedGraph g; UndirectedGraph::vertex_descriptor u, v, w, x, y; UndirectedGraph::edge_descriptor e, f; u = add_vertex(g); v = add_vertex(g); w = add_vertex(g); x = add_vertex(g); y = add_vertex(g); bool unused; tie(e, unused) = add_edge(u, v, g); tie(f, unused) = add_edge(x, y, g); cout << num_vertices(g) << " " << num_edges(g) << endl; graph_traits<UndirectedGraph>::vertex_iterator vi, vend; graph_traits<UndirectedGraph>::vertices_size_type cnt = 0; for(tie(vi,vend) = vertices(g); vi != vend; ++vi) g[*vi].index = cnt++; property_map<UndirectedGraph, int VertexInformation::*>::type components = get(&VertexInformation::index, g); int num = connected_components(g, components, vertex_index_map(get(&VertexInformation::index, g))); cout << num << endl; for(tie(vi,vend) = vertices(g); vi != vend; ++vi) cout << *vi << " " << components[*vi] << " " << g[*vi].index << endl; return 0; } Thanks, Nicolas -- Nicolas Saunier, ing. jr, Ph.D. Professeur Adjoint / Assistant Professor Département des génies civil, géologique et des mines (CGM) École Polytechnique de Montréal http://nicolas.saunier.confins.net

1 0

Boost on Mac w/ C++2011
by John M. Dlugosz 16 Dec '11

16 Dec '11

A co-worker reports that on a Mac, turning on the C++2011 dialect (to enable 'auto', lvalue references, etc.) makes the Boost headers choke. The release notes for the latest Boost show an older version of the compiler (Clang) as what is supported. Is there a simple way, like with a #define or a published patch to the config files, to make it work? —John

1 0

Condition Variable and optimization
by John M. Dlugosz 16 Dec '11

16 Dec '11

The example in the documentation for Condition Variables illustrates the implication that these are Mesa-style (non-blocking signals) with this example: boost::condition_variable cond; boost::mutex mut; bool data_ready; void process_data(); void wait_for_data_to_process() { boost::unique_lock<boost::mutex> lock(mut); while(!data_ready) { cond.wait(lock); } process_data(); } This needs to declare data_ready as mutable, so the compiler doesn't reduce the while loop to a no-op and assume the value doesn't change, or just hold it in a register so it doesn't see the change made by another thread. More generally, how do you write it in this case? while ( !collection.empty() ) cond.wait(lock); where the condition is a function of an existing class? The compiler might inline that function and give the same issue. I think a form of wait that takes a predicate ought to be introduced, that prevents this particular issue and ensures correct use. —John

2 2

Parsing statements from ascii files in arbitrary order into hierarchies of structs using boost spirit
by Stefan Zellmann 16 Dec '11

16 Dec '11

Hello! I'd like to parse one-line statements from an ascii file using boost spirit into structs. Statements may be quite different and may occur in arbitrary order. I'm wondering how I can achieve something like the following: /qi::rule<T, Statement(), Skipper> r_statement; qi::rule<T, DerivedStatement0(), Skipper> r_derivedStatement0; qi::rule<T, DerivedStatement1(), Skipper> r_derivedStatement1;/ With: /struct Statement { // empty }; struct DerivedStatement0 : public Statement { // members }; struct DerivedStatement1 : public Statement { // members };/ First thing I'm not sure about is how to adapt (using /BOOST_FUSION_ADAPT_STRUCT/) this hierarchy, since /Statement/ has no members. I've seen some snippets on the internet where inherited members (data members are good for me, no member functions) were adapted using /BOOST_FUSION_ADAPT_STRUCT/, so I'm right to believe that inheritance in my case shell pose no problem? Well, I'm actually not sure if the idea I came up with is the right way to accomplish this in the first place, so I'm grateful for any suggestions on how to do this more appropriately. Thanks in advance! Cheers, Stefan -- Stefan Zellmann Dipl.-Wirt.-Inf. Universität zu Köln RRZK Phone: +49 221 478 86578 Mail: zellmans(a)uni-koeln.de

2 3

[Geometry] 3D Oriented Bounding Box
by Jérémy Coulon 15 Dec '11

15 Dec '11

Hi All, Boost.Geometry looks promising for my personal projects. Reading the doc, I couldn't figure if it is possible to create a 3D oriented bounding box (OBB). I read that axis aligned bounding box (AABB) is supported but nothing on OBB. I need to use it in usual algorithms like intersetion, distance, ... Can anybody tell me if it is possible with the current Boost version and how I can achieve that ? Thanks. Jérémy

3 4

Boost Threads on Android
by John M. Dlugosz 15 Dec '11

15 Dec '11

I've heard that there are some issues with using Boost libraries that are not header-only on the Android platform. Where might I find some real information on that?

2 1

no thread pool?
by Jeff Graham 15 Dec '11

15 Dec '11

Hello, I do not see a thread pool in current boost. Has one never been accepted? Thanks.

2 1

[gil] Project Link
by Dan Bloomquist 15 Dec '11

15 Dec '11

I have put my adventure with gil on the web, this is just the start. If I have any stuff that needs attention about gil, I'd like to hear it. I'm thinking this will help others that have not started with gil yet. <http://lakeweb.net/test/codeproject.html> Best, Dan.

2 1

Re: [Boost-users] [Units] Temperature conversion problem
by Pieter 14 Dec '11

14 Dec '11

>>>> If 'f' is 212ÂºF, why, when converting it to ÂºC, do I end up at 117 and change? Is this really what we should expect? It seems that this very simple use case produces unexpected, and to a casual user wrong, results. I understand the need for complexity but it seems to show up very early in the user experience. >>> >>> Because a temperature change of 212ÂºF is equal to a temperature change of 117.778ÂºC = (5/9)*212. What would you expect the following to do: > > >> [ snipped a very complete response ] > >> Hi Matthias, > > Sorry, I didn't explain myself very well. I was merely surprised that quantities of temperature are, by default, temperature differences not absolute temperatures. With my rusty engineering hat on, I'd have expected quantities of temperature to be absolute so they're consistent with the published literature. I think of temperature differences as needing explanation such as outputting a Celsius temperature difference as Âºâˆ†C (delta ÂºC, ÂºdC, ...) rather than expressing a temperature difference with just ÂºC. Operating under the principle of least surprise, I found the default temperature behavior surprising, that's all. I don't know how useful temperature difference by itself really is but I'd guess it's less common than absolute temperatures or normalized temperatures though differences are useful, for example, in temperature gradients. >Don't mean to come across as prickly - there was just a lengthy debate on this topic during review. Basically, while the first order "principle of least surprise" is probably for temperatures to be absolute, this would make quantities of temperature an anomalous special case relative to all other quantities and would immediately cause problems when someone wanted, e.g., to implement something like the Planck radiation law, etc... In any case, we do appreciate feedback and try to incorporate suggestions for improvements wherever possible. >Cheers, >Matthias Dear Matthias, In the example given by you earlier: quantity<fahrenheit::temperature> f(32*fahrenheit::temperature()); quantity<celsius::temperature> c(0*celsius::temperature()); std::cout << f+quantity<fahrenheit::temperature>(c) << std::endl; std::cout << quantity<celsius::temperature>(f)+c << std::endl; would give different outputs 32+32 = 64 and 0+0 = 0 if the temperature were to be interpreted as being absolute. As far as I see it, it is in fact not ‘the order of conversion, but rather the scale that is used to do the addition in is what matters: in the Fahrenheit scale, taking twice the absolute temp. means something different than taking twice the absolute temperature in the Celsius scale (due to the affine relation between the scales). This does not make it meaningless to allow such additions (or other arithmetic operations). To give an example: take Plank’s radiation law which computes radiation of a body as a function of the temperature T in K, which is of the form (for appropriate constants a1 and a2): B(T) = a1*(1-exp(a2*T))^-1 As arithmetic is not allowed on absolute temperatures, my implementation would have to define T as a relative temperature, something like (in admittedly non-compiling 'code'): quantity<intensity> BodyRadiation(const quantity<si::temperature>& T) { // define a1 and a2 here return a1*(1/(1-std::exp(a2*T))); } Suppose the radiating body is at room temperature which I measure using my thermometer on the wall as 20.0 degrees Celsius. When I would define this as a relative temperature: quantity< celsius::temperature> TRoomInCelcius(20.0); and plug it into the radiation law: Intensity = BodyRadiation(quantity<si::temperature>(TRoomInCelcius)) This would give wrong results (without any warning) as the value T = 20K would be used unintentionally. I know it is the intent of the library to emphasize safety over convenience but I fail to see a problem with my abstraction here, while I don't regard this safe behavior. To get correct results I would need to define my room temperature as being absolute: quantity< absolute<celsius::temperature> > TRoomInCelcius (20.0); then translate it into an absolute temperature in K: quantity<absolute< si::temperature> > TRoomInK(TRoomInCelcius); and then ‘somehow’ translate this into a relative temperature to be plugged into the model, maybe like: quantity<absolute<si::temperature> > TZero(0*si::kelvin) ; quantity<si::temperature> T(TRoomInK – TZero); Intensity = BodyRadiation(T) which is far from elegant of course. Core of the matter is that I need the temperature to be converted using the ‘absolute’ notion, while I need it to be interpreted as ‘relative’ to be able to use it in the radiation law. This while the underlying numerical value of the ‘relative’ and ‘absolute’ temperature is the same and in both cases represents the same measured value. If arithmetic on the absolute type was allowed, this could all be avoided as the model could be specified in ‘absolute’ temperature – I don’t really understand why you say that would not make sense. I am not sure whether there is an elegant solution to allow this in natural manner. Maybe conversion for units with affine relations between scales should only be allowed to be explicitly done in either the absolute or relative manner, which could possibly also relieve the need for two different 'types' of temperature; as the example shows a single measurement can have both 'relative' and 'absolute' interpretations in the current system depending on the context in which it is used and the type of conversion that the context requires. Does this make any sense to you? Kind regards, Pieter

1 0

b-tree merge
by Jeff Ramsey 14 Dec '11

14 Dec '11

As an example, I've the following b-tree model with each node containing tag/value pairs. The tree indicates precedence (or priority), with the root being highest, down to the leaves as lowest (but this is application specific). I want to merge a new tree section into the parent, with the new section containing potentially common tag/value pairs all the way down to the node just above a leaf node (a completely duplicate new tree section would just not be merged). E.g. Existing tree (tag,value) pairs indicated: A,0 ,----------,----|--------, B,1 B,2 B,3 ,------|------, C,1 C,2 New tree to merge: A,0 | B,3 ,------|------, C,1 C,2 Final merged tree: A,0 ,----------,----|--------------, B,1 B,2 B,3 ,------|------, ,-----------, C,1 C,2 C,1 C,2 Question: is there a boost solution to this b-tree merge, and if not any suggestions? Thanks.

1 0

[Ref] unwrap_ref and TR1
by Krzysztof Żelechowski 14 Dec '11

14 Dec '11

The following code is valid: #if 1 #include <boost/ref.hpp> int const & (&b_unwrap_ref) (int const &) ((::boost ::unwrap_ref)); #endif The following code, however, is not (as of libstdc++ 4.5.1): #if 1 #include <tr1/functional> int const & (&tr1_unwrap_ref) (int const &) ((::std ::tr1 ::unwrap_ref)); #endif With the following diagnostic: > error: ‘unwrap_ref’ is not a member of ‘std::tr1’ So I started to ask myself: WTF? * It turns out that unwrap_ref did not make it to TR1, although reference_wrapper did. But why? * Because ref.hpp did not provide it when TR1 was formed? [1] Implication: * unwrap_ref (std:: reference wrapper) is a mismatch. #if 1 void test () { unwrap_ref (::boost ::cref (0)); unwrap_ref (::std ::tr1 ::cref (0)); // error: ‘unwrap_ref’ was not declared in this scope ::boost ::unwrap_ref (::std ::tr1 ::cref (0)); // error: error: invalid initialization of non-const reference } #endif Shouldn't we do something about it? Like, e.g., extend the scope of unwrap_ref to cover the corresponding standard class? This would at least allow expression #3. Chris ___ [1] <URL: https://svn.boost.org/svn/boost/!svn/bc/16384/trunk/boost/boost/ref.hpp >

1 0

challange to MPL gurus
by Robert Ramey 14 Dec '11

14 Dec '11

I am trying to implement concept checking for a couple of MPL concepts as part of a large project. I've having a heck of a time with some aspects of this. The example below illustrates one of the problems I'm having. The intent is to test the concept. for next<I>, the concept check is invoked recurrsively until the end of iteration is encountered. (I'm assuming it's a list in this test). But the is_end<false_> branch is always invoked leading to failure on both MSVC 9.0 and gcc 4.5.3 compilers I'll be quite impressed with anyone who can figure out how to make this work. Robert Ramey template<typename I> struct ForwardIterator { template<typename B> struct is_end {}; template<> struct is_end<false_> { typedef typename deref<I>::type t1; typedef typename next<I>::type t2; BOOST_CONCEPT_ASSERT(( ForwardIterator<t2> )); }; typedef typename boost::mpl::print< I >::type t1; typedef typename is_end< typename boost::is_same< boost::mpl::l_iter<boost::mpl::l_end>, I > > type; BOOST_MPL_ASSERT(( is_convertible< typename I::category, forward_iterator_tag > )); }; template<typename S> struct ForwardSequence { typedef typename end<S>::type t2; BOOST_CONCEPT_ASSERT(( ForwardIterator<t2> )); }; #include <boost/mpl/list.hpp> void test_list_sequence(){ BOOST_CONCEPT_ASSERT(( boost::mpl::ForwardSequence< boost::mpl::list<int, char> > )); }

4 15

Re: [Boost-users] Removing a vertex and adding another one with the same id causes segmentation fault?
by Alper Aydemir 14 Dec '11

14 Dec '11

The formatting went bad with the previous email. Sorry about that. Here it is once again. Hello, I'm using a labeled graph typedef boost::labeled_graph<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, Room, RoomEdge>,std::string> MyGraph; which lets me access vertices with string ids. I add a vertex and set it's relevant fields this way: MyVertex u = boost::add_vertex(id, g); g[id].category = category; //crashes here g[id].vertex_id = id; Here id is an std::string. And remove them like so: // First we remove all edges from this vertex BGL_FORALL_VERTICES(v, g, MyGraph){ if (QString(g.graph()[v].vertex_id.c_str()).compare(roomIdToBeRemoved) == 0){ ve = v; BGL_FORALL_OUTEDGES(v, e, g, MyGraph) { ev.push_back(e); } } } foreach(MyEdge e, ev){ remove_edge(e,g); } // Then we remove the vertex itself remove_vertex(roomIdToBeRemoved.toStdString().c_str(),g); This so far seems to work. The trouble is, if I want to add a removed vertex once again with the same id, I get the following: Exception Type: EXC_BAD_ACCESS (SIGSEGV) while setting the fields of the newly added vertex (above commented "crashes here"). What might be the reason? I'm using boost functions for removing/adding things.

1 0

Error in accessing label of an edge, urgently need help.
by Amanullah Yasin 14 Dec '11

14 Dec '11

Hello, I want to put edge label but facing an error. Please share any better idea. Thanks in advance. YASIN ======================= My graph is: namespace boost { struct computable_object_t { typedef vertex_property_tag kind; }; } typedef boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::computable_object_t, plComputableObject*> > slVertexProperty; typedef boost::property<boost::edge_weight_t, slScoreValueType, boost::property<boost::edge_name_t, std::string>> slEdgeProperty; typedef boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, slVertexProperty, slEdgeProperty> slGraph; slGraph graph; .... ... //Now i want to add edge name boost::property_map<slGraph, edge_name_t>::type labelmap = get(edge_name, graph); for(tie(ei, ei_end) = edges(graph); ei != ei_end; ++ei){ string label = "unknown"; put(labelmap, *ei, label); cout<<"\nUndirected s: "<<vertex_id[source(*ei, graph)] <<" T: "<<vertex_id[target(*ei, graph)]<<" LABEL: "<< get(labelmap,*ei); } ////////////But it gives me an error//////////////// E:\ProBT22\boost_1_46_1\boost/property_map/property_map.hpp(361): error C2679: binary '=' : no operator found which takes a right-hand operand of type 'const std::string' (or there is no acceptable conversion) 1> E:\ProBT22\boost_1_46_1\boost/pending/detail/property.hpp(21): could be 'boost::detail::error_property_not_found &boost::detail::error_property_not_found::operator =(const boost::detail::error_property_not_found &)' 1> while trying to match the argument list '(boost::detail::error_property_not_found, const std::string)' 1> MMHC\ResultAnalysis.cpp(558) : see reference to function template instantiation 'void boost::put<boost::adj_list_edge_property_map<Directed,Value,Ref,Vertex,Property,Tag>,Ref,boost::detail::edge_desc_impl<Directed,Vertex>,std::string>(const boost::put_get_helper<Reference,LvaluePropertyMap> &,K,const V &)' being compiled 1> with 1> [ 1> Directed=boost::bidirectional_tag, 1> Value=boost::detail::error_property_not_found, 1> Ref=boost::detail::error_property_not_found &, 1> Vertex=void *, 1> Property=boost::property<boost::edge_weight_t,slScoreValueType>, 1> Tag=boost::edge_name_t, 1> Reference=boost::detail::error_property_not_found &, 1> LvaluePropertyMap=boost::adj_list_edge_property_map<boost::bidirectional_tag,boost::detail::error_property_not_found,boost::detail::error_property_not_found &,void *,boost::property<boost::edge_weight_t,slScoreValueType>,boost::edge_name_t>, 1> K=boost::detail::edge_desc_impl<boost::bidirectional_tag,void *>, 1> V=std::string 1> ]

2 2

boost::hashes status
by Martin Dyring-Andersen 14 Dec '11

14 Dec '11

Hello, I've been using (parts of) the boost::hashes library for some time, and it seems to work quite well. Thanks Scott! A few changes are necessary to compile without errors and warnings Visual Studio 10 (see attached). I was wondering what the plans are for making it an official library? IMO it would be a very nice addition. As I recall, a suggestion was made to rename the library to boost::digest instead, to avoid confusion with boost::hash and the plural form. That seems sensible to me. -- Best regards, Martin Dyring-Andersen

2 1

Ambiguous boost::move
by Kelvin Chung 13 Dec '11

13 Dec '11

I'm having this compiler issue while trying to use boost::packaged_task (gcc, C++03, move emulation). When I try to compile, I get the following: src/KMBuilder.cpp:54: error: call of overloaded ‘move(boost::unique_future<long unsigned int>&)’ is ambiguous boost/include/boost/thread/detail/move.hpp:44: note: candidates are: typename boost::enable_if<boost::is_convertible<T&, boost::detail::thread_move_t<T> >, boost::detail::thread_move_t<T> >::type boost::move(T&) [with T = boost::unique_future<long unsigned int>] boost/include/boost/move/move.hpp:294: note: typename boost::move_detail::disable_if<boost::has_move_emulation_enabled<T>, T&>::type boost::move(T&) [with T = boost::unique_future<long unsigned int>] The offending line of code: futures.push_back(boost::move(taskResult)); // futures is a boost::container::deque Is there a way to force one version of boost::move over the other? If so, which one should I use?

3 2

Using unique_future in C++03, boost 1.47.0
by Kelvin Chung 13 Dec '11

13 Dec '11

I have a bunch of boost::packaged_task<unsigned long>, which I intend to execute on separate boost::threads. Before I do that, though, I want to insert each boost::unique_future<unsigned long> in a container as I make them. Given that I am using C++03 and boost 1.47.0 (boost 1.48.0 craps out over an ambiguous overload of boost::move), I have something like the following: std::deque<boost::unique_future<unsigned long>> futures; // std::deque<boost::thread> evalThreads; TODO for (…) { boost::packaged_task<unsigned long> task = …; // Create the tasks, one at a time boost::unique_future<unsigned long> taskResult = task.get_future(); // boost::thread taskThread(boost::move(task)); TODO // boost::unique_future and boost::thread can't be copied, but can be moved futures.push_back(boost::move(taskResult)); // evalThreads.push_back(boost::move(taskThread)); TODO } boost::wait_for_all(futures.begin(), futures.end()); // Now we can do stuff with futures The problem is that the code above is failing to compile, saying that /usr/include/c++/4.1.2/ext/new_allocator.h:104: error: passing ‘const boost::unique_future<long unsigned int>’ as ‘this’ argument of ‘boost::unique_future<R>::operator boost::detail::thread_move_t<boost::unique_future<R> >() [with R = long unsigned int]’ discards qualifiers I don't fully understand the problem, but I blame the move emulation. How do I fix this?

2 1

boost::shared_locks and boost::upgrade_locks
by Kelvin Chung 13 Dec '11

13 Dec '11

I'm trying to implement a read-write lock, and I was told to use boost::upgrade_lock. However, only one thread can have a boost::upgrade_lock, and everyone else gets blocked, so it's not much on the read end. (Correct me if I am wrong, but boost::upgrade_lock only waits if someone has exclusive, but someone with boost::upgrade_lock will cause everyone else to block) But reads are cheap in my case - I just need to use locks for a cache. So, suppose I have the following: class Cache { std::map<Input, Output> cache; boost::shared_mutex mutex; public: Output query(const Input& in); }; It would appear that the proper way to implement Cache::query() is as follows: Output query(const Input& in) { boost::shared_lock<boost::shared_mutex> readLock(mutex); if (cache.count(in) == 0) { readLock.unlock(); boost::unique_lock<boost::shared_mutex> writeLock(mutex); // Check to see if the result was added while waiting for lock if (cache.count(in) != 0) return cache[in]; cache[in] = compute_output(in); return cache[in]; } else { return cache[in]; } } Is this correct? Or maybe it should be this: Output query(const Input& in) { boost::shared_lock<boost::shared_mutex> readLock(mutex); if (cache.count(in) == 0) { readLock.unlock(); boost::upgrade_lock<boost::shared_mutex> rereadLock(mutex); // Check to see if the result was added while waiting for lock if (cache.count(in) != 0) { return cache[in]; } else { boost::upgrade_to_unique_lock<boost::shared_mutex> writeLock(rereadLock); cache[in] = compute_output(in); return cache[in]; } } else { return cache[in]; } } A side question is that if compute_output() is an expensive operation, should that be moved to the part between releasing the read lock and getting the write/reread lock?

5 9

Priority task queues using Boost.Asio and Boost.Thread
by Kelvin Chung 13 Dec '11

13 Dec '11

Suppose I have this abstract class Task like so: struct Task { virtual int doStuff() = 0; }; I then also have this: class CompositeTask : public Task { std::vector<Task> tasks; public: int doStuff() { for (std::vector<Task>::const_iterator it = tasks.begin(); it != tasks.end(); ++it) { it->do_stuff(); } } }; Now suppose that there is a point where I have a list of Tasks and I want to have them executed concurrently. To do so, I've leveraged Boost.Asio to create a thread pool task queue construct (via boost::asio::io_service). The next step beyond that is that I want to evaluate each of the tasks in CompositeTasks in parallel. I have a few questions about this: * One idea is to make a separate task thread for each CompositeTask. I'm under the impression that there is an absolute limit to the number of threads that I can make, which is determined by boost::thread::hardware_concurrency(). Is this true? If so, if the main Task queue has that many threads, would making a second task queue fail because it can't get more? * If I keep to one task queue (ie. throw all the Tasks in the CompositeTask to the main Task queue), then the possiblity exists of some kind of starvation (eg. the queue is full of CompositeTasks, and they are all blocking due to dependencies on Tasks in the queue). Is there a way to prioritize Tasks in the queue so that this doesn't happen?

3 2

Try-upgrade locking
by Kelvin Chung 13 Dec '11

13 Dec '11

Suppose I have a boost::upgrade_lock<boost::shared_mutex>. When I want to create the boost::upgrade_to_unique_lock<boost::shared_mutex> and upgrade to exclusive locking, this blocks until all the shared lock holders leave. However, it does not appear that there is a non-blocking version of this, unlike, say, making a boost::unique_lock<boost::shared_mutex> and passing in boost::try_to_lock. So what should I do in order to create my own "try-upgrade" lock? I'm trying to use it like so: boost::upgrade_lock<boost::shared_mutex> upgradeLock(mutex); ... if (...) { // Substitute for boost::upgrade_to_unique_lock<boost::shared_mutex>, but also with aspects of // boost::try_to_lock, basically my_upgrade_to_unique_lock<boost::shared_mutex> deferredWriteLock(lock); // Do stuff where it doesn't matter whether I have exclusive or not, while the readers leave if (!deferredWriteLock) deferredWriteLock.lock(); // Now we need exclusive // We have exclusive, do more stuff } // Back to regular upgrade_lock here

3 2

Boost matix question from a newbie
by boostnewbie 13 Dec '11

13 Dec '11

Hello, I want to use the boost matrices, and I have examples how to deal with that. But now, I want to store those matrix in a std-Array or an std-list. To do this, I must be able to name the type of for example a 3X3 matrix. I mean I nbeed an expressione similar to std::vector<matrix<double>> trafos; but I don´t know how to say that the matrix is a 3X3 type. Thanks in advence Egon -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-matix-question-from-a-newbie-tp418… Sent from the Boost - Users mailing list archive at Nabble.com.

3 2

shared_ptr to object in stl set container?
by Galen 13 Dec '11

13 Dec '11

Hi, -- I'm trying to use shared_ptr in a stl set, but am having trouble with find() Any help? Documentation on this seems hard to find. -- Also, are the overloaded < and == useful or correct here? thanks! Output is: ------------------ 0 adding neighbor 1 0 adding neighbor 2 1 adding neighbor 0 2 adding neighbor 1 0's neighbors 1 has 1 neighbors 0 2 has 1 neighbors 1 NOT WORKING is 1 a neighbor of 0? 0 is 0 a neighbor of 1? 0 Code below: ------------------- #include<set> #include<iostream> #include<boost/shared_ptr.hpp> using namespace std; //use typedef instead in actual code #define NodePtr boost::shared_ptr<Node> // TODO: should this extend shared_ptr? class Node { private: int id; set<NodePtr> neighbors; public: Node() { } Node(int newID) { id = newID; } ~Node() { } int getID() { return id; } int addNeighbor(NodePtr newNode) { int newID; newID = newNode->id; // if not already a neighbor, add if (!isNeighbor(newID)) neighbors.insert(newNode); } set<NodePtr> getNeighbors() { return neighbors; } bool isNeighbor(int searchID) { set<NodePtr>::iterator it; // check if this neighbor already in list NodePtr searchNode(new Node(searchID)); it = neighbors.find(searchNode); // if not found, add to neighbors if (it == neighbors.end()) { return false; } //else return true; } //overload == for find() bool operator== (NodePtr otherNode) { cout << "==: " << otherNode->id << " " << id << endl; return (otherNode->id == id); } //overload < in case we want to sort bool operator< (NodePtr otherNode) { return (id < otherNode->id); } }; int main() { // the nodes are pointers to Node objects NodePtr n0(new Node(0)); NodePtr n1(new Node(1)); NodePtr n2(new Node(2)); cout << n0->getID() << " adding neighbor " << n1->getID() << endl; n0->addNeighbor(n1); cout << n0->getID() << " adding neighbor " << n2->getID() << endl; n0->addNeighbor(n2); cout << n1->getID() << " adding neighbor " << n0->getID() << endl; n1->addNeighbor(n0); // cout << n2->getID() << " adding neighbor " << n0->getID() << endl; // n2->addNeighbor(n0); cout << n2->getID() << " adding neighbor " << n1->getID() << endl; n2->addNeighbor(n1); set<NodePtr> neighbors = n0->getNeighbors(); set<NodePtr>::iterator NB; int id = n0->getID(); cout << id << "'s neighbors" << endl; for (NB = neighbors.begin(); NB != neighbors.end() ; NB++) { set<NodePtr> neighborsList = (*NB)->getNeighbors(); cout << (*NB)->getID() << " has " << neighborsList.size() << " neighbors" << endl; cout << (*neighborsList.begin())->getID() << endl; } // http://www.engr.sjsu.edu/wbarrett/SortFind.htm cout << "NOT WORKING" << endl; cout << "is 1 a neighbor of 0? " << n0->isNeighbor(1) << endl; cout << "is 0 a neighbor of 1? " << n1->isNeighbor(0) << endl; }

6 11

Re: [Boost-users] Boost-users Digest, Vol 2933, Issue 5
by Marat Abrarov 13 Dec '11

13 Dec '11

Hi, Rory. > Is there a reason io_service::run does not set an appropriate error on the > passed boost::system::error_code object when this is encountered? Certainly > it seems like an error case and would help circuital circumstances such as > my own. With current behavior of asio::io_service we can continue working with io_service after it was stopped by calling asio::io_service::reset(). It's like pause on io_service. It's not often used feature but it is nice to know that such behavior is possible. Also note that invocation of handlers is done only within threads that executes asio::io_service::run (run_one, poll, poll_one - http://www.boost.org/doc/libs/1_48_0/doc/html/boost_asio/overview/core/thre…) When io_service switches to the "stopped" state asio::io_service::run have to exit as fast as possible. When io_service is already in the "stopped" state asio::io_service::run have to exit immediately. So if io_service is already in stopped state before any user thread calls asio::io_service::run how can Asio pass "appropriate error" to asynchronous completion handlers? IMHO, current design of Asio is very clear. Regards, Marat Abrarov.

2 1

Re: [Boost-users] incompatible serialization format of boost::property_tree between 1.44 and 1.48 (Robert Ramey)
by kpzhang 13 Dec '11

13 Dec '11

Hi Robert, os: windows 7 compiler: visual studio 2008 sample code: #include <iostream> #include <string> #include <boost/property_tree/ptree.hpp> #include <boost/property_tree/json_parser.hpp> int main() { std::string str; { std::stringstream sstr; boost::property_tree::ptree pt; char a= '\0'; pt.put("a",a); boost::property_tree::write_json(sstr, pt); str = sstr.str(); std::cout << str << std::endl; } { std::stringstream sstr(str); boost::property_tree::ptree pt; boost::property_tree::read_json(sstr, pt); char a = '\1'; std::cout << (int)pt.get("a",a) << std::endl; } return 0; }

1 0

Request for change on Solaris platform
by Leo Carreon 13 Dec '11

13 Dec '11

Hi, I have just discovered that the Apache Standard C++ Library (stdcxx4) is now available in both Solaris 10 U10 and Solaris 11. Would it be possible to add stdcxx4 as a standard library option for Solaris on the next Boost release? Kind regards, Leo

1 0

[BGL] Default-constructibility of vertices
by Kelvin Chung 13 Dec '11

13 Dec '11

Suppose I have a class hierarchy, like so: struct Foo { virtual Output doSomething(const Input& in); }; class CompositeFoo { std::vector<Foo*> fooList; // Use your favorite smart pointer standin for Foo* here public: Output doSomething(const Input& in); }; Now, suppose I have a functor: class Functor { Foo* foo; Input input; // assume Input is copyable public: Output operator()() { foo->doSomething(input); } }; Now, the structure of doSomething() calls leads to a DAG structure with Functor as the vertices. What I want to do is create a graph with BGL that shows that structure, before topologically sorting it and doing other stuff with it. However, it would appear that the vertices of the graph (which I would assume to be of type boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, Functor>) must be default-constructible, which Functor is clearly not. Is there a nice workaround to this without changing the vertex type to Functor* (again, use your favorite smart pointer standin for Functor* here)?

2 1

[boost] [review] [Local] Review Result - ACCEPTED
by Jeffrey Lee Hellrung, Jr. 13 Dec '11

13 Dec '11

Local is ACCEPTED into Boost. After following the lively Local review discussion several weeks ago, and reviewing the discussion a second (and sometimes third) time, I have come to the above conclusion. There was quite a bit of passion on both the sides of "aisle", and thus, obviously, no decision I make would be well-received by all. Let me start by summarizing the main arguments against including Local in Boost: (a) Local functions are not very useful, at least in the presence of existing alternatives (e.g., namespace functions and Boost.Phoenix). (b) Local is really a portability library for C++03 presenting an imperfect emulation of features readily available in C++11. (c) Local's interface is primarily macro-based, making code ugly and difficult to read. In my opinion as the review manager, a sufficient number of individuals in the discussion found the library "useful" to address (a) (sometimes with additional positive adverbs); indeed, at least a couple individuals have shared positive experiences with real-world use. Namespace functions require one to move code to somewhere other than where one may prefer to have it, and often requires a significant amount of boilerplate when binding local variables. Aside from any perceived issues with Boost.Phoenix's syntax and compiler error messages, it has been noted that binding member functions within Boost.Phoenix can get ugly. As far as (b) is concerned, the community seems pretty far from reaching a consensus on whether a library described by (b) belongs in Boost. There are certainly libraries currently in Boost that could be pegged to satisfy (b) as well, though they all have other mitigating features they make their situation different from Local in some way. As far as (c) is concerned, several have acknowledged that a macro-based interface is necessary to implement local functions in C++03, and it seems to have been generally agreed that, given this limitation, Lorenzo has done an admireable job making the interface as easy-to-use as possible. Some find it ugly, others find it reasonable. In addition to the counterarguments of (a-c) above, the following facts weighed into my final decision: * Lorenzo has been engaging and in constant communication with the developer's list during the development of Local. This gives me confidence that he will continue to actively maintain (and improve?) Local. * The documentation is unanimously agreed to be of Boost quality. * The transition of some organizations from C++03 to C++11 may take several more years, and Boost has a history of supporting "ancient" compilers (for better or worse). The point being, a library that eases the transition from C++03 to C++11 has some merit based on current precedent. * There had been previous work on local functions by Alexander Nasanov and Steven Watanabe shared on the developer's list, suggesting a desire for this functionality for some time. * Local is approximately an extension of Boost.ScopeExit; indeed, it basically fulfills the request to Alexander Nasanov from the review result [2] of Boost.ScopeExit to create such an extension. Lastly, my own opinion of "what Boost is" factored in here. I view Boost as *partly* a collection of general purpose libraries that can be used in wide variety of applications (and thus Boost frequently acts as a staging ground for standard adoption). Based on review feedback, I believe Local satisfies this criterion; and based on the mailing list discussion, I believe this view of Boost is not entirely inconsistent with others on the mailing list. Ultimately, it wasn't so much a # of "yes" votes versus # of "no" votes as it was the above general considerations. Regardless, I think independent of how the votes were counted, the "yes" votes outnumbered the "no" votes. This required some discretion on my part as not everyone who expressed an opinion submitted a formal review, and some participants were only arguing in favor of some specific point supporting either acceptance or rejection of Local. "Yes" reviews (7) -------- Krzysztof Czainski Andrzej Krzemienski Pierre Morcello Nat Lindon John Bytheway Edward Diener Gregory Crosswhite "No" reviews (3) -------- Vicente J. Botet Thomas Heller Hartmut Kaiser Paul A. Bristow and Alexander Nasanov (the author of Boost.ScopeExit) both submitted reviews but did not express an opinion (as far as I could tell) on whether Local should be included in Boost, though if I had to peg Paul's, it would be to reject Local. From what I gathered, Joel de Guzman, Joel Falcou, Dean Michael Berris, and Lucanus J. Simonson were opposed to including Local in Boost (the aforementioned did not submit a formal review, though a formal review might be unnecessary if your vote is "no"). On the other hand, Brian Wood, Philippe Vaucher, Mathias Gaunard, Robert Ramey, Nathan Ridge, Brent Spillner, Thomas Klimpel, Christopher Jefferson, Daniel James, Rafael Fourquet, Matthias Schabel, and Robert Stewart participated in the discussion and argued in favor of some point that supported accepting Local in Boost. I want to be clear here that certainly not everyone in the aforementioned list even implied that they supported acceptance of Local (I would guess that only roughly half implied as much), but they indirectly helped its case by addressing arguments against inclusion. Overall, that indicates to me that more individuals support acceptance of Local into Boost than rejection. [Apologies for any name misspellings and absent accents.] Regarding Boost.ScopeExit: 4 reviews were in favor of deprecating Boost.ScopeExit; 3 reviews felt there was nothing wrong with both Boost.ScopeExit and Local coexisting; and 3 reviews mentioned the possibility of improving Boost.ScopeExit with the features provided by Local's exits. As such I'm inclined to let Alexander (who opposed any kind of merging of Local and Boost.ScopeExit) work with Lorenzo on improving Boost.ScopeExit as he sees fit, and hopefully both libraries can address this apparent duplication of functionality within their respective documentation to avoid user confusion. Regarding local::function::overload: Based on the review comments, it makes the most sense to add this to Boost.Functional. Regarding BOOST_IDENTITY_TYPE: This should be added to Boost.Utility. On the other hand, there doesn't appear to be a compelling use case for BOOST_IDENTITY_VALUE. The following are some suggested *possible* improvements that reviewers brought up. This list is by no means exhaustive. Further, I personally don't think all of these suggestions are necessarily "good", but I think it's fair for Lorenzo (and the community) to consider them nonetheless. Parenthetic comments are my own opinions. * Some aren't convinced of the utility of LOCAL_BLOCK. (It's use cases appear fairly narrow so it might be best to simplify the library and remove this capability.) * Use "this_" (as opposed to "_this") as an alias for "this" within function bodies, and possibly also within bind declarations. * Present Boost.PP sequence interface as a workaround for the variadic interface? (I don't have a problem with supporting both interfaces at the top level.) * "Local" and "Locale" look too much alike, suggesting a name change to "Scope", "Scoped", "LocalFunction", "Closure" may be a good idea? * Allow use without dependence on Boost.TypeOf. * Rename prefix and postfix macros from XXX_PARAMS/XXX_NAME to XXX/XXX_END? (I don't mind the current macros.) * Explicitly separate bound variables from function parameters. (I think this suggestion has merit but I don't know what the interface could look like.) * Remove support for default parameters to simplify interface and documentation? (It doesn't seem like default function parameters would be very useful.) * Use "capture" instead of "bind" for the bind/capture keyword? (I like and prefer "bind".) Finally, here the links to the submitted formal reviews, for reference. Of particular note are Krzysztof's and John's reviews for their comments on the documentation. Some "yes" votes were conditional, but AFAIK Lorenzo has already agreed to address the relevant conditions. Krzysztof Czainski http://permalink.gmane.org/gmane.comp.lib.boost.devel/225543 Vicente J. Botet http://permalink.gmane.org/gmane.comp.lib.boost.devel/225604 Andrzej Krzemienski http://permalink.gmane.org/gmane.comp.lib.boost.devel/225656 Paul A. Bristow [...cannot find link to review...] Pierre Morcello http://permalink.gmane.org/gmane.comp.lib.boost.devel/225694 Nat Lindon http://permalink.gmane.org/gmane.comp.lib.boost.user/71508 Thomas Heller http://permalink.gmane.org/gmane.comp.lib.boost.devel/225736 Hartmut Kaiser http://permalink.gmane.org/gmane.comp.lib.boost.devel/225745 John Bytheway http://permalink.gmane.org/gmane.comp.lib.boost.devel/225746 Alexander Nasanov http://permalink.gmane.org/gmane.comp.lib.boost.devel/225783 Edward Diener http://permalink.gmane.org/gmane.comp.lib.boost.devel/225795 Gregory Crosswhite http://permalink.gmane.org/gmane.comp.lib.boost.devel/225807 Finally, really big thanks to everyone for participating in the review and ancillary discussions. I attempted to be as transparent as possible in outlining the rationale for my decision above, but if you have any further questions, do not hesitate to ask. - Jeff, Review Manager for Local [1] http://thread.gmane.org/gmane.comp.lib.boost.devel/168612 [2] http://lists.boost.org/boost-announce/2008/05/0190.php

2 1

Calls to asio::io_service::run on io_service object in stopped state don't generate an error.
by Rory Hart 12 Dec '11

12 Dec '11

Hey I spent a day trying to work out why calls to io_service::run was returning directly without running my async operations. It was my own fault of course, the io_service was in a stopped state as I had previously called io_service::stop and needed to call io_service::reset on it. This is documented in both the stop and reset documentation if I had RTFM instead of just skimming the interface. Is there a reason io_service::run does not set an appropriate error on the passed boost::system::error_code object when this is encountered? Certainly it seems like an error case and would help circuital circumstances such as my own. If there is no obvious reason not to I will put in a feature request and attempt a patch (I haven't touched the boost code base before). Thanks -- Rory Hart http://www.roryhart.net http://www.relishment.com

1 0

incompatible serialization format of boost::property_tree between 1.44 and 1.48
by kpzhang 12 Dec '11

12 Dec '11

Hi, Several days ago I upgrade boost from 1.44 to 1.48 and I found that serialization format is not compatible for node of 'char' type. The serialization format of a "char a=0" node in boost1.44 is: { "a": "\0" } while in boost1.48 is: { "a": "\u0000" } For the format of boost1.44, read_json of boost1.48 will throw exception which complains unexpected escaped slash. Is this intended behavior or a bug or my misuse? Any suggestions is welcomed. Regards, Ivan

2 1

boost asio: Crash on timer.expires_from_now only with specific MSVC settings (whole program optimization)
by Florian Burkart 12 Dec '11

12 Dec '11

Hi, I am currently struggling with a crash that I find very hard to isolate. Please see attached three classes I am using (the one not included is FlamTimeMillis, but that is basically just my own time class). In any case, LiveTimer works absolutely fine in my unit tests. It works absolutely fine in both debug and regular release versions. However, when compiled under msvc with compile options /Ox /Oi /Ot /GL and linked with /LTCG (e.g. whole program optimization), it crashes. But only in my main program, and not in any test I try to create. But in the main program, it consistently crashes. According to the logs, it crashes between 3 and 4, e.g. the log looks like this: IN: : LiveTimer: RegisterTimedCallback 2011-12-12 07:02:00.000000: Locked mutex. IN: : LiveTimer: Expires from now -22405.5 A: 2011-12-12 07:02:00.000000 B: 2011-12-12 13:15:25.489000 C: -2.24055e+007 IN: : 1 IN: : 2 IN: : 3 This happens on the very first call to RegisterTimedCallback. Judging from it, it looks like it crashes on timer.expires_from_now(boost::posix_time::seconds((long)secondsToElapse)). I checked that I am in the correct LiveTimer, and that LiveTimer still exists. I tried loading the dump file into WinDbg, and I get the following output: XCEPTION_RECORD: ffffffff -- (.exr 0xffffffffffffffff) ExceptionAddress: 77b68da9 (ntdll!RtlpWaitOnCriticalSection+0x000000bd) ExceptionCode: c0000005 (Access violation) ExceptionFlags: 00000000 NumberParameters: 2 Parameter[0]: 00000001 Parameter[1]: 00000114 Attempt to write to address 00000114 PROCESS_NAME: Test.exe ERROR_CODE: (NTSTATUS) 0xc0000005 - The instruction at 0x%08lx referenced memory at 0x%08lx. The memory could not be %s. EXCEPTION_CODE: (NTSTATUS) 0xc0000005 - The instruction at 0x%08lx referenced memory at 0x%08lx. The memory could not be %s. EXCEPTION_PARAMETER1: 00000001 EXCEPTION_PARAMETER2: 00000114 WRITE_ADDRESS: 00000114 FOLLOWUP_IP: Test!boost::asio::detail::win_iocp_io_service::cancel_timer<boost::asio::time_traits<boost::posix_time::ptime> >+4c [c:\program files (x86)\boost_1_47_0\boost\asio\detail\impl\win_iocp_io_service.hpp @ 117] 0139784c b001 mov al,1 MOD_LIST: <ANALYSIS/> NTGLOBALFLAG: 0 APPLICATION_VERIFIER_FLAGS: 0 FAULTING_THREAD: 000029b8 BUGCHECK_STR: APPLICATION_FAULT_NULL_CLASS_PTR_DEREFERENCE_INVALID_POINTER_WRITE PRIMARY_PROBLEM_CLASS: NULL_CLASS_PTR_DEREFERENCE DEFAULT_BUCKET_ID: NULL_CLASS_PTR_DEREFERENCE LAST_CONTROL_TRANSFER: from 77b68cb8 to 77b68da9 STACK_TEXT: 0032ec44 77b68cb8 00000000 00000000 00000000 ntdll!RtlpWaitOnCriticalSection+0xbd 0032ec6c 0139784c 00953408 654f7f27 0032ecf0 ntdll!RtlEnterCriticalSection+0x150 0032ecac 0139e79a 0095015c 0032f93c ffffffff Test!boost::asio::detail::win_iocp_io_service::cancel_timer<boost::asio::time_traits<boost::posix_time::ptime> >+0x4c [c:\program files (x86)\boost_1_47_0\boost\asio\detail\impl\win_iocp_io_service.hpp @ 117] 0032ecdc 013d9d20 0095015c 0032ed38 00000000 Test!boost::asio::detail::deadline_timer_service<boost::asio::time_traits<boost::posix_time::ptime> >::expires_from_now+0x6a [c:\program files (x86)\boost_1_47_0\boost\asio\detail\deadline_timer_service.hpp @ 159] 0032ecfc 013d948f 0032ed28 654f7e57 0095716c Test!boost::asio::basic_deadline_timer<boost::posix_time::ptime,boost::asio::time_traits<boost::posix_time::ptime>,boost::asio::deadline_timer_service<boost::posix_time::ptime,boost::asio::time_traits<boost::posix_time::ptime> > >::expires_from_now+0x30 [c:\program files (x86)\boost_1_47_0\boost\asio\basic_deadline_timer.hpp @ 411] 0032ede0 013b1840 0032f900 00950188 0094f970 Test!Flam::Live::LiveTimer::EnqueueTimedCallback+0x33f [c:\users\florian\documents\liveenvv1\trunk\flamlib\live\livetimer.cpp @ 55] STACK_COMMAND: ~0s; .ecxr ; kb FAULTING_SOURCE_CODE: 113: // If the service has been shut down we silently ignore the cancellation. 114: if (::InterlockedExchangeAdd(&shutdown_, 0) != 0) 115: return 0; 116: > 117: mutex::scoped_lock lock(dispatch_mutex_); 118: op_queue<win_iocp_operation> ops; 119: std::size_t n = queue.cancel_timer(timer, ops, max_cancelled); 120: post_deferred_completions(ops); 121: return n; 122: } SYMBOL_STACK_INDEX: 2 SYMBOL_NAME: Test!boost::asio::detail::win_iocp_io_service::cancel_timer<boost::asio::time_traits<boost::posix_time::ptime> >+4c The source quoted is from \boost_1_47_0\boost\asio\detail\impl\win_iocp_io_service.hpp. Despite the fact that I can't isolate the error, everything I look at points to a problem somewhere within boost asio, or me not using asio correctly. Anyone any suggestions as to where to go from here? Would be much appreciated. What looks a bit suspicious to me (but that might be entirely wrong), is the line "// If the service has been shut down we silently ignore the cancellation.," because the error happens after the return statement linked to that comment was apparently not executed, and the service has actually been shut down. P.S. I know that I don't need to manage the queue myself and could just let asio handle it, however, eventually I would like to manage the queue more (e.g. edit some timers, cancel others, so I'd prefer to stick to a single timer and manage the queue myself).

1 0

is_dereferenceable.hpp fails to compile with Apple Clang 3.0
by István Csanády 12 Dec '11

12 Dec '11

Hi All, I am trying to use boost::iostreams. When I include boost/iostreams/filtering_streambuf.hpp (even if I don't declare any filtering_streambuf variables) I get the following compilation error: is_dereferencable.hpp: Parse Issue: Expected unqualified-id The problem is in this code: template <class T> struct impl { static typename boost::remove_cv<T>::type& x; BOOST_STATIC_CONSTANT( bool , value = sizeof(is_dereferenceable_::check BOOST_PREVENT_MACRO_SUBSTITUTION(BOOST_comma(*x,0))) == 1 ); }; Compiler: Apple Clang 3.0, with -std=c++0x flag Any help would be greatly appreciated. Thanks Istvan

4 4

Query on Boost.iostreams
by Leo Carreon 12 Dec '11

12 Dec '11

Hi, I’m building Boost 1.47.0 for Windows with VS 2010 using the following commands: .\bootstrap.bat .\b2 -sZLIB_SOURCE=c:\zlib-1.2.5 -sBZIP2_SOURCE=c:\bzip2-1.0.6 link=static,shared runtime-link=shared address-model=32 variant=release install 2>&1 | tee libwin32.log The resulting Boost\lib directory contains the following files: boost_bzip2-vc100-mt-1_47.dll boost_bzip2-vc100-mt-1_47.lib libboost_bzip2-vc100-mt-1_47.lib boost_zlib-vc100-mt-1_47.dll boost_zlib-vc100-mt-1_47.lib libboost_zlib-vc100-mt-1_47.lib I created test applications to use the shared ZLIB and BZIP2 libraries which means I had to link with the corresponding import libraries. I discovered that the test application for the ZLIB library is able to execute correctly. However, the test application for the BZIP2 library fails because it is looking for LIBBZ2.DLL instead of boost_bzip2-vc100-mt-1_47.dll. I used dumpbin.exe to check the contents of the BZIP2 import library and it is definitely referring to LIBBZ2.DLL. I tried to locate the issue in the JAM files but since I’m a newbie with JAM files I couldn’t locate what is causing this issue. At the moment, my workaround is simply creating a copy of boost_bzip2-vc100-mt-1_47.dll as LIBBZ2.DLL although ideally this shouldn’t be necessary. Can this problem be fixed in the next release of the Boost libraries. Do I need to raise a bug for this? Kind regards, Leo

1 0

[boost::thread] can not link on open suse
by Kaz 11 Dec '11

11 Dec '11

Hi All, I have downloaded 1.4.8 on a new machine running suse 12.1 Kde, and built it using bjam install option. Now I have a very simple threading program as follows #include <boost/thread.hpp> #include <iostream> void func() { for(int i = 0; i < 10; ++i ) std::cout<<i<<std::endl; } int main () { boost::thread th0(func); th0.join(); return 0; } when I try to compile it using this command g++ -static -I./Built_Boost_1.4.8.0/include -L./Built_Boost_1.4.8.0/lib/ boostThreadTest.cpp -lboost_thread -lpthread -o threadTest I get following error /usr/lib/gcc/i586-suse-linux/4.6/../../../../i586-suse-linux/bin/ld: cannot find -lpthread /usr/lib/gcc/i586-suse-linux/4.6/../../../../i586-suse-linux/bin/ld: cannot find -lm /usr/lib/gcc/i586-suse-linux/4.6/../../../../i586-suse-linux/bin/ld: cannot find -lc collect2: ld returned 1 exit status I have searched for libpthread.a, but can not find it in my system. although I can see these /lib/libpthread.so /usr/include/pthread.h also if I remove -lpthread from build command, I still get the last two errors i-e /usr/lib/gcc/i586-suse-linux/4.6/../../../../i586-suse-linux/bin/ld: cannot find -lm /usr/lib/gcc/i586-suse-linux/4.6/../../../../i586-suse-linux/bin/ld: cannot find -lc collect2: ld returned 1 exit status So question is, do I need libpthread ? ( from my past experience I think I do, but not sure). if yes, then how can I get it, and if not, then how can I get this program to compile. Any help will be appreciated. Kaz

2 1

OSX Framework
by Kraus Philipp 11 Dec '11

11 Dec '11

Hello, I'm using Boost for a long time and create my package with bjam. Is there an option to create an OSX framework? OSX can handle libraries and headers in a special directory structure under eg /Library/Framework, can I build this structure with bjam or should I create it myself? Thanks Phil

2 2

[Units] Require help troubleshooting a template error with linear_algebra.hpp
by Stephen Torri 11 Dec '11

11 Dec '11

Below is a dump of the build output from compiling the stand alone example. In order to understand what I am doing I am trying to setup a boost unit system where length is in kilometers, angle is in degrees and time is in minutes. I would like to have the ability to enter automatically convert angles from degrees to radians. In addition I am attemping to make the angle types I use to be dimensionless. Regards, Stephen ----------- 1>Compiling... 1>boost_units.cpp 1>C:\boost\boost/units/detail/linear_algebra.hpp(342) : error C3083: 'item': the symbol to the left of a '::' must be a type 1> C:\boost\boost/units/detail/linear_algebra.hpp(310) : see reference to class template instantiation 'boost::units::detail::invert_handle_inital_rows<0>::apply<RowsBegin,IdentityBegin>' being compiled 1> with 1> [ 1> RowsBegin=boost::units::list<boost::units::detail::eliminate_from_pair_of_equations_impl<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::static_rational<0,1>,boost::units::static_rational<1>>::type,boost::units::detail::invert_handle_after_pivot_row<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>>::new_matrix>, 1> IdentityBegin=boost::units::list<boost::units::list<boost::units::static_rational<-1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::plane_angle_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::detail::invert_handle_after_pivot_row<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>>::identity_result> 1> ] 1> C:\boost\boost/units/detail/linear_algebra.hpp(310) : see reference to class template instantiation 'boost::units::detail::invert_handle_inital_rows<N>::apply<RowsBegin,IdentityBegin>' being compiled 1> with 1> [ 1> N=1, 1> RowsBegin=boost::units::list<boost::units::dimensionless_type,boost::units::list<boost::units::detail::eliminate_from_pair_of_equations_impl<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::static_rational<0,1>,boost::units::static_rational<1>>::type,boost::units::detail::invert_handle_after_pivot_row<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>>::new_matrix>>, 1> IdentityBegin=boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<-1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::plane_angle_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::detail::invert_handle_after_pivot_row<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>>::identity_result>> 1> ] 1> C:\boost\boost/units/detail/linear_algebra.hpp(501) : see reference to class template instantiation 'boost::units::detail::invert_handle_inital_rows<N>::apply<RowsBegin,IdentityBegin>' being compiled 1> with 1> [ 1> N=2, 1> RowsBegin=boost::units::list<boost::units::detail::eliminate_from_pair_of_equations_impl<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::static_rational<0,1>,boost::units::static_rational<1>>::type,boost::units::list<boost::units::dimensionless_type,boost::units::list<boost::units::detail::eliminate_from_pair_of_equations_impl<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::static_rational<0,1>,boost::units::static_rational<1>>::type,boost::units::detail::invert_handle_after_pivot_row<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>>::new_matrix>>>, 1> IdentityBegin=boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<-1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::plane_angle_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::detail::invert_handle_after_pivot_row<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>>::identity_result>>> 1> ] 1> C:\boost\boost/units/detail/linear_algebra.hpp(503) : see reference to class template instantiation 'boost::units::detail::invert_impl<N>::apply<RowsBegin,IdentityBegin>' being compiled 1> with 1> [ 1> N=1, 1> RowsBegin=boost::units::list<boost::units::detail::eliminate_from_pair_of_equations_impl<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::static_rational<0,1>,boost::units::static_rational<1>>::type,boost::units::list<boost::units::dimensionless_type,boost::units::list<boost::units::detail::eliminate_from_pair_of_equations_impl<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::static_rational<0,1>,boost::units::static_rational<1>>::type,boost::units::detail::invert_handle_after_pivot_row<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>>::new_matrix>>>, 1> IdentityBegin=boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<-1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::plane_angle_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::detail::invert_handle_after_pivot_row<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>>::identity_result>>> 1> ] 1> C:\boost\boost/units/detail/linear_algebra.hpp(503) : see reference to class template instantiation 'boost::units::detail::invert_impl<N>::apply<RowsBegin,IdentityBegin>' being compiled 1> with 1> [ 1> N=2, 1> RowsBegin=boost::units::list<boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>,boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>,boost::units::list<boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>,boost::units::detail::determine_extra_equations_impl<0>::apply<boost::units::dimensionless_type,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>::type>>>, 1> IdentityBegin=boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<-1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::plane_angle_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::detail::invert_handle_after_pivot_row<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>>::identity_result>>> 1> ] 1> C:\boost\boost/units/detail/linear_algebra.hpp(542) : see reference to class template instantiation 'boost::units::detail::invert_impl<N>::apply<RowsBegin,IdentityBegin>' being compiled 1> with 1> [ 1> N=3, 1> RowsBegin=boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::list<boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::plane_angle_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::dimensionless_type>>>, 1> IdentityBegin=boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::plane_angle_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::detail::make_identity<0>::apply<3>::type>>> 1> ] 1> C:\boost\boost/units/detail/linear_algebra.hpp(828) : see reference to class template instantiation 'boost::units::detail::make_square_and_invert<Matrix>' being compiled 1> with 1> [ 1> Matrix=boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::list<boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::plane_angle_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::dimensionless_type>>> 1> ] 1> C:\boost\boost/units/detail/linear_algebra.hpp(1032) : see reference to class template instantiation 'boost::units::detail::normalize_units<T>' being compiled 1> with 1> [ 1> T=boost::units::list<myproject::units::minute_base_unit,boost::units::list<myproject::units::angle::degree_base_unit,boost::units::list<myproject::units::earth::kilometer_base_unit,boost::units::dimensionless_type>>> 1> ] 1> C:\boost\boost/units/detail/linear_algebra.hpp(1051) : see reference to class template instantiation 'boost::units::detail::calculate_base_unit_exponents_impl<false>::apply<T,Dimensions>' being compiled 1> with 1> [ 1> T=boost::units::list<myproject::units::minute_base_unit,boost::units::list<myproject::units::angle::degree_base_unit,boost::units::list<myproject::units::earth::kilometer_base_unit,boost::units::dimensionless_type>>>, 1> Dimensions=boost::units::length_dimension 1> ] 1> C:\boost\boost/units/heterogeneous_system.hpp(243) : see reference to class template instantiation 'boost::units::detail::calculate_base_unit_exponents<T,Dimensions>' being compiled 1> with 1> [ 1> T=boost::units::list<myproject::units::minute_base_unit,boost::units::list<myproject::units::angle::degree_base_unit,boost::units::list<myproject::units::earth::kilometer_base_unit,boost::units::dimensionless_type>>>, 1> Dimensions=boost::units::length_dimension 1> ] 1> C:\boost\boost/units/unit.hpp(92) : see reference to class template instantiation 'boost::units::detail::make_heterogeneous_system<Dimensions,System>' being compiled 1> with 1> [ 1> Dimensions=boost::units::length_dimension, 1> System=myproject::units::earth::system 1> ] 1> C:\boost\boost/units/unit.hpp(99) : see reference to class template instantiation 'boost::units::reduce_unit<Unit>' being compiled 1> with 1> [ 1> Unit=boost::units::unit<boost::units::length_dimension,myproject::units::earth::system> 1> ] 1> ..\..\..\apps\boost_units\boost_units.cpp(81) : see reference to class template instantiation 'boost::units::is_implicitly_convertible<S1,S2>' being compiled 1> with 1> [ 1> S1=boost::units::unit<boost::units::length_dimension,myproject::units::earth::system>, 1> S2=boost::units::unit<boost::units::length_dimension,myproject::units::earth::system> 1> ] 1>C:\boost\boost/units/detail/linear_algebra.hpp(342) : error C2039: 'Numerator' : is not a member of 'boost::units::dimensionless_type' 1> C:\boost\boost/units/dimensionless_type.hpp(37) : see declaration of 'boost::units::dimensionless_type' 1>C:\boost\boost/units/detail/linear_algebra.hpp(342) : error C2065: 'Numerator' : undeclared identifier

2 1

intelisence warnings during compilation
by ohad barta 11 Dec '11

11 Dec '11

Hi Im use boost library and during the compilation on debbug mode I satarted the following warnings: 1386 IntelliSense: #error directive: "Macro BOOST_LIB_NAME not set (internal error)" c:\boost_1_47_0\boost_1_47_0\boost\config\auto_link.hpp 102 1387 IntelliSense: #error directive: "Incompatible build options" c:\boost_1_47_0\boost_1_47_0\boost\config\auto_link.hpp 111 Is this a known issue? Can I ignore it? and if not, what did I do wrong? Thanks Ohad Barta

1 0

[thread] - install - libraries not referencing?
by floobit 10 Dec '11

10 Dec '11

I apologize if this question is asked frequently by noobs. Essentially, the boost functions are not recognized. I installed the prebuilt boost package on ubuntu (ostensibly 1.43), and wonder if it's working correctly. I am working through the threading chapter from *Introduction to the C++ Boost Libraries – Volume I – Foundations,* and replicated their first example: #include <boost/thread.hpp> #include<iostream> using namespace std; using namespace boost; using namespace boost::this_thread; void fxn1() { for (int i=0; i<10; ++i) { cout << i << ") Do something in parallel with main method." << endl; boost::this_thread::yield(); }} int main() { boost::thread t(&fxn1); for (int i=0;i<10; i++) { cout << i << ". Do something in main method." << endl; } return 0; } using g++ boosttest1.c -o boosttest1 the compiler throws errors to each reference of a boost function (I have removed the names of temp files referenced by the compiler): undefined reference to `boost::this_thread::yield()' undefined reference to `boost::thread::~thread()' In function `boost::detail::thread_data_base::thread_data_base()': undefined reference to `vtable for boost::detail::thread_data_base' In function `boost::thread::thread<void (*)()>(void (*)(), boost::disable_if<boost::is_convertible<void (*&)(), boost::detail::thread_move_t<void (*)()> >, boost::thread::dummy*>::type)': undefined reference to `boost::thread::start_thread()' etc. Please respond if the remainder of the messages are cogent. If I comment out both lines with boost, the compile works perfectly, and if I comment out only the second, I receive: In function `fxn1()': boostthreadtest.c:(.text+0x43): undefined reference to `boost::this_thread::yield()' collect2: ld returned 1 exit status How do I reference the libraries correctly? It seems as though the more detailed thread.hpp files are correctly referenced and present, but are not being noticed by the compiler. Thanks for your patience. floobit

4 4

[boost] compilation warnings questions by a newbee
by Rai, Neeraj 09 Dec '11

09 Dec '11

Hi, I am writing my first boost program and having trouble with the compiler warning against boost 1.44.0. Is there any way to get rid of those warnings so I can focus on real warnings in my code ? The gist of warning is : boost_1_44_0/include/boost/mpl/aux_/integral_wrapper.hpp:73:96: warning: the result of the conversion is unspecified because '-0x00000000000000001' is outside the range of type 'boost::numeric::udt_builtin_mixture_enum' [-Wconversion] Any help or pointers are appreciated. Neeraj ====== The following program is a cut down version of my code, just declares sregex #include <iostream> #include <boost/xpressive/xpressive.hpp> int main (int _argc, const char** _argv) { std::cout << "argc=" << _argc << " argv=" << _argv << std::endl; using namespace boost::xpressive; std::string keyword(""); sregex const re(sregex::compile(keyword, sregex::icase)); } ====== The following cmd is used to build it (tried g++ v 4.4.5 and 4.6 with same results) g++ -ftemplate-depth-128 -O0 -fno-inline -Wall -g -Wconversion -Wno-strict-aliasing -Wextra -Wnon-virtual-dtor -Wno-missing-field-initializers -Wno-array-bounds -Wno-ignored-qualifiers -Wno-parentheses -Wno-strict-aliasing -fPIC -DBOOST_ALL_NO_LIB -I/work/loc1/atddds -I/work/loc1/boost_1_44_0/include -Iinclude -c -o boost_regex_test.o boost_regex_test.cpp ====== The following cmd is used to build it (tried g++ v 4.4.5 and 4.6) g++ -ftemplate-depth-128 -O0 -fno-inline -Wall -g -Wconversion -Wno-strict-aliasing -Wextra -Wnon-virtual-dtor -Wno-missing-field-initializers -Wno-array-bounds -Wno-ignored-qualifiers -Wno-parentheses -Wno-strict-aliasing -fPIC -DBOOST_ALL_NO_LIB -I/work/loc1/atddds -I/work/loc1/boost_1_44_0/include -Iinclude -c -o boost_regex_test.o boost_regex_test.cpp In file included from /work/loc1/boost_1_44_0/include/boost/mpl/integral_c.hpp:32:0, from /work/loc1/boost_1_44_0/include/boost/type_traits/integral_constant.hpp:11, from /work/loc1/boost_1_44_0/include/boost/type_traits/detail/bool_trait_def.hpp:15, from /work/loc1/boost_1_44_0/include/boost/type_traits/is_volatile.hpp:40, from /work/loc1/boost_1_44_0/include/boost/type_traits/remove_const.hpp:14, from /work/loc1/boost_1_44_0/include/boost/proto/proto_fwd.hpp:25, from /work/loc1/boost_1_44_0/include/boost/xpressive/xpressive_fwd.hpp:53, from /work/loc1/boost_1_44_0/include/boost/xpressive/detail/detail_fwd.hpp:24, from /work/loc1/boost_1_44_0/include/boost/xpressive/regex_primitives.hpp:21, from /work/loc1/boost_1_44_0/include/boost/xpressive/xpressive_static.hpp:24, from /work/loc1/boost_1_44_0/include/boost/xpressive/xpressive.hpp:18, from boost_regex_test.cpp:2: /work/loc1/boost_1_44_0/include/boost/mpl/aux_/integral_wrapper.hpp: In instantiation of 'mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u>': /work/loc1/boost_1_44_0/include/boost/numeric/conversion/detail/meta.hpp:30:13: instantiated from 'boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u>, mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u> >' /work/loc1/boost_1_44_0/include/boost/mpl/if.hpp:67:11: instantiated from 'boost::mpl::if_<boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u>, mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u> >, boost::mpl::identity<boost::numeric::convdetail::get_subranged_BuiltIn2BuiltIn<unsigned char, int> >, boost::mpl::eval_if<boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u>, mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)1u> >, boost::mpl::identity<boost::mpl::identity<boost::numeric::convdetail::subranged_BuiltIn2Udt<unsigned char, int> > >, boost::mpl::if_<boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u>, mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)2u> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Udt2BuiltIn<unsigned char, int> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Udt2Udt<unsigned char, int> > > > >' /work/loc1/boost_1_44_0/include/boost/mpl/eval_if.hpp:37:41: instantiated from 'boost::mpl::eval_if<boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u>, mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u> >, boost::mpl::identity<boost::numeric::convdetail::get_subranged_BuiltIn2BuiltIn<unsigned char, int> >, boost::mpl::eval_if<boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u>, mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)1u> >, boost::mpl::identity<boost::mpl::identity<boost::numeric::convdetail::subranged_BuiltIn2Udt<unsigned char, int> > >, boost::mpl::if_<boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u>, mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)2u> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Udt2BuiltIn<unsigned char, int> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Udt2Udt<unsigned char, int> > > > >' /work/loc1/boost_1_44_0/include/boost/numeric/conversion/detail/meta.hpp:82:9: instantiated from 'boost::numeric::convdetail::ct_switch4<mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u>, mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u>, mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)1u>, mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)2u>, boost::numeric::convdetail::get_subranged_BuiltIn2BuiltIn<unsigned char, int>, boost::mpl::identity<boost::numeric::convdetail::subranged_BuiltIn2Udt<unsigned char, int> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Udt2BuiltIn<unsigned char, int> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Udt2Udt<unsigned char, int> > >' /work/loc1/boost_1_44_0/include/boost/numeric/conversion/detail/udt_builtin_mixture.hpp:45:9: instantiated from 'boost::numeric::convdetail::for_udt_builtin_mixture<mpl_::integral_c<boost::numeric::udt_builtin_mixture_enum, (boost::numeric::udt_builtin_mixture_enum)0u>, boost::numeric::convdetail::get_subranged_BuiltIn2BuiltIn<unsigned char, int>, boost::mpl::identity<boost::numeric::convdetail::subranged_BuiltIn2Udt<unsigned char, int> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Udt2BuiltIn<unsigned char, int> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Udt2Udt<unsigned char, int> > >' /work/loc1/boost_1_44_0/include/boost/numeric/conversion/detail/is_subranged.hpp:206:11: [ skipping 9 instantiation contexts ] /work/loc1/boost_1_44_0/include/boost/xpressive/regex_compiler.hpp:281:13: instantiated from 'boost::xpressive::detail::sequence<BidiIter> boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::parse_alternates(FwdIter&, FwdIter) [with FwdIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, BidiIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, RegexTraits = boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> >, CompilerTraits = boost::xpressive::compiler_traits<boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> > >]' /work/loc1/boost_1_44_0/include/boost/xpressive/regex_compiler.hpp:212:75: instantiated from 'boost::xpressive::basic_regex<BidiIter> boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::compile_(FwdIter, FwdIter, boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::flag_type, std::forward_iterator_tag) [with FwdIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, BidiIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, RegexTraits = boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> >, CompilerTraits = boost::xpressive::compiler_traits<boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> > >, boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::flag_type = boost::xpressive::regex_constants::syntax_option_type]' /work/loc1/boost_1_44_0/include/boost/xpressive/regex_compiler.hpp:120:60: instantiated from 'boost::xpressive::basic_regex<BidiIter> boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::compile(InputIter, InputIter, boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::flag_type) [with InputIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, BidiIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, RegexTraits = boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> >, CompilerTraits = boost::xpressive::compiler_traits<boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> > >, boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::flag_type = boost::xpressive::regex_constants::syntax_option_type]' /work/loc1/boost_1_44_0/include/boost/xpressive/regex_compiler.hpp:129:71: instantiated from 'typename boost::disable_if<boost::is_pointer<InputRange>, boost::xpressive::basic_regex<BidiIter> >::type boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::compile(const InputRange&, boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::flag_type) [with InputRange = std::basic_string<char>, BidiIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, RegexTraits = boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> >, CompilerTraits = boost::xpressive::compiler_traits<boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> > >, typename boost::disable_if<boost::is_pointer<InputRange>, boost::xpressive::basic_regex<BidiIter> >::type = boost::xpressive::basic_regex<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char> > >, boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::flag_type = boost::xpressive::regex_constants::syntax_option_type]' /work/loc1/boost_1_44_0/include/boost/xpressive/basic_regex.hpp:193:61: instantiated from 'static boost::xpressive::basic_regex<BidiIter> boost::xpressive::basic_regex<BidiIter>::compile(const InputRange&, boost::xpressive::basic_regex<BidiIter>::flag_type) [with InputRange = std::basic_string<char>, BidiIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, boost::xpressive::basic_regex<BidiIter>::flag_type = boost::xpressive::regex_constants::syntax_option_type]' boost_regex_test.cpp:9:57: instantiated from here /work/loc1/boost_1_44_0/include/boost/mpl/aux_/integral_wrapper.hpp:73:96: warning: the result of the conversion is unspecified because '-0x00000000000000001' is outside the range of type 'boost::numeric::udt_builtin_mixture_enum' [-Wconversion] /work/loc1/boost_1_44_0/include/boost/mpl/aux_/integral_wrapper.hpp: In instantiation of 'mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u>': /work/loc1/boost_1_44_0/include/boost/numeric/conversion/detail/meta.hpp:30:13: instantiated from 'boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u>, mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u> >' /work/loc1/boost_1_44_0/include/boost/mpl/if.hpp:67:11: instantiated from 'boost::mpl::if_<boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u>, mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u> >, boost::mpl::identity<boost::numeric::convdetail::get_subranged_Int2Int<unsigned char, int> >, boost::mpl::eval_if<boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u>, mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)1u> >, boost::mpl::identity<boost::mpl::identity<boost::numeric::convdetail::subranged_Int2Float<unsigned char, int> > >, boost::mpl::if_<boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u>, mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)2u> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Float2Int<unsigned char, int> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Float2Float<unsigned char, int> > > > >' /work/loc1/boost_1_44_0/include/boost/mpl/eval_if.hpp:37:41: instantiated from 'boost::mpl::eval_if<boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u>, mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u> >, boost::mpl::identity<boost::numeric::convdetail::get_subranged_Int2Int<unsigned char, int> >, boost::mpl::eval_if<boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u>, mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)1u> >, boost::mpl::identity<boost::mpl::identity<boost::numeric::convdetail::subranged_Int2Float<unsigned char, int> > >, boost::mpl::if_<boost::numeric::convdetail::equal_to<mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u>, mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)2u> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Float2Int<unsigned char, int> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Float2Float<unsigned char, int> > > > >' /work/loc1/boost_1_44_0/include/boost/numeric/conversion/detail/meta.hpp:82:9: instantiated from 'boost::numeric::convdetail::ct_switch4<mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u>, mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u>, mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)1u>, mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)2u>, boost::numeric::convdetail::get_subranged_Int2Int<unsigned char, int>, boost::mpl::identity<boost::numeric::convdetail::subranged_Int2Float<unsigned char, int> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Float2Int<unsigned char, int> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Float2Float<unsigned char, int> > >' /work/loc1/boost_1_44_0/include/boost/numeric/conversion/detail/int_float_mixture.hpp:63:9: instantiated from 'boost::numeric::convdetail::for_int_float_mixture<mpl_::integral_c<boost::numeric::int_float_mixture_enum, (boost::numeric::int_float_mixture_enum)0u>, boost::numeric::convdetail::get_subranged_Int2Int<unsigned char, int>, boost::mpl::identity<boost::numeric::convdetail::subranged_Int2Float<unsigned char, int> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Float2Int<unsigned char, int> >, boost::mpl::identity<boost::numeric::convdetail::subranged_Float2Float<unsigned char, int> > >' /work/loc1/boost_1_44_0/include/boost/numeric/conversion/detail/is_subranged.hpp:184:35: [ skipping 10 instantiation contexts ] /work/loc1/boost_1_44_0/include/boost/xpressive/regex_compiler.hpp:281:13: instantiated from 'boost::xpressive::detail::sequence<BidiIter> boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::parse_alternates(FwdIter&, FwdIter) [with FwdIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, BidiIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, RegexTraits = boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> >, CompilerTraits = boost::xpressive::compiler_traits<boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> > >]' /work/loc1/boost_1_44_0/include/boost/xpressive/regex_compiler.hpp:212:75: instantiated from 'boost::xpressive::basic_regex<BidiIter> boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::compile_(FwdIter, FwdIter, boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::flag_type, std::forward_iterator_tag) [with FwdIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, BidiIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, RegexTraits = boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> >, CompilerTraits = boost::xpressive::compiler_traits<boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> > >, boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::flag_type = boost::xpressive::regex_constants::syntax_option_type]' /work/loc1/boost_1_44_0/include/boost/xpressive/regex_compiler.hpp:120:60: instantiated from 'boost::xpressive::basic_regex<BidiIter> boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::compile(InputIter, InputIter, boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::flag_type) [with InputIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, BidiIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, RegexTraits = boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> >, CompilerTraits = boost::xpressive::compiler_traits<boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> > >, boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::flag_type = boost::xpressive::regex_constants::syntax_option_type]' /work/loc1/boost_1_44_0/include/boost/xpressive/regex_compiler.hpp:129:71: instantiated from 'typename boost::disable_if<boost::is_pointer<InputRange>, boost::xpressive::basic_regex<BidiIter> >::type boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::compile(const InputRange&, boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::flag_type) [with InputRange = std::basic_string<char>, BidiIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, RegexTraits = boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> >, CompilerTraits = boost::xpressive::compiler_traits<boost::xpressive::regex_traits<char, boost::xpressive::cpp_regex_traits<char> > >, typename boost::disable_if<boost::is_pointer<InputRange>, boost::xpressive::basic_regex<BidiIter> >::type = boost::xpressive::basic_regex<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char> > >, boost::xpressive::regex_compiler<BidiIter, RegexTraits, CompilerTraits>::flag_type = boost::xpressive::regex_constants::syntax_option_type]' /work/loc1/boost_1_44_0/include/boost/xpressive/basic_regex.hpp:193:61: instantiated from 'static boost::xpressive::basic_regex<BidiIter> boost::xpressive::basic_regex<BidiIter>::compile(const InputRange&, boost::xpressive::basic_regex<BidiIter>::flag_type) [with InputRange = std::basic_string<char>, BidiIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >, boost::xpressive::basic_regex<BidiIter>::flag_type = boost::xpressive::regex_constants::syntax_option_type]' boost_regex_test.cpp:9:57: instantiated from here /work/loc1/boost_1_44_0/include/boost/mpl/aux_/integral_wrapper.hpp:73:96: warning: the result of the conversion is unspecified because '-0x00000000000000001' is outside the range of type 'boost::numeric::int_float_mixture_enum' [-Wconversion]

4 8

[interprocess] atomic_write32
by peter jacobsen 09 Dec '11

09 Dec '11

I have noticed that for Windows, atomic_write32 is defined thus: inline void atomic_write32(volatile boost::uint32_t *mem, boost::uint32_t val) { winapi::interlocked_exchange(reinterpret_cast<volatile long*>(mem), val); } Whereas otherwise like this: inline void atomic_write32(volatile boost::uint32_t *mem, boost::uint32_t val) { *mem = val; } the reads are both: return *mem; Windows documentation states that: 'Simple reads and writes to properly-aligned 32-bit variables are atomic operations.' [http://msdn.microsoft.com/en-us/library/windows/desktop/ms684122%28v=vs.85%…] Is there a reason for this? Thanks, Peter

3 3

[filesystem] boost::filesystem::path::append() with boost::filesystem::iterator
by Sebastian Karlsson 09 Dec '11

09 Dec '11

Unexpectedly this does not seem to work. Consider: boost::filesystem::path a("foo/bar/"), b("root/test"); a.append( b.begin() + 1, boost::filesystem::const_iterator() ); \\ Expects a == "foo/bar/test" Am I missing something? Kind regards, Sebastian Karlsson

1 1

[filesystem] native path starting with //:
by Frédéric Bron 09 Dec '11

09 Dec '11

I am trying to upgrade my code from filesystem v2 to v3. I have in some paths constructed from a string starting with "//:". This was to ensure that the path was interpreted as native path in v2. It seems that this option disappeared from v3 but this change is not documented (at least I have not found the documentation for it). Can I safely just remove "//:" from start of the constructor argument? Regards, Frédéric

1 0

[Format] boost 1.48.0, vs2010 runtime check triggered by cast to smaller type in feed_args.hpp
by david x callaway 09 Dec '11

09 Dec '11

running the code below triggers a runtime crash due to casting to a smaller type in feed_args.hpp if -RTCc is given. we turn on this runtime check for debug builds as shown in the sample code. so far the only remedy I've found is to turn off runtime checks for the entire module, not a nice solution. microsoft's suggestion, to use a pragma to turn off the check, doesn't work (not your problem I know). the same issue exists in boost 1.47.0. thx dxc // ----- cut ---- // boost 1.48.0 // visual studio 10.0, service pack 1, windows 7/64 // using this pragma, per microsoft, does not solve the problem // #pragma runtime_checks( "", off ) #include <string> #include <boost/format.hpp> // compile: cl -EHsc -W4 -I /path/to/boost -MDd check.cp // runs fine with no runtime check, output as expected // if you include -RTCc, runtime size checks, it goes into the debugger // compile: cl -EHsc -W4 -RTCc -I /path/to/boost check.cpp // static_cast triggers runtime error at feed_args.hpp:168 int main() { std::string documenttype("1"); std::string key(boost::str(boost::format("name[documenttype:%1%]")%documenttype)); std::cout << key << "\n"; // expected output: name[documenttype:1] return 0; } // #pragma runtime_checks( "", restore )

2 2

[boost][chrono] time_since_epoch different on windows and linux
by Ralf Globisch 09 Dec '11

09 Dec '11

Hi, I've run into a bit of a funny one and I'm not sure if I'm missing something or whether I've encountered a bug. The following code excerpt *seems* to have 2 different results on windows 7 (VS2010) and linux (gcc4.6) using boost version 1.47. #include <iostream> #include <cstdint> #include <boost/chrono.hpp> int main(int argc, char** argv) { boost::chrono::duration<double> sec = boost::chrono::system_clock::now().time_since_epoch(); uint32_t uiSeconds = sec.count(); double dMinutes = uiSeconds/60.0; double dHours = dMinutes/60.0; double dDays = dHours/24.0; double dYears = dDays/365.0; std::cout << "Sec: " << uiSeconds << " Min: " << dMinutes << " Hours: " << dHours << " Days: " << dDays << " Years: " << dYears << std::endl; return 0; } This outputs the following: Linux: Sec: 1323362917 Min: 2.2056e+07 Hours: 367601 Days: 15316.7 Years: 41.9636 Windows: Sec: 82934819 Min: 1.38225e+006 Hours: 23037.4 Days: 959.894 Years: 2.62985 The linux results is the expected result: 1970 + 41 years = ~2011. Why does the windows result differ? I've run the windows version on two different windows machines with the same result. Am I using the library incorrectly? I'm trying to obtain seconds since 1970 so that I can from there calculate seconds since 1900 to calculate an NTP timestamp. Thanks for any help/suggestions! Ralf

4 5

Re: [Boost-users] [BGL] Issue using connected_components
by Nicolas Saunier 08 Dec '11

08 Dec '11

Hi, thanks again for replying. I may sound stupid, but again, I cannot find what is the type of the component map to pass to connected_components when the graph is of type adjacency_list<listS, listS, undirectedS>. The following does not work (see previous email for the whole code): map<FeatureGraph::vertex_descriptor, graph_traits<FeatureGraph>::vertices_size_type> vertex2component; vertex2component.insert(make_pair(u, 0)); associative_property_map< map<graph_traits<FeatureGraph>::vertex_descriptor, graph_traits<FeatureGraph>::vertices_size_type> > components(vertex2component); Can someone please give me the declaration of the component map, and how to pass it to connected_components? Thanks, Nicolas On 11-12-08 02:08 PM, boost-users-request(a)lists.boost.org wrote: > If you use an associative property map, you will not need a vertex index > map. See > http://www.boost.org/doc/libs/1_48_0/libs/property_map/doc/associative_prop… > for documentation on how to create one. > > -- Jeremiah Willcock -- Nicolas Saunier, ing. jr, Ph.D. Professeur Adjoint / Assistant Professor Département des génies civil, géologique et des mines (CGM) École Polytechnique de Montréal http://nicolas.saunier.confins.net

1 0

[StateChart] How to fix "the outer state does not have inner states."
by Zhu Bicen 08 Dec '11

08 Dec '11

Following code can NOT be compiled successfully, according the comment in boost source code I note that the compiler complains the outer state does not have inner state. I want to know how to indicate one state have a inner state, if it didn't have a initial state? Thanks! #include <boost/statechart/state_machine.hpp> #include <boost/statechart/state.hpp> namespace fsm = boost::statechart; class HandlingFileState; class PlayerFsm : public fsm::state_machine< PlayerFsm, HandlingFileState > {}; class HandlingFileState: public fsm::state< HandlingFileState, PlayerFsm/*, PlayingState*/> //if the initial state is uncoment, it can be compiled success. But I don't want this. {}; class NormalPlayingState; class PlayingState: public fsm::state< PlayingState, HandlingFileState, NormalPlayingState > {}; class NormalPlayingState: public fsm::state< NormalPlayingState, PlayingState> {}; int main() { PlayerFsm fsm; } ------ Build started: Project: TestFsm, Configuration: Debug Win32 ------ Compiling... test_fsm.cpp d:\3rd_lib\boost_1_46_1\include\boost-1_46_1\boost\statechart\simple_state.hpp(387) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' with [ x=false ] d:\3rd_lib\boost_1_46_1\include\boost-1_46_1\boost\statechart\state.hpp(30) : see reference to class template instantiation 'boost::statechart::simple_state<MostDerived,Context,InnerInitial,historyMode>' being compiled with [ MostDerived=PlayingState, Context=HandlingFileState, InnerInitial=NormalPlayingState, historyMode=has_no_history ] d:\bzhu\code\trunk\testfsm\test_fsm.cpp(16) : see reference to class template instantiation 'boost::statechart::state<MostDerived,Context,InnerInitial>' being compiled with [ MostDerived=PlayingState, Context=HandlingFileState, InnerInitial=NormalPlayingState ] Build log was saved at "file://d:\bzhu\Code\trunk\TestFsm\Debug\BuildLog.htm" TestFsm - 1 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== and the first error point to : // If you receive a // "use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>'" or similar // compiler error here then either this state resides in a non-existent // orthogonal region of the outer state or the outer state does not have // inner states. BOOST_STATIC_ASSERT( ( mpl::less< orthogonal_position, typename context_type::no_of_orthogonal_regions >::value ) );

2 1

Re: [Boost-users] [BGL] Issue using connected_components
by Nicolas Saunier 08 Dec '11

08 Dec '11

Hi Jeremiah, >> Ok, I understand now that vertex_descriptor are integers if one uses a vecS >> for the vertex list. I have changed the type of my undirected graph to >> boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, >> VertexInformation, FeatureConnection> and used a simple >> vector<FeatureGraph::vertex_descriptor> for the component map and it works >> nicely. >> >> Another question is about efficiency: what are the advantages/disadvantages >> to use vecS or listS for the list of vertices? > The main difference is the speed of inserting and removing vertices, with > a secondary difference being when vertex descriptors and iterators are > invalidated. Look on the adjacency_list documentation page for more > detail on exactly which operations are affected. > >> Finally, how could I modify my initial code to make it work? > How much of it do you want to keep? The solution I gave you before > requires two changes (to the graph and to the definition of the component > map). If you want to keep the listS vertex container, you could also use > associative_property_map for your components, or add a vertex_index > property to your graph and fill it in before you create your property map. > Are you looking for one of those options? My requirements are a undirected graph, with frequent additions and removals of vertices/edges, and frequent computation of connected components. That is why I thought that listS vextex container was more appropriate. I would expect that the component map could then be some associative map from vertex_descriptors to component id: what is the exact type? Is it necessary to compute a vertex index (what is it exactly), how do I do so and is is computationally intensive? >> I really find it difficult to find the information to use property maps in >> the library: is there a tutorial or a more step by step documentation >> somewhere? > I forgot if the BGL book has any more details, but you can look in > libs/graph/example in the Boost source tree and also in > http://programmingexamples.net/wiki/Boost/BGL for code samples. Thanks for the link and for the help! Nicolas -- Nicolas Saunier, ing. jr, Ph.D. Professeur Adjoint / Assistant Professor Département des génies civil, géologique et des mines (CGM) École Polytechnique de Montréal http://nicolas.saunier.confins.net

2 1

[Interprocess] [file_mapping] is there any way to avoid writing a modified file to disc?
by Thorsten Ottosen 08 Dec '11

08 Dec '11

Hi, I'm using file_mapping/mapped_region with Boost 1.45. My idea was to load the memory mapped file in read/write mode and then decrypt the file content in-place (to avoid copying the entire file content). However, this will save a decrypted file :-( Is there any way to avoid the file being saved after in-memory manipulation? -Thorsten

4 9

[GIL] Array to image
by Sapp, Mark 08 Dec '11

08 Dec '11

Hi All, Can anyone point me in the right directions for copying or assigning an array in memory to an image? I'm reading an frame out of an AVI file using Microsoft's vfw32.lib/vfw.h and the function that grabs the frame returns a pointer to a bitmap in memory, like this: BYTE* pDIB = (BYTE*) AVIStreamGetFrame(pFrame, index); And I need to transfer that information into an image. I have extracted the bitmap header and have a pointer to the first pixel, so I suppose I could iterate over each pixel and channel and populate the image by hand, but I imagine there is a better way. Thanks, Mark Sapp Notice: This e-mail is intended solely for use of the individual or entity to which it is addressed and may contain information that is proprietary, privileged, company confidential and/or exempt from disclosure under applicable law. If the reader is not the intended recipient or agent responsible for delivering the message to the intended recipient, you are hereby notified that any dissemination, distribution or copying of this communication is strictly prohibited. If this communication has been transmitted from a U.S. location it may also contain data subject to the International Traffic in Arms Regulations or U.S. Export Administration Regulations and cannot be disseminated, distributed or copied to foreign nationals, residing in the U.S. or abroad, without the prior approval of the U.S. Department of State or appropriate export licensing authority. If you have received this communication in error, please notify the sender by reply e-mail or collect telephone call and delete or destroy all copies of this e-mail message, any physical copies made of this e-mail message and/or any file attachment(s).

3 5

[filesystem] filesystem::absolute() doesn't work with ../relative_path or ./relative_path
by Sachin Garg 08 Dec '11

08 Dec '11

In boost 1.47.0 filesystem v3, boost::filesystem::absolute only appends the relative path to base path. It should also remove "./" from relative paths and "backtrack" on base path if relative path contains "../../" etc. For example, Input: "d:\current\path" ".\..\relative\path" Result obtained: "d:\current\path\.\..\relative\path" Desired result: "d:\current\relative\path" I have created a trac ticket for the same: https://svn.boost.org/trac/boost/ticket/5988 SG

4 5

Re: [Boost-users] [BGL] Issue using connected_components
by Nicolas Saunier 08 Dec '11

08 Dec '11

Hi, >> Thanks for replying. The problem, and that may seem too simple or silly to >> people familiar with the library, is that I have no idea what should be the >> type of the component map to pass. I tried to declare the components variable >> as: >> >> vector< graph_traits<FeatureGraph>::vertices_size_type > >> components(num_vertices(g)); >> >> And it does not work either. What is the type of the component map, the >> second argument of connected_components? Can you give me an example of a type >> that would work (compile and return the correct results)? > > Try: > > shared_array_property_map< > ...::vertices_size_type, > property_map<FeatureGraph, vertex_index_t>::const_type >> > components(num_vertices(g), get(vertex_index, g)); > > This requires a vecS vertex container, though. > > -- Jeremiah Willcock Ok, I understand now that vertex_descriptor are integers if one uses a vecS for the vertex list. I have changed the type of my undirected graph to boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, VertexInformation, FeatureConnection> and used a simple vector<FeatureGraph::vertex_descriptor> for the component map and it works nicely. Another question is about efficiency: what are the advantages/disadvantages to use vecS or listS for the list of vertices? Finally, how could I modify my initial code to make it work? #include <boost/graph/adjacency_list.hpp> #include <boost/shared_ptr.hpp> #include <boost/graph/connected_components.hpp> using namespace boost; using namespace std; struct FeatureTrajectory { int id; }; struct FeatureConnection { float minDistance; float maxDistance; }; struct VertexInformation { shared_ptr<FeatureTrajectory> feature; }; typedef adjacency_list < listS, listS, undirectedS, VertexInformation, FeatureConnection> FeatureGraph; int main() { FeatureGraph g; FeatureGraph::vertex_descriptor u, v; FeatureGraph::edge_descriptor e; u = add_vertex(g); v = add_vertex(g); bool unused; tie(e, unused) = add_edge(u, v, g); g[e].minDistance = 0.; g[e].maxDistance = 1.; g[u].feature = shared_ptr<FeatureTrajectory>(new FeatureTrajectory()); g[u].feature->id =11; g[v].feature = shared_ptr<FeatureTrajectory>(new FeatureTrajectory()); g[v].feature->id =12; cout << num_vertices(g) << " " << num_edges(g) << endl; vector_property_map< graph_traits<FeatureGraph>::vertices_size_type > components(num_vertices(g)); int num = connected_components(g, &components[0]); return 0; } I really find it difficult to find the information to use property maps in the library: is there a tutorial or a more step by step documentation somewhere? Thanks again! Nicolas -- Nicolas Saunier, ing. jr, Ph.D. Professeur Adjoint / Assistant Professor Département des génies civil, géologique et des mines (CGM) École Polytechnique de Montréal http://nicolas.saunier.confins.net

2 1

Re: [Boost-users] Boost-users Digest, Vol 2928, Issue 3
by Nicolas Saunier 07 Dec '11

07 Dec '11

Hi, On 11-12-07 02:21 PM, boost-users-request(a)lists.boost.org wrote: > Message: 6 > Date: Wed, 7 Dec 2011 14:19:46 -0500 (EST) > From: Jeremiah Willcock<jewillco(a)osl.iu.edu> > To:boost-users@lists.boost.org > Subject: Re: [Boost-users] [BGL] Issue using connected_components > Message-ID:<alpine.LRH.2.00.1112071418120.25335(a)flowerpot.osl.iu.edu> > Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed > > On Wed, 7 Dec 2011, Nicolas Saunier wrote: > >> > Hi, >> > >> > here is a simplified code sample that I cannot get to work. I use bundled >> > properties for an undirected graph and I do not find what should be the type >> > of the component map (or property map) that should be passed as the second >> > argument of the connected_components function. The sample is useless since >> > only integers are for vertices. > The normal vector_property_map class does not work for adjacency_list > graphs with a listS vertex container unless you define a vertex_index_map. > Is there a reason you can't use vecS as the vertex container in your > graph? If you truly need listS, you will need to create a vertex index > map, fill it in before you create the property map, and pass it to the > vector_property_map constructor (and as a type argument to that class). > > -- Jeremiah Willcock Thanks for replying. The problem, and that may seem too simple or silly to people familiar with the library, is that I have no idea what should be the type of the component map to pass. I tried to declare the components variable as: vector< graph_traits<FeatureGraph>::vertices_size_type > components(num_vertices(g)); And it does not work either. What is the type of the component map, the second argument of connected_components? Can you give me an example of a type that would work (compile and return the correct results)? Thanks! Nicolas -- Nicolas Saunier, ing. jr, Ph.D. Professeur Adjoint / Assistant Professor Département des génies civil, géologique et des mines (CGM) École Polytechnique de Montréal http://nicolas.saunier.confins.net

2 1

[BGL] Issue using connected_components
by Nicolas Saunier 07 Dec '11

07 Dec '11

Hi, here is a simplified code sample that I cannot get to work. I use bundled properties for an undirected graph and I do not find what should be the type of the component map (or property map) that should be passed as the second argument of the connected_components function. The sample is useless since only integers are for vertices. #include <boost/graph/adjacency_list.hpp> #include <boost/shared_ptr.hpp> #include <boost/graph/connected_components.hpp> using namespace boost; using namespace std; struct FeatureTrajectory { int id; }; struct FeatureConnection { float minDistance; float maxDistance; }; struct VertexInformation { shared_ptr<FeatureTrajectory> feature; }; typedef adjacency_list < listS, listS, undirectedS, VertexInformation, FeatureConnection> FeatureGraph; int main() { FeatureGraph g; FeatureGraph::vertex_descriptor u, v; FeatureGraph::edge_descriptor e; u = add_vertex(g); v = add_vertex(g); bool unused; tie(e, unused) = add_edge(u, v, g); g[e].minDistance = 0.; g[e].maxDistance = 1.; g[u].feature = shared_ptr<FeatureTrajectory>(new FeatureTrajectory()); g[u].feature->id =11; g[v].feature = shared_ptr<FeatureTrajectory>(new FeatureTrajectory()); g[v].feature->id =12; cout << num_vertices(g) << " " << num_edges(g) << endl; vector_property_map< graph_traits<FeatureGraph>::vertices_size_type > components(num_vertices(g)); int num = connected_components(g, &components[0]); return 0; } The final error is: /usr/include/boost/graph/connected_components.hpp:46: error: no matching function for call to ‘put(long unsigned int*&, void*&, long unsigned int&)’ Can someone help me get it to work and to understand property maps? Thanks! Nicolas -- Nicolas Saunier, ing. jr, Ph.D. Professeur Adjoint / Assistant Professor Département des génies civil, géologique et des mines (CGM) École Polytechnique de Montréal http://nicolas.saunier.confins.net

2 1

Boost.Math and Math Constants
by Paul A. Bristow 07 Dec '11

07 Dec '11

Boost.Math has always had an inconspicuous collection of useful math constants, mainly those that are used internally. The presentation of these was as a function-template, called for example, as pi<double>(). using namespace boost::math::constants; return pi<Real>() * r * r; This leads to some rather ugly equations and is most unpopular with scientific and engineering users. John Maddock has now added a new cunning feature that allows the vast majority of users who just want a built-in double to get the constants quickly as plain variables. So in non-template code, users can write using boost::math::double_constants; double area = pi * r * r; and users can read the equations easily. (Float and long double are similarly available in their own namespaces). The original mechanism which can be used for higher multiprecision user-defined floating-point types appears unchanged but has been improved to work better with UDTs and high precision types. Some draft detailed docs about just these new proposals are at http://boost-sandbox.sourceforge.net/libs/math_constants/doc/html/index.html We would like to be sure that 1 This additional mechanism of presenting constants is acceptable. 2 It is acceptable to add more constants (current new list is about 60 constants). Are there important constants that you think we have missed? Do we need a mini-review? Other views? Paul PS 1 Are there important constants that you think we have missed? 2 Please tell me of mistakes and typos in the draft docs. --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

[range] discrepancy between size and vector ::size
by giecrilj＠stegny.2a.pl 07 Dec '11

07 Dec '11

The following code gives me a warning: void trigger (::std ::vector < int > const &v) { ::boost ::size (v) == v. size (); } and the warning is "signed and unsigned in comparison". I understand that (size == end - begin) and that the latter expression is a difference; however, isn't the difference guaranteed to be positive? Also note that no range function ever uses range_size ::type. I suggest that ::boost ::size should return range_size ::type. Chris

2 1

How to pass additional arguments to a boost test case?
by Marc Magrans de Abril 07 Dec '11

07 Dec '11

Dear colleagues, I would like to pass additional command line arguments to a given boost test. For example, if I execute the following from the command line: mytest.exe --log_level=all --param1=value1 --param2=value2 then I would like to be able to get param1 and param2 parameters inside the test cases doing: BOOST_AUTO_TEST_CASE(read_ param_from_command_line) { std::cout << "Param1=" << some_function("param1") << std::endl; std::cout << "Param2=" << some_function("param2") << std::endl; } What s the recommended approach in this case? Thanks, marc

3 2