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

tokenizer: exceptions not documented
by Keith MacDonald 25 Apr '04

25 Apr '04

I discovered the hard way that tokenizer (from CVS head) can throw escaped_list_error. It would help if that was documented. Keith MacDonald

1 0

Iterators
by Witz 24 Apr '04

24 Apr '04

just a quick question - which maybe should have been directed at the developers list but ... would it be possible in the iterator adaptors to have an operator== defined that takes the base iterator as the right hand side? it would certainly cut down on typing and also obviate the need to create an end iterator that is only used as an 'end of container' sentinel value if it was possible it would allow us to write, for example: copy( make_filter_iterator<is_positive_number>(numbers, … [View More]

3 5

boost format problems
by Navneet Dalal 23 Apr '04

23 Apr '04

Hi I decided to try boost::format for more compact and typesafe formatting of text. However, I am running into some problems. Problem 1 ============== The following line throws boost:bad_format_string exception. std::cout << format("%|1| %|2$3|") % "Hello" % 3 << std::endl; However, this one works std::cout << format("%|1|") % "Hello" << std::endl; All I want to do is use notation for printing character streams i.e. %|1| instead of %1% Is this a bug or I am doing … [View More]

2 1

Compilation problem with BOOST::filesystem lib
by Peter Koerber 23 Apr '04

23 Apr '04

Hello, i try to compile the *.cpp files of boost::filesystem within the following environment: os: Windows XP compiler: Visual C++ Toolkit 2003 (this is the free version of MS Visual C++ V7.1) boost: Version 1.31.0 If BOOST_WINDOWS is defined, the file windows.h is included in the sources: * exception.cpp * operations_posix_windows.cpp. Otherwise the file errno.h is included. BOOST_WINDOWS is defined within the environment mentioned above, but the compiler does not have a … [View More]

2 1

BGL: INTERNAL COMPILER ERROR in VC7.1
by Nicholas Burlett 22 Apr '04

22 Apr '04

I'm rather unsure about what is causing this, but I get an internal compiler error in Visual C++ 7.1 when using BGL in some specific circumstances. I have a graph defined in class Graph defined as such: typedef property<edge_feedback_t, bool> EdgeFeedback; typedef property<edge_sourcejack_t, IAudioOutputJack*, EdgeFeedback> EdgeSourceJack; typedef property<edge_destinationjack_t, IAudioInputJack*, EdgeSourceJack> EdgeDestinationJack; typedef … [View More]

5 5

RE: [Boost-users] Compilation problem with BOOST::filesystem lib
by Ben Hutchings 22 Apr '04

22 Apr '04

Peter Koerber <pk(a)ExperTeam.de> wrote: > i try to compile the *.cpp files of boost::filesystem within the > following environment: > > os: Windows XP > compiler: Visual C++ Toolkit 2003 (this is the free version > of MS Visual C++ V7.1) > boost: Version 1.31.0 > > If BOOST_WINDOWS is defined, the file windows.h is included > in the sources: > * exception.cpp > * operations_posix_windows.cpp. > > Otherwise the file … [View More]

1 0

problems using VC 7.1 and boost regex library
by Keith Smith 22 Apr '04

22 Apr '04

Sorry if this is a resend, but not sure if the original got sent! I tried your suggestion, and it appears that I still have the same errors. Anyone have any other ideas? (See Attached) -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of John Maddock Sent: Thursday, April 15, 2004 5:45 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] problems using VC 7.1 and boost regex library > I have been … [View More]

2 1

Problems with installation of boost unit_test_framework
by Matthew Burgess 21 Apr '04

21 Apr '04

Hi folks, http://www.boost.org/libs/test/doc/components/unit_test_framework/compilati… states that I can include <boost/test/included/unit_test_framework.hpp> in order to avoid having to link against the unit_test_framework library. However, the files it #includes are located in the boost test library source directory which doesn't appear to be installed by the default bjam procedure (I just get '/opt/boost/lib' &'/opt/boost/include' directories after installing boost). If it helps … [View More]

1 0

problems using VC 7.1 and boost regex library ( this time with attachment )
by Keith Smith 21 Apr '04

21 Apr '04

1 0

problems using VC 7.1 and boost regex library
by Keith Smith 21 Apr '04

21 Apr '04

I tried your suggestion, and it appears that I still have the same errors. Anyone have any other ideas? (See Attached) -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of John Maddock Sent: Thursday, April 15, 2004 5:45 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] problems using VC 7.1 and boost regex library > I have been trying to compile the following code with VC 7.1 ( which > compiled … [View More]

1 0

Selection scheme for boost libraries
by Uli Tuerk 19 Apr '04

19 Apr '04

Hi all! I have a very basic problem with the boost libraries: I used bjam to build all boost libraries for Linux (using "gcc" as toolset and the call 'bjam "-sTOOLS=gcc" install'). All went fine, however I wanted to do the regression tests for boost_regex using the gcc.mak Makefile in <boost_main>/libs/regex/test/regress which uses "-lboost_regex" for linking. The linker reported an error because there is no "libboost_regex.so" in my lib folder unless I created a link with this name … [View More]

2 1

BGL assertion
by Val Samko 18 Apr '04

18 Apr '04

Something triggers the assert line in push_relabel_max_flow, assert(algo.is_flow()); is that internal push_relabel_max_flow problem, or this means I supply invalid data to this function? Val Samko http://val.digiways.com

1 0

Problems compiling boost.python with Boost 1.31.0
by Markus Sch�pflin 17 Apr '04

17 Apr '04

I'm trying to compile boost.python from Boost 1.31.0 on Tru64 5.1 with Compaq C++ V6.5-033. Python has been built like this: ./configure --with-cxx=cxx --prefix=/opt --exec-prefix=/opt/exec/OSF1-V5.1-a lpha --without-gcc The command line used to build boost.python looks like this: bjam -sTOOLS=tru64cxx65 -sPYTHON_ROOT="/opt" -sPYTHON_VERSION="2.3" stage When build boost.python I get the following error message: tru64cxx65-C++-action bin/boost/libs/python/build/libboost_python.so/… [View More]

3 3

broken link in boost.org FAQ
by Mike Morearty 17 Apr '04

17 Apr '04

Minor problem: on the FAQ at http://www.boost.org/more/faq.htm , the very first question is, "How do I download the libraries?" and the answer is, "See Download instructions." But "Download" is a broken link. Points to http://www.boost.org/libs/libraries.htm#Download ; although http://www.boost.org/libs/libraries.htm does exist, it does not contain an anchor called "Download". The FAQ should probably be changed to point to http://www.boost.org/more/getting_started.html , or maybe to … [View More]

1 0

[MPL] Runtime Interaction
by Debian User 16 Apr '04

16 Apr '04

[Sent via gmane but it never appeared] Hi gang, Suppose I have a number of types that each have a "value" enum, much like MPL's constant classes. Now suppose that I want to construct a runtime-indexable array of those values, according to the position of each type in an MPL vector. For example: int values[3]; typedef boost::mpl::vector_c<int,10, 11, 12> values; typedef some_magic_metafunction<values>::type runtime_function; // values[0] = 10, values[1] = 11, values[2] = 12 … [View More]

2 1

problems using VC 7.1 and boost regex library
by Keith Smith 15 Apr '04

15 Apr '04

I have been trying to compile the following code with VC 7.1 ( which compiled fine with VC 6 ) with no luck. std::string m_rBuffer; boost::regex m_rStartExp; string::const_iterator rRawDataBegin = m_rBuffer.begin(); string::const_iterator rRawDataEnd = m_rBuffer.end(); boost::cmatch rStartMessage; unsigned int flags = boost::match_default; while ( boost::regex_search(rRawDataBegin, rRawDataEnd, … [View More]

2 1

BGL linking on Win32
by maxx＠dgap.mipt.ru 15 Apr '04

15 Apr '04

Hi! whenever I use libbgl-viz.lib to read graphviz files, I get a linker errors like this: msvcprt.lib(MSVCP71.dll) : error LNK2005: "public: __thiscall std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >(class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const &)" (??0?$basic_string@DU?$… [View More]

2 1

RE: [Boost-users] Changing the heap allocator
by Jim.Hyslop 14 Apr '04

14 Apr '04

David Barrett-Lennard wrote: > Yes HeapSetInformation() will do it once you have the heap handle. > However, the CRT creates its own heap with a call to HeapCreate(), and > stores the heap handle in a global variable called _crtheap > that is not > exported by the library. Right, of course - I thought that GetProcessHeap() would return the correct heap, but it does not. -- Jim Hyslop Senior Software Designer Leitch Technology International Inc. (http://www.leitch.com) … [View More]

1 0

RE: [Boost-users] Changing the heap allocator
by Jim.Hyslop 14 Apr '04

14 Apr '04

David Barrett-Lennard wrote: > Does anyone know how to enable the LFH (low fragmentation > heap) for the > heap created by the VC CRT? Have you tried HeapSetInformation()? -- Jim Hyslop Senior Software Designer Leitch Technology International Inc. (http://www.leitch.com) Columnist, C/C++ Users Journal (http://www.cuj.com/experts)

2 1

Changing the heap allocator
by David Barrett-Lennard 13 Apr '04

13 Apr '04

Hi, I'm working on a project where I've replaced Microsoft's (terrible) heap allocator with the Doug Lea allocator. There seems to be some cases where the Windows XP allocator is 500 times slower than it should be. This made my program take minutes rather than seconds to run. To try to understand what kind of allocation patterns cause the behaviour I wrote a small console application (see below). After playing around with different allocation patterns for half an hour I found a case where … [View More]

3 4

Using boost::regex 1.31.0 on vc6
by Chris Branch 10 Apr '04

10 Apr '04

Hi, I'm trying to use boost::regex 1.31.0 (the v4 source code) on MSVC++6 (sp5), but whenever I compile a project using the new code I get an internal compiler error in perl_matcher_common.hpp and no object is built. I want to use the new v4 code (the older v3 code works, and I'll use that if I have to) but this file is quite important... is there something I can do, or does it not work with VC6? Thanks, Chris

2 2

boost::thread and boost::bind
by GoochRules! 10 Apr '04

10 Apr '04

I am attempting to do this in vs.net 2003: int f(HANDLE, HANDLE, HANDLE); int main(int argc, char* argv[]) { HANDLE x; HANDLE y; HANDLE z; boost::thread* p = new boost::thread(boost::bind(f, x, y, z); p->join(); delete p; } As a contrived example it works. In my project it does not, spewing out 5 errors: 1) c:\src\include\boost\bind.hpp(62) : error C2825: 'F::result_type': cannot form a qualified name c:\src\include\boost\bind\bind_template.hpp(16) : see reference … [View More]to class template instantiation 'boost::_bi::result_traits<R,F>' being compiled with [ R=boost::_bi::unspecified, F=int (__cdecl *)(HANDLE,HANDLE) ] c:\src\ansa-1.0\src\main\main.cpp(369) : see reference to class template instantiation 'boost::_bi::bind_t<R,F,L>' being compiled with [ R=boost::_bi::unspecified, F=int (__cdecl *)(HANDLE,HANDLE), L=boost::_bi::list3<boost::_bi::list_av_3<fd_xpt,fd_xpt,fd_xpt>:: B1,boost::_bi::list_av_3<fd_xpt,fd_xpt,fd_xpt>::B2,boost::_bi:: list_av_3<fd_xpt,fd_xpt,fd_xpt>::B3> ] 2) c:\src\include\boost\bind.hpp(62) : error C2039: 'result_type' : is not a member of 'operator``global namespace''' 3) c:\src\include\boost\bind.hpp(62) : error C2146: syntax error : missing ';' before identifier 'type' 4) c:\src\include\boost\bind.hpp(62) : error C2955: 'boost::_bi::type' : use of class template requires template argument list c:\src\include\boost\bind.hpp(94) : see declaration of 'boost::_bi::type' 5) c:\src\include\boost\bind.hpp(62) : fatal error C1903: unable to recover from previous error(s); stopping compilation note: fd_xpt is declared as "typedef HANDLE fd_xpt;", and c:\src\ansa-1.0\src\main\main.cpp(369) is similar to "boost::thread* p = new boost::thread(boost::bind(f, x, y, z);" in the example. It appears that the compiler thinks my first argument is a "int (__cdecl *)(HANDLE,HANDLE)" when it is most certainly a "int (__cdecl *)(HANDLE,HANDLE,HANDLE)". It used to take two arguments, but I've since added a third (it was at this very point that these errors crashed the party). I am sure that there is no declaration that specifies only two arguments: I've had two other developers verify this. I have cleaned my project multiple times, even by hand, as well as getting a clean source tree from cvs, and yet I still get these errors. Any suggestions on how to silence these errors are greatly appreciated. --mpeltzer goochrules(a)hotmail.com [View Less]

3 3

Re: [boost] Re: [python] external references to python details
by Domenico Andreoli 10 Apr '04

10 Apr '04

hi, Lars Gullik Bj�nnes writes: > David Abrahams <dave(a)boost-consulting.com> writes: > > | larsbj(a)gullik.net (Lars Gullik Bj�nnes) writes: > > > >> I just discovered that boost libraries (or only one...) depend on > >> files in python/detail. That should probably be fixed? > > > | Got a suggested patch? > > Not really. > > With the subset I use from boost moving indirect_traits.hpp and > is_xxx.hpp from boost/python/detail/ … [View More]

1 0

template
by adel.essafi 08 Apr '04

08 Apr '04

hi list he is the source code of my project. it is an algorithms for scheduling DAG taks on machines. there is a template function that does not work well. please , can you guess where is the fault. thanks Accédez au courrier électronique de La Poste : www.laposte.net ; 3615 LAPOSTENET (0,34/mn) ; tél : 08 92 68 13 50 (0,34/mn)

1 0

template
by adel.essafi 08 Apr '04

08 Apr '04

hi list I am developping a scheduling algorithm. here you have the source code of my project. please , can you see what is wrong with it. thanks Accédez au courrier électronique de La Poste : www.laposte.net ; 3615 LAPOSTENET (0,34/mn) ; tél : 08 92 68 13 50 (0,34/mn)

1 0

RE: [Boost-users] Re: Any Success with AIX and GCC?
by James Zappia 08 Apr '04

08 Apr '04

I've compiled gcc on aix 4.3.3 in the past and no matter what c++ program I wrote, threading or no, I needed to specify the -pthread flag to get it to compile. It's an aix runtime thing with c++, pure c programs didn't have this problem. HTH, James -----Original Message----- From: Rene Rivera [mailto:grafik.list@redshift-software.com] Sent: Wednesday, April 07, 2004 12:55 PM To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: Any Success with AIX and GCC? Peter Jones wrote: > … [View More]

1 0

ublas and matrix expression
by Russell Hind 08 Apr '04

08 Apr '04

I have an expression a = (X^T * X)^-1 * X^T * y where x is an n * k matrix and y is an n row vector How do I implement this expression in ublas? I can create and populate the matrices and can do the product of matrices and the transpose use prod and trans, but I'm unsure on the ^-1. Can I do this with ublas? (I don't know much about matrices, but have been given the above expression as a way of finding a polynomial fit for a set of data). Thanks in advance Russell

4 14

Re: [Boost-users] Installing boost libraries with MS VC 6
by dmathews 08 Apr '04

08 Apr '04

Cheers for the help -got it compiling now.

1 0

Any Success with AIX and GCC?
by Peter Jones 08 Apr '04

08 Apr '04

Has anyone had any success compiling the latest version of boost wholesale with GCC on AIX? Besides the annoying dynamic linking problems, I am also getting failed links for wchar_t stuff: ld: 0711-317 ERROR: Undefined symbol: std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >::_Rep::_S_terminal With: Boost: 1.31.0 GCC: 3.3.2 AIX: 5.2 -- Peter Jones [unix;vi;crypto;c++;4wd] (http://pmade.org) PGP [5137 173E 5BFA 8C63 8982 F035 FDBB 1636 7D69 C63F]

4 8

Build boost with Codewarrior on OS X?
by Steve Folly 07 Apr '04

07 Apr '04

Hi, Has anyone built boost with: Mac OS X Panther Codewarrior 9.2 Cross-compiled for a Win32 target (and Mach-O target, for that matter). It's the Win32 target bit I'm having problems with. Cheers, Steve.

2 1

Installing boost libraries with MS VC 6
by dmathews 07 Apr '04

07 Apr '04

Hi, I hope you don't mind a total newbie question. I'm trying to make use of some c++ code from the web in a project of my own. However this code uses boost libraries. Specifically: #include <boost/numeric/ublas/matrix.hpp> using namespace boost::numeric::ublas; So I need to install these. However I don't really know what I'm doing (!) Do I need to build/install all of Boost? As I've really not got a clue how to do this and the documentation isn't abundantly clear. I tried just … [View More]

3 2

Boost::bind and protect
by Edward Diener 07 Apr '04

07 Apr '04

I am lost, even after looking at the code, of what protect is supposed to do in combination with boost::bind. I read this in the documentation, "Sometimes it is necessary not to evaluate the first argument, but not to evaluate some of the other arguments, even when they are nested bind subexpressions. This can be achieved with the help of another function object, protect, that masks the type so that bind does not recognize and evaluate it. When called, protect simply forwards the argument list … [View More]

2 1

[BGL] algorithms, design
by Val Samko 05 Apr '04

05 Apr '04

Hi, I find BGL extremely useful and flexible, but I am surprised that only a small number of algorithms is included with the library, although, numerous useful algorithms are implemented and available in boost/libs/graph/example . For example, why is the edge_connectivity function only available in edge-connectivity.cpp, and is not present in the library itself? I understand that I can copy the implementation of this function into my program, but why not include it in BGL? Is there any … [View More]

2 2

Spirit skip parser question.
by Jia Pu 05 Apr '04

05 Apr '04

I am trying to write a parser which skipps white space and C, Java style comments. To get familiar with spirit, I did some experiments, here is a question. First, I write a simple grammar to accept some non-white space chars. //////////////////////////////////////////////////////////////////////////// //// struct FOO_GRAMMAR : public grammar<FOO_GRAMMAR> { template <typename ScannerT> struct definition { typedef rule<ScannerT> rule_t; definition(ABNF_GRAMMAR const &… [View More]amp; self) { r_LETTER = range_p('a','z') | range_p('A','Z') | '.'; r = (+r_LETTER); } rule_t r, r_LETTER; rule_t const& start() const { return r; } }; }; //////////////////////////////////////////////////////////////////////////// //// I used FOO_GRAMMAR with space_p as skip parser: //////////////////////////////////////////////////////////////////////////// // FOO_GRAMMAR g; std::string line = "This is a test parser."; parse_info<> info = parse(line.begin(),line.end(), g, space_p); //////////////////////////////////////////////////////////////////////////// //// This works perfectly. Then, I tried to wrap the skip parser in a skip grammar, since eventually I need a more complicated parser. So I wrote the skip grammar as: //////////////////////////////////////////////////////////////////////////// /// struct SKIP_GRAMMAR : public grammar<SKIP_GRAMMAR> { template <typename ScannerT> struct definition { typedef rule<ScannerT> rule_t; definition(SKIP_GRAMMAR const & self) { rule_t r_SKIP = space_p; } rule_t r_SKIP; rule_t const& start() const { return r_SKIP; } }; }; ///////////////////////////////////////////////////////////////////////// I tried to parse the same sentence as before: /////////////////////////////////////////////////////////////////////////// FOO_GRAMMAR g; SKIP_GRAMMAR skip; std::string line = "This is a test parser."; parse_info<> info = parse(line.begin(),line.end(), g, skip); ////////////////////////////////////////////////////////////////////////// This time the parsing failed. Can anyone tell me why? I thought grammars are just like rules. And any suggestion on building a parser skipping certain pattern? I just can figure it out by reading the doc. Thank you. Jia (Jay) Pu Software Engineer LumenVox LLC ---------------------------------------------------------------------------- ------------ Anytime a linguist leaves the group the recognition rate goes up. --Fred Jelinek (then of the IBM speech group) (1988) [View Less]

1 0

Unexpected behavior in filesystem
by Martin Merck 05 Apr '04

05 Apr '04

Hi, I was trying the demo code from the filesystem library (searching for a file using the directory iterator). I noticed a strange behavior of the code. In the path I was searching I had a symbolic link, which was pointing to an unexisting file. The program throws now a exception with the following reason: boost::filesystem::is_directory: "/home/merck/CVS/test": No such file or directory Here 'test' is a link to some non exisitng file. It seems logical that the exception is thrown, however … [View More]

1 0

RE: [Boost-users] Re: about license
by Darryl Green 05 Apr '04

05 Apr '04

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > David Abrahams > Sent: Sunday, 4 April 2004 2:18 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Re: about license > > This has been sitting in my "to be dealt with" pile for quite some > time, because I couldn't figure out what to do with it. > > "Darryl Green" <Darryl.Green(a)unitab.com.au> writes:… [View More] > > > I've been trying to educate myself about the law in this area, > > with some help from Alexander Terekhov. I'm not at all convinced > > now that there is any derivative work produced by the compilation > > step > > I bet that's open to legal interpretation. Precisely. Thats what makes a trivial faq Q/A hard! > > > however this seems to make no difference to the result. > > Good. The intention of the license wording is to say that even if you > consider the compiled code a copy or a derivative work, the > requirement to embed a copy of the license doesn't apply to it. > > > It seems the compiled code is a translation of both works, > > I guess you mean the boost code and whatever it's compiled along with. > The latter could be nothing: there might only be boost code involved. > Anyway, can you cite something authoritative that gives compiled code > the status of a "translation" and not a "derivative work"? Actually, I'm not being careful enough with my words here - I should have said "mechanical translation". To quote from http://www.ipmall.info/hosted_resources/CopyrightCompendium/chapter_0300 .asp <quote> 306.02(a) Translations. A translation is a ren- -dering of a work from one language to another, as, for example, a work trans- -lated from Russian into French, or from German into English. However, trans- -literations and similar processes by which letters or sounds from one alpha- -bet are converted to another are not copyrightable since the conversion is merely a mechanical act. Thus, merely changing a work from the Cyrillic to the Roman alphabet would not be copyright- -able. </quote> The question is whether comiling source code is "merely a mechanical act". However, it seems reasonable to think that it is. I don't know how authoritative an answer you are looking for (presumably, in law that would need to be some sort of precedent) however Alexander did point me to the following discussion: http://www.crynwr.com/cgi-bin/ezmlm-cgi?3:mss:7659 http://www.crynwr.com/cgi-bin/ezmlm-cgi?3:mss:7663 http://www.crynwr.com/cgi-bin/ezmlm-cgi?3:mss:7679 http://www.crynwr.com/cgi-bin/ezmlm-cgi?3:mss:7680 It seems Rod Dixon at least (and he does cite some relevant material re. tests for originality) thinks that compilation doesn't produce a derivative work. Also, apparently the US copyright office thinks source code and object code are one and the same in at least some contexts - see: http://digital-law-online.info/lpdi1.0/treatise26.html <quote> VI.B. Source Code and Object Code ... Every computer program copyright case treats the copyright in the source code and the object code as equivalent... Even though source code and object code are distinct, it is still useful to maintain the concept that the source code and the object code are just different forms of the same copyrighted work. The Copyright Office regards the source code and object code as equivalent for purposes of registration... Where an applicant is unable or unwilling to deposit source code, he/she must state in writing that the work as deposited in object code contains copyrightable authorship. The Office will send a letter stating that registration has been made under its rule of doubt and warning that it has not determined the existence of copyrightable authorship. </quote> > > > agregated (a compilation) in some way then. I think whoever > > produces the compilation can license it however they like, > > subject to permission being granted by the authors of the > > original works to include their work in the compilation. > > I think the intent to grant that permission is made sufficiently > clear by the license text, don't you? No. Not so much because of the Boost license, but because of various other more exotic open source licenses such as the GPL in particular, changing the/my perception of what is "normal" or "expected" when it comes to copyright over software. I think it would be better spelt out clearly. However, I think at the end of the day the lawyers would figure it out as is - so the license meets the needs of lawyers at least. > > > I don't know if this is sufficiently clearly allowed by > > the wording of the boost license, though I think "use" > > must surely allow this for software source libs as there > > is no other way to "use" them. > > There are actually lots of ways to use them, but that is certainly *a* > use. Ok. > > > So the final answer is the same > > good. > > > but some of the questions and answers in between may be wrong. > > I don't know what _that_ means. Sorry - my earlier proposed FAQ Q/A might well be incorrect on some ponts of law but reaches the correct conclusion. > > > Have you received any feedback from lawyers about this? > > What is "this"? My earlier post containing the FAQ items, which you cced to the lawyers. I now understand the license sufficiently to use the code. I was hopeful that boost developers' time could be saved with a simple faq addition - but it my first attempt at that turns out (I think) to be innaccurate. I'm happy to put some time into correcting it, but ianal. If there is some lawyerly feedback I can use in correcting the FAQ proposal, I'm happy to do it. Beyond that, I don't want to waste more of your or the lawyers time on this. Regards Darryl Green. ########################################################################## This e-mail is for the use of the intended recipient(s) only. If you have received this e-mail in error, please notify the sender immediately and then delete it. If you are not the intended recipient, you must not use, disclose or distribute this e-mail without the author's prior permission. We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. ########################################################################## [View Less]

1 0

[BGL] johnson_all_pairs_shortest problem compiling
by Val Samko 04 Apr '04

04 Apr '04

Hi, Why doesn't the following code compile (VC++ 7.1, g++ 3.3.3, boost 1.31.0) ? ======================================================================== #include <boost/graph/adjacency_list.hpp> #include <boost/graph/johnson_all_pairs_shortest.hpp> int main() { using namespace boost; typedef adjacency_list<vecS, vecS, bidirectionalS, boost::property<boost::vertex_index_t, int, … [View More]

2 2

[BGL] documentation problem
by Val Samko 04 Apr '04

04 Apr '04

Hi, Is it required for a readable property map to have operator[]? At least, that is not mentioned at http://www.boost.org/libs/property_map/ReadablePropertyMap.html , so I assume, operator[] is not required. At http://www.boost.org/libs/graph/doc/johnson_all_pairs_shortest.html it is documented that weight_map named parameter must be a model of a readable property map. At johnson_all_pairs_shortest.hpp, line 101 we have w[e2] = w1[*e]; which assumes that weight_map has operator []. Is the … [View More]

2 2

RE: [Boost-users] Re: about license
by Darryl Green 04 Apr '04

04 Apr '04

> -----Original Message----- > From: David Abrahams [mailto:dave@boost-consulting.com] > Sent: Tuesday, 2 March 2004 12:43 AM > > "Darryl Green" <Darryl.Green(a)unitab.com.au> writes: > > > I'm happy to provide a patch once I'm reasonably sure I > understand the > > license. I'm assuming an email discussion will be more > productive than > > patches in the meantime. I have one more question that I > have a proposed > > FAQ answer … [View More]

2 1

[BGL] truncating dijkstra_shortest_paths
by Sven de Vries 03 Apr '04

03 Apr '04

Hi, in a given graph I want to determine whether between one (!) pair (u,v) of vertices there exists an u-v-path of length at most some given threshold and that path. I use dijkstra_shortest_paths(g,u, but to accelerate matters I would like to stop the computation as soon as the key of v becomes smaller than the threshold or v turns black. I couldn't find a hook of the dijkstra algorithm that could be used to achieve this. Do I really have to change the implementation of the dijkstra … [View More]

2 1

how to package graph related data ???
by Gustavo Sánchez 02 Apr '04

02 Apr '04

Hi all, I'm developing a hardware test program with some class abstractions like resistor, diode, relay ... which I stick to the BGL graph structure in the edge properties. I so have some information associated with vertices, and the result is a set of data composed of the graph itself - an ajacency_list - the graph properties for edges and vertices and a couple of vectors for the abstractions. My problem is how can I manage all these data in an OO program. The method used in BGL examples (… [View More]

1 0

Re: [boost] [BGL] forced client complexity
by Jeremy Siek 02 Apr '04

02 Apr '04

Hi, I too am dissatisfied with the complexity of many parts of the BGL... On Mar 31, 2004, at 4:48 AM, Provisional Dissonance wrote: > Is there any particular reason that a > simplified interface is not made available? Just a lack of time. The priority was placed on providing flexibility and efficiency so that the BGL components could handle any situation... that flexibility came at the price of complexity. I think a good next step would be to provide more special purpose components … [View More]

3 6

multi_array iterator question
by James N. Knight 02 Apr '04

02 Apr '04

I am trying to sort a multi_array along a dimension that is not the last. In other words, I can sort the rows of a 2D multi_array like so: typedef boost::multi_array<double, 2> array_type; typedef array_type::iterator iterator2; typedef array_type::template subarray<1>::type::iterator iterator1; array_type A(boost::extents[10][10]); for (iterator2 i = A.begin(); i!=A.end(); ++i){ sort((*i).begin(),(*i).end()); What I can't seem to do is sort the columns. Is … [View More]

1 0

Boost.Test support address
by Gennadiy Rozental 02 Apr '04

02 Apr '04

For anyone interrested, direct support address for Boost.Test issues is now rogeeff(a)patmedia.com. Old one is not free anymore and not supported accordingly. Regards, Gennadiy.

1 0

linker error creating simple unit_test (boost 1.31.0 + win32 + vc 71)
by Langston, Matthew David 02 Apr '04

02 Apr '04

I'm trying to create a simple unit test (using the Unit Test Framework) using boost 1.31.0 + win32 + vc71, but I get the following linker error due to the undefined symbol __imp___CrtSetReportHook: tests error LNK2019: unresolved external symbol __imp___CrtSetReportHook referenced in function "public: int __thiscall boost::execution_monitor::execute(bool,int)" (?execute@execution_monitor@boost@@QAEH_NH@Z) There was mention of this undefined symbol (__imp___CrtSetReportHook) in this thread: … [View More]

2 1

RE: [Boost-users] Re: License compatibility issues.
by Jim.Hyslop 01 Apr '04

01 Apr '04

David Abrahams wrote: > It seems to me that we can't ask > our volunteer lawyers to draw up a list of answers to all the possible > licensing questions along these lines, nor can we reasonably make them > available as an on-demand resource for answering boost users' legal > questions. No, but I think that the interaction between the LGPL or GPL and the Boost License is probably going to be a very frequently encountered scenario. Basically, what it boils down to is: what is the … [View More]

2 1

Re: License compatibility
by Cromwell Enage 01 Apr '04

01 Apr '04

Thanks, David Abrahams and Jim Hyslop! I'll heed your advice on seeking legal counsel and contacting the Free Software Foundation. Cromwell __________________________________ Do you Yahoo!? Yahoo! Small Business $15K Web Design Giveaway http://promotions.yahoo.com/design_giveaway/

1 0

RE: [Boost-users] Re: about license
by Jim.Hyslop 01 Apr '04

01 Apr '04

David Abrahams wrote: > Only the Boost code must use the Boost license; you can put any > license terms you wish on your own code. Why would you think > otherwise? Maybe he's used to the GPL, which forces its license model to be applied to the entire package? -- Jim Hyslop Senior Software Designer Leitch Technology International Inc. (http://www.leitch.com) Columnist, C/C++ Users Journal (http://www.cuj.com/experts)

1 0

about license
by Marleny Rafferty 01 Apr '04

01 Apr '04

Hi- I am considering using boost in my applications, but I have a question about the boost license at http://www.boost.org/LICENSE_1_0.txt . It says (edited) "Permission is hereby granted, free of charge, to ... use [and] reproduce ... the Software". It also says that any derivative works must also have the same license grant. If my application uses boost libraries unchanged, is it considered a derivative work? If so, does that mean that if I distribute my compiled software, I must … [View More]

6 10

License compatibility issues.
by Cromwell Enage 01 Apr '04

01 Apr '04

Good morning. >From previous posts regarding the License, I'm assuming the Legal Team is on this mailing list; if not, please direct me to them. Scenario I: I'm building a library that uses the Boost libraries (the ones covered by the current Boost Software License) and the Simple DirectMedia Layer, which is distributed under the terms of the GNU "Lesser" Public License <http://www.gnu.org/copyleft/lgpl.html>. Can I release my library under the Boost Software License? Can I release … [View More]

2 1

removing parallel edges in the Boost Graph Library?
by Nicholas Burlett 01 Apr '04

01 Apr '04

I am trying to use BGL to model a directed multigraph, but every time I try to remove just one of the edges (u,v), it removes all of the edges from u to v. My graph definition is: typedef adjacency_list<listS, listS, bidirectionalS, VertexProperty, EdgeProperty> graphdata; where VertexProperty and EdgeProperty are properties I've defined. Everything else seems to work: I have can add parallel edges, find the edge I want to remove based on the EdgeProperty, filter the graph … [View More]

2 5

Re: [boost] [BGL] forced client complexity
by Cromwell Enage 31 Mar '04

31 Mar '04

prs, On reflection, I've decided to cross-list my reply. > If one accepts the axiom that "a picture is worth a > thousand words," then it naturally follows that > discussion of graphs is always overly prolix. I recently had a chat with a fellow programmer and attempted to summarize, in semi-layman terms, how the core algorithms of my multi-state-mazes library work. They're pretty simple, but I couldn't do it without paper and pencil. > Sadly, the same reasoning is also … [View More]applicable to > the code of graph libraries. If a "code-visualizing compiler IDE" existed that would give us "code pictures" (plus conform to the new C++ standard, not ICE, and so on), I'm pretty sure more of us would be using it for all programming projects, not just graph applications. :) But seriously, with graph theory containing several different problem domains (search, network, AI, etc.), a graph library attempting to be generic enough for use in all of them is necessarily complex. > Boost.Graph seems to expose and require an > unnecessarily large amount of complexity, > though. If by "exposure" you mean lots of source code, I'll take that complexity any day of the week and twice on Sundays. :) The library does have a rather steep learning curve, especially if you're somewhat unfamiliar with graph theory and/or template programming. > Whereas libraries like Spirit go to great lengths > to make hard things easy, BGL seems to try only to > make hard things possible. I haven't looked at the Spirit library yet, so I can't tell you how easy it may be to use it. Perhaps getting your hands on a copy of the Boost Graph Library book will help (I don't have one, so I'm not certain). > The amount of scaffolding required > to use BGL for even the simplest of projects > often dwarfs the code size of a naive, > yet functional, special-purpose implementation. Special-purpose implementation of a graph library? Or the project? BGL aims to be as generic as the STL, but whereas each STL container deals with essentially one type of element, a graph needs to contain two types: a vertex type and an edge type. Furthermore, while most STL algorithms confine themselves to handling just those STL container elements, most graph algorithms also need the properties of vertices and/or edges as input. BGL delegates some of the responsibility of property storage to the Boost Property Map Library. I'm just glad the developers kept the complexity down to its current level. > While I understand that the BGL is deeply entrenched > in boost culture, certain academic circles, and even > publications, I nonetheless suggest that BGL lacks > the ease of use necessary for widespread adoption. Having dwelt in the academic circle known as the University of Central Florida, and thus familiar with the theoretical uses of a graph library (plus I've studied some game development apps on the side), I'd like to learn more about how the Real World would want to use BGL. > Even knowing that ease-of-use is not a criterion > for acceptance into boost, looking at what is > required of the client to use the BGL always leaves > me feeling perplexed. Is there any particular reason > that a simplified interface is not made available? Again, I don't know a simple graph problem that requires a simplified graph interface. > Perhaps a container adapter could be packaged with > the library allowing a compromise of functionality > and flexibility for simplicity? I thought the boost::vector_as_graph class template served that purpose. Wrap it around a std::vector<EdgeList>, with EdgeList = std::list<unsigned int> (or an edge list container of your choice, so long as the value type is usable as an index in the vector), and you should be good to go. > If a graphing problem is trivial, shouldn't BGL > provide a trivial solution? Why are the simplest > useful examples several hundred lines of code? The examples don't seem that big and hard to understand. Of course, quite a few of them have #ifdefs that I could do without since I don't use the compilers in question, but I can live with them. > I apologize for all of my vague criticisms - my > intention is not to flame but rather to test the > waters. Your criticisms seem healthy, and I hope my responses are helpful. > It is difficult for me to assess whether the > simplicity I yearn for isn't present for stylistic > reasons or whether it would rather necessitate a > sacrifice of flexibility, functionality or > implementation clarity. Nor is it clear to me to > what extent these criteria can be compromised to > promote clarity of client code. For what it is > worth, the kind of ease-of-use I'm imagining might > look like: #include <less_than_10_graph_headers> ... digraph<some_node_type,some_edge_context_type> g; g << "vertex" << make_pair("vertex", "implicit_vertex"); g.add_edge("brother", "sister", "sibling"); if(g.find(make_pair("brother", "sister"))) related = true; > Could someone please elucidate on why it is > impossible/impractical/unnecessary/whatever for a > graph library to have such an interface? I believe the potential for ambiguity would hinder this syntax the most. In this case, you'd have to overload operator<< to input both edges and vertices, and what if some_node_type turned out to be std::pair? You couldn't pass in make_pair(vertex,vertex) as an edge then. The same goes for g.find(); is it supposed to find a vertex, an edge, or both? Also, it seems you want to be able to use non-built-in or custom types as vertex IDs. You'll have to build your own custom-type-to-vertex map and bind it to the graph; BGL won't do it for you, to retain its genericity. Incidentally, BGL favors free functions over member functions. The rationale for that can be found in the FAQ <http://www.boost.org/libs/graph/doc/faq.html>. > Should I accept that the BGL is not the magic bullet > graph library and move on, or can this kind of > simplicity be somehow found within? Yeah, no magic bullets here. It depends on the problem you are trying to solve. Cromwell Enage __________________________________ Do you Yahoo!? Yahoo! Finance Tax Center - File online. File on time. http://taxes.yahoo.com/filing.html [View Less]

1 0

Re: [BGL] forced client complexity
by Christopher D. Russell 31 Mar '04

31 Mar '04

A well written critique. I had to go look up the word "prolix" (i.e. verbose). In defense of BGL: I am no BGL expert despite having read the book several times and writing a complex client application that uses dozens of different graph types. I admit, it was some hard work getting going with BGL. However, this is because I didn't know C++ templates nearly as well as I thought I did. Certainly there's nothing in the library that would preclude anyone from writing simpler BGL-derived classes … [View More]that offer solutions that are packaged to solve specific problems. Post specific problems and people will help. > It is difficult for me to assess whether the > simplicity I yearn for isn't present for stylistic > reasons or whether it would rather necessitate a > sacrifice of flexibility, functionality or > implementation clarity. Having become baseline proficient with BGL, I would disagree that it's overly complex. To me BGL is an elegant solution to a class of very complex problems that strikes a reasonable balance between complexity and flexibility. In my opinion, if you frequently use graphs BGL is well worth the investment required to learn how to use it. - Chris "Provisional Dissonance" <prosonance(a)yahoo.com> wrote in message news:20040331094800.93338.qmail@web60105.mail.yahoo.com... > If one accepts the axiom that "a picture is worth a > thousand words," then it naturally follows that > discussion of graphs is always overly prolix. Sadly, > the same reasoning is also applicable to the code of > graph libraries. Boost.Graph seems to expose and > require an unnecessarily large amount of complexity, > though. Whereas libraries like Spirit go to great > lengths to make hard things easy, BGL seems to try > only to make hard things possible. The amount of > scaffolding required to use BGL for even the simplest > of projects often dwarfs the code size of a naive, yet > functional, special-purpose implementation. > > While I understand that the BGL is deeply entrenched > in boost culture, certain academic circles, and even > publications, I nonetheless suggest that BGL lacks the > ease of use necessary for widespread adoption. Even > knowing that ease-of-use is not a criterion for > acceptance into boost, looking at what is required of > the client to use the BGL always leaves me feeling > perplexed. Is there any particular reason that a > simplified interface is not made available? Perhaps a > container adapter could be packaged with the library > allowing a compromise of functionality and flexibility > for simplicity? If a graphing problem is trivial, > shouldn't BGL provide a trivial solution? Why are the > simplest useful examples several hundred lines of > code? > > I apologize for all of my vague criticisms - my > intention is not to flame but rather to test the > waters. It is difficult for me to assess whether the > simplicity I yearn for isn't present for stylistic > reasons or whether it would rather necessitate a > sacrifice of flexibility, functionality or > implementation clarity. Nor is it clear to me to what > extent these criteria can be compromised to promote > clarity of client code. For what it is worth, the > kind of ease-of-use I'm imagining might look like: > > #include <less_than_10_graph_headers> > ... > digraph<some_node_type,some_edge_context_type> g; > g << "vertex" << make_pair("vertex", > "implicit_vertex"); > g.add_edge("brother", "sister", "sibling"); > if(g.find(make_pair("brother", "sister"))) > related = true; > > Could someone please elucidate on why it is > impossible/impractical/unnecessary/whatever for a > graph library to have such an interface? Should I > accept that the BGL is not the magic bullet graph > library and move on, or can this kind of simplicity be > somehow found within? > > Thanks in advance, > prs > > > __________________________________ > Do you Yahoo!? > Yahoo! Finance Tax Center - File online. File on time. > http://taxes.yahoo.com/filing.html > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > [View Less]

1 0

Re: boost::variant's and > 10 supported types
by Aleksey Gurtovoy 31 Mar '04

31 Mar '04

Eric Friedman writes: > Preston A. Elder wrote: > > How do I support > 10 types in a variant without having support for > > make_variant_over (since I wish to still support Borland and MSVC 6/.NET > > (aka. 7, not 7.1), as well as gcc). > > To solve your problem under the current implementation, you need a > greater value for BOOST_MPL_LIMIT_LIST_SIZE. I'm unfortunately not > attuned enough to the MPL implementation to know what is involved in > attaining … [View More]

1 0

Lambda question
by Anders Sundman 31 Mar '04

31 Mar '04

Hi all! I'm using the lambda library to compute the sum of squared differences, but I have encountered a puzzling problem. I would really appreciate if someone could explain it to me. This doesn't compile: std::inner_product(i1, i1+x, i2, 0.0, (_1 + _2), (_1*_1)(_1 - _2)); however, this does: std::inner_product(i1, i1+x, i2, 0.0, std::plus<double>(), (_1*_1)(_1 - _2)); The compiler message is very voluminous and hard to read. But I think this part might be of importance, … [View More]

2 3

Error building Boost_1_30_0
by Albert Gome 31 Mar '04

31 Mar '04

Hi, I am build Boost_1_30_0 on HPUX11.11 using gcc 3.3.3. I m getting these errors. skipping Boost.Python library build due to missing or incorrect configuration couldn't find Python.h in "/usr/local/include/python2.2" . . . . . ...patience... ...found 2254 targets... ...updating 295 targets... gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/c_regex_traits.o libs/regex/src/c_regex_traits.cpp: In static member function `static void boost::… [View More]c_regex_traits<char>::update()': libs/regex/src/c_regex_traits.cpp:655: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:658: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:660: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:663: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) g++ -c -Wall -ftemplate-depth-100 -DBOOST_REGEX_NO_LIB=1 -DBOOST_REGEX_STATIC_LINK=1 -g -O0 -fno-inline -I"libs/regex/build" -I "/mnt/r7/apal3/lib/boost_1_30_0" -o "libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/c_regex_traits.o" "libs/regex/build/../src/c_regex_traits.cpp" ...failed gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/c_regex_traits.o... gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/c_regex_traits_common.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/cpp_regex_traits.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/cregex.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/fileiter.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/posix_api.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/regex.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/regex_debug.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/regex_synch.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/w32_regex_traits.o . . . . . ...skipped <libs!regex!build/libboost_regex.a/gcc/debug/runtime-link-dynamic>libboost_regex_debug.a for lack of <libs!regex!build/libboost_regex.a/gcc/debug/runtime-link-dynamic>libboost_regex_debug.a(c_regex_traits.o)... ...skipped <!libs!regex!build!bin-stage>libboost_regex_debug.a for lack of <libs!regex!build/libboost_regex.a/gcc/debug/runtime-link-dynamic>libboost_regex_debug.a... gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/release/runtime-link-dynamic/c_regex_traits.o libs/regex/src/c_regex_traits.cpp: In static member function `static void boost::c_regex_traits<char>::update()': libs/regex/src/c_regex_traits.cpp:655: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:658: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:660: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:663: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) g++ -c -Wall -ftemplate-depth-100 -DNDEBUG -DBOOST_REGEX_NO_LIB=1 -DBOOST_REGEX_STATIC_LINK=1 -O3 -finline-functions -Wno-inline -I"libs/regex/build" -I "/mnt/r7/apal3/lib/boost_1_30_0" -o "libs/regex/build/bin/libboost_regex.a/gcc/release/runtime-link-dynamic/c_regex_traits.o" "libs/regex/build/../src/c_regex_traits.cpp" ...failed gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/release/runtime-link-dynamic/c_regex_traits.o... Does anybody know how to reolve this? Thnks Albert --------------------------------- Do you Yahoo!? Yahoo! Finance Tax Center - File online. File on time. [View Less]

2 1

boost::variant's and > 10 supported types
by Preston A. Elder 31 Mar '04

31 Mar '04

Hi, How do I support > 10 types in a variant without having support for make_variant_over (since I wish to still support Borland and MSVC 6/.NET (aka. 7, not 7.1), as well as gcc). To be precise, I need 18 types to be supported. -- PreZ Founder The Neuromancy Society http://www.neuromancy.net

5 4

boost::filesystem::exists() & GetfileAttributesA
by Sebastian Orfino 31 Mar '04

31 Mar '04

Hi, I am experiencig a problem with exists() and its Windows implementation with GetFileAttributes API. I am using exists() prior to the scan of a directory to see if it exists; the fact is that on W2K (just tested it on that OS) after a day or two GetFileAttributesA() returns INVALID_FILE_ATTRIBUTES but the path does exists (it is a UNC-style path). After a restart of the app, all works fine. So, should I use exists() this way ? I don't know why not. Or just use directory_iterator and … [View More]

4 6

vc7.1-stlport
by GoochRules! 31 Mar '04

31 Mar '04

Greetings, I am attempting to build boost using "-sTools=vc7.1-stlport". I have copied the STLport libaries to C:\src\lib. The STLport headers are in c:\src\include\stlport. I extracted the STLport archive to c:\src\STLport-4.6.1. I have tried STLPORT_PATH=c:\src, c:\src\lib, c:\src\include, and c:\src\include\stlport with STLPORT_VERSION unset, and set to 4.6.1, as well as both unset. Boost succeeds in building, yet does not link against the STLport libraries (as reported by depends.… [View More]

3 3

Boost Python on Mac OS X
by James Mastro 31 Mar '04

31 Mar '04

Hello all, I'm trying to use Boost Python on Mac OS X 10.3. I'm following along with what is at http://www.boost.org/libs/python/doc/tutorial/doc/ building_hello_world.html. After using bjam like this: bjam -sTOOLS=darwin the following are built: libboost_python.dylib hello.so This seems to be correct. I'm not totally sure where they are supposed to go, so I put them in next to Python in the Python framework so Python could find them to import. It found them, but an "import hello" … [View More]

2 1

Installing pyste
by Yannick Patois 31 Mar '04

31 Mar '04

Hi, When running "bjam install" from top-level directory, even with PYTHON_ROOT set correctly, it only creates shared libs but doesnt build and install pyste. What should be done to install it properly ? I finally went to libs/python/pyste/install and executed: python setup.py install I would expect this to be wrapped in some top-level command. Did I miss something in the doc ? Thanks, Yannick

2 1

Compilation problems on Linux
by mayankg＠iiitb.ac.in 31 Mar '04

31 Mar '04

Hi, We are trying to use the libboost_python.so library in Linux with our project. When we try to compile the C++ file of our project having all the boost interfaces, we get the following compilation error only on Linux. Although on Windows it works fine. We are using the Python 2.2.3 and Boost 1.30.2 versions. /usr/include/boost/python/converter/as_to_python_function.hpp:28: sorry, unimplemented: ` method_call_expr' not supported by dump_expr /usr/include/boost/python/converter/… [View More]

