-----------------------------------------------------------------------------
| Algorithm::FastPermute v0.05    - Robin Houston, 2002-03-05
-----------------------------------------------------------------------------

v0.05: Now works on Win32 and IRIX
Thanks to Edwin Pratomo, Jørn Amundsen and Yves Orton for reporting problems

Note: A version of this implementation is also provided by the
Algorithm::Permute module. The code in Algorithm::Permute 0.03 corresponds to
Algorithm::FastPermute 0.03; if you're trying to use that and having problems,
it may be worth giving this distribution a try instead.


NAME
       Algorithm::FastPermute - Rapid generation of permutations

SYNOPSIS
         use Algorithm::FastPermute ('permute');
         my @array = (1..shift());
         permute {
             print "@array\n";         # Print all the permutations
         } @array;


DESCRIPTION
       Algorithm::FastPermute generates all the permutations of
       an array. You pass a block of code, which will be executed
       for each permutation.

       It's very fast. My tests suggest it's four or five times as
       fast as Algorithm::Permute's traditional interface.

EXPORT
       The `permute' function is exported by default.

AUTHOR
       Robin Houston, <robin@kitsite.com>

       Based on a C program by Matt Day.

SEE ALSO
       the Algorithm::Permute manpage

COPYRIGHT
       Copyright (c) 2001-2002, Robin Houston. All Rights Reserved.
       This module is free software. It may be used, redistributed
       and/or modified under the same terms as Perl itself.