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

Tree traversal in boost spirit
by Olivier Austina 30 Sep '13

30 Sep '13

Hi, I would like to traverse a parsed tree. The parsing is fine. I am using this tutorial : http://en.highscore.de/cpp/boost/parser.html This is the instruction used for parsing : boost::spirit::parse_info<> pi = boost::spirit::parse(data.c_str(), g, boost::spirit::space_p); I would like to traverse the parsed tree like classical tree (Pre-order, In-order, Post-order) to have data in a given order. Any suggestion will be appreciated. Thank you. Regards Olivier

2 2

[Graph] Stable topological_sort? And topological_sort woes in general.
by Dominique Devienne 30 Sep '13

30 Sep '13

I'm sorting a set of SQL tables with foreign-key constraints. I'm currently using BGL's topological_sort for that, but struggled quite a bit because: * I didn't manage to adapt my own data-structure, so ended-up sorting indices to an array of my entries, and generated the edges as indice pairs on in this array (like the doc example). * Discovered via unit testing topological_sort didn't like vertices with no associated edges (a "free standing" table, with no relationships), so I'm "manually" removing those. * Discovered via unit testing topological_sort didn't like "duplicate" edges (a table with several columns referencing the same parent table), so I'm also manually removing those too. I confess to not trying to fully understand the BGL, nor to have read the book. Given what I was trying to do, as outlined above, was using topological_sort really the best tool for the job? What are the alternatives, if any? For my own education, why "singleton" vertices and duplicate edges make topological_sort break? But what brings me here today is to ask about a "stable" topo-sort. When I have several vertices which are all "unrelated" and thus sort at the same "level", topological_sort does not preserve the relative order of those "sibling" vertices, and I'd like something fully deterministic that I can count on. What are my options? Does BGL provide something like this? As a concrete example, given tables A, B, C, with A depending on both B, C, topological_sort gives me the C, B, A order (or adding the "levels" (C, B), A), while I'd like B, C, A, i.e. preserving the relative order of B, C. Thanks for any insight. --DD PS: What about getting a topo-sort, but which also gives you the "levels", so that you can schedule those independent tasks (on each level) in parallel for example? Does BGL provide something like this? I've done it in the past with the help of the Sedgewick book, but I see a single topo-sort in BGL.

2 2

[Serialization] How do I make boost::serialization work with std::shared_ptr?
by Arman Schwarz 30 Sep '13

30 Sep '13

Hi everyone, this is my first post so I apologies if I got some of the housekeeping wrong. I did my best. I also realise that this is likely to be a common question but all the responses I could find on Stackoverflow (among others) were related to older implementations of boost. My understanding is that Boost 1.54 is supposed to support `std::shared_ptr`. To illustrate the issue I am having, suppose we want to serialize a class containing a vector of shared pointers, along with a static `load` function that will build the class from a file and a `save` function that will store the instance to a file, and suppose that we can't just use the `serialize` member function for whatever reason (this particular example doesn't really illustrate such a case but in my code I can't use the `serialize` member function so this example doesn't use it either): #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/vector.hpp> #include <boost/serialization/shared_ptr.hpp> #include <fstream> #include <memory> #include <vector> class A { public: std::vector<std::shared_ptr<int>> v; void A::Save(char * const filename); static A * const Load(char * const filename); ////////////////////////////////// // Boost Serialization: // private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int file_version) {} }; // save the world to a file: void A::Save(char * const filename) { // create and open a character archive for output std::ofstream ofs(filename); // save data to archive { boost::archive::text_oarchive oa(ofs); // write the pointer to file oa << this; } } // load world from file A * const A::Load(char * const filename) { A * a; // create and open an archive for input std::ifstream ifs(filename); boost::archive::text_iarchive ia(ifs); // read class pointer from archive ia >> a; return a; } namespace boost { namespace serialization { template<class Archive> inline void save_construct_data( Archive & ar, A const * t, unsigned const int file_version ) { ar << t->v; } template<class Archive> inline void load_construct_data( Archive & ar, A * t, const unsigned int file_version ) { ar >> t->v; } } } int main() { } Why doesn't this code compile? What am I doing wrong here? The error message states that 'serialize' is not a member of 'shared_ptr'. Why am I am getting this message?

5 6

Re: [Boost-users] Running Regular expression (RE) over a list, array or map
by Olivier Austina 28 Sep '13

28 Sep '13

Hi, I try to use pattern matching approach for a dataset with multilevel tags. Suppose we have 2 sets of features: F and H with the following tags F={f0, f1, f2, f3} and H={h0, h1, h2, h3, h4} to describe a set of elements E={e1, e2, e3.....en}. We have in a table a sequence of E elements describe as following: E e1 e2 e3 e4 e5 e6 e7 e8 ...........en F *f3 f0 f0 f0* f2 *f3 f0 * f2 f0 H h4 h0 h4 *h1* h0 h2 *h3* h2 h1 The order in which e1, e2 e3...... appear is important as words in a sentence. Suppose we have the following RE with f3 and f0 as following: f3f0+ . It will match the corresponding sequence e1, e2, e3, e4 and e6, e7 in E. Now we want to add additional constraint as the last f0 should map a h1 in H. In this case the final result will be only the sequence e1, e2, e3, e4 because in the last sequence e6, e7 the f0 map h3 in H.The final result is always E sequences but the RE and constraint can be based on E, F or H. May be it becomes a bit clear. Thank for your help. Regards Olivier 2013/9/27 Anthony Foiani <tkil(a)scrye.com> > Olivier, greetings -- > > Olivier Austina <olivier.austina(a)gmail.com> writes: > > > I am wondering if it is possible to run directly regular expression > > over a list and getting the indexes (begging and end) of the > > match. For example, I have a list of strings and a regular > > expression and I want to know which part of the list matches the RE > > and get the corresponding indexes in the list. > > It looks like you got some other suggestions, but if they're not what > you're looking for, you might want to clarify your request. > > In particular, it's not clear to me whether you want to match the RE > against each individual item (which can be parallelized, but the > result is a membership bitmap or subset, not a range), or if you want > to match the RE against the concatenated value, or the largest span of > continuous values (which are the requests that make the most sense if > you want a starting and ending index). > > Some sample code would probably clarify things. > > E.g., given: > > typedef std::vector< std::string > string_vec; > const string_vec sv{ "foo", "bar", "baz" }; > > And you wanted to match: > > const boost::regex re{ "ba.*" }; > > What answer do you want to see? > > * The membership bitmap would be something like: [ 0, 1, 1 ] > > * The subset would be: { "bar", "baz" } > (This is basically a "grep" operator.) > > * The "range" answer would be sv.begin()+1, sv.begin()+3 (since > "barbaz" matches). > > * The other "range" answer would be the same, but because "bar" > matches, and "baz" matches, so the range represents the (longest?) > set of elements that individually match the given regex. This > ends up being something of a meta-regex, or if you prefer, the > result of searching the concatenated string for instances of > "(?:re)+". > > Or is there some other interpretation that you're trying to get at? > > Happy hacking, > Tony > > p.s. Heh. Guess who just finished a few interviews where "spot the > under-specified problem" was important... > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

2 2

Re: [Boost-users] [geometry] within(Poly, Poly)
by Barend Gehrels 27 Sep '13

27 Sep '13

> Barend Gehrels wrote: >> On 26-9-2013 23:01, Adam Wulkiewicz wrote: >>> Barend Gehrels wrote: >>> >>>> >>>>> >>>>> So must I handle each special case, analysing the exterior rings, polygons inside holes, holes inside holes, etc? Or do you see some other, clever way of doing it? >>>> >>>> Yes, all turn information should be totally independent on segments being exterior or interior (iff the orientation is correct w.r.t. the compile-time specified orientation) >>> >>> Ok so the algorithm complicates, correct me if I'm wrong: >>> >>> If P1 exterior isn't inside P2 exterior >>> return NOT_WITHIN >>> If P2 has holes >>> If P1 exterior is disjoint or only touches holes of P2 >>> return WITHIN >>> If holes of P2 which intersects P1 are also inside P1 holes >>> return WITHIN >>> else >>> return NOT_WITHIN >> >> You are right - if there are holes, this must be checked. See also the unit-tests for union.cpp (with TEST_WITH_SVG): union_wrapped, union_winded, union_within_holes_disjoint, union_intersect_holes_disjoint, ... >> >> For touches this is done in "rings_containing", this is probably possible here too. That makes it not really complex and because turns are OK for all exterior/interior combinations, the holes are not a big issue. >> >> For union/intersection, and also for dissolve in intersections, this is done in "select_rings" (the dissolve.hpp contains a simple version that might do ; the others are in overlay.hpp) They are followed by "assign_parents" but that is probably not necessary for this algorithm. >> >> >> >>> >>> And holes should be reversed before checking because they have different orientation than the exterior ring. >> >> No, we assume correct polygons. And all turn info is correct for holes. We don't have to check (besides for things located inside each other without intersections). >> I don't know if you mean this, but for information: we have a specific type for polygons where order is dynamic (both allowed: order_undetermined) but that is not yet implemented anywhere. >> > > Ok now I'm checking special cases and I think that my previous assumtions wasn't fully ok. Correct me if I'm wrong. > > Of course method 'i' and operation 'xx' is automatic fail. ? xx fails but i is ok for turns including on holes? > > Only if we have operation 'u' we must worry about > 'uu' - touches from the outside > 'ux' - is outside > 'ui' - the curve potentially goes to the other side of the second curve. ? yes but this all means failure for all turns including holes? (except ui, sometimes) > > All other combination with operations 'i' and 'c|c' are ok, also t+cc, m+cc? > > So additionally we should check if points of segments for which u|i was generated are inside the polygon. This would be ok for '[not] within *.svg', '(2-5).svg' but would fail for '1.svg'. However in those cases there would be uu there so it might be used as well. So I guess if there are some 'u|i' operations we should check if all (or some) points are inside. If there is some 'u|u' we should check if on the same point there are no other intersections to detect cases like 'ok_uu.svg'. > > Of course if there are no intersections, only one point may be tested if it's inside. > > What do you think? > sorry I don't understand it. As I said before, holes are processed correctly automatically for any turn. You don't have to process any turn special for any hole. So i is intersection, this is Ok. But u is union, then the within should fail. The interior is really the inside of a polygon, not the hole. That is outside.... Or maybe I did not understand your mail. I never handle holes separately in any turn in the whole traverse process. As long as the direction is ccw (for a cw polygon), it all goes ok. The interior is always on the right side. Of course, as we discussed before, if a hole does not have any turnpoints, we should check it separately and differently, not with turn info Regards, Barend Sent from iPad. Barend Gehrels www.barendgehrels

1 0

[Container] Using container of BOOST_MOVABLE_BUT_NOT_COPYABLE type with std algorithm
by kwanti 27 Sep '13

27 Sep '13

I try to use std::remove_if with boost.container of BOOST_MOVABLE_BUT_NOT_COPYABLE type in c++98 compiler. The compilation failed because std::remove_if in c++98 is not implemented with boost.move emulation. Is there any implementation of remove_if in boost that is implemented with boost.move? I found one remove_if algorithm in boost.range library but I can't find in the documentation whether it is using boost.move emulation. -- View this message in context: http://boost.2283326.n4.nabble.com/Container-Using-container-of-BOOST-MOVAB… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Running Regular expression (RE) over a list, array or map
by Olivier Austina 27 Sep '13

27 Sep '13

Hi, I am wondering if it is possible to run directly regular expression over a list and getting the indexes (begging and end) of the match. For example, I have a list of strings and a regular expression and I want to know which part of the list matches the RE and get the corresponding indexes in the list. Any suggestion is welcome. Thank you. Regards Olivier

4 4

Student and Internationaltickets for Meeting C++
by Jens Weller 26 Sep '13

26 Sep '13

Hello boost-community, a short update on the upcoming Meeting C++ Conference. There are 3 different discounts available - Student discount of 200 € - international guests 100 € - boost contributor* 100 / 50 € The discount works over a code, so you need to contact me, in order to be given your discount-code. The discount for boost contributors is 100 €, or additional 50 € if combined with one of the other discounts. More information on the Discounts: http://meetingcpp.com/index.php/newsreader/items/announcing-student-and-int… Meeting C++ 2013 Schedule: http://meetingcpp.com/index.php/schedule13.html General Information on the conf: http://meetingcpp.com/index.php/mcpp2013.html * you should have activly contributed to boost kind regards, Jens Weller

1 0

Linux TCP session stays ESTABLISHED when interface is removed
by Chris Verges 26 Sep '13

26 Sep '13

