From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: article on acces types and dynamic serialization in Ada (2003)
Date: Fri, 23 Feb 2018 14:13:42 +0100
Date: 2018-02-23T14:13:42+01:00 [thread overview]
Message-ID: <p6p427$cqt$1@gioia.aioe.org> (raw)
In-Reply-To: e0312102-f3dc-4e54-a5fa-814761c6c959@googlegroups.com
On 23/02/2018 11:30, Mehdi Saada wrote:
> It could be I'm just too ignorant of data-structures, but besides (different types of) nodes and (different types of) pointers to represent arrows/links, I don't see why a reference counting strategy wouldn't work for all.
Why it works, but requires a massive infrastructure. In general, you
need external and internal reference counting. You will have external
objects and memory-mapped proxies of. You will have to synchronize,
commit, when proxy's internal reference count = 0, but the external
reference count > 0. All this is beyond mere serialization and about
object persistence. Note that persistent linked structures are not
stored as blobs but as individual nodes, individually accessible with
individual reference counts etc. It is complicated and not language
business to meddle with.
--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de
prev parent reply other threads:[~2018-02-23 13:13 UTC|newest]
Thread overview: 13+ messages / expand[flat|nested] mbox.gz Atom feed top
2018-02-21 23:57 article on acces types and dynamic serialization in Ada (2003) Mehdi Saada
2018-02-22 9:16 ` Dmitry A. Kazakov
2018-02-22 12:08 ` guyclaude.burger
2018-02-22 12:15 ` Mehdi Saada
2018-02-22 13:04 ` Dmitry A. Kazakov
2018-02-22 23:49 ` Randy Brukardt
2018-02-23 3:40 ` Shark8
2018-02-23 7:23 ` Jacob Sparre Andersen
2018-02-23 8:38 ` Dmitry A. Kazakov
2018-02-23 20:28 ` G. B.
2018-02-23 20:40 ` Dmitry A. Kazakov
2018-02-23 10:30 ` Mehdi Saada
2018-02-23 13:13 ` Dmitry A. Kazakov [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox