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

Possible boost addition: sub string and const string.
by alexei_novakov 19 Nov '02

19 Nov '02

Hello everyone. I have two classes which I found pretty handy: sub_string (behaves as a mirror of the portion of master basic_string) and const_string (C- string wrapper). Nice thing about these two is they implemented as template specialization of basic_string which has advantages: a) familiar interface; b) possibility to reuse the code written for basic_string (like string streams, lexical casts, etc). Any interest? Regards. Alexei Novakov

1 0

Forte 7 Compiler
by ewanbrock 18 Nov '02

18 Nov '02

Hi, I'm trying to compile Boost using the Solaris Forte 7 Compiler. Initial attempts are leading to all sorts of assertion errors. Has anyone had success using boost with this compiler? Does anyone know what the Config options should be ? Many thanks, Ewan

1 0

[BGL] vc6&7 doesn't support partial specialization,can I still use BGL in vc?
by Jun Zhang 18 Nov '02

18 Nov '02

I can't believe it is vc7!! still missing support for partial specialization. Do you know other method to let vc compile BGL codes used partial specialization? Need your help. Jun Zhang

1 0

adjacency_list going out of memory range?
by Ramón Casero Cañas 18 Nov '02

18 Nov '02

Hi, I'm working with GNU/Linux, Debian Sarge, libboost-graph1.28.0, gcc version 2.95.4 20011002 (Debian prerelease). I'm quite new to this, so I don't know if I'll be able to explain my problem correctly. It seems to me as if when I declare a graph, it writes on memory already used by another data structure. The parts of the code that I consider relevant are (.hpp and .cpp merged) ------------------- | | \|/ ------------------- #include <utility> // for std::pair #include <boost/graph/adjacency_list.hpp>/* for namespace boost * vertex_index_t * edge_weight_t * listS * undirectedS */ using namespace boost; namespace boost { enum vertex_to_be_spanned_t { // used to mark vertices of W vertex_to_be_spanned }; BOOST_INSTALL_PROPERTY(vertex, to_be_spanned); } namespace steiner { typedef std::pair<int,int> Edge; // type of edges /* Steiner Problem Graph: * - multigraph * - add_edge(), ... stability and speed, bad space overhead * - vertex indices, edge weights */ typedef property <vertex_index_t, int, property <vertex_to_be_spanned_t, bool> > VertexProperty; typedef property <edge_weight_t, int> EdgeProperty; typedef adjacency_list <listS, listS, undirectedS, VertexProperty, EdgeProperty > SteinerGraph; } namespace steiner { #define EX_FORMAT "not a valid steiner problem file"; } #include <iostream> // for std::cout #include <fstream> // for std::ifstream using namespace steiner; namespace steiner { int readsteinerORfile(steiner::SteinerGraph& g, char *s); } namespace steiner { inline void skipspaces(std::ifstream& fp, char& c); } namespace steiner { inline int readchar2int(std::ifstream& fp, char& c); } /* int main(int argc, char *argv[]) * -------------------------------- * *argv[] (IN): file names array * -------------------------------- * return n: n files were succesfully read, n > 0 * return 0: no files could be read * return -1: unexpected error * -------------------------------- * read steiner problem from files */ int main(int argc, char *argv[]) { ... SteinerGraph g; nf = steiner::readsteinerORfile(g, argv[i]); ... } /* int readsteinerORfile(VertexListGraph& g, char *s) * -------------------------------- * g (OUT): graph read from file * *s (IN): file name * -------------------------------- * return 1: file successfully read * return 0: file could not be read * return -1: unexpected error * -------------------------------- * read steiner problem from one file */ namespace steiner { int readsteinerORfile(steiner::SteinerGraph& g, char *s) { ... int num_edg=0, num_ver=0, // number of edges, vertices num_verw=0; // number of non-steiner vertices char c; // file reader int i; // counter int x; // temp value int *weight_array=NULL; // edge weights read from file Edge *edge_array=NULL; // array of edges read from file int *w_array=NULL; // vertices of W ... weight_array = new int[num_edg]; if (weight_array == NULL) throw (char *)EX_MEM; edge_array = new Edge[num_edg]; if (edge_array == NULL) throw (char *)EX_MEM; w_array = new int[num_verw]; if (w_array == NULL) throw (char *)EX_MEM; ... *************** HERE ******************* /* creation of graph object */ g.clear(); g = SteinerGraph(num_ver); *************** HERE ******************* ... } } ------------------- | | \|/ ------------------- And what happens? If I print the contents of w_array[] at the first "HERE", I get Puf(W(0)=0 )! Puf(W(1)=1 )! Puf(W(2)=2 )! Puf(W(3)=3 )! but if I print them again at the second "HERE", I get Puf(W(0)=8 )! Puf(W(1)=1 )! Puf(W(2)=2 )! Puf(W(3)=-15 )! Does anybody knows what could be happening? Thank you. Regards, Ramón Casero.

2 2

RE: [Boost-Users] Getting a matrix to the power of n
by Scott Sinclair 17 Nov '02

17 Nov '02

Hi Unless I've missed something, I don't think uBlas provides a way to do this (other than the _very_ inefficient prod(A, A) in a loop). If you need to do this frequently with large matrices and/or large powers (n) then you'll need to look at diagonalizing your matrix using eigenvalue/vector decomposition. This reduces your task to raising the values on the diagonal of a diagonal matrix to the power of n and doing two matrix multiplies and an inverse. Finding the eigenvalues and corresponding eigenvectors of your matrix is a non-trivial task which imposes some restrictions on your matrix. Refer to "Numerical recipes in C" by Press et al. for some guidance as well as any good textbook on linear algebra. Hope this helps, Scott > -----Original Message----- > From: agiatojon [mailto:JonAgiato@nyc.rr.com] > Sent: 14/11/2002 14:17 > To: Boost-Users(a)yahoogroups.com > Subject: [Boost-Users] Getting a matrix to the power of n > > > Hello all, > I am working with a formula which requires me to get the result of a > matrix to the power of n (i.e. pow(matrix, n)) but as expected, the > <cmath> function pow() is unable to convert from type double to > matrix. Does the matrix library have this sort of functionality > built in, or maybe some other part of boost? Thanks! > > Jon Agiato > JonAgiato(a)nyc.rr.com The contents of this email may be confidential. Unauthorised use is prohibited. Umgeni Water does not accept liability for any statements and opinions which are the sender's own view and not expressly made on its behalf.

3 2

Using multi_array/matrix to wrap a SAFEARRAY
by Nick Toze 17 Nov '02

17 Nov '02

Hello, I haven't really used C++ much (more Java and Eiffel), but now I am helping develop a C++ dll that will use matrices alot and will probably need to use SAFEARRAY to interface with Visual Basic (either directly or via COM). Also the group I'm in need to standardize on a matrix representation and it needs to be compatible with NAG. I've been trying to wrap a SAFEARRAY using a multi_array and I've got something that seems to work (see attached), but :-) I'm not sure how to go about passing these (i.e. multi_array, multi_array_ref, const_multi_array_ref) around as function arguments since they don't have any inheritance relationship. Do you have any suggestions on that? Maybe template functions could be used, but I'd like to keep my code fairly simple since I'm no expert. As an alternative the uBLAS container classes look very appropriate since I'll only be passing numbers and some of the algorithms could be useful (although I'll mostly be using NAG), but I couldn't quite see whether it is possible to use a uBLAS matrix as a view onto the data in a SAFEARRAY. Is it possible to attach a pointer to an array to a uBLAS matrix? This is the code I've got as an example for wrapping a SAFEARRAY: typedef boost::multi_array_ref<double, 2> dbl_matrix_ref; typedef boost::multi_array<double, 2> dbl_matrix; __declspec(dllexport) HRESULT __stdcall mmultiply(SAFEARRAY** sa1, SAFEARRAY** sa2, SAFEARRAY** result) { HRESULT hr; if ( result == NULL ) return E_INVALIDARG; if ( (*sa1)->cDims != 2 ) return E_INVALIDARG; if ( (*sa1)->cbElements != 8 ) return E_INVALIDARG; if ( (*sa2)->cDims != 2 ) return E_INVALIDARG; if ( (*sa2)->cbElements != 8 ) return E_INVALIDARG; long m1_dim0_sz, m1_dim1_sz, m2_dim0_sz, m2_dim1_sz; m1_dim0_sz = (*sa1)->rgsabound[0].cElements; m1_dim1_sz = (*sa1)->rgsabound[1].cElements; m2_dim0_sz = (*sa2)->rgsabound[0].cElements; m2_dim1_sz = (*sa2)->rgsabound[1].cElements; hr = SafeArrayLock( *sa1 ); if ( FAILED(hr) ) return hr; hr = SafeArrayLock( *sa2 ); if ( FAILED(hr) ) return hr; dbl_matrix_ref matrix1( (double*)(*sa1)->pvData, boost::extents[m1_dim1_sz][m1_dim0_sz], boost::fortran_storage_order() ); dbl_matrix_ref matrix2( (double*)(*sa2)->pvData, boost::extents[m2_dim1_sz][m2_dim0_sz], boost::fortran_storage_order() ); dbl_matrix matrix_result( boost::extents[matrix1.shape()[0]][matrix2.shape()[1]], boost::fortran_storage_order() ); for (dbl_matrix_ref::index i = 0; i != matrix1.shape()[0]; ++i) { for (dbl_matrix_ref::index j = 0; j != matrix2.shape()[1]; ++j) { double s = 0; for (dbl_matrix_ref::index k = 0; k != matrix1.shape()[1]; ++k) { s = s + matrix1[i][k] * matrix2[k][j]; } matrix_result[i][j] = s; } } SAFEARRAYBOUND rgsabound[2]; rgsabound[0].lLbound = 0; rgsabound[0].cElements = matrix_result.shape()[0]; rgsabound[1].lLbound = 0; rgsabound[1].cElements = matrix_result.shape()[1]; SAFEARRAY* lresult = SafeArrayCreate(VT_R8, 2, rgsabound); lresult->pvData = matrix_result.data(); hr = SafeArrayCopy( lresult, result ); if ( FAILED(hr) ) return hr; hr = SafeArrayDestroy( lresult ); if ( FAILED(hr) ) return hr; hr = SafeArrayUnlock( *sa1 ); if ( FAILED(hr) ) return hr; hr = SafeArrayUnlock( *sa2 ); if ( FAILED(hr) ) return hr; return S_OK; } Then I declare this in VBA with: Declare Function mmultiply Lib _ "D:\multiarray_test\Debug\multiarray_test" _ (a() As Double, b() As Double, c() As Double) As Long

2 1

using 'this' with shared_ptrs
by Stephen Crowley 17 Nov '02

17 Nov '02

How is someone supposed to use 'this' when setting a member of another class to point back to it? Here is an example.. when you run it, this will happen. constructor called 0x804af10 constructor called 0x804af48 destructor called 0x804af48 destructor called 0x804af10 destructor called 0x804af10 The last destructor is called twice! The only way I can think to get around this add a member to the class called "shared_ptr<MyClass> thisptr" which is initialized to "this" in the constructor and over-ride the assignment operator or something.. will that work? ------------------------ #include <boost/shared_ptr.hpp> #include <boost/weak_ptr.hpp> #include <iostream> using namespace std; using namespace boost; class MyClass; typedef shared_ptr<MyClass> MyClassPtr; class MyClass { public: MyClass(); ~MyClass(); MyClassPtr makeCopy(); MyClassPtr original; }; MyClass::MyClass() { cout << "constructor called " << this << endl; } MyClass::~MyClass() { cout << "destructor called " << this << endl; } MyClassPtr MyClass::makeCopy() { MyClassPtr mc(new MyClass); mc->original = MyClassPtr(this); return mc; } main() { MyClassPtr oc(new MyClass); MyClassPtr cc = oc->makeCopy(); // the problem lies here // when cc's reference count is 0 it will be deleted, which will // in turn decrease its 'original' reference count which will be 0, thus // causing it to be deleted as well even though it is still being used by oc! cc.reset(); } ----------------------------------- -- Stephen

2 2

Date_time library question...
by shaneforbes 16 Nov '02

16 Nov '02

With the following line in my Microsoft Vc7 program: std::cout << to_simple_string(d) << std::endl; I get the following linker errors: error LNK2005: "public: __thiscall std::locale::id::id(unsigned int)" (??0id@locale@std@@QAE@I@Z) already defined in stdafx.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) 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) Clearly I am missing something important! I did put #define DATE_TIME_INLINE in my stdafx.h file and that allowed me to create dates (date d(...)) but clearly something else is needed (for IO related stuff?)... Do I have to for instance recreate the libboost_date_time.lib file with different settings? I just used 'bjam "-sTOOLS=vc7" "- sBUILD=debug release"'. Any help appreciated. Thanks to Jeff Garland and the rest of the Boost group for creating this library - I would really like to use it in my programs from now on but why won't the silly linker oblige!

