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

[boost-users][DateTime] crash with time_duration
by Igor R 08 Sep '08

08 Sep '08

Hi, The following code crashes (MSVC2005, boost1.36): //.... time_duration td = hours(25); cout << td; It seems that operator <<() uses to_tm() function, and the latter sets tm_hour = 25, which causes an assertion in CRT _expandtime() and program termination. Is this desired behavior / known issue / unknown bug? Thanks, Igor'.

1 0

[variant] variant member function apply_visitor( visitor ) thread-safe?
by Hicham Mouline 08 Sep '08

08 Sep '08

Hello, Is the apply_visitor() method per se thread-safe, meaning, if i have variant object, and i visit it from different threads at same time, and if i assume the visitor i write is thread-safe, my question is about the machinery of apply_visitor() itself, is it thread-safe? regards,

3 6

asio::serial_port how to know how many bytes are available for read
by Jean-Sebastien Stoezel 08 Sep '08

08 Sep '08

Hi, Is there a way to know how many bytes are available for read from a serial port, using asio::serial_port::read_some? The sockets have bytes_readable or something similar... Any equivalent for the serial ports? Thanks! Jean

1 1

Borland c++ 5.8.2 and Boost 1.3.6 - Thread problem???
by Stephen Kierzewski 08 Sep '08

08 Sep '08

Hello, Has anyone successfully compiled the Boost libraries with the Borland / Codegear Turbo C++ Pro, compiler version 5.8.2? I was able to build the libraries but I got a lot of errors and a simple Hello World program using boost::thread will not work. Any help on switches or tweaks I can do to get Boost to work would be appreciated. Here is the program I am compiling and the error I get when running it. I am linking to the debug version of the multi-threaded DLL (boost_thread-bcb-mt-d-1_36.dll) The sample program compiles fine but when I run it I get an assertion error and the program terminates. Any feedback is welcome. Thank you, Stephen ________________________________ Assertion failed: p_ != 0, file .\boost/intrusive_ptr.hpp, line 149 Abnormal program termination ________________________________ #include <boost/thread/thread.hpp> #include <iostream> using namespace std; void hello_world() { cout << "Hello world, I'm a thread!" << endl; } int main(int argc, char* argv[]) { // start a new thread that calls the "hello_world" function boost::thread my_thread(&hello_world); // wait for the thread to finish my_thread.join(); return 0; }

1 0

Boost Graph Library and Boehm Garbage Collector
by FBSL 08 Sep '08

08 Sep '08

Hello I am having trouble to garbage-collect adjacency_list<>. I have instanciated it with correctly garbage-collected vectors and lists (I have copied vecS and listS definitions, and added Boehm GC's default allocator so that they are garbage-collected). In my application I need to dynamically allocate many graphs, but it does not work, there is a (big) memory leak. Unfortunately, there is no template argument in adjacency_list<> to specify Boehm GC's allocator. Does anyone have a hint ? Snippet code "main.cpp" follows, compiled with Boost Graph Library 1.32, Boehm GC 6.4 and G++ 3.3.5, with command line : $ g++ -o main main.cpp -lgc -lgccpp -- #include <boost/graph/adjacency_list.hpp> #include <gc/gc_allocator.h> #include <gc/gc_cpp.h> #include <iostream> #include <vector> #include <list> using namespace std; using namespace boost; namespace boost { struct collected_vecS {}; struct collected_listS {}; template <class ValueType> struct container_gen<collected_vecS, ValueType> { typedef vector<ValueType,gc_allocator<ValueType> > type; }; template <class ValueType> struct container_gen<collected_listS, ValueType> { typedef list<ValueType,gc_allocator<ValueType> > type; }; template <> struct parallel_edge_traits<collected_vecS> { typedef allow_parallel_edge_tag type; }; template <> struct parallel_edge_traits<collected_listS> { typedef allow_parallel_edge_tag type; }; namespace detail { template <> struct is_random_access<collected_vecS> { enum { value = true }; typedef true_type type; }; } } typedef adjacency_list<collected_vecS, collected_vecS, directedS, no_property, no_property, no_property, collected_listS> graph; int main() { // leaks... while(true){ graph * g=new (UseGC) graph; for(unsigned int i=0; i<100; ++i){ add_vertex(*g); } for(unsigned int i=0; i<100; ++i){ for(unsigned int j=0; j<100; ++j){ add_edge(i,j,*g); } } } }

3 4

throw exception in boost
by gj_uestc 08 Sep '08

08 Sep '08

Hi, all When I use boost_1_36 in intel compiler, I got such error "runtime support for RTTI is disabled".It seems like RTTI is used in exception.hpp. Is there a way to let me choose not use the exception.hpp? I remembered in boose_1_35 you have to defined Macro "BOOST_NO_EXCEPTIONS" then "exception.hpp" would be included, otherwise this file is not necessary. Thanks Juan

2 1

Catching boost::thread_interrupted
by rbock＠eudoxos.de 08 Sep '08

08 Sep '08

Hi, currently I am making my first steps using Boost.Thread (1.36.0). The interrupt feature looks very cool, so I tried to use it, but somehow failed to catch boost::thread_interrupted. The code is attached to this mail. I was expecting to see something like Thread 0x60b050 got interrupted Thread 0x60b3e0 got interrupted Instead I got Thread 0x60b050 caught something else Thread 0x60b3e0 caught something else Can somebody please enlighten me? Thanks and regards, Roland

1 0

Boost.MPL.Vector -> Boost.Tuple
by Олег Царев 08 Sep '08

08 Sep '08

typedef boost::mpl::vector< A, B, C > Sequence; typedef typename Question< Sequence >::type Result; BOOST_MPL_ASSERT( boost::mpl::is_same< Result, boost::tuple< A, B, C > >); How write Question? I don't want to write specialisation for every dimension of tuple manually. Implementation should be compatible with the last stable Boost release (1.36) Thank you

2 2

What is the logic behind the library naming conventions?
by cowwoc 07 Sep '08

07 Sep '08

Hi, I am investigating possible library naming convention and I would appreciate getting your feedback on why Boost uses the naming convention it does. The discussion thread can be found here: http://discuss.joelonsoftware.com/default.asp?design.4.676033.4 I am sure the Boost team put a lot of thought into this so I would appreciate your insight on this discussion. Thank you, Gili -- View this message in context: http://www.nabble.com/What-is-the-logic-behind-the-library-naming-conventio… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Mutidimensional subscriptor operator
by Agustín K-ballo Bergé 07 Sep '08

07 Sep '08

Is there anything at boost that will help me build classes that support multidimensional subscriptor operator? I'm thinking in some CRTP-based solution in which I implement a subscriptor operator taking a tuple (or any other sequence of types type), that would create all the intermediate proxy types needed. Agustín K-ballo Bergé.-

1 0

[dataflow][review] Dataflow.Signals and threading - new docs and examples
by Stjepan Rajko 07 Sep '08

07 Sep '08

Hello, I have added a section on threading to the Dataflow.Signals tutorial: http://tinyurl.com/69subd (my hosting provider appears to be having some intermittent problems today - I apologize to any reviewers impacted by this) This new section summarizes information related to threading, and presents a new example component that uses the Threadpool library by Oliver Kowalke to provide support for asynchronous signals. Here is an excerpt regarding the Threadpool component: The purpose of the component is to make a signal call asynchronous. Instead of the consumer component processing the signal immediately, the signal call will be added to a thread pool and processed later. async_component is a class template, templated on the threadpool type, and the type of the underlying component that will process the asynchronous signal. The three examples provided are: * mixing synchronous and asynchronous signals * assigning priorities to tasks / signals * using asynchronous signals for cyclic networks Thanks to everyone that has participated in the discussion regarding this library so far. I hope this documentation update will provide some additional information on how the library can be used / extended. Stjepan

1 0

Building boost.regex with icu support
by Sean Farrow 07 Sep '08

07 Sep '08

Hi: How do I build boost.regex on windows with bjam and icu support? Cheers Sean. __________ Information from ESET NOD32 Antivirus, version of virus signature database 3423 (20080906) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

3 7

[dataflow.signals][thread_safe_signals] How to alter the Calling of chained signals
by Manuel Jung 07 Sep '08

07 Sep '08

Hi! I want to use dataflow.signals, which is build on top of thread_safe_signals. Each call of a producer (each signal) is put into a threadpool. Now i want not to execute the whole chain of data processing at once, but just one chain link at the time and put a new task to the threadpool than. The goal is that i can put rather complex and long (running) dataflow chains in the threadpool, which are divided into many pieces, so the threadpool can often decide which task is most important. So how can i alter the call of the next signal in a signal network/chain? Kind regards Manuel

2 12

Directory structure query
by Sean Farrow 07 Sep '08

07 Sep '08

Hi: When building boost regex with icu support with in the C:\Program Files\boost\Boost_trunk\bin.v2\libs\regex\build\msvc-8.0\release\ I have a build-no directory. What is this directory. It appears to build fine, and aditionally seems to be the static library. Any information apreciated. Sean. __________ Information from ESET NOD32 Antivirus, version of virus signature database 3423 (20080906) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

1 0

newbie question on cyclic shared pointers
by MGE 07 Sep '08

07 Sep '08

Hi guys, I have a data structure containing cycles of boost::shared_ptrs. I understand that this is not advisable since the cycles may not be deleted when shared pointers go out of scope. Possible solutions include the use of weak_ptrs or, alternatively, manually removing the cycles before deletion of pointers. I am finding it difficult to use weak_ptrs because I cannot guarantee that the single shared_ptr will outlive the numerous weak_ptrs. So I am trying to manually break the cycle at deletion. I would be grateful if somebody could take a look at the code below, which illustrates my basic approach. Assuming that I stringently break all cycles when a Child class or Parent class goes out of scope, would this approach avoid memory leaks? Would it be possible to put code into the destructor of Parent and Child classes that automatically sets the shared pointer owned by the class to null (not using the reset() function but by using the method below) hence guaranteeing that cycles are broken at deletion? Thanks for any advice! Best regards, MGE --------------------- struct Child; struct Parent { boost::shared_ptr<Child> myChild; }; struct Child { boost::shared_ptr<Parent> myParent; }; boost::shared_ptr<Child> child(new Child()); boost::shared_ptr<Parent> parent(new Parent()); // create a cycle of pointers parent->myChild = child; child->myParent = parent; // do something // .... // later, manually break the cycle parent->myChild = boost::shared_ptr<Child>(new Child()); child->myParent = boost::shared_ptr<Parent>(new Parent()); // there are no longer any cyclic pointers // parent and child go out of scope here, hopefully releasing all memory? -- View this message in context: http://www.nabble.com/newbie-question-on-cyclic-shared-pointers-tp19353536p… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

[filesystem] [random] Demo code in August 2008 Linux Gazette
by Scott McMurray 06 Sep '08

06 Sep '08

All, I just saw this article in the Linux Gazette ("Populating a Filesystem with Random Data"), and thought that people looking for a fairly simple example of boost might be interested: http://linuxgazette.net/153/pfeiffer.html Enjoy, ~ Scott

1 0

Newbie: Compiling multi filed programs
by Pete 06 Sep '08

06 Sep '08

Still trying to get a grip on Boost with some toy problems. I have a very simple program that multiplies two vectors. It worked as a single file program, but doesn't work as a multi file program. I'm finding it difficult to deal with impressive looking templates in the compiler error messages. This is on Linux, g++, Debian testing. 09-prob.h: ======= #pragma once #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/vector.hpp> #include <boost/numeric/ublas/io.hpp> using namespace boost::numeric::ublas; // n-vector outer product: |u><v| template<class E1, class E2> typename vector_matrix_binary_traits<E1, E2,scalar_multiplies<typename E1::value_type, typename E2::value_type> >::result_type mult_vector_vector( E1 bra, E2 ket ); 09-prob.cpp: ========= #include "09-prob.h" template<class E1, class E2> typename vector_matrix_binary_traits<E1, E2,scalar_multiplies<typename E1::value_type, typename E2::value_type> >::result_type mult_vector_vector( E1 bra, E2 ket ) { return outer_prod(bra, ket); } 09-driver.cpp: ========== #include "09-prob.h" using std::cout; using std::endl; int main( void ) { using boost::numeric::ublas::vector; // Use Boost's vector, not STL's. vector<double> u(3), v(3); for( unsigned i = 0; i < u.size(); ++i ) { u(i) = static_cast<double>(i); v(i) = u(i) * u(i); } // Test mult_vector_vector // cout << mult_vector_vector(u, v) << endl; return 0; } And the error message: g++ -g3 -Wall -Wextra -Waggregate-return -Wpointer-arith -Weffc++ -Wcast-qual -Wcast-align -Wmissing-declarations -Wredundant-decls -Wwrite-strings -Winline -c -o 09-driver.o 09-driver.cpp g++ 09-prob.o 09-driver.o -o 09-prob 09-driver.o: In function `main': /home/p/Baruch/numla/hw1/09-driver.cpp:29: undefined reference to `boost::numeric::ublas::vector_matrix_binary_traits<boost::numeric::ublas::vector<double, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::vector<double, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<boost::numeric::ublas::vector<double, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >::value_type, boost::numeric::ublas::vector<double, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >::value_type> >::result_type mult_vector_vector<boost::numeric::ublas::vector<double, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::vector<double, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > > >(boost::numeric::ublas::vector<double, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::vector<double, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >)' collect2: ld returned 1 exit status make: *** [09-prob] Error 1 Since 09-driver.o and 09-prob.o are being linked together, I'm guessing there's something wrong with the function signature? Can some kind soul give me a few hints on how to make this work? Thanks! ~

2 1

Problems building boost 1.36
by Steve Gilbert 06 Sep '08

06 Sep '08

Hi folks, I'm a systems administrator trying to build boost 1.36 for some of our engineers here who have been using version 1.35 for a while. The new version builds just fine (gcc 4.2.2 on RHEL3) without so much as an error. However, after the install we have far fewer libraries installed than we did with 1.35. The lib directory of the new version only contains 108 files as opposed to 423 in the previous version. Specifically, only the multi-threaded libs seems to get built with the new version...there are no single-threaded libraries at all. I can't find any mention of how to build these libraries in any of the documentation. Can anyone tell me if this is by design in this new version, or if I need to do anything special in order to get these to build? When building, we're not doing anything different than we did when building the previous version. Any help would be greatly appreciated. Thanks. -- Steve Gilbert Engineering Support NVIDIA Corporation ----------------------------------------------------------------------------------- This email message is for the sole use of the intended recipient(s) and may contain confidential 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. -----------------------------------------------------------------------------------

3 3

Crash when serializing binary object to XML archive
by Simon Fraser 06 Sep '08

06 Sep '08

Using Boost 1.36, I'm seeing a crash when serializing a 256K malloc block using binary_object to an XML archive, something like this: using namespace boost; serialization::binary_object dataObject = serialization::make_binary_object(dataBlock, dataSize); ar << serialization::make_nvp("data_contents", dataObject); The crash is in boost::archive::iterators::transform_width<char const*, 6, 8, char>::fill () template<class Base, int BitsOut, int BitsIn, class CharType> CharType transform_width<Base, BitsOut, BitsIn, CharType>::fill(){ CharType retval = 0; unsigned int missing_bits = BitsOut; for(;;){ unsigned int bcount; if(! m_bufferfull){ m_buffer = * this->base_reference(); <-------- crash here m_bufferfull = true; bcount = BitsIn; } else ... and the stack back up to my object serialization looks like: #0 0x0008f12e in boost::archive::iterators::transform_width<char const*, 6, 8, char>::fill () at transform_width.hpp:139 #1 0x0008f12e in boost::archive::iterators::transform_width<char const*, 6, 8, char>::dereference_impl () at transform_width.hpp:71 #2 0x0008f12e in boost::iterator_facade<boost::archive::iterators::transform_width<char const*, 6, 8, char>, char, boost::single_pass_traversal_tag, char, int>::operator* () at transform_width.hpp:78 #3 0x0008f12e in dereference<boost::archive::iterators::transform_width<const char*, 6, 8, char> > [inlined] () at transform_width.hpp:137 #4 0x0008f12e in boost::archive::iterators::transform_width<char const*, 6, 8, char>::dereference () at transform_width.hpp:635 #5 0x0008f12e in boost ::iterator_facade < boost ::transform_iterator <boost::archive::iterators::detail::from_6_bit<char>, boost::archive::iterators::transform_width<char const*, 6, 8, char>, boost::use_default, boost::use_default>, char, boost::single_pass_traversal_tag, char, int>::operator* () at transform_width.hpp:517 #6 0x0008f12e in dereference < boost ::transform_iterator <boost::archive::iterators::detail::from_6_bit<char>, boost::archive::iterators::transform_width<const char*, 6, 8, char>, boost::use_default, boost::use_default> > [inlined] () at transform_width.hpp:80 #7 0x0008f12e in boost ::transform_iterator <boost::archive::iterators::detail::from_6_bit<char>, boost::archive::iterators::transform_width<char const*, 6, 8, char>, boost::use_default, boost::use_default>::dereference () at transform_width.hpp:635 #8 0x0008f12e in boost ::archive ::iterators ::insert_linebreaks < boost ::archive ::iterators ::base64_from_binary<boost::archive::iterators::transform_width<char const*, 6, 8, char>, char>, 72, char const>::dereference () at insert_linebreaks.hpp:517 #9 0x0008f12e in dereference < boost ::archive ::iterators ::insert_linebreaks < boost ::archive ::iterators ::base64_from_binary<boost::archive::iterators::transform_width<const char*, 6, 8, char>, char>, 72, const char> > [inlined] () at insert_linebreaks.hpp:517 #10 0x0008f12e in boost ::iterator_facade < boost ::archive ::iterators ::insert_linebreaks < boost ::archive ::iterators ::base64_from_binary<boost::archive::iterators::transform_width<char const*, 6, 8, char>, char>, 72, char const>, char const, boost::single_pass_traversal_tag, char const, int>::operator* () at iterator_facade.hpp:635 #11 0x0008f12e in copy < boost ::archive ::iterators ::insert_linebreaks < boost ::archive ::iterators ::base64_from_binary<boost::archive::iterators::transform_width<const char*, 6, 8, char>, char>, 72, const char>, boost::archive::iterators::ostream_iterator<char> > [inlined] () at iterator_facade.hpp:270 #12 0x0008f12e in copy < boost ::archive ::iterators ::insert_linebreaks < boost ::archive ::iterators ::base64_from_binary<boost::archive::iterators::transform_width<const char*, 6, 8, char>, char>, 72, const char>, boost::archive::iterators::ostream_iterator<char> > [inlined] () at iterator_facade.hpp:270 #13 0x0008f12e in boost::archive::basic_text_oprimitive<std::ostream>::save_binary (this=0xbffff178, address=0x423000, count=262144) at libs/ serialization/src/basic_text_oprimitive.cpp:317 #14 0x000aaae4 in boost ::archive ::xml_oarchive_impl<boost::archive::xml_oarchive>::save_binary (this=0xbffff168, address=0x463000, count=4599808) at libs/ serialization/src/basic_text_oprimitive.cpp:317 #15 0x00054032 in boost ::serialization::binary_object::save<boost::archive::xml_oarchive> (this=0xbfffe730, ar=@0xbffff168) at libs/serialization/src/ basic_text_oprimitive.cpp:317 #16 0x00054059 in boost ::serialization::access::member_save<boost::archive::xml_oarchive, boost::serialization::binary_object const> (ar=@0xbffff168, t=@0xbfffe730, file_version=0) at libs/serialization/src/ basic_text_oprimitive.cpp:317 #17 0x00054081 in boost ::serialization::detail::member_saver<boost::archive::xml_oarchive, boost::serialization::binary_object>::invoke (ar=@0xbffff168, t=@0xbfffe730, file_version=0) at libs/serialization/src/ basic_text_oprimitive.cpp:317 #18 0x000540a9 in boost::serialization::split_member<boost::archive::xml_oarchive, boost::serialization::binary_object> (ar=@0xbffff168, t=@0xbfffe730, file_version=0) at libs/serialization/src/basic_text_oprimitive.cpp:317 #19 0x000540d1 in boost ::serialization ::binary_object::serialize<boost::archive::xml_oarchive> (this=0xbfffe730, ar=@0xbffff168, file_version=0) at libs/ serialization/src/basic_text_oprimitive.cpp:317 #20 0x000540f9 in boost::serialization::access::serialize<boost::archive::xml_oarchive, boost::serialization::binary_object> (ar=@0xbffff168, t=@0xbfffe730, file_version=0) at libs/serialization/src/basic_text_oprimitive.cpp:317 #21 0x00054121 in boost::serialization::serialize<boost::archive::xml_oarchive, boost::serialization::binary_object> (ar=@0xbffff168, t=@0xbfffe730, file_version=0) at libs/serialization/src/basic_text_oprimitive.cpp:317 #22 0x00054165 in boost::serialization::serialize_adl<boost::archive::xml_oarchive, boost::serialization::binary_object> (ar=@0xbffff168, t=@0xbfffe730, file_version=0) at libs/serialization/src/basic_text_oprimitive.cpp:317 #23 0x0005418e in boost ::archive::detail::save_non_pointer_type<boost::archive::xml_oarchive, boost::serialization::binary_object>::save_only::invoke (ar=@0xbffff168, t=@0xbfffe730) at libs/serialization/src/ basic_text_oprimitive.cpp:317 #24 0x000541ae in boost ::archive::detail::save_non_pointer_type<boost::archive::xml_oarchive, boost::serialization::binary_object>::invoke (ar=@0xbffff168, t=@0xbfffe730) at libs/serialization/src/basic_text_oprimitive.cpp:317 #25 0x000541ce in boost::archive::save<boost::archive::xml_oarchive, boost::serialization::binary_object> (ar=@0xbffff168, t=@0xbfffe730) at libs/serialization/src/basic_text_oprimitive.cpp:317 #26 0x000541f8 in boost ::archive ::detail ::common_oarchive < boost ::archive ::xml_oarchive>::save_override<boost::serialization::binary_object const> (this=0xbffff168, t=@0xbfffe730) at libs/serialization/src/ basic_text_oprimitive.cpp:317 #27 0x00054242 in boost ::archive ::basic_xml_oarchive < boost ::archive ::xml_oarchive>::save_override<boost::serialization::binary_object> (this=0xbffff168, t=@0xbfffe738) at libs/serialization/src/ basic_text_oprimitive.cpp:317 #28 0x0005428e in boost ::archive ::detail::interface_oarchive<boost::archive::xml_oarchive>::operator<< <boost::serialization::nvp<boost::serialization::binary_object> const> (this=0xbffff168, t=@0xbfffe738) at libs/serialization/src/ basic_text_oprimitive.cpp:317 #29 0x00054301 in MacTierra::Soup::save<boost::archive::xml_oarchive> (this=0x500880, ar=@0xbffff168, version=0) at libs/serialization/src/ basic_text_oprimitive.cpp:317 #30 0x0005432b in boost ::serialization::access::member_save<boost::archive::xml_oarchive, MacTierra::Soup const> (ar=@0xbffff168, t=@0x500880, file_version=0) at libs/serialization/src/basic_text_oprimitive.cpp:317 #31 0x00054353 in boost ::serialization::detail::member_saver<boost::archive::xml_oarchive, MacTierra::Soup>::invoke (ar=@0xbffff168, t=@0x500880, file_version=0) at libs/serialization/src/basic_text_oprimitive.cpp:317 #32 0x0005437b in boost::serialization::split_member<boost::archive::xml_oarchive, MacTierra::Soup> (ar=@0xbffff168, t=@0x500880, file_version=0) at libs/ serialization/src/basic_text_oprimitive.cpp:317 #33 0x000543a3 in MacTierra::Soup::serialize<boost::archive::xml_oarchive> (this=0x500880, ar=@0xbffff168, file_version=0) at libs/serialization/ src/basic_text_oprimitive.cpp:317 This is on Mac OS X, using gcc 4.0, compiling for intel. Has anyone seen this crash? Should I reduce and file a bug? Simon

2 4

Serialization problem while using class template with template function
by gatotkaca 06 Sep '08

06 Sep '08

Dear everyone, I need to serialize a class like this: template<typename typename1, typename typename2=double> class test_mean { public: test_mean(){} typename1 typename1_type; typename2 typename2_type; private: std::vector<double> m_parameters; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & boost::serialization::base_object<base_type>(*this); ar & m_parameters; } }; But I got trapped in the famous 'serialization trap' giving following error message (compilation is attempted using msvc 8.0 compiler): \boost_1_36_0\boost\iterator\iterator_adaptor.hpp(225) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' 1> with 1> [ 1> x=false 1> ] <cut> when I put struct parameters { double mean(const std::vector<double> &values) const { return ame::range::mean(std::make_pair(values.begin()+1, values.end()-1) | boost::adaptors::filtered(boost::math::isfinite<double>)); } }; in the typename1... Anyone can help me to fix this error? I attached the solution ( http://www.nabble.com/file/p19347724/jam_serialize.zip jam_serialize.zip ) along this message. Any guidance should be very helpful. Thank you!!! gatotkaca -- View this message in context: http://www.nabble.com/Serialization-problem-while-using-class-template-with… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[lexical_cast] bad_lexical_cast behavior?
by Hrvoje Prgeša 06 Sep '08

06 Sep '08

From the documentation: "If the conversion is unsuccessful, a bad_lexical_cast exception is thrown. " "Exception used to indicate runtime lexical_cast failure. " So the question is when will the conversion fail? Unit tests check for the cases between [min(), max()], but what about under/overflows (>max, <min)? Is it unspecified? It seems it is currently handled a bit inconsistent: #include <boost/test/unit_test.hpp> #include <boost/lexical_cast.hpp> #include <limits.h> using std::string; using std::numeric_limits; using boost::lexical_cast; string s; // warning: needs to be a part of a unit test //#define min max #define T short // add a digit! s = lexical_cast<string, T>(numeric_limits<T>::min()) + "0"; BOOST_CHECK_THROW(lexical_cast<T>(s), boost::exception); // throws s = lexical_cast<string, T>(numeric_limits<T>::min()) + "5"; BOOST_CHECK_THROW(lexical_cast<T>(s), boost::exception); // throws #define T boost::int64_t s = lexical_cast<string, T>(numeric_limits<T>::min()) + "0"; BOOST_CHECK_THROW(lexical_cast<T>(s), boost::exception); // NO throw!!! s = lexical_cast<string, T>(numeric_limits<T>::min()) + "5"; BOOST_CHECK_THROW(lexical_cast<T>(s), boost::exception); // throws The behavior is really weird. The docs don't mention what should happen. If I use max instead of min every test throws. Is there something in boost that can convert a *whole* string to it's integer representation and throw on under/overflows and errors? -- Hrvoje Prgeša

1 1

globals best-practices (avoiding multiple definitions)
by craigp 06 Sep '08

06 Sep '08

Hi - I'm trying to understand the best practice for handling globals (within a namespace), and in particular, avoiding multiple definitions (whether multiple "private" copies or collisions causing a linker error). For namespace globals, if I do something like this (in a header file): namespace log_categories { static log_t server(log_t::category("http.server.server")); } I'd guess that each translation unit (TU) would get its own copy of log_categories::server (or maybe some compilers give a multiple-definition link error, while others would just make multiple private copies?). OTOH, if I only declared the variable and put the definition in a c++ file, there would only be a single copy. For class static members, you cannot initialize the members "in-line" (unless it's an integral constant). One interesting "work-around" I saw in asio/error.hpp was this: namespace boost { ... static const boost::system::error_category& system_category = boost::asio::error::get_system_category(); ... This way, there might be multiple copies but they will all be references to the same underlying object. For the case of class template static members, I found this example in complex.hpp: namespace boost { namespace numeric { namespace detail { template<typename T> struct one_complex { static std::complex<T> const value; }; template<typename T> std::complex<T> const one_complex<T>::value = std::complex<T>(numeric::one<T>::value, numeric::one<T>::value); } ... Is it guaranteed that there will only be one instance of one_complex<T>::value for each T, even if this header file is included in multiple TU's? In this case it doesn't matter (it's a constant), but in other cases I need to ensure that it's a true singleton. Is there a good resource on best-practices for this? I've been bitten by the "multiple-definition" bug in several guises before (eg: in windows when there were multiple libraries linking to the same dll). I googled, and saw suggestions from, say, DEC (http://www.helsinki.fi/atk/unix/dec_manuals/cxx_6.0/cxx570_ug_004.html) which were to put template definitions in separate "template definition files." I take it complex.hpp is best-practice (standards-compatible, portable, etc - at least with certain options set on a particular vendor's compiler, say, automatic template instantiation)? Handling declarations vs definitions of template specializations seems even more fraught, but thankfully I don't have to worry about that for now (plus, it would certainly simplify things to always keep both template decls and defs in the same header file). thanks, --craig

1 0

More bimap issues
by Sean Farrow 06 Sep '08

06 Sep '08

Hi: I have the following code: struct VectorComp { bool operator()(const std::vector<std::bitset<6>>& lhs, const std::vector<std::bitset<6>>& rhs) const { return false; } }; typedef boost::bimaps::bimap<boost::bimaps::set_of<std::vector<std::bitset<6>>, VectorComp>, int> SignsList_Type; SignsList_Type SignsList; When compiling this code, I get c2676 errors from visual studio: 8 error C2676: binary '<' : 'const std::bitset<_Bits>' does not define this operator or a conversion to a type acceptable to the functional 143 I have BitsetComp which successfully compares two std::bitsets. How do I insert this so that my code works succesfully? Cheers Sean. __________ Information from ESET NOD32 Antivirus, version of virus signature database 3421 (20080906) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

1 0

Re: [Boost-users] [timer] eclapsed return zero
by gmail 06 Sep '08

06 Sep '08

1 0

Re: [Boost-users] [timer] eclapsed return zero
by raindog＠macrohmasheen.com 06 Sep '08

06 Sep '08

Perhaps your thread has been preempted during execution causing the delay. ------Original Message------ From: gmail Sender: boost-users-bounces(a)lists.boost.org To: boost-user-list ReplyTo: boost-users(a)lists.boost.org Sent: Sep 5, 2008 4:15 AM Subject: [Boost-users] [timer] eclapsed return zero Hello, I have used the timer class in my application. It works ok sometime but i think it dont work correctly. my code is: #include <iostream> #include "boost/timer.hpp" using namespace std; using namespace boost; int main() { int count=0; timer t; for(;count<1000000;++count); cout<<t.elapsed(); return 0; } and the output: 0.015 execute time :0.062s sometime the output is: 0 execute time :0.015s regards hechao _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users Sent from my Verizon Wireless BlackBerry

1 0

[string_algo] implementation functor for classification predicates doesn't implement result_of
by Adam Merz 05 Sep '08

05 Sep '08

The implementation functor for the String Algorithms library's classification predicates ( boost::algorithm::detail::is_classifiedF in boost/algorithm/string/detail/classification.hpp ) doesnt have a result_type typedef or a result struct. Consequently the classification predicates do not work with boost::bind. For a future release of Boost, please add 'typedef bool result_type;' into the struct.

1 0

Warning c4002 with boost_foreach
by Sean Farrow 05 Sep '08

05 Sep '08

Hi: Could somebody please tell me why I get a warning c4002 with the following boost::foreach declaration? BOOST_FOREACH( boost::bimaps::bimap<boost::bimaps::set_of<std::vector<std::bitset<6>>>, int>::left_reference CurrentSign, SignsList.left ) Should I use a typedef instead? Sean. __________ Information from ESET NOD32 Antivirus, version of virus signature database 3420 (20080905) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

2 3

[Thread]Deadlock using shared_mutex with unique_lock
by Stanislav Stoyanov 05 Sep '08

05 Sep '08

Hi everyone, I am trying to use shared_mutex with unique_lock but my program blocks. I am using boost 1.35. My compiler is MSVC 8.0.50727.762 and my OS is Windows 2000. Here is a minimal code to reproduce the problem: #include "boost/thread.hpp" #include "boost/thread/shared_mutex.hpp" #include "boost/bind.hpp" class Executor { public: void run() { boost::unique_lock<boost::shared_mutex> lock(theMutex); boost::thread::sleep(boost::get_system_time() + boost::posix_time::millisec(30)); } private: boost::shared_mutex theMutex; }; void main() { Executor ex; boost::thread_group group; for(int i=0; i<200; i++) { group.create_thread(boost::bind(&Executor::run, &ex)); } group.join_all(); } The program blocks during the call of group.join_all(). According to the Boost.Thread documentation, unique_lock<boost::shared_mutex> lock(theMutex) acquires exclusive ownership of theMutex. Therefore, I expect that the behaviour of boost::unique_lock<boost::shared_mutex> lock(theMutex); is the same as if a boost::mutex is used. Is my assumption correct or am I missing something? Thank you for any help you can provide, Stanislav

2 2

Linker error for thread methods
by Marc Riese 05 Sep '08

05 Sep '08

Hi, I'm trying to use the boost::thread library in an own dll with Visual Studio 2003. I'm using boost 1.36.0 and built it myself with bjam according to http://www.boost.org/doc/libs/1_36_0/more/getting_started/windows.html First I tested with a simple example, that I've found somewhere in the documentation: struct thread_alarm { thread_alarm(int secs) : m_secs(secs) { } void operator()() { boost::xtime xt; boost::xtime_get(&xt, boost::TIME_UTC); xt.sec += m_secs; // boost::this_thread::sleep(xt); } int m_secs; }; boost::thread thrd(thread_alarm(1)); This code runs and compiles fine. I can add a loop and some couts in the operator() for example and get the output parallel to my application. But when I uncomment the line boost::this_thread::sleep(xt);, I get the following linker error: error LNK2019: unresolved external symbol "bool __stdcall boost::this_thread::interruptible_wait(void *,struct boost::detail::timeout)" (?interruptible_wait@this_thread@boost@@YG_NPAXUtimeout@detail@2@@Z) referenced in function "void __stdcall boost::this_thread::interruptible_wait(class boost::posix_time::ptime const &)" (?interruptible_wait@this_thread@boost@@YGXABVptime@posix_time@2@@Z) The same occurs for other thread methods like yield(). I assume there's a problem with the calling convention, but using something other than __stdcall is not an option for me, since I have to comply with a given specification. I didn't find any information about calling conventions in the boost documentation. Is there a solution for this, or does the boost::thread library require the __cdecl calling convention? Regards, Marc

2 1

comparing objects using boost
by Reena Dass 05 Sep '08

05 Sep '08

Is there something available to compare objects using boost, similar to java.lang.Object Equals? Reena

3 2

newbie: debugging programs with boost
by p＠dirac.org 05 Sep '08

05 Sep '08

Hi all, I'm having trouble using GDB with my program that uses boost. In GDB (bra is a vector<double>): (gdb) print bra(j) Invalid data type for function to be called. I've compiled my program with -g3. How can I peek at boost datatypes? Thanks!

3 2

[timer] eclapsed return zero
by gmail 05 Sep '08

05 Sep '08

3 2

Purpose of identity template
by Annamalai Gurusami 05 Sep '08

05 Sep '08

Hi All, I have been going through the documentation of the multi_index_container in the Boot.MultiIndex library. In the example code provided I saw the use of the identity<> template. The relevant portion of the example code is reproduced here for convenience. http://www.boost.org/doc/libs/1_36_0/libs/multi_index/doc/index.html typedef multi_index_container< employee, indexed_by< // sort by employee::operator< ordered_unique<identity<employee> >, // sort by less<string> on name ordered_non_unique<member<employee,std::string,&employee::name> > > > employee_set; I am trying to understand what is the use of the identity<> template class. I also noticed the following in the documentation, "The predefined identity predicate can be used here as a key extractor; identity returns as the key the same object passed as argument." Is there any reason why the word object (instead of type) is used in that sentence? Also if the identity<> template evaluates to the type given as its argument, is there any benefit out of it? I am quite new to template meta programming and am trying to understand things. Any explanation would be very helpful. Rgds, anna -- Abusive Language on Internet http://missingrainbow.blogspot.com/2008/08/abusive-language-on-internet.html

3 4

Re: [Boost-users] [boost.serialization How does boost.serialization do with BOM
by Tan, Tom (Shanghai) 05 Sep '08

05 Sep '08

Thanks for the quick response. BOM is Windows specific. In my opinion, BOM is not really related to how you encode the text(thus not related to uft_codecvt_facet), but how you mark what your encoding is; so that any text editor can get a prompt of how to handle the text. It's implemented by inserting a few bytes to the very beginning of the file, which are never used in the chosen encoding of the following code. In the case of UTF-8, "EF BB BF" are used -- in the encoding table of UTF-8, "EF BB BF" should correspond to no character(I did not check, just out of guess). As it's related to general text files, not specific to xml files. basic_text_iarchive might be a better place to address the issue. I am thinking just detecting " EF BB BF " and discarding them if they exist would solve the issue. But I am not sure which method need to be overriden, can you please advise? Thanks, tom >This is news to me. >the wide character text/xml archives use UTF-8. They do this >by creating a stream with the uft_codecvt_facet. I used >this factet, it worked great and I moved on. So you're way >ahead of me on this. >This would probably be easy to address in the xml_iarchive code >or perhaps the xml_grammar - but, as I said, I don't know >anything about it. >Robert Ramey Tan, Tom (Shanghai) wrote: >> what is BOM? > >> Probably "Byte Order Mark", see > http://en.wikipedia.org/wiki/Byte-order_mark > > Yes, That's what I meant. > > I was testing the demo_xml_load.cpp and demo_xml_save.cpp available > in the boost.serialization example. > By simply opening demo_save.xml produced by demo_xml_save.exe with XML > copy editor(http://xml-copy-editor.sourceforge.net/) and saving it > back, demo_xml_load.exe would crash. I compared the two files with > Winmerge. It said it's identical. > > by studying the hex view, I later found it's because the 3-byte UTF-8 > BOM was inserted to the beginning of file. It would not change the > data, and in many cases was ignored by the text editors. > > I thinking that Boost.serialization should also handle this for all > text files including XML. > > Tom ------------------------------ _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users End of Boost-users Digest, Vol 1744, Issue 1 ********************************************

3 2

newbie: initializing a matrix
by Pete 05 Sep '08

05 Sep '08

The examples I've seen construct matrices using for loops, like: matrix<double> m (3, 3); for (unsigned i = 0; i < m.size1 (); ++ i) for (unsigned j = 0; j < m.size2 (); ++ j) m (i, j) = 3 * i + j; but that's inconvenient. I have a matrix in mind, say: double foo[3][3] = { { 1.0, 2.0, 3.0 }, { 2.0, 9.3, 8.1 }, { 3.0, 5.0, 2.3 } }; Is it possible to initialize a matrix<double> from a double[][]? How does one create a matrix without resorting to for loops or via n^2 assignments in the code? Thanks!

1 0

[program_options] Specific sections for options - lack of documentation
by Ken Johnson 05 Sep '08

05 Sep '08

I have absolutely loved the program_options library, and thank those who developed it so well and comprehensive. I love the config file parsing, but am confused on how to implement specific sections. The documentation speaks of parsing through sections of the config file on the following page. Library Overview --> Specific parsers --> Configuration file parser http://www.boost.org/doc/libs/1_36_0/doc/html/program_options/overview.html… However there is no discussion on how to setup some option that is part of a specific section. How can I do this and how will it affect the command line options? I noticed that boost_1_35_0/boost/program_options/detail/config_file.hpp talks about this functionality a little more. I appreciate any help with this, and would especially enjoy code snippets that illustrate creating options that belong to a section.

1 0

[lambda] Making my expression less complicated
by Peter Barker 05 Sep '08

05 Sep '08

Hello, In my test program below, I have a container of columns and want to output the column headers into a string separated by a tab. The lambda expression is looking fairly complicated so I wonder if it could be made simpler or if there's any other algorithm I should've used to put a separator between the elements? Regards, Pete #include <algorithm> #include <iostream> #include <string> #include <vector> #include <boost/lambda/bind.hpp> #include <boost/lambda/lambda.hpp> #include <boost/lambda/if.hpp> class Column { public: explicit Column(const std::string& str) : str_(str) {} const std::string& getColumnText() const {return str_;} private: std::string str_; }; int main() { using namespace boost::lambda; using boost::lambda::_1; std::vector<Column> cols; cols.push_back(Column("Fred")); cols.push_back(Column("Jim")); cols.push_back(Column("Harry")); const std::size_t numCols = static_cast<size_t>(cols.size()); const char fieldSeparator = '\t'; std::string outputText; std::size_t i = 1; var_type<std::size_t>::type iV(var(i)); std::for_each(cols.begin(),cols.end(), ( var(outputText) += bind(&Column::getColumnText,_1), if_then(iV < constant(numCols),var(outputText) += constant(fieldSeparator)), ++iV ) ); std::cout << '[' << outputText << ']'; }

2 2

graph all pair shortest path problem
by Nicolas Heine 05 Sep '08

05 Sep '08

Hi *, I have a question about the All Pair Shortest Path (Johnson) algorithm. Here is my code: #include <boost/config.hpp> #include <fstream> #include <iostream> #include <iomanip> #include <vector> #include <boost/property_map.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/johnson_all_pairs_shortest.hpp> int main() { using namespace boost; typedef property<vertex_index_t, int, property<vertex_name_t, std::string> > VertexProperty; typedef property<edge_weight_t, int, property<edge_weight2_t, int> > EdgeProperty; typedef property<graph_name_t, std::string> GraphProperty; //adjacency_list<OutEdgeList, VertexList, Directed, // VertexProperties, EdgeProperties, // GraphProperties, EdgeList> typedef adjacency_list<listS, listS, undirectedS, VertexProperty, EdgeProperty, GraphProperty> Graph; boost::graph_traits<Graph>::vertex_descriptor u, v, w, first, second; int N = 10; Graph g; first = add_vertex(g); put(vertex_index, g, first, num_vertices(g)); second = add_vertex(g); put(vertex_index, g, second, num_vertices(g)); add_edge(first, second, g); u = first; v = second; for (int i = 2; i < N; i++) { w = add_vertex(g); put(vertex_index, g, w, i + 1); add_edge(u, w, g); add_edge(v, w, g); u = v; v = w; } add_edge(u, first, g); add_edge(v, second, g), add_edge(v, first, g); std::cout << "Finished to build Graph" << std::endl; //set weights to 1 typedef graph_traits<Graph>::edge_iterator EdgeIterator; EdgeIterator ei, edge_end; for ( boost::tie(ei, edge_end) = edges(g); ei != edge_end; ++ei){ put(edge_weight, g, *ei, 1); } std::vector<int> d(N, (std::numeric_limits<int>::max)()); int D[N][N]; johnson_all_pairs_shortest_paths(g, D, distance_map(&d[0])); std::cout << " "; for (int k = 0; k < N; ++k) std::cout << std::setw(5) << k; std::cout << std::endl; for (int i = 0; i < N; ++i) { std::cout << i << " -> "; for (int j = 0; j < N; ++j) { if (D[i][j] > 20 || D[i][j] < -20) std::cout << std::setw(5) << "inf"; else std::cout << std::setw(5) << D[i][j]; } std::cout << std::endl; } return 0; } When I compile I get the error: ../src/BGLTest.cpp: In function 'int main()': ../src/BGLTest.cpp:73: error: no matching function for call to 'johnson_all_pairs_shortest_paths(main()::Graph&, int [(((long unsigned int)(((int)N) - 1)) + 1u)][(((long unsigned int)(((int)N) - 1)) + 1u)], boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>)' What does that mean? I want to use the Johnson algorithm with a listS = Vertexlist and listS = Egelist. With listS, vecS as in your example it works fine. What can I do? Thanks in advance, Nico

2 1

Closures emulation made easy
by Alexander Gutenev 05 Sep '08

05 Sep '08

Hi. Here's a trick. Use the idea of Boost.ScopeExit. But don't implement capturing of variables like in Boost.ScopeExit - use Boost.Bind which does it. Have easy to write and debug closure body - don't spend too much time on making Boost.Lamda work. And a compact implementation with very small proprocessor overhead, compared to Boost.ScopeExit. // Implementation #define CONCATENATE_DIRECT(s1, s2) s1##s2 #define CONCATENATE(s1, s2) CONCATENATE_DIRECT(s1, s2) #define ANONYMOUS_VARIABLE(str) CONCATENATE(str, __LINE__) #define LOCAL(R, P) \ typedef struct ANONYMOUS_VARIABLE(xg1) { \ typedef R(*F) P; static R body P { #define LOCAL_END(name) \ } } ANONYMOUS_VARIABLE(xg2); \ const ANONYMOUS_VARIABLE(xg2)::F name \ = ANONYMOUS_VARIABLE(xg2)::body; // Example #include <algorithm> int main() { LOCAL(bool, (int i, int j, bool reverse)) return reverse ? (j < i) : (i < j); LOCAL_END(myFcn) int a[] = { 2, 5, 1, 6 }; std::sort( a, a + sizeof(a)/sizeof(a[0]), boost::bind(myFcn, _1, _2, true)); }

2 2

Cannot statically link to Boost.Filesystem
by Graham Bull 05 Sep '08

05 Sep '08

Hi all, I've got this really simple C++ program that's using the Boost.Filesystem library: #include <iostream> #include <boost/filesystem.hpp> int main() { boost::filesystem::path pathname = "/usr/local/bin"; std::cout << pathname.string() << std::endl; return 0; } It compiles fine, and I can get it to link to use the shared object: g++ -I/usr/local/include/boost-1_35 -o test test.cpp -lboost_filesystem-gcc42-mt-1_35 But I want to statically link instead. I've tried this and other similar combinations: g++ -I/usr/local/include/boost-1_35 -o test test.cpp -lboost_filesystem-gcc42-mt-s-1_35 -static -static-libgcc and I'm always getting these linker errors: /tmp/ccoiFv2v.o: In function `__static_initialization_and_destruction_0(int, int)': test.cpp:(.text+0x1dc): undefined reference to `boost::system::get_system_category()' test.cpp:(.text+0x1e6): undefined reference to `boost::system::get_posix_category()' test.cpp:(.text+0x1f0): undefined reference to `boost::system::get_posix_category()' test.cpp:(.text+0x1fa): undefined reference to `boost::system::get_system_category()' collect2: ld returned 1 exit status I've built Boost in full and have got these Boost.Filesystem libraries in /usr/local/lib: libboost_filesystem-gcc42-1_35.a libboost_filesystem-gcc42-1_35.so libboost_filesystem-gcc42-1_35.so.1.35.0 libboost_filesystem-gcc42.a libboost_filesystem-gcc42-d-1_35.a libboost_filesystem-gcc42-d-1_35.so libboost_filesystem-gcc42-d-1_35.so.1.35.0 libboost_filesystem-gcc42-d.a libboost_filesystem-gcc42-d.so libboost_filesystem-gcc42-mt-1_35.a libboost_filesystem-gcc42-mt-1_35.so libboost_filesystem-gcc42-mt-1_35.so.1.35.0 libboost_filesystem-gcc42-mt.a libboost_filesystem-gcc42-mt-d-1_35.a libboost_filesystem-gcc42-mt-d-1_35.so libboost_filesystem-gcc42-mt-d-1_35.so.1.35.0 libboost_filesystem-gcc42-mt-d.a libboost_filesystem-gcc42-mt-d.so libboost_filesystem-gcc42-mt-s-1_35.a libboost_filesystem-gcc42-mt-s.a libboost_filesystem-gcc42-mt-sd-1_35.a libboost_filesystem-gcc42-mt-sd.a libboost_filesystem-gcc42-mt.so libboost_filesystem-gcc42-s-1_35.a libboost_filesystem-gcc42-s.a libboost_filesystem-gcc42-sd-1_35.a libboost_filesystem-gcc42-sd.a libboost_filesystem-gcc42.so I hope someone can help me because I just can't see what I'm doing wrong! Graham

4 9

[review] FSM Library review result
by Martin Vuille 05 Sep '08

05 Sep '08

This is a brief report of the results of the review of Andrey Semashev's Finite State Machines (FSM) library. I want to do justice to the discussions that took place, and will follow-up with a complete summary next week. In spite of a good amount of discussion and an extension of the review period, the number of reviews was smaller than I had hoped for. Nonetheless, I believe that the library received an adequate review and, based on the review comments and other discussions, the FSM library cannot be accepted into Boost at this time. A total of four reviews were submitted, as follows: Andrea Carbone: YES Phil Endecott: NO Jeff Flinn: NO Chris Knight: NO Darryl Green also submitted a mini-review, which did not include an explicit yes or no vote, but expressed doubt about whether the library should be accepted. On the positive side, several people noted that the goals of the library (simplicity and greater performance than Boost.StateCharts) were valid and that such a library was needed in some applications. I personally support this view. I would like to thank Andrey for his efforts in developing the library. I would like to encourage him to pursue the discussions that were begun during this review and perhaps try again with an updated submission. MV

1 0

Re: [Boost-users] Format local time in W3C format (YYYY-MM-DDThh:mm:ss.sTZD) without providing the time zone myself?
by Paul Bormans 05 Sep '08

05 Sep '08

Does anyone have hints/tips for me to get properly formatted time zone (%Q) for local time "without" providing the time zone myself? _________________________________________________________________ Express yourself instantly with MSN Messenger! Download today it's FREE! http://messenger.msn.click-url.com/go/onm00200471ave/direct/01/

1 0

Boost.Multiindex namespace problem
by Axel 05 Sep '08

05 Sep '08

Hello I m using boost 1.35 and g++ v4.1.3 20070929 (Ubuntu 4.1.2-16ubuntu2) on ubuntu gutsy, I have a problem when using multindex namespaces. This compiles without problem : (this is in a class) using namespace boost::multi_index ; class myClass { public: struct foo { public: int getLocalDataId() ; } ; typedef hashed_unique<boost::multi_index::mem_fun<foo, int, &foo::getLocalDataId> > myIndex ; }; But the same code without the prefix "boost::multi_index" doesnt compile : typedef hashed_unique<mem_fun<foo, int, &foo::getLocalDataId> > myIndex ; I can obviously add the namespace before mem_fun, I just wonder why this compile error occurs. Thanks in advance.

2 1

[Multi-index container] Why insertions into my Multi-index container are so slow?
by Angel Sunye 05 Sep '08

05 Sep '08

Hi everyone, I'm using a multi_index_container with 1 composite ordered_unique index and 1 hashed unique index. It have passed the unit tests perfectly, but when I have made the performance test, insertions into multi-index container went much slower than with a manual management. That grows exponentially with the number of insertions: 1000 insertions take 1.5 seconds, almost twice that without Multi-index library 10000 insertions take 160 seconds, thousands of times that without Multi-index library Below you can see my multi_index_container definition, and the insert calls that i have used. -----------------BEGIN CODE----------------- // TElementRec is a struct with its contructors // // Tags struct TMainIndexTag{}; struct TKeyIndexTag{}; typedef multi_index_container< TElementRec, indexed_by< ordered_unique< tag<TMainIndexTag>, composite_key< TElementRec, BOOST_MULTI_INDEX_MEMBER(TElementRec,PRIORITY_LEVEL,priority), BOOST_MULTI_INDEX_MEMBER(TElementRec,int,inputTimestamp), BOOST_MULTI_INDEX_MEMBER(TElementRec,TKey,key) > >, hashed_unique< tag<TKeyIndexTag>, BOOST_MULTI_INDEX_MEMBER(TElementRec,TKey,key) > > > TElementsMIContainer; // Using... TElementsMIContainer elMIContainer; elMIContainer.insert( elMIContainer.template get<TMainIndexTag>().end(), TElementRec( priority, key, content, inputTimestamp, 0 )); elMIContainer.insert( TElementRec( priority, key, content, inputTimestamp, 0 )); -----------------END CODE----------------- Is this boost implementation correct? Thanks a lot for your time Angel Suñe Marti

3 6

boost::logging rolling files prefix
by Alejandro Martinez 05 Sep '08

05 Sep '08

Im trying to use rolling files, but im having a hard time formatting the names that the files should have. Like putting the date/time in it. The documentation has no examples and wasn't able to google it. Thanks for your time.

2 2

[boost:regex]compiling error when building boost:regex with ICU
by gj_uestc 05 Sep '08

05 Sep '08

hi, while I tried to build all binaries of boost_1_35_0 with ICU, I only got 2 :libboost_regex-iw-mt-gd-1_35.lib and libboost_regex-iw-mt 1_35.lib,with the rest 6 are missing. I activated bjam like this: bjam --toolset=intel -with regex -sICU_PATH=/cygdrive/c/home/gejuan/ICU/icu4c-3_8_1-src/icu/source --build-type=complete -sHAVE_ICU=1 stage.and I got error message: Skipping build of: ./stage <build>no in common properties Skipping build of: ./stage <build>no in common properties Skipping build of: ./stage <build>no in common properties Skipping build of: ./stage <build>no in common properties Skipping build of: libs/regex/build/icucore <build>no in common properties Skipping build of: libs/regex/build/icuin <build>no in common properties Skipping build of: libs/regex/build/icudata <build>no in common properties C:/home/gejuan/boost_1_35_0/tools/build/v2/kernel\class.jam:93: in new *** argument error * rule object(searched-lib-target)(a)665.__init__ ( name : project : shared ? : search * : action ) * called with: ( icudata icui18n icuuc : object(project-target)@90 : true : libs/regex/build : object(null-action)@664 : : : : ) * extra argument icui18n C:/home/gejuan/boost_1_35_0/tools/build/v2/tools\builtin.jam:349:see definition of rule '__init__' being called C:/home/gejuan/boost_1_35_0/tools/build/v2/tools\builtin.jam:592: in object(searched-lib-generator)(a)6.run C:/home/gejuan/boost_1_35_0/tools/build/v2/build\generators.jam:859: in try-one-generator-really C:/home/gejuan/boost_1_35_0/tools/build/v2/build\generators.jam:920: in try-one-generator C:/home/gejuan/boost_1_35_0/tools/build/v2/build\generators.jam:1131: in construct-really what is the problem here?Did I miss something?

3 4

[filesystem] Path and UNCs
by Peter Barker 05 Sep '08

05 Sep '08

Hello, I'm using boost::filesystem in my application. It appears to work ok with UNC paths* but until now hadn't considered if there might be any problems lurking as they're quite different to "C:\something" or "/usr/something"? I had a look in the documentation but could not see UNCs mentioned. Regards, Pete

1 0

Comparing a bimap::vector_of with a vector
by Sean Farrow 05 Sep '08

05 Sep '08

Hi: I have the following defines: typedef boost::bimaps::bimap<boost::bimaps::vector_of<std::bitset<6>>, int> SignsList_type; SignsList_type SignsList; I need to compare each std::bitset in the left-hand side of the map i.e in the vector with an std::vector I am fillingin a boost::foreach loop. What is the best way of doing this? Any help apreciated. Sean. __________ Information from ESET NOD32 Antivirus, version of virus signature database 3417 (20080905) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

1 0

Re: [Boost-users] How does boost.serialization do with BOM in text/xmlfiles
by Tan, Tom (Shanghai) 05 Sep '08

05 Sep '08

> what is BOM? >Probably "Byte Order Mark", see http://en.wikipedia.org/wiki/Byte-order_mark Yes, That's what I meant. I was testing the demo_xml_load.cpp and demo_xml_save.cpp available in the boost.serialization example. By simply opening demo_save.xml produced by demo_xml_save.exe with XML copy editor(http://xml-copy-editor.sourceforge.net/) and saving it back, demo_xml_load.exe would crash. I compared the two files with Winmerge. It said it's identical. by studying the hex view, I later found it's because the 3-byte UTF-8 BOM was inserted to the beginning of file. It would not change the data, and in many cases was ignored by the text editors. I thinking that Boost.serialization should also handle this for all text files including XML. Tom

2 1

mutex locking!
by Wesley Khandavalli 05 Sep '08

05 Sep '08

I want to explicitly lock and unlock mutex. Is it possible and what are the methods? -- Wesley K

2 4

Boost Training - Oct/Nov
by Kristin Menefee 04 Sep '08

04 Sep '08

OCI is currently accepting registrations for two upcoming Boost Programming using C++ open enrollment training events. Here are the details: Title: Boost <http://www.ociweb.com/education/services/descrip/escp08-01.html> Programming using C++ Event #1 - October 27-November 19 (M/W eves) - 5:30pm-8:30pm Event #2 - November 10-13 (M-Th) - 9am-4:30pm Location: St. Louis, MO Please contact me for additional information for these open enrollment events or private onsite events. Best regards, Kristin Menefee Education Services Object Computing, Inc. (OCI) 314-579-0066 x203 tel www.ociweb.com/education <http://www.youtube.com/user/OCItv> Check out our new YouTube Channel!

1 0

[xpressive] Using placeholder in semantic actions
by Symons, Greg - SSD 04 Sep '08

04 Sep '08

Hi! I'm trying to use xpressive with semantic actions that use a placeholder, but I can't quite see the right way to do it. Here's my code: namespace grammar { using namespace boost::xpressive; struct ParsedUri { std::string hostname; std::string modelPath; std::string diagramPath; }; static placeholder<ParsedUri> result; static const mark_tag model(1), diagram(2), host(1); static const char pathSep = '/'; static sregex unreserved = set [ alpha | digit | '-' | '.' | '_' | '~' | ' ' | ':' | '$' ]; static sregex pctEncoded = as_xpr('%') >> xdigit >> xdigit; static sregex pathElem = *(unreserved | pctEncoded); static sregex path = pathElem | *(pathElem >> pathSep >> by_ref(path)); static sregex drive = alpha >> ':'; static sregex quad = repeat<1,3>(digit) [ check(as<int>(_) >= 1 && as<int>(_) <= 255) ]; static sregex ipv4 = repeat<3>(quad >> '.') >> quad; static sregex hostname = !(ipv4 | pathElem); static sregex pathNoHost = pathSep >> drive >> pathSep >> path; static sregex pathHost = (host= hostname) >> pathSep >> path [ result.hostname = host ]; static sregex modelPath = pathNoHost | pathHost static sregex uri = "rosert://" >> (model= modelPath) >> '?' >> (diagram= path) [ result.modelPath = model, result.diagramPath = diagram ]; } What happens is that when I compile the code, I get a compile error for the lines accessing the placeholder saying that the various members of the structure are not members of placeholder<T>, which looking at regex_actions.hpp seems to make sense to me. But in the example using placeholder<T> in the docs, it looks like you can use it in the semantic action as if it were a T. Somewhere I'm misunderstanding something, and I don't know what. Can anyone help me here? -- Gregory Symons Software Engineer ITT Space Systems Division greg.symons(a)itt.com (260) 451-6402 This e-mail and any files transmitted with it may be proprietary and are intended solely for the use of the individual or entity to whom they are addressed. If you have received this e-mail in error please notify the sender. Please note that any views or opinions presented in this e-mail are solely those of the author and do not necessarily represent those of ITT Corporation. The recipient should check this e-mail and any attachments for the presence of viruses. ITT accepts no liability for any damage caused by any virus transmitted by this e-mail.

2 2

MS VC++ wchar_t type build Q
by Scott Morgan 04 Sep '08

04 Sep '08

Is there an option to build the Boost libs with or without the wchar_t treated as built in (that whole /Zc:wchar_t mess MS dropped on us) Scott

2 3

Re: [Boost-users] Subsets of boost under version control (Angel Tsankov)
by Rodolfo Federico Gamarra 04 Sep '08

04 Sep '08

Hi Angel. I read your question and tought a little about it. I have some doubts about what exactly you're trying to do. >therefore it would be a good idea not to version control all of boost together with such projects. Do you want to version-control Boost's sources within the Boost client project's repository? Since, for that project which uses Boost, Boost it's an external dependency (and you're not touching Boost's sources) I believe that the general recommendation is not to version control those sources. But, it is sometimes helpful to have in the same repository the dependencies so as to check-put the whole thing easily. What do you mean by repository? The whole one or just particular SVN project within a given repository. You may create independent subsets as different SVN projects, within a same repository. The future additions would be new, independent, projects. Then, each one checks out the project that he/she needs. >Can someone recommend a way to achieve this with subversion's branches-tags-trunk policy? Trying to use tags/branchs/trunk, it seems that the concept of tag is closer to what you may need. In general, a tag is used to take a snapshot of the trunk and give a name to it. But it could be used in more ways. Take a look at this http://svnbook.red-bean.com/nightly/en/svn-book.html#svn.branchmerge.tags.m… With this, you can make-up in your local workspace whatever a subset you desire, and then upload it to the repository with any name you want to use to identify it. I hope you find these comments useful. Rodolfo. -- Rodolfo Federico Gamarra

1 0

How does boost.serialization do with BOM in text/xml files
by Tan, Tom (Shanghai) 04 Sep '08

04 Sep '08

I am think of using boost.serialization to replace CMarkup(http://www.firstobject.com/) as handle my XML config files. By playing with the examples coming with Boost, I found boost.serialization - does not handle BOM of UTF-8 files. - does not ignore <!-- ... > comments. Is there any workaround to this? Thanks.

3 2

[bjam] Presence of Mac OS X 10.6 SDK prevents boost 1.36 build
by Allen Cronce 04 Sep '08

04 Sep '08

Hi all, I have the Mac OS X 10.6 (Snow Leopard) SDK on my dev system. The presence of this SDK prevents boost 1.36 from building: --snip-- ./tools/jam/src/bin.macosxx86/bjam debug release --toolset=darwin -- architecture=combined --layout=system threading=multi address-model=32 link=shared,static macosx-version=10.4 --prefix=../1_36_0_install -- exec-prefix=../1_36_0_install install boost_1_36_0/tools/build/v2/build/feature.jam:466: in feature.validate- value-string from module feature error: "10.6" is not a known value of feature <macosx-version> error: legal values: "10.5" "10.4" "10.3" "10.2" "10.1" "iphone-2.0" "iphone-1.x" "iphonesim-2.0" boost_1_36_0/tools/build/v2/build/property.jam:276: in validate1 from module property boost_1_36_0/tools/build/v2/build/property.jam:301: in validate from module property boost_1_36_0/tools/build/v2/build/property.jam:310: in property.validate-property-sets from module property boost_1_36_0/tools/build/v2/build/toolset.jam:151: in flags from module toolset boost_1_36_0/tools/build/v2/tools/darwin.jam:227: in init-available- sdk-versions from module darwin boost_1_36_0/tools/build/v2/tools/darwin.jam:178: in darwin.init from module darwin boost_1_36_0/tools/build/v2/build/toolset.jam:38: in toolset.using from module toolset boost_1_36_0/tools/build/v2/build-system.jam:434: in process-explicit- toolset-requests from module build-system boost_1_36_0/tools/build/v2/build-system.jam:513: in load from module build-system boost_1_36_0/tools/build/v2/kernel/modules.jam:281: in import from module modules boost_1_36_0/tools/build/v2/kernel/bootstrap.jam:128: in boost-build from module boost_1_36_0/boost-build.jam:16: in module scope from module --snip-- The workaround was for me to hide the SDK, run configure again, then build. I still can't build successfully, due to an unrelated issue. But I'll post that separately in order to try and keep things clear. Snow Leopard will be here before you know it, so at some point the boost build system should be updated to know about 10.6. For that matter, maybe a new SDK would just generate a warning, not a hard error. Best, -- Allen Cronce

2 2

Subsets of boost under version control
by Angel Tsankov 04 Sep '08

04 Sep '08

Hello! It should come as no surprise that some projects use only small subsets of boost and therefore it would be a good idea not to version control all of boost together with such projects. Can someone recommend a way to achieve this with subversion's branches-tags-trunk policy? The recommendation should allow for future additions of new subsets of boost to the same repository. Regards, Angel Tsankov

1 0

Boost and the .net framework
by Richard Miller 04 Sep '08

04 Sep '08

Can anyone tell me, are there issues using Boost with the .NET framework and managed C++? How would shared_ptr etc work? Are there issues with the collection classes?

3 2

Re: [Boost-users] Serializing a char *
by Basilevs 04 Sep '08

04 Sep '08

On Sat, Aug 30, 2008 at 11:12 AM, Robert Ramey <ramey(a)rrsd.com> wrote: > I'm suspecting that there is a confusion about how to seriailzation a > pointer to > a null terminated string. It's natural to want to do something like > > char *p; > ... > p = "jsdkfjads" > ... > ar & p; > > because the library syntax encourages one to think that way. > > But in this case, one would want > > save(... > int i = strlen(p); > ar << i; > ar << binary_object(i, p); > } > > load(... > int i; > ar >> i; > ar >> binary_object(i,p); > } > How do we deal with the trailing null? In this example trailing null is not saved, and it is a good thing, but shouldn't we add it after loading?

3 5

Deployment of boost DLLs
by Tan, Tom (Shanghai) 04 Sep '08

04 Sep '08

- there are two versions of ms vc runtime, one with sp1 and the other without. Please make sure you are using the same version 1)to build boost, 2) to build your project 3)most importantly, to be distributed to the target machine. Please check the build number to check it. You may want to check the manifest file to see the runtime version your project is dependent on. - the best way to create a setup project using visual studio. It'll detect and wrap the correct runtime for you. -----Original Message----- Subject: [Boost-users] Deployment of boost DLLs Hi, I haven't been able to find much information on this, I hope someone can help me: I've only recently started using boost. I finally finished writing an application on my development machine. - Windows XP with Service pack 2 - Application developed in native C++ using MS VS2005 - Boost version 1.35, multithreaded, dynamically linked, installed boost using the installer from boost computing I then tried to deploy a release version of the application and the ms vc runtime redistributables to a test machine running a clean XP install and my application failed to run. The test machine also has XP Service Pack 2 installed. Strangely only the signal and the system DLL give the following error message: Error: The Side-by-Side configuration information for "c:\rtvc\bin\BOOST_SYSTEM-VC80-MT-1_35.DLL" contains errors. This application has failed to start because the application configuration is incorrect. Reinstalling the application may fix this problem (14001). The thread, date time, etc dlls are fine. However the signal and system dll are fine on my development machine. Has anyone encountered similar problems? Thanks, Ralf *********************

