#!/usr/bin/perl -w
# Copyright 2010, 2011, 2012, 2013, 2014 Kevin Ryde
# This file is part of Math-NumSeq.
#
# Math-NumSeq is free software; you can redistribute it and/or modify it
# under the terms of the GNU General Public License as published by the Free
# Software Foundation; either version 3, or (at your option) any later
# version.
#
# Math-NumSeq is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
# or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
# for more details.
#
# You should have received a copy of the GNU General Public License along
# with Math-NumSeq. If not, see <http://www.gnu.org/licenses/>.
use 5.004;
use strict;
use Test;
use lib 't';
use MyTestHelpers;
MyTestHelpers::nowarnings();
use Math::NumSeq::PrimeFactorCount;
plan tests => 14;
#------------------------------------------------------------------------------
# VERSION
{
my $want_version = 71;
ok ($Math::NumSeq::PrimeFactorCount::VERSION, $want_version,
'VERSION variable');
ok (Math::NumSeq::PrimeFactorCount->VERSION, $want_version,
'VERSION class method');
ok (eval { Math::NumSeq::PrimeFactorCount->VERSION($want_version); 1 },
1,
"VERSION class check $want_version");
my $check_version = $want_version + 1000;
ok (! eval { Math::NumSeq::PrimeFactorCount->VERSION($check_version); 1 },
1,
"VERSION class check $check_version");
}
#------------------------------------------------------------------------------
# characteristic()
{
my $seq = Math::NumSeq::PrimeFactorCount->new;
ok ($seq->characteristic('count'), 1, 'characteristic(count)');
ok ($seq->characteristic('integer'), 1, 'characteristic(integer)');
}
#------------------------------------------------------------------------------
# values
{
my $seq = Math::NumSeq::PrimeFactorCount->new;
my $want_arrayref = [ 1,0, # 1
2,1, # 2
3,1, # 3
4,2, # 4
5,1, # 5
6,2, # 6
7,1, # 7
8,3, # 8
9,2, # 9
10,2, # 10
11,1, # 11
12,3, # 12
13,1, # 13
14,2, # 14
15,2, # 15
16,4, # 16
17,1, # 17
18,3, # 18
19,1, # 19
20,3, # 20
21,2, # 21
22,2, # 22
23,1, # 23
24,4, # 24
25,2, # 25
26,2, # 26
27,3, # 27
28,3, # 28
29,1, # 29
30,3, # 30
];
my $want = join (',', @$want_arrayref);
{
my $got = join ',', map {$seq->next} 1..30;
ok ($got, $want,
'PrimeFactorCount 1 to 30 iterator');
}
{
$seq->rewind;
my $got = join ',', map {$seq->next} 1..30;
ok ($got, $want,
'PrimeFactorCount 1 to 30 rewind iterator');
}
# my %got_hashref;
# foreach my $n (2 .. 17) {
# if ($gen->is_iter_arrayref($n)) {
# $got_hashref{$n} = undef;
# }
# }
# is_deeply ($got_arrayref, $want_arrayref,
# 'PrimeFactorCount 2 to 17 is_iter_arrayref()');
}
{
my $seq = Math::NumSeq::PrimeFactorCount->new (prime_type => 'odd');
my $want_arrayref = [ 1,0, # 1
2,0, # 2
3,1, # 3
4,0, # 4
5,1, # 5
6,1, # 6
7,1, # 7
8,0, # 8
9,2, # 9
10,1, # 10
11,1, # 11
12,1, # 12
13,1, # 13
14,1, # 14
15,2, # 15
16,0, # 16
17,1, # 17
18,2, # 18
19,1, # 19
20,1, # 20
21,2, # 21
22,1, # 22
23,1, # 23
24,1, # 24
25,2, # 25
26,1, # 26
27,3, # 27
28,1, # 28 = 2*2*7
29,1, # 29
30,2, # 30 = 2*3*5
];
my $want = join (',', @$want_arrayref);
{
my $got = join ',', map {$seq->next} 1..30;
ok ($got, $want,
'PrimeFactorCount 1 to 30 iterator, prime_type=odd');
}
{
$seq->rewind;
my $got = join ',', map {$seq->next} 1..30;
ok ($got, $want,
'PrimeFactorCount 1 to 30 rewind iterator, prime_type=odd');
}
# my %got_hashref;
# foreach my $n (2 .. 17) {
# if ($gen->is_iter_arrayref($n)) {
# $got_hashref{$n} = undef;
# }
# }
# is_deeply ($got_arrayref, $want_arrayref,
# 'PrimeFactorCount 2 to 17 is_iter_arrayref()');
}
{
my $seq = Math::NumSeq::PrimeFactorCount->new (prime_type => '4k+1');
my $want_arrayref = [ 1,0, # 1
2,0, # 2
3,0, # 3
4,0, # 4
5,1, # 5 4k+1
6,0, # 6
7,0, # 7
8,0, # 8
9,0, # 9=3*3
10,1, # 10=2*5
11,0, # 11
12,0, # 12=2*2*3
13,1, # 13
14,0, # 14=2*7
15,1, # 15=3*5
16,0, # 16=2*2*2*2
17,1, # 17
18,0, # 18=2*3*3
19,0, # 19
20,1, # 20=2*2*5
21,0, # 21=3*7
22,0, # 22=2*11
23,0, # 23
24,0, # 24=2*2*2*3
25,2, # 25=5*5
26,1, # 26=2*13
27,0, # 27=3*3*3
28,0, # 28 = 2*2*7
29,1, # 29
30,1, # 30 = 2*3*5
];
my $want = join (',', @$want_arrayref);
{
my $got = join ',', map {$seq->next} 1..30;
ok ($got, $want,
'PrimeFactorCount 1 to 30 iterator, prime_type=4k+1');
}
{
$seq->rewind;
my $got = join ',', map {$seq->next} 1..30;
ok ($got, $want,
'PrimeFactorCount 1 to 30 rewind iterator, prime_type=4k+1');
}
# my %got_hashref;
# foreach my $n (2 .. 17) {
# if ($gen->is_iter_arrayref($n)) {
# $got_hashref{$n} = undef;
# }
# }
# is_deeply ($got_arrayref, $want_arrayref,
# 'PrimeFactorCount 2 to 17 is_iter_arrayref()');
}
{
my $seq = Math::NumSeq::PrimeFactorCount->new (prime_type => '4k+3');
my $want_arrayref = [ 1,0, # 1
2,0, # 2
3,1, # 3
4,0, # 4
5,0, # 5
6,1, # 6=2*3
7,1, # 7
8,0, # 8
9,2, # 9=3*3
10,0, # 10=2*5
11,1, # 11
12,1, # 12=2*2*3
13,0, # 13
14,1, # 14=2*7
15,1, # 15=3*5
16,0, # 16=2*2*2*2
17,0, # 17
18,2, # 18=2*3*3
19,1, # 19
20,0, # 20=2*2*5
21,2, # 21=3*7
22,1, # 22=2*11
23,1, # 23
24,1, # 24=2*2*2*3
25,0, # 25=5*5
26,0, # 26=2*13
27,3, # 27=3*3*3
28,1, # 28 = 2*2*7
29,0, # 29
30,1, # 30 = 2*3*5
];
my $want = join (',', @$want_arrayref);
{
my $got = join ',', map {$seq->next} 1..30;
ok ($got, $want,
'PrimeFactorCount 1 to 30 iterator, prime_type=4k+3');
}
{
$seq->rewind;
my $got = join ',', map {$seq->next} 1..30;
ok ($got, $want,
'PrimeFactorCount 1 to 30 rewind iterator, prime_type=4k+3');
}
# my %got_hashref;
# foreach my $n (2 .. 17) {
# if ($gen->is_iter_arrayref($n)) {
# $got_hashref{$n} = undef;
# }
# }
# is_deeply ($got_arrayref, $want_arrayref,
# 'PrimeFactorCount 2 to 17 is_iter_arrayref()');
}
exit 0;