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

limiting searches in BGL
by Jason Crosswhite 16 Jun '04

16 Jun '04

Hello, I am just starting to use the BGL, and have been beating my head upon a problem. I am needing to find an irregularly bounded set of points in three dimensional space. The points are within a convex hull and the graph edges are edges in a delaunay triangulation. I want to start at a node known to be on the hull, and crawl through the inside with either depth first or breadth first search. If you are on the hull, you would not allow the search to continue outside the hull. I thought of doing this with a simple visitor, and color the unwanted vertices black. However, from inside the scope of the visitor, I do not believe I can have access to the colors. Several ugly hacks come to mind, but I would like to know if there is an easy way of doing this first? -Jason Crosswhite

3 4

Re: limiting searches in BGL
by Vladimir Prus 16 Jun '04

16 Jun '04

Hi Jason, > I am just starting to use the BGL, and have been beating my head upon a > problem. I am needing to find an irregularly bounded set of points in > three dimensional space. The points are within a convex hull and the > graph edges are edges in a delaunay triangulation. I want to start at a > node known to be on the hull, and crawl through the inside with either > depth first or breadth first search. If you are on the hull, you would > not allow the search to continue outside the hull. I think you might want to use 'TerminatorFunc' argument to depth_first_visit. That's a functor which returns true if the search should not continue after a certain vertex. - Volodya

1 0

dynamic boost::array and performance/size of STL vector
by Bo Peng 15 Jun '04

15 Jun '04

Dear list, I frequently need to use arrays with undetermined (at compile time) but constant (user specify size) size. I.e., I need something like boost::array<int> arr(5); without arr.insert etc, rather than boost::array<int,5> arr; which only accept constant array length. Of course I can use 'vector<int> arr(5)' in this case but I am worry about the performance and size overhead, specifically: 1. How is size() implemented in vector<>? I am concerned with this function since icc (intel c++ compiler) can not vectorize 'for(i=0;i<arr.size();i++)' unless arr.size() is an inlined reference to a variable. 2.Since I will have a lot of such arrays, I would also like to know how many additional variables vector<int> keeps. I.e. exactly how big is vector<int> arr(5)? It might be trivial to copy boost::array and add constructor/destructor but I do not want to re-invent the wheel. Thanks. Bo

4 5

RE: [Boost-users] Regex lookahead/lookbehind
by James Gunn 15 Jun '04

15 Jun '04

*** Before acting on this e-mail or opening any attachment you are advised to read the disclaimer at the end of this e-mail *** Hi John, > -----Original Message----- > From: John Maddock [mailto:john@johnmaddock.co.uk] > Sent: 15 June 2004 12:40 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Regex lookahead/lookbehind > > > > Hi all, > > > > Is it possible to do lookahead and/or lookbehind within > boost::regex? > > Lookahead is supported at present, lookbehind will be in the > next revision (currently in cvs in the branch called regex5). > > John. Thanks for the quick response. In the end I managed to solve my current problem without needing lookahead or lookbehind. I used your (earlier) advice of checking for word boundaries at the beginning and end of my regular expression and this has helped loads! The latest version of my postcode validation expression is shown below: (\bGIR\s0AA\b)| (\b[^QVX\W0-9][^IJZ\W\s]([0-9]{1,2}?|[ABCDEFGHJKSTUW0-9]?|[0-9][ABEHMNPRVWXY ]?) \s+\d[^CIKMOV]{2}\b) I'm certain that the expression could be made simpler and that it could also be made more efficient but I'm not sure where. Cheers, James ********************************************************************** Please note: This e-mail and its attachments contain only the opinions of the sender and do not necessarily reflect the policy(s) of the communisis group in general. Employees of the communisis group are required not to make any defamatory statements and not to infringe or authorise any infringement of copyright or any other legal right by e-mail. Any such communication is therefore outside the scope of employment of the individual concerned. The communisis group will not accept any liability in respect of such a communication. Confidentiality: This e-mail and any attachments, together with their contents, are confidential unless otherwise explicitly stated in writing by the sender of this e-mail and are for the intended recipient only. If they have come to you in error you must not take any action in respect of them, which includes but is not limited to reproducing, sending or storing them, other than to notifying the sender immediately of the mistake, and deleting the e-mail, any attachments and any reproductions made by replying to it. Viruses: This e-mail and any attachments have been scanned for viruses but we cannot guarantee that they are virus free. The recipient should check this e-mail and any attachments for viruses. The communisis group accepts no responsibility for any damage caused by any virus transmitted by this e-mail or any of its attachments. In the event of any unauthorised copying or forwarding, the recipient will be required to indemnify the communisis group against any claim for loss or damage caused by any viruses or otherwise. ********************************************************************** ______________________________________________________________________ This email has been scanned by the MessageLabs Email Security System. For more information please visit http://www.messagelabs.com/email ______________________________________________________________________

1 0

Regex lookahead/lookbehind
by James Gunn 15 Jun '04

15 Jun '04

*** Before acting on this e-mail or opening any attachment you are advised to read the disclaimer at the end of this e-mail *** Hi all, Is it possible to do lookahead and/or lookbehind within boost::regex? Thanks in advance James Gunn Software Developer --LongSig Computer Bureau Communisis DM Manston Lane Crossgates Leeds LS15 8AH Telephone +44 (0)113 225 5306 Fax +44 (0)113 225 5921 Email James.Gunn(a)communisis-dm.co.uk ********************************************************************** Please note: This e-mail and its attachments contain only the opinions of the sender and do not necessarily reflect the policy(s) of the communisis group in general. Employees of the communisis group are required not to make any defamatory statements and not to infringe or authorise any infringement of copyright or any other legal right by e-mail. Any such communication is therefore outside the scope of employment of the individual concerned. The communisis group will not accept any liability in respect of such a communication. Confidentiality: This e-mail and any attachments, together with their contents, are confidential unless otherwise explicitly stated in writing by the sender of this e-mail and are for the intended recipient only. If they have come to you in error you must not take any action in respect of them, which includes but is not limited to reproducing, sending or storing them, other than to notifying the sender immediately of the mistake, and deleting the e-mail, any attachments and any reproductions made by replying to it. Viruses: This e-mail and any attachments have been scanned for viruses but we cannot guarantee that they are virus free. The recipient should check this e-mail and any attachments for viruses. The communisis group accepts no responsibility for any damage caused by any virus transmitted by this e-mail or any of its attachments. In the event of any unauthorised copying or forwarding, the recipient will be required to indemnify the communisis group against any claim for loss or damage caused by any viruses or otherwise. ********************************************************************** ______________________________________________________________________ This email has been scanned by the MessageLabs Email Security System. For more information please visit http://www.messagelabs.com/email ______________________________________________________________________

2 1

Regex failing to match postcodes
by James Gunn 15 Jun '04

15 Jun '04

*** Before acting on this e-mail or opening any attachment you are advised to read the disclaimer at the end of this e-mail *** Hi all, I'm having some difficulty getting my regular expression working. Basically, I need to make sure that a UK postcode is valid. The postcode that is passed to my function sometimes has extra things with it such as: Wakefield, WF1 3RD Shrewsbury SY2 5PT Shropshire It now seems to be failing to find the postcode in the above examples. Also, when I pass my function a postcode that I know is invalid, such as JG2 7L5 it matches it as G2 7L5 instead of failing to do the match. The regular expression I'm using is below: (?:(?:(^|\s)+ A[BL]|B[ABDHLNRST]?| C[ABFHMORTVW]|D[ADEGHLNTY]|E[CHNX]?|F[KY]|G[LUY]?| H[ADGPRSUX]|I[GMPV]|JE|K[ATWY]|L[ADELNSU]?|M[EKL]?| N[EGNPRW]?|O[LX]|P[AEHLOR]|R[GHM]|S[AEGKLMNOPRSTWY]?| T[0ADFNQRSW]|UB|W[ACDFNRSV]?|YO|ZE) \d(?:\d|[A-Z])?\s+\d[A-Z]{2}($|\s)+) Can anyone tell me whats wrong with my expression? BTW I'm using boost 1.31.0 on VC++ 7.1, Windows XP. James Gunn Software Developer --LongSig Computer Bureau Communisis DM Manston Lane Crossgates Leeds LS15 8AH Telephone +44 (0)113 225 5306 Fax +44 (0)113 225 5921 Email James.Gunn(a)communisis-dm.co.uk ********************************************************************** Please note: This e-mail and its attachments contain only the opinions of the sender and do not necessarily reflect the policy(s) of the communisis group in general. Employees of the communisis group are required not to make any defamatory statements and not to infringe or authorise any infringement of copyright or any other legal right by e-mail. Any such communication is therefore outside the scope of employment of the individual concerned. The communisis group will not accept any liability in respect of such a communication. Confidentiality: This e-mail and any attachments, together with their contents, are confidential unless otherwise explicitly stated in writing by the sender of this e-mail and are for the intended recipient only. If they have come to you in error you must not take any action in respect of them, which includes but is not limited to reproducing, sending or storing them, other than to notifying the sender immediately of the mistake, and deleting the e-mail, any attachments and any reproductions made by replying to it. Viruses: This e-mail and any attachments have been scanned for viruses but we cannot guarantee that they are virus free. The recipient should check this e-mail and any attachments for viruses. The communisis group accepts no responsibility for any damage caused by any virus transmitted by this e-mail or any of its attachments. In the event of any unauthorised copying or forwarding, the recipient will be required to indemnify the communisis group against any claim for loss or damage caused by any viruses or otherwise. ********************************************************************** ______________________________________________________________________ This email has been scanned by the MessageLabs Email Security System. For more information please visit http://www.messagelabs.com/email ______________________________________________________________________

3 2

[uBLAS] Compilation problem with VC 7.1
by kjfh kjnk 15 Jun '04

15 Jun '04

