Lines Matching defs:entry
56 * increase the time cost to look up an entry (which is reflected in most
467 // Creates the new entry.
559 * entry is rendered as the key, an equals sign <tt>=</tt>, and the
661 * <tt>setValue</tt> operation on a map entry returned by the
689 Map.Entry entry = (Map.Entry)o;
690 Object key = entry.getKey();
696 if (e.hash==hash && e.equals(entry))
704 Map.Entry<K,V> entry = (Map.Entry<K,V>) o;
705 K key = entry.getKey();
712 if (e.hash==hash && e.equals(entry)) {
841 for (HashtableEntry<K,V> entry : tab)
842 while (entry != null) {
843 h += entry.hashCode();
844 entry = entry.next;
859 for (HashtableEntry<?, ?> entry : tab) {
860 while (entry != null) {
861 action.accept((K)entry.key, (V)entry.value);
862 entry = entry.next;
878 for (HashtableEntry<K, V> entry : tab) {
879 while (entry != null) {
880 entry.value = Objects.requireNonNull(
881 function.apply(entry.key, entry.value));
882 entry = entry.next;
968 HashtableEntry<K,V> entry = table[index];
970 while (entry != null) {
972 new HashtableEntry<>(0, entry.key, entry.value, entryStack);
973 entry = entry.next;
1049 // Creates the new entry.
1056 * Hashtable bucket collision list entry
1127 HashtableEntry<K,V> entry = null;
1150 HashtableEntry<K,V> e = entry;
1157 entry = e;
1163 HashtableEntry<K,V> et = entry;
1170 entry = et;
1173 HashtableEntry<K,V> e = lastReturned = entry;
1174 entry = e.next;