2 8

Codewarrior 8 and Include Paths
by Roland Weiss 15 Nov '02

15 Nov '02

Hello, I'm trying to compile some simple test programs that use Boost Header libraries (no building required), like any, shared_ptr etc. Using CW8, I have a strange problem. When I add the Boost root to the access path, the compiler finds the according boost headers, but inside the config header the Boost lib looks up some headers using this syntax: #include <user.hpp> and so on. CW8 then fails to find these headers. If I change <user.hpp> to "user.hpp" all works fine (but it fails on the next header in angle brackets). Any help appreciated. Roland

2 2

uBlass outer_product
by Olaf Petzold 15 Nov '02

15 Nov '02

Hi, I can't get the following snipped from the doc examples to work: #include <iostream> #include <boost/numeric/ublas/vector.hpp> #include <boost/numeric/ublas/io.hpp> int main () { using namespace boost::numeric::ublas; vector<double> v1 (3), v2 (3); for (int i = 0; i < std::min (v1.size (), v2.size ()); ++ i) v1 (i) = v2 (i) = i; std::cout << outer_prod (v1, v2) << std::endl; } ublas_cross.cc: In function `int main()': ublas_cross.cc:17: `outer_prod' undeclared (first use this function) ublas_cross.cc:17: (Each undeclared identifier is reported only once for each function it appears in.) What's wrong here? Thanks Olaf

2 1

RE: [Boost-Users] using 'this' with shared_ptrs
by Per Kristensen 15 Nov '02

15 Nov '02

You initialises two shared_ptr with the same raw pointer. As a consequent the destructor is called twice, as you will have two different shared_count object which will calls delete as the count become zero. Try to use weak_ptr as a member: ----------------------------------- typedef shared_ptr<MyClass> MyClassPtr; class MyClass { public: MyClass(); ~MyClass(); void setOriginal(MyClassPtr); MyClassPtr makeCopy(); weak_ptr<MyClass> original; }; MyClass::MyClass() { cout << "constructor called " << this << endl; } MyClass::~MyClass() { cout << "destructor called " << this << endl; } void MyClass::setOriginal(MyClassPtr p) { original = p; } MyClassPtr MyClass::makeCopy() { return MyClassPtr(original); } main() { MyClassPtr oc(new MyClass); oc->setOriginal(oc); MyClassPtr cc = oc->makeCopy(); } --------------------------------- Per -----Original Message----- From: Stephen Crowley [mailto:stephenc@digitalpassage.com] Sent: 15. november 2002 05:37 To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] using 'this' with shared_ptrs How is someone supposed to use 'this' when setting a member of another class to point back to it? Here is an example.. when you run it, this will happen. constructor called 0x804af10 constructor called 0x804af48 destructor called 0x804af48 destructor called 0x804af10 destructor called 0x804af10 The last destructor is called twice! The only way I can think to get around this add a member to the class called "shared_ptr<MyClass> thisptr" which is initialized to "this" in the constructor and over-ride the assignment operator or something.. will that work? ------------------------ #include <boost/shared_ptr.hpp> #include <boost/weak_ptr.hpp> #include <iostream> using namespace std; using namespace boost; class MyClass; typedef shared_ptr<MyClass> MyClassPtr; class MyClass { public: MyClass(); ~MyClass(); MyClassPtr makeCopy(); MyClassPtr original; }; MyClass::MyClass() { cout << "constructor called " << this << endl; } MyClass::~MyClass() { cout << "destructor called " << this << endl; } MyClassPtr MyClass::makeCopy() { MyClassPtr mc(new MyClass); mc->original = MyClassPtr(this); return mc; } main() { MyClassPtr oc(new MyClass); MyClassPtr cc = oc->makeCopy(); // the problem lies here // when cc's reference count is 0 it will be deleted, which will // in turn decrease its 'original' reference count which will be 0, thus // causing it to be deleted as well even though it is still being used by oc! cc.reset(); } ----------------------------------- -- Stephen Info: < http://www.boost.org> Wiki: < http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service <http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed]

1 0

graph question : cycle detection - undirected graph
by Matthew Galati 15 Nov '02

15 Nov '02

Can DFS be used to detect cycles in an undirected graph? Using the code in the example file_dependencies.cpp on an undirected graph - it detects cycles even though there is none. Do we have to do more than simply look for back edges for an undirected graph? or should I convert it to directed then use this function? Thanks, Matt -- Matthew Galati ISE Lehigh University IBM Service Parts Solutions 610.758.4042 (Office) 610.882.0779 (Home) magh(a)lehigh.edu, magal11(a)us.ibm.com http://sagan.ie.lehigh.edu/mgalati/

2 1

Getting a matrix to the -1 power
by agiatojon 14 Nov '02

14 Nov '02

Hello all, I am trying to evaluate a matrix to the -1 power but have not been able to find a quick and dirty solution. Any suggestions? Thanks! Jon Agiato JonAgiato(a)nyc.rr.com

1 0

Preprocessor lib problems on Solaris (Forte compiler)
by Robert A. Reece 14 Nov '02

14 Nov '02

I'm using Forte 6 update 2 to compile my code. The preprocessor headers seem to have problems with all the various macros that get defined. These are the errors I'm seeing from compiling libs/preprocessor/test/list.cpp (using command CC -I../../.. list.cpp): /hades03/pegstage/boost/boost_1_29_0/libs/preprocessor/test> /../.. list.cpp < "list.cpp", line 24: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 24: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 24: Error: BOOST_PP_LIST_FOLD_LEFT_129 is not defined. "list.cpp", line 24: Error: BOOST_PP_NIL is not defined. "list.cpp", line 24: Error: BOOST_PP_TUPLE_EAT_3 is not defined. "list.cpp", line 24: Error: Badly formed expression. "list.cpp", line 25: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 25: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 25: Error: BOOST_PP_LIST_FOLD_LEFT_129 is not defined. "list.cpp", line 25: Error: BOOST_PP_NIL is not defined. "list.cpp", line 25: Error: BOOST_PP_TUPLE_EAT_3 is not defined. "list.cpp", line 25: Error: Badly formed expression. "list.cpp", line 26: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 26: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 26: Error: BOOST_PP_LIST_FOLD_LEFT_129 is not defined. "list.cpp", line 26: Error: BOOST_PP_NIL is not defined. "list.cpp", line 26: Error: BOOST_PP_TUPLE_EAT_3 is not defined. "list.cpp", line 26: Error: Badly formed expression. "list.cpp", line 28: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 28: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 28: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 28: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 28: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 28: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 28: Error: BOOST_PP_LIST_FOLD_LEFT_129 is not defined. "list.cpp", line 28: Error: BOOST_PP_NIL is not defined. "list.cpp", line 28: Error: BOOST_PP_TUPLE_EAT_3 is not defined. "list.cpp", line 28: Error: Badly formed expression. "list.cpp", line 30: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 30: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 30: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 30: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 30: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 30: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 30: Error: BOOST_PP_LIST_FOLD_LEFT_129 is not defined. "list.cpp", line 30: Error: BOOST_PP_NIL is not defined. "list.cpp", line 30: Error: BOOST_PP_TUPLE_EAT_3 is not defined. "list.cpp", line 30: Error: Badly formed expression. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Error: BOOST_PP_LIST_FOLD_LEFT_129 is not defined. "list.cpp", line 31: Error: BOOST_PP_NIL is not defined. "list.cpp", line 31: Error: BOOST_PP_TUPLE_EAT_3 is not defined. "list.cpp", line 31: Error: Badly formed expression. "list.cpp", line 33: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 33: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 33: Error: BOOST_PP_LIST_FIRST_I is not defined. Compilation aborted, too many Error messages. Any thoughts would be great. -Rob

4 6

RE: [Boost-Users] A strange question-)
by Aleksey Gurtovoy 14 Nov '02

14 Nov '02

Sam Gentile wrote: > I'm sorry, no I still don't understand. Could you please say more? Well, it would help me if you've said what exact points in my answer you are having troubles with :). Aleksey > > -----Original Message----- > From: Aleksey Gurtovoy [mailto:alexy@meta-comm.com] > Sent: Wednesday, November 13, 2002 3:19 AM > To: 'Boost-Users(a)yahoogroups.com' > Subject: RE: [Boost-Users] A strange question-) > > > > Sam Gentile wrote: > > I went there and indeed it can't get any simpler - at least > > in theory-) > > Read the document > > C:\Boost\boost_1_29_0\libs\type_traits\c++_type_traits.htm > > and its quite > > simple: > > > > template <typename T> > > struct is_void > > { static const bool value = false; }; > > > > template <> > > struct is_void<void> > > { static const bool value = true; }; > > > > That's exactly what I want to show. So I go to the header files and > > instead: > > > > //* is a type T void - is_void<T> > > > > BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_void,T,false) > > > > BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_void,void,true) > > > > > > > > Huh? So I look in bool_trait_def.hpp: > > > > #define BOOST_TT_AUX_BOOL_TRAIT_DEF1(trait,T,C) \ > > > > template< typename T > struct trait \ > > > > : mpl::bool_c< C > \ > > > > { \ > > > > BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ > > > > BOOST_MPL_AUX_LAMBDA_SUPPORT(1,trait,(T)) \ > > > > }; \ > > > Well, the original code doesn't have all these excessive newlines ;), > but > yes, basically that's how it's implemented. > > > Argh! Why is it done like this? This makes it much more > > complicated and unreadable than it has to be. Why are macros > > being used everywhere? > > Practical engineering matters. If you consider that the fact > that there > are > ~60 trait templates in the library and every time when a new > version of > a > compiler comes out, or when somebody starts porting the > library to a new > platform, there is a chance that you need to change half of those > definitions, from, for instance, > > template <typename T> > struct is_void > : mpl::bool_c<false> > { > }; > > to > > template <typename T> > struct is_void > { > BOOST_STATIC_CONSTANT(bool, value = false); > typedef mpl::bool_c<value> type; > }; > > it might all make sense, after all :). Something along the > lines of both > of > the above scenarios has actually happened, a couple of times. It's not > the > whole picture yet, but IMO it's enough of the motivation already, so I > won't > go too deep into details :). > > Hope this answers your question, > Aleksey > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to the Yahoo! > <http://docs.yahoo.com/info/terms/> Terms of Service. > > > > [Non-text portions of this message have been removed] > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > 4 DVDs Free +s&p Join Now > http://us.click.yahoo.com/pt6YBB/NXiEAA/ASSHAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

4 4

RE: [Boost-Users] A strange question-)
by Jim.Hyslop 14 Nov '02

14 Nov '02

Sam Gentile [mailto:ManagedCode@attbi.com] wrote: > Well at least you gave somewhat of an answer. I still want to > understand > how those particular macros give that portability. I haven't looked at the macros in question, but one approach to portability is to separate the macro definitions into platform-specific files. Exactly which file gets included depends on the compiler settings. For example: // file: compilerX/defines.h [omitting include guards for brevity #define DO_SOMETHING(x) CallCompilerXFn( x ) // end file // file: compilerY/defines.h #define DO_SOMETHING(x) compiler_y_function( x ) // end file // file: some Boost header #include "defines.h" class someClass { void f(T a) { DO_SOMETHING( a ); } }; Exactly _which_ "defines.h" gets included is controlled by the build settings, which are determined by the platform. The alternative is a really ugly set of #ifdefs: // file: some Boost header class someClass { void f(T a) { #ifdef COMPILER_X CallCompilerXFn( a ); #elif defined(COMPILER_Y) compiler_y_function( a ); [... etc. for each platform supported #endif } }; As I said, that's _one_ approach - Boost uses something slightly different. Have a look at config.hpp to see its approach. -- Jim

1 0

RE: [Boost-Users] A strange question-)
by Tom Matelich 14 Nov '02

14 Nov '02

Can't say for sure if it'll be helpful, but you might trace the file's evolution using the web interface to cvs on sourceforge. > -----Original Message----- > From: Sam Gentile [mailto:ManagedCode@attbi.com] > Sent: Thursday, November 14, 2002 10:28 AM > To: Boost-Users(a)yahoogroups.com > Subject: RE: [Boost-Users] A strange question-) > > > You're right of course. I do realize that everyone works on this in > their "free time," and what has been accomplished has been > astounding to > say the least. I'm sorry for my rant and I'll re-look at his reply and > try to figure it out. Once again, I apologize. > > ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

1 0

RE: [Boost-Users] A strange question-)
by Garriss, Michael 14 Nov '02

14 Nov '02

No problem. We all know how frustrating C++ can be sometimes :) . You're right, what they have done is astounding! -Mike -----Original Message----- From: Sam Gentile [mailto:ManagedCode@attbi.com] Sent: Thursday, November 14, 2002 11:28 AM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] A strange question-) You're right of course. I do realize that everyone works on this in their "free time," and what has been accomplished has been astounding to say the least. I'm sorry for my rant and I'll re-look at his reply and try to figure it out. Once again, I apologize. Sam Gentile .NET Consultant ManagedCode(a)nospam.attbi.com http://www.samgentile.com http://radio.weblogs.com/0105852/ -----Original Message----- From: Garriss, Michael [mailto:michael.garriss@abacus-direct.com] Sent: Thursday, November 14, 2002 12:57 PM To: 'Boost-Users(a)yahoogroups.com' Subject: RE: [Boost-Users] A strange question-) Keep in mind that Aleksey doesn't get paid for this and he answered your mail on his "free" time. Cut him some slack! I thought his answers for well written. -Mike Garriss -----Original Message----- From: Sam Gentile [mailto:ManagedCode@attbi.com] Sent: Thursday, November 14, 2002 9:29 AM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] A strange question-) Well at least you gave somewhat of an answer. I still want to understand how those particular macros give that portability. Sam Gentile .NET Consultant ManagedCode(a)nospam.attbi.com http://www.samgentile.com http://radio.weblogs.com/0105852/ -----Original Message----- From: Jeff Garland [mailto:jeff@crystalclearsoftware.com] Sent: Thursday, November 14, 2002 11:13 AM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] A strange question-) > <rant> > > How positively delightful to wait 24 hours and get a non-response like > this. This is like pulling blood out of a stone. At this point, I'll Sorry for your frustrations, but imagine the frustration of the library author after yet another bizarre compiler error on perfectly standard C++. Anyway, I think the answer was in the previous mail: Portability. In an ideal world most of this sort of macro hackery wouldn't exist. Unfortunately, boost exists in the real world... > just forget it and use something else. I do understand that Boost users > tend to be extremely advanced C++ users. For the record, I have been > programming in C++ for well over 10 years and still get confused at > some of the things you do. I am questioning and not understanding your > approach at all. Why? Well, lets look at Stroustrup, 3rd edition page > 160 "Macros are important in C, but have far fewer uses in C++. The > first rule about macros is: Don't use them if you don't have to. Almost > every macro demonstrates a flaw in the program, or the programmer." > Then "avoid macros." Now, I'm sure I'm missing your good reason but there you > go. To me, macros are an ugly legacy from C and render C++ code > unreadable and maintainable. So, how detailed does my question have to > be? I don't understand the whole approach and why it was taken. Is that > clear enough? This viewpoint is just fine if you are creating a library for one platform and compiler. The reality of the current world is that many supposedly standard features of C++ or parts of the standard library are not correct on many of the most common compilers. As a result, if you write a library 'to the standard' it might not get used much since it won't compile or work correctly for most people. In addition, many boost libraries push compilers to the limits and thus for some boost libraries the situation is even more severe. The result is that many boost libraries use various macro techniques to create portable code. Looking ahead a few years most of this will hopefully disappear. HTH, Jeff Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service. Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! <http://docs.yahoo.com/info/terms/> Terms of Service. [Non-text portions of this message have been removed] Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.

1 0

RE: [Boost-Users] A strange question-)
by Garriss, Michael 14 Nov '02

14 Nov '02

Keep in mind that Aleksey doesn't get paid for this and he answered your mail on his "free" time. Cut him some slack! I thought his answers for well written. -Mike Garriss -----Original Message----- From: Sam Gentile [mailto:ManagedCode@attbi.com] Sent: Thursday, November 14, 2002 9:29 AM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] A strange question-) Well at least you gave somewhat of an answer. I still want to understand how those particular macros give that portability. Sam Gentile .NET Consultant ManagedCode(a)nospam.attbi.com http://www.samgentile.com http://radio.weblogs.com/0105852/ -----Original Message----- From: Jeff Garland [mailto:jeff@crystalclearsoftware.com] Sent: Thursday, November 14, 2002 11:13 AM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] A strange question-) > <rant> > > How positively delightful to wait 24 hours and get a non-response like > this. This is like pulling blood out of a stone. At this point, I'll Sorry for your frustrations, but imagine the frustration of the library author after yet another bizarre compiler error on perfectly standard C++. Anyway, I think the answer was in the previous mail: Portability. In an ideal world most of this sort of macro hackery wouldn't exist. Unfortunately, boost exists in the real world... > just forget it and use something else. I do understand that Boost users > tend to be extremely advanced C++ users. For the record, I have been > programming in C++ for well over 10 years and still get confused at > some of the things you do. I am questioning and not understanding your > approach at all. Why? Well, lets look at Stroustrup, 3rd edition page > 160 "Macros are important in C, but have far fewer uses in C++. The > first rule about macros is: Don't use them if you don't have to. Almost > every macro demonstrates a flaw in the program, or the programmer." > Then "avoid macros." Now, I'm sure I'm missing your good reason but there you > go. To me, macros are an ugly legacy from C and render C++ code > unreadable and maintainable. So, how detailed does my question have to > be? I don't understand the whole approach and why it was taken. Is that > clear enough? This viewpoint is just fine if you are creating a library for one platform and compiler. The reality of the current world is that many supposedly standard features of C++ or parts of the standard library are not correct on many of the most common compilers. As a result, if you write a library 'to the standard' it might not get used much since it won't compile or work correctly for most people. In addition, many boost libraries push compilers to the limits and thus for some boost libraries the situation is even more severe. The result is that many boost libraries use various macro techniques to create portable code. Looking ahead a few years most of this will hopefully disappear. HTH, Jeff Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.

2 1

max, min, VC++6 and 7
by soulofsealion 14 Nov '02

14 Nov '02

Could someone provide me a brief explanation as to why max and min are redefined in \boost\config\suffix.hpp and \boost\config\platform\win32.hpp. It appears that the reason is that the max and min macros defined in windef.h are not type safe. Also, in user application code, would it be recommended to always use the _MAX and _MIN macros in VC++ 6 and 7 so that the STL implementations are always used, and just reserve explicit max and min for the Boost library code?

1 0

Re: Is MTL alive?
by Paul C. Leopardi 14 Nov '02

14 Nov '02

Alexei, See this thread on the MTL-devel mailing list archive: http://www.osl.iu.edu/MailArchives/mtl-devel/msg00435.php As you can see from the mailing list and the download area, there has not been much developer activity since September. There is also an MTL 3 prototype called MXTL at: http://www.mpi.nd.edu/~jsiek/mxtl.html See http://www.osl.iu.edu/MailArchives/mtl-devel/msg00373.php and http://lists.boost.org/MailArchives/boost/msg10435.php Best regards

1 0

Help with boost::function and boost::bind
by electricsnark 14 Nov '02

14 Nov '02

I need to make a registry of callback functions, which are in the form of member functions of objects of various types. ----------- code snippet ----------- class T1 { public: void CallBackFcn(); }; ... class Registry { public: template <typename T> void registerFcn (void (T::*updFcn)(), T* obj ); private: vector< boost::function<void>* > fcnvec; }; template <typename T> void Registry::registerFcn(void (T::*updFcn)(), T* obj) { boost::function<void> *fp = new boost::function<void> ( boost::bind(updFcn,obj) ); fcnvec.push_back( fp ); } main() { .... T1 *pt = new T1; p_Registry->registerFcn(&T1::CallBackFcn, pt); } ----------------------------------------------------- However, before adding the boost::function to the vector, I want to make sure that the callback function isn't already in there. Unfortunately, I can't just look at value of the pointer fp - I need to get to the address of the actual callback function that is to be executed. But I can't figure out how to get there. Any help appreciated.

2 1

Getting a matrix to the power of n
by agiatojon 14 Nov '02

14 Nov '02

Hello all, I am working with a formula which requires me to get the result of a matrix to the power of n (i.e. pow(matrix, n)) but as expected, the <cmath> function pow() is unable to convert from type double to matrix. Does the matrix library have this sort of functionality built in, or maybe some other part of boost? Thanks! Jon Agiato JonAgiato(a)nyc.rr.com

1 0

Problem with matrix_expressions
by agiatojon 14 Nov '02

14 Nov '02

Hello all, I am trying to compile the following code snippet from the documentation of matrix_expressions in which two matrices are used to display the use of addition and subtraction operations. I am not really sure how to post the error messages as there are literally hundreds of them, so here is the code as I am am pretty sure this is going to be one of those well known bugs kind of things. Compiled using VS.NET, debug mode. #include <iostream> #include <boost/numeric/ublas/matrix_expression.hpp> int main() { using namespace boost::numeric::ublas; matrix<double> m1(3, 3), m2(3, 3); for(int i = 0; i < std::min(m1.size1(), m2.size1()); ++i) for(int j = 0; j < std::min(m1.size2(), m2.size2()); ++j) m1(i, j) = m2(i, j) = 3 * i + j; std::cout << m1 + m2 << std::endl; std::cout << m1 - m2 << std::endl; std::cin.get(); return EXIT_SUCCESS; } Thanks! Jon Agiato JonAgiato(a)nyc.rr.com

3 2

ublas/config.hpp compliation error
by Michael Pagels 14 Nov '02

14 Nov '02

This is my first attempt at using ublas, here's the problem -- g++ -DHAVE_CONFIG_H -I. -I.. -I../sg -I../shared -I../include -O2 -g -c Linearity.C -o Linearity.o In file included from ../include/boost/numeric/ublas/matrix.hpp:20, from Linearity.C:16: ../include/boost/numeric/ublas/config.hpp:375: parse error before `,' token ../include/boost/numeric/ublas/config.hpp:381: parse error before `,' token ../include/boost/numeric/ublas/config.hpp:387: parse error before `,' token ../include/boost/numeric/ublas/config.hpp:401: too many template parameter lists in declaration of `typename V::size_type boost::numeric::ublas::num_elements(const V&)' ../include/boost/numeric/ublas/config.hpp:401: syntax error before `{' token ../include/boost/numeric/ublas/config.hpp:404: parse error before `>' token ../include/boost/numeric/ublas/config.hpp:408: parse error before `>' token ../include/boost/numeric/ublas/config.hpp:413: too many template parameter lists in declaration of `typename MV::size_type num_non_zeros(const MV&)' ../include/boost/numeric/ublas/config.hpp:413: syntax error before `{' token /usr/include/g++-v3/bits/std_cmath.h:69: confused by earlier errors, bailing out I'm using boost_1_29_0, and gcc 3.0.4 under Linux. I reviewed the newsgroup and didn't see this problem mentioned, so I'm sure it's something obvious to the experienced. Thanks

3 2

addendum to previous post on matrix_expression
by agiatojon 14 Nov '02

14 Nov '02

Ok, I fixed some of my mistakes but it now appears the overloaded operators aren't being seen so I must be missing another header or something. Once again here's the code compiled under VS.NET, debug, boost version 1_29_0, with the resultant error messages following. #include <iostream> #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/matrix_expression.hpp> int main() { using namespace boost::numeric::ublas; matrix<double> m1(3, 3), m2(3, 3); for(unsigned int i = 0; i < std::min(m1.size1(), m2.size1()); ++i) for(unsigned int j = 0; j < std::min(m1.size2(), m2.size2()); ++j) m1(i, j) = m2(i, j) = 3 * i + j; std::cout << m1 + m2 << std::endl; std::cout << m1 - m2 << std::endl; std::cin.get(); return EXIT_SUCCESS; } c:\Documents and Settings\Agiato\My Documents\Visual Studio Projects\test5\matrixAddSub.cpp(15): error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'boost::numeric::ublas::matrix_binary_traits<E1,E2,F>::result_ty pe' (or there is no acceptable conversion) with [ E1=boost::numeric::ublas::matrix<double,boost::numeric::ublas::row_ma jor,boost::numeric::ublas::unbounded_array<double>>, E2=boost::numeric::ublas::matrix<double,boost::numeric::ublas::row_ma jor,boost::numeric::ublas::unbounded_array<double>>, F=boost::numeric::ublas::scalar_plus<boost::numeric::ublas::matrix<do uble,boost::numeric::ublas::row_major,boost::numeric::ublas::unbounde d_array<double>>::value_type,boost::numeric::ublas::matrix<double,boo st::numeric::ublas::row_major,boost::numeric::ublas::unbounded_array< double>>::value_type> ] c:\Documents and Settings\Agiato\My Documents\Visual Studio Projects\test5\matrixAddSub.cpp(17): error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'boost::numeric::ublas::matrix_binary_traits<E1,E2,F>::result_ty pe' (or there is no acceptable conversion) with [ E1=boost::numeric::ublas::matrix<double,boost::numeric::ublas::row_ma jor,boost::numeric::ublas::unbounded_array<double>>, E2=boost::numeric::ublas::matrix<double,boost::numeric::ublas::row_ma jor,boost::numeric::ublas::unbounded_array<double>>, F=boost::numeric::ublas::scalar_minus<boost::numeric::ublas::matrix<d ouble,boost::numeric::ublas::row_major,boost::numeric::ublas::unbound ed_array<double>>::value_type,boost::numeric::ublas::matrix<double,bo ost::numeric::ublas::row_major,boost::numeric::ublas::unbounded_array <double>>::value_type> ] Thanks to all for their help! Jon Agiato JonAgiato(a)nyc.rr.com

2 1

[BGL] adjacency_matrix BUG
by mycia 14 Nov '02

14 Nov '02

Hi I compiled the adjacency matrix example in libs/graph/example/adjacency_matrix.cpp however, the output is totally different than expected http://www.boost.org/libs/graph/doc/adjacency_matrix.html it seems that something wrong in out_edges() have any idea? thanks a lot hcyeh

5 7

RE: [Boost-Users] Warnings compiling smart_ptr_test.cpp under MSV C++ 6.0
by Mark Storer 13 Nov '02

13 Nov '02

Good ol' C4786. It warns you whenever a classes name exceeds 255 characters. Templates within templates within... exceed this quite often (as you may have noticed). Microsoft's debugger won't work properly with these classes. Pragma is your friend. Throw this code in before the #includes: #pragma warning (disable: 4786) I generally build my own include file to wrap stl and boost (often a precompiled header). This file ALWAYS disables C4786. Aren't STL compiler messages great? (that would be sarcasm) --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

1 0

Is MTL alive?
by alexei_novakov 13 Nov '02

13 Nov '02

Does anyone know if there is any development of MTL? Where I can find the latest sources and info? What is the status of it anyways? Thank you Alexei Novakov

3 3

Warnings compiling smart_ptr_test.cpp under MSVC++ 6.0
by fejimush 13 Nov '02

13 Nov '02

I am brand new to boost. I have been able to compile and link smart_ptr_test.cpp. I have also been able to successfully run the test without errors. Can anyone tell me why I am getting numerous warnings? (shown below) One more item, the warning takes me to c:\...\VC98\Include\UTILITY Is this a stl implentation problem? Thanks in advanced. ---------------Build Output----------------------- Compiling... smart_ptr_test.cpp c:\program files\microsoft visual studio\vc98\include\utility(25) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > > ::_Kfn,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\libs\smart_ptr\smart_ptr_test.cpp(198) : see reference to class template instantiation 'std::pair<std::_Tree<boost::shared_ptr<int>,boost::shar ed_ptr<int>,std::set<boost::shared_ptr<int>,std::less<boost::shared_pt r<int> >,std ::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator,bool>' being compiled c:\program files\microsoft visual studio\vc98\include\utility(25) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_ array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\libs\smart_ptr\smart_ptr_test.cpp(242) : see reference to class template instantiation 'std::pair<std::_Tree<boost::shared_array<char>,boost::s hared_array<char>,std::set<boost::shared_array<char>,std::less<boost:: shared_array <char> >,std::allocator<boost::shared_array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator,bool>' being compiled c:\program files\microsoft visual studio\vc98\include\utility(21) : warning C4786: 'std::pair<std::_Tree<boost::shared_ptr<int>,boost::shared_ptr< int>,std::set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_pt r<int> > >::_Kfn,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator,bool>::pair<std::_Tree<boost::shared_ptr<int>,boost::share d_ptr<int>,std::set<boost::shared_ptr<int>,std::less<boost::shared_ptr <int> >,std::allo cator<boost::shared_ptr<int> > >::_Kfn,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator,bool>' : identifier was truncated to '255' characters in the debug information c:\program files\microsoft visual studio\vc98\include\utility(21) : warning C4786: 'std::pair<std::_Tree<boost::shared_array<char>,boost::shared_a rray<char>,std::set<boost::shared_array<char>,std::less<boost::shared_ array<char> >,std::allocator<boos t::shared_array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator,bool>::pair<std::_Tree<boost::shared_array<char>,boost::sh ared_array<char>,std::set<boost::shared_array<char>,std::less<boos t::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator,bool>' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Nil' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Nilrefs' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boos t::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Nilrefs' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::const_iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Node' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Redbl' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boos t::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::const_iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boos t::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boos t::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Redbl' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::pair<std::_Tree<boost::shared_ptr<int>,boost::shared_ptr< int>,std::set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std: :less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator,bool>' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::pair<std::_Tree<boost::shared_array<char>,boost::shared_a rray<char>,std::set<boost::shared_array<char>,std::less<boost::shared_ array<char> >,std::allocator<boost::shared_array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator,bool>' : identifier was truncated to '255' characters in the debug information Linking... GRPostOffice.exe - 0 error(s), 17 warning(s)

1 0

Boost on OS X
by boxerab 13 Nov '02

13 Nov '02

Dear Boost Users, I have been using boost on windows 2000, and I am now trying to move some code over to OS X. I have a PowerPlant application, and I want to use the regex library. Do I have to configure the codewarrior command line tools, or can I use gcc. Gcc seems to be the default compiler if I just issue the "bjam" command. I need to build a target that will link with CodeWarrior. Thanks in advance. Aaron Boxer boxerab(a)NOSPAMyahoo.com

3 2

RE: [Boost-Users] A strange question-)
by Aleksey Gurtovoy 13 Nov '02

13 Nov '02

Sam Gentile wrote: > I went there and indeed it can't get any simpler - at least > in theory-) > Read the document > C:\Boost\boost_1_29_0\libs\type_traits\c++_type_traits.htm > and its quite > simple: > > template <typename T> > struct is_void > { static const bool value = false; }; > > template <> > struct is_void<void> > { static const bool value = true; }; > > That's exactly what I want to show. So I go to the header files and > instead: > > //* is a type T void - is_void<T> > > BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_void,T,false) > > BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_void,void,true) > > > > Huh? So I look in bool_trait_def.hpp: > > #define BOOST_TT_AUX_BOOL_TRAIT_DEF1(trait,T,C) \ > > template< typename T > struct trait \ > > : mpl::bool_c< C > \ > > { \ > > BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ > > BOOST_MPL_AUX_LAMBDA_SUPPORT(1,trait,(T)) \ > > }; \ Well, the original code doesn't have all these excessive newlines ;), but yes, basically that's how it's implemented. > Argh! Why is it done like this? This makes it much more > complicated and unreadable than it has to be. Why are macros > being used everywhere? Practical engineering matters. If you consider that the fact that there are ~60 trait templates in the library and every time when a new version of a compiler comes out, or when somebody starts porting the library to a new platform, there is a chance that you need to change half of those definitions, from, for instance, template <typename T> struct is_void : mpl::bool_c<false> { }; to template <typename T> struct is_void { BOOST_STATIC_CONSTANT(bool, value = false); typedef mpl::bool_c<value> type; }; it might all make sense, after all :). Something along the lines of both of the above scenarios has actually happened, a couple of times. It's not the whole picture yet, but IMO it's enough of the motivation already, so I won't go too deep into details :). Hope this answers your question, Aleksey

2 1

1.29.1 release timeframe?
by Johan Nilsson 13 Nov '02

13 Nov '02

As the topic says. I do realize that there can be no absolute dates specified, I'd just like to get a hint on whether it's something within the matter of weeks, months or whatever. Thanks // Johan

5 14

RE: [Boost-Users] Q: Boost Python / weave / swig
by Aleksey Gurtovoy 13 Nov '02

13 Nov '02

Claudius Schnörr wrote: > I would like to build a python-interface for a C++-template library I > wrote. > > After looking around a bit, besides Boost-python I found swig > and weave, which seem to have a similar purpose in mind!?! > > I would appreciate it if someone could provide some comparing > hints/links/information about these various solutions (I'm new to all > these packages). > How do they differ in terms of > - the learning curve, > - their capabilities and > - their foci ? > Have you seen this one - http://www.boost.org/libs/python/doc/comparisons.html? It's more than 1 year old, though, so things might have changed since then. In general, it's better to ask Boost.Python-related questions here - http://mail.python.org/mailman/listinfo/c++-sig. For one, you are much likely to get a quicker response :). Aleksey

1 0

Can not gunzip bjam.exe.gz
by Mike Wilson 13 Nov '02

13 Nov '02

Hi, In Cygwin (version 2.125.2.10) I've tried to $ gunzip bjam.exe but get gunzip: bjam.exe.gz: not in gzip format (downloaded http://boost.sourceforge.net/jam-executables/bin.cygwinx86/bjam.exe.gz which was 143,050 bytes in size (x3 tries) ) My WinZip (V8.1) can't read it either. In fact I can't seem to read several of the .gz files that can be downloaded (but I did manage the Windows .zip version). Can anybody give me a clue as to what is wrong ? Mike Wilson

3 2

Erasing an element in shared_ptr
by cadiolis 12 Nov '02

12 Nov '02

I know that the destructor of shared_ptr will call delete for its contents, but what about erasing a member using the standard erase() function in vector?

2 1

RE: [Boost-Users] set thread priority
by Mark Storer 12 Nov '02

12 Nov '02

I'd think a relatively simple implementation would be to simply support them when possible, and otherwise turn all such calls into no-ops. Coming up with a range of priority values that would be portable shouldn't be too terribly difficult either. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

3 3

using ublas to solve linear systems?
by deane_yang 12 Nov '02

12 Nov '02

I'm trying to see if I can use ublas to solve a linear system of equations. Digging through the documentation, I find a description of a function called 'solve" that says "Solves a linear equation for a triangular matrix." There is also a formula, B = solve(A, B, tag) <------> B <- A-1 B But I just don't know what any of this means (even though I am a mathematician and quite fluent in linear algebra). So a) can ublas be used (without me implementing any additional algorithms) to solve a linear system of equations? b) what exactly does the function solve do?

3 4

RE: [Boost-Users] BUG: counted_base::release
by Per Kristensen 12 Nov '02

12 Nov '02

This is a constructed test case which should illustrate the problem. The bug is only a problem if you access data members of the counted_based object after the call to delete. So you can live happy without knowing anything about the bug if you never do that. //sourcecode begin #include "boost/shared_ptr.hpp" #include "boost/weak_ptr.hpp" class foo { public: void setWeak(boost::shared_ptr<foo> s) { w = s; } private: boost::weak_ptr<foo> w; //the desctuction of this member will delete the counted_based object }; class deleter { public: deleter() :lock(0) {} ~deleter() { assert(lock==0); //assert if destructor is called when we are executing } void operator() (foo *p) { ++lock; //lock the object from destruction within this operation delete p; --lock;//unlock the object } private: int lock; }; void main() { boost::shared_ptr<foo> s(new foo,deleter()); s->setWeak(s); s.reset(); } //source code end -----Original Message----- From: Peter Dimov [mailto:pdimov@mmltd.net] Sent: 11. november 2002 21:43 To: Boost-Users(a)yahoogroups.com Subject: Re: [Boost-Users] BUG: counted_base::release From: "perkristensennettest" <per.kristensen(a)nettest.com> > To me it seems like a bug, that the weak_count in > counted_base::release is decremented before the call to dispose. See > below [...] > > If the call to dispose() indirectly calls weak_release there is an > error as weak_release will decrement the --weak_count and may > destruct the counted_base object. This will happen if you have an > class C with a member of type weak_ptr<C>. Do you have a test case that breaks? Info: < http://www.boost.org> Wiki: < http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service <http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed]

2 1

uBLAS Matrix Multiplication
by Hickman, Greg 12 Nov '02

12 Nov '02

Why isn't there an overloaded matrix_expression operator* (const matrix_expression&, const matrix_expression&); for peforming matrix multiplication? Greg Hickman

8 7

compose function objects
by daniel szymanski 11 Nov '02

11 Nov '02

hi, i've a question regarding the compose function objects. i was wondering if there is something like compose_f_x_gy etc? i know there's only the compose_f_gx_hy function object. but then i would need g(x) = x, so my question: is there another way to get the same result like using g(x) = x or writing a compose_f_x_gx? thanks, daniel

2 1

RE: [Boost-Users] compose function objects
by Mark Storer 11 Nov '02

11 Nov '02

I'd think you could write a toy function (inline and all that) to do just that, then pass it in as the 'gx' param. I'd be disappointed if it didn't vanish during optimization, leaving just the 'x'. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

1 0

BUG: counted_base::release
by perkristensennettest 11 Nov '02

11 Nov '02

To me it seems like a bug, that the weak_count in counted_base::release is decremented before the call to dispose. See below //source code begin void release() // nothrow { long new_use_count; long new_weak_count; { #ifdef BOOST_HAS_THREADS mutex_type::scoped_lock lock(mtx_); #endif new_use_count = --use_count_; new_weak_count = --weak_count_; //this is a bug } if(new_use_count == 0) { dispose(); //the this object may be deleted here } if(new_weak_count == 0) { // not a direct 'delete this', because the inlined // release() may use a different heap manager self_deleter_(this); } } //source code end If the call to dispose() indirectly calls weak_release there is an error as weak_release will decrement the --weak_count and may destruct the counted_base object. This will happen if you have an class C with a member of type weak_ptr<C>. As I see it the decrement of weak_count should be moved to after the dispose call. see below: //source code begin void release() // nothrow { long new_use_count; long new_weak_count; { #ifdef BOOST_HAS_THREADS mutex_type::scoped_lock lock(mtx_); #endif new_use_count = --use_count_; //do not decrement weak_count here } if(new_use_count == 0) { dispose(); } { #ifdef BOOST_HAS_THREADS mutex_type::scoped_lock lock(mtx_); #endif new_weak_count = --weak_count_; } if(new_weak_count == 0) { // not a direct 'delete this', because the inlined // release() may use a different heap manager self_deleter_(this); } } //source code end ????

2 1

RE: [Boost-Users] Strange bug / MSVC 6.5 / Boost 1.29 / utility_f wd.hpp
by Tom Matelich 11 Nov '02

11 Nov '02

Here's a short example: #include <boost/smart_ptr.hpp> #include <iostream> namespace ZSystem { namespace Leg { enum Type { INLET = 1, OUTLET = 2 }; } } std::ostream& operator<<(std::ostream&, ZSystem::Leg::Type); #include <boost/utility.hpp> Not sure whats going on here, I just started with a broken compile and reduced it to here. > -----Original Message----- > I haven't tracked down what include order is causing this, > but I'm getting: > > c:\dev\opt\include\boost/utility_fwd.hpp(21) : fatal error > C1001: INTERNAL > COMPILER ERROR > (compiler file 'msc1.cpp', line 1794) > Please choose the Technical Support command on the > Visual C++ > Help menu, or open the Technical Support help file for more > information > ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

1 0

Strange bug / MSVC 6.5 / Boost 1.29 / utility_fwd.hpp
by Tom Matelich 11 Nov '02

11 Nov '02

I haven't tracked down what include order is causing this, but I'm getting: c:\dev\opt\include\boost/utility_fwd.hpp(21) : fatal error C1001: INTERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 1794) Please choose the Technical Support command on the Visual C++ Help menu, or open the Technical Support help file for more information Of course MSVC doesn't have header include tracing. I've been working around it with spurious includes of <boost/utility/base_from_member.hpp>. Any ideas? Thanks, Tom ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

1 0

gcc bug
by wugui 11 Nov '02

11 Nov '02

FreeBSD 4.6-STABLE gcc version 2.95.3 20010315 (release) [FreeBSD] 1. CXXFLAG = -Wall -g -pthread -D_THREAD_SAFE is ok 2. CXXFLAG = -Wall -ggdb -pthread -D_THREAD_SAFE boost_1_28_0/boost/function/function_base.hpp:155: Internal compiler error in `output_die', at dwarf2out.c:5433 Please submit a full bug report. See <URL:http://www.gnu.org/software/gcc/bugs.html> for instructions.

2 1

Is this shared_ptr usage okay?
by Hickman, Greg 11 Nov '02

11 Nov '02

I'd like to prevent clients from directly creating and deleting instances of a type like 'Bill' below, so Bill's constructor and destructor have been made private to prevent ordinary client access. Since Bill has reference semantics, construction is handled by a static 'Bill::create()' factory method which returns a dynamically allocated Bill instance wrapped in a shared_ptr. Destruction is handled by a private Bill::Deallocator who also happens to be a Friend of Bill (FOB). My question is: Is this an acceptable use of the shared_ptr deallocator, or am I just asking for trouble? Thanks, Greg Hickman //-------------------------------------- #include <boost/shared_ptr.hpp> using namespace boost; class Bill; typedef shared_ptr<Bill> Bill_ptr; class Bill { private: Bill() {} ~Bill() {} struct Deallocator { void operator() (Bill* b) const { delete b; } }; friend struct Deallocator; public: static Bill_ptr create() { return Bill_ptr(new Bill, Deallocator()); } };

2 1

Re: uBLAS Matrix Multiplication
by Paul C. Leopardi 10 Nov '02

10 Nov '02

Hi, There are at least two strong arguments here: 1. Use * for element-by-element multiplication of matrices. This treats matrices as if they were just arrays, with an added "mult" function, but it has the advantage that it prevents or at least discourages users from writing poorly performing code. 2. Use * for matrix multiplication. This treats matrices as if they were elements of a linear algebra, with algebra operations "+" and "*". C++ allows such abstractions, but there may be a penalty in performance if the abstraction is abused. In GluCat - http://glucat.sf.net - I implemented Clifford algebras using "+" and "*". GluCat also has two other products, for which it uses, "&" and "^". I used "*" for the main product which defines the algebra. Underlying each Clifford algebra is an isomorphic matrix algebra. Best regards

