January 2011 - Boost-users - lists.boost.org

win32 api
by Gianni Ambrosio 01 Feb '11

01 Feb '11

Hi All, I'm working on a piece of code that should run on a special real-time kernel that supports only a minimal set of win32 api. I would like to use boost sockets and threads but it seems there are some dependencies on win32 api not supported by that system (i.e. WSARecvFrom, WSASend, WSASocketA, WSAStringToAddressA). Is there a way to build boost libs with some options so that the C socket calls are used instead? I'm asking too much? Regards Gianni

2 4

Planar Embedding of a Graph
by Nitin Gangahar 01 Feb '11

01 Feb '11

Hi all! I am totally new to the Boost Library. I just wanted to know if BGL supports finding if a graph is planar or not and also the planar embedding of a graph. Thanking you, Nitin Gangahar

2 2

Compiling Boost
by Bhushan Inamdar 31 Jan '11

31 Jan '11

Hi all, I have installed Boost 1.44 and I have a program from a tutorial I am trying to compile with out success. The program is as follows: =============================================================================== #include <iostream> #include <vector> #include <algorithm> #include <boost/shared_ptr.hpp> using namespace::std; struct Boost_Example { Boost_Example(int _x) : x (_x) { } ~Boost_Example() { std::cout << "Destroying Boost_Example x = " << x << "\n"; std::cout << endl << endl << " "; system("PAUSE"); cout << endl << endl; } int x; }; typedef boost::shared_ptr<Boost_Example> Boost_ExamplePtr; struct Boost_ExamplePtrOps { bool operator()(const Boost_ExamplePtr &a, const Boost_ExamplePtr &b) { return a->x < b->x; } void operator()(const Boost_ExamplePtr &a) { std::cout << " " << a->x; } }; int main() { std::vector<Boost_ExamplePtr> Boost_Example_Vector; Boost_Example_Vector.push_back(Boost_ExamplePtr(new Boost_Example(3))); Boost_Example_Vector.push_back(Boost_ExamplePtr(new Boost_Example(2))); Boost_Example_Vector.push_back(Boost_ExamplePtr(new Boost_Example(1))); // std::cout << endl << endl; std::cout << " Original Boost_Example_Vector" ; std::for_each(Boost_Example_Vector.begin(), Boost_Example_Vector.end(), Boost_ExamplePtrOps()); std::cout << "\n"; // std::sort(Boost_Example_Vector.begin(), Boost_Example_Vector.end(), Boost_ExamplePtrOps()); std::cout << endl << endl; std::cout << "Sorted Boost_Example_vector: " ; std::for_each(Boost_Example_Vector.begin(), Boost_Example_Vector.end(), Boost_ExamplePtrOps()); std::cout << " \n"; // std::cout << endl << endl << " " ; system("PAUSE"); std::cout << endl << endl; // return 0; } ============================================================================= Just create an empty VC++ project and add a source file to it. Then paste this code in the source file. I believe that, if Boost is correctly installed on one's machine, this should compile correctly. For additional information, I have set up the include and lib directories as under: includes: $(BOOST_ROOT)boost libs $(BOOST_ROOT)stage\lib $(BOOST_ROOT)libs $(BOOST_ROOT)bin.v2 In the above paths, $(BOOST_ROOT) is added to "System Variables" under the "Environment Variables" as C:\Program Files\boost\boost_1_44_0 where it is installed. Shall a "\" be added in the end? Or shall this variable be added to "Path variables" instead of "System variables"? I believe that my environment is rightly setup. But I am still having problems building a simple console application. I am using Visual Studio 2008 on Windows 7. Please let me know, what to do and where to check for the missing block? Thanks and regards, Bhushan

2 1

Problems with testing a putatively successful build using cygwin
by Ted Byers 31 Jan '11

31 Jan '11

