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