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

RE: [Boost-users] Re: Copyright notice in redistributed object fi les
by Jim.Hyslop 21 May '04

21 May '04

David Abrahams wrote: > "Jim.Hyslop" <Jim.Hyslop(a)Leitch.com> writes: > > If your code is derived from Boost, i.e. you have taken the > Boost code and > > modified it, then I think whether or not you can put it in > the public domain > > will depend on the extent of your modifications. > > Though on that point I'm less certain, I'm still pretty sure that's > incorrect [IANAL]. Derivative works must carry the Boost license: Ah, of course. I forgot the "derivative works" part of the license. I should have reviewed the license before responding. My apologies. -- 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

iterator_facade with proxy reference type
by gusz1＠freemail.hu 21 May '04

21 May '04

Hi, could please somebody tell me why the code below generates a compile-time error? The compiler I'm using is VC++ 7.1. The error generated is this: c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\algorithm(458) : error C2582: 'operator =' function is unavailable in 'item_proxy' c:\PROG\VCPP\xItFacadeReferProxy\xItFacadeReferProxy.cpp(102) : see reference to function template instantiation 'void std::generate<array_iterator,int(__cdecl *)(void)>(_FwdIt,_FwdIt,_Fn0)' being compiled with [ _FwdIt=Array_iterator, _Fn0=int (__cdecl *)(void) ] the location of the error in <algorithm>: template<class _FwdIt, class _Fn0> inline void generate(_FwdIt _First, _FwdIt _Last, _Fn0 _Func) { // replace [_First, _Last) with _Func() for (; _First != _Last; ++_First) *_First = _Func(); // ERROR HERE } To my best knowledge, item_proxy's operator= is public, so I don't understand why it is unavailable. Thx, Gus The code: ------------------------------------------------------------------------ // xItFacadeReferProxy.cpp : Defines the entry point // for the console application. #include "stdafx.h" #include <algorithm> #include <boost/iterator/iterator_facade.hpp> using namespace boost; using namespace std; // THIS CLASS IS GOING TO BE 'STL'IZED': const int ARRAY_SIZE = 10; class Array { public: int Get(int i) const { return data[i]; } int Set(int i, int val) { data[i] = val; } private: int data[ARRAY_SIZE]; };//class Array class item_proxy; class Array_iterator : public iterator_facade < Array_iterator, int, // VALUE TYPE boost::random_access_traversal_tag, item_proxy // REFERENCE TYPE > { public: class item_proxy { public: item_proxy(const Array_iterator &it): m_rIterator(it) {} item_proxy& operator=(int i) { m_rIterator.m_pArray-> Set(m_rIterator.m_index, i); return *this; } item_proxy& operator=(item_proxy const& rhs) { operator=((int)rhs); return *this; } operator int() const { return m_rIterator.m_pArray-> Get(m_rIterator.m_index); } private: Array_iterator const &m_rIterator; };//class item_proxy public: Array_iterator():m_pArray(0) {} Array_iterator(Array& array, int index = 0): m_pArray(&array), m_index(0) {} private: friend class boost::iterator_core_access; void increment() { ++m_index; } void decrement() { --m_index; } void advance(int n) { m_index += n; } int distance_to(Array_iterator const& rhs) { if(m_pArray != rhs.m_pArray) { return -1; } return rhs.m_index - m_index; } bool equal(Array_iterator const& rhs) const { return m_pArray == rhs.m_pArray && m_index == rhs.m_index; } item_proxy dereference() const { return item_proxy(*this); } Array *m_pArray; int m_index; };//class Array_iterator Array_iterator array_begin(Array& array) { return Array_iterator(array); } Array_iterator array_end(Array& array) { return Array_iterator(array, ARRAY_SIZE); } int value_generator() { static int i = 0; return ++i; } int _tmain(int argc, _TCHAR* argv[]) { Array a; generate(array_begin(a), array_end(a), value_generator); // ERROR! copy(array_begin(a), array_end(a), ostream_iterator<int>(cout, " ")); return 0; } ------------------------------------------------------------------------

2 1

RE: [Boost-users] Copyright notice in redistributed object files
by Jim.Hyslop 21 May '04

21 May '04

