我正在实现一个名为MyTreeMap的TreeMap类,而put方法给我带来了一些麻烦。在测试期间,它似乎完全清除了节点,而不是更新已经存在的键的值。这是代码:
public class MyTreeMap<K extends Comparable<? super K>,V> extends AbstractMap<K,V> {
K key;
V value;
int height;
MyTreeMap<K,V> left,right;
int size;
public V put(K key, V value) {
if(this.isEmpty()) {
this.key = key;
this.value = value;
this.size++;
setHeight();
return null;
}
else if(this.key.compareTo(key) == 0) {
V temp = this.value;
this.value = value;
return temp;
}
else if(this.key.compareTo(key) > 0) {
if(this.left == null) {
this.left = new MyTreeMap<K,V>(key,value,null,null);
this.size++;
if(left.height > right.height + 1 || right.height > left.height + 1)
restructure(this);
setHeight();
return null;
}
else
return this.left.put(key, value);
}
else {
if(this.right == null) {
this.right = new MyTreeMap<K,V>(key,value,null,null);
this.size++;
if(left.height > right.height + 1 || right.height > left.height + 1)
restructure(this);
setHeight();
return null;
}
else
return this.right.put(key, value);
}
}
这是测试,第一个assertEquals通过,第二个没有,故障跟踪显示在该行的注释
@Test
public void putTest2() {
TreeMap<String,LinkedList<Integer>> actual = new TreeMap<String,LinkedList<Integer>>();
MyTreeMap<String,LinkedList<Integer>> test = new MyTreeMap<String,LinkedList<Integer>>();
LinkedList<Integer> actualList = new LinkedList<Integer>();
actualList.add(0);
actualList.add(4);
LinkedList<Integer> testList = new LinkedList<Integer>();
testList.add(0);
testList.add(4);
actual.put("hello", actualList);
test.put("hello", actualList);
assertEquals(actual, test); //this part passes, indicating that it adds new keys correctly
LinkedList<Integer> tempList;
tempList = actual.get("hello");
tempList.add(6);
actual.put("hello", tempList);
test.put("hello", tempList);
assertEquals(actual, test); //this part fails, fail trace: expected:<{hello=[0,4,6,6]}> but was <[]>
}
}
如果你能帮我解决这个问题,那将会有所帮助。感谢。
答案 0 :(得分:0)
在这种情况下,assertEquals(a, b)
会测试两个Map
参数是否相同的对象,而不是包含相同的值。< / p>
您的班级和TreeMap
都没有实施equals()
,因此使用Object
类的默认实现,只返回a == b
。
查看Hamcrest library是否按值有意义地比较集合。