Home | History | Annotate | Line # | Download | only in bigram
locate.bigram.c revision 1.3
      1  1.3  jtc /*	$NetBSD: locate.bigram.c,v 1.3 1994/12/22 06:17:40 jtc Exp $	*/
      2  1.3  jtc 
      3  1.1  cgd /*
      4  1.3  jtc  * Copyright (c) 1989, 1993
      5  1.3  jtc  *	The Regents of the University of California.  All rights reserved.
      6  1.1  cgd  *
      7  1.1  cgd  * This code is derived from software contributed to Berkeley by
      8  1.1  cgd  * James A. Woods.
      9  1.1  cgd  *
     10  1.1  cgd  * Redistribution and use in source and binary forms, with or without
     11  1.1  cgd  * modification, are permitted provided that the following conditions
     12  1.1  cgd  * are met:
     13  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
     14  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     15  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     16  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     17  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     18  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     19  1.1  cgd  *    must display the following acknowledgement:
     20  1.1  cgd  *	This product includes software developed by the University of
     21  1.1  cgd  *	California, Berkeley and its contributors.
     22  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     23  1.1  cgd  *    may be used to endorse or promote products derived from this software
     24  1.1  cgd  *    without specific prior written permission.
     25  1.1  cgd  *
     26  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     27  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     28  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     29  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     30  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     31  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     32  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     33  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     34  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     35  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     36  1.1  cgd  * SUCH DAMAGE.
     37  1.1  cgd  */
     38  1.1  cgd 
     39  1.1  cgd #ifndef lint
     40  1.3  jtc static char copyright[] =
     41  1.3  jtc "@(#) Copyright (c) 1989, 1993\n\
     42  1.3  jtc 	The Regents of the University of California.  All rights reserved.\n";
     43  1.1  cgd #endif /* not lint */
     44  1.1  cgd 
     45  1.1  cgd #ifndef lint
     46  1.3  jtc #if 0
     47  1.3  jtc static char sccsid[] = "@(#)locate.bigram.c	8.1 (Berkeley) 6/6/93";
     48  1.3  jtc #endif
     49  1.3  jtc static char rcsid[] = "$NetBSD: locate.bigram.c,v 1.3 1994/12/22 06:17:40 jtc Exp $";
     50  1.1  cgd #endif /* not lint */
     51  1.1  cgd 
     52  1.1  cgd /*
     53  1.1  cgd  *  bigram < text > bigrams
     54  1.1  cgd  *
     55  1.1  cgd  * List bigrams for 'updatedb' script.
     56  1.1  cgd  * Use 'code' to encode a file using this output.
     57  1.1  cgd  */
     58  1.1  cgd 
     59  1.1  cgd #include <stdio.h>
     60  1.1  cgd #include <sys/param.h>			/* for MAXPATHLEN */
     61  1.1  cgd 
     62  1.1  cgd char buf1[MAXPATHLEN] = " ";
     63  1.1  cgd char buf2[MAXPATHLEN];
     64  1.1  cgd 
     65  1.1  cgd main ( )
     66  1.1  cgd {
     67  1.1  cgd   	register char *cp;
     68  1.1  cgd 	register char *oldpath = buf1, *path = buf2;
     69  1.1  cgd 
     70  1.1  cgd      	while ( fgets ( path, sizeof(buf2), stdin ) != NULL ) {
     71  1.1  cgd 
     72  1.1  cgd 		/* skip longest common prefix */
     73  1.1  cgd 		for ( cp = path; *cp == *oldpath; cp++, oldpath++ )
     74  1.1  cgd 			if ( *oldpath == NULL )
     75  1.1  cgd 				break;
     76  1.1  cgd 		/*
     77  1.1  cgd 		 * output post-residue bigrams only
     78  1.1  cgd 		 */
     79  1.1  cgd 		while ( *cp != NULL && *(cp + 1) != NULL ) {
     80  1.1  cgd 			putchar ( *cp++ );
     81  1.1  cgd 			putchar ( *cp++ );
     82  1.1  cgd 			putchar ( '\n' );
     83  1.1  cgd 		}
     84  1.1  cgd 		if ( path == buf1 )		/* swap pointers */
     85  1.1  cgd 			path = buf2, oldpath = buf1;
     86  1.1  cgd 		else
     87  1.1  cgd 			path = buf1, oldpath = buf2;
     88  1.1  cgd    	}
     89  1.1  cgd }
     90