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

📄 tread2.c

📁 早期freebsd实现
💻 C
字号:
/*- * Copyright (c) 1991, 1993 *	The Regents of the University of California.  All rights reserved. * * This code is derived from software contributed to Berkeley by * Margo Seltzer. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright *    notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright *    notice, this list of conditions and the following disclaimer in the *    documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software *    must display the following acknowledgement: *	This product includes software developed by the University of *	California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors *    may be used to endorse or promote products derived from this software *    without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */#ifndef lintstatic char copyright[] ="@(#) Copyright (c) 1991, 1993\n\	The Regents of the University of California.  All rights reserved.\n";#endif /* not lint */#ifndef lintstatic char sccsid[] = "@(#)tread2.c	8.1 (Berkeley) 6/4/93";#endif /* not lint */#include <sys/types.h>#include <sys/file.h>#include <stdio.h>#include <db.h>#define INITIAL	25000#define MAXWORDS    25000	       /* # of elements in search table */typedef struct {		       /* info to be stored */	int num, siz;} info;char	wp1[8192];char	wp2[8192];main(argc, argv)char **argv;{	DBT item, key, res;	DB	*dbp;	HASHINFO ctl;	int	stat;	int i = 0;	ctl.nelem = INITIAL;	ctl.hash = NULL;	ctl.bsize = 64;	ctl.ffactor = 1;	ctl.cachesize = atoi(*argv++);	ctl.lorder = 0;	if (!(dbp = dbopen( "hashtest", O_RDONLY, 0400, DB_HASH, &ctl))) {		/* create table */		fprintf(stderr, "cannot open: hash table\n" );		exit(1);	}	key.data = wp1;	item.data = wp2;	while ( fgets(wp1, 8192, stdin) &&		fgets(wp2, 8192, stdin) &&		i++ < MAXWORDS) {/** put info in structure, and structure in the item*/		key.size = strlen(wp1);		item.size = strlen(wp2);		stat = (dbp->get)(dbp, &key, &res,0);		if (stat < 0) {		    fprintf ( stderr, "Error retrieving %s\n", key.data );		    exit(1);		} else if ( stat > 0 ) {		    fprintf ( stderr, "%s not found\n", key.data );		    exit(1);		}	}	(dbp->close)(dbp);	exit(0);}

⌨️ 快捷键说明

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