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

Re: [Boost-users] Boost.Signals: strange bug in example program
by Pranckevicius, Tadas 09 Jun '06

09 Jun '06

-----Original Message----- From: Sebastian Redl [mailto:sebastian.redl@getdesigned.at] Sent: 09 June 2006 16:22 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Boost.Signals: strange bug in example program Pranckevicius, Tadas wrote: >I tried to run this example and I got the same results, it prints 8 on >Microsoft Visual studio 2003 (7.1) as well. > >I did try to debug it and ended up in "algorithm" file: > >After adding cout: > >template<class _FwdIt> inline > _FwdIt _Max_element(_FwdIt _First, _FwdIt _Last) > { // find largest element, using operator< > _DEBUG_RANGE(_First, _Last); > _FwdIt _Found = _First; > cout<<*_Found<<endl; > if (_First != _Last) > for (; ++_First != _Last;) { > cout<<*_First <<endl; > if (_DEBUG_LT(*_Found, *_First)) > _Found = _First; > } > return (_Found); > } > > >My Visual Studio.Net 2003 does not even have this function anywhere in >the include directory. What precise version are you using? Have you >replaced your standard library? >Sebastian Redl Sorry for the confusion I have debugged in VS 2005 In VS2003 it is: C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\algorithm And it looks like: template<class _FwdIt> inline _FwdIt max_element(_FwdIt _First, _FwdIt _Last) { // find largest element, using operator< _FwdIt _Found = _First; if (_First != _Last) for (; ++_First != _Last; ) if (*_Found < *_First) _Found = _First; return (_Found); } And gives the same result... thanks

1 0

Re: [Boost-users] [multi index].[composite key] Index creation atrun-time.
by JOAQUIN LOPEZ MU?Z 09 Jun '06

09 Jun '06

----- Mensaje original ----- De: Prashant Thakre <prashant.thakre(a)gmail.com> Fecha: Jueves, Junio 8, 2006 8:46 pm Asunto: Re: [Boost-users] [multi index].[composite key] Index creation atrun-time. > One final suggestion :) regarding the choice of index_container in > terms of performance, > memory requirements, serialization support and insert/lookup > opreations considering that std::vector<const std::string> will be the > basis for this container : > 1.Composite keys and hashed indices. > 2.Hashed indices. Excuse me, but I don't get what your suggestion or question is. Would you mind rephrasing or elaborating some more? Thank you. > Thanks a lot for clarifying all the doubts. It is a pleasure. > -- > regards, > Prashant Thakre > Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 3

Re: [Boost-users] Boost.Signals: strange bug in example program
by Pranckevicius, Tadas 09 Jun '06

09 Jun '06

>-----Original Message----- >From: Benjamin Winkler [mailto:Benjamin.Winkler@RWTH-Aachen.de] >Sent: 07 June 2006 22:20 >To: boost-users(a)lists.boost.org >Subject: [Boost-users] Boost.Signals: strange bug in example program >Hi, >I just downloaded the newest boost library 1.33.1 and compiled the >"maximum.cpp" example >from the Signals library, which goes like this: >#include <algorithm> >#include <iostream> >#include <boost/signals/signal2.hpp> >template<typename T> >struct maximum { > typedef T result_type; > template<typename InputIterator> > T operator()(InputIterator first, InputIterator last) const > { > if (first == last) > throw std::runtime_error("Cannot compute maximum of zero elements!"); > return *std::max_element(first, last); > } >}; >int main() >{ > boost::signal2<int, int, int, maximum<int> > sig_max; > sig_max.connect(std::plus<int>()); > sig_max.connect(std::multiplies<int>()); > sig_max.connect(std::minus<int>()); > sig_max.connect(std::divides<int>()); > > std::cout << sig_max(5, 3) << std::endl; // prints 15 > > return 0; >} >As stated, the correct result would be 15 but the output really is 8. >However, when I print the values via > std::copy(first, last, std::ostream_iterator<T>(std::cout, " ")); >I get "8 15 2 1 ", which means that the values are calculated correctly. >This error occurs with Microsoft Visual Studio 2005 (8.0) as well as MinGW >3.4.2. >I even tried replacing std::max_element() with my own function, which >expectedly >didn't help. >Seems like a bug to me, but I can't track it down. Could it be some issue >with >copying the iterator? >Benjamin Winkler Hello, I tried to run this example and I got the same results, it prints 8 on Microsoft Visual studio 2003 (7.1) as well. I did try to debug it and ended up in "algorithm" file: After adding cout: template<class _FwdIt> inline _FwdIt _Max_element(_FwdIt _First, _FwdIt _Last) { // find largest element, using operator< _DEBUG_RANGE(_First, _Last); _FwdIt _Found = _First; cout<<*_Found<<endl; if (_First != _Last) for (; ++_First != _Last;) { cout<<*_First <<endl; if (_DEBUG_LT(*_Found, *_First)) _Found = _First; } return (_Found); } It print's 8 15 2 1.66667 This is expected, but if I add to cout *_Found Like this: cout<<*_First<<" "<<*_Found<<endl; Results are: 8 8 8 8 8 8 8 So (_DEBUG_LT(*_Found, *_First) is always comparing the same numbers. Something is wrong with overloaded operator *. Smart people please help!!! Thanks

2 1

unit_test library on linux
by gelbeiche 09 Jun '06

09 Jun '06

Hi, I tried to use boost unittest lib at my linux box (SuSE 10.0 gcc version 4.0.2 ). I'm able to compile #include using boost::unit_test::test_suite; // most frequently you implement test cases as a free functions void free_test_function() { BOOST_CHECK( 2 == 1 ); } test_suite* init_unit_test_suite( int argc, char* argv[] ) { test_suite* test= BOOST_TEST_SUITE( "Example" ); test->add( BOOST_TEST_CASE( &free_test_function )); return test; } and to link against boost_unit_test_framework. make all-am make[1]: Entering directory `/home/pberg/boost_example_unittest' if g++ -DHAVE_CONFIG_H -I. -I. -I. -I/usr/local/include -g -O2 -MT main.o -MD -MP -MF ".deps/main.Tpo" -c -o main.o main.cpp; \ then mv -f ".deps/main.Tpo" ".deps/main.Po"; else rm -f ".deps/main.Tpo"; exit 1; fi g++ -I/usr/local/include -g -O2 -lboost_unit_test_framework -o sharedpointer main.o /usr/lib/gcc/i586-suse-linux/4.0.2/../../../../i586-suse-linux/bin/ld: warning: libstdc++.so.5, needed by /usr/local/lib/libboost_unit_test_framework.so, may conflict with libstdc++.so.6 make[1]: Leaving directory `/home/pberg/boost_example_unittest' However at execution time I get: porschberg(pberg):/home/pberg/boost_example_unittest> ./sharedpointer *** glibc detected *** free(): invalid pointer: 0x0804ba10 *** Abgebrochen I "valgrinded" the executable and here is the output: *** errors detected in test suite "Example"; see standard output for details ==30533== ==30533== Mismatched free() / delete / delete [] ==30533== at 0x1B904A69: free (vg_replace_malloc.c:152) ==30533== by 0x1BC2FC80: operator delete(void*) (in /usr/lib/libstdc++.so.5.0 .7) ==30533== by 0x1B95840B: boost::unit_test::test_suite::~test_suite() (in /usr /local/lib/libboost_unit_test_framework.so.1.33.1) ==30533== by 0x1B9407FA: boost::unit_test::framework_impl::~framework_impl() (in /usr/local/lib/libboost_unit_test_framework.so.1.33.1) ==30533== by 0x1B93DF5E: (within /usr/local/lib/libboost_unit_test_framework. so.1.33.1) ==30533== by 0x1BA9D313: exit (in /lib/tls/libc-2.3.5.so) ==30533== by 0x1BA87EA7: __libc_start_main (in /lib/tls/libc-2.3.5.so) ==30533== by 0x8049120: ??? (start.S:119) ==30533== Address 0x1BC5D908 is 0 bytes inside a block of size 52 alloc'd ==30533== at 0x1B9046D3: operator new(unsigned) (vg_replace_malloc.c:132) ==30533== by 0x8049201: init_unit_test_suite(int, char**) (main.cpp:12) ==30533== by 0x1B93EEBD: boost::unit_test::framework::init(int, char**) (in / usr/local/lib/libboost_unit_test_framework.so.1.33.1) ==30533== by 0x1B94CF93: main (in /usr/local/lib/libboost_unit_test_framework .so.1.33.1) ==30533== ==30533== Mismatched free() / delete / delete [] ==30533== at 0x1B904A69: free (vg_replace_malloc.c:152) ==30533== by 0x1BC2FC80: operator delete(void*) (in /usr/lib/libstdc++.so.5.0 .7) ==30533== by 0x1B940927: boost::unit_test::framework_impl::~framework_impl() (in /usr/local/lib/libboost_unit_test_framework.so.1.33.1) ==30533== by 0x1B93DF5E: (within /usr/local/lib/libboost_unit_test_framework. so.1.33.1) ==30533== by 0x1BA9D313: exit (in /lib/tls/libc-2.3.5.so) ==30533== by 0x1BA87EA7: __libc_start_main (in /lib/tls/libc-2.3.5.so) ==30533== by 0x8049120: ??? (start.S:119) ==30533== Address 0x1BC5D9E8 is 0 bytes inside a block of size 44 alloc'd ==30533== at 0x1B9046D3: operator new(unsigned) (vg_replace_malloc.c:132) ==30533== by 0x804929E: init_unit_test_suite(int, char**) (unit_test_suite.hp p:222) ==30533== by 0x1B93EEBD: boost::unit_test::framework::init(int, char**) (in / usr/local/lib/libboost_unit_test_framework.so.1.33.1) ==30533== by 0x1B94CF93: main (in /usr/local/lib/libboost_unit_test_framework .so.1.33.1) ==30533== ==30533== ERROR SUMMARY: 7 errors from 7 contexts (suppressed: 24 from 2) ==30533== malloc/free: in use at exit: 9643 bytes in 6 blocks. ==30533== malloc/free: 24 allocs, 19 frees, 11593 bytes allocated. ==30533== For counts of detected errors, rerun with: -v ==30533== searching for pointers to 6 not-freed blocks. ==30533== checked 210328 bytes. ==30533== ==30533== LEAK SUMMARY: ==30533== definitely lost: 19 bytes in 1 blocks. ==30533== possibly lost: 0 bytes in 0 blocks. ==30533== still reachable: 9624 bytes in 5 blocks. ==30533== suppressed: 0 bytes in 0 blocks. ==30533== Use --leak-check=full to see details of leaked memory. I looked through the mailing list archives with no luck. Could someone give a hint ? Thomas

2 2

[ptr_container] ptr_multimap insert and transfer functions
by Konstantin Litvinenko 09 Jun '06

09 Jun '06

Hello, All! I have a couple of questions about ptr_container library. Specificaly 1) Why ptr_multimap_adapter::insert has non const key_type argument? 2) Why ptr_multimap_adapter::transfer( iterator object, ptr_multimap_adapter& from ) has void return type instead of iterator? PS I use 1.33.1 but this is true for 1.34 too. With best regards, Konstantin Litvinenko.

2 8

Serialization of valarray, Problem with Text Type
by Thomas DAVID 09 Jun '06

09 Jun '06

Hi all (again), I'm able to send a valarray with the XML archive but I have a problem with the Text archive. I displayed the received size in valarray.hpp. template<class Archive, class U> void load( Archive & ar, STD::valarray<U> &t, const unsigned int file_version ) { collection_size_type count; ar >> BOOST_SERIALIZATION_NVP(count); cerr << "Received size : " << count << endl; t.resize(count); if (count) ar >> make_array(detail::get_data(t), t.size()); } I have a correct "512" with XML but I have "0" with Text. But the message received is like "0 1 0 0 512 2 2 2 2 2 ...". So it seems that the message is correctly sent. Is the valarray with text buggy or I missed something (I'm quite sure this is the second option). Regards, Thomas DAVID

1 0

set() of dynamic_bitset is too slow.
by Bo Peng 09 Jun '06

09 Jun '06

Dear list, I am using dynamic_bitset to store a sequence of random 0/1. The program generates repeatedly 32bit random numbers and assign the result to a dynamic_bitset. for(UINT i=0; i < m_N; ++i) { if(bit == block) // generate a block { ri = rng().randInt(m_max); bit = 0; } if((ri >> bit) & 0x1) succ.set(i); bit++; } When I profile this program, I surprisingly find out that succ.set(i) uses >50% of the execution time. Is there anyway I can assign block by block to dynamic_bitset, or assign sequentially so the position of i does not have to be calculated each time? Many thanks in advance. Bo

2 9

Help to BUILD AND INSTALL Boost Libraries
by Hemal patel 08 Jun '06

08 Jun '06

Hello!! All, I ned help for BUILDING and INSTALLING the Boost Libraries through VC++ Express Edition . I tweaked it for couple of hrs unscussefully. Here is a run down of the steps I have taken Downloaded following three packs boost_1_33_1 boost-build-2.0-m10 boost-jam-3.1.12 Changed vcvars32.bat for PATH,INCLUDE and LIB settings for Platform SDK OS Environemental variables BOOST BOOST_BUILD_PATH VC80_ROOTS VC80CMNTOOLS Use of 'bjam install' or 'bjam "-sTOOLS=vc8" install ' generates following ERRORS/MESSAGE ------------------------------------------------------------------------------------------------------------------------------------------------------------------ C:/dnld/BOOST/boost_1_33_1/tools/build/v2\build-system.jam:48: in load rule os.environ unknown in module build-system. ------------------------------------------------------------------------------------------------------------------------------------------------------------------ C:\dnld\BOOST\boost-build-2.0-m10\boost-build\kernel\modules.jam:259: in import C:\dnld\BOOST\boost-build-2.0-m10\boost-build\kernel\bootstrap.jam:120: in boost-build C:\dnld\BOOST\boost-build-2.0-m10\boost-build\boost-build.jam:1: in module scope can someone of you take a while to show pointers to correct me. Thanks for all your time. Hemal Patel

4 6

Re: [Boost-users] [multi index].[composite key] Index creation at run-time.
by Prashant Thakre 08 Jun '06

08 Jun '06

One final suggestion :) regarding the choice of index_container in terms of performance, memory requirements, serialization support and insert/lookup opreations considering that std::vector<const std::string> will be the basis for this container : 1.Composite keys and hashed indices. 2.Hashed indices. Thanks a lot for clarifying all the doubts. -- regards, Prashant Thakre ----- Original Message ----- From: "Joaquín Mª López Muñoz" <joaquin(a)tid.es> Newsgroups: gmane.comp.lib.boost.user Sent: Thursday, June 08, 2006 6:51 PM Subject: Re: [multi index].[composite key] Index creation at run-time. Prashant Thakre ha escrito: > Hi, > > > OK, here, instead of a composite_key instantiation, > > you can take advantage directly of std::vector comparison > > semantics (you don't really need tuple_element): > > > > typedef multi_index_container< > > element, > > indexed_by< > > hashed_unique< > > member<element,std::vector<const std::string>,&element::tp> > > > > > // other indices, maybe > > > > > > element_collection; > > > > Is this equivalent to having a member std::string tp which is constructed at > run-time from all the elements of std::vector< const std::string > ? Depends on how you construct that string: if you just concatenate the vector elements, then no, it's not equivalent. For instance, the following two vectors {"mast","err","apparent"} {"master","rap","parent"} both map to "masterrapparent". > Also, how does the hash function generate the key ? Boost.Hash combines the vector element's hash values as described at http://boost.org/doc/html/id2490467.html B.MI also lets you specify your own hashing mechanism if you need it: http://boost.org/libs/multi_index/doc/advanced_topics.html#hash_spec Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

Re: [Boost-users] [multi_index].[composite_key] Index creation at run-time.
by Prashant Thakre 08 Jun '06

08 Jun '06

Hi, Guess, I should have given a code snippet :( >But, how are you planning to actually implement this? >Certainly you can't do the following: struct element { public: boost::tuple<t0,t1,...tn> tp; // ... }; As per your first suggestion: >1. If the maxium number of keys of the composite_key is bounded >then you can use that maximum and later on, at run-time, take >advantage of only the first N key slots. struct element { //Assumption: no more than 10 elements, a reasonable limit I guess. // boost::tuple<t0,t1,...t9> tp; const std::string & tuple_element(const int ind) const { return tp.get<ind>; } //... }; As per this suggestion: >2. You can have std::vector<> as the key, the comparison semantics >of this container in some ways resembles that of an infinite-length >composite key. struct element { std::vector<const std::string > tp; const std::string & tuple_element(const int ind) const { return tp[ind]; } //... }; template < std::size_t hash_table_size> struct element_hash { int operator() ( const std::string & hash_string ) const { std::string::const_iterator hash_iter = hash_string.begin(); register int hash_value = 0; //... return hash_value; } }; typedef multi_index_container< element, indexed_by< hashed_unique < // indexed by elements of tuple/vector composite_key< element, const_mem_fun< element, const std::string &, &element::tuple_element(0) > >, // end of composite key def composite_key_hash < element_hash< 8191 > > // end of key hash > // end of hash > // end of inedexed_by > > > element_collection; regards, Prashant Thakre > ----- Mensaje original ----- > De: Prashant Thakre <prashant.thakre_at_[hidden]> > Fecha: Martes, Junio 6, 2006 9:06 pm > Asunto: Re: [Boost-users] [multi_index].[composite_key] Index creation > atrun-time. > > > > Hi, > > Thanks for the reply. > > You're welcome. I'm afraid I'll have to ask > for some more info before I can try to answer > your original question, though :( > > > > This is what I am trying to achieve: > > a) Each entry in the container will have tuple containing n-elements > > tuple < t0, t1 ..., tn >, where n is known at run-time. This entry > > will also have other elements. > > > But, how are you planning to actually implement this? > Certainly you can't do the following: > > > class element > { > public: > boost::tuple<t0,t1,...tn> tp; > ... > }; > > > because you don't know n at compile time. This question > is important, since how you actually implement the > run-time knowledge of n will surely determine the way > you can plug a composite_key into the scheme. If you > can provide some actual code, no matter how sketchy, > showing how you implement your element type, so much > the better. > > > Looking fwd to your feedback, > > > Joaquín M López Muñoz > Telefónica, Investigación y Desarrollo

3 3