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

CodeWarrior 9 for Mac
by Stephen W. Carson 21 Dec '04

21 Dec '04

Has anyone used boost on CodeWarrior 9 for Mac? Our Mac programmer tried compiling boost v1.30.0 on CodeWarrior v9.3 running on MacOS 10.3. She got a slew of compile errors, (beginning with a check() macro). Is there any point in proceeding? Thanks, -- Stephen W. Carson dirXion St. Louis, MO

3 2

mutex.cpp with pthread problem
by Michael Garriss 21 Dec '04

21 Dec '04

from libs/thread/mutex.cpp in boost 1.31, around line 211: void mutex::do_lock() { int res = 0; res = pthread_mutex_lock(&m_mutex); if (res == EDEADLK) throw lock_error(); assert(res == 0); } that last assert is failing for me. pthread_mutex_lock is returning 22 which if it's from sys/errno.h is EINVAL or "Invalid argument". any ideas? i built boost 1.31 on hpux 11.11 with a gcc from hp. some info: > gcc -v Reading specs from /usr/local/lib/gcc-lib/hppa2.0w-hp-hpux11.11/3.3.3/specs Configured with: /scratch/zack/pkgbuild/3.3.1/hpux-11/gcc-3.3.3/configure --enable-languages=c,c++ --enable-threads=posix --disable-nls --with-gnu-as --without-gnu-ld --with-as=/usr/local/bin/as --prefix=/usr/local Thread model: posix gcc version 3.3.3 > uname -a HP-UX unknown B.11.11 U 9000/800 180901557 unlimited-user license thanks, mike

2 5

Tuple access on Solaris
by darren.gilbert＠ubs.com 20 Dec '04

20 Dec '04

