Re: How come Ada isn't more popular?
- From: Markus E Leypold <development-2006-8ecbb5cc8aREMOVETHIS@xxxxxxxxxxxxxxxxxxxxx>
- Date: Wed, 07 Feb 2007 10:42:01 +0100
Maciej Sobczak <no.spam@xxxxxxxxxxx> writes:
Dmitry A. Kazakov wrote:
For handling cycles there are weak pointers.
Not only.
Not at all you wanted to say.
If you have cycles, then you'd better rethink the design.
let rec fac n = if n = 0 then 1 else n * (fac (n-1));;
a) closure
b) cycle
:-).
A lot of OO models with callback also require cycles. E.g. A knows B
and B registers a callback with A in certain situations.
The difference is between a) graph treated as a mesh (or mess) of
nodes which "own" each other and b) graph treated as a collection of
nodes.
The former might have ownership cycles between nodes, but not the
latter, where ownership is an acyclic relation between graph and nodes.
I agree that this kind of restructuring is not always possible, but^^^^^^^^^^^^^^^^^^^^^
!!.
Regards -- Markus
.
- Follow-Ups:
- Re: How come Ada isn't more popular?
- From: Maciej Sobczak
- Re: How come Ada isn't more popular?
- References:
- Re: How come Ada isn't more popular?
- From: Markus E Leypold
- Re: How come Ada isn't more popular?
- From: Maciej Sobczak
- Re: How come Ada isn't more popular?
- From: Markus E Leypold
- Re: How come Ada isn't more popular?
- From: Maciej Sobczak
- Re: How come Ada isn't more popular?
- From: Markus E Leypold
- Re: How come Ada isn't more popular?
- From: Maciej Sobczak
- Re: How come Ada isn't more popular?
- From: Markus E Leypold
- Re: How come Ada isn't more popular?
- From: Maciej Sobczak
- Re: How come Ada isn't more popular?
- From: Ray Blaak
- Re: How come Ada isn't more popular?
- From: Dmitry A. Kazakov
- Re: How come Ada isn't more popular?
- From: Maciej Sobczak
- Re: How come Ada isn't more popular?
- Prev by Date: GC in Ada
- Next by Date: Re: log4ada
- Previous by thread: Re: How come Ada isn't more popular?
- Next by thread: Re: How come Ada isn't more popular?
- Index(es):
Relevant Pages
|