How far can stack [LIFO] solve do automatic garbage collection and prevent memory leak ?

Nick Keighley nick_keighley_nospam at hotmail.com
Wed Aug 25 16:43:36 CEST 2010


On 19 Aug, 16:25, c... at tiac.net (Richard Harter) wrote:
> On Wed, 18 Aug 2010 01:39:09 -0700 (PDT), Nick Keighley
> <nick_keighley_nos... at hotmail.com> wrote:
> >On 17 Aug, 18:34, Standish P <stnd... at gmail.com> wrote:

> >> How are these heaps being implemented ? Is there some illustrative
> >> code or a book showing how to implement these heaps in C for example ?
>
> >any book of algorithms I'd have thought

my library is currently inaccessible. Normally I'd have picked up
Sedgewick and seen what he had to say on the subject. And possibly
Knuth (though that requires taking more of a deep breath).

Presumably Plauger's library book includes an implementation of
malloc()/free() so that might be a place to start.

> >http://en.wikipedia.org/wiki/Dynamic_memory_allocation
> >http://www.flounder.com/inside_storage_allocation.htm
>
> >I've no idea how good either of these is

serves me right for not checking
:-(

> The wikipedia page is worthless.  

odd really, you'd think basic computer science wasn't that hard...
I found even wikipedia's description of a stack confusing and heavily
biased towards implementation

> The flounder page has
> substantial meat, but the layout and organization is a mess.  A
> quick google search didn't turn up much that was general - most
> articles are about implementations in specific environments.




More information about the Python-list mailing list