Hi all, I'm experiencing an odd phenomenon when using Boost ASIO 1.46.1. (I know it's older, but this was inherited.) Under normal operation, everything is fine. I can create a TCP server socket, listen, and accept as expected. If I disconnect the TCP client gracefully, everything resets as expected. However, if I physically remove the network interface -- such as yanking the USB adapter out of its socket -- the TCP session stills reports as ESTABLISHED via netstat and the application receives no read error. I'm at a bit of a loss how this is possible when the underlying OS shows that the interface no longer exists yet the socket is blocking away happily. Has anyone else experienced similar symptoms? Any advice? Thanks in advance, Chris

5 7

ASIO UDP Communication stops working when entering a thread
by Ulf Samuelsson 25 Sep '13

25 Sep '13

Have created a class to allow UDP communication using ASIO // Header class UdpClient { public: UdpClient(); void Open(string ipaddr, string port); void Send(string packet); void Close(); private: bool init; string ipAddress; string Port; udp::endpoint Endpoint; udp::socket *pSocket; udp::socket *s; }; // Part of code void UdpClient::Open(string ipaddr, string port) { ipAddress = ipaddr; Port = port; boost::asio::io_service io_service; udp::resolver resolver(io_service); udp::resolver::query query(udp::v4(), ipaddr,port); Endpoint = *resolver.resolve(query); pSocket = new udp::socket(io_service); pSocket->open(udp::v4()); pSocket->send_to(boost::asio::buffer(first.c_str(), first.size()), Endpoint); std::cout << "Opening port [" + Port + "] on " + ipAddress + "\n"; init = true; } void UdpClient::Send(string packet) { if (init) { pSocket->send_to(boost::asio::buffer(packet.c_str(), packet.size()), Endpoint); } } --------------- Another class implements more advanced communication. // Extracts extern UdpClient endpoint; void UdpDebug::WriteLine(string line) { line = "[" + Clock.Now() + "]" + line; endpoint.Send(line); }; ------------------------ In my main program i declare two global variables. UdpDebug DebugPort; UdpClient endpoint; The I init the UDP communication by calling endpoint.Open(IPAddress, UDPPort); after that I can write to the UDP enpoint by: DebugPort.WriteLine("Debug working!"); Have declared a thread: boost::thread t1(Initialize); void Initialize() { DebugPort.WriteLine("Debug working in the thread"); for (int i = 0; i < MAX; ++i) { wait(1); std::cout << "Thread 1: " << i << std::endl; } } When I do t1.join(); The thread starts printing out "Thread1: <number>" on the terminal but no UDP output is received on the other end. Any clues why this won't work? Are starting two threads, but only one of them is attempting UDP communication. If I put a wait statement inside the main program, and attempt UDP communication after the threads have executed a few seconds, this will still work. Also tried creating a new instance of UdpClient inside the thread. Opened it, and tried to send data, to no avail. Any clues? BR Ulf Samuelsson

1 1

How to solve __imp_Py_NoneStruct error in C++?
by Wenlong Wang 25 Sep '13

25 Sep '13

Hi, All I am trying to run Boost.Python in my IDE. Here is my tools: Microsoft Visual Studio 2012 Express Version (64-bit), Python 2.7 (64-bit), Boost 1.54, Windows7 64-bit. And my code is really simple. I created an empty project, and create a source.cpp as follows: #include <boost\python.hpp> #include <Python.h> using namespace std; void main() { return; } After debugging, an error pops out: "error LNK2001: unresolved external symbol __imp___Py_NoneStruct" May I know where am I wrong? Regards Wenlong Wang Risk Analyst, Capquest Group Ltd Email: wwang(a)capquest.co.uk Fleet 27, Rye Close, Fleet, GU51 2QQ. Website: http://www.capquest.co.uk/ This e-mail is intended solely for the addressee, is strictly confidential and may also be legally privileged. If you are not the addressee please do not read, print, re-transmit, store or act in reliance on it or any attachments. Instead, please email it back to the sender and then immediately permanently delete it. E-mail communications cannot be guaranteed to be secure or error free, as information could be intercepted, corrupted, amended, lost, destroyed, arrive late or incomplete, or contain viruses. We do not accept liability for any such matters or their consequences. Anyone who communicates with us by e-mail is taken to accept the risks in doing so. Opinions, conclusions and other information in this e-mail and any attachments are solely those of the author and do not represent those of Capquest Group Limited or any of its subsidiaries unless otherwise stated. Capquest Group Limited (registered number 4936030), Capquest Debt Recovery Limited (registered number 3772278), Capquest Investments Limited (registered number 5245825), Capquest Asset Management Limited (registered number 5245829) and Capquest Mortgage Servicing Limited (registered number 05821008) are all limited companies registered in England and Wales with their registered offices at Fleet 27, Rye Close, Fleet, Hampshire, GU51 2QQ. Each company is a separate and independent legal entity. None of the companies have any liability for each other's acts or omissions. Group VAT registration number 844281719. Members of the Capquest group are regulated under the Consumer Credit Act 1974 and are members of the Credit Services Association. This communication is from the company named in the sender's details above.

1 0

BGL (Boost Graph Library) MaxWeightedMatching algorithm
by Pablo Madoery 25 Sep '13

25 Sep '13

Hello, i want to use an algorithm called MaxWeightedMatching : Edmond's blossom shrinking algorithm for calculating maximum weighted matching in general graphs. I note that there is an algorithm in BGL called 1. edmonds_maximum_cardinality_matching<http://www.boost.org/doc/libs/1_54_0/libs/graph/doc/maximum_matching.html> but this is not what I want. I need to take in count the weights. I would like to know if this algorithm can be taken in count in the next version of Boost or if you can tell me some advices to implement it using BGL. The MaxWeightedMatching algorithm is already implemented in LEMON library: http://www.loco.ic.unicamp.br/~msambinelli/lemon_doc/a00537.html. Thanks for your time.

2 1

linking to boost 1.54 w/ windows and visual studio 2013 RC
by Jarrett Chisholm 25 Sep '13

25 Sep '13

Hi all I'm trying to compile my project as a shared library using scons. I'm using Windows 7, and the Visual Studio 2013 RC. In the project, I'm using boost. The project compiles fine. However, when it tries to link, I get the following: /scons: warning: No version of Visual Studio compiler found - C/C++ compilers most likely not set correctly// // //scons: Reading SConscript files ...// //Compiling Glr// //scons: Reading SConscript files ...// //Parsing Shaders into header ShaderData.h// //Done parsing Shaders into header ShaderData.h// //scons: done reading SConscript files.// //scons: Building targets ...// //Using tempfile c:\users\jarrett\appdata\local\temp\tmpecwym3.lnk for command line:// //link /nologo /dll /out:build\glr.dll /implib:build\glr.lib /LIBPATH:build /LIBPATH:src /LIBPATH:C:\Users\Jarrett\projects\angelscript-sdk\angelscript\lib /LIBPATH:C:\Users\Jarrett\projects\sqlite3 /LIBPATH:C:\Users\Jarrett\projects\berkelium-win32\lib /LIBPATH:C:\Users\Jarrett\projects\SFML\lib "/LIBPATH:C:\Program Files\Assimp\lib\x86" "/LIBPATH:C:\Program Files (x86)\Boost\lib" /LIBPATH:C:\Users\Jarrett\projects\FreeImage\Dist "/LIBPATH:C:\Program Files (x86)\Microsoft Visual Studio 12.0\VC\lib" opengl32.lib glew32.lib berkelium.lib sfml-system.lib sfml-window.lib assimp.lib freeimage.lib libboost_log-vc120-mt-1_54.lib libboost_log_setup-vc120-mt-1_54.lib libboost_date_time-vc120-mt-1_54.lib libboost_thread-vc120-mt-1_54.lib libboost_wave-vc120-mt-1_54.lib libboost_regex-vc120-mt-1_54.lib libboost_filesystem-vc120-mt-1_54.lib libboost_system-vc120-mt-1_54.lib build\BasicSceneManager.obj build\BasicSceneNode.obj build\Camera.obj build\GlrProgram.obj build\GraphicsEngine.obj build\Light.obj build\Window.obj build\common\math\Math.obj build\common\io\File.obj build\BasicSceneManager.obj build\BasicSceneNode.obj build\Camera.obj build\GlrProgram.obj build\GraphicsEngine.obj build\Light.obj build\Window.obj build\exceptions\Exception.obj build\exceptions\FormatException.obj build\exceptions\GlException.obj build\exceptions\IoException.obj build\gui\CallbackParameter.obj build\gui\GUI.obj build\gui\GUIObject.obj build\gui\HtmlGuiComponent.obj build\models\Animation.obj build\models\AssImpLoader.obj build\models\Model.obj build\models\ModelLoader.obj build\models\ModelManager.obj build\glw\Animation.obj build\glw\AnimationManager.obj build\glw\Constants.obj build\glw\Material.obj build\glw\MaterialManager.obj build\glw\Mesh.obj build\glw\MeshManager.obj build\glw\OpenGlDevice.obj build\glw\Texture.obj build\glw\TextureManager.obj build\glw\shaders\CPreProcessor.obj build\glw\shaders\GlrParser.obj build\glw\shaders\GlrPreProcessor.obj build\glw\shaders\GlrShader.obj build\glw\shaders\GlrShaderProgram.obj build\glw\shaders\GlslShader.obj build\glw\shaders\GlslShaderProgram.obj build\glw\shaders\ShaderProgramManager.obj// //link @c:\users\jarrett\appdata\local\temp\tmpecwym3.lnk// //Using tempfile c:\users\jarrett\appdata\local\temp\tmpep9gzl.lnk for command line:// //link /nologo /dll /out:build\glr.dll /implib:build\glr.lib /LIBPATH:build /LIBPATH:src /LIBPATH:C:\Users\Jarrett\projects\angelscript-sdk\angelscript\lib /LIBPATH:C:\Users\Jarrett\projects\sqlite3 /LIBPATH:C:\Users\Jarrett\projects\berkelium-win32\lib /LIBPATH:C:\Users\Jarrett\projects\SFML\lib "/LIBPATH:C:\Program Files\Assimp\lib\x86" "/LIBPATH:C:\Program Files (x86)\Boost\lib" /LIBPATH:C:\Users\Jarrett\projects\FreeImage\Dist "/LIBPATH:C:\Program Files (x86)\Microsoft Visual Studio 12.0\VC\lib" opengl32.lib glew32.lib berkelium.lib sfml-system.lib sfml-window.lib assimp.lib freeimage.lib libboost_log-vc120-mt-1_54.lib libboost_log_setup-vc120-mt-1_54.lib libboost_date_time-vc120-mt-1_54.lib libboost_thread-vc120-mt-1_54.lib libboost_wave-vc120-mt-1_54.lib libboost_regex-vc120-mt-1_54.lib libboost_filesystem-vc120-mt-1_54.lib libboost_system-vc120-mt-1_54.lib build\BasicSceneManager.obj build\BasicSceneNode.obj build\Camera.obj build\GlrProgram.obj build\GraphicsEngine.obj build\Light.obj build\Window.obj build\common\math\Math.obj build\common\io\File.obj build\BasicSceneManager.obj build\BasicSceneNode.obj build\Camera.obj build\GlrProgram.obj build\GraphicsEngine.obj build\Light.obj build\Window.obj build\exceptions\Exception.obj build\exceptions\FormatException.obj build\exceptions\GlException.obj build\exceptions\IoException.obj build\gui\CallbackParameter.obj build\gui\GUI.obj build\gui\GUIObject.obj build\gui\HtmlGuiComponent.obj build\models\Animation.obj build\models\AssImpLoader.obj build\models\Model.obj build\models\ModelLoader.obj build\models\ModelManager.obj build\glw\Animation.obj build\glw\AnimationManager.obj build\glw\Constants.obj build\glw\Material.obj build\glw\MaterialManager.obj build\glw\Mesh.obj build\glw\MeshManager.obj build\glw\OpenGlDevice.obj build\glw\Texture.obj build\glw\TextureManager.obj build\glw\shaders\CPreProcessor.obj build\glw\shaders\GlrParser.obj build\glw\shaders\GlrPreProcessor.obj build\glw\shaders\GlrShader.obj build\glw\shaders\GlrShaderProgram.obj build\glw\shaders\GlslShader.obj build\glw\shaders\GlslShaderProgram.obj build\glw\shaders\ShaderProgramManager.obj// //build\BasicSceneManager.obj : warning LNK4042: object specified more than once; extras ignored// //build\BasicSceneNode.obj : warning LNK4042: object specified more than once; extras ignored// //build\Camera.obj : warning LNK4042: object specified more than once; extras ignored// //build\GlrProgram.obj : warning LNK4042: object specified more than once; extras ignored// //build\GraphicsEngine.obj : warning LNK4042: object specified more than once; extras ignored// //build\Light.obj : warning LNK4042: object specified more than once; extras ignored// //build\Window.obj : warning LNK4042: object specified more than once; extras ignored// //LINK : fatal error LNK1104: cannot open file 'libboost_log-vc110-mt-1_54.lib'// //scons: building terminated because of errors.// //scons: *** [build/glr.dll] Error 1104/ I'm curious why it's trying to link to `libboost_log-vc110-mt-1_54.lib` instead of `libboost_log-vc120-mt-1_54.lib`, which is what I specified in the link command. Also, as far as I can tell, `vcxxx` is the compiler tag boost uses to tell what version of the compiler built the boost library...so it's almost like `scons` thinks boost was built using Visual Studio 2012, which would be `vc110`...I'm not sure. Any help is appreciated! Cheers Jarrett

