Initial value for unfold(-right) John Cowan (10 Jan 2015 23:49 UTC)
Re: Initial value for unfold(-right) Takashi Kato (11 Jan 2015 11:39 UTC)
Re: Initial value for unfold(-right) Arthur A. Gleckler (11 Jan 2015 17:19 UTC)
Re: Initial value for unfold(-right) Takashi Kato (11 Jan 2015 18:44 UTC)
Re: Initial value for unfold(-right) Arthur A. Gleckler (11 Jan 2015 21:16 UTC)
Re: Initial value for unfold(-right) Takashi Kato (12 Jan 2015 06:14 UTC)
Re: Initial value for unfold(-right) Arthur A. Gleckler (12 Jan 2015 06:17 UTC)
Re: Initial value for unfold(-right) John Cowan (12 Jan 2015 13:27 UTC)

Re: Initial value for unfold(-right) John Cowan 12 Jan 2015 13:27 UTC

Takashi Kato scripsit:

> BTW, why is there no queue appending procedure like
> list-queue-add-back-all!?

I think I'll add list-queue-append and list-queue-append!.  The first
is trivial in the presence of list-concatenate, and the second is
O(N) where N is the number of queues being appended and provides
the function of list-queue-add-back-all!.

--
John Cowan          http://www.ccil.org/~cowan        xxxxxx@ccil.org
The penguin geeks is happy / As under the waves they lark
The closed-source geeks ain't happy / They sad cause they in the dark
But geeks in the dark is lucky / They in for a worser treat
One day when the Borg go belly-up / Guess who wind up on the street.