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

[Random] newbie question on saving the generator state through stream operators
by Marco Baldi 04 Sep '06

04 Sep '06

Hello, I have found another post on the subject, but it seems that no response has followed (maybe the answer is so obvious...). http://thread.gmane.org/gmane.comp.lib.boost.user/3901/focus=3901 However, even in http://www.boost.org/libs/random/random_demo.cpp it is suggested to "Try boost::mt19937 or boost::ecuyer1988 instead of boost::minstd_rand", but the following code (taken from the same file) seems to work only when "generator" is of type boost::minstd_rand. // You can save the generator state for future use. You can read the // state back in at any later time using operator>>. std::ofstream file("rng.saved", std::ofstream::trunc); file << generator; I'm using bcb and get the following compiler error message when "generator" is not of type boost::minstd_rand (but is boost::mt19937, for example): "'operator<<' not implemented in type '_STL::ofstream' for arguments of type 'boost::mt19937'". Any help would be appreciated, thanks in advance, Marco -- No virus found in this outgoing message. Checked by AVG Free Edition. Version: 7.1.405 / Virus Database: 268.11.7/436 - Release Date: 01/09/2006

1 0

[boost::serialization] Newbie question on de-serializing a collection without reading into an STL
by Graham Hudspith 04 Sep '06

04 Sep '06

Apologies for the basic nature of this question . but I've scoured the documentation for the Boost Serialization library without any hint of how to solve this. I want to use the Boost Serialization library to allow the saving and loading of a collection of database rows. This will use XML as the file format. All of the examples in the documentation assume that there is a "root" object saved, and in the case of a collection on objects, just save and load the collection itself: void save_mib(const vector<Row>& mib, const string& filename) { ofstream ofs(filename.c_str()); boost::archive::xml_oarchive oa(ofs); oa << BOOST_SERIALIZATION_NVP(mib); } void load_mib(vector<Row>& mib, const string& filename) { ifstream ifs(filename.c_str()); boost::archive::xml_iarchive ia(ifs); ia >> BOOST_SERIALIZATION_NVP(mib); } However, this will be a LARGE collection of rows, and I don't want to read them all in at once. Instead, I want to read them in, one at a time and process piecemeal. However, I can't work out from the documentation how to test that there is another row left to read . So, I can successfully output a list of rows: void save_mib(const vector<Row>& mib, const string& filename) { ofstream ofs(filename.c_str()); boost::archive::xml_oarchive oa(ofs); const vector<Row>::const_iterator mibEnd(mib.end()); for (vector<Row>::const_iterator i(mib.begin()); i != mibEnd; ++i) { const Row& row(*i); oa << BOOST_SERIALIZATION_NVP(row); } } I have not been able to deduce how to read these back in again without relying on there being a "stream error" exception thrown . void load_mib(vector<Row>& mib, const string& filename) { ifstream ifs(filename.c_str()); boost::archive::xml_iarchive ia(ifs); Row row; try { while (1) { ia >> BOOST_SERIALIZATION_NVP(row); mib.push_back(row); } } catch (boost::archive::archive_exception& ae) { cout << "caught archive_exception '" << ae.what() << "'\n"; } catch (exception& e) { cout << "caught exception '" << e.what() << "'\n"; } catch (...) { cout << "caught unknown exception\n"; } } Is that the best way to do it? Surely there is a better, exception-free, method? Also, can anyone please suggest a way of doing this using ostream_iterators and istream_iterators? Thank you for reading this far! Graham.

2 1

compilation performance of lambda when using /clr (VC8)
by Matyas W Egyhazy 04 Sep '06

04 Sep '06

Hi, I noticed that the compilation performance on my old development machine increased dramatically when using the /clr option in VC8 (Visual Studio 2005) compared to not using any clr/managed code whatsoever. (4 seconds -> 1.5 minutes) Is there a workaround for this? Has this been discussed before? Thanks, Matt

1 0

[pool] why no object-pool with O(1) allocation AND O(1) deallocation?!?
by Andre Krause 04 Sep '06

04 Sep '06

dear boost users, boost offers in lib pool the class object_pool. as is stated in the docs, it allows for allocation with O(1) but deallocation need O(n) time. i suppose it has to search the internal list for the position of the object ro be freed. but this could be speed up a lot by using a stack of free objects. if one would like to allocate an object, a pointer to a free memory cell is popped from the stack, if the object should be returned / freed to the pool, that objects pointer is pushed onto the stack. of course this causes memory overhead, but, for example if one would like to implement a really large pool of small objects for a particle system, then O(n) deallocation is prohibitive. so my question is why boost does not offer an alternative version of object_pool with both O(1) alloc and dealloc ? below is my version of a stack based object pool with O(1) both alloc and dealloc. i really do not like my implementation, but i did not know how to do better... template<class T> class Smallobjects_Pool { protected: class Node // a node of a double linked list { public: Node() {prev=next=NULL; idx=-1; } Node* prev; Node* next; int idx; // index to the objects - vector T obj; }; //Node* next(int cur) { return objects[cur].next;} //Node* root() { return _root; } //Node* last() { return _last; } protected: Node* _root; Node* _last; vector<Node> objects; vector<int> free_objects; public: T & operator[](int i){return objects[i].obj;} bool empty() { return _root == NULL;} Smallobjects_Pool(int initial_size) { _root=NULL; _last=NULL; objects.resize(initial_size); free_objects.reserve(initial_size); for(unsigned int a=0;a<objects.size();a++) free_objects.push_back(a); } void push_back(const T& t) { //assert(!free_objects.empty() && "out of capacity"); if(free_objects.empty()) { PR("small object pool full.."); PR(objects.size() - free_objects.size()); return; } Node* new_obj = &(objects[free_objects.back()]); new_obj->idx = free_objects.back(); free_objects.pop_back(); if(_root==NULL) { _root=new_obj; new_obj->prev=NULL; new_obj->next=NULL; } else { _last->next=new_obj; new_obj->prev=_last; new_obj->next=NULL; } _last=new_obj; new_obj->obj = t; } class iterator { //protected: public: Node* i; public: iterator(Node* _i) : i(_i) {} ~iterator() {} iterator& operator=(const iterator& other) { i = other.i; return(*this); } // The assignment and relational operators are straightforward bool operator==(const iterator& it) { return(i == it.i); } bool operator!=(const iterator& it) { return(i != it.i); } iterator& operator++() { assert(i && "increment on null pointer"); i = i->next; return(*this); } // Update my state such that I refer to the next element in the SQueue. //Iterator& operator++(int) { Iterator tmp(*this); ++(*this); return(tmp);} T& operator*() { return i->obj; } // Return a reference to the value in the node. I do this instead of returning by value so a caller can update the value in the node directly. T* operator->() { return &(i->obj); } // Return the address of the value referred to. }; iterator begin() { return(iterator(_root));} iterator end() { return(iterator( NULL));} iterator erase(iterator i) { assert(i.i!=NULL && "cannot free null pointer."); free_objects.push_back(i.i->idx); if(i.i == _last) { if(i.i->prev != NULL) _last = i.i->prev; _last->next=NULL; return NULL; } if(i.i == _root) { _root = i.i->next; _root->prev=NULL; return _root; } i.i->prev->next = i.i->next; i.i->next->prev = i.i->prev; return iterator(i.i->next); } };

2 1

Can't build Boost on MSVS 2005
by Saul Spatz 03 Sep '06

03 Sep '06

I downloaded Boost and bjam today,and I'm trying to build on MSVS 2005. I run vsvars32.bat, and then I try bjam "-s VC80_ROOT= C:\Program Files\Microsoft Visual Studio 8\VC -stools=vc-8_0 --builddir=C:\temp --with-python-version=2.4 --with-pydebug" install but none of the libraries get built. I keep seeing stuff like CALL "C:\Program Files\Microsoft Visual Studio .NET 2003\VC7\bin\VCVARS32.BA T" >nul "C:\Program Files\Microsoft Visual Studio .NET 2003\VC7\bin\cl" /Zm800 -nologo <snip> which fails because there, is of course, no MSVS .NET 2003 directory. As far as I can tell, there is no environment variable on my system that mentions VS 2003. Can anyone help? Saul Spatz -- View this message in context: http://www.nabble.com/Can%27t-build-Boost-on-MSVS-2005-tf2204913.html#a6106… Sent from the Boost - Users forum at Nabble.com.

3 2

[MPL] Late-Breaking Map/Set/Performance Fixes?
by Holcomb, William (Tom ) 03 Sep '06

03 Sep '06

Greetings: Are there any map/set (or general/performance MPL) fixes for problems in earlier Boosts (such as 1.33.1) that didn't make it into the 1.34.0 Release Candidate? I ask because I'm working on a metaprogramming prototype (~200 lines of code so far) that uses associative sequences and whose compilation behavior was greatly improved by switching from 1.33.1 to 1.34.0, but now the compiler (msvc-8) runs out of heap space if I increase the size of the input sequence from 4 to 5 (in production, my solution would have to contend with sequences of size 60+, so I'm worried). I can't rule out the possibility that I've got some HUGE recursion or something going on in my prototype, but I want to pursue this possibility as well. If anyone is aware of said late-breaking fixes, I'd be grateful if you'd let me know how to get them (please be patient as I am a total CVS (not to mention Boost/MPL/newsgroup) newbie). Thanks, Tom

2 1

Date calculations with exclusions
by kingos＠optusnet.com.au 02 Sep '06

02 Sep '06

Hi, I am hoping to use boost::date_time to do some date calculations. What I want to do is basically work out the number of days to a given date with various exclusions applied. eg. How many working days are there to christmas? using namespace boost::gregorian; int CalculateDaysToChristmas() { date_period someHoliday(date(2006, Dec, 01), date_duration(1)); date today(2006, Sep, 1); date christmas(2006, Dec, 25); int days = 0; for (day_iterator i = today; i != christmas; ++i) { if (is_weekday(*i) && !someHoliday.contains(*i)) ++days; } return days; } However, I can't find a simply way to work out is_weekday ... Secondly, is there some way to put every sunday in as a date_period? Thirdly, this doesn't seem very optimal ... is there a better way of doing this? Thanks, Andrew

3 2

Re: [Boost-users] Date calculations with exclusions
by james.jones＠firstinvestors.com 01 Sep '06

01 Sep '06

From: kingos(a)optusnet.com.au > Hi, > > I am hoping to use boost::date_time to do some date calculations. What I want to do is > basically work out the number of days to a given date with various exclusions applied. > > eg. > > How many working days are there to christmas? > > using namespace boost::gregorian; > > int CalculateDaysToChristmas() > { > date_period someHoliday(date(2006, Dec, 01), date_duration(1)); > > date today(2006, Sep, 1); > > date christmas(2006, Dec, 25); > > int days = 0; > for (day_iterator i = today; i != christmas; ++i) > { > if (is_weekday(*i) && !someHoliday.contains(*i)) > ++days; > } > > return days; > } > > However, I can't find a simply way to work out is_weekday ... > Secondly, is there some way to put every sunday in as a date_period? > Thirdly, this doesn't seem very optimal ... is there a better way of doing this? First off, is_weekday is pretty simple, something like: bool is_weekday(const gregorian::date& d) { return d.day_of_week != Saturday && d.day_of_week != Sunday; } Second, I don't understand your question about Sundays. Third, you're right, it isn't very optimal. You'd be better off to note that weekdays in a period are equal to: complete weeks in the period * 5 + extra weekdays at the end of the period - holidays in the period Complete weeks in the period is easy to compute (days_between/7); the extra weekdays could be done via iterator (but guarantee to be <= 6 times through the loop) or via lookup table if you want really fast results. So this just leaves holidays in the period. It would be pretty easy to build a class which implemented a fast (constant-time) lookup for the # of holidays given a starting and ending date. Once you've got that, voila. If you're looking for some really quick way to do this in Boost::DateTime, I don't think it's possible. Holidays aren't even localizable, since different businesses in the same locale can have different holiday schedules. It might be nice to include some sort of "date-exclusion" functionality in Boost that would implement the class I propose above, but I'm not sure this would be generally useful enough to bother with. Anyone else have an opinion on this? - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

1 0

[Boost.Test] how to get current test outcome from within test case
by Pierre-Jules Tremblay 01 Sep '06

01 Sep '06

This must be an FAQ but I haven't found the answer in the documentation. With Boost.Test, is there a way to know whether the current test case's success/failure status? Cheers pj

2 5

[asio] how to check connection state
by Sascha Seewald 01 Sep '06

01 Sep '06

Hi boosters! I've written a simple client-server example using boost::asio::ip::tcp::socket. I establish the connection using socket::connect() and close it using socket::close(). But how can I determine the current state of connection (Am I still connected or not?) Is it sufficient to check whether the socket is open? Is there a function socket::is_open()? Or do I have to track errors for disconnection events and set some is_connected-flag somewhere. Btw what is the purpose of the keep_alive socket option? Thanks in advance Sascha

1 0

[boost::serialization]assertion in basic_iarchive.cpp
by Sascha Friedmann 01 Sep '06

01 Sep '06

Hello, when loading my application's state from a text file I get sometimes this assertion: Assertion failed: object_id_vector[i].adress >= old_adress, file ../src/basic_iarchive.cpp It's very strange because sometimes this assertion is triggered and sometimes not. What exactly does this assertion mean? Thanks. Sascha Friedmann

2 2

Include file problem
by Dave 31 Aug '06

31 Aug '06

Hello all, I sent the following to the spirit newsgroup, but it did not appear. I thought I'd try here. I am using the following boost version under Visual C++ 7.1: #define BOOST_VERSION 103200 I have the following #include in one of my source files: #include <boost/spirit/iterator/file_iterator.hpp> This induces the following compilation error: c:\sts\boost\boost\spirit\iterator\file_iterator.hpp(56) : fatal error C1083: Cannot open include file: 'boost/spirit/core/safe_bool.hpp': No such file or directory How may I remedy this? Also, I am intending to use file_iterator<> objects in conjunction with regex_search. Is there any reason this should not be done? Thanks, Dave

1 0

[asio] Question for Chat example
by Christian Henning 31 Aug '06

31 Aug '06

Hi there, I trying to wrap my head around the Chat example. In the chat_server's handle_accept() another chat_session is being created and I don't understand why. Also, why is the acceptor trying to accept another connection here? Thanks, Christian

1 0

problem with boost::shmem on Solaris 10 Sun Studio 11
by Clarke, Trevor 31 Aug '06

31 Aug '06

I'm trying to use boost::shmem and I'm having trouble on Solaris. The same code works fine on Windows with VS8. I'm getting: Error: Redefining boost::shmem::detail::segment_manager<boost::shmem::detail::CharType, ... After use in boost::shmem::detail::segment_manager<char, boost::shmem::simple_seq_fit... The offending line in boost::shmem is typedef segment_manager<CharType, MemoryAlgorithm, IndexType> segment_manager; in boost::shmem::detail::segment_manager::index_config The code in my application is mpLast->mNext = reinterpret_case<my_list_node*>(mpSegment->construct<my_list_node>(boost ::shmem::anonymous_instance)()); whieh mpSegment is a segment_manager*. Any idea what is going on? -------------------- Trevor R.H. Clarke tclarke at ball.com <mailto:tclarke@ball.com> Ball Aerospace & Technologies Corp

2 1

Graph - compiling with gcc-4.1.1
by Todd A. Gibson 31 Aug '06

31 Aug '06

I have code utilizing the boost graph library. It has compiled fine for some time under gcc-3.x and fails on gcc-4.1.1 (x86-32). Pasted at the end of this message are the relevant compile errors. A quick google search reveals that two other folks have reported this same error (in different boost graph-using applications) with gcc-4.1 using different Linux distributions. My questions are: 1) Has this been reported here before? 2) If yes, has a patch been posted? My graph code lies beneath several layers of application code, so I wanted to check here before spending the time trying to build a simple test case which reproduces the error. Thanks. -TAG Todd A. Gibson /usr/include/boost/graph/depth_first_search.hpp: In function ‘void boost::depth_first_search(const VertexListGraph&, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = std::vector<std::vector<unsigned int, std::allocator<unsigned int> >, std::allocator<std::vector<unsigned int, std::allocator<unsigned int> > > >, P = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<unsigned int, std::allocator<unsigned int> > > >, T = boost::graph_visitor_t, R = boost::bgl_named_params<boost::identity_property_map, boost::vertex_index_t, boost::no_property>]’: /usr/include/boost/graph/topological_sort.hpp:64: instantiated from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = std::vector<std::vector<unsigned int, std::allocator<unsigned int> >, std::allocator<std::vector<unsigned int, std::allocator<unsigned int> > > >, OutputIterator = std::back_insert_iterator<std::vector<unsigned int, std::allocator<unsigned int> > >, P = boost::identity_property_map, T = boost::vertex_index_t, R = boost::no_property]’ /usr/include/boost/graph/transitive_closure.hpp:120: instantiated from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::mapS, boost::vecS, boost::bidirectionalS, pygraph_templates::VertexAttrs, boost::property<boost::edge_index_t, int, pygraph_templates::EdgeAttrs>, boost::no_property, boost::listS>, GraphTC = boost::adjacency_list<boost::mapS, boost::vecS, boost::bidirectionalS, pygraph_templates::VertexAttrs, boost::property<boost::edge_index_t, int, pygraph_templates::EdgeAttrs>, boost::no_property, boost::listS>, G_to_TC_VertexMap = boost::iterator_property_map<unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, pygraph_templates::VertexAttrs, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, pygraph_templates::VertexAttrs, boost::no_property>, unsigned int>]’ /usr/include/boost/graph/transitive_closure.hpp:263: instantiated from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = pygraph::DirAdjList, GraphTC = pygraph::DirAdjList]’ src/DirectedGraph.cpp:392: instantiated from here /usr/include/boost/graph/depth_first_search.hpp:324: error: no matching function for call to ‘vertices(const std::vector<std::vector<unsigned int, std::allocator<unsigned int> >, std::allocator<std::vector<unsigned int, std::allocator<unsigned int> > > >&)’