Hello, I was using the boost tuples library (from boost 1.31) to create a cache key. However, the Solaris compiler (SUNWspro v6.2.p1) complained when I tried to access the last element in the tuple. My class looked something like this: typedef enum result_type_id { ... } ResultTypeID; class ParamStateKey; class Cache { typedef boost::tuple<ParamStateKey, ResultTypeID, int, int, int> key_type; // cache implementation ... // some helper functions defined to hide the boost::tuple interface static ParamStateKey &GetState(key_type &k) { return boost::tuples::get<0>(k); } static ResultTypeID &GetGreek(key_type &k) { return boost::tuples::get<1>(k); } static int &GetProduct(key_type &k) { return boost::tuples::get<2>(k); } static int &GetSubpage(key_type &k) { return boost::tuples::get<3>(k); } static int &GetBucket(key_type &k) { return boost::tuples::get<4>(k); } static key_type MakeKey(const ParamStateKey &psk, ResultTypeID r, int p1, int p2, int bkt) { return boost::tuples::make_tuple(psk, r, p1, p2, bkt); } }; The solaris compiler complained whenever I tried to call Cache::GetBucket() with the following error: "../../../../incl/3rd/boost/tuple/detail/tuple_basic.hpp", line 105: Error: Could not find a match for boost::tuples::detail::get_class<0>::get<boost::tuples::detail::get_class<0>::RET, boost::tuples::detail::get_class<0>::HT, boost::tuples::detail::get_class<0>::TT>(boost::tuples::cons<int, boost::tuples::null_type>). "../../../../incl/3rd/boost/tuple/detail/tuple_basic.hpp", line 105: Where: While instantiating "static boost::tuples::detail::get_class<1>::get<int&, int, boost::tuples::cons<int, boost::tuples::null_type>>(boost::tuples::cons<int, boost::tuples::cons<int, boost::tuples::null_type>>&)". "../../../../incl/3rd/boost/tuple/detail/tuple_basic.hpp", line 105: Where: Instantiated from non-template code. Firstly, I have no way of deciphering that error message. Through trial and error, I found that removing the GetBucket() calls solved the problem. However, I needed these calls. I reasoned that since the other helper functions worked, it was a problem accessing the last element of the tuple. So I created a dummy entry in the tuple and redefined my typedef: typedef boost::tuple<ParamStateKey, ResultTypeID, int, int, int, int> key_type; This work-around is fine, so this is not an urgent problem. But it seems like this should not be necessary. ________________________________________ Darren Gilbert Associate Director UBS - Equities Quantitative Strategies Phone: +1 (312) 525-5766 Stein's law: "When a trend cannot continue it will stop." -- Herb Stein, Chairman of the Council of Economic Advisors under Nixon Visit our website at http://www.ubs.com This message contains confidential information and is intended only for the individual named. If you are not the named addressee you should not disseminate, distribute or copy this e-mail. Please notify the sender immediately by e-mail if you have received this e-mail by mistake and delete this e-mail from your system. E-mail transmission cannot be guaranteed to be secure or error-free as information could be intercepted, corrupted, lost, destroyed, arrive late or incomplete, or contain viruses. The sender therefore does not accept liability for any errors or omissions in the contents of this message which arise as a result of e-mail transmission. If verification is required please request a hard-copy version. This message is provided for informational purposes and should not be construed as a solicitation or offer to buy or sell any securities or related financial instruments.

1 0

Efficient removal of std::list items
by Cory Nelson 20 Dec '04

20 Dec '04

This seems like the type of thing boost may have an answer to, yet I still havn't found it: I have two std::lists, about 50,000 items in each. The items are all number ranges so two uints start and end. I need to remove one list from the other - exact matches or subranges only. Currently I'm using remove_if() to remove/shrink/split them but it is taking forever, around 30sec. Anyone know of a better solution? -- Cory Nelson http://www.int64.org

4 10

Re: [Boost-users] boost::variant with boost::signals leads to Internal Compiler Error with MSDEV 7.1
by Victor A. Wagner Jr. 20 Dec '04

20 Dec '04

your snippit compiles fine using my vs7.1 and the latest from CVS. is there some code needed to instantiate any of this needed to cause the ICE? At Monday 2004-12-20 08:30, you wrote: >Hi > >Environment: >MS 7.1 compile with MS implementation of STL >Boost 1.32.0 > >Summary: > >I get an internal compiler error using boost::variant as a parameter of a >boost::signal compiling with MSDEV 7.1, but not with gcc3.3/3.4 or MinGW >(3.5). > >Does anyone knows a workaround other than not using boost::signals? > >Details > >Using a signal with a variant of 2 simple classes (see code snippet) leads >to an >internal compiler error C1001. Using pragma command to turn optimisation >off as >Suggested by the compiler does not change a thing > >Does anyone knows a workaround? > >Regards, jom > >Here's the bad code snippet: > >#include <boost/bind.hpp> >#include <boost/signals.hpp> >#include <boost/variant.hpp> > >#include <vector> > >class MessageException : public std::exception >{ >public: > MessageException() > : std::exception( "Message error" ) > {} >}; > >class Message >{ >public: > typedef std::vector<unsigned char> Content; > > Message(unsigned int p, unsigned char def = ' ') > : m_vector( p, def ) > {} > > const Content& message() {return m_vector;} >private: > Content m_vector; >}; > >typedef boost::variant<MessageException, Message> MessageVariant; > >class TestWrap >{ >public: > TestWrap(){} > > typedef boost::signal1<void, MessageVariant> MessageSignal; > //typedef boost::signal<void (MessageVariant)> MessageSignal; > > > void send_signal (MessageVariant& variant) > { > m_message_signal( variant ); > } >private: > MessageSignal m_message_signal; >}; > > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users Victor A. Wagner Jr. http://rudbek.com The five most dangerous words in the English language: "There oughta be a law"

1 0

Bug in BGL with num_vertices( filtered_graph )
by Sebastian Weber 20 Dec '04

20 Dec '04

Hello there! I think I found a bug in the BGL concerning the num_vertices function applied to filtered graphs. I use the filtered graph stuff with a vertice predicate. When I loop through the filtered graph with the vertex_iterator, I end up with a loop over all vertices where the predicate is true, just as it is supposed to be. But the function num_vertices on the filtered graph does return me the number of vertices of the original graph and not of the filtered graph. My system: boost 1.32.0, g++ 3.3.4, debian sarge. My graph type is boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS > and boost::filtered_graph<graph_t, boost::keep_all, largest_component<graph_t> > Greetings, Sebastian Weber

3 5

enable_if for class templates
by Agoston Bejo 20 Dec '04

20 Dec '04

Has anyone succeeded in specializing class templates with enable_if under VC++7.1? I have created the simplest example possible and cannot imagine how I could rewrite so that no Internal Compiler Error occurs. I have tried with both the boost 1.31 and 1.32 headers, with no difference. ------------------------------------------------------ #include <iostream> #include <boost/utility/enable_if.hpp> #include <boost/type_traits.hpp> using namespace std; using namespace boost; template<typename T, typename E = void> struct A { enum { X = 0 }; }; template<typename T> struct A<T, typename enable_if< typename is_arithmetic<T> >::type> { enum { X = 1 }; }; template<typename T> struct A<T, typename enable_if< typename is_object<T> >::type> { enum { X = 2 }; }; struct B {}; int _tmain(int argc, _TCHAR* argv[]) { // cout << is_arithmetic<double>::value << endl; typedef A<float> Afloat; cout << Afloat::X << endl; // Internal Compiler Error cout << A<int>::X << endl; cout << A<B>::X << endl; return 0; } ------------------------------------------------------

3 4

Where should STL suggestions go?
by Jim Lear 20 Dec '04

20 Dec '04

I know this is not the correct place to suggest new features to the STL, but I can't find a similar group for STL. Any suggestions? Sorry for the interruption. P.S. In case you're wondering what the suggestion is: Add ability to use random access operators with iterators. E.g. vector<int> intv; ... vector<int>::iterator i=intv.begin(); intv[i]++; It seems odd and confusing that iterators have pointer semantics but not random access semantics. -- Jim Lear

8 21

Return type of boost::bind(...)
by Agoston Bejo 19 Dec '04

19 Dec '04

Hi! Is there an easy way to use the exact type of what boost::bind(...) returns? The example above sheds some light of the source of this question. It would be much better (actually this is what bind is for, isn't it?) if I didn't have to define the plus_5 struct in order to be able to use transform_iterator. I wrote it in the comment what I'm thinking about. I could delve deeply into the bind header files and try to explicitly find what the exact class definition is, but I suspect it would not be too easy. Anyway, I may be forced to do that. Thx, Agoston // ------------------------------------------- #include <iostream> #include <functional> #include <algorithm> #include <boost/iterator/transform_iterator.hpp> #include <boost/bind.hpp> using namespace std; using namespace boost; struct plus_5 : public unary_function<int, int> { int operator()(int i) const { return i + 5; } }; typedef transform_iterator<plus_5, int*> Iterator; //------- *** ---------------------- //typedef transform_iterator< bind_type<plus<5>, _1, 5>, int* > Iterator; // how to easily get the return type of bind(plus<5>(), _1, 5) // in compilation time? //------- *** ------------------------ int _tmain(int argc, _TCHAR* argv[]) { int ia[] = {1,2,3,4,5}; copy(Iterator(ia), Iterator(ia+5), ostream_iterator<int>(cout, " ")); cout << endl; return 0; }

3 3

[range]array of ints
by Duane Murphy 18 Dec '04

18 Dec '04

I am changing a code base that previously was using the no longer supported array_traits. I use the begin() and end() functions in a lot of places with arrays of integers. I have converted everything to using boost::range::begin() and end(). However, there is a severe collision. begin() and more importantly end() are overloaded for wchar_t. Turns out on Mac OS X, wchar_t is the same as an int. This causes end() to look for a null terminator instead of just using the array length template function. Is there a way I can make range::end() work for real array's of int rather than wchar_t? Thanks for any tips, ...Duane

2 2