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

Using iostream to create ZIP archive
by Peter Json 14 Jan '09

14 Jan '09

Hi, I'm trying to use boost to create a "zip" file containing more than one file. To my understanding I should use boost::iosteams to do this. In the boost documentation I there is only an example on how to unzip a file ..... http://www.boost.org/doc/libs/1_37_0/libs/iostreams/doc/classes/zlib.html#e… ... but I dont understand how I could do the opposite (create a zip-archive) Especially how to do the naming of the files inside the archive. Does anyone have an example on howto do create a zip-archive containing a couple of text files? Thanx /Peter/ -- View this message in context: http://www.nabble.com/Using-iostream-to-create-ZIP-archive-tp21461391p21461… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

large enum and native array indexing
by Hicham Mouline 14 Jan '09

14 Jan '09

hello, we have a 3rd party lib which provides an enum OP with some hundred members, but each member is defined with numbers that are not contiguous. enum OP { op1=56, op2=6, op3=5 ..... }; We have a performance critical function f that looks like this: status f( double& result, OP , int thing ); typical usage calls f( result0, op0 ) then f(result1, op1) .... f(resultn, opn) on the same thing. these calls, if merged, could have some speedup as there is some repetitive work done for say op3 and op7. I then thought of doing void f( std::map< Op, pair<status, result> >& output, const std::set<OP>&, int thing ) to collapse the above calls to 1. Inside this f, we set results in output with the [] operator. then I compared this to void f( double results[], status statues[], const std::set<OP>&, int thing ), thanks to the native array contiguous access, it was 4 times faster. therefore i wrote a numerical pseudo-metafunction "Position" to take the enum OP as an input and return a size_t, reflecting the index for the array. A call would be like: std::set<OP> opset; opset.set( op1 ); opset.set( op2 ); ... opset.set( op7 ); double results[7]; status statuses[7]; f( results, statuses, opset, thing ); // then to read output results[ Position<OP5>::value ]; Now, the question is about defining the metafunction Position. template< OP op > struct Position {}; template<> struct Position<OP5> { const size_t value=4; }; .... The 3rd party enum OP in the header file I can't change. Is there a way to generate my metafunction automatically? Any facility in mpl or fusion instead of defining my own metafunction? regards,

2 1

[ASIO/1.35.0]: Exception thrown in epoll_reactor::run (async API)
by Slawomir Lisznianski 14 Jan '09

14 Jan '09

Running on RedHat Linux, compiled with gcc 4.x. Program terminates with "Transport endpoint is not connected" -- io_service::run (processing loop) ends with exception thrown. I'm using asynchronous API. Stack trace of optimized debug (-02 -g) binary shows: #0 0x0000003a15a30155 in raise () from /lib64/libc.so.6 #1 0x0000003a15a31bf0 in abort () from /lib64/libc.so.6 #2 0x0000003a15a6a38b in __libc_message () from /lib64/libc.so.6 #3 0x0000003a15a71634 in _int_free () from /lib64/libc.so.6 #4 0x0000003a15a74c5c in free () from /lib64/libc.so.6 #5 0x00000000005093b0 in boost::asio::detail::epoll_reactor<false>::cleanup_operations_and_timers () #6 0x000000000050e6aa in boost::asio::detail::epoll_reactor<false>::run () #7 0x000000000050ebe3 in boost::asio::detail::task_io_service<boost::asio::detail::epoll_reactor<false> >::run () The problem occurs sporadically, under moderate load (about 30 client connections). Appears to be coming from cleanup_operations_and_timers() I can catch exceptions leaking from io_service::run, but would appreciate more info on why this occurs and whether it has other side-effects. Thanks, Slawomir

1 0

Boost graph add vertex
by Damian 14 Jan '09

14 Jan '09

Just as in add_edge(1,2,graph) you get to choose the numbers which represent the vertex is it possible to do the same with add_vertex where i actually choose the vertex number. I guess the syntax might be like add_vertex(3,graph) Cheers Damian

2 1

[boost-users][Milti-Index] labmda and composite key
by Igor R 14 Jan '09

14 Jan '09

Hello, I've got the following data structure: struct Service; typedef shared_ptr<Service> ServicePtr; struct Event { ServicePtr service() const; ptime time() const; }; typedef shared_ptr<Event> EventPtr; struct Cache { struct time_tag{}; typedef mi::multi_index_container< EventPtr, mi::indexed_by< mi::ordered_non_unique< mi::tag<time_tag>, mi::composite_key< EventPtr, mi::const_mem_fun<Event, ServicePtr, &Event::service> mi::const_mem_fun<Event, pt::ptime, &Event::time> > > > > type; typedef type::index<time_tag>::type ByTime; }; Cache cache_; ServicePtr servicePtr = ...; period = ...; I try to extract all the events belonging to some service and bounded by "period": namespace bl=boost::lambda; pair<Cache::type::iterator, Cache::type::iterator> byPeriod = cache_.get<Cache::time_tag>().range(bl::_1 >= make_tuple(servicePtr, period.begin()), bl::_1 <= make_tuple(servicePtr, period.last())); The cache contains lots of matching events, but for some reason, this expression always returs empty region, i.e. byPeriod.first==byPeriod.second. So I'd like to know if the above expression is correct or I'm doing something wrong? Thank you.

2 3

[gil] any_image* conversion to concrete type
by Jan Boehme 14 Jan '09

14 Jan '09

Hi, the following sample code introduces my problem: #include <boost/gil/extension/dynamic_image/dynamic_image_all.hpp> #include <boost/mpl/vector.hpp> #include <boost/gil/extension/io/jpeg_dynamic_io.hpp> int main() { using namespace boost::gil; typedef boost::mpl::vector<rgb8_image_t, cmyk16_planar_image_t> images_t; typedef any_image<images_t> any_image_t; typedef any_image_view<boost::mpl::vector2<rgb8_view_t, cmyk16_planar_view_t > > any_view_t; typedef any_image_view<boost::mpl::vector2<rgb8c_view_t, cmyk16c_planar_view_t> > any_const_view_t; any_image_t img; jpeg_read_image("test2.jpg", img); any_const_view_t cview( img ); rgb8c_view_t rgb_view = cview; } In the last line I want to convert the any_const_view to a concrete type what runs fail in lack of a member named 'pixels'. Does anyone know about that kind of conversion as the documentation imho doesn't contain such a sample. Right now I have to copy the pixels in the following form but I can't believe that this is necessary: rgb8_image_t rgb_image(img.dimensions()); copy_pixels(color_converted_view<rgb8_pixel_t>(const_view(img)), view(rgb_image)); rgb8c_view_t rgb8c_view( const_view(rgb_image) ); Thanks a lot, Jan.

1 0

multi_array resize question
by Wilfried Holzke 14 Jan '09

14 Jan '09

Hi, The documentation from multi_array says that if elements are added while reszize is called, the new elements are initialized with the default constructor. I have the following: typedef boost::multi_array<Object*, 2> Array_Type; What is the default constructor of a pointer? Or do need to do the following: class ptr { public: ptr() { p = 0; } Object *p; } typedef boost::multi_array<ptr, 2> Array_Type; ... to get all new elements to bee zero-pointers? Thanks for help. regards W. Holzke

3 2

[serializaton] namespace issues with extended type info
by Daniel Roberts 14 Jan '09

14 Jan '09

If I nest macro calls such as: namespace SomeNamespace { BOOST_SERIALIZATION_ASSUME_ABSTRACT(SomeClass) BOOST_CLASS_TYPE_INFO(SomeClass, extended_type_info_no_rtti<SomeClass>) BOOST_CLASS_EXPORT(SomeClass) } inside the namespace containing the type I get a TON of compiler errors. The wackiest is that the compiler thinks boost is a namespace inside of my namespace. Things improve (not fully tested) if I move the macros outside of my namespace and qualify the type with namespace name: BOOST_SERIALIZATION_ASSUME_ABSTRACT(SomeNamespace::SomeClass) BOOST_CLASS_TYPE_INFO(SomeNamespace::SomeClass, extended_type_info_no_rtti<SomeNamespace::SomeClass>) BOOST_CLASS_EXPORT(SomeNamespace::SomeClass) Can someone explain please? Thanks

3 2

Joining two forward ranges
by er 13 Jan '09

13 Jan '09

Hello, I'm looking to create an iterator which iterates over two joined ranges: [b0,e0)[b1,e1) I'm sure there's a way to do it with an iterator adapter. I was wondering, however, if someone knew of an already available implementation. Thank you.

2 2

boost[thread] in win32 we have API like WaitForMultipleObjects.How can we implement the same using boost thread
by Mrudul Mahurkar 13 Jan '09

13 Jan '09

Hi, i am working on boost::asio and boost thread library.I am creating client application that will work against any server.In that application am using threads and for their synchronisation i need the APIs like WaitForSingleObject and WaitForMultipleObject given by win32.so is there any API in boost ::thread library so that it can work like that. Mrudul Mahurkar Mumbai.India. Add more friends to your messenger and enjoy! Go to http://messenger.yahoo.com/invite/

3 2

[lambda] Does Boost.Lambda support local variables?
by Robert Jones 13 Jan '09

13 Jan '09

If so, can anyone point me at the relevant bit of documentation. If not, are there some 'standard' techniques to produce a similar effect? Many Thanks, Rob.

4 7

class composition
by Hicham Mouline 13 Jan '09

13 Jan '09

hello, There is an example listed in "C++ template metaprogramming" to generate a class with its members from an mpl sequence: template <typename T> struct wrap { typedef T value; }; typedef mpl::vector< type1, type2, type3 > member_types; mpl::inherit_linearly< member_types, mpl::inherit< wrap<_2>, _1 > >::type generated; but then, the generated class did not look like this: class C { type1 t1; type2 t2; type3 t3; }; Can one do that with BOOST_PP and sequences from preprocessor libs instead? regards,

3 4

Can BOOST 1.37 be built without using stlport in Solaris 5.9 Sunstudio 11
by Saibal 13 Jan '09

13 Jan '09

Hi, I am trying to build BOOST without using stlport library, I am getting some errors? Is it possible to build? Have anybody try that earlier? regards, Saibal

2 1

stream error thrown in boost serialization
by Lee MacDonald 13 Jan '09

13 Jan '09

Guys, I'm having a bit of trouble with boost serialisation using boost 1.35 I am writing out my objects to a text file fine. I see the text_oarchive destructor get called and I get the required new line added to the end of the file. However when I read the objects back in, they get created fine, but as the archive reaches the end of file, it throws a stream error. I have tested the example code and that works fine, so I'm stuck at the mo. Unfortunately i can't try writing/reading the objects as binary easily. I presume the archive is trying to read past the end of the stream, but I don't know why as the newline exists? I've tried the following to make sure the stream is good, but archive still throws. while(stream.good()) { archive >> object; } Any help would be appreciated. Thanks. Lee MacDonald Schneider Trading 4th Floor, 25 Copthall Avenue London EC2R 7BP -------------------------------------------------------- Message from: lee.macdonald(a)schneidertrading.com Message to: boost-users(a)lists.boost.org Attached files: 0 This e-mail and any files transmitted with it are confidential, may be legally privileged, and are for the sole use of the intended recipient. Copyright in this e-mail and any accompanying document created by us is owned by us. If you are not the intended recipient of this e-mail or any part of it please telephone our IT Department at the number shown above or by e-mail at info(a)schneidertrading.com. You should not use or disclose to any other person the contents of this e-mail or its attachments (if any), nor take copies. This e-mail is not a representation or warranty and is not intended nor should it be taken to create any legal relations, contractual or otherwise. Schneider Trading Associates Ltd (Registration No. 3692131) is incorporated in England and Wales and the registered office is at 25 Copthall Avenue, London EC2R 7BP. The company is authorised and regulated by the Financial Services Authority

2 1

about delete elements from compressed_matrix
by Peng Wang 13 Jan '09

13 Jan '09

Hi, Dear all, Suppose I want to delete those elements whose values are smaller than 0.5 from compressed_matrix. I have looked for the mailing list but could not find a solution. Could you tell me how I can do this? Thank you very much in advance. Sincerely yours, Wang

1 0

Random Numbers using Boost.
by Atul Kulkarni 13 Jan '09

13 Jan '09

Hi All, I am using boost::random for generating random numbers I am using the default quick start code given up on the web page. I want to generate random numbers between range 1 - n so that they do not repeat themselves for at least n numbers. 1. Is it possible using boost::random? 2. If it is possible what do I need to do except the below code. == boost::mt19937 rng1; boost::uniform_int<> six1(1,30); boost::variate_generator<boost::mt19937&, boost::uniform_int<> > die1(rng1, six1); for(int i=0; i < 29; i++) { cout<<die1()<<endl; } == Thanks in advance. -- Regards, Atul Kulkarni Teaching Assistant, Department of Computer Science, University of Minnesota Duluth Duluth. 55805. www.d.umn.edu/~kulka053

3 2

boost installation problem
by Bijay Panda 13 Jan '09

13 Jan '09

Hi All, I am trying to install boost 1.34.1 in ubuntu 7.10 by the command below. apt-get install libboost-date-time-dev libboost-date-time1.34.1 libboost-dev libboost-doc libboost-filesystem-dev libboost-filesystem1.34.1 libboost-graph-dev libboost-graph1.34.1 libboost-iostreams-dev libboost-iostreams1.34.1 libboost-program-options-dev libboost-program-options1.34.1 libboost-python-dev libboost-python1.34.1 libboost-regex-dev libboost-regex1.34.1 libboost-signals-dev libboost-signals1.34.1 libboost-test-dev libboost-test1.34.1 libboost-thread-dev libboost-thread1.34.1 It's reading all packages from the related sites during installation but finally it's throwing an error like Internal Error, Could not perform immediate configuration (2) on libc6 Can any one suggest how to get rid of this. -- Thanks & Regards Bijay Kumar Panda Mob-9739591816 bijaykumar.mail(a)gmail.com bijaykumar_panda(a)yahoo.com

1 0

Boost.Parameter: copy constructor gets "mistaken" for constructor(const ArgPack& ) in parent class.
by er 13 Jan '09

13 Jan '09

Hello, I have a situation which I can summarize as: #include <boost/parameter/keyword.hpp> #include <boost/parameter/name.hpp> #include <boost/parameter/parameters.hpp> #include <boost/parameter/preprocessor.hpp> BOOST_PARAMETER_KEYWORD(tag, xx) struct A{ template<typename ArgPack> A(const ArgPack& arg):x_(arg[xx|0]){} A(const A&){} A& operator=(const A& that){ if(&that!=this){ x_ = that.x_; return *this; } } unsigned x_; }; 3 copy constructors are shown below, on the last of which works. However it's really the first one that I'd like to get to work. struct B : public A{ template<typename ArgPack> B(const ArgPack& arg):A(arg){} B& operator=(const B& that){ if(&that!=this){ A::operator=(that); return *this; } } //B(const B& that):A(that){} //no match for 'operator[]' in 'arg[(+<unnamed>::xx)->boost::parameter::keyword<T>::operator| [with Default = int, Tag = tag::xx](((const int&)((const int*)(&0))))]'| //B(const B& that):A(static_cast<A>(that)){} //fails too B(const B& that):A((xx=that.x_)){} //requires knowledge of A's members, not satisfactory. }; Any suggestion, please?

2 2

find substring and substring position
by M 13 Jan '09

13 Jan '09

hello all --------- In: http://www.boost.org/doc/libs/1_37_0/doc/html/string_algo/usage.html#id3676… there is an example: Find Iterator = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = string str1("abc-*-ABC-*-aBc"); // Find all 'abc' substrings (ignoring the case) // Create a find_iterator typedef find_iterator<string::iterator> string_find_iterator; for(string_find_iterator It= make_find_iterator(str1, first_finder("abc", is_iequal())); It!=string_find_iterator(); ++It) { cout << copy_range<std::string>(*It) << endl; } // Output will be: // abc // ABC // aBC = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = how do i find the position of each "abc" in: str1 ? thank's meir

2 1

more Boost::Units questions
by Mark Volkmann 12 Jan '09

12 Jan '09

My biggest issue is that my recent software development experience has involved using Java much more than C++ and I'm trying to learn how to use a C++ library that makes pretty heavy use of templates. Is there a tutorial somewhere that shows examples of doing basic things with this library? The kind of things I'm trying to figure out are: - What is the difference between a "measurement" and a "quantity"? Is it that the former doesn't specify a unit? - Does the library provide functions for converting between different units? ... for example, converting from miles to kilometers. If not, is there a recommended way to do this? - Can I only add quantities that have the same unit or can I add ones with different units and the library will handle conversions for me? - How can I extract the numeric value from a quantity? - How can I extract the unit type from a quantity? Thanks! --- Mark Volkmann

3 7

Help with a generic algorithm using boost::MultiArray/Multiple nested range traversal
by Jesse Perla 12 Jan '09

12 Jan '09

Steven: >int index_of(const multi_array<int, 3>& m, int* iter, int dimension) { > int offset = iter - m.origin(); > return(offset / m.strides()[dimension] % m.shape()[dimension] + >m.index_bases()[dimension]); } Thanks for the code suggestion. Does this code work for N dimensions? it appears to. I would prefer to keep a tight count of the indices in the iterator itself to ensure that we don't need to do this expensive calculation each time, but this looks like a pretty good starting point and would work similarly for my sequential ublas::matrix iteration as well. -Jesse

1 0

Help with a generic algorithm using boost::MultiArray/Multiple nested range traversal
by Jesse Perla 12 Jan '09

12 Jan '09

Hi Rob, Thanks for the response. I also think this is a pretty important use case for this great library. Let me justify why I think an Iterator based approach is the best: * For maximum efficiency (I will be using this in numerical simulations), we will want have an incrementing pointer within the data structure pointing to the actual object, and not just the iterator. * Also, if we have a single forward iterator, then we should be able to reuse a bunch of standard algorithms in the cases where we do not need the actual index values or the order of execution doesn't matter. * In the iterator algorithm, I would love to check the ordering of the data from the template parameters. If it is fortran ordering then we would do the loops in the opposite order for example, and this should be based on querying the data structure in the iterator code. * As for your range based use case, I don't know enough about how iterators and ranges interact to see how that would work. * As to implementation of this, thanks for the pointer to Fusion. This indeed seems to be the best approach since the loops can be generated at compile time, and compilers could then do some very fancy optimization on them. Sadly, I am not a template metaprogrammer, or a very good C++ programmer in general, and am terrified to learn it and lose sight of my non-CS research. Now for the semantics of this, it seems to me that the way the iterator concepts are designed, the distance() function is intended to pass back the related index information. Now my question is whether it is OK for the semantics of distance to pass back a boost::array<NUMDIMS> instead? Seems reasonable to me that it would not be based on passing back a scalar value in this case because that is arbitrarily dependent on the column vs. row ordering. And we can easily generate a boost::array from the distance function by looking at the distance between the .begin() for all of our current positions in the sub-iterators? If the iterator framework was there and the distance implemented as vectors, I can imagine the code looking like: int n1 = 3; int n2 = 4; int n3 = 5; boost::multi_array<double, 3> A(boost::extents[n1][n2][n3]); //NOTE SURE OF THE RIGHT SEMANTICS FOR GETTING AN ITERATOR OUTSIDE OF ONE GENERATED BY THE CONTAINER. multi_array_iterator<double, 3> begin = mult_sequential_iterator_begin(A); multi_array_iterator<double, 3> end = mult_sequential_iterator_end(A); for(mult_sequential_iterator<double, 3> iter = begin; iter != end; ++iter) *iter = f(distance(begin, iter); //POSSIBLE IMPLEMENTATION OF DISTANCE template<int NUMDIMS> boost::array<NUMDIMS> distance(const mult_sequential_iterator& iter1, const mult_sequential_iterator& iter1) const { static_assert(iter1::dimensionality == iter2::dimensionality) boost::array<NUMDIMS> dist; foreach dimension //PSEUDOCODE, FROM FUSION???? array<dimension> = distance(iter1.get_sub_iter<dimension>(), iter2.get_position<dimension>()); //here get_sub_iter returns the sub-iterator stored for that current dimension in the iterator. } template<int NUMDIMS> //HERE THE FUNCTION WOULD BE BASED ON A BOOST::ARRAY. double f(const boost::array<NUMDIMS>& indices) { ...} //AND LETS SAY WE WANTED TO NEGATE THE ENTIRE DATA STRUCTURE, NOW CAN USE STD: int n1 = 3; int n2 = 4; int n3 = 5; boost::multi_array<double, 3> A(boost::extents[n1][n2][n3]); boost::multi_array<double, 3> B(boost::extents[n1][n2][n3]); std::transform(mult_sequential_iterator_begin(A), mult_sequential_iterator_end(A), mult_sequential_iterator_begin(B), negate<double>()); //AND IF WE ADDED THIS ITERATOR TO THE CODE FOR THE MULTDIM: A.begin_sequential() could return the sequential iterator...

2 1

what are the different problems that can occur in network connections and send/recive, what are the related exceptions & errors, and what are the solutions (boost.asio)?
by Saeed Aliakbarian 12 Jan '09

12 Jan '09

While working with boost.asio networking features, in many cases problems may occur due to network connection erros, programmin errors, etc. In each case a different event occurs in the program. Most of the times, and error code is returned or an exception is thrown. I could not find a list of this error causes and their corresponding error codes or exceptions. The only way I could mange only a part of this problem was trough testing, creating a specific error manually, catching the exception or the error code, and the try to manage it in the correct way I suggested myself!!!! If there is not such a page containing my required information, do you agree there is a need for one? Can anyone help me find a better way to do what I am trying to do? Regards Saeed Aliakbarian

1 0

Boost Units standardization?
by Mark Volkmann 12 Jan '09

12 Jan '09

What is the status on getting the Units library to be part of the C++ standard? Is this being pursued? --- Mark Volkmann

2 1

[date_time]utc_to_local crashes
by Jan Deinhard 12 Jan '09

12 Jan '09

Hi, I get a crash calling utc_to_local with dates past 2038-Jan-19 03:14:07. I'm compiling with Visual C++ 2005. using namespace boost; posix_time::ptime pt(gregorian::date(2038, 1, 19), posix_time::hours(3) + posix_time::minutes(14) + posix_time::seconds(8)); date_time::c_local_adjustor<posix_time::ptime>::utc_to_local(pt); Jan

1 0

[Ranges] make_view: when will it be part of a release?
by Christoph Duelli 12 Jan '09

12 Jan '09

I recently had the need to produce from a vector<uint> a string representation (like for IPs) like "23.1.4.742.234.0". I thought that if only those were uints were strings I could boost::join them together. After a bit of searching the internet I found: make_view... very helpful, as indeed operating on iterators and containers only is a bit restrictive. So, first, I'd like to express my thanks for providing such helpful libraries (I love it how Boost.Bind and ASIO fit together, e.g.!). Great job everyone! Is there a better way to get to the string representation hinted to above? What I did is: #include <boost/view.hpp> // not yet part of Boost 1.37 // Helper to convert an uint to a std::string struct Stringer { std::string operator() (unsigned u) const { return boost::lexical_cast<std::string>(u); } }; boost::function<std::string(unsigned)> stringer = Stringer(); // way better than writing the loop by hand! std::string s = boost::join(boost::make_view(data_, stringer), "."); // Does not compile with gcc 4.2.1 // std::string s = boost::join(boost::make_view(data_, Stringer()), "."); Is there some existing class that makes my helper class Stringer unnecessary? (Can I use lexical_cast here w/o a helper class?) Is it possible to avoid putting the functor into a local Boost.Function variable? When will range_ex and make_view() be part of a Boost release? 1.38? (Please?) Best regards, and thank you -- Christoph Duelli

5 5

binary archive with text file
by gtsml owevwr 12 Jan '09

12 Jan '09

Hi, I just spend a entire day to realize this code was wrong: std::ofstream ofs(filename.c_str()); boost::archive::binary_oarchive oa(ofs); oa << (*this); And this one was right: std::ofstream ofs(filename.c_str(), std::ios::binary); boost::archive::binary_oarchive oa(ofs); oa << (*this); The consequence of the first code is a "stream_error" throw which doesn't say much about the problem. Instead, an exception should be thrown earlier on if the file is not in binary mode. thanks alot to all the boost contributors, Frank

2 2

Re: [Boost-users] Serialization of forward declared class
by niranjan bangera 12 Jan '09

12 Jan '09

hi all, > i have done in the following way.. even am getting some errors, did i miss > any of the headers, or added extra(added extra for sure). > > Any suggestions will be accepted > > #include <boost/serialization/utility.hpp> > #include <boost/serialization/collection_traits.hpp> > #include <boost/serialization/serialization.hpp> > #include <boost/serialization/base_object.hpp> > #include <fstream> > #include <boost/archive/text_iarchive.hpp> > #include <boost/archive/text_oarchive.hpp> > #include <boost/serialization/assume_abstract.hpp> > > class fd; > > class base: class derived > { > ..... > fd *ptr; > ..... > > friend class boost::serialization::access; > template<class Archive> > void serialize(Archive & ar, const unsigned int file_version) > { > (void) file_version; > ar & ptr; > ar & boost::serialization::base_object<derived>(*this); > > } > > }; //end of class base > > Version::1.36.0 > compliler: g++ 4.1.1.... > > i am getting a error : > error: forward declaration of 'struct fd' > /boost_1_36_0/include/boost-1_36/boost/serialization/access.hpp:109: error: > inva > lid use of undefined type 'struct > > /project/wipro_virtutech_nobackup/users/niranjan/project_new/boost_1_36_0/include/boost-1_36/boost/serialization/extended_type_info_typeid.hpp:117: > note: neither the destructor nor the class-specific operator delete will be > called, even if they are declared when the class is defined. > > Thanks in advance..... >

2 1

Help with a generic algorithm using boost::MultiArray
by Jesse Perla 11 Jan '09

11 Jan '09

Hi:I would like to write an algorithm that operates on a multi-array and am having trouble figuring out how to work with arbitrary numbers of dimensions. A simplified version of my problem that captures all of the types of access I need is: 1) You have a multi-array of (statically defined at compilation) dimensionality N. 2) This data is filled in, but the number of elements in each dimension will frequently be different. 3) Write a function that takes a reference to this multiarray and assigns it the value which is the sum of all of the actual indices(this is contrived, but if I can solve this, I can solve my problem... The key is I need an iterator moving through all dimensions, and I need the index numbers for my calculations). Here is some pseudocode that gives the kind of iterator I would love to have: template<int N> void test_setting(multi_array<double, N>& arr) { //HERE IS PSEUDOCODE: LETS SAY THERE WAS A WAY TO GET AN INDEX THAT YIELDED THE ACTUAL INDEX NUMBERS BUT STILL ACTED AS A POINTER. for(FANCYINDEX = arr.begin(); FANCYINDEX != arr.end(); ++FANCYINDEX) { boost::array<int, N> indicies = FANCYINDEX.get_indices(); //SAY IT RETURNED THE ACTUAL NUMBERS *FANCYINDEX = sum(indicies); //Alternatively, could we go: arr(indicies) = sum(indices); if there is no way for it to be a proper pointer. } } //TO CALL: const int NUMDIMS = 3; //Static at compile time. int n1 = 3; //These might be dynamic. int n2 = 4; int n3 = 5; boost::multi_array<double, NUMDIMS> A(boost::extents[n1][n2][n3]); test_setting(A); Any ideas on how this could be implemented without too much code? Thanks, Jesse

2 1

[proto] iterating array expressions
by Daniel Oberhoff 11 Jan '09

11 Jan '09

Hi, First off: much thanks for previous replies to related problems. One comment: I got told to properly use proto on my array class I needed to separate data from user interface. I found now that it is possible to define expressions non-intrusively without having to change my array structure, but still I understand the motivation, and possibly this way is better anyway. Anhow, now to my new problems. I have now set up proto to be able to evaluate expressions such as: A(_i,_j) + B(_j,_i*_j-2) at a given index (i.e. substituting given numbers for index placeholders _i and _j). Here A and B are of my own n-dimensional array class. Now I would like to iterate such expressions efficiently to evaluate assignment expressions like: C = A(_i,_j) + B(_j,_i*_j-2); efficiently. What I want to do is base it around basic "iterators" for each array indexing expression ( i.e. B(_j,_i*_j-2) and A(_i,_j) in the example) that know how to move to a certain setting for the index placeholders and how to advance along the index placeholders (e.g. advance the data pointer for _i -> _i+1, _j -> _j+1). I think I could implement such iterators (not in the STL sense, since I dont use begin/end, but enough for what I need) for the array indexing expressions, but I dont know how to generate the iterator for the complete expression. I would like such an iterator be generated automatically given the individual iterators for the array indexing expressions and be able to call move, advance, and evaluate on such an iterator. Any hints on where to start before I lose myself deeply in the documents and examples? Any help much appreciated. Best Daniel

2 1

[thread] assertion error in timed_lock
by Ernst Murnleitner 11 Jan '09

11 Jan '09

Hello, Sometimes - especially if I start the program with valgrind - my program exits with /usr/include/boost/thread/pthread/recursive_mutex.hpp:180: bool boost::recursive_timed_mutex::timed_lock(const boost::system_time&): Assertion `!res || res==16' failed. The line 180 is in this function: 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; } pthread_mutex_timedlock returned ETIMEDOUT. Can the BOOST_ASSERT be changed that it only logs a warning? In a production environment it is not nice, if the program exits. In the man page of pthread_mutex_timedlock I read: ----- ... The pthread_mutex_timedlock() function shall fail if: EINVAL The mutex was created with the protocol attribute having the value PTHREAD_PRIO_PROTECT and the calling thread's priority is higher than the mutex' current priority ceiling. EINVAL The process or thread would have blocked, and the abs_timeout parameter specified a nanoseconds field value less than zero or greater than or equal to 1000 million. ETIMEDOUT The mutex could not be locked before the specified timeout expired. ... ------ Isn't ETIMEDOUT a return value which has to be expected? Greetings, Ernst

2 1

[Spirit] Version question
by Peter Barker 11 Jan '09

11 Jan '09

Hello, I want to use Boost.Spirit to parse some data so I'm reading the documentation. I'm a little confused because the documentation linked to from 1.37.0 takes me to a Spirit user's guide apparently regarding "Spirit classic". Does Boost 1.37.0 include two Spirit versions? If so, do I need to be looking elsewhere for documentation on how to use the non-classic version? Essentially I want to use the latest version of Spirit that comes with Boost 1.37.0 and would like guidance on that please. Regards, Pete

2 3

[mp_math] Wrong sign for mp_int<> after addition.
by Jeroen N. Witmond 11 Jan '09

11 Jan '09

Greetings, I've stumbled across a problem in mp_math in the sandbox, revision 50541. The code below (a Boost.Test test case) demonstrates that the problem is present only for mp_int<> and not for int. The message I get is wrong-value.cpp(16): error in "Mixed_integers<N5boost7mp_math6mp_intISaIvENS0_13mp_int_traitsIjyEEEE>": check j == 4 failed [-4 != 4] Regards, Jeroen. #define BOOST_TEST_DYN_LINK #define BOOST_TEST_MODULE Wrong_sign #include <boost/test/unit_test.hpp> #include <boost/mp_math/mp_int.hpp> #include <boost/mpl/list.hpp> typedef boost::mpl::list< int, boost::mp_math::mp_int<> > test_types; BOOST_AUTO_TEST_CASE_TEMPLATE( Mixed_integers, Type, test_types ) { Type i(-1); BOOST_CHECK_EQUAL(i, -1); Type j = i + 5; BOOST_CHECK_EQUAL(j, 4); // Line 16. }

1 0

[GIL] trouble loading image files
by Kenny Riddile 11 Jan '09

11 Jan '09

This is my first time using GIL and I'm having some difficulty loading jpeg and png files. Here's some code: rgb8_image_t image1; jpeg_read_and_convert_image<rgb8_image_t>( "file.jpg", m_image1 ); rgb8_image_t image2; png_read_and_convert_image<rgb8_image_t>( "file.jpg", m_image2 ); Attempting to load the jpeg causes a crash at jpeg_read_header(&_cinfo,TRUE); in jpeg_io_private.hpp. Attempting to load the png causes a similar crash at png_read_info(_png_ptr, _info_ptr); in png_io_private.hpp. I'm using the libjpeg and libpng builds from these sites: http://gnuwin32.sourceforge.net/packages/jpeg.htm http://gnuwin32.sourceforge.net/packages/libpng.htm

1 1

[datetime] local_date_time and time zone issues
by Boris 10 Jan '09

10 Jan '09

I've been playing with local_date_time and time zones but don't understand the return values of utc_time(), local_time() and local_time_in(). Here's a small program: ---------- #include <boost/date_time/local_time/local_time.hpp> #include <iostream> int main() { boost::local_time::time_zone_ptr tz1(new boost::local_time::posix_time_zone("CET+1")); boost::posix_time::ptime pt1(boost::gregorian::date(2009, 1, 5), boost::posix_time::time_duration(12, 0, 0)); boost::local_time::local_date_time dt1(pt1, tz1); std::cout << dt1.utc_time() << std::endl; std::cout << dt1.local_time() << std::endl; boost::local_time::time_zone_ptr tz2(new boost::local_time::posix_time_zone("CET+2")); std::cout << dt1.local_time_in(tz2) << std::endl; } ---------- The output of this program is: 2009-Jan-05 12:00:00 2009-Jan-05 13:00:00 2009-Jan-05 14:00:00 CET The program uses CET which is the abbreviation for Central European Time which is UTC+1. If the UTC time is now 12:00:00 the local time in CET+1 must be 14:00:00 (and not 13:00:00). Accordingly the local time in CET+2 must be 15:00:00. Why Boost.DateTime appends "CET" to the local time in CET+2 I don't understand either. Is this a bug or do I misunderstand these functions? Boris

3 5

Boost Interprocess condition variables
by Federico Golfrè Andreasi 10 Jan '09

10 Jan '09

Hi! I'm using condition variables of Boost.interprocess 1.36.0 to manage a synchronized access to a shared memory segment by two tasks. I found a problem when: task 1 is waiting on a condition variable and task 2 crashes during his execution, so task 1 waits forever on that variable. How can I kill also task 1? thank you, Federico

3 4

[graph] Bundled properties in subgraphs
by Grzegorz Slodkowicz 10 Jan '09

10 Jan '09

Hello, It seems that bundled properties still don't work with subgraphs. I found a mention of the problem dating back to 2005 [1], a closed ticket for the issue [2] and another post [3], this time from 2008, with an ex tempore fix (which doesn't work for me). Could someone possibly account for that? [1] http://lists.boost.org/boost-users/2005/03/10844.php [2] https://svn.boost.org/trac/boost/ticket/380 [3] http://www.nabble.com/-graph--property_map-from-bundled-properties-in-a-sub… TIA, Greg Slodkowicz

2 3

[date_time] error with g++-4.3.2
by frederic.bron＠alcan.com 10 Jan '09

10 Jan '09

Using 1.37.0 on x86_64-pc-linux. I get the following error compiling a program that includes date_time.hpp with g++-4.3.2. The web site says that g++ 4.3.2 is tested for 1.37.0. Any clue? In file included from boost/date_time/local_time/tz_database.hpp:14, from boost/date_time/local_time/local_time.hpp:19, from boost/date_time.hpp:15, boost/date_time/tz_db_base.hpp:161: error: declaration of 'typedef class boost::date_time::dst_adjustment_offsets<typename time_zone_type::time_duration_type> boost::date_time::tz_db_base<time_zone_type, rule_type>::dst_adjustment_offsets' boost/date_time/time_zone_base.hpp:76: error: changes meaning of 'dst_adjustment_offsets' from 'class boost::date_time::dst_adjustment_offsets<typename time_zone_type::time_duration_type>' no particular error building boost; final message is only: ...updated 7627 targets... Frédéric Bron ___________________________________ Frédéric Bron (frederic.bron(a)alcan.com) Unité ALT, Alcan CRV, BP 27, 38341 Voreppe +33 4 76 57 81 72, +33 6 07 48 56 67 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.

3 4

BoostCon 2009: Submission deadline extended
by Hartmut Kaiser 10 Jan '09

10 Jan '09

Hi all, The deadline for the submission of session proposals has been extended to January 20th, 2009. No further extensions will be granted. Please find below the original call for participation. Conference registration will be available at http://www.boostcon.com/registration. Regards Hartmut ---------------------------------------------------------------------------- 3rd annual Boost Conference 2009 Aspen CO, USA, May 3-9, 2009, www.boostcon.com ---------------------------------------------------------------------------- Call for participation ---------------------- Promising to be the main face-to-face event for all things Boost (www.boost.org) BoostCon'09 opens the door to your C++ future. From using the Boost libraries to writing and maintaining them, from evangelizing to deploying Boost within your organization, from infrastructure and process to vision and mission, and from TR1 to TR2 and the new C++0x Standard, BoostCon brings together the sessions, the colleagues, and the inspiration to support your work with C++ and Boost in particular for the next year. To reflect the breadth of the Boost community, the conference includes sessions aimed at two constituencies: Boost end-users and hard-core Boost library and tool developers. The program fosters interaction and engagement within and across those two groups, with an emphasis on hands-on, participatory sessions. Session topics -------------- * Topics of interest include, but are not restricted to, the following: * General tutorial sessions introducing one or more Boost libraries * In-depth sessions on using specific libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * C++0x and how it will change life for users and library writers * TR1 and TR2 * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Other topics likely to be of great interest to Boost users and Developers. Interactive and collaborative sessions are encouraged, as this is the nature of both the on-line Boost community and the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. Session formats --------------- Presentations ............. Presentations focus on a practitioner's ideas and experience with anything relevant to Boost and Boost users. Panels ...... Panels feature three or four people presenting their ideas and experiences relating to Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials ......... Tutorials are sessions at which instructors teach conference participants specific Boost-relevant skills. Workshops ......... Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations ............................. These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems boost libraries. Tool Vendors Presentations .......................... We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. Submitting a proposal --------------------- Standard Sessions are 90 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 90 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned 90 minute, three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other * A paragraph or two describing the topic covered, suitable for the conference web site * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half-day, full day * Alternate lengths, if you are willing to make adjustments: 10-20 minute lightning-talks, 45 minutes, 90 minutes, half-day, full day * Audience: users, developers, both * Level: basic, intermediate, advanced * A biography, suitable for the conference web site * Your contact information (will not be made public) Submission details ------------------ All submissions have to be done through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=boostcon09. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted papers will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the BoostCon CD handed out to attendees. For general information on the BoostCon 2009 paper submission or the scope of technical papers solicited, please refer to the conference website at www.boostcon.com. For any other questions about the submission process or paper format, please contact the Program Committee at boostcon09(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to BoostCon. Important dates --------------- Proposals for submissions due: January 20th 2009. Proposals acceptances sent (tentative program available): February 10th, 2009 Fully scheduled program available: March 1st, 2009 Session materials due: April 1st 2009. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) David Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

Re: [Boost-users] Boost-users Digest, Vol 1870, Issue 4
by niranjan bangera 10 Jan '09

10 Jan '09

i have done in the following way.. even am getting some errors, did i miss any of the headers, or added extra(added extra for sure). Any suggestions will be accepted #include <boost/serialization/utility.hpp> #include <boost/serialization/collection_traits.hpp> #include <boost/serialization/serialization.hpp> #include <boost/serialization/base_object.hpp> #include <fstream> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/assume_abstract.hpp> class fd; class base: class derived { ..... fd *ptr; ..... friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int file_version) { (void) file_version; ar & ptr; ar & boost::serialization::base_object<derived>(*this); } }; //end of class base Version::1.36.0 compliler: g++ 4.1.1.... i am getting a error : error: forward declaration of 'struct fd' /boost_1_36_0/include/boost-1_36/boost/serialization/access.hpp:109: error: inva lid use of undefined type 'struct /project/wipro_virtutech_nobackup/users/niranjan/project_new/boost_1_36_0/include/boost-1_36/boost/serialization/extended_type_info_typeid.hpp:117: note: neither the destructor nor the class-specific operator delete will be called, even if they are declared when the class is defined.

1 0

[typeof] fails with Intel Compiler v11.0 on windows
by Mikko Vainio 10 Jan '09

10 Jan '09

Dear boosters, Could someone out there verify that the following piece of code fails with Intel Compiler v11.0.066 on Windows (Microsoft SDK v6.1): --------------------- #include <boost/typeof/typeof.hpp> #include <vector> using namespace std; int main(int argc, char* argv[]) { vector< int > testvec; BOOST_TYPEOF( testvec.begin() ) i = testvec.begin(); return 0; } --------------------- The compiler output is: --------------------- using typeof emulation C:\boost\include\boost-1_37\boost/typeof/encode_decode.hpp(50): error: incomplete type is not allowed struct encode_type : BOOST_TYPEOF_ENCODE_NS_QUALIFIER::encode_type_impl<V, T> ^ detected during instantiation of class "boost::type_of::encode_type<V, T> [with V=boost::type_of::vector0<void>, T=std::_Vector_iterator<int, std::allocator<int>>]" at line 9 of "typeoftest.cpp" ... --------------------- Preprocessor output shows that encode_type_impl is indeed just forward-declared before encode_type: --------------------- #line 30 "C:\\boost\\include\\boost-1_37\\boost/typeof/encode_decode.hpp" namespace { namespace boost_typeof { template<class V, class Type_Not_Registered_With_Typeof_System> struct encode_type_impl; <snip> }} namespace boost { namespace type_of { template<class V, class T> struct encode_type : boost_typeof::encode_type_impl<V, T> {}; template<class Iter> struct decode_type : boost_typeof::decode_type_impl< typename Iter::type, typename Iter::next > {}; }} --------------------- Is this a bug? Should a header containing the implementation of encode_type_impl be included prior to encode_decode.hpp? Any help appreciated. Cheers, Mikko

2 1

Units: adding quantities
by Mark Volkmann 09 Jan '09

09 Jan '09

I have a method that takes a parameter of type quantity<feet> where feet is defined by the following typedef: typedef boost::units::us::foot_base_unit::unit_type feet; I also have this typedef: typedef bu::us::inch_base_unit::unit_type inches; Do I really need to define a typedef like this for every measurement type I want to use? I certainly don't want to specify all those namespaces every time I use one of the measurement types, but this approach seems a bit tedious. I'd like to do something like this: a.setWingspan(195*feet() + 8*inches()); but that doesn't work because there is no match for operator+. What's a good way to add inches to a feet quantity? --- Mark Volkmann

3 3

getting started with Boost::Units
by Mark Volkmann 09 Jan '09

09 Jan '09

The first thing I'm trying to do is determine how to represent a velocity in miles per hour. I haven't been able to figure it out from the documentation. Any hints would be appreciated. I also need to figure out the best way to get string representations of quantities that include their units for output. --- Mark Volkmann

4 7

forward declared class serialization
by niranjan bangera 09 Jan '09

09 Jan '09

hi all, I am in learning stage of the boost serialization concept. I have one small problem in my project again. Here i have to serialize a pointer of a forward declared class. i dont how to do this. Pls help me to do this. May be the solutuion is too tough, it seems to tough for me, coz i have less knowledge about the c++. I am using, Version:1.36.0 compiler: gnu-gcc-4.1.1-binutils-2.16.1/x86_64-pc-linux2.4/bin/g++ my code looks like. class fd; class base: class derived { ..... fd *ptr; ..... }; i have done it like serialization method is class fd; class base: class derived { ..... fd *ptr; ..... friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int file_version) { (void) file_version; ar & ps_core_; ar & boost::serialization::base_object<derived>(*this); } }; //end of class base Thanks in advance, Thanks for your time. Niranjan

2 1

Boost and Intel Compiler 11
by Matthieu Brucher 09 Jan '09

09 Jan '09

Hi, I've read on the archive that some work needed to be done to support Intel Compiler 11 (Linux). Was progress made in that matter ? Matthieu -- Information System Engineer, Ph.D. 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

4 15

[Thread] order of shared_lock and unique_lock acquisitions
by Roland Bock 09 Jan '09

09 Jan '09

Hi, I am trying to use shared_lock and unique_lock on a shared_mutex to allow read-functions to access a certain resource in parallel, but write functions use the resource exclusively. Is there a way to determine the order in which the (shared) locks are acquired? I tried testing with the attached program and got rather weird and (seemingly) non-deterministic results. In the test program (see attachment), I start 9 threads of readers(r) and writers(w). Before doing anything else, the sleep and wake up in groups. rrww rr w rr There is one second delay between the groups I would expect to see them working in this order: rr w w rr w rr The first group could be scrambled of course since they race for the lock. But at least I would expect the order of groups to be maintained. I get quite different results, though, and the results differ from run to run. The weirdest result I saw until now is attached. rr rrr (these do not start before the first group is finished) w w w (the last writer is handled in second position btw) r This I do not understand at all. The readers are using the shared mutex. Why is the second group waiting for the first to be finished? And how can the last writer be handled in second place? I am at a total loss here... System information: ------------------- boost-1.36 Ubuntu-8.04 gcc-4.2.4 Intel Quad Core processor Thanks in advance, Roland reader(0) at 0 sleeping 5 reader(1) at 0 sleeping 5 writer(2) at 0 sleeping 5 writer(3) at 0 sleeping 5 reader(4) at 0 sleeping 6 reader(5) at 0 sleeping 6 writer(6) at 0 sleeping 7 reader(7) at 0 sleeping 8 reader(8) at 0 sleeping 8 reader(0) at 5 trying to acquire lock reader(0) at 5 got lock reader(1) at 5 trying to acquire lock reader(1) at 5 got lock writer(2) at 5 trying to acquire lock writer(3) at 5 trying to acquire lock reader(4) at 6 trying to acquire lock reader(5) at 6 trying to acquire lock writer(6) at 7 trying to acquire lock reader(7) at 8 trying to acquire lock reader(8) at 8 trying to acquire lock reader(0) at 10 finished reader(1) at 10 finished reader(4) at 10 got lock reader(5) at 10 got lock reader(7) at 10 got lock reader(4) at 15 finished reader(5) at 15 finished reader(7) at 15 finished writer(3) at 15 got lock writer(3) at 20 finished writer(6) at 20 got lock writer(6) at 25 finished writer(2) at 25 got lock writer(2) at 30 finished reader(8) at 30 got lock reader(8) at 35 finished

4 6

[BGL] max-flow/min-cut value of G for every pair of nodes s, t
by Rui Carvalho 09 Jan '09

09 Jan '09

Hi, Are there any optimized algorithms in the BGL to compute max-flow for every pair of nodes in a graph? Many thanks, R.

1 0

What help can Boost offer?
by Robert Jones 09 Jan '09

09 Jan '09

I often want to express intent of this sort... struct X {...}; void f( X & ); X my_array[3][6][11]; for (unsigned i=0;i!=3;++i) for(unsigned j=0;j!=6;++j) for(unsigned k=0;k!=11;++k) f( my_array[i][j][k] ); Apart from all the grottiness on hardcoded sizes and loop indices, which is just for exposition, is there a nice idiom in boost to do traversals over multiple indices in this way, or perhaps multiple ranges? Thanks, Rob.

3 2

boost-test with wxWidgets
by Matěj Týč 09 Jan '09

09 Jan '09

Hello all, is there anyone, who knows the Boost Unit Testing Framework (UTF)? I am developing a project that uses wxWidgets library and I would like to test some aspects where wxWidgets stuff is involved. The problem is that wxWidgets like to implement the main() function via IMPLEMENT_APP macro and I have found quite troublesome to work around that. When one lets UTF to generate the main() function, everything is very easy. The question is: There must be some sane way how to initialize UTF and launch a testsuite when wxWidgets are ready. I also know that I should supply the framework with argc and argv since the verbosity of the test module output can be tweaked. I have learned so far that I have to implement function init_unit_test_suite( int argc, char* argv[] (but I don't have an idea how), and that I have to register test cases (that should be OK) and to create some master test suite. Am I missing something here as well? I haven't found anything in the documentation that would lead me to the result, could you help me and possibly extend the documentation a little bit so wxWidgets users could start using UTF massively? :-) Regards, Matej

2 6

Boost.Function in 1.37.0
by Amit Sonawane 09 Jan '09

09 Jan '09

Environment: WinXP SP2/Visual Studio Team System 2005/Boost 1.37.0 32-bit Using boost.function in Boost 1.37.0 generates several errors. Compiler extract : 28>c:\software\boost\boost_1_37_0\boost_1_37_0\boost\function\function_t emplate.hpp(80) : error C2143: syntax error : missing ';' before 'namespace' 28>c:\software\boost\boost_1_37_0\boost_1_37_0\boost\function\function_t emplate.hpp(980) : error C2838: '()' : illegal qualified name in member declaration 28> c:\software\boost\boost_1_37_0\boost_1_37_0\boost\function\function_temp late.hpp(80) : see reference to class template instantiation 'boost::function0<R>' being compiled 28>c:\software\boost\boost_1_37_0\boost_1_37_0\boost\function\function_t emplate.hpp(995) : error C2804: binary 'operator ==' has too many parameters 28>c:\software\boost\boost_1_37_0\boost_1_37_0\boost\function\function_t emplate.hpp(1002) : error C2804: binary 'operator !=' has too many parameters 28>c:\software\boost\boost_1_37_0\boost_1_37_0\boost\function\function_t emplate.hpp(1098) : error C2764: 'R' : template parameter not used or deducible in partial specialization 'boost::function<R(void)>' 28>c:\software\boost\boost_1_37_0\boost_1_37_0\boost\function\function_t emplate.hpp(1098) : error C3412: 'boost::function<R(void)>' : cannot specialize template in current scope 28>c:\software\boost\boost_1_37_0\boost_1_37_0\boost\function\function_t emplate.hpp(90) : error C2061: syntax error : identifier 'function_buffer' 28> c:\software\boost\boost_1_37_0\boost_1_37_0\boost\function\function_temp late.hpp(96) : see reference to class template instantiation 'boost::boost::detail::function::function_invoker1<FunctionPtr,R,T0>' being compiled 28>c:\software\boost\boost_1_37_0\boost_1_37_0\boost\function\function_t emplate.hpp(106) : error C2061: syntax error : identifier 'function_buffer' 28> c:\software\boost\boost_1_37_0\boost_1_37_0\boost\function\function_temp late.hpp(113) : see reference to class template instantiation 'boost::boost::detail::function::void_function_invoker1<FunctionPtr,R,T0 >' being compiled In Boost 1.36.0 the code complies ok. Is it boost function or my code. Esta mensagem pode conter informação confidencial e/ou privilegiada. Se você não for o destinatário ou a pessoa autorizada a receber esta mensagem, não deverá utilizar, copiar, alterar, divulgar a informação nela contida ou tomar qualquer ação baseada nessas informações. Se você recebeu esta mensagem por engano, por favor avise imediatamente o remetente, respondendo o e-mail e em seguida apague-o. Agradecemos sua cooperação. This message may contain confidential and/or privileged information. If you are not the addressee or authorized to receive this for the addressee, you must not use, copy, disclose, change, take any action based on this message or any information herein. If you have received this message in error, please advise the sender immediately by reply e-mail and delete this message. Thank you for your cooperation.

6 5

example of factory where derived class constructors have different signatures
by Victor Whiskey Yankee 09 Jan '09

09 Jan '09

Hi, How factory can be used when derived classes need constructing with different args? Could someone show an sample? Thank you, Vic

3 2

[Boost.Graph] - problem with A* and bundled properties
by David Conner 08 Jan '09

08 Jan '09

I'm trying to use Bundled properties with astar. But I get the following error, below. 1>C:\Program Files\Microsoft Visual Studio 9.0\VC\include\limits(109) : error C2440: '<function-style-cast>' : cannot convert from 'int' to 'C' 1> No constructor could take the source type, or constructor overload resolution was ambiguous 1> C:\Program Files\Microsoft Visual Studio 9.0\VC\include\limits(107) : while compiling class template member function 'C std::numeric_limits<_Ty>::max(void) throw()' 1> with 1> [ 1> _Ty=C 1> ] 1> C:\Boost\include\boost-1_36\boost/graph/astar_search.hpp(342) : see reference to class template instantiation 'std::numeric_limits<_Ty>' being compiled 1> with 1> [ 1> _Ty=C 1> ] I noticed that this is the same problem as a post from January 2008 (Date: 2008-01-09 17:56:40), but there was no reply posted. The source code is attached; I get the same error with Boost 1.36 or 1.37 Here are my structures: class EdgePropertyMap { public: cost weight; }; typedef boost::property_map<mygraph_t, cost EdgePropertyMap::*>::type WeightMap; WeightMap weightmap = boost::get(&EdgePropertyMap::weight, g); boost::astar_search (g, start, distance_heuristic<mygraph_t, cost, location*>(locations, goal), boost::visitor(astar_goal_visitor<vertex>(goal)). // Only the first of named parameters needs boost:: predecessor_map(&p[0]).distance_map(&d[0]) );//. Any help? Thanks, David ----- Earlier post -------------------------------------------------------------------------- Christopher Gay (cgay_at_[hidden]) Date: 2008-01-09 17:56:40 I'm having a problem implementing A*. I used Mr Beevers cities example as a spring board for my own version. I am using bundled properties and I am getting an error that I am unsure of how to correct. The error revolves around the CostMap template parameter for the astar_search. It typedefs the value_type to 'C' and the error tells me that I cannot convert int to 'C' in the std::numeric_limits<C>::max call in astar_dispatch2. I am not passing an object/container for the CostMap parameter. Attached are the files I am working with. Thanks for your help! Chris Gay

1 0

Error during mipsel cross compile of asio example
by Gordon Smith 08 Jan '09

08 Jan '09

Hello, I'm cross compiling an asio http server example from x86 linux to mipsel linux using boost-1.37.0 and gcc 4.1.2. I've compiled libraries successfully using bjam but the http server code produces the following errors: # export ARCH=mipsel # export CC=mipsel-ssd-linux-gnu-gcc # export CXX=mipsel-ssd-linux-gnu-g++ # export LD=mipsel-ssd-linux-gnu-ld # make mipsel-ssd-linux-gnu-gcc -L/usr/cross/mipsel/mipsel-ssd-linux-gnu/lib -L../boost-1.37.0/lib-mipsel connection.o connection_manager.o mime_types.o posix_main.o reply.o request_handler.o request_parser.o server.o -o httpd -lpthread -lstdc++ -lboost_thread-gcc-mt-1_37 -lboost_system-gcc-mt-1_37 connection.o: In function `boost::detail::atomic_conditional_increment(int*)': connection.cpp:(.text._ZN5boost6detail28atomic_conditional_incrementEPi[boost::detail::atomic_conditional_increment(int*)]+0x78): undefined reference to `__sync_val_compare_and_swap_4' connection.o: In function `boost::detail::atomic_decrement(int*)': connection.cpp:(.text._ZN5boost6detail16atomic_decrementEPi[boost::detail::atomic_decrement(int*)]+0x2c): undefined reference to `__sync_fetch_and_add_4' connection.o: In function `boost::detail::atomic_increment(int*)': connection.cpp:(.text._ZN5boost6detail16atomic_incrementEPi[boost::detail::atomic_increment(int*)]+0x2c): undefined reference to `__sync_fetch_and_add_4' ../boost-1.37.0/lib-mipsel/libboost_thread-gcc-mt-1_37.a(thread.o): In function `boost::thread::get_thread_info() const': thread.cpp:(.text+0x478): undefined reference to `__sync_fetch_and_add_4' ../boost-1.37.0/lib-mipsel/libboost_thread-gcc-mt-1_37.a(thread.o): In function `boost::detail::thread_data_base::~thread_data_base()': thread.cpp:(.text+0x7ac): undefined reference to `__sync_fetch_and_add_4' thread.cpp:(.text+0x7e0): undefined reference to `__sync_fetch_and_add_4' ... snip ... I've seen "Disable sync use for arm and hppa" at https://svn.boost.org/trac/boost/changeset/44440 I've also glanced at detail/sp_counted_base.hpp and detail/atomic_count_sync.hpp. Is this a simple matter of avoiding this code as in the changeset, or should it be written? I don't know much about the MIPS architecture. Thank you, Gordon

2 1

serilalization of union
by niranjan bangera 08 Jan '09

08 Jan '09

Hi all, I am using the boost version 1.36.0 , linux platform. In my project i have to srialize a Union . i tried in the same way that classes and structures been serialized. But it gives a compilation error. How can i do that.. Please help me doing this. union myunion { uint32_t a; float t; }; i tried using like this. union myunion { uint32_t a; float t; template <class Archive> void serialize(Archive & ar, const unsigned int file_version) { ar & a; ar & t; } i get an error when iwant to serialize the object of the union saying myunion is not a class or struct type. Pls help me to do this. thanks in Advance.

4 7

[ublas] why is there no constructor that fills the matrix with a default value
by Thorsten Ottosen 08 Jan '09

08 Jan '09

Hi, I was a bit surprised that there is no way to fill a triangular_matrix with a default value. Say, I would have expected this to work: triangular_matrix<double> m(42,42,42); Is there any reason why this constructor is not provided? Thanks -Thorsten

1 0

[tuples] Lifting hardcoced limitations by using BOOST_PP
by Joel Falcou 08 Jan '09

08 Jan '09

I've been extensively using boost::tuple for a while and stumbled upon various tuple size limitation bound to the fact that the tuple implementation has hardcoded the maximum size of the tuple<> class and related function/meta-functions like tie for example or make_tuple. Is there anything in tuple design that prevent using Boost::Preprocessor to make it more customizable ? Is there an interest to such an update or is tuples more or less on the way to deprecation considering boost::fusion ?

1 0

XML serialization of non-std::string types
by Thomas Sondergaard 08 Jan '09

08 Jan '09

I'm using boost::serialization with QString, and I'm having the same problem as this poster: http://lists.boost.org/boost-users/2006/10/22940.php boost::serialization doesn't deal ideally with non-std::strings, and there are enough of them in use, that it is important (QString, CString, wxString, etc). Would it be possible to add a mechanism that would make it easy to extend boost::serialization to handle new string types as conveniently as std::string/std::wstring? I'm currently using the following helper-function to do the job, but ideally I'd want the same syntax for serializing QStrings as other strings. template<class Archive> inline void serializeQString(Archive &ar, const char *name, QString &s) { if (Archive::is_saving::value) { std::string tmp(s.toUtf8().constData()); ar & boost::serialization::make_nvp(name, tmp); } else if (Archive::is_loading::value) { std::string tmp; ar & boost::serialization::make_nvp(name, tmp); s = QString::fromUtf8(tmp.c_str()); } } Regards, Thomas Sondergaard

2 1

Re: [Boost-users] [Units] Molecular units base_units trouble: please help
by Christopher Bruns 07 Jan '09

07 Jan '09

Matthias Schabel wrote: > In general, it's easiest to avoid explicitly creating unit systems by > using the ::unit_type approach. For most cases, the unit system ought > to be considered an implementation detail since the library supports > heterogeneous units transparently. That is, for any given unit, the > appropriate system is just the set of units needed to fully describe > the unit itself... Thank you Matthias for the code example. It was exactly what I needed to get back into implementation flow. Yet I still feel the urge to create an md_units_system. For instance, once I create a system including base_units picoseconds, daltons, and nanometers, I can automatically create an energy unit in that system which magically has units of kilojoules per mole, without having to remember how mass, time, length, and energy are related. I am now pondering the creation of a clever set of base units such that Avogadro's constant appears in only one conversion factor to SI units. Either mass or amount would need to be a derived unit. But perhaps this topic is drifting outside the scope of the boost users list... Steven Watanabe wrote: > This was definitely a bug in the library. Fixed in the trunk. Thank you Steven Watanabe so much for your rapid analysis and fix of this bug. I have updated to the latest trunk and can verify that the compile errors no longer occur. I now have all I need to proceed to more sophisticated use of boost.units in molecular computation. Thanks again for the thoughtful and diligent help Matthias and Steven. --Chris Bruns

2 1

[BGL] Trouble linking read_graphviz
by Michael Olea 07 Jan '09

07 Jan '09

Hi. I have been working through the tutorial portion of "The Boost Graph Library: User Guide and Reference Manual", and have been unable to get example code that includes calls to read_graphviz to link. For example, code including this line: read_graphviz("figs/ospf-graph.dot", g_dot); when compiled like this: g++ -I/usr/local/include//boost-1_37 ospf-example.cpp \ -o ospf /usr/local/lib/libboost_graph-xgcc40-mt-1_37.a generates the message: /usr/libexec/gcc/i686-apple-darwin8/4.0.1/ld: Undefined symbols: boost::read_graphviz(std::basic_string<char, std::char_traits<char>, \ std::allocator<char> > const&, boost::subgraph<boost::adjacency_list ... <very long signature ending in...> ... boost::no_property> > > >, boost::listS> >&) collect2: ld returned 1 exit status However, the test code graphviz.cpp, which has the lines: std::ifstream in(filename.c_str()); BOOST_REQUIRE(in); Graph g; dynamic_properties dp; dp.property("id", get(vertex_name, g)); dp.property("weight", get(edge_weight, g)); BOOST_CHECK(read_graphviz(in, g, dp, "id")); compiles, links, and runs just fine. I also tried (desperation) building an earlier version of boost -- 1.34.1 -- with the same results. Any ideas what I'm missing and how I might fix it, or what I need to read to find out, would be appreciated. -- Michael

2 3

is there a way to exclude wchar support in boost 1.36.0?
by Shidong Chen 07 Jan '09

07 Jan '09

Hello everyone, I'm having issues in compiling boost 1.36.0 on a linux platform. I need to turn off wchar support. Is there anyway to exclude those files/libraries? Thanks a lot, Shidong

1 0

[BGL]Standard Breadth First Visitor
by Moritz Beber 07 Jan '09

07 Jan '09

Hello everyone, I can't seem to wrap my head around implementing a BFS Visitor and color map required by the breadth_first_visitor function. I want to use it to find connected parts of a graph and after the algorithm has run I plan to clear all white nodes. If anyone could provide me with a code example or link to one implementing really only default behaviour I'd appreciate it immensely. Have a happy new year, Moritz

2 4

[fusion] const and transform algorithm
by vicente.botet 07 Jan '09

07 Jan '09

Hi, What is the reason fusion::transform taskes a const Sequence? template< typename Sequence, typename F > typename result_of::transform<Sequence const, F>::type transform( Sequence const& seq, F f); Does this means that the transform do not change the sequence itself o also its elements? Why the following do not compiles struct get { template<typename Sig> struct result; template<typename T> struct result<get(T)> { typedef typename boost::remove_reference<T>::type ACT; typedef typename ACT::result_type type; }; template<typename ACT> typename ACT::result_type operator()(ACT& act) const { return act.get(); } }; boost::tuple<shared_future<int>,shared_future<char> > t; boost::fusion::result_of::transform< boost::tuple<shared_future<int>,shared_future<char> > , get>::type res= boost::fusion::transform(t, get()); transform call to get()(const shared_future<int>&act). How can I make a transformation changing also the sequence itself? The result of transform is a transform_view, so the function get is not really called. How can I assign this to a boost::tuple<int, char> = ??(boost::fusion::transform(t, get())); boost::as_vector? Is there a as_tuple function? Should this force the evaluation of the get function? Thanks, Vicente

2 5

Updating my local boost.
by Robert Jones 06 Jan '09

06 Jan '09

I guess this question is more appropriate to the Subversion maillist, but I'm not subscribed to that, so it might take upto 24 hours to appear there. I'm hoping someone here will know the answer! My organisation maintains its boost libraries under its own Subversion repository. This strikes me as a bit odd, but no reason really why not AFAICS. However, the version in our repository is 1.33.1, and I'd like to upgrade to latest 1.36 release. Our network prevents me accessing the Boost subversion repository, so I have to download the tarball and unpack. Then what do I do? I basically want to overwrite our existing boost code with the newer code, but maintain our local edit history so we can see what's changed locally between our old boost code and new. Hence there are lots of additions, changes and deletions, all of which I want to be able see (that's see the differences between our old code and new code, not all the individual boost commits). How can I do this? Thanks - Rob.

5 5

[bind][function] Newbie finds errors, but in Boost or between chair and keyboard?
by Jeroen N. Witmond 06 Jan '09

06 Jan '09

Greetings, I'm a newbie, at least to Boost, and I have been playing around with it to get familiar with it, and to improve my c++ skills. :) I've run into two problems with boost::bind (and I suspect there is a connection with boost::function). The two programs at the bottom of this message demonstrate these problems. Can anybody shed a light on this? Are these errors in Boost, or did I miss something in the documentation? Should I ask on another mailing list? Or should I file a bug report? Platform: linux-x86 Compiler: GNU C++ version 4.1.2 20061115 (prerelease) (Debian 4.1.1-21) STL : GNU libstdc++ version 20061115 Boost : 1.35.0 Regards, Jeroen. ------------------------------------------------------------------------ #include <boost/bind.hpp> #include <boost/function.hpp> bool doit(int i) { return i > 0; } int main(void) { boost::function1<bool, int> mything; mything = boost::bind(doit, 3); // The statement below results in error: // bind-and-function.cpp:24: error: no match for call to // $-1òø(boost::function1<bool, int, // std::allocator<boost::function_base> >) ()$-1òù // /usr/include/boost/function/function_template.hpp:819: note: // candidates are: typename boost::function1<R, T0, // Allocator>::result_type boost::function1<R, T0, // Allocator>::operator()(T0) const [with R = bool, T0 = int, // Allocator = std::allocator<boost::function_base>] return mything() ? 0 : 1; } ------------------------------------------------------------------------ #include <boost/bind.hpp> #include <boost/function.hpp> #include <cassert> struct anything { void operator()(int var1, int var2, boost::function1<void, int>& mything) { assert(var1 == 12345); assert(var2 == 67890); mything(var1 + var2); } void one_arg(int var3, int var4) { assert(var3 == var4); } } something; int main(void) { // Building and running an expression in small steps works. boost::function1<void, int> one_arg_f = boost::bind(&anything::one_arg, &something, _1, 80235); boost::function2<void, int, int> parentheses_f = boost::bind(&anything::operator(), &something, _1, _2, one_arg_f); parentheses_f(12345, 67890); // This also works. boost::bind(&anything::operator(), &something, _1, _2, one_arg_f)(12345, 67890); // Change either zero in the preprocessor consitionals to one to // demonstrate the problem. In my setup, changing both zeroes to // ones results only in an error message for the first statement. // Leaving both zeroes in place makes this code compile and run to an // exit code of zero. #if 0 // But replacing one_arg_f by its value fails to compile: // /usr/include/boost/bind.hpp:413: error: invalid use of void // expression boost::bind(&anything::operator(), &something, _1, _2, boost::bind(&anything::one_arg, &something, _1, 80235)) (12345, 67890); #elif 0 // Separating construction and execution does not help, but shows it // is the construction that is failing. boost::function2<void, int, int> parentheses_f2 = boost::bind(&anything::operator(), &something, _1, _2, boost::bind(&anything::one_arg, &something, _1, 80235)); parentheses_f2(12345, 67890); #endif // Replacing the second _1 by _3 results in even weirder error messages. return 0; } ------------------------------------------------------------------------

2 2

[Units] root_typeof_helper documentation
by David Walthall 06 Jan '09

06 Jan '09

Hello. I ran across a slight documentation issue when using Boost.Units root_typeof_helper. http://www.boost.org/doc/libs/1_37_0/doc/html/boost/units/root_typeof_helpe… and operators.hpp The issue is that BaseType is not defined. (Was that code copied from power_typeof_helper?) In addition, for both power_typeof_helper and root_typeof_helper, it would be useful to mention that Exponent and Index are of type boost::units::static_rational<N,D>. Thanks for the great library! David

2 1

[Units] Bug with BOOST_UNITS_STATIC_CONSTANT and precompiled headers on MSVC
by David Walthall 06 Jan '09

06 Jan '09

I think that I've run across a bug, either in Units, or in MSVC. Because it only appears when precompiled headers are in use, I suspect it may be a bug in MSVC. Basically, if BOOST_UNITS_STATIC_CONSTANT is used in a header that is compiled into the precomiled header, there will be linker errors. Here is my information: Microsoft Windows XP Professional x64 Edition Microsoft Development Environment 2003 Version 7.1.6030 Microsoft Visual Studio .NET 2003 Service Pack 1 (KB918007) Below is the minimial code to reproduce the error. There are 4 files, stdafx.h, stdafx.cpp (which is used to create the pch), a.cpp, and b.cpp. The same code without precompiled headers turned on links fine. // start of stdafx.cpp #include "stdafx.h" // end of stdafx.cpp // start of stdafx.h #ifndef STDAFX_H_328A91DC_3924_466E_80EA_C9BB6CBF7638 #define STDAFX_H_328A91DC_3924_466E_80EA_C9BB6CBF7638 #include <boost/units/systems/si/length.hpp> BOOST_UNITS_STATIC_CONSTANT(ONE_METER, boost::units::si::length); #endif // end of stdafx.h // start of a.cpp #include "stdafx.h" int main(void) { boost::units::si::meter; return 0; } // end of a.cpp // start of b.cpp #include "stdafx.h" int main2(void) { boost::units::si::meter; return 0; } // end of b.cpp Here is the error message: unit.obj : error LNK2005: "class unit<struct boost::units::list<struct boost::units::dim<struct boost::units::length_base_dimension,class boost::units::static_rational<1,1> >,struct boost::units::dimensionless_type>,struct boost::units::homogeneous_system<struct boost::units::list<struct boost::units::si::meter_base_unit,struct boost::units::list<struct boost::units::scaled_base_unit<struct boost::units::cgs::gram_base_unit,struct boost::units::scale<10,class boost::units::static_rational<3,1> > >,struct boost::units::list<struct boost::units::si::second_base_unit,struct boost::units::list<struct boost::units::si::ampere_base_unit,struct boost::units::list<struct boost::units::si::kelvin_base_unit,struct boost::units::list<struct boost::units::si::mole_base_unit,struct boost::units::list<struct boost::units::si::candela_base_unit,struct boost::units::list<struct boost::units::angle::radian_base_unit,struct boost::units::list<struct boost::units::angle::steradian_base_unit,struct boost::units::dimensionless_type> > > > > > > > > >,void>::boost::unit<struct boost::units::list<struct boost::units::dim<struct boost::units::length_base_dimension,class boost::units::static_rational<1,1> >,struct boost::units::dimensionless_type>,struct boost::units::homogeneous_system<struct boost::units::list<struct boost::units::si::meter_base_unit,struct boost::units::list<struct boost::units::scaled_base_unit<struct boost::units::cgs::gram_base_unit,struct boost::units::scale<10,class boost::units::static_rational<3,1> > >,struct boost::units::list<struct boost::units::si::second_base_unit,struct boost::units::list<struct boost::units::si::ampere_base_unit,struct boost::units::list<struct boost::units::si::kelvin_base_unit,struct boost::units::list<struct boost::units::si::mole_base_unit,struct boost::units::list<struct boost::units::si::candela_base_unit,struct boost::units::list<struct boost::units::angle::radian_base_unit,struct boost::units::list<struct boost::units::angle::steradian_base_unit,struct boost::units::dimensionless type> > > > > > > > > >,void> const & const boost::units::si::`anonymous namespace'::meter" (?meter@?A0x490e06d9@si@units@boost@@3ABV?$unit@U?$list@U?$dim@Ulength_base_dimension@units@boost@@V?$static_rational@$00$00@23@@units@boost@@Udimensionless_type@23@@units@boost@@U?$homogeneous_system@U?$list@Umeter_base_unit@si@units@boost@@U?$list@U?$scaled_base_unit@Ugram_base_unit@cgs@units@boost@@U?$scale@$09V?$static_rational@$02$00@units@boost@@@34@@units@boost@@U?$list@Usecond_base_unit@si@units@boost@@U?$list@Uampere_base_unit@si@units@boost@@U?$list@Ukelvin_base_unit@si@units@boost@@U?$list@Umole_base_unit@si@units@boost@@U?$list@Ucandela_base_unit@si@units@boost@@U?$list@Uradian_base_unit@angle@units@boost@@U?$list@Usteradian_base_unit@angle@units@boost@@Udimensionless_type@34@@34@@34@@34@@34@@34@@34@@23@@34@@units@boost@@@23@X@34@B) already defined in stdafx.obj unit2.obj : error LNK2005: "class unit<struct boost::units::list<struct boost::units::dim<struct boost::units::length_base_dimension,class boost::units::static_rational<1,1> >,struct boost::units::dimensionless_type>,struct boost::units::homogeneous_system<struct boost::units::list<struct boost::units::si::meter_base_unit,struct boost::units::list<struct boost::units::scaled_base_unit<struct boost::units::cgs::gram_base_unit,struct boost::units::scale<10,class boost::units::static_rational<3,1> > >,struct boost::units::list<struct boost::units::si::second_base_unit,struct boost::units::list<struct boost::units::si::ampere_base_unit,struct boost::units::list<struct boost::units::si::kelvin_base_unit,struct boost::units::list<struct boost::units::si::mole_base_unit,struct boost::units::list<struct boost::units::si::candela_base_unit,struct boost::units::list<struct boost::units::angle::radian_base_unit,struct boost::units::list<struct boost::units::angle::steradian_base_unit,struct boost::units::dimensionless_type> > > > > > > > > >,void>::boost::unit<struct boost::units::list<struct boost::units::dim<struct boost::units::length_base_dimension,class boost::units::static_rational<1,1> >,struct boost::units::dimensionless_type>,struct boost::units::homogeneous_system<struct boost::units::list<struct boost::units::si::meter_base_unit,struct boost::units::list<struct boost::units::scaled_base_unit<struct boost::units::cgs::gram_base_unit,struct boost::units::scale<10,class boost::units::static_rational<3,1> > >,struct boost::units::list<struct boost::units::si::second_base_unit,struct boost::units::list<struct boost::units::si::ampere_base_unit,struct boost::units::list<struct boost::units::si::kelvin_base_unit,struct boost::units::list<struct boost::units::si::mole_base_unit,struct boost::units::list<struct boost::units::si::candela_base_unit,struct boost::units::list<struct boost::units::angle::radian_base_unit,struct boost::units::list<struct boost::units::angle::steradian_base_unit,struct boost::units::dimensionles s_type> > > > > > > > > >,void> const & const boost::units::si::`anonymous namespace'::meter" (?meter@?A0x490e06d9@si@units@boost@@3ABV?$unit@U?$list@U?$dim@Ulength_base_dimension@units@boost@@V?$static_rational@$00$00@23@@units@boost@@Udimensionless_type@23@@units@boost@@U?$homogeneous_system@U?$list@Umeter_base_unit@si@units@boost@@U?$list@U?$scaled_base_unit@Ugram_base_unit@cgs@units@boost@@U?$scale@$09V?$static_rational@$02$00@units@boost@@@34@@units@boost@@U?$list@Usecond_base_unit@si@units@boost@@U?$list@Uampere_base_unit@si@units@boost@@U?$list@Ukelvin_base_unit@si@units@boost@@U?$list@Umole_base_unit@si@units@boost@@U?$list@Ucandela_base_unit@si@units@boost@@U?$list@Uradian_base_unit@angle@units@boost@@U?$list@Usteradian_base_unit@angle@units@boost@@Udimensionless_type@34@@34@@34@@34@@34@@34@@34@@23@@34@@units@boost@@@23@X@34@B) already defined in stdafx.obj Any insights would be appreciated. Thanks, David

2 3

Possible bug in archive/codecvt_null.hpp
by Matthieu Brucher 06 Jan '09

06 Jan '09

Hi, I'm trying to compile Boost 1.37 with PGI 7.0-7 (which does not support some SSE2 instructions, but this is easily managed) and I run into a missing ";" in archive/codecvt_null.hpp when no STD namespace is available: 25 #if defined(BOOST_NO_STDC_NAMESPACE) 26 using ::codecvt; 27 using ::mbstate_t; 28 using ::size_t 29 #endif Line 28 should end with a comma. Matthieu -- Information System Engineer, Ph.D. 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 3

isnan stopped working
by Thijs Koerselman 06 Jan '09

06 Jan '09

isnan() and family seems to have stopped working in my code. The only thing I can remember is updating from 1.36 to 1.37. Any idea why the following wouldn't work? float nan = FP_NAN; int ret = 0xdeadbeef; ret = (boost::math::isnan)(nan); isnan never returns anything. The value of ret is still 0xdeadbeef after invoking isnan() I'm on OSX10.5.6 using XCode 3 if that helps. Thijs

3 6

proto: BOOST_PROTO_AUTO
by Kim Kuen Tang 06 Jan '09

06 Jan '09

Hi all, i have a question and a problem. The problem is that i would like to write code like: domain=Domain([0,1]*[0,1]); where Domain([0,1]*[0,1]) is an expression created with proto. But of course this line of code is illegal, because i have to provide the type of this expression Domain([0,1]*[0,1]). So i have to write something like this: Domain([0,1]*[0,1])::type domain=Domain([0,1]*[0,1]); Is this correct? Now the question: To avoid code like above is this what the macro BOOST_PROTO_AUTO is for? Can i write BOOST_PROTO_AUTO( domain,Domain([0,1]*[0,1]) ); . Thanks in advance, Kim Tang

3 5

Boost preprocessor question
by Michiel Helvensteijn 06 Jan '09

06 Jan '09

I'm looking for a way to write certain kinds of classes without duplication or unnecessary verbosity. Because there will be many of them in a single file and I want them to be readable. I'm trying to decide if I should use the preprocessor or if I should write a script to do the translation before compilation. I would like something like this (how I think it might look): CLASS(Foo, FROM(Bar)) CONSTRUCT() CONSTRUCT(PAR(int, a, A), PAR(bool, b, B)) int A; bool B; END_CLASS to automatically become something like this: class Foo : public Bar, public shared_from_this<Foo> { private: Foo() {} public: static shared_ptr<Foo> construct() { return shared_ptr<Foo>(new Foo()); } private: Foo(int a, bool b) : A(a), B(b) {} public: static shared_ptr<Foo> construct(int a, bool b) { return shared_ptr<Foo>(new Foo(a, b)); } int A; bool B; }; Is such a thing possible? You see, there are a few things happening there: * Variable length list, reproduced more than once in different ways. * Foo is remembered to use in the constructor name. What would the original code look like if we could make this work? And is there something in the boost preprocessor library that can help me? Thanks in advance! -- Michiel Helvensteijn

5 7

[boost] Futures Review Starts Today - January 5, 2009
by Tom Brinkman 06 Jan '09

06 Jan '09

Futures Review Starts Today - January 5, 2009 Braddock Gaskill http://braddock.com/~braddock/future Anthony Williams http://www.justsoftwaresolutions.co.uk/files/n2561_future.hpp Please review one or both libraries for submission to boost. Apparently, Anthony Williams' submission has also been sumbitted the C++ standards committee. Status unknown. As always, here are some questions you might want to answer in your review(s): What is your evaluation of the design(s)? What is your evaluation of the implementation(s)? What is your evaluation of the documentation? What is your evaluation of the potential usefulness of the library(s)? Did you try to use the library? With what compiler(s)? Did you have any problems? How much effort did you put into your evaluation(s)? A glance? A quick reading? In-depth study? Are you knowledgeable about the problem domain? Do you think the libraries should be accepted into Boost as-is or should they be merged? Apparently, there has been various discussions about these two libraries last six months. The authors will need to bring us up to date as to why they want their libraries to be reviewed seperately. Also, each author should evaluate each others library and point out the differences in their implentations. These will serve as useful discussion points. The ideal outcome in my mind would be a resubmitted submission, incorporating the best ideas from each. Tell me if you share this view or what is your preferred result. As always, your reviews will certainly assist the authors in improving their libraries even further. Thank you in advance. Please feel free to participate in any discussion even if your not going to provide a full review. Review Manager Tom Brinkman _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Re: [Boost-users] [spirit2] Containers, Tuples and Sequence attributes
by Joel de Guzman 05 Jan '09

05 Jan '09

Joel de Guzman wrote: Ooops, sorry, wrong list. Please disregard. Cheers, -- Joel de Guzman http://www.boostpro.com http://spirit.sf.net

1 0

Adding Vertex to Graph
by Damian 05 Jan '09

05 Jan '09

I attempted to post this before but are not sure it went up so here it is again. Basically i have created a map with the key being a unique number and the value being a pointer to a class. Up until this point i have been using add_edge(1,2,graph) where 1 and 2 are unique numbers assigned to the classes. I now need to be able to add vertex and thought it would be something like add_vertex(3, graph) however it is not. How do i go about add a vertex with the id 3 Cheers Damian

2 1

Question on multiindex erase return value
by Ramesh 05 Jan '09

05 Jan '09

As per the erase documentation http://www.boost.org/doc/libs/1_36_0/libs/multi_index/doc/reference/ord_ind… erase method can take an iterator position as argument & if erase is successful, it returns an iterator pointing to the next item or end(). Assuming i have only one item in the container, after a successful erase, the iterator would anyway point to end(). Supposing erase failed, will it still return me end()? How do I distinguish between a successful erase & failed erase involving iterator? Thanks Ramesh

2 1

[thread] locking and time
by Ernst Murnleitner 05 Jan '09

05 Jan '09

Hello, I have some questions about threads. It would be very nice if somebody could clarify. 1) recursive_timed_mutex: It is possible to use a time period for locking of a recursive_timed_mutex by using the approprioate timed_lock(). But there is not lock class with such a constructor? 2) (recursive timed) shared mutex: Is it not possible to lock with a period of time instead of ptime? 3) change of system time: What happens in a timed_lock if the system time is advanced by e.g. one hour? Is there a difference of using ptime or time_period? 4) read/writer mutex: if there are some recursive locks by one thread and this thread should become the writer, do I run in a deadlock? 5) What is the meaning of the various ..._lock_t (e.g. )? Is there a documentation? ad 1) There seems only to be a constructor with ABSOLUTE time: unique_lock(Lockable & m,boost::system_time const& abs_time) ad 2) There seems no possibility to use boost::posix_time::time_period for locking. ad 3) If the clock is set to one hour in the future. I think a timed_lock could take one hour at this moment? If yes, does it happen also if I give a time period? ad 4) if it is possible to recusively lock in one thread, it should be possible to make the thread a writtrer thread (exclusive owner) independently on how often it was locked before. Is this possible? ad 5) Only internal usage?: unique_lock(Lockable& m_,adopt_lock_t); unique_lock(Lockable& m_,defer_lock_t); unique_lock(Lockable& m_,try_to_lock_t) Thank you in advance, Greetings, Ernst

3 3

[Units] Molecular units base_units trouble: please help
by Christopher Bruns 05 Jan '09

05 Jan '09

I am using the Boost Units library to support molecule scale dynamic simulations, but I am pretty sure I am using Boost Units wrong. I am looking for some guidance and explanations for some confusing compile errors I get (see below). I am creating a units system using a mixture of custom base_units (mass, amount, charge), scaled base units based on si::base_units (time, length), and unmodified si::base_units (plane_angle, solid_angle, temperature). The full set of base units I intend to use are as follows: * time in picoseconds * mass in daltons * length in nanometers * amount in molecules * angle in radians * solid angle in steradians * charge in elementary charges * temperature in kelvin * [I'm ignoring luminous intensity for now] Perhaps I am being too picky, because I can build up a molecular dynamics scale units system if I explicitly create every base_unit myself. But I would like to take maximum advantage of the SI units infrastructure that is already available. I suspect that directly using some of the SI base_units would be more efficient than the method I am currently using, which establishes conversion factors to the SI units. Some of these conversion factors are 1.0 (unity). Listing 1 shows a stripped down example using three base_units: mass, length, and time. This program compiles and runs, but notice the conversion factors of 1.0 in the BOOST_UNITS_DEFINE_CONVERSION_FACTOR macros toward the end. Listing 1: Compiles and runs, but I had to explicitly create every base_unit. THIS PROGRAM WORKS -- LOOK FARTHER DOWN FOR THE ONE THAT FAILS *** BEGIN LISTING 1 *** #include <boost/units/conversion.hpp> #include <boost/units/systems/si.hpp> #include <iostream> namespace si = boost::units::si; namespace md { using boost::units::length_dimension; using boost::units::mass_dimension; using boost::units::time_dimension; using boost::units::quantity; using boost::units::unit; using boost::units::scaled_base_unit; using boost::units::scale; using boost::units::static_rational; // length struct meter_base_unit : boost::units::base_unit<meter_base_unit, length_dimension, 1> { static std::string name() { return "meter"; } static std::string symbol() { return "m"; } }; typedef scaled_base_unit< meter_base_unit, scale<10, static_rational<-9> > > nanometer_base_unit; // mass struct dalton_base_unit : boost::units::base_unit<dalton_base_unit, mass_dimension, 2> { static std::string name() { return "Dalton"; } static std::string symbol() { return "Da"; } }; // time struct second_base_unit : boost::units::base_unit<second_base_unit, time_dimension, 3> { static std::string name() { return "second"; } static std::string symbol() { return "s"; } }; typedef scaled_base_unit< second_base_unit, scale<10, static_rational<-12> > > picosecond_base_unit; // create the units system typedef boost::units::make_system< nanometer_base_unit, dalton_base_unit, picosecond_base_unit >::type md_units_system; // define quantity types typedef unit<length_dimension, md_units_system> nanometer_unit; BOOST_UNITS_STATIC_CONSTANT(nanometer, nanometer_unit); BOOST_UNITS_STATIC_CONSTANT(nanometers, nanometer_unit); typedef quantity<nanometer_unit> length_t; typedef unit<mass_dimension, md_units_system> dalton_unit; BOOST_UNITS_STATIC_CONSTANT(dalton, dalton_unit); BOOST_UNITS_STATIC_CONSTANT(daltons, dalton_unit); BOOST_UNITS_STATIC_CONSTANT(atomic_mass_unit, dalton_unit); BOOST_UNITS_STATIC_CONSTANT(atomic_mass_units, dalton_unit); typedef quantity<dalton_unit> mass_t; typedef unit<time_dimension, md_units_system> picosecond_unit; BOOST_UNITS_STATIC_CONSTANT(picosecond, picosecond_unit); BOOST_UNITS_STATIC_CONSTANT(picoseconds, picosecond_unit); typedef quantity<picosecond_unit> time_t; } // namespace md // length conversions BOOST_UNITS_DEFINE_CONVERSION_FACTOR( md::meter_base_unit, si::meter_base_unit, double, 1.0); // mass conversions BOOST_UNITS_DEFINE_CONVERSION_FACTOR( md::dalton_base_unit, si::kilogram_base_unit, double, 1.6605388628e-27); // time conversions BOOST_UNITS_DEFINE_CONVERSION_FACTOR( md::second_base_unit, si::second_base_unit, double, 1.0); using namespace md; using namespace std; int main () { md::time_t timeStep = 0.002 * picoseconds; cout << "time step = " << timeStep << endl; mass_t carbonMass = 12.0 * daltons; cout << "carbon mass = " << carbonMass << endl; length_t bondLength = 0.15 * nanometers; cout << "bond length = " << bondLength << endl; // nonsense, but exercises composite dimensions cout << "composite value = " << timeStep * bondLength << endl; return 0; } *** END LISTING 1 *** Actually, I can directly base the LENGTH dimension on the SI units by changing line 27 of Listing 1 from 26: typedef scaled_base_unit< 27: meter_base_unit, 28: scale<10, static_rational<-9> > 29: > nanometer_base_unit; to 26: typedef scaled_base_unit< 27: si::meter_base_unit, // <== note si prefix 28: scale<10, static_rational<-9> > 29: > nanometer_base_unit; So shouldn't I be able to do the same thing for all of the other SI units? I would have thought so. But doing the same thing for the the TIME dimension always results in trouble, in my experience. Witness listing 2, below. Listing 2: Fails to compile; lots of indecipherable template errors. Time dimension is based on si::second_base_unit. THIS PROGRAM FAILS TO COMPILE *** BEGIN LISTING 2 *** #include <boost/units/conversion.hpp> #include <boost/units/systems/si.hpp> #include <iostream> namespace si = boost::units::si; namespace md { using boost::units::mass_dimension; using boost::units::time_dimension; using boost::units::quantity; using boost::units::unit; using boost::units::scaled_base_unit; using boost::units::scale; using boost::units::static_rational; // mass struct dalton_base_unit : boost::units::base_unit<dalton_base_unit, mass_dimension, 1> { static std::string name() { return "Dalton"; } static std::string symbol() { return "Da"; } }; // time typedef scaled_base_unit< si::second_base_unit, scale<10, static_rational<-12> > > picosecond_base_unit; // create the units system typedef boost::units::make_system< dalton_base_unit, picosecond_base_unit >::type md_units_system; // define quantity types typedef unit<mass_dimension, md_units_system> dalton_unit; BOOST_UNITS_STATIC_CONSTANT(dalton, dalton_unit); BOOST_UNITS_STATIC_CONSTANT(daltons, dalton_unit); BOOST_UNITS_STATIC_CONSTANT(atomic_mass_unit, dalton_unit); BOOST_UNITS_STATIC_CONSTANT(atomic_mass_units, dalton_unit); typedef quantity<dalton_unit> mass_t; typedef unit<time_dimension, md_units_system> picosecond_unit; BOOST_UNITS_STATIC_CONSTANT(picosecond, picosecond_unit); BOOST_UNITS_STATIC_CONSTANT(picoseconds, picosecond_unit); typedef quantity<picosecond_unit> time_t; } // namespace md // mass conversions BOOST_UNITS_DEFINE_CONVERSION_FACTOR( md::dalton_base_unit, si::kilogram_base_unit, double, 1.6605388628e-27); using namespace md; using namespace std; int main () { md::time_t timeStep = 0.002 * picoseconds; cout << "time step = " << timeStep << endl; mass_t carbonMass = 12.0 * daltons; cout << "carbon mass = " << carbonMass << endl; // nonsense, but exercises composite dimensions cout << "composite value = " << timeStep * carbonMass << endl; return 0; } *** END LISTING 2 *** One way to get listing 2 to compile and run is to change line 20 from 19: struct dalton_base_unit : 20: boost::units::base_unit<dalton_base_unit, mass_dimension, 1> to 19: struct dalton_base_unit : 20: boost::units::base_unit<dalton_base_unit, mass_dimension, -1000> // <== The program compiles when I use a large negative value for the base_unit id. But the documentation states that negative values are reserved. I am a bad boy for even trying. In any case, that "-1000" trick only works when the TIME dimension is the only dimension that is directly based on SI units. ERROR MESSAGES FROM LISTING 2: **** small sample of the top of the compile errors I get with unmodified Listing 2: **** 1>C:\cygwin\home\Christopher\svn\dnamodel\include\boost/units/detail/linear_algebra.hpp(207) : error C2976: 'boost::units::detail::determine_extra_equations_skip_zeros_impl<true,true>::apply' : too few template arguments 1> C:\cygwin\home\Christopher\svn\dnamodel\include\boost/units/detail/linear_algebra.hpp(217) : see declaration of 'boost::units::detail::determine_extra_equations_skip_zeros_impl<true,true>::apply' 1> C:\cygwin\home\Christopher\svn\dnamodel\include\boost/units/detail/linear_algebra.hpp(259) : see reference to class template instantiation 'boost::units::detail::determine_extra_equations_skip_zeros_impl<true,false>::apply<RowsBegin,RemainingRows,CurrentColumn,TotalColumns,Result>' being compiled 1> with 1> [ 1> RowsBegin=boost::units::list<boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::time_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::dimensionless_type>>, 1> RemainingRows=2, 1> CurrentColumn=0, 1> TotalColumns=2, 1> Result=boost::units::list<boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::time_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::dimensionless_type>> 1> ] 1> C:\cygwin\home\Christopher\svn\dnamodel\include\boost/units/detail/linear_algebra.hpp(538) : see reference to class template instantiation 'boost::units::detail::determine_extra_equations<RemainingColumns,is_done>::apply<RowsBegin,TotalColumns,Result>' being compiled 1> with 1> [ 1> RemainingColumns=2, 1> is_done=false, 1> RowsBegin=boost::units::list<boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::time_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::dimensionless_type>>, 1> TotalColumns=2, 1> Result=boost::units::list<boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::time_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::dimensionless_type>> 1> ] 1> C:\cygwin\home\Christopher\svn\dnamodel\include\boost/units/detail/linear_algebra.hpp(828) : see reference to class template instantiation 'boost::units::detail::make_square_and_invert<Matrix>' being compiled 1> with 1> [ 1> Matrix=boost::units::list<boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::list<boost::units::dim<boost::units::time_base_dimension,boost::units::static_rational<1>>,boost::units::dimensionless_type>>::type,boost::units::list<boost::units::static_rational<1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::list<boost::units::list<boost::units::static_rational<1>,boost::units::list<boost::units::detail::calculate_base_dimension_coefficients_func<false>::apply<boost::units::dimensionless_type>::type,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>,boost::units::dimensionless_type>> 1> ] 1> C:\cygwin\home\Christopher\svn\dnamodel\include\boost/units/detail/linear_algebra.hpp(1032) : see reference to class template instantiation 'boost::units::detail::normalize_units<T>' being compiled 1> with 1> [ 1> T=boost::units::list<boost::units::scaled_base_unit<boost::units::si::second_base_unit,boost::units::scale<10,boost::units::static_rational<-12>>>,boost::units::list<md::dalton_base_unit,boost::units::dimensionless_type>> 1> ] [snip] ****** END snippet of compile errors ********* Environment details: I am developing in Visual Studio Express 9.0 on Windows XP at the moment. The version of boost::units I am using is from subversion on January 3, 2009. I would feel better if I could reuse several of the base_units from SI. Just reusing length and not the others seems painfully sloppy. I welcome any comments that might nudge me in the right direction. Thanks in advance for any help. --Chris Bruns

3 3

Re: [Boost-users] [Proto] automaitcally convert class to proto literal
by Daniel Oberhoff 05 Jan '09

05 Jan '09

> Daniel Oberhoff a Ã©crit : > > I might have gotten the terms wrong. But the way I got it working now is > > with using proto::lit which turns things into literals. I tried > > subclassing terminal with my array class, but that way the tree did not >> keep a reference to the array, and thus could not be evaluated as such. > Just make a array_data class that contains your data and make your user > level array class extends terminal<array_data>::type. The vec3 example > in the doc is exacly this and I used variations of this for like 4 or 5 > array like DSEL since proto is available. Ok, I looked into that. Works better than my previous approaches. Though I would like it much better if I don't have to split my class into an internal data class and a user interface, since I would like to use the whole interface in the proto evaluators. Also, since the extends mechanism makes the data class end up a member of the derived class it is hard to access the derived class from the base class. Is this fundamentally impossible? Naively I would like to write: class array : public proto::extends< proto::terminal< array >::type, array > { [...] }; though this is not possible since the extends mechanism makes the expr class a member of the extending class, and thus the class would have to contain itself in the end, which is, of course, impossible. -- --- Daniel Oberhoff Fraunhofer FIT Schloss Birlinghoven 53754 Sankt Augustin, Germany Tel.: +49-(0)-2241-14-3486 Fax.:+49 (0) 2241/14-2080

3 2

[BGL] vertex_index_t, edge_index_t?
by Geoff Hilton 05 Jan '09

05 Jan '09

Quick question: Given an arbitrary graph of type: typedef boost::adjacency_list< boost::listS, //out edge list selector boost::vecS, //vertex list selector boost::bidirectionalS, //directedness selector VertexPropertyWrapper_type, EdgePropertyWrapper_type> Graph_type; Where: typedef boost::property< boost::vertex_index_t, unsigned long long, MyVertexProperty> VertexPropertyWrapper_type; And: typedef boost::property< boost::edge_index_t, unsigned long long, MyEdgeProperty> EdgePropertyWrapper_type; How does setting edge/vertex_index_t as an interior property affect..anything? I saw in a post on this list somewhere a while ago that this was a necessary workaround for something or other (that which I don't recall now). In the post it actually said to use "int" (or was it unsigned int?) rather than unsigned long long but in any case I left it as unsigned long long and it hasn't affected anything negatively thus far so I left it that way. I believe I put it at unsigned long long because the type that was suggested for the *_index_t happened to match a weight type used in the post, but whether that was intentionally and implicitly or unintentionally and explicitly I don't remember. Thank you, Geoff

5 11

[BGL] Bundled properties and property maps
by Alex Brooks 05 Jan '09

05 Jan '09

Hi, I've used BGL before for representing graphs, but this is my first time with an algorithm. I've been stuck for many hours trying to define a property map with bundled properties, I'd really appreciate some help. I'm using gcc4.3, boost 1.34. An example program and the compiler error are: ------------------------------------------------------------- #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/astar_search.hpp> using namespace std; class Point { public: double p_[2]; }; struct EdgeProp { double cost; }; typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, Point*, EdgeProp> Graph; typedef boost::graph_traits<Graph>::vertex_descriptor VertexRef; class AStarHeuristic : public boost::astar_heuristic<Graph, double> { public: double operator()( VertexRef vertex ) const {return 0.0;} }; // exception for termination struct FoundGoal {}; // // A* Visitor that terminates when we reach the goal // class AStarVisitor : public boost::default_astar_visitor { public: AStarVisitor( const VertexRef &goal ) : goal_(goal) {} template <class Graph> void examine_vertex( VertexRef vertex, Graph &g ) { if( vertex == goal_ ) throw FoundGoal(); } private: VertexRef goal_; }; bool searchThroughGraph( const Graph &graph, VertexRef start, VertexRef goal, std::vector<VertexRef> &shortestPath ) { AStarHeuristic aStarHeuristic; AStarVisitor aStarVisitor( goal ); typedef boost::property_map<Graph, double EdgeProp::*>::type EdgeWeightMap; EdgeWeightMap edgeWeightMap = get(&EdgeProp::cost, graph); std::vector<VertexRef> predecessors(num_vertices(graph)); try { astar_search( graph, start, aStarHeuristic, boost::weight_map(edgeWeightMap). predecessor_map(&predecessors[0]). visitor(aStarVisitor) ); } catch ( const FoundGoal& ) { shortestPath.clear(); for ( VertexRef vertex = goal;; vertex = predecessors[vertex] ) { shortestPath.push_back( vertex ); if ( predecessors[vertex]==vertex ) break; } std::reverse( shortestPath.begin(), shortestPath.end() ); return true; } // If we get to here, we couldn't reach the goal return false; } int main() { Graph graph; std::vector<VertexRef> path; searchThroughGraph(graph,0,1,path); return 0; } ------------------------------------------------------------- /home/a.brooks/shh/src/libs/prm/test/stupid.cpp: In function ‘bool searchThroughGraph(const Graph&, VertexRef, VertexRef, std::vector<unsigned int, std::allocator<unsigned int> >&)’: /home/a.brooks/shh/src/libs/prm/test/stupid.cpp:64: error: conversion from ‘boost::bundle_property_map<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, Point*, EdgeProp, boost::no_property, boost::listS>, boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, EdgeProp, const double>’ to non-scalar type ‘searchThroughGraph(const Graph&, VertexRef, VertexRef, std::vector<unsigned int, std::allocator<unsigned int> >&)::EdgeWeightMap’ requested ------------------------------------------------------------- Does anyone know what might be wrong? More generally, I'm a bit mystefied by the "<Graph, double EdgeProp::*>::type" syntax -- can anyone give me any pointers about what this syntax means, or where I can look it up? (googling for colon-colon-star doesn't help much). I also tried pattern-matching from the documentation page about bundled properties (the weight_map(get(&Highway::miles, map)) example) but couldn't get this to compile either. Is this example correct? Thanks very much in advance, Alex

4 19

Boost multiindex: Usage of erase
by Ramesh 05 Jan '09

05 Jan '09

Hello Joaquin, I am trying to erase members of a container selectively, I get a compile error (no matching function found) at the point where I use erase (highlighted line) below: Could you please point out whats wrong with the usage? Thanks /Ramesh Here is the code: ------------- struct MyMap { Adapter *pAdapter; unsigned long timestamp; MyMap(Adapter * param_Adp, unsigned long param_timestamp ): pAdapter(param_Adp), timestamp(param_timestamp) {} ~MyMap(){ pAdapter = 0; timestamp = 0; } }; struct pAdapter{}; struct timestamp{}; typedef multi_index_container< MyMap, indexed_by < ordered_unique< tag <pAdapter>, BOOST_MULTI_INDEX_MEMBER(MyMap, Adapter *, pAdapter) >, ordered_unique< tag <timestamp>,BOOST_MULTI_INDEX_MEMBER(MyMap, unsigned long, timestamp) > > > tMap; class ACtr { private: tMap AContainer; public: // Constructor ACtr(); //Destructor ~ACtr(); //Remove stale bool pruneBad(); }; bool ACtr::pruneBad { for ( tMap::index_iterator<timestamp>::type it = AContainer.get<timestamp>().begin(), it_end = AContainer.get<timestamp>().end();it != it_end; count++) { it = AContainer.erase(it); ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ } } ----

2 1

Re: [Boost-users] [Proto] automaitcally convert class to proto literal
by Daniel Oberhoff 05 Jan '09

05 Jan '09

Joel Falcou wrote: > Daniel Oberhoff a écrit : > > Hi, > > > > I am stilly trying o get my array computation DSEL up and running. > > The basic grammar is in place, what I am fighting with is protfying my > > literals. I.e. I have an array class, and I want the following > > expression: > > > > A(_i,_j) > > > > to become a function(literal<Array>(A), index_placeholder<0>, > > index_placeholder<1>) > Why A should be a litteral and not terminal ? I might have gotten the terms wrong. But the way I got it working now is with using proto::lit which turns things into literals. I tried subclassing terminal with my array class, but that way the tree did not keep a reference to the array, and thus could not be evaluated as such. Subclassing literal did not work because I did not find a way to actually have the literal take a reference to the array itself. I could of course use a placeholder syntax, and pass in the actual arrays at evaluation time but I want expressions to work "in-place", i.e. I want to be able to write A(_i,_j) = B(_i) * C(_j); and that to just be evaluated as it stands there. Enabling placeholders could be a useful feature, but that would be relatively easy to add. -- --- Daniel Oberhoff Fraunhofer FIT Schloss Birlinghoven 53754 Sankt Augustin, Germany Tel.: +49-(0)-2241-14-3486 Fax.:+49 (0) 2241/14-2080

2 1

Bus error side effect from boost::logging
by Allen Cronce 05 Jan '09

05 Jan '09

I'm tracking down an intermittent bus error under Mac OS X 10.5.6 that happens when formatting a double as a string. The crash can happen when outputting to a stream, when calling printf, or when using boost::format. Of course the crash only happens in our release build, which always makes things more fun ;-) Here's a sample routine that can trigger the bus error in our unit test: --snip-- int TestDoubleFormatBusError(void) { std::cout << "\nTesting double format problem..." << std::endl; uint64_t testMicroseconds = 100000; double delta = 179; double percentOff; percentOff = (delta / testMicroseconds) * 100; std::cout << percentOff; // <-- This is where the crash sometimes happens. return 0; } --snip-- I'm pretty sure that there's nothing wrong with the above code, but I'm open to suggestions. After binary chopping, I determined that the crash only happens after invoking John Torjo's experimental boost::logging. If I disable logging, the problem goes away. Has anyone seen this problem? John, do you have any suggestions for understanding and resolving the crash? Thanks in advance. Best, -- Allen Cronce

1 0

Re: [Boost-users] Compile error OSX Callback problem for
by Bill McLean 04 Jan '09

04 Jan '09

Marshall, Thanks for the reply. You have touched upon an issue that I'm not sure how to solve. The general problem is how to use boost::function and boost::bind to register a member callback function for a c style library. A proxy function that has signature of the c callback function and the correct instance of the class containing the member function to call. Any thoughts or approaches to solve it. Bill

2 1

Re: [Boost-users] Boost.Lambda: failure to compile with std::set, OK withstd::vector, bug?
by Anders Dalvander 04 Jan '09

04 Jan '09

> Hi, > > Compiling the code below with std::vector goes OK, the std::set variant does not compile: > > All elements in a std::set are const, so you need to make the print member function const: struct Integer { Integer(int anInt) : integer(anInt){} bool operator<( const Integer& anInteger) const { return integer < anInteger.integer;} void print() const {std::cout << integer << std::endl;} int integer; }; Regards, Anders Dalvander

1 0

[Proto] automaitcally convert class to proto literal
by Daniel Oberhoff 04 Jan '09

04 Jan '09

Hi, I am stilly trying o get my array computation DSEL up and running. The basic grammar is in place, what I am fighting with is protfying my literals. I.e. I have an array class, and I want the following expression: A(_i,_j) to become a function(literal<Array>(A), index_placeholder<0>, index_placeholder<1>) (simplified for readability, but the point should be clear). it works like this: proto::lit(A)(_i,_j) so how can I automate the turning of my array instance into a literal? I have access to the class definition and I tried subclassing terminal and literal and the PROTO_EXTENDS macro. The former two had no effect on my problem, and the latter didn't compile ( I tried various combindations of Expr and Derived parameters). Any ideas? Daniel

2 1

packaging boost-1.37.0 for "LTIB"?
by Robert P. J. Day 04 Jan '09

04 Jan '09

i want to package the latest version of boost for the LTIB software package so, to make a long story short, here's the RPM packaging spec file for an older version: =========================== cut here ============================ %define pfx /opt/freescale/rootfs/%{_target_cpu} %define __unzip unzip -a Summary : c++ libraries Name : boost Version : 1.31.0 Release : 1 Vendor : Freescale Packager : Stuart Hughes Group : System Environment/Libraries Source : %{name}_1_31_0.tar.bz2 Patch0 : boost-1.31.0-regex-patch-20040503.zip License : Boost (distributable) BuildRoot : %{_tmppath}/%{name} %Description %{summary} %Prep %setup -n %{name}_1_31_0 cd $RPM_BUILD_DIR/%{name}_1_31_0/boost/regex/v4 %{__unzip} -o $RPM_SOURCE_DIR/boost-1.31.0-regex-patch-20040503.zip %Build %Install rm -rf $RPM_BUILD_ROOT mkdir -p $RPM_BUILD_ROOT/%{pfx}/%{_prefix} (cd tools/build/jam_src && ./build.sh) BJAM=`find tools/build/jam_src/ -name bjam -a -type f` PYTHON_VERSION=`python -V 2>&1 |sed 's,.* $[0-9]\.[0-9]$$\.[0-9]$\?.*,\1,'` PYTHON_FLAGS="-sPYTHON_ROOT=%{_prefix} -sPYTHON_VERSION=$PYTHON_VERSION" $BJAM $PYTHON_FLAGS -sTOOLS=gcc -sBUILD="debug release" --prefix=$RPM_BUILD_ROOT/%{pfx} %{_prefix} install %Clean rm -rf $RPM_BUILD_ROOT %Files %defattr(-,root,root) %{pfx}/* ==================== cut here ================= so, a couple short questions that might save me some time before i dig into the source: 1) does 1.37.0 still require a "regex" patch? apparently, the patch mentioned above was to address some regex issues identified after 1.31.0 was released? i'm ready to assume that anything that significant has been resolved since then. 2) i'm also assuming that JAM is required for that final packaging step so that part of the spec file is still relevant. in other words, other than dropping the regex patch and updating the version number, does the above spec file look about right for 1.37.0? i'm about to give it a try. thanks. rday -- ======================================================================== Robert P. J. Day Linux Consulting, Training and Annoying Kernel Pedantry: Have classroom, will lecture. http://crashcourse.ca Waterloo, Ontario, CANADA ========================================================================

2 7

Boost.Lambda: failure to compile with std::set, OK withstd::vector, bug?
by Joost Kraaijeveld 04 Jan '09

04 Jan '09

Hi, Compiling the code below with std::vector goes OK, the std::set variant does not compile: /usr/include/boost/lambda/detail/actions.hpp no matching function for call to ‘boost::lambda::function_adaptor<void (Integer::*)()>::apply(void (Integer::* const&)(), const Integer&)’ /usr/include/boost/lambda/detail/actions.hpp return-statement with a value, in function returning 'void' /usr/include/c++/4.3/bits/stl_tree.h invalid type argument of ‘unary *’ Is this a bug or am I doing something wrong (gcc (Debian 4.3.2-1) 4.3.2 / Boost 1.35) ? #include <iostream> #include <vector> #include <set> #include <boost/lambda/lambda.hpp> #include <boost/lambda/algorithm.hpp> #include <boost/lambda/bind.hpp> struct Integer { Integer(int anInt) : integer(anInt){} bool operator<( const Integer& anInteger) const { return integer < anInteger.integer;} void print(){std::cout << integer << std::endl;} int integer; }; int main(int argc, char* argv[]) { // std::vector<Integer> collection(5,2); std::set<Integer> collection(5,2); // Calling a member function std::for_each(collection.begin(), collection.end(), boost::lambda::bind(&Integer::print, boost::lambda::_1)); } TIA -- Groeten, Joost Kraaijeveld Askesis B.V. Molukkenstraat 14 6524NB Nijmegen tel: 024-3888063 / 06-51855277 fax: 024-3608416 web: www.askesis.nl

1 0

BoostCon 2009: Call for participation
by Hartmut Kaiser 04 Jan '09

04 Jan '09

Hi all, Please find below the call for participation for the 3rd annual Boost Conference in Aspen. There are only a couple of days left to submit any proposals. I'm sorry for any duplicates you might receive. Please forward this mail to any related mailing list or any person you think might be interested. Regards Hartmut ---------------------------------------------------------------------------- 3rd annual Boost Conference 2009 Aspen CO, USA, May 3-9, 2009, www.boostcon.com ---------------------------------------------------------------------------- Call for participation ---------------------- Promising to be the main face-to-face event for all things Boost (www.boost.org) BoostCon'09 opens the door to your C++ future. From using the Boost libraries to writing and maintaining them, from evangelizing to deploying Boost within your organization, from infrastructure and process to vision and mission, and from TR1 to TR2 and the new C++0x Standard, BoostCon brings together the sessions, the colleagues, and the inspiration to support your work with C++ and Boost in particular for the next year. To reflect the breadth of the Boost community, the conference includes sessions aimed at two constituencies: Boost end-users and hard-core Boost library and tool developers. The program fosters interaction and engagement within and across those two groups, with an emphasis on hands-on, participatory sessions. Session topics -------------- * Topics of interest include, but are not restricted to, the following: * General tutorial sessions introducing one or more Boost libraries * In-depth sessions on using specific libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * C++0x and how it will change life for users and library writers * TR1 and TR2 * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Other topics likely to be of great interest to Boost users and Developers. Interactive and collaborative sessions are encouraged, as this is the nature of both the on-line Boost community and the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. Session formats --------------- Presentations ............. Presentations focus on a practitioner's ideas and experience with anything relevant to Boost and Boost users. Panels ...... Panels feature three or four people presenting their ideas and experiences relating to Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials ......... Tutorials are sessions at which instructors teach conference participants specific Boost-relevant skills. Workshops ......... Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations ............................. These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems boost libraries. Tool Vendors Presentations .......................... We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. Submitting a proposal --------------------- Standard Sessions are 90 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 90 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned 90 minute, three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other * A paragraph or two describing the topic covered, suitable for the conference web site * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half-day, full day * Alternate lengths, if you are willing to make adjustments: 10-20 minute lightning-talks, 45 minutes, 90 minutes, half-day, full day * Audience: users, developers, both * Level: basic, intermediate, advanced * A biography, suitable for the conference web site * Your contact information (will not be made public) Submission details ------------------ All submissions have to be done through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=boostcon09. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted papers will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the BoostCon CD handed out to attendees. For general information on the BoostCon 2009 paper submission or the scope of technical papers solicited, please refer to the conference website at www.boostcon.com. For any other questions about the submission process or paper format, please contact the Program Committee at boostcon09(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to BoostCon. Important dates --------------- Proposals for submissions due: January 10th 2009. Proposals acceptances sent (tentative program available): February 10th, 2009 Fully scheduled program available: March 1st, 2009 Session materials due: April 1st 2009. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) David Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

Re: [Boost-users] How to access COM ports
by Max 04 Jan '09

04 Jan '09

Hello Rahul, I'm also interested in such stuff. Look forward to seeing your example! B/Rgds Max ----- Original Message ----- From: master master <master_4_master(a)yahoo.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] How to access COM ports Date: 2009-1-4 10:02:52 Thank youIgor. I will try it today. How to add new example to boost lib docs. If I got success I want to add serial port example to asio lib because it is lacking with the examples. Rahul Boostian :) ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

How to access COM ports
by master master 04 Jan '09

04 Jan '09

How to access COM port using BOOST library. I want to access COM3 port using boost. For socket port the below line works .... ........ boost::asio::ip::tcp::resolver::query query("localhost", "9999"); .......... ..... but how to do it for COM port I tried this .... ....... boost::asio::ip::tcp::resolver::query query("localhost", "COM3"); ......... ....... but it didn't worked. Another problem I am facing is that the network client should be platform-independent but if I use socket.h then it will not work on windows and if I use winsock then it will not run on linux/unix variants. Same for other header files like inet.h etc Rahul To create something exceptional ________________________________ -Master4Master "Confidentiality Warning: This message and any attachments are intended only for the use of the intended recipient(s), are confidential, and may be privileged. If you are not the intended recipient, you are hereby notified that any review, re-transmission, conversion to hard copy, copying, circulation or other use of this message and any attachments is strictly prohibited. If you are not the intended recipient, please notify the sender immediately by return email, and delete this message and any attachments from your system. Virus Warning: Although I have taken reasonable precautions to ensure no viruses are present in this email, I cannot accept responsibility for any loss or damage arising from the use of this email or attachment." Speak out for justice and peace, even if your voice trembles. Add more friends to your messenger and enjoy! Go to http://messenger.yahoo.com/invite/

3 4

Re: [Boost-users] [Bind] How to bind?
by Max 04 Jan '09

04 Jan '09

Thank you, Watanabe. B/Rgds Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

[Proto] Using mpl::count as proto::transform
by Joel Falcou 04 Jan '09

04 Jan '09

I have a grammar with 3 kind of terminal : A,B and C. I want to have a transform that returns a mpl::int_ which is equal to the number of B terminal that appear in expression like : A(B,B,C,B,C ..) the grammar part for matching this is currently : when< function< vargarg<my_grammar> > , mpl::count< _, terminal<B> >() > alas this always return 0 and so does : when< function< vargarg<my_grammar> > , mpl::count< _, terminal<B>::type >() > as well as the same using flatten. What do I do wrong ? -- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35

2 1

Re: [Boost-users] proto for array expressions
by Daniel Oberhoff 03 Jan '09

03 Jan '09

>> Sorry for the delay, the holidays, you know ... >> >> Daniel Oberhoff wrote: >> > On 2008-12-18 23:46:40 +0100, Eric Niebler <eric <at> boost- >> consulting.com> >> > said: >> > >> >> Daniel Oberhoff wrote: >> >>> >> >>> Now with proto I was wondering how hard it would be to build an >> et >> >>> engine for array math. Basically I am interested in general >> tensor >> >>> notation, and the resulting expressions should be iteratable >> >>> efficiently. think (advanced example): >> >>> >> >>> a_ij = b_i * (c_j - sum(d_ijk, k = [i-1,1]) >> >> >> >> I don't understand your notation. What are a_ij et. al.? >> > >> > Sorry, the underscripts where meant to be indices. So a is a 2d >> array, b >> > and c are 1d arrays, and d is a 3d array. The statement says: to >> > calculate a at a given index pair i,j (say 0,0) you substitute >> for i,j >> > on the right. And the sum sums over the third index of the 3d >> array d. >> > The notation further says that the bounds for the summation >> depend on >> > what you substitute for i. So to fill the array a like that you >> need to >> > substitute all values in the domian (say both indices run from 0 >> to 99 >> > for a 100x100 array), and for efficiency it would be best if the >> right >> > hand side would result in an iterator that substitutes subsequent >> all >> > values in series. >> >> OK, the syntax for your tensor expressions needs work, but I think >> what >> you're shooting for is certainly doable. How about a syntax like >> this: >> >> a[i][j] = b[i] * ( c[j] - sum( (d[i][j][k], k = (i-1,1)) ) ) >> >> This is a valid C++ expression, and I think there could be enough >> type >> information in it to make it do something useful. Here is a simple >> program that makes the above well-formed, and also defines a very >> rudimentary the grammar for tensor expressions, with transforms that >> calculate the expression's dimensionality. That's important because >> you >> don't want to assign a 2-D array to a 1-D array, for instance. >> >> [...] > > Hey, wow, a full implementation as a response :). Seems very lean > and mean, and I will have to look at it further. What I just tried > was defining two domains very similar to the calculator example, and > then I was going to have syntax with round brackets like this: > > a(i, j) = b(i) * ( c(j) - sum( d(i,j,k), k, i-1, 1) ) ) > so one domain was to be for arrays (a,b,c,d) and one for the indices > (i,j,k). But I could not get the grammar to check for the function > syntax. somehow the proto extends mechanism just passed through all > kinds of function call expressions, even though I explicitly > specified only things like: > > boost::proto::function< array_grammar, index_grammar > > > and still things like a(a) compile. any ideas where I am going wrong? > ok, answering my own question. Turns out the calculator example used a grammar with a match-all-terminals to specify terminals, so it could not distinguish between index placeholders and arrays. got that now and got my first fully grammar checked expression tree printed. now moving towards contractions, dimension checks, and actually getting my array implementation in there and generating iterators to evaluate the expressions. stay tuned for more problems (and again much thanks to eric niebler for the prompt and insightful response!). Daniel

1 0

Compile error OSX Callback problem for FSEventsCallback
by Bill McLean 03 Jan '09

03 Jan '09

I'm trying to code up a FSEvent callback using a member function. I may be suffering from a case of the post holiday stupids :) I am using both the boost::bind and boost::function libraries. I have the following declaration for declaring the signature of the FSEventCallback: typedef boost::function<void ( ConstFSEventStreamRef streamRef, // _1 void *clientCallBackInfo, // _2 size_t numEvents, // _3 void *eventPaths, // _4 const FSEventStreamEventFlags eventFlags[], // _5 const FSEventStreamEventId eventIds[] // _6 )> FSEventCallbackT; The above typedef has been derived from the OSX FSEvent API definition for the FSEventStreamCallback: typedef void ( *FSEventStreamCallback)( ConstFSEventStreamRef streamRef, void *clientCallBackInfo, size_t numEvents, void *eventPaths, const FSEventStreamEventFlags eventFlags[], const FSEventStreamEventId eventIds[] ); The skeleton of the struct that has the member function that is to be the call back is defined as: struct osx::detail { // Callback type definition static const CFAbsoluteTime LATENCY = 2.0; static const unsigned BUF_SIZE = 32768; CFStringRef pathToWatch; CFArrayRef pathsToWatch; FSEventStreamRef streamRef; void *callbackInfo; CFRunLoopRef mainLoop; boost::mutex event_mutex; typedef boost::mutex::scoped_lock lock_type; FSEventCallbackT callBack; // public methods detail( const boost::filesystem::path& base_path ); ~detail() { stop(); } void stop(); void FSEventTriggered( ConstFSEventStreamRef streamRef, // _1 void *clientCallBackInfo, // _2 size_t numEvents, // _3 void *eventPaths, // _4 const FSEventStreamEventFlags eventFlags[], // _5 const FSEventStreamEventId eventIds[] // _6 ); item get_item(); }; In the constructor I get a single compile error in the call to FSEventStreamCreate: osx::detail::detail( const boost::filesystem::path& base_path ) : base_path(base_path), stopped(false), pathToWatch(CFStringCreateWithCString(NULL,base_pa th.string().c_str(), kCFStringEncodingUTF8)), pathsToWatch(CFArrayCreate(NULL, (const void **) &pathToWatch, 1, NULL)) { callBack = boost::bind(&fsmon :: osx::detail::FSEventTriggered, this, _1, _2, _3, _4, _5, _6); streamRef = FSEventStreamCreate(NULL, &callBack, callbackInfo, pathsToWatch, kFSEventStreamEventIdSinceNow, LATENCY, kFSEventStreamCreateFlagNone ); ... } /Users/bill/ardev/CurrentDev/InternalLibs/fsmon/osxExample.cpp:111: error: cannot convert 'FSEventCallbackT*' to 'void (*)(const __FSEventStream*, void*, size_t, void*, const FSEventStreamEventFlags*, const FSEventStreamEventId*)' for argument '2' to '__FSEventStream* FSEventStreamCreate(const __CFAllocator*, void (*)(const __FSEventStream*, void*, size_t, void*, const FSEventStreamEventFlags*, const FSEventStreamEventId*), FSEventStreamContext*, const __CFArray*, FSEventStreamEventId, CFTimeInterval, FSEventStreamCreateFlags)' The typdef for FSEventCallbackT should be the same as the void (*)(const __FSEventStream*, void*, size_t, void*, const FSEventStreamEventFlags*, const FSEventStreamEventId*). I do not see what I am doing incorrectly. Thanks in advance. Bill

2 1

Re: [Boost-users] proto for array expressions
by Daniel Oberhoff 03 Jan '09

03 Jan '09

1 0

[serialization] load/save seem to different header format
by Ewald Peiszer 03 Jan '09

03 Jan '09

Hi I am using the boost s11n lib, version 1.35.0, in combination with a text archive, Windows platform, MSVC++ 2005 compiler. I have split serialize into load and save members, as indicated in the tutorial. However, it seems as if save expects a different header format (ie text stream like stringstream etc) as the corresponding load method outputs. Output of my load method: 22 serialization::archive 4 0 0 10(...) Everything before 10 is s11n housekeeping stuff, 10 is the beginning of the "real" data. Now, if a string like this is used as input for save, then the first variable that is extracted is not the 10 (what it should be) but rather a 0 (or something else which is equally wrong); instead, the 10 shows up as the value of the const unsigned int version which is one of the two parameters of load/save/serialize members. Actually, version is supposed to be 0, I do not set a version number deliberatly anywhere. Playing around, I added a third 0 to the header, resulting in 22 serialization::archive 4 0 0 0 10 and, guess what, this time save(...) correctly managed to de-serialize the data congtained in the string. I tried it also with a single seralize() member (and not splitting into save/load). Save behaviour. The relevant code is below (class code and code to (de)serialize class instance. Has anybody experienced the same or similar problems? Any help is greatly appreciated. If you need more information please ask. Regards Ewald ------------------------------------- Excerpt of class code: class Foo { (...) private: int buflen; // s11n stuff friend class boost::serialization::access; template<class Archive> void save(Archive & ar, const unsigned int version) const { // store length of buffer ar & buflen; // store data itself for (int j = 0; j < buflen; j++) ar & buffer[j]; } template<class Archive> void load(Archive & ar, const unsigned int version) { // get length of buffer ar & buflen; // create buffer with appropriate length deleteBuffer(); init(buflen); // reat data into buffer for (int j = 0; j < buflen; j++) ar & buffer[j]; } BOOST_SERIALIZATION_SPLIT_MEMBER() /* // just to try it with serialize alone: template<class Archive> void serialize(Archive &ar, const unsigned int version) { ar & buflen; } */ (...) }; ------------------------------------- // check the save operation std::stringstream ssq (std::stringstream::in | std::stringstream::out); { const Foo rp(10); boost::archive::text_oarchive oa(ssq); oa << rp; } ----------------------------------- // load { stringstream ss (stringstream::in| std::stringstream::out); ss << s11nbuf << endl; boost::archive::text_iarchive ia(ss); // restore from the archive ia >> rp; } ---------------------------------- (end of post)

3 4

Re: [Boost-users] [Bind] How to bind?
by Max 03 Jan '09

03 Jan '09

Should I use a seperate functor like this? template<class T> struct dereference : public std::unary_function<T*, T> { T operator()(T *pt) { return *pt; } }; A a; boost::bind(&processA, boost::bind(dereference<A>(), _1))(&a); If the answer is yes, is there a safer and stronger equivalence of "dereference" in boost? Thanks again. B/Rgds Max ====================================== Hello On simple question: For struct A {}; void processA(A& a) {} A *pa = new A(); How to write a bind expression that make (pa); equivalent to processA(*pa); I've tried with this: boost::bind(&processA, *_1) but failed. I've also tried with this: processA(*boost::lambda::_1) also failed. Thanks for any information. B/Rgds Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ ) ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

[Bind] How to bind?
by Max 03 Jan '09

03 Jan '09

Hello One simple question: For struct A {}; void processA(A& a) {} A *pa = new A(); How to write a bind expression <BIND> that make <BIND>(pa); equivalent to processA(*pa); I've tried with this: boost::bind(&processA, *_1) but failed. I've also tried with this: processA(*boost::lambda::_1) also failed. Thanks for any information. B/Rgds Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

[interprocess] support for private mappings?
by Zeljko Vrba 03 Jan '09

03 Jan '09

Does this library support private, read-write file mappings? Such mapping is copy on write, and modifications to the mapped region remain private to the process that created the mapping. (POSIX: MAP_PRIVATE flag for mmap(), Windows: FILE_MAP_COPY flag to MapViewOfFile and PAGE_WRITECOPY flag to CreateFileMapping)

2 3

Missing regex lib on 1.37
by Larry 03 Jan '09

03 Jan '09

I did a complete build of 1.37 on Windows Vista using VS 2008, VS 2005, and VS .NET 2003 and it appears that none produced debug versions of the libraries. I couldn't see anything that said the debug builds were no longer supported but may have read it and it just didn't register that was what it was saying. I was doing --build_type=complete but even throwing in --variant=debug would not produce the lib. The specific one I was missing was libboost_regex-vc90-mt-gd-1_37.lib. Any suggestions? Pointers? Larry

2 1