Lines Matching defs:nkeys
53 private int nkeys;
69 nkeys = 0;
81 for (int i = nkeys; --i >= 0;)
85 for (int i = nkeys; --i >= 0;) {
94 for (int i = nkeys; --i >= 0;)
102 if (n < 0 || n >= nkeys) return null;
107 if (n < 0 || n >= nkeys) return null;
125 for (int i = nkeys; --i >= 0;)
132 for (int i = nkeys; --i >= 0;)
148 for (int i=0; i<nkeys; i++) {
158 for (int i=0; i<nkeys; i++) {
170 if (j != nkeys) {
171 nkeys = j;
194 while (index < nkeys) {
242 for (int i = nkeys; --i >= 0;) {
291 for (int i = 0; i < nkeys; i++)
304 keys[nkeys] = k;
305 values[nkeys] = v;
306 nkeys++;
313 for (int i = nkeys; i > 0; i--) {
319 nkeys++;
331 } else if (i >= nkeys) {
343 if (keys == null || nkeys >= keys.length) {
344 String[] nk = new String[nkeys + 4];
345 String[] nv = new String[nkeys + 4];
347 System.arraycopy(keys, 0, nk, 0, nkeys);
349 System.arraycopy(values, 0, nv, 0, nkeys);
364 for (int i = 0; i < nkeys; i++) {
365 while (keys[i] == null && i < nkeys) {
366 for(int j=i; j<nkeys-1; j++) {
370 nkeys--;
374 for (int i = 0; i < nkeys; i++) {
375 while (k.equalsIgnoreCase(keys[i]) && i < nkeys) {
376 for(int j=i; j<nkeys-1; j++) {
380 nkeys--;
391 for (int i = nkeys; --i >= 0;)
434 nkeys = 0;
510 String result = super.toString() + nkeys + " pairs: ";
511 for (int i = 0; i < keys.length && i < nkeys; i++) {