Lines Matching defs:keys
51 private String keys[];
67 keys = null;
82 if (keys[i] == null)
86 if (k.equalsIgnoreCase(keys[i]))
95 if ((keys[i] == k) ||
96 (k != null && k.equalsIgnoreCase(keys[i])))
103 return keys[n];
126 if (keys[i] == null)
133 if (k.equalsIgnoreCase(keys[i]))
149 if (k.equalsIgnoreCase(keys[i])
159 if (k.equalsIgnoreCase(keys[i]) && (
165 keys[j] = keys[i];
195 if (key.equalsIgnoreCase (keys[index])) {
248 (excludeList[j].equalsIgnoreCase(keys[i]))) {
255 List<String> l = m.get(keys[i]);
258 m.put(keys[i], l);
292 if (keys[i] != null) {
293 p.print(keys[i] +
304 keys[nkeys] = k;
314 keys[i] = keys[i-1];
317 keys[0] = k;
334 keys[i] = k;
343 if (keys == null || nkeys >= keys.length) {
346 if (keys != null)
347 System.arraycopy(keys, 0, nk, 0, nkeys);
350 keys = nk;
365 while (keys[i] == null && i < nkeys) {
367 keys[j] = keys[j+1];
375 while (k.equalsIgnoreCase(keys[i]) && i < nkeys) {
377 keys[j] = keys[j+1];
392 if (k.equalsIgnoreCase(keys[i])) {
511 for (int i = 0; i < keys.length && i < nkeys; i++) {
512 result += "{"+keys[i]+": "+values[i]+"}";