Jump to content

SHA-256: Difference between revisions

m
m (→‎{{header|Perl 6}}: using grep to make the lazy list of primes)
Line 169:
<lang Perl 6>say .list».fmt("%02x").join given sha256 "Rosetta code";
 
constant primes = grep *.&is-prime, 2 .. *;
sub init(&f, $n) { map { (($_ - .Int)*2**32).Int }, map &f, primes[^$n] }
 
1,934

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.