/*
 * @DEC_COPYRIGHT@
 */
/*
 * HISTORY
 * $Log:	psearch.h,v $
 * Revision 4.2.2.2  91/12/05  14:13:00  Jim_McHale
 * 	"Integrate with AG pool"
 * 
 * Revision 4.2.1.2  91/11/22  21:06:48  Jim_McHale
 * 	Merge with mips 3.0
 * 
 * Revision 4.2  91/09/20  05:12:59  devbld
 * 	Adding ODE Headers
 * 
 * $EndLog$
 */
/*
 *       @(#)$RCSfile: psearch.h,v $ $Revision: 4.2.2.2 $ (DEC) $Date: 91/12/05 14:13:00 $
 */
/*
 * |-----------------------------------------------------------|
 * | Copyright (c) 1991, 1990 MIPS Computer Systems, Inc.      |
 * | All Rights Reserved                                       |
 * |-----------------------------------------------------------|
 * |          Restricted Rights Legend                         |
 * | Use, duplication, or disclosure by the Government is      |
 * | subject to restrictions as set forth in                   |
 * | subparagraph (c)(1)(ii) of the Rights in Technical        |
 * | Data and Computer Software Clause of DFARS 252.227-7013.  |
 * |         MIPS Computer Systems, Inc.                       |
 * |         950 DeGuigne Avenue                               |
 * |         Sunnyvale, California 94088-3650, USA             |
 * |-----------------------------------------------------------|
 */
/* $Header: /usr/sde/osf1/rcs/src/./usr/include/cmplrs/psearch.h,v 4.2.2.2 91/12/05 14:13:00 Jim_McHale Exp $ */

/* Sort of like System V's bsearch, but not quite. "key" is a structure,
  "the_array" is an array of such structures, "elem_size" is the size in
  bytes of one element of the array, and "num_elems" is the number of
  elements in the array. Returns pointer to the element which matches
  "key", or pointer to the element which "key" ought to precede.
  Assumes array is already sorted. Both "prof" and "as1" need this. */
char *
psearch(/* char *key; char *the_array; int num_elems; int elem_size;
  procedure cmp */);