1 0

Re: [Boost-users] [Serialization] Runtime error in release but not in debug builds (Visual C++ 8)
by Nat Goodspeed 31 Aug '06

31 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Dieter Buys > Sent: Wednesday, August 30, 2006 6:36 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] [Serialization] Runtime error in release but not in > debug builds (Visual C++ 8) > > std::ofstream ofs(saveAsDialog.GetPath()); [Nat] Open the ofstream in binary mode? > boost::archive::binary_oarchive oa(ofs);

2 1

[regex] - Bug in boost::regex ??
by kiran 31 Aug '06

31 Aug '06

Hi I am trying to extract a pattern from a file. Actually there are 2 occurances of the pattern in the file, one in line 2-3 and other in line 4. But the program is only reporting the occurance in line 4. The reason why i am giving (.|\n) coupled 'match_not_dot_newline' with is that i want the regex to be perl compatible. Why is the program not reporting the first occurance ? Is this a bug ? I am attaching the code and file. Thanks Kiran.

3 6

Using regex on a file
by Dave 31 Aug '06

31 Aug '06

Hello all, I would like to programmatically search a (large) binary file for a particular text string and get a boolean result back - either the string appeared or it did not. I imagine whatever I end up implementing will be platform-independent, but I'll state anyway that I am using Visual C++. My first thought was to use regex_search and pass it two stream iterators, one pointing to the beginning of the file and one representing the end of the file. Alas, this won't work since regex_search requires bidirectional iterators, which stream iterators are not. I would appreciate any suggestions as to how I can most efficiently and elegantly achieve my goal. Thank you! Dave

2 1

[Serialization] Runtime error in release but not in debug builds (Visual C++ 8)
by Dieter Buys 31 Aug '06

31 Aug '06

Hi, My program is now crashing when I do a release build and try to serialize my data, but in the debug version it works just fine. Area where it is crashing appears to be: std::ofstream ofs(saveAsDialog.GetPath()); boost::archive::binary_oarchive oa(ofs); Specifically on the second line, where it attempts to create the archive on the file stream, it just crashes. At this point I have no idea what could be causing it. I am using MS Visual C++ 8. Cheers, Dieter Buys

2 1

Re: [Boost-users] Using regex on a file
by Todd Greer 31 Aug '06

31 Aug '06

Dave wrote: > My first thought was to use regex_search and pass it two stream iterators, > one pointing to the beginning of the file and one representing the end of > the file. Alas, this won't work since regex_search requires bidirectional > iterators, which stream iterators are not. You might consider using a file_iterator from Spirit. It is a random-access iterator for files, which sounds like exactly what you need. Check it out at http://www.boost.org/libs/spirit/doc/file_iterator.html. -- Todd

1 0

Problem building 1.33.1 for Intel Mac -- Seeking patches if they exist.
by Bennett Smith 30 Aug '06

30 Aug '06

Hi, I am attempting to build Boost 1.33.1 for an Intel Mac. Some of the libraries do not build successfully, and I think it is related to the different architecture. One of the errors I get is: ld: Undefined symbols: __Z9test_mainiPPc Does anyone have patches for Boost 1.33.1 that would make it build everything successfully on an Intel Mac? BTW, I also tried doing a build of the 1.34.0 release candidate files and everything there seems to build fine. I just don't really want to base our project on 1.34 until it is officially released. Thanks for any help you can offer. Cheers -- Bennett

1 0

Re: [Boost-users] Mismatch and regex newbie problem still problem -- FINAL NOTE
by james.jones＠firstinvestors.com 30 Aug '06

30 Aug '06

From: "david v" <danova_fr(a)hotmail.com> > Thanks to all for your comments.... > It's a pity this class of functionality is not implemented in boost. I'm in > the bioinformatics field and starting to work with boost. The use of regex > in general as boost implements is quite common in the field and boost is > very handy.!!! However at some point some advanced functionalities with > insertion,deltions and repeats are very handy to use. Maybe there's a chance > that some of the work out there get into boost as a boost_bio module ??? > Note that biocpp.sourceforge.net has done some work on bioinformatics and > that maybe it would be interesting to know if they were willing to move > their codeinto boost. This will avoid people from having to install > thousands of libraries to do their work. > > What do you think ?? I think if this functionality were added, it should NOT be called Boost.Bio or refer to bioinformatics in any way, because this isn't bioinformatic-specific. But in general adding these string algorithms would be useful - they are used in many fields. - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

1 0

is mpl::for_each depricated?
by Ovanes Markarian 30 Aug '06

30 Aug '06

Hi! Unfortunately I can not find online documentation for the mpl::for_each algorithm. Which I know from C++ Metaprogramming book. Is it depricated? I need at least the header file name. Would be nice if docs would be updated, at least stating, that this function is depricated. With Kind Regards, Ovanes Markarian

2 1

Documentation Suggestion.
by Minkoo Seo 30 Aug '06

30 Aug '06

Hi. I enjoy boost library these days, and really appreciate it. However, sometimes, I found it very hard to even compile a program that uses boost libraries. As an example, serialization library needs libboost_serialization.so. Hence, I have to compile a program like the following: g++ -lboost_serializatino foo.cpp Nevertheless, AFAIK, nowhere in the document, how to compile a program is not presented. Some of the docs even mention the header file. I don't know why this is so common in the documentation of boost, and I think mentioning how to compile will be very useful for users. So, please, please put some 'how to compile' section especially if the library needs -lxxx_library flag. I really thank boost developers' time and efforts. Sincerely, Minkoo Seo -- View this message in context: http://www.nabble.com/Documentation-Suggestion.-tf2189683.html#a6058183 Sent from the Boost - Users forum at Nabble.com.

3 4

[iostreams] Auto flush required
by Roman Perepelitsa 30 Aug '06

30 Aug '06

Hi. I've implemented output stream using boost.iostreams library. It requires call to flush in order to actually write data to sink. But I want to flush data to sink automatically after I write any object with operator<<. struct stream_sink : public boost::iostreams::sink { stream_sink(std::ostream & strm) : strm_(strm) {} std::streamsize write(const char * s, std::streamsize n) { if (strm_.write(s, n)) return n; else throw std::runtime_error("error"); } private: std::ostream & strm_; }; std::stringstream s; boost::iostreams::stream<stream_sink> strm(s); strm << "abc"; strm.flush(); std::cout << "String: '" << s.str() << "'" << std::endl; This test outputs "String: 'abc'" but if you comment strm.flush() then it outputs "String: ''". I want my stream to work like the stringstream does (it does not require call to flush). std::stringstream strm; strm << "abc"; std::string s; strm >> s; std::cout << "String: '" << s << "'" << std::endl; It outputs "String: 'abc'". I need it to create stream which can be used to convert wide char data (wchar_t *) to multibyte (char *). It can be used this way: // wcstombsstream is wostream and istream // "utf-8" is multibyte encoding wcstombsstream strm("utf-8"); strm << L"abc"; std::string s; strm >> s; This code does not work at the moment because it requires to call strm.flush() before reading from stream. Thus I need some auto flush facility :-) Thank you for any help, Roman Perepelitsa.

1 1

Boost Serialization lib:Problem in object tracking and Exporting classes
by mahesh prabhu 30 Aug '06

30 Aug '06

Hi, I'm new to Boost Serialization library . I wanted to use the library for some of my full fledge so I thought I might as well test out the features that the library documentation claimed it had . Many of the basic features did work but some of the advanced features that I wanted most like object tracking and serializing derived objects through a pointer to the base class gave me some problems . I faced the following two problems ( in order of decreasing priority ): (1) Object Serialization : I have 4 pointers to 3 objects of the same class , On deserializing these the pointers are mixed up . If while writing out pointers 1 & 2 pointed to objects 1 and 2 , and pointers 3 and 4 pointed to objects 1 and 3 then on restoration pointers 1 & 2 pointed to objects 1 & 2 but pointers 3 & 4 pointed to objects 2 and 3 instead of 1 and 3 . (2) Writing derived objects through pointer to base class : This feature worked if I did a registration through ar.register_type(static_cast<gps_moreAcc1 *>(NULL)) but did not work if I did BOOST_CLASS_EXPORT( gps_moreAcc1) . I get a "DoneAbort" message i.e a core dump . I don't know too much about templates , so I was not able to debug the problem . I have attached a program which exhibit both problems , but the code that causes the second problem is commented out . This can be reproduced by just commenting out ar.register_type calls and uncommenting BOOST_CLASS_EXPORT macros . I have added more comments in the source file . Please let me know if I am doing something wrong or if these are know problems with the serialization library or if the serialization library cannot be handled by serialization . +Mahesh

1 0

Re: [Boost-users] timed_mutex::scoped_timed_lock
by Andrew Wingorodov 30 Aug '06

30 Aug '06

10x, sorry for my english > I am not sure what this delay function does. this function from ${BOOSTDIR}/libs/thread/test/util.inl > scoped_time_lock takes boost::xtime or bool. 4 here is interpreted as > "true", not as time. oops. okey, the new version of my cool program (how i can see event of timeout?) are ///------- COOLPRG timed_mutex mut; #define TIMEOUT 1 #define AUTHTIME 4 void timeout () { timed_mutex::scoped_timed_lock lk (mut, delay(TIMEOUT)); if ( lk.locked ()) cout << "how i can see event of timeout?" << endl; else cout << "okey!" << endl; } std::auto_ptr<timed_mutex::scoped_timed_lock> lock; void auth () { cout << "auth" << endl; boost::thread::sleep ( delay(AUTHTIME)); cout << "auth end" << endl; lock->unlock(); } int main () { lock = (std::auto_ptr<timed_mutex::scoped_timed_lock>) new timed_mutex::scoped_timed_lock (mut,10); thread_group run; run.create_thread ( &auth); run.create_thread ( &timeout); run.create_thread ( &timeout); run.create_thread ( &timeout); run.join_all(); if ( !lock->locked ()) cout << "unlock!" << endl; } ///EOF And result (how i can see event of timeout?): andr@andr> ./coolprg auth okey! okey! okey! auth end unlock! andr@andr> -- andr.ru

