public interface DoubleIntMap extends IntIterable
Modifier and Type | Method and Description |
---|---|
boolean |
containsKey(double key) |
boolean |
containsValue(int value) |
boolean |
equals(Object o)
Follows the same general contract as
Map.equals(Object) . |
void |
forEachKey(DoubleProcedure procedure) |
void |
forEachKeyValue(DoubleIntProcedure procedure) |
void |
forEachValue(IntProcedure procedure) |
int |
get(double key) |
int |
getIfAbsent(double key,
int ifAbsent) |
int |
getOrThrow(double key) |
int |
hashCode()
Follows the same general contract as
Map.hashCode() . |
MutableDoubleSet |
keySet() |
LazyDoubleIterable |
keysView() |
RichIterable<DoubleIntPair> |
keyValuesView() |
DoubleIntMap |
reject(DoubleIntPredicate predicate) |
DoubleIntMap |
select(DoubleIntPredicate predicate) |
ImmutableDoubleIntMap |
toImmutable() |
String |
toString()
Returns a string representation of this DoubleIntMap.
|
MutableIntCollection |
values() |
allSatisfy, anySatisfy, asLazy, average, collect, contains, containsAll, containsAll, count, detectIfNone, forEach, injectInto, intIterator, max, maxIfEmpty, median, min, minIfEmpty, noneSatisfy, reject, select, sum, toArray, toBag, toList, toSet, toSortedArray, toSortedList
appendString, appendString, appendString, isEmpty, makeString, makeString, makeString, notEmpty, size
int get(double key)
int getIfAbsent(double key, int ifAbsent)
int getOrThrow(double key)
boolean containsKey(double key)
boolean containsValue(int value)
void forEachValue(IntProcedure procedure)
void forEachKey(DoubleProcedure procedure)
void forEachKeyValue(DoubleIntProcedure procedure)
LazyDoubleIterable keysView()
RichIterable<DoubleIntPair> keyValuesView()
DoubleIntMap select(DoubleIntPredicate predicate)
DoubleIntMap reject(DoubleIntPredicate predicate)
boolean equals(Object o)
Map.equals(Object)
.int hashCode()
Map.hashCode()
.String toString()
toString
in interface PrimitiveIterable
toString
in class Object
ImmutableDoubleIntMap toImmutable()
MutableDoubleSet keySet()
MutableIntCollection values()
Copyright © 2004–2018. All rights reserved.