cool, thanks
On Fri, Dec 16, 2016 at 1:55 PM, Joh-Tob Schäg wrote:
> If they become unreachable, they will be collected.
>
> That is a more compact way ofnsaying what i just said. If you want to get
> more technicalnread mine but this one is easier to understand
> Am 17.12.2016 03:53 schrieb "Jo
If they become unreachable, they will be collected.
That is a more compact way ofnsaying what i just said. If you want to get
more technicalnread mine but this one is easier to understand
Am 17.12.2016 03:53 schrieb "John Duncan" :
> If they become unreachable, they will be collected.
>
> On Fri,
If they become unreachable, they will be collected.
On Fri, Dec 16, 2016 at 1:28 PM, Bruno Franco
wrote:
> Hi John, Alex,
>
> Thank you for your explanations, I think I now understand how sort works:
> So, for example, in
>
> : (setq A (3 1 2 4 5 6))
> -> (3 1 2 4 5 6)
> : (setq B (sort A))
> ->
Assuming
( 1 . Pointertotheonecontaining(2)) and
( 2 . Pointertotheonecontaining(3))
are no longer referenced by a node referenced by the global name space.
They will be reclaimed during next gabarage collection and added to the
free cell list.
Am 17.12.2016 03:33 schrieb "Bruno Franco" :
> Hi Joh
Hi John, Alex,
Thank you for your explanations, I think I now understand how sort works:
So, for example, in
: (setq A (3 1 2 4 5 6))
-> (3 1 2 4 5 6)
: (setq B (sort A))
-> (1 2 3 4 5 6)
: A
-> (3 4 5 6)
: B
-> (1 2 3 4 5 6)
The symbol A points to the first cell of the list (3 1 2 3 4 5 6), and
Hi Bruno,
> But that might be because with 'by, the operation is not destructive.
This is correct. 'sort' is destructive, and 'by' is not, because it builds a
fresh, private list.
> Is this normal operation of picolisp? I assumed its not, because I didn't
> catch any reference to it in the docu
On Wed, Dec 14, 2016 at 10:01:27PM -0500, John Duncan wrote:
> This is because A still points at the cons that was the head of the list
> before sorting. If you want to update it, you have to set A to the result
> of sort.
Yes. The point is that 'sort' is a "destructive" operation. See the referen
This is because A still points at the cons that was the head of the list
before sorting. If you want to update it, you have to set A to the result
of sort.
On Dec 14, 2016 8:37 PM, "Bruno Franco"
wrote:
> Hi list, I have a problem.
>
> Whenever I sort a list stored in a symbol, some elements are