4 5

How to correctly run Boost.Python?
by Wenlong Wang 25 Sep '13

25 Sep '13

Hi, All This is my first message at this mailing list, apologies first if I raised some simple question. I am using Microsoft Visual Studio 2012 Express Version, and Python 2.7. My boost version is 1.54.0. I followed the Boost Library instruction at http://www.boost.org/doc/libs/1_54_0/more/getting_started/windows.html#i nstall-boost-build And successfully build Boost in my computer with a message "The Boost C++ Libraries were successfully built!" My Boost path is "C:\local\boost_1_54_0" Then I want to run Boost.Python, and find it requires to be built separately. So, I found Boost.Python Library instructions at http://www.boost.org/doc/libs/1_54_0/libs/python/doc/building.html#basic -procedure In step 3.1 Basic Procedure, the Boost.Python Library instructions lead me back to Boost Library instruction section 5, at where I installed the Boost.Build at "C:\local\boost_1_54_0\BoostBuild". And "C:\local\boost_1_54_0\BoostBuild\bin" has been added to my Path environment variable. So now I am back to the Boost.Python Library instructions at section 3.1.3. I followed the instruction and cd into the "C:\local\boost_1_54_0\libs\python\example\quickstart". The next step, according to the instruction is : Invoke bjam. Replace the "stage" argument from the example invocation from section 5 of the Getting Started Guide <http://www.boost.org/doc/libs/1_54_0/more/getting_started/index.html> with "test," to build all the test targets. Also add the argument "--verbose-test" to see the output generated by the tests when they are run. On Windows, your bjam invocation might look something like: C:\boost_1_34_0\...\quickstart> bjam toolset=msvc --verbose-test test Then I got 135 unresolved external errors. One of them is as follows: exec.obj : error LNK2019: unresolved external symbol __imp__PyEval_GetGlobals referenced in function "class boost::python::api::object __cdecl boost::python::eval(class boost::python::str,class boost::python::api::object,class boost::python::api::object)" (?eval@python@boost@@YA?AVobject@api@12@Vstr@12@V3412@1@Z) ..\..\..\..\bin.v2\libs\python\build\msvc-11.0\debug\boost_python-vc110- gd-1_54.dll : fatal error LNK1120: 135 unresolved externals May I know what am I wrong? How can I fix this? Thank you very much. Regards Long Wenlong Wang Risk Analyst, Capquest Group Ltd Email: wwang(a)capquest.co.uk Fleet 27, Rye Close, Fleet, GU51 2QQ. Website: http://www.capquest.co.uk/ This e-mail is intended solely for the addressee, is strictly confidential and may also be legally privileged. If you are not the addressee please do not read, print, re-transmit, store or act in reliance on it or any attachments. Instead, please email it back to the sender and then immediately permanently delete it. E-mail communications cannot be guaranteed to be secure or error free, as information could be intercepted, corrupted, amended, lost, destroyed, arrive late or incomplete, or contain viruses. We do not accept liability for any such matters or their consequences. Anyone who communicates with us by e-mail is taken to accept the risks in doing so. Opinions, conclusions and other information in this e-mail and any attachments are solely those of the author and do not represent those of Capquest Group Limited or any of its subsidiaries unless otherwise stated. Capquest Group Limited (registered number 4936030), Capquest Debt Recovery Limited (registered number 3772278), Capquest Investments Limited (registered number 5245825), Capquest Asset Management Limited (registered number 5245829) and Capquest Mortgage Servicing Limited (registered number 05821008) are all limited companies registered in England and Wales with their registered offices at Fleet 27, Rye Close, Fleet, Hampshire, GU51 2QQ. Each company is a separate and independent legal entity. None of the companies have any liability for each other's acts or omissions. Group VAT registration number 844281719. Members of the Capquest group are regulated under the Consumer Credit Act 1974 and are members of the Credit Services Association. This communication is from the company named in the sender's details above.

1 0

[BGL] memory leak in graph/r_c_shortest_paths.hpp
by potato_research 24 Sep '13

24 Sep '13

Hello, I'm using BGL in my project and, with some input data, I get - sooner or later, as I run r_c_shortest_paths many times - a segfault. This behaviour is apparently quite random, as I can see by implementing a custom visitor that the last label evaluated before the crash changes all the time. I must also say that the graph I use, while always having the same topological structure, has different properties that affect labelling each time I run the algorithm and these vary quite randomly from one run to the other, as they are generated by a random heuristics. Anyway, with one particular set of input data, I manage to have the program segfault (as I said, sooner or later) 100% of the times. This is far from being an MWE, but it's the best I could produce. I tried to debug the memory leak with valgrind and it turns out that r_c_shortest_paths_dispatch is trying to access memory in a block previously freed by: l_alloc.deallocate( cur_outer_splabel.get(), 1 ); in r_c_shortest_paths.hpp:314. After some debugging I started to believe that the problem doesn't rely with my code, but it might be a bug in r_c_shortest_paths.hpp. If this is actually the case and where the problem lies, though, I haven't been able to figure out with certainty. The output from valgrind can be found here: http://pastebin.com/raw.php?i=WWafwFv3 (output cleaned up and with templates substituted) http://pastebin.com/raw.php?i=cb3p6jzM (raw output intended to facilitate reading and with templates substituted) http://pastebin.com/raw.php?i=qeauBQTm (raw output indented to facilitate reading) http://pastebin.com/raw.php?i=hpppf49c (raw output) My code (the whole project) can be found here: https://github.com/alberto-santini/maritime-vrp In order to run it, one must have a licensed copy of CPLEX and change the include and library paths in the Makefile's accordingly. Unfortunately, without putting the labelling part inside a price-and-branch procedure (that uses CPLEX as a solver for the master problem) I wasn't able to produce input data by hand that would lead me to obtain the segfault. I understand this is not the best way to investigate into a bug and will be happy to provide any further help if requested to. Thanks, AS -- View this message in context: http://boost.2283326.n4.nabble.com/BGL-memory-leak-in-graph-r-c-shortest-pa… Sent from the Boost - Users mailing list archive at Nabble.com.

2 4

BJAM and VS2013RC
by LeMay.Steve 23 Sep '13

23 Sep '13

Has anyone successfully built Boost 1.54 with VS2013RC? Did you have an issue with the build process locating cl ? Steven LeMay Game Platform Engineering International Game Technology 9295 Prototype Way Reno, NV 89521 Office: +1 775.448.8089 Mobile: +1 775.813.6676 steven.lemay(a)igt.com<mailto:steven.lemay@igt.com> This email message is for the sole use of the intended recipient(s) and may contain confidential and privileged information. Any unauthorized review, use, disclosure or distribution is prohibited. If you are not the intended recipient, please contact the sender by reply email and destroy all copies of the original message. Any humorous implications are purely the result of misinterpretations provided by the reader.

6 7

Re: [Boost-users] [boost] cross-compilation x86_64-w64-ming32: undefined reference to `InterlockedIncrement'
by Frédéric Bron 23 Sep '13

23 Sep '13

> I probably missed the original problem, but the patch doesn't look correct > to me. The section guarded with "defined( BOOST_MSVC ) || defined( > BOOST_INTEL_WIN )" is obviously targeted for compilers supporting > interlocked intrinsics, which gcc isn't. MinGW should probably be handled > by the last section of the #if/elif/endif sequence. Anyway, what problem > are you trying to fix? Here is what I get when build an application with boost and mingw-w64 targeting x86_64: /usr/x86_64-w64-mingw32/sys- root/mingw/lib/../lib/libboost_thread-mt.a(thread.o):(.text+0x286): undefined reference to `InterlockedIncrement' /usr/x86_64-w64-mingw32/sys-root/mingw/lib/../lib/libboost_thread-mt.a(thread.o):(.text+0x3e7): undefined reference to `InterlockedDecrement' /usr/lib64/gcc/x86_64-w64-mingw32/4.8.1/../../../../x86_64-w64-mingw32/bin/ld: /usr/x86_64-w64-mingw32/sys-root/mingw/lib/../lib/libboost_thread-mt.a(thread.o): bad reloc address 0x8 in section `.data' I have been able to solve this by defining BOOST_USE_WINDOWS_H but this creates issues with Unicode when I also use wxWidgets. The patch proposed solves the issue. I recognise that I say that gcc should be considered as MSVC with regards to these Interlocked things which I do not understand. It may seem strange but it works. What's wrong with it? Basically, I just #include <intrin.h>; what's wrong with that? Frédéric

1 0

Re: [Boost-users] cross-compilation x86_64-w64-ming32: undefined reference to `InterlockedIncrement'
by Frédéric Bron 23 Sep '13

23 Sep '13

So I eventually managed to fix the issue with interlocked.hpp and mingw-w64: both i686 and x86_64 now work. Attached is a patch against 1.54.0. Is it possible to include this in 1.55.0? Regards, Frédéric

1 0

Multiple instance of options
by Ulf Samuelsson 23 Sep '13

23 Sep '13

Need to parse an "ini" file which configures one or more sensors. The sensors can be of the same type and are identified by "name", "type" and an "id" Some configuration items are for all sensors Other configuration tiems are only for some sensors. [sensor] SensorName="Outdoor Temp" SensorType=1 # Temp Sensor SensorID=1000 SerialNumber="12344" Active=1 Device="/dev/ttyUSB01" [sensor] SensorName="Indoor Temp" SensorType=1 # Temp Sensor SensorID=1001 SerialNumber="12345" Active=1 Device="/dev/USB02" [sensor] SensorName="Light" SensorType=2 # Light Sensor SensorID=1002 SerialNumber="12349" Active=1 Device="/dev/ttyUSB02" MaxLumen="500" Is having multiple identical section names possible with boost program options? It is of course possible to do [sensor_1] ... [sensor_2] ... [sensor_3] ... but that is not so nice looking, and you get a hard limit on the number of sensors you can attach. Ideas? BR Ulf Samuelsson

3 3

Question about boost.build and automatic selection of toolsets
by Mauricio Carneiro 22 Sep '13

22 Sep '13

I am using boost-build in my project (very happy with the outcome) but I would like to have the toolset selected automatically based on the operating system. Currently I am running successfully from the command line by manually setting the toolset when I am running it from macos and linux accordingly, but I feel like the Jamroot file should be able to figure that out for me. Any ideas? I made a more descriptive post on stack overflow, to share the knowledge once we figure this one out. http://stackoverflow.com/questions/18939911/choosing-compiler-options-based… Thank you, Mauricio Carneiro, Ph.D. http://www.broadinstitute.org/~carneiro/

2 1

units
by Robert Ramey 22 Sep '13

22 Sep '13

