/lucene-3.6.0/lucene/contrib/spellchecker/src/test/org/apache/lucene/search/suggest/ |
H A D | PersistenceTest.java | 34 public final String[] keys = new String[] { field in class:PersistenceTest 66 // Add all input keys. 68 TermFreq[] keys = new TermFreq[this.keys.length]; 69 for (int i = 0; i < keys.length; i++) 70 keys[i] = new TermFreq(this.keys[i], i); 71 lookup.build(new TermFreqArrayIterator(keys)); 83 for (TermFreq k : keys) {
|
/lucene-3.6.0/lucene/contrib/analyzers/stempel/src/test/org/egothor/stemmer/ |
H A D | TestStemmer.java | 65 String keys[] = {"a", "ba", "bb", "c"}; 68 for (int i = 0; i < keys.length; i++) { 69 t.add(keys[i], vals[i]); 75 assertTrieContents(t, keys, vals); 81 String keys[] = {"a", "ba", "bb", "c"}; 84 for (int i = 0; i < keys.length; i++) { 85 t.add(keys[i], vals[i]); 88 assertTrieContents(t, keys, vals); 94 String keys[] = {"a", "ba", "bb", "c"}; 97 for (int i = 0; i < keys 151 assertTrieContents(Trie trie, String keys[], String vals[]) argument [all...] |
/lucene-3.6.0/lucene/contrib/grouping/src/java/org/apache/lucene/search/grouping/ |
H A D | SentinelIntSet.java | 28 public int[] keys; field in class:SentinelIntSet 46 keys = new int[tsize]; 52 Arrays.fill(keys, emptyVal); 66 int s = h & (keys.length-1); 67 if (keys[s] == key || keys[s]== emptyVal) return s; 71 s = (s + increment) & (keys.length-1); 72 } while (keys[s] != key && keys[s] != emptyVal); 80 int s = h & (keys [all...] |
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/util/collections/ |
H A D | IntHashSet.java | 29 // TODO (Facet): This is wasteful as the "values" are actually the "keys" and 89 IntHashSet.this.remove(keys[lastIndex]); 95 * Implements an IntIterator, used for iteration over the map's keys. 107 return keys[iterator.next()]; 146 * This array holds the unique keys 148 int[] keys; field in class:IntHashSet 190 this.keys = new int[arrayLength]; 228 keys[objectIndex] = key; 300 if (keys[localIndex] == key) { 331 if (keys[inde [all...] |
H A D | ArrayHashMap.java | 30 * The pre allocated arrays (for keys, values) are at length of capacity + 1, 91 ArrayHashMap.this.remove((K) keys[lastIndex]); 96 /** Implements an Iterator, used for iteration over the map's keys. */ 108 return (K) keys[iterator.next()]; 162 /** Holds the unique keys. */ 163 Object[] keys; field in class:ArrayHashMap 203 keys = new Object[arrayLength]; 235 keys[objectIndex] = key; 300 if (keys[localIndex].equals(key)) { 328 if (keys[inde [all...] |
H A D | FloatToObjectMap.java | 32 * The pre allocated arrays (for keys, values) are at length of capacity + 1, 98 FloatToObjectMap.this.remove(keys[lastIndex]); 104 * Implements an IntIterator, used for iteration over the map's keys. 116 return keys[iterator.next()]; 177 * This array holds the unique keys 179 float[] keys; field in class:FloatToObjectMap 227 this.keys = new float[arrayLength]; 266 keys[objectIndex] = key; 355 if (keys[localIndex] == key) { 386 if (keys[inde [all...] |
H A D | IntToDoubleMap.java | 29 * The pre allocated arrays (for keys, values) are at length of capacity + 1, 97 IntToDoubleMap.this.remove(keys[lastIndex]); 103 * Implements an IntIterator, used for iteration over the map's keys. 115 return keys[iterator.next()]; 175 * This array holds the unique keys 177 int[] keys; field in class:IntToDoubleMap 225 this.keys = new int[arrayLength]; 266 keys[objectIndex] = key; 356 if (keys[localIndex] == key) { 387 if (keys[inde [all...] |
H A D | IntToIntMap.java | 29 * The pre allocated arrays (for keys, values) are at length of capacity + 1, 96 IntToIntMap.this.remove(keys[lastIndex]); 102 * Implements an IntIterator, used for iteration over the map's keys. 114 return keys[iterator.next()]; 173 * This array holds the unique keys 175 int[] keys; field in class:IntToIntMap 223 this.keys = new int[arrayLength]; 264 keys[objectIndex] = key; 353 if (keys[localIndex] == key) { 384 if (keys[inde [all...] |
H A D | IntToObjectMap.java | 31 * The pre allocated arrays (for keys, values) are at length of capacity + 1, 97 IntToObjectMap.this.remove(keys[lastIndex]); 103 * Implements an IntIterator, used for iteration over the map's keys. 115 return keys[iterator.next()]; 176 * This array holds the unique keys 178 int[] keys; field in class:IntToObjectMap 226 this.keys = new int[arrayLength]; 265 keys[objectIndex] = key; 355 if (keys[localIndex] == key) { 386 if (keys[inde [all...] |
H A D | ObjectToFloatMap.java | 31 * The pre allocated arrays (for keys, values) are at length of capacity + 1, 98 ObjectToFloatMap.this.remove((K) keys[lastIndex]); 104 * Implements an IntIterator, used for iteration over the map's keys. 117 return (K) keys[iterator.next()]; 177 * This array holds the unique keys 179 Object[] keys; field in class:ObjectToFloatMap 227 this.keys = new Object[arrayLength]; 266 keys[objectIndex] = key; 357 if (keys[localIndex].equals(key)) { 388 if (keys[inde [all...] |
H A D | ObjectToIntMap.java | 31 * The pre allocated arrays (for keys, values) are at length of capacity + 1, 98 ObjectToIntMap.this.remove((K) keys[lastIndex]); 104 * Implements an IntIterator, used for iteration over the map's keys. 117 return (K) keys[iterator.next()]; 177 * This array holds the unique keys 179 Object[] keys; field in class:ObjectToIntMap 227 this.keys = new Object[arrayLength]; 266 keys[objectIndex] = key; 357 if (keys[localIndex].equals(key)) { 388 if (keys[inde [all...] |
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/search/ |
H A D | TestExplanations.java | 141 public ItemizedFilter(String keyField, int [] keys) { argument 142 super(keyField, int2str(keys)); 144 public ItemizedFilter(int [] keys) { argument 145 super(KEY, int2str(keys));
|
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/search/ |
H A D | TestExplanations.java | 141 public ItemizedFilter(String keyField, int [] keys) { argument 142 super(keyField, int2str(keys)); 144 public ItemizedFilter(int [] keys) { argument 145 super(KEY, int2str(keys));
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/analysis/ |
H A D | CharArrayMap.java | 36 * by char[] keys without the necessity of converting 59 char[][] keys; // package private because used in CharArraySet's non Set-conform CharArraySetIterator field in class:CharArrayMap 80 keys = new char[size][]; 105 this.keys = toCopy.keys; 117 Arrays.fill(keys, null); 124 return keys[getSlot(text, off, len)] != null; 129 return keys[getSlot(cs)] != null; 163 int pos = code & (keys.length-1); 164 char[] text2 = keys[po [all...] |
/lucene-3.6.0/lucene/contrib/analyzers/common/src/java/org/apache/lucene/analysis/compound/hyphenation/ |
H A D | TernaryTree.java | 36 * retrieval of all keys within a given distance from the target, etc. The 45 * requires from 5000 to 15000 hyphenation patterns which will be keys in this 57 * All said, this is a map with strings as keys and char as value. Pretty 109 * This vector holds the trailing of the keys when the branch is compressed. 140 * keys. 368 * upper halves, and so on in order to get a balanced tree. The array of keys 456 public Enumeration<String> keys() { method in class:TernaryTree 638 System.out.println("Number of keys = " + Integer.toString(length)); 646 * System.out.println("Keys:"); for(Enumeration enum = keys();
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/ |
H A D | RamUsageEstimator.java | 605 * An identity hash set implemented using open addressing. No null keys are allowed. 623 public Object[] keys; field in class:RamUsageEstimator.IdentityHashSet 671 * Adds a reference to the set. Null keys are not allowed. 674 assert e != null : "Null keys not allowed."; 678 final int mask = keys.length - 1; 681 while ((existing = keys[slot]) != null) { 688 keys[slot] = e; 696 final int mask = keys.length - 1; 699 while ((existing = keys[slot]) != null) { 727 * Expand the internal storage buffers (capacity) or rehash current keys an [all...] |