- Boost-users - lists.boost.org

[Asio] Cannot receive a UDP multicast using receive_from
by David Laurie 08 Dec '08

08 Dec '08

Would like to say Hello to all as I've just joined the list today and am also a first time user of the boost libraries. I'm cutting my teeth on asio by trying to receive a UDP multicast message with the boost::asio::ip::udp::socket::receive_from function. I got it going using the windows calls but just cant seem to crack it with boost. My only suspicion is that im getting the wrong IP version in the endpoint, but would guess it has found it from the initialisation, but other than that im a bit stumped. Any suggestions to where I may be going wrong? Cheers David Heres the code: const boost::asio::ip::address listen_address = boost::asio::ip::address::from_string("192.168.1.1"); const boost::asio::ip::address multicast_address = boost::asio::ip::address::from_string("224.x.x.x"); //appropriate address used boost::asio::io_service io_service; boost::asio::ip::udp::socket socket_(io_service); boost::asio::ip::udp::endpoint sender_endpoint_; enum { max_length = 1024 }; char data_[max_length]; // Create the endpoint boost::asio::ip::udp::endpoint listen_endpoint( listen_address, multicast_port); // open the socket socket_.open(listen_endpoint.protocol()); // is this picking up v6 instead of v4? // Join the multicast group. socket_.set_option( boost::asio::ip::multicast::join_group(multicast_address)); // bind it socket_.bind(listen_endpoint); socket_.receive_from( boost::asio::buffer(data_, max_length), sender_endpoint_); This email has been scanned for all known viruses by the MessageLabs Email Security System. Systems Engineering & Assessment Ltd - Beckington Castle, 17 Castle Corner, Beckington, Frome, Somerset, BA11 6TA, UK is registered in England and Wales with the company number 2430846. The contents of this email (including any attachments) are confidential and may be legally privileged. If you are not the intended recipient of this email any disclosure, copying, distribution or use of its contents is strictly prohibited. You should notify the sender immediately and then delete it (including any attachments) from your system. Please help out the environment by only printing this e-mail if absolutely necessary - Thank You.

2 2

Subject::[boost thread] when does the thread start?
by Lei (oddo) Zhang 08 Dec '08

08 Dec '08

When I create a thread object such as : boost::thread thrd1(boost::bind(&function)); does the thread start executing the function immediately? -- Lei(Oddo) Zhang 70 Symonds Street Engineering Science Department

2 1

Build error: "duplicate initialization of gcc"
by Tim Martin 08 Dec '08

08 Dec '08

I downloaded boost 1.37.0, unzipped and ran $ ./configure $ make install It dies reliably with: ------------------ ./tools/jam/src/bin.linuxx86/bjam -sICU_PATH=/usr --user-config=user-config.jam --prefix=/home/timm --exec-prefix=/home/timm --libdir=/home/timm/lib --includedir=/home/timm/include install error: at /home/timm/downloads/boost_1_37_0/tools/build/v2/build/project.jam:846 error: duplicate initialization of gcc with the following parameters: error: version = 4.3.2 error: previous initialization at /home/timm/downloads/boost_1_37_0/tools/build/v2/build/project.jam:846 Not all Boost libraries built properly. ------------------- This is on a relatively unmodified Ubuntu Intrepid linux install. I could only find one other mention of this problem on the web and it was a mailing list post with no answer, so I'm apparently doing something quite unusually wrong. FWIW, the reason I'm building from source rather than using a package is that the Ubuntu packages don't seem to provide a binary lib for MPI - am I missing something here? They provide header files, so it seems eccentric not to provide a package with libs. Tim

3 4

Re: [Boost-users] [boost] [review][constrained_value] Review of ConstrainedValueLibrary begins today
by jesseperla＠gmail.com 07 Dec '08

07 Dec '08

