Compare commits
No commits in common. "bde868ad4746fca3a867774a0bc5b2594b998c26" and "c9b1dfbe4879dbba9d6187284d4f2aaaaf463566" have entirely different histories.
bde868ad47
...
c9b1dfbe48
|
|
@ -2,7 +2,6 @@ package pp;
|
||||||
|
|
||||||
public class ThreadsafeSimplifiedList<T> implements SimplifiedList<T> {
|
public class ThreadsafeSimplifiedList<T> implements SimplifiedList<T> {
|
||||||
private Node<T> first;
|
private Node<T> first;
|
||||||
private final Object headLock = new Object();
|
|
||||||
|
|
||||||
private static class Node<U> {
|
private static class Node<U> {
|
||||||
U element;
|
U element;
|
||||||
|
|
@ -23,16 +22,16 @@ public class ThreadsafeSimplifiedList<T> implements SimplifiedList<T> {
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
public boolean add(T element) {
|
public boolean add(T element) {
|
||||||
Node<T> curr;
|
synchronized (this) {
|
||||||
|
|
||||||
synchronized (headLock) {
|
|
||||||
if (first == null) {
|
if (first == null) {
|
||||||
first = new Node<>(element, null, null);
|
first = new Node<>(element, null, null);
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
curr = first;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Node<T> curr;
|
||||||
|
synchronized (first.lock) {
|
||||||
|
curr = first;
|
||||||
while (true) {
|
while (true) {
|
||||||
Node<T> next;
|
Node<T> next;
|
||||||
synchronized (curr.lock) {
|
synchronized (curr.lock) {
|
||||||
|
|
@ -42,14 +41,17 @@ public class ThreadsafeSimplifiedList<T> implements SimplifiedList<T> {
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
synchronized (next.lock) {
|
||||||
curr = next;
|
curr = next;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
public T get(int index) {
|
public T get(int index) {
|
||||||
Node<T> curr;
|
Node<T> curr;
|
||||||
synchronized (headLock) {
|
synchronized (this) {
|
||||||
if (first == null) throw new IndexOutOfBoundsException();
|
if (first == null) throw new IndexOutOfBoundsException();
|
||||||
curr = first;
|
curr = first;
|
||||||
}
|
}
|
||||||
|
|
@ -69,7 +71,7 @@ public class ThreadsafeSimplifiedList<T> implements SimplifiedList<T> {
|
||||||
@Override
|
@Override
|
||||||
public T set(int index, T element) {
|
public T set(int index, T element) {
|
||||||
Node<T> curr;
|
Node<T> curr;
|
||||||
synchronized (headLock) {
|
synchronized (this) {
|
||||||
if (first == null) throw new IndexOutOfBoundsException();
|
if (first == null) throw new IndexOutOfBoundsException();
|
||||||
curr = first;
|
curr = first;
|
||||||
}
|
}
|
||||||
|
|
@ -90,7 +92,7 @@ public class ThreadsafeSimplifiedList<T> implements SimplifiedList<T> {
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
public boolean isEmpty() {
|
public boolean isEmpty() {
|
||||||
synchronized (headLock) {
|
synchronized (this) {
|
||||||
return first == null;
|
return first == null;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue