⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 blast.pl

📁 一些常用的数据结构库
💻 PL
字号:
#!/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.4 1999/09/20 21:57:10 kaz Exp $# $Name: kazlib_1_20 $## $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"

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -