Additionally, it would become infeasible to splice a pair into or out
of the list [an O(1) operation], given only a pointer into the middle
of the list, because you cannot update the counts of earlier list
elements. This would be possible with a doubly-linked list---but
insert and remove would
Hello,
On Thu, 5 Jan 2006 03:07:16 -0600 Zbigniew [EMAIL PROTECTED] wrote:
Additionally, it would become infeasible to splice a pair into or out
of the list [an O(1) operation], given only a pointer into the middle
of the list, because you cannot update the counts of earlier list
elements.
Chicken supports the vector datatype. Checkout the srfi-43 egg.
Best Wishes,
Kon
On Jan 5, 2006, at 8:40 AM, Mario Domenech Goulart wrote:
Hello,
On Thu, 5 Jan 2006 03:07:16 -0600 Zbigniew [EMAIL PROTECTED]
wrote:
Additionally, it would become infeasible to splice a pair into or out
of
Hello
I've noticed that the performance of the length function is a bit low
for medium/large lists. As far as I understand (from runtime.c
C_i_length), Chicken counts the elements from the given list everytime
length is invoked. Is it like that?
If so, wouldn't it be better to have a list
Mario Domenech Goulart scripsit:
I've noticed that the performance of the length function is a bit low
for medium/large lists. As far as I understand (from runtime.c
C_i_length), Chicken counts the elements from the given list everytime
length is invoked. Is it like that?
It is.
If so,
