- Boost-users - lists.boost.org

[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

Re: [Boost-users] [Serialization]:
by sui tam 08 Feb '06

08 Feb '06

I am trying to use the macro : BOOST_CLASS_EXPORT(A) and the compiler issue the warning: warning #880: omission of explicit type is nonstandard ("int" assumed) Also I have to change to BOOST_CLASS_EXPORT(A); in order to compile, but I do not think the semicolon is in the example. --------------------------------- Brings words and photos together (easily) with PhotoMail - it's free and works with Yahoo! Mail.

1 0

regex matching
by Dave 08 Feb '06

08 Feb '06

#define BOOST_REGEX_DYN_LINK #include <iostream> #include <boost\regex.hpp> using namespace boost; using namespace std; int main() { regex reg_exp("\xF8.\x2A..\x0D(P|V)[0-9A-F]{3}"); // I would expect this to match. cout << regex_match("\xF8p\x2Aqf\x0DPFFF", reg_exp) << endl; // I would expect this to not match due to the 'w'. // Why does it match? cout << regex_match("\xF8p\x2Aqfw\x0DPFFF", reg_exp) << endl; }

3 2

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

08 Feb '06

Hello I've tried to reproduce the bug with an XML archive : nothing happens there. So only a text_archive triggers it. I've also examined the text output, but nothing seems really obvious, it just seems that after the 512 characters garbage is loaded into the std::string (something present earlier in the string); For example If my saved string was: Abalvqdslfldls****************tons of other characters *********** this is the 512th character HERE___and there it is beyond 512 The reloaded string before the next load which will crash will look something like: Abalvqdslfldls****************tons of other characters *********** this is the 512th character HEREons of other characters Or: Abalvqdslfldls****************tons of other characters *********** this is the 512th character HERE Abalvqdslfldls********* I will try to investigate more on this, but nothing is obvious. About the stream buffers, I am not really knowledgeable on this but from what I've read you cannot change the size of the stream buffer used (there is an overloaded method pubsetbuf but the standard says that behaviour is not defined if its arguments are something other than 0,0). So what do you mean? I will tomorrow try to read the file first into a string stream and try to load from there using a text archive. We will see if the bug happens Jean-Noël Without being able to reproduce it its going to be tough for me to find the problem or know when its fixed. try the following a) try using a different stream buffer - strstream b) try changing the size of the streambuffer used c) try xml_serialization d) examine the text output where the load fails to see if there's anything obvious there You've made some progress - but not enough for me to work with. Robert Ramey "RIVASSEAU Jean Noel" <JN.RIVASSEAU(a)oberthurcs.com> wrote in message news:87F60F7FA02FF749AFB02BD9FCAA6B04C1E144@naserv31.nanterre.oberthurcs.com... Hi I have tested with a binary archive and the problem does not occur. Only text archives seem to trigger it (I have not yet tested XML archives). I have replaced all "strange" (non-letters) characters and the problem still happens. So the string contains only letters, I even removed the spaces. However do not forget that I left the line breaks in it (if I remove the line breaks, the problem does not appear). To recapitulate: the problem appears when *all* of the following conditions are met: * using a text archive * using a std::string with line breaks * with a length >=512 * * And even like that, I am not able to reproduce this bug in a small program, although in my program it is triggered all the time. Now, Robert, if you could look into that, I'd appreciate it... Jean-Noël _____ De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Robert Ramey Envoyé : mercredi 1 février 2006 18:13 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] [Serialization]: bug while serializing astd:string This sounds like a bug to me. To help me out - check the following: try different types of archives xml, binary, etc. xml archives have a pending issue if a string contains a character (e.g. '\0') which is not representable in an xml string. Other archive classes don't have this problem. Check to see if its related to a particular character. be sure its really question of size. Robert Ramey "RIVASSEAU Jean Noel" <JN.RIVASSEAU(a)oberthurcs.com> wrote in message news:87F60F7FA02FF749AFB02BD9FCAA6B04C1D8FA@naserv31.nanterre.oberthurcs.com... Hello It seems I have come against a bug in the BSL. I am running on Win 2000 Pro, MinGW (gcc 3.4.2), Boost 1.33.1. If I serialize a standard string with 512 or more characters, the save goes ok but a stream error exception occurs while trying to reload it later from archive. Any string with size < 512 is ok. Also this bug is really strange. It does not happen if the string has no line breaks in it (even if it is more than 512 chars). It also happens on my program, but I was unable to reproduce it with a small test program, even using the same string. Could it be a bug in another part of my rather large program? Or is it really a bug in the BSL? Jean-Noël _____ _______________________________________________ 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

test_suite execution (unit test framework)
by Alexander Eisenhuth 08 Feb '06

08 Feb '06

Hello alltogether, it seems, that the a test_case-failure (BOOST_ERROR("")), skips only the actual test case, but all following tests are executed. Is that possible ? ... or am I doing something wrong? Here my code: [...] boost::shared_ptr<testTestExecutor> aInstance( new testTestExecutor ); // here happens a failure pTestSuite->add( BOOST_CLASS_TEST_CASE(&testTestExecutor::setUp, aInstance)); // but this is also executed pTestSuite->add( BOOST_CLASS_TEST_CASE(&testTestExecutor::testConstruction, aInstance)); pTestSuite->add( BOOST_CLASS_TEST_CASE( &testTestExecutor::testTestExecutorMethode, aInstance)); [...] Can I configure that behaviour ? Regards Alexander

2 1

Re: [Boost-users] [program_options]allow_unregistered() ignored?
by Merrill Cornish 08 Feb '06

08 Feb '06

Volodya, >>> Are you sure you have all the catch clauses in place. Several days ago, I posted a short, single file program that exhibited the throw problem. That example, however, didn't have the allow_unregistered() call in it. That example has a catch for both std::exception (in which case it prints the exception message) and ... (in which case it prints a messages saying unknown exception. Merrill

1 0