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

Problems with if_then_else_return in boost::lambda library
by Ioffe, Robert 07 Aug '03

07 Aug '03

Hi, If I have a vector of strings vector<string> v; v.push_back("One"); v.push_back("Two"); v.push_back("Three"); v.push_back("Four"); v.push_back("Five"); and define arithmetic action plus like this: namespace boost { namespace lambda { struct plain_return_type_2<arithmetic_action<plus_action>, std::string, std::string> { typedef std::string type; }; } } then the following code works just fine: cout << accumulate(v.begin()+1, v.end(), v.front(), _1 + string(", ") + _2) << endl; and the following also works wonderfully: int i = 1; cout << accumulate(v.begin()+1, v.end(), v.front(), _1 + bind(constructor<string>(), var(i)++, ' ') + _2) << endl; Now, if I want to use if_then_else_return as shown below, it fails miserably, producing a huge error message: cout << accumulate(v.begin(), v.end(), string(), if_then_else_return(_1 == string(), _1, _1 + bind(constructor<string>(), var(i)++, ' ') + _2)) << endl; Now for the questions: What is the proper way to use if_then_else_return? Why do I need to define a separate arithmetic action for strings, even though they are a common library type? Is there a way to say the most intuitive: cout << accumulate(v.begin()+1, v.end(), v.front(), _1 + ", " + _2) << endl; Is there way to do more intuitive: cout << accumulate(v.begin()+1, v.end(), v.front(), _1 + string(i++, ' ') + _2) << endl; Thank you for your help. Robert Ioffe [Non-text portions of this message have been removed]

1 0

[function] How to extract a tuple<A0,A1> of arguments from a boost::function<>?
by Fernando Cacciola 07 Aug '03

07 Aug '03

Short question: As the Subject says, given a boost::function{1..N}<>, how can I extract a tuple of all its arguments? Long question: Anyway, what I'm really trying to do is this: Given some classes with different methods: struct X { void f(int n ) ; } ; struct Y { void g(char c, double d ) ; } ; I want to easly create _polymorphic_ closures binding member functions of X /Y with instances of X/Y and function arguments. The goal is the have a deferred 'action' list for easy backtracing of an algorithm. That is, instead of directly calling: X x ; Y y ; x.f(1); y.g('a',1.2); I want to do something that would look like: X x; Y y; ActionList actions; actions.push_back( make_closure(&X::f, x,1) ); actions.push_back( make_closure(&Y::g, y,'a',1.2) ); std::for_each(actions.begin(),actions.end(),execute_action()); TIA Fernando Cacciola

2 2

filesystem compilation on tru64 unix
by allysonlurena 07 Aug '03

07 Aug '03

Hi all, I have been trying to build the filesystem library for one of our alpha servers running tru64 unix. I have managed to compile bjam using the tru64cxx toolset. Then, I went into the filesystem build directory and ran the following, but it has been hanging for over 30 minutes now on the last command you see below. Can anyone help? It could just be our machines, but I am at a loss. Does anyone have any ideas? Any help would be appreciated! Thanks Allyson $ cxx -V Compaq C++ V6.5-014 for Compaq Tru64 UNIX V5.1A (Rev. 1885) Compiler Driver V6.5-014 (cxx) cxx Driver rum:/.../boost_1_30_0/libs/filesystem/build $ bjam "-sTOOLS=tru64cxx65" ...found 432 targets... ...using 1 temp target... ...updating 9 targets... tru64cxx65-C++-action ../../../libs/filesystem/build/bin/libboost_filesystem.a/tru64cxx65/debug/exception.o tru64cxx65-C++-action ../../../libs/filesystem/build/bin/libboost_filesystem.a/tru64cxx65/debug/operations_posix_windows.o cxx: Warning: ../src/operations_posix_windows.cpp, line 236: #767-D conversion from pointer to smaller integer assert( m_imp.get() ); // fails if dereference end iterator ------^ cxx: Warning: ../src/operations_posix_windows.cpp, line 242: #767-D conversion from pointer to smaller integer assert( m_imp.get() ); // fails on increment end iterator ------^ tru64cxx65-C++-action ../../../libs/filesystem/build/bin/libboost_filesystem.a/tru64cxx65/debug/path_posix_windows.o tru64cxx65-C++-action ../../../libs/filesystem/build/bin/libboost_filesystem.a/tru64cxx65/debug/convenience.o tru64cxx65-Archive-action ../../../libs/filesystem/build/bin/libboost_filesystem.a/tru64cxx65/debug/libboost_filesystem.a ar: Warning: creating ../../../libs/filesystem/build/bin/libboost_filesystem.a/tru64cxx65/debug/libboost_filesystem.a Ranlib ../../../libs/filesystem/build/bin/libboost_filesystem.a/tru64cxx65/debug/libboost_filesystem.a ...using <libs!filesystem!build/libboost_filesystem.a/tru64cxx65/release>exception.o... tru64cxx65-C++-action ../../../libs/filesystem/build/bin/libboost_filesystem.a/tru64cxx65/release/operations_posix_windows.o So, it seems to hang at the last command above. Thanks again! Allyson

3 2

cvs checkout probs
by Angus Leeming 07 Aug '03

07 Aug '03

Hi, I have just tried to checkout the boost cvs tree from sourceforge, but get stuck at cvs server: Updating boost/libs/numeric/mtl/test cvs server: [05:07:19] waiting for anoncvs_boost's lock in /cvsroot/boost/boost/libs/numeric/mtl/test I can subsequently check out the remaining stuff with $ cat tmp pool preprocessor property_map python random rational regex signals smart_ptr spirit static_assert test thread timer tokenizer tuple type_traits utility $ for dir in `cat tmp`; do cvs -z3 co boost/libs/$dir; done so it appears that the problem is specific to the boost/libs/numeric/mtl/test directory. Kind regards, Angus

1 0

[boost] filesystem lib & linking (MSVC.NET)
by Jonathan Roewen 07 Aug '03

07 Aug '03

Hi All, I'm trying to use the filesystem lib, but I'm having some problems figuring out how to build it properly. I'm using MSVC.NET on WindowsXP, and I ran the bjam tool like in the docs for the whole set of libraries. It took me a while to figure out where it had put everything, and finally found a file called libboost_filesystem.lib. I copied it to a convenient location, added the library path and lib file to my project settings, and then tried to link my app. MSVC then gave a bunch of linker errors, and suggested to add MSVCRT to the nodefaultlib setting, so I did that, and got less linker errors. All that is left is some thing to do with exception & string classes. Linker errors are all about multiply defined symbols. I suppose I'm doing something wrong somewhere along the line, but not sure what. I can't tell if bjam is actually doing what it's supposed to, and the documentation around the place can be pretty sparse in places, so I hope someone can point out what I can do to get things working. Regards, Jonathan Roewen

4 4

Re: what is wrong with boost::bind?
by Jason Shirk 06 Aug '03

06 Aug '03

"yxh" <yg-boost-users(a)m.gmane.org> wrote in message news:<bgqfkv$eeu$1(a)main.gmane.org>... > I solved it by using Visual Assistant .NET I can't seem to reproduce the problem you have reported. If you could send me (jasonsh(a)microsoft.com) a project that reproduces the problem, I'd appreciate it. You might consider trying Intellisense a bit more. Because we use a variant of our C++ compiler for Intellisense, it has capabilities that are beyond many other editors. It's far from perfect, as you've found, but as far as we are aware, the template support for auto completion is much better than with any other similar tool. -- Jason Shirk VC++ Compiler Team

1 0

Problems with if_then_else_return in boost::lambda library
by Ioffe, Robert 06 Aug '03

06 Aug '03

Hi, If I have a vector of strings vector<string> v; v.push_back("One"); v.push_back("Two"); v.push_back("Three"); v.push_back("Four"); v.push_back("Five"); and define arithmetic action plus like this: namespace boost { namespace lambda { struct plain_return_type_2<arithmetic_action<plus_action>, std::string, std::string> { typedef std::string type; }; } } then the following code works just fine: cout << accumulate(v.begin()+1, v.end(), v.front(), _1 + string(", ") + _2) << endl; and the following also works wonderfully: int i = 1; cout << accumulate(v.begin()+1, v.end(), v.front(), _1 + bind(constructor<string>(), var(i)++, ' ') + _2) << endl; Now, if I want to use if_then_else_return as shown below, it fails miserably, producing a huge error message: cout << accumulate(v.begin(), v.end(), string(), if_then_else_return(_1 == string(), _1, _1 + bind(constructor<string>(), var(i)++, ' ') + _2)) << endl; Now for the questions: What is the proper way to use if_then_else_return? Why do I need to define a separate arithmetic action for strings, even though they are a common library type? Is there a way to say the most intuitive: cout << accumulate(v.begin()+1, v.end(), v.front(), _1 + ", " + _2) << endl; Is there way to do more intuitive: cout << accumulate(v.begin()+1, v.end(), v.front(), _1 + string(i++, ' ') + _2) << endl; Thank you for your help. Robert Ioffe [Non-text portions of this message have been removed]

1 0

prim_minimum_spanning_tree crashes
by Stephan Höfer 06 Aug '03

06 Aug '03

