Cross Reference: /external/smack/src/org/jivesoftware/smack/util/collections/AbstractHashedMap.java

Lines Matching defs:hashCode
191         int hashCode = hash((key == null) ? NULL : key);
192         HashEntry<K, V> entry = data[hashIndex(hashCode, data.length)]; // no local for hash index
194             if (entry.hashCode == hashCode && isEqualKey(key, entry.key)) {
228         int hashCode = hash((key == null) ? NULL : key);
229         HashEntry entry = data[hashIndex(hashCode, data.length)]; // no local for hash index
231             if (entry.hashCode == hashCode && isEqualKey(key, entry.getKey())) {
279         int hashCode = hash((key == null) ? NULL : key);
280         int index = hashIndex(hashCode, data.length);
283             if (entry.hashCode == hashCode && isEqualKey(key, entry.getKey())) {
290         addMapping(index, hashCode, key, value);
324         int hashCode = hash((key == null) ? NULL : key);
325         int index = hashIndex(hashCode, data.length);
329             if (entry.hashCode == hashCode && isEqualKey(key, entry.getKey())) {
363         int h = key.hashCode();
398      * Gets the index into the data storage for the hashCode specified.
399      * This implementation uses the least significant bits of the hashCode.
402      * @param hashCode the hash code to use
406     protected int hashIndex(int hashCode, int dataSize) {
407         return hashCode & (dataSize - 1);
422         int hashCode = hash((key == null) ? NULL : key);
423         HashEntry<K, V> entry = data[hashIndex(hashCode, data.length)]; // no local for hash index
425             if (entry.hashCode == hashCode && isEqualKey(key, entry.getKey())) {
455      * @param hashCode  the hash code of the key to add
459     protected void reuseEntry(HashEntry<K, V> entry, int hashIndex, int hashCode, K key, V value) {
461         entry.hashCode = hashCode;
476      * @param hashCode  the hash code of the key to add
480     protected void addMapping(int hashIndex, int hashCode, K key, V value) {
482         HashEntry<K, V> entry = createEntry(data[hashIndex], hashCode, key, value);
496      * @param hashCode the hash code to use
501     protected HashEntry<K, V> createEntry(HashEntry<K, V> next, int hashCode, K key, V value) {
502         return new HashEntry<K, V>(next, hashCode, key, value);
609                         int index = hashIndex(entry.hashCode, newCapacity);
670      * Gets the <code>hashCode</code> field from a <code>HashEntry</code>.
674      * @return the <code>hashCode</code> field of the entry
679         return entry.hashCode;
1022         protected int hashCode;
1032         protected HashEntry(HashEntry<K, V> next, int hashCode, K key, V value) {
1035             this.hashCode = hashCode;
1069         public int hashCode() {
1070             return (getKey() == null ? 0 : getKey().hashCode()) ^ (getValue() == null ? 0 : getValue().hashCode());
1297      * Gets the standard Map hashCode.
1301     public int hashCode() {
1305             total += it.next().hashCode();