public interface CharBooleanMap extends BooleanIterable
Modifier and Type | Method and Description |
---|---|
boolean |
containsKey(char key) |
boolean |
containsValue(boolean value) |
boolean |
equals(Object o)
Follows the same general contract as
Map.equals(Object) . |
void |
forEachKey(CharProcedure procedure) |
void |
forEachKeyValue(CharBooleanProcedure procedure) |
void |
forEachValue(BooleanProcedure procedure) |
boolean |
get(char key) |
boolean |
getIfAbsent(char key,
boolean ifAbsent) |
boolean |
getOrThrow(char key) |
int |
hashCode()
Follows the same general contract as
Map.hashCode() . |
MutableCharSet |
keySet() |
LazyCharIterable |
keysView() |
RichIterable<CharBooleanPair> |
keyValuesView() |
CharBooleanMap |
reject(CharBooleanPredicate predicate) |
CharBooleanMap |
select(CharBooleanPredicate predicate) |
ImmutableCharBooleanMap |
toImmutable() |
String |
toString()
Returns a string representation of this CharBooleanMap.
|
MutableBooleanCollection |
values() |
allSatisfy, anySatisfy, asLazy, booleanIterator, collect, contains, containsAll, containsAll, count, detectIfNone, forEach, injectInto, noneSatisfy, reject, select, toArray, toBag, toList, toSet
appendString, appendString, appendString, isEmpty, makeString, makeString, makeString, notEmpty, size
boolean get(char key)
boolean getIfAbsent(char key, boolean ifAbsent)
boolean getOrThrow(char key)
boolean containsKey(char key)
boolean containsValue(boolean value)
void forEachValue(BooleanProcedure procedure)
void forEachKey(CharProcedure procedure)
void forEachKeyValue(CharBooleanProcedure procedure)
LazyCharIterable keysView()
RichIterable<CharBooleanPair> keyValuesView()
CharBooleanMap select(CharBooleanPredicate predicate)
CharBooleanMap reject(CharBooleanPredicate predicate)
boolean equals(Object o)
Map.equals(Object)
.int hashCode()
Map.hashCode()
.String toString()
toString
in interface PrimitiveIterable
toString
in class Object
ImmutableCharBooleanMap toImmutable()
MutableCharSet keySet()
MutableBooleanCollection values()
Copyright © 2004–2018. All rights reserved.