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
|
#!/usr/bin/perl
#
# This is a program whose output can be piped to the test drivers for
# hash.c and dict.c. It inserts a bunch of data and then deletes it all.
#
# The $modulus should be a prime number. This ensures that the $modulus - 1
# generated keys are all distinct. The $factor_i and $factor_d values need not
# be prime, but it should not be a multiple of $modulus (including zero),
# otherwise a sequence of duplicate keys will be generated: choose numbers
# in the range [1, $modulus - 1]. Choosing 1 means that
# insertions (or deletions) will take place in order.
# The purpose of using the prime modulus number is to generate a repeatable
# sequence of unique keys that is (possibly) not in sorted order.
#
# $Id: blast.pl,v 1.1.1.1 2008-10-21 09:10:13 cizzo Exp $
# $Name: not supported by cvs2svn $
#
# $modulus = 200003;
# $factor_i = 100;
# $factor_d = 301;
$modulus = 6113;
$factor_i = 1669;
$factor_d = 2036;
for ($i = 1; $i < $modulus; $i++) {
printf("a %d %d\n", ($i * $factor_i) % $modulus, $i);
}
for ($i = 1; $i < $modulus; $i++) {
printf("d %d\n", ($i * $factor_d) % $modulus);
}
print "t\nq\n"
|
