On Aug 25, 4:05 am, Alex McDonald b...@rivadpm.com wrote:
Your example of writing code with
memory leaks *and not caring because it's a waste of your time* makes
me think that you've never been a programmer of any sort.
Windows applications are immune from memory leaks since programmers
can
On 27-Aug-2010, at 2:14 AM, Brad wrote:
On Aug 25, 4:05 am, Alex McDonald b...@rivadpm.com wrote:
Your example of writing code with
memory leaks *and not caring because it's a waste of your time* makes
me think that you've never been a programmer of any sort.
Windows applications are
Hugh Aguilar hughaguila...@yahoo.com writes:
On Aug 24, 5:16 pm, Paul Rubin no.em...@nospam.invalid wrote:
Anyway, as someone else once said, studying a subject like CS isn't done
by reading. It's done by writing out answers to problem after problem.
Unless you've been doing that, you
On 25 Aug, 01:00, Hugh Aguilar hughaguila...@yahoo.com wrote:
On Aug 24, 4:17 pm, Richard Owlett rowl...@pcnetinc.com wrote:
Hugh Aguilar wrote:
[SNIP ;]
The real problem here is that C, Forth and C++ lack automatic garbage
collection. If I have a program in which I have to worry
Alex McDonald b...@rivadpm.com writes:
Your example of writing code with
memory leaks *and not caring because it's a waste of your time* makes
me think that you've never been a programmer of any sort. Ever.
Well, I find his approach towards memory leaks as described in
On 19 Aug, 16:25, c...@tiac.net (Richard Harter) wrote:
On Wed, 18 Aug 2010 01:39:09 -0700 (PDT), Nick Keighley
nick_keighley_nos...@hotmail.com wrote:
On 17 Aug, 18:34, Standish P stnd...@gmail.com wrote:
How are these heaps being implemented ? Is there some illustrative
code or a book
On Aug 24, 8:00 pm, Hugh Aguilar hughaguila...@yahoo.com wrote:
The C programmers reading this are likely wondering why I'm being
attacked. The reason is that Elizabeth Rather has made it clear to
everybody that this is what she wants: [http://tinyurl.com/2bjwp7q]
Hello to those outside of
On Aug 24, 9:05 pm, Hugh Aguilar hughaguila...@yahoo.com wrote:
What about using what I learned to write programs that work?
Does that count for anything?
It obviously counts, but it's not the only thing that matters. Where
I'm employed, I am currently managing a set of code that works but
the
On Aug 25, 1:44 pm, John Passaniti john.passan...@gmail.com wrote:
On Aug 24, 9:05 pm, Hugh Aguilar hughaguila...@yahoo.com wrote:
What about using what I learned to write programs that work?
Does that count for anything?
It obviously counts, but it's not the only thing that matters.
John Passaniti john.passan...@gmail.com writes:
On Aug 24, 8:00 pm, Hugh Aguilar hughaguila...@yahoo.com wrote:
The C programmers reading this are likely wondering why I'm being
attacked. The reason is that Elizabeth Rather has made it clear to
everybody that this is what she wants:
On Aug 25, 5:01 pm, Joshua Maurice joshuamaur...@gmail.com wrote:
I agree. Sadly, with managers, especially non-technical
managers, it's hard to make this case when the weasel
guy says See! It's working..
Actually, it's not that hard. The key to communicating the true cost
of software
On Aug 25, 4:01 pm, John Passaniti john.passan...@gmail.com wrote:
On Aug 25, 5:01 pm, Joshua Maurice joshuamaur...@gmail.com wrote:
I agree. Sadly, with managers, especially non-technical
managers, it's hard to make this case when the weasel
guy says See! It's working..
Actually, it's
On 24 Aug, 01:00, Hugh Aguilar hughaguila...@yahoo.com wrote:
On Aug 21, 12:32 pm, Alex McDonald b...@rivadpm.com wrote:
Scintilla gets about 2,080,000 results on google; blather gets
about 876,000 results. O Hugh, you pseudo-intellectual you!
with gutter language such as
turd
John Bokma j...@castleamber.com writes:
On the other hand: some people I knew during my studies had no problem
at all with introducing countless memory leaks in small programs (and
turning off compiler warnings, because it gave so much noise...)
[...]
As for electrical engineering: done
David Kastrup wrote:
John Bokmaj...@castleamber.com writes:
On the other hand: some people I knew during my studies had no problem
at all with introducing countless memory leaks in small programs (and
turning off compiler warnings, because it gave so much noise...)
[...]
As for electrical
On Aug 21, 12:18 pm, ehr...@dk3uz.ampr.org (Edmund H. Ramm) wrote:
In 2d59bfaa-2aa5-4396-bd03-22200df8c...@x21g2000yqa.googlegroups.com Hugh
Aguilar hughaguila...@yahoo.com writes:
[...]
I really recommend that people spend a lot more time writing code,
and a lot less time with all of
David Kastrup d...@gnu.org writes:
John Bokma j...@castleamber.com writes:
On the other hand: some people I knew during my studies had no problem
at all with introducing countless memory leaks in small programs (and
turning off compiler warnings, because it gave so much noise...)
[...]
On Aug 22, 11:12 am, John Bokma j...@castleamber.com wrote:
And my
experience is that a formal study in CS can't compare to home study
unless you're really good and have the time and drive to read formal
books written on CS. And my experience is that most self-educaters don't
have that time.
Hugh Aguilar wrote:
[SNIP ;]
The real problem here is that C, Forth and C++ lack automatic garbage
collection. If I have a program in which I have to worry about memory
leaks (as described above), I would be better off to ignore C, Forth
and C++ and just use a language that supports garbage
On Aug 24, 9:24 am, David Kastrup d...@gnu.org wrote:
Anybody worth his salt in his profession has a trail of broken things in
his history.
When I was employed as a Forth programmer, I worked for two brothers.
The younger one told me a funny story about when he was 13 or 14 years
old. He bought
Hugh Aguilar hughaguila...@yahoo.com writes:
On Aug 22, 11:12 am, John Bokma j...@castleamber.com wrote:
And my
experience is that a formal study in CS can't compare to home study
unless you're really good and have the time and drive to read formal
books written on CS. And my experience is
On Aug 24, 4:17 pm, Richard Owlett rowl...@pcnetinc.com wrote:
Hugh Aguilar wrote:
[SNIP ;]
The real problem here is that C, Forth and C++ lack automatic garbage
collection. If I have a program in which I have to worry about memory
leaks (as described above), I would be better off to
Hugh Aguilar wrote:
On Aug 24, 4:17 pm, Richard Owlettrowl...@pcnetinc.com wrote:
Hugh Aguilar wrote:
[SNIP ;]
The real problem here is that C, Forth and C++ lack automatic garbage
collection. If I have a program in which I have to worry about memory
leaks (as described above), I would be
Hugh Aguilar hughaguila...@yahoo.com writes:
I've read a lot of graduate-level CS books.
Reading CS books doesn't make you a computer scientist any more than
listening to violin records makes you a violinist. Write out answers to
all the exercises in those books, and get your answers to the
Paul Rubin no.em...@nospam.invalid writes:
Hugh Aguilar hughaguila...@yahoo.com writes:
I've read a lot of graduate-level CS books.
Reading CS books doesn't make you a computer scientist any more than
listening to violin records makes you a violinist. Write out answers to
all the exercises
On Aug 24, 5:16 pm, Paul Rubin no.em...@nospam.invalid wrote:
Anyway, as someone else once said, studying a subject like CS isn't done
by reading. It's done by writing out answers to problem after problem.
Unless you've been doing that, you haven't been studying.
What about using what I
On Aug 21, 10:57 pm, Steven D'Aprano st...@remove-this-
cybersource.com.au wrote:
Anyway, I'm looking forward to hear why overuse of the return stack is a
big reason why people use GCC rather than Forth. (Why GCC? What about
other C compilers?) Me, in my ignorance, I thought it was because C
Hugh Aguilar hughaguila...@yahoo.com writes:
On Aug 24, 5:16 pm, Paul Rubin no.em...@nospam.invalid wrote:
Anyway, as someone else once said, studying a subject like CS isn't done
by reading. It's done by writing out answers to problem after problem.
Unless you've been doing that, you
Hugh Aguilar hughaguila...@yahoo.com writes:
This is also the attitude that I find among college graduates. They
just believe what their professors told them in college, and there is
no why.
Which college is that? It doesn't agree with my experiences. In CS quite
a lot has to be proven with a
John Bokma j...@castleamber.com writes:
At an university which languages you see depend a lot on what your
teachers use themselves. A language is just a verhicle to get you from a
to b.
Addendum: or to illustrate a concept (e.g. functional programming, oop)
[..]
Like you, you mean? You
On Aug 21, 12:32 pm, Alex McDonald b...@rivadpm.com wrote:
Scintilla gets about 2,080,000 results on google; blather gets
about 876,000 results. O Hugh, you pseudo-intellectual you!
with gutter language such as
turd
About 5,910,000 results. It has a long history, even getting a mention
On Aug 22, 3:40 pm, 1001nuits 1001nu...@gmail.com wrote:
Another thing you learn in studying in University is the fact that you can
be wrong, which is quite difficult to accept for self taught people.
Yet another thing you learn in studying in University, is the art of
apple polishing! LOL
Oh, I am so going to regret getting sucked into this tarpit... oh
well.
On Sat, 21 Aug 2010 09:58:18 -0700, Hugh Aguilar wrote:
The
following is a pretty good example, in which Alex mixes big pseudo-
intellectual words such as scintilla with gutter language such as
turd in an
John Bokma j...@castleamber.com writes:
David Kastrup d...@gnu.org writes:
John Passaniti john.passan...@gmail.com writes:
Amen! All this academic talk is useless. Who cares about things like
the big-O notation for program complexity. Can't people just *look*
at code and see how complex
David Kastrup d...@gnu.org writes:
John Bokma j...@castleamber.com writes:
David Kastrup d...@gnu.org writes:
John Passaniti john.passan...@gmail.com writes:
Amen! All this academic talk is useless. Who cares about things like
the big-O notation for program complexity. Can't people
Le Sun, 22 Aug 2010 20:12:36 +0200, John Bokma j...@castleamber.com a
écrit:
David Kastrup d...@gnu.org writes:
John Bokma j...@castleamber.com writes:
David Kastrup d...@gnu.org writes:
John Passaniti john.passan...@gmail.com writes:
Amen! All this academic talk is useless. Who
On 8/20/10 7:42 PM, Standish P wrote:
...
Admittedly, I am asking a question that would be thought
provoking to those who claim to be experts but these experts are
actually very stingy and mean business people, most certainly worse
than Bill Gates, only it did not occur to them his ideas and at
John Passaniti john.passan...@gmail.com writes:
Amen! All this academic talk is useless. Who cares about things like
the big-O notation for program complexity. Can't people just *look*
at code and see how complex it is?! And take things like the years of
wasted effort computer scientists
On 21 Aug, 06:42, Standish P stnd...@gmail.com wrote:
On Aug 20, 3:51 pm, Hugh Aguilar hughaguila...@yahoo.com wrote:
On Aug 18, 6:23 pm, Standish P stnd...@gmail.com wrote:
On Aug 17, 6:38 pm, John Passaniti john.passan...@gmail.com wrote:
You asked if Forth borrowed lists from
On Aug 21, 5:29 am, Alex McDonald b...@rivadpm.com wrote:
On 21 Aug, 06:42, Standish P stnd...@gmail.com wrote:
Admittedly, I am asking a question that would be thought
provoking to those who claim to be experts but these experts are
actually very stingy and mean business people, most
On 21 Aug, 17:58, Hugh Aguilar hughaguila...@yahoo.com wrote:
On Aug 21, 5:29 am, Alex McDonald b...@rivadpm.com wrote:
On 21 Aug, 06:42, Standish P stnd...@gmail.com wrote:
Admittedly, I am asking a question that would be thought
provoking to those who claim to be experts but these
David Kastrup d...@gnu.org writes:
John Passaniti john.passan...@gmail.com writes:
Amen! All this academic talk is useless. Who cares about things like
the big-O notation for program complexity. Can't people just *look*
at code and see how complex it is?! And take things like the years
On Aug 21, 3:36 am, David Kastrup d...@gnu.org wrote:
I think there must be some programmer gene. It is not enough to be able
to recognize O(n^k) or worse (though it helps having a more exact rather
than a fuzzy notion of them _if_ you have that gene).
Some of the best minds in
On Aug 19, 8:25 am, c...@tiac.net (Richard Harter) wrote:
On Wed, 18 Aug 2010 01:39:09 -0700 (PDT), Nick Keighley
nick_keighley_nos...@hotmail.com wrote:
On 17 Aug, 18:34, Standish P stnd...@gmail.com wrote:
How are these heaps being implemented ? Is there some illustrative
code or a book
On Aug 19, 2:14 pm, spinoza spinoza1...@yahoo.com wrote:
All the rest [how to implement heaps] is
detail for the little techies to normally, get wrong.
That's a fundamental feature of structured programming.
If we maintain the interface malloc(), realloc(), and free(), then we
could have a
On Aug 18, 6:23 pm, Standish P stnd...@gmail.com wrote:
On Aug 17, 6:38 pm, John Passaniti john.passan...@gmail.com wrote:
You asked if Forth borrowed lists from Lisp. It did not. In Lisp,
lists are constructed with pair of pointers called a cons cell.
That is the most primitive
On Aug 18, 6:13 pm, Standish P stnd...@gmail.com wrote:
Mostly it had a snowball's chance because it was never picked up by
the CS gurus who, AFAIK, never really took a serious look at it.
Its quite possible that the criticism is unfair, but dont you think
that in part some responsibility
On Aug 20, 6:51 pm, Hugh Aguilar hughaguila...@yahoo.com wrote:
You can see an example of lists in my novice package (in the list.4th
file):http://www.forth.org/novice.html
Also in there is symtab, which is a data structure intended to be used
for symbol tables (dictionaries). Almost nobody
John Passaniti wrote:
On Aug 20, 6:51 pm, Hugh Aguilarhughaguila...@yahoo.com wrote:
You can see an example of lists in my novice package (in the list.4th
file):http://www.forth.org/novice.html
Also in there is symtab, which is a data structure intended to be used
for symbol tables
On Aug 18, 8:05 pm, Elizabeth D Rather erat...@forth.com wrote:
On 8/18/10 2:23 PM, Standish P wrote:
On Aug 17, 6:38 pm, John Passanitijohn.passan...@gmail.com wrote:
You asked if Forth borrowed lists from Lisp. It did not. In Lisp,
lists are constructed with pair of pointers called a
On Aug 20, 3:51 pm, Hugh Aguilar hughaguila...@yahoo.com wrote:
On Aug 18, 6:23 pm, Standish P stnd...@gmail.com wrote:
On Aug 17, 6:38 pm, John Passaniti john.passan...@gmail.com wrote:
You asked if Forth borrowed lists from Lisp. It did not. In Lisp,
lists are constructed with
On Aug 18, 5:38 pm, Keith Thompson ks...@mib.org wrote:
Standish P stnd...@gmail.com writes:
On Aug 18, 12:30 pm, Elizabeth D Rather erat...@forth.com wrote:
[...]
Mostly it had a snowball's chance because it was never picked up by
the CS gurus who, AFAIK, never really took a serious look
On Thu, 19 Aug 2010 00:56:35 -0700 (PDT), Standish P stnd...@gmail.com
wrote:
On Aug 18, 5:38 pm, Keith Thompson ks...@mib.org wrote:
Standish P stnd...@gmail.com writes:
Show me on what page does it explain how Forth implements dynamic
binding or lexical binding and takes care of the scope
On Aug 18, 1:44 am, James Kanze james.ka...@gmail.com wrote:
On Aug 17, 6:21 pm, Standish P stnd...@gmail.com wrote:
Garbage collection doesn't use a stack. It uses a heap,
which is in the abstract a collection of memory blocks of
different lengths, divided into two lists, generally
John Nagle na...@animats.com writes:
In the superscalar era, there's not much of an advantage to avoiding
stack accesses.
Apart from 4stack, I am not aware of a superscalar stack machine (and
4stack is more of an LIW than a superscalar).
OTOH, if by stack accesses you mean memory accesses
On Wed, 18 Aug 2010 01:39:09 -0700 (PDT), Nick Keighley
nick_keighley_nos...@hotmail.com wrote:
On 17 Aug, 18:34, Standish P stnd...@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
Standish P stnd...@gmail.com writes:
On Aug 18, 5:38 pm, Keith Thompson ks...@mib.org wrote:
[...]
Show me how this is relevant to comp.lang.c, comp.lang.c++, comp.theory,
or comp.lang.python. Please trim the Newsgroups line.
provide a rigorous proof that people are more interested in the
On Thu, 19 Aug 2010 04:14:42 -0700 (PDT), spinoza
spinoza1...@yahoo.com wrote:
On Aug 18, 1:44=A0am, James Kanze james.ka...@gmail.com wrote:
On Aug 17, 6:21 pm, Standish P stnd...@gmail.com wrote:
Garbage collection doesn't use a stack. It uses a heap,
which is in the abstract a
On 8/17/2010 11:20 AM, Standish P wrote:
On Aug 17, 1:17 am, torb...@diku.dk (Torben Ægidius Mogensen) wrote:
Standish Pstnd...@gmail.com writes:
[Q] How far can stack [LIFO] solve do automatic garbage collection and
prevent memory leak ?
Because a stack has push and pop, it is able
On 17 Aug, 18:34, Standish P stnd...@gmail.com wrote:
On Aug 16, 11:09 am, Elizabeth D Rather erat...@forth.com wrote:
On 8/15/10 10:33 PM, Standish P wrote:
If Forth is a general processing language based on stack, is it
possible to convert any and all algorithms to stack based ones and
On 17 Aug, 21:37, Elizabeth D Rather erat...@forth.com wrote:
On 8/17/10 10:19 AM, Standish P wrote
On Aug 17, 12:32 pm, John Passanitijohn.passan...@gmail.com wrote:
It is true that the other languages such as F/PS also have borrowed
lists from lisp in the name of nested-dictionaries and
On Aug 18, 1:21 am, Standish P stnd...@gmail.com wrote:
Garbage collection doesn't use a stack. It uses a heap, which is in
the abstract a collection of memory blocks of different lengths,
divided into two lists, generally represented as linked lists:
1. A list of blocks that are free
On 18 Aug, 11:09, spinoza spinoza1...@yahoo.com wrote:
On Aug 18, 1:21 am, Standish P stnd...@gmail.com wrote:
This you might want to take this to the Forth people because they are
marketing their language as a cure for all that plagues programming
today.
No, they're not.
That I
On 8/18/10 12:09 AM, spinoza wrote:
On Aug 18, 1:21 am, Standish Pstnd...@gmail.com wrote:
Garbage collection doesn't use a stack. It uses a heap, which is in
the abstract a collection of memory blocks of different lengths,
divided into two lists, generally represented as linked lists:
Elizabeth D Rather erat...@forth.com writes:
Processors seldom could multitask, so it wasn't recognized that the
stack could be a performance bottleneck
Lol. Forth supported multitasking on every processor it was
implemented on in the 70's, with blazing speed compared to competitive
On 8/18/2010 1:32 PM, Paul Rubin wrote:
Elizabeth D Rathererat...@forth.com writes:
Processors seldom could multitask, so it wasn't recognized that the
stack could be a performance bottleneck
Lol. Forth supported multitasking on every processor it was
implemented on in the 70's, with blazing
On Aug 18, 12:30 pm, Elizabeth D Rather erat...@forth.com wrote:
On 8/18/10 12:09 AM, spinoza wrote:
On Aug 18, 1:21 am, Standish Pstnd...@gmail.com wrote:
Garbage collection doesn't use a stack. It uses a heap, which is in
the abstract a collection of memory blocks of different
On Aug 17, 6:38 pm, John Passaniti john.passan...@gmail.com wrote:
You asked if Forth borrowed lists from Lisp. It did not. In Lisp,
lists are constructed with pair of pointers called a cons cell.
That is the most primitive component that makes up a list. Forth has
no such thing; in Forth,
Standish P stnd...@gmail.com writes:
On Aug 18, 12:30 pm, Elizabeth D Rather erat...@forth.com wrote:
[...]
Mostly it had a snowball's chance because it was never picked up by
the CS gurus who, AFAIK, never really took a serious look at it.
Its quite possible that the criticism is unfair, but
On 8/18/10 2:23 PM, Standish P wrote:
On Aug 17, 6:38 pm, John Passanitijohn.passan...@gmail.com wrote:
You asked if Forth borrowed lists from Lisp. It did not. In Lisp,
lists are constructed with pair of pointers called a cons cell.
That is the most primitive component that makes up a
On Aug 16, 4:20 am, Malcolm McLean malcolm.mcle...@btinternet.com
wrote:
On Aug 16, 10:20 am, Standish P stnd...@gmail.com wrote: [Q] How far can
stack [LIFO] solve do automatic garbage collection and
prevent memory leak ?
Most programs can be written so that most of their memory
Garbage collection doesn't use a stack. It uses a heap, which is in
the abstract a collection of memory blocks of different lengths,
divided into two lists, generally represented as linked lists:
1. A list of blocks that are free and may be used to store new data
2. A list of blocks that
On Aug 16, 11:09 am, Elizabeth D Rather erat...@forth.com wrote:
On 8/15/10 10:33 PM, Standish P wrote:
If Forth is a general processing language based on stack, is it
possible to convert any and all algorithms to stack based ones and
thus avoid memory leaks since a pop automatically
On Aug 17, 6:21 pm, Standish P stnd...@gmail.com wrote:
Garbage collection doesn't use a stack. It uses a heap,
which is in the abstract a collection of memory blocks of
different lengths, divided into two lists, generally
represented as linked lists:
1. A list of blocks that are free
On Aug 17, 1:17 am, torb...@diku.dk (Torben Ægidius Mogensen) wrote:
Standish P stnd...@gmail.com writes:
[Q] How far can stack [LIFO] solve do automatic garbage collection and
prevent memory leak ?
Because a stack has push and pop, it is able to release and allocate
memory. We envisage
On Aug 17, 10:34 am, Standish P stnd...@gmail.com wrote:
On Aug 16, 11:09 am, Elizabeth D Rather erat...@forth.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 ?
Forth does not use a heap, except
On Aug 16, 12:20 am, Standish P stnd...@gmail.com wrote:
[Q] How far can stack [LIFO] solve do automatic garbage collection and
prevent memory leak ?
Because a stack has push and pop, it is able to release and allocate
memory. We envisage an exogenous stack which has malloc() associated
On Tue, 17 Aug 2010 11:53:27 -0700 (PDT), Standish P stnd...@gmail.com
wrote:
Another way to pose my question, as occurred to me presently is to ask
if a stack is a good abstraction for programming ? Certainly, it is
the main abstraction in Forth and Postscript and implementable readily
in C,C++
On Aug 17, 2:53 pm, Standish P stnd...@gmail.com wrote:
Another way to pose my question, as occurred to me presently is
to ask if a stack is a good abstraction for programming ?
Certainly, it is the main abstraction in Forth and Postscript
and implementable readily in C,C++ and I assume
On Aug 17, 12:32 pm, John Passaniti john.passan...@gmail.com wrote:
On Aug 17, 2:53 pm, Standish P stnd...@gmail.com wrote:
Another way to pose my question, as occurred to me presently is
to ask if a stack is a good abstraction for programming ?
Certainly, it is the main abstraction in
On Aug 17, 1:19 pm, Standish P stnd...@gmail.com wrote:
On Aug 17, 12:32 pm, John Passaniti john.passan...@gmail.com wrote:
On Aug 17, 2:53 pm, Standish P stnd...@gmail.com wrote:
Another way to pose my question, as occurred to me presently is
to ask if a stack is a good abstraction
On 8/17/10 10:19 AM, Standish P wrote:
On Aug 17, 12:32 pm, John Passanitijohn.passan...@gmail.com wrote:
...
It is true that the other languages such as F/PS also have borrowed
lists from lisp in the name of nested-dictionaries and mathematica
calls them nested-tables as its fundamental data
On Aug 17, 4:19 pm, Standish P stnd...@gmail.com wrote:
It is true that the other languages such as F/PS also have borrowed
lists from lisp in the name of nested-dictionaries and mathematica
calls them nested-tables as its fundamental data structure.
No.
you are contradicting an
[Q] How far can stack [LIFO] solve do automatic garbage collection and
prevent memory leak ?
Because a stack has push and pop, it is able to release and allocate
memory. We envisage an exogenous stack which has malloc() associated
with a push and free() associated with a pop.
The algorithm using
* Standish P, on 16.08.2010 09:20:
[garble garble]
Nonsense article We look for an exogenous stack cross-posted to
[comp.lang.c],
[comp.lang.c++],
[comp.theory],
[comp.lang.python],
[comp.lang.forth].
Please refrain from following up on Standish' article.
Cheers,
- Alf
--
blog
Standish P, 16.08.2010 09:20:
We envisage an exogenous stack which has malloc() associated
with a push and free() associated with a pop.
What's your use case?
Stefan
--
http://mail.python.org/mailman/listinfo/python-list
this is heavily x-posted I'm answering from comp.lang.c
On 16 Aug, 08:20, Standish P stnd...@gmail.com wrote:
[Q] How far can stack [LIFO] solve do automatic garbage collection and
prevent memory leak ?
I'm having trouble understanding your question (I read your whole post
before replying). I
On Aug 16, 12:47 am, Nick Keighley nick_keighley_nos...@hotmail.com
wrote:
this is heavily x-posted I'm answering from comp.lang.c
On 16 Aug, 08:20, Standish P stnd...@gmail.com wrote:
[Q] How far can stack [LIFO] solve do automatic garbage collection and
prevent memory leak ?
I'm having
/loon
you seem to be using some computer science-like terms but in an oddly
non-standard manner
[Q] How far can stack [LIFO] solve do automatic garbage collection and
prevent memory leak ?
no at all. How can a goldfish whistle?
I'm having trouble understanding your question (I read your
On Aug 16, 10:20 am, Standish P stnd...@gmail.com wrote:
[Q] How far can stack [LIFO] solve do automatic garbage collection and
prevent memory leak ?
Most programs can be written so that most of their memory allocations
are matched by destructors at the same level.
However the allocations
On Aug 16, 3:20 pm, Standish P stnd...@gmail.com wrote:
[Q] How far can stack [LIFO] solve do automatic garbage collection and
prevent memory leak ?
Because a stack has push and pop, it is able to release and allocate
memory. We envisage an exogenous stack which has malloc() associated
On Aug 16, 7:20 pm, Malcolm McLean malcolm.mcle...@btinternet.com
wrote:
On Aug 16, 10:20 am, Standish P stnd...@gmail.com wrote: [Q] How far can
stack [LIFO] solve do automatic garbage collection and
prevent memory leak ?
Most programs can be written so that most of their memory
is it possible to convert any and all algorithms to stack based ones and thus
avoid memory leaks?
No, not really. If you keep the allocated things and free them in
reverse order on exit, then well yes, but practically, early free()
frees memory for reuse on low memory systems. In this sense
On Aug 16, 3:14 pm, spinoza spinoza1...@yahoo.com wrote:
To build an explicit stack in this program would have been folly, for
it would have been necessary to either preallocate the stack and thus
legislate the maximum complexity of source code, or use a lot of
memory management in the
On 8/15/10 10:33 PM, Standish P wrote:
...
I don't understand a lot of your post (and it's clear that I'm not
alone). I don't know whether it's a (human) language problem or simply
an issue of your having read too many books and not having enough
practical experience, but at least I can try
On Aug 16, 12:38 am, Alf P. Steinbach /Usenet alf.p.steinbach
+use...@gmail.com wrote:
* Standish P, on 16.08.2010 09:20:
[garble garble]
Nonsense article We look for an exogenous stack cross-posted to
[comp.lang.c],
[comp.lang.c++],
[comp.theory],
[comp.lang.python],
In message
5fa7b287-0199-4349-ae0d-c34c8461c...@5g2000yqz.googlegroups.com, Standish
P wrote:
We envisage an exogenous stack which has malloc() associated
with a push and free() associated with a pop.
Since when are malloc(3) and free(3) exogenous?
--
97 matches
Mail list logo
