|
|||||||||
PREV NEXT | FRAMES NO FRAMES |
true
if this map contains a mapping for the
specified key pair.
This implementation iterates over entrySet()
searching for an
entry with the specified keys.
true
if this map contains a mapping for the
specified key pair.
This implementation iterates over entrySet()
searching for an
entry with the specified keys.
This implementation uses index to check for key pair presence.
true
if this map contains a mapping for the
specified key pair.
Map<Y,V>
view of Map<Y,Entry<X,Y,Z>> map that is stored in index.
- curry1(X) -
Method in interface com.myjavatools.lib.foundation.Map2
- Currying by first argument.
- curry2(Y) -
Method in class com.myjavatools.lib.foundation.AbstractMap2
- Currying by second argument.
This implementation builds the map on every call.
- curry2(Y) -
Method in class com.myjavatools.lib.foundation.Function2
- Curries the function by the second argument.
- curry2(Y) -
Method in class com.myjavatools.lib.foundation.IndexedMap2
- Currying by second argument. Produces a map that for each X key1 returns
the same value as get(key1, key2) would return. If key2 is not present in
the set of keys, an empty map is returned.
This implementation builds the map on every call.
This implementation uses the index to return a
Map<X,V>
view of Map<Y,Entry<X,Y,Z>> map that is stored in index.
- curry2(Y) -
Method in interface com.myjavatools.lib.foundation.Map2
- Currying by second argument.
Map2.Entry
. The set is backed by the
map, so changes to the map are reflected in the set, and vice-versa.
This implementation uses HashSet for storing entries.
Map2.Entry
. The set is backed by the
map, so changes to the map are reflected in the set, and vice-versa.
This implementation uses TreeSet for storing entries.
format("{0} Monkeys", new Long(12))
returns "12 Monkeys".format("{0} is {1}", "Life", "struggle")
returns "Life is struggle".format("{0} + {1} = {2}", new Byte(2), new Byte(2), new Long(5))
returns "2 + 2 = 5".null
if the map contains no mapping for these keys.
This implementation iterates over entrySet()
searching for an
entry with the specified pair of keys.
null
if the map contains no mapping for these keys.
This implementation iterates over entrySet()
searching for an
entry with the specified pair of keys.
This implementation uses two indexes.
null
if the map contains no mapping for these keys.
UnsupportedOperationException
.
UnsupportedOperationException
.
This implementation uses and updates two indexes.
entrySet()
collection, and calls this map's put
operation once for each entry returned by the iteration.
entrySet()
searching for an
entry with the specified pair of keys.
Returns the value to which the map previously associated the keys, or
null if the map contained no mapping for this key pair.
This implementation iterates over entrySet()
searching for an
entry with the specified pair of keys.
This implementation uses index to retrieve an entry with the specified
pair of keys.
replace("Bokonon loves you", "love", "hate", true)
returns "Bokonon hates you";replace("All you need is love, love!", "me", false)
returns "All you need is me, love!".left/what
and right/what
toStrings(new Object[] { new Integer(22), new Boolean(false), "wow"})
returns new String[] {"22", "false", "wow"}.
|
|||||||||
PREV NEXT | FRAMES NO FRAMES |