November 2003 - Boost-users

boost::shared_ptr and stl algorithms
by Bill Eidson 15 Apr '05

15 Apr '05

std::vector< boost::shared_ptr<T> > TVec; I want to write a function object to run std::for_each. to do somework against members of T and accumulate results in functor. My attempts have failed in VC7 with memory errors in my operator() method. struct fo { bool operator()( boost::shared_ptr<T>& t ) { return true; } }; Thanks in advance bille

5 9

Will libraries built on WinNT run on Win98? (MinGW)
by Reed Hedges 31 Mar '05

31 Mar '05

I know that Win98 is not really supported, but is there any chance that libraries (specifically thread and regex) that were build on WinNT using MinGW work on Win98 (in MinGW)? My guess is no, but has anyone tried it? thanks reed

2 1

problem with regex_fwd.hpp
by Stefan Shishkov 29 Dec '03

29 Dec '03

Hi, I had a small problem using boost::regexp on MS VC 6.0, boost 1.30.2. In one of my headers I included regex_fwd.hpp. The compilation failed with: ..\boost-1.30.2\boost/detail/allocator.hpp(215): error C2065: 'assert': undeclared identifier Allocator.hpp does not include <cassert> probably relying that it will be included before it. I solved this problem by including <cassert> before regex_fwd.hpp but may be it is better to change allocator.hpp? Or probably something is wrong with my configuration? Best regards Stefan

2 1

BGL and reversing / moving edges
by joshrose 17 Dec '03

17 Dec '03

G'day, I was hoping someone might be able to tell me if they've run into any situations using BGL where they needed to move (or reverse (i.e. flip the source and target)) an edge within a graph implemented as an adjacency_list. I'm working on an implementation of an algorithm for max. weight bipartite matching ("the assignment problem"), and one of the assumptions in the algorithm is that non-matched edges are directed from one subgraph, A, to the other subgraph, B, and matched edges are directed the other way. Over the course of growing the matching, a simple way to add and remove edges from the candidate set is just to reverse the edge, thus the need for some way to reverse the edge within BGL. I don't think I can just remove and then re-add the edge in the other direction, primarily because doing so will (I believe) invalidate any edge_descriptors referring to that edge. In particular, there are property maps keeping track of the weight of edges, the predecessors of certain nodes, etc. that use edge descriptors as keys. I've spent a fair bit of time reading the documentation and looking through the implementation of adjacency_lists (incl. edge_list_impl), and I'm not really sure of a way to either move an edge directly within a graph, or even to create a new edge from another s.t. they have the same edge_descriptor (in general a bad thing, probably). Anyone have any thoughts on this? Thanks, -Josh

4 10

Boost Software License: redistribute modified works?
by Steve M. Robbins 16 Dec '03

16 Dec '03

Hi, I've a question for the drafters of the Boost Software License - Version 1.0 - August 17th, 2003. Put yourself in the position of someone who wants to redistribute a modified version of Boost. For example, the linux distributors like Debian. The license begins with the permission grant: Permission is hereby granted, free of charge, to any person or organization obtaining a copy of the software and accompanying documentation covered by this license (the "Software") to use, reproduce, display, distribute, execute, and transmit the Software, and to prepare derivative works of the Software, and to permit third-parties to whom the Software is furnished to do so, all subject to the following: [... a restriction and a disclaimer paragraph ...] As I read this, "the Software" means "the unmodified tar or zip file obtained from boost.org". Is that correct? I'm permitted to "prepare derivative works of the Software", but the license doesn't specify what I may do with my derivative works. Clearly, I may distribute "the Software", but may I distribute the derivative work? Some licenses (e.g. the BSD and the GPL) make it clear that the terms apply to both the software and to derivative works. Shouldn't the boost license do likewise? -Steve

2 1

ublas + msvc 7.1
by Witz 01 Dec '03

01 Dec '03

hi, I seem to be having problems with ublas in combination with msvc 7.1. Compiling the code below results in a whole slew of errors of the form: 'use of undefined type 'boost::numeric::SOME_MATRIX_TYPE<ARGS>::const_iterator2' Am i doing something dumb or is something broken? #include <boost/numeric/ublas/triangular.hpp> int main() { using namespace boost::numeric::ublas; triangular_matrix<int,lower> ldm(4,4); } I.M.Whittley

3 2

Vertex descriptors in adjacancy_list
by Ali Tofigh 01 Dec '03

01 Dec '03

Is there any guarantee that Vertex descriptors are some kind of integers? In the examples provided add_edge is called with integers as vertex descriptors. Does the choice of parameters for the adjacency_list graph make a difference on this issue? E.g. whether the we choose vecS or listS as VertexList? If future flexibility of the program being written is a factor (e.g. if we want it to be easy to change the definition of the graphs without necessarily changing other parts of the code) is it better to use add_vertex, followed by add_edge using the vertex descriptors returned by add_vertex? Regards, A. T.

3 4

Re: [Boost-users] Re: ublas + msvc 7.1
by cyril.godart＠bnpparibas.com 01 Dec '03

01 Dec '03

