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

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/tru64cxx65/debug/numeric.o cxx: Error: /net/camos/opt/include/python2.3/Python.h, line 8: #5 could not open source file "pyconfig.h" #include "pyconfig.h" ---------------------^ It looks like the exec prefix is not taken into account because the file is located here: /opt/exec/OSF1-V5.1-alpha/include/python2.3/pyconfig.h Is this not supported by the current boost build process or is there any option I missed? Or is there anything else I'm doing wrong? Thanks, Markus

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 http://sourceforge.net/project/showfiles.php?group_id=7586 - Mike Morearty

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 runtime_function::fill_array(values); The idea is that some_magic_metafunction<values> would generate a type kind of like this: template<typename TypeValueList, typename Index> struct magic { static void fill_array(int *v) { // Non-MPL type vector indexing -- could use an // MPL iterator here v[Index::value] = TypeValueList<Index::value>::value; if (Index::value < distance<begin<TypeValueList>::type, end<TypeValueList>::type>::type::value) { magic<TypeValueList, Index::next>::fill_array(v); } }; }; Get it? The problem is that I don't know how to make MPL transition from strictly compile-time to something in-between. It can statically know the size of the value array and the values themselves but it has to fill the array "values" at runtime so that the values may be indexed by runtime computations. Any guidance? Thanks! -Dave

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, rStartMessage, m_rStartExp, flags) ) Included is the compiler error report. Please throw me a bone.

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?$char_traits@D@std@@V?$allocator@D@2@@std@@QAE@ABV01@@Z) already defined in Graphviz.obj It was Ok to add "/NODEFAULTLIB:msvcrt" to the compiler options, but now I need that library! So if I don't add this option, I get errors like the one above, if I do add it, I get errors "unresolved symbols"... What is probably(or definitely) wrong? Thanks in advance, -- Maxim

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) Columnist, C/C++ Users Journal (http://www.cuj.com/experts)

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 the pathological behaviour appeared. I'm none the wiser about the problem. For example, moving the malloc(301) statement before the 7 x malloc(1000) makes the problem go away! However, given the ease with which I rediscovered the problem, I wonder why there aren't more complaints about Microsoft's heap allocator. With some allocation patterns I have seen the allocator fall below 1kHz on a Pentium IV 2GHz machine! I've created a library that exports alternative versions of operator new and operator delete, by using a def file as follows EXPORTS ??2@YAPAXI@Z ??3@YAXPAX@Z I've had to do some hacky things to make it work with the STL (because of msvcp60.dll) , but that's another story! Now my question : I want to use boost, but need to work out how to make it use a different allocator. Will I need to rebuild the boost dlls (such as boost_python.dll), against my static library? Regards, David Barrett-Lennard /////////////////////// heap allocation test /////////////////////////// #include <iostream> #include <time.h> int main(int argc, char* argv[]) { for (int count=1 ; count <= 5 ; ++count) { int n1 = 0, n2 = 0; clock_t start = clock(); { const int NUM = 10000; void* L[NUM*7]; for (int i=0 ; i < NUM ; ++i) { for (int j=0 ; j < 7 ; ++j) L[n1++] = malloc(1000); void* leak = malloc(301); ++n2; } for (int k=n1-1 ; k >= 0 ; --k) free(L[k]); } clock_t elapsed = clock()-start; if (elapsed) { std::cout << "Time = " << elapsed << " ms" << " Rate = " << 1000 * (n1 + n2) / elapsed << " Hz" << std::endl; } } return 0; }

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 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

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/ to boost/detail/ (and fixup > #includes) seems like the simple fix. here at Debian we have the same problem, please see bug #242801 [0]. this suggestion could would fix also our situation. any news? thanks domenico [0] http://bugs.debian.org/242801 -----[ Domenico Andreoli, aka cavok --[ http://filibusta.crema.unimi.it/~cavok/gpgkey.asc ---[ 3A0F 2F80 F79C 678A 8936 4FEE 0677 9033 A20E BC50

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: > Hey, remember back when Rene Rivera said: > >>The gcc toolset is already adding the -pthread option when linking >>multi-threaded variants (lines 143-145). Are you saying you need to use >>-pthread even when linking single-threaded variants? > > > This is what "bjam -sTOOLS=gcc -sBUILD=release" produces without my > change to gcc-tools.jam: Which builds the release single-threaded variants. > gcc-Link-action > bin/boost/libs/filesystem/build/libboost_filesystem.so/gcc/release/shared-li nkable-true/libboost_filesystem-gcc-1_31.so > bin/boost/libs/filesystem/build/libboost_filesystem.so/gcc/release/shared-li nkable-true/libboost_filesystem-gcc-1_31.imp > ld: 0711-317 ERROR: Undefined symbol: .pthread_mutex_lock > ld: 0711-317 ERROR: Undefined symbol: .pthread_mutex_unlock > ld: 0711-317 ERROR: Undefined symbol: .pthread_mutex_init > ld: 0711-317 ERROR: Undefined symbol: .pthread_mutex_destroy Is there a way to tell who is referencing those symbols? As it might not be Boost code but other runtime code. -- Something to try would be to compile an empty *.so. That is compile an empty source file and try doing a "-shared" link. If you get thread errors with an empty shared library, then the problem is that the GCC+AIX runtimes require threading. And I'll fix that on the toolset, and post a patch ;-) -- -- 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

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 copying "matrix.hpp" into the project and typing #include <matrix.hpp> but it didn't work. Any pointers to get me going greatfully appreciated. I can work in MS VC 6 or 7 Thanks in advance Dave

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 to the other function object unmodified. The header boost/bind/protect.hpp contains an implementation of protect. To protect a bind function object from evaluation, use protect(bind(f, ...))." but the grammar, or perhaps the explanation, eludes me. Can anyone explains what it means to protect other arguments so that they are not evaluated in the context of boost::bind, perhaps by a practical example, which I think the doc could use, of what protect actually does ?

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 particular reason for this? -- Val Samko http://val.digiways.com/

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 & 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)

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 I can't garantee that there will never be tangling sym-links on the system. I would prefer if the library would have a option not to follow symlinks or handel this situation by itself. Regards Martin oooooooooooooooooooooooooooooooooooooooooooooooooooooooo o Dr. Martin Merck o o Institut fuer Theoretische Physik und Astrophysik o o Am Hubland o o 97074 Wuerzburg o o Phone: +49 931 888 4933 Fax: +49 931 888 4603 o o Email: merck(a)astro.uni-wuerzburg.de o oooooooooooooooooooooooooooooooooooooooooooooooooooooooo

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: > > > 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. ##########################################################################

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, boost::property<boost::edge_weight_t, int> > > Graph; Graph g; int distance_matrix[100][100]; johnson_all_pairs_shortest_paths(g, distance_matrix); } ======================================================================== but it compiles, if we pass the edge weight map (composed from std::map<edge_descriptor, int>) as a named parameter to johnson_all_pairs_shortest_paths ? Also, why do johnson_all_pairs_shortest_paths(g, distance_matrix); and johnson_all_pairs_shortest_paths(g, distance_matrix, weight_map(get(vertex_index, g))); produce completely different compile time errors? Finally, is it possible to use johnson_all_pairs_shortest_paths with adjacency_list<mapS, mapS, ...> ? According to the documentation, this should be possible, but this just does not compile. -- Val Samko http://val.digiways.com/

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 problem in the readable property map documentation, or in the johnson_all_pairs_shortest, or I am doing something wrong? -- Val Samko http://val.digiways.com

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 for, but my "answer" is based purely on what I think it > > should be, not an understanding of the law. 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, however this seems to make no difference to the result. It seems the compiled code is a translation of both works, 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 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. So the final answer is the same - but some of the questions and answers in between may be wrong. Have you received any feedback from lawyers about 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. ##########################################################################

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 algorithm for this, or is there a better way? Thanks sven

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 (just declare all these in main ) is right just for that, but in a more complex object colaboration society I consider it to be simple and useless. I just use a class named GraphContainer to package all the elements, but I wonder if there is any other better aproach... class GraphContainer{ int nVertices; public: UGraph g; property_map<UGraph, vertex_index_t>::type id; property_map<UGraph, edge_name_t>::type name; property_map<UGraph, vertex_name_t>::type vname; std::map<string,boost::graph_traits<UGraph>::vertex_descriptor> vertx; // mapa vertices(string)--vertex_descriptor vector<Lampara> Lamparas; vector<Diodo> Diodos; vector<Switch> Switches; vector<Resistencia> Resistencias; vector<Bobina> Bobinas; // ---------- GraphContainer(); }; Thanks a lot... --------------------------------- Antivirus Filtros antispam 6 MB gratis ¿Todavía no tienes un correo inteligente?

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 that are easier to use. > Perhaps a > container adapter could be packaged with the library > allowing a compromise of functionality and flexibility > for simplicity? Could you explain this "container adaptor" idea more. > #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; Perhaps this is a good place to start. Could you explain each of the above lines of code. Then we can compare to an implementation in the current BGL and pinpoint problem areas. Cheers, Jeremy _______________________________________________ Jeremy Siek <jsiek(a)osl.iu.edu> http://www.osl.iu.edu/~jsiek Ph.D. Student, Indiana University Bloomington Graduating in August 2004 and looking for work C++ Booster (http://www.boost.org) _______________________________________________

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 there a way I can create a view with the dimensions reordered? Or, can I somehow create a strided iterator that will do the job (select the values in a column)? I would like to avoid transposing the array. Pointers to the relevant documentation or suggestions are appreciated. James

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: http://lists.boost.org/MailArchives/boost/msg43787.php. However, that post was concerning the Metrowerks compiler, but I am using Microsoft's vc71 compiler. Can someone help me resolve this undefined symbol (__imp___CrtSetReportHook) problem? Here is my simple "unit test suite" that I am trying to build: #include <boost/test/unit_test.hpp> #include <boost/test/included/unit_test_framework.hpp> using boost::unit_test_framework::test_suite; void test_GleamData() { BOOST_CHECK(2 == 1); // non-critical test => continue after failure } test_suite* init_unit_test_suite( int, char* [] ) { test_suite* test = BOOST_TEST_SUITE( "GleamAnalysis Test Suite" ); test -> add( BOOST_TEST_CASE( &test_GleamData ), 1 /* expected one error */ ); return test; } Warmest regards, Matt

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 compatibility between LGPL or GPL, and the Boost license? Can we draw up a list of the most common free-software licenses, say the top three, and ask the volunteer lawyers to determine whether Boost is compatible with each of the three? I don't mean to determine the various combinations and permutations, e.g. Boost and GPL and Mozilla Artistic, but the simple ones: Boost and "x", Boost and "y", etc. Until and unless such a comparison is done, though, I would echo your advice about seeking a competent legal opinion. -- 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

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 allow free of charge use and distribution? Thanks. -- Marleny

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 it under the GNU LGPL? Or can I not release it at all? Scenario II: I plan on building an application that uses the Boost libraries (the ones covered by the current Boost Software License) and the FOX GUI Toolkit, which is distributed under the terms of the GNU General Public License. According to <http://www.gnu.org/licenses/gpl-faq.html#IfLibraryIsGPL>, if I publicly distribute my application (e.g. via SourceForge.net) I must do so using the GNU GPL, since the FOX Toolkit is distributed under that license. Will the Boost Software License allow me to do this? Kind regards, Cromwell Enage __________________________________ Do you Yahoo!? Yahoo! Small Business $15K Web Design Giveaway http://promotions.yahoo.com/design_giveaway/

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 for topological sorting, check for existing edges, etc. In the following, e is of type graph_traits<graphdata>::edge_descriptor, and g is the graph of type graphdata (defined above): std::cout << "about to remove edge\n"; DumpInfo(); remove_edge(e, g); std::cout << "removed edge\n"; DumpInfo(); Here is some sample output: about to remove edge vertex: 0 out-edges: in-edges: (1,0) (1,0) adjacent vertices: vertex: 1 out-edges: (1,0) (1,0) in-edges: adjacent vertices: 0 0 removed edge vertex: 0 out-edges: in-edges: adjacent vertices: vertex: 1 out-edges: in-edges: adjacent vertices: Note that there were two edges present before the call to remove_edge, but only one after. What am I doing wrong? I'm using version 1.31, if that helps. Thanks, Nicholas Burlett nrb23(a)cornell.edu

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 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

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 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 >

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 this; I've CCed this to Aleksey Gurtovoy (the MPL maintainer), > who may be able to help you. Just #define-ing BOOST_MPL_LIMIT_LIST_SIZE to something that is a multiple of 10 (e.g. 20) before including Boost headers should work. -- Aleksey Gurtovoy MetaCommunications Engineering

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, the (double&, double) looks strange: /usr/include/c++/3.3/bits/stl_numeric.h:119: error: no match for call to `( boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambd a::arithmetic_action<boost::lambda::plus_action>, boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder <1> >, boost::lambda::lambda_functor<boost::lambda::placeholder<2> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >) (double&, double)' /usr/include/boost/lambda/detail/lambda_functors.hpp:142: error: candidates are: typename T::sig<boost::tuples::null_type>::type boost::lambda::lambda_functor<Base>::operator()() const [with T = boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::la mbda::plus_action>, Many thanks in advance Anders Sundman

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::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.

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 scan the hot-folder right away catching any exceptions ?. I don't want to iterate over a direcotry that doesn't exists if I could knew that in advance; besides, I don't know if that will work anyway. Does anyone know somthing about this GetFileAttributesA/boost::exists() behavior ? Thanks in advance, Sebastian.

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.exe), but rather to MSVCP71.DLL and MSVCP71.DLL (the C++ and C runtime libraries provided by vc7.1 I presume). I have ensured that c:\src\lib is first in %LIB% and c:\src\include\stlport;c:\src\include; is first in %INCLUDE% Any suggestions for what my STLport setup should look like are appreciated, as well as pointers on getting boost to link against the STLport libraries. --Matthew Peltzer

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" in Python resulted in: ImportError: Failure linking new module: ../../../../bin/boost/libs/python/build/libboost_python.dylib/darwin/ debug/shared-linkable-true/libboost_python.dylib: dyld: /Applications/MacPython-2.3/PythonIDE.app/Contents/MacOS/PythonIDE can't open library: ../../../../bin/boost/libs/python/build/libboost_python.dylib/darwin/ debug/shared-linkable-true/libboost_python.dylib (No such file or directory, errno = 2) Before putting the 2 libs in, "import hello" found nothing. So I assume Python is finding the hello module now, but not liking it. Can anyone show me where I've gone wrong? Many thanks. -jim

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