- Boost-users - lists.boost.org

[Serialization] how to use serialization in windows dll
by jiang.yu(mos) 06 Mar '07

06 Mar '07

Hi! I meet trouble in use serialization in dll in dll export a function like hi_dll() void hi_dll() { std::map<std::string,int> m_map; std::ostringstream os; boost::archive::text_oarchive oa(os); oa & m_map; std::cout << os.str() << std::endl; } and in exe there is a function hi_exe() code is the same as hi_dll void hi_exe() { std::map<std::string,int> m_map; std::ostringstream os; boost::archive::text_oarchive oa(os); oa & m_map; std::cout << os.str() << std::endl; } in Debug mode , the exe call both hi_exe() and hi_dll() will assert at extended_type_info.cpp line 71 assert(lookup(eti) == m_self->m_map.end()); vc7.1 boost 1.33.1 link with serialization as dll then what to do? thanks in advance. Best Regards mos

3 3

Problem with graphs - constructor throwing vector::_M_fill_insert
by Tamas Marki 06 Mar '07

06 Mar '07

Hi, I'm having a problem with the graph library. The problematic function looks like this below. Edge is a simple struct with vertex_a, vertex_b and cost as its members. The trick is that I need to process this big graph a few times, each time throwing out some edges and keeping others, hence the reindexing and mapping of these. I've used the graph lib previously, and worked, I'm just unable to find what am I doing wrong this time. Any help would be welcome. Thanks in advance. typedef std::pair<int, int> edge; typedef boost::adjacency_list < boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property < boost::edge_weight_t, int > > graph_t; typedef boost::graph_traits < graph_t >::vertex_descriptor vertex_descriptor; typedef boost::graph_traits < graph_t >::edge_descriptor edge_descriptor; graph_t* KGMReader::buildGraph (vector<edge>& edgs, vector<int>& weights, vector<int>& vertexmapping, int rootter) { edgs.clear (); weights.clear (); vertexmapping.clear (); for (vector<Edge>::iterator it = edges.begin (); it != edges.end (); ++it) { if (keepEdge (*it, rootter)) { vector<int>::iterator v1 = find (vertexmapping.begin (), vertexmapping.end (), it->vertex_a); vector<int>::iterator v2 = find (vertexmapping.begin (), vertexmapping.end (), it->vertex_b); if (v1 == vertexmapping.end ()) { vertexmapping.push_back (it->vertex_a); v1 = find (vertexmapping.begin (), vertexmapping.end (), it->vertex_a); } if (v2 == vertexmapping.end ()) { vertexmapping.push_back (it->vertex_b); v2 = find (vertexmapping.begin (), vertexmapping.end (), it->vertex_b); } edgs.push_back (edge (v1 - vertexmapping.begin (), v2 - vertexmapping.begin ())); weights.push_back (it->cost); edgs.push_back (edge (v2 - vertexmapping.begin (), v1 - vertexmapping.begin ())); weights.push_back (it->cost); } } qDebug () << "Vertexes: " << vertexmapping.size () << " edges " << edgs.size () << ", weights " << weights.size (); graph_t *g = 0; try { g = new graph_t (edgs.begin (), edgs.end (), weights.begin (), vertexmapping.size ()); } catch (exception& e) { qDebug () << "caught!!! " << e.what (); g = 0; } return g; } -- Tamas Marki

1 0

program_options - save configuration
by Aljaz 06 Mar '07

06 Mar '07

I wonder if there are any functions in boost program options libary to save them back to configuration file? Maybe any example? Thanks for help

4 7

boost::lambda::bind with shared_ptr
by Steven S. Klug 05 Mar '07

05 Mar '07

Is there any way using BLL's bind to bind to shared_ptrs in a container? e.g.: class MyClass { public: std::string MyFunc() { return str; } private: string str; }; vector<shared_ptr<MyClass> > v; find_if( v.begin(), v.end(), boost::lambda::bind( &MyClass::MyFunc, _1 ) == string( "steve" ) ); In visual studio with the scenario I get errors indicating it can't find MyFunc in the interface for shared_ptr, which you'd expect, except for the fact that boost::bind works with shared poiners. Is it the case that boost::lambda::bind doesn't? If so, that's unfortunate as it rules out using lambda with containers of shared_ptrs in a lot of cases. What am I missing? sklug

2 1

[interprocess]: build on Solaris?
by Wolfgang Hottgenroth 05 Mar '07

05 Mar '07

