All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.xdev.jadoth.collections.SubList Maven / Gradle / Ivy

/*
 * XDEV Application Framework - XDEV Application Framework
 * Copyright © 2003 XDEV Software (https://xdev.software)
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program 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 Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program.  If not, see .
 */
/**
 *
 */
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 implementation of the Java Collection SubList concept for {@link XList} instances.
* See {@link List#subList(int, int)} * * @author Thomas Muenz * */ public class SubList extends SubListAccessor implements XList { /* * Three variants: * SubListReadOnlyView implements XGettingList * SubListView extends SubListReadOnlyView implements XSettingList * SubList extends SubListView implements XList */ /* * Write mini parser and generator to generate appropriate delegation methods */ // example for adding index delegation // add() -> return this.insert(this.offset+this.size, c); //example for rng~ method delegation // return this.rangeCheck(startIndex, endIndex) // ?this.list.idRngReplace(this.offset + startIndex, this.offset + endIndex - 1, oldElement, newElement) // :this.list.idRngReplace(this.offset + startIndex - 1, this.offset + endIndex, oldElement, newElement) // ; // beware size modification methods! // beware special case methods (like truncate())! 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; } /** * @param oldElement * @param newElement * @return */ @Override public int replace(final E oldElement, final E newElement, final Equalator equalator) { return 0; } /** * @param oldElement * @param newElement * @param limit * @return */ @Override public int replace(final E oldElement, final E newElement,final int skip, final Integer limit, final Equalator equalator) { return 0; } /** * @param oldElement * @param newElement * @return */ @Override public int replaceOne(final E oldElement, final E newElement, final Equalator equalator) { return 0; } /** * @param oldElement * @param newElement * @return */ @Override public int replace(final E oldElement, final E newElement) { return 0; } /** * @param oldElement * @param newElement * @param limit * @return */ @Override public int replace(final E oldElement, final E newElement,final int skip, final Integer limit) { return 0; } /** * @param oldElement * @param newElement * @return */ @Override public int replaceOne(final E oldElement, final E newElement) { return 0; } /** * @param replacementMapping * @return */ @Override public int replaceAll(final Map replacementMapping) { return 0; } /** * @param vc */ @Override public void appendTo(final VarChar vc) { } /** * @param vc * @param seperator */ @Override public void appendTo(final VarChar vc, final char seperator) { } /** * @param vc * @param seperator */ @Override public void appendTo(final VarChar vc, final String seperator) { } /** * @param predicate * @return */ @Override public boolean applies(final Predicate predicate) { return false; } /** * @param predicate * @return */ @Override public boolean applies(final TPredicate predicate) { return false; } /** * */ @Override public void clear() { } /** * @param predicate * @return */ @Override public boolean contains(final Predicate predicate) { return false; } /** * @param predicate * @return */ @Override public boolean contains(final TPredicate predicate) { return false; } /** * @param element * @param equalator * @return */ @Override public boolean contains(final E element, final Equalator equalator) { return false; } /** * @param predicate * @return */ @Override public int count(final Predicate predicate) { return 0; } /** * @param predicate * @return */ @Override public int count(final TPredicate predicate) { return 0; } /** * @param element * @return */ @Override public int count(final E element, final Equalator equalator) { return 0; } /** * @param element * @return */ @Override public E search(final E element, final Equalator equalator) { return null; } /** * @param list * @param comparator * @return */ @Override public boolean equals(final XGettingCollection list, final Equalator comparator) { return false; } /** * @param list * @param comparator * @return */ @Override public boolean equalsContent(final Collection list, final Equalator comparator) { return false; } /** * @param * @param other * @param comparator * @param target * @return */ @Override public > C except(final XGettingCollection other, final Equalator comparator, final C target) { return null; } /** * @param operation * @return */ @Override public SubList execute(final Operation operation) { return null; } /** * @param operation * @return */ @Override public SubList execute(final TOperation operation) { return null; } /** * @param comparator * @return */ @Override public boolean hasUniqueValues(final boolean ignoreMultipleNulls, final Equalator comparator) { return false; } /** * @param element * @return */ @Override public boolean containsId(final E element) { return false; } /** * @param element * @return */ @Override public int count(final E element) { return 0; } /** * @param ignoreMultipleNullValues * @return */ @Override public boolean hasUniqueValues(final boolean ignoreMultipleNullValues) { return false; } /** * @param * @param other * @param comparator * @param target * @return */ @Override public > C intersect(final XGettingCollection other, final Equalator comparator, final C target) { return null; } /** * @return */ @Override public boolean isEmpty() { return false; } /** * @param comparator * @return */ @Override public E max(final Comparator comparator) { return null; } /** * @param comparator * @return */ @Override public E min(final Comparator comparator) { return null; } /** * @param operation * @return */ @Override public SubList process(final Operation operation) { return null; } /** * @param operation * @return */ @Override public SubList process(final TOperation operation) { return null; } /** * @param predicate * @return */ @Override public E search(final Predicate predicate) { return null; } /** * @param predicate * @return */ @Override public E search(final TPredicate predicate) { return null; } /** * @return */ @Override public int size() { return 0; } /** * @return */ @Override public Object[] toArray() { return null; } /** * @param * @param a * @return */ @Override public T[] toArray(final T[] a) { return null; } /** * @param type * @return */ @Override public E[] toArray(final Class type) { return null; } /** * @param * @param other * @param comparator * @param target * @return */ @Override public > C union(final XGettingCollection other, final Equalator comparator, final C target) { return null; } /** * @return */ @Override public Iterator iterator() { return null; } /** * @param e * @return */ @Override public boolean add(final E e) { return false; } /** * @param elements * @return */ @Override public XAddingCollection add(final E... elements) { return null; } /** * @param elements * @return */ @Override public XAddingCollection add(final Iterable elements) { return null; } /** * @param elements * @param srcIndex * @param srcLength * @param predicate * @param limit * @return */ @Override public XAddingCollection add(final E[] elements, final int srcIndex, final int srcLength, final Predicate predicate, final int skip, final Integer limit) { return null; } /** * @param elements * @param srcIndex * @param srcLength * @param predicate * @param limit * @return */ @Override public XAddingCollection add(final Iterable elements, final int srcIndex, final Integer srcLength, final Predicate predicate, final int skip, final Integer limit) { return null; } /** * @param elements * @param srcIndex * @param srcLength * @param predicate * @param limit * @return */ @Override public XAddingCollection add(final E[] elements, final int srcIndex, final int srcLength, final TPredicate predicate, final int skip, final Integer limit) { return null; } /** * @param elements * @param srcIndex * @param srcLength * @param predicate * @param limit * @return */ @Override public XAddingCollection add(final Iterable elements, final int srcIndex, final Integer srcLength, final TPredicate predicate, final int skip, final Integer limit) { return null; } /** * @param c * @return */ @Override public boolean addAll(final Collection c) { return false; } /** * @param element * @return */ @Override public int remove(final E element, final Equalator equalator) { return 0; } /** * @param element * @param limit * @return */ @Override public int remove(final E element,final int skip, final Integer limit, final Equalator equalator) { return 0; } /** * @param c * @param ingoreNulls * @return */ @Override public int removeAll(final XCollection c, final boolean ingoreNulls, final Equalator equalator) { return 0; } /** * @param keepMultipleNullValues * @return */ @Override public int removeDuplicates(final boolean keepMultipleNullValues, final Equalator equalator) { return 0; } /** * @param element * @return */ @Override public E removeOne(final E element, final Equalator equalator) { return null; } /** * @param c * @return */ @Override public int retainAll(final XCollection c, final Equalator equalator) { return 0; } /** * @param element * @return */ @Override public int removeId(final E element) { return 0; } /** * @param element * @param limit * @return */ @Override public int removeId(final E element,final int skip, final Integer limit) { return 0; } /** * @param c * @param ingoreNulls * @return */ @Override public int removeAllId(final XCollection c, final boolean ingoreNulls) { return 0; } /** * @param keepMultipleNullValues * @return */ @Override public int removeDuplicates(final boolean keepMultipleNullValues) { return 0; } /** * @param element * @return */ @Override public E removeOne(final E element) { return null; } /** * @param c * @return */ @Override public int retainAllId(final XCollection c) { return 0; } /** * @param predicate * @return */ @Override public int reduce(final Predicate predicate) { return 0; } /** * @param predicate * @return */ @Override public int reduce(final TPredicate predicate) { return 0; } /** * @param predicate * @param limit * @return */ @Override public int reduce(final Predicate predicate,final int skip, final Integer limit) { return 0; } /** * @param predicate * @param limit * @return */ @Override public int reduce(final TPredicate predicate,final int skip, final Integer limit) { return 0; } /** * @return */ @Override public XList truncate() { return null; } /** * @param startIndex * @param endIndex * @param oldElement * @param newElement * @return */ @Override public int rngReplace( final int startIndex, final int endIndex, final E oldElement, final E newElement, final Equalator equalator ) { return 0; } /** * @param startIndex * @param endIndex * @param oldElement * @param newElement * @param limit * @return */ @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; } /** * @param startIndex * @param endIndex * @param oldElement * @param newElement * @return */ @Override public int rngReplaceOne( final int startIndex, final int endIndex, final E oldElement, final E newElement, final Equalator equalator ) { return 0; } /** * @param startIndex * @param endIndex * @param element * @return */ @Override public XList fill(final int startIndex, final int endIndex, final E element) { return null; } /** * @param startIndex * @param endIndex * @param oldElement * @param newElement * @return */ @Override public int rngReplace(final int startIndex, final int endIndex, final E oldElement, final E newElement) { return 0; } /** * @param startIndex * @param endIndex * @param oldElement * @param newElement * @param limit * @return */ @Override public int rngReplace(final int startIndex, final int endIndex, final E oldElement, final E newElement,final int skip, final Integer limit) { return 0; } /** * @param startIndex * @param endIndex * @param oldElement * @param newElement * @return */ @Override public int rngReplaceOne(final int startIndex, final int endIndex, final E oldElement, final E newElement) { return 0; } /** * @return */ @Override public XList reverse() { return null; } /** * @param startIndex * @param endIndex * @param replacementMapping * @return */ @Override public int rngReplaceAll(final int startIndex, final int endIndex, final Map replacementMapping) { return 0; } /** * @param startIndex * @param endIndex * @return */ @Override public XList rngReverse(final int startIndex, final int endIndex) { return null; } /** * @param startIndex * @param endIndex * @return */ @Override public XList rngShuffle(final int startIndex, final int endIndex) { return null; } /** * @param startIndex * @param endIndex * @param comparator * @return */ @Override public XList rngSortMerge(final int startIndex, final int endIndex, final Comparator comparator) { return null; } /** * @param startIndex * @param endIndex * @param comparator * @return */ @Override public XList rngSortQuick(final int startIndex, final int endIndex, final Comparator comparator) { return null; } /** * @param index * @param element * @return */ @Override public E set(final int index, final E element) { return null; } /** * @param startIndex * @param elements * @return */ @Override public XList set(final int startIndex, final E... elements) { return null; } /** * @param startIndex * @param elements * @param elementsStartIndex * @param length * @return */ @Override public XList set(final int startIndex, final E[] elements, final int elementsStartIndex, final int length) { return null; } /** * @param startIndex * @param elements * @param elementsStartIndex * @param length * @return */ @Override public XList set(final int startIndex, final List elements, final int elementsStartIndex, final int length) { return null; } /** * @param element */ @Override public void setFirst(final E element) { } /** * @param element */ @Override public void setLast(final E element) { } /** * @return */ @Override public XList shuffle() { return null; } /** * @param comparator * @return */ @Override public XList sortMerge(final Comparator comparator) { return null; } /** * @param comparator * @return */ @Override public XList sortQuick(final Comparator comparator) { return null; } /** * @param indexA * @param indexB */ @Override public void swap(final int indexA, final int indexB) { } /** * @param indexA * @param indexB * @param length */ @Override public void swap(final int indexA, final int indexB, final int length) { } /** * @param element * @param comparator * @return */ @Override public int binarySearch(final E element, final Comparator comparator) { return 0; } /** * @return */ @Override public XList copy() { return null; } /** * @param o * @return */ @Override public int indexOf(final E o, final Equalator equalator) { return 0; } /** * @param o * @return */ @Override public int lastIndexOf(final E o, final Equalator equalator) { return 0; } /** * @param startIndex * @param endIndex * @param c * @param ignoreNulls * @return */ @Override public boolean rngContainsAll(final int startIndex, final int endIndex, final Collection c, final boolean ignoreNulls, final Equalator equalator) { return false; } /** * @param startIndex * @param endIndex * @param element * @return */ @Override public int rngCount(final int startIndex, final int endIndex, final E element, final Equalator equalator) { return 0; } /** * @param startIndex * @param endIndex * @param o * @return */ @Override public int rngIndexOf(final int startIndex, final int endIndex, final E o, final Equalator equalator) { return 0; } /** * @param index * @return */ @Override public E get(final int index) { return null; } /** * @return */ @Override public E getFirst() { return null; } /** * @return */ @Override public E getLast() { return null; } /** * @param o * @return */ @Override public int indexOfId(final E o) { return 0; } /** * @param o * @return */ @Override public int lastIndexOfId(final E o) { return 0; } /** * @param startIndex * @param endIndex * @param o * @return */ @Override public boolean rngContainsId(final int startIndex, final int endIndex, final E o) { return false; } /** * @param startIndex * @param endIndex * @param c * @param ignoreNulls * @return */ @Override public boolean rngContainsAll(final int startIndex, final int endIndex, final Collection c, final boolean ignoreNulls) { return false; } /** * @param startIndex * @param endIndex * @param element * @return */ @Override public int rngCount(final int startIndex, final int endIndex, final E element) { return 0; } /** * @param startIndex * @param endIndex * @param ignoreMultipleNullValues * @return */ @Override public boolean rngHasUniqueValues(final int startIndex, final int endIndex, final boolean ignoreMultipleNullValues) { return false; } /** * @param startIndex * @param endIndex * @param o * @return */ @Override public int rngIndexOfId(final int startIndex, final int endIndex, final E o) { return 0; } /** * @param predicate * @return */ @Override public int indexOf(final Predicate predicate) { return 0; } /** * @param predicate * @return */ @Override public int indexOf(final TPredicate predicate) { return 0; } /** * @param comparator * @return */ @Override public boolean isSorted(final Comparator comparator) { return false; } /** * @return */ @Override public ListIterator listIterator() { return null; } /** * @param i * @return */ @Override public ListIterator listIterator(final int i) { return null; } /** * @param comparator * @return */ @Override public int maxIndex(final Comparator comparator) { return 0; } /** * @param comparator * @return */ @Override public int minIndex(final Comparator comparator) { return 0; } /** * @param startIndex * @param endIndex * @param vc */ @Override public void rngAppendTo(final int startIndex, final int endIndex, final VarChar vc) { } /** * @param startIndex * @param endIndex * @param vc * @param seperator */ @Override public void rngAppendTo(final int startIndex, final int endIndex, final VarChar vc, final String seperator) { } /** * @param startIndex * @param endIndex * @param vc * @param seperator */ @Override public void rngAppendTo(final int startIndex, final int endIndex, final VarChar vc, final char seperator) { } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public boolean rngApplies(final int startIndex, final int endIndex, final Predicate predicate) { return false; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public boolean rngApplies(final int startIndex, final int endIndex, final TPredicate predicate) { return false; } /** * @param startIndex * @param endIndex * @param element * @param comparator * @return */ @Override public int rngBinarySearch(final int startIndex, final int endIndex, final E element, final Comparator comparator) { return 0; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public boolean rngContains(final int startIndex, final int endIndex, final Predicate predicate) { return false; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public boolean rngContains(final int startIndex, final int endIndex, final TPredicate predicate) { return false; } /** * @param startIndex * @param endIndex * @param element * @param comparator * @return */ @Override public boolean rngContains(final int startIndex, final int endIndex, final E element, final Equalator comparator) { return false; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public int rngCount(final int startIndex, final int endIndex, final Predicate predicate) { return 0; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public int rngCount(final int startIndex, final int endIndex, final TPredicate predicate) { return 0; } /** * @param startIndex * @param endIndex * @param element * @return */ @Override public E rngSearch(final int startIndex, final int endIndex, final E element, final Equalator equalator) { return null; } /** * @param startIndex * @param list * @param length * @param comparator * @return */ @Override public boolean rngEqualsContent(final int startIndex, final List list, final int length, final Equalator comparator) { return false; } /** * @param * @param startIndex * @param endIndex * @param c * @param comparatorr * @param targetCollection * @return */ @Override public > C rngExcept(final int startIndex, final int endIndex, final XGettingCollection c, final Equalator comparatorr, final C targetCollection) { return null; } /** * @param startIndex * @param endIndex * @param operation * @return */ @Override public XList rngExecute(final int startIndex, final int endIndex, final Operation operation) { return null; } /** * @param startIndex * @param endIndex * @param operation * @return */ @Override public XList rngExecute(final int startIndex, final int endIndex, final TOperation operation) { return null; } /** * @param startIndex * @param endIndex * @param comparator * @return */ @Override public boolean rngHasUniqueValues(final int startIndex, final int endIndex, final boolean ignoreMultipleNulls, final Equalator comparator) { return false; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public int rngIndexOf(final int startIndex, final int endIndex, final Predicate predicate) { return 0; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public int rngIndexOf(final int startIndex, final int endIndex, final TPredicate predicate) { return 0; } /** * @param * @param startIndex * @param endIndex * @param c * @param comparator * @param targetCollection * @return */ @Override public > C rngIntersect(final int startIndex, final int endIndex, final XGettingCollection c, final Equalator comparator, final C targetCollection) { return null; } /** * @param startIndex * @param endIndex * @param comparator * @return */ @Override public boolean rngIsSorted(final int startIndex, final int endIndex, final Comparator comparator) { return false; } /** * @param startIndex * @param endIndex * @param comparator * @return */ @Override public E rngMax(final int startIndex, final int endIndex, final Comparator comparator) { return null; } /** * @param startIndex * @param endIndex * @param comparator * @return */ @Override public int rngMaxIndex(final int startIndex, final int endIndex, final Comparator comparator) { return 0; } /** * @param startIndex * @param endIndex * @param comparator * @return */ @Override public E rngMin(final int startIndex, final int endIndex, final Comparator comparator) { return null; } /** * @param startIndex * @param endIndex * @param comparator * @return */ @Override public int rngMinIndex(final int startIndex, final int endIndex, final Comparator comparator) { return 0; } /** * @param startIndex * @param endIndex * @param operation * @return */ @Override public XList rngProcess(final int startIndex, final int endIndex, final Operation operation) { return null; } /** * @param startIndex * @param endIndex * @param operation * @return */ @Override public XList rngProcess(final int startIndex, final int endIndex, final TOperation operation) { return null; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public int rngScan(final int startIndex, final int endIndex, final Predicate predicate) { return 0; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public int rngScan(final int startIndex, final int endIndex, final TPredicate predicate) { return 0; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public E rngSearch(final int startIndex, final int endIndex, final Predicate predicate) { return null; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public E rngSearch(final int startIndex, final int endIndex, final TPredicate predicate) { return null; } /** * @param startIndex * @param endIndex * @param type * @return */ @Override public E[] rngToArray(final int startIndex, final int endIndex, final Class type) { return null; } /** * @param startIndex * @param endIndex * @return */ @Override public Object[] rngToArray(final int startIndex, final int endIndex) { return null; } /** * @param * @param startIndex * @param endIndex * @param a * @return */ @Override public T[] rngToArray(final int startIndex, final int endIndex, final T[] a) { return null; } /** * @param * @param startIndex * @param endIndex * @param c * @param comparatorr * @param targetCollection * @return */ @Override public > C rngUnion(final int startIndex, final int endIndex, final XGettingCollection c, final Equalator comparatorr, final C targetCollection) { return null; } /** * @param predicate * @return */ @Override public int scan(final Predicate predicate) { return 0; } /** * @param predicate * @return */ @Override public int scan(final TPredicate predicate) { return 0; } /** * @param fromIndex * @param toIndex * @return */ @Override public SubList subList(final int fromIndex, final int toIndex) { return null; } /** * @return */ @Override public XList toReversed() { return null; } /** * @param index * @param element * @return */ @Override public XInsertingList insert(final int index, final E element) { return null; } /** * @param index * @param elements * @return */ @Override public XInsertingList insert(final int index, final E... elements) { return null; } /** * @param index * @param elements * @return */ @Override public XInsertingList insert(final int index, final Iterable elements) { return null; } /** * @param index * @param elements * @param srcIndex * @param srcLength * @param predicate * @param limit * @return */ @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; } /** * @param index * @param elements * @param srcIndex * @param srcLength * @param predicate * @param limit * @return */ @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; } /** * @param index * @param elements * @param srcIndex * @param srcLength * @param predicate * @param limit * @return */ @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; } /** * @param index * @param elements * @param srcIndex * @param srcLength * @param predicate * @param limit * @return */ @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; } /** * @param element * @return */ @Override public XInsertingList prepend(final E element) { return null; } /** * @param startIndex * @param endIndex * @param element * @return */ @Override public int rngRemove(final int startIndex, final int endIndex, final E element, final Equalator equalator) { return 0; } /** * @param startIndex * @param endIndex * @param element * @param limit * @return */ @Override public int rngRemove(final int startIndex, final int endIndex, final E element, final Equalator equalator,final int skip, final Integer limit) { return 0; } /** * @param startIndex * @param endIndex * @param c * @param ignoreNulls * @return */ @Override public int rngRemoveAll(final int startIndex, final int endIndex, final XCollection c, final boolean ignoreNulls, final Equalator equalator) { return 0; } /** * @param startIndex * @param endIndex * @param keepMultipleNulls * @return */ @Override public int rngRemoveDuplicates(final int startIndex, final int endIndex, final boolean keepMultipleNulls, final Equalator equalator) { return 0; } /** * @param startIndex * @param endIndex * @param o * @return */ @Override public E rngRemoveOne(final int startIndex, final int endIndex, final E o, final Equalator equalator) { return null; } /** * @param startIndex * @param endIndex * @param c * @return */ @Override public int rngRetainAll(final int startIndex, final int endIndex, final XCollection c, final Equalator equalator) { return 0; } /** * @param startIndex * @param endIndex * @param element * @return */ @Override public int rngRemove(final int startIndex, final int endIndex, final E element) { return 0; } /** * @param startIndex * @param endIndex * @param element * @param limit * @return */ @Override public int rngRemove(final int startIndex, final int endIndex, final E element,final int skip, final Integer limit) { return 0; } /** * @param startIndex * @param endIndex * @param c * @param ignoreNulls * @return */ @Override public int rngRemoveAll(final int startIndex, final int endIndex, final XCollection c, final boolean ignoreNulls) { return 0; } /** * @param startIndex * @param endIndex * @param keepMultipleNulls * @return */ @Override public int rngRemoveDuplicates(final int startIndex, final int endIndex, final boolean keepMultipleNulls) { return 0; } /** * @param startIndex * @param endIndex * @param o * @return */ @Override public E rngRemoveOne(final int startIndex, final int endIndex, final E o) { return null; } /** * @param startIndex * @param endIndex * @param c * @return */ @Override public int rngRetainAll(final int startIndex, final int endIndex, final XCollection c) { return 0; } /** * @param index * @return */ @Override public E remove(final int index) { return null; } /** * @return */ @Override public E removeFirst() { return null; } /** * @return */ @Override public E removeLast() { return null; } /** * @param startIndex * @param endIndex * @return */ @Override public XList removeRange(final int startIndex, final int endIndex) { return null; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public int rngReduce(final int startIndex, final int endIndex, final Predicate predicate) { return 0; } /** * @param startIndex * @param endIndex * @param predicate * @return */ @Override public int rngReduce(final int startIndex, final int endIndex, final TPredicate predicate) { return 0; } /** * @param startIndex * @param endIndex * @param predicate * @param limit * @return */ @Override public int rngReduce(final int startIndex, final int endIndex, final Predicate predicate,final int skip, final Integer limit) { return 0; } /** * @param startIndex * @param endIndex * @param predicate * @param limit * @return */ @Override public int rngReduce(final int startIndex, final int endIndex, final TPredicate predicate,final int skip, final Integer limit) { return 0; } /** * @param index * @param element */ @Override public void add(final int index, final E element) { } /** * @param index * @param c * @return */ @Override public boolean addAll(final int index, final Collection c) { return false; } /** * @param o * @return */ @Override public boolean contains(final Object o) { return false; } /** * @param c * @return */ @Override public boolean containsAll(final Collection c) { return false; } /** * @param o * @return */ @Override public int indexOf(final Object o) { return 0; } /** * @param o * @return */ @Override public int lastIndexOf(final Object o) { return 0; } /** * @param o * @return */ @Override public boolean remove(final Object o) { return false; } /** * @param c * @return */ @Override public boolean removeAll(final Collection c) { return false; } /** * @param c * @return */ @Override public boolean retainAll(final Collection c) { return false; } /** * @param * @param aggregate * @return * @see com.xdev.jadoth.collections.XGettingCollection#aggregate(com.xdev.jadoth.lang.functional.aggregates.Aggregate) */ @Override public R aggregate(final Aggregate aggregate) { return null; } /** * @param * @param startIndex * @param endIndex * @param aggregate * @return * @see com.xdev.jadoth.collections.XGettingList#rngAggregate(int, int, com.xdev.jadoth.lang.functional.aggregates.Aggregate) */ @Override public R rngAggregate(final int startIndex, final int endIndex, final Aggregate aggregate) { return null; } /** * @param * @param targetCollection * @param predicate * @return * @see com.xdev.jadoth.collections.XGettingCollection#copyTo(com.xdev.jadoth.collections.XGettingCollection, com.xdev.jadoth.lang.functional.Predicate) */ @Override public > L copyTo(final L targetCollection, final Predicate predicate) { return null; } /** * @param * @param targetCollection * @param predicate * @return * @see com.xdev.jadoth.collections.XGettingCollection#copyTo(com.xdev.jadoth.collections.XGettingCollection, com.xdev.jadoth.lang.functional.controlflow.TPredicate) */ @Override public > L copyTo(final L targetCollection, final TPredicate predicate) { return null; } /** * @param * @param targetCollection * @param predicate * @param limit * @return * @see com.xdev.jadoth.collections.XGettingCollection#copyTo(com.xdev.jadoth.collections.XGettingCollection, com.xdev.jadoth.lang.functional.Predicate, int) */ @Override public > L copyTo(final L targetCollection, final Predicate predicate,final int skip, final Integer limit) { return null; } /** * @param * @param targetCollection * @param predicate * @param limit * @return * @see com.xdev.jadoth.collections.XGettingCollection#copyTo(com.xdev.jadoth.collections.XGettingCollection, com.xdev.jadoth.lang.functional.controlflow.TPredicate, int) */ @Override public > L copyTo(final L targetCollection, final TPredicate predicate,final int skip, final Integer limit) { return null; } /** * @param * @param aggregate * @return * @see com.xdev.jadoth.collections.XGettingCollection#aggregate(com.xdev.jadoth.lang.functional.aggregates.TAggregate) */ @Override public R aggregate(final TAggregate aggregate) { return null; } /** * @param * @param startIndex * @param endIndex * @param aggregate * @return * @see com.xdev.jadoth.collections.XGettingList#rngAggregate(int, int, com.xdev.jadoth.lang.functional.aggregates.TAggregate) */ @Override public R rngAggregate(final int startIndex, final int endIndex, final TAggregate aggregate) { return null; } /** * @param * @param target * @param predicate * @return * @see com.xdev.jadoth.collections.XRemovingCollection#moveTo(com.xdev.jadoth.collections.XGettingCollection, com.xdev.jadoth.lang.functional.Predicate) */ @Override public > L moveTo(final L target, final Predicate predicate) { return null; } /** * @param * @param target * @param predicate * @return * @see com.xdev.jadoth.collections.XRemovingCollection#moveTo(com.xdev.jadoth.collections.XGettingCollection, com.xdev.jadoth.lang.functional.controlflow.TPredicate) */ @Override public > L moveTo(final L target, final TPredicate predicate) { return null; } /** * @param * @param target * @param predicate * @param limit * @return * @see com.xdev.jadoth.collections.XRemovingCollection#moveTo(com.xdev.jadoth.collections.XGettingCollection, com.xdev.jadoth.lang.functional.Predicate, int) */ @Override public > L moveTo(final L target, final Predicate predicate,final int skip, final Integer limit) { return null; } /** * @param * @param target * @param predicate * @param limit * @return * @see com.xdev.jadoth.collections.XRemovingCollection#moveTo(com.xdev.jadoth.collections.XGettingCollection, com.xdev.jadoth.lang.functional.controlflow.TPredicate, int) */ @Override public > L moveTo(final L target, final TPredicate predicate,final int skip, final Integer limit) { return null; } /** * @param * @param startIndex * @param endIndex * @param targetCollection * @param predicate * @return * @see com.xdev.jadoth.collections.XGettingList#rngCopyTo(int, int, com.xdev.jadoth.collections.XAddingCollection, com.xdev.jadoth.lang.functional.Predicate) */ @Override public > L rngCopyTo(final int startIndex, final int endIndex, final L targetCollection, final Predicate predicate) { return null; } /** * @param * @param startIndex * @param endIndex * @param targetCollection * @param predicate * @return * @see com.xdev.jadoth.collections.XGettingList#rngCopyTo(int, int, com.xdev.jadoth.collections.XAddingCollection, com.xdev.jadoth.lang.functional.controlflow.TPredicate) */ @Override public > L rngCopyTo(final int startIndex, final int endIndex, final L targetCollection, final TPredicate predicate) { return null; } /** * @param * @param startIndex * @param endIndex * @param targetCollection * @param predicate * @param limit * @return * @see com.xdev.jadoth.collections.XGettingList#rngCopyTo(int, int, com.xdev.jadoth.collections.XAddingCollection, com.xdev.jadoth.lang.functional.Predicate, int) */ @Override public > L rngCopyTo(final int startIndex, final int endIndex, final L targetCollection, final Predicate predicate,final int skip, final Integer limit) { return null; } /** * @param * @param startIndex * @param endIndex * @param targetCollection * @param predicate * @param limit * @return * @see com.xdev.jadoth.collections.XGettingList#rngCopyTo(int, int, com.xdev.jadoth.collections.XAddingCollection, com.xdev.jadoth.lang.functional.controlflow.TPredicate, int) */ @Override public > L rngCopyTo(final int startIndex, final int endIndex, final L targetCollection, final TPredicate predicate,final int skip, final Integer limit) { return null; } /** * @param * @param startIndex * @param endIndex * @param targetCollection * @return * @see com.xdev.jadoth.collections.XGettingList#copyRange(int, int, com.xdev.jadoth.collections.XAddingCollection) */ @Override public > L copyRange(final int startIndex, final int endIndex, final L targetCollection) { return null; } /** * @param * @param startIndex * @param endIndex * @param target * @param predicate * @return * @see com.xdev.jadoth.collections.XRemovingList#rngMoveTo(int, int, com.xdev.jadoth.collections.XAddingCollection, com.xdev.jadoth.lang.functional.Predicate) */ @Override public > L rngMoveTo(final int startIndex, final int endIndex, final L target, final Predicate predicate) { return null; } /** * @param * @param startIndex * @param endIndex * @param target * @param predicate * @return * @see com.xdev.jadoth.collections.XRemovingList#rngMoveTo(int, int, com.xdev.jadoth.collections.XAddingCollection, com.xdev.jadoth.lang.functional.controlflow.TPredicate) */ @Override public > L rngMoveTo(final int startIndex, final int endIndex, final L target, final TPredicate predicate) { return null; } /** * @param * @param startIndex * @param endIndex * @param target * @param predicate * @param limit * @return * @see com.xdev.jadoth.collections.XRemovingList#rngMoveTo(int, int, com.xdev.jadoth.collections.XAddingCollection, com.xdev.jadoth.lang.functional.Predicate, int) */ @Override public > L rngMoveTo(final int startIndex, final int endIndex, final L target, final Predicate predicate,final int skip, final Integer limit) { return null; } /** * @param * @param startIndex * @param endIndex * @param target * @param predicate * @param limit * @return * @see com.xdev.jadoth.collections.XRemovingList#rngMoveTo(int, int, com.xdev.jadoth.collections.XAddingCollection, com.xdev.jadoth.lang.functional.controlflow.TPredicate, int) */ @Override public > L rngMoveTo(final int startIndex, final int endIndex, final L target, final TPredicate predicate,final int skip, final Integer limit) { return null; } /** * @param c * @param ignoreNulls * @param equalator * @return * @see com.xdev.jadoth.collections.XGettingCollection#containsAll(java.util.Collection, boolean, com.xdev.jadoth.lang.Equalator) */ @Override public boolean containsAll(final Collection c, final boolean ignoreNulls, final Equalator equalator) { return false; } /** * @param c * @param ignoreNulls * @return * @see com.xdev.jadoth.collections.XGettingCollection#containsAll(java.util.Collection, boolean) */ @Override public boolean containsAll(final Collection c, final boolean ignoreNulls) { return false; } /** * @param comparator * @return * @see com.xdev.jadoth.collections.XSettingList#sort(java.util.Comparator) */ @Override public void sort(final Comparator comparator) { } /** * @param * @param targetCollection * @return * @see com.xdev.jadoth.collections.XGettingCollection#distinct(com.xdev.jadoth.collections.Collecting) */ @Override public > C distinct(final C targetCollection) { return null; } /** * @param * @param targetCollection * @param equalator * @return * @see com.xdev.jadoth.collections.XGettingCollection#distinct(com.xdev.jadoth.collections.Collecting, com.xdev.jadoth.lang.Equalator) */ @Override public > C distinct(final C targetCollection, final Equalator equalator) { return null; } /** * @param oldElements * @param newElement * @return * @see com.xdev.jadoth.collections.XSettingCollection#replaceAll(E[], java.lang.Object) */ @Override public int replaceAll(final E[] oldElements, final E newElement) { return 0; } /** * @param oldElements * @param newElement * @param equalator * @return * @see com.xdev.jadoth.collections.XSettingCollection#replaceAll(E[], java.lang.Object, com.xdev.jadoth.lang.Equalator) */ @Override public int replaceAll(final E[] oldElements, final E newElement, final Equalator equalator) { return 0; } /** * @param oldElements * @param newElement * @return * @see com.xdev.jadoth.collections.XSettingCollection#replaceAll(XGettingCollection, java.lang.Object) */ @Override public int replaceAll(final XGettingCollection oldElements, final E newElement) { return 0; } /** * @param oldElements * @param newElement * @param equalator * @return * @see com.xdev.jadoth.collections.XSettingCollection#replaceAll(com.xdev.jadoth.collections.XGettingCollection, java.lang.Object, com.xdev.jadoth.lang.Equalator) */ @Override public int replaceAll(final XGettingCollection oldElements, final E newElement, final Equalator equalator) { return 0; } /** * @param predicate * @param newElement * @return * @see com.xdev.jadoth.collections.XSettingCollection#replace(com.xdev.jadoth.lang.functional.Predicate, java.lang.Object) */ @Override public int replace(final Predicate predicate, final E newElement) { return 0; } /** * @param predicate * @param newElement * @return * @see com.xdev.jadoth.collections.XSettingCollection#replace(com.xdev.jadoth.lang.functional.controlflow.TPredicate, java.lang.Object) */ @Override public int replace(final TPredicate predicate, final E newElement) { return 0; } /** * @param predicate * @param newElement * @param skip * @param limit * @return * @see com.xdev.jadoth.collections.XSettingCollection#replace(com.xdev.jadoth.lang.functional.Predicate, java.lang.Object, int, int) */ @Override public int replace(final Predicate predicate, final E newElement, final int skip, final Integer limit) { return 0; } /** * @param predicate * @param newElement * @param skip * @param limit * @return * @see com.xdev.jadoth.collections.XSettingCollection#replace(com.xdev.jadoth.lang.functional.controlflow.TPredicate, java.lang.Object, int, int) */ @Override public int replace(final TPredicate predicate, final E newElement, final int skip, final Integer limit) { return 0; } /** * @param predicate * @param newElement * @return * @see com.xdev.jadoth.collections.XSettingCollection#replaceOne(com.xdev.jadoth.lang.functional.Predicate, java.lang.Object) */ @Override public int replaceOne(final Predicate predicate, final E newElement) { return 0; } /** * @param predicate * @param newElement * @return * @see com.xdev.jadoth.collections.XSettingCollection#replaceOne(com.xdev.jadoth.lang.functional.controlflow.TPredicate, java.lang.Object) */ @Override public int replaceOne(final TPredicate predicate, final E newElement) { return 0; } /** * @param oldElements * @param newElement * @param skip * @param limit * @return * @see com.xdev.jadoth.collections.XSettingCollection#replaceAll(E[], java.lang.Object, int, int) */ @Override public int replaceAll(final E[] oldElements, final E newElement, final int skip, final Integer limit) { return 0; } /** * @param oldElements * @param newElement * @param skip * @param limit * @param equalator * @return * @see com.xdev.jadoth.collections.XSettingCollection#replaceAll(E[], java.lang.Object, int, int, com.xdev.jadoth.lang.Equalator) */ @Override public int replaceAll(final E[] oldElements, final E newElement, final int skip, final Integer limit, final Equalator equalator) { return 0; } /** * @param oldElements * @param newElement * @param skip * @param limit * @return * @see com.xdev.jadoth.collections.XSettingCollection#replaceAll(XGettingCollection, java.lang.Object, int, int) */ @Override public int replaceAll(final XGettingCollection oldElements, final E newElement, final int skip, final Integer limit) { return 0; } /** * @param oldElements * @param newElement * @param skip * @param limit * @param equalator * @return * @see com.xdev.jadoth.collections.XSettingCollection#replaceAll(com.xdev.jadoth.collections.XGettingCollection, java.lang.Object, int, int, com.xdev.jadoth.lang.Equalator) */ @Override public int replaceAll(final XGettingCollection oldElements, final E newElement, final int skip, final Integer limit, final Equalator equalator) { return 0; } }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy