mirror of
https://github.com/corda/corda.git
synced 2025-06-13 04:38:19 +00:00
bugfixes
This commit is contained in:
@ -53,8 +53,8 @@ public class HashMap<K, V> implements Map<K, V> {
|
||||
for (Cell<K, V> c = array[i]; c != null; c = next) {
|
||||
next = c.next();
|
||||
int index = c.hashCode() & (capacity - 1);
|
||||
c.setNext(array[index]);
|
||||
array[index] = c;
|
||||
c.setNext(newArray[index]);
|
||||
newArray[index] = c;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
@ -127,8 +127,7 @@ public class LinkedList<T> implements List<T> {
|
||||
public T removeFirst() {
|
||||
if (front != null) {
|
||||
T v = front.value;
|
||||
front = front.next;
|
||||
if (front != null) front.prev = null;
|
||||
remove(front);
|
||||
return v;
|
||||
} else {
|
||||
throw new NoSuchElementException();
|
||||
@ -138,8 +137,7 @@ public class LinkedList<T> implements List<T> {
|
||||
public T removeLast() {
|
||||
if (rear != null) {
|
||||
T v = rear.value;
|
||||
rear = rear.prev;
|
||||
if (rear != null) rear.next = null;
|
||||
remove(rear);
|
||||
return v;
|
||||
} else {
|
||||
throw new NoSuchElementException();
|
||||
|
Reference in New Issue
Block a user