Hi, This simple code creates 2 ublas vector and computes the inner_product. It does not compile with VC 7.1: --------------------------------------------------- #include <iostream> #include <string> #include <boost/concept_check.hpp> #include <boost/numeric/ublas/matrix.hpp> namespace ublas = boost::numeric::ublas; int main(int argc, char **argv) { ublas::vector<unsigned short> toto(3); ublas::vector<double> tata(3); double titi = ublas::inner_prod(toto, tata); return 0; } --------------------------------------------------- Here is the compilation: *************************************************** C:\Temp\ublas>cl -I"C:\Program Files\boost_1_31_0" /EHsc ublas-test.cpp Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 13.10.3052 for 80x86 Copyright (C) Microsoft Corporation 1984-2002. All rights reserved. ublas-test.cpp ublas-test.cpp(12) : error C2440: 'initializing' : cannot convert from 'boost::numeric::ublas::vector_scalar_binary_traits<E1,E2,F>::result_type' to 'double' with [ E1=boost::numeric::ublas::vector<unsigned short>, E2=boost::numeric::ublas::vector<double>, F=boost::numeric::ublas::vector_inner_prod<unsigned short,double,boost::mpl::if_c<false,unsigned short,boost::numeric::ublas::promote_traits<unsigned short,double>::builtin_promote_type>::type> ] No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called C:\Temp\ublas> **************************************************** It compiles well with with VC 6.0, but the result is not good... (with a proper initialisation) Anybody has an idea ? JD ___________________________________________________________ALL-NEW Yahoo! Messenger - sooooo many all-new ways to express yourself http://uk.messenger.yahoo.com

2 2

BGL on VC 6.0
by Boris Kagan 15 Jun '04

15 Jun '04

Hi All, I have a problem in compiling my very first example in BGL - quick_tour.cpp, using boost-1_31, VC 6.0 and native Microsoft stl. I've got the following error messages: c:\boost\include\boost-1_31\boost\graph\detail\adjacency_list.hpp(1055) : error C2244: 'bidirectional_graph_helper_with_property<Config>::remove_edge' : unable to resolve function overload c:\boost\include\boost-1_31\boost\graph\detail\adjacency_list.hpp(1057) : error C2954: template definitions cannot nest c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(45) : error C2143: syntax error : missing ';' before '<' c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(57) : see reference to class template instantiation 'is_incrementable_::impl<T>' being compiled c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(45) : error C2059: syntax error : '<' c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(57) : see reference to class template instantiation 'is_incrementable_::impl<T>' being compiled c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(45) : error C2039: 'type' : is not a member of '`global namespace'' c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(57) : see reference to class template instantiation 'is_incrementable_::impl<T>' being compiled c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(45) : error C2238: unexpected token(s) preceding ';' c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(57) : see reference to class template instantiation 'is_incrementable_::impl<T>' being compiled c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(52) : error C2653: 'mpl' : is not a class or namespace name c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(57) : see reference to class template instantiation 'is_incrementable_::impl<T>' being compiled c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(52) : error C2143: syntax error : missing ';' before '<' c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(57) : see reference to class template instantiation 'is_incrementable_::impl<T>' being compiled c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(52) : error C2059: syntax error : '<' c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(57) : see reference to class template instantiation 'is_incrementable_::impl<T>' being compiled c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(56) : error C2238: unexpected token(s) preceding ';' c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(57) : see reference to class template instantiation 'is_incrementable_::impl<T>' being compiled c:\boost\include\boost-1_31\boost\detail\is_incrementable.hpp(69) : fatal error C1903: unable to recover from previous error(s); stopping compilation My question is : May I use BGL 1_31 using VC6.0 with all restrictions of VC6.0 compiler? Thanks a lot for your advice, Kagan Boris. Software Engineer, NC-Infrastructure Team, Cimatron Ltd.

1 0

How to use STL and Boost in C codes.
by Jeff Wang 15 Jun '04

15 Jun '04

Dear Lists, I am working on a projects which was written in C (*.c), is there any way to use STL Vector or Boost Smart pointer class in this original C codes. WHen I compiled these C codes with VC6.0++, and included with <vector>, the compile give fatal eroor C1189: #error :"eh.h is only for C++!", Any work around without modifying the codes are weclomes, thanks. Jeff __________________________________ Do you Yahoo!? Friends. Fun. Try the all-new Yahoo! Messenger. http://messenger.yahoo.com/

3 2

RE: [Boost-users] Re: newbie question: missing libs ?
by Randy.Ormond＠ngc.com 14 Jun '04

14 Jun '04

Thanks, Randy -----Original Message----- From: Rene Rivera [mailto:grafik.list@redshift-software.com] Sent: Friday, June 11, 2004 3:42 PM To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: newbie question: missing libs ? Randy.Ormond(a)ngc.com wrote: > After building Boost 1.31.0 on Linux and on Irix, I expected to see a > smart pointer library, something like libboost_smart_ptr-gcc-mt.so If > fact, it looks like only date_time, filesystem, prg_exec, regex, > signals, test_exec_monitor, thread, and unit_test_framework were > built. I didn't see any error messages. Did I do something wrong? Nothing is wrong. Most Boost libraries are entirely implemented in headers. So no libraries need to be built for them. -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com - 102708583/icq _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0