Hi, is it true, that boost::interprocess will only built on i386 and especially not on Solaris? We got this, when building boost::interprocess on Solaris #error No atomic operations implemented for this platform, sorry! Thanks, Wolfgang

2 1

for loop problem
by Vaclav 05 Mar '07

05 Mar '07

Hi all, Can you please tell me what is wrong with this? I do not know how to iterate thru a vector. The error is shown on the last line. Thank you Vaclav typedef boost::shared_ptr<MySillyClass> mySharedPtr; std::vector<mySharedPtr> vec; vec.push_back( mySharedPtr(new MySillyClass("bigString")) ); vec.push_back( mySharedPtr(new MySillyClass("smallOne")) ); vec.push_back( mySharedPtr(new MySillyClass("anotherOne")) ); vec.push_back( mySharedPtr(new MySillyClass("bullShit")) ); mySharedPtr ptr2 = vec[2]; if(ptr2.use_count() > 0) { ptr2->DoSomething(); // <------- works OK } for (std::vector<mySharedPtr>::iterator i = vec.begin(); i != vec.end(); ++i) { i->DoSomething(); // <------- gives error "DoSomething' : is not a member of 'shared_ptr<class MySillyClass>" }

2 2

[fusion2/phoenix2] polymorphic function objects return type
by Chris Weed 05 Mar '07

05 Mar '07

Hi, I have been looking at fusion2 and phoenix2, and I noticed fusion2 suggests using "result" as polymorphic function objects return type, but the phoenix2 documentation suggests "apply" in the examples. Are these two different things, will they be merged, or am I missing something? Thanks, Chris

2 1

[boost::transform_iterator] failure with std::vector::const_iterator
by Ovanes Markarian 05 Mar '07

05 Mar '07

Hello! I have an assertion failure using std::vector::const_iterator and boost::transform_iterator. I have a constant seq of constant string pairs delimited by special character (here ':'). My application needs only once to iterate through these pairs and return iterator ranges from the beginning until the colon and after colon until the end. I thought a transform iterator can do the job. I get in the marked position an assertion failure using MSVC 2005 Express Edition. Here the code snippet with problem description: #include <string> #include <vector> #include <utility> #include <functional> #include <boost/iterator/transform_iterator.hpp> #include <boost/range/iterator_range.hpp> #include <boost/utility.hpp> #include <boost/bind.hpp> typedef boost::iterator_range<std::string::const_iterator> iter_range; typedef std::pair<iter_range,iter_range> result_type; struct string_splitter : std::unary_function<std::string const&, result_type> { result_type operator()(std::string const& s)const throw() { iter_range r1(s.begin(), s.begin() + s.find(":")); iter_range r2(r1.end()+1, s.end()); return result_type(r1,r2); } }; typedef std::vector<std::string> str_vector; typedef str_vector::const_iterator vector_citer; typedef boost::transform_iterator<string_splitter, vector_citer> msg_opcode_citer; int main() { //create vector of strings and put 2 strings inside str_vector v; v.push_back(std::string("test1:opcode1")); v.push_back(std::string("test2:opcode2")); //!!!increment operator or dereference operator cause an assertion failure!!! // stating: "vector iterators incompatible" for(msg_opcode_citer curr = msg_opcode_citer(const_cast<str_vector const&>(v).begin(), string_splitter()), end; curr != end; ++curr) { result_type t = *curr; } return 0; } Did I miss something? With Kind Regards, Ovanes Markarian

3 3

[review][bimap] Bimap accepted
by Ion Gaztañaga 05 Mar '07

05 Mar '07

Hi to all, The Bimap library submitted by Matias Capeletto has been accepted into Boost. Thanks to all reviewers and all who contributed to the library in the informal review. Thanks also to Matias for his submission and Joaquin for his mentoring effort on this Google SoC project. We've received 6 reviews (Alisdair, Fernando, Jeff, John, Thorsten and Tony), all of which were positive. If I weren't the review manager, I would also make a positive review of this library, so I'm pretty happy with the results. Now I have a bit of work reviewing all the comments, suggestions and Matias' replies to write an small summary of requested changes and conclusions. The "relation" view, and some basic names ("first"/"second" vs. "left"/"right") were the most active topics. But everyone has considered Bimap useful, well-written, and well documented. I'll post the summary following week. Regards, Ion

3 2

Boost.Test on Cygwin
by n.torrey.pines＠gmail.com 04 Mar '07

04 Mar '07

Hi I noticed that Cygwin does not include Boost.Test. Apparently, the maintainers could not build it. Should I try doing that myself, or is this a waste of time? Thanks

4 5