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

[1.41.0] PDF Build of documentation available.
by John Maddock 20 Nov '09

20 Nov '09

A PDF build of the documentation for Boost-1.41 (for those libraries that support it) is now available from the usual sourceforge download site: https://sourceforge.net/projects/boost/files/ in the boost-docs/1.41.0 folder. Direct URL's are: https://sourceforge.net/projects/boost/files/boost-docs/1.41.0/boost_pdf_1_… (23Mb) https://sourceforge.net/projects/boost/files/boost-docs/1.41.0/boost_pdf_1_… (22.5Mb) https://sourceforge.net/projects/boost/files/boost-docs/1.41.0/boost_pdf_1_… (22.2Mb) https://sourceforge.net/projects/boost/files/boost-docs/1.41.0/boost_pdf_1_… (21Mb) Enjoy! John.

1 0

boost python beginner questions...
by Jebagnana Das 20 Nov '09

20 Nov '09

Hello to all, Thank you for giving me an oppurtunity to interact with you all through this mailing list.. After installing boost python and bjam from ubuntu 9.04 repositories i can't find a clear detailed description about compiling and running the boost python program from it's tutorials .. Can any among you please tell me what are the options we need to be give to compile like g++ filename path/to/boost etc., and run this hello world boost python program http://wiki.python.org/moin/boost.python/SimpleExample using and without bjam. This is what i did. I created a c++ file named hello.cpp with the contents.. #include <string> namespace { // Avoid cluttering the global namespace. // A couple of simple C++ functions that we want to expose to Python. std::string greet() { return "hello, world"; } int square(int number) { return number * number; } } #include <boost/python.hpp> using namespace boost::python; BOOST_PYTHON_MODULE(getting_started1) { // Add regular functions to the module. def("greet", greet); def("square", square); } What should i do to make this as "a shared library and put it on the PYTHONPATH" as said in the tutorial?? (This question may sound trivial or silly but these are essential components that "must must" be included while writing a tutorial bcoz. it's gonna be read by people at all levels.. This 'll dampen the spirits of the beginner if he can't get to know how to compile and run it.. Sorry if i offended you..). FYI:I'm using python 3.1 Thanks & Regards..

1 0

[Boost] [Spirit] parse_ast, leaf_node_d and skip parser
by Vincent Jacques 20 Nov '09

20 Nov '09

