Sha256: cb34b63c9d7d8f8c41dfcb437b1cbb1b275f0d5e921113bdc9ce4ae7dcd16421
Contents?: true
Size: 1.28 KB
Versions: 46
Compression:
Stored size: 1.28 KB
Contents
#!/usr/bin/env perl6
use v6;
use Test;
use lib $?FILE.IO.dirname;
my $exercise = 'Robot';
my $version = v1;
my $module = %*ENV<EXERCISM> ?? 'Example' !! $exercise;
plan 8;
use-ok $module or bail-out;
require ::($module);
if ::($exercise).^ver !~~ $version {
warn "\nExercise version mismatch. Further tests may fail!"
~ "\n$exercise is $(::($exercise).^ver.gist). "
~ "Test is $($version.gist).\n";
bail-out 'Example must match test.' if %*ENV<EXERCISM>;
}
subtest 'Class method(s)', {
plan 2;
ok ::($exercise).can($_), $_ for <name reset-name>;
}
srand 1;
my $robot = ::($exercise).?new;
my Str $name = $robot.?name;
like $name, /^^<[A..Z]>**2 <[0..9]>**3$$/, 'Name matches schema';
srand 2;
is $robot.?name, $name, 'Name is persistent';
srand 1;
isnt ::($exercise).new.?name, $name, 'New Robot cannot claim previous Robot name';
srand 1;
$robot.?reset-name;
$robot.?reset_name; # Allows next test to still pass for older solutions
isnt $robot.?name, $name, "'reset-name' cannot use previous Robot name";
diag "\nCreating 100 robots...";
push my @names, ::($exercise).new.name for 1..100;
is @names, @names.unique, 'All names are unique';
subtest 'Randomness', {
plan 2;
isnt @names, @names.sort, 'Names not ordered';
isnt @names, @names.sort.reverse, 'Names not reverse ordered';
}
Version data entries
46 entries across 46 versions & 1 rubygems