t/unit/file_versions.t - metacpan.org

#!/usr/bin/env perl

# mt-aws-glacier - Amazon Glacier sync client
# Copyright (C) 2012-2013  Victor Efimov
# http://mt-aws.com (also http://vs-dev.com) vs@vs-dev.com
# License: GPLv3
#
# This file is part of "mt-aws-glacier"
#
#    mt-aws-glacier 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 of the License, or
#    (at your option) any later version.
#
#    mt-aws-glacier 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 this program.  If not, see <http://www.gnu.org/licenses/>.



use strict;
use warnings;
use utf8;
use Test::More tests => 1028;
use Test::Deep;
use FindBin;
use lib "$FindBin::RealBin/../", "$FindBin::RealBin/../../lib";
use App::MtAws::FileVersions;
use TestUtils;

warning_fatal();

sub object
{
	my ($time, $mtime, $archive_id) = @_;
	{ time => $time, mtime => $mtime, ($archive_id ? (archive_id => $archive_id) : () )};
}

# _cmp tests

{
	my $cmp = \&App::MtAws::FileVersions::_cmp;

	for ([undef, undef], [777, 777]) {
		is $cmp->(object(123, $_->[0]), object(456, $_->[1])), -1, "cmp should work when mtime is undef or equal and a.time < b.time";
		is $cmp->(object(456, $_->[0]), object(123, $_->[1])), 1, "cmp should work when mtime is undef or equal and a.time > b.time";
		is $cmp->(object(456, $_->[0]), object(456, $_->[1])), 0, "cmp should work when mtime is undef or equal and a.time == b.time";
	}

	for ([123, 42], [42, 123]) {
		is $cmp->(object(44, $_->[0]), object(44, $_->[1])), $_->[0] <=> $_->[1], "cmp should compare mtime if it's defined";
		is $cmp->(object($_->[0], undef), object(44, $_->[1])), $_->[0] <=> $_->[1], "cmp should compare time if mtime missing in left operand";
		is $cmp->(object(44, $_->[0]), object($_->[1]), undef), $_->[0] <=> $_->[1], "cmp should compare time if mtime missing in right operand";
		is $cmp->(object($_->[0], undef), object($_->[1]), undef), $_->[0] <=> $_->[1], "cmp should compare time if mtime missing in both operands";

		is $cmp->(object($_->[0], undef), object($_->[1], $_->[0])), $_->[0] <=> $_->[1], "cmp should compare time with time if mtime match time";
		is $cmp->(object($_->[1], $_->[0]), object($_->[0], undef)), $_->[1] <=> $_->[0], "cmp should compare time with time if mtime match time";
	}

	for ([42, 43], [43, 42]) {
		is $cmp->(object($_->[0], 123), object($_->[1], 456)), -1, "cmp should work when a.mtime < b.mtime and ignore time";
		is $cmp->(object($_->[0], 456), object($_->[1], 123)), 1, "cmp should work when a.mtime > b.mtime and ignore time";
	}

	# _cmp integration tests

	{
		my @all = (-1,0,1,2);
		for my $a (@all) { for my $b (@all, undef) { for my $c (@all) { for my $d (@all, undef) {
			my $got = $cmp->(object($a, $b), object($c, $d));

			my $l = defined($b) ? $b : $a;
			my $r = defined($d) ? $d : $c;

			my $expected;
			if ($l == $r) {
				$expected = $a <=> $c;
			} else {
				$expected = $l <=> $r;
			}


			my $bb = $b ? $b : 'undef';
			my $dd = $d ? $d : 'undef';
			is $got, $expected, "_cmp ($a, $bb), ($c, $dd) = $expected";
		}}}}
	}
}


# _mid tests

{
	my $mid = \&App::MtAws::FileVersions::_mid;
	for my $base (0..3) {
		is $mid->($base, $base+0), $base+0;
		is $mid->($base, $base+1), $base+0;
		is $mid->($base, $base+2), $base+1;
		is $mid->($base, $base+3), $base+1;
		is $mid->($base, $base+4), $base+2;
		is $mid->($base, $base+5), $base+2;
	}
}

# _find tests

{
	my $v = bless [], 'App::MtAws::FileVersions';
	ok ! defined $v->_find(object(5)), '_find 0 elements, should return before everything';
}

{
	my $v = bless [object(10)], 'App::MtAws::FileVersions';
	ok ! defined $v->_find(object(5)), '_find 1 element, should return before everything';
	is $v->_find(object(15)), 0, '_find 1 element, should return after 0-th';
	is $v->_find(object(10)), 0, '_find 1 element, should return after 0-th if elements are equal';
}

{
	my $v = bless [object(10), object(20)], 'App::MtAws::FileVersions';
	ok ! defined $v->_find(object(5)), '_find 2 element, should return before everything';
	is $v->_find(object(10)), 0, '_find 2 element, should return after 0-th if elements are equal';
	is $v->_find(object(15)), 0, '_find 2 element, should return after 0-th';

	is $v->_find(object(20)), 1, '_find 2 element, should return after 1st if elements are equal';
	is $v->_find(object(25)), 1, '_find 2 element, should return after 1st';
}

# same tests as above, but for N elements
for (1..10) {
	my @elements = map $_* 10, 1..$_;
	my $v = bless [map object($_), @elements], 'App::MtAws::FileVersions';

	for (my $i = 0; $i <= $#elements; ++$i) {
		is $v->_find(object($elements[$i])), $i, "find $_ elements, should return after $i";
		if ($i > 0) {
			is $v->_find(object($elements[$i]-3)), $i - 1, "find $_ elements, should return after ".($i-1)." for ".($elements[$i]-3);
		} else {
			ok ! defined $v->_find(object($elements[$i]-3)), "find $_ elements, should return before everything for ".($elements[$i]-3);
		}
		if ($i == $#elements) {
			is $v->_find(object($elements[$i]+3)), $i, "find $_ elements, should return after ".($i)." for ".($elements[$i]+3);
		}
	}
}

# same "stresstest", but some elements have repeations
{
	for my $before (1..6) { for my $same (1..6) { for my $after (1..6) {
		my @elements = ( (map $_* 10, 1..$before), (($before + 1) * 10 ) x $same, (map { ($before + 1) * 10 + $_* 10 } 1..$after) );
		my $ok = 1;
		$ok &&= (scalar @elements) == $before + $same + $after;
		my $v = bless [map object($_), @elements], 'App::MtAws::FileVersions';
		my %seen;
		for (my $i = 0; $i <= $#elements; ++$i) {
			next if $seen{$elements[$i]}++; # we have some repetions (array produced with $same)
			my $after = $v->_find(object($elements[$i]));
			$ok &&= $elements[$after] <= $elements[$i];
			if ($after+1 <= $#elements) {
				$ok &&= $elements[$after+1] > $elements[$i];
			}
			my $after2 = $v->_find(object($elements[$i]-3));
			if (defined $after2) {
				$ok &&= $elements[$after2] <= $elements[$i]-3;
				if ($after2+1 <= $#elements) {
					$ok &&= $elements[$after2+1] > $elements[$i]-3;
				}
			} else {
				$ok &&= $elements[0] > $elements[$i]-3;
			}
		}
		ok $ok;
	}}}
}

# adding elements tests

for (100, 123, 300) {
	my $v = App::MtAws::FileVersions->new();
	my $o1 = object(123);
	my $o2 = object($_, undef, 'latest');
	$v->add($o1);
	$v->add($o2);
	is scalar @$v, 2, "should add second element";
	ok $v->[0]{time} <= $v->[1]{time}, "should add second element right";
	if ($v->[0]{time} == $v->[1]{time}) {
		ok !$v->[0]{archive_id} && $v->[1]{archive_id} eq 'latest', "if everything equal, later added element should go last"
	}
}

for (100, 300, 500) {
	my $v = App::MtAws::FileVersions->new();
	my $o1 = object(123);
	my $o2 = object(456);
	my $o3 = object($_);
	$v->add($o1);
	$v->add($o2);
	$v->add($o3);
	is scalar @$v, 3, "should add third element";
	ok $v->[0]{time} < $v->[1]{time}, "should add third element right";
	ok $v->[1]{time} < $v->[2]{time}, "should add third element right";
}

for (100, 200, 201, 211, 300, 310, 311, 321, 330, 500) {
	my $v = App::MtAws::FileVersions->new();
	my @objects;
	for my $el ((200, 210, 220, 230, 310, 320, 330)) {
		my $o = object($el);
		push @objects, $o;
		$v->add($o);
	}
	my $o = object($_, undef, 'latest');
	$v->add($o);
	push @objects, $o;
	is scalar @$v, 8, "should add $_";
	is scalar $v->all, scalar @$v, "all() should return all data";
	cmp_deeply [$v->all], [sort { App::MtAws::FileVersions::_cmp($a, $b) } @objects], "all should return sorted data";
	for (my $i = 0; $i < $#$v; ++$i) {
		ok $v->[$i]{time} <= $v->[$i+1]{time}, "$i-th element ($v->[$i]{time}) should be less then next one ($v->[$i+1]{time}), for $_";
		if ($v->[$i]{time} == $v->[$i+1]{time}) {
			ok !$v->[$i]{archive_id} && $v->[$i+1]{archive_id} eq 'latest', "if everything equal, later added element should go last"
		}
	}
}

