/*- * Copyright (c) 1979 The Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms are permitted * provided that: (1) source distributions retain this entire copyright * notice and comment, and (2) distributions including binaries display * the following acknowledgement: ``This product includes software * developed by the University of California, Berkeley and its contributors'' * in the documentation or other materials provided with the distribution * and in all advertising materials mentioning features or use of this * software. 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 ``AS IS'' AND WITHOUT ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. */ #ifndef lint static char sccsid[] = "@(#)INCT.c 1.3 (Berkeley) 4/9/90"; #endif /* not lint */ #include "h00vars.h" bool INCT(element, paircnt, singcnt, data) register long element; /* element to find */ long paircnt; /* number of pairs to check */ long singcnt; /* number of singles to check */ long data; /* paircnt plus singcnt bounds */ { register long *dataptr = &data; register int cnt; for (cnt = 0; cnt < paircnt; cnt++) { if (element > *dataptr++) { dataptr++; continue; } if (element >= *dataptr++) { return TRUE; } } for (cnt = 0; cnt < singcnt; cnt++) { if (element == *dataptr++) { return TRUE; } } return FALSE; }