1 0

[review] Dataflow Library
by David Abrahams 04 Sep '08

04 Sep '08

I was reading other review commentary when it occurred to me that Boost.Accumulators is also implementing a dataflow system. I would like to know if Stjepan considered Boost.Accumulators and whether his library could build on some of that work. Thanks, -- Dave Abrahams BoostPro Computing http://www.boostpro.com

1 0

library accumulator, example sum_accumulator
by Kim Kuen Tang 03 Sep '08

03 Sep '08

Hi all, i ' ve written a piece of code to get the class sum_accumulator working which is described in the user's guide http://boost-sandbox.sourceforge.net/libs/accumulators/doc/html/accumulator…. The function result must be provided with a struct dont_care. And the constructor of dont_care must be provided with a value to get an instanciation. In my opinion a default constructor taking no arguments for the struct dont_care must exists so the user can write code like dont_care(). To get the example working i must write code like sumacc.result(*dont_care(0.0)*) to get the result from my accumulator. And this is a little bit unnecessary. with regards, Kim Tang the code below is tested with visual studio 2008. #include <iostream> #include <boost/accumulators/framework/accumulator_base.hpp> #include <boost/accumulators/framework/parameters/sample.hpp> using namespace boost::accumulators; namespace boost { // Putting your accumulators in the namespace accumulators { // impl namespace has some namespace impl { // advantages. See below. template<typename Sample> struct sum_accumulator // All accumulators should inherit from : accumulator_base // accumulator_base. { typedef Sample result_type; // The type returned by result() below. template<typename Args> // The constructor takes an argument pack. sum_accumulator(Args const & args) : sum(args[sample | Sample()]) // Maybe there is an initial value in the { // argument pack. ('sample' is defined in } // sample.hpp, included above.) template<typename Args> // The accumulate function is the function void operator ()(Args const & args) // call operator, and it also accepts an { // argument pack. this->sum += args[sample]; } result_type result(dont_care) const // The result function will also be passed { // an argument pack, but we don't use it here, return this->sum; // so we use "dont_care" as the argument type. } private: Sample sum; }; }}} int main() { try { boost::accumulators::impl::sum_accumulator<double> sumacc(sample=0.0); sumacc(sample=1.2); std::cout<<sumacc.result(*dont_care(0.0)*)<<"\n"; return EXIT_SUCCESS; } catch(std::exception& e) { std::cout<<"Errors with message: "<<e.what()<<"\n"; return EXIT_FAILURE; } catch(...) { std::cout<<"Unknown Errors \n"; return EXIT_FAILURE; } }

