- Boost-users - lists.boost.org

linker problem with boost::thread
by Eske Christiansen 02 Nov '02

02 Nov '02

Hi all I'm new to this list and I have a question. I want to use the thread lib in g++ 2.96.110 under redhat 7.3 I have the test e.x. #include <boost/thread/thread.hpp> #include <iostream> void hello() { std::cout << "Hello world, I'm a thread!" << std::endl; } int main(int argc, char* argv[]) { boost::thread thrd(&hello); thrd.join(); return 0; } (from cuj.com) I try to compile with g++ -lboost_thread foo.cpp I get the the error(s): /tmp/ccdoKT37.o: In function `main': /tmp/ccdoKT37.o(.text+0x53): undefined reference to `boost::thread::thread(boost::function0<void, boost::empty_function_policy, boost::empty_function_mixin, allocator<boost::function_base> > const &)' /tmp/ccdoKT37.o(.text+0x75): undefined reference to `boost::thread::join(void)' /tmp/ccdoKT37.o(.text+0x86): undefined reference to `boost::thread::~thread(void)' /tmp/ccdoKT37.o(.text+0xbe): undefined reference to `boost::thread::~thread(void)' collect2: ld returned 1 exit status What do I do wrong. I don't want to use jam og bjam files because all my works i build by using automake. yours eske

1 0

Basic Overviews Needed
by Sam Gentile 02 Nov '02

02 Nov '02

