Re: Searching for stack based containers

From:

"Alf P. Steinbach" <alfps@start.no>

Newsgroups:

comp.lang.c++

Date:

Thu, 03 May 2007 19:26:47 +0200

Message-ID:

<59uk6tF2lpmsmU1@mid.individual.net>

* Erik Wikstr?m:

On 2007-05-03 16:28, Alf P. Steinbach wrote:

* Pete Becker:

jimxoch wrote:

The above facts make me want to try using STL like containers which
are able to store their data on stack. Is anybody familiar with such
container implementations? Any opinions about them?

TR1 provides an array template which puts its contents on the stack.
It holds a fixed-size array, which is really the only sort of thing
you can do on the stack.

C99 manages variable length arrays on the stack just fine. I think
you meant "in current C++".

Correct me if I'm wrong but are they not only of dynamic length up to
the point where they were declared so to speak, meaning that you can do
something like this:

void foo(int n) {
int arr[n];
}

And after that the number of elements of arr is fixed to n (for whatever
n happened to be when foo() was called).

yes

While this is more that you can
currently do in C++ it's still not what I'd like to call dynamic since
it can't grow in size on demand (which no stackbased datastructure can
do unless you allocate lots of unused space to grow in).

it's enough to be very useful, e.g. for string conversion. currently
language extensions such as _alloca are used instead. the point being
that there's no inherent technical constraint that makes this
impossible; it is in fact a very common language extension.

--
A: Because it messes up the order in which people normally read text.
Q: Why is it such a bad thing?
A: Top-posting.
Q: What is the most annoying thing on usenet and in e-mail?