- Boost-users - lists.boost.org

Boost-Jam - Building Boost.Python extensions
by Lawrence Spector 27 Nov '06

27 Nov '06

Hello all. Quick question on boost-jam, because I couldn't get it work right on my system. When I went into the $BOOST_ROOT_DIR\libs\python\example\tutorial directory and build as follows: bjam -sTOOLS=vc-7_1 It built with no problems. I then took the tutorial example and moved it outside the boost tree. I edited the Jamrules so that: path-global BOOST_ROOT : ../../../.. ; became: path-global BOOST_ROOT : $(BOOST_ROOT_DIR) ; and left all else the same. However when I built, it complained that it couldn't find boost-build.jam. Any ideas what might be missing/not set up right, or if I missed a step? Thanks so much, Lawrence

2 1

Signals
by Sam Duvall 27 Nov '06

27 Nov '06

Hi, I am trying to use boost signals. I am using Visual Studio 2005 with boost and qt. I had to do this workaround to avoid the signals conflict: #ifdef signals #error "signalslib.hpp must be included before any qt header" #endif #include <boost/signal.hpp> namespace boost { namespace signalslib = signals; } I am getting this error INK : fatal error LNK1104: cannot open file 'libboost_signals-vc80-mt-1_33_1.lib' Thanks, Sam

2 1

[multiindex] - lower_bound/upper_bound return wrong results
by Oliver.Kowalke＠qimonda.com 27 Nov '06

27 Nov '06

Hello, The example below should print out only the items {1.0, true} and {2.0, true} but not {1.5, false}. What is going wrong? Regards, Oliver #include <algorithm> #include <iostream> #include <iterator> #include <cstdlib> #include <stdexcept> #include <utility> #include <boost/lambda/lambda.hpp> #include <boost/multi_index_container.hpp> #include <boost/multi_index/key_extractors.hpp> #include <boost/multi_index/ordered_index.hpp> namespace mi = boost::multi_index; namespace ld = boost::lambda; class item { private: double weight_; bool asignable_; public: item( double weight, bool asignable) : weight_( weight), asignable_( asignable) {} double weight() const { return weight_; } bool asignable() const { return asignable_; } }; std::ostream & operator<<( std::ostream & os, item const& i) { os << i.weight() << " " << std::boolalpha << i.asignable(); return os; } int main( int argc, char *argv[]) { try { typedef mi::multi_index_container< item, mi::indexed_by< mi::ordered_unique< mi::composite_key< item, mi::const_mem_fun< item, double, & item::weight >, mi::const_mem_fun< item, bool, & item::asignable > > > > > item_table; item_table s; s.insert( item( 0.1, true) ); s.insert( item( 0.5, true) ); s.insert( item( 1.0, true) ); s.insert( item( 1.5, false) ); s.insert( item( 2.0, true) ); typedef item_table::nth_index< 0 >::type idx_type; idx_type::iterator it0 = s.lower_bound( boost::make_tuple( 0.8, true) ); idx_type::iterator it1 = s.upper_bound( boost::make_tuple( 2.5, true) ); std::copy( it0, it1, std::ostream_iterator< item >( std::cout, "\n") ); /* output: 1 true 1.5 false // wrong! 2 true */ return EXIT_SUCCESS; } catch ( std::exception const& e) { std::cerr << e.what() << std::endl; } catch ( ... ) { std::cerr << "unhandled exception" << std::endl; } return EXIT_FAILURE; }

2 1

Re: [Boost-users] [multiindex] - lower_bound/upper_bound return wrongresults
by Mihalicza, Jozsef 27 Nov '06

27 Nov '06

Hello, Compose_key implements lexicographical comparison where (1, true) < (1.5, false) < (2, true). What you need is a composition of two indices rather than of keys I think, the first filters out elements having proper first keys and the second narrows that by the second key. HTH József Mihalicza -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Oliver.Kowalke(a)qimonda.com Sent: Monday, November 27, 2006 2:41 PM To: boost-users(a)lists.boost.org Subject: [Boost-users] [multiindex] - lower_bound/upper_bound return wrongresults Hello, The example below should print out only the items {1.0, true} and {2.0, true} but not {1.5, false}. What is going wrong? Regards, Oliver #include <algorithm> #include <iostream> #include <iterator> #include <cstdlib> #include <stdexcept> #include <utility> #include <boost/lambda/lambda.hpp> #include <boost/multi_index_container.hpp> #include <boost/multi_index/key_extractors.hpp> #include <boost/multi_index/ordered_index.hpp> namespace mi = boost::multi_index; namespace ld = boost::lambda; class item { private: double weight_; bool asignable_; public: item( double weight, bool asignable) : weight_( weight), asignable_( asignable) {} double weight() const { return weight_; } bool asignable() const { return asignable_; } }; std::ostream & operator<<( std::ostream & os, item const& i) { os << i.weight() << " " << std::boolalpha << i.asignable(); return os; } int main( int argc, char *argv[]) { try { typedef mi::multi_index_container< item, mi::indexed_by< mi::ordered_unique< mi::composite_key< item, mi::const_mem_fun< item, double, & item::weight >, mi::const_mem_fun< item, bool, & item::asignable > > > > > item_table; item_table s; s.insert( item( 0.1, true) ); s.insert( item( 0.5, true) ); s.insert( item( 1.0, true) ); s.insert( item( 1.5, false) ); s.insert( item( 2.0, true) ); typedef item_table::nth_index< 0 >::type idx_type; idx_type::iterator it0 = s.lower_bound( boost::make_tuple( 0.8, true) ); idx_type::iterator it1 = s.upper_bound( boost::make_tuple( 2.5, true) ); std::copy( it0, it1, std::ostream_iterator< item >( std::cout, "\n") ); /* output: 1 true 1.5 false // wrong! 2 true */ return EXIT_SUCCESS; } catch ( std::exception const& e) { std::cerr << e.what() << std::endl; } catch ( ... ) { std::cerr << "unhandled exception" << std::endl; } return EXIT_FAILURE; } _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Carrying Boost source code with mine
by Paulo J. Matos 25 Nov '06

25 Nov '06

Hello, I need to use Boost (it would be great and save me a lot of work) in my software. However, I don't want to say to my users that they need to have boost installed. So, what's the best way to distribute boost around with my code? Right now, I only need variant. Should I just copy the include/variant to my include/boost? How do I know why files are needed if these are not just the only ones? Regards, -- Paulo Jorge Matos - pocm at soton.ac.uk http://www.personal.soton.ac.uk/pocm PhD Student @ ECS University of Southampton, UK

2 2

[serialization] char[] and double
by Larry Smith 25 Nov '06

25 Nov '06

