Hello Markus,
> "But apparently (see Ian's answer) this is not the case, and the GC
always needs to trace all elements, keys and values."
I think Ian said something a bit different from what you said there.
As far as I understand, the GC does not scan the keys and values of a map
if they are n
> Many data structures are implemented using pointers. How does this perform
>> wrt garbage collecting? For example take any data structure that uses some
>> tree of nodes, or even simpler just a singly linked list: there is one
>> pointer from the left node to the next. Wouldn't this incur hu
On Thu, Jul 9, 2020 at 6:40 PM Markus Heukelom
wrote:
> Many data structures are implemented using pointers. How does this perform
> wrt garbage collecting? For example take any data structure that uses some
> tree of nodes, or even simpler just a singly linked list: there is one
> pointer from t
On Thu, Jul 9, 2020 at 9:40 AM Markus Heukelom wrote:
>
> Many data structures are implemented using pointers. How does this perform
> wrt garbage collecting? For example take any data structure that uses some
> tree of nodes, or even simpler just a singly linked list: there is one
> pointer fr
Hi,
Many data structures are implemented using pointers. How does this perform
wrt garbage collecting? For example take any data structure that uses some
tree of nodes, or even simpler just a singly linked list: there is one
pointer from the left node to the next. Wouldn't this incur huge GC
(
