Hi Maxim,
> And here are the Intel VTune results (see the sources for details):
>
> CreationAssignment
> struct13383 27358
> boost::any3846331870
> TailoredAny<>
Eric Friedman wrote:
> 1) In addition to its role in enabling recursive variants,
> boost::incomplete provides a convenient way to increase space
efficiency
> (though at the expense of speed efficiency due to heap allocation). Note
> though that this is only because incomplete wraps a T*, which is
Gennadiy Rozental wrote:
> > > mpl/contain.hpp
> > > I think this is in Alexey direction: it may worth generalizing this
> > > function so that if the second argument is the sequence it will
> > > check that one sequence contain another.
>
> Alexey,
>
> What do you think about this proposition?
In
Gennadiy Rozental wrote:
> > > 7. Variant size
> > > Unfortunately I was not able to follow exact logic behind usage of 2
> > > different storages. But one thing I know:
> > > sizeof(boost::variant) could not be 28.
> > > >From what I view it seems that types that are used to construct
> > > storag
I get the following warning when building and using a thread_group in MSVC
70 with boost 1.30
...\boost\boost\thread\thread.hpp(79) : warning C4251:
'boost::thread_group::m_threads' : class 'std::list<_Ty,_Ax>' needs to have
dll-interface to be used by clients of class 'boost::thread_group'
My gu
Gennadiy Rozental wrote:
> > > 5. Usage std::type_info for reflection
> > > I don't think we should enforce RTTI for the variant users. We should
> > > be able to postpone the decision on what kind of reflection
> > > information user want till instantiation time.
> >
> > Please elaborate on this p
Gennadiy Rozental wrote:
> > > 3. Copy Constructible/Assignable requirements on bounded types
> > > This only need to be required if variant should have appropriate
> > > feature.
> >
> > I disagree. As-is, every variant object requires CopyConstructible
> > bounded types, as it is the only way to
Gennadiy Rozental wrote:
> > > 2. Top level const requirement on bounded types.
> > > It's unreasonable. I should be able to define variant with const
> > > types. It will be as usable as usual constant types are. The only
> > > requirements that we may incur is that if one types is const,
> > > re
Gennadiy Rozental wrote:
> > > 8. Visitation algorithm
> > > In sketch presented visitation algorithm look like this:
> > >
> > > void foo1( which, visitor )
> > > {
> > > if( n = 1 )
> > >visitor(...)
> > >else
> > > foo2( which, visitor );
> > > }
> > >
> > > void foo2( whic
Gennadiy Rozental wrote:
> > > Also I think we need free function form of value
> > > extraction. In other case it would be difficult to place extract
> > > in context where template parameter is deduced. And check function
> > > is not that important in most cases.
> >
> > While I am again conside
Larry Evans wrote:
Jason House wrote:
[snip]
use make files and perl scripts. I'll post them in another
files directory, probably col_io.
The test is is files/col_io/col_io.zip. The file:
libs/col_io/tests/marg_ostream/generated.mk
is a simplified makefile produced with help of save_genmk
an
Jason House wrote:
Larry Evans wrote:
Reece Dunn wrote:
Here is the associated code and example program.
Wouldn't the following:
*this<
do essentially what indentor< OutputFileType >::indent() does?
I have not read indentor's code, so I'll only comment about the example
replacement code.
My
Larry Evans wrote:
>
> Reece Dunn wrote:
> > Here is the associated code and example program.
> Wouldn't the following:
>
>*this<*this<
> do essentially what indentor< OutputFileType >::indent() does?
I have not read indentor's code, so I'll only comment about the example
replacement
Larry Evans wrote:
Reece Dunn wrote:
Here is the associated code and example program.
[snip]
marg_ostream. Another indentor implementation is there's no need
The above should be "indentor advantage"
to defind operator<< or all the primitive types as was done in
should be "to define operator<< for
Reece Dunn wrote:
Here is the associated code and example program.
Wouldn't the following:
*this<
do essentially what indentor< OutputFileType >::indent() does?
This implementation also requires the user to know when the
beginning of line occurs. That does sound pretty reasonable,
and I'm kind
Sadly (but perhaps not too surpringly) this does not seem to work for MSVC 7.0
with complex. (OK without)
A full working example with at least a few comments might sell this better?
Paul
Paul A Bristow, Prizet Farmhouse, Kendal, Cumbria, LA8 8AB UK
+44 1539 561830 Mobile +44 7714 33 02 04
Mob
Here is the associated code and example program.
-rhd-
mailto:[EMAIL PROTECTED]
_
Surf together with new Shared Browsing
http://join.msn.com/?page=features/browse&pgmarket=en-gb&XAPID=74&DI=1059
indentor.zip
Description: Zip comp
Hi all,
Anyone interested in thread-safe access to std::basic_ostream<>s?
The idea is that you write like the way you're used to, and when the stream
is flushed, thread-safety happens behind the scenes, very much like:
{
// 100 locks, after each written std::endl
for( int idx = 0; idx < 100; ++i
___
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
We find ourselves in want of a custom deallocator for scoped_ptr, but
no such thing seems to exist now.
Has this been thought of?
If yes, what was the reason for not supporting this?
--
Lgb
___
Unsubscribe & other changes: http://lists.boost.
Hello,
Two months ago, I said that we began the project to translate boost
document into Japanese.
Now, we made a first release for boost 1.29 and boost 1.30, so I
announce here.
The release is not a complete version, but just a milestone, so some
libraries is still in English. We will correct a
> > mpl/contain.hpp
> > I think this is in Alexey direction: it may worth generalizing this
> > function so that if the second argument is the sequence it will
> > check that one sequence contain another.
Alexey,
What do you think about this proposition?
Gennadiy.
Implementation issues comments:
> > 2. is_static_visitable description states that this metafunction will
> > check whether the specified type is visitable by a static visitor.
> > This statement is misleading, cause you do not (and could not ) check
> > this. What you check is that type could be
23 matches
Mail list logo
