- Boost - lists.boost.org

tarball build doc issue
by Jared McIntyre 19 Nov '04

19 Nov '04

The documentation for bjam setup in more/getting_started.html says to "chdir boost-1.31.0" as a possible place to you may have installed boost. Should this be made 1.32.0? Jared McIntyre

2 1

[jamboost] [fsm] gcc-3.4.x patches
by Juergen Hunold 19 Nov '04

19 Nov '04

Hi ! The attached patch fixes the last problems with gcc-3.4.1 due to missing "template" keywords. Tested against gcc-3.3.4 (SuSE-9.2) Andreas, I tried to sent you my V2 jamfiles to your yahoo.com address, but did not get a reply from you. Is that a throw-away address ? Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! Institut für Verkehrswesen, Eisenbahnbau * voice: ++49 511 762-2529 ! und -betrieb, Universität Hannover * fax : ++49 511 762-3001 ! Appelstrasse 9a, D-30167 Hannover * hunold(a)ive.uni-hannover.de ! www.ive.uni-hannover.de ------------------------ Yahoo! Groups Sponsor --------------------~--> $9.95 domain names from Yahoo!. Register anything. http://us.click.yahoo.com/J8kdrA/y20IAA/yQLSAA/z3wwlB/TM --------------------------------------------------------------------~-> Yahoo! Groups Links <*> To visit your group on the web, go to: http://groups.yahoo.com/group/jamboost/ <*> To unsubscribe from this group, send an email to: jamboost-unsubscribe(a)yahoogroups.com <*> Your use of Yahoo! Groups is subject to: http://docs.yahoo.com/info/terms/

3 5

Macro for using overloaded functions with templated code.
by Daniel James 19 Nov '04

19 Nov '04

