home *** CD-ROM | disk | FTP | other *** search
- package java.util;
-
- final class TreeMap$Entry<K, V> implements Map.Entry<K, V> {
- K key;
- V value;
- TreeMap$Entry<K, V> left = null;
- TreeMap$Entry<K, V> right = null;
- TreeMap$Entry<K, V> parent;
- boolean color = true;
-
- TreeMap$Entry(K var1, V var2, TreeMap$Entry<K, V> var3) {
- this.key = var1;
- this.value = var2;
- this.parent = var3;
- }
-
- public K getKey() {
- return this.key;
- }
-
- public V getValue() {
- return this.value;
- }
-
- public V setValue(V var1) {
- Object var2 = this.value;
- this.value = var1;
- return (V)var2;
- }
-
- public boolean equals(Object var1) {
- if (!(var1 instanceof Map.Entry)) {
- return false;
- } else {
- Map.Entry var2 = (Map.Entry)var1;
- return TreeMap.valEquals(this.key, var2.getKey()) && TreeMap.valEquals(this.value, var2.getValue());
- }
- }
-
- public int hashCode() {
- int var1 = this.key == null ? 0 : this.key.hashCode();
- int var2 = this.value == null ? 0 : this.value.hashCode();
- return var1 ^ var2;
- }
-
- public String toString() {
- return this.key + "=" + this.value;
- }
- }
-