Please wait. This can take some minutes ...
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.
com.xdev.jadoth.collections.SubList Maven / Gradle / Ivy
package com.xdev.jadoth.collections;
import java.util.Collection;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
import java.util.Map;
import com.xdev.jadoth.lang.Equalator;
import com.xdev.jadoth.lang.functional.Operation;
import com.xdev.jadoth.lang.functional.Predicate;
import com.xdev.jadoth.lang.functional.aggregates.Aggregate;
import com.xdev.jadoth.lang.functional.aggregates.TAggregate;
import com.xdev.jadoth.lang.functional.controlflow.TOperation;
import com.xdev.jadoth.lang.functional.controlflow.TPredicate;
import com.xdev.jadoth.util.VarChar;
public class SubList extends SubListAccessor implements XList
{
private final XList list;
private final int offset;
private int size;
public SubList (final XList list, final int startIndex, final int endIndex)
{
if (startIndex < 0 || endIndex >= list.size() || startIndex > endIndex){
throw new IndexOutOfBoundsException("Range [" +startIndex+';' +endIndex+"] not in [0;" +list.size()+"]." );
}
this .list = list;
this .offset = startIndex;
this .size = endIndex - startIndex + 1 ;
}
private void rangeCheck (final int index)
{
if (index < 0 || index >= this .size){
throw new IndexOutOfBoundsException("Index: " +index+",Size: " +this .size);
}
}
private boolean rangeCheck (final int startIndex, final int endIndex)
{
if (startIndex < 0 || endIndex >= this .size || startIndex > endIndex){
throw new IndexOutOfBoundsException("Range [" +startIndex+';' +endIndex+"] not in [0;" +this .size+"]." );
}
return startIndex <= endIndex;
}
@Override
public int replace (final E oldElement, final E newElement, final Equalator equalator)
{
return 0 ;
}
@Override
public int replace (final E oldElement, final E newElement,final int skip, final Integer limit, final Equalator equalator)
{
return 0 ;
}
@Override
public int replaceOne (final E oldElement, final E newElement, final Equalator equalator)
{
return 0 ;
}
@Override
public int replace (final E oldElement, final E newElement)
{
return 0 ;
}
@Override
public int replace (final E oldElement, final E newElement,final int skip, final Integer limit)
{
return 0 ;
}
@Override
public int replaceOne (final E oldElement, final E newElement)
{
return 0 ;
}
@Override
public int replaceAll (final Map replacementMapping)
{
return 0 ;
}
@Override
public void appendTo (final VarChar vc)
{
}
@Override
public void appendTo (final VarChar vc, final char seperator)
{
}
@Override
public void appendTo (final VarChar vc, final String seperator)
{
}
@Override
public boolean applies (final Predicate predicate)
{
return false ;
}
@Override
public boolean applies (final TPredicate predicate)
{
return false ;
}
@Override
public void clear ()
{
}
@Override
public boolean contains (final Predicate predicate)
{
return false ;
}
@Override
public boolean contains (final TPredicate predicate)
{
return false ;
}
@Override
public boolean contains (final E element, final Equalator equalator)
{
return false ;
}
@Override
public int count (final Predicate predicate)
{
return 0 ;
}
@Override
public int count (final TPredicate predicate)
{
return 0 ;
}
@Override
public int count (final E element, final Equalator equalator)
{
return 0 ;
}
@Override
public E search (final E element, final Equalator equalator)
{
return null ;
}
@Override
public boolean equals (final XGettingCollection list, final Equalator comparator)
{
return false ;
}
@Override
public boolean equalsContent (final Collection list, final Equalator comparator)
{
return false ;
}
@Override
public > C except (final XGettingCollection other, final Equalator comparator, final C target)
{
return null ;
}
@Override
public SubList execute (final Operation operation)
{
return null ;
}
@Override
public SubList execute (final TOperation operation)
{
return null ;
}
@Override
public boolean hasUniqueValues (final boolean ignoreMultipleNulls, final Equalator comparator)
{
return false ;
}
@Override
public boolean containsId (final E element)
{
return false ;
}
@Override
public int count (final E element)
{
return 0 ;
}
@Override
public boolean hasUniqueValues (final boolean ignoreMultipleNullValues)
{
return false ;
}
@Override
public > C intersect (final XGettingCollection other, final Equalator comparator, final C target)
{
return null ;
}
@Override
public boolean isEmpty ()
{
return false ;
}
@Override
public E max (final Comparator comparator)
{
return null ;
}
@Override
public E min (final Comparator comparator)
{
return null ;
}
@Override
public SubList process (final Operation operation)
{
return null ;
}
@Override
public SubList process (final TOperation operation)
{
return null ;
}
@Override
public E search (final Predicate predicate)
{
return null ;
}
@Override
public E search (final TPredicate predicate)
{
return null ;
}
@Override
public int size ()
{
return 0 ;
}
@Override
public Object[] toArray()
{
return null ;
}
@Override
public T[] toArray(final T[] a)
{
return null ;
}
@Override
public E[] toArray(final Class type)
{
return null ;
}
@Override
public > C union (final XGettingCollection other, final Equalator comparator, final C target)
{
return null ;
}
@Override
public Iterator iterator ()
{
return null ;
}
@Override
public boolean add (final E e)
{
return false ;
}
@Override
public XAddingCollection add (final E... elements)
{
return null ;
}
@Override
public XAddingCollection add (final Iterable elements)
{
return null ;
}
@Override
public XAddingCollection add (final E[] elements, final int srcIndex, final int srcLength, final Predicate predicate, final int skip, final Integer limit)
{
return null ;
}
@Override
public XAddingCollection add (final Iterable elements, final int srcIndex, final Integer srcLength, final Predicate predicate, final int skip, final Integer limit)
{
return null ;
}
@Override
public XAddingCollection add (final E[] elements, final int srcIndex, final int srcLength, final TPredicate predicate, final int skip, final Integer limit)
{
return null ;
}
@Override
public XAddingCollection add (final Iterable elements, final int srcIndex, final Integer srcLength, final TPredicate predicate, final int skip, final Integer limit)
{
return null ;
}
@Override
public boolean addAll (final Collection c)
{
return false ;
}
@Override
public int remove (final E element, final Equalator equalator)
{
return 0 ;
}
@Override
public int remove (final E element,final int skip, final Integer limit, final Equalator equalator)
{
return 0 ;
}
@Override
public int removeAll (final XCollection c, final boolean ingoreNulls, final Equalator equalator)
{
return 0 ;
}
@Override
public int removeDuplicates (final boolean keepMultipleNullValues, final Equalator equalator)
{
return 0 ;
}
@Override
public E removeOne (final E element, final Equalator equalator)
{
return null ;
}
@Override
public int retainAll (final XCollection c, final Equalator equalator)
{
return 0 ;
}
@Override
public int removeId (final E element)
{
return 0 ;
}
@Override
public int removeId (final E element,final int skip, final Integer limit)
{
return 0 ;
}
@Override
public int removeAllId (final XCollection c, final boolean ingoreNulls)
{
return 0 ;
}
@Override
public int removeDuplicates (final boolean keepMultipleNullValues)
{
return 0 ;
}
@Override
public E removeOne (final E element)
{
return null ;
}
@Override
public int retainAllId (final XCollection c)
{
return 0 ;
}
@Override
public int reduce (final Predicate predicate)
{
return 0 ;
}
@Override
public int reduce (final TPredicate predicate)
{
return 0 ;
}
@Override
public int reduce (final Predicate predicate,final int skip, final Integer limit)
{
return 0 ;
}
@Override
public int reduce (final TPredicate predicate,final int skip, final Integer limit)
{
return 0 ;
}
@Override
public XList truncate ()
{
return null ;
}
@Override
public int rngReplace (
final int startIndex,
final int endIndex,
final E oldElement,
final E newElement,
final Equalator equalator
)
{
return 0 ;
}
@Override
public int rngReplace (
final int startIndex,
final int endIndex,
final E oldElement,
final E newElement,
final int skip,
final Integer limit,
final Equalator equalator
)
{
return 0 ;
}
@Override
public int rngReplaceOne (
final int startIndex,
final int endIndex,
final E oldElement,
final E newElement,
final Equalator equalator
)
{
return 0 ;
}
@Override
public XList fill (final int startIndex, final int endIndex, final E element)
{
return null ;
}
@Override
public int rngReplace (final int startIndex, final int endIndex, final E oldElement, final E newElement)
{
return 0 ;
}
@Override
public int rngReplace (final int startIndex, final int endIndex, final E oldElement, final E newElement,final int skip, final Integer limit)
{
return 0 ;
}
@Override
public int rngReplaceOne (final int startIndex, final int endIndex, final E oldElement, final E newElement)
{
return 0 ;
}
@Override
public XList reverse ()
{
return null ;
}
@Override
public int rngReplaceAll (final int startIndex, final int endIndex, final Map replacementMapping)
{
return 0 ;
}
@Override
public XList rngReverse (final int startIndex, final int endIndex)
{
return null ;
}
@Override
public XList rngShuffle (final int startIndex, final int endIndex)
{
return null ;
}
@Override
public XList rngSortMerge (final int startIndex, final int endIndex, final Comparator comparator)
{
return null ;
}
@Override
public XList rngSortQuick (final int startIndex, final int endIndex, final Comparator comparator)
{
return null ;
}
@Override
public E set (final int index, final E element)
{
return null ;
}
@Override
public XList set (final int startIndex, final E... elements)
{
return null ;
}
@Override
public XList set (final int startIndex, final E[] elements, final int elementsStartIndex, final int length)
{
return null ;
}
@Override
public XList set (final int startIndex, final List elements, final int elementsStartIndex, final int length)
{
return null ;
}
@Override
public void setFirst (final E element)
{
}
@Override
public void setLast (final E element)
{
}
@Override
public XList shuffle ()
{
return null ;
}
@Override
public XList sortMerge (final Comparator comparator)
{
return null ;
}
@Override
public XList sortQuick (final Comparator comparator)
{
return null ;
}
@Override
public void swap (final int indexA, final int indexB)
{
}
@Override
public void swap (final int indexA, final int indexB, final int length)
{
}
@Override
public int binarySearch (final E element, final Comparator comparator)
{
return 0 ;
}
@Override
public XList copy ()
{
return null ;
}
@Override
public int indexOf (final E o, final Equalator equalator)
{
return 0 ;
}
@Override
public int lastIndexOf (final E o, final Equalator equalator)
{
return 0 ;
}
@Override
public boolean rngContainsAll (final int startIndex, final int endIndex, final Collection c, final boolean ignoreNulls, final Equalator equalator)
{
return false ;
}
@Override
public int rngCount (final int startIndex, final int endIndex, final E element, final Equalator equalator)
{
return 0 ;
}
@Override
public int rngIndexOf (final int startIndex, final int endIndex, final E o, final Equalator equalator)
{
return 0 ;
}
@Override
public E get (final int index)
{
return null ;
}
@Override
public E getFirst ()
{
return null ;
}
@Override
public E getLast ()
{
return null ;
}
@Override
public int indexOfId (final E o)
{
return 0 ;
}
@Override
public int lastIndexOfId (final E o)
{
return 0 ;
}
@Override
public boolean rngContainsId (final int startIndex, final int endIndex, final E o)
{
return false ;
}
@Override
public boolean rngContainsAll (final int startIndex, final int endIndex, final Collection c, final boolean ignoreNulls)
{
return false ;
}
@Override
public int rngCount (final int startIndex, final int endIndex, final E element)
{
return 0 ;
}
@Override
public boolean rngHasUniqueValues (final int startIndex, final int endIndex, final boolean ignoreMultipleNullValues)
{
return false ;
}
@Override
public int rngIndexOfId (final int startIndex, final int endIndex, final E o)
{
return 0 ;
}
@Override
public int indexOf (final Predicate predicate)
{
return 0 ;
}
@Override
public int indexOf (final TPredicate predicate)
{
return 0 ;
}
@Override
public boolean isSorted (final Comparator comparator)
{
return false ;
}
@Override
public ListIterator listIterator ()
{
return null ;
}
@Override
public ListIterator listIterator (final int i)
{
return null ;
}
@Override
public int maxIndex (final Comparator comparator)
{
return 0 ;
}
@Override
public int minIndex (final Comparator comparator)
{
return 0 ;
}
@Override
public void rngAppendTo (final int startIndex, final int endIndex, final VarChar vc)
{
}
@Override
public void rngAppendTo (final int startIndex, final int endIndex, final VarChar vc, final String seperator)
{
}
@Override
public void rngAppendTo (final int startIndex, final int endIndex, final VarChar vc, final char seperator)
{
}
@Override
public boolean rngApplies (final int startIndex, final int endIndex, final Predicate predicate)
{
return false ;
}
@Override
public boolean rngApplies (final int startIndex, final int endIndex, final TPredicate predicate)
{
return false ;
}
@Override
public int rngBinarySearch (final int startIndex, final int endIndex, final E element, final Comparator comparator)
{
return 0 ;
}
@Override
public boolean rngContains (final int startIndex, final int endIndex, final Predicate predicate)
{
return false ;
}
@Override
public boolean rngContains (final int startIndex, final int endIndex, final TPredicate predicate)
{
return false ;
}
@Override
public boolean rngContains (final int startIndex, final int endIndex, final E element, final Equalator comparator)
{
return false ;
}
@Override
public int rngCount (final int startIndex, final int endIndex, final Predicate predicate)
{
return 0 ;
}
@Override
public int rngCount (final int startIndex, final int endIndex, final TPredicate predicate)
{
return 0 ;
}
@Override
public E rngSearch (final int startIndex, final int endIndex, final E element, final Equalator equalator)
{
return null ;
}
@Override
public boolean rngEqualsContent (final int startIndex, final List list, final int length, final Equalator comparator)
{
return false ;
}
@Override
public > C rngExcept (final int startIndex, final int endIndex, final XGettingCollection c, final Equalator comparatorr, final C targetCollection)
{
return null ;
}
@Override
public XList rngExecute (final int startIndex, final int endIndex, final Operation operation)
{
return null ;
}
@Override
public XList rngExecute (final int startIndex, final int endIndex, final TOperation operation)
{
return null ;
}
@Override
public boolean rngHasUniqueValues (final int startIndex, final int endIndex, final boolean ignoreMultipleNulls, final Equalator comparator)
{
return false ;
}
@Override
public int rngIndexOf (final int startIndex, final int endIndex, final Predicate predicate)
{
return 0 ;
}
@Override
public int rngIndexOf (final int startIndex, final int endIndex, final TPredicate predicate)
{
return 0 ;
}
@Override
public > C rngIntersect (final int startIndex, final int endIndex, final XGettingCollection c, final Equalator comparator, final C targetCollection)
{
return null ;
}
@Override
public boolean rngIsSorted (final int startIndex, final int endIndex, final Comparator comparator)
{
return false ;
}
@Override
public E rngMax (final int startIndex, final int endIndex, final Comparator comparator)
{
return null ;
}
@Override
public int rngMaxIndex (final int startIndex, final int endIndex, final Comparator comparator)
{
return 0 ;
}
@Override
public E rngMin (final int startIndex, final int endIndex, final Comparator comparator)
{
return null ;
}
@Override
public int rngMinIndex (final int startIndex, final int endIndex, final Comparator comparator)
{
return 0 ;
}
@Override
public XList rngProcess (final int startIndex, final int endIndex, final Operation operation)
{
return null ;
}
@Override
public XList rngProcess (final int startIndex, final int endIndex, final TOperation operation)
{
return null ;
}
@Override
public int rngScan (final int startIndex, final int endIndex, final Predicate predicate)
{
return 0 ;
}
@Override
public int rngScan (final int startIndex, final int endIndex, final TPredicate predicate)
{
return 0 ;
}
@Override
public E rngSearch (final int startIndex, final int endIndex, final Predicate predicate)
{
return null ;
}
@Override
public E rngSearch (final int startIndex, final int endIndex, final TPredicate predicate)
{
return null ;
}
@Override
public E[] rngToArray(final int startIndex, final int endIndex, final Class type)
{
return null ;
}
@Override
public Object[] rngToArray(final int startIndex, final int endIndex)
{
return null ;
}
@Override
public T[] rngToArray(final int startIndex, final int endIndex, final T[] a)
{
return null ;
}
@Override
public > C rngUnion (final int startIndex, final int endIndex, final XGettingCollection c, final Equalator comparatorr, final C targetCollection)
{
return null ;
}
@Override
public int scan (final Predicate predicate)
{
return 0 ;
}
@Override
public int scan (final TPredicate predicate)
{
return 0 ;
}
@Override
public SubList subList (final int fromIndex, final int toIndex)
{
return null ;
}
@Override
public XList toReversed ()
{
return null ;
}
@Override
public XInsertingList insert (final int index, final E element)
{
return null ;
}
@Override
public XInsertingList insert (final int index, final E... elements)
{
return null ;
}
@Override
public XInsertingList insert (final int index, final Iterable elements)
{
return null ;
}
@Override
public XInsertingList insert (final int index, final E[] elements, final int srcIndex, final int srcLength, final Predicate predicate, final int skip, final Integer limit)
{
return null ;
}
@Override
public XInsertingList insert (final int index, final Iterable elements, final int srcIndex, final Integer srcLength, final Predicate predicate, final int skip, final Integer limit)
{
return null ;
}
@Override
public XInsertingList insert (final int index, final E[] elements, final int srcIndex, final int srcLength, final TPredicate predicate, final int skip, final Integer limit)
{
return null ;
}
@Override
public XInsertingList insert (final int index, final Iterable elements, final int srcIndex, final Integer srcLength, final TPredicate predicate, final int skip, final Integer limit)
{
return null ;
}
@Override
public XInsertingList prepend (final E element)
{
return null ;
}
@Override
public int rngRemove (final int startIndex, final int endIndex, final E element, final Equalator equalator)
{
return 0 ;
}
@Override
public int rngRemove (final int startIndex, final int endIndex, final E element, final Equalator equalator,final int skip, final Integer limit)
{
return 0 ;
}
@Override
public int rngRemoveAll (final int startIndex, final int endIndex, final XCollection c, final boolean ignoreNulls, final Equalator equalator)
{
return 0 ;
}
@Override
public int rngRemoveDuplicates (final int startIndex, final int endIndex, final boolean keepMultipleNulls, final Equalator equalator)
{
return 0 ;
}
@Override
public E rngRemoveOne (final int startIndex, final int endIndex, final E o, final Equalator equalator)
{
return null ;
}
@Override
public int rngRetainAll (final int startIndex, final int endIndex, final XCollection c, final Equalator equalator)
{
return 0 ;
}
@Override
public int rngRemove (final int startIndex, final int endIndex, final E element)
{
return 0 ;
}
@Override
public int rngRemove (final int startIndex, final int endIndex, final E element,final int skip, final Integer limit)
{
return 0 ;
}
@Override
public int rngRemoveAll (final int startIndex, final int endIndex, final XCollection c, final boolean ignoreNulls)
{
return 0 ;
}
@Override
public int rngRemoveDuplicates (final int startIndex, final int endIndex, final boolean keepMultipleNulls)
{
return 0 ;
}
@Override
public E rngRemoveOne (final int startIndex, final int endIndex, final E o)
{
return null ;
}
@Override
public int rngRetainAll (final int startIndex, final int endIndex, final XCollection c)
{
return 0 ;
}
@Override
public E remove (final int index)
{
return null ;
}
@Override
public E removeFirst ()
{
return null ;
}
@Override
public E removeLast ()
{
return null ;
}
@Override
public XList removeRange (final int startIndex, final int endIndex)
{
return null ;
}
@Override
public int rngReduce (final int startIndex, final int endIndex, final Predicate predicate)
{
return 0 ;
}
@Override
public int rngReduce (final int startIndex, final int endIndex, final TPredicate predicate)
{
return 0 ;
}
@Override
public int rngReduce (final int startIndex, final int endIndex, final Predicate predicate,final int skip, final Integer limit)
{
return 0 ;
}
@Override
public int rngReduce (final int startIndex, final int endIndex, final TPredicate predicate,final int skip, final Integer limit)
{
return 0 ;
}
@Override
public void add (final int index, final E element)
{
}
@Override
public boolean addAll (final int index, final Collection c)
{
return false ;
}
@Override
public boolean contains (final Object o)
{
return false ;
}
@Override
public boolean containsAll (final Collection c)
{
return false ;
}
@Override
public int indexOf (final Object o)
{
return 0 ;
}
@Override
public int lastIndexOf (final Object o)
{
return 0 ;
}
@Override
public boolean remove (final Object o)
{
return false ;
}
@Override
public boolean removeAll (final Collection c)
{
return false ;
}
@Override
public boolean retainAll (final Collection c)
{
return false ;
}
@Override
public R aggregate (final Aggregate aggregate)
{
return null ;
}
@Override
public R rngAggregate (final int startIndex, final int endIndex, final Aggregate aggregate)
{
return null ;
}
@Override
public > L copyTo (final L targetCollection, final Predicate predicate)
{
return null ;
}
@Override
public > L copyTo (final L targetCollection, final TPredicate predicate)
{
return null ;
}
@Override
public > L copyTo (final L targetCollection, final Predicate predicate,final int skip, final Integer limit)
{
return null ;
}
@Override
public > L copyTo (final L targetCollection, final TPredicate predicate,final int skip, final Integer limit)
{
return null ;
}
@Override
public R aggregate (final TAggregate aggregate)
{
return null ;
}
@Override
public R rngAggregate (final int startIndex, final int endIndex, final TAggregate aggregate)
{
return null ;
}
@Override
public > L moveTo (final L target, final Predicate predicate)
{
return null ;
}
@Override
public > L moveTo (final L target, final TPredicate predicate)
{
return null ;
}
@Override
public > L moveTo (final L target, final Predicate predicate,final int skip, final Integer limit)
{
return null ;
}
@Override
public > L moveTo (final L target, final TPredicate predicate,final int skip, final Integer limit)
{
return null ;
}
@Override
public > L rngCopyTo (final int startIndex, final int endIndex, final L targetCollection, final Predicate predicate)
{
return null ;
}
@Override
public > L rngCopyTo (final int startIndex, final int endIndex, final L targetCollection, final TPredicate predicate)
{
return null ;
}
@Override
public > L rngCopyTo (final int startIndex, final int endIndex, final L targetCollection, final Predicate predicate,final int skip, final Integer limit)
{
return null ;
}
@Override
public > L rngCopyTo (final int startIndex, final int endIndex, final L targetCollection, final TPredicate predicate,final int skip, final Integer limit)
{
return null ;
}
@Override
public > L copyRange (final int startIndex, final int endIndex, final L targetCollection)
{
return null ;
}
@Override
public > L rngMoveTo (final int startIndex, final int endIndex, final L target, final Predicate predicate)
{
return null ;
}
@Override
public > L rngMoveTo (final int startIndex, final int endIndex, final L target, final TPredicate predicate)
{
return null ;
}
@Override
public > L rngMoveTo (final int startIndex, final int endIndex, final L target, final Predicate predicate,final int skip, final Integer limit)
{
return null ;
}
@Override
public > L