I've written a macro (the implementation is attached) for generating a function object for using overloaded functions with generic code such as the STL algorithms and boost::bind. A simple example of it's use: void foo(int); void foo(char*); GENERATE_OVERLOADED(void, foo); int main() { int values[] = { 1, 2, 3, 4 }; std::for_each(values, values+4, foo_overloaded); } GENERATE_OVERLOADED (yes, the naming is pretty bad) creates an object called which contains overloaded calls to operator() which forward to the named functions. Something like: struct foo_overloaded_type { void operator() const { return foo(); } template <class T1> void operator(T1 const& p1) const { return foo(p1); } template <class T1, class T2> void operator(T1 const& p1, T2 const& p2) const { return foo(p1, p2); } // etc. } foo_overloaded; The main advantage is that you don't have to select the desired overload. It can also be useful when different calls will have different argument types such as iterating over a tuple in fusion (I guess you could call it a visitor). Any comments on this? Would anyone else find this useful? Also, has anyone done something similar? I'd be surprised if no one has, I always feel like I'm missing something when I'm doing this kind of thing. The implementation is lacking in several ways - it doesn't work for non-const references, the return type is fixed, needs to deal with member functions, namespace issues and so on. I suppose, it could also be better integrated with bind, lambda or pheonix. Daniel

3 8

configure script not executable
by Jonathan Wakely 19 Nov '04

19 Nov '04

The libs/config/config.htm page says you should run /libs/config/configure as "./configure" but the file isn't executable in either CVS or the 1.32.0 release candidate. The docs should be changed as per the attached patch, although it might be too late for 1.32 jon -- "Self-respect: the secure feeling that no one, as yet, is suspicious." - H.L. Mencken

2 3

preprocessor fix
by Arias Brent-P96059 19 Nov '04

19 Nov '04

I've invented a printable enum, based on the Boost preprocessor programming lib. But although the printable enum works, I think my efforts revealed a bug in Boost. The BOOST_PP_SEQ_ENUM preprocessor macro doesn't work with the empty "false" result of BOOST_PP_EXPR_IIF. This has forced me to do hacks like this: #define ENUM(name, start, entries)\ BOOST_PP_SEQ_ENUM( \ BOOST_PP_IIF(ENUMS, \ (typedef enum{ BOOST_PP_SEQ_HEAD(entries) = start) \ BOOST_PP_SEQ_TAIL(entries) \ (LAST_##name } name;) \ , \ (static void PP_NILFUNC();) \ ) \ ) As you can see in the above definition, I've included an explicit "false" clause for BOOST_PP_IIF() that expands into the harmless (and utterly superfluous) expression "static void PP_NILFUNC();". I would instead have preferred to use BOOST_PP_EXPR_IIF and thus avoid the eye-sore. But the hack was necessary, as I said before, because BOOST_PP_SEQ_ENUM does not elogantly handle the empty "false" result of BOOST_PP_EXPR_IIF. Can this be fixed? -Brent

3 3

[Boost-bugs] [ boost-Bugs-1069225 ] date_time type conversion warning
by SourceForge.net 19 Nov '04

19 Nov '04

Bugs item #1069225, was opened at 2004-11-18 21:21 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1069225&group_… Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: date_time type conversion warning Initial Comment: from boost 1.32.0 final draft tarball. d:\development files\boost 1.32.0 \include\boost\date_time\date_parsing.hpp(211) : warning C4244: 'argument' : conversion from '_STL::basic_string<_CharT,_Traits,_Alloc>::value_t ype' to 'char', possible loss of data with [ _CharT=wchar_t, _Traits=_STL::char_traits<wchar_t>, _Alloc=_STL::allocator<wchar_t> ] d:\development files\boost 1.32.0 \include\boost\date_time\date_parsing.hpp(253) : see reference to function template instantiation 'date_type boost::date_time::from_stream_type<date_type,_STL::b asic_string<_CharT,_Traits,_Alloc>::iterator> (iterator_type &,iterator_type &,wchar_t)' being compiled with [ date_type=boost::gregorian::date, _CharT=wchar_t, _Traits=_STL::char_traits<wchar_t>, _Alloc=_STL::allocator<wchar_t>, iterator_type=_STL::basic_string<wchar_t,_STL::char_tr aits<wchar_t>,_STL::allocator<wchar_t>>::iterator ] d:\development files\boost 1.32.0 \include\boost\date_time\gregorian\parsers.hpp(78) : see reference to function template instantiation 'boost::date_time::period<point_rep,duratio n_rep> boost::date_time::from_simple_string_type<boost::grego rian::date,wchar_t>(const _STL::basic_string<_CharT,_Traits,_Alloc> &)' being compiled with [ point_rep=boost::gregorian::date, duration_rep=boost::gregorian::date_duration, _CharT=wchar_t, _Traits=_STL::char_traits<wchar_t>, _Alloc=_STL::allocator<wchar_t> ] ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1069225&group_… ------------------------------------------------------- This SF.Net email is sponsored by: InterSystems CACHE FREE OODBMS DOWNLOAD - A multidimensional database that combines robust object and relational technologies, making it a perfect match for Java, C++,COM, XML, ODBC and JDBC. www.intersystems.com/match8 _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[assign] documentation bug
by Caleb Epstein 19 Nov '04

19 Nov '04

In the assign library documentation page <boost>/libs/assign/doc/index.html#repeat: v = list_of(1).repeat(5,2)(3); // v = [1,2,2,2,2,2,3] BOOST_ASSERT( v.size() == 1 + 5 + 3 ); push_back( v )(1).repeat(1,2)(3); // v = old v + [1,2,3] BOOST_ASSERT( v.size() == 12 ); I think the first BOOST_ASSERT should be BOOST_ASSERT (v.size() == 1 + 5 + 1) and the last one should be BOOST_ASSERT( v.size() == 10 ); -- Caleb Epstein caleb.epstein(a)gmail.com

3 3

[1.32] dynamic_bitset docs
by Pavel Vozenilek 19 Nov '04

19 Nov '04

Documentation for dynamic_bitset contains TODO notes at the beginning. Maybe they should be removed for Release, they are of little value for user and rather give impression of library being unfinished. Chapter "Changes from previous version(s)" contains striken text "reserve(), capacity()" that may be removed (functions are present but undocumented).. /Pavel

2 1

[progress] progress_timer inserts \n and std::endl
by Caleb Epstein 18 Nov '04

18 Nov '04

Is there any that boost::progress_timer to inserts *both* \n and std::endl to the output stream when it is destroyed? I think it should just do the std::endl. -- Caleb Epstein caleb dot epstein at gmail dot com

1 0

bug in bgl?
by Eyal Farago 18 Nov '04

18 Nov '04

I'm trying to use the edge(u, v, g) on a revese_grap h, I get a stack overflow after the programs enters an infinite loop(or actually infinite recursive call). once looking at the selected overload I could see a very strait-forward correction: template <class BidirectionalGraph, class GRef> inline std::pair<typename BidirectionalGraph::edge_descriptor, bool> edge(const typename BidirectionalGraph::vertex_descriptor u, const typename BidirectionalGraph::vertex_descriptor v, const reverse_graph<BidirectionalGraph,GRef>& g) { return edge(v, u, g); //this should be: edge(v, u, g.mg) } the next call to edg(...) shoul pass the adapted grap. eyal.

2 1