#!/usr/bin/env perl
use strict;
use warnings;

use Test::More;
use Math::Prime::Util qw/partitions forpart forcomp is_prime/;
my $extra = defined $ENV{EXTENDED_TESTING} && $ENV{EXTENDED_TESTING};

my @parts = qw/
1
1
2
3
5
7
11
15
22
30
42
56
77
101
135
176
231
297
385
490
627
792
1002
1255
1575
1958
2436
3010
3718
4565
5604
6842
8349
10143
12310
14883
17977
21637
26015
31185
37338
44583
53174
63261
75175
89134
105558
124754
147273
173525
204226
/;

my %bparts = (
    101 => "214481126",
    256 => "365749566870782",
    501 => "2431070104309287327876",
   1001 => "25032297938763929621013218349796",
   2347 => "56751384003004060684283391440819878903446789803099",
   4128 => "13036233928924552978434294180871407270098426394166677221003078079504",
   #9988 => "31043825285346179203111322344702502691204288916782299617140664920755263693739998376431336412511604846065386",
  #13337 => "4841449229081281114351180373774137636239639013054790559544724995314398354517477085116206336008004971541987422037760634642695",
  #37373 => "885240148270777711759915557428752066370785294706979437063536090533501018735098279767013023483349639513395622225840616033227700794918506274833787569446519667398089943122156454986205555766363295867812094833219935",
);
if (!$extra) {
  my @ns = grep { $_ > 300 } keys %bparts;
  foreach my $n (@ns) { delete $bparts{$n} }
}

plan tests => scalar(@parts) + scalar(keys(%bparts)) + 20 + 6;


foreach my $n (0..$#parts) {
  is( partitions($n), $parts[$n], "partitions($n)" );
}

while (my($n, $epart) = each (%bparts)) {
  is( partitions($n), $epart, "partitions($n)" );
}

################### forpart

{ my @p=(); forpart { push @p, [@_] } 0;
  is_deeply( [@p], [[]], "forpart 0" ); }

{ my @p=(); forpart { push @p, [@_] } 1;
  is_deeply( [@p], [[1]], "forpart 1" ); }

{ my @p=(); forpart { push @p, [@_] } 2;
  is_deeply( [@p], [[1,1],[2]], "forpart 2" ); }

{ my @p=(); forpart { push @p, [@_] } 3;
  is_deeply( [@p], [[1,1,1],[1,2],[3]], "forpart 3" ); }

{ my @p=(); forpart { push @p, [@_] } 4;
  is_deeply( [@p], [[1,1,1,1],[1,1,2],[1,3],[2,2],[4]], "forpart 4" ); }

{ my @p=(); forpart { push @p, [@_] } 6;
  is_deeply( [@p], [[1,1,1,1,1,1],[1,1,1,1,2],[1,1,1,3],[1,1,2,2],[1,1,4],[1,2,3],[1,5],[2,2,2],[2,4],[3,3],[6]], "forpart 6" ); }

{ my @p=(); forpart { push @p, [@_] } 17,{n=>2};
  is_deeply( [@p], [[1,16],[2,15],[3,14],[4,13],[5,12],[6,11],[7,10],[8,9]], "forpart 17 restricted n=[2,2]" ); }

{ my @p1 = (); my @p2 = ();
  forpart { push @p1, [@_] if @_ <= 5 } 27;
  forpart { push @p2, [@_] } 27, {nmax=>5};
  is_deeply( [@p1], [@p2], "forpart 27 restricted nmax 5" ); }

{ my @p1 = (); my @p2 = ();
  forpart { push @p1, [@_] if @_ >= 20 } 27;
  forpart { push @p2, [@_] } 27, {nmin=>20};
  is_deeply( [@p1], [@p2], "forpart 27 restricted nmin 20" ); }

{ my @p1 = (); my @p2 = ();
  forpart { push @p1, [@_] if @_ >= 10 && @_ <= 13 } 19;
  forpart { push @p2, [@_] } 19, {nmin=>10,nmax=>13};
  is_deeply( [@p1], [@p2], "forpart 19 restricted n=[10..13]" ); }

{ my @p1 = (); my @p2 = ();
  forpart { push @p1, [@_] unless scalar grep { $_ > 4 } @_ } 20;
  forpart { push @p2, [@_] } 20, {amax=>4};
  is_deeply( [@p1], [@p2], "forpart 20 restricted amax 4" ); }