First: I am not a lawyer. If you want competent legal advice, consult a lawyer. What follows is my lay opinion, which may or may not be correct or valid in your legal jurisdiction. Aaron W. LaFramboise wrote: > I understand that the license states that I allowed to "use, > reproduce, display, distribute, execute, and transmit" Boost software > without restriction, provided that the software is in object form. > However, I still have a question about other responsibilities I might > have in redistributing a work of mine that incorporates Boost in > object form. In particular, I am interested in whether I have to > mention "Boost" or the authors' names at all anywhere in my software > or the supporting documentation. My opinion: If the license doesn't require it, you don't have to do it. If the license doesn't forbid it, then you can do it. Whatever "it" means in the appropriate context. > As an example, in distributed object code without source, do I need to > state a copyright notice including the Boost copyright holder's names > in the same place I put my ordinary copyright, if any? If my > derivative work is (other than Boost) released into the public domain > (for example, I explicitly disclaim all copyright interest), do I > still need to mention that Boost copyright holders have copyrighted > portions of the object code? You cannot place into public domain rights to something that you do not own. Since you do not own the rights to the Boost library, you cannot place it in the public domain. Your statement placing the code in the public domain should probably explicitly state _which_ code you are giving away. If your code is derived from Boost, i.e. you have taken the Boost code and modified it, then I think whether or not you can put it in the public domain will depend on the extent of your modifications. > Also, am I required to mention that the Boost portions of the > distributed objects have no warranty? For example, if I include > boost_regex.dll, am I required to state that that Boost copyright > holders provide no warranty? Hmmm... that's a trickier one. This one you might want to consult a lawyer about, because it gets into areas such as liability, consumer protection laws, etc. which vary from jurisdiction to jurisdiction. > Outside of my obligations under the Boost license, is there any other > particular reason I might acknowledge Boost or display their > copyright? Goodwill? > (I am asking this because several popular proprietary programs seem to > attempt to include a copyright notice for every rights-holder's code > included in their software, even where the licenses covering the code > does not seem to obligate the program distributor to include them.) <rant> I've seen this, and I don't agree with it. Consider what would happen if the automobile industry started doing this kind of thing. Your owner's manual would swell to several thousand pages long, with most of it being acknowledgements: Portions of this automobile were manufactured by Bolts-R-Us Inc. Portions of this automobile were assembled using Very Tough Tools(TM). blah blah blah. When you get down to it, end users don't care what makes up the program, as long as it works. For _their_ definition of "works". </rant> -- 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

Copyright notice in redistributed object files
by Aaron W. LaFramboise 21 May '04

21 May '04

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, While legal issues are being discussed, I'd like to pose a question I myself have. I understand that the license states that I allowed to "use, reproduce, display, distribute, execute, and transmit" Boost software without restriction, provided that the software is in object form. However, I still have a question about other responsibilities I might have in redistributing a work of mine that incorporates Boost in object form. In particular, I am interested in whether I have to mention "Boost" or the authors' names at all anywhere in my software or the supporting documentation. As an example, in distributed object code without source, do I need to state a copyright notice including the Boost copyright holder's names in the same place I put my ordinary copyright, if any? If my derivative work is (other than Boost) released into the public domain (for example, I explicitly disclaim all copyright interest), do I still need to mention that Boost copyright holders have copyrighted portions of the object code? Also, am I required to mention that the Boost portions of the distributed objects have no warranty? For example, if I include boost_regex.dll, am I required to state that that Boost copyright holders provide no warranty? Outside of my obligations under the Boost license, is there any other particular reason I might acknowledge Boost or display their copyright? (I am asking this because several popular proprietary programs seem to attempt to include a copyright notice for every rights-holder's code included in their software, even where the licenses covering the code does not seem to obligate the program distributor to include them.) Thank you for your time, Aaron W. LaFramboise -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.4 (MingW32) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFAra7rlp/lhnWsM8QRAhQaAJ9favUFNvAOtWk6CcS5tOFSliOxSgCeLAHL zqhwCA9oXt7juuQeorADvFk= =sQDM -----END PGP SIGNATURE-----

1 0

Regex++ Installation Problems
by kinshuk srivastava 20 May '04

20 May '04

Hi I am a Newbie to using the regex++.I am trying to install the regex++ library on a Linux system. according to the instructions given but I found the following errors: make -fgcc.mak mkdir -p gcc mkdir -p gcc/boost_regex g++ -o gcc/boost_regex/c_regex_traits.o -c -O2 -I../../../ ../src/c_regex_traits.cpp g++ -o gcc/boost_regex/c_regex_traits_common.o -c -O2 -I../../../ ../src/c_regex_traits_common.cpp g++ -o gcc/boost_regex/cpp_regex_traits.o -c -O2 -I../../../ ../src/cpp_regex_traits.cpp g++ -o gcc/boost_regex/cregex.o -c -O2 -I../../../ ../src/cregex.cpp ../../../boost/regex/v3/regex_match.hpp: In member function `unsigned int boost::RegEx::GrepFiles(bool (*)(const char*, const boost::RegEx&), const char*, bool, unsigned int)': ../../../boost/regex/v3/regex_match.hpp:1937: Internal compiler error in expand_call, at calls.c:3049 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://www.gnu.org/software/gcc/bugs.html> for instructions. make: *** [gcc/boost_regex/cregex.o] Fehler 1 I cant quite figure out what the problem is. Some one please help... Thanx in advance... -Kinshuk ________________________________________________________________________ Yahoo! India Matrimony: Find your partner online. http://yahoo.shaadi.com/india-matrimony/

3 2

A simple question involving boost.function and boost.lambda
by gredner＠bu.edu 19 May '04

19 May '04

Greetings, I would like to crate a lambda expression that simply executes two functions sequentially. I have: using namespace boost; using namespace boost::lambda; function0<void> func1 = cout << constant('1'); function0<void> func2 = cout << constant('2'); I have tried: function0<void> funcs = (func1, func2); but this seems to execute only one of the two functions when it is called. I have also tried: function0<void> funcs = (_1(), _2())(func1, func2); but my compiler (GCC 3.3 under darwin) barfs it up, with error messages: ---------- main.cpp: In function `int main(int, char**)': main.cpp:58: error: no match for call to `(boost::tuples::null_type) ( boost::function0<void, std::allocator<boost::function_base> >&, boost::function0<void, std::allocator<boost::function_base> >&)' /usr/local/include/boost-1_31/boost/lambda/detail/lambda_functors.hpp: In member function `RET boost::lambda::placeholder<1>::call(A&, B&, C&, Env&) const [with RET = boost::tuples::null_type, A = const boost::tuples::null_type, B = const boost::tuples::null_type, C = const boost::tuples::null_type, Env = const boost::tuples::null_type]': /usr/local/include/boost-1_31/boost/lambda/detail/lambda_functors.hpp:143: instantiated from `typename T::sig<boost::tuples::null_type>::type boost::lambda::lambda_functor<Base>::operator()() const [with T = boost::lambda::placeholder<1>]' main.cpp:58: instantiated from here /usr/local/include/boost-1_31/boost/lambda/detail/lambda_functors.hpp:65: error: invalid application of `sizeof' to an incomplete type ---------- (line 58 is the assignment to funcs) I'd appreciate any advice :) -Gabe Redner

2 1

How to compile minimal_test.cpp with gcc?
by Sebastian Stein 14 May '04

14 May '04

