Lines Matching defs:nkey
64 int nkey; /* The current number of members in the table */
106 kt->nkey = 0;
318 (kt->nkey - first - 1) * sizeof(kt->table[0]));
319 kt->nkey--;
350 if(kt->nkey + 1 > kt->size) {
359 if(last < kt->nkey) {
361 (kt->nkey - last) * sizeof(kt->table[0]));
376 kt->nkey++;
419 top = kt->nkey - 1;
444 if(*last < kt->nkey && kt->table[*last].nc > nc &&
447 while(*last+1 < kt->nkey && kt->table[*last+1].nc > nc &&
802 for(oldkey=0; oldkey<kt->nkey; oldkey++)
808 for(oldkey=0; oldkey<kt->nkey; oldkey++) {
821 kt->nkey = newkey;