Hello, I try to use prim_minimum_spanning_tree to find rings in subgraphs doing the following: typedef subgraph< adjacency_list<vecS, vecS, undirectedS, VertexProperty, EdgeProperty> > Graph; /... building Graph g with some vertices and edges for(int i=0; i<7; ++i) { add_vertex(g); LAMath::Vec3_f tVec((float)i, (float)(6-i), .0); put(vertex_point_t(), g, i, tVec); } property_map<Graph, edge_weight_t>::type weightmap = get(edge_weight, g); Edge e; bool inserted; tie(e, inserted) = add_edge(0, 1, g); weightmap[e] = 1; tie(e, inserted) = add_edge(1, 2, g); weightmap[e] = 1; tie(e, inserted) = add_edge(2, 3, g); .../ Graph tSubGraph = g.create_subgraph(); add_vertex(1, tSubGraph); add_vertex(3, tSubGraph); add_vertex(4, tSubGraph); add_vertex(6, tSubGraph); std::vector < graph_traits < Graph >::vertex_descriptor > p(num_vertices(tSubGraph)); prim_minimum_spanning_tree(tSubGraph, &p[0]); After having created the graph g, I call the create_subgraph member function to get an induced subgraph of it. Trying to use the prim_minimum_spanning_tree function it crashes in dijkstra_dispatch1 by trying to delete the local variable std::vector<D> distance_map(n). Is there something missing in my code which leads to that crash? It works for the root graph but not for any new created subgraph. Help would be appreciated. Thanks in advance Stephan

4 8

boost and vxWorks?
by Alexander Nasonov 06 Aug '03

06 Aug '03

Does anybody use boost libraries under Vxworks? I'm especially interested in pool and threads libraries. Thankin advance -- Alexander Nasonov Remove minus and all between minus and at from my e-mail for timely response

2 1

How to avoid warning C4275 in MSVC 7.1
by yxh 06 Aug '03

06 Aug '03

Hello, when I build /libs/thread/examples/thread.cpp, I got warning C4275. I think it is because std::logic_error is not defined as dllexport/dllimport. Can anyone tell me how to correct this? TIA.

2 2

A good class to substitute boost.tuple
by Black Ice 06 Aug '03

06 Aug '03

Pls. look the source codde and demo code, you will find a good substitute for boost.tuple. Any suggestions are appreciated. Source code #ifndef _PROPERTYLIST_HEADER_ #define _PROPERTYLIST_HEADER_ namespace pl{ struct NullType { NullType() {} template<typename T> NullType(const T&) {} }; template<typename H, typename T> struct PropertyList { typedef H head_type; typedef T tail_type; typedef PropertyList<head_type, tail_type> my_type; PropertyList() : head_value(head_type()), tail_value(tail_type()) {} template<typename OtherHead, typename OtherTail> PropertyList(const OtherHead & head, const OtherTail & tail) : head_value(head), tail_value(tail) {} PropertyList(const my_type & other) : head_value(other.head_value), tail_value(other.tail_value) {} void swap(my_type & other) { std::swap(head_value, other.head_value); std::swap(tail_value, other.tail_value); } my_type & operator=(const my_type & other) { if(this != &other) { my_type temp(other); swap(temp); } return *this; } head_type head_value; tail_type tail_value; }; #define PROPERTYLIST_1(T1) PropertyList<T1, NullType> template<typename T1> PROPERTYLIST_1(T1) make_list(const T1 & t1) { return PROPERTYLIST_1(T1)(t1, NullType()); } #define PROPERTYLIST_2(T1, T2) PropertyList<T1, PROPERTYLIST_1(T2) > template<typename T1, typename T2> PROPERTYLIST_2(T1, T2) make_list(const T1 & t1, const T2 & t2) { return PROPERTYLIST_2(T1, T2)(t1, make_list(t2)); } #define PROPERTYLIST_3(T1, T2, T3) PropertyList<T1, PROPERTYLIST_2(T2, T3) > template<typename T1, typename T2, typename T3> PROPERTYLIST_3(T1, T2, T3) make_list(const T1 & t1, const T2 & t2, const T3 & t3) { return PROPERTYLIST_3(T1, T2, T3)(t1, make_list(t2, t3)); } #define PROPERTYLIST_4(T1, T2, T3, T4) PropertyList<T1, PROPERTYLIST_3(T2, T3, T4) > template<typename T1, typename T2, typename T3, typename T4> PROPERTYLIST_4(T1, T2, T3, T4) make_list(const T1 & t1, const T2 & t2, const T3 & t3, const T4 & t4) { return PROPERTYLIST_4(T1, T2, T3, T4)(t1, make_list(t2, t3, t4)); } #define PROPERTYLIST_5(T1, T2, T3, T4, T5) PropertyList<T1, PROPERTYLIST_4(T2, T3, T4, T5) > template<typename T1, typename T2, typename T3, typename T4, typename T5> PROPERTYLIST_5(T1, T2, T3, T4, T5) make_list(const T1 & t1, const T2 & t2, const T3 & t3, const T4 & t4, const T5 & t5) { return PROPERTYLIST_5(T1, T2, T3, T4, T5)(t1, make_list(t2, t3, t4, t5)); } #define PROPERTYLIST_6(T1, T2, T3, T4, T5, T6) PropertyList<T1, PROPERTYLIST_5(T2, T3, T4, T5, T6) > template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6> PROPERTYLIST_6(T1, T2, T3, T4, T5, T6) make_list(const T1 & t1, const T2 & t2, const T3 & t3, const T4 & t4, const T5 & t5, const T6 & t6) { return PROPERTYLIST_6(T1, T2, T3, T4, T5, T6)(t1, make_list(t2, t3, t4, t5, t6)); } #define PROPERTYLIST_7(T1, T2, T3, T4, T5, T6, T7) PropertyList<T1, PROPERTYLIST_6(T2, T3, T4, T5, T6, T7) > template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7> PROPERTYLIST_7(T1, T2, T3, T4, T5, T6, T7) make_list(const T1 & t1, const T2 & t2, const T3 & t3, const T4 & t4, const T5 & t5, const T6 & t6, const T7 & t7) { return PROPERTYLIST_7(T1, T2, T3, T4, T5, T6, T7)(t1, make_list(t2, t3, t4, t5, t6, t7)); } #define PROPERTYLIST_8(T1, T2, T3, T4, T5, T6, T7, T8) PropertyList<T1, PROPERTYLIST_7(T2, T3, T4, T5, T6, T7, T8) > template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8> PROPERTYLIST_8(T1, T2, T3, T4, T5, T6, T7, T8) make_list(const T1 & t1, const T2 & t2, const T3 & t3, const T4 & t4, const T5 & t5, const T6 & t6, const T7 & t7, const T8 & t8) { return PROPERTYLIST_8(T1, T2, T3, T4, T5, T6, T7, T8)(t1, make_list(t2, t3, t4, t5, t6, t7, t8)); } #define PROPERTYLIST_9(T1, T2, T3, T4, T5, T6, T7, T8, T9) PropertyList<T1, PROPERTYLIST_8(T2, T3, T4, T5, T6, T7, T8, T9) > template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9> PROPERTYLIST_9(T1, T2, T3, T4, T5, T6, T7, T8, T9) make_list(const T1 & t1, const T2 & t2, const T3 & t3, const T4 & t4, const T5 & t5, const T6 & t6, const T7 & t7, const T8 & t8, const T9 & t9) { return PROPERTYLIST_9(T1, T2, T3, T4, T5, T6, T7, T8, T9)(t1, make_list(t2, t3, t4, t5, t6, t7, t8, t9)); } #define PROPERTYLIST_10(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10) PropertyList<T1, PROPERTYLIST_9(T2, T3, T4, T5, T6, T7, T8, T9, T10) > template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9, typename T10> PROPERTYLIST_10(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10) make_list(const T1 & t1, const T2 & t2, const T3 & t3, const T4 & t4, const T5 & t5, const T6 & t6, const T7 & t7, const T8 & t8, const T9 & t9, const T10 & t10) { return PROPERTYLIST_10(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)(t1, make_list(t2, t3, t4, t5, t6, t7, t8, t9, t10)); } template <class PList> struct Length { enum{value = 1 + Length<PList::tail_type>::value}; }; template <> struct Length<NullType> { enum{value = 0}; }; template<class PList, unsigned int N> struct TypeAt { typedef typename TypeAt<typename PList::tail_type, N-1>::type type; }; template<class PList> struct TypeAt<PList, 0> { typedef typename PList::head_type type; }; template<int N> struct TypeAt<NullType, N> { }; template<> struct TypeAt<NullType, 0> { typedef NullType type; }; template<class PList, class T> struct Append { typedef PropertyList<typename PList::head_type, typename Append< typename PList::tail_type, T>::type> type; }; template<class T> struct Append<NullType, T> { typedef PropertyList<T, NullType> type; }; template<class PList, class T> struct Push { typedef PropertyList<T, PList> type; }; template<class PList> struct Pop { typedef typename PList::tail_type type; }; template<class PList, unsigned int N> struct RemoveAt { typedef PropertyList<typename PList::head_type, typename RemoveAt<typename PList::tail_type, N-1>::type> type; }; template<class PList> struct RemoveAt<PList, 0> { typedef typename PList::tail_type type; }; template<int N> struct RemoveAt<NullType, N> { }; template<> struct RemoveAt<NullType, 0> { }; template<class PList, class T, unsigned int N> struct InsertAt { typedef PropertyList<typename PList::head_type, typename InsertAt<typename PList::tail_type, T, N-1>::type> type; }; template<class PList, class T> struct InsertAt<PList, T, 0> { typedef PropertyList<T, PList> type; }; template<class T, unsigned int N> struct InsertAt<NullType, T, N> { }; template<class T> struct InsertAt<NullType, T, 0> { }; template<class PList, unsigned int N> struct ValueAt { static typename TypeAt<PList, N>::type & get(PList & plist) { typedef typename PList::tail_type tail_type; tail_type & tail = plist.tail_value; return ValueAt<tail_type, N-1>::get(tail); } static const typename TypeAt<PList, N>::type & get(const PList & plist) { typedef const typename PList::tail_type tail_type; tail_type & tail = plist.tail_value; return ValueAt<tail_type, N-1>::get(tail); } }; template<class PList> struct ValueAt<PList, 0> { static typename TypeAt<PList, 0>::type & get(PList & plist) { return plist.head_value; } static const typename TypeAt<PList, 0>::type & get(const PList & plist) { return plist.head_value; } }; template<class PList, template<class> class FunctionClass, typename T = NullType> struct Visitor { static void for_each(PList & plist, T & t) { FunctionClass<typename PList::head_type> f(t); f(plist.head_value); typedef typename PList::tail_type tail_type; Visitor<tail_type, FunctionClass, T>::for_each(plist.tail_value, t); } }; template<class PList, template<class> class FunctionClass> struct Visitor<PList, FunctionClass, NullType> { static void for_each(PList & plist) { FunctionClass<typename PList::head_type>()(plist.head_value); typedef typename PList::tail_type tail_type; Visitor<tail_type, FunctionClass, NullType>::for_each(plist.tail_value); } }; template<template<class> class FunctionClass, typename T> struct Visitor<NullType, FunctionClass, T> { static void for_each(NullType & plist, T &) { } }; template<template<class> class FunctionClass> struct Visitor<NullType, FunctionClass, NullType> { static void for_each(NullType & plist) { } }; } // namespace pl #endif // _PROPERTYLIST_HEADER_ demo code #include <iostream> #include <string> #include <boost/type_traits.hpp> #include <PropertyList.h> #include <utility> using namespace std; using namespace boost; using namespace pl; template<typename T> struct Dump { void operator()(const T & t) { cout << t << endl; } }; template<typename T> struct LoadFromStream { LoadFromStream(long stream) : m_stream(stream) { } void operator()(T & t) { cout << "Load <" << t << "> from stream " << m_stream << endl; } long m_stream; }; template<typename PList> void SaveToStream(long stream, const PList & plist) { cout << "Save <" << plist.head_value << "> to stream " << stream << endl; SaveToStream(stream, plist.tail_value); } template<> void SaveToStream<NullType>(long stream, const NullType &) { } void test(void) { typedef PROPERTYLIST_3(int, long , double) MY_PROPS; BOOST_STATIC_ASSERT( (Length<MY_PROPS>::value == 3) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS, 0>::type, int>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS, 1>::type, long>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS, 2>::type, double>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS, 3>::type, NullType>::value) ); typedef Append<MY_PROPS, float>::type MY_PROPS2; BOOST_STATIC_ASSERT( (Length<MY_PROPS2>::value == 4) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS2, 0>::type, int>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS2, 1>::type, long>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS2, 2>::type, double>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS2, 3>::type, float>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS2, 4>::type, NullType>::value) ); typedef Push<MY_PROPS, char>::type MY_PROPS3; BOOST_STATIC_ASSERT( (Length<MY_PROPS3>::value == 4) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS3, 0>::type, char>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS3, 1>::type, int>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS3, 2>::type, long>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS3, 3>::type, double>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS3, 4>::type, NullType>::value) ); typedef Pop<MY_PROPS>::type MY_PROPS4; BOOST_STATIC_ASSERT( (Length<MY_PROPS4>::value == 2) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS4, 0>::type, long>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS4, 1>::type, double>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS4, 2>::type, NullType>::value) ); typedef RemoveAt<MY_PROPS, 1>::type MY_PROPS5; BOOST_STATIC_ASSERT( (Length<MY_PROPS5>::value == 2) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS5, 0>::type, int>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS5, 1>::type, double>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS5, 2>::type, NullType>::value) ); typedef InsertAt<MY_PROPS, short, 1>::type MY_PROPS6; BOOST_STATIC_ASSERT( (Length<MY_PROPS6>::value == 4) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS6, 0>::type, int>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS6, 1>::type, short>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS6, 2>::type, long>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS6, 3>::type, double>::value) ); BOOST_STATIC_ASSERT( (is_same<TypeAt<MY_PROPS6, 4>::type, NullType>::value) ); typedef Append<MY_PROPS, string>::type MY_PROPS7; MY_PROPS7 props; ValueAt<MY_PROPS7, 0>::get(props) = 1; ValueAt<MY_PROPS7, 1>::get(props) = 2; ValueAt<MY_PROPS7, 2>::get(props) = 3.3; ValueAt<MY_PROPS7, 3>::get(props) = "Hello World"; Visitor<MY_PROPS7, Dump>::for_each(props); long stream = 1; Visitor<MY_PROPS7, LoadFromStream, long>::for_each(props, stream); MY_PROPS7 props2 = make_list(10, 20L, 3.1415, string("Hello World")); SaveToStream(stream, props2); } -- Regards, Black Ice Çë²»Òª»ØžŽµœÎÒµÄÓÊÏä ×ÔÓÉ£šliberty£©ÎÞ·ÇŸÍÊÇÕâÑùÒ»ÖÖ³ÐÅµ£ºÃ¿žöÈËœ«»áµÃµœÒ»ÖÖ±£ÕÏ£¬±£ÕÏÎÒÃÇ¿ÉÒÔÓë ÈšÍþ¡¢¶àÊý¡¢Á÷Ë×Œ°ÓßÂÛµÄÓ°ÏìÏà¿¹ºâ¡£ http://www.leoliu.net

1 0

Subscripting and operator()
by Christopher Dawson 05 Aug '03

05 Aug '03

Hi there, I am wrapping a class with an operator()(int, int) which I'd like to make available in Python as a subscript operator, but haven't been able to find any documentation on this nor guess the appropriate .def Is this possible and if so can anyone help? Regards, Chris.

2 2

Linking with BGL adjacency_list_io.hpp
by Solomon Gibbs 05 Aug '03

05 Aug '03

Hi, I'm having trouble linking code that uses adjacency_list_io.hpp. If the header is included is included in more than one compilation unit, I get "multiple definition of function" errors for the non-template functions in adjacency_list_io.hpp: std::istream& operator >> ( std::istream& in, no_property& ) and void getSubset( no_property& p, const no_property& s ) I'm sure that there is some C+ subtlety that I'm missing here, but I'm not familiar enough with the library to understand what it is. Shouldn't non-template function code be in a .cpp file to keep this sort of thing from happening? - Solomon

3 5

degree_size_type vs integer
by Jérémie Leguay 05 Aug '03

05 Aug '03

Hi! I have a simple question: if I use the in_degree function I have in return a degree_size_type. How it is possible to convert it in integer? /Jérémie ___________________________________________________________ Do You Yahoo!? -- Une adresse @yahoo.fr gratuite et en français ! Yahoo! Mail : http://fr.mail.yahoo.com

2 1

shared_ptr Intellisense
by destinati2001 05 Aug '03

05 Aug '03

Hello, Has anyone been able to get IntelliSense member information for the boost::shared_ptr class? I am using Visual Studio.NET 2003. I have setup the boost directory as a subfolder of my project directory. Moreover, I *am* able to obtain Intellisense information for boost::any, any_cast, get_pointer, make_permuation_iterator, permutation_iterator_generator, permutation_iterator_policies, scoped_ptr, signal, and swap. The fact that scoped_ptr works fine makes me wonder why shared_ptr doesn't work. Any help would be much appreciated! Thanks, Jeff

1 0

boost::tokenizer
by peter 05 Aug '03

05 Aug '03

hi there im trying to tokenize a string where any sort of blank space (' ', or '\t') is a delimiter, and allow having spaces in a token by enclosing it with a single quote (') character... the code below does not work well if i have more than one space characters (' ' or '\t') beside eachother... it simply keeps the token (even though the result is an empty string)... #include <string> #include <vector> #include <boost/tokenizer.hpp> std::vector<std::string> tokenizeStr(const std::string &str) { std::vector<std::string> result; boost::escaped_list_separator<char> sep("", " \t", "'"); boost::tokenizer<boost::escaped_list_separator<char> > tok(str, sep); for(boost::tokenizer<boost::escaped_list_separator<char> >::iterator p=tok.begin(); p!=tok.end(); p++) { result.push_back(static_cast<std::string>(*p)); } return result; } does anyone have any ideas how to make this work without actually going through the list manually and deleting the empty tokens?? by the way, im using boost 1.29 thanks peter

1 1

New Bee Question
by sarwanaggarwal 03 Aug '03

03 Aug '03

Hi: 1. I finally built "lib" for file-system. 2. I copied borland's debug version to a project directory. 3. I am getting a link error from [Linker Fatal Error] Fatal: Expected a file name: Borlannd C++ Builder Version 6.0. 4. I get numerous errors from MSVC++. With little help, I am sure to get started soon. Thanks. Sarwan

1 0

schizophrenic code.
by chris_baus 01 Aug '03

01 Aug '03

Am I only one that is uncomfortable with the following: std::vector<boost::any> mySchizophrenicCollection; Just curious.

1 1

schizophrenic code.
by chris_baus 01 Aug '03

01 Aug '03

The following seems like a battle of wills between two different typing paradigms. std::vector<boost::any> m_schizophrenicCollection; The thought of this is making me a bit uneasy. comments? ~christopher

2 2

Re: [Spirit-general] Problem with Parsing
by Joel de Guzman 01 Aug '03

01 Aug '03

Hi, Have you tried using the Spirit debugger? Cheers, -- Joel de Guzman joel at boost-consulting.com http://www.boost-consulting.com http://spirit.sf.net Surinder Pal Singh <sps22(a)yahoo.com> wrote: > Hi, > I am trying to use Spirit (in the latest Boost 1_30_0) > for a project. I want to parse a file whose structure > is the following: > > section1 { > something; > } > > I am using the file_iterator to iterate on the input > file and then define comment as well as the grammar. I > am at my wits end why my parser keeps failing. (When > this simple grammar works, I want to make the parser > more complex.) My code is attached below. (Note: I > used the example in the distribution c_grammar.cpp as > the starting point for it.) > > Thanks. > > -surinder > I have attempted to join the spirit mail list, but > have not received the confirmation so far, but please > feel free to respond to me at: sps22_at_yahoo_dot_com > > > PS: This input file structure is going to be, of > course, more complicated than the example shown above. > Inside the setions, I would like to pass on flags and > statements to the code. If it is better for me to use > another approach to parse this file structure, please > suggest me. > [snip]

3 4

A Quick Question about Threads
by Paul Grenyer 01 Aug '03

01 Aug '03

Hi All I'm planning on replacing all our (Win32 API Wrapped) threads with the boost threads. I was looking at the thread class interface and there isn't a method to ask if the thread is still running. This is something we use quite a lot in out current wrapper. To get around this I was thinking of using a member variable in the function object that is passed to the thread constructor to indicated whether the thread had finished. Is there a better way? I've not had a really good look at the docs yet, but there doesn't appear to be a Critical Section class. Should I be using the Mutex for synchronisation instead? -- Regards Paul Paul Grenyer Email: pjgrenyer(a)iee.org Web: www.paulgrenyer.co.uk EvaneScence: http://www.evanescence.com

6 15

Graph Library: Ordered Vertex List?
by dmatt001 01 Aug '03

01 Aug '03

Hi Guys, I would like to use an ordered vertex list (ie based on property type) in an implementation that I am working on such that duplication can be avoided. I have read and understand how to implement an ordered edge list thanks to the previous posts but am finding it hard to get started! Perhaps I have missed the key example? It appears that from the way config::VertList is constructed that it may be a similar process in nature? adj_list_impl::add_vertex appears to discard the boolean return value from the associative insertion. Would such a construction allow me to avoid the duplication I seek to avoid? I am guessing so, but some advice would give me a confidence "boost". ( <-- It's a lame pun: I really do need help ;-) ) My first steps are below rehashing the excellent ordered edges example with a simple search/replace and maching my target container base. I'll keep plugging along with it anyway and it may just compile one day. Suggestions/Ideas/Refs/Ptrs are appreciated. Matt --- first guess follows --- template <class VertDesc> struct order_by_name : public std::binary_function<VertDesc,VertDesc,bool> { bool operator()(const VertDesc& v1, const VertDesc& v2) const { // Order by vertex name. return boost::get(boost::vertex_name, v1) < boost::get(boost::vertex_name, v2); } }; #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION struct ordered_set_by_nameS { }; namespace boost { template <class ValueType> struct container_gen<ordered_set_by_nameS, ValueType> { typedef std::set<ValueType, order_by_name<ValueType> > type; }; } #else struct ordered_set_by_nameS { template <class T> struct bind_ { typedef std::multiset<T, order_by_name<T> > type; }; }; namespace boost { template <> struct container_selector<ordered_set_by_nameS> { typedef ordered_set_by_nameS type; }; } #endif

3 3

Compile time Problem with boost::type_traits library
by Amit Bhatia 01 Aug '03

01 Aug '03

Hello, I am trying to use the boost::function library which in turn includes many of the headers from other boost libraries. I am using g++ 3.2 with: g++ -c -g -fwritable-strings -Wno-deprecated -static -ansi -pedantic -DANSI_HEADERS -D_G_HAVE_BOOL as the options. The file is_integral.hpp and the file is_convertible.hpp in the type_traits library contain the declarations of the type long long which the ISO C++ seemingly doesn't accept. The compiler gives the warning: ISO C++ does not support `long long' . I don't think there is a new version of this on boost. I downloaded the boost lib sometime in June Version 1.30.0. Can this problem be because of any of the compiler options that I am using? thanking you, regards, amit.

3 2

Spirit Sequential-or
by Bruno Martínez 01 Aug '03

01 Aug '03

Hi boosters, In operators.html (a || b) is said to be equivalent to (a | b | a >> b), but, if I understand precedence correctly, it should be equivalent to (a >> b | a | b). I'm just learning Spirit, so this may probably be my mistake, right? Cheers, Bruno Martinez ---------------------------------------------------- ATENCION Su servicio de correo tiene antivirus ?? @internet URUGUAY: http://www.internet.com.uy

3 3

FC++ in Boost, Spirit, Preprocessing
by Jan Kybic 31 Jul '03

31 Jul '03

Hello, I want to write in favor of Boostifying the functional library FC++, which I find very useful. Would a merger with the Phoenix library from Spirit (already in Boost) be feasible? Phoenix seems to have a slightly nicer syntax but lacks (as far as I know) the Haskell prelude functions and lazy list implementation, also the closures do not seem very intuitive to me. My main concern with both FC++ and Phoenix is that when defining new functiods, the user needs to write a lot of often repetitive code. This could be simplified using a suitable preprocessor. Would that be acceptable and are there other people interested ? Yours, Jan -- ------------------------------------------------------------------------- Jan Kybic <kybic(a)ieee.org> tel. +420 2 2435 7264 or <kybic(a)fel.cvut.cz>, http://cmp.felk.cvut.cz/~kybic

3 3

date_parsing.hpp.patch
by Tonal 31 Jul '03

31 Jul '03

This is simple refactore and improved date_parsing.hpp begin 666 date_parsing.hpp.patch M*BHJ(&1A=&5?<&%R<VEN9RYH<' N;W)I9PE4:'4(a)075G(#$U(#$Y.C4W.C,X M(#(P,#(-"BTM+2!D871E7W!A<G-I;F<N:'!P"51H=2!*=6P@,S$@,C Z,S$Z M,3(@,C P,PT**BHJ*BHJ*BHJ*BHJ*BHJ#0HJ*BH@,30L,SD@*BHJ*@T*(" - M"B @;F%M97-P86-E(&1A=&5?=&EM92![#0H@( T*(" -"B @(" O+R$@1V5N M97)I8R!F=6YC=&EO;B!T;R!P87)S92!A(&1E;&EM:71E9"!D871E("AE9SH@ M,C P,BTP,BTQ,"D-"B @("!T96UP;&%T93QC;&%S<R!D871E7W1Y<&4^#0H@ M(" @9&%T95]T>7!E#0H@(" @<&%R<V5?9&%T92AC;VYS="!S=&0Z.G-T<FEN M9R8@<RD-"B @("![#0HM(" @("!T>7!E9&5F('1Y<&5N86UE(&1A=&5?='EP M93HZ>65A<E]T>7!E('EE87)?='EP93L-"BT@(" @(&EN="!P;W,@/2 P.PT* M+2 @(" @='EP96YA;64@9&%T95]T>7!E.CIY;61?='EP92!Y;60H>65A<E]T M>7!E.CIM:6XH*2PQ+#$I.PT*(" @(" @8F]O<W0Z.G1O:V5N:7IE<CQB;V]S M=#HZ8VAA<E]D96QI;6ET97)S7W-E<&%R871O<CQC:&%R/B ^('1O:RAS*3L- M"B$@(" @(&9O<BAB;V]S=#HZ=&]K96YI>F5R/#XZ.FET97)A=&]R(&)E9SUT M;VLN8F5G:6XH*3L@8F5G(3UT;VLN96YD*"D[*RMB96<I>PT*(2 @(" @("!I M;G0@:2 ](&)O;W-T.CIL97AI8V%L7V-A<W0\:6YT/B@J8F5G*3L-"B$@(" @ M(" @<W=I=&-H*'!O<RD@>PT*(2 @(" @("!C87-E(# Z('EM9"YY96%R(#T@ M:3L@8G)E86L[#0HA(" @(" @(&-A<V4@,3H@>6UD+FUO;G1H(#T@:3L@8G)E M86L[#0HA(" @(" @(&-A<V4@,CH@>6UD+F1A>2 ](&D[(&)R96%K.PT*(2 @ M(" @("!].PT*(2 @(" @("!P;W,K*SL-"B$@(" @('T-"B$@(" @(')E='5R M;B!D871E7W1Y<&4H>6UD*3L-"B @("!]#0H@( T*(" @("\O(2!'96YE<FEC M(&9U;F-T:6]N('1O('!A<G-E('5N9&5L:6UI=&5D(&1A=&4@*&5G.B R,# R M,#(P,2D-"BTM+2 Q-"PU," M+2TM#0H@( T*("!N86UE<W!A8V4@9&%T95]T M:6UE('L-"B @#0HK(&YA;65S<&%C92!D971A:6P@>PT**R @( T**R @("\O M(2!'96YE<FEC(&9U;F-T:6]N('1O('!A<G-E(&1A=&4-"BL@("!T96UP;&%T M93QC;&%S<R!D871E7W1Y<&4L(&-L87-S('1O:V5N:7IE<CX-"BL@("!D871E M7W1Y<&4-"BL@("!P87)S95]D871E*&-O;G-T('1O:V5N:7IE<B8@=&]K*2 - M"BL@("![#0HK(" @("!T>7!E9&5F('1Y<&5N86UE(&1A=&5?='EP93HZ>65A M<E]T>7!E('EE87)?='EP93L-"BL@(" @('1Y<&5N86UE(&1A=&5?='EP93HZ M>6UD7W1Y<&4@>6UD*'EE87)?='EP93HZ;6EN*"DL(#$L(#$I.PT**R @(" @ M='EP961E9B!T>7!E;F%M92!T;VME;FEZ97(Z.F-O;G-T7VET97)A=&]R(&ET M97)A=&]R.PT**R @(" @:71E<F%T;W(@8F5G(#T@=&]K+F)E9VEN*"DL(&5N M9" ]('1O:RYE;F0H*3L-"BL@(" @(&EF("AB96<@/3T@96YD*0T**R @(" @ M("!R971U<FX@9&%T95]T>7!E*'EM9"D[#0HK(" @("!Y;60N>65A<B ](&)O M;W-T.CIL97AI8V%L7V-A<W0\:6YT/B@J8F5G*3L-"BL@(" @(&EF("@K*V)E M9R ]/2!E;F0I#0HK(" @(" @(')E='5R;B!D871E7W1Y<&4H>6UD*3L-"BL@ M(" @('EM9"YM;VYT:" ](&)O;W-T.CIL97AI8V%L7V-A<W0\:6YT/B@J8F5G M*3L-"BL@(" @(&EF("@K*V)E9R ]/2!E;F0I#0HK(" @(" @(')E='5R;B!D M871E7W1Y<&4H>6UD*3L-"BL@(" @('EM9"YD87D@/2!B;V]S=#HZ;&5X:6-A M;%]C87-T/&EN=#XH*F)E9RD[#0HK(" @("!R971U<FX@9&%T95]T>7!E*'EM M9"D[#0HK(" @?0T**R!]("\O(&YA;65S<&%C92!D971A:6P-"B @#0H@(" @ M+R\A($=E;F5R:6,@9G5N8W1I;VX@=&\@<&%R<V4@82!D96QI;6ET960@9&%T M92 H96<Z(#(P,#(M,#(M,3 I#0H@(" @=&5M<&QA=&4\8VQA<W,@9&%T95]T M>7!E/@T*(" @(&1A=&5?='EP90T*(" @('!A<G-E7V1A=&4H8V]N<W0@<W1D M.CIS=')I;F<F(',I#0H@(" @>PT*(" @(" @8F]O<W0Z.G1O:V5N:7IE<CQB M;V]S=#HZ8VAA<E]D96QI;6ET97)S7W-E<&%R871O<CQC:&%R/B ^('1O:RAS M*3L-"B$@(" @(')E='5R;B!D971A:6PZ.G!A<G-E7V1A=&4\9&%T95]T>7!E M/BAT;VLI.PT*(" @('T-"B @#0H@(" @+R\A($=E;F5R:6,@9G5N8W1I;VX@ M=&\@<&%R<V4@=6YD96QI;6ET960@9&%T92 H96<Z(#(P,#(P,C Q*0T**BHJ M*BHJ*BHJ*BHJ*BHJ#0HJ*BH@-#(L-C,@*BHJ*@T*(" @('!A<G-E7W5N9&5L M:6UI=&5D7V1A=&4H8V]N<W0@<W1D.CIS=')I;F<F(',I#0H@(" @>PT*(" @ M(" @:6YT(&]F9G-E='-;72 ]('LT+#(L,GT[#0HM(" @("!I;G0@<&]S(#T@ M,#L-"BT@(" @('1Y<&5D968@='EP96YA;64@9&%T95]T>7!E.CIY96%R7W1Y M<&4@>65A<E]T>7!E.PT*+2 @(" @='EP96YA;64@9&%T95]T>7!E.CIY;61? M='EP92!Y;60H>65A<E]T>7!E.CIM:6XH*2PQ+#$I.PT*(" @(" @8F]O<W0Z M.F]F9G-E=%]S97!A<F%T;W(@;W-F*&]F9G-E=',L(&]F9G-E=',K,RD[( T* M(" @(" @8F]O<W0Z.G1O:V5N:7IE<CQB;V]S=#HZ;V9F<V5T7W-E<&%R871O M<CX@=&]K*',L(&]S9BD[#0HA(" @("!F;W(H8F]O<W0Z.G1O:V5N:7IE<CQB M;V]S=#HZ;V9F<V5T7W-E<&%R871O<CXZ.FET97)A=&]R('1I/71O:RYB96=I M;B@I.R!T:2$]=&]K+F5N9"@I.RLK=&DI>PT*(2 @(" @("!I;G0@:2 ](&)O M;W-T.CIL97AI8V%L7V-A<W0\:6YT/B@J=&DI.PT*(2 @(" @(" O+R @(" @ M('-T9#HZ8V]U=" \/"!I(#P\('-T9#HZ96YD;#L-"B$@(" @(" @<W=I=&-H M*'!O<RD@>PT*(2 @(" @("!C87-E(# Z('EM9"YY96%R(#T@:3L@8G)E86L[ M#0HA(" @(" @(&-A<V4@,3H@>6UD+FUO;G1H(#T@:3L@8G)E86L[#0HA(" @ M(" @(&-A<V4@,CH@>6UD+F1A>2 ](&D[(&)R96%K.PT*(2 @(" @("!].PT* M(2 @(" @("!P;W,K*SL-"B$@(" @('T@#0HA(" @("!R971U<FX@9&%T95]T M>7!E*'EM9"D[#0H@(" @?0T*(" @( T*(" @( T*+2TM(#4S+#8Q("TM+2T- M"B @("!P87)S95]U;F1E;&EM:71E9%]D871E*&-O;G-T('-T9#HZ<W1R:6YG M)B!S*0T*(" @('L-"B @(" @(&EN="!O9F9S971S6UT@/2![-"PR+#)].PT* M(" @(" @8F]O<W0Z.F]F9G-E=%]S97!A<F%T;W(@;W-F*&]F9G-E=',L(&]F M9G-E=',K,RD[( T*(" @(" @8F]O<W0Z.G1O:V5N:7IE<CQB;V]S=#HZ;V9F M<V5T7W-E<&%R871O<CX@=&]K*',L(&]S9BD[#0HA(" @("!R971U<FX@9&5T M86EL.CIP87)S95]D871E/&1A=&5?='EP93XH=&]K*3L-"B @("!]#0H@(" @ M#0H@(" @#0HJ*BHJ*BHJ*BHJ*BHJ*BH-"BHJ*B V-2PX-B J*BHJ#0H@(" @ M9&%T95]T>7!E#0H@(" @<&%R<V5?9&%T93(H8V]N<W0@<W1D.CIS=')I;F<F M(',I#0H@(" @>PT*+2 @(" @+R]U<VEN9R!N86UE<W!A8V4@8F]O<W0[#0HM M(" @("!I;G0@<&]S(#T@,#L-"BT@(" @('1Y<&5D968@='EP96YA;64@9&%T M95]T>7!E.CIY96%R7W1Y<&4@>65A<E]T>7!E.PT*+2 @(" @='EP96YA;64@ M9&%T95]T>7!E.CIY;61?='EP92!Y;60H>65A<E]T>7!E.CIM:6XH*2PQ+#$I M.PT*(" @(" @8F]O<W0Z.F-H87)?9&5L:6UI=&5R<U]S97!A<F%T;W(\8VAA M<CX@9&5L:6TH(D14(BD[#0H@(" @("!B;V]S=#HZ=&]K96YI>F5R/&)O;W-T M.CIC:&%R7V1E;&EM:71E<G-?<V5P87)A=&]R/&-H87(^(#X@=&]K*',I.PT* M(2 @(" @9F]R*&)O;W-T.CIT;VME;FEZ97(\/CHZ:71E<F%T;W(@8F5G/71O M:RYB96=I;B@I.R!B96<A/71O:RYE;F0H*3LK*V)E9RE[#0HA(" @(" @(&EN M="!I(#T@8F]O<W0Z.FQE>&EC86Q?8V%S=#QI;G0^*"IB96<I.PT*(2 @(" @ M("!S=VET8V@H<&]S*2![#0HA(" @(" @(&-A<V4@,#H@>6UD+GEE87(@/2!I M.R!B<F5A:SL-"B$@(" @(" @8V%S92 Q.B!Y;60N;6]N=&@@/2!I.R!B<F5A M:SL-"B$@(" @(" @8V%S92 R.B!Y;60N9&%Y(#T@:3L@8G)E86L[#0HA(" @ M(" @('T[#0HA(" @(" @('!O<RLK.PT*(2 @(" @?0T*(2 @(" @<F5T=7)N M(&1A=&5?='EP92AY;60I.PT*(" @('T-"B @#0H@( T*+2TM(#8S+#<Q("TM M+2T-"B @("!D871E7W1Y<&4-"B @("!P87)S95]D871E,BAC;VYS="!S=&0Z M.G-T<FEN9R8@<RD-"B @("![#0H@(" @("!B;V]S=#HZ8VAA<E]D96QI;6ET M97)S7W-E<&%R871O<CQC:&%R/B!D96QI;2@B1%0B*3L-"B @(" @(&)O;W-T M.CIT;VME;FEZ97(\8F]O<W0Z.F-H87)?9&5L:6UI=&5R<U]S97!A<F%T;W(\ M8VAA<CX@/B!T;VLH<RD[#0HA(" @("!R971U<FX(a)9&5T86EL.CIP87)S95]D E871E/&1A=&5?='EP93XH=&]K*3L-"B @("!]#0H@( T*(" -"@`` ` end

1 0

Spirit Parsing Problem
by sps22 31 Jul '03

31 Jul '03

Hi, I am trying to use Spirit (in the latest Boost 1_30_0) for a project. I want to parse a file whose structure is the following: section1 { something; } I am using the file_iterator to iterate on the input file and then define comment as well as the grammar. I am at my wits end why my parser keeps failing. (When this simple grammar works, I want to make the parser more complex.) My code is attached below. (Note: I used the example in the distribution c_grammar.cpp as the starting point for it.) Thanks. -surinder PS: This input file structure is going to be, of course, more complicated than the example shown above. Inside the setions, I would like to pass on flags and statements to the code. If it is better for me to use another approach to parse this file structure, please suggest me. #include <iostream> #include <fstream> #include <vector> #include <boost/spirit.hpp> /* Input file for this looks like: file { something; } */ ////////////////////////////////////////////////////////////////////// ///////// // used namespaces using namespace boost::spirit; using namespace std; ////////////////////////////////////////////////////////////////////// ///////// // parsing helper function // Here's our comment rule struct skip_grammar : public grammar<skip_grammar> { template <typename ScannerT> struct definition { definition(skip_grammar const& /*self*/) { skip = space_p | comment_p("//") // C++ comment | comment_p("/*", "*/") // C comment | comment_p("#") // added for correctly ; } rule<ScannerT> skip; rule<ScannerT> const& start() const { return skip; } }; }; ////////////////////////////////////////////////////////////////////// ///////// // typedef typedef char CharT; typedef file_iterator <CharT> IteratorT; typedef scanner <IteratorT> ScannerT; typedef rule <ScannerT> RuleT; template<typename GrammarT> void parse(GrammarT const& g, char const* filename) { ifstream in(filename); if (!in) { cerr << "Could not open input file: " << filename << endl; return; } IteratorT start(filename); if (!start) { cerr << "Could not open the file " << endl; return ; } IteratorT end = start.make_end(); skip_grammar skip; parse_info<IteratorT> result = parse(start, end, g, skip); if (result.full) cerr << filename << " Parses OK" << endl; else { cerr << filename << " Fails Parsing" << endl; for (int i = 0; i < 50; i++) { if (result.stop == end) break; cerr << *result.stop++; } cerr << endl; } } struct c_grammar : public grammar<c_grammar> { template <typename ScannerT> struct definition { definition(c_grammar const& /*self*/) : SEMICOLON(';'), COMMA(','), COLON(':'), ASSIGN('='), LEFT_PAREN('('), RIGHT_PAREN(')') { // C keywords keywords = "file", "physics", "math"; // C operators LEFT_BRACE = chlit<>('{') | strlit<>("<%"); RIGHT_BRACE = chlit<>('}') | strlit<>("%>"); LEFT_BRACKET = chlit<>('[') | strlit<>("<:"); RIGHT_BRACKET = chlit<>(']') | strlit<>(":>"); // Tokens FILE = strlit<>("file"); PHYSICS = strlit<>("physics"); MATH = strlit<>("math"); // string literals STRING_LITERAL_PART = lexeme_d[ !chlit<>('L') >> chlit<>('\"') >> *( strlit<>("\\\"") | anychar_p - chlit<>('\"') ) >> chlit<>('\"') ] ; STRING_LITERAL = +STRING_LITERAL_PART; // Rules file_statement = FILE >> LEFT_BRACE >> *(anychar_p) >> RIGHT_BRACE; // does not work // file_statement = *(anychar_p); // parses OK translation_unit = file_statement; } symbols<> keywords; chlit<> SEMICOLON, COMMA, COLON, ASSIGN, LEFT_PAREN, RIGHT_PAREN; rule<ScannerT> LEFT_BRACE, RIGHT_BRACE, LEFT_BRACKET, RIGHT_BRACKET; rule<ScannerT> FILE, PHYSICS, MATH, STRING_LITERAL, STRING_LITERAL_PART; rule<ScannerT> file_statement, translation_unit; rule<ScannerT> const& start() const { return translation_unit; } }; }; ////////////////////////////////////////////////////////////////////// ///////// // main entrypoint int main(int argc, char* argv[]) { // Start grammar definition cerr << "C Grammar checker implemented with Spirit ..." << endl; // main driver code c_grammar g; if (2 == argc) parse(g, argv[1]); else cerr << "No filename given" << endl; return 0; }

1 0

Re: [Boost-Users] Newbie shared_ptr in a container question.
by Joshua Little 31 Jul '03

31 Jul '03

>From: "Duane Murphy" <duanemurphy(a)mac.com> >Reply-To: Boost-Users(a)yahoogroups.com >To: "Boost Users" <Boost-Users(a)yahoogroups.com> >Subject: Re: [Boost-Users] Newbie shared_ptr in a container question. >Date: Sun, 27 Jul 2003 09:17:48 -0700 > >--- At Sat, 26 Jul 2003 19:57:17 +0000, Joshua wrote: > > >I've been reading through posts on here and in the docs but I think I may > >have missed something. Heres what I am trying to do: > >lets say I have a class Foo* and I'm trying to use it in a > >std::vector<shared_ptr<Foo> >. I can add them all day long and it works > >fine. The problem is that when I try to remove the shared_ptr from the > >vector. I expected it to delete the memory for the Foo* then delete > >itself (to completely free the memory that the shared_ptr used and the > >memory that the Foo was using. I think this is not happening though since > >the destructor is not being called when the elements are removed from the > >vector. Heres how I am currently inserting the shared_ptr's into the > >vector (yes I know this is the wrong way now that I've read a few of the > >posts here): > > > >typedef std::vector<boost::shared_ptr<Foo> > FooVector; > > > >FooVector Foobar; > >Foo* blah = new Foo(); > >boost::shared_ptr<Foo> * NewPointer = new boost::shared_ptr<Foo>(blah); > >Foobar.insert(*NewPointer); //Yes I know this looks horrible. And its > >probably wrong. > > > > > >When I call Foobar.erase() I thought that the shared_ptr would be removed > >and the memory freed (and Foo's destructor called). I tried it like this >: > >FooVector::iterator CurrentFoo = Foobar.begin(); > >Foobar.erase(CurrentFoo); > > > >That did remove the shared_ptr but the Foo* did not seem to get > >deallocated, its destructor was never called. Some of the posts seem to > >indicate that this is a very bad way to let shared_ptr manager the > >memory, is there a better way to do what I want to do using shared_ptr or > >is shared_ptr the wrong tool to use? > >There have been many good suggestions as to what the correct sequence for >inserting the shared_ptr into the vector. I'm not sure the real problem >has been adequately explained. Why isnt the foo* being deleted. > >Shared_ptr<> counts the number of instances of the pointer that are >created. When you did: > >boost::shared_ptr<Foo> * NewPointer = new boost::shared_ptr<Foo>(blah); > >You created the first instance; count == 1. > >When you did: > >Foobar.insert(*NewPointer); //Yes I know this looks horrible. And its > >A copy of the shared_ptr<> was made. The count is now 2. > >When you did: > >Foobar.erase(CurrentFoo); > >One copy (of two) was "deleted". In this sense, the shared_ptr<> was >deleted. The destructor for the shared counter mearly decrements the >counter. Count == 1. > >The problem is that the original count was leaked by using "new >shared_ptr<>". This is why all the suggestions show that you should be >using the stack based method for shared_ptr<>. > >Shared_ptr is almost never allocated from the heap. There really is not >much point. It's use is as a value representation of pointer. > >I hope this helps you understand where your code went astray. > >Good luck, > ...Duane > > > > > ...Duane > Reading many of these replys I now see why what I was doing wasn't working, so I'm going to change my code around and hopefully get this cleared up. Thanks to everyone for your help :) _________________________________________________________________ Add photos to your e-mail with MSN 8. Get 2 months FREE*. http://join.msn.com/?page=features/featuredemail

2 1

Newbie: Way to convert "pointer-to-member-function" to a "pointer-to-function".
by Amit Bhatia 31 Jul '03

31 Jul '03

Hello All!, I am trying to figure out a way of converting "pointer-to-member-function" to a "pointer-to-function" so that I can pass it as a callback function pointer to constructor of some third party class. I know there is NO direct way of doing this in c++. I am further constrained because of the following facts: 1. The fact that I am using a third party class for whose constructor I need to pass pointers to functions having some specific signature. 2. I don't want to be using static declaration for the method that I wish to pass to the third party constructor as a callback function(due to the fact that static methods can access only access static data members). So if I am not mistaken, then, I suppose, that boost function library might be of help in here by somehow using some elegant tricks' to do this task. (There is the fact also that every instance of my class has lot of data which is different and I need access to the data for the method that I wish to pass). Am I right, or am I looking at the wrong place? If I am indeed looking at the wrong place then where will it be best to look for it. I remember some notes on binding in the documentation of the boost function library though. Thanks in advance, regards, amit.

1 0

Detecting None in Boost.Python
by ahakim777 31 Jul '03

31 Jul '03

Hi, This is a Boost.Python question. How do I detect that a Python function has passed a 'None' to a wrapped C++ function? Cheers, Ammar

2 1

filesystem::path & wide char strings?
by Cody Batt 30 Jul '03

30 Jul '03

Hello, I want to use the filesystem::path class for a project I'm working on, but I need to support wide character strings in the path names. I might be missing something, but it seems that path only supports std::string. Is this because of a portability issue or what is the rationale for not using something like basic_string<CharType>? Are there any plans to provide support for wide character strings in the future? Thanks, Cody Batt

2 1

howto map c++ namespaces using boost::python?
by cavok＠filibusta.crema.unimi.it 30 Jul '03

30 Jul '03

hi all, i'm a newbie user of Boost. i need some suggestions to expose c++ namespaces in python. in python i use classes as namespaces, but using class_ construct to build python classes seems to not be applicable to c++ namesapces. moreover, i have a global c++ object which i'd like to map onto python. it is not that clear to me how i can achieve this result. thanks domenico -----[ Domenico Andreoli, aka cavok --[ http://filibusta.crema.unimi.it/~cavok/gpgkey.asc ---[ 3A0F 2F80 F79C 678A 8936 4FEE 0677 9033 A20E BC50

2 1

Boost Bind on MSVC 7.1
by Dale Peakall 30 Jul '03

30 Jul '03

The following example is a very simple, and contrived, example that demonstrates the problem I'm seeing. This fails to compile with 'term does not evaluate to a function taking 1 arguments'. Is this a problem with bind on MSVC 7.1, or have I just forgotton how to use it/what it can do. - Dale. #include <iostream> #include <string> #include <boost/bind.hpp> int my_function(std::string const& value) { return static_cast<int>(value.length()); } int main() { std::string my_string("hello world!"); std::cout << boost::bind<int>(_1, my_string)(my_function); }

2 1

boost.python exception
by newwz2003 29 Jul '03

29 Jul '03

Can I raise exception in C++ module can catch it in python ? or where can I get detailed doc about boost.python? Thank you

2 1

Deferred Function Forwarding
by vivek_arora 29 Jul '03

29 Jul '03

I am looking for pointers on how to use boost to implement a set of template classes/helper functions which can be used for deferred function/method call forwarding. Here's an example of illustrating what I wish to accomplish. I can live with restictions on the function argument types. //Define a template type which can capture arguments of any (or most) functions. I believe boost tuple could suit my requirements. //Define a template helper function save_args which constructs a arguments tuple based on the signature of the function passed as the first argument. e.g . R f(T1, T2, T3); boost:tuple<R, T1, T2, T3> args = save_args(f, t1, t2, t3); //Don't want to explicitly specify types like save_args<R,T1,T2,T3> (t1,t2,t3) //Define another template helper function call_with_args which given another function "g" with a signature conforming with "f" and the argument tuple invokes "g" e.g. R g(T1, T2, T3) //This should call g(args.get<0>, args.get<1>, args.get<2>) call_with_args(g, args); Could someone provide ideas, pointers/sample code for implementing save_args, call_with_args helper template functions. Thanks -Vivek Arora

3 2

Feature Suggestion
by everwicked 29 Jul '03

29 Jul '03

Hello guys, I have just been introduced to the library by some people at Efnet's #c++ and I have to say there is quite a lot of useful work in there. I hope boost makes it into the standard. It's about time to get a feature rich std library. Want I wanted to ask you is to provide a few more functions in library interval. I was comparing boost with blitz++ as the parts I need at the moment are mainly of scientific nature. Anyways, I found boost more to my likeness because it has other features I might want to use later, because it supports more compilers and lastly because it's API is better organised in my opinion. The functions that I find that are missing from library 'interval' are the ones listed here: http://www.oonumerics.org/blitz/manual/blitz03.html#l77 Is there any chance you could implement them in boost? I wouldn't ask but I think that they are not a lot of work. Thanks in advance. Kind regards, George

3 2

boost_date_time: ftime ==>gettimeofday for microsec_clock?
by dick.bridges＠tais.com 28 Jul '03

28 Jul '03

I need a microsec_clock on Windows XP. My first impulse is to define gettimeofday() implemented using ftime(). Should this work ok or am I missing something obvious? TIA

1 0

Newbie - stack overflow in connected components
by Frank H 28 Jul '03

28 Jul '03

Hello: Environment: Windows 2K, MSVC 6 SP5, Boost 1.30.0 I'm new to BGL ( 2 days experience ) and am trying to use the connected components graph. My implementation seems to be OK for my small test case ( 10 verticies) but when I run my "real data" through it ( 15000 verticies) I get a stack overflow error. I note that there is a patch in the sourceforge CVS for the dfs algoritm which implements a non-recursive solution from dgregor that I understand will avoid the stack overflow. I naively downloaded the "depth_first_search.hpp" V1.35 from the CVS and of course it doesn't compile. The question: "How can I apply the patch to fix the stack problem( ie how to determine what and where are the other files I need or do I download the entire current version ( ie tag MAIN)?" Thanks for any help Frank

4 9

RE: [Boost-Users] Newbie missing a header for boost_date_time?
by dick.bridges＠tais.com 28 Jul '03

28 Jul '03

<history> <snip/> > ...which refers to lexical_cast.hpp > > template<typename Target, typename Source> > class lexical_stream > { > bool operator<<(const Source &input) > { > here ===> return stream << input; <==== here > } > } <snip/> I'm starting to think this may be related to the 1_30_0 lexical cast problem. Can you upgrade lexical_cast.hpp from cvs? You can download it from here: http://cvs.sourceforge.net/cgi- bin/viewcvs.cgi/boost/boost/boost/lexical_cast.hpp Jeff </history> I downloaded the head this (Monday) morning and replaced the 1_30_0 version. Compile error disappeared. (Sanity check: copied the 'old' version back and compile error re-appears.) Thanks for the help. That was driving me nuts.

1 0

link problems with precompiled headers and boost libs?
by co_tangens 28 Jul '03

28 Jul '03

Hi, I'm using the datetime library of boost 1_30_0 with VC7.1 with precompiled headers on. We're getting the following link warnings/errors: om.lib(bg_extra.obj) : warning LNK4006: ___@@_PchSym_@00@UwvevolknvmgUtnkEPozhgUhlfixvUytPzwwOlyq@ already defined in om.lib(bg_init.obj); second definition ignored om.lib(bg_extra.obj) : error LNK2005: ___@@_PchSym_@00@UwvevolknvmgUtnkEPozhgUhlfixvUytPzwwOlyq@ already defined in om.lib(bg_init.obj) We include boost headers in our own header files. Our own headerfiles are then used to create a precompiled header. It seems that all object files that use the precompiled header get these link errors... Does anyone know the reason/ a solution for this error? Thanks a lot!

1 1

spirit & tokenizer
by Andrey Sverdlichenko 28 Jul '03

28 Jul '03

Hello. Is there any "right way" to parse strings, already splitted with tokenizer? I wrote iterator that can work with this splitted strings, but i also need some "skip parser" to recognize token boundaries as whitespaces and can't design one. -- Best regards, Andrey mailto:blaze@lists.infosec.ru

4 7

lexical_cast problem with Unicode
by Stefan Felkel 27 Jul '03

27 Jul '03

I have problems compiling the following piece of code under Microsoft Visual C++ 6.0 with UNICODE defined. The compiler complains about a missing operator<<. What can I do in order to get this programme compiled ? #include <iostream> #include <boost/lexical_cast.hpp> int main( int argc, char * argv [] ) { std::wcout << boost::lexical_cast<std::wstring>( std::wstring( L"test" ) ).c_str() << L"\n"; return 0; } c:\programme\boost_1_30_0\boost\lexical_cast.hpp(148): error C2679: binary '<<': no operator defined which takes a right-hand operand of type 'const wstring' (or there is no acceptable conversion) c:\programme\boost_1_30_0\boost\lexical_cast.hpp(146): while compiling class-template member function 'bool boost::detail::lexical_stream<wstring,wstring>::operator <<(const wstring &)' Thanks in advance, Stefan

3 2

Announce: Advanced Los Angeles C++ Users Group
by Jon Stewart 27 Jul '03

27 Jul '03

Hi! A small group of like-minded C++ programmers in Pasadena, CA has been meeting regularly for the past few months. The group's name is ALACPP, for Advanced Los Angeles C++, and we're interested in teaching ourselves more about generic programming and other advanced C++ techniques. Obviously, we're Boost users! We read books together and have weekly lunch meetings to discuss them; we just finished _Modern C++ Design_ and are moving on to Herb Sutter's _Exceptional C++_. We're also organizing periodic evening meetings, to explore specific topics in depth. If you'd like to give a relevant presentation to the group, please contact me! If you're in the Los Angeles area, I invite you to check out the group. Our meager website can be found here: http://www.alacpp.org and you can sign up for our mailing list here: http://lists.ellipsis.cx/mailman/listinfo/alacpp Thanks! Jon -- Jon Stewart stew1(a)ellipsis.cx

3 4

Newbie shared_ptr in a container question.
by Joshua 27 Jul '03

27 Jul '03

I've been reading through posts on here and in the docs but I think I may have missed something. Heres what I am trying to do: lets say I have a class Foo* and I'm trying to use it in a std::vector<shared_ptr<Foo> >. I can add them all day long and it works fine. The problem is that when I try to remove the shared_ptr from the vector. I expected it to delete the memory for the Foo* then delete itself (to completely free the memory that the shared_ptr used and the memory that the Foo was using. I think this is not happening though since the destructor is not being called when the elements are removed from the vector. Heres how I am currently inserting the shared_ptr's into the vector (yes I know this is the wrong way now that I've read a few of the posts here): typedef std::vector<boost::shared_ptr<Foo> > FooVector; FooVector Foobar; Foo* blah = new Foo(); boost::shared_ptr<Foo> * NewPointer = new boost::shared_ptr<Foo>(blah); Foobar.insert(*NewPointer); //Yes I know this looks horrible. And its probably wrong. When I call Foobar.erase() I thought that the shared_ptr would be removed and the memory freed (and Foo's destructor called). I tried it like this : FooVector::iterator CurrentFoo = Foobar.begin(); Foobar.erase(CurrentFoo); That did remove the shared_ptr but the Foo* did not seem to get deallocated, its destructor was never called. Some of the posts seem to indicate that this is a very bad way to let shared_ptr manager the memory, is there a better way to do what I want to do using shared_ptr or is shared_ptr the wrong tool to use?

5 4

Building Thread Tests on Red Hat 9.0
by Paul Grenyer 26 Jul '03

26 Jul '03

Hi All I'm trying the boost threading library for the first time. I've successfully built the threading library itself and now I want to build the tests. I've followed the instructions, but the build seems to hang at this point: execute-test ../../../libs/thread/test/bin/test_once.test/gcc/debug/runtime-link-dynamic/threading-multi/test_once.run Is this normal? I've left it for a few minutes to see if I was just being impatient, but it doesn't continue. Also, I've been looking for some code examples in the documentation on the website, I seem to remember there being some when I looked at potentially using the threads on Windows about 18 months ago, but I can't find them now. Any pointers greatly appreciated. -- Regards Paul Paul Grenyer Email: pjgrenyer(a)iee.org Web: www.paulgrenyer.co.uk EvaneScence: http://www.evanescence.com

1 0

Newbie: boost::filesystem::fstream base class undefined error
by sea2stl 25 Jul '03

25 Jul '03

I am using VC++6 SP5, STLPort 4.5.3, boost 1.30.0. I am tring to use boost::filesystem::fstream objects in conjuction with boost::filesystem::path objects. When I create an ifstream object, the compiler gives the following message: error C2504: 'basic_ifstream<char,class _STL::char_traits<char> >' : base class undefined. Above error takes me to ln 47 in fstream.hpp. Similar problem with ofstream. Any suggestions? Thanks, Aaron Laws

1 0

RE: [Boost-Users] Newbie missing a header for boost_date_time?
by Jeff Garland 25 Jul '03

25 Jul '03

Dick B. wrote: > I'm pretty sure the headers are being found. If I replace posix_time.hpp > with posix_time_types.hpp, the error and many of the warnings disappear. > In other words... Ok. > #include <boost/date_time/gregorian/gregorian.hpp> > //#include <boost/date_time/posix_time/posix_time.hpp> > #include <boost/date_time/posix_time/posix_time_types.hpp> > > avoids the error message. This is because commenting out 'posix_time.hpp' eliminates the I/O code from the library. This is the part that uses lexical_cast which is where the error is occuring. > ...which refers to lexical_cast.hpp > > template<typename Target, typename Source> > class lexical_stream > { > bool operator<<(const Source &input) > { > here ===> return stream << input; <==== here > } > } > > So I assume there's a header somewhere that defines the '<<' operator > referred to. I don't know if this is related to my use of VC7.1 or not. > I'm trying to find someone around here with VC7 to build boost_1_30_0 and > see if that makes a difference. No luck so far. I'm starting to think this may be related to the 1_30_0 lexical cast problem. Can you upgrade lexical_cast.hpp from cvs? You can download it from here: http://cvs.sourceforge.net/cgi- bin/viewcvs.cgi/boost/boost/boost/lexical_cast.hpp Jeff

1 0

Need help with BOOST unit test framework!
by rudugani 25 Jul '03

25 Jul '03

hi, Essentially what I'm trying to do(the code is attached below) , is pass a base class member pointer (member function should automatically be visible in the derived class) , to the BOOST framework. However, since the member function is statically not visible in the derived class, a compile time error is generated . I'm *thinking* that some kind of casting operation is required but not very sure how! could anybody enlighten me as to how to get the code snippet below running? Thanks! CODE: #include <iostream.h> /*-------------------- BOOST FRAMEWORK --------------------- */ #include <test/included/unit_test_framework.hpp> using boost::unit_test_framework::test_suite; class baseTrailTest{ public: baseTrailTest(){}; ~baseTrailTest(){}; protected : void trail(){ cout << " trail!!!! " << endl; } }; class TrailTest: public baseTrailTest{ }; struct trail_test_suite : public test_suite { trail_test_suite() : test_suite("trail_test_suite") { // add member function test cases to a test suite boost::shared_ptr<TrailTest> instance(new TrailTest); add( BOOST_CLASS_TEST_CASE( &TrailTest::trail ,instance ), 0 ); } }; test_suite* init_unit_test_suite( int argc, char * argv[] ) { std::auto_ptr<test_suite> test( BOOST_TEST_SUITE( "example" ) ); /*if( argc < 2 ) return (test_suite*)0;*/ test->add( new trail_test_suite); return test.release(); }

2 1

using the signals lib
by Roel Vanhout 25 Jul '03

25 Jul '03

Hello all, I'm sorry if this is a faq (it almost has to be) but I couldn't find anything in the signals documentation nor in the general build instruction. I've build the signals library using jam as described in the build instructions, I've added the resulting library to my linker list but then I get the errors below about several symbols being multiply defined. I'm using MSVC 7.0 (Visual Studio .Net, not .Net 2003). What do I do wrong? Thanks. cheers, roel ------ Build started: Project: boost_signaltest, Configuration: Debug Win32 ------ Linking... msvcprt.lib(MSVCP70.dll) : error LNK2005: "public: __thiscall std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >(class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const &)" (??0?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@QAE@ABV01@@Z) already defined in boost_signaltest.obj msvcprt.lib(MSVCP70.dll) : error LNK2005: "public: __thiscall std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::~basic_string<char,struct std::char_traits<char>,class std::allocator<char> >(void)" (??1?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@QAE@XZ) already defined in boost_signaltest.obj msvcprt.lib(MSVCP70.dll) : error LNK2005: "public: __thiscall std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >(char const *)" (??0?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@QAE@PBD@Z) already defined in boost_signaltest.obj MSVCRT.lib(MSVCR70.dll) : error LNK2005: "public: __thiscall exception::exception(void)" (??0exception@@QAE@XZ) already defined in LIBCD.lib(stdexcpt.obj) MSVCRT.lib(MSVCR70.dll) : error LNK2005: "public: virtual __thiscall exception::~exception(void)" (??1exception@@UAE@XZ) already defined in LIBCD.lib(stdexcpt.obj) MSVCRT.lib(MSVCR70.dll) : error LNK2005: "public: __thiscall exception::exception(class exception const &)" (??0exception@@QAE@ABV0@@Z) already defined in LIBCD.lib(stdexcpt.obj) MSVCRT.lib(MSVCR70.dll) : error LNK2005: "public: int __thiscall type_info::operator==(class type_info const &)const " (??8type_info@@QBEHABV0@@Z) already defined in LIBCD.lib(typinfo.obj) MSVCRT.lib(ti_inst.obj) : error LNK2005: "private: __thiscall type_info::type_info(class type_info const &)" (??0type_info@@AAE@ABV0@@Z) already defined in LIBCD.lib(typinfo.obj) MSVCRT.lib(ti_inst.obj) : error LNK2005: "private: class type_info & __thiscall type_info::operator=(class type_info const &)" (??4type_info@@AAEAAV0@ABV0@@Z) already defined in LIBCD.lib(typinfo.obj) LINK : warning LNK4098: defaultlib 'MSVCRT' conflicts with use of other libs; use /NODEFAULTLIB:library Debug/boost_signaltest.exe : fatal error LNK1169: one or more multiply defined symbols found Build log was saved at "file://c:\test\boost_signaltest\boost_signaltest\Debug\BuildLog.htm" boost_signaltest - 10 error(s), 1 warning(s) ---------------------- Done ---------------------- Build: 0 succeeded, 1 failed, 0 skipped -- Roel Vanhout - Programmer/Systems Administrator RIKS BV Papenstraat 8 - 6211 LG Maastricht Tel +31 (0)43 388 3708 - Fax +31 (0)43 325 3155

2 1

RE: [Boost-Users] Newbie missing a header for boost_date_time?
by dick.bridges＠tais.com 24 Jul '03

24 Jul '03

<previous> > I must be missing one or more headers but I can't figure it out. Can > someone help get me pointed in the right direction? > ...lots of compiler stuff omitted... My guess is that you don't have the boost root directory in your include path options. This would be the boost\boost_1_30_0 directory.... HTH, Jeff </previous> I'm pretty sure the headers are being found. If I replace posix_time.hpp with posix_time_types.hpp, the error and many of the warnings disappear. In other words... #include <boost/date_time/gregorian/gregorian.hpp> //#include <boost/date_time/posix_time/posix_time.hpp> #include <boost/date_time/posix_time/posix_time_types.hpp> avoids the error message. Changing it back to: #include <boost/date_time/gregorian/gregorian.hpp> #include <boost/date_time/posix_time/posix_time.hpp> //#include <boost/date_time/posix_time/posix_time_types.hpp> results in... <error> c:\boost\boost_1_30_0\boost\lexical_cast.hpp(147) : error C2679: binary ' <<' : no operator found which takes a right-hand operand of type 'const boost::token_iterator_generator<TokenizerFunc,Iterator,Type>::value_type' (or there is no acceptable conversion) with [ TokenizerFunc=boost::char_delimiters_separator<char>, Iterator=std::basic_string<char,std::char_traits<char>,std::allocator<char>>::const_iterator, Type=std::string ] c:\boost\boost_1_30_0\boost\lexical_cast.hpp(146) : while compiling class-template member function 'bool boost::detail::lexical_stream<Target,Source>::operator <<(const Source &)' with [ Target=unsigned short, Source=boost::token_iterator_generator<boost::char_delimiters_separator<char>,std::basic_string<char,std::char_traits<char>,std::allocator<char>>::const_iterator,std::string>::value_type ] c:\boost\boost_1_30_0\boost\lexical_cast.hpp(189) : see reference to class template instantiation 'boost::detail::lexical_stream<Target,Source>' being compiled with [ Target=unsigned short, Source=boost::token_iterator_generator<boost::char_delimiters_separator<char>,std::basic_string<char,std::char_traits<char>,std::allocator<char>>::const_iterator,std::string>::value_type ] c:\boost\boost_1_30_0\boost\date_time\time_parsing.hpp(30) : see reference to function template instantiation 'Target boost::lexical_cast<unsigned short,boost::token_iterator_generator<TokenizerFunc,Iterator,Type>::value_type>(Source)' being compiled with [ Target=unsigned short, TokenizerFunc=boost::char_delimiters_separator<char>, Iterator=std::basic_string<char,std::char_traits<char>,std::allocator<char>>::const_iterator, Type=std::string, Source=boost::token_iterator_generator<boost::char_delimiters_separator<char>,std::basic_string<char,std::char_traits<char>,std::allocator<char>>::const_iterator,std::string>::value_type ] c: \boost\boost_1_30_0\boost\date_time\posix_time\time_parsers.hpp(18) : see reference to function template instantiation 'time_duration boost::date_time::parse_delimited_time_duration<boost::posix_time::time_duration>(const std::string &)' being compiled with [ time_duration=boost::posix_time::time_duration ] </error> ...which refers to lexical_cast.hpp template<typename Target, typename Source> class lexical_stream { bool operator<<(const Source &input) { here ===> return stream << input; <==== here } } So I assume there's a header somewhere that defines the '<<' operator referred to. I don't know if this is related to my use of VC7.1 or not. I'm trying to find someone around here with VC7 to build boost_1_30_0 and see if that makes a difference. No luck so far.

1 0