2 3

[Iostreams] Can't open mapped_file data file on Windows
by Allen Cronce 03 Sep '08

03 Sep '08

Hi all, I'm trying to use mapped_file from the Boost 1.35.0 Iostreams library to open a data file for reading and writing. My code works fine under Mac OS X, which is posix, of course. But under Windows (built with VS2005), I get an access error. Here's a code sample that works on Mac OS X and fails under Windows: --snip-- /** Test boost iostream mapped_file. */ static int BoostMappedFileTest(void) { int result = 0; std::cout << "\nRunning BoostMappedFileTest..." << std::endl; // Initialize our test directory fs::path testDirPath( "BoostMappedFileTest" ); create_directory(testDirPath); // Initialize a test file buffer with some data const size_t kTestFileSize = 4096; boost::scoped_array<char> fileBuffer( new char[kTestFileSize] ); char* pCur = fileBuffer.get(); char curChar = 0; for( size_t i = 0; i < kTestFileSize; ++i ) { *pCur++ = curChar++; } // Write the data to a test file. Be sure to explicitly close it. fs::path testFilePath( testDirPath / "test_mapped_file" ); boost::filesystem::ofstream testFile( testFilePath, ios::trunc | ios::binary ); testFile.write(fileBuffer.get(), kTestFileSize); testFile.close(); // Try and open the test file as a memory mapped file. string testFilePathStr = testFilePath.file_string(); mapped_file mappedFile(testFilePathStr); // We never get here under Windows with boost 1.35.0. The file fails to // open with an access error, although it throws with a more obscure error // due to a clean up bug. // Compare the mapped file data to our original buffer const char* mmConstData = mappedFile.const_data(); bool compareSucceeded = (0 == memcmp(fileBuffer.get(), mmConstData, kTestFileSize)); if (!compareSucceeded) { throw runtime_error("The boost memory mapped file data doesn't match our buffer!"); } return result; } --snip-- The problem seems to come from passing GENERIC_ALL as the "dwDesiredAccess" parameter to the CreateFileA call. If I change the implementation to pass GENERIC_READ | GENERIC_WRITE, then it works in my test scenario. Please note that I haven't tried pointing the current code at an actual executable to see if it works with GENERIC_ALL. If you assume a strict interpretation of the mapped_file API, the mode of BOOST_IOS::in would map to GENERIC_READ in the Windows world, and BOOST_IOS::out would map to GENERIC_WRITE. There is no corresponding "execute" flag that I can see in this API. Since I'm only interested in mapping data files, I could certainly modify the boost 1.35.0 sources so that only GENERIC_READ and GENERIC_WRITE are passed to the Windows API depending on what BOOST_IOS mode was specified. But I'm not sure of what dependancies may exist between the mapped_file implementation and other boost libraries. The interprocess library, for example, hasn't yet fallen under my sphere of research ;-) Could someone please advise me as to the best course of action that will allow me to open memory mapped data files on Windows without adversely impacting the rest of the boost libraries? BTW, there's a secondary problem where if an error happens at CreateFileA, the clean up code fails and throws an invalid handle exception. This is because the mapped_handle_ member variable is initialized to NULL instead of INVALID_HANDLE_VALUE (which is what the clean up test is looking for). After code inspection of the svn trunk, I *think* this secondary issue has already been resolved. However, the latest sources look like they're still using GENERIC_ALL as the access parameter to the CreateFile, so my reported problem is still relevant and needs to be resolved. Thanks in advance for any suggestions. Best, -- Allen Cronce

2 2

Bitset issue
by Sean Farrow 03 Sep '08

03 Sep '08

Hi: I am using a bitset to store up to 63 different values as a key in a mapp This does appear to be working though, as I carn't seem to get an iterator to accept any bitset even though it is defined, has any one go any othe ideas as to how I could tackle this issue. Regards Sean. __________ Information from ESET NOD32 Antivirus, version of virus signature database 3390 (20080826) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

3 6

Deployment of boost DLLs
by Ralf Globisch 03 Sep '08

03 Sep '08

Hi, I haven't been able to find much information on this, I hope someone can help me: I've only recently started using boost. I finally finished writing an application on my development machine. - Windows XP with Service pack 2 - Application developed in native C++ using MS VS2005 - Boost version 1.35, multithreaded, dynamically linked, installed boost using the installer from boost computing I then tried to deploy a release version of the application and the ms vc runtime redistributables to a test machine running a clean XP install and my application failed to run. The test machine also has XP Service Pack 2 installed. 1) To isolate the problem I then decided to start from scratch with a "Hello World" console application . Deployed it on the test machine and it ran fine. 2) Extended the console app to print out the current time using boost date time. Linked in boost dynamically by specifying BOOST_ALL_DYN_LINK. Deployed this on the server, received a "The application failed to initialize properly (0xc0150002) Click on OK to terminate the application" popup. 3) Rebuilt the application by changing the application to use a static runtime ( /MT instead of /MD ) Added the preprocessor directive BOOST_ALL_NO_LIB so that I could link to the static boost lib. Deployed the application on the server and it ran. 4) I then had a look at the dynamic boost release system DLL using depends.exe on the test machine: Strangely only the signal and the system DLL give the following error message: Error: The Side-by-Side configuration information for "c:\rtvc\bin\BOOST_SYSTEM-VC80-MT-1_35.DLL" contains errors. This application has failed to start because the application configuration is incorrect. Reinstalling the application may fix this problem (14001). The thread, date time, etc dlls are fine. However the signal and system dll are fine on my development machine. Has anyone encountered similar problems? Thanks, Ralf -- This message is subject to the CSIR's copyright terms and conditions, e-mail legal notice, and implemented Open Document Format (ODF) standard. The full disclaimer details can be found at http://www.csir.co.za/disclaimer.html. This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean. MailScanner thanks Transtec Computers for their support.

2 1

Re: [Boost-users] Boost and the .net framework
by raindog＠macrohmasheen.com 03 Sep '08

03 Sep '08

They are pretty much mutually exclusive to my knowledge. you can use them together of course but you would have to write custom marshallers for stl containers being passed to .net functions expecting arrays or ienumerable. ------Original Message------ From: Richard Miller Sender: boost-users-bounces(a)lists.boost.org To: boost-users(a)lists.boost.org ReplyTo: boost-users(a)lists.boost.org Sent: Sep 3, 2008 12:47 AM Subject: [Boost-users] Boost and the .net framework Can anyone tell me, are there issues using Boost with the .NET framework and managed C++? How would shared_ptr etc work? Are there issues with the collection classes? _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users Sent from my Verizon Wireless BlackBerry

1 0

Compile errors with boost::mpl::if on MinGW/Msys
by Kevin Jenkins 03 Sep '08

03 Sep '08

Hi, I'm trying to use typedef typename boost::mpl::if_ to choose between two structures, both with identical function names, so I can choose which function to call based on the template parameter type. The code works fine on Visual Studio 2005. But in MinGW/MSys it returns: RPC3_Boost.h:203: error: template argument 2 is invalid RPC3_Boost.h:203: error: template argument 3 is invalid RPC3_Boost.h:203: error: ISO C++ forbids declaration of `type' with no type This is with boost_1_35_0. I've cut out as much code as I can: struct ReadBitstream { static void apply(RakNet::BitStream &bitStream, RakNet::BitStream* t) {/* ... */} }; template <typename T> struct ReadPtr { static inline void apply(RakNet::BitStream &bitStream, const char *&t) {applyStr(bitStream, (char *&) t);} }; template< typename T > struct DoRead { typedef typename boost::mpl::if_< boost::is_convertible<T*,RakNet::BitStream*>, typename ReadBitstream, typename ReadPtr<T> >::type type; }; To call the function, I use: DoRead< boost::remove_pointer<T>::type >::type::apply(* (args.bitStream),&t); Thanks in advance for any help. The whole file is here if you need to see more code: https://raknetjenkinsso.svn.sourceforge.net/svnroot/raknetjenkinsso/trunk/D…

3 2

set help
by Kurt Kohler 03 Sep '08

03 Sep '08

1 0

[Serialization] binary archive 1.75 times larger than source data
by Sebastian.Karlsson＠mmorpgs.org 03 Sep '08

03 Sep '08