I have a program in which there is the notion of consumption rate such as m^3/sec, gallons/hour, etc. I have consumption_rate unit defined in terms of si units. I read in a quanity in gallons/hour and so far so good. If I display the quantity it is displayed as m^3/sec. This displays the "compound units" as expected - very cool. All this is OK as far as it goes. When I try to display the quantity as gallons/hour again I have a whole host of problems. The attached test fill illustrates the issues. The only way I've been able to do is is by making a complete end run around the units system itself - sort of self defeating. I would appreciate insight anyone might be able to offer into this issue. Robert Ramey begin 666 test_units.cpp M#0HC:6YC;'5D92 \:6]S=')E86T^#0H-"B-I;F-L=61E(#QB;V]S="]U;FET M<R]I;RYH<' ^#0HC:6YC;'5D92 \8F]O<W0O=6YI=',O<&]W+FAP<#X-"B\O M(VEN8VQU9&4@/&)O;W-T+W5N:71S+V1E=&%I;"]U=&EL:71Y+FAP<#X-"B-I M;F-L=61E(#QB;V]S="]U;FET<R]S>7-T96US+V-G<RYH<' ^#0HC:6YC;'5D M92 \8F]O<W0O=6YI=',O<WES=&5M<R]S:2YH<' ^#0HC:6YC;'5D92 \8F]O M<W0O=6YI=',O<WES=&5M<R]S:2]I;RYH<' ^#0H-"B-I;F-L=61E(#QB;V]S M="]U;FET<R]B87-E7W5N:71S+VUE=')I8R]H;W5R+FAP<#X-"@T*=7-I;F<@ M;F%M97-P86-E(&)O;W-T.CIU;FET<SL-"@T*+R\@9&5R:79E('-P96-I86P@ M=6YI=',@=&AA="!W92!U<V4@:6X@;W5R(&%P<&QI8V%T:6]N#0HO+R!D97)I M=F5D(&1I;65N<VEO;B!F;W(@8V]N<W5M<'1I;VY?<F%T92 Z($T@5%XM,0T* M='EP961E9B!B;V]S=#HZ=6YI=',Z.F1E<FEV961?9&EM96YS:6]N/ T*(" @ M(&)O;W-T.CIU;FET<SHZ;&5N9W1H7V)A<V5?9&EM96YS:6]N+#,L#0H@(" @ M8F]O<W0Z.G5N:71S.CIT:6UE7V)A<V5?9&EM96YS:6]N+"TQ#0H^.CIT>7!E M(&-O;G-U;7!T:6]N7W)A=&5?9&EM96YS:6]N.R @(" @(" @(" @(" @(" - M"@T*='EP961E9B!B;V]S=#HZ=6YI=',Z.G5N:70\#0H@(" @8V]N<W5M<'1I M;VY?<F%T95]D:6UE;G-I;VXL#0H@(" @8F]O<W0Z.G5N:71S.CIS:3HZ<WES M=&5M#0H^(&-O;G-U;7!T:6]N7W)A=&5?=6YI=#L-"G1Y<&5D968@8F]O<W0Z M.G5N:71S.CIQ=6%N=&ET>3QC;VYS=6UP=&EO;E]R871E7W5N:70L(&9L;V%T M/B!C;VYS=6UP=&EO;E]R871E.PT*#0HC:6YC;'5D92 \8F]O<W0O=6YI=',O M8F%S95]U;FET<R]U<R]G86QL;VXN:'!P/@T*='EP961E9B!B;V]S=#HZ=6YI M=',Z.G5S.CIG86QL;VY?8F%S95]U;FET.CIU;FET7W1Y<&4@9V%L;&]N7W5N M:70[#0I"3T]35%]53DE44U]35$%424-?0T].4U1!3E0H9V%L;&]N+"!G86QL M;VY?=6YI="D[(" @( T*0D]/4U1?54Y)5%-?4U1!5$E#7T-/3E-404Y4*&=A M;&QO;G,L(&=A;&QO;E]U;FET*3L@(" @#0H-"B-I;F-L=61E(#QB;V]S="]U M;FET<R]B87-E7W5N:71S+VUE=')I8R]H;W5R+FAP<#X-"G1Y<&5D968@8F]O M<W0Z.G5N:71S.CIM971R:6,Z.FAO=7)?8F%S95]U;FET.CIU;FET7W1Y<&4@ M:&]U<E]U;FET.PT*0D]/4U1?54Y)5%-?4U1!5$E#7T-/3E-404Y4*&AO=7)S M+"!H;W5R7W5N:70I.PT*0D]/4U1?54Y)5%-?4U1!5$E#7T-/3E-404Y4*&AO M=7(L(&AO=7)?=6YI="D[(" @( T*#0II;G0@;6%I;B@I#0I[#0H@(" @<75A M;G1I='D\8V]N<W5M<'1I;VY?<F%T95]U;FET/B @0R@Q+C @*B!G86QL;VX@ M+R!H;W5R*3L-"@T*(" @('-T9#HZ8V]U=" \/" Q+C @*B!G86QL;VYS("\@ M:&]U<B \/" B("T@;VL@9&ES<&QA>7,@9V%L+VAO=7(B(#P\('-T9#HZ96YD M;" [#0H@(" @<W1D.CIC;W5T(#P\($,@/#P@(B M(&]K/R!D:7-P;&%Y<R!M M,R]S96,B(#P\('-T9#HZ96YD;" [#0H@(" @<W1D.CIC;W5T(#P\($,@*B!G M86QL;VYS("\@:&]U<B \/" B("T@;F]T(&]K("T@22!M:6=H="!B=7D@=&AI M<R(@/#P@<W1D.CIE;F1L(#L-"B @("!S=&0Z.F-O=70@/#P@0R O("AG86QL M;VYS("\@:&]U<BD@/#P@(B M(&)U="!T:&5N('1H:7,@<VAO=6QD('=O<FLA M(B \/"!S=&0Z.F5N9&P@.PT*#0H@(" @<W1D.CIC;W5T(#P\($,N=F%L=64H M*2 O("AG86QL;VYS("\@:&]U<BD@/#P@(B M(&1I<W!L87ES(&@O9R M3TL_ M(&)U="!U;F5X<&5C=&5D('9A;'5E("$@*&5X<&5C=&5D(#$N,"D@(CP\('-T M9#HZ96YD;" [#0H@(" @+R\@<W1D.CIC;W5T/#P@0RYV86QU92@I("\@*&=A M;&QO;G,@+R!H;W5R*2YV86QU92@I(#P\("(@+2!D:7-P;&%Y<R!H+V<@+4]+ M/R!B=70@=6YE>'!E8W1E9"!V86QU92 A("AE>'!E8W1E9" Q+C I("(\/"!S M=&0Z.F5N9&P@.PT*(" @('-T9#HZ8V]U=" \/"!#+G9A;'5E*"D@+R H*#$N M," J(&=A;&QO;G,I("\@*#$N," J(&AO=7(I*2YV86QU92@I(#P\("(@+2!U M;F5X<&5C=&5D('9A;'5E("$@*&5X<&5C=&5D(#$N,"D@(CP\('-T9#HZ96YD M;" [#0H@(" @<W1D.CIC;W5T(#P\($,N=F%L=64H*2 O("@H,2XP("H@9V%L M;&]N<RDN=F%L=64H*2 O("@Q+C @*B!H;W5R*2YV86QU92@I*2 \/" B("T@ M=6YE>'!E8W1E9"!V86QU92 A("AE>'!E8W1E9" Q+C I("(\/"!S=&0Z.F5N M9&P@.PT*#0H@(" @9FQO870@9R ]("@Q+C @*B!G86QL;VYS*2YV86QU92@I M.PT*(" @('-T9#HZ8V]U=" \/"!G(#P\('-T9#HZ96YD;#L-"B @("!F;&]A M="!H(#T@*#$N," J(&AO=7(I+G9A;'5E*"D[#0H@(" @<W1D.CIC;W5T(#P\ M(&@@/#P@<W1D.CIE;F1L.PT*(" @(&9L;V%T('(@/2!#+G9A;'5E*"D@+R H M9R O(&(a)I.PT*(" @('-T9#HZ8V]U=" \/"!R("H@9V%L;&]N<R O(&AO=7(@ M/#P@(B M(&9I;F%L;'DA('1H92!C;W)R96-T(')E<W5L="$B(#P\('-T9#HZ M96YD;#L-"@T*(" @('-T9#HZ8V]U=" \/"!S=&0Z.F5N9&P[#0H@(" @#0H@ M(" @<75A;G1I='D\<VDZ.F%R96$^(" @(" @02@Q+C4J<VDZ.FUE=&5R*F-G M<SHZ8V5N=&EM971E<BD[#0H@(" @#0H@(" @<W1D.CIC;W5T(#P\(#$N-2IS M:3HZ;65T97(J8V=S.CIC96YT:6UE=&5R(#P\('-T9#HZ96YD; T*(" @(" @ M(" @(" @(" \/"!!(#P\('-T9#HZ96YD; T*(" @(" @(" @(" @(" \/"!S A=&0Z.F5N9&P[#0H-"B @("!R971U<FX@,#L-"GT-"@T* ` end

2 3

Boost::Bind Problem
by vishal rawate 22 Sep '13

22 Sep '13

Hello, I am trying to use Boost::Bind to bind my function but I am getting an error as Bind cannot diffrentiate between the constructors even though they have diffrent function signatures. TestBind(boost::bind((&Test::process), &t1, _1)); I would highly appreciate any help. Thanks //Boost Includes #include <boost/function.hpp> #include <boost/bind.hpp> #include <boost/enable_shared_from_this.hpp> namespace test{ struct A{ public: int one; int two; }; struct B{ public: short three; short four; }; typedef boost::shared_ptr<A> t_boostInt; typedef boost::shared_ptr<B> t_boostShort; class TestBind{ public: typedef boost::function< int (t_boostInt)> t_ProcessFunctionInt; public: ///< call back process function for short typedef boost::function< short (t_boostShort)> t_ProcessFunctionShort; public: TestBind( t_ProcessFunctionInt func){} TestBind(t_ProcessFunctionShort func){} }; class Test { public: Test(){} ~Test(); public: int process(t_boostInt msg) { return 1;} }; int main(int argc, char * argv[]) { try { Test t1; TestBind(boost::bind((&Test::process), &t1, _1)); } catch (std::exception & exception) { std::cout << exception.what() << std::endl; } return 0; } }

3 4

Newbie boost::spirit rule semantic action question
by LeMay.Steve 21 Sep '13

21 Sep '13

Brand-newbie boost::spirit::qi question. MSVS2012, boost 1.54 I have a response from a serial device that provides with 0 or more "profiles" in a given character format. I want to capture the number of profile responses in the list (semantic action) as well as have the value into the final result (std::vector<std::string>). How do I properly express this? Given the input.... (in this case, there are zero profiles returned) *ARSS:0<CR><LF>OK<CR><LF> Expect a vector of strings containing "*ARSS" "0" "OK" This sub-rule fails to return... (Not failing to parse) boost::spirit::qi::rule<Iter, std::vector<std::string>(), boost::spirit::qi::locals<int, std::string>> service_search_list; service_search_list %= // %= operator is necessary for attribute propagation when using symantic attributes (anything in [ ]) string ("*ARSS") >> colon >> // Initial response +digit [qi::_a = qi::_1] >> crlf >> // Number of discovered devices - save in local qi::_a qi::omit [ok [qi::_b = qi::_1]] >> // Match but don't emit the "OK" here - save it for the end qi::repeat (qi::_a) // Repeat for each discovered device [ crlf >> ( qi::hold [profile1] | qi::hold [profile2] ... ) ] >> qi::attr(qi::_b); // Emit the "OK" here at the end of the list Using qi::int_[qi::_a = qi::_1] provides and empty string "" in the result and not "0". If I omit the numeric input from the result... qi::omit [qi::int_[qi::_a = qi::_1]] the parse will succeed but number of items in the response list is lost in the final result (omitted as requested). Any suggestion is appreciated, I'm stumped.

2 2

Re: [Boost-users] Boost::Bind Problem
by Sergey Zhuravlev 21 Sep '13

21 Sep '13

Try use TestBind f(boost::bind(boost::type<TestBind::t_ProcessFunctionInt>(), (&Test::process), &t1, _1)); for ambiguity. Either ...boost::bind<TestBind::t_ProcessFunctionInt>..., but less portable.

1 0

build errors with 1.54 on linux
by Dev Guy 21 Sep '13

21 Sep '13

Hello All, I am building boost 1.54 on a linux box and I am seeing the following error messages after the build: gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7/release/link-static/threading-multi/instantiate_re2c_lexer_str.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7/release/link-static/threading-multi/token_ids.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7/release/link-static/threading-multi/wave_config_constant.o common.mkdir bin.v2/libs/wave/build/gcc-4.7/release/link-static/threading-multi/cpplexer common.mkdir bin.v2/libs/wave/build/gcc-4.7/release/link-static/threading-multi/cpplexer/re2clex gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7/release/link-static/threading-multi/cpplexer/re2clex/aq.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7/release/link-static/threading-multi/cpplexer/re2clex/cpp_re.o gcc.archive bin.v2/libs/wave/build/gcc-4.7/release/link-static/threading-multi/libboost_wave.a common.copy /home/yadav/dev/cpp/boost_1.54/lib/libboost_wave.a ...failed updating 29 targets... ...updated 10797 targets... How can I know what these 29 targets have failed and how to go about getting a clean build? Thanks!

2 1