Return type | Name and parameters |
---|---|
BlockingQueue
|
leftShift(Object value)
Overloads the left shift operator to provide an easy way to append objects to a BlockingQueue. |
addAll
, addAll
, addAll
, asBoolean
, asImmutable
, asSynchronized
, asType
, collect
, collect
, collect
, collectNested
, each
, eachWithIndex
, find
, find
, findAll
, findAll
, findResult
, findResult
, flatten
, getAt
, getIndices
, grep
, grep
, inject
, inject
, intersect
, isCase
, leftShift
, minus
, plus
, plus
, plus
, removeAll
, removeAll
, removeElement
, retainAll
, retainAll
, split
, toListString
, toListString
, toSet
, unique
, unique
, unique
, unique
, unique
, unique
any
, asCollection
, asList
, asType
, collate
, collate
, collate
, collate
, collectEntries
, collectEntries
, collectEntries
, collectEntries
, collectMany
, collectMany
, collectNested
, collectNested
, combinations
, combinations
, contains
, containsAll
, count
, count
, countBy
, disjoint
, drop
, dropRight
, dropWhile
, each
, eachCombination
, eachPermutation
, eachWithIndex
, every
, findResults
, first
, flatten
, flatten
, getAt
, groupBy
, groupBy
, groupBy
, head
, indexed
, indexed
, init
, intersect
, join
, last
, max
, max
, max
, min
, min
, min
, minus
, minus
, multiply
, permutations
, permutations
, plus
, plus
, size
, sort
, sort
, sort
, sort
, sort
, sum
, sum
, sum
, sum
, tail
, take
, takeRight
, takeWhile
, toList
, toSet
, toSorted
, toSorted
, toSorted
, toSpreadMap
, toUnique
, toUnique
, toUnique
, withIndex
, withIndex
Overloads the left shift operator to provide an easy way to append objects to a BlockingQueue. In case of bounded queue the method will block till space in the queue become available
def list = new java.util.concurrent.LinkedBlockingQueue () list << 3 << 2 << 1 assert list.iterator().collect{it} == [3,2,1]
value
- an Object to be added to the collection.