2 * CDE - Common Desktop Environment
4 * Copyright (c) 1993-2012, The Open Group. All rights reserved.
6 * These libraries and programs are free software; you can
7 * redistribute them and/or modify them under the terms of the GNU
8 * Lesser General Public License as published by the Free Software
9 * Foundation; either version 2 of the License, or (at your option)
12 * These libraries and programs are distributed in the hope that
13 * they will be useful, but WITHOUT ANY WARRANTY; without even the
14 * implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU Lesser General Public License for more
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with these librararies and programs; if not, write
20 * to the Free Software Foundation, Inc., 51 Franklin Street, Fifth
21 * Floor, Boston, MA 02110-1301 USA
24 * $XConsortium: bsearch.C /main/4 1996/10/04 09:33:19 drk $
26 * Copyright (c) 1992 HaL Computer Systems, Inc. All rights reserved.
27 * UNPUBLISHED -- rights reserved under the Copyright Laws of the United
28 * States. Use of a copyright notice is precautionary only and does not
29 * imply publication or disclosure.
31 * This software contains confidential information and trade secrets of HaL
32 * Computer Systems, Inc. Use, disclosure, or reproduction is prohibited
33 * without the prior express written permission of HaL Computer Systems, Inc.
35 * RESTRICTED RIGHTS LEGEND
36 * Use, duplication, or disclosure by the Government is subject to
37 * restrictions as set forth in subparagraph (c)(l)(ii) of the Rights in
38 * Technical Data and Computer Software clause at DFARS 252.227-7013.
39 * HaL Computer Systems, Inc.
40 * 1315 Dell Avenue, Campbell, CA 95008
50 #include "dynhash/bucket.h"
54 int bsearch(char*, char*, int, int, int(*)());
58 int compare(const void* vd1, const void* vd2)
60 data_t* d1 = (data_t*)vd1;
61 data_t* d2 = (data_t*)vd2;
63 if ( d1 -> key < d2 -> key )
66 if ( d1 -> key == d2 -> key )
74 main( int argc, char** argv )
76 data_t *x = new data_t[TBSIZE];
79 for ( int i=0; i<TBSIZE; i++ ) {
80 x[i].key = rand() % TBSIZE;
87 for ( i=0; i<TBSIZE; i++ )
91 struct timeval sec1, sec2;
92 struct timezone tz1, tz2;
94 gettimeofday(&sec1, &tz1);
95 //debug(cerr, sec1.tv_sec);
96 //debug(cerr, sec1.tv_usec);
98 qsort((char*)x, TBSIZE, sizeof(data_t), compare);
100 for ( i=0; i<TBSIZE; i++ ) {
102 void * ok = bsearch((char*)(&key),
103 (char*)x, TBSIZE, sizeof(data_t), compare);
105 debug(cerr, "member test failed");
109 gettimeofday(&sec2, &tz2);
110 //debug(cerr, sec2.tv_sec);
111 //debug(cerr, sec2.tv_usec);
113 if ( sec1.tv_usec > sec2.tv_usec ) {
114 printf("difference = %ld %6ld\n",
115 (long)sec2.tv_sec-sec1.tv_sec-1,
116 (long)1000000+sec2.tv_usec-sec1.tv_usec
119 printf("difference = %ld %6ld\n",
120 (long)sec2.tv_sec-sec1.tv_sec,
121 (long)sec2.tv_usec-sec1.tv_usec