[PATCH] Use a more efficient algorithm for list shuffling

[Pierre Thierry]

Scribit salvador fandino dies 11/05/2015 hora 16:00:
> Considering those results I would choose 200 as the best cut point because
> it is where SBCL and CCL perform best without incurring in a great penalty
> for ECL and GCL (~40%). Note also that performance degrades quite fast for
> SBCL and CCL once the optimal cut point is surpassed.

Why not use a different cut point for implementations where we know an
optimal one?

Curiously,
Pierre Thierry
-- 
pierre at nothos.net
OpenPGP 0xD9D50D8A
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 181 bytes
Desc: Digital signature
URL: <https://mailman.common-lisp.net/pipermail/alexandria-devel/attachments/20150511/84ae9fa3/attachment.sig>