2 1

Location and namespace of a boost library (say, iterators)
by Deane Yang 31 Mar '04

31 Mar '04

I'm sorry if I'm being dumb about this, but I've run into the following difficulty a couple of times with boost libraries. I've decided to try using the new boost iterator library. Based on the documentation, I think I want to use iterator_adaptor. But scanning through the documentation, I don't immediately see - what namespace iterator_adaptor lives in. I assume it's just boost, but it probably doesn't hurt to mention this explicitly, since some boost libraries use sub-namespaces. - … [View More]

2 1

Installing Boost 1_30_0 on HPUX
by Albert Gome 31 Mar '04

31 Mar '04

Hi, I am new to BOOST and i like to install that on HPUX11.11. I have downloaded BOOST_1_30_0 and have gcc installed on HPUX. What is the efficient way of installing it. ie the parameters with the bjam. Thanks Albert __________________________________ Do you Yahoo!? Yahoo! Finance Tax Center - File online. File on time. http://taxes.yahoo.com/filing.html

2 1

[BGL] Finding out what properties exist in a graph?
by Steve Juranich 30 Mar '04

30 Mar '04

Is there an easy way to find out all of, for instance, the vertex properties associated with a graph? What I'm looking for is something like the following: <pseduocode> vector<properties> my_vertex_properties; property_iterator pi, last; for(tie(pi, last) = vertex_property_list(Graph); pi != last; ++pi) my_vertex_properties.push_back(*pi); </pseudocode> How about it? Does anything like this exist or am I just daydreaming again? Thanks. -- Stephen W. Juranich Science … [View More]

2 2

Serialization library
by Steve Folly 30 Mar '04

30 Mar '04

Hi, I'm looking using the Robert Ramey's serialization library for our own projects and would like to know it's current status. Obviously, it's not in 1.31.0, so what are the plans for it's future inclusion? Thanks. Steve.

2 1

graph, dfs search
by Peter Aronsson 30 Mar '04

30 Mar '04

Hi. I am having a problem with depth_first_search. The thing I do different is that I do not put any info in a property map and I do not want to bother myself with colormaps etc. The application code does: Graph g; pass2_visitor vis; depth_first_search(g,boost::visitor(vis)); But I get a compilation error, saying that it can not find a suitable operator+ in the property_map... See attached files for complete example. Grateful for all help! (I am running from HEAD on sourceforge cvs ) … [View More]Regards Peter Aronsson -- _________________________________________________________________ / Peter Aronsson, Phd Student at PELAB (Programming Environments \ | Laboratory ) Department for Computer & Information Science | | Linköping University, Sweden | |=================================================================| | petar(a)ida.liu.se , phone +46 (0)13-28 1737 Room 3B:490 | \_________________________________________________________________/ #include "tg.hpp" int main() { TaskGraph g; pass2_visitor vis; depth_first_search(g,boost::visitor(vis)); } #ifndef _TASKGRAPH_H #define _TASKGRAPH_H #include <boost/config.hpp> #include <iostream> // for std::cout #include <utility> // for std::pair #include <algorithm> // for std::for_each #include <boost/utility.hpp> // for boost::tie #include <boost/graph/graph_traits.hpp> // for boost::graph_traits #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adjacency_iterator.hpp> #include <boost/graph/graphviz.hpp> #include <boost/graph/depth_first_search.hpp> //Task graph types using namespace std; using boost::tie; struct vertex_execcost_t { typedef boost::vertex_property_tag kind; }; struct vertex_unique_id_t { typedef boost::vertex_property_tag kind; }; struct edge_result_set_t { typedef boost::edge_property_tag kind; }; typedef boost::property<boost::vertex_name_t,string, boost::property<vertex_execcost_t,float, boost::property<vertex_unique_id_t, int > > > VertexProperty; typedef boost::property<boost::edge_weight_t, int > EdgeProperty; typedef boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, VertexProperty, EdgeProperty> TaskGraph; typedef boost::graph_traits<TaskGraph>::vertex_descriptor VertexID; class pass2_visitor : public boost::default_dfs_visitor { public: pass2_visitor(/* initialize containers to store stuff in*/) { }; template <typename Vertex, typename Graph> void discover_vertex(Vertex u, const Graph & g) const { // Do some stuff }; }; #endif [View Less]

2 4

CVS import gotcha - beware!
by Steve Folly 29 Mar '04

29 Mar '04

Hi, Most of you are probably aware of this, but I just thought I'd share my experience with trying to import the new version of boost into our CVS repository using 'cvs import': It wasn't recognising new folders - e.g. boost/spirit/core and all it's contents. I was puzzling it for a while until I realised the import output was showing 'I' next to boost/spirit/core. Aha - it's ignored. DOH! Well, core files are ignored, aren't they! To all those who have been long suffering with this : don'… [View More]

1 0

RE: [Boost-users] Defining less on member variables/functions
by Chris Jurney 29 Mar '04

29 Mar '04

In this case, I could have used pair's operator<, but if I have a class by value as the second item of the pair that doesn't have a meaningful operator<, I want to ignore it in the sort. Thanks for all the help, guys. Chris -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Victor A. Wagner Jr. Sent: Friday, March 26, 2004 8:40 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Defining less on … [View More]

1 0

Microsoft Managed C++
by Roger Wilco 29 Mar '04

29 Mar '04

I have a somewhat large (~100K lines) C++ server application. It uses Boost (lots of smart pointer use, thread use, regex), Xerces XML libraries, some MFC for GUI, and ADO for database access. I tried to build a test build of my application using Microsoft's Managed C++. I got all my code to compile, but I can't link to either Boost or Xerces XML. Is this possible? Has anyone done this? If I ultimately go the .NET route, I would replace Boost and Xerces with functionality provided by the … [View More]native .NET runtime libraries. However, that would be a massive time consuming undertaking. At this point, I just want to dip my toes in the water and observe pros/cons of .NET, and have the option of migrating to .NET piecemeal. I have solid experience with C# and Java and I am extremely experienced with C++ (10 years). My main problems with C++ are: - Compile times. On my 2.8GHz dev system, a rebuild takes ~20 minutes and even a build after making a minor change takes 45 seconds. It's amazing how VC++ build speeds really have remained so stagnant despite increases in hardware speed. I realize VC++ is the slower of the IDEs for build times. - Debugging memory corruption or thread concurrency issues. This is much easier in Java/C# and the tools for assisting are much easier to use. I spent many days trying tools such as Purify for C++ and couldn't produce any fruitful results. - Diagnosing memory usage. My server application uses lots of memory. After running for several hours under production conditions it will reach around 400MB-1.3GB depending on the tasks its doing. I'd like to get a general overview of where this memory is being used. I don't suspect blatant memory leaks (new with no delete) but instead runaway caches or legitimate usage. These issues are of course still present in C#/Java but the diagnostic tools to address these issues seem to be much better. I haven't found any usable C++ tool for this issue and I rely on manually logging data points and manually trying to infer an idea of what is happening. - Java/C# is overall a better (easier/faster to develop/maintain) development platform for this type of server application work. However, I will happily stick with C++ if I can resolve these other issues. And I am of course, concerned about any performance hit when migrating to Java/C#. We max out CPU and RAM use, so these factors aren't important. I couldn't take more than a 25% drop in efficiency. Any other suggestions on my situation? [View Less]

2 1

SQLite
by Witz 28 Mar '04

28 Mar '04

I don't know if this is the forum for bringing this up but ... I was wondering if anyone thinks SQLite might make a good addition to Boost - www.sqlite.org - if the author would agree to it. Ian Whittley

2 1

boost::format with non-standard string class
by Scott Lamb 27 Mar '04

27 Mar '04

Hi, I'm not real happy with std::string, largely because it seems poorly suited to UTF-8. I'm happier with other classes such as Glib::ustring. [1,2] Is it possible to use boost::format with such a class? I'd previously thought that boost as a whole expected you to use std::string, but the recent discussion of boost::regex + Glib::ustring gave me some hope. It seems the requirements for boost::regex are more simple - a bidirectional, read-only character (not byte) iterator. That … [View More]

1 0

boost/graph/push_relabel_max_flow::is_flow() bug?
by Arun Bhalla 27 Mar '04

27 Mar '04

Hi, I'm not really a user of Boost, but I've been referring to the Boost Graph Library code for another project. In particular, I've been looking at push_relabel_max_flow.hpp. I was writing a unit test which followed the same ideas of the is_flow() test, and it was failing on what should be a flow network with a valid maximum flow. The code in question: // a is an edge_descriptor if (capacity[a] > 0) if ((residual_capacity[a] + residual_capacity[… [View More]

1 0

Defining less on member variables/functions
by Chris Jurney 26 Mar '04

26 Mar '04

I've had this same pattern come up 4 or 5 times now, and each time I've been unable to find a stl + boost solution that allowed me to do what I want without writing my own less function. Basically, I want something that will let me do a sort, or define a map on structs or pairs without writing a less that compares the member variable or .first. My last attempt: vector<pair<float, float>> myVector std::sort(myVector.begin(), myVector.end(), _1.first < _2.first); No such … [View More]

6 8

Re: [Boost-users] MAC OS X installation of boost libs
by Michael Short 26 Mar '04

26 Mar '04

Hello I am using MAC OS X 10.3.3. First I done find the bjam tool? Second when I build the bjam tool myself I get the following error. Jamfile:71: in module scope rule unless unknown in module. I think if you could please just give me a quick step by step of what you did to setup the libs with the correct directorys you used then that would probably fix the problems. I did try following the instructions on the page you stated but just did not help. thanks Michael On Tuesday, … [View More]

4 7

MultiArray questions
by Dr Mark H Phillips 24 Mar '04

24 Mar '04

Hi, I've recently found out about the existence of MultiArray and I am quite impressed! I was thinking of implementing something similar myself but now hopefully I don't have to! However I have a few questions that I'm hoping someone can answer. Question 1 ---------- In the user documentation there is an example which has some example code: for(index i = 0; i != 3; ++i) for(index j = 0; j != 4; ++j) for(index k = 0; k != 2; ++k) A[i][j][k] = values++; Why can't you … [View More]change the != into <? Ie, do: for(index i = 0; i < 3; ++i) for(index j = 0; j < 4; ++j) for(index k = 0; k < 2; ++k) A[i][j][k] = values++; or can you? This would be more efficient I should think, and requiring that index types be ordered shouldn't be too onerous should it? Question 2 ---------- If I use the built-in "no-frills" C array type to represent a 2-dimensional array in row-major order, then I would access an element (i, j) by doing: a[ &a[0] + i*n + j ] where a is my m by n array. And if I wish to traverse a, in row-major order, I can do: for (int* ip=&(a[0]); ip<&(a[n*m]); ip+=n) { for (int* ijp=&(ip[0]); ijp<&(ip[n]); ++ijp) { visit(ijp); } } These are a very efficient ways of doing things, but it lacks somewhat in ease-of-generalization and in readbility. This is where the MultiArray library is useful. But do I lose in efficiency by going to MultiArray? Ie, in the simple case where base is 0, stride is 1, and when we traverse in row-major order, is the MultiArray library smart enough to do compile-time optimizations to generate code which is as efficient as the above? I am guessing that this sort of approach is what the Blitz++ library does?? Question 3 ---------- Is it possible to construct a new multi_array/multi_array_ref/const_multi_array_ref from an array_view by doing a deep copy of the view? A view is a nice way of looking at different parts of a MultiArray object in a readable way, but sometimes you might wish to turn this view into a more-efficiently represented object. Is this easy to do in the MultiArray library? Question 4 ---------- Sometimes you might have an object starts off being mostly accessed in row-major order, so you want a representation which works efficiently for this use. But down the track you might wish to change to mostly column-major access. Does MultiArray provide easy ways to transform from one underlying representation to another? Thanks, Mark Phillips. [View Less]

3 2

RE: [Boost-users] boost::filesystem::exists() & GetfileAttributesA
by Ben Hutchings 24 Mar '04

24 Mar '04

Sebastian Orfino <sorfino(a)lanacion.com.ar> wrote: > I am experiencig a problem with exists() and its Windows > implementation with GetFileAttributes API. I am using exists() prior > to the scan of a directory to see if it exists; the fact is that on > W2K (just tested it on that OS) after a day or two > GetFileAttributesA() returns INVALID_FILE_ATTRIBUTES but the path > does exists (it is a UNC-style path). > After a restart of the app, all works fine. <snip… [View More]

1 0

It always show compiler limitation when I use boost.python to wrap a class under MSVisualStudio .Net
by Shunming Fang 24 Mar '04

24 Mar '04

Hello, guys, I try build my c++ lib as python modules using boost.python, when compile one big class, it always show compiler limit( my ram already update to 1.5 GB) while the class can be smoothly build on other platforms like SGI, Linux(RAM 512 MB+). I don't know why? I already upgrade my MSVS .net to 2003Version, Anybody know How I can get around this problems? Thank you very much __________________________________ Do you Yahoo!? Yahoo! Finance Tax Center - File online. File on time. http://taxes.yahoo.com/filing.html

1 0

Boost error on Red Hat Linux 7.4
by Jonathan Arnold 24 Mar '04

24 Mar '04

I'm trying to build the latest (1.31.0) Boost libraries for the first time on a Red Hat Linux 7.4, gcc 2.96 system. It seems to build all the libs and such correctly, but I get the following error trying to build the test programs: gcc-C++-action bin/boost/libs/test/build/libboost_test_exec_monitor.so/gcc/debug/shared-linkable-true/test_tools.o /home/jdarnold/boost_1_31_0/libs/test/build/../src/test_tools.cpp: In method `void boost::test_toolbox::detail::print_log_value<char>::operator() … [View More]

1 0

Cannot use BGL & boost::format together under VS2003
by Alexeev Gleb 24 Mar '04

24 Mar '04

Hi all! The following simple sample doesn't compile on VC++ .NET 2003: #include <iostream> #include <boost/format.hpp> // without the following line everything's ok #include <boost/graph/adjacency_list.hpp> int main(){ std::cout << boost::format("%d, %s") % 5 % "some text"; return 0; } -- Best regards, Alexeev Gleb mailto:alexeev_gleb@hotbox.ru

2 2

boost/graph - induced subgraph
by Matthew Galati 24 Mar '04

24 Mar '04

Is it possible to find the minimum spanning tree of an induced subgraph? vector< graph_traits<Graph>::vertex_descriptor > vd; typedef subgraph< Graph > SubGraph; SubGraph & inducedG = subG.create_subgraph(vd.begin(), vd.end()); Here is the example I am looking at: induced verts: 1 2 3 4 5 7 Original Graph: 0 <--> 1 2 5 7 1 <--> 0 3 5 7 2 <--> 0 3 4 5 3 <--> 2 1 4 5 4 <--> 2 3 5 6 5 <--> 0 1 2 3 4 6 7 6 <--> 4 5 7 7 &… [View More]

4 3

boost-sandbox socket and boost 1.31.0?
by Robert Helgesson 23 Mar '04

23 Mar '04

Howdy, I'm wondering regarding the socket library found in boost-sandbox. Will it be updated to function nicely with the latest Boost release? The problem seems to be that boost::default_iterator_policies and boost::iterator_adaptor no longer work like the socket library expect. Regards -- / Robert Helgesson |-- rycee(a)home.se --\ \-- GPG Key ID: 41E95A5B --| http://www.rycee.cx/ /

3 2

Re: [Boost-users] obtaining vertex descriptor from property_map (newbie)
by Gustavo Sánchez 23 Mar '04

23 Mar '04

I tend to use a map<string, vertex_descriptor> for this. Doug Thanks for the idea, I was just thinking something like this, but I have a problem. I need the definition of the Graph typedef property<edge_name_t, std::string> EdgeProperty; typedef property<vertex_name_t, std::map<string,vertex_property??> > NameProperty; typedef property<vertex_index_t, std::size_t, NameProperty> VertexProperty; typedef adjacency_list<vecS, vecS, undirectedS, … [View More]

2 1

Solaris and thread_resource_error
by Peter Jones 23 Mar '04

23 Mar '04

On Feb 1 of this year Baptiste Lepilleur posted a status report for Boost 1.31.0 Release candidate 2 on Solaris and AIX. It was mentioned that "boost.thread is now systematically failing with 'thread resource error'". I am experiencing the same thing on Solaris 8, with GCC 3.3.2 (GNU binutils) and Boost 1.31.0. Has anyone looked into this yet? If not, I am willing to track down what line in Boost.Threads is throwing thread_resource_error(). -- Peter Jones [unix;vi;crypto;c++;4wd] (http://… [View More]

2 3

linking to boost::thread
by Jerry 23 Mar '04

23 Mar '04

Hi, I've just built boost1.31.0 using bjam under Linux, apparently successfully. There don't appear to be any static libraries for boost::thread. Is this correct? If so, could someone please explain why I'm getting linker errors under g++ if I don't mention the _dynamic_ thread libs on the g++ command line, and "cannot open shared object file" at runtime if I do. Any pointers appreciated. TIA, Jerry.

2 1

shared_ptr help needed, please!
by Eric Damphousse 23 Mar '04

23 Mar '04

hi all, quick question concerning shared_ptr... not sure if things get deleted (destroyed) properly and its freaking me out. I hope this is not too long Basically, I use the BGL to store my data and that seems to be ok. The way the BGL stuff is defined is as such... Note that spObjectNode is defined as typedef boost::shared_ptr<CObject> spObjectNode // Set vertex properties typedef boost::property<boost::vertex_name_t, std::string> node_name_t; typedef boost::property<… [View More]graph_node_t, spObjectNode, node_name_t> node_property_t; // Set edge properties typedef boost::property<boost::edge_name_t, std::string> connection_name_t; typedef boost::property<graph_connection_t, spObjectNode, connection_name_t> edge_property_t; // Set graph typedef adjacency_list<listS, vecS, bidirectionalS, node_property_t, edge_property_t> graph_t; // graph_t m_Graph; The function below is what I use to add a node to the BGL... template <typename T> void AddNode(const T& object) { // Create the vertex boost::shared_ptr<T> pNode(new T(object)); // Add the vertex + its name to the graph vertexdescriptor_t newNode = boost::add_vertex(node_property_t(pNode, node_name_t(pNode->GetObjectName())), m_Graph); }; The way I use the AddNode ... for example in a main.cpp: /// blablabla above CSphere sphere("sphere1"); CSceneDB::Instance().AddNode(sphere); return 0; For testing purposes, in the base class and derived classes (see below) I print a message in the destructor of the class, just to make sure things are ok. If I just have in my main the previous call then upon exit I expect and get the following message... CSceneDB cleanup CSphere cleanup CGeometry cleanup CObject cleanup Now for the source of my anxiety... I wrote a function to get back my object from the BGL and it goes like this... inline boost::shared_ptr<CObject> getNodeProperty(const vertexdescriptor_t& vertex) { boost::property_map<graph_t, graph_node_t>::type node_prop_map; node_prop_map = boost::get(graph_node_t(), m_Graph); return node_prop_map[vertex]; } boost::shared_ptr<CObject> CSceneDB::getNodebyName(const std::string& strName) { boost::shared_ptr<CObject> node_prop; boost::graph_traits<graph_t>::vertex_iterator vi, vi_end; boost::tie(vi, vi_end) = boost::vertices(m_Graph); for(; vi != vi_end; ++vi) { node_prop = getNodeProperty(*vi); if(node_prop != 0) { if(node_prop->GetObjectName() == strName) break; } } return node_prop; } template <typename T> boost::shared_ptr<T> getNode(const std::string& strName) { boost::shared_ptr<CObject> abc = getNodebyName(strName); shared_ptr<T> def = boost::dynamic_pointer_cast<T>(abc); return def; } The problem is that if I do something like this... in the main.cpp /// blablabla stuff above CSphere sphere("sphere1"); CSceneDB::Instance().AddNode(sphere); boost::shared_ptr<CSphere> abc = CSceneDB::Instance().getNode<CSphere>("sphere1"); return 0; I only get upon exit... CSceneDB cleanup what happened to CSphere cleanup, CGeometry cleanup and CObject cleanup, are they leaking? Now for a sanity check, if I do in the main.cpp ... i do NOT do the assignment boost::shared_ptr<CSphere> abc = /// blablabla stuff above CSphere sphere("sphere1"); CSceneDB::Instance().AddNode(sphere); CSceneDB::Instance().getNode<CSphere>("sphere1"); return 0; upon exit i get ... CSceneDB cleanup CSphere cleanup CGeometry cleanup CObject cleanup Can someone tell me why this is, is my assignment wrong? Any help would be greatly appreciated Eric Brief description of the classes used ofr my test // Object.h class CObject { protected: CObject(){}; protected: virtual ~CObject(){cout << "CObject cleanup" << endl;}; }; typedef boost::shared_ptr<CObject> spObjectNode; // Geometry.h class CGeometry : public CObject { protected: CGeometry(){}; protected: virtual ~CGeometry(){cout << "CGeometry cleanup" << endl;}; }; // Sphere.h class CSphere : public CGeometry { public: CSphere(){}; ~CSphere(){cout << "CSphere cleanup" << endl;}; }; [View Less]

3 4

dumb question: iterator dynamic_cast adapter?
by Paul Elliott 22 Mar '04

22 Mar '04

I am trying to figure out iterators and I have a dumb question: I have an iterator A_iter, that can traverse in both directions ( A_iter++ and A_iter-- ) and can do input (operator*()). Value_type = type of *A_iter is A; and A is static_cast able to B: A start; B fish = static_cast<B>(start); // OK How do I use adapters to create B_iter, which is the same as A_iter, but whose value_type= typeof *B_iter is B? I am sorry if this is a dumb question. -- Paul Elliott … [View More]

2 1

obtaining vertex descriptor from property_map (newbie)
by Gustavo Sánchez 22 Mar '04

22 Mar '04

Dear all, We have a graph which has a property of type string associated with the vertexes. What we want to do is to obtain a vertex descriptor from a string. Could you please tell us how to implement it? Thank you in advance! --------------------------------- Antivirus Filtros antispam 6 MB gratis ¿Todavía no tienes un correo inteligente?

2 1

Controlling selection of runtime libraries
by Bob Kline 22 Mar '04

22 Mar '04

We're using Boost's regex package in a Windows environment for a server built with Microsoft Visual Studio 7.x. We'd like to be able to build our server with debugging symbols for our own code, but still use the release versions of the Microsoft runtime DLLs (because the debugging versions of the Microsoft runtime DLLs aren't redistributable, so we can't legally install them on our production server). The problem is, when we compile our own code for debugging (with -Zi and -D_DEBUG), … [View More]

3 4

Re: boost-sandbox socket and boost 1.31.0?
by Hugo Duncan 22 Mar '04

22 Mar '04

Robert Helgesson <rycee(a)home.se> wrote: > I'm wondering regarding the socket library found in boost-sandbox. Will > it be updated to function nicely with the latest Boost release? Hi, I have something similar that works with current boost CVS code. I have uploaded this to http://sourceforge.net/projects/giallo/ in an attempt to get this moving again. So far I have low level wrappers for sockets and named pipes. Documentation, tests are lacking. I will be adding the reactor … [View More]

1 0

Re: Trouble building libbgl-viz.a
by Vladimir Prus 22 Mar '04

22 Mar '04

Steve Juranich wrote: Hi Steve, sorry that it took quite some time to reply, > My version of graphviz_graph_parser.hpp has the following (lines 55-58): > > #ifndef YYSTYPE > typedef int yystype; > # define YYSTYPE yystype > #endif > > So it looks like the test is different as well as the #define arguments > being switched around. > > When I changed my lines to match your lines, I was able to get the > graphviz_graph_lex.o file, but the build chokes … [View More]

2 2

RE: [Boost-users] regular expression searching for Glib::ustring??
by Ben Hutchings 19 Mar '04

19 Mar '04

Paul Elliott <pelliott(a)io.com> wrote: > On Thu, Mar 18, 2004 at 04:08:59PM -0000, Ben Hutchings wrote: > > Paul Elliott <pelliott(a)io.com> wrote: > > > I am using Gtkmm. I want to do boost regular expression searching > > > on Glib::ustring. <snip> > > > How would you set up boost regex to search if both the regular > > > expression and the string to be searched is a ustring? <snip> > > To create a regex from a … [View More]

1 0

singleton_pool compile error
by ukropina＠sfu.ca 19 Mar '04

19 Mar '04

Hi I'm trying to compile the sample code for singleton pool from http://www.boost.org/libs/pool/doc/interfaces.html just to learn how to use singleton pool. Here is the code. struct MyPoolTag { }; typedef boost::singleton_pool<MyPoolTag, sizeof(int)> my_pool; void func() { for (int i = 0; i < 10000; ++i) { int * const t = my_pool::malloc(); } my_pool::purge_memory(); } but I keep geting this error: Compiling... main.cpp c:\program files\microsoft visual studio\vc98\… [View More]

2 1

regular expression searching for Glib::ustring??
by Paul Elliott 19 Mar '04

19 Mar '04

I am using Gtkmm. I want to do boost regular expression searching on Glib::ustring. http://www.gtkmm.org/gtkmm2/docs/reference/html/classGlib_1_1ustring.html This class represents characters in UTF-8, so each character in the buffer is represented by a varriable number of bytes. But it does have a bidirectional iterator. How would you set up boost regex to search if both the regular expression and the string to be searched is a ustring? Does one need to override any of the types defiened in … [View More]

2 1

RE: [Boost-users] regular expression searching for Glib::ustring??
by Ben Hutchings 18 Mar '04

18 Mar '04

Paul Elliott <pelliott(a)io.com> wrote: > I am using Gtkmm. I want to do boost regular expression searching on > Glib::ustring. > http://www.gtkmm.org/gtkmm2/docs/reference/html/classGlib_1_1ustring.htm l > > This class represents characters in UTF-8, so each character in the > buffer is represented by a varriable number of bytes. But it does > have a bidirectional iterator. > > How would you set up boost regex to search if both the regular > expression and … [View More]

2 1

RE: [Boost-users] regular expression searching for Glib::ustring??
by Yarwood, Martin (UK) 18 Mar '04

18 Mar '04

> "Under construction. > The current boost.regex traits class design will be migrated to > that specified in the regular expression standardization proposal." > > This is not very useful to someone trying to use the boost_regex > library now! > I'm sure they'll give you a full refund ******************************************************************** This email and any attachments are confidential to the intended recipient and may also be privileged. If you are not … [View More]

1 0

adjacency_matrix BGL problem
by Gustavo Sánchez 18 Mar '04

18 Mar '04

Hi everybody, Is it posible to resize a graph with this representation?. The idea is start with an empty matrix and add vertex based on the new vertices and edges we read. That is, we read a new edge and if their vertex aren't in the graph we add them and then the edge. Is this posible in an adjacency_matrix representation??? Thanks a lot. --------------------------------- Antivirus Filtros antispam 6 MB gratis ¿Todavía no tienes un correo inteligente?

2 1

problem with vertex properties in BGL
by Gustavo Sánchez 17 Mar '04

17 Mar '04

I have to build a graph from data in a file, some information is strings which are related to vertexes. I want to prove if those vertexes already exist in the graph before the insert operation. Next is the source: typedef adjacency_matrix<undirectedS,VertexProperty,EdgeProperty> UGraph; // an undirected graph UGraph g(0); // start from scratch property_map<UGraph, edge_name_t>::type ename = get(edge_name, g); // not sure if this is right (the graph have no elements at this … [View More]

2 1

Bug in Boost Graph Library?
by Heiko Bauke 17 Mar '04

17 Mar '04

Dear all, today I was engaged in searching for a bug in my program. After a while I figured out that boost::num_egdes behaves not as I expected. If G is an undirected adjacency matrix graph boost::num_egdes(G) returns the number of edges in the graph G plus the number of edges in G that are no self edges. That means almost all edges are counted twice in undirected adjacency matrix graphs. In my oppinion this behaviour is a bug. At least it makes the BGL-user's live unnecessary difficult.… [View More]

2 1

RE: [Boost-users] boost::thread problem
by Ben Hutchings 17 Mar '04

17 Mar '04

Pete <petehug(a)paradise.net.nz> wrote: > I'm having a problem with my boost multithreaded application. > My app runs fine as a Windows Service, but as a Unix daemon it > stops responding after some time. I noticed that the fewer > threads I have available, the quicker the application stops > responding: HP-UX(64) after 20mins, RH8(256) after >1hr, Linux > RH9(1024) >5hrs. This led me to assume that perhaps the threads > are not cleaned up properly. That could … [View More]

1 0