Hello, Using Boost.Spirit, when I group nodes with a leaf_node_d directive and call parse_ast, it looks like I get a node whose value includes some characters that are supposed to be skipped. My questions: am I missing anything? Is this intended? If yes, what am I missing (again)? Is there a way to work around this? Here is a simple example program (it should compile and demonstrate what I mean, with boost 1.39 and 1.40) // BEGIN OF THE PROGRAM #include <iostream> #include <boost/spirit/include/classic_core.hpp> #include <boost/spirit/include/classic_lists.hpp> #include <boost/spirit/include/classic_ast.hpp> #include <boost/spirit/include/classic_tree_to_xml.hpp> namespace bs = boost::spirit::classic; template< typename IteratorT > class OkGrammar : public bs::grammar< OkGrammar< IteratorT > > { public: template< typename ScannerT > struct definition { bs::rule< ScannerT, bs::parser_context<>, bs::parser_tag< 1 > > start() { return startRule; } definition( const OkGrammar& ) { startRule = bs::list_p( identifier, bs::ch_p( ',' ) ); identifier = +bs::alpha_p; } bs::rule< ScannerT, bs::parser_context<>, bs::parser_tag< 1 > > startRule; bs::rule< ScannerT, bs::parser_context<>, bs::parser_tag< 2 > > identifier; }; }; template< typename IteratorT > class StrangeGrammar : public bs::grammar< StrangeGrammar< IteratorT > > { public: template< typename ScannerT > struct definition { bs::rule< ScannerT, bs::parser_context<>, bs::parser_tag< 1 > > start() { return startRule; } definition( const StrangeGrammar& ) { startRule = bs::list_p( identifier, bs::ch_p( ',' ) ); identifier = bs::leaf_node_d[ +bs::alpha_p ]; } bs::rule< ScannerT, bs::parser_context<>, bs::parser_tag< 1 > > startRule; bs::rule< ScannerT, bs::parser_context<>, bs::parser_tag< 2 > > identifier; }; }; int main( int argc, char *argv[] ) { std::string input = " Hello , wor , ld "; std::map< bs::parser_id, std::string > ruleNames; ruleNames[ 1 ] = "startRule"; ruleNames[ 2 ] = "identifier"; typedef std::string::const_iterator iterator; iterator first = input.begin(); iterator last = input.end(); bs::tree_parse_info< iterator > info = bs::ast_parse( first, last, OkGrammar< iterator >(), +bs::space_p ); bs::tree_to_xml( std::cout, info.trees, input, ruleNames ); std::cout << std::endl; info = bs::ast_parse( first, last, StrangeGrammar< iterator >(), +bs::space_p ); bs::tree_to_xml( std::cout, info.trees, input, ruleNames ); } // END OF THE PROGRAM Here is the output: <?xml version="1.0" encoding="ISO-8859-1"?> <!DOCTYPE parsetree SYSTEM "parsetree.dtd">  <parsetree version="1.0"> <parsenode rule="startRule"> <parsenode rule="identifier"> <parsenode> <value>H</value> </parsenode> <parsenode> <value>e</value> </parsenode> <parsenode> <value>l</value> </parsenode> <parsenode> <value>l</value> </parsenode> <parsenode> <value>o</value> </parsenode> </parsenode> <parsenode> <value>,</value> </parsenode> <parsenode rule="identifier"> <parsenode> <value>w</value> </parsenode> <parsenode> <value>o</value> </parsenode> <parsenode> <value>r</value> </parsenode> </parsenode> <parsenode> <value>,</value> </parsenode> <parsenode rule="identifier"> <parsenode> <value>l</value> </parsenode> <parsenode> <value>d</value> </parsenode> </parsenode> </parsenode> </parsetree> <?xml version="1.0" encoding="ISO-8859-1"?> <!DOCTYPE parsetree SYSTEM "parsetree.dtd">  <parsetree version="1.0"> <parsenode rule="startRule"> <parsenode rule="identifier"> <value>Hello</value> </parsenode> <parsenode> <value>,</value> </parsenode> <parsenode rule="identifier"> <value> wor</value> </parsenode> <parsenode> <value>,</value> </parsenode> <parsenode rule="identifier"> <value> ld</value> </parsenode> </parsenode> </parsetree> In the first xml tree, there are no node with spaces, while in the second, the identifiers do have spaces. Thank you for your help, -- Vincent Jacques "S'il n'y a pas de solution, c'est qu'il n'y a pas de problème" Devise Shadock

2 2

[Test] Spelling error in docs
by OvermindDL1 20 Nov '09

20 Nov '09

On the page: http://www.boost.org/doc/libs/1_41_0/libs/test/doc/html/tutorials/new-year-… Search for "BOOST_AUTO_EST_CASE", it needs to be replaced with "BOOST_AUTO_TEST_CASE", makes for a bad copy/paste when learning the thing... :)

1 1

Invitation to connect on LinkedIn
by Leandro Lima 20 Nov '09

20 Nov '09

LinkedIn ------------ I'd like to add you to my professional network on LinkedIn. - Leandro Leandro Lima Programmer at Universidade Federal de Minas Gerais Brazil Confirm that you know Leandro Lima https://www.linkedin.com/e/isd/876040909/N6GauMry/ ------ (c) 2009, LinkedIn Corporation

1 0

Heap vs. Stack allocation of filtering_streambuf??
by Eric R George 19 Nov '09

19 Nov '09

