Searched defs:find (Results 1 - 11 of 11) sorted by relevance

/lucene-3.6.0/lucene/contrib/grouping/src/java/org/apache/lucene/search/grouping/
H A DSentinelIntSet.java77 public int find(int key) { method in class:SentinelIntSet
93 return find(key) >= 0;
97 int s = find(key);
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/util/collections/
H A DIntHashSet.java281 return find(value) != 0;
290 protected int find(int key) { method in class:IntHashSet
308 // If we got this far, it could only mean we did not find the key we
315 * Some methods use the baseHashIndex. If those call {@link #find()} there's
340 // If we got this far, it could only mean we did not find the key we
416 int index = find(value);
H A DArrayHashMap.java275 return find(key) != 0;
290 protected int find(K key) { method in class:ArrayHashMap
308 // If we got this far, it could only mean we did not find the key we
315 * use the baseHashIndex. If those call {@link #find()} there's no need to
337 // If we got thus far, it could only mean we did not find the key we
345 return (V) values[find(key)];
408 int index = find(key);
435 * @param key used to find the value to remove
H A DFloatToObjectMap.java317 return find(key) != 0;
322 * This method iterates over the collection, trying to find an equal object.
345 protected int find(float key) { method in class:FloatToObjectMap
363 // If we got this far, it could only mean we did not find the key we
370 * Some methods use the baseHashIndex. If those call {@link #find()} there's
395 // If we got this far, it could only mean we did not find the key we
410 return (T) values[find(key)];
481 int index = find(key);
508 * @param key used to find the value to remove
H A DIntToDoubleMap.java319 return find(key) != 0;
324 * This method iterates over the collection, trying to find an equal object.
346 protected int find(int key) { method in class:IntToDoubleMap
364 // If we got this far, it could only mean we did not find the key we
371 * Some methods use the baseHashIndex. If those call {@link #find()} there's
396 // If we got this far, it could only mean we did not find the key we
410 return values[find(key)];
479 int index = find(key);
506 * @param key used to find the value to remove
H A DIntToIntMap.java316 return find(key) != 0;
321 * This method iterates over the collection, trying to find an equal object.
343 protected int find(int key) { method in class:IntToIntMap
361 // If we got this far, it could only mean we did not find the key we
368 * Some methods use the baseHashIndex. If those call {@link #find()} there's
393 // If we got this far, it could only mean we did not find the key we
407 return values[find(key)];
476 int index = find(key);
503 * @param key used to find the value to remove
H A DIntToObjectMap.java317 return find(key) != 0;
322 * This method iterates over the collection, trying to find an equal object.
345 protected int find(int key) { method in class:IntToObjectMap
363 // If we got this far, it could only mean we did not find the key we
370 * Some methods use the baseHashIndex. If those call {@link #find()} there's
395 // If we got this far, it could only mean we did not find the key we
410 return (T) values[find(key)];
481 int index = find(key);
508 * @param key used to find the value to remove
H A DObjectToFloatMap.java320 return find(key) != 0;
325 * This method iterates over the collection, trying to find an equal object.
347 protected int find(K key) { method in class:ObjectToFloatMap
365 // If we got this far, it could only mean we did not find the key we
372 * Some methods use the baseHashIndex. If those call {@link #find()} there's
397 // If we got this far, it could only mean we did not find the key we
411 return values[find(key)];
481 int index = find(key);
508 * @param key used to find the value to remove
H A DObjectToIntMap.java320 return find(key) != 0;
325 * This method iterates over the collection, trying to find an equal object.
347 protected int find(K key) { method in class:ObjectToIntMap
365 // If we got this far, it could only mean we did not find the key we
372 * Some methods use the baseHashIndex. If those call {@link #find()} there's
397 // If we got this far, it could only mean we did not find the key we
411 return values[find(key)];
480 int index = find(key);
507 * @param key used to find the value to remove
/lucene-3.6.0/lucene/contrib/benchmark/src/java/org/apache/lucene/benchmark/byTask/feeds/
H A DDirContentSource.java94 void find() { method in class:DirContentSource.Iterator
118 find();
142 find();
/lucene-3.6.0/lucene/contrib/analyzers/common/src/java/org/apache/lucene/analysis/compound/hyphenation/
H A DTernaryTree.java286 public int find(String key) { method in class:TernaryTree
292 return find(strkey, 0);
295 public int find(char[] key, int start) { method in class:TernaryTree
327 return (find(key) >= 0);
413 * tree is traversed to find the key substrings actually used. In addition,
440 k = map.find(kv.getArray(), lo[p]);
591 * traverse the tree to find next key
659 System.out.println((char) tt.find("Car"));
660 System.out.println((char) tt.find("Carlos"));
661 System.out.println((char) tt.find("alt
[all...]

Completed in 63 milliseconds