Re: How come Ada isn't more popular?


"Dmitry A. Kazakov" <mailbox@xxxxxxxxxxxxxxxxx> writes:

On Tue, 06 Feb 2007 17:47:25 GMT, Ray Blaak wrote:

Maciej Sobczak <no.spam@xxxxxxxxxxx> writes:
OK. What about refcounting with smart pointers?

This form of GC actually works against your determinism goal. It simply is a
poor form of GC, can't handle cycles, and has unpredictable execution times.

Determinism /= time bounded.

For handling cycles there are weak pointers.

No. For handling cycles there are GC algorithms that can handle
cycles. Weak pointers are for implementing caching of costly (in terms
of memory) but recomuptable objects/structurs.

You're again talking from a parallel universe.

Regards -- Markus

.

Relevant Pages

  • Re: How come Ada isnt more popular?
    ... Dmitry A. Kazakov wrote: ... poor form of GC, can't handle cycles, and has unpredictable execution times. ... The former might have ownership cycles between nodes, but not the latter, where ownership is an acyclic relation between graph and nodes. ...
    (comp.lang.ada)
  • Re: How come Ada isnt more popular?
    ... poor form of GC, can't handle cycles, and has unpredictable execution times. ... But your main points of needing scoped-based resource control I indeed agree ... "WithResource" wrapper function pattern. ...
    (comp.lang.ada)
  • Re: Cycle detection and object memory usage?
    ... I understand from the documentation that types with a finalizer method that participate in cycles can't be collected. ... Use weak pointers where appropriate to avoid cycles. ... of a tree structure should be weak pointers, ...
    (comp.lang.python)