|
org.codehaus.gpars | |||||||
PREV NEXT | FRAMES NO FRAMES |
true
if this set contains no elements.equals
method to test for duplication.Alternative
object ˜ tray
("shake loose") * tray product
*null
if both arguments are null, and that casts
its arguments as Comparable on each comparison, throwing
ClassCastException on failure.null
if both arguments are null, and that casts
its arguments as Comparable on each comparison, throwing
ClassCastException on failure.ChannelInputEnds
ArrayList
class of java
This constructor creates an empty ArrayList
to be populated with
NetChannelInputs
ChannelOUTPUTEnds
ArrayList
class of java
This constructor creates an empty ArrayList
to be populated with
NetChannelOUTPUTs
true
if this map contains a key equivalent to
the given key with respect to this map's key Equivalence.JCSPCopy
is used to define a copy
method
that is used to make a deep copy of an object. java.util.ConcurrentMap
supporting user-defined
equivalence comparisons, soft, weak, or strong keys and values, and
user-supplied computational methods for setting and updating
values. null
if there is no mapping.null
if there is
no mapping.CountDownLatch
initialized with the given count.==
the second.equals
the second.GParsPool
. entrySet()
view, which in turn are the hash codes
computed using key and value Equivalences for this Map.==
the second.==
the second.true
if this map contains no key-value mappings. tray << product
*link producer to consumer
.==
the second.==
the second.java.util.ConcurrentMap
supporting user-defined
equivalence comparisons, soft, weak, or strong keys and values, and
user-supplied computational methods for setting and updating
values. Parallel
objectCollections.newSetFromMap
applied to a
CustomConcurrentHashMap
, but possibly more
space-efficient. op(thisElement, otherElement)
.op(thisElement, otherElement)
.op(thisElement, otherElement)
.op(thisElement, otherElement)
.op(thisElement, otherElement)
.op(thisElement, otherElement)
.asList().toString()
.link producer to consumer
.Copyright © 2008–2013 Václav Pech. All Rights Reserved.