# _delete_by_archive_id test
{
	my $v = App::MtAws::FileVersions->new();
	my $aid = 'abc123';
	$v->add(object(123, undef, $aid));
	is scalar @$v, 1, "should contain one element";
	ok $v->delete_by_archive_id($aid);
	is scalar @$v, 0, "deletion of one element should work";
}

{
	sub create_objects
	{
		my ($v, $n) = @_;
		my @ids;
		for my $i (1..$_-2) {
			$v->add(object(200+$i, undef, "id$i"));
			push @ids, "id$i";
		}
		@ids;
	}
	for (2..10) {
		{
			my $v = App::MtAws::FileVersions->new();
			my $aid = 'abc123';
			$v->add(object(123, undef, 'anotherid'));
			$v->add(object(456, undef, $aid));

			my @ids = create_objects($v, $_-2);

			is scalar @$v, $_, "should contain $_ elements";
			cmp_deeply [map $_->{archive_id}, @$v], ['anotherid', @ids, $aid];
			ok $v->delete_by_archive_id($aid);
			is scalar @$v, $_ - 1, "deletion of last element should work in $_-items array";
			cmp_deeply [map $_->{archive_id}, @$v], ['anotherid', @ids];
			ok !$v->delete_by_archive_id('nonexistant');
		}
		{
			my $v = App::MtAws::FileVersions->new();
			my $aid = 'abc123';
			$v->add(object(123, undef, $aid));
			$v->add(object(456, undef, 'anotherid'));

			my @ids = create_objects($v, $_-2);

			is scalar @$v, $_, "should contain $_ elements";
			cmp_deeply [map $_->{archive_id}, @$v], [$aid, @ids, 'anotherid'];
			ok $v->delete_by_archive_id($aid);
			is scalar @$v, $_ - 1, "deletion of first element should work in $_-items array";
			cmp_deeply [map $_->{archive_id}, @$v], [@ids, 'anotherid'];
			ok !$v->delete_by_archive_id('nonexistant');
		}
	}
}

# latest() tests

{
	my $v = App::MtAws::FileVersions->new();
	ok !defined $v->latest();
	$v->add(object(123, undef, 'f1'));
	is $v->latest->{archive_id}, 'f1';
	$v->add(object(200, undef, 'f2'));
	is $v->latest->{archive_id}, 'f2';
	$v->add(object(199, undef, 'f3'));
	is $v->latest->{archive_id}, 'f2';
	$v->add(object(456, undef, 'f4'));
	is $v->latest->{archive_id}, 'f4';
}


# these tests does not make sense, as sort behaviour already tested above
# but I still implement this to define how files can be sorted in practice
{
	my $v = App::MtAws::FileVersions->new();
	$v->add(object(7, undef, 'f1'));
	$v->add(object(8, 5, 'f2')); # loaded later than f1, but we know mtime of f2 is before f1 is loaded
	# anyway we ignore mtime and think who is later loaded is older

	cmp_deeply [map $_->{archive_id}, @$v], [qw/f2 f1/];

}

{
	my $v = App::MtAws::FileVersions->new();
	$v->add(object(7, undef, 'f1'));
	$v->add(object(7, 5, 'f2'));

	cmp_deeply [map $_->{archive_id}, @$v], [qw/f2 f1/], "if at least one mtime missed, and time is same, we compare mtime with time"
}
1;
	Global
`s`	Focus search bar
`?`	Bring up this help dialog
	GitHub
`g` `p`	Go to pull requests
`g` `i`	go to github issues (only if github is preferred repository)
	POD
`g` `a`	Go to author
`g` `c`	Go to changes
`g` `i`	Go to issues
`g` `d`	Go to dist
`g` `r`	Go to repository/SCM
`g` `s`	Go to source
`g` `b`	Go to file browse
	Search terms
module: (e.g. module:Plugin)
distribution: (e.g. distribution:Dancer auth)
author: (e.g. author:SONGMU Redis)
version: (e.g. version:1.00)