Robert: As a caveat and analogy: I want to use this to represent mathematics rather than just bounds-checking. The constrained value manages the subset within an underlying space (represented by the underlying type int, double, etc.). Then an instantiation of this is an element in this set. And my goal is to be able to take an instantiation/element and access information about the underlying set/type itself (eg managing bounds for optimizers, domain/range for functors, etc. from only an instance of the type passed in to a generic function). And if you use linear operators on elements of the subset, then it always returns members of the underlying space (which is mathematically correct. integers are a subset of reals which is a linear space with the +,-,/,* operators on it. Divide an integer by an integer and you get an element of the superset) More questions: 1) Storage the same as underlying type?::::::: > OK, now it makes a bit more sense. Moreover, I believe it is possible (though > maybe not trivial) to implement something similar with the current library. Cool. This would be necessary for me to use the library, so I hope it is possible to have dynamic bounds associated with the type. If this was completed, would the space/storage taken up by an instantiation of the bounded type be the same as the underlying type? In particular, I would be interested in having a vector of bounded double's have the same storage aa vector of bounded doubles (I would be using ublas for example) so that I could potentially pass on a pointer to a C function for some interoperability (I know... hacky but sometimes necessary for all the C scientific computing libraries out there). And for my numerical work, having an extra parameter or two stored for every value in a big matrix would eat up cache/memory too quickly for no value. If necessary to accommodate consistency of the storage with just the underlying type, perhaps the idea of a bounded value on an instantiation (like it is today for the runtime) vs. a bounded type (modifiable at runtime, but common to all instance) could have a different template... something like: typedef bounded_type<double, "INTEREST RATE"> interest_rate; interest_rate::change_bounds(.8, .99); 2) Casting for underlying numeric type?:::::::::: > http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2199.html Thanks for educating me on this. I find the myvar.value() syntax to be a little rough since my functions would want to be able to use both bounded types and intrinsic types in the same function, but perhaps this could work with an explicit cast which seems reasonable considering the C++ limitation. For example, would something like the following work to ensure consistency in my own usage?: template<typname T> void myfunc1(T& t) { cout << std::max(0.0, static_cast<double>(t)); //Note a floating point here } void myfunc2(T& t) { cout << std::max(0, static_cast<int>(t)); //Note integer here. } typedef bounded_type<double, "INTEREST RATE"> interest_rate; interest_rate::change_bounds(.8, .99); interest_rate r = .95; myfunc1(r); //works since casting internal myfunc1(.75); //also works, may be a double to double cast... myfunc2(r); //Would this fail? myfunc2(1); //Should work Note on the last one that it is trying to call max with an integer... My question here is whether this would work? Does the constrained value only have a direct cast to its underlying type, or is there any way to have it cast to any types that the underlying type can cast to? I would guess not for the last case... and this may be where myvar.value() is absolutely necessary? If the casting to the underlying type always works, then I would suggest that the myvar.value() is not the right way to go about things. What we are talking about here really is a cast, like it or not. 3) Bounds including infinity?:::::::: When we are working with bounds, can we use the numeric infinities with both open and closed sets? I am thinking something like: typedef bounded_type<double, "Risk Aversion"> risk_aversion; risk_aversion::change_bounds(1, std::numeric_limits<double>::infinity()); //Might want open or closed depending on if function domain is reals or extended reals. 4) Numeric limits traits?:::::::::::: For numeric processing, we also need to have some association with the numeric limit traits. I realize that there is some kind of conceptual connection between some of the traits here and the bounds themselves, but for practical purposes, these traits are too useful to ignore. Conceptually I think of these traits as being information about how the data is stored, rather than bounds themselves. What would be really useful is if bounded<> and other types would generate traits on their own based on the underlying type... this way, we wouldn't have to create numeric_limits traits for the types ourselves (which is unreasonable for a library user). So what I am thinking of is; typedef bounded_type<double, "Risk Aversion"> risk_aversion; cout << numeric_limits<risk_aversion>::quiet_NaN(); where the numeric_limits<risk_aversion> subclasses directly from numeric_limits<double>..... I don't know enough about generic programming to know how or if this is possible, but this is necessary for generic numeric programming. 5) Testing set inclusion:::::::: While it is nice to have the bounds checking on the () operator, I would also want to be able to ask the type if a value is in the set. For example, in math: Let Y = integers Let X = positive integers y = -1 \in Y Is y \in X? In this: typedef bounded_type<int, "X"> X; X::change_bounds(0, std::numeric_limits<int>::infinity()); int y = -1; cout << X::element_of(y); //would return a boolean? what I really would love to say is is X::element_of() or element_of<X>(y) ? This is a non-failing operation, and would be used all over in my numeric code, especially with wrapping optimizers. 6) No debug only functionality please:::::::::::: On all of the conversations about turning off bounds checking on debug, I would definitely not want this to happen automatically. And a bounds checking failure should be an exception, not a non-recoverable error. I may want to use this with an optimizer that tries to put in values out of bounds, and I would want to catch it and display a message to the console that the optimization failed, then try with a different initial value. 7) Operations consistent with built in C++ numeric types::::::::::::::::::: You have successfully educated me on why you need to overload the ++, --, +, -, etc. operators yourself and can't just revert to the underlying type. But focusing entirely on intrinsic numeric types double, int, etc.: Will we have complete coverage of the operators that are defined for these types in C++? Will the compiler end up generating EXACTLY the same code if I do a whole bunch of read only operations on a bounded<double> vs. a double? And will the overloading of these operators work for cross-type operations (eg multiplying a constrained integer by a constrained double?)? If the answer is no on these, then we probably can't use this library for scientific processing. 8) Multi-bounds:::::::::::::::: In comments such as: http://lists.boost.org/Archives/boost/2008/12/145662.php I think this is getting away from what I would hope this library can achieve: Associating sets(in the mathematical sense) of allowed values with a C++ type. I see what the predicates are used for, but I wouldn't use them very often. So I don't think we can think of the multi-bounds here being orthogonal constraints, but rather being a set of disconnected intervals themselves. Why not orthogonal constraints as described in this link (which essentially means intersections of subsets)? Try to construct X = (-infinity, 0] union [1,2] union [3,infinity) with intersecting intervals.... I would love to have a list of disconnected intervals in the space of the underlying type that could be parsed through from the . I do not see this as primarily a predicate question. If this is done with iterators, it might be even more flexible. For example, say that you only wanted even numbers and wanted to list out the first 10 intervals of this set... it could return an iterator to a list of intervals. In this case, it wouldn't calculate all of the intervals at once, but when you stepped forward, it would give you the next valid interval (a single value in this case). Thanks, Jesse

