Re: Weak/Soft references?
This message is in MIME format. The first part should be readable text,
while the remaining parts are likely unreadable without MIME-aware tools.
---910079544-219058225-1216738363=:22278
Content-Type: TEXT/PLAIN; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 8BIT
On Wed, 16 Jul 2008, Tegiri Nenashi wrote:
On Jul 11, 12:11?pm, Joshua Cranmer <Pidgeo...@verizon.invalid> wrote:
Tegiri Nenashi wrote:
In general yes, nothing prevents the count not to go up. But we are
talking a very specific usage here. If a notifier sees an element in
its collection of listeners to be not referenced from outside, it can
And how do you propose to do that? That makes sense in ref-counted
systems, but Java isn't ref-counted...
Legacy limitations... Note however, that ref counted based GCs can be
parallelized, and mark and sweep can't.
I think you might need to go and do some more reading on GC.
Is it possible to have a language where graph of references never has
loops (DAG) by design?
Yes - any language in which it's impossible to mutate existing objects has
this property. That, roughly speaking, is the definition of what are
called 'functional' languages - popular examples would be Haskell, ML,
Erlang, and certain styles of LISP. They're all garbage collected, but i
believe they all use mark-and-sweep rather than refcounting, despite
cycles being impossible.
tom
--
Sometimes it takes a madman like Iggy Pop before you can SEE the logic
really working.
---910079544-219058225-1216738363=:22278--