We have thousands of 'packed' 'C' structs (2100+) shared between C and C++ modules & apps. These structures do NOT contain any pointers, all data is contiguous so that it may be transferred directly from one machine's memory to another machine's memory without translation (32 bit Windows on Intel), e.g. #ifdef __cplusplus extern "C" { #endif typedef struct NODE_MGR { char ApplName[8]; char CompName[8]; } NODE_MGR; typedef struct ROUTE_CONTROL { UCHAR msg_type; ULONG req_num; char src_domain_id[ 15 ]; char src_machine_id[ 8 ]; char src_proc_id[ 32 ]; char dest_domain_id[ 15 ]; char dest_machine_id[ 8 ]; char dest_proc_id[ 32 ]; NODE_MGR PrimeNodeMgr; NODE_MGR BkupNodeMgr; UINT parmlen; UINT datalen; /* data[] is actually 'parmlen + datalen' bytes * in length (64K max) and contains arrays of * other struct's who's types vary based on the values * of 'msg_type' and 'req_num'. */ char data[ 1 ]; } ROUTE_CONTROL; /* hundreds of other struct defs here... */ #ifdef __cplusplus } #endif Currently, these structs are written directly from the workstation's memory to a TCP/IP socket connected to a remote server process which reads them from the socket directly into memory for immediate use by the server program (i.e. 'packed' binary structs are transfered over the net from one 32 bit Windows machine to another 32 bit Windows machine). In the near future the workstations will continue to be 32 bit Windows, but the servers may be 32 bit Linux on Intel, or 64 bit Linux on AMD, or 64 bit Linux on PowerPC, or 64 bit Solaris on Sparc. This means that we can no longer send/receive 32 bit Intel 'packed' binary structs directly from the workstation to the server. I had hoped to use Boost Archives to serialize the structs to a std::string (via std::strstream), send it across the net, then deserialize the structs at the server. However, the structs have thousands of members of the form 'char[N]' representing char arrays which are NOT nul-terminated. I can not get these struct members to serialize; I get compile errors, e.g. this fails to compile: ar & fld; // where fld is: char[200] What's the secret trick? The structs also contain many 'double' fields. If the precision is the (default?) 6 when serialized, that won't be enough. Is there a way to control the precision of doubles when they are written to a text archive? Thanks, Larry

4 7

Re: [Boost-users] debugging templates
by Sohail Somani 25 Nov '06

25 Nov '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Maik Beckmann > Sent: Friday, November 24, 2006 10:27 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] debugging templates > > Am Freitag, den 24.11.2006, 10:32 +0100 schrieb Berenguer Blasi: > > Thank you David, > > > > I think it?s a Kdbg issue (though I thought I would use gdb > behind the > > scenes)... > > > > Anybody knows something like Kgdb WITH templates? > > > > Thanks > > > > What about DDD ? > http://www.gnu.org/software/ddd/ > > I'm not an expert, but its the best(most bug free) GDB > front-end I know. cgdb is also a good one http://cgdb.sf.net

2 1

[install] need to install 32 bit boost libraries on amd64 system
by Brian Budge 24 Nov '06

24 Nov '06

Hi all - Is it possible to build 32 bit boost libraries on amd64? When I try, I get complaints (errors) saying that pointers aren't the right size. I already have boost installed in /usr/lib64, but I need the 32 bit libs in /usr/lib32. I'm running the gentoo distribution, so a trick to build via emerge or a trick to build via tarball/configure would be great. Thanks for any help, Brian

2 1

Wrapping variant into a smart reference
by Mathias Gaunard 24 Nov '06

24 Nov '06

I would have liked to wrap boost.variant<Base, Derived1, Derived2 .. DerivedN> into a smart reference that would act like a reference to Base. Unfortunetely, the variadic template nature makes this extremely complicated, especially since there are a lot of conversions cases to handle too (<Base, Derived1..DerivedN> should be convertible to <BaseOfBase, Base, Derived1..DerivedN>). Is there any way to code that kind of thing easily?

1 0

Re: [Boost-users] debugging templates
by Hughes, James 24 Nov '06

24 Nov '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Berenguer Blasi > Sent: 23 November 2006 09:44 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] debugging templates > > Hi, > > I guess the subject says it all. > > Is there a way to debug templates? with kdbg preferrably? Kgdb??? The Linux kernel debugger?? Since the kernel is all C, how can you use templates in it? Forgive me if I am missing something!! I have certainly done some debugging using _gdb_ on templated code, but it can be somewhat confusing (rather like template compile errors!), but certainly possible. James > > I've read you can with dbx but don?t know if you can with others. > > How do you do it? > > Thanks. > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > This message (including any attachments) contains confidential and/or proprietary information intended only for the addressee. Any unauthorized disclosure, copying, distribution or reliance on the contents of this information is strictly prohibited and may constitute a violation of law. If you are not the intended recipient, please notify the sender immediately by responding to this e-mail, and delete the message from your system. If you have any questions about this e-mail please notify the sender immediately.

5 6