2 1

[LibrariesUnderConstruction] new LibrariesUnderConstruction wiki page
by vicente.botet 07 Dec '08

07 Dec '08

Hi, I have created a new wiki page containing some of the libraries under construction for Boost. You can access this page from the Boost Trac wiki https://svn.boost.org/trac/boost/wiki > Projects > Libraries Under Construction or directly https://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction The contents of this page is by nature incomplete and outdated. Please help to maintain this page updated by modifying it directly (if you have the rights) or posting on the Boost mailing lists boost-AT-lists.boost.org or boost-users-AT-lists.boost.org with the prefix [LibrariesUnderConstruction]. If you're the author of one of these libraries and desire that all or part of the information related to your library be removed or modified, please send a mail or you can do it directly if you prefer. If you're a library author and plan on submitting a library but don't know when it will be ready for review, and you want to include your library in this list, please add it directly (if you have the rights) or send a mail. If you're a library author and plan on submitting a library for review in the next 3-6 months, email Ron Garcia or John Phillips ("garcia at osl dot iu dot edu" and "phillips at mps dot ohio-state dot edu" respectively) a short description of your library and they will add it to the Review Wizard Report Libraries Under Construction section. HTH, Vicente

1 0

Mac 64/32 bit universal libraries
by Neal Meyer 07 Dec '08

07 Dec '08

I'm trying to build a 64/32 bit universal application that uses boost. Is there a way to build a version of the boost libraries for this usage?

2 1

Compiling Boost 1.36.0 for Itanium
by Amit Sonawane 07 Dec '08

07 Dec '08