1 0

[BGL] access order in outEdgeList containers ?
by Manuel Yguel 30 Aug '06

30 Aug '06

Hello, Does the order of the add_edge() calls for an adjacency_list graph with vecS or listS OutEdgeList containers defines the access order through out_edge_iterators ? If true, how to define some add_edge_after() method with the same semantic than the insert_after method defined for slist in http://www.sgi.com/tech/stl/Slist.html Thanks a lot. P.S. thanks Doug, for your answer concerning graph properties.

1 0

[regex] - Don't give wrong documentation in boost site itself.
by kiran 30 Aug '06

30 Aug '06

Hi This mail is to say that wrong documentation in a site like boost in no worser than no documentation at all. http://www.boost.org/libs/regex/doc/syntax_perl.html In this the second line saying that "Perl regular expressions are the default behavior in Boost.Regex" and then when using boost::regex i found that "dot" in perl and boost::regex have different meaning by default. I am not speaking aganist the guy who made the documentation. He did a great job by creating the doc which help newbies like me to great extent. The aim of this mail is to get the doc corrected. Could anyone tell what are the differences between perl regex and boost::regex by default . Thanks Kiran.

1 0

[regex] - Doubts of a regex beginner on boost::regex getting aborted.
by kiran 30 Aug '06

30 Aug '06

Hi, I have 2 doubts 1) Why is regex expr("Resurfacing.*?Home", boost::regex::icase) getting aborted. ? 2) How to make boost regex behave like perl regex ? I mean "dot" in boost::regex is taking new lines as well. How to prevent this ? Is "boost::regex::perl" flag the answer to the question ? Thanks in advance Kiran.

2 1

Mismatch and regex newbie problem still problem
by david v 30 Aug '06

30 Aug '06

So to sum-up. If the regex i'm looking for is "testing" and the string to search the regex for is "tastung" (obviously this is a short example but i'm dealing with more complex regular expressions. how can i get the number of mismatches. Basically the output of the program would tell me: >2 mismatches found in string "tastung" at position 2 (a) and 5(u). I have tried the iterator above but does not seem to do what i want??? std::string::const_iterator start = in.begin(); std::string::const_iterator end = in.end(); boost::sregex_token_iterator i(start, end, *regex, -1), j; while(i != j) { cout << *i << endl; }

2 2

timed_mutex::scoped_timed_lock
by Andrew Wingorodov 30 Aug '06

30 Aug '06

Why result of my program such? auth() sleeps one second, and I have established four in timeout. I thought, that will be "okey". why timeout? # ./a auth auth end timeout! timeout! timeout! # ///----------------------------- static timed_mutex mut; void timeout () { timed_mutex::scoped_timed_lock lk (mut,4); if ( lk.locked ()) cout << "timeout!" << endl; else cout << "okey!" << endl; } timed_mutex::scoped_timed_lock *lock; void auth () { cout << "auth" << endl; boost::thread::sleep ( delay(1)); cout << "auth end" << endl; delete lock; } int main () { lock = new timed_mutex::scoped_timed_lock (mut,10); thread_group run; run.create_thread ( &auth); run.create_thread ( &timeout); run.create_thread ( &timeout); run.create_thread ( &timeout); run.join_all(); } -- andr.ru

3 2

reference_wrapper question
by Ovanes Markarian 29 Aug '06

29 Aug '06

Hello, I have a small problem. Some of my data holders have dereference operator which returns refernces to contained types. The problem I face here is that I have some noncopyable types and the dereference operator fails to compile. I thought using a reference_wrapper class could do the trick, but then I can not call functions on the contained type without explict casting, regardless operator T&() const defined. here is a small test app to simulate the behavior: #include <boost/ref.hpp> #include <boost/array.hpp> #include <boost/utility.hpp> using namespace std; template<class T> struct test { test() : ptr(new T()) {} ~test() { delete ptr; } boost::reference_wrapper<T> operator*() { return boost::ref(*ptr); } T* ptr; }; template<class T, int N> class array : public boost::array<T,N> , private boost::noncopyable {}; int main(int argc, char* argv[]) { test< array<int,10> > t; int size = (static_cast<array<int,10>&>(*t)).size(); } Is there any way to call the last line like: int size = (*t).size(); operator ->() would work just fine, but I need to support both. Thanks for help, Ovanes Markarian

1 0

Build program_options using stdcall
by Ben Weatherman 29 Aug '06

29 Aug '06

I want to build the program_options library, but using the stdcall calling convention. Is there a command-line parameter I can pass to bjam that will do this? Thanks in advance, Ben

1 0

bind trouble
by Sebastian Weber 29 Aug '06

29 Aug '06

Hello everybody! I ran into a very weird problem with boost::bind and boost::function. I am using boost 1.33.1 with a g++ 4.0.3 on a Ubuntu dapper system. The code which does not compile is: boost::function< double(double) > pFunc = boost::bind(std::pow, _1, -3); While this code fragment does: double f(double k, double p) { return std::pow(double(k), p); } boost::function< double(std::size_t) > pFunc = boost::bind(f, _1, -3); Ok, I got a solution, but may someone enlighten me what is wrong with the first version? The error message from g++ is correlFunc.cpp: In function 'int main(int, char**)': correlFunc.cpp:184: error: no matching function for call to 'bind(<unknown type>, boost::arg<1>&, double)' Thanks in advance! Greetings, Sebastian Weber

2 1

[Regex] - Is this a limitation of sregex_iterator ?
by kiran 29 Aug '06

29 Aug '06

Hi I am using sregex_iterator to parse an html file like below. string htmlFile; //populate htmlFile with a file contents regex regExpr("Resurfacing(.|\\n)*Home", boost::regex::icase); sregex_iterator itr(htmlFile.begin(), htmlFile.end(), regExpr); But that is throwing and std::runtime_error exception with message "Regular expression too big". What can i do to avoid this ? I went through http://www.boost.org/libs/regex/doc/configuration.html and changed the variables like below #define BOOST_REGEX_NON_RECURSIVE #define BOOST_REGEX_BLOCKSIZE (4096 * 10) #define BOOST_REGEX_MAX_BLOCKS 1024 Even after that i am getting the same error message. I found that when i changed the regular expression ( i mean a simpler 'regExpr' variable) to a simpler one, the exception (std::runtime_error) was not thrown. I need to parse big html files for some complex regular expressions. I dont mind even if the sregex_iterator takes much memory or time.How can i solve this error. ? Or is this a limitatiton of boost::regex library. Thanks In Advance Kiran.

2 2

Mismatch and regex newbie problem still problem
by david v 29 Aug '06

29 Aug '06

Yes i think there were some misunderstanding here.. I think that comes by the definition you have of mistake. A mistake for me is as follows: Regex: "testing" String_to_search: "tastung". The output should be that the regex testing was found but with 2 mismatches that are "a" and "u". So a mismatch is a letter that was not found. It may sound weird to you but the way i'm using the regex is to identify genomic regions, so in other words for biological applications. In some cases my regex is a piece of DNA such as "atgcta" and i want to search for this regex in another piece of DNA. Given the fact that the regex "atgcta" can be found in the genome many times i will get probably get a lot of matches. But in some cases i want to be able to search for "atgcta" but i want to allow some mismatches. Obviuously i will even get more matches but i think regex can be a more much efficient way that by building ip aligment matrices. ANy idea how to handle the example above >-----Original Message----- >From: boost-users-bounces_at_[hidden] [mailto:boost-users- >bounces_at_[hidden]] On Behalf Of david v >Sent: Tuesday, August 29, 2006 9:08 AM >To: boost-users_at_[hidden] >Subject: [Boost-users] Mismatch and regex newbie problem still problem > >So to sum-up. >If the regex i'm looking for is "testing" and the string to search the >regex >for is "tastung" (obviously this is a short example but i'm dealing with >more complex regular expressions. > >how can i get the number of mismatches. Basically the output of the >program >would tell me: > >2 mismatches found in string "tastung" at position 2 (a) and 5(u). [Nat] Maybe I'm completely misunderstanding you. If so, please forgive me. I think you're saying that you want to start with the regex "testing" and have the library detect that the string "tastung" is somehow similar but nonetheless distinct. My belief is that, given the regex "testing", the library will not recognize the string "tastung" in any way. It will simply report that no match was found. You could construct a more complex regex that would handle this particular example. You could, for instance, say that you want to match a "t", followed by an arbitrary character, followed by "st", followed by another arbitrary character, followed by "ng". The library would report that the string "tastung" matches that regex, and you could ask it to tell you the specific substrings matching the variable parts. But if you want to allow arbitrary variance in any character position -- as long as some other set of character positions matches -- then I'm a little perplexed as to how to express that in a regular expression. Maybe an exhaustive family of acceptable alternatives? But if you're dealing with longer expression strings, that could explode really quickly. I think you need to get really specific about the rules you want to use to detect a "mismatch." Then you need to figure out whether the regex library is the right tool to help you apply those rules. Again, sorry if I'm way off base here.

5 4

Mismatch and regex newbie problem still problem"
by david v 29 Aug '06

29 Aug '06

Hello, As James pointed out the right place to start with will be suffix tree algorithms. The only thing i don't know if this is going to be very time consuming ??? ######For Brian.... 1) What's the longest string you're searching for? For the moment is limited to 6 to 8 characters. 2) What's the smallest bit-width of any cpu on which you're running your code? I'm on 64 dual opteron machine 3) How familiar with string searching/matching are you? Quite familiar but was looking for a cpp library that could handle it instead of trying to rewrite things. Best, david

3 2

Re: [Boost-users] Mismatch and regex newbie problem still problem
by Nat Goodspeed 29 Aug '06

29 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of david v > Sent: Tuesday, August 29, 2006 10:02 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Mismatch and regex newbie problem still problem > > It may sound weird to you but the way i'm using the regex is to identify > genomic regions, so in other words for biological applications. > In some cases my regex is a piece of DNA such as "atgcta" and i want to > search for this regex in another piece of DNA. [Nat] That's not weird. I wasn't questioning your desired processing, just trying to figure out where the disconnect lies. > in some cases i want to be able to search for "atgcta" but i > want to allow some mismatches. Obviuously i will even get more matches but > i > think regex can be a more much efficient way that by building ip aligment > matrices. [Nat] This is where you have to get really specific about what kinds of mismatches you want to recognize. For example, will the sequence always begin with "at" and end with "ta" and be separated by exactly two items? ("atxxta") In that case regex is perfect for the problem. If the variable items are at fixed positions within the original pattern, it's easy. But since I don't yet know the full set of cases you intend to allow as a "mismatch," there's room for me to speculate that you might want to find "xtgcta" or "axgcta" or "atxcta" or "atgxta" or "atgcxa" or "atgctx" (one item wrong) or "xxgcta" or "xtxcta" or ... That's for a sequence length of 6. The full list of permutations is so long that you'd want to generate it programmatically. Step up to a length of 7 and that list gets alarmingly longer. That's what I meant when I said that it could quickly explode. How many items must match the original pattern before you recognize a valid "mismatch"? Presumably it's at least 1, otherwise you'd validly "mismatch" every position in every string. In practice, matching only 1 item out of 6 makes little sense to me either. You need to define what does make sense. It may be that regex is still the best tool for the job. But depending on the full set of possibilities that you mean by "mismatch," you might have to hand-code the (mis)match testing instead. I can imagine generating a regex string that would choke the library.

1 0

little endian detection
by Andreas Fabri 29 Aug '06

29 Aug '06

Hello, Is boost supported for Visual C++ 8 in 64 bit mode on XP 64 on an AMD Turion. When I run cl.exe /E boost/detail/endian.hpp I get the error message that it must be set up correctly. I use boost-1_33_1 coming with cygwin. thanks in advance, andreas

2 1

Re: [Boost-users] Mismatch and regex newbie problem still problem
by james.jones＠firstinvestors.com 29 Aug '06

29 Aug '06

From: "david v" <danova_fr(a)hotmail.com> > Yes i think there were some misunderstanding here.. I think that comes by > the definition you have of mistake. A mistake for me is as follows: > > Regex: "testing" > String_to_search: "tastung". > The output should be that the regex testing was found but with 2 mismatches > that are "a" and "u". So a mismatch is a letter that was not found. > > It may sound weird to you but the way i'm using the regex is to identify > genomic regions, so in other words for biological applications. > In some cases my regex is a piece of DNA such as "atgcta" and i want to > search for this regex in another piece of DNA. Given the fact that the regex > "atgcta" can be found in the genome many times i will get probably get a lot > of matches. But in some cases i want to be able to search for "atgcta" but i > want to allow some mismatches. Obviuously i will even get more matches but i > think regex can be a more much efficient way that by building ip aligment > matrices. > > Any idea how to handle the example above I don't see how regex can help you here. You need to use more complicated string algorithms. Try this: http://en.wikipedia.org/wiki/Suffix_tree - James

1 0

Re: [Boost-users] Mismatch and regex newbie problem still problem
by Nat Goodspeed 29 Aug '06

29 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of david v > Sent: Tuesday, August 29, 2006 9:08 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Mismatch and regex newbie problem still problem > > So to sum-up. > If the regex i'm looking for is "testing" and the string to search the > regex > for is "tastung" (obviously this is a short example but i'm dealing with > more complex regular expressions. > > how can i get the number of mismatches. Basically the output of the > program > would tell me: > >2 mismatches found in string "tastung" at position 2 (a) and 5(u). [Nat] Maybe I'm completely misunderstanding you. If so, please forgive me. I think you're saying that you want to start with the regex "testing" and have the library detect that the string "tastung" is somehow similar but nonetheless distinct. My belief is that, given the regex "testing", the library will not recognize the string "tastung" in any way. It will simply report that no match was found. You could construct a more complex regex that would handle this particular example. You could, for instance, say that you want to match a "t", followed by an arbitrary character, followed by "st", followed by another arbitrary character, followed by "ng". The library would report that the string "tastung" matches that regex, and you could ask it to tell you the specific substrings matching the variable parts. But if you want to allow arbitrary variance in any character position -- as long as some other set of character positions matches -- then I'm a little perplexed as to how to express that in a regular expression. Maybe an exhaustive family of acceptable alternatives? But if you're dealing with longer expression strings, that could explode really quickly. I think you need to get really specific about the rules you want to use to detect a "mismatch." Then you need to figure out whether the regex library is the right tool to help you apply those rules. Again, sorry if I'm way off base here.