Hi, So I've got most of my serialization working now, the only problem now is that it's still largely inefficent. The resulting binary file is 1.75 times larger than the sourcer XML file which I parse from. This is probably a lot due to the fact that I still default tracking and version everything. What I'd love to do however is to specify on a archive by archive basis if I want tracking / versioning. In fact, isn't this what one would normally want to do? When you specify tracking on a class by class basis you have no idea if there will be multiple pointer to the same object of that type. I found the no_tracking which I found a reference to from 2006 on this very mailing list, however it still doesn't seem to affect at least archive size ( haven't checked deserialization timings for it ). When I take a look at the deserialization the binary archive seems to store identifiers for types as their straight up string versions. This also seems largely inefficient, is there a reason for why this can't just be a hash? Also, is binary archives streaming or do they wait until the entire archive is loaded? Basically I'm wondering what would be the fastest possible archive one could create if one doesn't care about portability. // Sebastian Karlsson

2 1

boost::filesystem: removing directory recursively?
by Ákos Maróy 03 Sep '08

03 Sep '08

Is there an easy / elegant way to remove directory contents recursively using boost::filesystem? I see that there's a create_directories() convenience function, but there's no such convenience function for removing a directory and all its contents. moreover, recursive_directory_iterator() does not return an iterator that contains the directory contens in the order suitable for removal :( I wonder if there's an easy / elegant way to do this? Akos

3 4

[bind] [lambda] making lambda::bind work
by Peter Barker 03 Sep '08

03 Sep '08

Hello, I've got some code that works ok with boost::bind and I'm trying to make it work with lambda::bind but am getting compilation errors. Why not leave it as-is? Just above the problem area of code I have another lambda expression and because I've already introduced lambda's _1 placeholder into the current scope and didn't want ambiguities arising so want to convert it over. I'm using VC++ 7.1 (2003) and Boost 1.35.0. I've created a stripped down test program to show the compilation problem: #include <algorithm> #include <memory> #include <string> #include <vector> #include <boost/bind.hpp> #include <boost/utility.hpp> #include <boost/lambda/bind.hpp> #include <boost/lambda/lambda.hpp> class GridItem : boost::noncopyable { public: bool AddOption(const char* item,bool unique = true) { // implementation code omitted! return true; } }; void GoodOldBoostBind() { std::auto_ptr<GridItem> item(new GridItem()); std::vector<std::string> options; std::for_each(options.begin(),options.end(), boost::bind(GridItem::AddOption,boost::ref(item),boost::bind(std::string::c_str,_1),true)); } void LambdaBind() { std::auto_ptr<GridItem> item(new GridItem()); std::vector<std::string> options; using namespace boost::lambda; using boost::lambda::_1; std::for_each(options.begin(),options.end(), bind(GridItem::AddOption,boost::ref(item),bind(std::string::c_str,_1),true)); // COMPILE ERROR ON ABOVE } int main() { } The error is: c:\releases\lib\boost\boost_1_35_0\include\boost\bind.hpp(338) : error C2664: 'R boost::_mfi::mf2<R,T,A1,A2>::operator ()<std::auto_ptr<_Ty>>(const U &,A1,A2) const' : cannot convert parameter 2 from 'boost::lambda::lambda_functor<T>' to 'const char *' with [ R=bool, T=GridItem, A1=const char *, A2=bool, _Ty=GridItem, U=std::auto_ptr<GridItem> ] and [ T=boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<const char *(__thiscall std::basic_string<char,std::char_traits<char>,std::allocator<char>>::* const )(void) const>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>> ] No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called Can anyone help with this? Thanks, Pete

4 8

boost::regex problem
by Silvio Reis Junior 03 Sep '08

03 Sep '08

Hello folks! I'm trying to work with boost::regex but I'm stuck. I wrote the following code: //------------------------------------------------------------------- int main( int argc, CHAR* argv[] ) { boost::regex RegEx( "(eth\\d)" ); if ( boost::regex_match( "dsjkadhjksadjks eth1: ssgdsdhjasgdjg", RegEx ) ) { printf( "Found.\n" ); } return 0; } I tested the expression with Expresso and it's correct although it doesn't work in the code above. Is there something missing? My best regards Silvio

3 3

[boost.asio] string iterator not dereferencable using message in async_send_to
by John Urberg 03 Sep '08

03 Sep '08

I'm using async_send_to to send multicast messages. When I try to send data in a std::string, I always get a 'string iterator not dereferencable' assertion failure. I'm using boost 1.35 and VC9. Here's the code: // instance variable string buffer; // code in method buffer = BuildHailMessage(); socket.async_send_to( boost::asio::buffer(buffer), endpoint, boost::bind( &MulticastServer::HandleSendTo, this, boost::asio::placeholders::error)); I've also tried using char* buffer, dynamically allocating it based on the message length and then use std::copy to copy the std::string into the buffer, but I get heap corruption assertions when trying to delete [] it. The only way I've gotten this to work is using a fixed char[] buffer. Is there a way I can use a std::string with async_send_to? Do I need to use a different type of asio::buffer class? Thanks, John

3 2

Function pointers vs boost.function
by Kurt Kohler 03 Sep '08

03 Sep '08

I have some code that uses pointers to member functions (not boost.function). It compiles and works fine. But when I tried to convert the code to use boost.function, I got a mess of errors. I know I'm doing something wrong, but I have no idea what it is. A clue would be greatly appreciated. Here's a reduced test case. #include <boost/function.hpp> struct X { double f(double x) { return x; } double g(double x) { return -x; } //typedef boost::function<double (double)> ftype; typedef double (X::*ftype)(double); double call(ftype func, double x) { //return func(x); return (this->*func)(x); } }; int main(int argc, char *argv[]) { X x; x.call(&X::f, 1.0); // Error occurs here x.call(&X::g, 2.0); } It compiles as it appears above, but if I switch the typedef and return statements to their commented versions, I get the following errors: if g++ -DHAVE_CONFIG_H -I. -I/home/kohler/Projects/test/trunk/src -I.. -O0 -Wall -g3 -MT test.0 -MD -MP -MF ".deps/test.Tpo" -c -o test.o /home/kohler/Projects/test/trunk/src/test.cpp; then mv -f ".deps/test.Tpo" ".deps/test.Po"; else rm -f ".deps/test.Tpo"; exit 1; fi /usr/include/boost/function/function_template.hpp: In static member function 'static R boost::detail::function::function_obj_invoker1<FunctionObj, R, T0>::invoke(boost::detail::function::function_buffer&, T0) [with FunctionObj = boost::_mfi::mf1<double, X, double>, R = double, T0 = double]': /usr/include/boost/function/function_template.hpp:368: instantiated from 'void boost::detail::function::basic_vtable1<R, T0, Allocator>::init(FunctionObj, boost::detail::function::function_obj_tag) [with FunctionObj = boost::_mfi::mf1<double, X, double>, R = double, T0 = double, Allocator = std::allocator<void>]' /usr/include/boost/function/function_template.hpp:298: instantiated from 'void boost::detail::function::basic_vtable1<R, T0, Allocator>::init(F) [with F = boost::_mfi::mf1<double, X, double>, R = double, T0 = double, Allocator = std::allocator<void>]' /usr/include/boost/function/function_template.hpp:339: instantiated from 'void boost::detail::function::basic_vtable1<R, T0, Allocator>::init(MemberPtr, boost::detail::function::member_ptr_tag) [with MemberPtr = double (X::*)(double), R = double, T0 = double, Allocator = std::allocator<void>]' /usr/include/boost/function/function_template.hpp:298: instantiated from 'void boost::detail::function::basic_vtable1<R, T0, Allocator>::init(F) [with F = double (X::*)(double), R = double, T0 = double, Allocator = std::allocator<void>]' /usr/include/boost/function/function_template.hpp:277: instantiated from 'boost::detail::function::basic_vtable1<R, T0, Allocator>::basic_vtable1(F) [with F = double (X::*)(double), R = double, T0 = double, Allocator = std::allocator<void>]' /usr/include/boost/function/function_template.hpp:655: instantiated from 'void boost::function1<R, T0, Allocator>::assign_to(Functor) [with Functor = double (X::*)(double), R = double, T0 = double, Allocator = std::allocator<void>]' /usr/include/boost/function/function_template.hpp:513: instantiated from 'boost::function1<R, T0, Allocator>::function1(Functor, typename boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functor>::value>::value, int>::type) [with Functor = double (X::*)(double), R = double, T0 = double, Allocator = std::allocator<void>]' /usr/include/boost/function/function_template.hpp:753: instantiated from 'boost::function<R ()(T0), Allocator>::function(Functor, typename boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functor>::value>::value, int>::type) [with Functor = double (X::*)(double), R = double, T0 = double, Allocator = std::allocator<void>]' /home/kohler/Projects/test/trunk/src/test.cpp:21: instantiated from here /usr/include/boost/function/function_template.hpp:134: error: no match for call to '(boost::_mfi::mf1<double, X, double>) (double&)' /usr/include/boost/bind/mem_fn_template.hpp:160: note: candidates are: R boost::_mfi::mf1<R, T, A1>::operator()(T*, A1) const [with R = double, T = X, A1 = double] /usr/include/boost/bind/mem_fn_template.hpp:179: note: R boost::_mfi::mf1<R, T, A1>::operator()(T&, A1) const [with R = double, T = X, A1 = double] g++ -v Using built-in specs. Target: i486-linux-gnu Configured with: ../src/configure -v --enable-languages=c,c++,fortran,objc,obj-c++,treelang --prefix=/usr --enable-shared --with-system-zlib --libexecdir=/usr/lib --without-included-gettext --enable-threads=posix --enable-nls --with-gxx-include-dir=/usr/include/c++/4.2 --program-suffix=-4.2 --enable-clocale=gnu --enable-libstdcxx-debug --enable-objc-gc --enable-mpfr --enable-targets=all --enable-checking=release --build=i486-linux-gnu --host=i486-linux-gnu --target=i486-linux-gnu Thread model: posix gcc version 4.2.3 (Ubuntu 4.2.3-2ubuntu7)

3 3

transform_view: question about boilerplate code
by Zeljko Vrba 02 Sep '08

02 Sep '08

I have succeeded in writing the following transform functor: typedef bf::map<bf::pair<net, unsigned>, bf::pair<pin, unsigned> > Map; typedef bf::vector<unsigned, unsigned> Pair; struct Map2Pair { template<typename Sig> struct result; template<typename U> struct result<Map2Pair(U)> : remove_reference<T::second_type> { }; template<typename T> typename T::second_type operator()(T t) const { return t.second; } }; I have tested it, it works. The result magic has been copied from the transform_view example in the documentation and adjusted for the proper return type. Where can I read a bit more about result conventions? In particular, how does the template<typename U> struct result<Map2Pair(U)> : remove_reference<T::second_type> { }; specialization work when Map2Pair is a struct, and it doesn't even have a constructor! Even worse, why does it work at all when T is not in the scope of the template (.. because it's never used?) Yes, it is not used, the following functor also works: struct Map2Pair { template<typename T> typename T::second_type operator()(T t) const { return t.second; } }; When and how is the above version preferred than the simpler version?

3 3

[Boost.Asio] service_name/port inconsistency
by Vjekoslav Brajkovic 02 Sep '08

02 Sep '08

Hi. When designing server-client model, one has to use boost::asio::ip::tcp::endpoint and boost::asio::ip::tcp::resolver::query respectively. What I am confused about is that query accepts std::string& service as a parameter whereas endpoint only accepts unsigned short. When writing code, it is really easy to get confused which constructor takes string and which short. I would appreciate is somebody could tell me if there is a way to create a server side component using integer as a service. - V

3 5

[Math] errno on WCE
by Paul Heil 02 Sep '08

02 Sep '08

I'm compiling the Boost 1.36.0 Math library for Windows Mobile 5 using Visual Studio 2008. I have STLPort-5.1.5 installed. When I get to anything requiring errno support, I get compiler errors as below: compile-c-c++ bin.v2\libs\math\build\msvc-WM5\debug\link-static\runtime-link-static\stdlib-stlport\threading-multi\acosh.obj acosh.cpp Unknown EVC++ compiler version - please run the configure tests and report the results eMbedded Visual C++ 3 and .NET don't have a errno.h header; STLport won't include native errno.h here C:\boost\boost_1_36_0\boost/math/policies/error_handling.hpp(149) : error C2065: 'errno_t' : undeclared identifier [...] C:\boost\boost_1_36_0\boost/math/policies/error_handling.hpp(149) : error C2065: 'EDOM' : undeclared identifier [..] C:\boost\boost_1_36_0\boost/math/policies/error_handling.hpp(233) : error C2065: 'ERANGE' : undeclared identifier In the STLPort errno.h header, there's a section: #ifdef _STLP_WCE // only show message when directly including this file in a non-library build # if !defined(__BUILDING_STLPORT) && (_STLP_OUTERMOST_HEADER_ID == 0x205) # pragma message("eMbedded Visual C++ 3 and .NET don't have a errno.h header; STLport won't include native errno.h here") #define errno errno_t I can add an "#include<crtdefs.h>" to get errno_t support, but that just declares it as "typedef int errno_t;". Which, of course, gives me " boost/math/policies/error_handling.hpp(149) : error C2513: 'int' : no variable declared before '=' " errors as that isn't the way Boost expects to be able to use errno. What can I do to either get errno support under CE or remove the dependency of that feature without breaking Boost? Thanks, PaulH

2 2

[Serialization] Compatibility of text archives in 1.36 and 1.34
by Glenn Ramsey 02 Sep '08

02 Sep '08

Hi, I recently upgraded from boost 1.34 to boost 1.36. A version of my application built with 1.36 can read the text archives produced by 1.34, but a version of my application built with 1.34 cannot read the text archives produced by 1.36. Is this the behaviour that I should expect? Glenn -- Glenn Ramsey http://www.componic.co.nz

3 5

Re: [Boost-users] Changing from std::map to boost::bimap
by Sean Farrow 02 Sep '08

02 Sep '08

Hi: I got that far, however I carn't seem to declare iterators properly: With the previously used map scheme, my iterator was declared as follows: Std::map<std::bitset<6>, int>::iterator DotsIterator; How do I convert this to use boost::bimap. Cheers Sean. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Daryle Walker Sent: 01 September 2008 20:34 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Changing from std::map to boost::bimap On Aug 31, 2008, at 6:56 AM, Sean Farrow wrote: > I am looking to change from std::map to boost::bimap. > I have the following defined: > std::bimap<std::bitset<6>, int, BitSetComp> DotsList; > And > boost::bimap<std::bitset<6>, int, BitSetComp>::iterator DotsIterator; [SNIP] > How do I change these definitions to use boost::bimap. > Any help appreciated. A bimap can act as two regular maps, and does so through two special public data members. The "left" member acts like a map<bitset, int, BitSetComp>, and the "right" member flips the first two arguments. There are also type-aliases defined for each iterator, left or right. There is also a mode that acts like a std::set< std::pair< std::bitset< 6 >, int > > >. Read the docs for the specific names and modes. -- Daryle Walker Mac, Internet, and Video Game Junkie darylew AT hotmail DOT com _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users __________ Information from ESET NOD32 Antivirus, version of virus signature database 3406 (20080902) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com __________ Information from ESET NOD32 Antivirus, version of virus signature database 3406 (20080902) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

2 1

Problem with Boost.Test (1.36.0) and Visual Studio 2008 SP1
by Matthieu Brucher 02 Sep '08

02 Sep '08

