Return to INCT.c CVS log

Up to [CSRG BSD Unix] / 43BSDReno / lib / libpc

Annotation of 43BSDReno/lib/libpc/INCT.c, revision 1.1.1.1

1.1       root        1: /*-
                      2:  * Copyright (c) 1979 The Regents of the University of California.
                      3:  * All rights reserved.
                      4:  *
                      5:  * Redistribution and use in source and binary forms are permitted
                      6:  * provided that: (1) source distributions retain this entire copyright
                      7:  * notice and comment, and (2) distributions including binaries display
                      8:  * the following acknowledgement:  ``This product includes software
                      9:  * developed by the University of California, Berkeley and its contributors''
                     10:  * in the documentation or other materials provided with the distribution
                     11:  * and in all advertising materials mentioning features or use of this
                     12:  * software. Neither the name of the University nor the names of its
                     13:  * contributors may be used to endorse or promote products derived
                     14:  * from this software without specific prior written permission.
                     15:  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
                     16:  * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
                     17:  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
                     18:  */
                     19: 
                     20: #ifndef lint
                     21: static char sccsid[] = "@(#)INCT.c     1.3 (Berkeley) 4/9/90";
                     22: #endif /* not lint */
                     23: 
                     24: #include "h00vars.h"
                     25: 
                     26: bool
                     27: INCT(element, paircnt, singcnt, data)
                     28: 
                     29:        register long   element;        /* element to find */
                     30:        long            paircnt;        /* number of pairs to check */
                     31:        long            singcnt;        /* number of singles to check */
                     32:        long            data;           /* paircnt plus singcnt bounds */
                     33: {
                     34:        register long   *dataptr = &data;
                     35:        register int    cnt;
                     36: 
                     37:        for (cnt = 0; cnt < paircnt; cnt++) {
                     38:                if (element > *dataptr++) {
                     39:                        dataptr++;
                     40:                        continue;
                     41:                }
                     42:                if (element >= *dataptr++) {
                     43:                        return TRUE;
                     44:                }
                     45:        }
                     46:        for (cnt = 0; cnt < singcnt; cnt++) {
                     47:                if (element == *dataptr++) {
                     48:                        return TRUE;
                     49:                }
                     50:        }
                     51:        return FALSE;
                     52: }

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.