Hi, I have the following environment: WinXP SP2/Visual Studio Team System 2005/Itanium cross compiler tools 1 . Generate boost libs using Itanium cross compiler command prompt with these options bjam -a --build-type=complete --toolset=msvc architecture=ia64 --stagedir=Winia64 stage 2. Compiling under Itanium configuration in VS2005 generates several linker errors as: error LNK2019: unresolved external symbol ._interlockedbittestandset referenced in function "[Entry] bool __cdecl boost::detail::win32::interlocked_bit_test_and_set(long *,long)" (.?interlocked_bit_test_and_set@win32@detail@boost@@YA_NPEAJJ@Z) error LNK2001: unresolved external symbol ._interlockedbittestandset 3.The projects compile fine under x86 and x64. _interlockbittestandset is not intrinsic on Itanium platform Has anyone come across this before ? or what is the correct way to build boost under itanium cross platform other then the options I used. Cheers, Esta mensagem pode conter informação confidencial e/ou privilegiada. Se você não for o destinatário ou a pessoa autorizada a receber esta mensagem, não deverá utilizar, copiar, alterar, divulgar a informação nela contida ou tomar qualquer ação baseada nessas informações. Se você recebeu esta mensagem por engano, por favor avise imediatamente o remetente, respondendo o e-mail e em seguida apague-o. Agradecemos sua cooperação. This message may contain confidential and/or privileged information. If you are not the addressee or authorized to receive this for the addressee, you must not use, copy, disclose, change, take any action based on this message or any information herein. If you have received this message in error, please advise the sender immediately by reply e-mail and delete this message. Thank you for your cooperation.

2 1

Threads and linking against the right Boost-libs
by Christoph Duelli 07 Dec '08

07 Dec '08

* When I have a program that use a second thread and only that second thread does use Boost, will I need to link against the "-mt" libs? (I am using linux.) [An example would be: when I use some Boost facilities together with Qt: Qt4 creates threads even if I do not use any explicitly.] * If I create a lib and that lib does not use threads, but does use Boost.Regex, I usually add a "-lboost_regex" to that lib. If a program later on uses both my lib and threads, would I have had to link against boost_regex-mt? Does this boil down to 'if I might use threads I should always link against the -mt libs'? Best regards Christoph

3 2

Re: [Boost-users] [review][constrained_value] Review of Constrained Value Library begins today
by Jesse Perla 06 Dec '08

06 Dec '08

One idea on the dynamically changing the global bounds for a type as I keep mentioning, one concern people have is that it could invalidate instantiated objects of the type. As I said before, being able to dynamically change the bounds at runtime is essential, but most of the time you would do it before you instantiate anything. Hence, one solution is to make a check to see if it has been instantiated yet. I don't know enough metaprogramming to know if this is possible, but the idea is to flip some kind of a compile time flag in the constructor of the type and if you try to change the bounds after that, it fails a compile time assertion. So, the following would work: typedef bounded_type<double, "INTEREST RATE"> interest_rate; interest_rate::change_bounds(.8, .99); interest_rate r = .95; But the following would fail at compile time: typedef bounded_type<double, "INTEREST RATE"> interest_rate; interest_rate r = .95; interest_rate::change_bounds(.8, .99); If this is a good idea, my only request is a preprocessor instruction to turn it off... -Jesse

2 1

ublas vector resize std::bad_alloc
by Fabian Lim 06 Dec '08

06 Dec '08

Im having a memory management problem. I have 2 ublas vectors Vector A = vector<V1 > Vector B = vector<vector<V2 > > : first vector level size is 2^22 where the data types both V1=vector<int> and V2 are vector<vectors<int>> and the size |V1| <= 2 and the first level size of V2 <=2 and the second level size <= 10. A grows as my program runs. B also grows but only the second level. I run in windows and when i check the memory usage, it seems to be around 90,000K when the exception throws. I dont really have a good feel for these figures, so I compared to my firefox browser, which seems to occupy approximately the same amount of memory, hence i concluded that not alot of memory is used. My computers have around 1/2 Gb RAM. I do not see the typical OS slowdown which accompanies alot of paging.

1 0