/lucene-3.6.0/solr/core/src/java/org/apache/solr/update/processor/ |
H A D | Lookup3Signature.java | 23 protected long hash; field in class:Lookup3Signature 30 hash = Hash.lookup3ycs64(content,0,content.length(),hash); 35 return new byte[]{(byte)(hash>>56),(byte)(hash>>48),(byte)(hash>>40),(byte)(hash>>32),(byte)(hash>>24),(byte)(hash>>16),(byte)(hash>> [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/ |
H A D | SimpleStringInterner.java | 31 final private int hash; field in class:SimpleStringInterner.Entry 33 private Entry(String str, int hash, Entry next) { argument 35 this.hash = hash; 44 * @param tableSize Size of the hash table, should be a power of two. 55 // In the future, it may be worth augmenting the string hash 65 if (e.hash == h && (e.str == s || e.str.compareTo(s)==0)) { 66 // if (e.str == s || (e.hash == h && e.str.compareTo(s)==0)) {
|
H A D | WeakIdentityMap.java | 109 private final int hash; field in class:WeakIdentityMap.IdentityWeakReference 113 hash = System.identityHashCode(obj); 117 return hash;
|
/lucene-3.6.0/solr/core/src/java/org/apache/solr/search/function/ |
H A D | LiteralValueSource.java | 73 public static final int hash = LiteralValueSource.class.hashCode(); field in class:LiteralValueSource 76 return hash + string.hashCode();
|
/lucene-3.6.0/lucene/contrib/grouping/src/java/org/apache/lucene/search/grouping/ |
H A D | SentinelIntSet.java | 56 public int hash(int key) { method in class:SentinelIntSet 65 int h = hash(key); 79 int h = hash(key);
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/fst/ |
H A D | NodeHash.java | 65 // hash code for an unfrozen node. This must be identical 67 private int hash(Builder.UnCompiledNode<T> node) { method in class:NodeHash 69 //System.out.println("hash unfrozen"); 87 // hash code for a frozen node 88 private int hash(int node) throws IOException { method in class:NodeHash 91 //System.out.println("hash frozen node=" + node); 113 // System.out.println("hash: add count=" + count + " vs " + table.length); 115 final int h = hash(nodeIn); 124 assert hash(node) == h : "frozenHash=" + hash(nod [all...] |
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/util/ |
H A D | TestBytesRefHash.java | 38 BytesRefHash hash; field in class:TestBytesRefHash 48 hash = newHash(pool); 77 int count = hash.size(); 78 int key = hash.add(ref); 80 assertEquals(hash.size(), count); 82 assertEquals(hash.size(), count + 1); 84 hash.clear(); 85 assertEquals(0, hash.size()); 86 hash.reinit(); 111 int count = hash 332 assertAllIn(Set<String> strings, BytesRefHash hash) argument [all...] |
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/facet/taxonomy/writercache/cl2o/ |
H A D | CollisionMap.java | 43 int hash; field in class:CollisionMap.Entry 49 this.hash = h; 93 int hash = e.hash; 94 int i = indexFor(hash, newCapacity); 107 public int get(CategoryPath label, int hash) { argument 108 int bucketIndex = indexFor(hash, this.capacity); 111 while (e != null && !(hash == e.hash && label.equalsToSerialized(this.labelRepository, e.offset))) { 121 public int get(CategoryPath label, int prefixLen, int hash) { argument 135 addLabel(CategoryPath label, int hash, int cid) argument 155 addLabel(CategoryPath label, int prefixLen, int hash, int cid) argument 180 addLabelOffset(int hash, int offset, int cid) argument 185 addEntry(int offset, int cid, int hash, int bucketIndex) argument [all...] |
H A D | CompactLabelToOrdinal.java | 121 int hash = CompactLabelToOrdinal.stringHashCode(label); 123 if (addLabel(this.hashArrays[i], label, hash, ordinal)) { 128 int prevVal = this.collisionMap.addLabel(label, hash, ordinal); 141 int hash = CompactLabelToOrdinal.stringHashCode(label, prefixLen); 143 if (addLabel(this.hashArrays[i], label, prefixLen, hash, ordinal)) { 148 int prevVal = this.collisionMap.addLabel(label, prefixLen, hash, ordinal); 161 int hash = CompactLabelToOrdinal.stringHashCode(label); 163 int ord = getOrdinal(this.hashArrays[i], label, hash); 169 return this.collisionMap.get(label, hash); 178 int hash 242 addLabel(HashArray a, CategoryPath label, int hash, int ordinal) argument 262 addLabel(HashArray a, CategoryPath label, int prefixLen, int hash, int ordinal) argument 282 addLabelOffset(int hash, int cid, int knownOffset) argument 297 addLabelOffsetToHashArray(HashArray a, int hash, int ordinal, int knownOffset) argument 312 getOrdinal(HashArray a, CategoryPath label, int hash) argument 330 getOrdinal(HashArray a, CategoryPath label, int prefixLen, int hash) argument [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/ |
H A D | TermQuery.java | 44 private final Set<Integer> hash; field in class:TermQuery.TermWeight 50 hash = new HashSet<Integer>(); 59 hash.add(r.hashCode()); 67 hash = null; 98 if (hash != null && reader.getSequentialSubReaders() == null && !hash.contains(reader.hashCode())) { 230 /** Returns a hash code value for this object.*/
|
/lucene-3.6.0/solr/core/src/java/org/apache/solr/schema/ |
H A D | RandomSortField.java | 67 private static int hash(int key) { method in class:RandomSortField 78 * Given a field name and an IndexReader, get a random hash seed. 131 return bottomVal - hash(doc+seed); 136 values[slot] = hash(doc+seed); 172 return (float)hash(doc+seed); 177 return hash(doc+seed); 182 return (long)hash(doc+seed); 187 return (double)hash(doc+seed); 192 return Integer.toString(hash(doc+seed));
|