mirror of
https://github.com/github/codeql.git
synced 2026-04-29 10:45:15 +02:00
Update stubs to not include package protected members
This commit is contained in:
@@ -6,10 +6,6 @@ import com.google.common.base.Function;
|
||||
|
||||
abstract public class Converter<A, B> implements Function<A, B>
|
||||
{
|
||||
<C> Converter<A, C> doAndThen(Converter<B, C> p0){ return null; }
|
||||
A correctedDoBackward(B p0){ return null; }
|
||||
B correctedDoForward(A p0){ return null; }
|
||||
Converter(boolean p0){}
|
||||
protected Converter(){}
|
||||
protected abstract A doBackward(B p0);
|
||||
protected abstract B doForward(A p0);
|
||||
|
||||
@@ -11,10 +11,6 @@ import java.util.Map;
|
||||
abstract class AbstractListMultimap<K, V> extends AbstractMapBasedMultimap<K, V> implements ListMultimap<K, V>
|
||||
{
|
||||
protected AbstractListMultimap() {}
|
||||
<E> Collection<E> unmodifiableCollectionSubclass(Collection<E> p0){ return null; }
|
||||
Collection<V> wrapCollection(K p0, Collection<V> p1){ return null; }
|
||||
List<V> createUnmodifiableEmptyCollection(){ return null; }
|
||||
abstract List<V> createCollection();
|
||||
protected AbstractListMultimap(Map<K, Collection<V>> p0){}
|
||||
public List<V> get(K p0){ return null; }
|
||||
public List<V> removeAll(Object p0){ return null; }
|
||||
|
||||
@@ -3,68 +3,17 @@
|
||||
package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.AbstractMultimap;
|
||||
import com.google.common.collect.Multiset;
|
||||
import java.io.Serializable;
|
||||
import java.util.AbstractCollection;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import java.util.Spliterator;
|
||||
import java.util.function.BiConsumer;
|
||||
|
||||
abstract class AbstractMapBasedMultimap<K, V> extends AbstractMultimap<K, V> implements Serializable
|
||||
{
|
||||
protected AbstractMapBasedMultimap() {}
|
||||
<E> Collection<E> unmodifiableCollectionSubclass(Collection<E> p0){ return null; }
|
||||
Collection<Map.Entry<K, V>> createEntries(){ return null; }
|
||||
Collection<V> createCollection(K p0){ return null; }
|
||||
Collection<V> createUnmodifiableEmptyCollection(){ return null; }
|
||||
Collection<V> createValues(){ return null; }
|
||||
Collection<V> wrapCollection(K p0, Collection<V> p1){ return null; }
|
||||
Iterator<Map.Entry<K, V>> entryIterator(){ return null; }
|
||||
Iterator<V> valueIterator(){ return null; }
|
||||
Map<K, Collection<V>> backingMap(){ return null; }
|
||||
Map<K, Collection<V>> createAsMap(){ return null; }
|
||||
Multiset<K> createKeys(){ return null; }
|
||||
Set<K> createKeySet(){ return null; }
|
||||
Spliterator<Map.Entry<K, V>> entrySpliterator(){ return null; }
|
||||
Spliterator<V> valueSpliterator(){ return null; }
|
||||
abstract Collection<V> createCollection();
|
||||
class WrappedCollection extends AbstractCollection<V>
|
||||
{
|
||||
protected WrappedCollection() {}
|
||||
AbstractMapBasedMultimap.WrappedCollection getAncestor(){ return null; }
|
||||
Collection<V> delegate = null;
|
||||
Collection<V> getDelegate(){ return null; }
|
||||
K getKey(){ return null; }
|
||||
WrappedCollection(K p0, Collection<V> p1, AbstractMapBasedMultimap.WrappedCollection p2){}
|
||||
final AbstractMapBasedMultimap.WrappedCollection ancestor = null;
|
||||
final Collection<V> ancestorDelegate = null;
|
||||
final K key = null;
|
||||
public Iterator<V> iterator(){ return null; }
|
||||
public Spliterator<V> spliterator(){ return null; }
|
||||
public String toString(){ return null; }
|
||||
public boolean add(V p0){ return false; }
|
||||
public boolean addAll(Collection<? extends V> 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 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 size(){ return 0; }
|
||||
public void clear(){}
|
||||
void addToMap(){}
|
||||
void refreshIfEmpty(){}
|
||||
void removeIfEmpty(){}
|
||||
}
|
||||
final List<V> wrapList(K p0, List<V> p1, AbstractMapBasedMultimap.WrappedCollection p2){ return null; }
|
||||
final Map<K, Collection<V>> createMaybeNavigableAsMap(){ return null; }
|
||||
final Set<K> createMaybeNavigableKeySet(){ return null; }
|
||||
final void setMap(Map<K, Collection<V>> p0){}
|
||||
protected AbstractMapBasedMultimap(Map<K, Collection<V>> p0){}
|
||||
public Collection<Map.Entry<K, V>> entries(){ return null; }
|
||||
public Collection<V> get(K p0){ return null; }
|
||||
|
||||
@@ -14,9 +14,6 @@ import java.util.function.ObjIntConsumer;
|
||||
abstract class AbstractMapBasedMultiset<E> extends AbstractMultiset<E> implements Serializable
|
||||
{
|
||||
protected AbstractMapBasedMultiset() {}
|
||||
Iterator<E> elementIterator(){ return null; }
|
||||
Iterator<Multiset.Entry<E>> entryIterator(){ return null; }
|
||||
int distinctElements(){ return 0; }
|
||||
protected AbstractMapBasedMultiset(Map<E, Count> p0){}
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public Set<Multiset.Entry<E>> entrySet(){ return null; }
|
||||
@@ -27,5 +24,4 @@ abstract class AbstractMapBasedMultiset<E> extends AbstractMultiset<E> implement
|
||||
public int size(){ return 0; }
|
||||
public void clear(){}
|
||||
public void forEachEntry(ObjIntConsumer<? super E> p0){}
|
||||
void setBackingMap(Map<E, Count> p0){}
|
||||
}
|
||||
|
||||
@@ -5,7 +5,6 @@ package com.google.common.collect;
|
||||
import com.google.common.collect.Multimap;
|
||||
import com.google.common.collect.Multiset;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
|
||||
|
||||
@@ -5,17 +5,10 @@ package com.google.common.collect;
|
||||
import com.google.common.collect.Multiset;
|
||||
import java.util.AbstractCollection;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.Set;
|
||||
|
||||
abstract class AbstractMultiset<E> extends AbstractCollection<E> implements Multiset<E>
|
||||
{
|
||||
AbstractMultiset(){}
|
||||
Set<E> createElementSet(){ return null; }
|
||||
Set<Multiset.Entry<E>> createEntrySet(){ return null; }
|
||||
abstract Iterator<E> elementIterator();
|
||||
abstract Iterator<Multiset.Entry<E>> entryIterator();
|
||||
abstract int distinctElements();
|
||||
public Set<E> elementSet(){ return null; }
|
||||
public Set<Multiset.Entry<E>> entrySet(){ return null; }
|
||||
public abstract void clear();
|
||||
|
||||
@@ -11,10 +11,6 @@ import java.util.Set;
|
||||
abstract class AbstractSetMultimap<K, V> extends AbstractMapBasedMultimap<K, V> implements SetMultimap<K, V>
|
||||
{
|
||||
protected AbstractSetMultimap() {}
|
||||
<E> Collection<E> unmodifiableCollectionSubclass(Collection<E> p0){ return null; }
|
||||
Collection<V> wrapCollection(K p0, Collection<V> p1){ return null; }
|
||||
Set<V> createUnmodifiableEmptyCollection(){ return null; }
|
||||
abstract Set<V> createCollection();
|
||||
protected AbstractSetMultimap(Map<K, Collection<V>> p0){}
|
||||
public Map<K, Collection<V>> asMap(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entries(){ return null; }
|
||||
|
||||
@@ -4,16 +4,12 @@ package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.AbstractSortedSetMultimap;
|
||||
import java.util.Collection;
|
||||
import java.util.Set;
|
||||
import java.util.SortedMap;
|
||||
import java.util.SortedSet;
|
||||
|
||||
abstract class AbstractSortedKeySortedSetMultimap<K, V> extends AbstractSortedSetMultimap<K, V>
|
||||
{
|
||||
protected AbstractSortedKeySortedSetMultimap() {}
|
||||
AbstractSortedKeySortedSetMultimap(SortedMap<K, Collection<V>> p0){}
|
||||
Set<K> createKeySet(){ return null; }
|
||||
SortedMap<K, Collection<V>> backingMap(){ return null; }
|
||||
public SortedMap<K, Collection<V>> asMap(){ return null; }
|
||||
public SortedSet<K> keySet(){ return null; }
|
||||
}
|
||||
|
||||
@@ -7,18 +7,10 @@ import com.google.common.collect.BoundType;
|
||||
import com.google.common.collect.Multiset;
|
||||
import com.google.common.collect.SortedMultiset;
|
||||
import java.util.Comparator;
|
||||
import java.util.Iterator;
|
||||
import java.util.NavigableSet;
|
||||
|
||||
abstract class AbstractSortedMultiset<E> extends AbstractMultiset<E> implements SortedMultiset<E>
|
||||
{
|
||||
AbstractSortedMultiset(){}
|
||||
AbstractSortedMultiset(Comparator<? super E> p0){}
|
||||
Iterator<E> descendingIterator(){ return null; }
|
||||
NavigableSet<E> createElementSet(){ return null; }
|
||||
SortedMultiset<E> createDescendingMultiset(){ return null; }
|
||||
abstract Iterator<Multiset.Entry<E>> descendingEntryIterator();
|
||||
final Comparator<? super E> comparator = null;
|
||||
public Comparator<? super E> comparator(){ return null; }
|
||||
public Multiset.Entry<E> firstEntry(){ return null; }
|
||||
public Multiset.Entry<E> lastEntry(){ return null; }
|
||||
|
||||
@@ -11,10 +11,6 @@ import java.util.SortedSet;
|
||||
abstract class AbstractSortedSetMultimap<K, V> extends AbstractSetMultimap<K, V> implements SortedSetMultimap<K, V>
|
||||
{
|
||||
protected AbstractSortedSetMultimap() {}
|
||||
<E> SortedSet<E> unmodifiableCollectionSubclass(Collection<E> p0){ return null; }
|
||||
Collection<V> wrapCollection(K p0, Collection<V> p1){ return null; }
|
||||
SortedSet<V> createUnmodifiableEmptyCollection(){ return null; }
|
||||
abstract SortedSet<V> createCollection();
|
||||
protected AbstractSortedSetMultimap(Map<K, Collection<V>> p0){}
|
||||
public Collection<V> values(){ return null; }
|
||||
public Map<K, Collection<V>> asMap(){ return null; }
|
||||
|
||||
@@ -4,19 +4,10 @@ package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.Table;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.Set;
|
||||
import java.util.Spliterator;
|
||||
|
||||
abstract class AbstractTable<R, C, V> implements Table<R, C, V>
|
||||
{
|
||||
AbstractTable(){}
|
||||
Collection<V> createValues(){ return null; }
|
||||
Iterator<V> valuesIterator(){ return null; }
|
||||
Set<Table.Cell<R, C, V>> createCellSet(){ return null; }
|
||||
Spliterator<V> valuesSpliterator(){ return null; }
|
||||
abstract Iterator<Table.Cell<R, C, V>> cellIterator();
|
||||
abstract Spliterator<Table.Cell<R, C, V>> cellSpliterator();
|
||||
public Collection<V> values(){ return null; }
|
||||
public Set<C> columnKeySet(){ return null; }
|
||||
public Set<R> rowKeySet(){ return null; }
|
||||
|
||||
@@ -4,13 +4,10 @@ package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.ArrayListMultimapGwtSerializationDependencies;
|
||||
import com.google.common.collect.Multimap;
|
||||
import java.util.List;
|
||||
|
||||
public class ArrayListMultimap<K, V> extends ArrayListMultimapGwtSerializationDependencies<K, V>
|
||||
{
|
||||
protected ArrayListMultimap() {}
|
||||
List<V> createCollection(){ return null; }
|
||||
int expectedValuesPerKey = 0;
|
||||
public static <K, V> ArrayListMultimap<K, V> create(){ return null; }
|
||||
public static <K, V> ArrayListMultimap<K, V> create(Multimap<? extends K, ? extends V> p0){ return null; }
|
||||
public static <K, V> ArrayListMultimap<K, V> create(int p0, int p1){ return null; }
|
||||
|
||||
@@ -3,11 +3,8 @@
|
||||
package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.AbstractListMultimap;
|
||||
import java.util.Collection;
|
||||
import java.util.Map;
|
||||
|
||||
abstract class ArrayListMultimapGwtSerializationDependencies<K, V> extends AbstractListMultimap<K, V>
|
||||
{
|
||||
protected ArrayListMultimapGwtSerializationDependencies() {}
|
||||
ArrayListMultimapGwtSerializationDependencies(Map<K, Collection<V>> p0){}
|
||||
}
|
||||
|
||||
@@ -8,18 +8,12 @@ import com.google.common.collect.ImmutableSet;
|
||||
import com.google.common.collect.Table;
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import java.util.Spliterator;
|
||||
|
||||
public class ArrayTable<R, C, V> extends AbstractTable<R, C, V> implements Serializable
|
||||
{
|
||||
protected ArrayTable() {}
|
||||
Iterator<Table.Cell<R, C, V>> cellIterator(){ return null; }
|
||||
Iterator<V> valuesIterator(){ return null; }
|
||||
Spliterator<Table.Cell<R, C, V>> cellSpliterator(){ return null; }
|
||||
Spliterator<V> valuesSpliterator(){ return null; }
|
||||
public Collection<V> values(){ return null; }
|
||||
public ImmutableList<C> columnKeyList(){ return null; }
|
||||
public ImmutableList<R> rowKeyList(){ return null; }
|
||||
|
||||
@@ -7,7 +7,4 @@ public enum BoundType
|
||||
{
|
||||
CLOSED, OPEN;
|
||||
private BoundType() {}
|
||||
BoundType flip(){ return null; }
|
||||
final boolean inclusive = false;
|
||||
static BoundType forBoolean(boolean p0){ return null; }
|
||||
}
|
||||
|
||||
@@ -16,9 +16,4 @@ public class Collections2
|
||||
public static <E> Collection<List<E>> orderedPermutations(Iterable<E> p0, Comparator<? super E> p1){ return null; }
|
||||
public static <E> Collection<List<E>> permutations(Collection<E> p0){ return null; }
|
||||
public static <F, T> Collection<T> transform(Collection<F> p0, Function<? super F, T> p1){ return null; }
|
||||
static String toStringImpl(Collection<? extends Object> p0){ return null; }
|
||||
static StringBuilder newStringBuilderForCollection(int p0){ return null; }
|
||||
static boolean containsAllImpl(Collection<? extends Object> p0, Collection<? extends Object> p1){ return false; }
|
||||
static boolean safeContains(Collection<? extends Object> p0, Object p1){ return false; }
|
||||
static boolean safeRemove(Collection<? extends Object> p0, Object p1){ return false; }
|
||||
}
|
||||
|
||||
@@ -13,11 +13,6 @@ import java.util.concurrent.atomic.AtomicInteger;
|
||||
public class ConcurrentHashMultiset<E> extends AbstractMultiset<E> implements Serializable
|
||||
{
|
||||
protected ConcurrentHashMultiset() {}
|
||||
ConcurrentHashMultiset(ConcurrentMap<E, AtomicInteger> p0){}
|
||||
Iterator<E> elementIterator(){ return null; }
|
||||
Iterator<Multiset.Entry<E>> entryIterator(){ return null; }
|
||||
Set<E> createElementSet(){ return null; }
|
||||
int distinctElements(){ return 0; }
|
||||
public <T> T[] toArray(T[] p0){ return null; }
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public Object[] toArray(){ return null; }
|
||||
|
||||
@@ -7,7 +7,6 @@ import java.io.Serializable;
|
||||
class Count implements Serializable
|
||||
{
|
||||
protected Count() {}
|
||||
Count(int p0){}
|
||||
public String toString(){ return null; }
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public int addAndGet(int p0){ return 0; }
|
||||
|
||||
@@ -2,31 +2,12 @@
|
||||
|
||||
package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.BoundType;
|
||||
import com.google.common.collect.DiscreteDomain;
|
||||
import java.io.Serializable;
|
||||
|
||||
abstract class Cut<C extends Comparable> implements Comparable<Cut<C>>, Serializable
|
||||
{
|
||||
protected Cut() {}
|
||||
C endpoint(){ return null; }
|
||||
Cut(C p0){}
|
||||
Cut<C> canonical(DiscreteDomain<C> p0){ return null; }
|
||||
abstract BoundType typeAsLowerBound();
|
||||
abstract BoundType typeAsUpperBound();
|
||||
abstract C greatestValueBelow(DiscreteDomain<C> p0);
|
||||
abstract C leastValueAbove(DiscreteDomain<C> p0);
|
||||
abstract Cut<C> withLowerBoundType(BoundType p0, DiscreteDomain<C> p1);
|
||||
abstract Cut<C> withUpperBoundType(BoundType p0, DiscreteDomain<C> p1);
|
||||
abstract boolean isLessThan(C p0);
|
||||
abstract void describeAsLowerBound(StringBuilder p0);
|
||||
abstract void describeAsUpperBound(StringBuilder p0);
|
||||
final C endpoint = null;
|
||||
public abstract int hashCode();
|
||||
public boolean equals(Object p0){ return false; }
|
||||
public int compareTo(Cut<C> p0){ return 0; }
|
||||
static <C extends Comparable> Cut<C> aboveAll(){ return null; }
|
||||
static <C extends Comparable> Cut<C> aboveValue(C p0){ return null; }
|
||||
static <C extends Comparable> Cut<C> belowAll(){ return null; }
|
||||
static <C extends Comparable> Cut<C> belowValue(C p0){ return null; }
|
||||
}
|
||||
|
||||
@@ -6,8 +6,6 @@ import java.math.BigInteger;
|
||||
|
||||
abstract public class DiscreteDomain<C extends Comparable>
|
||||
{
|
||||
C offset(C p0, long p1){ return null; }
|
||||
final boolean supportsFastOffset = false;
|
||||
protected DiscreteDomain(){}
|
||||
public C maxValue(){ return null; }
|
||||
public C minValue(){ return null; }
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
// Generated automatically from com.google.common.collect.HashBasedTable for testing purposes, and manually adjusted.
|
||||
// Generated automatically from com.google.common.collect.HashBasedTable for testing purposes
|
||||
|
||||
package com.google.common.collect;
|
||||
|
||||
|
||||
@@ -5,7 +5,6 @@ package com.google.common.collect;
|
||||
import com.google.common.collect.BiMap;
|
||||
import com.google.common.collect.Maps;
|
||||
import java.io.Serializable;
|
||||
import java.util.Iterator;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import java.util.function.BiConsumer;
|
||||
@@ -14,7 +13,6 @@ import java.util.function.BiFunction;
|
||||
public class HashBiMap<K, V> extends Maps.IteratorBasedAbstractMap<K, V> implements BiMap<K, V>, Serializable
|
||||
{
|
||||
protected HashBiMap() {}
|
||||
Iterator<Map.Entry<K, V>> entryIterator(){ return null; }
|
||||
public BiMap<V, K> inverse(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<V> values(){ return null; }
|
||||
|
||||
@@ -4,13 +4,10 @@ package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.HashMultimapGwtSerializationDependencies;
|
||||
import com.google.common.collect.Multimap;
|
||||
import java.util.Set;
|
||||
|
||||
public class HashMultimap<K, V> extends HashMultimapGwtSerializationDependencies<K, V>
|
||||
{
|
||||
protected HashMultimap() {}
|
||||
Set<V> createCollection(){ return null; }
|
||||
int expectedValuesPerKey = 0;
|
||||
public static <K, V> HashMultimap<K, V> create(){ return null; }
|
||||
public static <K, V> HashMultimap<K, V> create(Multimap<? extends K, ? extends V> p0){ return null; }
|
||||
public static <K, V> HashMultimap<K, V> create(int p0, int p1){ return null; }
|
||||
|
||||
@@ -3,11 +3,8 @@
|
||||
package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.AbstractSetMultimap;
|
||||
import java.util.Collection;
|
||||
import java.util.Map;
|
||||
|
||||
abstract class HashMultimapGwtSerializationDependencies<K, V> extends AbstractSetMultimap<K, V>
|
||||
{
|
||||
protected HashMultimapGwtSerializationDependencies() {}
|
||||
HashMultimapGwtSerializationDependencies(Map<K, Collection<V>> p0){}
|
||||
}
|
||||
|
||||
@@ -10,7 +10,6 @@ import java.util.Map;
|
||||
public class ImmutableClassToInstanceMap<B> extends ForwardingMap<Class<? extends B>, B> implements ClassToInstanceMap<B>, Serializable
|
||||
{
|
||||
protected ImmutableClassToInstanceMap() {}
|
||||
Object readResolve(){ return null; }
|
||||
protected Map<Class<? extends B>, B> delegate(){ return null; }
|
||||
public <T extends B> T getInstance(Class<T> p0){ return null; }
|
||||
public <T extends B> T putInstance(Class<T> p0, T p1){ return null; }
|
||||
|
||||
@@ -58,18 +58,8 @@ abstract public class ImmutableList<E> extends ImmutableCollection<E> implements
|
||||
public static <E> ImmutableList<E> of(E p0, E p1, E p2, E p3, E p4, E p5, E p6, E p7, E p8, E p9, E p10, E p11, E... p12){ return null; }
|
||||
public static <E> ImmutableList<E> sortedCopyOf(Comparator<? super E> p0, Iterable<? extends E> p1){ return null; }
|
||||
public void forEach(Consumer<? super E> p0){}
|
||||
<<<<<<< HEAD
|
||||
static public class Builder<E> extends ImmutableCollection.Builder<E>
|
||||
{
|
||||
=======
|
||||
static <E> ImmutableList<E> asImmutableList(Object[] p0){ return null; }
|
||||
static <E> ImmutableList<E> asImmutableList(Object[] p0, int p1){ return null; }
|
||||
static public class Builder<E> extends ImmutableCollection.Builder<E>
|
||||
{
|
||||
Builder(int p0){}
|
||||
ImmutableList.Builder<E> combine(ImmutableList.Builder<E> p0){ return null; }
|
||||
Object[] contents = null;
|
||||
>>>>>>> 2bc43eb337... Generate stubs.
|
||||
public Builder(){}
|
||||
public ImmutableList.Builder<E> add(E p0){ return null; }
|
||||
public ImmutableList.Builder<E> add(E... p0){ return null; }
|
||||
|
||||
@@ -3,11 +3,9 @@
|
||||
package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.ImmutableList;
|
||||
import com.google.common.collect.ImmutableMap;
|
||||
import com.google.common.collect.ImmutableMultimap;
|
||||
import com.google.common.collect.ListMultimap;
|
||||
import com.google.common.collect.Multimap;
|
||||
import java.util.Collection;
|
||||
import java.util.Comparator;
|
||||
import java.util.Map;
|
||||
import java.util.function.Function;
|
||||
@@ -17,7 +15,6 @@ import java.util.stream.Stream;
|
||||
public class ImmutableListMultimap<K, V> extends ImmutableMultimap<K, V> implements ListMultimap<K, V>
|
||||
{
|
||||
protected ImmutableListMultimap() {}
|
||||
ImmutableListMultimap(ImmutableMap<K, ImmutableList<V>> p0, int p1){}
|
||||
public ImmutableList<V> get(K p0){ return null; }
|
||||
public ImmutableListMultimap<V, K> inverse(){ return null; }
|
||||
public final ImmutableList<V> removeAll(Object p0){ return null; }
|
||||
@@ -33,10 +30,8 @@ public class ImmutableListMultimap<K, V> extends ImmutableMultimap<K, V> impleme
|
||||
public static <K, V> ImmutableListMultimap<K, V> of(K p0, V p1, K p2, V p3, K p4, V p5, K p6, V p7, K p8, V p9){ return null; }
|
||||
public static <T, K, V> Collector<T, ? extends Object, ImmutableListMultimap<K, V>> flatteningToImmutableListMultimap(Function<? super T, ? extends K> p0, Function<? super T, ? extends Stream<? extends V>> p1){ return null; }
|
||||
public static <T, K, V> Collector<T, ? extends Object, ImmutableListMultimap<K, V>> toImmutableListMultimap(Function<? super T, ? extends K> p0, Function<? super T, ? extends V> p1){ return null; }
|
||||
static <K, V> ImmutableListMultimap<K, V> fromMapEntries(Collection<? extends Map.Entry<? extends K, ? extends Collection<? extends V>>> p0, Comparator<? super V> p1){ return null; }
|
||||
static public class Builder<K, V> extends ImmutableMultimap.Builder<K, V>
|
||||
{
|
||||
ImmutableListMultimap.Builder<K, V> combine(ImmutableMultimap.Builder<K, V> p0){ return null; }
|
||||
public Builder(){}
|
||||
public ImmutableListMultimap.Builder<K, V> orderKeysBy(Comparator<? super K> p0){ return null; }
|
||||
public ImmutableListMultimap.Builder<K, V> orderValuesBy(Comparator<? super V> p0){ return null; }
|
||||
|
||||
@@ -3,12 +3,10 @@
|
||||
package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.ImmutableCollection;
|
||||
import com.google.common.collect.ImmutableList;
|
||||
import com.google.common.collect.ImmutableMap;
|
||||
import com.google.common.collect.ImmutableSet;
|
||||
import com.google.common.collect.ImmutableSortedMapFauxverideShim;
|
||||
import com.google.common.collect.ImmutableSortedSet;
|
||||
import com.google.common.collect.RegularImmutableSortedSet;
|
||||
import java.util.Comparator;
|
||||
import java.util.Map;
|
||||
import java.util.NavigableMap;
|
||||
@@ -21,13 +19,6 @@ import java.util.stream.Collector;
|
||||
public class ImmutableSortedMap<K, V> extends ImmutableSortedMapFauxverideShim<K, V> implements NavigableMap<K, V>
|
||||
{
|
||||
protected ImmutableSortedMap() {}
|
||||
ImmutableCollection<V> createValues(){ return null; }
|
||||
ImmutableSet<K> createKeySet(){ return null; }
|
||||
ImmutableSet<Map.Entry<K, V>> createEntrySet(){ return null; }
|
||||
ImmutableSortedMap(RegularImmutableSortedSet<K> p0, ImmutableList<V> p1){}
|
||||
ImmutableSortedMap(RegularImmutableSortedSet<K> p0, ImmutableList<V> p1, ImmutableSortedMap<K, V> p2){}
|
||||
Object writeReplace(){ return null; }
|
||||
boolean isPartialView(){ return false; }
|
||||
public Comparator<? super K> comparator(){ return null; }
|
||||
public ImmutableCollection<V> values(){ return null; }
|
||||
public ImmutableSet<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
@@ -74,11 +65,9 @@ public class ImmutableSortedMap<K, V> extends ImmutableSortedMapFauxverideShim<K
|
||||
public static <T, K, V> Collector<T, ? extends Object, ImmutableSortedMap<K, V>> toImmutableSortedMap(Comparator<? super K> p0, Function<? super T, ? extends K> p1, Function<? super T, ? extends V> p2){ return null; }
|
||||
public static <T, K, V> Collector<T, ? extends Object, ImmutableSortedMap<K, V>> toImmutableSortedMap(Comparator<? super K> p0, Function<? super T, ? extends K> p1, Function<? super T, ? extends V> p2, BinaryOperator<V> p3){ return null; }
|
||||
public void forEach(BiConsumer<? super K, ? super V> p0){}
|
||||
static <K, V> ImmutableSortedMap<K, V> emptyMap(Comparator<? super K> p0){ return null; }
|
||||
static public class Builder<K, V> extends ImmutableMap.Builder<K, V>
|
||||
{
|
||||
protected Builder() {}
|
||||
ImmutableSortedMap.Builder<K, V> combine(ImmutableMap.Builder<K, V> p0){ return null; }
|
||||
public Builder(Comparator<? super K> p0){}
|
||||
public ImmutableSortedMap.Builder<K, V> put(K p0, V p1){ return null; }
|
||||
public ImmutableSortedMap.Builder<K, V> put(Map.Entry<? extends K, ? extends V> p0){ return null; }
|
||||
|
||||
@@ -10,7 +10,6 @@ import java.util.stream.Collector;
|
||||
|
||||
abstract class ImmutableSortedMapFauxverideShim<K, V> extends ImmutableMap<K, V>
|
||||
{
|
||||
ImmutableSortedMapFauxverideShim(){}
|
||||
public static <K, V> ImmutableSortedMap.Builder<K, V> builder(){ return null; }
|
||||
public static <K, V> ImmutableSortedMap.Builder<K, V> builderWithExpectedSize(int p0){ return null; }
|
||||
public static <K, V> ImmutableSortedMap<K, V> of(K p0, V p1){ return null; }
|
||||
|
||||
@@ -16,9 +16,6 @@ import java.util.stream.Collector;
|
||||
|
||||
abstract public class ImmutableSortedMultiset<E> extends ImmutableSortedMultisetFauxverideShim<E> implements SortedMultiset<E>
|
||||
{
|
||||
ImmutableSortedMultiset(){}
|
||||
ImmutableSortedMultiset<E> descendingMultiset = null;
|
||||
Object writeReplace(){ return null; }
|
||||
public ImmutableSortedMultiset<E> descendingMultiset(){ return null; }
|
||||
public ImmutableSortedMultiset<E> subMultiset(E p0, BoundType p1, E p2, BoundType p3){ return null; }
|
||||
public abstract ImmutableSortedMultiset<E> headMultiset(E p0, BoundType p1);
|
||||
@@ -45,7 +42,6 @@ abstract public class ImmutableSortedMultiset<E> extends ImmutableSortedMultiset
|
||||
public static <E> ImmutableSortedMultiset<E> copyOfSorted(SortedMultiset<E> p0){ return null; }
|
||||
public static <E> ImmutableSortedMultiset<E> of(){ return null; }
|
||||
public static <T, E> Collector<T, ? extends Object, ImmutableSortedMultiset<E>> toImmutableSortedMultiset(Comparator<? super E> p0, Function<? super T, ? extends E> p1, ToIntFunction<? super T> p2){ return null; }
|
||||
static <E> ImmutableSortedMultiset<E> emptyMultiset(Comparator<? super E> p0){ return null; }
|
||||
static public class Builder<E> extends ImmutableMultiset.Builder<E>
|
||||
{
|
||||
protected Builder() {}
|
||||
|
||||
@@ -10,7 +10,6 @@ import java.util.stream.Collector;
|
||||
|
||||
abstract class ImmutableSortedMultisetFauxverideShim<E> extends ImmutableMultiset<E>
|
||||
{
|
||||
ImmutableSortedMultisetFauxverideShim(){}
|
||||
public static <E> Collector<E, ? extends Object, ImmutableMultiset<E>> toImmutableMultiset(){ return null; }
|
||||
public static <E> ImmutableSortedMultiset.Builder<E> builder(){ return null; }
|
||||
public static <E> ImmutableSortedMultiset<E> copyOf(E[] p0){ return null; }
|
||||
|
||||
@@ -4,7 +4,6 @@ package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.ImmutableSet;
|
||||
import com.google.common.collect.ImmutableSortedSetFauxverideShim;
|
||||
import com.google.common.collect.RegularImmutableSortedSet;
|
||||
import com.google.common.collect.SortedIterable;
|
||||
import com.google.common.collect.UnmodifiableIterator;
|
||||
import java.util.Collection;
|
||||
@@ -18,16 +17,6 @@ import java.util.stream.Collector;
|
||||
abstract public class ImmutableSortedSet<E> extends ImmutableSortedSetFauxverideShim<E> implements NavigableSet<E>, SortedIterable<E>
|
||||
{
|
||||
protected ImmutableSortedSet() {}
|
||||
ImmutableSortedSet(Comparator<? super E> p0){}
|
||||
ImmutableSortedSet<E> descendingSet = null;
|
||||
Object writeReplace(){ return null; }
|
||||
abstract ImmutableSortedSet<E> createDescendingSet();
|
||||
abstract ImmutableSortedSet<E> headSetImpl(E p0, boolean p1);
|
||||
abstract ImmutableSortedSet<E> subSetImpl(E p0, boolean p1, E p2, boolean p3);
|
||||
abstract ImmutableSortedSet<E> tailSetImpl(E p0, boolean p1);
|
||||
abstract int indexOf(Object p0);
|
||||
final Comparator<? super E> comparator = null;
|
||||
int unsafeCompare(Object p0, Object p1){ return 0; }
|
||||
public Comparator<? super E> comparator(){ return null; }
|
||||
public E ceiling(E p0){ return null; }
|
||||
public E first(){ return null; }
|
||||
@@ -66,20 +55,14 @@ abstract public class ImmutableSortedSet<E> extends ImmutableSortedSetFauxveride
|
||||
public static <E> ImmutableSortedSet<E> copyOf(Iterator<? extends E> p0){ return null; }
|
||||
public static <E> ImmutableSortedSet<E> copyOfSorted(SortedSet<E> p0){ return null; }
|
||||
public static <E> ImmutableSortedSet<E> of(){ return null; }
|
||||
static <E> ImmutableSortedSet<E> construct(Comparator<? super E> p0, int p1, E... p2){ return null; }
|
||||
static <E> RegularImmutableSortedSet<E> emptySet(Comparator<? super E> p0){ return null; }
|
||||
static int SPLITERATOR_CHARACTERISTICS = 0;
|
||||
static int unsafeCompare(Comparator<? extends Object> p0, Object p1, Object p2){ return 0; }
|
||||
static public class Builder<E> extends ImmutableSet.Builder<E>
|
||||
{
|
||||
protected Builder() {}
|
||||
ImmutableSortedSet.Builder<E> combine(ImmutableSet.Builder<E> p0){ return null; }
|
||||
public Builder(Comparator<? super E> p0){}
|
||||
public ImmutableSortedSet.Builder<E> add(E p0){ return null; }
|
||||
public ImmutableSortedSet.Builder<E> add(E... p0){ return null; }
|
||||
public ImmutableSortedSet.Builder<E> addAll(Iterable<? extends E> p0){ return null; }
|
||||
public ImmutableSortedSet.Builder<E> addAll(Iterator<? extends E> p0){ return null; }
|
||||
public ImmutableSortedSet<E> build(){ return null; }
|
||||
void copy(){}
|
||||
}
|
||||
}
|
||||
|
||||
@@ -8,7 +8,6 @@ import java.util.stream.Collector;
|
||||
|
||||
abstract class ImmutableSortedSetFauxverideShim<E> extends ImmutableSet<E>
|
||||
{
|
||||
ImmutableSortedSetFauxverideShim(){}
|
||||
public static <E> Collector<E, ? extends Object, ImmutableSet<E>> toImmutableSet(){ return null; }
|
||||
public static <E> ImmutableSortedSet.Builder<E> builder(){ return null; }
|
||||
public static <E> ImmutableSortedSet.Builder<E> builderWithExpectedSize(int p0){ return null; }
|
||||
|
||||
@@ -7,26 +7,15 @@ import com.google.common.collect.ImmutableCollection;
|
||||
import com.google.common.collect.ImmutableMap;
|
||||
import com.google.common.collect.ImmutableSet;
|
||||
import com.google.common.collect.Table;
|
||||
import com.google.common.collect.UnmodifiableIterator;
|
||||
import java.io.Serializable;
|
||||
import java.util.Comparator;
|
||||
import java.util.Iterator;
|
||||
import java.util.Map;
|
||||
import java.util.Spliterator;
|
||||
import java.util.function.BinaryOperator;
|
||||
import java.util.function.Function;
|
||||
import java.util.stream.Collector;
|
||||
|
||||
abstract public class ImmutableTable<R, C, V> extends AbstractTable<R, C, V> implements Serializable
|
||||
{
|
||||
ImmutableTable(){}
|
||||
abstract ImmutableCollection<V> createValues();
|
||||
abstract ImmutableSet<Table.Cell<R, C, V>> createCellSet();
|
||||
abstract ImmutableTable.SerializedForm createSerializedForm();
|
||||
final Iterator<V> valuesIterator(){ return null; }
|
||||
final Object writeReplace(){ return null; }
|
||||
final Spliterator<Table.Cell<R, C, V>> cellSpliterator(){ return null; }
|
||||
final UnmodifiableIterator<Table.Cell<R, C, V>> cellIterator(){ return null; }
|
||||
public ImmutableCollection<V> values(){ return null; }
|
||||
public ImmutableMap<C, V> row(R p0){ return null; }
|
||||
public ImmutableMap<R, V> column(C p0){ return null; }
|
||||
@@ -47,17 +36,8 @@ abstract public class ImmutableTable<R, C, V> extends AbstractTable<R, C, V> imp
|
||||
public static <R, C, V> ImmutableTable<R, C, V> of(R p0, C p1, V p2){ return null; }
|
||||
public static <T, R, C, V> Collector<T, ? extends Object, ImmutableTable<R, C, V>> toImmutableTable(Function<? super T, ? extends R> p0, Function<? super T, ? extends C> p1, Function<? super T, ? extends V> p2){ return null; }
|
||||
public static <T, R, C, V> Collector<T, ? extends Object, ImmutableTable<R, C, V>> toImmutableTable(Function<? super T, ? extends R> p0, Function<? super T, ? extends C> p1, Function<? super T, ? extends V> p2, BinaryOperator<V> p3){ return null; }
|
||||
static <R, C, V> ImmutableTable<R, C, V> copyOf(Iterable<? extends Table.Cell<? extends R, ? extends C, ? extends V>> p0){ return null; }
|
||||
static <R, C, V> Table.Cell<R, C, V> cellOf(R p0, C p1, V p2){ return null; }
|
||||
static class SerializedForm implements Serializable
|
||||
{
|
||||
protected SerializedForm() {}
|
||||
Object readResolve(){ return null; }
|
||||
static ImmutableTable.SerializedForm create(ImmutableTable<? extends Object, ? extends Object, ? extends Object> p0, int[] p1, int[] p2){ return null; }
|
||||
}
|
||||
static public class Builder<R, C, V>
|
||||
{
|
||||
ImmutableTable.Builder<R, C, V> combine(ImmutableTable.Builder<R, C, V> p0){ return null; }
|
||||
public Builder(){}
|
||||
public ImmutableTable.Builder<R, C, V> orderColumnsBy(Comparator<? super C> p0){ return null; }
|
||||
public ImmutableTable.Builder<R, C, V> orderRowsBy(Comparator<? super R> p0){ return null; }
|
||||
|
||||
@@ -8,7 +8,6 @@ import com.google.common.base.Predicate;
|
||||
import com.google.common.collect.ImmutableCollection;
|
||||
import java.util.Collection;
|
||||
import java.util.Comparator;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
|
||||
public class Iterables
|
||||
@@ -56,8 +55,4 @@ public class Iterables
|
||||
public static boolean retainAll(Iterable<? extends Object> p0, Collection<? extends Object> p1){ return false; }
|
||||
public static int frequency(Iterable<? extends Object> p0, Object p1){ return 0; }
|
||||
public static int size(Iterable<? extends Object> p0){ return 0; }
|
||||
static <T> Function<Iterable<? extends T>, Iterator<? extends T>> toIterator(){ return null; }
|
||||
static <T> T removeFirstMatching(Iterable<T> p0, Predicate<? super T> p1){ return null; }
|
||||
static <T> T[] toArray(Iterable<? extends T> p0, T[] p1){ return null; }
|
||||
static Object[] toArray(Iterable<? extends Object> p0){ return null; }
|
||||
}
|
||||
|
||||
@@ -7,13 +7,11 @@ import com.google.common.base.Optional;
|
||||
import com.google.common.base.Predicate;
|
||||
import com.google.common.collect.PeekingIterator;
|
||||
import com.google.common.collect.UnmodifiableIterator;
|
||||
import com.google.common.collect.UnmodifiableListIterator;
|
||||
import java.util.Collection;
|
||||
import java.util.Comparator;
|
||||
import java.util.Enumeration;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
import java.util.ListIterator;
|
||||
|
||||
public class Iterators
|
||||
{
|
||||
@@ -65,13 +63,4 @@ public class Iterators
|
||||
public static int advance(Iterator<? extends Object> p0, int p1){ return 0; }
|
||||
public static int frequency(Iterator<? extends Object> p0, Object p1){ return 0; }
|
||||
public static int size(Iterator<? extends Object> p0){ return 0; }
|
||||
static <T> Iterator<T> concatNoDefensiveCopy(Iterator<? extends T>... p0){ return null; }
|
||||
static <T> Iterator<T> emptyModifiableIterator(){ return null; }
|
||||
static <T> ListIterator<T> cast(Iterator<T> p0){ return null; }
|
||||
static <T> T pollNext(Iterator<T> p0){ return null; }
|
||||
static <T> UnmodifiableIterator<T> emptyIterator(){ return null; }
|
||||
static <T> UnmodifiableListIterator<T> emptyListIterator(){ return null; }
|
||||
static <T> UnmodifiableListIterator<T> forArray(T[] p0, int p1, int p2, int p3){ return null; }
|
||||
static void checkNonnegative(int p0){}
|
||||
static void clear(Iterator<? extends Object> p0){}
|
||||
}
|
||||
|
||||
@@ -5,21 +5,12 @@ package com.google.common.collect;
|
||||
import com.google.common.collect.LinkedHashMultimapGwtSerializationDependencies;
|
||||
import com.google.common.collect.Multimap;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import java.util.Spliterator;
|
||||
|
||||
public class LinkedHashMultimap<K, V> extends LinkedHashMultimapGwtSerializationDependencies<K, V>
|
||||
{
|
||||
protected LinkedHashMultimap() {}
|
||||
Collection<V> createCollection(K p0){ return null; }
|
||||
Iterator<Map.Entry<K, V>> entryIterator(){ return null; }
|
||||
Iterator<V> valueIterator(){ return null; }
|
||||
Set<V> createCollection(){ return null; }
|
||||
Spliterator<Map.Entry<K, V>> entrySpliterator(){ return null; }
|
||||
Spliterator<V> valueSpliterator(){ return null; }
|
||||
int valueSetCapacity = 0;
|
||||
public Collection<V> values(){ return null; }
|
||||
public Set<K> keySet(){ return null; }
|
||||
public Set<Map.Entry<K, V>> entries(){ return null; }
|
||||
@@ -28,5 +19,4 @@ public class LinkedHashMultimap<K, V> extends LinkedHashMultimapGwtSerialization
|
||||
public static <K, V> LinkedHashMultimap<K, V> create(Multimap<? extends K, ? extends V> p0){ return null; }
|
||||
public static <K, V> LinkedHashMultimap<K, V> create(int p0, int p1){ return null; }
|
||||
public void clear(){}
|
||||
static double VALUE_SET_LOAD_FACTOR = 0;
|
||||
}
|
||||
|
||||
@@ -3,11 +3,8 @@
|
||||
package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.AbstractSetMultimap;
|
||||
import java.util.Collection;
|
||||
import java.util.Map;
|
||||
|
||||
abstract class LinkedHashMultimapGwtSerializationDependencies<K, V> extends AbstractSetMultimap<K, V>
|
||||
{
|
||||
protected LinkedHashMultimapGwtSerializationDependencies() {}
|
||||
LinkedHashMultimapGwtSerializationDependencies(Map<K, Collection<V>> p0){}
|
||||
}
|
||||
|
||||
@@ -5,23 +5,12 @@ package com.google.common.collect;
|
||||
import com.google.common.collect.AbstractMultimap;
|
||||
import com.google.common.collect.ListMultimap;
|
||||
import com.google.common.collect.Multimap;
|
||||
import com.google.common.collect.Multiset;
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
|
||||
public class LinkedListMultimap<K, V> extends AbstractMultimap<K, V> implements ListMultimap<K, V>, Serializable
|
||||
{
|
||||
Iterator<Map.Entry<K, V>> entryIterator(){ return null; }
|
||||
LinkedListMultimap(){}
|
||||
List<Map.Entry<K, V>> createEntries(){ return null; }
|
||||
List<V> createValues(){ return null; }
|
||||
Map<K, Collection<V>> createAsMap(){ return null; }
|
||||
Multiset<K> createKeys(){ return null; }
|
||||
Set<K> createKeySet(){ return null; }
|
||||
public List<Map.Entry<K, V>> entries(){ return null; }
|
||||
public List<V> get(K p0){ return null; }
|
||||
public List<V> removeAll(Object p0){ return null; }
|
||||
|
||||
@@ -8,7 +8,6 @@ import java.util.ArrayList;
|
||||
import java.util.Iterator;
|
||||
import java.util.LinkedList;
|
||||
import java.util.List;
|
||||
import java.util.ListIterator;
|
||||
import java.util.concurrent.CopyOnWriteArrayList;
|
||||
|
||||
public class Lists
|
||||
@@ -33,13 +32,4 @@ public class Lists
|
||||
public static <T> List<T> reverse(List<T> p0){ return null; }
|
||||
public static ImmutableList<Character> charactersOf(String p0){ return null; }
|
||||
public static List<Character> charactersOf(CharSequence p0){ return null; }
|
||||
static <E> List<E> subListImpl(List<E> p0, int p1, int p2){ return null; }
|
||||
static <E> ListIterator<E> listIteratorImpl(List<E> p0, int p1){ return null; }
|
||||
static <E> boolean addAllImpl(List<E> p0, int p1, Iterable<? extends E> p2){ return false; }
|
||||
static <T> List<T> cast(Iterable<T> p0){ return null; }
|
||||
static boolean equalsImpl(List<? extends Object> p0, Object p1){ return false; }
|
||||
static int computeArrayListCapacity(int p0){ return 0; }
|
||||
static int hashCodeImpl(List<? extends Object> p0){ return 0; }
|
||||
static int indexOfImpl(List<? extends Object> p0, Object p1){ return 0; }
|
||||
static int lastIndexOfImpl(List<? extends Object> p0, Object p1){ return 0; }
|
||||
}
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
// Generated automatically from com.google.common.collect.Multimaps for testing purposes, and manually adjusted.
|
||||
// Generated automatically from com.google.common.collect.Maps for testing purposes, and adjusted manually
|
||||
|
||||
package com.google.common.collect;
|
||||
|
||||
@@ -11,9 +11,7 @@ import com.google.common.collect.ImmutableMap;
|
||||
import com.google.common.collect.MapDifference;
|
||||
import com.google.common.collect.Range;
|
||||
import com.google.common.collect.SortedMapDifference;
|
||||
import com.google.common.collect.UnmodifiableIterator;
|
||||
import java.util.AbstractMap;
|
||||
import java.util.Collection;
|
||||
import java.util.Comparator;
|
||||
import java.util.EnumMap;
|
||||
import java.util.HashMap;
|
||||
@@ -27,25 +25,17 @@ import java.util.Properties;
|
||||
import java.util.Set;
|
||||
import java.util.SortedMap;
|
||||
import java.util.SortedSet;
|
||||
import java.util.Spliterator;
|
||||
import java.util.TreeMap;
|
||||
import java.util.concurrent.ConcurrentMap;
|
||||
import java.util.function.BinaryOperator;
|
||||
import java.util.function.Consumer;
|
||||
import java.util.stream.Collector;
|
||||
|
||||
public class Maps
|
||||
{
|
||||
protected Maps() {}
|
||||
abstract static class IteratorBasedAbstractMap<K, V> extends AbstractMap<K, V>
|
||||
{
|
||||
IteratorBasedAbstractMap(){}
|
||||
Spliterator<Map.Entry<K, V>> entrySpliterator(){ return null; }
|
||||
abstract Iterator<Map.Entry<K, V>> entryIterator();
|
||||
abstract static class IteratorBasedAbstractMap<K, V> extends AbstractMap<K, V> {
|
||||
public Set<Map.Entry<K, V>> entrySet(){ return null; }
|
||||
public abstract int size();
|
||||
public void clear(){}
|
||||
void forEachEntry(Consumer<? super Map.Entry<K, V>> p0){}
|
||||
}
|
||||
public static <A, B> Converter<A, B> asConverter(BiMap<A, B> p0){ return null; }
|
||||
public static <C, K extends C, V> TreeMap<K, V> newTreeMap(Comparator<C> p0){ return null; }
|
||||
@@ -99,36 +89,6 @@ public class Maps
|
||||
public static <T, K extends Enum<K>, V> Collector<T, ? extends Object, ImmutableMap<K, V>> toImmutableEnumMap(Function<? super T, ? extends K> p0, Function<? super T, ? extends V> p1){ return null; }
|
||||
public static <T, K extends Enum<K>, V> Collector<T, ? extends Object, ImmutableMap<K, V>> toImmutableEnumMap(Function<? super T, ? extends K> p0, Function<? super T, ? extends V> p1, BinaryOperator<V> p2){ return null; }
|
||||
public static ImmutableMap<String, String> fromProperties(Properties p0){ return null; }
|
||||
static <E> Comparator<? super E> orNaturalOrder(Comparator<? super E> p0){ return null; }
|
||||
static <E> ImmutableMap<E, Integer> indexMap(Collection<E> p0){ return null; }
|
||||
static <K, V1, V2> Function<Map.Entry<K, V1>, Map.Entry<K, V2>> asEntryToEntryFunction(Maps.EntryTransformer<? super K, ? super V1, V2> p0){ return null; }
|
||||
static <K, V1, V2> Function<Map.Entry<K, V1>, V2> asEntryToValueFunction(Maps.EntryTransformer<? super K, ? super V1, V2> p0){ return null; }
|
||||
static <K, V1, V2> Function<V1, V2> asValueToValueFunction(Maps.EntryTransformer<? super K, V1, V2> p0, K p1){ return null; }
|
||||
static <K, V1, V2> Maps.EntryTransformer<K, V1, V2> asEntryTransformer(Function<? super V1, V2> p0){ return null; }
|
||||
static <K, V> Iterator<K> keyIterator(Iterator<Map.Entry<K, V>> p0){ return null; }
|
||||
static <K, V> Iterator<Map.Entry<K, V>> asMapEntryIterator(Set<K> p0, Function<? super K, V> p1){ return null; }
|
||||
static <K, V> Iterator<V> valueIterator(Iterator<Map.Entry<K, V>> p0){ return null; }
|
||||
static <K, V> Map.Entry<K, V> unmodifiableEntry(Map.Entry<? extends K, ? extends V> p0){ return null; }
|
||||
static <K, V> Set<Map.Entry<K, V>> unmodifiableEntrySet(Set<Map.Entry<K, V>> p0){ return null; }
|
||||
static <K, V> UnmodifiableIterator<Map.Entry<K, V>> unmodifiableEntryIterator(Iterator<Map.Entry<K, V>> p0){ return null; }
|
||||
static <K, V> boolean containsEntryImpl(Collection<Map.Entry<K, V>> p0, Object p1){ return false; }
|
||||
static <K, V> boolean removeEntryImpl(Collection<Map.Entry<K, V>> p0, Object p1){ return false; }
|
||||
static <K, V> void putAllImpl(Map<K, V> p0, Map<? extends K, ? extends V> p1){}
|
||||
static <K> Function<Map.Entry<K, ? extends Object>, K> keyFunction(){ return null; }
|
||||
static <K> K keyOrNull(Map.Entry<K, ? extends Object> p0){ return null; }
|
||||
static <K> Predicate<Map.Entry<K, ? extends Object>> keyPredicateOnEntries(Predicate<? super K> p0){ return null; }
|
||||
static <V2, K, V1> Map.Entry<K, V2> transformEntry(Maps.EntryTransformer<? super K, ? super V1, V2> p0, Map.Entry<K, V1> p1){ return null; }
|
||||
static <V> Function<Map.Entry<? extends Object, V>, V> valueFunction(){ return null; }
|
||||
static <V> Predicate<Map.Entry<? extends Object, V>> valuePredicateOnEntries(Predicate<? super V> p0){ return null; }
|
||||
static <V> V safeGet(Map<? extends Object, V> p0, Object p1){ return null; }
|
||||
static <V> V safeRemove(Map<? extends Object, V> p0, Object p1){ return null; }
|
||||
static <V> V valueOrNull(Map.Entry<? extends Object, V> p0){ return null; }
|
||||
static String toStringImpl(Map<? extends Object, ? extends Object> p0){ return null; }
|
||||
static boolean containsKeyImpl(Map<? extends Object, ? extends Object> p0, Object p1){ return false; }
|
||||
static boolean containsValueImpl(Map<? extends Object, ? extends Object> p0, Object p1){ return false; }
|
||||
static boolean equalsImpl(Map<? extends Object, ? extends Object> p0, Object p1){ return false; }
|
||||
static boolean safeContainsKey(Map<? extends Object, ? extends Object> p0, Object p1){ return false; }
|
||||
static int capacity(int p0){ return 0; }
|
||||
static public interface EntryTransformer<K, V1, V2>
|
||||
{
|
||||
V2 transformEntry(K p0, V1 p1);
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
// Generated automatically from com.google.common.collect.Multimaps for testing purposes, and manually adjusted.
|
||||
// Generated automatically from com.google.common.collect.Multimaps for testing purposes, and adjusted manually
|
||||
|
||||
package com.google.common.collect;
|
||||
|
||||
@@ -61,5 +61,4 @@ public class Multimaps
|
||||
public static <K, V> SortedSetMultimap<K, V> unmodifiableSortedSetMultimap(SortedSetMultimap<K, V> p0){ return null; }
|
||||
public static <T, K, V, M extends Multimap<K, V>> Collector<T, ? extends Object, M> flatteningToMultimap(Function<? super T, ? extends K> p0, Function<? super T, ? extends Stream<? extends V>> p1, Supplier<M> p2){ return null; }
|
||||
public static <T, K, V, M extends Multimap<K, V>> Collector<T, ? extends Object, M> toMultimap(Function<? super T, ? extends K> p0, Function<? super T, ? extends V> p1, Supplier<M> p2){ return null; }
|
||||
static boolean equalsImpl(Multimap<? extends Object, ? extends Object> p0, Object p1){ return false; }
|
||||
}
|
||||
|
||||
@@ -6,9 +6,6 @@ import com.google.common.base.Predicate;
|
||||
import com.google.common.collect.ImmutableMultiset;
|
||||
import com.google.common.collect.Multiset;
|
||||
import com.google.common.collect.SortedMultiset;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.Spliterator;
|
||||
import java.util.function.Function;
|
||||
import java.util.function.Supplier;
|
||||
import java.util.function.ToIntFunction;
|
||||
@@ -32,16 +29,4 @@ public class Multisets
|
||||
public static boolean removeOccurrences(Multiset<? extends Object> p0, Iterable<? extends Object> p1){ return false; }
|
||||
public static boolean removeOccurrences(Multiset<? extends Object> p0, Multiset<? extends Object> p1){ return false; }
|
||||
public static boolean retainOccurrences(Multiset<? extends Object> p0, Multiset<? extends Object> p1){ return false; }
|
||||
static <E> Iterator<E> elementIterator(Iterator<Multiset.Entry<E>> p0){ return null; }
|
||||
static <E> Iterator<E> iteratorImpl(Multiset<E> p0){ return null; }
|
||||
static <E> Spliterator<E> spliteratorImpl(Multiset<E> p0){ return null; }
|
||||
static <E> boolean addAllImpl(Multiset<E> p0, Collection<? extends E> p1){ return false; }
|
||||
static <E> boolean setCountImpl(Multiset<E> p0, E p1, int p2, int p3){ return false; }
|
||||
static <E> int setCountImpl(Multiset<E> p0, E p1, int p2){ return 0; }
|
||||
static <T> Multiset<T> cast(Iterable<T> p0){ return null; }
|
||||
static boolean equalsImpl(Multiset<? extends Object> p0, Object p1){ return false; }
|
||||
static boolean removeAllImpl(Multiset<? extends Object> p0, Collection<? extends Object> p1){ return false; }
|
||||
static boolean retainAllImpl(Multiset<? extends Object> p0, Collection<? extends Object> p1){ return false; }
|
||||
static int inferDistinctElements(Iterable<? extends Object> p0){ return 0; }
|
||||
static int linearTimeSizeImpl(Multiset<? extends Object> p0){ return 0; }
|
||||
}
|
||||
|
||||
@@ -2,7 +2,6 @@
|
||||
|
||||
package com.google.common.collect;
|
||||
|
||||
import java.util.Collection;
|
||||
|
||||
public class ObjectArrays
|
||||
{
|
||||
@@ -12,12 +11,4 @@ public class ObjectArrays
|
||||
public static <T> T[] concat(T[] p0, T[] p1, Class<T> p2){ return null; }
|
||||
public static <T> T[] newArray(Class<T> p0, int p1){ return null; }
|
||||
public static <T> T[] newArray(T[] p0, int p1){ return null; }
|
||||
static <T> T[] toArrayImpl(Collection<? extends Object> p0, T[] p1){ return null; }
|
||||
static <T> T[] toArrayImpl(Object[] p0, int p1, int p2, T[] p3){ return null; }
|
||||
static Object checkElementNotNull(Object p0, int p1){ return null; }
|
||||
static Object[] checkElementsNotNull(Object... p0){ return null; }
|
||||
static Object[] checkElementsNotNull(Object[] p0, int p1){ return null; }
|
||||
static Object[] copyAsObjectArray(Object[] p0, int p1, int p2){ return null; }
|
||||
static Object[] toArrayImpl(Collection<? extends Object> p0){ return null; }
|
||||
static void swap(Object[] p0, int p1, int p2){}
|
||||
}
|
||||
|
||||
@@ -2,21 +2,15 @@
|
||||
|
||||
package com.google.common.collect;
|
||||
|
||||
import com.google.common.base.Function;
|
||||
import com.google.common.base.Predicate;
|
||||
import com.google.common.collect.BoundType;
|
||||
import com.google.common.collect.Cut;
|
||||
import com.google.common.collect.DiscreteDomain;
|
||||
import com.google.common.collect.Ordering;
|
||||
import com.google.common.collect.RangeGwtSerializationDependencies;
|
||||
import java.io.Serializable;
|
||||
|
||||
public class Range<C extends Comparable> extends RangeGwtSerializationDependencies implements Predicate<C>, Serializable
|
||||
{
|
||||
protected Range() {}
|
||||
Object readResolve(){ return null; }
|
||||
final Cut<C> lowerBound = null;
|
||||
final Cut<C> upperBound = null;
|
||||
public BoundType lowerBoundType(){ return null; }
|
||||
public BoundType upperBoundType(){ return null; }
|
||||
public C lowerEndpoint(){ return null; }
|
||||
@@ -50,9 +44,4 @@ public class Range<C extends Comparable> extends RangeGwtSerializationDependenci
|
||||
public static <C extends Comparable<? extends Object>> Range<C> range(C p0, BoundType p1, C p2, BoundType p3){ return null; }
|
||||
public static <C extends Comparable<? extends Object>> Range<C> singleton(C p0){ return null; }
|
||||
public static <C extends Comparable<? extends Object>> Range<C> upTo(C p0, BoundType p1){ return null; }
|
||||
static <C extends Comparable<? extends Object>> Function<Range<C>, Cut<C>> lowerBoundFn(){ return null; }
|
||||
static <C extends Comparable<? extends Object>> Function<Range<C>, Cut<C>> upperBoundFn(){ return null; }
|
||||
static <C extends Comparable<? extends Object>> Ordering<Range<C>> rangeLexOrdering(){ return null; }
|
||||
static <C extends Comparable<? extends Object>> Range<C> create(Cut<C> p0, Cut<C> p1){ return null; }
|
||||
static int compareOrThrow(Comparable p0, Comparable p1){ return 0; }
|
||||
}
|
||||
|
||||
@@ -6,5 +6,4 @@ import java.io.Serializable;
|
||||
|
||||
abstract class RangeGwtSerializationDependencies<C extends Comparable> implements Serializable
|
||||
{
|
||||
RangeGwtSerializationDependencies(){}
|
||||
}
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
// Generated automatically from com.google.common.collect.Sets for testing purposes, and manually adjusted.
|
||||
// Generated automatically from com.google.common.collect.Sets for testing purposes, and adjusted manually
|
||||
|
||||
package com.google.common.collect;
|
||||
|
||||
@@ -76,8 +76,4 @@ public class Sets
|
||||
public static <E> SortedSet<E> filter(SortedSet<E> p0, Predicate<? super E> p1){ return null; }
|
||||
public static <E> TreeSet<E> newTreeSet(Comparator<? super E> p0){ return null; }
|
||||
public static <K extends Comparable<? super K>> NavigableSet<K> subSet(NavigableSet<K> p0, Range<K> p1){ return null; }
|
||||
static boolean equalsImpl(Set<? extends Object> p0, Object p1){ return false; }
|
||||
static boolean removeAllImpl(Set<? extends Object> p0, Collection<? extends Object> p1){ return false; }
|
||||
static boolean removeAllImpl(Set<? extends Object> p0, Iterator<? extends Object> p1){ return false; }
|
||||
static int hashCodeImpl(Set<? extends Object> p0){ return 0; }
|
||||
}
|
||||
|
||||
@@ -2,7 +2,6 @@
|
||||
|
||||
package com.google.common.collect;
|
||||
|
||||
import com.google.common.base.Supplier;
|
||||
import com.google.common.collect.RowSortedTable;
|
||||
import com.google.common.collect.StandardTable;
|
||||
import java.util.Map;
|
||||
@@ -12,8 +11,6 @@ import java.util.SortedSet;
|
||||
class StandardRowSortedTable<R, C, V> extends StandardTable<R, C, V> implements RowSortedTable<R, C, V>
|
||||
{
|
||||
protected StandardRowSortedTable() {}
|
||||
SortedMap<R, Map<C, V>> createRowMap(){ return null; }
|
||||
StandardRowSortedTable(SortedMap<R, Map<C, V>> p0, Supplier<? extends Map<C, V>> p1){}
|
||||
public SortedMap<R, Map<C, V>> rowMap(){ return null; }
|
||||
public SortedSet<R> rowKeySet(){ return null; }
|
||||
}
|
||||
|
||||
@@ -2,26 +2,16 @@
|
||||
|
||||
package com.google.common.collect;
|
||||
|
||||
import com.google.common.base.Supplier;
|
||||
import com.google.common.collect.AbstractTable;
|
||||
import com.google.common.collect.Table;
|
||||
import java.io.Serializable;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import java.util.Spliterator;
|
||||
|
||||
class StandardTable<R, C, V> extends AbstractTable<R, C, V> implements Serializable
|
||||
{
|
||||
protected StandardTable() {}
|
||||
Iterator<C> createColumnKeyIterator(){ return null; }
|
||||
Iterator<Table.Cell<R, C, V>> cellIterator(){ return null; }
|
||||
Map<R, Map<C, V>> createRowMap(){ return null; }
|
||||
Spliterator<Table.Cell<R, C, V>> cellSpliterator(){ return null; }
|
||||
StandardTable(Map<R, Map<C, V>> p0, Supplier<? extends Map<C, V>> p1){}
|
||||
final Map<R, Map<C, V>> backingMap = null;
|
||||
final Supplier<? extends Map<C, V>> factory = null;
|
||||
public Collection<V> values(){ return null; }
|
||||
public Map<C, Map<R, V>> columnMap(){ return null; }
|
||||
public Map<C, V> row(R p0){ return null; }
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
// Generated automatically from com.google.common.collect.Tables for testing purposes, and manually adjusted.
|
||||
// Generated automatically from com.google.common.collect.Tables for testing purposes, and adjusted manually
|
||||
|
||||
package com.google.common.collect;
|
||||
|
||||
@@ -22,5 +22,4 @@ public class Tables
|
||||
public static <R, C, V> Table<R, C, V> unmodifiableTable(Table<? extends R, ? extends C, ? extends V> p0){ return null; }
|
||||
public static <T, R, C, V, I extends Table<R, C, V>> Collector<T, ? extends Object, I> toTable(Function<? super T, ? extends R> p0, Function<? super T, ? extends C> p1, Function<? super T, ? extends V> p2, BinaryOperator<V> p3, Supplier<I> p4){ return null; }
|
||||
public static <T, R, C, V, I extends Table<R, C, V>> Collector<T, ? extends Object, I> toTable(Function<? super T, ? extends R> p0, Function<? super T, ? extends C> p1, Function<? super T, ? extends V> p2, Supplier<I> p3){ return null; }
|
||||
static boolean equalsImpl(Table<? extends Object, ? extends Object, ? extends Object> p0, Object p1){ return false; }
|
||||
}
|
||||
|
||||
@@ -4,7 +4,6 @@ package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.StandardRowSortedTable;
|
||||
import java.util.Comparator;
|
||||
import java.util.Iterator;
|
||||
import java.util.Map;
|
||||
import java.util.SortedMap;
|
||||
import java.util.SortedSet;
|
||||
@@ -12,8 +11,6 @@ import java.util.SortedSet;
|
||||
public class TreeBasedTable<R, C, V> extends StandardRowSortedTable<R, C, V>
|
||||
{
|
||||
protected TreeBasedTable() {}
|
||||
Iterator<C> createColumnKeyIterator(){ return null; }
|
||||
TreeBasedTable(Comparator<? super R> p0, Comparator<? super C> p1){}
|
||||
public Comparator<? super C> columnComparator(){ return null; }
|
||||
public Comparator<? super R> rowComparator(){ return null; }
|
||||
public SortedMap<C, V> row(R p0){ return null; }
|
||||
|
||||
@@ -6,18 +6,12 @@ import com.google.common.collect.AbstractSortedKeySortedSetMultimap;
|
||||
import com.google.common.collect.Multimap;
|
||||
import java.util.Collection;
|
||||
import java.util.Comparator;
|
||||
import java.util.Map;
|
||||
import java.util.NavigableMap;
|
||||
import java.util.NavigableSet;
|
||||
import java.util.SortedSet;
|
||||
|
||||
public class TreeMultimap<K, V> extends AbstractSortedKeySortedSetMultimap<K, V>
|
||||
{
|
||||
protected TreeMultimap() {}
|
||||
Collection<V> createCollection(K p0){ return null; }
|
||||
Map<K, Collection<V>> createAsMap(){ return null; }
|
||||
SortedSet<V> createCollection(){ return null; }
|
||||
TreeMultimap(Comparator<? super K> p0, Comparator<? super V> p1){}
|
||||
public Comparator<? super K> keyComparator(){ return null; }
|
||||
public Comparator<? super V> valueComparator(){ return null; }
|
||||
public NavigableMap<K, Collection<V>> asMap(){ return null; }
|
||||
|
||||
@@ -1,11 +1,9 @@
|
||||
// Generated automatically from com.google.common.collect.TreeMultiset for testing purposes, and manually adjusted.
|
||||
// Generated automatically from com.google.common.collect.TreeMultiset for testing purposes
|
||||
|
||||
package com.google.common.collect;
|
||||
|
||||
import com.google.common.collect.AbstractSortedMultiset;
|
||||
import com.google.common.collect.BoundType;
|
||||
import com.google.common.collect.GeneralRange;
|
||||
import com.google.common.collect.Multiset;
|
||||
import com.google.common.collect.SortedMultiset;
|
||||
import java.io.Serializable;
|
||||
import java.util.Comparator;
|
||||
@@ -15,11 +13,6 @@ import java.util.function.ObjIntConsumer;
|
||||
public class TreeMultiset<E> extends AbstractSortedMultiset<E> implements Serializable
|
||||
{
|
||||
protected TreeMultiset() {}
|
||||
Iterator<E> elementIterator(){ return null; }
|
||||
Iterator<Multiset.Entry<E>> descendingEntryIterator(){ return null; }
|
||||
Iterator<Multiset.Entry<E>> entryIterator(){ return null; }
|
||||
TreeMultiset(Comparator<? super E> p0){}
|
||||
int distinctElements(){ return 0; }
|
||||
public Iterator<E> iterator(){ return null; }
|
||||
public SortedMultiset<E> headMultiset(E p0, BoundType p1){ return null; }
|
||||
public SortedMultiset<E> tailMultiset(E p0, BoundType p1){ return null; }
|
||||
|
||||
Reference in New Issue
Block a user