mirror of
https://github.com/github/codeql.git
synced 2026-05-04 05:05:12 +02:00
Generate stubs
This commit is contained in:
@@ -0,0 +1,11 @@
|
||||
// Generated automatically from org.apache.commons.collections4.BoundedCollection for testing purposes
|
||||
|
||||
package org.apache.commons.collections4;
|
||||
|
||||
import java.util.Collection;
|
||||
|
||||
public interface BoundedCollection<E> extends Collection<E>
|
||||
{
|
||||
boolean isFull();
|
||||
int maxSize();
|
||||
}
|
||||
11
java/ql/test/stubs/apache-commons-collections4-4.4/org/apache/commons/collections4/BoundedMap.java
generated
Normal file
11
java/ql/test/stubs/apache-commons-collections4-4.4/org/apache/commons/collections4/BoundedMap.java
generated
Normal file
@@ -0,0 +1,11 @@
|
||||
// Generated automatically from org.apache.commons.collections4.BoundedMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4;
|
||||
|
||||
import org.apache.commons.collections4.IterableMap;
|
||||
|
||||
public interface BoundedMap<K, V> extends IterableMap<K, V>
|
||||
{
|
||||
boolean isFull();
|
||||
int maxSize();
|
||||
}
|
||||
@@ -0,0 +1,13 @@
|
||||
// Generated automatically from org.apache.commons.collections4.SortedBidiMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4;
|
||||
|
||||
import java.util.Comparator;
|
||||
import java.util.SortedMap;
|
||||
import org.apache.commons.collections4.OrderedBidiMap;
|
||||
|
||||
public interface SortedBidiMap<K, V> extends OrderedBidiMap<K, V>, SortedMap<K, V>
|
||||
{
|
||||
Comparator<? super V> valueComparator();
|
||||
SortedBidiMap<V, K> inverseBidiMap();
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.AbstractBagDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.Bag;
|
||||
import org.apache.commons.collections4.collection.AbstractCollectionDecorator;
|
||||
|
||||
abstract public class AbstractBagDecorator<E> extends AbstractCollectionDecorator<E> implements Bag<E>
|
||||
{
|
||||
protected AbstractBagDecorator(){}
|
||||
protected AbstractBagDecorator(Bag<E> p0){}
|
||||
protected Bag<E> decorated(){ return null; }
|
||||
public Set<E> uniqueSet(){ return null; }
|
||||
public boolean add(E p0, int p1){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public boolean remove(Object p0, int p1){ return false; }
|
||||
public int getCount(Object p0){ return 0; }
|
||||
public int hashCode(){ return 0; }
|
||||
}
|
||||
@@ -0,0 +1,17 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.AbstractSortedBagDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.util.Comparator;
|
||||
import org.apache.commons.collections4.SortedBag;
|
||||
import org.apache.commons.collections4.bag.AbstractBagDecorator;
|
||||
|
||||
abstract public class AbstractSortedBagDecorator<E> extends AbstractBagDecorator<E> implements SortedBag<E>
|
||||
{
|
||||
protected AbstractSortedBagDecorator(){}
|
||||
protected AbstractSortedBagDecorator(SortedBag<E> p0){}
|
||||
protected SortedBag<E> decorated(){ return null; }
|
||||
public Comparator<? super E> comparator(){ return null; }
|
||||
public E first(){ return null; }
|
||||
public E last(){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,21 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.CollectionBag for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.util.Collection;
|
||||
import org.apache.commons.collections4.Bag;
|
||||
import org.apache.commons.collections4.bag.AbstractBagDecorator;
|
||||
|
||||
public class CollectionBag<E> extends AbstractBagDecorator<E>
|
||||
{
|
||||
protected CollectionBag() {}
|
||||
public CollectionBag(Bag<E> p0){}
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean add(E p0, int p1){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean containsAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public static <E> Bag<E> collectionBag(Bag<E> p0){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,21 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.CollectionSortedBag for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.util.Collection;
|
||||
import org.apache.commons.collections4.SortedBag;
|
||||
import org.apache.commons.collections4.bag.AbstractSortedBagDecorator;
|
||||
|
||||
public class CollectionSortedBag<E> extends AbstractSortedBagDecorator<E>
|
||||
{
|
||||
protected CollectionSortedBag() {}
|
||||
public CollectionSortedBag(SortedBag<E> p0){}
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean add(E p0, int p1){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean containsAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public static <E> SortedBag<E> collectionSortedBag(SortedBag<E> p0){ return null; }
|
||||
}
|
||||
13
java/ql/test/stubs/apache-commons-collections4-4.4/org/apache/commons/collections4/bag/HashBag.java
generated
Normal file
13
java/ql/test/stubs/apache-commons-collections4-4.4/org/apache/commons/collections4/bag/HashBag.java
generated
Normal file
@@ -0,0 +1,13 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.HashBag for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import org.apache.commons.collections4.bag.AbstractMapBag;
|
||||
|
||||
public class HashBag<E> extends AbstractMapBag<E> implements Serializable
|
||||
{
|
||||
public HashBag(){}
|
||||
public HashBag(Collection<? extends E> p0){}
|
||||
}
|
||||
@@ -0,0 +1,22 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.PredicatedBag for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.Bag;
|
||||
import org.apache.commons.collections4.Predicate;
|
||||
import org.apache.commons.collections4.collection.PredicatedCollection;
|
||||
|
||||
public class PredicatedBag<E> extends PredicatedCollection<E> implements Bag<E>
|
||||
{
|
||||
protected PredicatedBag() {}
|
||||
protected Bag<E> decorated(){ return null; }
|
||||
protected PredicatedBag(Bag<E> p0, Predicate<? super E> p1){}
|
||||
public Set<E> uniqueSet(){ return null; }
|
||||
public boolean add(E p0, int p1){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public boolean remove(Object p0, int p1){ return false; }
|
||||
public int getCount(Object p0){ return 0; }
|
||||
public int hashCode(){ return 0; }
|
||||
public static <E> PredicatedBag<E> predicatedBag(Bag<E> p0, Predicate<? super E> p1){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,19 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.PredicatedSortedBag for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.util.Comparator;
|
||||
import org.apache.commons.collections4.Predicate;
|
||||
import org.apache.commons.collections4.SortedBag;
|
||||
import org.apache.commons.collections4.bag.PredicatedBag;
|
||||
|
||||
public class PredicatedSortedBag<E> extends PredicatedBag<E> implements SortedBag<E>
|
||||
{
|
||||
protected PredicatedSortedBag() {}
|
||||
protected PredicatedSortedBag(SortedBag<E> p0, Predicate<? super E> p1){}
|
||||
protected SortedBag<E> decorated(){ return null; }
|
||||
public Comparator<? super E> comparator(){ return null; }
|
||||
public E first(){ return null; }
|
||||
public E last(){ return null; }
|
||||
public static <E> PredicatedSortedBag<E> predicatedSortedBag(SortedBag<E> p0, Predicate<? super E> p1){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,22 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.SynchronizedBag for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.Bag;
|
||||
import org.apache.commons.collections4.collection.SynchronizedCollection;
|
||||
|
||||
public class SynchronizedBag<E> extends SynchronizedCollection<E> implements Bag<E>
|
||||
{
|
||||
protected SynchronizedBag() {}
|
||||
protected Bag<E> getBag(){ return null; }
|
||||
protected SynchronizedBag(Bag<E> p0){}
|
||||
protected SynchronizedBag(Bag<E> p0, Object p1){}
|
||||
public Set<E> uniqueSet(){ return null; }
|
||||
public boolean add(E p0, int p1){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public boolean remove(Object p0, int p1){ return false; }
|
||||
public int getCount(Object p0){ return 0; }
|
||||
public int hashCode(){ return 0; }
|
||||
public static <E> SynchronizedBag<E> synchronizedBag(Bag<E> p0){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.SynchronizedSortedBag for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.util.Comparator;
|
||||
import org.apache.commons.collections4.Bag;
|
||||
import org.apache.commons.collections4.SortedBag;
|
||||
import org.apache.commons.collections4.bag.SynchronizedBag;
|
||||
|
||||
public class SynchronizedSortedBag<E> extends SynchronizedBag<E> implements SortedBag<E>
|
||||
{
|
||||
protected SynchronizedSortedBag() {}
|
||||
protected SortedBag<E> getSortedBag(){ return null; }
|
||||
protected SynchronizedSortedBag(Bag<E> p0, Object p1){}
|
||||
protected SynchronizedSortedBag(SortedBag<E> p0){}
|
||||
public Comparator<? super E> comparator(){ return null; }
|
||||
public E first(){ return null; }
|
||||
public E last(){ return null; }
|
||||
public static <E> SynchronizedSortedBag<E> synchronizedSortedBag(SortedBag<E> p0){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,23 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.TransformedBag for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.Bag;
|
||||
import org.apache.commons.collections4.Transformer;
|
||||
import org.apache.commons.collections4.collection.TransformedCollection;
|
||||
|
||||
public class TransformedBag<E> extends TransformedCollection<E> implements Bag<E>
|
||||
{
|
||||
protected TransformedBag() {}
|
||||
protected Bag<E> getBag(){ return null; }
|
||||
protected TransformedBag(Bag<E> p0, Transformer<? super E, ? extends E> p1){}
|
||||
public Set<E> uniqueSet(){ return null; }
|
||||
public boolean add(E p0, int p1){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public boolean remove(Object p0, int p1){ return false; }
|
||||
public int getCount(Object p0){ return 0; }
|
||||
public int hashCode(){ return 0; }
|
||||
public static <E> Bag<E> transformedBag(Bag<E> p0, Transformer<? super E, ? extends E> p1){ return null; }
|
||||
public static <E> Bag<E> transformingBag(Bag<E> p0, Transformer<? super E, ? extends E> p1){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.TransformedSortedBag for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.util.Comparator;
|
||||
import org.apache.commons.collections4.SortedBag;
|
||||
import org.apache.commons.collections4.Transformer;
|
||||
import org.apache.commons.collections4.bag.TransformedBag;
|
||||
|
||||
public class TransformedSortedBag<E> extends TransformedBag<E> implements SortedBag<E>
|
||||
{
|
||||
protected TransformedSortedBag() {}
|
||||
protected SortedBag<E> getSortedBag(){ return null; }
|
||||
protected TransformedSortedBag(SortedBag<E> p0, Transformer<? super E, ? extends E> p1){}
|
||||
public Comparator<? super E> comparator(){ return null; }
|
||||
public E first(){ return null; }
|
||||
public E last(){ return null; }
|
||||
public static <E> TransformedSortedBag<E> transformedSortedBag(SortedBag<E> p0, Transformer<? super E, ? extends E> p1){ return null; }
|
||||
public static <E> TransformedSortedBag<E> transformingSortedBag(SortedBag<E> p0, Transformer<? super E, ? extends E> p1){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,28 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.UnmodifiableBag for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.Set;
|
||||
import java.util.function.Predicate;
|
||||
import org.apache.commons.collections4.Bag;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
import org.apache.commons.collections4.bag.AbstractBagDecorator;
|
||||
|
||||
public class UnmodifiableBag<E> extends AbstractBagDecorator<E> implements Unmodifiable
|
||||
{
|
||||
protected UnmodifiableBag() {}
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public Set<E> uniqueSet(){ return null; }
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean add(E p0, int p1){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean remove(Object p0, int p1){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean removeIf(Predicate<? super E> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public static <E> Bag<E> unmodifiableBag(Bag<? extends E> p0){ return null; }
|
||||
public void clear(){}
|
||||
}
|
||||
@@ -0,0 +1,28 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bag.UnmodifiableSortedBag for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bag;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.Set;
|
||||
import java.util.function.Predicate;
|
||||
import org.apache.commons.collections4.SortedBag;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
import org.apache.commons.collections4.bag.AbstractSortedBagDecorator;
|
||||
|
||||
public class UnmodifiableSortedBag<E> extends AbstractSortedBagDecorator<E> implements Unmodifiable
|
||||
{
|
||||
protected UnmodifiableSortedBag() {}
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public Set<E> uniqueSet(){ return null; }
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean add(E p0, int p1){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean remove(Object p0, int p1){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean removeIf(Predicate<? super E> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public static <E> SortedBag<E> unmodifiableSortedBag(SortedBag<E> p0){ return null; }
|
||||
public void clear(){}
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bidimap.AbstractBidiMapDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bidimap;
|
||||
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.BidiMap;
|
||||
import org.apache.commons.collections4.MapIterator;
|
||||
import org.apache.commons.collections4.map.AbstractMapDecorator;
|
||||
|
||||
abstract public class AbstractBidiMapDecorator<K, V> extends AbstractMapDecorator<K, V> implements BidiMap<K, V>
|
||||
{
|
||||
protected AbstractBidiMapDecorator() {}
|
||||
protected AbstractBidiMapDecorator(BidiMap<K, V> p0){}
|
||||
protected BidiMap<K, V> decorated(){ return null; }
|
||||
public BidiMap<V, K> inverseBidiMap(){ return null; }
|
||||
public K getKey(Object p0){ return null; }
|
||||
public K removeValue(Object p0){ return null; }
|
||||
public MapIterator<K, V> mapIterator(){ return null; }
|
||||
public Set<V> values(){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,39 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bidimap.AbstractDualBidiMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bidimap;
|
||||
|
||||
import java.util.Iterator;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.BidiMap;
|
||||
import org.apache.commons.collections4.MapIterator;
|
||||
|
||||
abstract public class AbstractDualBidiMap<K, V> implements BidiMap<K, V>
|
||||
{
|
||||
protected AbstractDualBidiMap(){}
|
||||
protected AbstractDualBidiMap(Map<K, V> p0, Map<V, K> p1){}
|
||||
protected AbstractDualBidiMap(Map<K, V> p0, Map<V, K> p1, BidiMap<V, K> p2){}
|
||||
protected Iterator<K> createKeySetIterator(Iterator<K> p0){ return null; }
|
||||
protected Iterator<Map.Entry<K, V>> createEntrySetIterator(Iterator<Map.Entry<K, V>> p0){ return null; }
|
||||
protected Iterator<V> createValuesIterator(Iterator<V> p0){ return null; }
|
||||
protected abstract BidiMap<V, K> createBidiMap(Map<V, K> p0, Map<K, V> p1, BidiMap<K, V> p2);
|
||||
public BidiMap<V, K> inverseBidiMap(){ return null; }
|
||||
public K getKey(Object p0){ return null; }
|
||||
public K removeValue(Object p0){ return null; }
|
||||
public MapIterator<K, V> mapIterator(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public Set<V> values(){ return null; }
|
||||
public String toString(){ return null; }
|
||||
public V get(Object p0){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public boolean containsKey(Object p0){ return false; }
|
||||
public boolean containsValue(Object p0){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public boolean isEmpty(){ return false; }
|
||||
public int hashCode(){ return 0; }
|
||||
public int size(){ return 0; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bidimap.AbstractOrderedBidiMapDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bidimap;
|
||||
|
||||
import org.apache.commons.collections4.OrderedBidiMap;
|
||||
import org.apache.commons.collections4.OrderedMapIterator;
|
||||
import org.apache.commons.collections4.bidimap.AbstractBidiMapDecorator;
|
||||
|
||||
abstract public class AbstractOrderedBidiMapDecorator<K, V> extends AbstractBidiMapDecorator<K, V> implements OrderedBidiMap<K, V>
|
||||
{
|
||||
protected AbstractOrderedBidiMapDecorator() {}
|
||||
protected AbstractOrderedBidiMapDecorator(OrderedBidiMap<K, V> p0){}
|
||||
protected OrderedBidiMap<K, V> decorated(){ return null; }
|
||||
public K firstKey(){ return null; }
|
||||
public K lastKey(){ return null; }
|
||||
public K nextKey(K p0){ return null; }
|
||||
public K previousKey(K p0){ return null; }
|
||||
public OrderedBidiMap<V, K> inverseBidiMap(){ return null; }
|
||||
public OrderedMapIterator<K, V> mapIterator(){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,21 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bidimap.AbstractSortedBidiMapDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bidimap;
|
||||
|
||||
import java.util.Comparator;
|
||||
import java.util.SortedMap;
|
||||
import org.apache.commons.collections4.SortedBidiMap;
|
||||
import org.apache.commons.collections4.bidimap.AbstractOrderedBidiMapDecorator;
|
||||
|
||||
abstract public class AbstractSortedBidiMapDecorator<K, V> extends AbstractOrderedBidiMapDecorator<K, V> implements SortedBidiMap<K, V>
|
||||
{
|
||||
protected AbstractSortedBidiMapDecorator() {}
|
||||
protected SortedBidiMap<K, V> decorated(){ return null; }
|
||||
public AbstractSortedBidiMapDecorator(SortedBidiMap<K, V> p0){}
|
||||
public Comparator<? super K> comparator(){ return null; }
|
||||
public Comparator<? super V> valueComparator(){ return null; }
|
||||
public SortedBidiMap<V, K> inverseBidiMap(){ return null; }
|
||||
public SortedMap<K, V> headMap(K p0){ return null; }
|
||||
public SortedMap<K, V> subMap(K p0, K p1){ return null; }
|
||||
public SortedMap<K, V> tailMap(K p0){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,16 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bidimap.DualHashBidiMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bidimap;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Map;
|
||||
import org.apache.commons.collections4.BidiMap;
|
||||
import org.apache.commons.collections4.bidimap.AbstractDualBidiMap;
|
||||
|
||||
public class DualHashBidiMap<K, V> extends AbstractDualBidiMap<K, V> implements Serializable
|
||||
{
|
||||
protected BidiMap<V, K> createBidiMap(Map<V, K> p0, Map<K, V> p1, BidiMap<K, V> p2){ return null; }
|
||||
protected DualHashBidiMap(Map<K, V> p0, Map<V, K> p1, BidiMap<V, K> p2){}
|
||||
public DualHashBidiMap(){}
|
||||
public DualHashBidiMap(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,16 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bidimap.DualLinkedHashBidiMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bidimap;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Map;
|
||||
import org.apache.commons.collections4.BidiMap;
|
||||
import org.apache.commons.collections4.bidimap.AbstractDualBidiMap;
|
||||
|
||||
public class DualLinkedHashBidiMap<K, V> extends AbstractDualBidiMap<K, V> implements Serializable
|
||||
{
|
||||
protected BidiMap<V, K> createBidiMap(Map<V, K> p0, Map<K, V> p1, BidiMap<K, V> p2){ return null; }
|
||||
protected DualLinkedHashBidiMap(Map<K, V> p0, Map<V, K> p1, BidiMap<V, K> p2){}
|
||||
public DualLinkedHashBidiMap(){}
|
||||
public DualLinkedHashBidiMap(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,35 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bidimap.DualTreeBidiMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bidimap;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Comparator;
|
||||
import java.util.Map;
|
||||
import java.util.SortedMap;
|
||||
import org.apache.commons.collections4.BidiMap;
|
||||
import org.apache.commons.collections4.OrderedBidiMap;
|
||||
import org.apache.commons.collections4.OrderedMapIterator;
|
||||
import org.apache.commons.collections4.SortedBidiMap;
|
||||
import org.apache.commons.collections4.bidimap.AbstractDualBidiMap;
|
||||
|
||||
public class DualTreeBidiMap<K, V> extends AbstractDualBidiMap<K, V> implements Serializable, SortedBidiMap<K, V>
|
||||
{
|
||||
protected DualTreeBidiMap(Map<K, V> p0, Map<V, K> p1, BidiMap<V, K> p2){}
|
||||
protected DualTreeBidiMap<V, K> createBidiMap(Map<V, K> p0, Map<K, V> p1, BidiMap<K, V> p2){ return null; }
|
||||
public Comparator<? super K> comparator(){ return null; }
|
||||
public Comparator<? super V> valueComparator(){ return null; }
|
||||
public DualTreeBidiMap(){}
|
||||
public DualTreeBidiMap(Comparator<? super K> p0, Comparator<? super V> p1){}
|
||||
public DualTreeBidiMap(Map<? extends K, ? extends V> p0){}
|
||||
public K firstKey(){ return null; }
|
||||
public K lastKey(){ return null; }
|
||||
public K nextKey(K p0){ return null; }
|
||||
public K previousKey(K p0){ return null; }
|
||||
public OrderedBidiMap<V, K> inverseOrderedBidiMap(){ return null; }
|
||||
public OrderedMapIterator<K, V> mapIterator(){ return null; }
|
||||
public SortedBidiMap<V, K> inverseBidiMap(){ return null; }
|
||||
public SortedBidiMap<V, K> inverseSortedBidiMap(){ return null; }
|
||||
public SortedMap<K, V> headMap(K p0){ return null; }
|
||||
public SortedMap<K, V> subMap(K p0, K p1){ return null; }
|
||||
public SortedMap<K, V> tailMap(K p0){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,26 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bidimap.UnmodifiableBidiMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bidimap;
|
||||
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.BidiMap;
|
||||
import org.apache.commons.collections4.MapIterator;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
import org.apache.commons.collections4.bidimap.AbstractBidiMapDecorator;
|
||||
|
||||
public class UnmodifiableBidiMap<K, V> extends AbstractBidiMapDecorator<K, V> implements Unmodifiable
|
||||
{
|
||||
protected UnmodifiableBidiMap() {}
|
||||
public BidiMap<V, K> inverseBidiMap(){ return null; }
|
||||
public K removeValue(Object p0){ return null; }
|
||||
public MapIterator<K, V> mapIterator(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public Set<V> values(){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public static <K, V> BidiMap<K, V> unmodifiableBidiMap(BidiMap<? extends K, ? extends V> p0){ return null; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,27 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bidimap.UnmodifiableOrderedBidiMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bidimap;
|
||||
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.OrderedBidiMap;
|
||||
import org.apache.commons.collections4.OrderedMapIterator;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
import org.apache.commons.collections4.bidimap.AbstractOrderedBidiMapDecorator;
|
||||
|
||||
public class UnmodifiableOrderedBidiMap<K, V> extends AbstractOrderedBidiMapDecorator<K, V> implements Unmodifiable
|
||||
{
|
||||
protected UnmodifiableOrderedBidiMap() {}
|
||||
public K removeValue(Object p0){ return null; }
|
||||
public OrderedBidiMap<V, K> inverseBidiMap(){ return null; }
|
||||
public OrderedBidiMap<V, K> inverseOrderedBidiMap(){ return null; }
|
||||
public OrderedMapIterator<K, V> mapIterator(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public Set<V> values(){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public static <K, V> OrderedBidiMap<K, V> unmodifiableOrderedBidiMap(OrderedBidiMap<? extends K, ? extends V> p0){ return null; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,30 @@
|
||||
// Generated automatically from org.apache.commons.collections4.bidimap.UnmodifiableSortedBidiMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.bidimap;
|
||||
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import java.util.SortedMap;
|
||||
import org.apache.commons.collections4.OrderedMapIterator;
|
||||
import org.apache.commons.collections4.SortedBidiMap;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
import org.apache.commons.collections4.bidimap.AbstractSortedBidiMapDecorator;
|
||||
|
||||
public class UnmodifiableSortedBidiMap<K, V> extends AbstractSortedBidiMapDecorator<K, V> implements Unmodifiable
|
||||
{
|
||||
protected UnmodifiableSortedBidiMap() {}
|
||||
public K removeValue(Object p0){ return null; }
|
||||
public OrderedMapIterator<K, V> mapIterator(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public Set<V> values(){ return null; }
|
||||
public SortedBidiMap<V, K> inverseBidiMap(){ return null; }
|
||||
public SortedMap<K, V> headMap(K p0){ return null; }
|
||||
public SortedMap<K, V> subMap(K p0, K p1){ return null; }
|
||||
public SortedMap<K, V> tailMap(K p0){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public static <K, V> SortedBidiMap<K, V> unmodifiableSortedBidiMap(SortedBidiMap<K, ? extends V> p0){ return null; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,31 @@
|
||||
// Generated automatically from org.apache.commons.collections4.collection.AbstractCollectionDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.collection;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.function.Predicate;
|
||||
|
||||
abstract public class AbstractCollectionDecorator<E> implements Collection<E>, Serializable
|
||||
{
|
||||
protected AbstractCollectionDecorator(){}
|
||||
protected AbstractCollectionDecorator(Collection<E> p0){}
|
||||
protected Collection<E> decorated(){ return null; }
|
||||
protected void setCollection(Collection<E> p0){}
|
||||
public <T> T[] toArray(T[] p0){ return null; }
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public Object[] toArray(){ return null; }
|
||||
public String toString(){ return null; }
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean contains(Object p0){ return false; }
|
||||
public boolean containsAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean isEmpty(){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean removeIf(Predicate<? super E> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public int size(){ return 0; }
|
||||
public void clear(){}
|
||||
}
|
||||
@@ -0,0 +1,45 @@
|
||||
// Generated automatically from org.apache.commons.collections4.collection.CompositeCollection for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.collection;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
import java.util.function.Predicate;
|
||||
|
||||
public class CompositeCollection<E> implements Collection<E>, Serializable
|
||||
{
|
||||
protected CompositeCollection.CollectionMutator<E> getMutator(){ return null; }
|
||||
public <T> T[] toArray(T[] p0){ return null; }
|
||||
public Collection<E> toCollection(){ return null; }
|
||||
public CompositeCollection(){}
|
||||
public CompositeCollection(Collection<E> p0){}
|
||||
public CompositeCollection(Collection<E> p0, Collection<E> p1){}
|
||||
public CompositeCollection(Collection<E>... p0){}
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public List<Collection<E>> getCollections(){ return null; }
|
||||
public Object[] toArray(){ return null; }
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean contains(Object p0){ return false; }
|
||||
public boolean containsAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean isEmpty(){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean removeIf(Predicate<? super E> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public int size(){ return 0; }
|
||||
public void addComposited(Collection<E> p0){}
|
||||
public void addComposited(Collection<E> p0, Collection<E> p1){}
|
||||
public void addComposited(Collection<E>... p0){}
|
||||
public void clear(){}
|
||||
public void removeComposited(Collection<E> p0){}
|
||||
public void setMutator(CompositeCollection.CollectionMutator<E> p0){}
|
||||
static public interface CollectionMutator<E> extends Serializable
|
||||
{
|
||||
boolean add(CompositeCollection<E> p0, List<Collection<E>> p1, E p2);
|
||||
boolean addAll(CompositeCollection<E> p0, List<Collection<E>> p1, Collection<? extends E> p2);
|
||||
boolean remove(CompositeCollection<E> p0, List<Collection<E>> p1, Object p2);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,29 @@
|
||||
// Generated automatically from org.apache.commons.collections4.collection.IndexedCollection for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.collection;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.function.Predicate;
|
||||
import org.apache.commons.collections4.MultiMap;
|
||||
import org.apache.commons.collections4.Transformer;
|
||||
import org.apache.commons.collections4.collection.AbstractCollectionDecorator;
|
||||
|
||||
public class IndexedCollection<K, C> extends AbstractCollectionDecorator<C>
|
||||
{
|
||||
protected IndexedCollection() {}
|
||||
public C get(K p0){ return null; }
|
||||
public Collection<C> values(K p0){ return null; }
|
||||
public IndexedCollection(Collection<C> p0, Transformer<C, K> p1, MultiMap<K, C> p2, boolean p3){}
|
||||
public boolean add(C p0){ return false; }
|
||||
public boolean addAll(Collection<? extends C> p0){ return false; }
|
||||
public boolean contains(Object p0){ return false; }
|
||||
public boolean containsAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean removeIf(Predicate<? super C> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public static <K, C> IndexedCollection<K, C> nonUniqueIndexedCollection(Collection<C> p0, Transformer<C, K> p1){ return null; }
|
||||
public static <K, C> IndexedCollection<K, C> uniqueIndexedCollection(Collection<C> p0, Transformer<C, K> p1){ return null; }
|
||||
public void clear(){}
|
||||
public void reindex(){}
|
||||
}
|
||||
@@ -0,0 +1,43 @@
|
||||
// Generated automatically from org.apache.commons.collections4.collection.PredicatedCollection for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.collection;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.List;
|
||||
import java.util.Queue;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.Bag;
|
||||
import org.apache.commons.collections4.MultiSet;
|
||||
import org.apache.commons.collections4.Predicate;
|
||||
import org.apache.commons.collections4.collection.AbstractCollectionDecorator;
|
||||
|
||||
public class PredicatedCollection<E> extends AbstractCollectionDecorator<E>
|
||||
{
|
||||
protected PredicatedCollection() {}
|
||||
protected PredicatedCollection(Collection<E> p0, Predicate<? super E> p1){}
|
||||
protected final Predicate<? super E> predicate = null;
|
||||
protected void validate(E p0){}
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public static <E> PredicatedCollection.Builder<E> builder(Predicate<? super E> p0){ return null; }
|
||||
public static <E> PredicatedCollection.Builder<E> notNullBuilder(){ return null; }
|
||||
public static <T> PredicatedCollection<T> predicatedCollection(Collection<T> p0, Predicate<? super T> p1){ return null; }
|
||||
static public class Builder<E>
|
||||
{
|
||||
protected Builder() {}
|
||||
public Bag<E> createPredicatedBag(){ return null; }
|
||||
public Bag<E> createPredicatedBag(Bag<E> p0){ return null; }
|
||||
public Builder(Predicate<? super E> p0){}
|
||||
public Collection<E> rejectedElements(){ return null; }
|
||||
public List<E> createPredicatedList(){ return null; }
|
||||
public List<E> createPredicatedList(List<E> p0){ return null; }
|
||||
public MultiSet<E> createPredicatedMultiSet(){ return null; }
|
||||
public MultiSet<E> createPredicatedMultiSet(MultiSet<E> p0){ return null; }
|
||||
public PredicatedCollection.Builder<E> add(E p0){ return null; }
|
||||
public PredicatedCollection.Builder<E> addAll(Collection<? extends E> p0){ return null; }
|
||||
public Queue<E> createPredicatedQueue(){ return null; }
|
||||
public Queue<E> createPredicatedQueue(Queue<E> p0){ return null; }
|
||||
public Set<E> createPredicatedSet(){ return null; }
|
||||
public Set<E> createPredicatedSet(Set<E> p0){ return null; }
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,35 @@
|
||||
// Generated automatically from org.apache.commons.collections4.collection.SynchronizedCollection for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.collection;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.function.Predicate;
|
||||
|
||||
public class SynchronizedCollection<E> implements Collection<E>, Serializable
|
||||
{
|
||||
protected SynchronizedCollection() {}
|
||||
protected Collection<E> decorated(){ return null; }
|
||||
protected SynchronizedCollection(Collection<E> p0){}
|
||||
protected SynchronizedCollection(Collection<E> p0, Object p1){}
|
||||
protected final Object lock = null;
|
||||
public <T> T[] toArray(T[] p0){ return null; }
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public Object[] toArray(){ return null; }
|
||||
public String toString(){ return null; }
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean contains(Object p0){ return false; }
|
||||
public boolean containsAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public boolean isEmpty(){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean removeIf(Predicate<? super E> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public int hashCode(){ return 0; }
|
||||
public int size(){ return 0; }
|
||||
public static <T> SynchronizedCollection<T> synchronizedCollection(Collection<T> p0){ return null; }
|
||||
public void clear(){}
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
// Generated automatically from org.apache.commons.collections4.collection.TransformedCollection for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.collection;
|
||||
|
||||
import java.util.Collection;
|
||||
import org.apache.commons.collections4.Transformer;
|
||||
import org.apache.commons.collections4.collection.AbstractCollectionDecorator;
|
||||
|
||||
public class TransformedCollection<E> extends AbstractCollectionDecorator<E>
|
||||
{
|
||||
protected TransformedCollection() {}
|
||||
protected Collection<E> transform(Collection<? extends E> p0){ return null; }
|
||||
protected E transform(E p0){ return null; }
|
||||
protected TransformedCollection(Collection<E> p0, Transformer<? super E, ? extends E> p1){}
|
||||
protected final Transformer<? super E, ? extends E> transformer = null;
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public static <E> TransformedCollection<E> transformedCollection(Collection<E> p0, Transformer<? super E, ? extends E> p1){ return null; }
|
||||
public static <E> TransformedCollection<E> transformingCollection(Collection<E> p0, Transformer<? super E, ? extends E> p1){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,28 @@
|
||||
// Generated automatically from org.apache.commons.collections4.collection.UnmodifiableBoundedCollection for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.collection;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.function.Predicate;
|
||||
import org.apache.commons.collections4.BoundedCollection;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
import org.apache.commons.collections4.collection.AbstractCollectionDecorator;
|
||||
|
||||
public class UnmodifiableBoundedCollection<E> extends AbstractCollectionDecorator<E> implements BoundedCollection<E>, Unmodifiable
|
||||
{
|
||||
protected UnmodifiableBoundedCollection() {}
|
||||
protected BoundedCollection<E> decorated(){ return null; }
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean isFull(){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean removeIf(Predicate<? super E> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public int maxSize(){ return 0; }
|
||||
public static <E> BoundedCollection<E> unmodifiableBoundedCollection(BoundedCollection<? extends E> p0){ return null; }
|
||||
public static <E> BoundedCollection<E> unmodifiableBoundedCollection(Collection<? extends E> p0){ return null; }
|
||||
public void clear(){}
|
||||
}
|
||||
@@ -0,0 +1,23 @@
|
||||
// Generated automatically from org.apache.commons.collections4.collection.UnmodifiableCollection for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.collection;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.function.Predicate;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
import org.apache.commons.collections4.collection.AbstractCollectionDecorator;
|
||||
|
||||
public class UnmodifiableCollection<E> extends AbstractCollectionDecorator<E> implements Unmodifiable
|
||||
{
|
||||
protected UnmodifiableCollection() {}
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean removeIf(Predicate<? super E> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public static <T> Collection<T> unmodifiableCollection(Collection<? extends T> p0){ return null; }
|
||||
public void clear(){}
|
||||
}
|
||||
@@ -0,0 +1,21 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.AbstractListIteratorDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.ListIterator;
|
||||
|
||||
public class AbstractListIteratorDecorator<E> implements ListIterator<E>
|
||||
{
|
||||
protected AbstractListIteratorDecorator() {}
|
||||
protected ListIterator<E> getListIterator(){ return null; }
|
||||
public AbstractListIteratorDecorator(ListIterator<E> p0){}
|
||||
public E next(){ return null; }
|
||||
public E previous(){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public boolean hasPrevious(){ return false; }
|
||||
public int nextIndex(){ return 0; }
|
||||
public int previousIndex(){ return 0; }
|
||||
public void add(E p0){}
|
||||
public void remove(){}
|
||||
public void set(E p0){}
|
||||
}
|
||||
@@ -0,0 +1,18 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.AbstractMapIteratorDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import org.apache.commons.collections4.MapIterator;
|
||||
|
||||
public class AbstractMapIteratorDecorator<K, V> implements MapIterator<K, V>
|
||||
{
|
||||
protected AbstractMapIteratorDecorator() {}
|
||||
protected MapIterator<K, V> getMapIterator(){ return null; }
|
||||
public AbstractMapIteratorDecorator(MapIterator<K, V> p0){}
|
||||
public K getKey(){ return null; }
|
||||
public K next(){ return null; }
|
||||
public V getValue(){ return null; }
|
||||
public V setValue(V p0){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public void remove(){}
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.AbstractOrderedMapIteratorDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import org.apache.commons.collections4.OrderedMapIterator;
|
||||
|
||||
public class AbstractOrderedMapIteratorDecorator<K, V> implements OrderedMapIterator<K, V>
|
||||
{
|
||||
protected AbstractOrderedMapIteratorDecorator() {}
|
||||
protected OrderedMapIterator<K, V> getOrderedMapIterator(){ return null; }
|
||||
public AbstractOrderedMapIteratorDecorator(OrderedMapIterator<K, V> p0){}
|
||||
public K getKey(){ return null; }
|
||||
public K next(){ return null; }
|
||||
public K previous(){ return null; }
|
||||
public V getValue(){ return null; }
|
||||
public V setValue(V p0){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public boolean hasPrevious(){ return false; }
|
||||
public void remove(){}
|
||||
}
|
||||
@@ -0,0 +1,21 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.ArrayIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import org.apache.commons.collections4.ResettableIterator;
|
||||
|
||||
public class ArrayIterator<E> implements ResettableIterator<E>
|
||||
{
|
||||
protected ArrayIterator() {}
|
||||
protected void checkBound(int p0, int p1, String p2){}
|
||||
public ArrayIterator(Object p0){}
|
||||
public ArrayIterator(Object p0, int p1){}
|
||||
public ArrayIterator(Object p0, int p1, int p2){}
|
||||
public E next(){ return null; }
|
||||
public Object getArray(){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public int getEndIndex(){ return 0; }
|
||||
public int getStartIndex(){ return 0; }
|
||||
public void remove(){}
|
||||
public void reset(){}
|
||||
}
|
||||
@@ -0,0 +1,22 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.ArrayListIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import org.apache.commons.collections4.ResettableListIterator;
|
||||
import org.apache.commons.collections4.iterators.ArrayIterator;
|
||||
|
||||
public class ArrayListIterator<E> extends ArrayIterator<E> implements ResettableListIterator<E>
|
||||
{
|
||||
protected ArrayListIterator() {}
|
||||
public ArrayListIterator(Object p0){}
|
||||
public ArrayListIterator(Object p0, int p1){}
|
||||
public ArrayListIterator(Object p0, int p1, int p2){}
|
||||
public E next(){ return null; }
|
||||
public E previous(){ return null; }
|
||||
public boolean hasPrevious(){ return false; }
|
||||
public int nextIndex(){ return 0; }
|
||||
public int previousIndex(){ return 0; }
|
||||
public void add(Object p0){}
|
||||
public void reset(){}
|
||||
public void set(Object p0){}
|
||||
}
|
||||
@@ -0,0 +1,27 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.CollatingIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.Comparator;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
|
||||
public class CollatingIterator<E> implements Iterator<E>
|
||||
{
|
||||
public CollatingIterator(){}
|
||||
public CollatingIterator(Comparator<? super E> p0){}
|
||||
public CollatingIterator(Comparator<? super E> p0, Collection<Iterator<? extends E>> p1){}
|
||||
public CollatingIterator(Comparator<? super E> p0, Iterator<? extends E> p1, Iterator<? extends E> p2){}
|
||||
public CollatingIterator(Comparator<? super E> p0, Iterator<? extends E>[] p1){}
|
||||
public CollatingIterator(Comparator<? super E> p0, int p1){}
|
||||
public Comparator<? super E> getComparator(){ return null; }
|
||||
public E next(){ return null; }
|
||||
public List<Iterator<? extends E>> getIterators(){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public int getIteratorIndex(){ return 0; }
|
||||
public void addIterator(Iterator<? extends E> p0){}
|
||||
public void remove(){}
|
||||
public void setComparator(Comparator<? super E> p0){}
|
||||
public void setIterator(int p0, Iterator<? extends E> p1){}
|
||||
}
|
||||
@@ -0,0 +1,19 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.EnumerationIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.Enumeration;
|
||||
import java.util.Iterator;
|
||||
|
||||
public class EnumerationIterator<E> implements Iterator<E>
|
||||
{
|
||||
public E next(){ return null; }
|
||||
public Enumeration<? extends E> getEnumeration(){ return null; }
|
||||
public EnumerationIterator(){}
|
||||
public EnumerationIterator(Enumeration<? extends E> p0){}
|
||||
public EnumerationIterator(Enumeration<? extends E> p0, Collection<? super E> p1){}
|
||||
public boolean hasNext(){ return false; }
|
||||
public void remove(){}
|
||||
public void setEnumeration(Enumeration<? extends E> p0){}
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.FilterIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.Iterator;
|
||||
import org.apache.commons.collections4.Predicate;
|
||||
|
||||
public class FilterIterator<E> implements Iterator<E>
|
||||
{
|
||||
public E next(){ return null; }
|
||||
public FilterIterator(){}
|
||||
public FilterIterator(Iterator<? extends E> p0){}
|
||||
public FilterIterator(Iterator<? extends E> p0, Predicate<? super E> p1){}
|
||||
public Iterator<? extends E> getIterator(){ return null; }
|
||||
public Predicate<? super E> getPredicate(){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public void remove(){}
|
||||
public void setIterator(Iterator<? extends E> p0){}
|
||||
public void setPredicate(Predicate<? super E> p0){}
|
||||
}
|
||||
@@ -0,0 +1,27 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.FilterListIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.ListIterator;
|
||||
import org.apache.commons.collections4.Predicate;
|
||||
|
||||
public class FilterListIterator<E> implements ListIterator<E>
|
||||
{
|
||||
public E next(){ return null; }
|
||||
public E previous(){ return null; }
|
||||
public FilterListIterator(){}
|
||||
public FilterListIterator(ListIterator<? extends E> p0){}
|
||||
public FilterListIterator(ListIterator<? extends E> p0, Predicate<? super E> p1){}
|
||||
public FilterListIterator(Predicate<? super E> p0){}
|
||||
public ListIterator<? extends E> getListIterator(){ return null; }
|
||||
public Predicate<? super E> getPredicate(){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public boolean hasPrevious(){ return false; }
|
||||
public int nextIndex(){ return 0; }
|
||||
public int previousIndex(){ return 0; }
|
||||
public void add(E p0){}
|
||||
public void remove(){}
|
||||
public void set(E p0){}
|
||||
public void setListIterator(ListIterator<? extends E> p0){}
|
||||
public void setPredicate(Predicate<? super E> p0){}
|
||||
}
|
||||
@@ -0,0 +1,22 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.IteratorChain for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
|
||||
public class IteratorChain<E> implements Iterator<E>
|
||||
{
|
||||
protected void updateCurrentIterator(){}
|
||||
public E next(){ return null; }
|
||||
public IteratorChain(){}
|
||||
public IteratorChain(Collection<Iterator<? extends E>> p0){}
|
||||
public IteratorChain(Iterator<? extends E> p0){}
|
||||
public IteratorChain(Iterator<? extends E> p0, Iterator<? extends E> p1){}
|
||||
public IteratorChain(Iterator<? extends E>... p0){}
|
||||
public boolean hasNext(){ return false; }
|
||||
public boolean isLocked(){ return false; }
|
||||
public int size(){ return 0; }
|
||||
public void addIterator(Iterator<? extends E> p0){}
|
||||
public void remove(){}
|
||||
}
|
||||
@@ -0,0 +1,13 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.IteratorIterable for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.Iterator;
|
||||
|
||||
public class IteratorIterable<E> implements Iterable<E>
|
||||
{
|
||||
protected IteratorIterable() {}
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public IteratorIterable(Iterator<? extends E> p0){}
|
||||
public IteratorIterable(Iterator<? extends E> p0, boolean p1){}
|
||||
}
|
||||
@@ -0,0 +1,22 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.ListIteratorWrapper for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.Iterator;
|
||||
import org.apache.commons.collections4.ResettableListIterator;
|
||||
|
||||
public class ListIteratorWrapper<E> implements ResettableListIterator<E>
|
||||
{
|
||||
protected ListIteratorWrapper() {}
|
||||
public E next(){ return null; }
|
||||
public E previous(){ return null; }
|
||||
public ListIteratorWrapper(Iterator<? extends E> p0){}
|
||||
public boolean hasNext(){ return false; }
|
||||
public boolean hasPrevious(){ return false; }
|
||||
public int nextIndex(){ return 0; }
|
||||
public int previousIndex(){ return 0; }
|
||||
public void add(E p0){}
|
||||
public void remove(){}
|
||||
public void reset(){}
|
||||
public void set(E p0){}
|
||||
}
|
||||
@@ -0,0 +1,17 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.LoopingIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.Collection;
|
||||
import org.apache.commons.collections4.ResettableIterator;
|
||||
|
||||
public class LoopingIterator<E> implements ResettableIterator<E>
|
||||
{
|
||||
protected LoopingIterator() {}
|
||||
public E next(){ return null; }
|
||||
public LoopingIterator(Collection<? extends E> p0){}
|
||||
public boolean hasNext(){ return false; }
|
||||
public int size(){ return 0; }
|
||||
public void remove(){}
|
||||
public void reset(){}
|
||||
}
|
||||
@@ -0,0 +1,23 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.LoopingListIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.List;
|
||||
import org.apache.commons.collections4.ResettableListIterator;
|
||||
|
||||
public class LoopingListIterator<E> implements ResettableListIterator<E>
|
||||
{
|
||||
protected LoopingListIterator() {}
|
||||
public E next(){ return null; }
|
||||
public E previous(){ return null; }
|
||||
public LoopingListIterator(List<E> p0){}
|
||||
public boolean hasNext(){ return false; }
|
||||
public boolean hasPrevious(){ return false; }
|
||||
public int nextIndex(){ return 0; }
|
||||
public int previousIndex(){ return 0; }
|
||||
public int size(){ return 0; }
|
||||
public void add(E p0){}
|
||||
public void remove(){}
|
||||
public void reset(){}
|
||||
public void set(E p0){}
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.ObjectArrayIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import org.apache.commons.collections4.ResettableIterator;
|
||||
|
||||
public class ObjectArrayIterator<E> implements ResettableIterator<E>
|
||||
{
|
||||
protected ObjectArrayIterator() {}
|
||||
public E next(){ return null; }
|
||||
public E[] getArray(){ return null; }
|
||||
public ObjectArrayIterator(E... p0){}
|
||||
public ObjectArrayIterator(E[] p0, int p1){}
|
||||
public ObjectArrayIterator(E[] p0, int p1, int p2){}
|
||||
public boolean hasNext(){ return false; }
|
||||
public int getEndIndex(){ return 0; }
|
||||
public int getStartIndex(){ return 0; }
|
||||
public void remove(){}
|
||||
public void reset(){}
|
||||
}
|
||||
@@ -0,0 +1,22 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.ObjectArrayListIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import org.apache.commons.collections4.ResettableListIterator;
|
||||
import org.apache.commons.collections4.iterators.ObjectArrayIterator;
|
||||
|
||||
public class ObjectArrayListIterator<E> extends ObjectArrayIterator<E> implements ResettableListIterator<E>
|
||||
{
|
||||
protected ObjectArrayListIterator() {}
|
||||
public E next(){ return null; }
|
||||
public E previous(){ return null; }
|
||||
public ObjectArrayListIterator(E... p0){}
|
||||
public ObjectArrayListIterator(E[] p0, int p1){}
|
||||
public ObjectArrayListIterator(E[] p0, int p1, int p2){}
|
||||
public boolean hasPrevious(){ return false; }
|
||||
public int nextIndex(){ return 0; }
|
||||
public int previousIndex(){ return 0; }
|
||||
public void add(E p0){}
|
||||
public void reset(){}
|
||||
public void set(E p0){}
|
||||
}
|
||||
@@ -0,0 +1,17 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.PeekingIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.Iterator;
|
||||
|
||||
public class PeekingIterator<E> implements Iterator<E>
|
||||
{
|
||||
protected PeekingIterator() {}
|
||||
public E element(){ return null; }
|
||||
public E next(){ return null; }
|
||||
public E peek(){ return null; }
|
||||
public PeekingIterator(Iterator<? extends E> p0){}
|
||||
public boolean hasNext(){ return false; }
|
||||
public static <E> PeekingIterator<E> peekingIterator(Iterator<? extends E> p0){ return null; }
|
||||
public void remove(){}
|
||||
}
|
||||
@@ -0,0 +1,16 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.PermutationIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
|
||||
public class PermutationIterator<E> implements Iterator<List<E>>
|
||||
{
|
||||
protected PermutationIterator() {}
|
||||
public List<E> next(){ return null; }
|
||||
public PermutationIterator(Collection<? extends E> p0){}
|
||||
public boolean hasNext(){ return false; }
|
||||
public void remove(){}
|
||||
}
|
||||
@@ -0,0 +1,16 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.PushbackIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.Iterator;
|
||||
|
||||
public class PushbackIterator<E> implements Iterator<E>
|
||||
{
|
||||
protected PushbackIterator() {}
|
||||
public E next(){ return null; }
|
||||
public PushbackIterator(Iterator<? extends E> p0){}
|
||||
public boolean hasNext(){ return false; }
|
||||
public static <E> PushbackIterator<E> pushbackIterator(Iterator<? extends E> p0){ return null; }
|
||||
public void pushback(E p0){}
|
||||
public void remove(){}
|
||||
}
|
||||
@@ -0,0 +1,22 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.ReverseListIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.List;
|
||||
import org.apache.commons.collections4.ResettableListIterator;
|
||||
|
||||
public class ReverseListIterator<E> implements ResettableListIterator<E>
|
||||
{
|
||||
protected ReverseListIterator() {}
|
||||
public E next(){ return null; }
|
||||
public E previous(){ return null; }
|
||||
public ReverseListIterator(List<E> p0){}
|
||||
public boolean hasNext(){ return false; }
|
||||
public boolean hasPrevious(){ return false; }
|
||||
public int nextIndex(){ return 0; }
|
||||
public int previousIndex(){ return 0; }
|
||||
public void add(E p0){}
|
||||
public void remove(){}
|
||||
public void reset(){}
|
||||
public void set(E p0){}
|
||||
}
|
||||
@@ -0,0 +1,16 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.SingletonIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import org.apache.commons.collections4.ResettableIterator;
|
||||
|
||||
public class SingletonIterator<E> implements ResettableIterator<E>
|
||||
{
|
||||
protected SingletonIterator() {}
|
||||
public E next(){ return null; }
|
||||
public SingletonIterator(E p0){}
|
||||
public SingletonIterator(E p0, boolean p1){}
|
||||
public boolean hasNext(){ return false; }
|
||||
public void remove(){}
|
||||
public void reset(){}
|
||||
}
|
||||
@@ -0,0 +1,21 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.SingletonListIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import org.apache.commons.collections4.ResettableListIterator;
|
||||
|
||||
public class SingletonListIterator<E> implements ResettableListIterator<E>
|
||||
{
|
||||
protected SingletonListIterator() {}
|
||||
public E next(){ return null; }
|
||||
public E previous(){ return null; }
|
||||
public SingletonListIterator(E p0){}
|
||||
public boolean hasNext(){ return false; }
|
||||
public boolean hasPrevious(){ return false; }
|
||||
public int nextIndex(){ return 0; }
|
||||
public int previousIndex(){ return 0; }
|
||||
public void add(E p0){}
|
||||
public void remove(){}
|
||||
public void reset(){}
|
||||
public void set(E p0){}
|
||||
}
|
||||
@@ -0,0 +1,12 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.UniqueFilterIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.Iterator;
|
||||
import org.apache.commons.collections4.iterators.FilterIterator;
|
||||
|
||||
public class UniqueFilterIterator<E> extends FilterIterator<E>
|
||||
{
|
||||
protected UniqueFilterIterator() {}
|
||||
public UniqueFilterIterator(Iterator<? extends E> p0){}
|
||||
}
|
||||
@@ -0,0 +1,15 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.UnmodifiableIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.Iterator;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
|
||||
public class UnmodifiableIterator<E> implements Iterator<E>, Unmodifiable
|
||||
{
|
||||
protected UnmodifiableIterator() {}
|
||||
public E next(){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public static <E> Iterator<E> unmodifiableIterator(Iterator<? extends E> p0){ return null; }
|
||||
public void remove(){}
|
||||
}
|
||||
@@ -0,0 +1,21 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.UnmodifiableListIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import java.util.ListIterator;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
|
||||
public class UnmodifiableListIterator<E> implements ListIterator<E>, Unmodifiable
|
||||
{
|
||||
protected UnmodifiableListIterator() {}
|
||||
public E next(){ return null; }
|
||||
public E previous(){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public boolean hasPrevious(){ return false; }
|
||||
public int nextIndex(){ return 0; }
|
||||
public int previousIndex(){ return 0; }
|
||||
public static <E> ListIterator<E> umodifiableListIterator(ListIterator<? extends E> p0){ return null; }
|
||||
public void add(E p0){}
|
||||
public void remove(){}
|
||||
public void set(E p0){}
|
||||
}
|
||||
@@ -0,0 +1,18 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.UnmodifiableMapIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import org.apache.commons.collections4.MapIterator;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
|
||||
public class UnmodifiableMapIterator<K, V> implements MapIterator<K, V>, Unmodifiable
|
||||
{
|
||||
protected UnmodifiableMapIterator() {}
|
||||
public K getKey(){ return null; }
|
||||
public K next(){ return null; }
|
||||
public V getValue(){ return null; }
|
||||
public V setValue(V p0){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public static <K, V> MapIterator<K, V> unmodifiableMapIterator(MapIterator<? extends K, ? extends V> p0){ return null; }
|
||||
public void remove(){}
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
// Generated automatically from org.apache.commons.collections4.iterators.UnmodifiableOrderedMapIterator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.iterators;
|
||||
|
||||
import org.apache.commons.collections4.OrderedMapIterator;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
|
||||
public class UnmodifiableOrderedMapIterator<K, V> implements OrderedMapIterator<K, V>, Unmodifiable
|
||||
{
|
||||
protected UnmodifiableOrderedMapIterator() {}
|
||||
public K getKey(){ return null; }
|
||||
public K next(){ return null; }
|
||||
public K previous(){ return null; }
|
||||
public V getValue(){ return null; }
|
||||
public V setValue(V p0){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public boolean hasPrevious(){ return false; }
|
||||
public static <K, V> OrderedMapIterator<K, V> unmodifiableOrderedMapIterator(OrderedMapIterator<K, ? extends V> p0){ return null; }
|
||||
public void remove(){}
|
||||
}
|
||||
@@ -0,0 +1,23 @@
|
||||
// Generated automatically from org.apache.commons.collections4.keyvalue.MultiKey for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.keyvalue;
|
||||
|
||||
import java.io.Serializable;
|
||||
|
||||
public class MultiKey<K> implements Serializable
|
||||
{
|
||||
protected MultiKey() {}
|
||||
protected Object readResolve(){ return null; }
|
||||
public K getKey(int p0){ return null; }
|
||||
public K[] getKeys(){ return null; }
|
||||
public MultiKey(K p0, K p1){}
|
||||
public MultiKey(K p0, K p1, K p2){}
|
||||
public MultiKey(K p0, K p1, K p2, K p3){}
|
||||
public MultiKey(K p0, K p1, K p2, K p3, K p4){}
|
||||
public MultiKey(K[] p0){}
|
||||
public MultiKey(K[] p0, boolean p1){}
|
||||
public String toString(){ return null; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public int hashCode(){ return 0; }
|
||||
public int size(){ return 0; }
|
||||
}
|
||||
@@ -0,0 +1,119 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.AbstractLinkedList for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.io.ObjectInputStream;
|
||||
import java.io.ObjectOutputStream;
|
||||
import java.util.AbstractList;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
import java.util.ListIterator;
|
||||
import org.apache.commons.collections4.OrderedIterator;
|
||||
|
||||
abstract public class AbstractLinkedList<E> implements List<E>
|
||||
{
|
||||
protected AbstractLinkedList(){}
|
||||
protected AbstractLinkedList(Collection<? extends E> p0){}
|
||||
protected AbstractLinkedList.Node<E> createHeaderNode(){ return null; }
|
||||
protected AbstractLinkedList.Node<E> createNode(E p0){ return null; }
|
||||
protected AbstractLinkedList.Node<E> getNode(int p0, boolean p1){ return null; }
|
||||
protected Iterator<E> createSubListIterator(AbstractLinkedList.LinkedSubList<E> p0){ return null; }
|
||||
protected ListIterator<E> createSubListListIterator(AbstractLinkedList.LinkedSubList<E> p0, int p1){ return null; }
|
||||
protected boolean isEqualValue(Object p0, Object p1){ return false; }
|
||||
protected void addNode(AbstractLinkedList.Node<E> p0, AbstractLinkedList.Node<E> p1){}
|
||||
protected void addNodeAfter(AbstractLinkedList.Node<E> p0, E p1){}
|
||||
protected void addNodeBefore(AbstractLinkedList.Node<E> p0, E p1){}
|
||||
protected void doReadObject(ObjectInputStream p0){}
|
||||
protected void doWriteObject(ObjectOutputStream p0){}
|
||||
protected void init(){}
|
||||
protected void removeAllNodes(){}
|
||||
protected void removeNode(AbstractLinkedList.Node<E> p0){}
|
||||
protected void updateNode(AbstractLinkedList.Node<E> p0, E p1){}
|
||||
public <T> T[] toArray(T[] p0){ return null; }
|
||||
public E get(int p0){ return null; }
|
||||
public E getFirst(){ return null; }
|
||||
public E getLast(){ return null; }
|
||||
public E remove(int p0){ return null; }
|
||||
public E removeFirst(){ return null; }
|
||||
public E removeLast(){ return null; }
|
||||
public E set(int p0, E p1){ return null; }
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public List<E> subList(int p0, int p1){ return null; }
|
||||
public ListIterator<E> listIterator(){ return null; }
|
||||
public ListIterator<E> listIterator(int p0){ return null; }
|
||||
public Object[] toArray(){ return null; }
|
||||
public String toString(){ return null; }
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean addAll(int p0, Collection<? extends E> p1){ return false; }
|
||||
public boolean addFirst(E p0){ return false; }
|
||||
public boolean addLast(E p0){ return false; }
|
||||
public boolean contains(Object p0){ return false; }
|
||||
public boolean containsAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public boolean isEmpty(){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public int hashCode(){ return 0; }
|
||||
public int indexOf(Object p0){ return 0; }
|
||||
public int lastIndexOf(Object p0){ return 0; }
|
||||
public int size(){ return 0; }
|
||||
public void add(int p0, E p1){}
|
||||
public void clear(){}
|
||||
static class LinkedListIterator<E> implements ListIterator<E>, OrderedIterator<E>
|
||||
{
|
||||
protected LinkedListIterator() {}
|
||||
protected AbstractLinkedList.Node<E> current = null;
|
||||
protected AbstractLinkedList.Node<E> getLastNodeReturned(){ return null; }
|
||||
protected AbstractLinkedList.Node<E> next = null;
|
||||
protected LinkedListIterator(AbstractLinkedList<E> p0, int p1){}
|
||||
protected final AbstractLinkedList<E> parent = null;
|
||||
protected int expectedModCount = 0;
|
||||
protected int nextIndex = 0;
|
||||
protected void checkModCount(){}
|
||||
public E next(){ return null; }
|
||||
public E previous(){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public boolean hasPrevious(){ return false; }
|
||||
public int nextIndex(){ return 0; }
|
||||
public int previousIndex(){ return 0; }
|
||||
public void add(E p0){}
|
||||
public void remove(){}
|
||||
public void set(E p0){}
|
||||
}
|
||||
static class LinkedSubList<E> extends AbstractList<E>
|
||||
{
|
||||
protected LinkedSubList() {}
|
||||
protected LinkedSubList(AbstractLinkedList<E> p0, int p1, int p2){}
|
||||
protected void checkModCount(){}
|
||||
protected void rangeCheck(int p0, int p1){}
|
||||
public E get(int p0){ return null; }
|
||||
public E remove(int p0){ return null; }
|
||||
public E set(int p0, E p1){ return null; }
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public List<E> subList(int p0, int p1){ return null; }
|
||||
public ListIterator<E> listIterator(int p0){ return null; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean addAll(int p0, Collection<? extends E> p1){ return false; }
|
||||
public int size(){ return 0; }
|
||||
public void add(int p0, E p1){}
|
||||
public void clear(){}
|
||||
}
|
||||
static class Node<E>
|
||||
{
|
||||
protected AbstractLinkedList.Node<E> getNextNode(){ return null; }
|
||||
protected AbstractLinkedList.Node<E> getPreviousNode(){ return null; }
|
||||
protected AbstractLinkedList.Node<E> next = null;
|
||||
protected AbstractLinkedList.Node<E> previous = null;
|
||||
protected E getValue(){ return null; }
|
||||
protected E value = null;
|
||||
protected Node(){}
|
||||
protected Node(AbstractLinkedList.Node<E> p0, AbstractLinkedList.Node<E> p1, E p2){}
|
||||
protected Node(E p0){}
|
||||
protected void setNextNode(AbstractLinkedList.Node<E> p0){}
|
||||
protected void setPreviousNode(AbstractLinkedList.Node<E> p0){}
|
||||
protected void setValue(E p0){}
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,27 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.AbstractListDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.List;
|
||||
import java.util.ListIterator;
|
||||
import org.apache.commons.collections4.collection.AbstractCollectionDecorator;
|
||||
|
||||
abstract public class AbstractListDecorator<E> extends AbstractCollectionDecorator<E> implements List<E>
|
||||
{
|
||||
protected AbstractListDecorator(){}
|
||||
protected AbstractListDecorator(List<E> p0){}
|
||||
protected List<E> decorated(){ return null; }
|
||||
public E get(int p0){ return null; }
|
||||
public E remove(int p0){ return null; }
|
||||
public E set(int p0, E p1){ return null; }
|
||||
public List<E> subList(int p0, int p1){ return null; }
|
||||
public ListIterator<E> listIterator(){ return null; }
|
||||
public ListIterator<E> listIterator(int p0){ return null; }
|
||||
public boolean addAll(int p0, Collection<? extends E> p1){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public int hashCode(){ return 0; }
|
||||
public int indexOf(Object p0){ return 0; }
|
||||
public int lastIndexOf(Object p0){ return 0; }
|
||||
public void add(int p0, E p1){}
|
||||
}
|
||||
@@ -0,0 +1,12 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.AbstractSerializableListDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.util.List;
|
||||
import org.apache.commons.collections4.list.AbstractListDecorator;
|
||||
|
||||
abstract public class AbstractSerializableListDecorator<E> extends AbstractListDecorator<E>
|
||||
{
|
||||
protected AbstractSerializableListDecorator() {}
|
||||
protected AbstractSerializableListDecorator(List<E> p0){}
|
||||
}
|
||||
@@ -0,0 +1,44 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.CursorableLinkedList for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.ListIterator;
|
||||
import org.apache.commons.collections4.list.AbstractLinkedList;
|
||||
|
||||
public class CursorableLinkedList<E> extends AbstractLinkedList<E> implements Serializable
|
||||
{
|
||||
protected ListIterator<E> createSubListListIterator(AbstractLinkedList.LinkedSubList<E> p0, int p1){ return null; }
|
||||
protected void addNode(AbstractLinkedList.Node<E> p0, AbstractLinkedList.Node<E> p1){}
|
||||
protected void broadcastNodeChanged(AbstractLinkedList.Node<E> p0){}
|
||||
protected void broadcastNodeInserted(AbstractLinkedList.Node<E> p0){}
|
||||
protected void broadcastNodeRemoved(AbstractLinkedList.Node<E> p0){}
|
||||
protected void init(){}
|
||||
protected void registerCursor(CursorableLinkedList.Cursor<E> p0){}
|
||||
protected void removeAllNodes(){}
|
||||
protected void removeNode(AbstractLinkedList.Node<E> p0){}
|
||||
protected void unregisterCursor(CursorableLinkedList.Cursor<E> p0){}
|
||||
protected void updateNode(AbstractLinkedList.Node<E> p0, E p1){}
|
||||
public CursorableLinkedList(){}
|
||||
public CursorableLinkedList(Collection<? extends E> p0){}
|
||||
public CursorableLinkedList.Cursor<E> cursor(){ return null; }
|
||||
public CursorableLinkedList.Cursor<E> cursor(int p0){ return null; }
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public ListIterator<E> listIterator(){ return null; }
|
||||
public ListIterator<E> listIterator(int p0){ return null; }
|
||||
static public class Cursor<E> extends AbstractLinkedList.LinkedListIterator<E>
|
||||
{
|
||||
protected Cursor() {}
|
||||
protected Cursor(CursorableLinkedList<E> p0, int p1){}
|
||||
protected void checkModCount(){}
|
||||
protected void nodeChanged(AbstractLinkedList.Node<E> p0){}
|
||||
protected void nodeInserted(AbstractLinkedList.Node<E> p0){}
|
||||
protected void nodeRemoved(AbstractLinkedList.Node<E> p0){}
|
||||
public int nextIndex(){ return 0; }
|
||||
public void add(E p0){}
|
||||
public void close(){}
|
||||
public void remove(){}
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,38 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.FixedSizeList for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
import java.util.ListIterator;
|
||||
import java.util.function.Predicate;
|
||||
import org.apache.commons.collections4.BoundedCollection;
|
||||
import org.apache.commons.collections4.list.AbstractSerializableListDecorator;
|
||||
|
||||
public class FixedSizeList<E> extends AbstractSerializableListDecorator<E> implements BoundedCollection<E>
|
||||
{
|
||||
protected FixedSizeList() {}
|
||||
protected FixedSizeList(List<E> p0){}
|
||||
public E get(int p0){ return null; }
|
||||
public E remove(int p0){ return null; }
|
||||
public E set(int p0, E p1){ return null; }
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public List<E> subList(int p0, int p1){ return null; }
|
||||
public ListIterator<E> listIterator(){ return null; }
|
||||
public ListIterator<E> listIterator(int p0){ return null; }
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean addAll(int p0, Collection<? extends E> p1){ return false; }
|
||||
public boolean isFull(){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean removeIf(Predicate<? super E> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public int indexOf(Object p0){ return 0; }
|
||||
public int lastIndexOf(Object p0){ return 0; }
|
||||
public int maxSize(){ return 0; }
|
||||
public static <E> FixedSizeList<E> fixedSizeList(List<E> p0){ return null; }
|
||||
public void add(int p0, E p1){}
|
||||
public void clear(){}
|
||||
}
|
||||
@@ -0,0 +1,18 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.GrowthList for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.List;
|
||||
import org.apache.commons.collections4.list.AbstractSerializableListDecorator;
|
||||
|
||||
public class GrowthList<E> extends AbstractSerializableListDecorator<E>
|
||||
{
|
||||
protected GrowthList(List<E> p0){}
|
||||
public E set(int p0, E p1){ return null; }
|
||||
public GrowthList(){}
|
||||
public GrowthList(int p0){}
|
||||
public boolean addAll(int p0, Collection<? extends E> p1){ return false; }
|
||||
public static <E> GrowthList<E> growthList(List<E> p0){ return null; }
|
||||
public void add(int p0, E p1){}
|
||||
}
|
||||
@@ -0,0 +1,19 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.LazyList for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.util.List;
|
||||
import org.apache.commons.collections4.Factory;
|
||||
import org.apache.commons.collections4.Transformer;
|
||||
import org.apache.commons.collections4.list.AbstractSerializableListDecorator;
|
||||
|
||||
public class LazyList<E> extends AbstractSerializableListDecorator<E>
|
||||
{
|
||||
protected LazyList() {}
|
||||
protected LazyList(List<E> p0, Factory<? extends E> p1){}
|
||||
protected LazyList(List<E> p0, Transformer<Integer, ? extends E> p1){}
|
||||
public E get(int p0){ return null; }
|
||||
public List<E> subList(int p0, int p1){ return null; }
|
||||
public static <E> LazyList<E> lazyList(List<E> p0, Factory<? extends E> p1){ return null; }
|
||||
public static <E> LazyList<E> lazyList(List<E> p0, Transformer<Integer, ? extends E> p1){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,23 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.NodeCachingLinkedList for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import org.apache.commons.collections4.list.AbstractLinkedList;
|
||||
|
||||
public class NodeCachingLinkedList<E> extends AbstractLinkedList<E> implements Serializable
|
||||
{
|
||||
protected AbstractLinkedList.Node<E> createNode(E p0){ return null; }
|
||||
protected AbstractLinkedList.Node<E> getNodeFromCache(){ return null; }
|
||||
protected boolean isCacheFull(){ return false; }
|
||||
protected int getMaximumCacheSize(){ return 0; }
|
||||
protected void addNodeToCache(AbstractLinkedList.Node<E> p0){}
|
||||
protected void removeAllNodes(){}
|
||||
protected void removeNode(AbstractLinkedList.Node<E> p0){}
|
||||
protected void setMaximumCacheSize(int p0){}
|
||||
protected void shrinkCacheToMaximumSize(){}
|
||||
public NodeCachingLinkedList(){}
|
||||
public NodeCachingLinkedList(Collection<? extends E> p0){}
|
||||
public NodeCachingLinkedList(int p0){}
|
||||
}
|
||||
@@ -0,0 +1,29 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.PredicatedList for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.List;
|
||||
import java.util.ListIterator;
|
||||
import org.apache.commons.collections4.Predicate;
|
||||
import org.apache.commons.collections4.collection.PredicatedCollection;
|
||||
|
||||
public class PredicatedList<E> extends PredicatedCollection<E> implements List<E>
|
||||
{
|
||||
protected PredicatedList() {}
|
||||
protected List<E> decorated(){ return null; }
|
||||
protected PredicatedList(List<E> p0, Predicate<? super E> p1){}
|
||||
public E get(int p0){ return null; }
|
||||
public E remove(int p0){ return null; }
|
||||
public E set(int p0, E p1){ return null; }
|
||||
public List<E> subList(int p0, int p1){ return null; }
|
||||
public ListIterator<E> listIterator(){ return null; }
|
||||
public ListIterator<E> listIterator(int p0){ return null; }
|
||||
public boolean addAll(int p0, Collection<? extends E> p1){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public int hashCode(){ return 0; }
|
||||
public int indexOf(Object p0){ return 0; }
|
||||
public int lastIndexOf(Object p0){ return 0; }
|
||||
public static <T> PredicatedList<T> predicatedList(List<T> p0, Predicate<? super T> p1){ return null; }
|
||||
public void add(int p0, E p1){}
|
||||
}
|
||||
@@ -0,0 +1,37 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.SetUniqueList for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
import java.util.ListIterator;
|
||||
import java.util.Set;
|
||||
import java.util.function.Predicate;
|
||||
import org.apache.commons.collections4.list.AbstractSerializableListDecorator;
|
||||
|
||||
public class SetUniqueList<E> extends AbstractSerializableListDecorator<E>
|
||||
{
|
||||
protected SetUniqueList() {}
|
||||
protected Set<E> createSetBasedOnList(Set<E> p0, List<E> p1){ return null; }
|
||||
protected SetUniqueList(List<E> p0, Set<E> p1){}
|
||||
public E remove(int p0){ return null; }
|
||||
public E set(int p0, E p1){ return null; }
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public List<E> subList(int p0, int p1){ return null; }
|
||||
public ListIterator<E> listIterator(){ return null; }
|
||||
public ListIterator<E> listIterator(int p0){ return null; }
|
||||
public Set<E> asSet(){ return null; }
|
||||
public boolean add(E p0){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean addAll(int p0, Collection<? extends E> p1){ return false; }
|
||||
public boolean contains(Object p0){ return false; }
|
||||
public boolean containsAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean removeIf(Predicate<? super E> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public static <E> SetUniqueList<E> setUniqueList(List<E> p0){ return null; }
|
||||
public void add(int p0, E p1){}
|
||||
public void clear(){}
|
||||
}
|
||||
@@ -0,0 +1,30 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.TransformedList for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.List;
|
||||
import java.util.ListIterator;
|
||||
import org.apache.commons.collections4.Transformer;
|
||||
import org.apache.commons.collections4.collection.TransformedCollection;
|
||||
|
||||
public class TransformedList<E> extends TransformedCollection<E> implements List<E>
|
||||
{
|
||||
protected TransformedList() {}
|
||||
protected List<E> getList(){ return null; }
|
||||
protected TransformedList(List<E> p0, Transformer<? super E, ? extends E> p1){}
|
||||
public E get(int p0){ return null; }
|
||||
public E remove(int p0){ return null; }
|
||||
public E set(int p0, E p1){ return null; }
|
||||
public List<E> subList(int p0, int p1){ return null; }
|
||||
public ListIterator<E> listIterator(){ return null; }
|
||||
public ListIterator<E> listIterator(int p0){ return null; }
|
||||
public boolean addAll(int p0, Collection<? extends E> p1){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public int hashCode(){ return 0; }
|
||||
public int indexOf(Object p0){ return 0; }
|
||||
public int lastIndexOf(Object p0){ return 0; }
|
||||
public static <E> TransformedList<E> transformedList(List<E> p0, Transformer<? super E, ? extends E> p1){ return null; }
|
||||
public static <E> TransformedList<E> transformingList(List<E> p0, Transformer<? super E, ? extends E> p1){ return null; }
|
||||
public void add(int p0, E p1){}
|
||||
}
|
||||
@@ -0,0 +1,27 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.TreeList for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.util.AbstractList;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.ListIterator;
|
||||
|
||||
public class TreeList<E> extends AbstractList<E>
|
||||
{
|
||||
public E get(int p0){ return null; }
|
||||
public E remove(int p0){ return null; }
|
||||
public E set(int p0, E p1){ return null; }
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public ListIterator<E> listIterator(){ return null; }
|
||||
public ListIterator<E> listIterator(int p0){ return null; }
|
||||
public Object[] toArray(){ return null; }
|
||||
public TreeList(){}
|
||||
public TreeList(Collection<? extends E> p0){}
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean contains(Object p0){ return false; }
|
||||
public int indexOf(Object p0){ return 0; }
|
||||
public int size(){ return 0; }
|
||||
public void add(int p0, E p1){}
|
||||
public void clear(){}
|
||||
}
|
||||
@@ -0,0 +1,33 @@
|
||||
// Generated automatically from org.apache.commons.collections4.list.UnmodifiableList for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.list;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
import java.util.ListIterator;
|
||||
import java.util.function.Predicate;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
import org.apache.commons.collections4.list.AbstractSerializableListDecorator;
|
||||
|
||||
public class UnmodifiableList<E> extends AbstractSerializableListDecorator<E> implements Unmodifiable
|
||||
{
|
||||
protected UnmodifiableList() {}
|
||||
public E remove(int p0){ return null; }
|
||||
public E set(int p0, E p1){ return null; }
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public List<E> subList(int p0, int p1){ return null; }
|
||||
public ListIterator<E> listIterator(){ return null; }
|
||||
public ListIterator<E> listIterator(int p0){ return null; }
|
||||
public UnmodifiableList(List<? extends E> p0){}
|
||||
public boolean add(Object p0){ return false; }
|
||||
public boolean addAll(Collection<? extends E> p0){ return false; }
|
||||
public boolean addAll(int p0, Collection<? extends E> p1){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean removeIf(Predicate<? super E> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public static <E> List<E> unmodifiableList(List<? extends E> p0){ return null; }
|
||||
public void add(int p0, E p1){}
|
||||
public void clear(){}
|
||||
}
|
||||
@@ -0,0 +1,16 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.AbstractInputCheckedMapDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.map.AbstractMapDecorator;
|
||||
|
||||
abstract class AbstractInputCheckedMapDecorator<K, V> extends AbstractMapDecorator<K, V>
|
||||
{
|
||||
protected AbstractInputCheckedMapDecorator(){}
|
||||
protected AbstractInputCheckedMapDecorator(Map<K, V> p0){}
|
||||
protected abstract V checkSetValue(V p0);
|
||||
protected boolean isSetValueChecking(){ return false; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,19 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.AbstractOrderedMapDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import org.apache.commons.collections4.OrderedMap;
|
||||
import org.apache.commons.collections4.OrderedMapIterator;
|
||||
import org.apache.commons.collections4.map.AbstractMapDecorator;
|
||||
|
||||
abstract public class AbstractOrderedMapDecorator<K, V> extends AbstractMapDecorator<K, V> implements OrderedMap<K, V>
|
||||
{
|
||||
protected AbstractOrderedMapDecorator(){}
|
||||
protected OrderedMap<K, V> decorated(){ return null; }
|
||||
public AbstractOrderedMapDecorator(OrderedMap<K, V> p0){}
|
||||
public K firstKey(){ return null; }
|
||||
public K lastKey(){ return null; }
|
||||
public K nextKey(K p0){ return null; }
|
||||
public K previousKey(K p0){ return null; }
|
||||
public OrderedMapIterator<K, V> mapIterator(){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,25 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.AbstractSortedMapDecorator for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.util.Comparator;
|
||||
import java.util.SortedMap;
|
||||
import org.apache.commons.collections4.IterableSortedMap;
|
||||
import org.apache.commons.collections4.OrderedMapIterator;
|
||||
import org.apache.commons.collections4.map.AbstractMapDecorator;
|
||||
|
||||
abstract public class AbstractSortedMapDecorator<K, V> extends AbstractMapDecorator<K, V> implements IterableSortedMap<K, V>
|
||||
{
|
||||
protected AbstractSortedMapDecorator(){}
|
||||
protected SortedMap<K, V> decorated(){ return null; }
|
||||
public AbstractSortedMapDecorator(SortedMap<K, V> p0){}
|
||||
public Comparator<? super K> comparator(){ return null; }
|
||||
public K firstKey(){ return null; }
|
||||
public K lastKey(){ return null; }
|
||||
public K nextKey(K p0){ return null; }
|
||||
public K previousKey(K p0){ return null; }
|
||||
public OrderedMapIterator<K, V> mapIterator(){ return null; }
|
||||
public SortedMap<K, V> headMap(K p0){ return null; }
|
||||
public SortedMap<K, V> subMap(K p0, K p1){ return null; }
|
||||
public SortedMap<K, V> tailMap(K p0){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,17 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.CaseInsensitiveMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Map;
|
||||
import org.apache.commons.collections4.map.AbstractHashedMap;
|
||||
|
||||
public class CaseInsensitiveMap<K, V> extends AbstractHashedMap<K, V> implements Cloneable, Serializable
|
||||
{
|
||||
protected Object convertKey(Object p0){ return null; }
|
||||
public CaseInsensitiveMap(){}
|
||||
public CaseInsensitiveMap(Map<? extends K, ? extends V> p0){}
|
||||
public CaseInsensitiveMap(int p0){}
|
||||
public CaseInsensitiveMap(int p0, float p1){}
|
||||
public CaseInsensitiveMap<K, V> clone(){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,41 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.CompositeMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.map.AbstractIterableMap;
|
||||
|
||||
public class CompositeMap<K, V> extends AbstractIterableMap<K, V> implements Serializable
|
||||
{
|
||||
public Collection<V> values(){ return null; }
|
||||
public CompositeMap(){}
|
||||
public CompositeMap(Map<K, V> p0, Map<K, V> p1){}
|
||||
public CompositeMap(Map<K, V> p0, Map<K, V> p1, CompositeMap.MapMutator<K, V> p2){}
|
||||
public CompositeMap(Map<K, V>... p0){}
|
||||
public CompositeMap(Map<K, V>[] p0, CompositeMap.MapMutator<K, V> p1){}
|
||||
public Map<K, V> removeComposited(Map<K, V> p0){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public V get(Object p0){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public boolean containsKey(Object p0){ return false; }
|
||||
public boolean containsValue(Object p0){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public boolean isEmpty(){ return false; }
|
||||
public int hashCode(){ return 0; }
|
||||
public int size(){ return 0; }
|
||||
public void addComposited(Map<K, V> p0){}
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
public void setMutator(CompositeMap.MapMutator<K, V> p0){}
|
||||
static public interface MapMutator<K, V> extends Serializable
|
||||
{
|
||||
V put(CompositeMap<K, V> p0, Map<K, V>[] p1, K p2, V p3);
|
||||
void putAll(CompositeMap<K, V> p0, Map<K, V>[] p1, Map<? extends K, ? extends V> p2);
|
||||
void resolveCollision(CompositeMap<K, V> p0, Map<K, V> p1, Map<K, V> p2, Collection<K> p3);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,21 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.DefaultedMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Map;
|
||||
import org.apache.commons.collections4.Factory;
|
||||
import org.apache.commons.collections4.Transformer;
|
||||
import org.apache.commons.collections4.map.AbstractMapDecorator;
|
||||
|
||||
public class DefaultedMap<K, V> extends AbstractMapDecorator<K, V> implements Serializable
|
||||
{
|
||||
protected DefaultedMap() {}
|
||||
protected DefaultedMap(Map<K, V> p0, Transformer<? super K, ? extends V> p1){}
|
||||
public DefaultedMap(Transformer<? super K, ? extends V> p0){}
|
||||
public DefaultedMap(V p0){}
|
||||
public V get(Object p0){ return null; }
|
||||
public static <K, V> DefaultedMap<K, V> defaultedMap(Map<K, V> p0, Factory<? extends V> p1){ return null; }
|
||||
public static <K, V> DefaultedMap<K, V> defaultedMap(Map<K, V> p0, V p1){ return null; }
|
||||
public static <K, V> Map<K, V> defaultedMap(Map<K, V> p0, Transformer<? super K, ? extends V> p1){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,22 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.EntrySetToMapIteratorAdapter for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.MapIterator;
|
||||
import org.apache.commons.collections4.ResettableIterator;
|
||||
|
||||
public class EntrySetToMapIteratorAdapter<K, V> implements MapIterator<K, V>, ResettableIterator<K>
|
||||
{
|
||||
protected EntrySetToMapIteratorAdapter() {}
|
||||
protected Map.Entry<K, V> current(){ return null; }
|
||||
public EntrySetToMapIteratorAdapter(Set<Map.Entry<K, V>> p0){}
|
||||
public K getKey(){ return null; }
|
||||
public K next(){ return null; }
|
||||
public V getValue(){ return null; }
|
||||
public V setValue(V p0){ return null; }
|
||||
public boolean hasNext(){ return false; }
|
||||
public void remove(){}
|
||||
public void reset(){}
|
||||
}
|
||||
@@ -0,0 +1,26 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.FixedSizeMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.BoundedMap;
|
||||
import org.apache.commons.collections4.map.AbstractMapDecorator;
|
||||
|
||||
public class FixedSizeMap<K, V> extends AbstractMapDecorator<K, V> implements BoundedMap<K, V>, Serializable
|
||||
{
|
||||
protected FixedSizeMap() {}
|
||||
protected FixedSizeMap(Map<K, V> p0){}
|
||||
public Collection<V> values(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public boolean isFull(){ return false; }
|
||||
public int maxSize(){ return 0; }
|
||||
public static <K, V> FixedSizeMap<K, V> fixedSizeMap(Map<K, V> p0){ return null; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,31 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.FixedSizeSortedMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import java.util.SortedMap;
|
||||
import org.apache.commons.collections4.BoundedMap;
|
||||
import org.apache.commons.collections4.map.AbstractSortedMapDecorator;
|
||||
|
||||
public class FixedSizeSortedMap<K, V> extends AbstractSortedMapDecorator<K, V> implements BoundedMap<K, V>, Serializable
|
||||
{
|
||||
protected FixedSizeSortedMap() {}
|
||||
protected FixedSizeSortedMap(SortedMap<K, V> p0){}
|
||||
protected SortedMap<K, V> getSortedMap(){ return null; }
|
||||
public Collection<V> values(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public SortedMap<K, V> headMap(K p0){ return null; }
|
||||
public SortedMap<K, V> subMap(K p0, K p1){ return null; }
|
||||
public SortedMap<K, V> tailMap(K p0){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public boolean isFull(){ return false; }
|
||||
public int maxSize(){ return 0; }
|
||||
public static <K, V> FixedSizeSortedMap<K, V> fixedSizeSortedMap(SortedMap<K, V> p0){ return null; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
35
java/ql/test/stubs/apache-commons-collections4-4.4/org/apache/commons/collections4/map/Flat3Map.java
generated
Normal file
35
java/ql/test/stubs/apache-commons-collections4-4.4/org/apache/commons/collections4/map/Flat3Map.java
generated
Normal file
@@ -0,0 +1,35 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.Flat3Map for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.IterableMap;
|
||||
import org.apache.commons.collections4.MapIterator;
|
||||
import org.apache.commons.collections4.map.AbstractHashedMap;
|
||||
|
||||
public class Flat3Map<K, V> implements Cloneable, IterableMap<K, V>, Serializable
|
||||
{
|
||||
protected AbstractHashedMap<K, V> createDelegateMap(){ return null; }
|
||||
public Collection<V> values(){ return null; }
|
||||
public Flat3Map(){}
|
||||
public Flat3Map(Map<? extends K, ? extends V> p0){}
|
||||
public Flat3Map<K, V> clone(){ return null; }
|
||||
public MapIterator<K, V> mapIterator(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public String toString(){ return null; }
|
||||
public V get(Object p0){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public boolean containsKey(Object p0){ return false; }
|
||||
public boolean containsValue(Object p0){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public boolean isEmpty(){ return false; }
|
||||
public int hashCode(){ return 0; }
|
||||
public int size(){ return 0; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
39
java/ql/test/stubs/apache-commons-collections4-4.4/org/apache/commons/collections4/map/LRUMap.java
generated
Normal file
39
java/ql/test/stubs/apache-commons-collections4-4.4/org/apache/commons/collections4/map/LRUMap.java
generated
Normal file
@@ -0,0 +1,39 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.LRUMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.ObjectInputStream;
|
||||
import java.io.ObjectOutputStream;
|
||||
import java.io.Serializable;
|
||||
import java.util.Map;
|
||||
import org.apache.commons.collections4.BoundedMap;
|
||||
import org.apache.commons.collections4.map.AbstractHashedMap;
|
||||
import org.apache.commons.collections4.map.AbstractLinkedMap;
|
||||
|
||||
public class LRUMap<K, V> extends AbstractLinkedMap<K, V> implements BoundedMap<K, V>, Cloneable, Serializable
|
||||
{
|
||||
protected boolean removeLRU(AbstractLinkedMap.LinkEntry<K, V> p0){ return false; }
|
||||
protected static int DEFAULT_MAX_SIZE = 0;
|
||||
protected void addMapping(int p0, int p1, K p2, V p3){}
|
||||
protected void doReadObject(ObjectInputStream p0){}
|
||||
protected void doWriteObject(ObjectOutputStream p0){}
|
||||
protected void moveToMRU(AbstractLinkedMap.LinkEntry<K, V> p0){}
|
||||
protected void reuseMapping(AbstractLinkedMap.LinkEntry<K, V> p0, int p1, int p2, K p3, V p4){}
|
||||
protected void updateEntry(AbstractHashedMap.HashEntry<K, V> p0, V p1){}
|
||||
public LRUMap(){}
|
||||
public LRUMap(Map<? extends K, ? extends V> p0){}
|
||||
public LRUMap(Map<? extends K, ? extends V> p0, boolean p1){}
|
||||
public LRUMap(int p0){}
|
||||
public LRUMap(int p0, boolean p1){}
|
||||
public LRUMap(int p0, float p1){}
|
||||
public LRUMap(int p0, float p1, boolean p2){}
|
||||
public LRUMap(int p0, int p1){}
|
||||
public LRUMap(int p0, int p1, float p2){}
|
||||
public LRUMap(int p0, int p1, float p2, boolean p3){}
|
||||
public LRUMap<K, V> clone(){ return null; }
|
||||
public V get(Object p0){ return null; }
|
||||
public V get(Object p0, boolean p1){ return null; }
|
||||
public boolean isFull(){ return false; }
|
||||
public boolean isScanUntilRemovable(){ return false; }
|
||||
public int maxSize(){ return 0; }
|
||||
}
|
||||
20
java/ql/test/stubs/apache-commons-collections4-4.4/org/apache/commons/collections4/map/LazyMap.java
generated
Normal file
20
java/ql/test/stubs/apache-commons-collections4-4.4/org/apache/commons/collections4/map/LazyMap.java
generated
Normal file
@@ -0,0 +1,20 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.LazyMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Map;
|
||||
import org.apache.commons.collections4.Factory;
|
||||
import org.apache.commons.collections4.Transformer;
|
||||
import org.apache.commons.collections4.map.AbstractMapDecorator;
|
||||
|
||||
public class LazyMap<K, V> extends AbstractMapDecorator<K, V> implements Serializable
|
||||
{
|
||||
protected LazyMap() {}
|
||||
protected LazyMap(Map<K, V> p0, Factory<? extends V> p1){}
|
||||
protected LazyMap(Map<K, V> p0, Transformer<? super K, ? extends V> p1){}
|
||||
protected final Transformer<? super K, ? extends V> factory = null;
|
||||
public V get(Object p0){ return null; }
|
||||
public static <K, V> LazyMap<K, V> lazyMap(Map<K, V> p0, Factory<? extends V> p1){ return null; }
|
||||
public static <V, K> LazyMap<K, V> lazyMap(Map<K, V> p0, Transformer<? super K, ? extends V> p1){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,25 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.LazySortedMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.util.Comparator;
|
||||
import java.util.SortedMap;
|
||||
import org.apache.commons.collections4.Factory;
|
||||
import org.apache.commons.collections4.Transformer;
|
||||
import org.apache.commons.collections4.map.LazyMap;
|
||||
|
||||
public class LazySortedMap<K, V> extends LazyMap<K, V> implements SortedMap<K, V>
|
||||
{
|
||||
protected LazySortedMap() {}
|
||||
protected LazySortedMap(SortedMap<K, V> p0, Factory<? extends V> p1){}
|
||||
protected LazySortedMap(SortedMap<K, V> p0, Transformer<? super K, ? extends V> p1){}
|
||||
protected SortedMap<K, V> getSortedMap(){ return null; }
|
||||
public Comparator<? super K> comparator(){ return null; }
|
||||
public K firstKey(){ return null; }
|
||||
public K lastKey(){ return null; }
|
||||
public SortedMap<K, V> headMap(K p0){ return null; }
|
||||
public SortedMap<K, V> subMap(K p0, K p1){ return null; }
|
||||
public SortedMap<K, V> tailMap(K p0){ return null; }
|
||||
public static <K, V> LazySortedMap<K, V> lazySortedMap(SortedMap<K, V> p0, Factory<? extends V> p1){ return null; }
|
||||
public static <K, V> LazySortedMap<K, V> lazySortedMap(SortedMap<K, V> p0, Transformer<? super K, ? extends V> p1){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,42 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.ListOrderedMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.List;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.OrderedMap;
|
||||
import org.apache.commons.collections4.OrderedMapIterator;
|
||||
import org.apache.commons.collections4.map.AbstractMapDecorator;
|
||||
|
||||
public class ListOrderedMap<K, V> extends AbstractMapDecorator<K, V> implements OrderedMap<K, V>, Serializable
|
||||
{
|
||||
protected ListOrderedMap(Map<K, V> p0){}
|
||||
public Collection<V> values(){ return null; }
|
||||
public K firstKey(){ return null; }
|
||||
public K get(int p0){ return null; }
|
||||
public K lastKey(){ return null; }
|
||||
public K nextKey(Object p0){ return null; }
|
||||
public K previousKey(Object p0){ return null; }
|
||||
public List<K> asList(){ return null; }
|
||||
public List<K> keyList(){ return null; }
|
||||
public List<V> valueList(){ return null; }
|
||||
public ListOrderedMap(){}
|
||||
public OrderedMapIterator<K, V> mapIterator(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public String toString(){ return null; }
|
||||
public V getValue(int p0){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V put(int p0, K p1, V p2){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public V remove(int p0){ return null; }
|
||||
public V setValue(int p0, V p1){ return null; }
|
||||
public int indexOf(Object p0){ return 0; }
|
||||
public static <K, V> ListOrderedMap<K, V> listOrderedMap(Map<K, V> p0){ return null; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
public void putAll(int p0, Map<? extends K, ? extends V> p1){}
|
||||
}
|
||||
@@ -0,0 +1,51 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.MultiKeyMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Map;
|
||||
import org.apache.commons.collections4.MapIterator;
|
||||
import org.apache.commons.collections4.keyvalue.MultiKey;
|
||||
import org.apache.commons.collections4.map.AbstractHashedMap;
|
||||
import org.apache.commons.collections4.map.AbstractMapDecorator;
|
||||
|
||||
public class MultiKeyMap<K, V> extends AbstractMapDecorator<MultiKey<? extends K>, V> implements Cloneable, Serializable
|
||||
{
|
||||
protected AbstractHashedMap<MultiKey<? extends K>, V> decorated(){ return null; }
|
||||
protected MultiKeyMap(AbstractHashedMap<MultiKey<? extends K>, V> p0){}
|
||||
protected boolean isEqualKey(AbstractHashedMap.HashEntry<MultiKey<? extends K>, V> p0, Object p1, Object p2){ return false; }
|
||||
protected boolean isEqualKey(AbstractHashedMap.HashEntry<MultiKey<? extends K>, V> p0, Object p1, Object p2, Object p3){ return false; }
|
||||
protected boolean isEqualKey(AbstractHashedMap.HashEntry<MultiKey<? extends K>, V> p0, Object p1, Object p2, Object p3, Object p4){ return false; }
|
||||
protected boolean isEqualKey(AbstractHashedMap.HashEntry<MultiKey<? extends K>, V> p0, Object p1, Object p2, Object p3, Object p4, Object p5){ return false; }
|
||||
protected int hash(Object p0, Object p1){ return 0; }
|
||||
protected int hash(Object p0, Object p1, Object p2){ return 0; }
|
||||
protected int hash(Object p0, Object p1, Object p2, Object p3){ return 0; }
|
||||
protected int hash(Object p0, Object p1, Object p2, Object p3, Object p4){ return 0; }
|
||||
protected void checkKey(MultiKey<? extends Object> p0){}
|
||||
public MapIterator<MultiKey<? extends K>, V> mapIterator(){ return null; }
|
||||
public MultiKeyMap(){}
|
||||
public MultiKeyMap<K, V> clone(){ return null; }
|
||||
public V get(Object p0, Object p1){ return null; }
|
||||
public V get(Object p0, Object p1, Object p2){ return null; }
|
||||
public V get(Object p0, Object p1, Object p2, Object p3){ return null; }
|
||||
public V get(Object p0, Object p1, Object p2, Object p3, Object p4){ return null; }
|
||||
public V put(K p0, K p1, K p2, K p3, K p4, V p5){ return null; }
|
||||
public V put(K p0, K p1, K p2, K p3, V p4){ return null; }
|
||||
public V put(K p0, K p1, K p2, V p3){ return null; }
|
||||
public V put(K p0, K p1, V p2){ return null; }
|
||||
public V put(MultiKey<? extends K> p0, V p1){ return null; }
|
||||
public V removeMultiKey(Object p0, Object p1){ return null; }
|
||||
public V removeMultiKey(Object p0, Object p1, Object p2){ return null; }
|
||||
public V removeMultiKey(Object p0, Object p1, Object p2, Object p3){ return null; }
|
||||
public V removeMultiKey(Object p0, Object p1, Object p2, Object p3, Object p4){ return null; }
|
||||
public boolean containsKey(Object p0, Object p1){ return false; }
|
||||
public boolean containsKey(Object p0, Object p1, Object p2){ return false; }
|
||||
public boolean containsKey(Object p0, Object p1, Object p2, Object p3){ return false; }
|
||||
public boolean containsKey(Object p0, Object p1, Object p2, Object p3, Object p4){ return false; }
|
||||
public boolean removeAll(Object p0){ return false; }
|
||||
public boolean removeAll(Object p0, Object p1){ return false; }
|
||||
public boolean removeAll(Object p0, Object p1, Object p2){ return false; }
|
||||
public boolean removeAll(Object p0, Object p1, Object p2, Object p3){ return false; }
|
||||
public static <K, V> MultiKeyMap<K, V> multiKeyMap(AbstractHashedMap<MultiKey<? extends K>, V> p0){ return null; }
|
||||
public void putAll(Map<? extends MultiKey<? extends K>, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,38 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.PassiveExpiringMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import java.util.concurrent.TimeUnit;
|
||||
import org.apache.commons.collections4.map.AbstractMapDecorator;
|
||||
|
||||
public class PassiveExpiringMap<K, V> extends AbstractMapDecorator<K, V> implements Serializable
|
||||
{
|
||||
public Collection<V> values(){ return null; }
|
||||
public PassiveExpiringMap(){}
|
||||
public PassiveExpiringMap(Map<K, V> p0){}
|
||||
public PassiveExpiringMap(PassiveExpiringMap.ExpirationPolicy<K, V> p0){}
|
||||
public PassiveExpiringMap(PassiveExpiringMap.ExpirationPolicy<K, V> p0, Map<K, V> p1){}
|
||||
public PassiveExpiringMap(long p0){}
|
||||
public PassiveExpiringMap(long p0, Map<K, V> p1){}
|
||||
public PassiveExpiringMap(long p0, TimeUnit p1){}
|
||||
public PassiveExpiringMap(long p0, TimeUnit p1, Map<K, V> p2){}
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public V get(Object p0){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public boolean containsKey(Object p0){ return false; }
|
||||
public boolean containsValue(Object p0){ return false; }
|
||||
public boolean isEmpty(){ return false; }
|
||||
public int size(){ return 0; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
static public interface ExpirationPolicy<K, V> extends Serializable
|
||||
{
|
||||
long expirationTime(K p0, V p1);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,22 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.PredicatedMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Map;
|
||||
import org.apache.commons.collections4.Predicate;
|
||||
import org.apache.commons.collections4.map.AbstractInputCheckedMapDecorator;
|
||||
|
||||
public class PredicatedMap<K, V> extends AbstractInputCheckedMapDecorator<K, V> implements Serializable
|
||||
{
|
||||
protected PredicatedMap() {}
|
||||
protected PredicatedMap(Map<K, V> p0, Predicate<? super K> p1, Predicate<? super V> p2){}
|
||||
protected V checkSetValue(V p0){ return null; }
|
||||
protected boolean isSetValueChecking(){ return false; }
|
||||
protected final Predicate<? super K> keyPredicate = null;
|
||||
protected final Predicate<? super V> valuePredicate = null;
|
||||
protected void validate(K p0, V p1){}
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public static <K, V> PredicatedMap<K, V> predicatedMap(Map<K, V> p0, Predicate<? super K> p1, Predicate<? super V> p2){ return null; }
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,22 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.PredicatedSortedMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.util.Comparator;
|
||||
import java.util.SortedMap;
|
||||
import org.apache.commons.collections4.Predicate;
|
||||
import org.apache.commons.collections4.map.PredicatedMap;
|
||||
|
||||
public class PredicatedSortedMap<K, V> extends PredicatedMap<K, V> implements SortedMap<K, V>
|
||||
{
|
||||
protected PredicatedSortedMap() {}
|
||||
protected PredicatedSortedMap(SortedMap<K, V> p0, Predicate<? super K> p1, Predicate<? super V> p2){}
|
||||
protected SortedMap<K, V> getSortedMap(){ return null; }
|
||||
public Comparator<? super K> comparator(){ return null; }
|
||||
public K firstKey(){ return null; }
|
||||
public K lastKey(){ return null; }
|
||||
public SortedMap<K, V> headMap(K p0){ return null; }
|
||||
public SortedMap<K, V> subMap(K p0, K p1){ return null; }
|
||||
public SortedMap<K, V> tailMap(K p0){ return null; }
|
||||
public static <K, V> PredicatedSortedMap<K, V> predicatedSortedMap(SortedMap<K, V> p0, Predicate<? super K> p1, Predicate<? super V> p2){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,49 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.SingletonMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.BoundedMap;
|
||||
import org.apache.commons.collections4.KeyValue;
|
||||
import org.apache.commons.collections4.OrderedMap;
|
||||
import org.apache.commons.collections4.OrderedMapIterator;
|
||||
|
||||
public class SingletonMap<K, V> implements BoundedMap<K, V>, Cloneable, KeyValue<K, V>, OrderedMap<K, V>, Serializable
|
||||
{
|
||||
protected boolean isEqualKey(Object p0){ return false; }
|
||||
protected boolean isEqualValue(Object p0){ return false; }
|
||||
public Collection<V> values(){ return null; }
|
||||
public K firstKey(){ return null; }
|
||||
public K getKey(){ return null; }
|
||||
public K lastKey(){ return null; }
|
||||
public K nextKey(K p0){ return null; }
|
||||
public K previousKey(K p0){ return null; }
|
||||
public OrderedMapIterator<K, V> mapIterator(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public SingletonMap(){}
|
||||
public SingletonMap(K p0, V p1){}
|
||||
public SingletonMap(KeyValue<K, V> p0){}
|
||||
public SingletonMap(Map.Entry<? extends K, ? extends V> p0){}
|
||||
public SingletonMap(Map<? extends K, ? extends V> p0){}
|
||||
public SingletonMap<K, V> clone(){ return null; }
|
||||
public String toString(){ return null; }
|
||||
public V get(Object p0){ return null; }
|
||||
public V getValue(){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public V setValue(V p0){ return null; }
|
||||
public boolean containsKey(Object p0){ return false; }
|
||||
public boolean containsValue(Object p0){ return false; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public boolean isEmpty(){ return false; }
|
||||
public boolean isFull(){ return false; }
|
||||
public int hashCode(){ return 0; }
|
||||
public int maxSize(){ return 0; }
|
||||
public int size(){ return 0; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,25 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.TransformedMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Map;
|
||||
import org.apache.commons.collections4.Transformer;
|
||||
import org.apache.commons.collections4.map.AbstractInputCheckedMapDecorator;
|
||||
|
||||
public class TransformedMap<K, V> extends AbstractInputCheckedMapDecorator<K, V> implements Serializable
|
||||
{
|
||||
protected TransformedMap() {}
|
||||
protected K transformKey(K p0){ return null; }
|
||||
protected Map<K, V> transformMap(Map<? extends K, ? extends V> p0){ return null; }
|
||||
protected TransformedMap(Map<K, V> p0, Transformer<? super K, ? extends K> p1, Transformer<? super V, ? extends V> p2){}
|
||||
protected V checkSetValue(V p0){ return null; }
|
||||
protected V transformValue(V p0){ return null; }
|
||||
protected boolean isSetValueChecking(){ return false; }
|
||||
protected final Transformer<? super K, ? extends K> keyTransformer = null;
|
||||
protected final Transformer<? super V, ? extends V> valueTransformer = null;
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public static <K, V> TransformedMap<K, V> transformedMap(Map<K, V> p0, Transformer<? super K, ? extends K> p1, Transformer<? super V, ? extends V> p2){ return null; }
|
||||
public static <K, V> TransformedMap<K, V> transformingMap(Map<K, V> p0, Transformer<? super K, ? extends K> p1, Transformer<? super V, ? extends V> p2){ return null; }
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,23 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.TransformedSortedMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.util.Comparator;
|
||||
import java.util.SortedMap;
|
||||
import org.apache.commons.collections4.Transformer;
|
||||
import org.apache.commons.collections4.map.TransformedMap;
|
||||
|
||||
public class TransformedSortedMap<K, V> extends TransformedMap<K, V> implements SortedMap<K, V>
|
||||
{
|
||||
protected TransformedSortedMap() {}
|
||||
protected SortedMap<K, V> getSortedMap(){ return null; }
|
||||
protected TransformedSortedMap(SortedMap<K, V> p0, Transformer<? super K, ? extends K> p1, Transformer<? super V, ? extends V> p2){}
|
||||
public Comparator<? super K> comparator(){ return null; }
|
||||
public K firstKey(){ return null; }
|
||||
public K lastKey(){ return null; }
|
||||
public SortedMap<K, V> headMap(K p0){ return null; }
|
||||
public SortedMap<K, V> subMap(K p0, K p1){ return null; }
|
||||
public SortedMap<K, V> tailMap(K p0){ return null; }
|
||||
public static <K, V> TransformedSortedMap<K, V> transformedSortedMap(SortedMap<K, V> p0, Transformer<? super K, ? extends K> p1, Transformer<? super V, ? extends V> p2){ return null; }
|
||||
public static <K, V> TransformedSortedMap<K, V> transformingSortedMap(SortedMap<K, V> p0, Transformer<? super K, ? extends K> p1, Transformer<? super V, ? extends V> p2){ return null; }
|
||||
}
|
||||
@@ -0,0 +1,27 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.UnmodifiableEntrySet for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import java.util.function.Predicate;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
import org.apache.commons.collections4.set.AbstractSetDecorator;
|
||||
|
||||
public class UnmodifiableEntrySet<K, V> extends AbstractSetDecorator<Map.Entry<K, V>> implements Unmodifiable
|
||||
{
|
||||
protected UnmodifiableEntrySet() {}
|
||||
public <T> T[] toArray(T[] p0){ return null; }
|
||||
public Iterator<Map.Entry<K, V>> iterator(){ return null; }
|
||||
public Object[] toArray(){ return null; }
|
||||
public boolean add(Map.Entry<K, V> p0){ return false; }
|
||||
public boolean addAll(Collection<? extends Map.Entry<K, V>> p0){ return false; }
|
||||
public boolean remove(Object p0){ return false; }
|
||||
public boolean removeAll(Collection<? extends Object> p0){ return false; }
|
||||
public boolean removeIf(Predicate<? super Map.Entry<K, V>> p0){ return false; }
|
||||
public boolean retainAll(Collection<? extends Object> p0){ return false; }
|
||||
public static <K, V> Set<Map.Entry<K, V>> unmodifiableEntrySet(Set<Map.Entry<K, V>> p0){ return null; }
|
||||
public void clear(){}
|
||||
}
|
||||
@@ -0,0 +1,25 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.UnmodifiableMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.MapIterator;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
import org.apache.commons.collections4.map.AbstractMapDecorator;
|
||||
|
||||
public class UnmodifiableMap<K, V> extends AbstractMapDecorator<K, V> implements Serializable, Unmodifiable
|
||||
{
|
||||
protected UnmodifiableMap() {}
|
||||
public Collection<V> values(){ return null; }
|
||||
public MapIterator<K, V> mapIterator(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public static <K, V> Map<K, V> unmodifiableMap(Map<? extends K, ? extends V> p0){ return null; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,26 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.UnmodifiableOrderedMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import org.apache.commons.collections4.OrderedMap;
|
||||
import org.apache.commons.collections4.OrderedMapIterator;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
import org.apache.commons.collections4.map.AbstractOrderedMapDecorator;
|
||||
|
||||
public class UnmodifiableOrderedMap<K, V> extends AbstractOrderedMapDecorator<K, V> implements Serializable, Unmodifiable
|
||||
{
|
||||
protected UnmodifiableOrderedMap() {}
|
||||
public Collection<V> values(){ return null; }
|
||||
public OrderedMapIterator<K, V> mapIterator(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public static <K, V> OrderedMap<K, V> unmodifiableOrderedMap(OrderedMap<? extends K, ? extends V> p0){ return null; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
@@ -0,0 +1,31 @@
|
||||
// Generated automatically from org.apache.commons.collections4.map.UnmodifiableSortedMap for testing purposes
|
||||
|
||||
package org.apache.commons.collections4.map;
|
||||
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Comparator;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import java.util.SortedMap;
|
||||
import org.apache.commons.collections4.Unmodifiable;
|
||||
import org.apache.commons.collections4.map.AbstractSortedMapDecorator;
|
||||
|
||||
public class UnmodifiableSortedMap<K, V> extends AbstractSortedMapDecorator<K, V> implements Serializable, Unmodifiable
|
||||
{
|
||||
protected UnmodifiableSortedMap() {}
|
||||
public Collection<V> values(){ return null; }
|
||||
public Comparator<? super K> comparator(){ return null; }
|
||||
public K firstKey(){ return null; }
|
||||
public K lastKey(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public SortedMap<K, V> headMap(K p0){ return null; }
|
||||
public SortedMap<K, V> subMap(K p0, K p1){ return null; }
|
||||
public SortedMap<K, V> tailMap(K p0){ return null; }
|
||||
public V put(K p0, V p1){ return null; }
|
||||
public V remove(Object p0){ return null; }
|
||||
public static <K, V> SortedMap<K, V> unmodifiableSortedMap(SortedMap<K, ? extends V> p0){ return null; }
|
||||
public void clear(){}
|
||||
public void putAll(Map<? extends K, ? extends V> p0){}
|
||||
}
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user