I tried the following: ./bootstrap.sh --exec-prefix=/usr/local ./bjam --layout=versioned --build-type=complete cd status ../bjam And I was planning the following if the result of the above was acceptable. ./bjam install However, every time I have tried this, it stops part way through, at the following the last few lines: ../boost/iterator/iterator_facade.hpp:514: warning: type qualifiers ignored on function return type gcc.compile.c++ ../bin.v2/libs/regex/test/regex_regress_threaded.test/gcc-4.3.4/debug/thread ing-multi/regress/test_unicode.o In file included from ../boost/date_time/posix_time/posix_time_system.hpp:14, from ../boost/date_time/posix_time/ptime.hpp:12, from ../boost/date_time/posix_time/posix_time_types.hpp:12, from ../boost/thread/thread_time.hpp:11, from ../boost/thread/locks.hpp:12, from ../boost/thread/pthread/mutex.hpp:12, from ../boost/thread/mutex.hpp:16, from ../boost/thread/pthread/thread_data.hpp:12, from ../boost/thread/thread.hpp:17, from ../boost/thread.hpp:13, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/info.hpp:27, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test_not_regex.hpp: 22, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test.hpp:31, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\test_unicode.cpp:21: ../boost/date_time/time_system_split.hpp:41:1: warning: use of C99 long long integer constant gcc.compile.c++ ../bin.v2/libs/regex/test/regex_regress_threaded.test/gcc-4.3.4/debug/thread ing-multi/regress/test_overloads.o In file included from ../boost/date_time/posix_time/posix_time_system.hpp:14, from ../boost/date_time/posix_time/ptime.hpp:12, from ../boost/date_time/posix_time/posix_time_types.hpp:12, from ../boost/thread/thread_time.hpp:11, from ../boost/thread/locks.hpp:12, from ../boost/thread/pthread/mutex.hpp:12, from ../boost/thread/mutex.hpp:16, from ../boost/thread/pthread/thread_data.hpp:12, from ../boost/thread/thread.hpp:17, from ../boost/thread.hpp:13, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/info.hpp:27, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test_not_regex.hpp: 22, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test.hpp:31, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\test_overloads.cpp:1 2: ../boost/date_time/time_system_split.hpp:41:1: warning: use of C99 long long integer constant gcc.compile.c++ ../bin.v2/libs/regex/test/regex_regress_threaded.test/gcc-4.3.4/debug/thread ing-multi/regress/test_operators.o In file included from ../boost/date_time/posix_time/posix_time_system.hpp:14, from ../boost/date_time/posix_time/ptime.hpp:12, from ../boost/date_time/posix_time/posix_time_types.hpp:12, from ../boost/thread/thread_time.hpp:11, from ../boost/thread/locks.hpp:12, from ../boost/thread/pthread/mutex.hpp:12, from ../boost/thread/mutex.hpp:16, from ../boost/thread/pthread/thread_data.hpp:12, from ../boost/thread/thread.hpp:17, from ../boost/thread.hpp:13, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/info.hpp:27, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test_not_regex.hpp: 22, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test.hpp:31, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\test_operators.cpp:1 2: ../boost/date_time/time_system_split.hpp:41:1: warning: use of C99 long long integer constant gcc.link ../bin.v2/libs/regex/test/regex_regress_threaded.test/gcc-4.3.4/debug/thread ing-multi/regex_regress_threaded.exe The last gcc.link statement above has been the last statement in the cygwin bash console for about 12 hours now. I am rather surprised that either bjam or a test program it is running can stop like that and not have bjam detect it and respond appropriately. Is there a way to prevent this from happening? I know (from having tried it), that I can terminate this and re-execute bjam in status, and that that will finish, but doing that doesn't tell me what fraction of tests succeeded. Rather, it tells me only about those targets that were found, and their result, during the current executin. Obviously, it will ignore all the tests that had been performed previously. I also see a lot of files created in status during the test. Is there a script that will process the contents of status and tell me at least the sort of info provided in the table on " http://www.boost.org/development/tests/trunk/developer/summary.html"? Thanks Ted

1 0

[1.46.0 beta 1] Release 1.46.0 beta 1 available
by Beman Dawes 31 Jan '11

31 Jan '11

Boost release 1.46.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/ This release contains one new library, Interval Containers, and numerous enhancements and bug fixes for existing libraries. For details of what's in the release, see http://beta.boost.org/users/news/version_1_46_0. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

2 1

getting a return value from a bind?
by pedro chaparro 31 Jan '11

31 Jan '11

hi , i have on my code something like boost::thread thrd(boost::bind(&myioTCPLTE,TCPmsg)) function myioTCPLTE return a string value, bu i dont now how to get it to store in a different variable from the main code!! Could anyone help me? thanks -- Pedro Alonso Chaparro Valero R&D Engineer Ciudad Politecnica de la Innovación iTEAM - Mobile Communications Group Polytechnic University of Valencia C\ Camino de Vera S/N, Edificio 8G 46022 Valencia, Spain

2 1

Re: [Boost-users] [Asio] Socket Read/Write Thread-Safety (Timothy Liang)
by Marat Abrarov 31 Jan '11

31 Jan '11

> The 'boost::asio::async_read(...)' and 'boost::asio::async_write(...)' > functions might call async_read_some and async_write_some concurrently in > some scenarios, as they do not synchronize accesses to the stream object > that I'm passing to them as a reference. A look in their implementations > confirms this: if the stream's async_read_some or async_write_some didn't > satisfy the completion condition, it tries again, using the same reference > to the stream object. With multiple threads calling > io_service::run_one(), the result can be one thread calling > async_read_some while another is calling async_write_some at the same > time. This seems to prevent me from using async_read and async_write at > all, so I'm wondering if the stream has some undocumented thread-safety > guarantees, or if there's a proper way to achieve the same effect. RTFM. Really, RTFM. Use boost::asio::io_service::strand and don't worry about synchronization. http://www.boost.org/doc/libs/1_45_0/doc/html/boost_asio/overview/core/stran ds.html You can use async_read and async_write simultaneously (but note "Thread Safety" for used asio class) with strands easily. Yes, with multiple threads running boost::asio::io_service::run on the same boost::asio::io_service object. What amazing laziness in reading asio docs :) - all of the latest questions about Boost.Asio have respective answers in documentation. Marat Abrarov.

2 1

[Range] Sliced range adaptor, alternative for non RandomAccessRanges?
by Alastair Rankine 31 Jan '11

31 Jan '11

Hi, Currently it seems that the sliced range adaptor [1] requires a Random Access Range to do its job. Hence it can't be used for other ranges which dont model this concept. I want to use it with a Forward Range, specifically a std::set iterator range. What I want to do is this: std::set<int> input; input += 1,2,3,4,5,6,7,8,9; boost::copy( input | sliced(2, 5), std::ostream_iterator<int>(std::cout, ",")); (as per the sliced example, but with a std::set instead of a std::vector). I don't know much about the internals of the sliced adapter, but could it be changed to work a similar manner to counting_range, in order to locate the relevant slice of the input range? This would allow it to operate efficiently on Forward Ranges. Failing this, is there an efficient alternative to the above example? [1]: http://www.boost.org/doc/libs/1_45_0/libs/range/doc/html/range/reference/ad…)

3 3

graph- single source K shortest path with Boost Library
by Alexandre Lima 31 Jan '11

31 Jan '11

Hi, I would like to know if somebody could help me with Graphs. I need to find the 10th or kth shortest path in a single source problem, weighted >0, in other words, I need to keep the 10th or more first paths of one source to all other vertexes. I had already done that using a K shortest path algorithm (Yen, http://code.google.com/p/k-shortest-paths/ ),which discovery all the paths of a source to a sink, and I had just used a "for" with an objective to try all the sink nodes to solve the problems to all vertexes. It works, but the problem is that I can't use it in a big graph with 500 000 nodes, problems with memory. And now I am trying to use the boost library to compute at least the 10th shortest path to all nodes from a sink, but I don't know how can I keep the other paths. Attached: graph_al.cpp that is the code of boost library to compute a single source shortest path with dijkstra and pseudo_code that I was thinking to use to storage the other paths, but I don't know how to use it in a complex code like dijkstra boost code. If someone could help me ? thank you in advance. Alexandre de Lima

1 0

Re: [Boost-users] What's happened to Ryppl?
by Brian Wood 31 Jan '11

31 Jan '11

Edward Diener: >On 1/30/2011 7:16 PM, Scott McMurray wrote: >> >> >> I agree -- everything different about a DVCS is a consequence of >> allowing local commits. The best way I've seen of phrasing that >> fundamental difference: >> >> "[A DVCS] separates the act of committing new code from the act of >> inflicting it on everybody else." ~<http://hginit.com/00.html> > > But of course when you eventually merge all your local commits which Git > encourages you to keep to yourself until you are good and ready to > combine them with other people's repositories and local commits, I think that's called chewing the cud. I'm not a Git user, but it reminds me of the saying, "Don't call us, we'll call you." I find this thread interesting so thanks to all involved. And thanks for not top-posting. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net (651) 251-9384

1 0