File: Sort-Key-Top.t

package info (click to toggle)
libsort-key-top-perl 0.08-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, forky, sid, trixie
  • size: 256 kB
  • sloc: ansic: 212; perl: 155; makefile: 5
file content (137 lines) | stat: -rw-r--r-- 4,837 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
# -*- Mode: CPerl -*-

use strict;
use warnings;

use Test::More tests => 791;

use Sort::Key::Top qw(nkeytop top rnkeytop topsort
                      nkeytopsort rnkeytopsort
                      ikeytopsort rikeytopsort
                      ukeytopsort rukeytopsort
                      nhead nkeyhead tail nkeytail
                      atpos rnkeyatpos
                      nkeypartref
                     );


my @top;

@top = nkeytop { abs $_ } 5 => 1, 2, 7, 5, 5, 1, 78, 0, -2, -8, 2;
is_deeply(\@top, [1, 2, 1, 0, -2], "nkeytop 1");


my @a = qw(cat fish bird leon penguin horse rat elephant squirrel dog);

is_deeply([top 5 => @a], [qw(cat fish bird elephant dog)], "top 1");

is_deeply([top 30 => @a], [@a], "top 1.1");

is_deeply([rnkeytop { length $_ } 3 => qw(a ab aa aac b t uu g h)], [qw(ab aa aac)], "rnkeytop 1");

is_deeply([top 5 => qw(a b ab t uu g h aa aac)], [qw(a b ab aa aac)], "top 2");

is_deeply([topsort 5 => qw(a b ab t uu g h aa aac)], [qw(a aa aac ab b)], "topsort 1");

is_deeply([rnkeytopsort { length $_ } 3 => qw(a ab aa aac b t uu g h)], [qw(aac ab aa)], "rnkeytopsort 1");

is(scalar(top 5 => @a), q(dog), "scalar top 1");

is(scalar(top 30 => @a), undef, "top 1.1");

is(scalar(rnkeytop { length $_ } 3 => qw(a ab aa aac b t uu g h)), q(aac), "scalar rnkeytop 1");

is(scalar(top 5 => qw(a b ab t uu g h aa aac)), q(aac), "scalar top 2");

is(scalar(topsort 5 => qw(a b ab t uu g h aa aac)), q(b), "scalar topsort 1");

is(scalar(rnkeytopsort { length $_ } 3 => qw(a ab aa aac b t uu g h)), q(aa), "scalar rnkeytopsort 1");

is_deeply([nkeypartref { $_ * $_ } 1 => (760, 617, -836)], [[617], [760, -836]], "nkeypartref");

my @data = map { join ('', map { ('a'..'f')[rand 6] } 0..(3 + rand  6)) } 0..1000;

for my $n (0, 1, 2, 3, 4, 10, 16, 20, 50, 100, 200, 500, 900, 990,
           996, 997, 998, 999, 1000, 1001, 1002, 1003, 1010, 1020, 2000, 4000,
           100000, 2000000, -1, -2, -3, -4, -10, -16, -20, -50, -100, -200, -500,
           -900, -990, -996, -997, -998, -999, -1000, -1001, -1002, -1003, -1010,
           -1020, -2000, -4000, -100000, -2000000 ) {

  my ($min, $max);



  if ($n >= 0) {
    $max = @data > $n ? $n - 1 : $#data;
    $min = 0;
  }
  else {
    if (@data > -$n) {
      $min = @data + $n;
      $max = $#data;
    }
    else {
      $min = 0;
      $max = $#data;
    }
  }


  # on 5.6.x perls, sort is not stable, so we have to stabilize it ourselves:
  my @ixs = sort { length($data[$a]) <=> length($data[$b]) or $a <=> $b } 0 .. $#data;
  my @sorted = @data[@ixs];

  my @rixs = sort { length($data[$b]) <=> length($data[$a]) or $a <=> $b } 0 .. $#data;
  my @rsorted = @data[@rixs];


  is_deeply([topsort $n => @data], [(sort @data)[$min..$max]], "topsort ($n)")
      or diag ("data: @data, min: $min, max: $max");

  is_deeply([nkeytopsort { length $_ } $n => @data],
            [ (@sorted)[$min..$max]], "nkeytopsort ($n)");
  is_deeply([rnkeytopsort { length $_ } $n => @data],
            [ (@rsorted)[$min..$max]], "rnkeytopsort ($n)");
  is_deeply([ikeytopsort { length $_ } $n => @data],
            [ (@sorted)[$min..$max]], "ikeytopsort ($n)");
  is_deeply([rikeytopsort { length $_ } $n => @data],
            [ (@rsorted)[$min..$max]], "rikeytopsort ($n)");
  is_deeply([ukeytopsort { length $_ } $n => @data],
            [ (@sorted)[$min..$max]], "ukeytopsort ($n)");
  is_deeply([rukeytopsort { length $_ } $n => @data],
            [ (@rsorted)[$min..$max]], "rukeytopsort ($n)");

  my $n1 = $n > 0 ? $n - 1 : $n < 0 ? $n : @data + 10;

  my $vn = (!$n || abs($n) > @data) ? undef : $sorted[$n > 0 ? $n - 1 : $n];
  my $rvn = (!$n || abs($n) > @data) ? undef : $rsorted[$n > 0 ? $n - 1 : $n];
    

  is(scalar(topsort $n => @data), (sort @data)[$n1], "scalar topsort ($n)");

  is(scalar(nkeytopsort { length $_ } $n => @data),
     $vn, "scalar nkeytopsort ($n)");

  is(scalar(rnkeytopsort { length $_ } $n => @data),
     $rvn, "scalar rnkeytopsort ($n)");

  is(scalar(ikeytopsort { length $_ } $n => @data),
     $vn, "scalar ikeytopsort ($n)");

  is(scalar(rikeytopsort { length $_ } $n => @data),
     $rvn, "scalar rikeytopsort ($n)");

  is(scalar(ukeytopsort { length $_ } $n => @data),
     $vn, "scalar ukeytopsort ($n)");

  is(scalar(rukeytopsort { length $_ } $n => @data),
     $rvn, "scalar rukeytopsort ($n)");
}

is(nhead(6, 7, 3, 8, 9, 9), 3, "nhead");
is((nkeyhead sub { length $_ }, qw(a ab aa aac b t uu uiyii)), 'a', 'nkeyhead');
is(tail(qw(a ab aa aac b t uu uiyii)), 'uu', 'tail');
is((nkeytail sub { length $_ }, qw(a ab aa aac b t uu uiyii)), 'uiyii', 'nkeytail');
is(atpos(3, qw(a ab aa aac b t uu uiyii)), 'ab', 'atpos');
is((rnkeyatpos sub { abs $_ }, 2 => -0.3, 1.1, 4, 0.1, 0.9, -2), 1.1, 'rnkeyatpos');
is((rnkeyatpos sub { abs $_ }, -2 => -0.3, 1.1, 4, 0.1, 0.9, -2), -0.3, 'rnkeyatpos neg');