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

boost.mem_fn with _com_ptr_t
by Andy Tompkins 17 Sep '04

17 Sep '04

Hi, I am trying to use com smart pointers with boost::mem_fn I defined the following so that mem_fn would know about _com_ptr_t s: template <typename Interface> inline typename _com_ptr_t<Interface>::Interface* get_pointer(_com_ptr_t<Interface> const& p) { return p.GetInterfacePtr(); } but when I use the function object returned from boost::bind, I get a null pointer in my _com_ptr_t ADODB::_RecordsetPtr recordSet(__uuidof(ADODB::Recordset)); ... boost::bind(&ADODB::_Recordset::Close, recordSet)(); The problem seems to be in mem_fn_template.hpp The function class BOOST_MEM_FN_NAME(mf0)::operator()(U &u) const calls BOOST_MEM_FN_RETURN call(u, &u); and _com_ptr_t::operator&() calls _Release() and sets m_pInterface = NULL; Is there any way to get this to work correctly? Thanks in advance. Andy.

1 0

Re: [Boost-users] sort implementation based on swap
by John Meinel 17 Sep '04

17 Sep '04

Howard wrote: > > On Sep 15, 2004, at 5:28 PM, Russell Mok wrote: > >> I know this is kinda off topic. >> >> I am trying to sort some objects which are expensive to copy. Does >> anyone know a sort implementation that uses neither copier nor >> assignment? The STLport version I have is using both. Worse, some >> routines are passing arguments as T instead of const T &. I did >> search boost and google but I couldn't find what I want. > > > The Metrowerks implementation of std::sort uses swap (unqualified) > exclusively. > > -Howard > > Another idea which I think works out for simplicity is to just sort an array of pointers, and then once all items are in order, you change the ordering on disk. I think this would be your biggest performance gains, as most sorting has a lot of intermediate steps. You can do all those fast with the pointers, and then do the slow sort of the files. John =:->

1 0

Newbie help in compiling boost
by Murali Krishnan Ganapathy 17 Sep '04

17 Sep '04

Platform: Windows XP Compiler: VC7 (Visual Studio .NET) Shell: Cmd.exe BJAM: Prebuilt version 3.1.10-1-ntx86 from sourceforge Boost Version: 1.31.0 On the prompt: * set PYTHON_ROOT=C:\Python23 * set PYTHON_VERSION=2.3 * C:\Program Files\...\VC7\bin\VCVARS32.BAT (execute this) * bjam "-sTOOLS=vc7" install I get a whole lot of lines of the form ...skipped XXX for lack of YYY... and finally get ...failed updating 2 targets ...skipped 3077 targets Any pointers on what I am doing wrong. On the prompt I am able to run "cl, link, nmake" without any problems (i.e. path is set correctly by vcvars32.bat). - Murali

3 4

RE: [Boost-users] Boost problems
by Puverle, Tomas (IT) 17 Sep '04

17 Sep '04

> > We have found some problems with the following files: > > > > boost_1_31_0/libs/regex/src/cpp_regex_traits.cpp > > boost_1_31_0/libs/test/src/test_tools.cpp > > > > They use definitions from <ios> but never actually include it > > - they are > > relying on the fact that in some STLs the headers are pulled in by > > other header files. Unfortunately, under our STL (RW STL > 6.0) this is > > not the case and hence the files fail to compile. Add the > following > > include line to both to fix the problem: > > > > #include <ios> > > Ok. > > Gennadiy. Gennadiy, have you any news about the second problem also related to regex, as described in my original email? Thanks, Tom -------------------------------------------------------- NOTICE: If received in error, please destroy and notify sender. Sender does not waive confidentiality or privilege, and use is prohibited.

1 0

[boost-users][MPL] Where did eq, gt, lt, et al. go?
by Cromwell Enage 17 Sep '04

17 Sep '04

These metafunctions used to be defined in the same headers as equal_to, greater, less, etc., respectively. What functionality should I use to replace them for my sequence algorithms? Cromwell Enage __________________________________ Do you Yahoo!? Yahoo! Mail - Helps protect you from nasty viruses. http://promotions.yahoo.com/new_mail

2 1

boost.graph, subgraph questioon
by Jeffrey Holle 17 Sep '04

17 Sep '04

I'm using boost 1.31.0. I've experienced and observed that other fokes found this problem with subgraphs and internal properties. Derived subgraphs only get internal properties produced by default construct. What I'd like to know is if adding an edge to a derived subgraph via: add_edge(vertex_descriptor u_local, vertex_descriptor v_local, const EdgeProperty& p, subgraph& g) will get the property sent to the ancestor graphs? Are there any other "bugs" associated with adding edges/vertices to a derived subgraph?

1 0

It seems that boost.random doesn't work under vc6.0?
by huangliang 17 Sep '04

17 Sep '04

When I tried to compile the random_demo.cpp using vc6.0 and stlport5.0, there were many errors and warnings. Does boost.random correctly work under vc6.0? I use boost1.31.0.

1 0

RE: [Boost-users] Boost problems
by Rozental, Gennadiy 16 Sep '04

16 Sep '04

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Tom Puverle > Sent: Thursday, September 16, 2004 4:53 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Boost problems > > > Hey boosters, > > We have found some problems with the following files: > > boost_1_31_0/libs/regex/src/cpp_regex_traits.cpp > boost_1_31_0/libs/test/src/test_tools.cpp > > They use definitions from <ios> but never actually include it > - they are > relying on the fact that in some STLs the headers are pulled > in by other > header files. Unfortunately, under our STL (RW STL 6.0) this > is not the > case and hence the files fail to compile. Add the following > include line to > both to fix the problem: > > #include <ios> Ok. Gennadiy.

1 0

sort implementation based on swap
by Russell Mok 16 Sep '04

16 Sep '04

I know this is kinda off topic. I am trying to sort some objects which are expensive to copy. Does anyone know a sort implementation that uses neither copier nor assignment? The STLport version I have is using both. Worse, some routines are passing arguments as T instead of const T &. I did search boost and google but I couldn't find what I want. Thanks in advance. Russell

3 3

Edmund Karp sample
by Daniele Carlucci 16 Sep '04

16 Sep '04

Hi all, how can I print only the out edges from a node in this sample? I only print 0->1 1->0 2 3 2->1 3->1 there is a way to print this output: 0->1 1->2 1->3 Thanks Daniele Carlucci

1 0