/openjdk10/jdk/make/src/classes/build/tools/generatenimbus/ |
H A D | ComponentColor.java | 76 int hash = 5; 77 hash = 61 * hash + (this.propertyName != null ? this.propertyName.hashCode() : 0); 78 hash = 61 * hash + (this.defaultColorVariableName != null ? this.defaultColorVariableName.hashCode() : 0); 79 hash = 61 * hash + Float.floatToIntBits(this.saturationOffset); 80 hash = 61 * hash + Float.floatToIntBits(this.brightnessOffset); 81 hash [all...] |
/openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xml/internal/dtm/ref/ |
H A D | ExtendedType.java | 33 private int hash; field in class:ExtendedType 37 * The hash code is calculated from the node type, namespace and local name. 48 this.hash = nodetype + namespace.hashCode() + localName.hashCode(); 53 * and a given hash code. 58 * @param hash The given hash code 60 public ExtendedType (int nodetype, String namespace, String localName, int hash) argument 65 this.hash = hash; 78 this.hash 86 redefine(int nodetype, String namespace, String localName, int hash) argument [all...] |
/openjdk10/corba/src/java.corba/share/classes/com/sun/corba/se/impl/util/ |
H A D | IdentityHashtableEntry.java | 39 int hash; field in class:IdentityHashtableEntry
|
/openjdk10/jdk/src/java.desktop/share/classes/javax/swing/plaf/nimbus/ |
H A D | ImageCache.java | 46 // Ordered Map keyed by args hash, ordered by most recent accessed entry. 111 PixelCountSoftReference ref = map.get(hash(config, w, h, args)); 112 // check reference has not been lost and the key truly matches, in case of false positive hash match 135 int hash = hash(config, w, h, args); 138 PixelCountSoftReference ref = map.get(hash); 146 map.remove(hash); 155 map.remove(ref.hash); 171 map.put(hash, new PixelCountSoftReference(image, referenceQueue, newPixelCount,hash, confi 179 private int hash(GraphicsConfiguration config, int w, int h, Object ... args) { method in class:ImageCache 192 private final int hash; field in class:ImageCache.PixelCountSoftReference 199 PixelCountSoftReference(Image referent, ReferenceQueue<? super Image> q, int pixelCount, int hash, GraphicsConfiguration config, int w, int h, Object[] args) argument [all...] |
/openjdk10/jaxws/src/java.xml.bind/share/classes/com/sun/xml/internal/bind/v2/util/ |
H A D | CollisionCheckStack.java | 101 int hash = hash(o); 102 boolean r = findDuplicate(o, hash); 103 next[size] = initialHash[hash]; 104 initialHash[hash] = size+1; 123 int hash = hash(o); 124 return findDuplicate(o, hash); 137 private int hash(Object o) { method in class:CollisionCheckStack 150 // pushed by nocheck. no need to update hash 166 findDuplicate(E o, int hash) argument [all...] |
/openjdk10/jaxws/src/jdk.xml.ws/share/classes/com/sun/tools/internal/ws/processor/modeler/annotation/ |
H A D | MemberInfo.java | 72 int hash = 5; 73 hash = 47 * hash + (this.paramType != null ? this.paramType.hashCode() : 0); 74 hash = 47 * hash + (this.paramName != null ? this.paramName.hashCode() : 0); 75 hash = 47 * hash + (this.jaxbAnnotations != null ? this.jaxbAnnotations.hashCode() : 0); 76 return hash;
|
/openjdk10/jdk/src/java.security.jgss/share/classes/sun/security/krb5/internal/rcache/ |
H A D | AuthTimeWithHash.java | 39 // The hash algorithm can be "HASH" or "SHA256". 63 final String hash; field in class:AuthTimeWithHash 69 int ctime, int cusec, String hashAlg, String hash) { 72 this.hash = hash; 85 return Objects.equals(hash, that.hash) 94 * Returns a hash code for this <code>AuthTimeWithHash</code> object. 98 return Objects.hash(hash); 68 AuthTimeWithHash(String client, String server, int ctime, int cusec, String hashAlg, String hash) argument [all...] |
/openjdk10/jaxws/src/jdk.xml.bind/share/classes/com/sun/xml/internal/dtdparser/ |
H A D | SimpleHashtable.java | 166 int hash = key.hashCode(); 167 int index = (hash & 0x7FFFFFFF) % tab.length; 169 if ((e.hash == hash) && (e.key == key)) 181 int hash = key.hashCode(); 182 int index = (hash & 0x7FFFFFFF) % tab.length; 184 if ((e.hash == hash) && e.key.equals(key)) 219 int index = (e.hash & 0x7FFFFFFF) % newCapacity; 242 int hash 273 int hash; field in class:SimpleHashtable.Entry 278 Entry(int hash, Object key, Object value, Entry next) argument [all...] |
/openjdk10/jdk/src/jdk.jlink/share/classes/jdk/tools/jlink/internal/ |
H A D | ImageLocationWriter.java | 108 int hash = seed; 111 hash = ImageStringsReader.unmaskedHashCode("/", hash); 112 hash = ImageStringsReader.unmaskedHashCode(getModule(), hash); 113 hash = ImageStringsReader.unmaskedHashCode("/", hash); 117 hash = ImageStringsReader.unmaskedHashCode(getParent(), hash); 118 hash [all...] |
/openjdk10/jdk/src/java.desktop/share/classes/com/sun/beans/util/ |
H A D | Cache.java | 111 int hash = hash(key); 115 V current = getEntryValue(key, hash, table[index(hash, table)]); 122 current = getEntryValue(key, hash, this.table[index(hash, this.table)]); 128 int index = index(hash, this.table); 129 this.table[index] = new CacheEntry<>(hash, key, value, this.table[index]); 162 int hash = hash(ke 216 private int hash(Object key) { method in class:Cache 237 index(int hash, Object[] table) argument 252 getEntryValue(K key, int hash, CacheEntry<K,V> entry) argument 322 private final int hash; field in class:Cache.CacheEntry 335 CacheEntry(int hash, K key, V value, CacheEntry<K,V> next) argument 350 matches(int hash, Object object) argument [all...] |
/openjdk10/hotspot/src/share/vm/utilities/ |
H A D | nativeCallStack.hpp | 80 // compare hash values 81 if (hash() != other.hash()) return false; 92 unsigned int hash() const;
|
/openjdk10/jdk/src/java.desktop/share/classes/java/beans/ |
H A D | WeakIdentityMap.java | 60 int hash = key.hashCode(); 64 int index = getIndex(table, hash); 66 if (entry.isMatched(key, hash)) { 73 index = getIndex(this.table, hash); 75 if (entry.isMatched(key, hash)) { 80 this.table[index] = new Entry<T>(key, hash, value, this.queue, this.table[index]); 114 int index = getIndex(this.table, entry.hash); 155 int index = getIndex(newTable, entry.hash); 170 private static int getIndex(Entry<?>[] table, int hash) { argument 171 return hash 175 private final int hash; field in class:WeakIdentityMap.Entry 179 Entry(Object key, int hash, T value, ReferenceQueue<Object> queue, Entry<T> next) argument 186 isMatched(Object key, int hash) argument [all...] |
/openjdk10/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/ |
H A D | InputBlockEdge.java | 76 int hash = from.hashCode(); 77 hash = 59 * hash + to.hashCode(); 78 return hash;
|
/openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/util/ |
H A D | ShadowedSymbolTable.java | 98 * by the <code>hash(char[],int,int)</code> method when called 101 * @param symbol The symbol to hash. 103 public int hash(String symbol) { method in class:ShadowedSymbolTable 104 return fSymbolTable.hash(symbol); 105 } // hash(String):int 110 * returned by the <code>hash(String)</code> method when called 118 public int hash(char[] buffer, int offset, int length) { method in class:ShadowedSymbolTable 119 return fSymbolTable.hash(buffer, offset, length); 120 } // hash(char[],int,int):int
|
H A D | XMLGrammarPoolImpl.java | 175 int hash = hashCode(desc); 176 int index = (hash & 0x7FFFFFFF) % fGrammars.length; 178 if (entry.hash == hash && equals(entry.desc, desc)) { 184 Entry entry = new Entry(hash, desc, grammar, fGrammars[index]); 200 int hash = hashCode(desc); 201 int index = (hash & 0x7FFFFFFF) % fGrammars.length; 203 if ((entry.hash == hash) && equals(entry.desc, desc)) { 222 int hash 320 public int hash; field in class:XMLGrammarPoolImpl.Entry 325 Entry(int hash, XMLGrammarDescription desc, Grammar grammar, Entry next) argument [all...] |
/openjdk10/jdk/src/java.rmi/share/classes/java/rmi/server/ |
H A D | Skeleton.java | 53 * @param hash stub/skeleton interface hash 59 void dispatch(Remote obj, RemoteCall theCall, int opnum, long hash) argument
|
/openjdk10/hotspot/src/share/vm/services/ |
H A D | allocationSite.hpp | 39 int hash() const { return _call_stack.hash(); } function in class:VALUE_OBJ_CLASS_SPEC
|
/openjdk10/jaxws/src/jdk.xml.bind/share/classes/com/sun/xml/internal/xsom/impl/ |
H A D | UName.java | 86 int hash = 7; 87 hash = 13 * hash + (this.nsUri != null ? this.nsUri.hashCode() : 0); 88 hash = 13 * hash + (this.localName != null ? this.localName.hashCode() : 0); 89 hash = 13 * hash + (this.qname != null ? this.qname.hashCode() : 0); 90 return hash;
|
/openjdk10/nashorn/test/script/basic/ |
H A D | JDK-8031715.js | 46 var hash = "Hashtable"; variable 48 print(ji[hash]);
|
/openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/jaxp/validation/ |
H A D | SoftReferenceGrammarPool.java | 163 int hash = hashCode(desc); 164 int index = (hash & 0x7FFFFFFF) % fGrammars.length; 166 if (entry.hash == hash && equals(entry.desc, desc)) { 174 Entry entry = new Entry(hash, index, desc, grammar, fGrammars[index], fReferenceQueue); 191 int hash = hashCode(desc); 192 int index = (hash & 0x7FFFFFFF) % fGrammars.length; 199 else if ((entry.hash == hash) && equals(entry.desc, desc)) { 219 int hash 389 public int hash; field in class:SoftReferenceGrammarPool.Entry 396 Entry(int hash, int bucket, XMLGrammarDescription desc, Grammar grammar, Entry next, ReferenceQueue queue) argument [all...] |
/openjdk10/hotspot/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/ |
H A D | LongHashMap.java | 41 private int hash; field in class:LongHashMap.Entry 46 Entry(int hash, long key, Object value, Entry next) { argument 47 this.hash = hash; 120 * Returns the hash code value for this map entry. The hash code 130 * @return the hash code value for this map entry. 136 return hash ^ (value==null ? 0 : value.hashCode()); 141 * The hash table data. 146 * The total number of mappings in the hash tabl 453 newEntry(int hash, long key, Object value, Entry next) argument [all...] |
/openjdk10/hotspot/src/share/vm/gc/g1/ |
H A D | g1StringDedupTable.hpp | 36 // character array. Can be chained in a linked list in case of hash 66 unsigned int hash() { function in class:G1StringDedupEntry 70 void set_hash(unsigned int hash) { argument 71 _hash = hash; 102 // The table has hash buckets with chains for hash collision. If the average chain 105 // The table is also dynamically rehashed (using a new hash seed) if it becomes severely 106 // unbalanced, i.e., a hash chain is significantly longer than average. 130 // The hash seed also dictates which hash functio 160 hash_to_index(unsigned int hash) argument 183 lookup_or_add(typeArrayOop value, bool latin1, unsigned int hash) argument [all...] |
/openjdk10/jdk/src/java.base/share/classes/sun/security/x509/ |
H A D | DistributionPointName.java | 209 * Returns the hash code for this distribution point name. 211 * @return the hash code. 214 int hash = hashCode; 215 if (hash == 0) { 216 hash = 1; 218 hash += fullName.hashCode(); 221 hash += relativeName.hashCode(); 223 hashCode = hash; 225 return hash;
|
/openjdk10/jdk/test/java/nio/channels/Channels/ |
H A D | Basic2.java | 71 if (reader.hash() != writer.hash()) 82 private volatile int hash; field in class:Basic2.Reader 110 hash = hash ^ value; 122 int hash() { return hash; } method in class:Basic2.Reader 128 private volatile int hash; field in class:Basic2.Writer 136 hash = 0; 155 hash 174 int hash() { return hash; } method in class:Basic2.Writer [all...] |
/openjdk10/jdk/src/jdk.attach/share/classes/com/sun/tools/attach/ |
H A D | VirtualMachineDescriptor.java | 64 private volatile int hash; // 0 => not computed field in class:VirtualMachineDescriptor 144 * Returns a hash-code value for this VirtualMachineDescriptor. The hash 149 * @return A hash-code value for this descriptor. 152 if (hash != 0) { 153 return hash; 155 hash = provider.hashCode() * 127 + id.hashCode(); 156 return hash;
|