1 0

Efficiacy of std::vector
by Janos Vegh 29 Aug '06

29 Aug '06

Hi, I was interested in the efficiacy of std::vector. Using the test program below, I receive the following results. The "simple" handling is equivalent with the C array access. The [] and iterator access time of the vector element is an order of magnitude worse, than that of the simple access. This is not because of index limit control, it is done by at() and its use increases that access time by a factor of three. What is going on in the background here, that the implementation is so ineffective? ( I did my tests with WinXP/cygwin/g++/time, using different setting of the #define-s at the beginning) Shall I expect similar ineffectivity with the other STL objects? Regards Janos Empty cycle real 0m2.173s user 0m1.892s sys 0m0.080s STL=1, SIMPLE=1, size=0 real 0m4.917s user 0m4.646s sys 0m0.070s STL=1, size=0 real 0m33.939s user 0m33.658s sys 0m0.090s STL=1, ITERATOR=1, size=1000 real 0m34.059s user 0m33.688s sys 0m0.100s STL=1, AT=1, size=1000 real 1m22.769s user 1m22.368s sys 0m0.090s #define STL 1 #define SIMPLE 0 #define ITERATOR 1 #define AT 0 #define EMPTY 1 #if STL #include <vector> #endif using namespace std; #include <iostream> #define ARR_SIZE 1000 #define CYCLES 1000000 main (int argc, char** argv) { long int i,j,*P; #if EMPTY cout << "Empty cycle"; #else #if STL #if ITERATOR || AT std::vector<long int>::iterator pos; std::vector<long int> arr(ARR_SIZE); #else std::vector <long int> arr; arr.reserve(ARR_SIZE); #endif cout << "STL=1"; #if SIMPLE cout << ", SIMPLE=1"; #endif #if ITERATOR cout << ", ITERATOR=1"; #endif #if AT cout << ", AT=1"; #endif cout << ", size=" << arr.size(); #else long int *arr; arr = new long int[ARR_SIZE]; cout << "STL=0"; #endif #endif cout << endl; #if SIMPLE && STL P = &arr[0]; #endif for(j=0;j<CYCLES; j++) { #if STL && ITERATOR && !EMPTY i = 0; for(pos=arr.begin(); pos < arr.end(); ++pos) { *pos = i; } #else for(i=0; i<ARR_SIZE; i++) { #if !EMPTY #if SIMPLE && STL P[i] = i; #elif STL && AT arr.at(i) = i; #else arr[i] = i; #endif #endif } #endif } exit(0); }

9 10

Re: [Boost-users] Mismatch and regex newbie problem
by david v 29 Aug '06

29 Aug '06

What's boost_check and what's it got to do with regex? john i found the boost_check in here http://www.boost.org/libs/test/doc/components/test_tools/reference/BOOST_CH… and though it would do what i was trying to do. But i think the the regex_token_iterator you submitted would do it. std::string::const_iterator start = in.begin(); std::string::const_iterator end = in.end(); boost::sregex_token_iterator i(start, end, *regex, -1), j; while(i != j) { cout << *i << endl; }

1 0

Re: [Boost-users] Mismatch and regex newbie problem
by david v 29 Aug '06

29 Aug '06

For example, If the regex to search for is "test" and the string is "tast" , then 1 mismatch is found position 2. John, i think the code below you have submitted is doing exactly what i want right ?? std::string::const_iterator start = in.begin(); std::string::const_iterator end = in.end(); boost::sregex_token_iterator i(start, end, *regex, -1), j; while(i != j) { cout << *i << endl; } >Hello, >I'm using the boost regex library to search short expressions in large >strings. The code below works fine but it almost does what ever i >want. The thing i'm missing and that i'm not sure to handle are the >mismatches. Basically when i look for a regex in a string i want to >have the possibility to get the number of mismatches and their >respective positions. I read through the docs and saw that the >boost_check may do the work. Well the think is that i'm not sure how >to use it with my code and since the boost library is quite complex >it would be great if somebody could help to move forward. > >How can i use the code below to get the mismatches and their >positions with boost_check ??? What's boost_check and what's it got to do with regex? >#####Setting the regex >..... >re = "test"; >boost::regex *regex = new boost::regex(re,boost::regbase::icase); >..... > >#######Getting the matched >....... >std::string::const_iterator start = in.begin(); >std::string::const_iterator end = in.end(); >boost::smatch match; >while >(boost::regex_search(start,end,match,*regex,boost::match_extra)) >{ >cout << match.[0] << endl; >start = match[0].second; >} > >#############Getting the mismatches ??? >How ??? > >Any help would be extemely helpful !!! What do you mean by mismatches? The sections of the string that didn't match? That would be: std::string::const_iterator start = in.begin(); std::string::const_iterator end = in.end(); boost::smatch match; while(boost::regex_search(start,end,match,*regex)) { cout << match.prefix() << endl; start = match[0].second; } // avoid a fencepost error: cout << match.suffix() << endl; Note that the match_extra flag is unnecessary unless you really need to record repeated captures. Normal capture information - of the kind you get from Perl and other regex engines don't need this - and it slows down matching as well as requiring building the lib in a non-default mode. You can also do this rather easier with regex_token_iterator: std::string::const_iterator start = in.begin(); std::string::const_iterator end = in.end(); boost::sregex_token_iterator i(start, end, *regex, -1), j; while(i != j) { cout << *i << endl; } HTH, John.

1 0

Mismatch and regex newbie problem
by david v 29 Aug '06

29 Aug '06

Hello, I'm using the boost regex library to search short expressions in large strings. The code below works fine but it almost does what ever i want. The thing i'm missing and that i'm not sure to handle are the mismatches. Basically when i look for a regex in a string i want to have the possibility to get the number of mismatches and their respective positions. I read through the docs and saw that the boost_check may do the work. Well the think is that i'm not sure how to use it with my code and since the boost library is quite complex it would be great if somebody could help to move forward. How can i use the code below to get the mismatches and their positions with boost_check ??? #####Setting the regex ..... re = "test"; boost::regex *regex = new boost::regex(re,boost::regbase::icase); ..... #######Getting the matched ....... std::string::const_iterator start = in.begin(); std::string::const_iterator end = in.end(); boost::smatch match; while (boost::regex_search(start,end,match,*regex,boost::match_extra)) { cout << match.[0] << endl; start = match[0].second; } #############Getting the mismatches ??? How ??? Any help would be extemely helpful !!! david

3 2

[program_options] passing a negative numer as an option --sorry
by imre＠u-tx.com 29 Aug '06

29 Aug '06

Sorry, it was a configuration problem on my side.

1 0

[preprocessor] Enumerating sequence and shifter sequence
by Roman Perepelitsa 29 Aug '06

29 Aug '06

Hi. I have the following sequence #define SEQ (a)(b)(c)(d) I want to transform it to something like this F(a,b) F(b,c) F(c,d) How can I do it efficiently and elegantly? Thank you in advance. Roman Perepelitsa.

2 5

[program_options] passing a negative numer as an option
by imre＠u-tx.com 29 Aug '06

29 Aug '06

Hi, Is subj. possible (with 1.33)? If yes, then how? If I write attn = "-11" into the config file, then cout << vm["attn"].as<int16_t>(); outputs 11. Thx ImRe

1 0

Jamfile for app using date_time
by Steve Hyatt 29 Aug '06

29 Aug '06

Hi all. I am trying to write a Jamfile for a simple test app which uses the boost date_time library. I am unable to figure out how to tell the boost build system to link in that library. I have a Makefile which can do the link: $make g++ -c -pipe -Wall -Wno-unknown-pragmas -DLINUX -I./ -g -o tester.o tester.cpp g++ -o tester tester.o -lboost_date_time-gcc-1_33_1 Can someone show me a Jamfile that 'just works' (TM). Thanks Steve saphlyx(a)shaw.ca

2 1

Interprocess bug and patch
by Adam Lewis 28 Aug '06

28 Aug '06

Not sure if this is the right place for this bug but I believe it is. The function get_max_num_msg() was returning the incorrect member.

2 1

asio and interprocess fifo
by Koen Deforche 28 Aug '06

28 Aug '06

Hello, For a server-client application, I am experimenting with boost::asio and boost::interprocess -- this is my first intensively boostified project. Since boost::interprocess is work-in-progress, I am using the CVS version. I have found some smaller problems (see at the end of my email), but so far, all works well. I have noticed that in interprocess, an ipc/named_fifo is planned. I was wondering if there will be plans for the asio library to create an asynchronous I/O service for such a fifo ? If not, is this feasible ? I did not find any documentation on how to write a new io_service in the asio documentation ? Regards, koen 1) Timeouts always timed out immediately, which was caused by : interprocess/sync/ptime_to_timespec.hpp line 29: ts.tv_sec = duration.seconds(); should be ts.tv_sec = duration.total_seconds(); 2) Compile problem in interprocess/errors.hpp, which was solved by : interprocess/errors.hpp line 86: void fill_system_message( int system_error, std::string &str) should be inline void fill_system_message( int system_error, std::string &str) (probably the same is true for the BOOST_WINDOWS versino on line 65 ?

2 1

[statechart] No state?
by Johan Nilsson 28 Aug '06

28 Aug '06

Hi, I'm implementing an asynchronous state machine and have problems with events not being dispatched. All event thrown at the fsm are dispatched to the unhandled_event method. When debugging the problem, I used typeid on the event to see that the expected events were generated (they were) from the event dispatch threads. After this, I tried to get the current state from within the unhandled_event() method - but to my surprise the statement "this->state_begin() != this->state_end()" is never satisfied. Looks like there's no current state. What's even more confusing is that this behaviour is only exposed in the application itself. This part of the project is divided into three modules; the application, a static library containing most of the code, and a unit test driver. The test driver and the application links to the library. When running the unit tests, the dispatching works and it is possible to see the current state using the above method. Release or debug mode doesn't matter. RTTI is enabled. Using RC_1_34_0 and VC8. What could possibly expose this behaviour? // Johan

2 4

How to wrap a template function(not a member of a template class) into python?
by Qinfeng(Javen) Shi 28 Aug '06

28 Aug '06

Dear All, How can I wrap a c++ template function(not a member of any class) by pyste or manually? /**************************************/ for example : template<class T> void push(v_array<T>& v, const T &new_ele) { while(v.index >= v.length) { v.length = 2*v.length + 3; v.elements = (T *)realloc(v.elements,sizeof(T) * v.length); } v[v.index++] = new_ele; } /***************************************/ Here v_array is a class. I know how to wrap a c++ template class into python by pyste. But what should I do if the template function is not a member of a class. (I don't want to put the function"push()" into a class). Any suggestion will be appreciated. Thanks! Javen Research School of Information Sciences and Engineering Australian National University Locked Bag 8001 Canberra ACT 2601

2 1

Re: [Boost-users] boost program_options
by Vladimir Prus 28 Aug '06

28 Aug '06

On Monday 28 August 2006 15:49, you wrote: > Hello, Hi, please send all Boost questions to some mailing list, not in private. > > in your tutorial for program_options at the boost site you talk about > the method allow_unregistered() lite this: > > parsed_options parsed = > command_line_parser(argv, > argc).options(desc).allow_unregistered().run(); > > > However, I'm using boost 1.33 and the command_line_parser class uses > private inheritence from the detail::cmdline class, which makes the > allow_unregistered() method unavailable for public use. What is the > deal? That's a bug in 1.33. The operation of allow_unregistered was unit-tested, but since unit test used detail::cmdline directly, the fact that the method is not accessible in command_line_parser went undetected. I believe it's fixed in CVS. - Volodya

2 1

[interval]
by Andy Little 28 Aug '06

28 Aug '06

Shouldnt this work?: #include <boost/numeric/interval.hpp> int main() { boost::numeric::interval<double> v(.5); cos(v); } ------------------ I get this error in VC7.1: c:\boost\include\boost-1_33_1\boost\numeric\interval\transc.hpp(73) : error C2039: 'cos_down' : is not a member of 'boost::numeric::interval_lib::rounded_math<double>' c:\boost\include\boost-1_33_1\boost\numeric\interval\hw_rounding.hpp(53) : see declaration of 'boost::numeric::interval_lib::rounded_math<double>' e:\Projects\Test\test.cpp(6) : see reference to function template instantiation 'boost::numeric::interval<T> boost::numeric::cos<double,boost::numeric::interval_lib::default_policies<T>::type>(const boost::numeric::interval<T> &)' being compiled with [ T=double ] c:\boost\include\boost-1_33_1\boost\numeric\interval\transc.hpp(73) : error C2039: 'cos_up' : is not a member of 'boost::numeric::interval_lib::rounded_math<double>' c:\boost\include\boost-1_33_1\boost\numeric\interval\hw_rounding.hpp(53) : see declaration of 'boost::numeric::interval_lib::rounded_math<double>' c:\boost\include\boost-1_33_1\boost\numeric\interval\transc.hpp(75) : error C2039: 'cos_up' : is not a member of 'boost::numeric::interval_lib::rounded_math<double>' c:\boost\include\boost-1_33_1\boost\numeric\interval\hw_rounding.hpp(53) : see declaration of 'boost::numeric::interval_lib::rounded_math<double>' regards Andy Little

2 3

boost::condition
by Andrew Wingorodov 28 Aug '06

28 Aug '06

I wish to lock some threads up to the end of one of them, and after to start all of them without restrictions. show to me an example, plz the timedwait is necessary. -- andr.ru

1 0

[serialization] class versioning with template classes
by Oliver Mutz 28 Aug '06

28 Aug '06

Hi all, has anyone ever used the versioning mechanism of the serialization library together with template classes? What I want to do is something like: class TemplateA { public: TemplateA(); public: ... //Serialization stuff private: friend class boost::serialization::access; template<class Archive> void save(Archive & ar, const unsigned int /*version*/) const { ar & boost::serialization::make_nvp("HighValue",m_high) & boost::serialization::make_nvp("NewData",m_newData); } template<class Archive> void load(Archive & ar, const unsigned int version) { ar & boost::serialization::make_nvp("HighValue",m_high); if (version > 0) { ar & boost::serialization::make_nvp("NewData",m_newData); } } BOOST_SERIALIZATION_SPLIT_MEMBER(); private: T m_high; T m_newData; }; // class TemplateA BOOST_CLASS_VERSION(TemplateA, 1); The above won't compile for sure, but I'm looking for a way to use the versioning without having to specialize it for each type T which I'm going to use this class with. Best regards Oliver Mutz

1 0

Debian Sarge less-then-g++-4.0.x link-time issues
by Matt England 28 Aug '06

28 Aug '06

Our project is experiencing a lot of Debian link-time issues with Boost libraries, namely with g++ versions less then 4.0.x. Some bug listings: http://www.cleversafe.org/bugs/show_bug.cgi?id=260 http://www.cleversafe.org/bugs/show_bug.cgi?id=239 Does the boost-users community have any pointers/ideas/suggestions/references? Some of our devs think that these problems may be due to bugs in g++ 3.3.5 or less; we have unconfirmed reports that g++ 3.3.5 or less builds may have failed on other Linux platforms. -Matt Dispersed Storage: http://cleversafe.org

1 1

shared_ptr segfaults on 64bit AMD
by Paul Davis 27 Aug '06

27 Aug '06

Howdy, I've come across an odd segfault that originates in some of the boost code. (By originate, meaning thats where the stack trace points, I'm not sure if its me or boost thats wrong) Anyway, the weird part is that its only on my 64 bit machine. I took a look at where its segfaulting in boost::detail::atomic_exchange_and_add(). Its scary inline assembly stuff. Well, mostly I just don't know assembly so I haven't the slightest idea if its right or wrong. And obviously, its a platform specific header and what not so I imagine its limited to this area. I have had other weird segfaults that come and go from the atomic_* set of methods. I can't pin down exactly whats causing it. They mostly seem to be coming from storing shared_ptr's in STL containers. I've never had any problems with it before so I'm assuming its just a relatively untested section of code. And if its relevant, I also tried downloading CVS and running the shared_ptr_test. It ran without segfaulting just fine. Some relevant info: Segfaults on: 2.6.15-25-amd64-generic #1 SMP PREEMPT Wed Jun 14 11:28:03 UTC 2006 x86_64 GNU/Linux g++ (GCC) 4.0.3 (Ubuntu 4.0.3-1ubuntu5) boost/version.hpp #define BOOST_VERSION 103301 Does NOT segfault on: 2.6.15-1.1831_FC4smp #1 SMP Tue Feb 7 13:48:31 EST 2006 i686 i686 i386 GNU/Linux g++ (GCC) 4.0.2 20051125 (Red Hat 4.0.2-8) boost/version.hpp : #define BOOST_VERSION 103200 Stack trace: Program received signal SIGSEGV, Segmentation fault. [Switching to Thread 46912529528592 (LWP 27560)] 0x000000000040a2f8 in boost::detail::atomic_exchange_and_add (pw=0x98, dv=-1) at sp_counted_base_gcc_x86.hpp:50 50 ); (gdb) bt #0 0x000000000040a2f8 in boost::detail::atomic_exchange_and_add (pw=0x98, dv=-1) at sp_counted_base_gcc_x86.hpp:50 #1 0x000000000040a46c in boost::detail::sp_counted_base::release (this=0x90) at sp_counted_base_gcc_x86.hpp:143 #2 0x000000000040a4d0 in ~shared_count (this=0x2514218) at shared_count.hpp:159 #3 0x00002aaaaccb849b in ~shared_ptr (this=0x2514210) at shared_ptr.hpp:106 #4 0x00002aaaaccb88e1 in __gnu_cxx::new_allocator<boost::shared_ptr<min_heap> >::destroy (this=0x7fffffc2b410, __p=0x2514210) at new_allocator.h:107 #5 0x00002aaaaccb9f66 in std::vector<boost::shared_ptr<min_heap>, std::allocator<boost::shared_ptr<min_heap> > >::erase ( this=0x7fffffc2b410, __position={_M_current = 0x2514220}) at vector.tcc:115 #6 0x00002aaaaccb7add in label_map::CloseToAlive (this=0x7fffffc2b3e0, p=@0x7fffffc2b1a0) at build/Modules/Marching/label_map.cc:273 #7 0x00002aaaaccb326f in fast_march::march (this=0x7fffffc2b3c0, mask=@0x527d30, gradient=@0x527d10, labeled=@0x527d40) at build/Modules/Marching/fast_march.cc:76 #8 0x00002aaaaccbec64 in marching::run (this=0x527c50, cli=@0x7fffffc2b5e0, options=@0x7fffffc2b5d0, args=@0x7fffffc2b5c0) at build/Modules/Marching/marching.cc:110 #9 0x00000000004074bd in process (args=@0x7fffffc2c460) at build/DDS/dds.cc:259 #10 0x0000000000408ffd in main (argc=2, argv=0x7fffffc2c5a8) at build/DDS/dds.cc:531 Paul Davis

4 7

Re: [Boost-users] on-line documentation, boost 1.34, etc.
by JOAQUIN LOPEZ MU?Z 27 Aug '06

27 Aug '06

Andriy Tylychko ha escrito: > Hi. > > Several question, slightly unrelated: > > 1) To read the last version of documentation I go to > http://www.boost.org/doc/html/index.html. But this list > counts only 15 libraries. Next, going to > http://www.boost.org/doc/html/libraries.html, we see the > same list of 15 libraries with sub-links, but just after > that "Libraries Listed Alphabetically" contains already > much more libraries. Just a bug? The page http://www.boost.org/doc/html/index.html contains those Boost libs which are documented using a tool called BoostBook. Not all Boost libs are documented with BoostBook; the complete list can be obtained at: http://boost.org/libs/libraries.htm which is where you get to from the main Boost page link "Documentation". As to http://www.boost.org/doc/html/libraries.html, this BoostBook-produced page attempts to list every library in Boost, be it documented with BoostBook or not, but in fact it's missing some entries, so you better rely on the link I give above. I don't know if this lack of some entries must e categorized as a bug or as an unmaintained spot to be removed. > > 2) Where can I see documentation of "coming soon" boost > 1.34? Especially documentation for new libraries... I > tried to find it in CVS, but in > http://boost.cvs.sourceforge.net/boost/boost/doc/html/ I > didn't find even "index.html". Using the CVS web browser, go to libs/libraries.htm under the branch RC_1_34_0: http://boost.cvs.sourceforge.net/boost/boost/libs/libraries.htm? view=log&pathrev=RC_1_34_0 There you can find the complete list of all libraries coming into Boost 1.34. If you're interested in new libraries, go to the main index.htm under RC_1_34_0: http://boost.cvs.sourceforge.net/boost/boost/index.htm? view=log&pathrev=RC_1_34_0 Also, Boost Consulting kindly hosts the entire Boost site in its current CVS form at http://boost-consulting.com/boost/ It is the main trunk of the CVS that is published here, which strictly speaking does not have to be the same as RC_1_34_0 (for instance, it may contain material scheduled for 1.35) for in general differences are few. > Why some new libraries > already have nice documentation, but this documentation > cannot be found in logical (?) locations (ASIO e.g., > http://boost.cvs.sourceforge.net/boost/boost/libs/asio/doc/ > is empty)? ASIO has not yet been integrated into Boost. I guess it'll be by Boost 1.35. > > 3) What is the easiest way (better "what is the right > place") to investigate with libraries (and their docs) that > are planned for inclusion to boost 1.34? Hopefully answered above. > > Thank you in advance! > > Best regards, > Andriy Tylychko, > telia(a)vichnavich.com > www.vichnavich.com Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

on-line documentation, boost 1.34, etc.
by Andriy Tylychko (mail.ru) 27 Aug '06

27 Aug '06

Hi. Several question, slightly unrelated: 1) To read the last version of documentation I go to <http://www.boost.org/doc/html/index.html> http://www.boost.org/doc/html/index.html. But this list counts only 15 libraries. Next, going to <http://www.boost.org/doc/html/libraries.html> http://www.boost.org/doc/html/libraries.html, we see the same list of 15 libraries with sub-links, but just after that "Libraries Listed Alphabetically" contains already much more libraries. Just a bug? 2) Where can I see documentation of "coming soon" boost 1.34? Especially documentation for new libraries... I tried to find it in CVS, but in http://boost.cvs.sourceforge.net/boost/boost/doc/html/ I didn't find even "index.html". Why some new libraries already have nice documentation, but this documentation cannot be found in logical (?) locations (ASIO e.g., http://boost.cvs.sourceforge.net/boost/boost/libs/asio/doc/ is empty)? 3) What is the easiest way (better "what is the right place") to investigate with libraries (and their docs) that are planned for inclusion to boost 1.34? Thank you in advance! Best regards, Andriy Tylychko, telia(a)vichnavich.com www.vichnavich.com <http://www.vichnavich.com/>

1 0

Re: [Boost-users] [Boost.Test] How to handle std::valarray<>w/BOOST_CHECK or BOOST_CHECK_EQUAL
by Marc Viala 26 Aug '06

26 Aug '06

After few days of vacation, I've got your reply... Thanks for your response... Marc Viala ________________________________ De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Gennadiy Rozental Envoyé : vendredi 18 août 2006 06:17 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] [Boost.Test] How to handle std::valarray<>w/BOOST_CHECK or BOOST_CHECK_EQUAL operator==( std::valarray<double> const&, std::valarray<double> const& ) returns std::valarray<bool> which is not bool convertible value You will either have to use by element comparison or write your own predicate that compare the valarrays BOOS_CHECK_PREDICATE( my_valarray_comp, (v1)(v2) ); Gennadiy "Marc Viala" <mviala(a)acticm.com> wrote in message news:D0D608FD34E14C4BA93A30AC162651E11F3B97@SERVEUR2003.acticm.com... Hello, I am using the Boost.Test framework, but I not able to use std::valarray<> with BOOST_CHECK or BOOST_CHECK_EQUAL macro. For example: <\code> static void print_valarray(std::ostream& os, std::valarray<double> const& v) { // TODO } namespace std { std::ostream& operator<< (std::ostream& os, std::valarray<double> const& v) { print_valarray(os, v) ; return os ; } } ; std::valarray<double> v(10) ; BOOST_CHECK_EQUAL(v, v); <\code> Failed with the following compilation error: c:\Dev\MViala\ADV\Library\boost-1_33_1\boost\test\predicate_result.hpp(51): error C2664: 'boost::test_tools::predicate_result::readonly_property57::readonly_property57(const boost::test_tools::predicate_result::readonly_property57::write_param_t)' : impossible de convertir le paramètre 1 de 'std::_Boolarray' en 'const boost::test_tools::predicate_result::readonly_property57::write_param_t' Configuration: Platform: Win32 Compiler: Microsoft Visual C++ version 7.1 STL : Dinkumware standard library version 313 Boost : 1.33.1 Any help will be appreciated... Marc Viala ________________________________ _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[mpl] how to create a map using an algorithm
by Yuval Ronen 26 Aug '06

26 Aug '06

Lets say I have several types t1, t2, t3, and so on. Each of them has a typedef x within it. I want to be able to get a type y, and find the type t which holds is_same<y, t::x>. I thought of doing it using mpl::map< pair<t1::x, t1>, pair<t2::x, t2>, ...>. The problem is how to create the map. I can create it manually, just like in the previous sentence, but I hope there's a better way. Is there some transform algorithm that I can pass it an mpl::set<t1, t2, ...> and a meta-function that yields t::x for any given t, and this algorithm would produce the desired map? Thanks, Yuval

2 3

[boost::function_types] Create function type from member function type
by Peter Soetens 25 Aug '06

25 Aug '06

Hi, I was looking for a way to convert a member function type: bool (X::*)(int) or bool (X::)(int) to the 'C' equivalent, without the class pointer: bool (*)(int) or bool(int) Now, I used this helper class: // Converts R (X::)(Args) to R (Args) template<class F> class UnMember { typedef boost::function_type_signature<F> member_signature; typedef typename boost::mpl::erase<typename member_signature::types, typename boost::mpl::next<typename boost::mpl::begin<member_signature>::type>::type>::type non_member_signature; public: typedef typename boost::function_type<boost::plain_function,non_member_signature>::type type; }; And use it like: typedef UnMember<bool(X::)(int)>::type PlainFunctionType; It gets even complexer when one wants to convert a member function type to a function type which takes the member as first argument: // Converts R (X::)(Args) to R (X::*, Args) template<class F> class MemberToFirstArg { typedef boost::function_type_signature<F> member_signature; // remove the class from the arg list: typedef typename boost::mpl::erase<typename member_signature::types, typename boost::mpl::next<typename boost::mpl::begin<member_signature>::type>::type>::type non_member_signature; // insert it as first argument. typedef typename boost::mpl::insert<non_member_signature, typename boost::mpl::next<typename boost::mpl::begin<non_member_signature>::type>::type, typename boost::add_pointer<typename boost::mpl::at<typename member_signature::types,boost::mpl::int_<1> >::type>::type >::type arg_signature; public: typedef typename boost::function_type<boost::plain_function,arg_signature>::type type; }; Is there an easier way to do this ? Does a boost library have a mechanism to convert member function types to non-member function types and vice versa ? Peter -- Peter Soetens -- FMTC -- <http://www.fmtc.be>

3 8

Re: [Boost-users] boost.test and Cruise Control
by Ferentinos, Jerry 25 Aug '06

25 Aug '06

Matt Schuckmann wrote: > Up to using NAnt that sounds pretty much like what I want to do. Right > now I'm pretty much just having CC.NET do the build via the Dev Studio > command line interface. We are still on .NET 2003 right now but the 2005 > disks should be here next week. > What does using NAnt buy you that CC.NET doesn't have? > Do you have CC.NET do anything with the results of the unit tests, I.E > have it display the tests/test_suites run, have it display errors and > maybe even notify when people when test fail? I know that Boost.Test can > produce xml output but I don't know how to begin to have CC.NET consume it. The benefit of NAnt is that it is able to launch build of Visual Studio solutions, there's no having to mess with command lines and the like. Another benefit is NAnt integration with our version control system (ClearCase). Basically we have CruiseControl observe the ClearCase integration stream, issuing NAnt builds when new deliveries appear in the stream. NAnt is used to control the whole build process as well as running the tests and reacting to their results. Using NAnt we're able to perform many of the administrative tasks involved in version control and configuration management as well as promote the baselines as they pass through our build/smoke/integration tests. For CC.NET to consume Boost.Test output you will have to write an XSL transform to convert Boost.Test XML output to a format recognized by CC.NET. Jerry Ferentinos Basic Research Informatics Merck Frosst Center for Therapeutic Research www.merckfrosstlab.ca ------------------------------------------------------------------------------ Notice: This e-mail message, together with any attachments, contains information of Merck & Co., Inc. (One Merck Drive, Whitehouse Station, New Jersey, USA 08889), and/or its affiliates (which may be known outside the United States as Merck Frosst, Merck Sharp & Dohme or MSD and in Japan, as Banyu - direct contact information for affiliates is available at http://www.merck.com/contact/contacts.html) that may be confidential, proprietary copyrighted and/or legally privileged. It is intended solely for the use of the individual or entity named on this message. If you are not the intended recipient, and have received this message in error, please notify us immediately by reply e-mail and then delete it from your system. ------------------------------------------------------------------------------

1 0

scoped_ptr and swap question?
by Michael Nicolella 25 Aug '06

25 Aug '06

Looking at boost::scoped_ptr, as I understand it it's meant to model sole-ownership without transfer-of-ownership semantics. If that's the case, what is the utility for having it support swap() operations ? What functionality is lost if the swap() capability is removed? Thanks, Mike

2 1

Re: [Boost-users] Boost serialization : Stream error exception
by Nat Goodspeed 25 Aug '06

25 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of smith smithson > Sent: Friday, August 25, 2006 10:43 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Boost serialization : Stream error exception > > I figured out what the problem is; I use a buffered > version of iostream/stream_buf to buffer data from my > mmap'd file and pass it out when requested. For some > reason if the very first character in the buffer is > character 255 (an extended ascii character) in any of > the buffers, I get the stream error exception. Any > suggestions why this might happen? Is this reserved in > some way? I see the issue in both text mode and binary > mode. [Nat] Do you have access to the source code to your buffered version of stream_buf? Is the buffer declared as an array of char? Does char default to signed with your compiler? If so, char 255 == 0xFF can get returned as the int value -1 -- which is still used as EOF in the stream code I've poked through. Sorry if this is way off base, but I've been bitten before by not using unsigned char for buffers containing bytes with high-order bits set.

1 0

Boost serialization : Stream error exception
by smith smithson 25 Aug '06

25 Aug '06

