hunt2.c revision 7c478bd95313f5f23a4c958a745db2134aa03244
/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
/*
* Copyright (c) 1980 Regents of the University of California.
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*/
/*
* Copyright (c) 1983, 1984 1985, 1986, 1987, 1988, Sun Microsystems, Inc.
* All Rights Reserved.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
#include "refer..c"
static int *coord = 0;
int hh[50];
extern int prfreqs;
union ptr {
unsigned *a;
long *b;
};
long *hpt;
char *qitem[];
unsigned *mptr;
{
long k;
int *prevcoord;
long lp;
long getl();
extern int iflong;
if (iflong) {
}
else {
}
# if D1
fprintf(stderr, "and frequencies are %d %d %d %d %d\n",hfreq[0],hfreq[1],hfreq[2],hfreq[3],hfreq[4]);
# endif
if (coord==0)
if (colevel>0)
{
if (iflong)
else
}
else
{
}
# if D1
# endif
for(i=0; i<nitem; i++)
{
# if D1
# endif
}
# if D1
# endif
if (prfreqs)
for(i=0; i<nitem; i++)
/* if possible, sort query into decreasing frequency of hashes */
if (hfrflg)
# if D1
for(i=0; i<nitem; i++)
# endif
# if D1
# endif
for(i=0; i<lmaster; i++)
{
if (iflong)
else
coord[i]=1;
# if D2
if (iflong)
else
# endif
if (iflong)
{
if (master.b[i] == -1L) break;
}
else
{
if (master.a[i] == -1) break;
}
}
nf= i;
{
# ifdef D1
# endif
if (colevel>0)
{
for(j=0; j<nf; j++)
{
if (iflong)
else
}
}
# if D1
# endif
g=j=0;
while (1)
{
if (iflong)
else
if (k== -1) break;
# if D2
# endif
# if D3
if (iflong)
else
# endif
{
# if D3
if (iflong)
else
# endif
j++;
else
{
if (iflong)
else
# if D1
if (iflong)
fprintf(stderr, " not skip g %d doc %d coord %d note %d\n",g,master.b[g-1], coord[g-1],master.b[j-1]);
else
# endif
continue;
}
}
{
if (iflong)
master.b[g]=k;
else
master.a[g]=k;
# if D1
if (iflong)
else
# endif
}
else
{
if (iflong)
master.b[g]=k;
else
master.a[g]=k;
coord[g++] = 1;
}
}
# if D1
# endif
if (colevel>0)
for ( ; j<nf; j++)
{
if (iflong)
else
# if D3
if(iflong)
else
# endif
}
nf = g;
}
if (colevel>0)
{
best=0;
for(j=0; j<nf; j++)
# if D1
# endif
for(g=j=0; j<nf; j++)
{
if (iflong)
else
}
nf=g;
# if D1
# endif
}
# ifdef D1
# endif
if (colevel)
{
}
# if D3
for(g=0;g<nf;g++)
if(iflong)
else
# endif
return(nf);
}
long
{
}
long ll;
FILE *f;
{
}
{
}
{
int t;
}