Hi Folks - I'm working on a mod to an existing program to write compressed output files. The following code works fine, but if I put the indicated code in a function, it drops core when I attempt to write to the ofile ostream - presumably because the filtering_streambuf<output> out was allocated on the stack and no longer exists after the function exits. #include <fstream> #include <iostream> #include <string> #include <boost/iostreams/filtering_streambuf.hpp> #include <boost/iostreams/filter/bzip2.hpp> using namespace std; using namespace boost::iostreams; using namespace boost::iostreams::bzip2; int main() { string x; fstream infile; infile.open("00011.eph.org", ios::in); ostream *ofile; //******* To be put in function ************************ fstream *file2; file2 = new fstream; file2->open("00011.eph.org.bz2", ios_base::out | ios_base::binary); filtering_streambuf<output> out; out.push(bzip2_compressor()); out.push(*file2); ofile = new ostream(&out); //******* To be put in function ************************ while(!infile.eof()) { getline(infile, x); *ofile << x << endl; } return 0; } //***************************************************************************** Now if I attempt to dynamically allocate the filtering_streambuf. #include <fstream> #include <iostream> #include <string> #include <boost/iostreams/filtering_streambuf.hpp> #include <boost/iostreams/filter/bzip2.hpp> using namespace std; using namespace boost::iostreams; using namespace boost::iostreams::bzip2; int main() { string x; fstream infile; infile.open("00011.eph.org", ios::in); ostream *ofile; //******* To be put in function ************************ fstream *file2; file2 = new fstream; file2->open("00011.eph.org.bz2", ios_base::out | ios_base::binary); filtering_streambuf<output> *out; out = new filtering_streambuf<output>; out->push(bzip2_compressor()); out->push(*file2); ofile = new ostream(out); //******* To be put in function ************************ while(!infile.eof()) { getline(infile, x); *ofile << x << endl; } return 0; } This code compiles and runs fine, but the compressed output file, 00011.eph.org.bz2, ends up empty. Moving the indicated code to a function again works fine - but again, no output?? The reasoning for all this is that I'd like to be able to open and set up the various output streams in a function, and then pass those streams around as needed. Which means they need to be dynamically allocated/built on the heap. But it's not working?? Ideas? What am I missing here? Thanks Eric

2 2

[Graph] changes in 1_40
by Meththa 19 Nov '09

19 Nov '09

Hi, I've noticed that the Graph library has changed in the new version, though the documentation and the examples have not been updated. I am trying to use the fruchterman_reingold algorithm. I am confused as to the new parameters topology, origin and extent that are passed to the function. I think topology is given by xmin, ymin, xmax, ymax for a rectangular topology. For the origin, I have used topology.center() But I am at loss as to what the extent is and what I should assign it. Can someone please explain these new parameters and what values are expected. Thank you.

3 4

How to create 1.41 Debian .deb packages?
by Joost Kraaijeveld 19 Nov '09

19 Nov '09

Hi, Can anyone tell me how I can create Debian .deb packages fro Boost 1.41, as they are not available from any repository? Preferably written down for dummies.... TIA -- Groeten, Joost Kraaijeveld Askesis B.V. Molukkenstraat 14 6524NB Nijmegen tel: 024-3888063 / 06-51855277 fax: 024-3608416 web: www.askesis.nl

2 2

[boost::asio] Proxy with external app protocol bulk transfer recv issue.
by Patryk Bukowinski 19 Nov '09

19 Nov '09

