Cross Reference: /libcore/luni/src/main/java/java/util/TreeMap.java

Lines Matching refs:entry
107         for (Map.Entry<? extends K, ? extends V> entry : copyFrom.entrySet()) {
108             putInternal(entry.getKey(), entry.getValue());
150         for (Map.Entry<K, ? extends V> entry : copyFrom.entrySet()) {
151             putInternal(entry.getKey(), entry.getValue());
177         Entry<K, V> entry = findByObject(key);
178         return entry != null ? entry.getValue() : null;
355      * Returns this map's entry that has the same key and value as {@code
356      * entry}, or null if this map has no such entry.
363     Node<K, V> findByEntry(Entry<?, ?> entry) {
364         Node<K, V> mine = findByObject(entry.getKey());
365         boolean valuesEqual = mine != null && Objects.equal(mine.value, entry.getValue());
580      * Returns an immutable version of {@param entry}. Need this because we allow entry to be null,
583     private SimpleImmutableEntry<K, V> immutableCopy(Entry<K, V> entry) {
584         return entry == null ? null : new SimpleImmutableEntry<K, V>(entry);
640         Entry<K, V> entry = find(key, LOWER);
641         return entry != null ? entry.getKey() : null;
649         Entry<K, V> entry = find(key, FLOOR);
650         return entry != null ? entry.getKey() : null;
658         Entry<K, V> entry = find(key, CEILING);
659         return entry != null ? entry.getKey() : null;
667         Entry<K, V> entry = find(key, HIGHER);
668         return entry != null ? entry.getKey() : null;
1017             Entry<K, V> entry = internalPollFirstEntry();
1018             return entry != null ? entry.getKey() : null;
1022             Entry<K, V> entry = internalPollLastEntry();
1023             return entry != null ? entry.getKey() : null;
1189          * Returns the entry if it is in bounds, or null if it is out of bounds.
1212             Entry<K, V> entry = endpoint(true);
1213             if (entry == null) {
1216             return entry.getKey();
1232             Entry<K, V> entry = endpoint(false);
1233             if (entry == null) {
1236             return entry.getKey();
1335             Entry<K, V> entry = findBounded(key, LOWER);
1336             return entry != null ? entry.getKey() : null;
1344             Entry<K, V> entry = findBounded(key, FLOOR);
1345             return entry != null ? entry.getKey() : null;
1353             Entry<K, V> entry = findBounded(key, CEILING);
1354             return entry != null ? entry.getKey() : null;
1362             Entry<K, V> entry = findBounded(key, HIGHER);
1363             return entry != null ? entry.getKey() : null;
1522                 Entry<?, ?> entry = (Entry<?, ?>) o;
1523                 return isInBounds(entry.getKey()) && findByEntry(entry) != null;
1530                 Entry<?, ?> entry = (Entry<?, ?>) o;
1531                 return isInBounds(entry.getKey()) && TreeMap.this.entrySet().remove(entry);
1577                 Entry<K, ?> entry = pollFirstEntry();
1578                 return entry != null ? entry.getKey() : null;
1586                 Entry<K, ?> entry = pollLastEntry();
1587                 return entry != null ? entry.getKey() : null;
1672         for (Map.Entry<K, V> entry : entrySet()) {
1673             stream.writeObject(entry.getKey());
1674             stream.writeObject(entry.getValue());