Hi, I'm trying to build a test suite that worked with Linux and an older Boost version (1.34.1). I tried to compile it with Visual Studio 2008 SP1 with Boost 1.36 and I ran into this error : link /nologo /OUT:IRT_test_suit.exe /LIBPATH:D:\Travail\boost_1_36_0\lib "/LIBPA TH:D:\Python 2.5\libs" /LIBPATH:. IRT.lib boost_unit_test_framework-vc90-mt-1_36 .lib tools\boost_main_test.obj test_light.obj boost_unit_test_framework-vc90-mt-1_36.lib(boost_unit_test_framework-vc90-mt-1_3 6.dll) : error LNK2005: "public: static class boost::unit_test::unit_test_log_t & __cdecl boost::unit_test::singleton<class boost::unit_test::unit_test_log_t>:: instance(void)" (?instance@?$singleton@Vunit_test_log_t@unit_test@boost@@@unit_t est@boost@@SAAAVunit_test_log_t@23@XZ) déjà défini(e) dans test_light.obj IRT_test_suit.exe : fatal error LNK1169: un ou plusieurs symboles définis à diff érentes reprises ont été rencontrés boost_main_test.cpp consists of: #define BOOST_TEST_DYN_LINK #define BOOST_TEST_MODULE "IRT test suit" #include <boost/test/unit_test.hpp> And test_light.cpp: #include <boost/test/unit_test.hpp> Both files were compiled with the arguments cl /nologo /EHsc /Ox /MD -D_CRT_SECURE_NO_DEPRECATE -DWIN32 /TP /ID:\Travail\boo st_1_36_0 /I. /c test_light.cpp /Fotest_light.obj I didn't find a thing on the Internet with this issue, so I hope someone will have a clue... Matthieu -- French PhD student Website : http://matthieu-brucher.developpez.com/ Blogs : http://matt.eifelle.com and http://blog.developpez.com/?blog=92 LinkedIn : http://www.linkedin.com/in/matthieubrucher

3 8

Errors when defining iterators for use with boost::bimap
by Sean Farrow 02 Sep '08

02 Sep '08

Hi: I am defining the following iterator with boost::bimap: typedef boost::bimap<std::bitset<6>, int, BitSetComp>::left_map::iterator DotsIterator; I get the following error amonst others: error C2903: 'rebind' : symbol is neither a class template nor a function template bimap_core.hpp 408 Should I have included something. If not how do I use boost::bimap with comparison operators within iterators. Note the following won't compile either: typedef boost::bimap<std::bitset<6>, int>::left_map::iterator DotsIterator; Any help apreciated. Sean. __________ Information from ESET NOD32 Antivirus, version of virus signature database 3408 (20080902) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

1 0

Re: [Boost-users] [review] Dataflow Review starts today, September 1st
by Maarten Nieber 02 Sep '08

02 Sep '08

Hi, in the last year, I have been doing a lot of dataflow programming so potentially I am very interested in this library. However, I would really like to see a documentation page that "sells" the library. I would like to see a description of cases that would be difficult, timeconsuming or hard to adapt for future requirements when implemented without this library, and understand how the library makes life easier. Instead, the library documentation quickly focuses on the architecture, i.e. the different layers in the library. There are some examples (VTK, graphical editor), but from these too I cannot tell if this library would help me or not. Best regards, Maarten ----- Original Message ---- From: Jaakko Järvi <jarvi(a)cs.tamu.edu> To: boost-users <boost-users(a)lists.boost.org> Sent: Monday, September 1, 2008 4:00:49 PM Subject: [Boost-users] [review] Dataflow Review starts today, September 1st The review of Stjepan Rajko's Dataflow library starts today, September 1st, and will run until September 10th. --------------------------------------------------------- Description of the library: Dataflow is a generic library for dataflow programming. Dataflow programs can typically be expressed as a graph in which vertices represent components that process data, and edges represent the flow of data between the components. As such, dataflow programs can be easily reconfigured by changing the components and/or the connections. This review focuses on the Dataflow.Signals layer of the library. For its data transport mechanism, Dataflow.Signals uses Boost.Signals which can be used to make lasting dataflow connections based on function calls. Dataflow.Signals provides the following to facilitate signals-based dataflow networks: * A number of useful general-purpose components, and building blocks for implementing new components. * Various free functions and operators for connecting and using components. The library documentation provides some concrete examples of how Dataflow.Signals layer can be used. Some examples are: * Implementing distributed dataflow applications using Dataflow.Signals and Boost.Asio * An image processing network using Dataflow.Signals and Boost.GIL * A GUI dataflow editor (located in the Dataflow.Blueprint documentation) While the Dataflow library contains other layers, only the Dataflow.Signals layer is ready for review. Reviewers are welcome to provide feedback for any part of the library, but please be aware that the documentation and implementation for the other layers may be lacking (for example, there is the generic support layer, which provides concepts applicable to different dataflow frameworks, and can be used to develop generic dataflow code, as well as the Dataflow.Blueprint layer which provides run-time reflection and modeling of dataflow networks in a Boost Graph Library graph for any dataflow framework with implemented Dataflow library support). For the time being, please consider these other layers as implementation details or proof-of-concept examples, as appropriate. The library is accessible as a tarball at: http://www.boostpro.com/vault/index.php?&directory=Dataflow The documentation can be accessed here: http://www.dancinghacker.com/code/dataflow/ The documentation particular to the Dataflow.Signals layer under review: http://www.dancinghacker.com/code/dataflow/dataflow/signals.html Dataflow depends on many existing Boost libraries, such as Fusion and MPL. The Dataflow.Signals layer builds functionality over Boost.Signals. The Dataflow library has been tested using a recent version of the Boost trunk, as well as the 1.35 release. Tests and examples have been built successfuly on OS X (GCC 4.0, 4.2), Linux (GCC 4.2), and Windows (MSVC 8.0 and to some degree MinGW GCC 4.2). --------------------------------------------------------- --------------------------------------------------------- Questions you may want to answer in your review: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? In particular, please remember to answer the following question explicitly: - Do you think the library should be accepted as a Boost library? Jaakko Järvi Review Manager _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Re: [Boost-users] [review] Dataflow Review starts today, September 1st
by Manuel Jung 02 Sep '08

02 Sep '08

Jaakko Järvi wrote: > The review of Stjepan Rajko's Dataflow library starts today, September > 1st, and will run until September 10th. > > --------------------------------------------------------- > Description of the library: > > Dataflow is a generic library for dataflow programming. Dataflow > programs can typically be expressed as a graph in which vertices > represent components that process data, and edges represent the flow > of data between the components. As such, dataflow programs can be > easily reconfigured by changing the components and/or the connections. > > This review focuses on the Dataflow.Signals layer of the library. For > its data transport mechanism, Dataflow.Signals uses Boost.Signals > which can be used to make lasting dataflow connections based on > function calls. Dataflow.Signals provides the following to facilitate > signals-based dataflow networks: > > * A number of useful general-purpose components, and building blocks > for implementing new components. > * Various free functions and operators for connecting and using > components. > > The library documentation provides some concrete examples of how > Dataflow.Signals layer can be used. Some examples are: > > * Implementing distributed dataflow applications using > Dataflow.Signals and Boost.Asio > * An image processing network using Dataflow.Signals and Boost.GIL > * A GUI dataflow editor (located in the Dataflow.Blueprint documentation) > > While the Dataflow library contains other layers, only the > Dataflow.Signals layer is ready for review. Reviewers are welcome to > provide feedback for any part of the library, but please be aware that > the documentation and implementation for the other layers may be > lacking (for example, there is the generic support layer, which > provides concepts applicable to different dataflow frameworks, and can > be used to develop generic dataflow code, as well as the > Dataflow.Blueprint layer which provides run-time reflection and > modeling of dataflow networks in a Boost Graph Library graph for any > dataflow framework with implemented Dataflow library support). For > the time being, please consider these other layers as implementation > details or proof-of-concept examples, as appropriate. > > The library is accessible as a tarball at: > http://www.boostpro.com/vault/index.php?&directory=Dataflow > > The documentation can be accessed here: > http://www.dancinghacker.com/code/dataflow/ > > The documentation particular to the Dataflow.Signals layer under review: > http://www.dancinghacker.com/code/dataflow/dataflow/signals.html > > Dataflow depends on many existing Boost libraries, such as Fusion and > MPL. The Dataflow.Signals layer builds functionality over > Boost.Signals. The Dataflow library has been tested using a recent > version of the Boost trunk, as well as the 1.35 release. Tests and > examples have been built successfuly on OS X (GCC 4.0, 4.2), Linux > (GCC 4.2), and Windows (MSVC 8.0 and to some degree MinGW GCC 4.2). > --------------------------------------------------------- > > > --------------------------------------------------------- > Questions you may want to answer in your review: > > - What is your evaluation of the design? > - What is your evaluation of the implementation? > - What is your evaluation of the documentation? > - What is your evaluation of the potential usefulness of the library? > - Did you try to use the library? With what compiler? Did you have any > problems? - How much effort did you put into your evaluation? A glance? A > quick reading? > In-depth study? > - Are you knowledgeable about the problem domain? > > In particular, please remember to answer the following question > explicitly: > > - Do you think the library should be accepted as a Boost library? > > > Jaakko Järvi > Review Manager > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost Hey, The filter of the GIl example is always processed, whether or whether not it is multiplexed to the output, right? Maybe it would be good to insert a conditional component right before the filter, therefore the data is dropped, if the multiplexer takes data from slot 0. Otherwise a senseless computation is done, if the filter is turned off. I wanted to alter the example as suggested, but i don't know how to use the conditional component? I couldn't find a example for that. Maybe you could point out how to use it. Kind Regards Manuel

2 2

Buffers - slices.
by Leandro Lucarella 02 Sep '08

02 Sep '08

Hello. I've been searching for a "buffer" class. I mean, a class like std::string with a .data() method that returns a mutable char* instead of a const char*. So I can do something like: std::string buffer; buffer.reserve(SIZE); int n = recv(fd, buffer.data(), SIZE, 0); I know I probably can do that with a cast anyways, but I don't think it's pretty nor "defined behaviour", right? Another thing sometime I need, is some string processing *without* copying. Something like a readonly substring view. What I think of is basically some struct like: struct slice { const char* ptr; size_t len; } which has all the other (at least no-mutable) operation of a string. Something like doing a std::string::substr() but without the copying. Are there any support for this stuff on boost? Do you know any other libraries which have this? TIA. -- Leandro Lucarella (luca) | Blog colectivo: http://www.mazziblog.com.ar/blog/ ---------------------------------------------------------------------------- GPG Key: 5F5A8D05 (F8CD F9A7 BF00 5431 4145 104C 949E BFB6 5F5A 8D05) ---------------------------------------------------------------------------- You look so tired-unhappy, bring down the government, they don't, they don't speak for us.

2 1

[thread] wrong assertion following call to pthread_mutex_timedlock()?
by Wolfgang Fertsak 02 Sep '08

02 Sep '08

