Only one end of a stack is dynamic, the oldest item is the last removed.
- From: Jeff☠Relf <Jeff_Relf@xxxxxxxxx>
- Date: 26 Sep 2007 01:21:44 GMT
I told Messrs. Roberts and Voigt:
“ If, for some --> really <-- odd reason,
your stack is huge and C.P.U. intensive, just give it its own heap;
so it's dynamic and you never have to move it. ”.
And you ( Mr. Voigt ) insulted me and replied:
“ But you will have to move it, because
if you add to the end and remove from the beginning... ”.
Huh ?
Only one end of a stack is dynamic, the oldest item is the last removed.
So far, Mr. Voigt, all I recall about you is:
1. You needlessly spam us with quotes.
( i.e. either you're lazy and/or you can't see the thread )
2. You don't know what a stack is.
3. You imagine that link-lists are still a good idea, in 2007.
( Ever hear of a Memory Management Unit ? )
Even in the case of large, dynamic, C.P.U.-intensive queues,
a dynamic array of pointers and dedicated, destroyable heaps
would be better than a linked list
( and/or C++'s automatic garbage collection ).
.
- Follow-Ups:
- Re: Only one end of a stack is dynamic, the oldest item is the last removed.
- From: Ben Voigt [C++ MVP]
- Re: Only one end of a stack is dynamic, the oldest item is the last removed.
- References:
- I suggest binary searches not “ linklist.h ”.
- From: Jeff☠Relf
- Re: I suggest binary searches not " linklist.h ".
- From: Ben Voigt [C++ MVP]
- How does a linked-list optimize a stack ?
- From: Jeff☠Relf
- Re: How does a linked-list optimize a stack ?
- From: Tim Roberts
- Linked-lists don't make sense.
- From: Jeff☠Relf
- Re: Linked-lists don't make sense.
- From: Ben Voigt [C++ MVP]
- I suggest binary searches not “ linklist.h ”.
- Prev by Date: Re: Install drivers via .inf
- Next by Date: Here, the debugger says: “ Waited == .00500 ” seconds.
- Previous by thread: Re: Linked-lists don't make sense.
- Next by thread: Re: Only one end of a stack is dynamic, the oldest item is the last removed.
- Index(es):
Relevant Pages
|
|