I have noticed something similar with msvc 7.1. Could you try please to locate the first occurence of the error and prefix any template deduced type with "typename". In the example you give: typename boost::numeric::SOME_MATRIX_TYPE<ARGS>::const_iterator2 and check that this precise compile error disappears ? (I have realised the code is boost::ublas'). This does not intend to solve your problem but to point to what vc7.1 is expecting. I am not sure whether that should be strict ISO C++. Regards, Cyril Godart. Internet fuxiaowei9999@hotmail.com@lists.boost.org - 25/11/2003 12:21 Please respond to boost-users(a)lists.boost.org Sent by: boost-users-bounces(a)lists.boost.org To: boost-users cc: Subject: [Boost-users] Re: ublas + msvc 7.1 Hi Whittley: I think this may be a bug in VC7.1. I try it successly under VC6.0 and find that the ublas is develop under VC6.0 with Dinkumware STL in its document. Yours f_x_w ----- Original Message ----- From: "Witz" <witz(a)nildram.co.uk> Newsgroups: gmane.comp.lib.boost.user Sent: Monday, November 24, 2003 9:09 AM Subject: ublas + msvc 7.1 > hi, > > I seem to be having problems with ublas in combination with msvc 7.1. > Compiling the code below results in a whole slew of errors of the form: > > 'use of undefined type > 'boost::numeric::SOME_MATRIX_TYPE<ARGS>::const_iterator2' > > Am i doing something dumb or is something broken? > > #include <boost/numeric/ublas/triangular.hpp> > > int main() > { > using namespace boost::numeric::ublas; > triangular_matrix<int,lower> ldm(4,4); > } > > I.M.Whittley _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users This message and any attachments (the "message") is intended solely for the addressees and is confidential. If you receive this message in error, please delete it and immediately notify the sender. Any use not in accord with its purpose, any dissemination or disclosure, either whole or partial, is prohibited except formal approval. The internet can not guarantee the integrity of this message. BNP PARIBAS (and its subsidiaries) shall (will) not therefore be liable for the message if modified. --------------------------------------------- Ce message et toutes les pieces jointes (ci-apres le "message") sont etablis a l'intention exclusive de ses destinataires et sont confidentiels. Si vous recevez ce message par erreur, merci de le detruire et d'en avertir immediatement l'expediteur. Toute utilisation de ce message non conforme a sa destination, toute diffusion ou toute publication, totale ou partielle, est interdite, sauf autorisation expresse. L'internet ne permettant pas d'assurer l'integrite de ce message, BNP PARIBAS (et ses filiales) decline(nt) toute responsabilite au titre de ce message, dans l'hypothese ou il aurait ete modifie.

2 1

Help! Error in quote.hpp...
by Dan W. 01 Dec '03

01 Dec '03

Hi, first-time poster. Got an automated reply to the effect that my first post would be moderated; but later I got another automated email about the moderator being on vacation; and I'm in a hurry, so I hope it's okay for me to re-post here. I'm using latest betas for Digital Mars, STLport and BOOST, and I'm trying to compile a state-machine using boost's fsm::state_machine. My include line is as follows: G:\boost-1.30.2;G:\boost-1.30.2\boost\mpl;G:\boost-1.30.2\libs\mpl\example\fsm;G:\dm\STLport-5.0-1031\stlport;G:\dm\include Here's the top of my file: ............................................................................... #include <iostream> #include "boost/mpl/list.hpp" #include "state_machine.hpp" namespace mpl = boost::mpl; class rec_frm_sm : fsm::state_machine<rec_frm_sm> { public: ............................................................................... What I get on the output window is: sc rec_frm.cpp -Ae -Aa -r -mn -C -WA -S -3 -a8 -c -gf -IG:\boost-1.30.2 -IG:\boost-1.30.2\boost\mpl -IG:\boost-1.30.2\libs\mpl\example\fsm -IG:\dm\STLport-5.0-1031\stlport -IG:\dm\include -orec_frm.obj Error: G:\boost-1.30.2\boost/mpl/aux_/preprocessed/plain /quote.hpp(7): no type for argument 'T' Error: G:\boost-1.30.2\boost/mpl/aux_/has_type.hpp(23): no type for argument 'T' ..................................... Build failed I'm not sure how to track the include path for quote.hpp and has_type.hpp. I notice there's a link at www.boost.org for tracking header file inclusion, but the link appears to be broken. Any help would be appreciated. Yours. dan

2 1

Re: [Boost-users] Help with function and/or bind libraries
by John.Wismar＠alldata.com 01 Dec '03

01 Dec '03

On Sun, 30 Nov 2003 Douglas Paul Gregor <gregod(a)cs.rpi.edu> wrote: > You can replace the body of get_total with: > > return std::accumulate(myVec.begin(), myVec.end(), 0, > boost::bind(std::plus<int>(), //bind 1 > _1, > boost::bind(&B::stretch_it, //bind 2 > this, > boost::bind(&A::size, //bind 3 > _2)))); > > You can decide whether that's better than the hand-coded loop or not :) >From a maintainability standpoint, I don't think I'll make that switch. ; -) Thanks for the reply, though! (Now I just have to try to figure out what it's doing!) --------------------- John Wismar -- RPI '90 john.wismar(a)alldata.com

1 0