I'm trying to use boost serialization to serialize/deserialize data to and from a mmap'd file. I have my own ostream/istream classes that essentially read/write bytes from a mmap'd file. The process works fine except on some rare occasions (With different objects/number of objects), in which case boost throws a "stream error" exception. Any ideas what could trigger this? A search of the Boost archives indicated other people had the same problem, where the solution was "use binary mode when you open the file"... but I'm not using a file on disk, I'm using a mmap'd file. (As a side note, the mmap file is large enough to hold all my data and does not need to be expanded or remmap'd etc) The OS i'm using is Linux. Thanks for any suggestions... __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

4 4

[boost-users] How to put together a tuple type?
by Christian Henning 25 Aug '06

25 Aug '06

Hi there, just trying to figure out how to put together a tuple type at compile type? Please consider the following code: struct s1 { static const int num_values = 1; int i; }; struct s2 { static const int num_values = 2; int i; int j; }; struct s3 { static const int num_values = 3; int i; int j; int k; }; template< class S > void create_tuple( S s ) { /// create tuple_type map< tuple_type, unsigned int > map; map[ make_tuple( s ) ] = 99; } The template parameter S will only be one of above defined structs. Clearly, I need to loop over S::num_values to create the tuple type. But how do I do that? Thanks ahead, Christian

3 13

how to reverse a regex ?
by david v 25 Aug '06

25 Aug '06

Hello, Is it possible to reverse a regex. In my example below i'm trying to match the word "hope " and its reverse "epoh". Obviously i could build up a regex such as (hope|epoh) but i was wondering if there is a member in libboost that implements that function directly ? string re = "hope"; boost::regex *regex = new boost::regex(re,boost::regbase::icase); std::string in = "hope is forward and epoh is reversed"; boost::smatch match; std::string::const_iterator start = in.begin(); std::string::const_iterator end = in.end(); while (boost::regex_search(start,end,match,re,boost::match_extra)) { cout << "Match:" << match[0] ; } Thanks, david

2 1

Re: [Boost-users] boost.test and Cruise Control
by Ferentinos, Jerry 25 Aug '06

25 Aug '06

-----Original Message----- From: Matt Schuckmann Sent: Thursday, August 24, 2006 11:43 AM Has anybody out there integrated tests built on boost.test with Cruise Control or Cruise Control .NET. ...snip... Hi Matt, We currently use CruiseControl.NET and boost::test for continuous integration and testing of our deliveries. What we'll typically do is create a testing project (.exe) for each module (.dll) in our system and invoke it from an NAnt script that we call from a CruiseControl task. As new testing projects are created we add them to the NAnt unit-testing target. NAnt can report non-zero return values from executables as being failures and CruiseControl can be configured to regard these as either build or test failures depending on how it's configured. Jerry Ferentinos Basic Research Informatics Merck Frosst Center for Therapeutic Research www.merckfrosstlab.ca We've started creating Unit Tests and we are just starting to use Cruise Control for continuous build integration and I'd like to have Cruise Control run and report on the unit tests. A quick look around Cruise Control only shows integration with NUnit. I don't know how tough or easy it is to make something workable with Boost.Test Sorry if this has already been addressed I did try to search for it but came with nothing in my new reader and the web interface is down. Thanks Matt S. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users ------------------------------------------------------------------------------ Notice: This e-mail message, together with any attachments, contains information of Merck & Co., Inc. (One Merck Drive, Whitehouse Station, New Jersey, USA 08889), and/or its affiliates (which may be known outside the United States as Merck Frosst, Merck Sharp & Dohme or MSD and in Japan, as Banyu - direct contact information for affiliates is available at http://www.merck.com/contact/contacts.html) that may be confidential, proprietary copyrighted and/or legally privileged. It is intended solely for the use of the individual or entity named on this message. If you are not the intended recipient, and have received this message in error, please notify us immediately by reply e-mail and then delete it from your system. ------------------------------------------------------------------------------

3 2

serialization library has misspelled constant
by Dan Bikel 25 Aug '06

25 Aug '06

The struct boost::serialization::tracking_level has a misspelled constant. Instead of it having a constant named "track_selectively", the constant is misspelled "track_selectivly". For backward compatibility, I would add a new constant with the correct spelling that has the value of the old, misspelled constant. (This bug exists in v. 1.33.1 of boost.) --Dan.

2 2

errors serializing pointers on Fedora Core 5
by Dan Bikel 25 Aug '06

25 Aug '06

The following tiny program generates two compiler errors on FC 5 (which comes with g++ 4.1.1 and boost 1.33.1): #include <iostream> #include <fstream> #include <string> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/string.hpp> using namespace std; using namespace boost; int main(int argc, char **argv) { string * pFoo = new string("foo"); ofstream ofs("strfile"); { archive::text_oarchive oa(ofs); oa << pFoo; } } Error No. 1: /usr/include/boost/archive/detail/oserializer.hpp:567: error: invalid application of -1òøsizeofòù to incomplete type òøboost::STATIC_ASSERTION_FAILURE<false> Error No. 2: /usr/include/boost/serialization/access.hpp:109: error: -1òøstruct std::basic_string<char, std::char_traits<char>, std::allocator<char> >òù has no member named òøserializeòù Error No. 1 can be fixed by making pFoo a const pointer type, i.e., by changing the declaration/assignment statement to be string *const pFoo = new string("foo"); I cannot figure out why such a change is necessary, as the serialization library documentation does not indicate that it is necessary to make pointers const in order to serialize them (as is borne out by the demo.cpp code). Also, I cannot figure out how to fix Error No. 2. Any help would be much appreciated! Thanks, Dan.

2 4

[MPL/Fusion?]Call a 0-args template function on members of a sequence
by Edd Dawson 24 Aug '06

24 Aug '06

Hello all, I have the following: template<typename T> void f() { /* ... */ } typedef boost::mpl::vector<int, long, double> my_vec; I'm looking for a way to call f<T>() for all types T in my_vec. I initially hoped that either an mpl algorithm or fusion::for_each might be able to accomplish this for me, but after reading through their docs this doesn't appear to be the case. Am I correct in this conclusion? If not, I'd really appreciate someone giving me a quick pointer as to what I need to do. Currently I'm using the specialization/static-recursion trick. Something like: template<typename types, int idx, int size> struct helper { static void call_f() { using namespace boost::mpl; f< at<types, int_<idx>::type >::type >(); helper<types, idx + 1, size>::call_f(); // recurse } }; template<typename types, int size> struct helper<types, size, size> { static void call_f() { } // end recursion }; void call_f_with_each_type() { enum { num_types = size<my_vec>::type::value }; helper<my_vec, 0, num_types>::call_f(); } It works fine, but I'm wondering if there's a more succinct and readable way. Kind regards, Edd

2 5

No thread safe libraries built for Darwin when using release 1.33.1?
by Rush Manbert 24 Aug '06

24 Aug '06

Hi All, This has been discussed before, but I can't find an answer, so here is another bjam build question. When I build the Boost libraries using the VC8 toolset on the PC, I create thread safe (-mt) versions of the libraries. When I build the Boost libraries on Darwin, there are never any thread safe library versions built, even if I specify "-sBUILD=<threading>multi" on the bjam command line. I have found threads that discuss use of the thread safe version of the regex lib, so I know that it exists and gets built on some platform(s). Why are there no thread safe libraries built for the Darwin toolset? On the surface, this seems like a bug, but I figure there must be some reasonable explanation. (Oh, please, let there be a reasonable explanation! :-) Regards, Rush

3 4

boost.test and Cruise Control
by Matt Schuckmann 24 Aug '06

24 Aug '06

Has anybody out there integrated tests built on boost.test with Cruise Control or Cruise Control .NET. We've started creating Unit Tests and we are just starting to use Cruise Control for continuous build integration and I'd like to have Cruise Control run and report on the unit tests. A quick look around Cruise Control only shows integration with NUnit. I don't know how tough or easy it is to make something workable with Boost.Test Sorry if this has already been addressed I did try to search for it but came with nothing in my new reader and the web interface is down. Thanks Matt S.

1 0

shared_ptr implementation question
by Ovanes Markarian 24 Aug '06

24 Aug '06

I have a question regarding shared_ptr implementation: currently shared_ptr is implementated so, that it contains: T * px; // contained pointer detail::shared_count pn; // reference counter I am interested to know philosophical thoughts why this kind of decision was made to implement the shared_ptr class this way? I assumed to save space which is consumed by such a pointer one could move T pointer (T*) to shared_count class. All shared_ptr classes would contain only one instance or (may be better pointer to counter): detail::shared_count* pn; // reference counter and the approach to retrieve pointer would be: pn->px //since px would be moved to pn This would reduce the size of shared_ptr<T> to sizeof(detail::shared_count*) which is at least by sizeof(detail::shared_count) smaller of may be more if alignment has to used. Are there any arguments which prevent shared_ptr from such implementation scenario? With Kind Regards, Ovanes Markarian

3 2

[Boost-Threads] Assertion during a second call to thread::join()
by Aubrey, Jason 24 Aug '06

24 Aug '06

Hi, Does anyone know the reason for the behavior in the following example program? This example attempts to simulate the scenario where two threads wait on a third thread. However, I realize that the following is actually one thread waiting on a second thread twice. Regards, Jason My Environment: MSVC 8.0, boost v1.33.1 #include <boost/thread/thread.hpp> #include <boost/thread/xtime.hpp> void f() { } void main() { boost::thread t(f); t.join(); t.join(); // Causes an assertion }

3 4

Debian-Boost linking errors in Cleversafe project
by Matt England 24 Aug '06

24 Aug '06

(This msg is getting cross-posted to the Boost and Debian users' lists. I hope that's ok.) Summary: Our builds are experiencing link-time problems with Boost libraries only on Debian systems. Details below. Does anyone have any suggestions on the root causes and fixes for this? If not, possibly other things we can do to better determine what's causing these symptoms? Details: We experience link-time errors on some Debian systems when linking against boost libraries that are built from the same automated source procedure (as per <http://svn.cleversafe.org/dscore/trunk/>) as the binary that links against them. Since our software and the Boost software/libs are all "built from source" using the same compiler/tools, we hope that we are removing any compatibility problems like C++ ABI incompatibilities between g++ revs (<http://autopackage.org/apbuild-apgcc.php#cxx>), etc. Details here: http://www.cleversafe.org/bugs/show_bug.cgi?id=239 Would anyone have any suggestions/pointers for help? For details on how to build our stuff from source, see: http://www.cleversafe.org/wiki/Project_Build_System#Building_from_source Note that we don't experience these errors when building on other systems, including the CentOS system detailed here: http://www.cleversafe.org/bugs/show_bug.cgi?id=239#c1 -Matt Dispersed Storage: http://www.cleversafe.org

2 1

Preprocessor library: inrement a macro
by Arno Schödl 24 Aug '06

24 Aug '06

Hello, I simply want to increment a macro, like that: #define VARIABLE 7 FunctionA( VARIABLE ); // VARIABLE expands to 7 #define VARIABLE BOOST_PP_INC(VARIABLE) FunctionB( VARIABLE ); // VARIABLE expands to 8 #define VARIABLE BOOST_PP_INC(VARIABLE) FunctionC( VARIABLE ); // VARIABLE expands to 9 #define VARIABLE BOOST_PP_INC(VARIABLE) ... Of course, as I have written it, it does not work. What's the right way? Thanks a lot! Arno P.S. I don't want to iterate. FunctionA/B/C are all different constructs. I simply want to avoid forgetting to adjust all numbers when making a change to the chain of calls.

2 1

[program_options] MS command line option
by Simon Reye 23 Aug '06

23 Aug '06

Is there any way to support the Microsoft 'standard' for command line options i.e '/' instead of '-'. We've got legacy code that requires command line options to be in this format while at the same time attempting to implement boost in a lot of our new code. Simon

2 3

calling map::insert through bind.
by Minkoo Seo 23 Aug '06

23 Aug '06

Hi list. I've got a question on calling map::insert using bind. What I'd like to do is to copy all members in m into m2: #include <iostream> #include <algorithm> #include <map> #include <utility> #include <boost/lambda/algorithm.hpp> #include <boost/lambda/lambda.hpp> #include <boost/lambda/bind.hpp> using namespace std; using namespace boost::lambda; int main() { map<string, int> m; map<string, int> m2; m["a"] = 1; m["b"] = 2; m2["c"] = 3; for_each(m.begin(), m.end(), bind(&map<string, int>::insert, &m2, bind(&make_pair, bind(&map<string, int>::value_type::first, _1), bind(&map<string, int>::value_type::second, _1)))); return EXIT_SUCCESS; } Unfortunately, the above code fails to compile and I have no idea why it fails. I'm using g++ and the errors are as follows: g++ map_test.cpp map_test.cpp: In function 'int main()': map_test.cpp:26: error: no matching function for call to 'bind(<unknown type>, const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<2, boost::lambda::function_action<2, boost::lambda::detail::unspecified> >, boost::tuples::tuple<const std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, int>::* const, const boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >, const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<2, boost::lambda::function_action<2, boost::lambda::detail::unspecified> >, boost::tuples::tuple<int std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, int>::* const, const boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >)' Any idea on this? Sincerely, Minkoo Seo -- View this message in context: http://www.nabble.com/calling-map%3A%3Ainsert-through-bind.-tf2150829.html#… Sent from the Boost - Users forum at Nabble.com.

3 2

serialization pointer to primitive type
by Cheok Yan Cheng 23 Aug '06

23 Aug '06

hello, i have an int pointer, which pointer to the starting address of an array. currently, i need to serialize the array elements one by one, at the same time serialize the size of the array too. i try to serialize the dynamic allocated array, just like what i did on vector, but fail. vector<int> v; ar & vector; /* no problem. */ int *i = new int[10]; ar & i; /* compile error. */ i was understand that the serialization library had no idea on the size of dynamic allocated array either during run-time or compiled time. i just want to know whether there is any better way to serialize on the above mentioned data? here is the error i get from vc++ 2003. C:\Boost\include\boost-1_33_1\boost\serialization\access.hpp(109): error C2228: left of '.serialize' must have class/struct/union type the below are my full source code. thanks! #include <fstream> // include headers that implement a archive in simple text format #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> ///////////////////////////////////////////////////////////// // gps coordinate // // illustrates serialization for a simple type // class gps_position { private: friend class boost::serialization::access; // When the class Archive corresponds to an output archive, the // & operator is defined similar to <<. Likewise, when the class Archive // is a type of input archive the & operator is defined similar to >>. template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & degrees; ar & minutes; ar & seconds; ar & data; } int degrees; int minutes; float seconds; int* data; public: gps_position(){}; gps_position(int d, int m, float s) : degrees(d), minutes(m), seconds(s) {data = new int[5];} }; int main() { // create and open a character archive for output std::ofstream ofs("filename"); // create class instance const gps_position g(35, 59, 24.567f); // save data to archive { boost::archive::text_oarchive oa(ofs); // write class instance to archive oa << g; // archive and stream closed when destructors are called } // ... some time later restore the class instance to its orginal state gps_position newg; { // create and open an archive for input std::ifstream ifs("filename", std::ios::binary); boost::archive::text_iarchive ia(ifs); // read class state from archive ia >> newg; // archive and stream closed when destructors are called } return 0; } __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

Problem wih regex_search_example.cpp
by david v 23 Aug '06

23 Aug '06

Hello, I'm trying to adapt the example script regex_search_example.cpp to do what i want, that is basically search for all the patterns in a file and get their position. I'm trying to match the pattern "test" in a file that called "testfile" that looks like that: ############ file "testfile" this_is _the_file_that_contains_twice_the_word_test_test. ########### ####### In file regex_search_example.cpp i have only changed the line const char* re = "test"; ####### The output looks like that: >Processing file testfile 1 matches found class "" found at position: 56 Class is empty ?? How can i retrive all the patterns and all the positions. I thought the example was supposed to do so ?? Any help would be great. david

2 1

Re: [Boost-users] opengl and boost::function casting problems. .
by Nat Goodspeed 23 Aug '06

23 Aug '06

________________________________________ From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of chun ping wang Sent: Tuesday, August 22, 2006 10:36 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] opengl and boost::function casting problems. . Hi, sorry for another problem... i have a simple question to ask... lets say say i have base class struct GeomObject { // draws an wire shape virtual void drawAbstract(const GLfloat& x, const GLfloat& y, const GLfloat& z) = 0; // draws a solid shape. virtual void drawSolid(const GLfloat& x, const GLfloat& y, const GLfloat& z) = 0; } Now i have bunch of stuff that inherits it.. Like class Circle, class Sphere, class Cylinder, class Cone and all of them implement drawSolid and drawAbstract (radius base assumed). I have a function call drawCircle(const std::string& r, (someBoostFunctionParam)) { Circle cir(4.0, r); // construct a circle with radius 4.0 and name r cir.someBoostFunctionParam(x, y, z); } thus if i say drawCircle("solid", &Circle::drawSolid); drawCircle("abstract", &Circle::drawAbstract); How do you do that? Or whats the best way to do it. [Nat] Since drawCircle() is specifically drawing a Circle, it would work to use an ordinary member function pointer: void drawCircle(const std::string& r, void (Circle::*drawFunction)(const GLfloat&, const GLfloat&, const GLfloat&)) { Circle cir(4.0, r); // construct a circle with radius 4.0 and name r GLfloat x = 0, y = 0, z = 0; // set values for x, y, z somehow (cir.*drawFunction)(x, y, z); } Normally I'd use typedef to tame member function pointer syntax, but it appears that you'd want a different subclass-specific member function pointer for each such drawSomething() free function.

1 0

[Boost.Threads] MSVC memory leak detected in boost v1.33.1
by Aubrey, Jason 23 Aug '06

23 Aug '06

Hello, My questions are: 1) Is there any ETA for releasing a fix? 2) Otherwise, is there an recommended fix I can apply myself? Environment: * MSVC 8.0 * boost v1.33.1 It seems that it's a known issue that has been present for quite a while (at least since 1.30): "Perhaps this is the same leak reported by gast128 in the thread "Memory leak reported using threads library". A mutex is created in DLLMain -> on_process_enter -> init_threadmon_mutex. It seems that this mutex is never deleted and there is no comments that this is intentional. On Windows the size of the mutex is 8 bytes and it creates a CRITICAL_SECTION in its constructor - 24 bytes." I'm not concerned much by the size of the leak nor the semantics of whether it is truly a leak. My concern is that I'm receiving an alert from VS indicating "Detected memory leaks!" and regardless of how MS's detecting this, it's obviously not a good situation for me. Regards, Jason

2 2

Converting epoch(long) to ptime in Boost.Date_Time
by gdprosch＠micron.com 23 Aug '06

23 Aug '06

I would like to convert epoch(long) time values to boost ptime and vice versa. On the surface this seems relatively easy but some of the functions needed are missing and there is an issue ensuring that the local time is properly applied. Has someone come up with an easy way to do this? I can convert to ptime like this... long epoch_in = 1140411002; // 2006-Feb-19 21:50:02 std::time_t stdtime ( epoch_in ); ptime = from_time_t( stdtime ); To convert from ptime back to epoch(long) there is no conversion provided the other way. I found some code the author supplied a few years ago here: http://lists.boost.org/MailArchives/boost-users/msg07254.php Unfortunately, the result does not correctly apply local time. The following code... std::time_t to_time_t(ptime t) { ptime start(gregorian::date(1970,1,1),time_duration(0,0,0)); return (t-start).total_seconds(); } ... produces a date with the value: 2006-Feb-20 04:50:02 and not 2006-Feb-19 21:50:02 (I am in US MST). I've played around with applying the local offset but I end up with a lot of lines of code that leave me wondering if there is a better way. It would be nice if it were simple like this (assuming local time adjustment is correctly applied)... long epoch_in = 1140411002; // 2006-Feb-19 21:50:02 ptime pt = from_epoch( epoch_in ); long epoch_out = to_epoch( pt ); Many thanks, > Greg Prosch > Micron Technology, Inc.

2 1

opengl and boost::function casting problems. .
by chun ping wang 23 Aug '06

23 Aug '06

here is the basic header file basicgl.hpp #include <windows.h> #include <GL/gl.h> #include <GL/glu.h> #include <GL/glut.h> #include <boost/function.hpp> #include <boost/static_assert.hpp> #include <boost/type_traits.hpp> #include <boost/cast.hpp> template <class T> boost::function<void*(const T&, const T&)> getVerxFunc2() { BOOST_STATIC_ASSERT(boost::is_integral<T>::value || boost::is_floating_point<T>::value); return (boost::is_floating_point<T>::value) ? &glVertex2d : &glVertex2i; } template <class T> boost::function<void*(const T&, const T&, const T&)> getVerxFunc3() { BOOST_STATIC_ASSERT(boost::is_integral<T>::value || boost::is_floating_point<T>::value); return (boost::is_integral<T>::value) ? &glVertex3i : &glVertex3d; } template <class T> void drawDot(const T& x, const T& y) { boost::function<void(const T&, const T&)> myFunc(getVerxFunc2<T>()); glBegin(GL_POINTS); myFunc(x, y); glEnd(); glFlush(); } template <class T> void drawDot(const T& x, const T& y, const T& z) { boost::function<void(const T&, const T&, const T&)> myFunc(getVerxFunc3<T>()); glBegin(GL_POINTS); myFunc(x, y, z); glEnd(); glFlush(); } template <class T> void drawLine(const T& x1, const T& y1, const T& x2, const T& y2) { boost::function<void(const T&, const T&)> myFunc(getVerxFunc2<T>()); glBegin(GL_LINE); myFunc(x1, y1); myFunc(x2, y2); glEnd(); glFlush(); } template <class T> void drawLine(const T& x1, const T& y1, const T& x2, const T& y2, const T& z1, const T& z2) { boost::function<void(const T&, const T&, const T&)> myFunc(getVerxFunc3<T>()); glBegin(GL_LINE); myFunc(x1, y1, z1); myFunc(x2, y2, z2); glEnd(); glFlush(); } drawLine(4.1, 5.2, 3.9, 4.2); When i compile i get the following errors. 16 D:\Data\cs classes\cs450\c++\BasicGL.hpp conditional expression between distinct pointer types `void (*)(GLdouble, GLdouble)' and `void (*)(GLint, GLint)' lacks a cast 46 D:\Data\cs classes\cs450\c++\BasicGL.hpp instantiated from `void drawLine(const T&, const T&, const T&, const T&) [with T = GLdouble]' 16 D:\Data\cs classes\cs450\c++\BasicGL.hpp invalid conversion from `void (*)(GLdouble, GLdouble)' to `void*' 16 D:\Data\cs classes\cs450\c++\BasicGL.hpp invalid conversion from `void (*)(GLint, GLint)' to `void*' 85 D:\Data\Devcpp\include\boost_1_33_1\boost\function\function_template.hpp ISO C++ forbids casting between pointer-to-function and pointer-to-object Is there a nice work around this? Thanks.

3 3

(no subject)
by Juan Ramos 23 Aug '06

23 Aug '06

Hi everybody, I'm using VC++ .NET 2003 and when compile a file with connected_components.hpp I get the following compile error: Fatal error C1001: INTERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 2844) Please choose the Technical Support command on the Visual C++ What can I do to fix this error? Thanks for your help Juan

1 0

compile error under GCC 3.4.4, but successfully compiled by GCC 3.2.3
by sean yang 22 Aug '06

22 Aug '06

I successfully compiled my program with GCC 3.2.3 on a Linux (Red Hat Linux 3.2.3-56) box. When I tried to compile the same program with GCC 3.4.4 on a Solaris box, it gave me the following errors. Can anyone help me figure out why it is happening? #g++ -O -I./boost_1_25_1 -Wall beaconfsa.cpp ./boost_1_25_1/boost/config/compiler/gcc.hpp:57:7: warning: #warning "Unknown compiler version - please run the configu re tests and report the results" In file included from ./boost_1_25_1/boost/graph/graph_utility.hpp:42, from ./boost_1_25_1/boost/graph/detail/adjacency_list.hpp:43, from ./boost_1_25_1/boost/graph/adjacency_list.hpp:293, from beaconfsa.cpp:19: ./boost_1_25_1/boost/graph/depth_first_search.hpp: In function `void boost::depth_first_search(const VertexListGraph&, const boost::bgl_named_params<P, T, R>&)': ./boost_1_25_1/boost/graph/depth_first_search.hpp:167: error: there are no arguments to `make_dfs_visitor' that depend on a template parameter, so a declaration of `make_dfs_visitor' must be available ./boost_1_25_1/boost/graph/depth_first_search.hpp:167: error: (if you use `-fpermissive', G++ will accept your code, bu t allowing the use of an undeclared name is deprecated) In file included from ./boost_1_25_1/boost/graph/dijkstra_shortest_paths.hpp:39, from beaconfsa.cpp:22: ./boost_1_25_1/boost/pending/mutable_queue.hpp: In member function `bool boost::mutable_queue<IndexedType, RandomAccess Container, Comp, ID>::test()': ./boost_1_25_1/boost/pending/mutable_queue.hpp:131: error: `is_heap' is not a member of `std' In file included from beaconfsa.cpp:22: ./boost_1_25_1/boost/graph/dijkstra_shortest_paths.hpp: In member function `void boost::dijkstra_visitor<Visitors>::edg e_relaxed(Edge, Graph&)': ./boost_1_25_1/boost/graph/dijkstra_shortest_paths.hpp:70: error: `m_vis' undeclared (first use this function) ./boost_1_25_1/boost/graph/dijkstra_shortest_paths.hpp:70: error: (Each undeclared identifier is reported only once for each function it appears in.) ./boost_1_25_1/boost/graph/dijkstra_shortest_paths.hpp: In member function `void boost::dijkstra_visitor<Visitors>::edg e_not_relaxed(Edge, Graph&)': ./boost_1_25_1/boost/graph/dijkstra_shortest_paths.hpp:74: error: `m_vis' undeclared (first use this function) beaconfsa.cpp: In function `int transition_fsa(unsigned int*, unsigned int*)': beaconfsa.cpp:282: warning: comparison between signed and unsigned integer expressions make: *** [beaconfsa.o] Error 1 _________________________________________________________________ Windows Live Spaces is here! Its easy to create your own personal Web site. http://spaces.live.com/signup.aspx

2 1

Re: [Boost-users] bind depending on the type
by Todd Greer 22 Aug '06

22 Aug '06

Minkoo Seo wrote: > vector< pair<string, int> > subjects; > subjects.push_back(make_pair("Math", 90)); > subjects.push_back(make_pair("English", 86)); > subjects.push_back(make_pair("Physics", 88)); > subjects.push_back(make_pair("Biology", 97)); > > long total; > total = accumulate(subjects.begin(), subjects.end(), 0, > _1 + bind(&pair<string, int>::second, _2)); > This is a simple score card application that computes the total score. > As you can see, I've used bind in calling accumulate and that > seems to be ugly. So, I modified the code as follows: Seems fine to me, but it's your code, so your opinion's the important one. > So, what I want to do is write a function get_score that successfuly > compiles and run the following: > > total = accumulate(subjects.begin(), subjects.end(), 0, get_score(_1) + > get_score(_2)); > > I've tried my best only to fail. Could anybody write get_score functions > for me? You're motivation is unclear. The usual reason to use Boost.Lambda is that you want to define all of the logic of the algorithm at the call site, rather than having auxiliary definitions elsewhere. If you're going to have some part of the algorithm get its own named definition, then it's simpler just to use a regular function or function object. Then everything is quite simple: total = accumulate(subjects.begin(), subjects.end(), 0, accumulate_scores); This assumes that accumulate_scores is something like: int accumulate_scores(int a, pair<char const*, int> const& b) { return a + b.second; } If you really do want to write "total = accumulate(subjects.begin(), subjects.end(), 0, get_score(_1) + get_score(_2));", you would need to write two get_score() overloads, one that takes a boost::lambda::placeholder1_type, and one that takes a placeholder2_type. They could return types with an overloaded addition operator that returned a boost::function of the appropriate type, or they could return types equivalent to bind expressions. Although the placeholder1_type overload would simply return its argument, the other would return a long, complex, and I think unspecified type, though I guess you could generate the type with boost::result_of. Frankly, it sounds like far too much trouble; I'd take the simple route, but it's your call. -- Todd Greer

1 0

[BGL] How to add a vertex_descriptor in a graph property
by Manuel Yguel 22 Aug '06

22 Aug '06

Hello, I want to make tree class with the BGL and so I need to specify the root of the tree. Previously I did that by deriving a graph and adding a graph_descriptor member like the code below: typedef boost::adjacency_list< boost::listS, boost::listS, boost::directedS, int > Graph; class Tree : public Graph { public: typedef typename boost::graph_traits< Graph >::vertex_descriptor root; Tree(); }; The constructor create a Vertex then defines root equal to that first vertex. But with bundled property I wanted to know if it is possible to define the root in the graph property. In fact I tried it but I am a bit embarrassed by the cyclic problem: - graph property needs to know what a vertex_descriptor is, - graph needs to know what a graph property is, - graph defines what a vertex_descriptor is. I tried the Barton-Nackman trick but I failed. Is it a proper way to do that ? Some advices, or pointers will be really apreciated. Thanks, Manuel Yguel.

2 1

Is there any corresponding C++ component for java.lang.reflect?
by Bo Xie 22 Aug '06

22 Aug '06

Hi all, I know C++ language does not support Java language's "reflect" mechanism. Is there any corresponding C++ component/library for java.lang.reflect? e.g., Does Boost support "reflect"? Thanks! Best Regards, Xie, Bo

5 6

segfault and no segfault with 2 different boost versions.
by Thierry Dumont 22 Aug '06

22 Aug '06

I develop a C++ code which uses boost::threads * This code performs perfectly well with the boost library wich comes with Debian sarge (libboost-thread1.32.0 for thread library). But I want a more complete implementation of boost (I want to use property tree library). So I have installed and compiled boost_1_33_1. * Using this library, all the programs which use the thread library segfault (at thread-create). Where is the problem ? With the Debian sarge library, I compile with the options: -DBOOST_HAS_THREADS -D_REENTRANT -O2 -funroll-all-loops -fomit-frame-pointer Do I need to change something? Did I missed something when I installed boost_1_33_1? In both cases, g++ version is 3.3.5. -- Thierry Dumont. Institut Camille Jordan -- Mathematiques-- Univ. Lyon I,43 Bd du 11 Novembre 1918, 69622 - Villeurbanne Cedex - France. Thierry.Dumont(a)maply.univ-lyon1.fr web: http://maply.univ-lyon1.fr/~tdumont

2 1

Problem while installin boost 1.33.1
by Leonardo José Reyes Diago 22 Aug '06

22 Aug '06

Hello, i´m trying to install boost 1.33.1, ii'm using windowsXP with visual c++ 2005 express, and using the follow command line: bjam "-sTOOLS=vc-8_0" "—prefix=d:\" install. that have to build a folder with the libraries, but does not do that. This is a part of the message that it show in the command prompt: CALL "C:\Archivos de programa\Microsoft Visual Studio 8\Common7\Tools..\..\VC\bin\vcvars32.BAT" >nul "C:\Archivos de programa\Microsoft Visual Studio 8\Common7\Tools..\..\VC\bin\cl" /Zm800 -nologo /EHsc -c -DBOOST_DATE_TIME_STATIC_LINK -DUSE_DATE_TIME_PRE_1_33_FACET_IO /Z7 /Od /Ob0 /EHsc /GR /MTd /Zc:forScope /Zc:wchar_t -I"bin\boost\libs\date_time\build" -I"C:\boost_1_33_1" -Fo"bin\boost\libs\date_time\build\libboost_date_time.lib\vc-8_0\debug\runtime-link-static\threading-multi\greg_month.obj" -Tp"C:\boost_1_33_1\libs\date_time\build\../src/gregorian/greg_month.cpp" ...failed vc-C++ bin\boost\libs\date_time\build\libboost_date_time.lib\vc-8_0\debug\runtime-link-static\threading-multi\greg_month.obj...vc-C++ bin\boost\libs\date_time\build\libboost_date_time.lib\vc-8_0\debug\runtime-link-static\threading-multi\greg_weekday.obj The system cannot find the specified route . The system cannot find the specified route . ...skipped <@boost!lib>libboost_wave-vc80-mt-1_33_1.lib for lack of <@boost!libs!wave!build\libboost_wave.lib\vc-8_0\release\threading-multi>libboost_wave-vc80-mt-1_33_1.lib... ...skipped <@boost!lib>boost_date_time-vc80-mt-gd.lib for lack of <@boost!lib>boost_date_time-vc80-mt-gd-1_33_1.lib... ...skipped <@boost!lib>boost_date_time-vc80-mt.lib for lack of <@boost!lib>boost_date_time-vc80-mt-1_33_1.lib... ...skipped <@boost!lib>libboost_date_time-vc80-mt-sgd.lib for lack of <@boost!lib>libboost_date_time-vc80-mt-sgd-1_33_1.lib... ...failed updating 808 targets... ...skipped 336 targets... ...updated 2 targets... Can someone help me to solve this? Thanks

2 1

Boost regex multi-processor scalability and user-defined allocators
by Roy Emek 22 Aug '06

22 Aug '06

Iâm using boost-regex library, and Iâm running into multi-threading scalability issues. When tested on a machine with several CPUs, my performance tests show improvement of about 60-70% when moving from a single thread to 2 threads. Question 1: Is anyone aware of this problem? Is there a known solution? >From some testing weâve done, it seems that the cause of the scalability issue is problematic implementation of std:allocator. This is a known issue on some operating systems (e.g., Solaris 8). Some of the boost::regex classes (e.g., match_results) accept a user-defined allocator. However, as far as I can understand thereâs no way to completely override the use of std::allocator. Question 2: is there a way to completely prevent boost / regex from using std::allocator? If no, can such a capability be added? (One solution to this problem would be global overriding the ânewâ and âdeleteâ operators â but for various reasons this cannot be done in the application Iâm developing). __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

3 2

Re: [Boost-users] [Signals] Relationships to other libraries and terms
by Ames Andreas 22 Aug '06

22 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Scott Meyers > Sent: Tuesday, August 22, 2006 12:07 AM > Subject: [Boost-users] [Signals] Relationships to other > libraries and terms > > We start with "callable entities" -- things that can be called, e.g., > function pointers, function objects, bound member functions, > etc. As I > understand it: > > - A callback (function or object) is a callable entity > - A slot in Boost.Signals is a callable entity > - boost::bind and boost::lambda create callable entities. > - A boost::function object stores a callable entity. > > We also have collections of callable entities: > > - A .NET delegate is a collection of 0 or more callable > entities with a > given signature. > - A signal in Boost.Signals is a collection of 0 or more callable > entities with signatures compatible with a given signature. > > Objects of these collection types are also callable entities: > > - When a Boost.Signals signal or a .NET delegate is > called, it invokes > the callable entities it contains. > > Is that correct? > > Also, does anybody know where the name "slot" comes from in > this context? > I've found this term to be a stumbling block for trying to > understand this > stuff. I think the callability of signals is just a detail. Libsigc++ seems to prefer signal.emit() (although they also have operator()). A slot corresponds to the Observer (in the corresponding GoF pattern), i.e the receipient of a signal (which comes closest to the subject in the GoF pattern). Regarding the terminology: IIRC, it was introduced by a signal/slot lib in C, unfortunately I can't find the links, sorry (I'd also be interested in them, if anyone can find them). There are quite some implementations in C++: Qt, libsigc++, boost and others. On the libsigc++ mailing list was a discussion about the terminology, you can find it in the thread starting with http://mail.gnome.org/archives/libsigc-list/2005-July/msg00014.html. cheers, aa -- Andreas Ames | Programmer | Comergo GmbH | Voice: +49 69 7505 3213 | ames AT avaya DOT com

1 0

Problem binding a predicate to random_shuffle()
by Nelis Franken 22 Aug '06

22 Aug '06

Good day. After an initial post on the comp.lang.c++ usergroup, I was pointed to using boost::bind for binding member functions as predicates for STL functions (original example applied to sort()). The technique to use Boost's bind() works well, except when used with STL's random_shuffle(). The following code demonstrates a working call (on sort()) and a call that generates an error (on random_shuffle()), both using the same technique. The code: #include <algorithm> #include <functional> #include <vector> #include <boost/bind.hpp> using namespace std; class Foo { public: Foo() { for (int i=0; i < 5; i++) { dataVector.push_back(i*10); idVector.push_back(i); } } bool isLess(int leftID, int rightID) { return (dataVector[leftID] < dataVector[rightID]); } int customRand(int n) { return (rand() % n); } void mySort() { sort(idVector.begin(), idVector.end(), boost::bind(&Foo::isLess, this, _1, _2)); } void myShuffle() { random_shuffle(dataVector.begin(), dataVector.end(), boost::bind(&Foo::customRand, this, _1)); } private: vector<int> dataVector; vector<int> idVector; }; int main(int argc, char** argv) { Foo myObj; myObj.myShuffle(); myObj.mySort(); return 0; } The error: sort.cpp: In member function `void Foo::myShuffle()': sort.cpp:33: error: no matching function for call to `random_shuffle(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, boost::_bi::bind_t<int, boost::_mfi::mf1<int, Foo, int>, boost::_bi::list2<boost::_bi::value<Foo*>, boost::arg<1> > >)' /usr/lib/gcc/i686-pc-cygwin/3.4.4/include/c++/bits/stl_algo.h:1766: note: candidates are: void std::random_shuffle(_RandomAccessIterator, _RandomAccessIterator, _RandomNumberGenerator&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, _RandomNumberGenerator = boost::_bi::bind_t<int, boost::_mfi::mf1<int, Foo, int>, boost::_bi::list2<boost::_bi::value<Foo*>, boost::arg<1> > >] The code compiles and runs fine using VC7.1 (Visual Studio 2003), but gives an error using g++ (GCC) 3.4.4 (cygming special). Any help will be greatly appreciated. Kind regards, Nelis Franken PS: A follow-up post on the exact same problem to comp.lang.c++ directed me to post it on the Boost list, since it was deemed off-topic. I hope someone else on this list has had a similar STL problem with random_shuffle() and boost::bind?

3 4

[Format] Why boost::format doesn't work with /vd2 compiler option?
by SMART_n 22 Aug '06

22 Aug '06

Hello. I have a project in Visual Studio 2005. This project uses GtkMM library and it's necessary to use /vd2 compiler option. The problem is that Boost::format doesn't work(raise exception) with this option. What can i do? Is it possible to use boost::format with this compiler option?

1 0