1 0

Possible Error (with Fix?) in debug build of thread(?) library created with msvc/stlport.
by Mike Wilson 10 Nov '02

10 Nov '02

As a newbie I'd like to say a big thank to all those concerned for boost. I found that the following (MSVC6) program fails when in the (default) debug build, but works in release: #include <iostream> #include <boost/thread/thread.hpp> int main(int , char* ) { int NUM_CLIENTS = 3; boost::thread_group thrds; std::cout << NUM_CLIENTS; // prints 0 in _DEBUG build, 3 in release return 0; } It was linked using the libboost_thread.lib file created using the following bjam command: bjam "-sTOOLS=msvc-stlport" "-sSTLPORT_PATH=F:\TemplateStuff" "-sBUILD=debug <runtime-link>static <stlport-iostream>on" POSSIBLE FIX Compiling the above program with _STLP_DEBUG defined gives the correct answer. Is this the correct fix to the problem? (I've noted that there is no mention of _STLP_DEBUG in the distributed docs) Mike Wilson Thanks again to the boost community.

3 2

Q: Boost Python / weave / swig
by Claudius Schnörr 09 Nov '02

09 Nov '02

Hello, I would like to build a python-interface for a C++-template library I wrote. After looking around a bit, besides Boost-python I found swig and weave, which seem to have a similar purpose in mind!?! I would appreciate it if someone could provide some comparing hints/links/information about these various solutions (I'm new to all these packages). How do they differ in terms of - the learning curve, - their capabilities and - their foci ? Thank you in advance, Claudius

1 0

N-dimensional array besides multi_array
by Paul Cameron 09 Nov '02

09 Nov '02

I'm looking for an N-dimensional array that doesn't require the dimensionality be specified at compile time, like multi_array. Does anyone know of such a beast? It doesn't need a lot of functionality, just basic storage/retrieval and some slicing. Just thought I'd ask before I roll my own. I'm thinking of tweaking Giovanni Bavestrelli's implementation which is what multi_array is based on. Thanks, Paul

1 0

RE: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering
by Randy Bowen 09 Nov '02

09 Nov '02

I assume you meant, What's the matter with Visio, right? -----Original Message----- From: Marcio Del'Valle [mailto:mjdelvalle@terra.com.br] Sent: Friday, November 08, 2002 4:11 PM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering Hi, Every time I try to reverse engineer a project where I've used boost::shared_ptr Visio 2002 locks my Visual C++. What's the matter with the shared_ptr library? Marcio Del'Valle [Non-text portions of this message have been removed] Yahoo! Groups Sponsor ADVERTISEMENT <http://rd.yahoo.com/M=238900.2578845.3984497.2273195/D=egroupweb/S=1705 006788:HM/A=1309024/R=0/*http://www.gotomypc.com/u/tr/yh/cpm/grp/300_you H1/g22lp?Target=mm/g22lp.tmpl> <http://us.adserver.yahoo.com/l?M=238900.2578845.3984497.2273195/D=egrou pmail/S=:HM/A=1309024/rand=607495686> Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service <http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed]

2 1

Boost (shared_ptr) vs Visio 2002 reverse engineering
by Marcio Del'Valle 09 Nov '02

09 Nov '02

Hi, Every time I try to reverse engineer a project where Ive used boost::shared_ptr Visio 2002 locks my Visual C++. Whats the matter with the shared_ptr library? Marcio DelValle [Non-text portions of this message have been removed]

1 0

RE: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering
by Randy Bowen 09 Nov '02

09 Nov '02

Actually, we've played with the Visio reverse engineering stuff a bit, but it appears to choke on any moderately complex use of templates in C++. I would assume that this is the issue you're encountering with the use of the Boost libraries. Randy Bowen Software Architect Stamps.com -----Original Message----- From: Marcio Del'Valle [mailto:mjdelvalle@terra.com.br] Sent: Friday, November 08, 2002 5:03 PM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering Yep!! =) Sorry about that. But, after all, it's M$! Marcio Del'Valle -----Original Message----- From: Randy Bowen [mailto:rbowen@stamps.com] Sent: Friday, November 08, 2002 8:41 PM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering I assume you meant, What's the matter with Visio, right? -----Original Message----- From: Marcio Del'Valle [mailto:mjdelvalle@terra.com.br] Sent: Friday, November 08, 2002 4:11 PM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering Hi, Every time I try to reverse engineer a project where I've used boost::shared_ptr Visio 2002 locks my Visual C++. What's the matter with the shared_ptr library? Marcio Del'Valle [Non-text portions of this message have been removed] Yahoo! Groups Sponsor ADVERTISEMENT < http://rd.yahoo.com/M=238900.2578845.3984497.2273195/D=egroupweb/S=1705 006788:HM/A=1309024/R=0/* http://www.gotomypc.com/u/tr/yh/cpm/grp/300_you H1/g22lp?Target=mm/g22lp.tmpl> < http://us.adserver.yahoo.com/l?M=238900.2578845.3984497.2273195/D=egrou pmail/S=:HM/A=1309024/rand=607495686> Info: < http://www.boost.org> Wiki: < http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service < http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed] Yahoo! Groups Sponsor ADVERTISEMENT <http://rd.yahoo.com/M=237459.2482214.3917349.2146399/D=egroupweb/S=1705 0067 88:HM/A=1267611/R=0/*http://ad.doubleclick.net/jump/N2524.Yahoo/B1071650 ;sz= 300x250;ord=1036798890310715?> Info: < http://www.boost.org> Wiki: < http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service <http://docs.yahoo.com/info/terms/> . _____ Esta mensagem foi verificada pelo E-mail Protegido Terra <http://www.emailprotegido.terra.com.br/> . Scan engine: VirusScan / Atualizado em 06/11/2002 / Versco: 1.3.13 Proteja o seu e-mail Terra: http://www.emailprotegido.terra.com.br/ [Non-text portions of this message have been removed] Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.

1 0

[BGL] Problem getting a property map from a reverse graph
by kweeheong 08 Nov '02

08 Nov '02

When I create a reverse_graph from a graph, is it possible to get the property map as well? I have reduced the code to the following snippet: typedef adjacency_list<vecS, vecS, bidirectionalS, property<vertex_name_t,string> > GraphType; typedef boost::property_map<GraphType,vertex_name_t>::type VertexNameMapType; typedef reverse_graph<GraphType> ReverseGraphType; typedef boost::property_map<ReverseGraphType,vertex_name_t>::type ReverseVertexNameMapType; GraphType g; VertexNameMapType nameMap=get(vertex_name,g); // get nameMap from graph g reverse_graph<GraphType> rg(g); // create the reverse_graph ReverseVertexNameMapType rnameMap=boost::get(vertex_name,rg); // get rnameMap frmo rg, but this line fails to compile The VC6 compile error message, with long substrings substituted for string ( STR ) and adjacency list ( ADJL ) looks like: graph\reverse_graph.hpp(241) : error C2664: '__thiscall boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t>::boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t><class boost::ADJL *>' : cannot convert parameter 1 from 'struct boost::vec_adj_list_vertex_property_map<class boost::ADJL,class boost::ADJL const *,class STR,class STR const &,enum boost::vertex_name_t>' to 'class boost::ADJL *' No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called example\testreverse.cpp(97) : see reference to function template instantiation 'struct boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t> __cdecl boost::get<enum boost::vertex_name_t,class boost::reverse_graph<class boost::ADJL,class boost::ADJL const &> &>' being compiled graph\reverse_graph.hpp(241) : error C2553: no legal conversion of return value to return type 'struct boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t> *' example\testreverse.cpp(97) : see reference to function template instantiation 'struct boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t> __cdecl boost::get<enum boost::vertex_name_t,class boost::reverse_graph<class boost::ADJL,class boost::ADJL const &> &>' being compiled I am trying to determine whether I have made the call incorrectly or is this a limitation of the reverse_graph?

1 0

[BGL SUGGESTION] about source() and target()
by mycia 08 Nov '02

08 Nov '02

to Boost Graph Library designers: in the boost/graph/graph_traits.hpp (line 104): //--begin---------------------------------------------------------------- // Since pair is in namespace std, Koenig lookup will find source and // target if they are also defined in namespace std. This is illegal, // but the alternative is to put source and target in the global // namespace which causes name conflicts with other libraries (like // SUIF). namespace std { template <class T, class G> T source(pair<T,T> p, const G&) { return p.first; } template <class T, class G> T target(pair<T,T> p, const G&) { return p.second; } } //--end---------------------------------------------------------------- why not change it with: //--begin---------------------------------------------------------------- template <class E, class G> typename boost::graph_traits<G>::vertex_descriptor source(E e, const G& g) { return boost::source(e,g); } template <class E, class G> typename boost::graph_traits<G>::vertex_descriptor target(E e, const G& g) { return boost::target(e,g); } //--end---------------------------------------------------------------- and add the following in boost/graph/vector_as_graph.hpp //--begin---------------------------------------------------------------- template <class T, class EdgeList, class Alloc> T source(std::pair<T,T> p, const std::vector<EdgeList, Alloc>&) { return p.first; } template <class T, class EdgeList, class Alloc> T target(std::pair<T,T> p, const std::vector<EdgeList, Alloc>&) { return p.second; } //---end--------------------------------------------------------------- which means, vector_as_graph handles source() and target() inside its class (and in boost namespace) and makes std::source() and std::target() more general the reason why I want to modify this is that the original design makes trouble when I try to develop a subgraph view adaptor (something like filtered_graph, but accept vector_as_graph type) I need to define my own source() and target() to deal with my own subgraph view class, as shown below: namespace boost { template <class G> typename subview_graph<G>::vertex_descriptor target(typename subview_graph<G>::edge_descriptor e, subview_graph<G>& v) {...} } however, when dealing with vector_as_graph (which means the 1st argument, edge_descriptor, will be std::pair<int,int>), the compiler complains ambiguity between std::target() and boost::target() in fact, it will make trouble to everyone who wants to define his/her own source() & target() function but the 1st argument is std::pair<T,T> if it's possible, please fix this strange design or any other opinions will be appreciated best regards, hcyeh

1 0

using regexps with streams
by David VERGNAUD 08 Nov '02

08 Nov '02

hi i'm wondering if it's possible to use apply the regex-search algorithm on an input stream. my first thought is that it's not, since i've read (and so it looks on the specification) that the regex_search function can be passed only bi-directional iterators, and as far as i know one can only create input iterators on streams. typically, the first and second arguments of regex_search are iterators on the first and (most annoyingly) last element, which one cannot get with a stream. however, there might be (and i hope there is) another way to do it i'm not aware of. thx David __________________________________________________ Do you Yahoo!? U2 on LAUNCH - Exclusive greatest hits videos http://launch.yahoo.com/u2

2 1

problems with posix
by silvermangbs 08 Nov '02

08 Nov '02

Since I don't have librt.so on my Solaris (2.6 & 8) machines, I am trying to get Boost to use libposix4.so (which contains the same functions). I have substituted "posix4" for "rt" in the configure and configure.in files. I have done the same for the gcc-tools.jam file, since, I am using gcc (2.95.2 and 3.2). All seems to go well until I try to run the thread tests. Then, the linker is unable to find the posix4 library! What's going on? libposix4.so is in /usr/lib, so, the gcc compiler should be able to find it. Any ideas? Greg Silverman TRW Sunnyvale, CA

1 1

year_iterator
by deane_yang 08 Nov '02

08 Nov '02

Contrary to the documentation, the type "year_iterator" does not appear to be defined in the file "gregorian_types.hpp". Or did I miss something?

2 4

Trouble compiling regexpp example
by Cameron McCormack 08 Nov '02

08 Nov '02

Hi everyone. I'm using the libboost-regex Debian package and I'm trying to compile one of the example programs, regex_match_example.cpp. I am compiling with the command g++ -g -Wall -lboost_regex regex_match_example.cpp \ -o regex_match_example but I get many errors: /tmp/ccCZxmp1.o: In function __static_initialization_and_destruction_0': /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:31: undefined reference to `boost::reg_expression<char, boost::regex_traits<char>, allocator<char> >::reg_expression(char const *, unsigned int, allocator<char> const &)' /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:31: undefined reference to `boost::reg_expression<char, boost::regex_traits<char>, allocator<char> >::~reg_expression(void)' /tmp/ccCZxmp1.o: In function `basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >::assign(char const *, unsigned int)': /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.m_free(void)+0x20): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.m_free(void)+0xbe): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.(boost::re_detail::match_results_base<char const *, allocator<char> > const &)+0x26): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.(boost::re_detail::match_results_base<char const *, allocator<char> > const &)+0x6d): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.(boost::re_detail::match_results_base<char const *, allocator<char> > const &)+0xb2): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /tmp/ccCZxmp1.o(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.set_accumulator_size(unsigned int)+0x37):/usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h: more undefined references to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' follow /tmp/ccCZxmp1.o: In function `basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >::assign(char const *, unsigned int)': /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::match_results_base<char const *, allocator<char> >::gnu.linkonce.t.set_second(char const *)+0x13): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::cow(void)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.gnu.linkonce.t.__as__Q35boost9re_detailt18match_results_base2ZPCcZt9allocator1ZcRCQ35boost9re_detailt18match_results_base2ZPCcZt9allocator1Zc+0x19): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::m_free(void)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::match_results_base<char const *, allocator<char> >::gnu.linkonce.t.set_second(char const *, unsigned int, bool)+0x1a): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::cow(void)' /tmp/ccCZxmp1.o: In function `main': /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:89: undefined reference to `boost::c_regex_traits<char>::transform(basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > &, basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > const &)' /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:99: undefined reference to `boost::c_regex_traits<char>::transform_primary(basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > &, basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > const &)' /tmp/ccCZxmp1.o: In function `basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >::assign(char const *, unsigned int)': /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.bool boost::re_detail::gnu.linkonce.t.query_match_aux<char const *, allocator<char>, char, boost::regex_traits<char>, allocator<char> >(char const *, char const *, boost::match_results<char const *, allocator<char> > &, boost::reg_expression<char, boost::regex_traits<char>, allocator<char> > const &, unsigned int, boost::re_detail::_priv_match_data<char const *, allocator<char> > &, char const * *)+0x77): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::set_first(char const *)' /tmp/ccCZxmp1.o: In function `main': /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:95: undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::set_first(char const *, unsigned int)' /tmp/ccCZxmp1.o: In function `basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >::assign(char const *, unsigned int)': /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.bool boost::gnu.linkonce.t.regex_match<char const *, allocator<char>, char, boost::regex_traits<char>, allocator<char> >(char const *, char const *, boost::match_results<char const *, allocator<char> > &, boost::reg_expression<char, boost::regex_traits<char>, allocator<char> > const &, unsigned int)+0x34): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::set_size(unsigned int, char const *, char const *)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.gnu.linkonce.t._._Q35boost9re_detailt18match_results_base2ZPCcZt9allocator1Zc+0x13): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::m_free(void)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::match_results<char const *, allocator<char> >::gnu.linkonce.t.(allocator<char> const &)+0x14): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::match_results_base(allocator<char> const &)' collect2: ld returned 1 exit status make: *** [regex_match_example] Error 1 (Sorry for the messiness, I can't get Mozilla not to wrap those error lines.) Anyone know what is going on here (a template instantiation problem perhaps)? Thanks, Cameron -- Cameron McCormack // clm(a)csse.monash.edu.au // http://www.csse.monash.edu.au/~clm/ // icq 26955922

2 3

Q: Graphs. Sorting edges. Possible? How to?
by stas_fomin 07 Nov '02

07 Nov '02

Hello. I a newbie in BGL and I rewrite my LEDA code now... I have to sort (order) edges according to some functor. For example (simplified): typedef adjacency_list<vecS, vecS, bidirectionalS> MyGraph; typedef graph_traits < MyGraph >::edge_descriptor MyGraphEdge; typedef graph_traits < MyGraph >::edge_iterator MyEdgeIter; class MyCompareEdges{ public: bool operator()(MyGraphEdge e1, MyGraphEdge e2) const { return true; } }; .... { MyGraph Gr(10); MyEdgeIter ei_beg, ei_end; MyCompareEdges comp; tie(ei_beg, ei_end) = edges(Gr); std::sort(ei_beg, ei_end, comp); //Error C2676 } And I have error C2676 (below the message...). Questions: 1. Is it possible to sort edges in the graph? 2. How to... Thanks all in advance... Stas Fomin. P.S. vecS, setS, listS for edge container... - C2676. ------------------------------ d:\projects\lib\cpp_libs\libboost\boost\iterator_adaptors.hpp(264) : error C2676: binary '+=' : 'class std::list<struct boost::list_edge<unsigned int,struct boost::no_property>,class std::allocator<struct boost::list_edge<unsigned int,struct boost:: no_property> > >::iterator' does not define this operator or a conversion to a type acceptable to the predefined operator d:\projects\lib\cpp_libs\libboost\boost\iterator_adaptors.hpp (911) : see reference to function template instantiation 'void __thiscall boost::default_iterator_policies::advance(struct boost::iterator_adaptor<class std::list<struct boost::lis t_edge<unsigned int,struct boost::no_property>,class std::allocator<struct boost::list_edge<unsigned int,struct boost::no_property> > >::iterator,struct boost::detail::undirected_edge_iter_policies,class boost::detail::edge_desc_impl<struct boost::b idirectional_tag,unsigned int>,class boost::detail::edge_desc_impl<struct boost::bidirectional_tag,unsigned int>,class boost::detail::edge_desc_impl<struct boost::bidirectional_tag,unsigned int> *,struct boost::multi_pass_input_iterator_tag,int> &,i nt)' being compiled Error executing cl.exe.

4 7

[Regex] Case insensitive pb
by f_mayot 07 Nov '02

07 Nov '02

Hi, Maybe a stupid question but I didn't manage to make my regular expression objects case insensitive. What should I do insted of this : boost::regex* pRegExp = new boost::wregex(sRegExp); ? Thanks. Fred

4 3

Can't use adjacency_list AND adjacency_matrix in same program
by loopylozzysdad 06 Nov '02

06 Nov '02

Hi, It seems to me that you can't use adjacency_list AND adjacency_matrix in the same program. When I had both the relevant inludes in the program I got duplicate definition errors from the linker. Is this by design, or a bug? Cheers - Richard Howells (loopylozzydad at yahoo dot com)

3 2

RE: [Boost-Users] shared_ptr capabilities
by Mark Storer 06 Nov '02

06 Nov '02

>I don't believe the above statement will affect me, >but I just want to be sure Correct. A language-level array is not an STL container. There IS a shared_ptr-like template called shared_array that calls "delete []" instead of "delete". Had to look that one up. It doesn't get used much. std::vector is a superior choice (in every situation I can think of). An STL container of shared_ptr's is just fine. Just don't create a circular reference. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Collin Peters [mailto:yg-boost-users@m.gmane.org] Sent: Wednesday, November 06, 2002 1:04 PM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] shared_ptr capabilities http://www.boost.org/libs/smart_ptr/shared_ptr.htm states that: "Normally, a shared_ptr cannot correctly hold a pointer to a dynamically allocated array. See shared_array for that usage." What I hope to use shared_ptr for, is to store pointers to a class in a vector, and that class will also have a vector that stores pointers via shared_ptr. example: class Foo { int a; } class one { int var1; int var2; std::vector<Foo> foo_vector; } class two { std::vector<one> one_vector; } I don't believe the above statement will affect me, but I just want to be sure Collin Peters Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

shared_ptr capabilities
by Collin Peters 06 Nov '02

06 Nov '02

http://www.boost.org/libs/smart_ptr/shared_ptr.htm states that: "Normally, a shared_ptr cannot correctly hold a pointer to a dynamically allocated array. See shared_array for that usage." What I hope to use shared_ptr for, is to store pointers to a class in a vector, and that class will also have a vector that stores pointers via shared_ptr. example: class Foo { int a; } class one { int var1; int var2; std::vector<Foo> foo_vector; } class two { std::vector<one> one_vector; } I don't believe the above statement will affect me, but I just want to be sure Collin Peters

3 2

Q: Problems building boost.python under cygwin
by "Schnörr, Claudius Dr." 06 Nov '02

06 Nov '02

Hello, I run into problems building boost under cygwin. It seems to be merely a matter of a wrong configuration or wrong scripts. After running 'bjam -sTOOLS=gcc -n > build.com' in boost/libs/python/build in order to get hands on the statements being executed by bjam, there had to be made a lot of textual replacements to get the statements in build.com run: Just to mention some: - replace '-isystem ' by '-I' - remove '-I""' - change shared library-names from *.so to *.dll - insert '-L <path_to_libpython2.2.dll> -lpython2.2' where shared libs are created In boost/libs/python/test, going the same way, there have in addition this changes to be made: - LD_LIBRARY_PATH=... --> PATH=$PATH:..., because cygwin uses PATH to look for .dlls My question: I think there have to be made more configurations than I did to create the boost.python-stuff under cygwin. Where have they to be done, and what? (I already configured environment variables like GCC_ROOT_DIRECTORY, GXX, PYTHON_ROOT, ...etc...) Any suggestions are welcome! Please send a copy of your answer to schnoerr(a)mailzone.com Thank you in advance, Claudius --------------------------------------------------------- This Mail has been checked for Viruses Attention: Encrypted mails can NOT be checked! ** Diese Mail wurde auf Viren geprueft Hinweis: Verschluesselte mails koennen NICHT auf Viren geprueft werden! ---------------------------------------------------------

2 1

RE: [Boost-Users] set thread priority
by Mark Storer 05 Nov '02

05 Nov '02

I'd think you could get away with something like a set range, like 0 to 1000, and then map those values into whatever system is present. You could even use floating point values, 0.0 to 1.0, though people might look at you cross-eyed, at least until they got used to the idea. Then it's just a matter of mapping those ranges to whatever OS settings are present. You just state up front a couple caveats: Given two threads, A (higher priority) and B (lower priority), you only guarentee that A won't be given a lower underlying system priority than B. This would save you quite a bit of grief... particularly when someone wants threads with priority 1.0, 0.99 and 0.98. The thread with 0.98 might not run slower than the one with a 1.0 priority, but it certainly won't be faster. SOUNDS simple enough. At least to someone whose sum total multi-threading experience is a toy java applet and a dozen lines of boost::thread code. ;) --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

3 3

set thread priority
by boxerab 05 Nov '02

05 Nov '02

Dear Boost Users, I am considering using the boost thread library; currently I use the Win32 API for threading on Windows. Is it possible to set the thread priority of a boost thread? Thanks! Aaron Boxer boxerab(a)NOSPAMyahoo.com

2 1

can't compile johnson-eg.cpp with VC6
by chul_de_condares 05 Nov '02

05 Nov '02

I get the following errors when trying to compile the example code for johnson_all_pairs_shortest_paths. Has anyone ever seen this before? Thanks in advance. d:\swapps\source\axrt\c\boost\boost_1_29_0 \boost\graph\johnson_all_pairs_shortest.hpp(61) : error C2899: typename cannot be used outside a template declaration d:\swapps\source\axrt\c\boost\boost_1_29_0 \boost\graph\johnson_all_pairs_shortest.hpp(166) : see reference to function template instantiation 'bool __cdecl boost::johnson_all_pairs_shortest_paths(class boost::adjacency_list<struct boost::vec S,struct boost::vecS,struct boost::directedS,struct boost::no_property,struct boost::property<enum boost::edge_weight_t,int,struct boost::property<enum boost::edge_weight2_t,int,struct boost::no_property> >,struct boost::no_property,struct boost::li stS> &,int (&)[5][5],struct boost::vec_adj_list_vertex_id_map<struct boost::no_property,unsigned int>,struct boost::adj_list_edge_property_map<struct boost::directed_tag,int,int const &,unsigned int,struct boost::property<enum boost::edge_weight_t,i nt,struct boost::property<enum boost::edge_weight2_t,int,struct boost::no_property> > const ,enum boost::edge_weight_t>,int)' being compiled d:\swapps\source\axrt\c\boost\boost_1_29_0 \boost\graph\johnson_all_pairs_shortest.hpp(84) : error C2899: typename cannot be used outside a template declaration d:\swapps\source\axrt\c\boost\boost_1_29_0 \boost\graph\johnson_all_pairs_shortest.hpp(166) : see reference to function template instantiation 'bool __cdecl boost::johnson_all_pairs_shortest_paths(class boost::adjacency_list<struct boost::vec S,struct boost::vecS,struct boost::directedS,struct boost::no_property,struct boost::property<enum boost::edge_weight_t,int,struct boost::property<enum boost::edge_weight2_t,int,struct boost::no_property> >,struct boost::no_property,struct boost::li stS> &,int (&)[5][5],struct boost::vec_adj_list_vertex_id_map<struct boost::no_property,unsigned int>,struct boost::adj_list_edge_property_map<struct boost::directed_tag,int,int const &,unsigned int,struct boost::property<enum boost::edge_weight_t,i nt,struct boost::property<enum boost::edge_weight2_t,int,struct boost::no_property> > const ,enum boost::edge_weight_t>,int)' being compiled Error executing cl.exe. test.obj - 2 error(s), 0 warning(s)

1 0

Boost Python v2 - extending and embedding - memory leaks, compiler warnings
by texrmex 04 Nov '02

04 Nov '02

First, I'm excited about the new work that's been done with Boost Python v2. I can't wait to see if it's enough to overcome the pitfalls that prevented me from getting past the evaluation stage with v1. I'm using VC7 IDE to build my project and link to python22.lib and boost_python.lib (built with VC7 command line tools using bjam). I'm attempting to extend and embed in my existing project, so I'm not building a dll, but and exe. First of all, can I do this? When it links it says "Creating library ....lib and object ....exp", and still creates an exe. If I don't include my test module (and thus boost/python.hpp) I don't get this message. I'm assuming that by defining a module, boost defines exports and the linker then creates the lib and exp, since there were exports? Although I've built dlls before, I really don't know the inner workings of the process. The following is a brief example of my module. At the bottom is a simple test function that I'm calling just to test importing of the module. When I call TestModule(), I get 2 memory leaks from the module definition section, one from the class definition, and the other from the method definition. If I remove these, I get no memory leaks, and if I add more classes and methods, I get one 12 byte leak per class and one 12 byte leak per method I add. I do not get a leak from defining the top level function "greet". /////////////////////////////////////////////////// #include <boost\python.hpp> using namespace boost::python; namespace { const char * greet() { return "Hello World"; } class CSimple { public: bool Test() { return true; } }; }; BOOST_PYTHON_MODULE(Test) { def("greet", greet); class_<CSimple>("Simple") .def("Test", &CSimple::Test) ; } void TestModule() { Py_Initialize(); initTest(); Py_Finalize(); } /////////////////////////////////////////////////// In addition to the memory leaks, I get a number of compiler warnings, similar to the following: d:\Boost\boost\python\instance_holder.hpp(18) : warning C4275: non dll-interface class 'boost::noncopyable' used as base for dll- interface struct 'boost::python::instance_holder' d:\Boost\boost\utility.hpp(50) : see declaration of 'boost::noncopyable' d:\Boost\boost\python\instance_holder.hpp(17) : see declaration of 'boost::python::instance_holder' *and* d:\Boost\boost\python\detail\exception_handler.hpp(34) : warning C4251: 'boost::python::detail::exception_handler::m_impl' : class 'boost::function2<R,T0,T1,Policy,Mixin,Allocator>' needs to have dll-interface to be used by clients of struct 'boost::python::detail::exception_handler' with [ R=bool, T0=const boost::python::detail::exception_handler &, T1=const boost::function0<void,boost::empty_function_policy,boost::empty_functi on_mixin,int> &, Policy=boost::empty_function_policy, Mixin=boost::empty_function_mixin, Allocator=int ] I was wondering if my project is not set up properly, and if these warnings might have something to do with the memory leaks. In v1 there was a vc project you could use for building boost python. This works well if you are planning on linking to a vc built project, since you can make sure your settings, paths and libs are consistent between the boost python lib and your project. I currently have 3 different sets of build tools (yes, 3 compilers) on this box, with several different versions of standard and other libraries, so making sure I have control of the paths and settings used is very important. This is one reason I'm weary of the jam environment. It's yet another build environment, one that I'm not familiar with, and one that I'm not going to be using with any other projects except to build boost python. So a question would be: how easy would it be for me to set up a VC project for building boost python? Has this already been done? Or am I barking up the wrong tree? Thanks in advance, -Tex

1 0

RE: [Boost-Users] Iterator Adaptor Question
by Hickman, Greg 04 Nov '02

04 Nov '02

> -----Original Message----- > From: Mark Storer [mailto:mstorer@cardiff.com] > > You wrote up your sample so anyone could easily compile it... Thanks for noticing. :) > On > VC++ v6, I got two compiler errors: > > samplecode.cpp(58) : error C2663: 'reset' : 2 overloads have > no legal conversion for 'this' pointer > samplecode.cpp(59) : error C2678: binary '=' : no operator > defined which takes a left-hand operand of type 'const class > boost::shared_ptr<struct Shape const >' (or there is no > acceptable conversion) > > These errors are on the two lines you want to prevent. > > My first impression of the code was that it was already > illegal to perform those two actions. You shouldn't be able > to call non-const functions through a const_iterator, and > since neither reset() nor operator=() are const, no problem. > Right? I wasn't expecting the first error message, but the > second is in line with my expectations. > > I take it this code compiles for you? What tools/OS/etc are > you using? Unfortunately it does. I'm using Borland C++ Builder 5, for which I believe I have all of the available patches installed. (I'm using the IDE, but my command-line tells me I'm using Borland C++ 5.5.1. Borland gives away a set of free command-line tools that are distinct from the Builder IDE, and it may be that the compiler they give away is now more compliant than the one included in C++ Builder 5. If there is a way to point my IDE at the latest version of the free compiler, I don't know how to do it. I need to get gcc set up on my machine as a sanity check.) My first thought was that iterator_adaptor might be stripping away the const-ness from reference_type<const Const_shape_ptr>, and that the pointer type being generated was somehow pointing to a non-const Const_shape_ptr, thus allowing the indicated lines to compile. However, since you seem to get the desired results, perhaps the problem is with my compiler (or with Boost's support of it). Thanks very much for taking the time to respond. -Greg Hickman

1 0

Property maps
by Edward Diener 04 Nov '02

04 Nov '02

The documentation for boost::property_map is awful, so would someone please explain to me what this implementation does and how it differs from std::map<> and std::multi_map<> ? I know this post sounds irascible and I am not trying to dump on Mr. Siek but really I do not understand what this idea is or why one should use it over and above what already exists in the C++ standard library. I only wish that Boost implementors would stop explaining their ideas through examples and start explaining them in logical ways in which a knowledge of the English language would suffice.

1 0

RE: [Boost-Users] Iterator Adaptor Question
by Mark Storer 04 Nov '02

04 Nov '02

>Specifically, I'd like to prevent clients from writing the two lines >preceeding the return from main below. Can anyone help? Eh? You wrote up your sample so anyone could easily compile it... and I did. On VC++ v6, I got two compiler errors: samplecode.cpp(58) : error C2663: 'reset' : 2 overloads have no legal conversion for 'this' pointer samplecode.cpp(59) : error C2678: binary '=' : no operator defined which takes a left-hand operand of type 'const class boost::shared_ptr<struct Shape const >' (or there is no acceptable conversion) These errors are on the two lines you want to prevent. My first impression of the code was that it was already illegal to perform those two actions. You shouldn't be able to call non-const functions through a const_iterator, and since neither reset() nor operator=() are const, no problem. Right? I wasn't expecting the first error message, but the second is in line with my expectations. I take it this code compiles for you? What tools/OS/etc are you using? --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Hickman, Greg [mailto:greg.hickman@lmco.com] Sent: Friday, November 01, 2002 2:22 PM To: Boost-Users (Boost-Users(a)yahoogroups.com) Subject: [Boost-Users] Iterator Adaptor Question 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; } Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

Bug fix for format library
by Fred Jackson 04 Nov '02

04 Nov '02

I found a bug in the format library and fixed it. strm << boost::format("%64.64s") % "hello"; gave an access violation. It was caused by passing an argument greater than the string length to std::string::erase. I added a check so as not to try to erase text that is not there. Here is a diff of my small fix. < is feed_args.hpp from the boost_1_29_0 distribution. > is my fixed file. 158c158,162 < if (specs.truncate_ >= 0) --- > // @@@@@ fjackson 20021022 Added test to make sure we don't call > // std::string::erase with an arg greater than the length - this > // caused an access violation, noted on outputting a short string > // with a %64.64 format specifier. > if (specs.truncate_ >= 0 && specs.truncate_ < res.length())

1 0

Wrapping a std::list with boost.python
by jefflholle 03 Nov '02

03 Nov '02

I've just started experimenting with version 2 of boost.python. In iterator.cpp, a std::list is wrapped using following code: typedef std::list<int> list_int; void push_back(list_int& x, int y) { x.push_back(y); } int back(list_int& x) { return x.back(); } . . . class_<list_int>("list_int") .def("push_back", push_back) .def("back", back) .def("__iter__", iterator<list_int>()) ; Is it possible to use the container methods instead of user defined functions? I've tried the code: class_<list_int>("list_int") .def("push_back", &list_int::push_back) .def("back", &list_int::back) .def("__iter__", iterator<list_int>()) ; This doesn't work. Am what I'm tried to do possible? If so, how?

2 1

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

03 Nov '02

sorry, have fixed the problem. the correct way of linking with boost::thread is: g++ foo.cpp -lboost_thread -lpthread yours eske

1 0

Making boost/test pause so the console can be read when running the tester from an IDE.
by Sean Shubin 03 Nov '02

03 Nov '02

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. #include <boost/test/unit_test.hpp> using boost::unit_test_framework::test_suite; using std::cout; using std::cin; using std::endl; void waitForUserToPressEnter() { cout << "Press <ENTER> to continue..." << endl; cin.get(); } test_suite* init_unit_test_suite(int argc, char* argv[]) { test_suite* test = BOOST_TEST_SUITE("Master test suite"); //add other tests here test->add(BOOST_TEST_CASE(&waitForUserToPressEnter)); return test; }

4 3

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 01 Nov '02

01 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 01 Nov '02

01 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 01 Nov '02

01 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 31 Oct '02

31 Oct '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 31 Oct '02

31 Oct '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

d_heap bug
by Tsvetomir Valtchev 31 Oct '02

31 Oct '02

[I tried to contact the library's author, dietmar.kuehl@claas- solutions.de, but the message bounced back.] Dear Dietmar, I was looking for a better heap class than the one in STL and I was delighted to come across your d_heap class included in the Boost library. Unfortunately, I had a number of problems with it, and I figured you might be interested in some feedback. First, the class didn't compile with VC.NET (and probably won't with VC 6 either). This might be due to non-conformance on the part of Microsoft's compiler and some known limitations with template support, but for some of the issues I think they were due to the non- conformance of the code itself. Second, to my dismay, the code turned out to be seriously flawed. The following simple fragment, for example, causes a crash: THeap::pointer ptrs[10]; ptrs[0] = heap.push(12); ptrs[1] = heap.push(16); heap.remove(ptrs[0]); heap.remove(ptrs[1]); After some debugging and deciphering of the code, I found that the remove() function didn't handle a special case where the node to be 'sifted up' coincided with the last "hole" left in the tree. I think pop() had a similar problem. (In my fixed version, I have expressed pop() in terms of remove(), which resolves the problem and also avoids some code duplication.) I hope some day you get around to publishing an improved version. Another suggestion I have is some way to make sure that the pointer's passed back by client code are valid. Extensive use of assertions throughout the code might also prevent various programming errors. Regards, // Chango V.

1 0

Regex++ and UTF-8
by Gitit 31 Oct '02

31 Oct '02

Hi, We want to use regex++ (version 3.31) with UTF-8 strings. I tried to match a UTF-8 character of 2 bytes to the regex "." and the match failed. It seems regex++ handles these 2 bytes as two separate characters. 1) Is there a "native" way in the regex++ library for using UTF-8 strings? Can we use UTF-8 strings to compare against a compiled regex (the regex is in ASCII only)? Can the regex itself hold UTF-8 characters? 2) Is converting to wchar_t our only option? As far as I understand, wchar_t does not cover the entire range of characters covered by UTF-8, so it may not be enough. Any other ideas? thanks, Gitit.

1 0

Re: [Boost-Users] Re: regex: flag for "global" search?
by dick.bridges＠tais.com 30 Oct '02

30 Oct '02

The boost::regex_search example bumps the start to march through the sub-expressions and the boost::regex_grep examples demonstrate using the 'callback' for each term. I was kinda hoping the library provided a "convenience version" that would take something like "(\\w+)(?:\\.(\\w+))*" and populate the match_results as if the terms had been expanded <e.g.> "(\\w+)(?:\\.(\\w+))?(?:\\. (\\w+))?(?:\\.(\\w+))?"</e.g.> Perhaps to some arbitrary limit? Oh well, given the riches provided, a little while loop now and then is surely a small price to pay. ;) Thanks for the response. I'm continually amazed at the ethos fostered by Boost group members. "Edward Diener" <eddielee@tropic To: boost-users(a)yahoogroups.com soft.com> cc: Sent by: news Subject: [Boost-Users] Re: regex: flag for "global" search? <news(a)main.gmane .org> 10/29/2002 04:54 PM Please respond to Boost-Users Use boost::regex_grep. The boost::regex_search only finds the first match. <dick.bridges(a)tais.com> wrote in message news:OF6181960C.1A0F5C63-ON88256C61.006996C6@tais.net... > I'm trying to capture the sub-expressions in a fqdn (e.g., > one.two.three.com.) One piece of Perl-speak for the expression is: "/ > (\w+)\./g". I've been using boost_search and trying variations on "(?: > (\\w+)\\.)+" but I can't seem to get all the sub-expressions into the > match_results. > > There's got to be a flag I've been overlooking. Any suggestion will be > appreciated. Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

regex: flag for "global" search?
by dick.bridges＠tais.com 30 Oct '02

30 Oct '02

I'm trying to capture the sub-expressions in a fqdn (e.g., one.two.three.com.) One piece of Perl-speak for the expression is: "/ (\w+)\./g". I've been using boost_search and trying variations on "(?: (\\w+)\\.)+" but I can't seem to get all the sub-expressions into the match_results. There's got to be a flag I've been overlooking. Any suggestion will be appreciated. TIA

3 2

Gcc-3.2, statistic_tests.cpp and <limits>
by pcarlini.rm 29 Oct '02

29 Oct '02

Hi, the PR libstdc++/6718 in the Gcc bug database is about a run time problem with this Boost testcase: paolo:~/Programming/c++/boost_1_29_0/libs/random> a.out Confidence level: 0.99; 1-alpha = 0.01; chi_square(19, 36.191) = 0.99 Running tests on minstd_rand KS: 4750* [0] 9500* [0] equidistribution: a.out: statistic_tests.hpp:571: void generic_counter<RandomA ccessContainer>::operator()(int) [with RandomAccessContainer = std::vector<int, std::allocator<int> >] : Assertion `static_cast<unsigned int>(i) < container.size()' failed. Abort According to Nathan Sidwell and Gaby Dos Reis analysis the problem is due to well known issues with numeric_limits<double>::infinity of 3.2's run time library for which unexpectedly Boost provides no work arounds. On the contrary, 2.95.x worked just fine. Please let me know if you need any additional information, ciao, Paolo.

1 1

AW: [Boost-Users] boost::bind problem
by Jasper, Alexander 29 Oct '02

29 Oct '02

-----Ursprüngliche Nachricht----- Von: Mark Snelling [mailto:mark@bakedbeans.com] Gesendet: Dienstag, 29. Oktober 2002 17:44 An: Boost-Users(a)yahoogroups.com Betreff: [Boost-Users] boost::bind problem [...] typedef priority_queue<shared_ptr<Functor>, vector<shared_ptr<Functor> >, bind(less<int(), bind(&Functor::priority, _1), bind(&Functor::priority, _2))> MyQueue; As far as I know you can't call a function in a typedef. bind(..) is a function call returning a predicate. But does s.o. know how to use bind in this manner. I failed to, since the type of what bind returns is far to complex. And it is required if you want to to use bind in conjunction with maps or the priority_queue's. You have to wrap the call in your own predicate. alex

1 0

boost::bind problem
by Mark Snelling 29 Oct '02

29 Oct '02

Hello, I was wondering if anyone out there in Boost land could give me a hand here? Here's the problem: I have a class A: class A { public: A(int i) : _priority(i) {} int priority() {return _priority;} private: int _priority; }; What I want to do is create a std::priority_queue based on boost::shared_ptr<A> and use boost::bind/compose to create the sorting function required by std::priority_queue. However, when I try and typedef the queue (to save a lot of typing) I get compiler errors on VS.NET. using namespace std; using namespace boost; typedef priority_queue<shared_ptr<Functor>, vector<shared_ptr<Functor> >, bind(less<int(), bind(&Functor::priority, _1), bind(&Functor::priority, _2))> MyQueue; Am I going about this the right way? Any help appreciated. TIA Mark.

1 0

Graph library: parallel edges
by Juerg Tschirren 29 Oct '02

29 Oct '02

With the Boost Graph Library, I try do create an undirected graph that does not allow parallel edges, so far without success. Does anybody have a small example that shows how to do this? Juerg

2 1

Graph library: vertex type
by Juerg Tschirren 29 Oct '02

29 Oct '02

In the Boost Graph Library, is it possible to have a custom-defined type for vertices, e.g., I would like to have boost::graph_traits<Graph>::vertex_descriptor map to std::pair<int,int> Can this be done? If yes, how? Juerg

2 1

Re: [Boost-Users] MSVCNT not used anymore?
by dick.bridges＠tais.com 28 Oct '02

28 Oct '02

Thanks! That worked. The MSVCNT example on http://www.boost.org/tools/build/build_system.htm must be left over from a previous version. Appreciate the quick response. sashan <sashang(a)ihug.co To: Boost-Users(a)yahoogroups.com .nz> cc: Subject: Re: [Boost-Users] MSVCNT not used anymore? 10/29/2002 04:20 AM Please respond to Boost-Users dick.bridges(a)tais.com wrote: >I'm having a senior moment. > >MSVCNT is set to C:\Program Files\Microsoft Visual Studio\VC98 and bjam is >invoked with "-sTOOLS=msvc" but the command line that gets invoked is C: >\Program Files\Microsoft Visual C++\VC98\bin\cl and, of course I get: "The >system cannot find the file specified." > >Where's the instructions for compiling with VC6, SP4? > > This is my command line (saved in a batch file): bjam -sTOOLS=msvc -sBUILD=release -sMSVC_ROOT=D:\msvs\VC98 -sVISUALC=D:\msvs\VC98 I don't think MSVCNT is used see http://www.boost.org/tools/build/msvc-tools.html -- P: Egad! You astound me, Brain! B: That's a simple task, Pinky. Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

MSVCNT not used anymore?
by dick.bridges＠tais.com 28 Oct '02

28 Oct '02

I'm having a senior moment. MSVCNT is set to C:\Program Files\Microsoft Visual Studio\VC98 and bjam is invoked with "-sTOOLS=msvc" but the command line that gets invoked is C: \Program Files\Microsoft Visual C++\VC98\bin\cl and, of course I get: "The system cannot find the file specified." Where's the instructions for compiling with VC6, SP4?

2 1

are examples on maual page ready to run?
by J-S Lin 28 Oct '02

28 Oct '02

The error message is as follows, --------------------------------- g:\C++ notes\test_boost\test_matrix.cpp(14) : error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'boost::numeric::ublas::matrix' (or there is no acceptable conversion) with [ T=double, F=boost::numeric::ublas::row_major, A=boost::numeric::ublas::unbounded_array ] ------------------------------ Much appreciated. J-S Lin

2 2

lexical_cast fails to convert std::string to boost::dynamic_bitset<>
by Klaus Nowikow 28 Oct '02

28 Oct '02

Hi! I am trying to convert a string to a boost::dynamic_bitset using boost::lexical_cast, as in this example: template <class Value> bool GetValue(const std::string& str, Value& val) { try { val = boost::lexical_cast<Value>(str); } catch(boost::bad_lexical_cast&) { return false; } return true; } int main() { std::string str = "01"; boost::dynamic_bitset<> bits; if(!GetValue(str, bits)) { [...] } } The lexical_cast always throws an exception. The problem seems to be in lexical_cast.hpp, where a temporary object is created: Target result; if(!(interpreter << arg) || !(interpreter >> result) || !(interpreter >> std::ws).eof()) throw bad_lexical_cast(); and in dynamic_bitset.hpp, where operator>>(std::basic_istream<CharT, Traits>&, dynamic_bitset<Block, Allocator>&) iterates over the bitset using the size() (which is, of course, 0). I sure could solve my particular problem by providing an explicit template instantiation of the GetValue() function, but I don't want to do this because the code is for a library, and I want to reduce references to other libraries to an absolute minimum. Did I miss something here, or is there a workaround for this problem? Regards, Klaus

1 0