Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code 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
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package com.sun.javafx.collections;
import java.util.Collection;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
import java.util.NoSuchElementException;
import javafx.beans.InvalidationListener;
import javafx.beans.Observable;
import javafx.collections.ModifiableObservableListBase;
import javafx.collections.ObservableList;
import javafx.util.Callback;
public final class ObservableSequentialListWrapper extends ModifiableObservableListBase implements ObservableList, SortableList{
private final List backingList;
private final ElementObserver elementObserver;
private SortHelper helper;
public ObservableSequentialListWrapper(List list) {
backingList = list;
elementObserver = null;
}
public ObservableSequentialListWrapper(List list, Callback extractor) {
backingList = list;
this.elementObserver = new ElementObserver(extractor, new Callback() {
@Override
public InvalidationListener call(final E e) {
return new InvalidationListener() {
@Override
public void invalidated(Observable observable) {
beginChange();
int i = 0;
for (Iterator it = backingList.iterator(); it.hasNext();) {
if (it.next() == e) {
nextUpdate(i);
}
++i;
}
endChange();
}
};
}
}, this);
for (E e : backingList) {
elementObserver.attachListener(e);
}
}
@Override
public boolean contains(Object o) {
return backingList.contains(o);
}
@Override
public boolean containsAll(Collection c) {
return backingList.containsAll(c);
}
@Override
public int indexOf(Object o) {
return backingList.indexOf(o);
}
@Override
public int lastIndexOf(Object o) {
return backingList.lastIndexOf(o);
}
@Override
public ListIterator listIterator(final int index) {
return new ListIterator() {
private final ListIterator backingIt = backingList.listIterator(index);
private E lastReturned;
@Override
public boolean hasNext() {
return backingIt.hasNext();
}
@Override
public E next() {
return lastReturned = backingIt.next();
}
@Override
public boolean hasPrevious() {
return backingIt.hasPrevious();
}
@Override
public E previous() {
return lastReturned = backingIt.previous();
}
@Override
public int nextIndex() {
return backingIt.nextIndex();
}
@Override
public int previousIndex() {
return backingIt.previousIndex();
}
@Override
public void remove() {
beginChange();
int idx = previousIndex();
backingIt.remove();
nextRemove(idx, lastReturned);
endChange();
}
@Override
public void set(E e) {
beginChange();
int idx = previousIndex();
backingIt.set(e);
nextSet(idx, lastReturned);
endChange();
}
@Override
public void add(E e) {
beginChange();
int idx = nextIndex();
backingIt.add(e);
nextAdd(idx, idx + 1);
endChange();
}
};
}
@Override
public Iterator iterator() {
return listIterator();
}
@Override
public E get(int index) {
try {
return backingList.listIterator(index).next();
} catch (NoSuchElementException exc) {
throw new IndexOutOfBoundsException("Index: "+index);
}
}
@Override
public boolean addAll(int index, Collection c) {
try {
beginChange();
boolean modified = false;
ListIterator e1 = listIterator(index);
Iterator e2 = c.iterator();
while (e2.hasNext()) {
e1.add(e2.next());
modified = true;
}
endChange();
return modified;
} catch (NoSuchElementException exc) {
throw new IndexOutOfBoundsException("Index: "+index);
}
}
@Override
public int size() {
return backingList.size();
}
@Override
protected void doAdd(int index, E element) {
try {
backingList.listIterator(index).add(element);
} catch (NoSuchElementException exc) {
throw new IndexOutOfBoundsException("Index: "+index);
}
}
@Override
protected E doSet(int index, E element) {
try {
ListIterator e = backingList.listIterator(index);
E oldVal = e.next();
e.set(element);
return oldVal;
} catch (NoSuchElementException exc) {
throw new IndexOutOfBoundsException("Index: "+index);
}
}
@Override
protected E doRemove(int index) {
try {
ListIterator e = backingList.listIterator(index);
E outCast = e.next();
e.remove();
return outCast;
} catch (NoSuchElementException exc) {
throw new IndexOutOfBoundsException("Index: "+index);
}
}
@Override
@SuppressWarnings("unchecked")
public void sort() {
if (backingList.isEmpty()) {
return;
}
int[] perm = getSortHelper().sort((List)backingList);
fireChange(new NonIterableChange.SimplePermutationChange(0, size(), perm, this));
}
@Override
public void sort(Comparator comparator) {
if (backingList.isEmpty()) {
return;
}
int[] perm = getSortHelper().sort(backingList, comparator);
fireChange(new NonIterableChange.SimplePermutationChange(0, size(), perm, this));
}
private SortHelper getSortHelper() {
if (helper == null) {
helper = new SortHelper();
}
return helper;
}
}
