/*
* Copyright (c) 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017 David Berkman
*
* This file is part of the SmallMind Code Project.
*
* The SmallMind Code Project is free software, you can redistribute
* it and/or modify it under either, at your discretion...
*
* 1) The terms of GNU Affero General Public License as published by the
* Free Software Foundation, either version 3 of the License, or (at
* your option) any later version.
*
* ...or...
*
* 2) The terms of the Apache License, Version 2.0.
*
* The SmallMind Code Project is distributed in the hope that it will
* be useful, but WITHOUT ANY WARRANTY; without even the implied warranty
* of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License or Apache License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* and the Apache License along with the SmallMind Code Project. If not, see
* <http://www.gnu.org/licenses/> or <http://www.apache.org/licenses/LICENSE-2.0>.
*
* Additional permission under the GNU Affero GPL version 3 section 7
* ------------------------------------------------------------------
* If you modify this Program, or any covered work, by linking or
* combining it with other code, such other code is not for that reason
* alone subject to any of the requirements of the GNU Affero GPL
* version 3.
*/
package org.smallmind.persistence.cache.praxis.intrinsic;
import java.lang.reflect.Array;
import java.util.Collection;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
import java.util.NoSuchElementException;
import java.util.concurrent.locks.ReentrantReadWriteLock;
import org.smallmind.persistence.cache.praxis.Roster;
import org.terracotta.annotations.InstrumentedClass;
@InstrumentedClass
public class IntrinsicRoster<T> implements Roster<T> {
private final ReentrantReadWriteLock lock;
private IntrinsicRosterStructure<T> structure;
public IntrinsicRoster () {
this(new ReentrantReadWriteLock(), new IntrinsicRosterStructure<T>());
}
public IntrinsicRoster (Collection<? extends T> c) {
this(new ReentrantReadWriteLock(), new IntrinsicRosterStructure<T>());
if (!c.isEmpty()) {
IntrinsicRosterNode<T> added = null;
for (T element : c) {
if (added == null) {
structure.setHead(added = new IntrinsicRosterNode<T>(element, null, null));
}
else {
added = new IntrinsicRosterNode<T>(element, added, null);
added.getPrev().setNext(added);
}
}
structure.setTail(added);
structure.addSize(c.size());
}
}
private IntrinsicRoster (ReentrantReadWriteLock lock, IntrinsicRosterStructure<T> structure) {
this.lock = lock;
this.structure = structure;
}
protected ReentrantReadWriteLock getLock () {
return lock;
}
protected IntrinsicRosterNode<T> getNextInView (IntrinsicRosterNode<T> current) {
lock.readLock().lock();
try {
return structure.isTail(current) ? null : current.getNext();
}
finally {
lock.readLock().unlock();
}
}
protected IntrinsicRosterNode<T> getPrevInView (IntrinsicRosterNode<T> current) {
lock.readLock().lock();
try {
return structure.isHead(current) ? null : current.getPrev();
}
finally {
lock.readLock().unlock();
}
}
public int size () {
lock.readLock().lock();
try {
return structure.getSize();
}
finally {
lock.readLock().unlock();
}
}
public boolean isEmpty () {
lock.readLock().lock();
try {
return structure.getSize() == 0;
}
finally {
lock.readLock().unlock();
}
}
public boolean contains (Object obj) {
lock.readLock().lock();
try {
if (structure.getSize() > 0) {
for (IntrinsicRosterNode<T> current = structure.getHead(); current != null; current = getNextInView(current)) {
if (current.objEquals(obj)) {
return true;
}
}
}
return false;
}
finally {
lock.readLock().unlock();
}
}
public Object[] toArray () {
return toArray(null);
}
public <U> U[] toArray (U[] a) {
lock.readLock().lock();
try {
Object[] elements = ((a != null) && (a.length >= structure.getSize())) ? a : (Object[])Array.newInstance((a == null) ? Object.class : a.getClass().getComponentType(), structure.getSize());
if (structure.getSize() > 0) {
int index = 0;
for (IntrinsicRosterNode<T> current = structure.getHead(); current != null; current = getNextInView(current)) {
elements[index++] = current.getObj();
}
}
if (elements.length > structure.getSize()) {
elements[structure.getSize()] = null;
}
return (U[])elements;
}
finally {
lock.readLock().unlock();
}
}
private IntrinsicRosterNode<T> getNode (int index) {
if ((index < 0) || (index >= structure.getSize())) {
throw new IndexOutOfBoundsException(String.valueOf(index));
}
IntrinsicRosterNode<T> current;
if (index <= (structure.getSize() / 2)) {
current = structure.getHead();
for (int count = 0; count < index; count++) {
current = current.getNext();
}
return current;
}
else {
current = structure.getTail();
for (int count = (structure.getSize() - 1); count > index; count--) {
current = current.getPrev();
}
return current;
}
}
public T getFirst () {
lock.readLock().lock();
try {
if (structure.getSize() == 0) {
throw new NoSuchElementException();
}
return structure.getHead().getObj();
}
finally {
lock.readLock().unlock();
}
}
public T getLast () {
lock.readLock().lock();
try {
if (structure.getSize() == 0) {
throw new NoSuchElementException();
}
return structure.getTail().getObj();
}
finally {
lock.readLock().unlock();
}
}
public T get (int index) {
lock.readLock().lock();
try {
return getNode(index).getObj();
}
finally {
lock.readLock().unlock();
}
}
public T set (int index, T element) {
lock.readLock().lock();
try {
IntrinsicRosterNode<T> current;
T value;
value = (current = getNode(index)).getObj();
current.setObj(element);
return value;
}
finally {
lock.readLock().unlock();
}
}
protected void add (IntrinsicRosterNode<T> next, T element) {
IntrinsicRosterNode<T> prev = next.getPrev();
IntrinsicRosterNode<T> added;
next.setPrev(added = new IntrinsicRosterNode<T>(element, prev, next));
if (prev != null) {
prev.setNext(added);
}
if (structure.isHead(next)) {
structure.setHead(added);
}
structure.incSize();
}
public void addFirst (T element) {
lock.writeLock().lock();
try {
if (structure.getSize() == 0) {
structure.ouroboros(element);
}
else {
add(structure.getHead(), element);
}
}
finally {
lock.writeLock().unlock();
}
}
public void addLast (T element) {
lock.writeLock().lock();
try {
if (structure.getSize() == 0) {
structure.ouroboros(element);
}
else {
IntrinsicRosterNode<T> end;
IntrinsicRosterNode<T> added = new IntrinsicRosterNode<T>(element, structure.getTail(), end = structure.getTail().getNext());
if (end != null) {
end.setPrev(added);
}
structure.getTail().setNext(added);
structure.setTail(added);
structure.incSize();
}
}
finally {
lock.writeLock().unlock();
}
}
public boolean add (T element) {
addLast(element);
return true;
}
public void add (int index, T element) {
lock.writeLock().lock();
try {
if (index == structure.getSize()) {
addLast(element);
}
else {
add(getNode(index), element);
}
}
finally {
lock.writeLock().unlock();
}
}
protected void removeNode (IntrinsicRosterNode<T> current) {
IntrinsicRosterNode<T> prev = current.getPrev();
IntrinsicRosterNode<T> next = current.getNext();
if (prev != null) {
prev.setNext(next);
}
if (next != null) {
next.setPrev(prev);
}
structure.decSize();
structure.evaporate(prev, current, next);
}
public T removeFirst () {
lock.writeLock().lock();
try {
if (structure.getSize() == 0) {
throw new NoSuchElementException();
}
else {
T element = structure.getHead().getObj();
removeNode(structure.getHead());
return element;
}
}
finally {
lock.writeLock().unlock();
}
}
public T removeLast () {
lock.writeLock().lock();
try {
if (structure.getSize() == 0) {
throw new NoSuchElementException();
}
else {
T element = structure.getTail().getObj();
removeNode(structure.getTail());
return element;
}
}
finally {
lock.writeLock().unlock();
}
}
public boolean remove (Object o) {
lock.writeLock().lock();
try {
for (IntrinsicRosterNode<T> current = structure.getHead(); current != null; current = getNextInView(current)) {
if (current.objEquals(o)) {
removeNode(current);
return true;
}
}
return false;
}
finally {
lock.writeLock().unlock();
}
}
public T remove (int index) {
lock.writeLock().lock();
try {
IntrinsicRosterNode<T> current;
removeNode(current = getNode(index));
return current.getObj();
}
finally {
lock.writeLock().unlock();
}
}
public boolean containsAll (Collection<?> c) {
if (c.isEmpty()) {
return true;
}
HashSet<?> checkSet = new HashSet<Object>(c);
lock.readLock().lock();
try {
for (IntrinsicRosterNode<T> current = structure.getHead(); current != null; current = getNextInView(current)) {
checkSet.remove(current.getObj());
if (checkSet.isEmpty()) {
return true;
}
}
return false;
}
finally {
lock.readLock().unlock();
}
}
public boolean addAll (Collection<? extends T> c) {
if (!c.isEmpty()) {
lock.writeLock().lock();
try {
for (T element : c) {
addLast(element);
}
return true;
}
finally {
lock.writeLock().unlock();
}
}
return false;
}
public boolean addAll (int index, Collection<? extends T> c) {
if (!c.isEmpty()) {
lock.writeLock().lock();
try {
IntrinsicRosterNode<T> next = getNode(index);
for (T element : c) {
add(next, element);
}
return true;
}
finally {
lock.writeLock().unlock();
}
}
return false;
}
public boolean removeAll (Collection<?> c) {
if (c.isEmpty()) {
return false;
}
HashSet<?> checkSet = new HashSet<Object>(c);
boolean changed = false;
lock.writeLock().lock();
try {
for (IntrinsicRosterNode<T> current = structure.getHead(); current != null; current = getNextInView(current)) {
if (checkSet.contains(current.getObj())) {
removeNode(current);
changed = true;
}
}
return changed;
}
finally {
lock.writeLock().unlock();
}
}
public boolean retainAll (Collection<?> c) {
if (c.isEmpty()) {
return false;
}
HashSet<?> checkSet = new HashSet<Object>(c);
boolean changed = false;
lock.writeLock().lock();
try {
for (IntrinsicRosterNode<T> current = structure.getHead(); current != null; current = getNextInView(current)) {
if (!checkSet.contains(current.getObj())) {
removeNode(current);
changed = true;
}
}
return changed;
}
finally {
lock.writeLock().unlock();
}
}
public void clear () {
lock.writeLock().lock();
try {
structure.clear();
}
finally {
lock.writeLock().unlock();
}
}
public int indexOf (Object o) {
lock.readLock().lock();
try {
int index = 0;
for (IntrinsicRosterNode<T> current = structure.getHead(); current != null; current = getNextInView(current)) {
if (current.objEquals(o)) {
return index;
}
index++;
}
return -1;
}
finally {
lock.readLock().unlock();
}
}
public int lastIndexOf (Object o) {
lock.readLock().lock();
try {
int index = structure.getSize() - 1;
for (IntrinsicRosterNode<T> current = structure.getTail(); current != null; current = getPrevInView(current)) {
if (current.objEquals(o)) {
return index;
}
index--;
}
return -1;
}
finally {
lock.readLock().unlock();
}
}
public Iterator<T> iterator () {
return listIterator();
}
public ListIterator<T> listIterator () {
lock.readLock().lock();
try {
return new IntrinsicRosterIterator<T>(this, null, (structure.getSize() == 0) ? null : structure.getHead(), 0);
}
finally {
lock.readLock().unlock();
}
}
public ListIterator<T> listIterator (int index) {
lock.readLock().lock();
try {
if (index > structure.getSize()) {
throw new IndexOutOfBoundsException(String.valueOf(index));
}
else if (index == structure.getSize()) {
return new IntrinsicRosterIterator<T>(this, (structure.getSize() == 0) ? null : structure.getTail(), null, index);
}
else {
IntrinsicRosterNode<T> current = getNode(index);
return new IntrinsicRosterIterator<T>(this, getPrevInView(current), current, index);
}
}
finally {
lock.readLock().unlock();
}
}
public List<T> subList (int fromIndex, int toIndex) {
if (fromIndex > toIndex) {
throw new IndexOutOfBoundsException(fromIndex + " > " + toIndex);
}
lock.readLock().lock();
try {
return new IntrinsicRoster<T>(lock, new IntrinsicRosterStructure<T>(structure, getNode(fromIndex), (fromIndex == toIndex) ? getNode(fromIndex).getNext() : getNode(toIndex - 1), toIndex - fromIndex));
}
finally {
lock.readLock().unlock();
}
}
}