Hi, I downloaded boost-1.31.0 and the bjam package. I first compiled bjam and copied the executeables to /usr/local/bin. Then I went on to boost-1.31.0 (patched with the regex files). I first changed the env variables for python and compiled and installed the package with: bjam "-sTOOLS=gcc" install After building was finished, the files where copied. The include files got installed under /usr/local/include/boost-1_31/boost. I made a symlink /usr/local/include/boost pointing to /usr/local/include/boost-1_31/boost. Now I tried to do a small test, taken from: http://www.boost.org/libs/test/test/minimal_test.cpp I tried to compile the file with: gcc -o test minimal_test.cpp But I get a lot of error messages saying: In file included from test.cpp:16: /usr/local/include/boost/test/minimal.hpp:44:47: libs/test/src/execution_monitor.cpp: No such file or directory In file included from test.cpp:16: /usr/local/include/boost/test/minimal.hpp:62: error: `execution_monitor' is not a class or namespace /usr/local/include/boost/test/minimal.hpp:62: error: invalid base-class specification /usr/local/include/boost/test/minimal.hpp:63: error: parse error before `::' token /usr/local/include/boost/test/minimal.hpp:75: error: type specifier omitted for parameter `c_string_literal' /usr/local/include/boost/test/minimal.hpp:75: error: parse error before `,' token /usr/local/include/boost/test/minimal.hpp:91: error: type specifier omitted for parameter `c_string_literal' /usr/local/include/boost/test/minimal.hpp:91: error: parse error before `,' token /usr/local/include/boost/test/minimal.hpp:98: error: parse error before `,' token /usr/local/include/boost/test/minimal.hpp:98: error: parse error before `,' token /usr/local/include/boost/test/minimal.hpp:98: error: missing ';' before right brace /usr/local/include/boost/test/minimal.hpp:98: error: semicolon missing after declaration of `boost::minimal_test::monitor' ... ... ... /usr/local/include/boost/test/minimal.hpp:130: error: parse error before `if' /usr/local/include/boost/test/minimal.hpp:138: error: syntax error before `<<' token test.cpp: In function `int test_main(int, char**)': test.cpp:54: error: `the_monitor' undeclared in namespace `boost::minimal_test' test.cpp:55: error: `the_monitor' undeclared in namespace `boost::minimal_test' test.cpp:57: error: `the_monitor' undeclared in namespace `boost::minimal_test' test.cpp:58: error: `the_monitor' undeclared in namespace `boost::minimal_test' test.cpp:60: error: `the_monitor' undeclared in namespace `boost::minimal_test' test.cpp:61: error: `the_monitor' undeclared in namespace `boost::minimal_test' test.cpp:63: error: `the_monitor' undeclared in namespace `boost::minimal_test' test.cpp:64: error: `the_monitor' undeclared in namespace `boost::minimal_test' test.cpp:66: error: `the_monitor' undeclared in namespace `boost::minimal_test' test.cpp:68: error: `the_monitor' undeclared in namespace `boost::minimal_test' Well, mostly interesting is the first line: /usr/local/include/boost/test/minimal.hpp:44:47: libs/test/src/execution_monitor.cpp: No such file or directory Why is a part of the source included here? Is there a special place where the source should be installed, so that it can be found? I also tried replacing the include statement pointing to the execution_monitor.hpp header file in the include directory, but this produced far more error messages. So how do I build this small test program under gcc 3.3 (Linux)??? Is there somewhere a good step by step guide (tutorial) how to use boost and how to set up the build environment for small projects? Sebastian -- ONE FAMILY! Leipzig 2012 - Olympic Summer Games http://www.leipzig2012.com/

2 2

RE: [Boost-users] Shared_Ptr problem with 1.30.2 and gcc 3.2.3
by Ben Hutchings 14 May '04

14 May '04

Joshua Little <ljoshua(a)swbell.net> wrote: > I've been using shared_ptr's for a while now with gcc 3.1 and > recently had to upgrade to gcc 3.2.3. Ever since then I'm getting > strange crashes when shared_ptr's are destructed. Heres a backtrace : > Program received signal SIGSEGV, Segmentation fault. <snip> Did you rebuild everything with the new release? There may be some difference in the ABIs used by the two releases though they are supposed to be compatible (3.2.1 is different on Cygwin though; that was a bug).

1 0

Python.exe crashes with C++ interfaces exported to python using boost
by mayankg＠iiitb.ac.in 14 May '04

14 May '04

Hi, I have developed a dll, in that I have exported the C++ interfaces as python interfaces using boost. While running the python script, which uses those interfaces, I am facing a strange problem. When I try to call the del operator on the object of a particular class in the python script, whose interfaces has been exported to python, the python.exe crashes and gives me the following error: _BLOCK_TYPE_IS_VALID(pHead->nBlockUse) When I try to debug my dll, it is crashing inside the destructor of the class, where a byte pointer is being deleted. Although the delete operator on the same type of object works fine when i try to do the same kind of operation from a sample C++ application using my dll. I have checked the project properties etc. and my dll uses Debug Multithreaded DLL and Multithreaded DLL, for the runtime library, for debug and release builds. I have also tried with both debug and release dlls. Please help, Thanks, Mayank

3 2

Sun C++ 5.5 and std::numeric_limits
by Robin KAY 14 May '04

