mirror of
https://github.com/corda/corda.git
synced 2025-01-09 14:33:30 +00:00
87b02eb949
Previously, I used a shell script to extract modification date ranges from the Git history, but that was complicated and unreliable, so now every file just gets the same year range in its copyright header. If someone needs to know when a specific file was modified and by whom, they can look at the Git history themselves; no need to include it redundantly in the header.
199 lines
4.7 KiB
Java
199 lines
4.7 KiB
Java
/* Copyright (c) 2008-2013, Avian Contributors
|
|
|
|
Permission to use, copy, modify, and/or distribute this software
|
|
for any purpose with or without fee is hereby granted, provided
|
|
that the above copyright notice and this permission notice appear
|
|
in all copies.
|
|
|
|
There is NO WARRANTY for this software. See license.txt for
|
|
details. */
|
|
|
|
package java.util;
|
|
|
|
import avian.PersistentSet;
|
|
import avian.Cell;
|
|
|
|
public class TreeSet<T> extends AbstractSet<T> implements Collection<T> {
|
|
private PersistentSet<Cell<T>> set;
|
|
|
|
public TreeSet(final Comparator<T> comparator) {
|
|
set = new PersistentSet(new Comparator<Cell<T>>() {
|
|
public int compare(Cell<T> a, Cell<T> b) {
|
|
return comparator.compare(a.value, b.value);
|
|
}
|
|
});
|
|
}
|
|
|
|
public TreeSet() {
|
|
this(new Comparator<T>() {
|
|
public int compare(T a, T b) {
|
|
return ((Comparable) a).compareTo(b);
|
|
}
|
|
});
|
|
}
|
|
|
|
public TreeSet(Collection<? extends T> collection) {
|
|
this();
|
|
|
|
for (T item: collection) {
|
|
add(item);
|
|
}
|
|
}
|
|
|
|
public T first() {
|
|
if (isEmpty()) throw new NoSuchElementException();
|
|
|
|
return set.first().value().value;
|
|
}
|
|
|
|
public T last() {
|
|
if (isEmpty()) throw new NoSuchElementException();
|
|
|
|
return set.last().value().value;
|
|
}
|
|
|
|
public Iterator<T> iterator() {
|
|
return new MyIterator<T>(set.first());
|
|
}
|
|
|
|
public String toString() {
|
|
return Collections.toString(this);
|
|
}
|
|
|
|
public boolean add(T value) {
|
|
PersistentSet.Path<Cell<T>> p = set.find(new Cell(value, null));
|
|
if (p.fresh()) {
|
|
set = p.add();
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
T addAndReplace(T value) {
|
|
PersistentSet.Path<Cell<T>> p = set.find(new Cell(value, null));
|
|
if (p.fresh()) {
|
|
set = p.add();
|
|
return null;
|
|
} else {
|
|
T old = p.value().value;
|
|
set = p.replaceWith(new Cell(value, null));
|
|
return old;
|
|
}
|
|
}
|
|
|
|
T find(T value) {
|
|
PersistentSet.Path<Cell<T>> p = set.find(new Cell(value, null));
|
|
return p.fresh() ? null : p.value().value;
|
|
}
|
|
|
|
T removeAndReturn(T value) {
|
|
Cell<T> cell = removeCell(value);
|
|
return cell == null ? null : cell.value;
|
|
}
|
|
|
|
private Cell<T> removeCell(Object value) {
|
|
PersistentSet.Path<Cell<T>> p = set.find(new Cell(value, null));
|
|
if (p.fresh()) {
|
|
return null;
|
|
} else {
|
|
Cell<T> old = p.value();
|
|
|
|
if (p.value().next != null) {
|
|
set = p.replaceWith(p.value().next);
|
|
} else {
|
|
set = p.remove();
|
|
}
|
|
|
|
return old;
|
|
}
|
|
}
|
|
|
|
public boolean remove(Object value) {
|
|
return removeCell(value) != null;
|
|
}
|
|
|
|
public int size() {
|
|
return set.size();
|
|
}
|
|
|
|
public boolean isEmpty() {
|
|
return set.size() == 0;
|
|
}
|
|
|
|
public boolean contains(Object value) {
|
|
return !set.find(new Cell(value, null)).fresh();
|
|
}
|
|
|
|
public void clear() {
|
|
set = new PersistentSet(set.comparator());
|
|
}
|
|
|
|
private class MyIterator<T> implements java.util.Iterator<T> {
|
|
private PersistentSet.Path<Cell<T>> path;
|
|
private PersistentSet.Path<Cell<T>> nextPath;
|
|
private Cell<T> cell;
|
|
private Cell<T> prevCell;
|
|
private Cell<T> prevPrevCell;
|
|
private boolean canRemove = false;
|
|
|
|
private MyIterator(PersistentSet.Path<Cell<T>> path) {
|
|
this.path = path;
|
|
if (path != null) {
|
|
cell = path.value();
|
|
nextPath = path.successor();
|
|
}
|
|
}
|
|
|
|
private MyIterator(MyIterator<T> start) {
|
|
path = start.path;
|
|
nextPath = start.nextPath;
|
|
cell = start.cell;
|
|
prevCell = start.prevCell;
|
|
prevPrevCell = start.prevPrevCell;
|
|
canRemove = start.canRemove;
|
|
}
|
|
|
|
public boolean hasNext() {
|
|
return cell != null || nextPath != null;
|
|
}
|
|
|
|
public T next() {
|
|
if (cell == null) {
|
|
path = nextPath;
|
|
nextPath = path.successor();
|
|
cell = path.value();
|
|
}
|
|
prevPrevCell = prevCell;
|
|
prevCell = cell;
|
|
cell = cell.next;
|
|
canRemove = true;
|
|
return prevCell.value;
|
|
}
|
|
|
|
public void remove() {
|
|
if (! canRemove) throw new IllegalStateException();
|
|
|
|
if (prevPrevCell != null && prevPrevCell.next == prevCell) {
|
|
// cell to remove is not the first in the list.
|
|
prevPrevCell.next = prevCell.next;
|
|
prevCell = prevPrevCell;
|
|
} else if (prevCell.next == cell && cell != null) {
|
|
// cell to remove is the first in the list, but not the last.
|
|
set = (PersistentSet) path.replaceWith(cell);
|
|
prevCell = null;
|
|
} else {
|
|
// cell is alone in the list.
|
|
set = (PersistentSet) path.remove();
|
|
path = path.successor();
|
|
if (path != null) {
|
|
prevCell = null;
|
|
cell = path.value();
|
|
path = (PersistentSet.Path) set.find((Cell) cell);
|
|
}
|
|
}
|
|
|
|
canRemove = false;
|
|
}
|
|
}
|
|
}
|