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

Re: [Boost-users] [Serialization]: bug while serializing a std::string
by RIVASSEAU Jean Noel 09 Feb '06

09 Feb '06

I am assuming you meant : std::ofstream ifs("container.mob"); boost::archive::text_oarchive ia(ofs); oa << MyObject; ofs << std::endl; and not std::ifstream ifs. So if I understand well, this "patch" only adds a newline to the archive at the saving stage. I tried it but it did not help in any way; in fact I cannot see how it could help, since the problem is at the point of the loading of the std::string, not at the end of the load of the whole object. What I mean here is that MyObject is, in my case, a class containing a std::vector of pointers to class containing std::strings. One of these strings is too long, which causes the crash. Maybe what you meant is appending the std::endl after the serialization of the std::string, but this is not possible since at this point I have only access to the archive, not the underlying ofstream : template<class Archive> void serialize(Archive & ar, const MyClass& m, const unsigned int version) { ar & m.a_standard_string; } I do not have access there to the underlying ofstream of the implementation. Note that here, MyObject would contain a std::vector < MyClass * >. And I am serializing directly MyObject which causes the serialization of MyClass later. So, what do you mean? Have you located the bug ? _____ De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Robert Ramey Envoyé : jeudi 9 février 2006 04:46 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] [Serialization]: bug while serializing astd:string Untl 1.34 comes out try the following on the output stream std::ifstream ofs("container.mob"); boost::archive::text_oarchive ia(ofs); oa << MyObject; ofs << std::endl; "RIVASSEAU Jean Noel" <JN.RIVASSEAU(a)oberthurcs.com> wrote in message news:87F60F7FA02FF749AFB02BD9FCAA6B04C87411@naserv31.nanterre.oberthurcs.com... I have been able to test with a string stream; the bug does not occur. That is, this code produces the bug: std::ifstream ifs("container.mob"); boost::archive::text_iarchive ia(ifs); ia & MyObject; while the following does not: std::ifstream ifs("container.mob"); std::ostringstream tmp; tmp << ifs.rdbuf(); std::istringstream is(tmp.str()); boost::archive::text_iarchive ia(is); ia & MyObject; a) try using a different stream buffer - strstream So do you have any clue, Robert ?? Clearly the problem has to do with buffering somewhere.... Jean-Noël _____ _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

pd darwin Symbol not found
by Locatelli Jérôme 09 Feb '06

09 Feb '06

I'am writing a application on MacOS 10.4.4 using darwin 8 with gcc 4, I compile and link my application without problem but when I run my application , I've got the error bellow. Has anybody got an idear?? Thanks. dyld: lazy symbol binding failed: Symbol not found: __ZN5boost6detail3tss4initEPNS_9function1IvPvSaINS_13function_baseEEEE Referenced from: /Users/locatelli/Projets/ics/IcsServer/obj.ics/../lib/ libIcsServerCommandSystem.0 Expected in: flat namespace dyld: Symbol not found: __ZN5boost6detail3tss4initEPNS_9function1IvPvSaINS_13function_baseEEEE Referenced from: /Users/locatelli/Projets/ics/IcsServer/obj.ics/../lib/ libIcsServerCommandSystem.0 Expected in: flat namespace Trace/BPT trap --------------------------------------------------- Locatelli Jérôme Institut Laue-Langevin Service Contrôle des instruments 6 rue Jules Horowitz, BP 156 38042 Grenoble cedex 9 http://www.ill.fr/ Tel: 33 (0)4 76 20 76 27 Fax: 33 (0)4 76 20 77 00 ---------------------------------------------------

1 0

[any] Converting between types
by Iulian M 09 Feb '06

09 Feb '06

Hello, I'm trying to use boost::any to store a group of types. For value types everything works as expected. The problem is that i need to store some polymorphic types also. The following code explains what i'm trying to accomplish. #include <boost/any.hpp> class A {}; //base calss class B: public A {}; // derived class int main() { B *b = new B(); //create derived class boost::any n(b); // place inside boost::any /* other part of code where i only know n contains a pointer to a class derived from A this will throw bad_any_cast: typeid(A*) != typeid (B*) */ A* a = boost::any_cast<A*>(n); } Is there any way of making boost::any_cast work work ok with "convertible" types? Or is there a way of storing different types of objects and having the possibility of retrieving them as compatible objects ? I've looked into any.hpp and found that it uses a typeid() equality test to see if the cast can be made. Can't there be a is_convertible test insted , at least for the case when is holding pointer to objects? Iulian -- Blessed is the man who, having nothing to say, abstains from giving wordy evidence of the fact. -- George Eliot

3 6

A problem with '^' and '$' in boost regex
by Alan Huang 09 Feb '06

09 Feb '06

Hi, In boost document I saw that the '^' matches all the blank chars in the begin of line and the '$' matches all the blank chars in the end of line. Just like regex( "^abc$" ) can't match the string " abc ". What's wrong? -- Yours Sincerely, Alan Huang

3 3

Re: [Boost-users] [GRAPH] Is the HP aCC compiler supported?
by Oliver.Kowalke＠infineon.com 09 Feb '06

09 Feb '06

Hello, aCC V6 is only available on HP/UX 11 Itanium systems. On HP/UX 11.11 PA-RISC only the old 3.x versions are available which are unable to compile boost libraries. I use gcc 3.4.4 on HP/UX together with boost - works fine. Oliver >The aCC V6 compiler is not listed as a supported compiler with boost >because nobody is running boost regression tests with this compiler, >but we are working on this... > >I ran boost regression tests with aCC A.06.06 for the latest boost >release: 1.33.1 and the results were on par with that for the supported >compilers. Specifically, for the graph library, 32 tests succeeded and >two tests failed to compile: graphviz_test and layout_test. > >graphviz_test failed to compile with: > >"/opt/aCC/include_std/utility", line 103: error #2144: a value of type > "const char *" cannot be used to initialize an entity of type > "std::pair<char [2], char [2]>::first_type" > >layout_test failed to compile because the compiler ran out of memory. > >I used extended acc jamfile with some compilation warnings disabled, >like "#2340-D: value copied to temporary, reference to temporary used", >"#2068-D: integer conversion resulted in a change of sign", "#2111-D: >statement is unreachable", ...etc. > >I suggest, you try BGL with aCC V6. > >Boris Gubenko >HP C++ team > >----- Original Message ----- >From: "rohit wadhwa" <rohit.wadhwa(a)teleatlas.com> >To: <boost-users(a)lists.boost.org> >Sent: Wednesday, February 08, 2006 12:01 PM >Subject: [Boost-users] [GRAPH] Is the HP aCC compiler supported? > > >> Can I use BGL with HP aCC compiler? If so, what version? >> >> Any help is really appreciated. >> >> Rohit. >> >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users >> >> > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[GRAPH] Is the HP aCC compiler supported?
by rohit wadhwa 09 Feb '06

09 Feb '06

Can I use BGL with HP aCC compiler? If so, what version? Any help is really appreciated. Rohit.

3 2

Re: [Boost-users] [Serialization]: bug while serializing astd:string
by RIVASSEAU Jean Noel 09 Feb '06

09 Feb '06

I have been able to test with a string stream; the bug does not occur. That is, this code produces the bug: std::ifstream ifs("container.mob"); boost::archive::text_iarchive ia(ifs); ia & MyObject; while the following does not: std::ifstream ifs("container.mob"); std::ostringstream tmp; tmp << ifs.rdbuf(); std::istringstream is(tmp.str()); boost::archive::text_iarchive ia(is); ia & MyObject; a) try using a different stream buffer - strstream So do you have any clue, Robert ?? Clearly the problem has to do with buffering somewhere.... Jean-Noël

2 1

[Regex] extracting with bcp and size
by Orhun Birsoy 08 Feb '06

08 Feb '06

I was able to extract regex and build it, Thanks for the help for my previous problem. But, (there is always a but) the size is huge (well, more than one expects). I used "bcp boost/regex.hpp C:\Development\3rdParty\Regex" to extract the regex library. For now, I do not need to build the examples etc. The extracted directory contains 1246 Files (8.75 MB), and it looks like it contains bind, function, iterator, mpl, preprocessor, regex, thread, type_traits, utility, smart_ptr libraries from boost. (boost/mpl contains 649 files, boost/preprocessor contains 149 files) Although I used make files to build (VC80), when building regex, it didn't require the thread library. I wonder whether it is really necessary. Is there anything I can do to reduce the size of this? Or am I doing something wrong? For example when extracting smart_ptr library I commented out the line that includes <boost/detail/quick_allocator.hpp> in sp_counted_impl.hpp (I will not use it), so that bcp does not extract the mpl library, which reduced the extracted file count to 85, from 345. I wonder whether similar tricks are available for regex as well. -- Orhun Birsoy

2 2

[program_options] Bug in program_options with vc-8_0 build target when displaying the help descriptions
by boost＠nogga.de 08 Feb '06

08 Feb '06

Hello, there is a bug in the help output generated from void format_paragraph(std::ostream& os, std::string par, unsigned first_column_width, unsigned line_length) function. The error message is cryptic and something like that: _Myptr + _Off <= (((_Mystring *)this->_Mycont)->_Myptr() + ((_Mystring *)this->_Mycont)->_Mysize) && _Myptr + _Off >= ((_Mystring *)this->_Mycont)->_Myptr(): The point is that the new vc8.0 compiler (or better the vs2005 standard library) performs a lot of additional iterator checking. In the function format_paragraph the "line_begin" iterator is checked, whether there is one more line to indent in the help output or whether this is the last line. During this process, the "line_begin" iterator is incremented behind the end of the current string "par.end()" and this will trigger the _SCL_SECURE_VALIDATE_RANGE warning from the new library. if (line_begin + (line_length - indent) > par_end) { line_end = par_end; } You should be able to trigger this behavior with every application when printing the help text for an option that is longer than one line. This new iterator checking has it's pros and cons. While it is good to find any sort of error, how would you safely write the case above without reverting to index like operations? Best regards Dirk

1 0

[BGL] infinite loop in astar_search (there are no negative edge costs)
by Detlef Mages 08 Feb '06

08 Feb '06

Hi all I am using astar_search from the BGL and have sometimes hangs due to an infinite loop (no, I do not use negative costs or negative heuristic values). Now here is the strange problem: when compiling the attached (see below) test program with compiler optimization enabled it runs into an infinite loop. Without optimization a solution is found. I need help, because I do not know what I should do next. Is this a compiler bug? Is there something boost can do (workaround)? Is there a known issue (could not find anything) with the relax function? -- Detlef Here are the facts: I condensed one of the malicious (undirected) graphs to <SNIP> V ar[181]; for( unsigned int i = 0; i < 181; ++i ) { ar[i] = add_vertex( VProp(i, 1.0), g ); } add_edge( ar[1], ar[18 ], EProp( 2.20 ), g ); add_edge( ar[0], ar[30 ], EProp( 1.58 ), g ); add_edge( ar[0], ar[66 ], EProp( 0.93 ), g ); add_edge( ar[66], ar[100 ], EProp( 2.72 ), g ); add_edge( ar[66], ar[101 ], EProp( 2.87 ), g ); add_edge( ar[30], ar[142 ], EProp( 4.88 ), g ); add_edge( ar[18], ar[142 ], EProp( 3.29 ), g ); </SNAP>. There are no other edges. A complete listing of the program is attached. My compiler version: # g++ -v Using built-in specs. Target: i586-suse-linux Configured with: ../configure --enable-threads=posix --prefix=/usr --with-local-prefix=/usr/local --infodir=/usr/share/info --mandir=/usr/share/man --libdir=/usr/lib --libexecdir=/usr/lib --enable-languages=c,c++,objc,f95,java,ada --disable-checking --with-gxx-include-dir=/usr/include/c++/4.0.2 --enable-java-awt=gtk --disable-libjava-multilib --with-slibdir=/lib --with-system-zlib --enable-shared --enable-__cxa_atexit --without-system-libunwind --host=i586-suse-linux Thread model: posix gcc version 4.0.2 20050901 (prerelease) (SUSE Linux) # g++ -O2 searchtest4.cpp && a.out 2>/dev/null discover: 0 examine: 0 edge_relaxed: 0 -- 30 discover: 30 edge_relaxed: 0 -- 66 discover: 66 examine: 66 edge_not_relaxed: 66 -- 0 edge_relaxed: 66 -- 100 discover: 100 edge_relaxed: 66 -- 101 discover: 101 examine: 30 edge_not_relaxed: 30 -- 0 edge_relaxed: 30 -- 142 discover: 142 CYCLE: examine: 100 CYCLE: edge_relaxed: 100 -- 66 CYCLE: black_target: 100 -- 66 CYCLE: examine: 66 CYCLE: edge_not_relaxed: 66 -- 0 CYCLE: edge_relaxed: 66 -- 100 CYCLE: black_target: 66 -- 100 CYCLE: edge_relaxed: 66 -- 101 >From now on the lines marked CYCLE are repeated. --> infinite loop # g++ -O0 searchtest4.cpp && a.out 2>/dev/null discover: 0 examine: 0 edge_relaxed: 0 -- 30 discover: 30 edge_relaxed: 0 -- 66 discover: 66 examine: 66 edge_not_relaxed: 66 -- 0 edge_relaxed: 66 -- 100 discover: 100 edge_relaxed: 66 -- 101 discover: 101 examine: 30 edge_not_relaxed: 30 -- 0 edge_relaxed: 30 -- 142 discover: 142 examine: 100 edge_not_relaxed: 100 -- 66 // from here on the two outputs differ examine: 101 edge_not_relaxed: 101 -- 66 examine: 142 edge_not_relaxed: 142 -- 30 edge_relaxed: 142 -- 18 discover: 18 examine: 18 edge_relaxed: 18 -- 1 discover: 1 edge_not_relaxed: 18 -- 142 examine: 1 found 1->18->142->30->0 --> success Here is the listing "searchtest4.cpp": ---------------------------------- #include <boost/graph/astar_search.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graphviz.hpp> #include <iostream> using namespace std; using namespace boost; struct VProp { VProp() : m_distance(1.0) {} VProp( size_t invar_id, double heuristic ) : m_vertex_invariable_id( invar_id ), m_heuristic( heuristic ), m_distance( .0 ) {} size_t m_vertex_invariable_id; // my id that is not changed by rebuilding the index map double m_heuristic; // a really simple heuristic double m_distance; // altered by the algo: this id is the distance boost::default_color_type m_color; }; struct EProp { EProp() : m_weight( .0 ) {} EProp( double weight ) : m_weight( weight ) {} double m_weight; }; typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::undirectedS, VProp, EProp > G; typedef G::vertex_descriptor V; typedef G::edge_descriptor E; struct found_goal {}; template< class Vertex, class Edge > class GoalVisitor : public boost::default_astar_visitor { public: GoalVisitor(Vertex goal) : m_goal(goal) {} template <class Graph> void examine_vertex(Vertex u, Graph& g) { cout << "examine: " << u << endl; if(u == m_goal) throw found_goal(); } template <class Graph> void discover_vertex(Vertex u, Graph& g) { cout << "discover: " << u << endl; } template <class Graph> void black_target(Edge u, Graph& g) { cout << "black_target: " << boost::source( u, g ) << " -- " << boost::target( u, g ) << endl; } template <class Graph> void edge_relaxed(Edge u, Graph& g) { cout << "edge_relaxed: " << boost::source( u, g ) << " -- " << boost::target( u, g ) << endl; } template <class Graph> void edge_not_relaxed(Edge u, Graph& g) { cout << "edge_not_relaxed: " << boost::source( u, g ) << " -- " << boost::target( u, g ) << endl; } private: Vertex m_goal; }; template< class Graph, class CostType > class DistanceHeuristic : public boost::astar_heuristic<Graph, CostType > { public: DistanceHeuristic( Graph & graph ) : m_graph(graph) {} template< class Vertex > CostType operator()( Vertex u) { return m_graph[u].m_heuristic; } private: Graph & m_graph; }; class EdgeWeightWriter { public: EdgeWeightWriter( G & graph ): m_graph( graph ) {} template< class OStream > void operator()( OStream& out, V v ) { // out << " [label= \"" << v <<"\"]"; } template< class OStream > void operator()( OStream& out, E v ) { out.precision( 30 ); out << " [label= \"" << m_graph[v].m_weight <<"\"]"; } private: G & m_graph; }; int main() { G g; V ar[181]; for( unsigned int i = 0; i < 181; ++i ) { ar[i] = add_vertex( VProp(i, 1.0), g ); } // add_edge( ar[1], ar[18 ], EProp( 2.20307469298885294506362697575 ), g ); // add_edge( ar[0], ar[30 ], EProp( 1.58945958901181461087048774061 ), g ); // add_edge( ar[0], ar[66 ], EProp( 0.937232823257896585644743936427 ), g ); // add_edge( ar[66], ar[100 ], EProp( 2.72761497732282665040770552878 ), g ); // add_edge( ar[66], ar[101 ], EProp( 2.87914914272965027919326530537 ), g ); // add_edge( ar[30], ar[142 ], EProp( 4.8843528076143511995610424492 ), g ); // add_edge( ar[18], ar[142 ], EProp( 3.29201592753501959265349796624 ), g ); add_edge( ar[1], ar[18 ], EProp( 2.20 ), g ); add_edge( ar[0], ar[30 ], EProp( 1.58 ), g ); add_edge( ar[0], ar[66 ], EProp( 0.93 ), g ); add_edge( ar[66], ar[100 ], EProp( 2.72 ), g ); add_edge( ar[66], ar[101 ], EProp( 2.87 ), g ); add_edge( ar[30], ar[142 ], EProp( 4.88 ), g ); add_edge( ar[18], ar[142 ], EProp( 3.29 ), g ); map< V, V > predecessor; associative_property_map< map< V, V > > predecessorMap( predecessor ); /** * solution to this: 1->18->142->30->0 */ try { astar_search(g, ar[0], DistanceHeuristic<G, double>( g ), predecessor_map( predecessorMap ). weight_map( get(&EProp::m_weight, g) ). color_map( get(&VProp::m_color, g) ). distance_map( get(&VProp::m_distance, g) ). visitor(GoalVisitor<V, E>( ar[1] ) ) ); } catch ( found_goal ) { cout << "found" << endl; for(V v = ar[1];; v = predecessor[v]) { cout << v; if(predecessor[v] == v) break; cout << "->"; } cout << endl; } boost::write_graphviz( std::cerr, g, EdgeWeightWriter( g ), EdgeWeightWriter( g ), default_writer() ); }

2 2