14 May '04

As of patch 113817-04 to the Sun C++ 5.5 compiler (see http://sunsolve6.sun.com/search/document.do?assetkey=1-21-113817 ), the functions in the numeric_limits class support 64 bit integers. However, the logic in boost/boost/config/stdlib/roguewave.hpp doesn't detect this a defines BOOST_NO_LONG_LONG_NUMERIC_LIMITS and hence causes an error: "../../../../boost/boost/limits.hpp", line 35: Error: Multiple declaration for std::numeric_limits<long long>. "../../../../boost/boost/limits.hpp", line 88: Error: Multiple declaration for std::numeric_limits<unsigned long long>. 2 Error(s) detected. As __SUNPRO_CC is set to 0x550 for both compilers below and above patchlevel 04, I can't see a way to fix this without extending the logic in the CVS head, for handling Sun C++ 5.6, to 5.5 and breaking unpatched installations. -- Wishing you good fortune, --Robin Kay-- (komadori)

2 1

Re: [Boost-users] Visitor makes Dijkstra slow
by Cromwell Enage 14 May '04

14 May '04

Hello, Martin! Graphs are supposed to be passed by reference to visitor functions. Your program didn't do that, so it created tons of temporary graph copies. Changing template<typename V, typename G> void operator()(V v, G g) { ++dummy; } to template<typename V, typename G> void operator()(V v, G& g) { ++dummy; } and template<typename V, typename G> void examine_vertex(V v, G g) { ++dummy; } to template<typename V, typename G> void examine_vertex(V v, G& g) { ++dummy; } should reduce your running times about 500-fold, down to the expected running times. HTH Cromwell Enage __________________________________ Do you Yahoo!? Yahoo! Movies - Buy advance tickets for 'Shrek 2' http://movies.yahoo.com/showtimes/movie?mid=1808405861

1 0

BGL: why is the prim algorithm only useable for undirected graphs?
by boost＠spyderworks.de 13 May '04

13 May '04

Hi all, in the documentation of prim_minimum_spanning_tree is mentioned "... solving the minimum spanning tree problem for an undirected graph with weighted edges ...". In my application I use this graph type (the graph type is bidirectionalS => not directed): typedef adjacency_list<vecS,vecS,bidirectionalS,no_property,property<edge_weight_t,int> > BGraph; This type modells the VertexListGraph and IncidenceGraph concepts, which are required by the prim function. If I call the prim_minimum_spanning_tree, I get reasonalble results. In literature, I can only find usage of Prims algorithm for undirected graphs, too. But I can see no reason, why it shouldn't work for directed graphs. Can you tell me more? Best regards Stefan Rauch

3 2

Visitor makes Dijkstra slow
by Martin von Gagern 13 May '04

13 May '04

Hello. I compiled the attached program on my system: boost-1.31.0 g++ (GCC) 3.3.2 20031218 (Gentoo Linux 3.3.2-r5, propolice-3.3-7) CXXFLAGS="-O3" Linux 2.6.5 #1 SMP i686 Pentium III (Coppermine) GenuineIntel GNU/Linux I get the following timings: Without any visitor: 10000 With dijkstra visitor: 7450000 With event visitor: 7430000 I cannot understand this difference, for the visitor is doing almost no work at all. Can you explain why using a visitor slows things down so much? Did I do anything wrong? Greetings, Martin von Gagern

1 0

Shared_Ptr problem with 1.30.2 and gcc 3.2.3
by Joshua Little 13 May '04

13 May '04

I've been using shared_ptr's for a while now with gcc 3.1 and recently had to upgrade to gcc 3.2.3. Ever since then I'm getting strange crashes when shared_ptr's are destructed. Heres a backtrace : Program received signal SIGSEGV, Segmentation fault. 0x77f967bf in ?? () (gdb) bt #0 0x77f967bf in ?? () #1 0x77fb5c15 in ?? () #2 0x77fa6afc in ?? () #3 0x77fccc55 in ?? () #4 0x78001e00 in _libmsvcrt_a_iname () #5 0x0050f4f5 in operator delete(void*) () #6 0x00541cc4 in boost::detail::sp_counted_base_impl<BeamWeaponXMLLoader*, boost::checked_deleter<BeamWeaponXMLLoader> >::~sp_counted_base_impl() ( this=0x1899aa0) at e:/MinGW/include/c++/3.2.3/iostream:63 #7 0x0053fada in boost::detail::sp_counted_base::destruct() (this=0x1899aa0) at e:/boost-1.30.2/boost/detail/shared_count.hpp:113 #8 0x0053f996 in boost::detail::sp_counted_base::weak_release() ( this=0x1899aa0) at e:/boost-1.30.2/boost/detail/shared_count.hpp:168 #9 0x0053fab4 in boost::detail::sp_counted_base::release() (this=0x1899aa0) at e:/boost-1.30.2/boost/detail/shared_count.hpp:144 #10 0x0053f913 in boost::detail::shared_count::~shared_count() (this=0x1899154) at e:/boost-1.30.2/boost/detail/shared_count.hpp:376 #11 0x005393e5 in boost::shared_ptr<BeamWeaponXMLLoader>::~shared_ptr() ( this=0x1899150) at src/loaders/HullXMLLoader.cpp:19 #12 0x0043489a in HullXMLLoader::~HullXMLLoader() (this=0x1899100) at src/loaders/HullXMLLoader.cpp:32 #13 0x0053b5ba in void boost::checked_delete<HullXMLLoader>(HullXMLLoader*) ( x=0x1899100) at e:/boost-1.30.2/boost/checked_delete.hpp:34 #14 0x0055b43d in boost::checked_deleter<HullXMLLoader>::operator()(HullXMLLoader*) const (this=0x1899d08, x=0x1899100) at e:/boost-1.30.2/boost/checked_delete.hpp:52 #15 0x00540b8b in boost::detail::sp_counted_base_impl<HullXMLLoader*, boost::checked_deleter<HullXMLLoader> >::dispose() (this=0x1899cf8) at e:/boost-1.30.2/boost/detail/shared_count.hpp:262 #16 0x0053faa6 in boost::detail::sp_counted_base::release() (this=0x1899cf8) at e:/boost-1.30.2/boost/detail/shared_count.hpp:143 #17 0x0053f913 in boost::detail::shared_count::~shared_count() (this=0x18990e4) at e:/boost-1.30.2/boost/detail/shared_count.hpp:376 #18 0x00536f09 in boost::shared_ptr<HullXMLLoader>::~shared_ptr() ( this=0x18990e0) at src/loaders/StarShipXMLLoader.cpp:13 #19 0x00432ba8 in StarShipXMLLoader::~StarShipXMLLoader() (this=0x18990c8) at src/loaders/StarShipXMLLoader.cpp:23 #20 0x00523926 in void baleet<StarShipXMLLoader>(StarShipXMLLoader*) ( x=0x18990c8) at src/Deleters.hpp:36 #21 0x0055d119 in baleeter<StarShipXMLLoader>::operator()(StarShipXMLLoader*) const (this=0x1899d40, x=0x18990c8) at src/Deleters.hpp:48 #22 0x0054170f in boost::detail::sp_counted_base_impl<StarShipXMLLoader*, baleeter<StarShipXMLLoader> >::dispose() (this=0x1899d30) at e:/boost-1.30.2/boost/detail/shared_count.hpp:262 #23 0x0053faa6 in boost::detail::sp_counted_base::release() (this=0x1899d30) at e:/boost-1.30.2/boost/detail/shared_count.hpp:143 #24 0x0053f913 in boost::detail::shared_count::~shared_count() (this=0x22fd14) at e:/boost-1.30.2/boost/detail/shared_count.hpp:376 #25 0x00538b1d in boost::shared_ptr<StarShipXMLLoader>::~shared_ptr() ( this=0x22fd10) at src/Player.cpp:76 #26 0x0040cd8f in Player::Player(EngineManager*, GameManager*) ( this=0x1898cd8, NewEngine=0x17d7a20, NewGameManager=0x1852ec8) at src/Player.cpp:96 #27 0x00407e4e in GameManager::Initialise() (this=0x1852ec8) at src/GameManager.cpp:125 #28 0x0040398a in main (argc=1, argv=0x17924f8) at src/ZeroSpace.cpp:32 I am constructing the shared_ptr's in a normal way : HullLoader.reset(new HullXMLLoader()); for instance. It seems to segfault when delete is called either with the default deleter or with one of my own. This was working fine when using gcc 3.1, do I need to upgrade my boost or use some compile flag? Any help would be greatfully appriciated, Joshua.

1 0

boost regex support for 64-bit
by itay 12 May '04

12 May '04

does boost regex support 64-bit for SunOS 5.8, HP-UX 11i (native compilers), WIN (MSVC-6) ? we are using an old(?) version - regexpp version 3.12. Is it recommended to upgrade to the latest version ? Is it essential to upgrade to the latest version with relevance to 64-bit compilation ? thanks, Itay

2 1

BGL: record tree-edges of MST during prim_minimum_spanning_tree
by boost＠spyderworks.de 12 May '04

12 May '04

Hi, I'm looking for a possibility to record the tree edges in the minimum spanning tree (like the result of kruskal_minimum_spanning_tree). But unfortenuatley I depend on using the prim_minimum_spanning_tree function, because the root of the tree has to be defined. My first idea was, to use a dijkstra visitor and do something with the edge_relaxed respectivley edge_not_relaxed events, but this doesn't work, because these events doesn't give me an unique edge state. Maybe anyone has another hint? best regards Stefan Rauch

1 0

AW: [Boost-users] BGL: using an edge_descriptor as key in a map
by boost＠spyderworks.de 12 May '04

12 May '04

Hi Doug, [...] > > I intend to write a visitor class which sets a boolean to each edge, and > > therefore I need the edge as key. > > Common ways to do this include using internal properties and maintaining your > own edge_index (internal) property so that you can build property maps out of > vectors. [...] I don't know, if I understand correctly? Would I request the edges' index in the callback member function of the visitor and use this as index to a vector? Maybe you can give me an example? I'm pretty new to boost. Thanks Stefan Rauch

1 0

Re: Boostifying GluCat
by Paul C. Leopardi 11 May '04

11 May '04

Hi all, Back in January last year, I asked if there was any documentation which could help me to Boostify GluCat: http://lists.boost.org/MailArchives/boost-users/msg02787.php Since then I have been very busy, but in the next few months I may be able to find the time to get this done right, so I'm asking again: GluCat is a new numeric template class library, hopefully destined for promotion to Boost. I would like to know where there is some documentation on how to: 1. Add concepts. Is there such a thing as a non-commutative multiplication concept? How do I check concepts? 2. Add numeric limits. Limits of U<T> would default to limits of T. 3. Add numeric promotion_traits. What are promotion_traits ? There is a discussion on ublas-dev mailing list about promotion_traits within uBLAS. 4. Add numeric type_traits. Also, is there a set of documented procedures which explain what is required for a library to be included in Boost? GluCat uses uBLAS. Should I take these questions to ublas-dev? Thanks

1 0

Re: is_sequence
by Rozental, Gennadiy 11 May '04

11 May '04

> It already works. If you want to detect STL sequence-ness, you'll > have to try some nasty hacks. I'm have doubts about whether it's even > possible to approximate that metafunction in portable code. Wouldn't something about these lines work? template<typename T> char test( T const&, long ); template<typename T> int test( std::list<T> const&, int ); template<typename T> struct is_list { static T t; enum { value = sizeof( test( t, 0 ) ) == 4; } }; Gennadiy.

2 1

[BGL] graph constness and vertex/edge iterators
by Cyrille Damez 11 May '04

11 May '04

Hi all, I'm currently trying to write a wrapper in order to use the BGL algorithms and visitors on a home-made graph class. If I'm not mistaken, this requires me to write (amongst other things) a couple functions that will return iterators over my graph edges and vertices, eg: std::pair<graph_traits<MyGraph>::out_edge_iterator, graph_traits<MyGraph>::out_edge_iterator > out_edges(graph_traits<MyGraph>::vertex_descriptor u, const MyGraph& g) and similarly in_edges(...) , vertices(...) and edges(...) functions. However, it seems that this function profile forces me to do a const_cast on g when implementing the function body since the out_edge_iterators are not const iterators, though they point to internal elements of g. I had a look at the example given in the documentation (dealing with converting LEDA graphs to the BGL), but I didn't see anything helping me on this particular issue (also, the example in the doc is a bit outdated since it uses the deprecated Boost iterator adaptors). Am I forced to rely on const_cast in these functions, or is there a way to declare my graph edges, vertices and the corresponding iterators as const in my graph_traits class ? I'm a newbie with the BGL, and more generally with this whole traits/template specialization style of programming, so please excuse me if I overlooked something obvious. Cheers.

3 4

is_sequence
by Wolfgang Meyer 11 May '04

11 May '04

Is boost::mpl::is_sequence supposed to work with gcc 3.2.2 ? I'm trying to use it, but get "false" for boost::mpl::is_sequence<std::list<int> >::value using boost 1.31.0. The same happens with boost::mpl::has_begin. I'm working with FreeBSD 5.1. Any hints how to get it to work would be greatly appreciated. Wolfgang Meyer

2 1

BOOST_NO_MEMBER_TEMPLATE_FRIENDS
by Witz 11 May '04

11 May '04

if the following code is commented out from visualc.hpp the standard streaming operators become available for mersenne_twister - and they seem to work fine. is this a bug or have i just been fortunate in my experimentation? #if _MSC_VER <= 1310 # define BOOST_NO_MEMBER_TEMPLATE_FRIENDS #endif ian whittley

2 2

BGL: using an edge_descriptor as key in a map
by boost＠spyderworks.de 11 May '04

11 May '04

Hi, is it possible to use an edge_descriptor (boost::graph_traits<G>::edge_descriptor) as key in a map? I intend to write a visitor class which sets a boolean to each edge, and therefore I need the edge as key. The result of my first try is, that the compiler complains about the missing '<' operator of the key in the map. Best regards Stefan Rauch

2 1

RE: [Boost-users] help: boost::thread and compile error
by Ben Hutchings 10 May '04

10 May '04

Guillermo Martony <gmartony(a)cue.com.uy> wrote: > Greetings, > The following code taken from an example compiles without errors: > > #include <boost/thread/thread.hpp> > #include <boost/thread/xtime.hpp> > #include <iostream> > class thread_alarm > { <snip> > }; > > int main() > { > int secs = 5; > std::cout << "setting alarm for 5 seconds..." << std::endl; > thread_alarm alarm(secs); > boost::thread thrd(alarm); > thrd.join(); > return 0; > } > > But adding a std::fstream varible to the thread_alarm class: <snip> > Results in the following compilation error: > > c:\opt\include\boost\function\function_template.hpp(289): > error C2664: 'void > boost::function0<R,Allocator>::assign_to(Functor)' : cannot convert > parameter 1 from 'const thread_alarm' to 'thread_alarm' > with > [ > R=void, > Allocator=int, > Functor=thread_alarm > ] The boost::thread constructor copies its argument, so the thread_alarm class needs to be copiable, but std::fstream is not copiable. You might be better off using Boost.Bind to produce a lightweight functor.

1 0

boost::bind vs boost::mem_fun (was RE: [Boost-users] Re: shared_ptrs with std::mem_fn)
by Mark Storer 10 May '04

10 May '04

> > template<class _R, class _Ty> > > class mem_fun_t : public unary_function<_Ty *, _R> { > > public: > > explicit mem_fun_t(_R (_Ty::*_Pm)()) > > : _Ptr(_Pm) {} > > _R operator()(_Ty *_P) const > ^^^^^^^ > > {return ((_P->*_Ptr)()); } > > private: > > _R (_Ty::*_Ptr)(); > > }; > > --- > > <...> > No, the relevant part is the signature I highlighted above. <...> > > All I have to say is "use boost::mem_fn, which works, and never > touch the one in std::". Thanks for clearing that up, it was really bugging me. So to speak. ;) I've recently started using boost::bind, and I think I'm in love. But boost::mem_fun raises another question in my mind: Are there any cases where "boost::bind( &foo::bar, _1 )" is superior to "boost::mem_fun( &foo::bar )" (other than a few less keys to press)? I'd say that boost::bind is clearly supperior when "bar" takes a parameter, but when it does not, the water gets a little muddy. I'd imagine that you wouldn't get the long stream of error messages (expected N params not Y, expected N + 1 params, not Y, expected N + 2 ...) from bind when all the different variants miss, but is there anything else? --Mark Storer Senior Software Engineer Verity, Inc.

1 0