{ my @p1 = (); my @p2 = ();
  forpart { push @p1, [@_] unless scalar grep { $_ < 4 } @_ } 15;
  forpart { push @p2, [@_] } 15, {amin=>4};
  is_deeply( [@p1], [@p2], "forpart 15 restricted amin 4" ); }

{ my @p1 = (); my @p2 = ();
  forpart { push @p1, [@_] unless scalar grep { $_ < 3 || $_ > 6 } @_ } 21;
  forpart { push @p2, [@_] } 21, {amin=>3,amax=>6};
  is_deeply( [@p1], [@p2], "forpart 21 restricted a=[3..6]" ); }

#{ my @p1 = (); my @p2 = ();
#  forpart { push @p1, [@_] unless @_ != 4 || scalar grep { $_ < 2 || $_ > 8 } @_ } 22;
#  forpart { push @p2, [@_] } 22, {amin=>2,amax=>8,n=>4};
#  is_deeply( [@p1], [@p2], "forpart 22 restricted n=4 and a=[3..6]" ); }
{ my @p=(); forpart { push @p, [@_] } 22, {amin=>2,amax=>8,n=>4};
  is_deeply( [@p], [[2,4,8,8],[2,5,7,8],[2,6,6,8],[2,6,7,7],[3,3,8,8],[3,4,7,8],[3,5,6,8],[3,5,7,7],[3,6,6,7],[4,4,6,8],[4,4,7,7],[4,5,5,8],[4,5,6,7],[4,6,6,6],[5,5,5,7],[5,5,6,6]], "forpart 22 restricted n=4 and a=[3..6]" ); }

{ my @p = ();
  forpart { push @p, [@_] unless scalar grep {!is_prime($_)} @_ } 20,{amin=>3};
  is_deeply( [@p], [[3,3,3,3,3,5],[3,3,3,11],[3,3,7,7],[3,5,5,7],[3,17],[5,5,5,5],[7,13]], "forpart 20 restricted to odd primes" );
}

{ my @p=(); forpart { push @p, [@_] } 21, {amax=>0};
  is_deeply( [@p], [], "forpart 21 restricted amax 0" );
}

{ my $c = 0;
  forpart { $c++ } 2*89+1,{n=>3,amin=>3,prime=>1};
  is($c, 86, "A007963(89) = number of odd-prime 3-tuples summing to 2*89+1 = 86");
}
{ my $c = 0;
  forpart { $c++ } 23,{n=>4,amin=>2};
  is($c, 54, "23 partitioned into 4 with mininum 2 => 54");
}
{ my $c = 0;
  forpart { $c++ } 23,{n=>4,amin=>2,prime=>1};
  is($c, 5, "23 partitioned into 4 with mininum 2 and prime => 5");
}
{ my $c = 0;
  forpart { $c++ } 23,{n=>4,amin=>2,prime=>0};
  is($c, 1, "23 partitioned into 4 with mininum 2 and composite => 1");
}


################### forcomp

{ my @p=(); forcomp { push @p, [@_] } 0;
  is_deeply( [@p], [[]], "forcomp 0" ); }

{ my @p=(); forcomp { push @p, [@_] } 1;
  is_deeply( [@p], [[1]], "forcomp 1" ); }

{ my @p=(); forcomp { push @p, [@_] } 2;
  is_deeply( [@p], [[1,1],[2]], "forcomp 2" ); }

{ my @p=(); forcomp { push @p, [@_] } 3;
  is_deeply( [@p], [[1,1,1],[1,2],[2,1],[3]], "forcomp 3" ); }

{ my @p=(); forcomp { push @p, [@_] } 5,{n=>3};
  is_deeply( [@p], [[1,1,3],[1,2,2],[1,3,1],[2,1,2],[2,2,1],[3,1,1]], "forcomp 5 restricted n=3" ); }

{ my @p=(); forcomp { push @p, [@_] } 12,{n=>3,amin=>3,amax=>5};
  is_deeply( [@p], [[3,4,5],[3,5,4],[4,3,5],[4,4,4],[4,5,3],[5,3,4],[5,4,3]], "forcomp 12 restricted n=3,a=[3..5]" ); }