Re: best way to "delete" all objects in a std::vector.
On Jun 5, 12:21 pm, Kai-Uwe Bux <jkherci...@gmx.net> wrote:
James Kanze wrote:
On Jun 5, 9:22 am, Kai-Uwe Bux <jkherci...@gmx.net> wrote:
Jerry Coffin wrote:
In article <daniel_t-4F9851.22361904062...@earthlink.vsrv-
sjc.supernews.net>, danie...@earthlink.net says...
[ ... ]
AFAIK, the implementation I presented is guaranteed by the
standard not to read or copy any pointers after the delete.
I don't see any such guarantee, though I'll admit I might
have missed it.
Maybe you missed it because you snipped it. So, let's look at it:
struct Delete_ptr {
template<class T> T* operator()(T* p) const { delete p; return 0; =
}
};
...
transform(s.begin(),s.end(),s.begin(),Delete_ptr());
Note:
a) Delete_ptr::operator() returns 0.
b) The proposed solution uses transform and not foreach.
And... Where do you have a guarantee that std::transform
doesn't read through the pointer a second time, after having
called the fucntional object? Or that
std::vector::iterator::operator*() doesn't read the object
before returning an lvalue to it.
Those are valid points.
I very heavily stressed in my original posting that this was for
nitpickers, because, of course, no implementation will do such
things, and we all know it. But the fact remains that the
standard requires that all objects in a container be copyiable,
at all times (even if no member function is called). And
between the delete in the operator(), above, and the moment
transform assigns the result of the operator to its target,
there is a deleted pointer in the container, which is undefined
behavior.
If that was true in this generality, I would consider it a
defect in the standard because it decidedly interferes with
generic programming. E.g.,
delete_and_set_null ( T* & p_ref ) {
delete p_ref;
p_ref = 0;
}
would be undefined when v[0] is passed into it because between
the two statements, although no member function of the
container can be called, there is a non-copiable object in the
container.
Instead one would have to use your swap proposal to implement
a safe delete_and_set_null (at the point the reference is
passed, no template magic will be able to detect that is comes
from a container). Clearly, that makes you pay for stuff you
don't use.
Yep. Formally, I think that's actually the situation.
Practically, for starters, we can be 100% sure that none of the
standard containers do anything with any of the elements they
contain when none of their functions are being called. I don't
think the wording of the standard gives enough leeway to
guarantee this, but I do think that one could argue that it was
the intent; that if the standard doesn't give this guarantee,
it's because it never occured to anyone that the opposite could
be true. Beyond that, I think it reasonable to suppose that a
container doesn't copy or assign except in cases where it is
required to, and that you can leave uncopiable values in a
container for short instances, as long as you do nothing which
might "perturb" the container (although I'll admit that that is
very, very vague).
With regards to your "pay for stuff you don't use", of course,
it would be a pretty poor optimizer which didn't detect that the
tmp in my code using swap didn't cease to be live immediately,
and generate pretty much the same code as it does for what
you've written, above (supposing std::swap inline, of course).
BTW, with regard to the "at all times (even if no member
function is called)", the standard is not at all clear.
[23.1/3] requires the "type of objects stored in these
components" to satisfy the CopyConstructible and Assignable
requirements, which in turn are only defined for types and not
for objects.
This is a more general problem; the standard really doesn't
define very well what it means by "CopyConstructible". But for
a type to be CopyConstructible, it seems clear that the ability
to copy must not depend on the value of objects of the type.
This is also emphasized in [20.1/1] which implies that
CopyConstructible is a requirement for types used to
instantiate template arguments not a requirement for objects.
You're raising a very interesting point. Formally, for a type T
to be CopyConstructible, the expression T(u) must be valid.
Where u is a const value of type T. Not a particular const
value, but any const value.
The type "T*" clearly satisfies those requirements. That
individual objects of type T* may at times have invalid values
does not change that.
There are two different issues concerned here (and I don't think
that the standard makes this very clear). The first is that
every value of the type T must be copiable, otherwise the type
is not CopyConstructible, and you cannot have a collection which
contains it. I find that rather clear, but maybe I'm reading
more into things than I should. The second is that space
declared as a T may still not contain a value of type T; if you
delete a pointer, or call the destructor on an object, then you
no longer have a value of that object type. In this regard,
using the Delete_ptr above falls into the same category as
using a functional object something like:
struct MessThingsUp
{
template< typename T >
void operator()( T& obj )
{
obj.~T() ;
}
} ;
The result in both cases is that you've left something in the
container which is no longer a valid object of type T. (Note
that in the case of Delete_ptr, of course, the type T in
question is in fact a pointer type.) You can get away with it
in the case of pointers only because the standard allows using
the raw memory of a POD object as a POD, as long as there is no
lvalue to rvalue conversion.
However, other rules kick in and say that reading such values
is undefined. In that regard, your objections from the first
paragraph are valid. However, that can only happen when member
functions of the container are called triggering the read.
Mere existence of an object with invalid value within a
container might not necessarily entail undefined behavior (at
least of the top of my head, I don't see the provisions that
would imply that).
You're arguing from a common sense point of view, and not from
the standard:-).
I think it's a somewhat awkward question, since I think that the
entire specification of the standard library "assumes" that all
objects in a container are valid. There are no special rules
for cases where an "object" is temporarily invalid, or
temporarily "uncopiable". So we really don't know. When all is
said and done, however, the standard clearly doesn't make any
distinction on the requirements depending on what you do with
the container. If you can legally leave an invalid pointer in a
container for the shortest instance, you can legally do anything
which the container supports even if it contains an invalid
pointer.
FWIW: the discussion is largely accademic with regards to
pointers, since architectures on which reading an invalid
pointer doesn't work are really rare. I've actually had
problems along these lines with iterators, however; an iterator
constructed with the default constructor, or one which has been
invalidated by some operation on the container, is not copiable,
g++ complains if you try to copy it, and I've had it complain
because I've left such iterators in a container.
Anyway, I wouldn't mind it if the standard did clarify this, but
I don't consider it a serious issue, because the only time it
really seems to occur is this particular case, we all know that
in practice, it will work, and there is a simple work-around.
And I don't see any easy wording which would make legal what we
all know will work, but still make illegal all of the more
dubious cases.
(If comp.std.c++ were active, I'd raise the issue there, but I'm
a bit hesitant about raising it on the committee mailing lists;
I don't think it's a concrete problem in practice, and the
committee has more than enough to keep it busy without such hair
splitting.)
--
James Kanze (GABI Software) email:james.kanze@gmail.com
Conseils en informatique orient=E9e objet/
Beratung in objektorientierter Datenverarbeitung
9 place S=E9mard, 78210 St.-Cyr-l'=C9cole, France, +33 (0)1 30 23 00 34