src.java.net.htmlparser.jericho.nodoc.SequentialListSegment Maven / Gradle / Ivy
// Jericho HTML Parser - Java based library for analysing and manipulating HTML
// Version 3.1
// Copyright (C) 2004-2009 Martin Jericho
// http://jericho.htmlparser.net/
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of either one of the following licences:
//
// 1. The Eclipse Public License (EPL) version 1.0,
// included in this distribution in the file licence-epl-1.0.html
// or available at http://www.eclipse.org/legal/epl-v10.html
//
// 2. The GNU Lesser General Public License (LGPL) version 2.1 or later,
// included in this distribution in the file licence-lgpl-2.1.txt
// or available at http://www.gnu.org/licenses/lgpl.txt
//
// This library is distributed on an "AS IS" basis,
// WITHOUT WARRANTY OF ANY KIND, either express or implied.
// See the individual licence texts for more details.
package net.htmlparser.jericho.nodoc;
import net.htmlparser.jericho.*;
import java.util.*;
/**
* A base class used internally to simulate multiple inheritance of {@link Segment} and java.util.AbstractSequentialList.
*
* It allows a {@link Segment} based class to implement java.util.List without having to implement
* all of the List methods explicitly, which would clutter the API documentation with mostly irrelevant methods.
* By extending this class, most of the list implementation methods are simply listed in the inherited methods list.
*
* The list is assumed to be immutable.
*
* @see Attributes
*/
public abstract class SequentialListSegment extends Segment implements List {
public SequentialListSegment(final Source source, final int begin, final int end) {
super(source,begin,end);
}
/**
* Returns the number of items in the list.
* @return the number of items in the list.
*/
public abstract int getCount();
/**
* Returns a list iterator of the items in this list (in proper sequence), starting at the specified position in the list.
*
* The specified index indicates the first item that would be returned by an initial call to the next() method.
* An initial call to the previous() method would return the item with the specified index minus one.
*
* @param index index of the first item to be returned from the list iterator (by a call to the next() method).
* @return a list iterator of the items in this list (in proper sequence), starting at the specified position in the list.
* @throws IndexOutOfBoundsException if the specified index is out of range (index < 0 || index > size()).
*/
public abstract ListIterator listIterator(int index);
/**
* Returns the item at the specified position in this list.
*
* This implementation first gets a list iterator pointing to the indexed item (with listIterator(index)).
* Then, it gets the element using ListIterator.next and returns it.
*
* @param index the index of the item to return.
* @return the item at the specified position in this list.
* @throws IndexOutOfBoundsException if the specified index is out of range (index < 0 || index >= size()).
*/
public E get(final int index) {
final ListIterator li=listIterator(index);
try {
return(li.next());
} catch(NoSuchElementException ex) {
throw(new IndexOutOfBoundsException("index="+index));
}
}
/**
* Returns the number of items in the list.
*
* This is equivalent to {@link #getCount()},
* and is necessary to for the implementation of the java.util.Collection interface.
*
* @return the number of items in the list.
*/
public int size() {
return getCount();
}
/**
* Indicates whether this list is empty.
* @return true if there are no items in the list, otherwise false.
*/
public boolean isEmpty() {
return getCount()==0;
}
/**
* Indicates whether this list contains the specified object.
*
* @param o object to be checked for containment in this list.
* @return true if this list contains the specified object, otherwise false.
*/
public boolean contains(final Object o) {
return indexOf(o)>=0;
}
/**
* Returns an array containing all of the items in this list.
* @return an array containing all of the items in this list.
*/
public Object[] toArray() {
final Object[] array=new Object[getCount()];
int x=0;
for (E e : this) array[x++]=e;
return array;
}
/**
* Returns an array containing all of the items in this list in the correct order;
* the runtime type of the returned array is that of the specified array.
* If the list fits in the specified array, it is returned therein.
* Otherwise, a new array is allocated with the runtime type of the specified array and the size of this list.
*
* If the list fits in the specified array with room to spare (i.e., the array has more elements than the list),
* the item in the array immediately following the end of the collection is set to null.
* This is useful in determining the length of the list only
* if the caller knows that the list does not contain any null items.
*
* @param a the array into which the items of the list are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose.
* @return an array containing the items of the list.
* @throws NullPointerException if the specified array is null.
* @throws ArrayStoreException if the runtime type of the specified array is not a supertype of the runtime type of every item in this list.
*/
@SuppressWarnings("unchecked") // There is no way to implement this without using unchecked casts
public T[] toArray(T[] a) {
final int count=getCount();
if (a.lengthcount) a[count]=null;
return a;
}
/**
* This list is unmodifiable, so this method always throws an UnsupportedOperationException.
* @throws UnsupportedOperationException
*/
public boolean remove(Object o) {
throw new UnsupportedOperationException();
}
/**
* Indicates whether this list contains all of the items in the specified collection.
* @param collection the collection to be checked for containment in this list.
* @return true if this list contains all of the items in the specified collection, otherwise false.
* @throws NullPointerException if the specified collection is null.
* @see #contains(Object)
*/
public boolean containsAll(final Collection collection) {
for (Object o : collection)
if(!contains(o)) return false;
return true;
}
/**
* This list is unmodifiable, so this method always throws an UnsupportedOperationException.
* @throws UnsupportedOperationException
*/
public boolean addAll(Collection collection) {
throw new UnsupportedOperationException();
}
/**
* This list is unmodifiable, so this method always throws an UnsupportedOperationException.
* @throws UnsupportedOperationException
*/
public boolean removeAll(Collection collection) {
throw new UnsupportedOperationException();
}
/**
* This list is unmodifiable, so this method always throws an UnsupportedOperationException.
* @throws UnsupportedOperationException
*/
public boolean retainAll(Collection collection) {
throw new UnsupportedOperationException();
}
/**
* This list is unmodifiable, so this method always throws an UnsupportedOperationException.
* @throws UnsupportedOperationException
*/
public boolean add(E e) {
throw new UnsupportedOperationException();
}
/**
* This list is unmodifiable, so this method always throws an UnsupportedOperationException.
* @throws UnsupportedOperationException
*/
public E set(int index, E element) {
throw new UnsupportedOperationException();
}
/**
* This list is unmodifiable, so this method always throws an UnsupportedOperationException.
* @throws UnsupportedOperationException
*/
public void add(int index, E element) {
throw new UnsupportedOperationException();
}
/**
* This list is unmodifiable, so this method always throws an UnsupportedOperationException.
* @throws UnsupportedOperationException
*/
public E remove(int index) {
throw new UnsupportedOperationException();
}
/**
* Returns the index in this list of the first occurence of the specified object, or -1 if the list does not contain this object.
*
* @param o object to search for.
* @return the index in this list of the first occurence of the specified object, or -1 if the list does not contain this object.
*/
public int indexOf(final Object o) {
final ListIterator li=listIterator(0);
if (o==null) {
while (li.hasNext()) if (li.next()==null) return li.previousIndex();
} else {
while (li.hasNext()) if (o.equals(li.next())) return li.previousIndex();
}
return -1;
}
/**
* Returns the index in this list of the last occurence of the specified object, or -1 if the list does not contain this object.
*
* @param o object to search for.
* @return the index in this list of the last occurence of the specified object, or -1 if the list does not contain this object.
*/
public int lastIndexOf(final Object o) {
final ListIterator li=listIterator(getCount());
if (o==null) {
while (li.hasPrevious()) if (li.previous()==null) return li.nextIndex();
} else {
while (li.hasPrevious()) if (o.equals(li.previous())) return li.nextIndex();
}
return -1;
}
/**
* This list is unmodifiable, so this method always throws an UnsupportedOperationException.
* @throws UnsupportedOperationException
*/
public void clear() {
throw new UnsupportedOperationException();
}
/**
* This list is unmodifiable, so this method always throws an UnsupportedOperationException.
* @throws UnsupportedOperationException
*/
public boolean addAll(int index, Collection collection) {
throw new UnsupportedOperationException();
}
/**
* Returns an iterator over the items in the list in proper sequence.
* @return an iterator over the items in the list in proper sequence.
*/
public Iterator iterator() {
return listIterator();
}
/**
* Returns a list iterator of the items in this list (in proper sequence), starting with the first item in the list.
* @return a list iterator of the items in this list (in proper sequence), starting with the first item in the list.
* @see #listIterator(int)
*/
public ListIterator listIterator() {
return listIterator(0);
}
/**
* Returns a view of the portion of this list between fromIndex, inclusive, and toIndex, exclusive.
* (If fromIndex and toIndex are equal, the returned list is empty.)
* The returned list is backed by this list, so changes in the returned list are reflected in this list, and vice-versa.
* The returned list supports all of the optional list operations supported by this list.
*
* @param fromIndex low endpoint (inclusive) of the subList.
* @param toIndex high endpoint (exclusive) of the subList.
* @return a view of the specified range within this list.
* @throws IndexOutOfBoundsException endpoint index value out of range (fromIndex < 0 || toIndex > size)
* @throws IllegalArgumentException endpoint indices out of order (fromIndex > toIndex)
* @see java.util.List#subList(int fromIndex, int toIndex)
*/
public List subList(final int fromIndex, final int toIndex) {
return (new SubList(this,fromIndex,toIndex));
}
private static class SubList extends AbstractList {
private final List list;
private final int offset;
private final int size;
SubList(final List list, final int fromIndex, final int toIndex) {
if (fromIndex<0) throw new IndexOutOfBoundsException("fromIndex="+fromIndex);
if (toIndex>list.size()) throw new IndexOutOfBoundsException("toIndex="+toIndex);
if (fromIndex>toIndex) throw new IllegalArgumentException("fromIndex("+fromIndex+") > toIndex("+toIndex+")");
this.list=list;
offset=fromIndex;
size=toIndex-fromIndex;
}
public E get(final int index) {
return list.get(getSuperListIndex(index));
}
public int size() {
return size;
}
public Iterator iterator() {
return listIterator();
}
public ListIterator listIterator(final int index) {
return new ListIterator() {
private final ListIterator i=list.listIterator(getSuperListIndex(index));
public boolean hasNext() {
return nextIndex()=0;
}
public E previous() {
if (!hasPrevious()) throw new NoSuchElementException();
return i.previous();
}
public int nextIndex() {
return i.nextIndex()-offset;
}
public int previousIndex() {
return i.previousIndex()-offset;
}
public void remove() {
throw new UnsupportedOperationException();
}
public void set(E o) {
throw new UnsupportedOperationException();
}
public void add(E o) {
throw new UnsupportedOperationException();
}
};
}
public List subList(final int fromIndex, final int toIndex) {
return new SubList(this,fromIndex,toIndex);
}
private int getSuperListIndex(final int index) {
if (index<0 || index>=size) throw new IndexOutOfBoundsException("index="+index+", size="+size);
return index+offset;
}
}
}