Hi Folks, I am new to Boost. I have looked at the Boost Documentation on the web (http://www.boost.org/libs/libraries.htm) and although it does a very excellent job of listing all the libraries, it doesn't really have any overview documents or tutorials as such. What I would like is some documents that tell me the power of Boost, what its useful for, etc. Any help would be greatly appreciated. Sam Gentile .NET Consultant ManagedCode(a)attbi.com http://www.samgentile.com http://radio.weblogs.com/0105852/ [Non-text portions of this message have been removed]

4 4

compiler warning
by Matthew Galati 02 Nov '02

02 Nov '02

hi, using gcc version 2.96 20000731 (Red Hat Linux 7.3 2.96-110) does anyone know the pragma for turning this compiler warning off? or is this warning telling me something - do i need to configure my compiler differently? /home/mgalati/source/boost_1_29_0/boost/integer_traits.hpp:186: warning: ISO C++ does not support `long long' thanks, matt

2 1

RE: [Boost-Users] Making boost/test pause so the console can be read when running the tester from an IDE.
by Sean Shubin 02 Nov '02

02 Nov '02

Tried it. The "return test" line completes the creation of the tests, but not their execution. When that breakpoint is reached, the tests have not been run, so there is not output. -----Original Message----- From: Jeff Garland [mailto:jeff@crystalclearsoftware.com] Sent: Friday, November 01, 2002 2:37 PM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] Making boost/test pause so the console can be read when running the tester from an IDE. > My version of C++ builder does not pause to let me see console output. This makes it > difficult to use boost/test while I am running the program from the IDE. The solution > I found most useful, is to make the last test wait for the user to press enter. If > anyone has solved this a different way, I would like to hear about it. Set a breakpoint on return test... HTH, Jeff

2 1

Iterator Adaptor Question
by Hickman, Greg 02 Nov '02

02 Nov '02

The following code illustrates a problem I'm having trying to use iterator_adaptor. Basically, I have a container of shared pointers to mutable, and I'd like to provide a const_iterator to clients that disallows modification of both the shared pointer as well as the pointee. Specifically, I'd like to prevent clients from writing the two lines preceeding the return from main below. Can anyone help? Thanks, Greg #include <boost/iterator_adaptors.hpp> #include <boost/shared_ptr.hpp> #include <vector> using namespace boost; using namespace std; struct Shape { virtual ~Shape() {} virtual void draw() const = 0; virtual void update() = 0; }; struct Concrete_shape : Shape { void draw() const {} void update() {} }; typedef shared_ptr<Shape> Shape_ptr; typedef shared_ptr<const Shape> Const_shape_ptr; struct Picture { typedef vector<Shape_ptr> Shapes; // Declare a const_iterator that converts // to the underlying Shape_ptr to a // Const_shape_ptr. Since the returned // Const_shape_ptr is a temporary, clients // shouldn't be allowed to modify it. typedef iterator_adaptor< Shapes::const_iterator, default_iterator_policies, value_type_is<Const_shape_ptr>, reference_is<const Const_shape_ptr>, iterator_category_is<input_iterator_tag> > const_iterator; const_iterator begin() const { return const_iterator(shapes_.begin()); } Shapes shapes_; }; int main(int argc, char* argv[]) { Picture pic; const Picture& cpic = pic; pic.shapes_.push_back(Shape_ptr(new Concrete_shape)); Picture::const_iterator i = cpic.begin(); // I'd like to prevent clients from writing... i->reset(new Concrete_shape); *i = Const_shape_ptr(new Concrete_shape); return 0; }

1 0

Property Map deep copy
by Björn Lindberg 01 Nov '02

01 Nov '02

I have an external iterator_property_map to an adjacency_list, using std::vector to store std::string as values. I need to copy this map, but a deep copy so that all the strings are unique to the copy. Is there an easy way to do this? I thought about constructing a new property map from a copy of the underlying vector, but this presents two other questions: (i) will the vertex-to-string mappings of the old map still be valid in the constructed copy? (ii) is there a way to extract the underlying vector from the property map? I couldn't find information on this in the online documentation. Björn

1 0

[BGL] How to prune a BFS or exit a BFS
by kweeheong 01 Nov '02

01 Nov '02

I have a custom BFS visitor used to traverse a graph. Is there a built-in way to - prune off a vertex's descendants from the search - exit a BFS These ( pruning and terminating ) are separate situations. I believe the following will work; however, I do not know how to access the relevant data structures. - To prune off a vertex's descendents from the search In the custom BFS visitor's discover_vertex event, set the color of all its adjacent descendants to "black". - To exit a BFS In the custom BFS visitor's discover_vertex event, once the required vertex is found, empty the queue of vertices. How can I access a vertex's color and a BFS's queue? Or is there a better way?

2 2

How to pass result of boost::bind to arg of template function ?
by hugo duncan 01 Nov '02

01 Nov '02

Hi, I want to pass the result of a boost::bind as an argument of a templated function of a class, and am struggling to find a signature that will let me do this. Is this possible? if so what signature should the function have ? Any help much apreciated Hugo #include "boost/function/function1.hpp" #include "boost/bind.hpp" class another_class {}; class my_class { public: typedef another_class ObjectType; //! this works fine passing a boost::function object template <class ReturnType> void add(const boost::function1<ReturnType,ObjectType>& arg) { boost::function1<ReturnType,ObjectType> fn_obj=arg; } //! this should work when passed the result of a boost::bind template <class ReturnType> void add(?what goes here? & arg) { function1<ReturnType,ObjectType> fn_obj(arg); } }; int fn(another_class,int) { return 1; } int main(int, char**) { my_class c; c.add(boost::bind(&fn,_1,1)); }

2 1

[bgl] breadth_first_search for shortest paths (fwd)
by Joel Young 01 Nov '02

01 Nov '02

Dear Jeremy, et al, I am trying to implement a shortest paths algorithm on a directed graph. As I have unit edge weights, I would rather use breadth_first_search rather than dijkstra. // Is this a good candidate for addition? template <class Map, class Tag> struct vertex_marker : public boost::base_visitor<vertex_marker<Map,Tag> > { typedef Tag event_filter; vertex_marker(Map p_map,int p_val) : m_map(p_map),m_val(p_val) { } template <class Vertex, class Graph> void operator()(Vertex v,const Graph&) { boost::put(m_map,v,m_val); } Map m_map; int m_val; }; template <class Map, class Tag> vertex_marker<Map,Tag> mark_vertices(Map p_map, Tag, int p_v) { return vertex_marker<Map,Tag>(p_map,p_v); } boost::breadth_first_search( mygraph, rootnode, boost::visitor(boost::make_bfs_visitor( std::make_pair( boost::record_distances( boost::get(boost::vertex_distance,mygraph), boost::on_tree_edge()) , std::make_pair( mark_vertices( boost::get(boost::vertex_distance,mygraph), boost::on_initialize_vertex(), std::numeric_limits<int>::max()) , mark_vertices( boost::get(boost::vertex_distance,mygraph), boost::on_start_vertex(), 0) ) ) )) ); The problem is that on_start_vertex does not seem to be implemented for breadth_first_search, but it is for depth_first. For dijkstra, the start node seems to be automaticly zeroed. I guess I could mod Am I missing something really obvious here or is there an inconsistency across the algorithms? Shouldn't on_start_vertex be used for all of the graph algorithms? Also, I can't seem to find documentation on neighbor_bfs.hpp Thanks, Joel

2 1

Debug regex++ in VC6
by r_gharavi 31 Oct '02

31 Oct '02

When I build a stand-alone debug xll with regex++ (static linking), Excel refuses to accept it as an addin. It works fine in release mode. Due to reasons beyond my control :-), I am using VC6 STL. Any pointers would be appreciated. Thanks.

1 0