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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
#!/usr/bin/perl
#
# Tests for various caching errors
#
my $file = "tf20-$$.txt";
$: = Tie::File::_default_recsep();
my $data = join $:, "record0" .. "record9", "";
my $V = $ENV{INTEGRITY}; # Verbose integrity checking?
print "1..111\n";
my $N = 1;
use Tie::File;
print "ok $N\n"; $N++;
open F, '>', $file or die $!;
binmode F;
print F $data;
close F;
# Limit cache size to 30 bytes
my $MAX = 30;
# -- that's enough space for 3 records, but not 4, on both \n and \r\n systems
my $o = tie @a, 'Tie::File', $file, memory => $MAX, autodefer => 0;
print $o ? "ok $N\n" : "not ok $N\n";
$N++;
# (3-5) Let's see if data was properly expired from the cache
my @z = @a; # force cache to contain all ten records
# It should now contain only the *last* three records, 7, 8, and 9
{
my $x = "7 8 9";
my $a = join " ", sort $o->{cache}->ckeys;
if ($a eq $x) { print "ok $N\n" }
else { print "not ok $N # cache keys were <$a>; expected <$x>\n" }
$N++;
}
check();
# Here we redo *all* the splice tests, with populate()
# calls before each one, to make sure that splice() does not botch the cache.
# (6-25) splicing at the beginning
splice(@a, 0, 0, "rec4");
check();
splice(@a, 0, 1, "rec5"); # same length
check();
splice(@a, 0, 1, "record5"); # longer
check();
splice(@a, 0, 1, "r5"); # shorter
check();
splice(@a, 0, 1); # removal
check();
splice(@a, 0, 0); # no-op
check();
splice(@a, 0, 0, 'r7', 'rec8'); # insert more than one
check();
splice(@a, 0, 2, 'rec7', 'record8', 'rec9'); # insert more than delete
check();
splice(@a, 0, 3, 'record9', 'rec10'); # delete more than insert
check();
splice(@a, 0, 2); # delete more than one
check();
# (26-45) splicing in the middle
splice(@a, 1, 0, "rec4");
check();
splice(@a, 1, 1, "rec5"); # same length
check();
splice(@a, 1, 1, "record5"); # longer
check();
splice(@a, 1, 1, "r5"); # shorter
check();
splice(@a, 1, 1); # removal
check();
splice(@a, 1, 0); # no-op
check();
splice(@a, 1, 0, 'r7', 'rec8'); # insert more than one
check();
splice(@a, 1, 2, 'rec7', 'record8', 'rec9'); # insert more than delete
check();
splice(@a, 1, 3, 'record9', 'rec10'); # delete more than insert
check();
splice(@a, 1, 2); # delete more than one
check();
# (46-65) splicing at the end
splice(@a, 3, 0, "rec4");
check();
splice(@a, 3, 1, "rec5"); # same length
check();
splice(@a, 3, 1, "record5"); # longer
check();
splice(@a, 3, 1, "r5"); # shorter
check();
splice(@a, 3, 1); # removal
check();
splice(@a, 3, 0); # no-op
check();
splice(@a, 3, 0, 'r7', 'rec8'); # insert more than one
check();
splice(@a, 3, 2, 'rec7', 'record8', 'rec9'); # insert more than delete
check();
splice(@a, 3, 3, 'record9', 'rec10'); # delete more than insert
check();
splice(@a, 3, 2); # delete more than one
check();
# (66-85) splicing with negative subscript
splice(@a, -1, 0, "rec4");
check();
splice(@a, -1, 1, "rec5"); # same length
check();
splice(@a, -1, 1, "record5"); # longer
check();
splice(@a, -1, 1, "r5"); # shorter
check();
splice(@a, -1, 1); # removal
check();
splice(@a, -1, 0); # no-op
check();
splice(@a, -1, 0, 'r7', 'rec8'); # insert more than one
check();
splice(@a, -1, 2, 'rec7', 'record8', 'rec9'); # insert more than delete
check();
splice(@a, -3, 3, 'record9', 'rec10'); # delete more than insert
check();
splice(@a, -4, 3); # delete more than one
check();
# (86-87) scrub it all out
splice(@a, 0, 3);
check();
# (88-89) put some back in
splice(@a, 0, 0, "rec0", "rec1");
check();
# (90-91) what if we remove too many records?
splice(@a, 0, 17);
check();
# (92-95) In the past, splicing past the end was not correctly detected
# (1.14)
splice(@a, 89, 3);
check();
splice(@a, @a, 3);
check();
# (96-99) Also we did not emulate splice's freaky behavior when inserting
# past the end of the array (1.14)
splice(@a, 89, 0, "I", "like", "pie");
check();
splice(@a, 89, 0, "pie pie pie");
check();
# (100-105) Test default arguments
splice @a, 0, 0, (0..11);
check();
splice @a, 4;
check();
splice @a;
check();
# (106-111) One last set of tests. I don't know what state the cache
# is in now. But if I read any three records, those three records are
# what should be in the cache, and nothing else.
@a = "record0" .. "record9";
check(); # In 0.18 #107 fails here--STORE was not flushing the cache when
# replacing an old cached record with a longer one
for (5, 6, 1) { my $z = $a[$_] }
{
my $x = "5 6 1";
my $a = join " ", $o->{cache}->_produce_lru;
if ($a eq $x) { print "ok $N\n" }
else { print "not ok $N # LRU was <$a>; expected <$x>\n" }
$N++;
$x = "1 5 6";
$a = join " ", sort $o->{cache}->ckeys;
if ($a eq $x) { print "ok $N\n" }
else { print "not ok $N # cache keys were <$a>; expected <$x>\n" }
$N++;
}
check();
sub init_file {
my $data = shift;
open F, '>', $file or die $!;
binmode F;
print F $data;
close F;
}
sub check {
my $integrity = $o->_check_integrity($file, $ENV{INTEGRITY});
print $integrity ? "ok $N\n" : "not ok $N\n";
$N++;
my $b = $o->{cache}->bytes;
print $b <= $MAX
? "ok $N\n"
: "not ok $N # $b bytes cached, should be <= $MAX\n";
$N++;
}
sub ctrlfix {
for (@_) {
s/\n/\\n/g;
s/\r/\\r/g;
}
}
END {
undef $o;
untie @a;
1 while unlink $file;
}
|