In boost 1.35 and 1.36 the implementation of mutex::timed_lock() and recursive_mutex::timed_lock() for posix-platforms with BOOST_PTHREAD_HAS_TIMEDLOCK defined looks like this: bool timed_lock(system_time const & abs_time) { struct timespec const timeout=detail::get_timespec(abs_time); int const res=pthread_mutex_timedlock(&m,&timeout); BOOST_ASSERT(!res || res==EBUSY); return !res; } The assertion following pthread_mutex_timedlock() always fails in case of a timeout since the system call returns ETIMEDOUT when timed out and not EBUSY (according to the open group specification http://www.opengroup.org/onlinepubs/009695399/functions/pthread_mutex_timed…) Best regards, Wolfgang

1 1

[filesystem][xpressive] Hotfix patches available for 1.36.0
by Beman Dawes 02 Sep '08

02 Sep '08

Hotfix patches are available to fix Boost.Filesystem and Boost.Xpressive [1.36.0] problems. See https://svn.boost.org/trac/boost/wiki/ReleasePractices/HotFixes Providing hotfix patches is something new and experimental for Boost. Please let us know if you find the patches useful or have other comments. Thanks, --Beman

9 11

[statechart] Events not consumed when using derived states?
by Stefan Steuerwald 01 Sep '08

01 Sep '08

Dear statecharters, I would like to request help with a problem building a statemachine from states that I derive from simple_state. Here is minimal code that defines two states StateA and StateB and an event cycling between these two: #include <boost/statechart/state_machine.hpp> #include <boost/statechart/simple_state.hpp> #include <boost/statechart/event.hpp> #include <boost/statechart/transition.hpp> namespace sc = boost::statechart; using namespace std; class StateA; struct StateMachine : sc::state_machine< StateMachine, StateA > { void unconsumed_event( const sc::event_base & evt ) { cout << "unconsumed!" << endl; } }; class Event : public sc::event< Event > {}; struct StateA : sc::simple_state< StateA, StateMachine > { typedef sc::transition< Event, StateB > reactions; }; struct StateB : sc::simple_state< StateB, StateMachine > { typedef sc::transition< Event, StateA > reactions; }; ----------------- This works fine as expected with process_event( Event() ). However, I would like to derive the states of my statechart from a class like this: template<class context> struct State : sc::simple_state< State<context>, context > { // Some application-specific things }; struct StateA : State< StateMachine > { typedef sc::transition< Event, StateB > reactions; }; struct StateB : State< StateMachine > { typedef sc::transition< Event, StateA > reactions; }; ----------------- Now, calling process_event( Event() ) does not do anything, except turning the event up at the StateMachine::unconsumed_event() method. I am aware of this one: http://www.boost.org/doc/libs/1_35_0/libs/statechart/doc/faq.html#Templated… but I'm not sure whether this applies in any way to my case, as I don't have any compiler errors. May I be violating some prerequisites here? Thank you for any help you can provide, Stefan.

2 2

unit test XML ouput to HTML XSL?
by Ákos Maróy 01 Sep '08

01 Sep '08

Hi, I'm wondering if someone has already created an XSL stylesheet that transforms the XML output of boost::test to human-friendly HTML? It would be even better if this XSL could combine the output of several test output XML files. I'm also wondering on the state of integration between boost test and continous integration tools, like Hudson, Bitten, etc.. Thanks, Akos

3 2

Serializing a char *
by Diane 01 Sep '08

01 Sep '08

Based on tutorial and reference material, and some previous posts here, it seems like I should be able to serialize a char* by using a wrapper like tracked_char: BOOST_STRONG_TYPEDEF(char, tracked_char) template<class Archive> void serialize(Archive &ar, tracked_char & tc){ ar & tc; } But when I try to serialize my struct that contains char*: typedef struct MYSTRUCT { char chtest; char *chstar; } MYSTRUCT; template<class Archive> void serialize(Archive & ar, MYSTRUCT & it, const unsigned int version) { ar & it.chtest; tracked_char *tcp = it.chstar; //****error on this line****// ar & *tcp; } I get this compile error: cannot convert `char*' to `tracked_char*' in initialization What is the compiler complaining about here? How do I fix it? I'm not sure if I have the correct usage of BOOST_STRONG_TYPEDEF, so I also tried: struct tracked_char { char m_char; // the real data template<class Archive> void serialize(Archive &ar, unsigned int version){ ar & m_char; } // casting operators - not compiled char operator char () const { //****error here****// return m_char; } char & operator char() { //****error here****// return m_char; } }; I need someone to point me in the right direction. Thanks, Diane

4 5

Changing from std::map to boost::bimap
by Sean Farrow 01 Sep '08

01 Sep '08

Hi: I am looking to change from std::map to boost::bimap. I have the following defined: std::bimap<std::bitset<6>, int, BitSetComp> DotsList; And boost::bimap<std::bitset<6>, int, BitSetComp>::iterator DotsIterator; If it's needed BitsetComp is defined as: struct BitSetComp { bool operator()(const std::bitset<6>& lhs, const std::bitset<6>& rhs) const { return lhs.to_ulong() < rhs.to_ulong(); } }; How do I change these definitions to use boost::bimap. Any help apreciated. Chers Sean. __________ Information from ESET NOD32 Antivirus, version of virus signature database 3401 (20080829) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

2 1

[Serialization] Are the serialized char* different when code runs in 32/64 bits machines ?
by jotalo jotalo 01 Sep '08

01 Sep '08

Hi, I use the Bost serialization library to serialize some classes that I put in a char* variable ... I have a Server which publish this char* variable and Clients get this variable and de-serialize it to obtain the original class... Everything work fine when servers and clients are running in machines with the same architecture (64 or 32 bits)... But when I run the server in a 64 bits machine, the char* variable is not recognized in a 32 bits client. In this code: std::stringstream is; is.rdbuf()->pubsetbuf(c, m_StringSize); boost::archive::binary_iarchive *ia = new boost::archive::binary_iarchive(is); The last line returns the std::exception: "invalid signature" To be sure that I am not doing something wrong I printed the first 80 characters of this variable when it is created in a 64 bits server and a 32 bits server: In a 64 bits machine server, the print out is: "........serialization::archive.................MonH1F............Efficiency.(cou" (the "." are not printable ascii characters) in Hexa format it is : 16 00 00 00 00 00 00 00 73 65 72 69 61 6C 69 7A 61 74 69 6F 6E 3A 3A 61 72 63 68 69 76 65 04 04 08 04 08 01 00 00 00 06 00 00 00 00 00 00 00 4D 6F 6E 48 31 46 00 00 00 00 1E 00 00 00 00 00 00 00 45 66 66 69 63 69 65 6E 63 79 20 28 63 6F 75 And ind the case of a 32 bits machine server, it is: "....serialization::archive.............MonH1F........Efficiency.(counter2/counte" 16 00 00 00 73 65 72 69 61 6C 69 7A 61 74 69 6F 6E 3A 3A 61 72 63 68 69 76 65 04 04 04 04 08 01 00 00 00 06 00 00 00 4D 6F 6E 48 31 46 00 00 00 00 1E 00 00 00 45 66 66 69 63 69 65 6E 63 79 20 28 63 6F 75 6E 74 65 72 32 2F 63 6F 75 6E 74 65 They are similar but not equal... Thank you, very much Juan Otalora _________________________________________________________________ Explore the seven wonders of the world http://search.msn.com/results.aspx?q=7+wonders+world&mkt=en-US&form=QBRE

4 4

[Min-Max] Usage with a member function as criteria.
by Rodolfo Federico Gamarra 01 Sep '08

01 Sep '08

Hello Boost users, I'm working on my thesis with the Boost library (Boost-1.34.1) running on g++ (GCC) 4.1.3 20070929 (prerelease) (Ubuntu 4.1.2-16ubuntu2). What I'm trying to do can be done very simply, but I preferred to do it more appropriately, I believe, using the Boost Min-Max library. I'm trying to simultaneously obtain the maximum and minimum values of a member function call over a lists of objects. Suppose there exists a class utl::Particle; with a member function double GetEnergy() const; In a member field of another class I have a list of those particles std::list<utl::Particle> particles; for which I want min/max GetEnergy() values. How is that accomplished using Boost.Min-Max? Below I give some excerpts of some of the things I've tried, but didn't work. In order to try to understand what I was doing I split the code over several lines, so to minimize the non-compiling one. In both cases the error seems to be (that line is what I believe to be the most important part of all the error messages): boost/iterator/iterator_adaptor.hpp:353: error: no match for 'operator-' in... First attempt: boost::function<double(const utl::Particle&)> energy = boost::lambda::bind(&utl::Particle::GetEnergy, boost::lambda::_1 ); boost::transform_iterator< boost::function<double(const utl::Particle&)> , list<utl::Particle>::const_iterator> itBeg(particles.begin(), energy),itEnd(particles.end(), energy); boost::minmax(itBeg, itEnd); // This call doesn't compile. Second attempt: boost::function<double(const utl::Particle&)> energy = boost::lambda::bind(&utl::Particle::GetEnergy, boost::lambda::_1 ); // As in the first case. boost::minmax( boost::make_transform_iterator(particles.begin(),energy ), boost::make_transform_iterator(particles.end() ,energy )); // This call doesn't compile. Thanks a lot for your help. -- Rodolfo Federico Gamarra

2 1

problem with boost io_service
by lakers fan 01 Sep '08

01 Sep '08

Hello, I have an application in which I created an io_service object in the main thread of the application. Then I created a listener object (listener socket class), this class creates a new worker thread and waits for incoming messages. First I created listener socket in the context of the main thread and called async_receive_from() so that io_service has something to work, and then I called io_service.run() in the worker thread. But the run() returned immediately. So I tried creating the socket in the worker thread and called async_receive_from() and then called io_service.run(). Again run() returned immeidately with boost::system::error_code's m_val = 0. Can someone point me in the right direction? i m kind of clueless.. Thanks, Bharani _________________________________________________________________ Talk to your Yahoo! Friends via Windows Live Messenger. Find out how. http://www.windowslive.com/explore/messenger?ocid=TXT_TAGLM_WL_messenger_ya…

3 3

cycle iterator that does keep track of wraparound.
by e r 01 Sep '08

01 Sep '08

hi, regarding http://www.boostpro.com/vault/index.php?action=downloadfile&filename=cycle_… is there an illustration/explanation of the different behaviors of cycle_iterator.hpp and cycle_iterator2.hpp thanks!

1 0

Boost::Thread
by Daryl Haresign 01 Sep '08

01 Sep '08

I've been trying to use boost::thread with a movable structure (see end for code + error). From the online manual ( http://www.boost.org/doc/libs/1_36_0/doc/html/thread/thread_management.html… ) template <class F, class A1, class A2, ...> thread(F f, A1 a1, A2 a2, ...); Preconditions: F and each An must by copyable or movable. Effects: As if thread(boost::bind(f,a1,a2,...)). Consequently, f and each an are copied into internal storage for access by the new thread. I've been running into a problem with this however. The use of boost::bind means that F needs to have a copy constructor, which seems odd as the manual says "or movable". Am I doing something wrong, or is this an oversight, or what? Regards, Daryl. ---------- Code: (built with: gcc version 4.4.0 20080831 (experimental) (GCC) g++-trunk -o move_thread move_thread.cpp --std=c++0x /usr/local/lib/libboost_thread-gcc43-mt.a) ---------- #include <iostream> #include <vector> #include <boost/preprocessor/iteration/iterate.hpp> #include <boost/thread.hpp> using std::cout; using std::endl; using std::vector; using boost::thread; struct S { S(int) { cout << "S()" << endl; } S(S &&) { cout << "S() move" << endl; } void operator()(int i) { cout << "Thread running [" << i << "]" << endl; } S(S const &) = delete; }; int main() { vector<thread> v; for (int i = 0; i < 10; ++i) { v.push_back(thread(S(i), i)); } for (int i = 0; i < 10; ++i) { v[i].join(); } } ---------- Error: ---------- In file included from /usr/local/include/boost/thread/thread.hpp:22, from /usr/local/include/boost/thread.hpp:13, from move_thread.cpp:4: move_thread.cpp: In constructor ‘boost::thread::thread(F, A1) [with F = S, A1 = int]’: move_thread.cpp:26: instantiated from here move_thread.cpp:18: error: deleted function ‘S::S(const S&)’ /usr/local/include/boost/thread/detail/thread.hpp:227: error: used here /usr/local/include/boost/thread/detail/thread.hpp:227: error: initializing argument 2 of ‘boost::_bi::bind_t<R, F, typename boost::_bi::list_av_1<A1>::type> boost::bind(boost::type<R>, F, A1) [with R = void, F = S, A1 = int]’

2 1

[graph] Compressed Sparse Row graph - undirected?
by Mojmir Svoboda 01 Sep '08

01 Sep '08

hello, i am using directed CSR from boost::graph and i have a small problem with memory consumption, as each edge property is duplicated. i can of course make edge property to be some index and reduce this, but i have an editor part of graph that is adjacency_list and i'd like the properties to be the same. my primary question is: is there a way to implement an undirected csr graph? anyway, when constructing directed graph from undirected there is a slight bug in implementation, because it allocates space for only N edges(properties) instead of 2N. or am i missing something? another thing: perhaps i am doing something wrong, but this code seems to go 'one field beyond' the allocated space. can you confirm, please? edge_iterator& operator++() { ++current_edge.idx; while (current_edge.idx == end_of_this_vertex) { ++current_edge.src; end_of_this_vertex = rowstart_array[current_edge.src + 1]; ^^^^^^^^^^^^^^^^^^^^ } return *this; } many thanks for your attention, mojmir

1 0

[review] Dataflow Review starts today, September 1st
by jarvi＠cs.tamu.edu 01 Sep '08

01 Sep '08

The review of Stjepan Rajko's Dataflow library starts today, September 1st, and will run until September 10th. --------------------------------------------------------- Description of the library: Dataflow is a generic library for dataflow programming. Dataflow programs can typically be expressed as a graph in which vertices represent components that process data, and edges represent the flow of data between the components. As such, dataflow programs can be easily reconfigured by changing the components and/or the connections. This review focuses on the Dataflow.Signals layer of the library. For its data transport mechanism, Dataflow.Signals uses Boost.Signals which can be used to make lasting dataflow connections based on function calls. Dataflow.Signals provides the following to facilitate signals-based dataflow networks: * A number of useful general-purpose components, and building blocks for implementing new components. * Various free functions and operators for connecting and using components. The library documentation provides some concrete examples of how Dataflow.Signals layer can be used. Some examples are: * Implementing distributed dataflow applications using Dataflow.Signals and Boost.Asio * An image processing network using Dataflow.Signals and Boost.GIL * A GUI dataflow editor (located in the Dataflow.Blueprint documentation) While the Dataflow library contains other layers, only the Dataflow.Signals layer is ready for review. Reviewers are welcome to provide feedback for any part of the library, but please be aware that the documentation and implementation for the other layers may be lacking (for example, there is the generic support layer, which provides concepts applicable to different dataflow frameworks, and can be used to develop generic dataflow code, as well as the Dataflow.Blueprint layer which provides run-time reflection and modeling of dataflow networks in a Boost Graph Library graph for any dataflow framework with implemented Dataflow library support). For the time being, please consider these other layers as implementation details or proof-of-concept examples, as appropriate. The library is accessible as a tarball at: http://www.boostpro.com/vault/index.php?&directory=Dataflow The documentation can be accessed here: http://www.dancinghacker.com/code/dataflow/ The documentation particular to the Dataflow.Signals layer under review: http://www.dancinghacker.com/code/dataflow/dataflow/signals.html Dataflow depends on many existing Boost libraries, such as Fusion and MPL. The Dataflow.Signals layer builds functionality over Boost.Signals. The Dataflow library has been tested using a recent version of the Boost trunk, as well as the 1.35 release. Tests and examples have been built successfuly on OS X (GCC 4.0, 4.2), Linux (GCC 4.2), and Windows (MSVC 8.0 and to some degree MinGW GCC 4.2). --------------------------------------------------------- --------------------------------------------------------- Questions you may want to answer in your review: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? In particular, please remember to answer the following question explicitly: - Do you think the library should be accepted as a Boost library? Jaakko Järvi Review Manager

1 0

Re: [Boost-users] RE Outer product in the uBLAS
by Ting Yu 01 Sep '08

01 Sep '08

Thanks Bron for your reply. I am quit sure it is about the outer product. The ordinary product is also named as inner product, which indeed works in an opposite way. The outer product is used very rarely, but this time it happens to me. I have tried the "prod", and it only work as an inner product. Cheers Ting Yu At 04:18 PM 1/09/2008, you wrote: >maybe you just want "prod"? > >F. Bron >___________________________________ > >boost-users-bounces(a)lists.boost.org a écrit sur 01/09/2008 03:56:15 : > > > Hi All, > > I am using the uBLAS to do an outer product between a vector and a > > matrix. The function "outer_prod" seems to only accept two vectors > > instead of a vector and a matrix. Is there anyone successfully to do > > the outer product between a vector and a matrix? Many Thanks > > > > Cheers > > > > Ting Yu > > > > Research Fellow, PhD > > The Center for Integrated Sustainability Analysis (ISA) > > Office: Room 408, Physics Building A28, University of Sydney, NSW 2006 > > Tel: (02) 9351 2627 (Shared) > > Fax: (02) 9351 7726 > > > > > > _______________________________________________ > > Boost-users mailing list > > Boost-users(a)lists.boost.org > > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > >Avis : >Ce message et toute pièce jointe sont la >propriété d'Alcan et sont destinés seulement aux >personnes ou à l'entité à qui le message est >adressé. Si vous avez reçu ce message par erreur, veuillez le >détruire et en aviser l'expéditeur par courriel. >Si vous n'êtes pas le destinataire du message, >vous n'êtes pas autorisé à utiliser, à copier ou >à divulguer le contenu du message ou ses pièces jointes >en tout ou en partie. > >Notice: >This message and any attachments are the >property of Alcan and are intended solely for >the named recipients or entity to whom this >message is addressed. If you have received this message in error >please inform the sender via e-mail and destroy >the message. If you are not the intended >recipient you are not allowed to use, copy or >disclose the contents or attachments in whole or in part. > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users Research Fellow, PhD The Center for Integrated Sustainability Analysis (ISA) Office: Room 408, Physics Building A28, University of Sydney, NSW 2006 Tel: (02) 9351 2627 (Shared) Fax: (02) 9351 7726 Web: http://www.physics.usyd.edu.au/~tingyu/

1 0

Outer product in the uBLAS
by Ting Yu 01 Sep '08

01 Sep '08

Hi All, I am using the uBLAS to do an outer product between a vector and a matrix. The function "outer_prod" seems to only accept two vectors instead of a vector and a matrix. Is there anyone successfully to do the outer product between a vector and a matrix? Many Thanks Cheers Ting Yu Research Fellow, PhD The Center for Integrated Sustainability Analysis (ISA) Office: Room 408, Physics Building A28, University of Sydney, NSW 2006 Tel: (02) 9351 2627 (Shared) Fax: (02) 9351 7726

2 1

[Serialization] load_binary/save_binary purpose
by Peter S. 31 Aug '08

31 Aug '08

Hi, I'm fairly new to boost so please excuse if my question may sound stupid :) I was wondering what the actual purpose of the load_binary/save_binary methods of the Archive concept classes is. In the documentation section "Archive Concepts", it is noted, that save_binary( u, count ) "Appends to the archive size_t(count) bytes found at u" and load_binary( u, count ) "Retrieves from la size_t(count) bytes and stores them in memory starting at u". Is this meant to a) enable appending random data after some object was serialized to the archive or is this really b) a lowlevel interface through which all data is read/written to the archive, as one could think (or at least, I did :)) by reading the "Archive Class Reference" also found in the documentation? And if case b) applies, couldn't that become a problem, when someone likes to implement an archive where it isn't quite possible to write raw binary data to as additional information is needed (databases/column names come to mind)? Thanks and bye, Peter

3 4