Hello all, I'm during proxy application development. I'm forced to use external application protocol over TCP. I'm running application on windows and linux (ubuntu). Actors: - client app (sends data) - server app (receives data and sends this same data back) - MIM - my proxy Server receives all data, tries to send it back, but variously proxy stuck waiting for complete data. When issue appears: - The issue I'm struggling with, appears only on linux. - The issue shows up in various cases but always when transferring bulk data (bigger then my buffer size (essentially - 20kB). When issue doesn't appears: - The issue doesn't exist without my proxy (direct client-server connection). Both of applications are allocating this bulk data. So they send and receive data in single step. - during step debugging :) One problem I see is that protocol of that system is designed in a way that it: - uses non blocking sockets - does not check each time is socket ready (only on "handshake") which causes EAGAIN error. How i do networking: CLIENT -> PROXY -> SERVER --------------------- client_send(big_data) -> async_read(proxy_cli_sock ...) -> async_write(proxy_serv_sock ...) -> server_select() -> server_recv() = * = (until whole big data will be transfered) I haven't observed any issues here Client stack trace: fcntl64(3, F_SETFL, O_RDONLY) = 0 send(3, "\1\1\0\0\0315\f0"..., 800025, 0) = 800025 Server stack trace: (This is repeated many times, with some EAGAING errors on server) select(5, [0 3 4], [], NULL, {0, 665119}) = 1 (in [4], left {0, 664454}) recv(4, "\1\1\0\0\0315\f\0", 8, 0) = 8 recv(4, "\0\0\60"..., 800017, 0) = 59992 recv(4, 0xb36d7a90, 740025, 0) = -1 EAGAIN (Resource temporarily unavailable) gettimeofday({1257845153, 280644}, NULL) = 0 select(5, [0 3 4], [], NULL, {0, 663455}) = 1 (in [4], left {0, 662128}) recv(4, "@\0\0\5"..., 740025, 0) = 56384 .. .. (but finally whole message is received by server) SERVER -> PROXY -> CLIENT --------------------- server_select()-> serv_send(proxy_fd) -> async_read(proxy_serv_sock ...) -> async_write(proxy_cli_sock ...) -> client_select() -> client_recv(proxy_fd) select(5, [0 3 4], [4], NULL, {0, 651671}) = 1 (out [4], left {0, 651666}) send(4, "\1\00"..., 800015, 0) = 65536 send(4, "\0\\0"..., 734478, 0) = 114688 send(4, "\0\\0"..., 619790, 0) = -1 EAGAIN (Resource temporarily unavailable) gettimeofday({1257845153, 293482}, NULL) = 0 ... select(5, [0 3 4], [4], NULL, {0, 645928}) = 1 (out [4], left {0, 644732}) send(4, "\0\0\0"..., 46350, 0) = 46350 *** Above is saying that transfer is complete, but I'm missing some (unfortunately I haven't inspect which one) data packet. And here is where my proxy is waiting for a packet, (ass well as client is) gettimeofday({1257845153, 299914}, NULL) = 0 select(5, [0 3 4], [], NULL, {0, 644185}) = 0 (Timeout) .... .... I've attached whole stack trace of client and server. Please point me any kind of solution.

1 0

Broken test results pages
by Martin_Thomas＠McAfee.com 18 Nov '09

18 Nov '09

A number of pages presenting test results appear to be broken with no content at all (not even <html></html>) Some examples: http://www.boost.org/development/tests/trunk/developer/summary_release.html http://www.boost.org/development/tests/trunk/user/summary.html http://www.boost.org/development/tests/release/user/summary_release.html http://www.boost.org/development/tests/trunk/user/index.html These are links that are found at the top of the developer summary page (http://www.boost.org/development/tests/release/developer/summary.html) or from the main testing page (http://www.boost.org/development/testing.html) Cheers // Martin Martin Thomas Sr. Software Engineer Risk and Compliance BU McAfee, Inc. 972.963.7680 Direct

1 0

[variant] apply_visitor/static access to which()
by Stefan Strasser 18 Nov '09

18 Nov '09

Hi, I have a problem regarding the static visitor of boost::variant. there is a variant and a mpl vector: variant<A1,A2,A3> var; typedef mpl::vector<B1,B2,B3> B_types; the variant and the vector have the same number of types, but not the same types. I need to "visit" the element of the variant, and access the B_types element at the same position as the element of the variant: struct visitor : static_visitor<void>{ template<class A> void operator()(A a) const{ typedef typename mpl::at_c<B_types,var.which()>::type B; //error } }; so if var.which() == 1, I need a typedef of type B2. obviously the code above doesn't work because which() is a runtime function. but the value of which() is known statically at this point (that's the point of visitation). is there a way to access it, with boost::variant visitors? I like neither of the solutions I can come up with: 1. write my own visitation pattern that not only instantiates the visitor with the variant type but also with the vector type. 2. convert the variant to template<class A,class B> struct A_holder{ typedef B B_type; A value; }; variant<A_holder<A1,B1>,A_holder<A2,B2>,A_holder<A3,B3> > var; 3. do a seperate "visition" of the mpl vector inside the variant visitor: struct visitor : static_visitor<void>{ template<class A> void operator()(A a) const{ switch(var.which()){ case... case... } } }; is there a better way to do this?

1 1

Boost release 1.41.0 available
by Beman Dawes 18 Nov '09

18 Nov '09

Boost release 1.41.0 is now available. This release contains one new library and numerous bug fixes for existing libraries. For details, including download links, see http://www.boost.org/users/news/version_1_41_0 The release can also be downloaded directly from SourceForge. See http://sourceforge.net/projects/boost/files/ To install this release on your system, see http://www.boost.org/doc/libs/1_41_0/more/getting_started/index.html Thanks, --The Boost release team

1 0

[asio] Error: should never be called
by Norbert Wenzel 18 Nov '09

18 Nov '09

Since a few days I do get strange exceptions (boost::system::system_error) from my asio network code, based on v1.39. The message logged with .what() and .code() gives the following line: winsock: error: should never be called (error: should never be called:16646560) (The .code() output is put in parentheses.) I found two functions that produce the message in error_code.hpp (line 479ff) but I have no idea why they shouldn't be called. There's a comment to explain the implementation that refers to VC++ 8, but I have VC++ 7.1, so it doesn't seem that this code is called for VC++ 8 only. Are there any known cases, that produce this error message? thanks, Norbert

1 0

asio::async_write
by Lloyd 18 Nov '09

18 Nov '09

Hi, I have been trying very hard to "compile" this code. What is the reason for the compilation errors in the "async_write" call. #include <boost/bind.hpp> #include <boost/enable_shared_from_this.hpp> #include <boost/asio.hpp> using boost::asio::ip::tcp; class aa { public: void testme() { char a[20]="<test data>"; boost::asio::io_service io; tcp::socket s(io); boost::asio::async_write(s,boost::asio::buffer(a,sizeof(a)), boost::bind(&aa::handler,shared_from_this(),boost::asio::placeholders::error)); } void handler(const boost::system::error_code& error) { } private: }; int main() { aa x; x.testme(); return 0; } The erros I got are: ==================== 1>------ Build started: Project: del, Configuration: Release Win32 ------ 1>Compiling... 1>del.cpp 1>.\del.cpp(19) : error C2780: 'void boost::asio::async_write(AsyncWriteStream &,boost::asio::basic_streambuf<Allocator> &,CompletionCondition,WriteHandler)' : expects 4 arguments - 3 provided 1> C:\Program Files\boost140\boost/asio/write.hpp(510) : see declaration of 'boost::asio::async_write' 1>.\del.cpp(19) : error C2784: 'void boost::asio::async_write(AsyncWriteStream &,boost::asio::basic_streambuf<Allocator> &,WriteHandler)' : could not deduce template argument for 'boost::asio::basic_streambuf<Allocator> &' from 'boost::asio::mutable_buffers_1' 1> C:\Program Files\boost140\boost/asio/write.hpp(453) : see declaration of 'boost::asio::async_write' 1>.\del.cpp(19) : error C2784: 'void boost::asio::async_write(AsyncWriteStream &,boost::asio::basic_streambuf<Allocator> &,WriteHandler)' : could not deduce template argument for 'boost::asio::basic_streambuf<Allocator> &' from 'boost::asio::mutable_buffers_1' 1> C:\Program Files\boost140\boost/asio/write.hpp(453) : see declaration of 'boost::asio::async_write' 1>.\del.cpp(19) : error C2780: 'void boost::asio::async_write(AsyncWriteStream &,const ConstBufferSequence &,CompletionCondition,WriteHandler)' : expects 4 arguments - 3 provided 1> C:\Program Files\boost140\boost/asio/write.hpp(411) : see declaration of 'boost::asio::async_write' 1>.\del.cpp(19) : error C3861: 'shared_from_this': identifier not found 1>Build log was saved at "file://c:\Documents and Settings\Administrator\Desktop\del\del\Release\BuildLog.htm" 1>del - 5 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== ______________________________________ Scanned and protected by Email scanner

4 7

[Bimap] Many warnings
by Dylan Klomparens 18 Nov '09

18 Nov '09

I declared a bimap in my code and discovered that it generates 200+ warnings. I'm using MS Visual Studio 2008 with Boost 1.41. All the warnings are the same: C4503: '<long variable name>' : decorated name length exceeded, name was truncated Functionally, the program *should* still work despite all the warnings (from what I've found on Google), but I'd like to know why this many warnings are generated by declaring: "boost::bimap<int, int> RemoteIdentityMap;". Does anyone know? -- Dylan

2 1

Shortest path problem: distance between two vertices
by Pedram Pedarsani 18 Nov '09

18 Nov '09

I am kind of new to C++ and also boost library, trying to use the bfs to find the distance between two vertices in a graph. As I read from previous posts, the easiest way would be to throw an exception once the target vertex has been discovered. Now the problem is that I can't figure out how to do this, and this is pretty urgent! Can you help me with a few lines of code which make the bfs_visitor and call the bfs function for this purpose? Thanks a lot!

2 1

Re: [Boost-users] [Graph] changes in 1_40 (Meththa)
by Ralph Gauges 18 Nov '09

18 Nov '09

Hi, I think you can pass whatever you want for those parameters since they are actually not used in the algorithm. The only thing that is used it the topology. Actually the fruchterman algorithm in 1.40 was broken and did not work for me. Maybe you should give the newly released 1.41 a try because there the two parameters origin and extend have been removed and the bug that was in 1.40 has been fixed. Best Ralph

1 0

How to upload a file with ASIO
by Ramon F Herrera 18 Nov '09

18 Nov '09

Hello, I have successfully implemented clients and servers, both in the Windows side and the Linux side. So far, the Windows client passes a set of parameters and the servers returns some text which is displayed on the client's screen. That part is working perfectly. My next challenge is to upload a whole file(s) from the client to the server and would like hear any tips, caveats from experienced ASIO users. Thanks to everyone for sharing their expertise. Regards, -Ramon

2 4

Re: [Boost-users] [serialization] Problems with serializingashared_ptr
by Robert Ramey 17 Nov '09

17 Nov '09

dfs(a)savarese.org wrote: > In message <hdt8vh$66b$1(a)ger.gmane.org>, "Robert Ramey" writes: >> I'm pretty sure I addressed this in 1.41 Robert Ramey > the fix, report back, and possibly improve on the fix if required and > submit a patch via the issue tracking system. By the same token, when > users report a problem, it would be extremely helpful if they were to > post a concise self-contained compilable example that reproduces the > problem so that both the library maintainer and other users can > readily understand and isolate the issue as well as verify any > proposed fixes. > If this is already happening via the issue tracking system, then I > apologize for restating the obvious. I'm simply finding it very > difficult to determine which Boost.Serialization problems being > reported on the mailing list are real or imagined. Well, it's not always easy for me either. The tracking system has worked well for me and I make an effort address issues reported there. > Since I cannot reproduce either reported problem, I have to assume > the problems are either compiler-specific or caused by operator error > until shown otherwise. Looks like I may have been able to reproduce the problem here. I'll let you know. Robert Ramey

1 0

[python] undefined symbol Py_InitModule4
by Jan Boehme 17 Nov '09

17 Nov '09

Hi, I'm new to boost python and built an extension on Centos 4 64bit using Boost 1.40 and python 2.3.4-14.7.el4_8.2 and it runs like a charm on the same machine. After that I tried to use my extension on a RHEL4 with python 2.3.4-14.3 installed and got the following error: ImportError: /tmp/install/lib/libboost_python.so.1.40.0: undefined symbol: Py_InitModule4 I get the same error when using python 2.6 on Fedora 11 64bit. Is this some kind of versioning issue? I'm quite helpless with this and your help is highly appreciated. Cheers, Jan.

1 0

[bind] Binding a bound function does not compile
by Eugene Yakubovich 17 Nov '09

17 Nov '09

Hello, The following code does not compile (gcc 4.3.2, boost 1.40). #include <boost/bind.hpp> using boost::bind; void foo(int) {} template <class F> void invoker(F f) { f(); } template <class F> void call(F f) { bind(invoker<F>, f)(); } int main(int argc, char* argv[]) { call(bind(foo, 1)); return 0; } I am passing a bound function as an argument to bind. The binding itself seems to work but the call fails. In other words, if I change the line in call() to bind(invoker<F>, f); it compiles just fine. Any ideas? Thanks, Eugene This e-mail and its attachments are intended only for the individual or entity to whom it is addressed and may contain information that is confidential, privileged, inside information, or subject to other restrictions on use or disclosure. Any unauthorized use, dissemination or copying of this transmission or the information in it is prohibited and may be unlawful. If you have received this transmission in error, please notify the sender immediately by return e-mail, and permanently delete or destroy this e-mail, any attachments, and all copies (digital or paper). Unless expressly stated in this e-mail, nothing in this message should be construed as a digital or electronic signature.

2 1

Losing memory connecting multiple signals to a passed slot_type
by COBryan 17 Nov '09

17 Nov '09

Hi, I've been losing memory when using Boost::Signal. I cannot find anywhere in forums and documentation if it's legal to use a passed slot_type multiple times, so I feel that may be the issue, but was wondering if someone here could either verify that or otherwise help me fix my problem. I have a PageManager that inherits from boost::signals::trackable. From this PageManager I make this call: ------------------------- texthandle[i].getPhrases ( boost::bind( &PageManagerCommon::shortcutHandler, this, i ) ); ------------------------- TextHandle also inherits boost::signals::trackable. To test the leak, I replaced TextHandle::getPhrases with the following code: ------------------------- typedef boost::signal0<void> PhraseSignalType; struct PhraseType { PhraseSignalType signal; }; void TextHandle::getPhrases ( const PhraseSignalType::slot_type& aSlot //!< The slot to connect the phrase signals to ) const { PhraseType *phrase; std::list<PhraseType*> phraseList; std::list<PhraseType*>::iterator phraseIter; for(int i = 0; i < 50; i++) { phrase = new PhraseType; phrase->signal.connect(aSlot); phraseList.push_back(phrase); } for(phraseIter = phraseList.begin(); phraseIter != phraseList.end(); phraseIter++) { delete *phraseIter; } phraseList.clear(); return; } ------------------------- Now, what I expect to happen is to create 50 phrases, push them into a list, then iterate through the list destroying these phrases. When the phrase is destroyed, the signal should disconnect and clean itself up. Instead, my memory usage simply goes up. We use an allocator that tracks 'memory handles,' and it seems that the number of unfreed handles is always the number of phrases - 1, so in this case we had 49 handles that weren't freed. I feel like this has something to do with using the passed slot_type for multiple connects, but can't find anywhere saying that I can't do that. I would appreciate any suggestions. Thanks, Chris -- View this message in context: http://old.nabble.com/Losing-memory-connecting-multiple-signals-to-a-passed… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[boost::signals] Who deletes copied objects passed to slots?
by Ed Sutton 17 Nov '09

17 Nov '09

I am using boost::signals2 to pass copied objects from my library's worker thread to a client GUI. While this works well, the GUI must delete the copied objects when done which seems wrong. Are there any techniques I could use so that the client would not be responsible for the object deletion? Thanks in advance, -Ed Multi-threaded Red Hat Enterprise 5.x QT 4x

2 1

Boost.Statechart and CppUnit in Eclipse on Ubuntu
by Patricia Hawley 17 Nov '09

17 Nov '09

Hi, I have a simple state machine that I put together in NetBeans CDT (on a WinXP machine with MinGW) with a short main program to check the first few states. I then moved the code to a Linux box (Ubuntu) with Eclipse (gcc 4.3.3) and the CppUnit plug-in ECUT to follow our practices and procedures. The code compiles in the CppUnit test fixture; however, when the test reaches myMachine.initiate(); (the first thing that is Statechart-related) the testing stops. What can fail in the initiate() method that would stop the execution? Any suggestions on debugging this would be appreciated. Pat

2 1

boost statechart - using deep_history/shallow_history with custom reactions
by ae ss 17 Nov '09

17 Nov '09

Hi Question on using history with custom reactions I have a parent-state-A state and a parent-state-B state parent-state-A has a child-state-A1 and a child-state-A2 (nested state) The machine initializes on parent-state-A entering by default in child-state-A1 (the initial state) Then moves to child-state-A2 Then to parent-state-B Then a event occurs and I need the machine to go back to child-state-A2 (and not the initial state child-state-A2) question is how do I do it when using custom reactions that is, instead of doing a hardcoded parent-state-B::react (event& evty) { return transit<child-state-A2 > (); } I would like to do something like parent-state-B::react (event& evty) { return transit<parent-state-A > (); } and let the state machine figure out that it needs to go back to child-state-A2 rather then the initial child-state-A1 the documentation shows how to do it with sc::transition... but I couldn't find a way to do it in the case of custom reactions trial and error didn't work either... help! : ) thanks in advance silva

2 4