Max Vasin wrote:
But why do you need that? Where do need to make an assumption about the size
of the list?
I'm implementing the RC4 algorithm, which requires a state array with 256 elements containing the bytes from 0 to 255. As the algorithm progresses, the elements of the array get shuffled around. This is what drives the pseudo-random number generator. But the size of the state array is always 256.
Cheers, Daniel. _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
