in reply to Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's

I wonder if something like this might be helpful/useful:

#!/usr/bin/env perl use strict; use warnings; use Algorithm::Combinatorics qw(combinations); use MCE::Loop; MCE::Loop->init( max_workers => 12, # what ever you have... chunk_size => 'auto' ); my $length = 10; my $ones = 2; mce_loop { my ( $mce, $chunk_ref, $chunk_id ) = @_; for ( @{$chunk_ref} ) { something($_); } } combinations([0..$length-1], $ones); sub something { my $chunk_ref = shift; ...; }

Unfortunately I canít test because I donít have access to my Mac because of relocation/renovation. I hope also that I didnít miss the point. Regards, Karl

See also MCE::Loop

Minor update: Link added etc.

ęThe Crux of the Biscuit is the ApostropheĽ

perl -MCrypt::CBC -E 'say Crypt::CBC->new(-key=>'kgb',-cipher=>"Blowfish")->decrypt_hex($ENV{KARL});'Help