Class DefaultGroovyMethods
public static String reverse(String self)
provides a
reverse()
method for String
.
NOTE: While this class contains many 'public' static methods, it is primarily regarded as an internal class (its internal package name suggests this also). We value backwards compatibility of these methods when used within Groovy but value less backwards compatibility at the Java method call level. I.e. future versions of Groovy may remove or move a method call in this file but would normally aim to keep the method available from within Groovy.
-
Field Summary
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionstatic double
Gets the absolute value.static float
Gets the absolute value.static long
Gets the absolute value.static int
Gets the absolute value.static <T> boolean
addAll
(Collection<T> self, Iterable<? extends T> items) Adds all items from the iterable to the Collection.static <T> boolean
addAll
(Collection<T> self, Iterator<? extends T> items) Adds all items from the iterator to the Collection.static <T> boolean
addAll
(Collection<T> self, T[] items) Modifies the collection by adding all the elements in the specified array to the collection.static <T> boolean
Modifies this list by inserting all the elements in the specified array into the list at the specified position.static void
addShutdownHook
(Object self, Closure closure) Allows the usage of addShutdownHook without getting the runtime first.static Boolean
Logical conjunction of two boolean operators.static Number
Bitwise AND together two Numbers.static BitSet
Bitwise AND together two BitSets.static <T> Set<T>
Creates a Set composed of the intersection of a Set and an Iterable.static <T> Set<T>
and
(Set<T> left, Iterable<T> right, Comparator<? super T> comparator) Creates a Set composed of the intersection of a Set and an Iterable.static <T> SortedSet<T>
Creates a SortedSet composed of the intersection of a SortedSet and an Iterable.static <T> SortedSet<T>
and
(SortedSet<T> left, Iterable<T> right, Comparator<? super T> comparator) Creates a SortedSet composed of the intersection of a SortedSet and an Iterable.static <T> boolean
Iterates over the contents of an iterable, and checks whether a predicate is valid for at least one element.static boolean
Iterates over the elements of a collection, and checks whether at least one element is true according to the Groovy Truth.static boolean
Iterates over the contents of an object or collection, and checks whether a predicate is valid for at least one element.static <T> boolean
Iterates over the contents of an iterator, and checks whether a predicate is valid for at least one element.static <K,
V> boolean Iterates over the entries of a map, and checks whether a predicate is valid for at least one entry.static <T> boolean
Deprecated.static boolean
asBoolean
(boolean[] self) Deprecated.static boolean
asBoolean
(byte[] self) Deprecated.static boolean
asBoolean
(char[] self) Deprecated.static boolean
asBoolean
(double[] self) Deprecated.static boolean
asBoolean
(float[] self) Deprecated.static boolean
asBoolean
(int[] self) Deprecated.static boolean
asBoolean
(long[] self) Deprecated.static boolean
asBoolean
(short[] self) Deprecated.static boolean
Coerce a Boolean instance to a boolean value.static boolean
Coerce a character to a boolean value.static boolean
Coerce a Double instance to a boolean value.static boolean
Coerce a Float instance to a boolean value.static boolean
Coerce a number to a boolean value.static boolean
Coerce an object instance to a boolean value.static boolean
Deprecated.static boolean
asBoolean
(Collection collection) Coerce a collection instance to a boolean value.static boolean
asBoolean
(AtomicBoolean bool) Coerce an AtomicBoolean instance to a boolean value.static boolean
asBoolean
(Enumeration enumeration) Coerce an enumeration instance to a boolean value.static boolean
Coerce an iterator instance to a boolean value.static boolean
Coerce a map instance to a boolean value.static <T> Collection<T>
asChecked
(Collection<T> self, Class<T> type) Creates a checked view of a Collection.static <T> List<T>
Creates a checked view of a List.static <K,
V> Map<K, V> Creates a checked view of a Map.static <K,
V> NavigableMap<K, V> asChecked
(NavigableMap<K, V> self, Class<K> keyType, Class<V> valueType) Creates a checked view of a NavigableMap.static <T> NavigableSet<T>
asChecked
(NavigableSet<T> self, Class<T> type) Creates a checked view of a NavigableSet.static <T> Queue<T>
Creates a checked view of a Queue.static <T> Set<T>
Creates a checked view of a Set.static <K,
V> SortedMap<K, V> Creates a checked view of a SortedMap.static <T> SortedSet<T>
Creates a checked view of a SortedSet.static <T> Collection<T>
asCollection
(Iterable<T> self) Converts this Iterable to a Collection.static <T> Collection<T>
asImmutable
(Collection<T> self) A convenience method for creating an immutable Collection.static <T> List<T>
asImmutable
(List<T> self) A convenience method for creating an immutable List.static <K,
V> Map<K, V> asImmutable
(Map<K, V> self) A convenience method for creating an immutable Map.static <T> Set<T>
asImmutable
(Set<T> self) A convenience method for creating an immutable Set.static <K,
V> SortedMap<K, V> asImmutable
(SortedMap<K, V> self) A convenience method for creating an immutable SortedMap.static <T> SortedSet<T>
asImmutable
(SortedSet<T> self) A convenience method for creating an immutable SortedSet.static <T> List<T>
Converts this Iterable to a List.static <T> List<T>
asReversed
(List<T> self) Creates a view list with reversed order, and the order of original list will not change.static <T> NavigableSet<T>
asReversed
(NavigableSet<T> self) Creates a reverse order view of the set.static String
Get the detail information ofThrowable
instance's stack tracestatic <T> Collection<T>
asSynchronized
(Collection<T> self) Creates a synchronized view of a Collection.static <T> List<T>
asSynchronized
(List<T> self) Creates a synchronized view of a List.static <K,
V> Map<K, V> asSynchronized
(Map<K, V> self) Creates a synchronized view of a Map.static <K,
V> NavigableMap<K, V> asSynchronized
(NavigableMap<K, V> self) Creates a synchronized view of a NavigableMap.static <T> NavigableSet<T>
asSynchronized
(NavigableSet<T> self) Creates a synchronized view of a NavigableSet.static <T> Set<T>
asSynchronized
(Set<T> self) Creates a synchronized view of a Set.static <K,
V> SortedMap<K, V> asSynchronized
(SortedMap<K, V> self) Creates a synchronized view of a SortedMap.static <T> SortedSet<T>
asSynchronized
(SortedSet<T> self) Creates a synchronized view of a SortedSet.static <T> T
Coerces the closure to an implementation of the given class.static <T> T
Converts the given iterable to another type.static <T> T
Transform this number to the given type, using the 'as' operator.static <T> T
Deprecated.static <T> T
Converts a given object to a type.static <T> T
asType
(Collection col, Class<T> clazz) Converts the given collection to another type.static <T> T
Coerces this map to the given type, using the map's keys as the public method names, and values as the implementation.static <T> Collection<T>
asUnmodifiable
(Collection<T> self) Creates an unmodifiable view of a Collection.static <T> List<T>
asUnmodifiable
(List<T> self) Creates an unmodifiable view of a List.static <K,
V> Map<K, V> asUnmodifiable
(Map<K, V> self) Creates an unmodifiable view of a Map.static <K,
V> SortedMap<K, V> asUnmodifiable
(NavigableMap<K, V> self) Creates an unmodifiable view of a NavigableMap.static <T> NavigableSet<T>
asUnmodifiable
(NavigableSet<T> self) Creates an unmodifiable view of a NavigableSet.static <T> Set<T>
asUnmodifiable
(Set<T> self) Creates an unmodifiable view of a Set.static <K,
V> SortedMap<K, V> asUnmodifiable
(SortedMap<K, V> self) Creates an unmodifiable view of a SortedMap.static <T> SortedSet<T>
asUnmodifiable
(SortedSet<T> self) Creates an unmodifiable view of a SortedSet.static BigDecimal
average
(byte[] self) Deprecated.static double
average
(double[] self) Deprecated.static double
average
(float[] self) Deprecated.static BigDecimal
average
(int[] self) Deprecated.static BigDecimal
average
(long[] self) Deprecated.static BigDecimal
average
(short[] self) Deprecated.static Object
Averages the items in an Iterable.static <T> Object
Averages the result of applying a closure to each item of an Iterable.static Object
Deprecated.static Object
Averages the items from an Iterator.static <T> Object
Averages the result of applying a closure to each item returned from an iterator.static <T> Object
Deprecated.static Number
bitwiseNegate
(Number left) Bitwise NEGATE a Number.static BitSet
bitwiseNegate
(BitSet self) Bitwise NEGATE a BitSet.static <T> BufferedIterator<T>
Returns aBufferedIterator
that allows examining the next element without consuming it.static <T> BufferedIterator<T>
bufferedIterator
(Iterable<T> self) Returns aBufferedIterator
that allows examining the next element without consuming it.static <T> BufferedIterator<T>
bufferedIterator
(List<T> self) Returns aBufferedIterator
that allows examining the next element without consuming it.protected static <T> T
callClosureForLine
(Closure<T> closure, String line, int counter) protected static <T,
K, V> T callClosureForMapEntry
(Closure<T> closure, Map.Entry<K, V> entry) protected static <T,
K, V> T callClosureForMapEntryAndCounter
(Closure<T> closure, Map.Entry<K, V> entry, int counter) Chops the Iterable into pieces, returning lists with sizes corresponding to the supplied chop sizes.Chops the iterator items into pieces, returning lists with sizes corresponding to the supplied chop sizes.chop
(T[] self, int... chopSizes) Deprecated.Collates this iterable into sub-lists of lengthsize
.Collates this iterable into sub-lists of lengthsize
.Collates this iterable into sub-lists of lengthsize
stepping through the codestep
elements for each subList.Collates this iterable into sub-lists of lengthsize
stepping through the codestep
elements for each sub-list.collate
(T[] self, int size) Deprecated.collate
(T[] self, int size, boolean keepRemainder) Deprecated.collate
(T[] self, int size, int step) Deprecated.collate
(T[] self, int size, int step, boolean keepRemainder) Deprecated.static <E,
T, C extends Collection<T>>
CDeprecated.static <E,
T> List<T> Deprecated.static <E,
T, C extends Collection<T>>
CIterates through this collection transforming each value into a new value using thetransform
closure and adding it to the suppliedcollector
.static <E,
T> List<T> Iterates through this Iterable transforming each entry into a new value using thetransform
closure returning a list of transformed values.static <T> List<T>
Iterates through this collection transforming each entry into a new value using Closure.IDENTITY as a transformer, basically returning a list of items copied from the original collection.static Collection
Iterates through this aggregate Object transforming each item into a new value using Closure.IDENTITY as a transformer, basically returning a list of items copied from the original object.static <T,
C extends Collection<T>>
CIterates through this aggregate Object transforming each item into a new value using thetransform
closure and adding it to the suppliedcollector
.static <T> List<T>
Iterates through this aggregate Object transforming each item into a new value using thetransform
closure, returning a list of transformed values.static <E,
T, C extends Collection<T>>
CIterates through this Iterator transforming each item into a new value using thetransform
closure and adding it to the suppliedcollector
.static <E,
T> List<T> Iterates through this Iterator transforming each item into a new value using thetransform
closure, returning a list of transformed values.static <T,
K, V, C extends Collection<T>>
CIterates through this Map transforming each map entry into a new value using thetransform
closure returning thecollector
with all transformed values added to it.static <T,
K, V> List<T> Iterates through this Map transforming each map entry into a new value using thetransform
closure returning a list of transformed values.static <K,
V, E> Map<K, V> collectEntries
(E[] self) Deprecated.static <K,
V, E> Map<K, V> collectEntries
(E[] self, Closure<?> transform) Deprecated.static <K,
V, E> Map<K, V> collectEntries
(E[] self, Map<K, V> collector) Deprecated.static <K,
V, E> Map<K, V> collectEntries
(E[] self, Map<K, V> collector, Closure<?> transform) Deprecated.static <K,
V> Map<K, V> collectEntries
(Iterable<?> self) A variant of collectEntries for Iterable objects using the identity closure as the transform.static <K,
V> Map<K, V> collectEntries
(Iterable<?> self, Map<K, V> collector) A variant of collectEntries for Iterables using the identity closure as the transform and a supplied map as the destination of transformed entries.static <K,
V, E> Map<K, V> collectEntries
(Iterable<E> self, Closure<?> transform) Iterates through this Iterable transforming each item using thetransform
closure and returning a map of the resulting transformed entries.static <K,
V, E> Map<K, V> collectEntries
(Iterable<E> self, Function<? super E, K> keyTransform, Function<? super E, V> valueTransform) A variant of collectEntries for Iterables with separate functions for transforming the keys and values.static <K,
V, E> Map<K, V> collectEntries
(Iterable<E> self, Map<K, V> collector, Closure<?> transform) Iterates through this Iterable transforming each item using the closure as a transformer into a map entry, returning the supplied map with all the transformed entries added to it.static <K,
V, E> Map<K, V> collectEntries
(Iterable<E> self, Map<K, V> collector, Function<? super E, K> keyTransform, Function<? super E, V> valueTransform) A variant of collectEntries for Iterables with separate functions for transforming the keys and values.static <K,
V> Map<K, V> collectEntries
(Iterator<?> self) A variant of collectEntries for Iterators using the identity closure as the transform.static <K,
V> Map<K, V> collectEntries
(Iterator<?> self, Map<K, V> collector) A variant of collectEntries for Iterators using the identity closure as the transform and a supplied map as the destination of transformed entries.static <K,
V, E> Map<K, V> collectEntries
(Iterator<E> self, Closure<?> transform) A variant of collectEntries for Iterators.static <K,
V, E> Map<K, V> collectEntries
(Iterator<E> self, Function<? super E, K> keyTransform, Function<? super E, V> valueTransform) A variant of collectEntries for Iterators with separate functions for transforming the keys and values.static <K,
V, E> Map<K, V> collectEntries
(Iterator<E> self, Map<K, V> collector, Closure<?> transform) A variant of collectEntries for Iterators using a supplied map as the destination of transformed entries.static <K,
V, E> Map<K, V> collectEntries
(Iterator<E> self, Map<K, V> collector, Function<? super E, K> keyTransform, Function<? super E, V> valueTransform) A variant of collectEntries for Iterators with separate functions for transforming the keys and values.static <K,
V, X, Y> Map<K, V> collectEntries
(Map<X, Y> self, Closure<?> transform) Iterates through this Map transforming each entry using thetransform
closure and returning a map of the transformed entries.static <K,
V, X, Y> Map<K, V> collectEntries
(Map<X, Y> self, Function<? super X, K> keyTransform, Function<? super Y, V> valueTransform) A variant of collectEntries for Maps with separate functions for transforming the keys and values.static <K,
V, X, Y> Map<K, V> collectEntries
(Map<X, Y> self, Map<K, V> collector, Closure<?> transform) Iterates through this Map transforming each map entry using thetransform
closure returning a map of the transformed entries.static <K,
V, X, Y> Map<K, V> collectEntries
(Map<X, Y> self, Map<K, V> collector, Function<? super X, K> keyTransform, Function<? super Y, V> valueTransform) A variant of collectEntries for Maps with separate functions for transforming the keys and values.static <K,
V> Map<K, V> collectKeys
(Map<K, V> keys, Function<? super K, K> keyTransform) Transform a Maps' keys leaving the values unchanged.static <K,
V> Map<K, V> collectKeys
(Map<K, V> keys, Map<K, V> collector, Function<? super K, K> keyTransform) Transform a Maps' keys leaving the values unchanged.static <T,
E, C extends Collection<T>>
CcollectMany
(E[] self, C collector, Closure<? extends Collection<? extends T>> projection) Deprecated.static <T,
E> List<T> collectMany
(E[] self, Closure<? extends Collection<? extends T>> projection) Deprecated.static <T,
E, C extends Collection<T>>
CcollectMany
(Iterable<E> self, C collector, Closure<? extends Collection<? extends T>> projection) Projects each item from a source collection to a result collection and concatenates (flattens) the resulting collections adding them into thecollector
.static <T,
E> List<T> collectMany
(Iterable<E> self, Closure<? extends Collection<? extends T>> projection) Projects each item from a source Iterable to a collection and concatenates (flattens) the resulting collections into a single list.static <T,
E, C extends Collection<T>>
CcollectMany
(Iterator<E> self, C collector, Closure<? extends Collection<? extends T>> projection) Projects each item from a source iterator to a collection and concatenates (flattens) the resulting collections into a single list.static <T,
E> List<T> collectMany
(Iterator<E> self, Closure<? extends Collection<? extends T>> projection) Projects each item from a source iterator to a collection and concatenates (flattens) the resulting collections into a single list.static <T,
K, V, C extends Collection<T>>
CcollectMany
(Map<K, V> self, C collector, Closure<? extends Collection<? extends T>> projection) Projects each item from a source map to a result collection and concatenates (flattens) the resulting collections adding them into thecollector
.static <T,
K, V> List<T> collectMany
(Map<K, V> self, Closure<? extends Collection<? extends T>> projection) Projects each item from a source map to a result collection and concatenates (flattens) the resulting collections adding them into a collection.static <T,
K, V> Collection<T> collectMany$$bridge
(Map<K, V> self, Closure<? extends Collection<? extends T>> projection) Deprecated.static <C extends Collection>
CcollectNested
(Iterable self, C collector, Closure transform) Recursively iterates through this Iterable transforming each non-Collection value into a new value using thetransform
closure.static List
collectNested
(Iterable self, Closure transform) Recursively iterates through this Iterable transforming each non-Collection value into a new value using the closure as a transformer.static List
collectNested
(Collection self, Closure transform) Recursively iterates through this collection transforming each non-Collection value into a new value using the closure as a transformer.static <K,
V> Map<K, V> collectValues
(Map<K, V> keys, Function<? super V, V> valueTransform) Transform a Maps' values leaving the keys unchanged.static <K,
V> Map<K, V> collectValues
(Map<K, V> keys, Map<K, V> collector, Function<? super V, V> valueTransform) Transform a Maps' values leaving the keys unchanged.combinations
(Iterable self) Finds all combinations of items from the given aggregate of collections.static <T> List<T>
combinations
(Iterable self, Closure<T> function) Finds all combinations of items from the given aggregate of collections, then returns the results of the supplied transform.static int
Compares two Characters.static int
Compares a Character and a Number.static int
Compares a Number and a Character.static int
Compares two Numbers.static boolean
Deprecated.static boolean
Deprecated.static boolean
Deprecated.static boolean
Deprecated.static boolean
Deprecated.static boolean
Deprecated.static boolean
Deprecated.static boolean
Deprecated.static boolean
Returns true if this iterable contains the item.static boolean
Deprecated.static boolean
containsAll
(Iterable<?> self, Object[] items) Returns true if this iterable contains all the elements in the specified array.static Number
Deprecated.static Number
Deprecated.static Number
Deprecated.static Number
Deprecated.static Number
Deprecated.static Number
Deprecated.static Number
Deprecated.static Number
Deprecated.static <T,
E extends Number>
ECounts the number of occurrences which satisfy the given closure from inside this Iterable.static <T> Number
Counts the number of occurrences which satisfy the given closure from inside this Iterable.static Number
Counts the number of occurrences of the given value inside this Iterable.static Number
Deprecated.static <T,
E extends Number>
ECounts the number of occurrences which satisfy the given closure from the items within this Iterator, adding the count to the initial count.static <T> Number
Counts the number of occurrences which satisfy the given closure from the items within this Iterator.static Number
Counts the number of occurrences of the given value from the items within this Iterator.static <K,
V, E extends Number>
ECounts the number of occurrences which satisfy the given closure from inside this map.static <K,
V> Number Counts the number of occurrences which satisfy the given closure from inside this map.static <T> Number
Deprecated.Deprecated.Creates a multiset-like map of the collection members.Sorts all collection members into groups determined by the supplied mapping closure and counts the group size.Creates a multiset-like map of the iterator members.Sorts all iterator items into groups determined by the supplied mapping closure and counts the group size.Groups the members of a map into groups determined by the supplied mapping closure and counts the frequency of the created groups.static boolean
Returnstrue
if the intersection of two iterables is empty.static Number
Divide one Character by another.static Number
Divide a Character by a Number.static Number
Divide a Number by a Character.static void
Iterates from this number down to the given number, inclusive, decrementing by one each time.static void
Iterates from this number down to the given number, inclusive, decrementing by one each time.static void
Iterates from this number down to the given number, inclusive, decrementing by one each time.static void
Iterates from this number down to the given number, inclusive, decrementing by one each time.static void
Iterates from this number down to the given number, inclusive, decrementing by one each time.static void
Iterates from this number down to the given number, inclusive, decrementing by one each time.static void
Iterates from this number down to the given number, inclusive, decrementing by one each time.static void
downto
(BigDecimal self, Number to, Closure closure) Iterates from this number down to the given number, inclusive, decrementing by one each time.static void
downto
(BigInteger self, Number to, Closure closure) Iterates from this number down to the given number, inclusive, decrementing by one each time.static <T> Collection<T>
Drops the given number of elements from the head of this Iterable.static <T> Iterator<T>
Drops the given number of elements from the head of this iterator if they are available.static <T> List<T>
Drops the given number of elements from the head of this List.static <K,
V> Map<K, V> Drops the given number of key/value pairs from the head of this map if they are available.static <T> SortedSet<T>
Drops the given number of elements from the head of this List.static <T> T[]
drop
(T[] self, int num) Deprecated.static <T> Collection<T>
Drops the given number of elements from the tail of this Iterable.static <T> Iterator<T>
Drops the given number of elements from the tail of this Iterator.static <T> List<T>
Drops the given number of elements from the tail of this List.static <T> SortedSet<T>
Drops the given number of elements from the tail of this SortedSet.static <T> T[]
dropRight
(T[] self, int num) Deprecated.static <T> Collection<T>
Returns a suffix of this Iterable where elements are dropped from the front while the given closure evaluates to true.static <T> Iterator<T>
Creates an Iterator that returns a suffix of the elements from an original Iterator.static <T> List<T>
Returns a suffix of this List where elements are dropped from the front while the given Closure evaluates to true.static <K,
V> Map<K, V> Create a suffix of the given Map by dropping as many entries as possible from the front of the original Map such that calling the given closure condition evaluates to true when passed each of the dropped entries (or key/value pairs).static <T> SortedSet<T>
Returns a suffix of this SortedSet where elements are dropped from the front while the given Closure evaluates to true.static <T> T[]
Deprecated.static String
Generates a detailed dump string of an object showing its class, hashCode and all accessible fields.static <T> Iterable<T>
Iterates through an Iterable, passing each item to the given closure.static <T> Collection<T>
each
(Collection<T> self, Closure closure) Iterates through a Collection, passing each item to the given closure.static <T> Iterator<T>
Iterates through an Iterator, passing each item to the given closure.static <T> List<T>
Iterates through a List, passing each item to the given closure.static <K,
V> Map<K, V> Allows a Map to be iterated through using a closure.static <T> Set<T>
Iterates through a Set, passing each item to the given closure.static <T> SortedSet<T>
Iterates through a SortedSet, passing each item to the given closure.static <T> T[]
Deprecated.static <T> T
Iterates through an aggregate type or data structure, passing each item to the given closure.static void
Deprecated.static void
Deprecated.static void
eachCombination
(Iterable self, Closure<?> function) Applies a function on each combination of the input lists.eachPermutation
(Iterable<T> self, Closure closure) Iterates over all permutations of a collection, running a closure for each iteration.static <T> Iterable<T>
eachWithIndex
(Iterable<T> self, Closure closure) Iterates through an iterable type, passing each item and the item's index (a counter starting at zero) to the given closure.static <T> Collection<T>
eachWithIndex
(Collection<T> self, Closure closure) Iterates through a Collection, passing each item and the item's index (a counter starting at zero) to the given closure.static <T> Iterator<T>
eachWithIndex
(Iterator<T> self, Closure closure) Iterates through an iterator type, passing each item and the item's index (a counter starting at zero) to the given closure.static <T> List<T>
eachWithIndex
(List<T> self, Closure closure) Iterates through a List, passing each item and the item's index (a counter starting at zero) to the given closure.static <K,
V> Map<K, V> eachWithIndex
(Map<K, V> self, Closure<?> closure) Allows a Map to be iterated through using a closure.static <T> Set<T>
eachWithIndex
(Set<T> self, Closure closure) Iterates through a Set, passing each item and the item's index (a counter starting at zero) to the given closure.static <T> SortedSet<T>
eachWithIndex
(SortedSet<T> self, Closure closure) Iterates through a SortedSet, passing each item and the item's index (a counter starting at zero) to the given closure.static <T> T[]
eachWithIndex
(T[] self, Closure closure) Deprecated.static <T> T
eachWithIndex
(T self, Closure closure) Iterates through an aggregate type or data structure, passing each item and the item's index (a counter starting at zero) to the given closure.static boolean
equals
(int[] left, int[] right) Deprecated.static boolean
Deprecated.static boolean
Determines if the contents of this list are equal to the contents of the given array in the same order.static boolean
Compare the contents of two Lists.static boolean
Compares two Maps treating coerced numerical values as identical.static <T> boolean
Compare the contents of two Sets for equality using Groovy's coercion rules.static boolean
equalsIgnoreZeroSign
(Double number, Object other) Compares this object against the specified object returning the same result asDouble.equals(Object)
but returning true if this object and the specified object are both zero and negative zero respectively or vice versa.static boolean
equalsIgnoreZeroSign
(Float number, Object other) Compares this object against the specified object returning the same result asFloat.equals(Object)
but returning true if this object and the specified object are both zero and negative zero respectively or vice versa.static <T> boolean
Used to determine if the given predicate closure is valid (i.e.static boolean
Iterates over every element of a collection, and checks whether all elements aretrue
according to the Groovy Truth.static boolean
Used to determine if the given predicate closure is valid (i.e.static <T> boolean
Used to determine if the given predicate closure is valid (i.e.static <K,
V> boolean Iterates over the entries of a map, and checks whether a predicate is valid for all entries.static <T> boolean
Deprecated.static Object
Finds the first item matching the IDENTITY Closure (i.e. matching Groovy truth).static Object
Finds the first value matching the closure condition.static <T> T
find
(Collection<T> self) Finds the first item matching the IDENTITY Closure (i.e. matching Groovy truth).static <T> T
find
(Collection<T> self, Closure closure) Finds the first value matching the closure condition.static <K,
V> Map.Entry<K, V> Finds the first entry matching the closure condition.static <T> T
Deprecated.static List
Finds all items matching the IDENTITY Closure (i.e. matching Groovy truth).static List
Finds all items matching the closure condition.static <T> Collection<T>
findAll
(Collection<T> self) Finds the items matching the IDENTITY Closure (i.e. matching Groovy truth).static <T> Collection<T>
findAll
(Collection<T> self, Closure closure) Finds all values matching the closure condition.static <T> List<T>
Finds the items matching the IDENTITY Closure (i.e. matching Groovy truth).static <T> List<T>
Finds all values matching the closure condition.static <K,
V> Map<K, V> Finds all entries matching the closure condition.static <T> Set<T>
Finds the items matching the IDENTITY Closure (i.e. matching Groovy truth).static <T> Set<T>
Finds all values matching the closure condition.static <T> List<T>
findAll
(T[] self) Deprecated.static <T> List<T>
Deprecated.static Collection
findAll$$bridge
(Object self) Deprecated.static Collection
findAll$$bridge
(Object self, Closure closure) Deprecated.static <T> Collection<T>
findAll$$bridge
(T[] self) Deprecated.static <T> Collection<T>
findAll$$bridge
(T[] self, Closure condition) Deprecated.static <T> int
findIndexOf
(Iterable<T> self, int startIndex, Closure condition) Iterates over the elements of an Iterable, starting from a specified startIndex, and returns the index of the first item that satisfies the condition specified by the closure.static <T> int
findIndexOf
(Iterable<T> self, Closure condition) Iterates over the elements of an Iterable and returns the index of the first item that satisfies the condition specified by the closure.static int
findIndexOf
(Object self, int startIndex, Closure condition) Iterates over the elements of an aggregate of items, starting from a specified startIndex, and returns the index of the first item that matches the condition specified in the closure.static int
findIndexOf
(Object self, Closure condition) Iterates over the elements of an aggregate of items and returns the index of the first item that matches the condition specified in the closure.static <T> int
findIndexOf
(Iterator<T> self, int startIndex, Closure condition) Iterates over the elements of an Iterator, starting from a specified startIndex, and returns the index of the first item that satisfies the condition specified by the closure.static <T> int
findIndexOf
(Iterator<T> self, Closure condition) Iterates over the elements of an Iterator and returns the index of the first item that satisfies the condition specified by the closure.static <T> int
findIndexOf
(T[] self, int startIndex, Closure condition) Deprecated.static <T> int
findIndexOf
(T[] self, Closure condition) Deprecated.findIndexValues
(Iterable<T> self, Closure condition) Iterates over the elements of an Iterable and returns the index values of the items that match the condition specified in the closure.findIndexValues
(Iterable<T> self, Number startIndex, Closure condition) Iterates over the elements of an Iterable, starting from a specified startIndex, and returns the index values of the items that match the condition specified in the closure.findIndexValues
(Object self, Closure condition) Iterates over the elements of an aggregate of items and returns the index values of the items that match the condition specified in the closure.findIndexValues
(Object self, Number startIndex, Closure condition) Iterates over the elements of an aggregate of items, starting from a specified startIndex, and returns the index values of the items that match the condition specified in the closure.findIndexValues
(Iterator<T> self, Closure condition) Iterates over the elements of an Iterator and returns the index values of the items that match the condition specified in the closure.findIndexValues
(Iterator<T> self, Number startIndex, Closure condition) Iterates over the elements of an Iterator, starting from a specified startIndex, and returns the index values of the items that match the condition specified in the closure.findIndexValues
(T[] self, Closure condition) Deprecated.findIndexValues
(T[] self, Number startIndex, Closure condition) Deprecated.static <T> int
findLastIndexOf
(Iterable<T> self, int startIndex, Closure condition) Iterates over the elements of an Iterable, starting from a specified startIndex, and returns the index of the last item that matches the condition specified in the closure.static <T> int
findLastIndexOf
(Iterable<T> self, Closure condition) Iterates over the elements of an Iterable and returns the index of the last item that matches the condition specified in the closure.static int
findLastIndexOf
(Object self, int startIndex, Closure condition) Iterates over the elements of an aggregate of items, starting from a specified startIndex, and returns the index of the last item that matches the condition specified in the closure.static int
findLastIndexOf
(Object self, Closure condition) Iterates over the elements of an aggregate of items and returns the index of the last item that matches the condition specified in the closure.static <T> int
findLastIndexOf
(Iterator<T> self, int startIndex, Closure condition) Iterates over the elements of an Iterator, starting from a specified startIndex, and returns the index of the last item that matches the condition specified in the closure.static <T> int
findLastIndexOf
(Iterator<T> self, Closure condition) Iterates over the elements of an Iterator and returns the index of the last item that matches the condition specified in the closure.static <T> int
findLastIndexOf
(T[] self, int startIndex, Closure condition) Deprecated.static <T> int
findLastIndexOf
(T[] self, Closure condition) Deprecated.static <S,
T, U extends T, V extends T>
TfindResult
(Iterable<S> self, U defaultResult, Closure<V> condition) Iterates through the Iterable calling the given closure condition for each item but stopping once the first non-null result is found and returning that result.static <T> T
findResult
(Iterable<T> self) Iterates through the Iterable stopping once the first non-null result is found and returning that result.static <T,
U> T findResult
(Iterable<U> self, Closure<T> condition) Iterates through the Iterable calling the given closure condition for each item but stopping once the first non-null result is found and returning that result.static <T,
U extends T, V extends T>
TfindResult
(Iterable<U> self, V defaultResult) Iterates through the Iterable calling the given closure condition for each item but stopping once the first non-null result is found and returning that result.static Object
findResult
(Object self) Treats the object as iterable, iterating through the values it represents and returns the first non-null value, otherwise returns null.static Object
findResult
(Object self, Closure condition) Treats the object as iterable, iterating through the values it represents and returns the first non-null result obtained from calling the closure, otherwise returns null.static Object
findResult
(Object self, Object defaultResult) Treats the object as iterable, iterating through the values it represents and returns the first non-null result, otherwise returns the defaultResult.static Object
findResult
(Object self, Object defaultResult, Closure condition) Treats the object as iterable, iterating through the values it represents and returns the first non-null result obtained from calling the closure, otherwise returns the defaultResult.static <S,
T, U extends T, V extends T>
TfindResult
(Iterator<S> self, U defaultResult, Closure<V> condition) Iterates through the Iterator calling the given closure condition for each item but stopping once the first non-null result is found and returning that result.static <T> T
findResult
(Iterator<T> self) Iterates through the Iterator stopping once the first non-null result is found and returning that result.static <T,
U> T findResult
(Iterator<U> self, Closure<T> condition) Iterates through the Iterator calling the given closure condition for each item but stopping once the first non-null result is found and returning that result.static <T,
U extends T, V extends T>
TfindResult
(Iterator<U> self, V defaultResult) Iterates through the Iterator stopping once the first non-null result is found and returning that result.static <T,
U extends T, V extends T, A, B>
TfindResult
(Map<A, B> self, U defaultResult, Closure<V> condition) Returns the first non-null closure result found by passing each map entry to the closure, otherwise the defaultResult is returned.static <T,
K, V> T findResult
(Map<K, V> self, Closure<T> condition) Returns the first non-null closure result found by passing each map entry to the closure, otherwise null is returned.static <S,
T> T findResult
(S[] self, Closure<T> condition) Deprecated.static <S,
T, U extends T, V extends T>
TfindResult
(S[] self, U defaultResult, Closure<V> condition) Deprecated.static <T> T
findResult
(T[] self) Deprecated.static <T,
U extends T, V extends T>
TfindResult
(U[] self, V defaultResult) Deprecated.static <T> Collection<T>
findResults
(Iterable<T> self) Iterates through the Iterable collecting any non-null results.static <T,
U> Collection<T> findResults
(Iterable<U> self, Closure<T> filteringTransform) Iterates through the Iterable transforming items using the supplied closure and collecting any non-null results.static <T> Collection<T>
findResults
(Iterator<T> self) Iterates through the Iterator collecting any non-null results.static <T,
U> Collection<T> findResults
(Iterator<U> self, Closure<T> filteringTransform) Iterates through the Iterator transforming items using the supplied closure and collecting any non-null results.static <T,
K, V> Collection<T> findResults
(Map<K, V> self, Closure<T> filteringTransform) Iterates through the map transforming items using the supplied closure and collecting any non-null results.static <T> Collection<T>
findResults
(T[] self) Deprecated.static <T,
U> Collection<T> findResults
(U[] self, Closure<T> filteringTransform) Deprecated.static <T> T
Returns the first item from the Iterable.static <T> T
Returns the first item from the List.static <T> T
first
(T[] self) Deprecated.static Collection
flatten
(boolean[] self) Deprecated.static Collection
flatten
(byte[] self) Deprecated.static Collection
flatten
(char[] self) Deprecated.static Collection
flatten
(double[] self) Deprecated.static Collection
flatten
(float[] self) Deprecated.static Collection
flatten
(int[] self) Deprecated.static Collection
flatten
(long[] self) Deprecated.static Collection
flatten
(short[] self) Deprecated.static <T,
E> Collection<T> Flatten an Iterable.static <T,
E> Collection<T> Flatten an Iterable.static <T> Collection<T>
Flatten an Iterable.static <T> Collection<T>
Flatten an Iterable.static Collection
Deprecated.static <T> Collection<T>
flatten
(Collection<T> self) Flatten a Collection.static <T> List<T>
Flatten a List.static <T> Collection<T>
Flatten an Optional.static <T> Set<T>
Flatten a Set.static <T> SortedSet<T>
Flatten a SortedSet.static Collection<Object>
flattenMany
(Iterable<?> self, Closure<?> transform) Flatten an Iterable.static <K,
V> V Looks up an item in a Map for the given key and returns the corresponding value.Deprecated.getAt
(boolean[] self, ObjectRange range) Deprecated.Deprecated.getAt
(boolean[] self, Collection indices) Deprecated.Deprecated.getAt
(byte[] self, ObjectRange range) Deprecated.Deprecated.getAt
(byte[] self, Collection indices) Deprecated.Deprecated.getAt
(char[] self, ObjectRange range) Deprecated.Deprecated.getAt
(char[] self, Collection indices) Deprecated.Deprecated.getAt
(double[] self, ObjectRange range) Deprecated.Deprecated.getAt
(double[] self, Collection indices) Deprecated.Deprecated.getAt
(float[] self, ObjectRange range) Deprecated.Deprecated.getAt
(float[] self, Collection indices) Deprecated.Deprecated.getAt
(int[] self, ObjectRange range) Deprecated.Deprecated.getAt
(int[] self, Collection indices) Deprecated.Deprecated.getAt
(long[] self, ObjectRange range) Deprecated.Deprecated.getAt
(long[] self, Collection indices) Deprecated.Deprecated.getAt
(short[] self, ObjectRange range) Deprecated.Deprecated.getAt
(short[] self, Collection indices) Deprecated.static <T> List<T>
getAt
(ListWithDefault<T> self, EmptyRange range) Support the range subscript operator for an eager or lazy List.static <T> List<T>
getAt
(ListWithDefault<T> self, Range range) Support the range subscript operator for an eager or lazy List.static <T> List<T>
getAt
(ListWithDefault<T> self, Collection indices) Select a List of items from an eager or lazy List using a Collection to identify the indices to be selected.static <T> T
Support the subscript operator for an Iterable.static Object
Allows the subscript operator to be used to lookup dynamic property values.static boolean
Support the subscript operator for a Bitsetstatic BitSet
Support retrieving a subset of a BitSet using a Rangestatic List
getAt
(Collection coll, String property) Support the subscript operator for Collection.static <T> T
Support the subscript operator for an Iterator.static <T> T
Support the subscript operator for a List.static <T> List<T>
getAt
(List<T> self, EmptyRange range) Support the range subscript operator for a List.static <T> List<T>
Support the range subscript operator for a List.static <T> T
Support subscript operator for list access.static <T> List<T>
getAt
(List<T> self, Collection indices) Select a List of items from a List using a Collection to identify the indices to be selected.static <K,
V> V Support the subscript operator for a Map.static <T> List<T>
getAt
(T[] self, EmptyRange range) Deprecated.static <T> List<T>
Deprecated.static <T> List<T>
getAt
(T[] self, ObjectRange range) Deprecated.static <T> List<T>
Deprecated.static <T> List<T>
getAt
(T[] self, Collection indices) Deprecated.static Groovydoc
getGroovydoc
(AnnotatedElement holder) Gets runtime groovydoc.static IntRange
getIndices
(boolean[] self) Deprecated.static IntRange
getIndices
(byte[] self) Deprecated.static IntRange
getIndices
(char[] self) Deprecated.static IntRange
getIndices
(double[] self) Deprecated.static IntRange
getIndices
(float[] self) Deprecated.static IntRange
getIndices
(int[] self) Deprecated.static IntRange
getIndices
(long[] self) Deprecated.static IntRange
getIndices
(short[] self) Deprecated.static IntRange
getIndices
(Collection self) Returns indices of the collection.static <T> IntRange
getIndices
(T[] self) Deprecated.static URL
getLocation
(Class self) Gets the url of the jar file/source file containing the specified class.static MetaClass
getMetaClass
(GroovyObject obj) Obtains a MetaClass for an object either from the registry or in the case of a GroovyObject from the object itself.static MetaClass
Adds a "metaClass" property to all class objects so you can use the syntaxString.metaClass.myMethod = { println "foo" }
static MetaClass
getMetaClass
(Object obj) Obtains a MetaClass for an object either from the registry or in the case of a GroovyObject from the object itself.static List<PropertyValue>
getMetaPropertyValues
(Object self) Retrieves the list ofMetaProperty
objects for 'self' and wraps it in a list ofPropertyValue
objects that additionally provide the value for each property of 'self'.getProperties
(Object self) Convenience method that callsgetMetaPropertyValues(java.lang.Object)
(self) and provides the data in form of simple key/value pairs, i.e.static ClassLoader
getRootLoader
(ClassLoader self) Iterates through the classloader parents until it finds a loader with a class named "org.codehaus.groovy.tools.RootLoader".static Collection
Iterates over the collection of items which this Object represents and returns each item that matches using the IDENTITY Closure as a filter - effectively returning all elements which satisfy Groovy truth.static Collection
Iterates over the collection of items which this Object represents and returns each item that matches the given filter - calling the
method used by switch statements.isCase(java.lang.Object, java.lang.Object)
static <T> Collection<T>
grep
(Collection<T> self) Iterates over the collection returning each element that matches using the IDENTITY Closure as a filter - effectively returning all elements which satisfy Groovy truth.static <T> Collection<T>
grep
(Collection<T> self, Object filter) Iterates over the collection of items and returns each item that matches the given filter - calling the
method used by switch statements.isCase(java.lang.Object, java.lang.Object)
static <T> List<T>
Iterates over the collection returning each element that matches using the IDENTITY Closure as a filter - effectively returning all elements which satisfy Groovy truth.static <T> List<T>
Iterates over the collection of items and returns each item that matches the given filter - calling the
method used by switch statements.isCase(java.lang.Object, java.lang.Object)
static <T> Set<T>
Iterates over the collection returning each element that matches using the IDENTITY Closure as a filter - effectively returning all elements which satisfy Groovy truth.static <T> Set<T>
Iterates over the collection of items and returns each item that matches the given filter - calling the
method used by switch statements.isCase(java.lang.Object, java.lang.Object)
static <T> Collection<T>
grep
(T[] self) Deprecated.static <T> Collection<T>
Deprecated.protected static <K,
T> void groupAnswer
(Map<K, List<T>> answer, T element, K value) Groups the current element according to the valueSorts all Iterable members into groups determined by the supplied mapping closure.static Map
Sorts all Iterable members into (sub)groups determined by the supplied mapping closures.static Map
Sorts all Iterable members into (sub)groups determined by the supplied mapping closures.static Map
Deprecated.static Map
Deprecated.Groups the members of a map into sub maps determined by the supplied mapping closure.Groups the members of a map into sub maps determined by the supplied mapping closures.Groups the members of a map into sub maps determined by the supplied mapping closures.Deprecated.groupEntriesBy
(Map<K, V> self, Closure<G> closure) Groups all map entries into groups determined by the supplied mapping closure.static MetaProperty
hasProperty
(Object self, String name) Returns true of the implementing MetaClass has a property of the given namestatic <T> T
Returns the first item from the Iterable.static <T> T
Returns the first item from the List.static <T> T
head
(T[] self) Deprecated.static <T,
U> T Allows the closure to be called for the object reference self.static Boolean
Logical implication of two boolean operands.indexed
(double[] self) Deprecated.indexed
(double[] self, int offset) Deprecated.indexed
(int[] self) Deprecated.indexed
(int[] self, int offset) Deprecated.indexed
(long[] self) Deprecated.indexed
(long[] self, int offset) Deprecated.Zips an Iterable with indices in (index, value) order.Zips an Iterable with indices in (index, value) order.Zips an iterator with indices in (index, value) order.Zips an iterator with indices in (index, value) order.static <T> Collection<T>
Returns the items from the Iterable excluding the last item.static <T> Iterator<T>
Returns an Iterator containing all the items from this iterator except the last one.static <T> List<T>
Returns the items from the List excluding the last item.static <T> SortedSet<T>
Returns the items from the SortedSet excluding the last item.static <T> T[]
init
(T[] self) Deprecated.Calculates the init values of this Iterable: the first value will be this list of all items from the iterable and the final one will be an empty list, with the intervening values the results of successive applications of init on the items.static <E extends T,
T, V extends T>
TDeprecated.static <E,
T, U extends T, V extends T>
TDeprecated.static <E extends T,
T, V extends T>
TIterates through the given object, passing the first two elements to the closure.static <E,
T, U extends T, V extends T>
TIterates through the given object, passing in the initial value to the 2-arg closure along with the first item.static <T,
V extends T>
TIterates through the given object, passing the first two elements to the closure.static <T,
U extends T, V extends T>
TIterates through the given object, passing in the initial value to the closure along with the first item.static <E extends T,
T, V extends T>
Tinject
(Collection<E> self, Closure<V> closure) Deprecated.static <E,
T, U extends T, V extends T>
Tinject
(Collection<E> self, U initialValue, Closure<V> closure) Deprecated.static <E,
T, U extends T, V extends T>
TIterates through the given iterator, passing in the initial value to the closure along with the first item.static <K,
V, T, U extends T, W extends T>
TIterates through the given map, passing in the initial value to the 2-arg Closure along with the first item (or 3-arg Closure along with the first key and value).static String
Inspects returns the String that matches what would be typed into a terminal to create this object.static Number
Integer Divide two Characters.static Number
Integer Divide a Character by a Number.static Number
Integer Divide a Number by a Character.static Number
Integer Divide two Numbers.static <T> Collection<T>
Create a Collection composed of the intersection of both iterables.static <T> Collection<T>
Create a Collection composed of the intersection of both iterables.static <T> Collection<T>
intersect
(Iterable<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a Collection composed of the intersection of both iterables.static <T> Collection<T>
intersect
(Collection<T> left, Collection<T> right) Create a Collection composed of the intersection of both collections.static <T> Collection<T>
intersect
(Collection<T> left, Collection<T> right, Comparator<? super T> comparator) Create a Collection composed of the intersection of both collections.static <T> List<T>
Create a List composed of the intersection of a List and an Iterable.static <T> List<T>
intersect
(List<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a List composed of the intersection of a List and an Iterable.static <K,
V> Map<K, V> Create a Map composed of the intersection of both maps.static <T> Set<T>
Create a Set composed of the intersection of a Set and an Iterable.static <T> Set<T>
intersect
(Set<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a Set composed of the intersection of a Set and an Iterable.static <T> SortedSet<T>
Create a SortedSet composed of the intersection of a SortedSet and an Iterable.static <T> SortedSet<T>
intersect
(SortedSet<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a SortedSet composed of the intersection of a SortedSet and an Iterable.static Object
invokeMethod
(Object object, String method, Object arguments) Provide a dynamic method invocation method which can be overloaded in classes to implement dynamic proxies easily.static boolean
Identity check.static Boolean
isAtLeast
(BigDecimal left, String right) Compare a BigDecimal to a String representing a number.static Boolean
isAtLeast
(BigDecimal left, BigDecimal right) Compare a BigDecimal to another.static boolean
Special 'Case' implementation for Class, which allows testing whether some switch value is assignable from the given case class.static boolean
'Case' implementation for iterable types which tests if the 'switch' operand is contained in any of the 'case' values.static boolean
Special 'case' implementation for all numbers, which delegates to thecompareTo()
method for comparing numbers of different types.static boolean
Method for overloading the behavior of the 'case' method in switch statements.static boolean
isCase
(Collection caseValue, Object switchValue) 'Case' implementation for collections which tests if the 'switch' operand is contained in any of the 'case' values.static boolean
'Case' implementation for maps which tests the groovy truth value obtained using the 'switch' operand as key.static boolean
Determines if a character is a digit.static boolean
Check whether anIterable
has elementsstatic boolean
Determines if a character is a letter.static boolean
isLetterOrDigit
(Character self) Determines if a character is a letter or digit.static boolean
isLowerCase
(Character self) Determines if a Character is lowercase.static boolean
static boolean
static boolean
static boolean
static boolean
isNotCase
(Collection<?> caseValue, Object switchValue) static boolean
static boolean
isUpperCase
(Character self) Determines if a Character is uppercase.static boolean
isWhitespace
(Character self) Determines if a character is a whitespace character.static Iterator
Creates an Iterator for the given Object by converting it to a Collection.static <T> Iterator<T>
iterator
(Enumeration<T> self) Allows an Enumeration to behave like an Iterable.static <T> Iterator<T>
Supports 'duck-typing' when trying to get an Iterator for each element of a Collection, some of which may already be an Iterator.Returns an Iterator for the given Map's entry set.static <T> Iterator<T>
iterator
(T[] self) Deprecated.static String
Deprecated.static String
Deprecated.static String
Deprecated.static String
Deprecated.static String
Deprecated.static String
Deprecated.static String
Deprecated.static String
Deprecated.static String
Concatenates thetoString()
representation of each item from the Iterable.static String
Concatenates thetoString()
representation of each item from the Iterable, with the given String as a separator between each item.static String
Concatenates thetoString()
representation of each item from the Iterator.static String
Concatenates thetoString()
representation of each item from the Iterator, with the given String as a separator between each item.static <T> String
Deprecated.static <T> T
Returns the last item from the Iterable.static <T> T
An optimized version oflast(List)
.static <T> T
Returns the last item from the List.static <T> T
last
(T[] self) Deprecated.static Number
Implementation of the left shift operator for integral types.static BitSet
Implementation of the left shift operator for BitSets, returning a new BitSet and leaving the original unchanged.static <T> Collection<T>
leftShift
(Collection<T> self, T value) Overloads the left shift operator to provide an easy way to append objects to a Collection.static <T> BlockingQueue<T>
leftShift
(BlockingQueue<T> self, T value) Overloads the left shift operator to provide an easy way to append objects to a BlockingQueue.static <T> List<T>
Overloads the left shift operator to provide an easy way to append objects to a List.static <K,
V> Map<K, V> Overloads the left shift operator to provide an easy way to append Map.Entry values to a Map.static <K,
V> Map<K, V> Overloads the left shift operator to provide an easy way to put one maps entries into another map.static <T> Set<T>
Overloads the left shift operator to provide an easy way to append objects to a Set.static <T> SortedSet<T>
Overloads the left shift operator to provide an easy way to append objects to a SortedSet.static double
max
(double[] self) Deprecated.static int
max
(int[] self) Deprecated.static long
max
(long[] self) Deprecated.static <T> T
Adds max() method to Iterable objects.static <T> T
Selects the item in the iterable which when passed as a parameter to the supplied closure returns the maximum value.static <T> T
max
(Iterable<T> self, Comparator<? super T> comparator) Selects the maximum value found in the Iterable using the given comparator.static <T> T
Adds max() method to Iterator objects.static <T> T
Selects the maximum value found from the Iterator using the closure to determine the correct ordering.static <T> T
max
(Iterator<T> self, Comparator<? super T> comparator) Selects the maximum value found from the Iterator using the given comparator.static <K,
V> Map.Entry<K, V> Selects an entry in the map having the maximum calculated value as determined by the supplied closure.static <T> T
max
(T[] self) Deprecated.static <T> T
Deprecated.static <T> T
max
(T[] self, Comparator<? super T> comparator) Deprecated.static MetaClass
Sets/updates the metaclass for a given class to a closure.static MetaClass
Sets/updates the metaclass for a given object to a closure.static double
min
(double[] self) Deprecated.static int
min
(int[] self) Deprecated.static long
min
(long[] self) Deprecated.static <T> T
Adds min() method to Collection objects.static <T> T
Selects the item in the iterable which when passed as a parameter to the supplied closure returns the minimum value.static <T> T
min
(Iterable<T> self, Comparator<? super T> comparator) Selects the minimum value found in the Iterable using the given comparator.static <T> T
Adds min() method to Iterator objects.static <T> T
Selects the minimum value found from the Iterator using the closure to determine the correct ordering.static <T> T
min
(Iterator<T> self, Comparator<? super T> comparator) Selects the minimum value found from the Iterator using the given comparator.static <K,
V> Map.Entry<K, V> Selects an entry in the map having the minimum calculated value as determined by the supplied closure.static <T> T
min
(T[] self) Deprecated.static <T> T
Deprecated.static <T> T
min
(T[] self, Comparator<? super T> comparator) Deprecated.static Number
Subtract one Character from another.static Number
Subtract a Number from a Character.static <T> Collection<T>
Create a new Collection composed of the elements of the first Iterable minus every occurrence of elements of the given Iterable.static <T> Collection<T>
Create a new Collection composed of the elements of the first Iterable minus every matching occurrence as determined by the condition closure of elements of the given Iterable.static <T> Collection<T>
minus
(Iterable<T> self, Iterable<?> removeMe, Comparator<? super T> comparator) Create a new Collection composed of the elements of the first Iterable minus every matching occurrence as determined by the condition comparator of elements of the given Iterable.static <T> Collection<T>
Create a new Collection composed of the elements of the first Iterable minus every occurrence of the given element to remove.static Number
Subtract a Character from a Number.static <T> Collection<T>
minus
(Collection<T> self, Collection<?> removeMe) Create a new Collection composed of the elements of the first Collection minus every occurrence of elements of the given Collection.static <T> List<T>
Create a new List composed of the elements of the first List minus every occurrence of elements of the given Iterable.static <T> List<T>
Create a new List composed of the elements of the first List minus every occurrence of the given element to remove.static <T> List<T>
minus
(List<T> self, Collection<?> removeMe) Create a List composed of the elements of the first list minus every occurrence of elements of the given Collection.static <K,
V> Map<K, V> Create a Map composed of the entries of the first map minus the entries of the given map.static <T> Set<T>
Create a Set composed of the elements of the first Set minus the elements from the given Iterable.static <T> Set<T>
Create a Set composed of the elements of the first Set minus the given element.static <T> Set<T>
minus
(Set<T> self, Collection<?> removeMe) Create a Set composed of the elements of the first Set minus the elements of the given Collection.static <T> SortedSet<T>
Create a SortedSet composed of the elements of the first SortedSet minus the elements of the given Iterable.static <T> SortedSet<T>
Create a SortedSet composed of the elements of the first SortedSet minus the given element.static <T> SortedSet<T>
minus
(SortedSet<T> self, Collection<?> removeMe) Create a SortedSet composed of the elements of the first SortedSet minus the elements of the given Collection.static <T> T[]
Deprecated.static <T> T[]
Deprecated.static <T> T[]
Deprecated.static void
Extend class globally with category methods.static void
Extend class globally with category methods.static void
Extend object with category methods.static void
Extend class globally with category methods.static void
Extend class globally with category methods.static void
Extend class globally with category methods.static Number
Performs a division modulus operation.static Number
Multiply two Characters.static Number
Multiply a Character by a Number.static <T> Collection<T>
Create a Collection composed of the elements of this Iterable, repeated a certain number of times.static Number
Multiply a Number by a Character.static Number
multiply
(BigDecimal left, Double right) Multiply a BigDecimal and a Double.static Number
multiply
(BigDecimal left, BigInteger right) Multiply a BigDecimal and a BigInteger.static <T> List<T>
Create a List composed of the elements of this Iterable, repeated a certain number of times.static <T> T
newInstance
(Class<T> c) Convenience method to dynamically create a new instance of this class.static <T> T
newInstance
(Class<T> c, Object[] args) Helper to construct a new instance from the given arguments.static Character
Increment a Character by one.static Number
Increment a Number by one.static int
numberAwareCompareTo
(Comparable self, Comparable other) Provides a method that compares two comparables using Groovy's default number aware comparator.static Boolean
Logical disjunction of two boolean operatorsstatic Number
Bitwise OR together two numbers.static BitSet
Bitwise OR together two BitSets.static <T> Set<T>
Create a Set as a union of a Set and an Iterable.static <T> SortedSet<T>
Create a SortedSet as a union of a SortedSet and an Iterable.permutations
(Iterable<T> self) Finds all permutations of an iterable.static <T,
V> List<V> permutations
(Iterable<T> self, Closure<V> function) Finds all permutations of an iterable, applies a function to each permutation and collects the result into a list.static Number
Add one Character to another.static Number
Add a Character and a Number.static <T> Collection<T>
Create a Collection as a union of two iterables.static <T> Collection<T>
Create a collection as a union of an Iterable and an Object.static Number
Add a Number and a Character.static <T> Collection<T>
plus
(Collection<T> left, Iterable<T> right) Create a Collection as a union of a Collection and an Iterable.static <T> Collection<T>
plus
(Collection<T> left, Collection<T> right) Create a Collection as a union of two collections.static <T> Collection<T>
plus
(Collection<T> left, T right) Create a collection as a union of a Collection and an Object.static <T> List<T>
Creates a new List by inserting all the elements in the given Iterable to the elements from this List at the specified index.static <T> List<T>
Creates a new List by inserting all the elements in the given additions List to the elements from the original List at the specified index.static <T> List<T>
Creates a new List by inserting all the elements in the specified array to the elements from the original List at the specified index.static <T> List<T>
Create a List as a union of a List and an Iterable.static <T> List<T>
plus
(List<T> left, Collection<T> right) Create a List as a union of a List and a Collection.static <T> List<T>
Create a List as a union of a List and an Object.static <K,
V> Map<K, V> plus
(Map<K, V> self, Collection<? extends Map.Entry<? extends K, ? extends V>> entries) Returns a newMap
containing all entries fromself
andentries
, giving precedence toentries
.static <K,
V> Map<K, V> Returns a newMap
containing all entries fromleft
andright
, giving precedence toright
.static String
Appends a GString to the literal of the Map instance.static String
Appends a String to the literal of the Map instance.static <T> Set<T>
Create a Set as a union of a Set and an Iterable.static <T> Set<T>
plus
(Set<T> left, Collection<T> right) Create a Set as a union of a Set and a Collection.static <T> Set<T>
Create a Set as a union of a Set and an Object.static <T> SortedSet<T>
Create a SortedSet as a union of a SortedSet and an Iterable.static <T> SortedSet<T>
plus
(SortedSet<T> left, Collection<T> right) Create a SortedSet as a union of a SortedSet and a Collection.static <T> SortedSet<T>
Create a SortedSet as a union of a SortedSet and an Object.static <T> T[]
Deprecated.static <T> T[]
Deprecated.static <T> T[]
Deprecated.static <T> T[]
plus
(T[] left, Collection<?> right) Deprecated.static <T> T
Removes the initial item from the List.static Number
Power of an integer to an integer certain exponent.static Number
Power of a long to an integer certain exponent.static Number
Power of a Number to a certain exponent.static Number
power
(BigDecimal self, Integer exponent) Power of a BigDecimal to an integer certain exponent.static Number
power
(BigInteger self, Integer exponent) Power of a BigInteger to an integer certain exponent.static BigInteger
power
(BigInteger self, BigInteger exponent) Power of a BigInteger to a BigInteger certain exponent.static Character
Decrement a Character by one.static Number
Decrement a Number by one.protected static Object
primitiveArrayGet
(Object self, int idx) Deprecated.protected static List
primitiveArrayGet
(Object self, Range range) Deprecated.protected static List
primitiveArrayGet
(Object self, Collection indices) Deprecated.protected static Object
primitiveArrayPut
(Object self, int idx, Object newValue) Deprecated.static void
Print a value to the standard output stream.static void
print
(PrintStream self, Object value) Print a value formatted Groovy style to the print stream.static void
print
(PrintWriter self, Object value) Print a value formatted Groovy style to the print writer.static void
print
(Object self, PrintWriter out) Print to a console in interactive format.static void
Print a value formatted Groovy style to self if it is a Writer, otherwise to the standard output stream.static void
Printf a value to the standard output stream using a format string.static void
Printf 0 or more values to the standard output stream using a format string.static void
Prints a formatted string using the specified format string and arguments.static void
Printf to the standard output stream.static void
Print a linebreak to the standard output stream.static void
Print a value (followed by a newline) to the standard output stream.static void
println
(PrintStream self, Object value) Print a value formatted Groovy style (followed by a newline) to the print stream.static void
println
(PrintWriter self, Object value) Print a value formatted Groovy style (followed by a newline) to the print writer.static void
Print a linebreak to the standard output stream.static void
println
(Object self, PrintWriter out) Print to a console in interactive format.static void
Print a value formatted Groovy style (followed by a newline) to self if it is a Writer, otherwise to the standard output stream.static <T> boolean
Prepends an item to the start of the List.static <K,
V> Map<K, V> putAll
(Map<K, V> self, Collection<? extends Map.Entry<? extends K, ? extends V>> entries) Provides an easy way to append multiple Map.Entry values to a Map.static void
Allows the subscript operator to be used to set dynamically named property values.static void
Support subscript-style assignment for a BitSet.static void
Support assigning a range of values with a single assignment statement.static <T> void
A helper method to allow lists to work with subscript operators.static <T> void
Support subscript operator for list modification.static void
putAt
(List self, EmptyRange range, Object value) A helper method to allow lists to work with subscript operators.static void
putAt
(List self, EmptyRange range, Collection value) A helper method to allow lists to work with subscript operators.static void
List subscript assignment operator when given a range as the index.static void
putAt
(List self, IntRange range, Collection col) List subscript assignment operator when given a range as the index and the assignment operand is a collection.static void
A helper method to allow lists to work with subscript operators.static void
putAt
(List self, List splice, Collection values) A helper method to allow lists to work with subscript operators.static void
Deprecated.static <K,
V> V A helper method to allow maps to work with subscript operatorsstatic Number
Performs a division modulus operation.static <T> boolean
removeAll
(Collection<T> self, Closure condition) Modifies this collection by removing the elements that are matched according to the specified closure condition.static boolean
removeAll
(Collection self, Object[] items) Modifies this collection by removing its elements that are contained within the specified object array.static <K,
V> boolean Modifies this map by removing the elements that are matched according to the specified closure condition.static <E> E
Modifies this list by removing the element at the specified position in this list.static <E> boolean
removeElement
(Collection<E> self, Object o) Modifies this collection by removing a single instance of the specified element from this collection, if it is present.static <T> T
removeLast
(List<T> self) Removes the last item from the List.static List<MetaMethod>
respondsTo
(Object self, String name) Returns an object satisfying Groovy truth if the implementing MetaClass responds to a method with the given name regardless of the arguments.static List<MetaMethod>
respondsTo
(Object self, String name, Object[] argTypes) Returns an object satisfying Groovy truth if the implementing MetaClass responds to a method with the given name and arguments types.static <T> boolean
retainAll
(Collection<T> self, Closure condition) Modifies this collection so that it retains only its elements that are matched according to the specified closure condition.static boolean
retainAll
(Collection self, Object[] items) Modifies this collection so that it retains only its elements that are contained in the specified array.static <K,
V> boolean Modifies this map so that it retains only its elements that are matched according to the specified closure condition.static <T> Iterator<T>
Reverses the iterator.static <T> List<T>
Creates a new List with the identical contents to this list but in reverse order.static <T> List<T>
Reverses the elements in a list.static <T> T[]
reverse
(T[] self) Deprecated.static <T> T[]
reverse
(T[] self, boolean mutate) Deprecated.static <T> List<T>
reverseEach
(List<T> self, Closure closure) Iterate over each element of the list in the reverse order.static <K,
V> Map<K, V> reverseEach
(Map<K, V> self, Closure<?> closure) Allows a Map to be iterated through in reverse order using a closure.static <T> NavigableSet<T>
reverseEach
(NavigableSet<T> self, Closure closure) Iterate over each element of the set in reverse order.static <T> T[]
reverseEach
(T[] self, Closure closure) Deprecated.static Number
rightShift
(Number self, Number operand) Implementation of the right shift operator for integral types.static BitSet
rightShift
(BitSet self, Number operand) Implementation of the right shift operator for BitSets, returning a new BitSet and leaving the original unchanged.static Number
rightShiftUnsigned
(Number self, Number operand) Implementation of the right shift (unsigned) operator for integral types.static BitSet
rightShiftUnsigned
(BitSet self, Number operand) Implementation of the right shift (unsigned) operator for BitSets, returning a new BitSet and leaving the original unchanged.static long
Round the valuestatic double
Round the valuestatic int
Round the valuestatic float
Round the valuestatic BigDecimal
round
(BigDecimal number) Round the valuestatic BigDecimal
round
(BigDecimal number, int precision) Round the valuestatic TimerTask
Allows a simple syntax for using timers.static void
setMetaClass
(GroovyObject self, MetaClass metaClass) Sets the metaclass for aGroovyObject
.static void
setMetaClass
(Class self, MetaClass metaClass) Sets the metaclass for a given class.static void
setMetaClass
(Object self, MetaClass metaClass) Sets the metaclass for an object.static void
Randomly reorders the elements of the specified list.static void
Randomly reorders the elements of the specified list using the specified random instance as the source of randomness.static <T> void
shuffle
(T[] self) Deprecated.static <T> void
Deprecated.static <T> List<T>
Creates a new list containing the elements of the specified list but in a random order.static <T> List<T>
Creates a new list containing the elements of the specified list but in a random order using the specified random instance as the source of randomness.static <T> T[]
shuffled
(T[] self) Deprecated.static <T> T[]
Deprecated.static int
size
(boolean[] self) Deprecated.static int
size
(byte[] self) Deprecated.static int
size
(char[] self) Deprecated.static int
size
(double[] self) Deprecated.static int
size
(float[] self) Deprecated.static int
size
(int[] self) Deprecated.static int
size
(long[] self) Deprecated.static int
size
(short[] self) Deprecated.static int
Provide the standard Groovysize()
method forIterable
.static int
Deprecated.static int
Provide the standard Groovysize()
method forIterator
.static <T> List<T>
Sorts the Collection.static <T> List<T>
Sorts the Iterable.static <T> List<T>
Sorts this Iterable using the given Closure to determine the correct ordering.static <T> List<T>
sort
(Iterable<T> self, boolean mutate, Comparator<? super T> comparator) Sorts the Iterable using the given Comparator.static <T> List<T>
Sorts this Iterable using the given Closure to determine the correct ordering.static <T> Iterator<T>
Sorts the given iterator items into a sorted iterator.static <T> Iterator<T>
Sorts the given iterator items into a sorted iterator using the Closure to determine the correct ordering.static <T> Iterator<T>
sort
(Iterator<T> self, Comparator<? super T> comparator) Sorts the given iterator items into a sorted iterator using the comparator.static <K,
V> Map<K, V> Sorts the elements from the given map into a new ordered Map using the natural ordering of the keys to determine the ordering.static <K,
V> Map<K, V> Sorts the elements from the given map into a new ordered map using the closure as a comparator to determine the ordering.static <K,
V> Map<K, V> sort
(Map<K, V> self, Comparator<? super K> comparator) Sorts the elements from the given map into a new ordered Map using the specified key comparator to determine the ordering.static <K,
V> SortedMap<K, V> Avoids doing unnecessary work when sorting an already sorted map (i.e.static <T> SortedSet<T>
Avoids doing unnecessary work when sorting an already sorted set (i.e.static <T> T[]
sort
(T[] self) Deprecated.static <T> T[]
sort
(T[] self, boolean mutate) Deprecated.static <T> T[]
Deprecated.static <T> T[]
sort
(T[] self, boolean mutate, Comparator<? super T> comparator) Deprecated.static <T> T[]
Deprecated.static <T> T[]
sort
(T[] self, Comparator<? super T> comparator) Deprecated.static Collection
Splits all items into two lists based on the closure condition.static <T> Collection<Collection<T>>
split
(Collection<T> self, Closure closure) Splits all items into two collections based on the closure condition.Splits all items into two collections based on the closure condition.Splits all items into two collections based on the closure condition.static <T> Collection<Collection<T>>
Deprecated.static SpreadMap
Synonym fortoSpreadMap(java.util.Map)
.static String
Returns a formatted string using the specified format string and arguments.static String
Sprintf to a string.static void
Iterates from this number up to the given number using a step increment.static <K,
V> Map<K, V> subMap
(Map<K, V> map, Collection<K> keys) Creates a sub-Map containing the given keys.static <K,
V> Map<K, V> Creates a sub-Map containing the given keys.subsequences
(List<T> self) Finds all non-null subsequences of a list.static byte
sum
(byte[] self) Deprecated.static byte
sum
(byte[] self, byte initialValue) Deprecated.static char
sum
(char[] self) Deprecated.static char
sum
(char[] self, char initialValue) Deprecated.static double
sum
(double[] self) Deprecated.static double
sum
(double[] self, double initialValue) Deprecated.static float
sum
(float[] self) Deprecated.static float
sum
(float[] self, float initialValue) Deprecated.static int
sum
(int[] self) Deprecated.static int
sum
(int[] self, int initialValue) Deprecated.static long
sum
(long[] self) Deprecated.static long
sum
(long[] self, long initialValue) Deprecated.static short
sum
(short[] self) Deprecated.static short
sum
(short[] self, short initialValue) Deprecated.static Object
Sums the items in an Iterable.static Object
Sums the items in an Iterable, adding the result to some initial value.static <T> Object
Sums the result of applying a closure to each item of an Iterable.static <T> Object
Sums the result of applying a closure to each item of an Iterable to some initial value.static Object
Deprecated.static Object
Deprecated.static Object
Sums the items from an Iterator, adding the result to some initial value.static Object
Sums the items from an Iterator.static <T> Object
Sums the result of applying a closure to each item returned from an iterator.static <T> Object
Sums the result of applying a closure to each item of an Iterator to some initial value.static <T> Object
Deprecated.static <T> Object
Deprecated.static boolean[]
swap
(boolean[] self, int i, int j) Deprecated.static byte[]
swap
(byte[] self, int i, int j) Deprecated.static char[]
swap
(char[] self, int i, int j) Deprecated.static double[]
swap
(double[] self, int i, int j) Deprecated.static float[]
swap
(float[] self, int i, int j) Deprecated.static int[]
swap
(int[] self, int i, int j) Deprecated.static long[]
swap
(long[] self, int i, int j) Deprecated.static short[]
swap
(short[] self, int i, int j) Deprecated.static <T> List<T>
Swaps two elements at the specified positions.static <T> T[]
swap
(T[] self, int i, int j) Deprecated.static <T> Collection<T>
Returns the items from the Iterable excluding the first item.static <T> Iterator<T>
Returns the original iterator after throwing away the first element.static <T> List<T>
Returns the items from the List excluding the first item.static <T> SortedSet<T>
Returns the items from the SortedSet excluding the first item.static <T> T[]
tail
(T[] self) Deprecated.Calculates the tail values of this Iterable: the first value will be this list of all items from the iterable and the final one will be an empty list, with the intervening values the results of successive applications of tail on the items.static <T> Collection<T>
Returns the firstnum
elements from the head of this Iterable.static <T> Iterator<T>
Returns an iterator of up to the firstnum
elements from this iterator.static <T> List<T>
Returns the firstnum
elements from the head of this List.static <K,
V> Map<K, V> Returns a new map containing the firstnum
elements from the head of this map.static <T> SortedSet<T>
Returns the firstnum
elements from the head of this SortedSet.static <T> T[]
take
(T[] self, int num) Deprecated.static <T> Collection<T>
Returns the lastnum
elements from the tail of this Iterable.static <T> List<T>
Returns the lastnum
elements from the tail of this List.static <T> SortedSet<T>
Returns the lastnum
elements from the tail of this SortedSet.static <T> T[]
takeRight
(T[] self, int num) Deprecated.static <T> Collection<T>
Returns a Collection containing the longest prefix of the elements from this Iterable where each element passed to the given closure evaluates to true.static <T> Iterator<T>
Returns the longest prefix of elements in this iterator where each element passed to the given condition closure evaluates to true.static <T> List<T>
Returns the longest prefix of this list where each element passed to the given closure condition evaluates to true.static <K,
V> Map<K, V> Returns the longest prefix of this Map where each entry (or key/value pair) when passed to the given closure evaluates to true.static <T> SortedSet<T>
Returns the longest prefix of this SortedSet where each element passed to the given closure condition evaluates to true.static <T> T[]
Deprecated.static <T,
U> U Allows the closure to be called for the object reference self (similar towith
) and always returns self.static void
Executes the closure this many times, starting from zero.static String
toArrayString
(Object[] self) Deprecated.static BigDecimal
toBigDecimal
(Number self) Transforms a Number into a BigDecimal.static BigInteger
toBigInteger
(Number self) Transforms this Number into a BigInteger.static Boolean
Identity conversion which returns Boolean.TRUE for a true Boolean and Boolean.FALSE for a false Boolean.static Double
Transforms a Number into a Double.static Float
Transforms a Number into a Float.static Integer
Transforms a Number into an Integer.toList
(boolean[] self) Deprecated.toList
(byte[] self) Deprecated.toList
(char[] self) Deprecated.toList
(double[] self) Deprecated.toList
(float[] self) Deprecated.toList
(int[] self) Deprecated.toList
(long[] self) Deprecated.toList
(short[] self) Deprecated.static <T> List<T>
Convert an Iterable to a List.static <T> List<T>
toList
(Enumeration<T> self) Convert an enumeration to a List.static <T> List<T>
Convert an iterator to a List.static <T> List<T>
toList
(T[] self) Deprecated.static String
toListString
(Collection self) Returns the string representation of the given list.static String
toListString
(Collection self, int maxSize) Returns the string representation of the given list.static Long
Transforms a Number into a Long.static char
toLowerCase
(Character self) Converts the character to lowercase.static String
toMapString
(Map self) Returns the string representation of this map.static String
toMapString
(Map self, int maxSize) Returns the string representation of this map.toSet
(boolean[] self) Deprecated.toSet
(byte[] self) Deprecated.toSet
(char[] self) Deprecated.toSet
(double[] self) Deprecated.toSet
(float[] self) Deprecated.toSet
(int[] self) Deprecated.toSet
(long[] self) Deprecated.toSet
(short[] self) Deprecated.static <T> Set<T>
Convert an Iterable to a Set.static <T> Set<T>
toSet
(Collection<T> self) Convert a Collection to a Set.static <T> Set<T>
toSet
(Enumeration<T> self) Convert an enumeration to a Set.static <T> Set<T>
Convert an iterator to a Set.static <T> List<T>
Sorts the Iterable.static <T> List<T>
Sorts this Iterable using the given Closure to determine the correct ordering.static <T> List<T>
toSorted
(Iterable<T> self, Comparator<? super T> comparator) Sorts the Iterable using the given Comparator.static <T> Iterator<T>
Sorts the Iterator.static <T> Iterator<T>
Sorts the given iterator items into a sorted iterator using the Closure to determine the correct ordering.static <T> Iterator<T>
toSorted
(Iterator<T> self, Comparator<? super T> comparator) Sorts the given iterator items using the comparator.static <K,
V> Map<K, V> Sorts the elements from the given map into a new ordered map using aNumberAwareComparator
on map entry values to determine the resulting order.static <K,
V> Map<K, V> Sorts the elements from the given map into a new ordered map using the supplied Closure condition as a comparator to determine the ordering.static <K,
V> Map<K, V> toSorted
(Map<K, V> self, Comparator<Map.Entry<K, V>> comparator) Sorts the elements from the given map into a new ordered map using the supplied comparator to determine the ordering.static <K,
V> Map<K, V> Avoids doing unnecessary work when sorting an already sorted mapstatic <T> Set<T>
Avoids doing unnecessary work when sorting an already sorted setstatic <T> T[]
toSorted
(T[] self) Deprecated.static <T> T[]
Deprecated.static <T> T[]
toSorted
(T[] self, Comparator<? super T> comparator) Deprecated.static SpreadMap
toSpreadMap
(Iterable self) Creates a spreadable map from this iterable.static SpreadMap
toSpreadMap
(Object[] self) Deprecated.static SpreadMap
toSpreadMap
(List self) Creates a spreadable map from this list.static SpreadMap
toSpreadMap
(Map self) Returns a newSpreadMap
from this map.static String
toString
(boolean[] self) Deprecated.static String
toString
(byte[] self) Deprecated.static String
toString
(char[] self) Deprecated.static String
toString
(double[] self) Deprecated.static String
toString
(float[] self) Deprecated.static String
toString
(int[] self) Deprecated.static String
toString
(long[] self) Deprecated.static String
toString
(short[] self) Deprecated.static String
Create a String representation of this object.static String
Deprecated.static String
toString
(AbstractCollection self) Returns the string representation of the given collection.static String
toString
(AbstractMap self) Returns the string representation of the given map.static <T> Collection<T>
Returns a Collection containing the items from the Iterable but with duplicates removed using the natural ordering of the items to determine uniqueness.static <T> Collection<T>
Returns a Collection containing the items from the Iterable but with duplicates removed.static <T> Collection<T>
toUnique
(Iterable<T> self, Comparator<? super T> comparator) Returns a Collection containing the items from the Iterable but with duplicates removed.static <T> Iterator<T>
Returns an iterator equivalent to this iterator with all duplicated items removed by using the natural ordering of the items.static <T> Iterator<T>
Returns an iterator equivalent to this iterator but with all duplicated items removed where duplicate (equal) items are deduced by calling the supplied Closure condition.static <T> Iterator<T>
toUnique
(Iterator<T> self, Comparator<? super T> comparator) Returns an iterator equivalent to this iterator with all duplicated items removed by using the supplied comparator.static <T> List<T>
Returns a List containing the items from the List but with duplicates removed using the natural ordering of the items to determine uniqueness.static <T> List<T>
Returns a List containing the items from the List but with duplicates removed.static <T> List<T>
toUnique
(List<T> self, Comparator<? super T> comparator) Returns a List containing the items from the List but with duplicates removed.static <T> T[]
toUnique
(T[] self) Deprecated.static <T> T[]
Deprecated.static <T> T[]
toUnique
(T[] self, Comparator<? super T> comparator) Deprecated.static char
toUpperCase
(Character self) Converts the character to uppercase.static double[][]
transpose
(double[][] self) Deprecated.static int[][]
transpose
(int[][] self) Deprecated.static long[][]
transpose
(long[][] self) Deprecated.static List
Adds GroovyCollections#transpose(List) as a method on lists.static double
Truncate the valuestatic double
Truncate the valuestatic float
Truncate the valuestatic float
Truncate the valuestatic BigDecimal
trunc
(BigDecimal number) Truncate the valuestatic BigDecimal
trunc
(BigDecimal number, int precision) Truncate the valuestatic Number
unaryMinus
(Number left) Negates the number.static Number
Returns the number, effectively being a noop for numbers.static <T> Collection<T>
Create a Collection composed of the union of both iterables.static <T> Collection<T>
Create a Collection composed of the union of both iterables.static <T> Collection<T>
union
(Iterable<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a Collection composed of the union of both iterables.static Object[]
Deprecated.static Object[]
Deprecated.static Object[]
Deprecated.static Object[]
union
(Object[] left, Collection<?> right) Deprecated.static <T> Collection<T>
union
(Collection<T> left, Collection<T> right) Create a Collection composed of the union of both collections.static <T> Collection<T>
union
(Collection<T> left, Collection<T> right, Comparator<? super T> comparator) Create a Collection composed of the union of both collections.static <T> List<T>
Create a List composed of the union of a List and an Iterable.static <T> List<T>
union
(List<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a List composed of the union of a List and an Iterable.static <T> Set<T>
Create a Set composed of the union of a Set and an Iterable.static <T> Set<T>
union
(Set<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a Set composed of the union of a Set and an Iterable.static <T> SortedSet<T>
Create a SortedSet composed of the union of a SortedSet and an Iterable.static <T> SortedSet<T>
union
(SortedSet<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a SortedSet composed of the intersection of a SortedSet and an Iterable.static <T> Collection<T>
unique
(Collection<T> self) Modifies this collection to remove all duplicated items, using Groovy's default number-aware comparator.static <T> Collection<T>
unique
(Collection<T> self, boolean mutate) Remove all duplicates from a given Collection using Groovy's default number-aware comparator.static <T> Collection<T>
unique
(Collection<T> self, boolean mutate, Closure closure) A convenience method for making a collection unique using a Closure to determine duplicate (equal) items.static <T> Collection<T>
unique
(Collection<T> self, boolean mutate, Comparator<? super T> comparator) Remove all duplicates from a given Collection.static <T> Collection<T>
unique
(Collection<T> self, Closure closure) A convenience method for making a collection unique using a Closure to determine duplicate (equal) items.static <T> Collection<T>
unique
(Collection<T> self, Comparator<? super T> comparator) Remove all duplicates from a given Collection.static <T> Iterator<T>
Returns an iterator equivalent to this iterator with all duplicated items removed by using Groovy's default number-aware comparator.static <T> Iterator<T>
Returns an iterator equivalent to this iterator but with all duplicated items removed by using a Closure to determine duplicate (equal) items.static <T> Iterator<T>
unique
(Iterator<T> self, Comparator<? super T> comparator) Returns an iterator equivalent to this iterator with all duplicated items removed by using the supplied comparator.static <T> List<T>
Modifies this List to remove all duplicated items, using Groovy's default number-aware comparator.static <T> List<T>
Remove all duplicates from a given List using Groovy's default number-aware comparator.static <T> List<T>
A convenience method for making a List unique using a Closure to determine duplicate (equal) items.static <T> List<T>
unique
(List<T> self, boolean mutate, Comparator<? super T> comparator) Remove all duplicates from a given List.static <T> List<T>
A convenience method for making a List unique using a Closure to determine duplicate (equal) items.static <T> List<T>
unique
(List<T> self, Comparator<? super T> comparator) Remove all duplicates from a given List.static void
Iterates from this number up to the given number, inclusive, incrementing by one each time.static void
Iterates from this number up to the given number, inclusive, incrementing by one each time.static void
Iterates from this number up to the given number, inclusive, incrementing by one each time.static void
Iterates from this number up to the given number, inclusive, incrementing by one each time.static void
Iterates from this number up to the given number, inclusive, incrementing by one each time.static void
Iterates from this number up to the given number, inclusive, incrementing by one each time.static void
Iterates from this number up to the given number, inclusive, incrementing by one each time.static void
upto
(BigDecimal self, Number to, Closure closure) Iterates from this number up to the given number, inclusive, incrementing by one each time.static void
upto
(BigInteger self, Number to, Closure closure) Iterates from this number up to the given number, inclusive, incrementing by one each time.static <T> T
Scoped use methodstatic Object
Allows you to use a list of categories, specifying the list as varargs.static <T> T
Scoped use method with list of categories.static <T,
U extends T, V extends T>
TAllows the closure to be called for the object reference self.static <T,
U> T Allows the closure to be called for the object reference self.static <K,
V> Map<K, V> withCollectedKeys
(Iterable<V> values, Function<? super V, K> keyTransform) Transform Iterable elements into Map entries with values unchanged and keys transformed using the supplied function.static <K,
V> Map<K, V> withCollectedKeys
(Iterable<V> values, Map<K, V> collector, Function<? super V, K> keyTransform) Transform Iterable elements into Map entries with values unchanged and keys transformed using the supplied function.static <K,
V> Map<K, V> withCollectedKeys
(Iterator<V> values, Function<? super V, K> keyTransform) A variant of withCollectedKeys for Iterators.static <K,
V> Map<K, V> withCollectedKeys
(Iterator<V> values, Map<K, V> collector, Function<? super V, K> keyTransform) A variant of withCollectedKeys for Iterators.static <K,
V> Map<K, V> withCollectedValues
(Iterable<K> keys, Function<? super K, V> valueTransform) Transform Iterable elements into Map entries with keys unchanged and values transformed using the supplied function.static <K,
V> Map<K, V> withCollectedValues
(Iterable<K> keys, Map<K, V> collector, Function<? super K, V> valueTransform) Transform Iterable elements into Map entries with keys unchanged and values transformed using the supplied function.static <K,
V> Map<K, V> withCollectedValues
(Iterator<K> keys, Function<? super K, V> valueTransform) A variant of withCollectedValues for Iterators.static <K,
V> Map<K, V> withCollectedValues
(Iterator<K> keys, Map<K, V> collector, Function<? super K, V> valueTransform) A variant of withCollectedValues for Iterators.static <T> ListWithDefault<T>
withDefault
(List<T> self, Closure<T> init) An alias forwithLazyDefault
which decorates a list allowing it to grow when called with index values outside the normal list bounds.static <K,
V> Map<K, V> withDefault
(Map<K, V> self, boolean autoGrow, boolean autoShrink, Closure<V> init) Wraps a map using the decorator pattern with a wrapper that intercepts all calls toget(key)
andput(key, value)
.static <K,
V> Map<K, V> withDefault
(Map<K, V> self, Closure<V> init) Wraps a map using the decorator pattern with a wrapper that intercepts all calls toget(key)
.static <T> List<T>
withDefault$$bridge
(List<T> self, Closure<T> init) Deprecated.static <T> ListWithDefault<T>
withEagerDefault
(List<T> self, Closure<T> init) Decorates a list allowing it to grow when called with a non-existent index value.static <T> List<T>
withEagerDefault$$bridge
(List<T> self, Closure<T> init) Deprecated.Zips an Iterable with indices in (value, index) order.Zips an Iterable with indices in (value, index) order.Zips an iterator with indices in (value, index) order.Zips an iterator with indices in (value, index) order.static <T> ListWithDefault<T>
withLazyDefault
(List<T> self, Closure<T> init) Decorates a list allowing it to grow when called with a non-existent index value.static <T> List<T>
withLazyDefault$$bridge
(List<T> self, Closure<T> init) Deprecated.static Object
withMethodClosure
(Object self, MethodClosure mc) A utility method for calling a method closure on an object.static Object
withTraits
(Object self, Class<?>... traits) Dynamically wraps an instance into something which implements the supplied trait classes.static Boolean
Exclusive disjunction of two boolean operatorsstatic Number
Bitwise XOR together two Numbers.static BitSet
Bitwise XOR together two BitSets.static <T> Set<T>
Create a Set composed of the symmetric difference of a Set and an Iterable.static <T> Set<T>
xor
(Set<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a Set composed of the symmetric difference of a Set and an Iterable.static <T> SortedSet<T>
Create a SortedSet composed of the symmetric difference of a SortedSet and an Iterable.static <T> SortedSet<T>
xor
(SortedSet<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a SortedSet composed of the symmetric difference of a SortedSet and an Iterable.An iterator of all the pairs of two Iterables.An iterator of all the pairs of two Iterators.Methods inherited from class org.codehaus.groovy.runtime.DefaultGroovyMethodsSupport
cloneSimilarCollection, cloneSimilarMap, closeQuietly, closeWithWarning, createSimilarArray, createSimilarCollection, createSimilarCollection, createSimilarCollection, createSimilarList, createSimilarMap, createSimilarOrDefaultCollection, createSimilarQueue, createSimilarSet, normaliseIndex, sameType, sameType, subListBorders, subListBorders, subListRange, writeUTF16BomIfRequired, writeUTF16BomIfRequired, writeUTF16BomIfRequired, writeUTF16BomIfRequired
-
Field Details
-
ADDITIONAL_CLASSES
-
DGM_LIKE_CLASSES
-
-
Constructor Details
-
DefaultGroovyMethods
public DefaultGroovyMethods()
-
-
Method Details
-
callClosureForLine
protected static <T> T callClosureForLine(@ClosureParams(value=FromString.class,options={"String","String,Integer"}) Closure<T> closure, String line, int counter) -
callClosureForMapEntry
protected static <T,K, T callClosureForMapEntryV> (@ClosureParams(value=FromString.class,options={"K,V","Map.Entry<K,V>"}) Closure<T> closure, Map.Entry<K, V> entry) -
callClosureForMapEntryAndCounter
protected static <T,K, T callClosureForMapEntryAndCounterV> (@ClosureParams(value=FromString.class,options={"K,V,Integer","K,V","Map.Entry<K,V>"}) Closure<T> closure, Map.Entry<K, V> entry, int counter) -
abs
Gets the absolute value.Note: This method is NOT called if number is a BigInteger or BigDecimal, because those classes implement a method with a better exact match.
- Parameters:
number
- a Number- Returns:
- the absolute value of that Number
- Since:
- 1.0
-
abs
Gets the absolute value.- Parameters:
number
- a Long- Returns:
- the absolute value of that Long
- Since:
- 1.0
-
abs
Gets the absolute value.- Parameters:
number
- a Float- Returns:
- the absolute value of that Float
- Since:
- 1.0
-
abs
Gets the absolute value.- Parameters:
number
- a Double- Returns:
- the absolute value of that Double
- Since:
- 1.0
-
addAll
Adds all items from the iterator to the Collection.- Parameters:
self
- the collectionitems
- the items to add- Returns:
- true if the collection changed
-
addAll
Adds all items from the iterable to the Collection.- Parameters:
self
- the collectionitems
- the items to add- Returns:
- true if the collection changed
-
addAll
Modifies the collection by adding all the elements in the specified array to the collection. The behavior of this operation is undefined if the specified array is modified while the operation is in progress.See also
plus
or the '+' operator if wanting to produce a new collection containing additional items but while leaving the original collection unchanged.- Parameters:
self
- a Collection to be modifieditems
- array containing elements to be added to this collection- Returns:
- true if this collection changed as a result of the call
- Since:
- 1.7.2
- See Also:
-
addAll
Modifies this list by inserting all the elements in the specified array into the list at the specified position. Shifts the element currently at that position (if any) and any subsequent elements to the right (increases their indices). The new elements will appear in this list in the order that they occur in the array. The behavior of this operation is undefined if the specified array is modified while the operation is in progress. See alsoplus
for similar functionality with copy semantics, i.e. which produces a new list after adding the additional items at the specified position but leaves the original list unchanged.- Parameters:
self
- a list to be modifieditems
- array containing elements to be added to this collectionindex
- index at which to insert the first element from the specified array- Returns:
- true if this collection changed as a result of the call
- Since:
- 1.7.2
- See Also:
-
addShutdownHook
Allows the usage of addShutdownHook without getting the runtime first.- Parameters:
self
- the object the method is called on (ignored)closure
- the shutdown hook action- Since:
- 1.5.0
-
and
Bitwise AND together two Numbers.- Parameters:
left
- a Numberright
- another Number to bitwise AND- Returns:
- the bitwise AND of both Numbers
- Since:
- 1.0
-
and
Bitwise AND together two BitSets.- Parameters:
left
- a BitSetright
- another BitSet to bitwise AND- Returns:
- the bitwise AND of both BitSets
- Since:
- 1.5.0
-
and
Logical conjunction of two boolean operators.- Parameters:
left
- left operatorright
- right operator- Returns:
- result of logical conjunction
- Since:
- 1.0
-
and
Creates a Set composed of the intersection of a Set and an Iterable. Any elements that exist in both are added to the resultant Set.This operation will always create a new object for the result, while the operands remain unchanged.
def a = [1,2,3,4] as Set def b = [3,4,5,6] as Set assert (a & b) == [3,4] as Set
By default, Groovy uses aNumberAwareComparator
when determining if an element exists in both sets.- Parameters:
left
- a Setright
- an Iterable- Returns:
- a Set as an intersection of a Set and an Iterable
- Since:
- 5.0.0
- See Also:
-
and
Creates a Set composed of the intersection of a Set and an Iterable. Any elements that exist in both iterables are added to the resultant collection.This operation will always create a new object for the result, while the operands remain unchanged.
assert [3,4] as Set == ([1,2,3,4] as Set).and([3,4,5,6], Comparator.naturalOrder())
- Parameters:
left
- a Setright
- an Iterablecomparator
- a Comparator- Returns:
- a Set as an intersection of a Set and an Iterable
- Since:
- 5.0.0
- See Also:
-
and
Creates a SortedSet composed of the intersection of a SortedSet and an Iterable. Any elements that exist in both are added to the resultant SortedSet.This operation will always create a new object for the result, while the operands remain unchanged.
def a = [1,2,3,4] as SortedSet def b = [3,4,5,6] as Set assert (a & b) == [3,4] as SortedSet
By default, Groovy uses aNumberAwareComparator
when determining if an element exists in both sets.- Parameters:
left
- a SortedSetright
- an Iterable- Returns:
- a SortedSet as an intersection of a SortedSet and an Iterable
- Since:
- 5.0.0
- See Also:
-
and
public static <T> SortedSet<T> and(SortedSet<T> left, Iterable<T> right, Comparator<? super T> comparator) Creates a SortedSet composed of the intersection of a SortedSet and an Iterable. Any elements that exist in both iterables are added to the resultant collection.This operation will always create a new object for the result, while the operands remain unchanged.
assert [3,4] as SortedSet == ([1,2,3,4] as SortedSet).and([3,4,5,6], Comparator.naturalOrder())
- Parameters:
left
- a SortedSetright
- an Iterablecomparator
- a Comparator- Returns:
- a SortedSet as an intersection of a SortedSet and an Iterable
- Since:
- 5.0.0
- See Also:
-
any
Iterates over the elements of a collection, and checks whether at least one element is true according to the Groovy Truth. Equivalent to self.any({element->
element})assert [false, true].any() assert [0, 1].any() assert ![0, 0].any()
- Parameters:
self
- the object over which we iterate- Returns:
- true if any item in the collection matches the closure predicate
- Since:
- 1.5.0
-
any
Iterates over the contents of an object or collection, and checks whether a predicate is valid for at least one element.assert [1, 2, 3].any { it == 2 } assert ![1, 2, 3].any { it
>
3 }- Parameters:
self
- the object over which we iteratepredicate
- the closure predicate used for matching- Returns:
- true if any iteration for the object matches the closure predicate
- Since:
- 1.0
-
any
public static <T> boolean any(Iterator<T> self, @ClosureParams(FirstGenericType.class) Closure predicate) Iterates over the contents of an iterator, and checks whether a predicate is valid for at least one element.assert [1, 2, 3].iterator().any { it == 2 } assert ![1, 2, 3].iterator().any { it
>
3 }- Parameters:
self
- the iterator over which we iteratepredicate
- the closure predicate used for matching- Returns:
- true if any iteration for the object matches the closure predicate
- Since:
- 1.0
-
any
public static <T> boolean any(Iterable<T> self, @ClosureParams(FirstGenericType.class) Closure predicate) Iterates over the contents of an iterable, and checks whether a predicate is valid for at least one element.assert [1, 2, 3].any { it == 2 } assert ![1, 2, 3].any { it
>
3 }- Parameters:
self
- the iterable over which we iteratepredicate
- the closure predicate used for matching- Returns:
- true if any iteration for the object matches the closure predicate
- Since:
- 1.0
-
any
public static <K,V> boolean any(Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<?> predicate) Iterates over the entries of a map, and checks whether a predicate is valid for at least one entry. If the closure takes one parameter then it will be passed the Map.Entry otherwise if the closure takes two parameters then it will be passed the key and the value.assert [2:3, 4:5, 5:10].any { key, value
->
key * 2 == value } assert ![2:3, 4:5, 5:10].any { entry->
entry.key == entry.value * 2 }- Parameters:
self
- the map over which we iteratepredicate
- the 1 or 2 arg closure predicate used for matching- Returns:
- true if any entry in the map matches the closure predicate
- Since:
- 1.5.0
-
asBoolean
Coerce an object instance to a boolean value. An object is coerced to true if it's not null, to false if it is null.- Parameters:
object
- the object to coerce- Returns:
- the boolean value
- Since:
- 1.7.0
-
asBoolean
Coerce a Boolean instance to a boolean value.// you can omit ".asBoolean()" assert Boolean.TRUE.asBoolean() assert !Boolean.FALSE.asBoolean()
- Since:
- 1.7.0
-
asBoolean
Coerce an AtomicBoolean instance to a boolean value.import java.util.concurrent.atomic.AtomicBoolean // you can omit ".asBoolean()" assert new AtomicBoolean(true).asBoolean() assert !new AtomicBoolean(false).asBoolean() assert !new AtomicBoolean(true).tap{set(false)}
- Since:
- 5.0.0
-
asBoolean
Coerce a collection instance to a boolean value. A collection is coerced to false if it's empty, and to true otherwise.assert [1,2].asBoolean() == true
assert [].asBoolean() == false
- Parameters:
collection
- the collection- Returns:
- the boolean value
- Since:
- 1.7.0
-
asBoolean
Coerce a map instance to a boolean value. A map is coerced to false if it's empty, and to true otherwise.assert [:] as Boolean == false assert [a:2] as Boolean == true
- Parameters:
map
- the map- Returns:
- the boolean value
- Since:
- 1.7.0
-
asBoolean
Coerce an iterator instance to a boolean value. An iterator is coerced to false if there are no more elements to iterate over, and to true otherwise.- Parameters:
iterator
- the iterator- Returns:
- the boolean value
- Since:
- 1.7.0
-
asBoolean
Coerce an enumeration instance to a boolean value. An enumeration is coerced to false if there are no more elements to enumerate, and to true otherwise.- Parameters:
enumeration
- the enumeration- Returns:
- the boolean value
- Since:
- 1.7.0
-
asBoolean
Coerce a character to a boolean value. A character is coerced to false if it's character value is equal to 0, and to true otherwise.- Parameters:
character
- the character- Returns:
- the boolean value
- Since:
- 1.7.0
-
asBoolean
Coerce a Float instance to a boolean value.- Parameters:
object
- the Float- Returns:
true
for non-zero and non-NaN values, elsefalse
- Since:
- 2.6.0
-
asBoolean
Coerce a Double instance to a boolean value.- Parameters:
object
- the Double- Returns:
true
for non-zero and non-NaN values, elsefalse
- Since:
- 2.6.0
-
asBoolean
Coerce a number to a boolean value. A number is coerced to false if its double value is equal to 0, and to true otherwise.- Parameters:
number
- the number- Returns:
- the boolean value
- Since:
- 1.7.0
-
asChecked
Creates a checked view of a List.- Since:
- 5.0.0
- See Also:
-
asChecked
Creates a checked view of a Queue.- Since:
- 5.0.0
- See Also:
-
asChecked
Creates a checked view of a Collection.- Since:
- 5.0.0
- See Also:
-
asChecked
Creates a checked view of a Set.- Since:
- 5.0.0
- See Also:
-
asChecked
Creates a checked view of a SortedSet.- Since:
- 5.0.0
- See Also:
-
asChecked
Creates a checked view of a Map.- Since:
- 5.0.0
- See Also:
-
asChecked
public static <K,V> SortedMap<K,V> asChecked(SortedMap<K, V> self, Class<K> keyType, Class<V> valueType) Creates a checked view of a SortedMap. -
asCollection
Converts this Iterable to a Collection. Returns the original argument if it is already a Collection.Example usage:
assert new HashSet().asCollection() instanceof Collection
- Parameters:
self
- an Iterable to be converted into a Collection- Returns:
- a newly created List if this Iterable is not already a Collection
- Since:
- 2.4.0
-
asImmutable
A convenience method for creating an immutable Map.- Parameters:
self
- a Map- Returns:
- an unmodifiable view of a copy of the original, i.e. an effectively immutable copy
- Since:
- 1.0
- See Also:
-
asImmutable
A convenience method for creating an immutable SortedMap.- Parameters:
self
- a SortedMap- Returns:
- an unmodifiable view of a copy of the original, i.e. an effectively immutable copy
- Since:
- 1.0
- See Also:
-
asImmutable
A convenience method for creating an immutable List.def mutable = [1,2,3] def immutable = mutable.asImmutable() try { immutable << 4 assert false } catch (UnsupportedOperationException) { assert true } mutable << 4 assert mutable.size() == 4 assert immutable.size() == 3
- Parameters:
self
- a List- Returns:
- an unmodifiable view of a copy of the original, i.e. an effectively immutable copy
- Since:
- 1.0
- See Also:
-
asImmutable
A convenience method for creating an immutable Set.- Parameters:
self
- a Set- Returns:
- an unmodifiable view of a copy of the original, i.e. an effectively immutable copy
- Since:
- 1.0
- See Also:
-
asImmutable
A convenience method for creating an immutable SortedSet.- Parameters:
self
- a SortedSet- Returns:
- an unmodifiable view of a copy of the original, i.e. an effectively immutable copy
- Since:
- 1.0
- See Also:
-
asImmutable
A convenience method for creating an immutable Collection.- Parameters:
self
- a Collection- Returns:
- an unmodifiable view of a copy of the original, i.e. an effectively immutable copy
- Since:
- 1.5.0
- See Also:
-
asList
Converts this Iterable to a List. Returns the original Iterable if it is already a List.Example usage:
assert new HashSet().asList() instanceof List
- Parameters:
self
- an Iterable to be converted into a List- Returns:
- a newly created List if this Iterable is not already a List
- Since:
- 2.2.0
-
asReversed
Creates a view list with reversed order, and the order of original list will not change.def list = ["a", 6, true] assert list.asReversed() == [true, 6, "a"] assert list == ["a", 6, true]
- Type Parameters:
T
- the type of element- Parameters:
self
- a list- Returns:
- the reversed list
- Since:
- 4.0.0
-
asString
Get the detail information ofThrowable
instance's stack trace- Parameters:
self
- a Throwable instance- Returns:
- the detail information of stack trace
- Since:
- 2.5.3
-
asSynchronized
Creates a synchronized view of a Map.- Parameters:
self
- a Map- Returns:
- a synchronized Map
- Since:
- 1.0
- See Also:
-
asSynchronized
Creates a synchronized view of a SortedMap.- Parameters:
self
- a SortedMap- Returns:
- a synchronized SortedMap
- Since:
- 1.0
- See Also:
-
asSynchronized
Creates a synchronized view of a Collection.- Parameters:
self
- a Collection- Returns:
- a synchronized Collection
- Since:
- 1.0
- See Also:
-
asSynchronized
Creates a synchronized view of a List.- Parameters:
self
- a List- Returns:
- a synchronized List
- Since:
- 1.0
- See Also:
-
asSynchronized
Creates a synchronized view of a Set.- Parameters:
self
- a Set- Returns:
- a synchronized Set
- Since:
- 1.0
- See Also:
-
asSynchronized
Creates a synchronized view of a SortedSet.- Parameters:
self
- a SortedSet- Returns:
- a synchronized SortedSet
- Since:
- 1.0
- See Also:
-
asType
Converts the given iterable to another type.- Parameters:
iterable
- an Iterableclazz
- the desired class- Returns:
- the object resulting from this type conversion
- Since:
- 2.4.12
- See Also:
-
asType
Converts the given collection to another type. A default concrete type is used for List, Set, or SortedSet. If the given type has a constructor taking a collection, that is used. Otherwise, the call is deferred toasType(Object,Class)
. If this collection is already of the given type, the same instance is returned.- Parameters:
col
- a collectionclazz
- the desired class- Returns:
- the object resulting from this type conversion
- Since:
- 1.0
- See Also:
-
asType
Coerces the closure to an implementation of the given class. The class is assumed to be an interface or class with a single method definition. The closure is used as the implementation of that single method.- Parameters:
impl
- the implementation of the single methodtype
- the target type- Returns:
- A proxy of the given type which wraps this closure.
- Since:
- 1.0
-
asType
Coerces this map to the given type, using the map's keys as the public method names, and values as the implementation. Typically the value would be a closure which behaves like the method implementation.- Parameters:
map
- this mapclazz
- the target type- Returns:
- a Proxy of the given type, which defers calls to this map's elements.
- Since:
- 1.0
-
asType
Transform this number to the given type, using the 'as' operator. The following types are supported in addition to the defaultasType(java.lang.Object, java.lang.Class)
:- BigDecimal
- BigInteger
- Double
- Float
- Parameters:
self
- this numbertype
- the desired type of the transformed result- Returns:
- an instance of the given type
- Since:
- 1.0
-
asType
Converts a given object to a type. This method is used through the "as" operator and is overloadable as any other operator.- Parameters:
obj
- the object to converttype
- the goal type- Returns:
- the resulting object
- Since:
- 1.0
-
asUnmodifiable
Creates an unmodifiable view of a Map.- Parameters:
self
- a Map- Returns:
- an unmodifiable view of the Map
- Since:
- 2.5.0
- See Also:
-
asUnmodifiable
Creates an unmodifiable view of a SortedMap.- Parameters:
self
- a SortedMap- Returns:
- an unmodifiable view of the SortedMap
- Since:
- 2.5.0
- See Also:
-
asUnmodifiable
Creates an unmodifiable view of a List.def mutable = [1,2,3] def unmodifiable = mutable.asUnmodifiable() try { unmodifiable << 4 assert false } catch (UnsupportedOperationException) { assert true } mutable << 4 assert unmodifiable.size() == 4
- Parameters:
self
- a List- Returns:
- an unmodifiable view of the List
- Since:
- 2.5.0
- See Also:
-
asUnmodifiable
Creates an unmodifiable view of a Set.- Parameters:
self
- a Set- Returns:
- an unmodifiable view of the Set
- Since:
- 2.5.0
- See Also:
-
asUnmodifiable
Creates an unmodifiable view of a SortedSet.- Parameters:
self
- a SortedSet- Returns:
- an unmodifiable view of the SortedSet
- Since:
- 2.5.0
- See Also:
-
asUnmodifiable
Creates an unmodifiable view of a Collection.- Parameters:
self
- a Collection- Returns:
- an unmodifiable view of the Collection
- Since:
- 2.5.0
- See Also:
-
average
Averages the items in an Iterable. This is equivalent to invoking the "plus" method on all items in the Iterable and then dividing by the total count using the "div" method for the resulting sum.assert 3 == [1, 2, 6].average()
- Parameters:
self
- Iterable of values to average- Returns:
- The average of all the items
- Since:
- 3.0.0
- See Also:
-
average
Averages the items from an Iterator. This is equivalent to invoking the "plus" method on all items in the array and then dividing by the total count using the "div" method for the resulting sum. The iterator will become exhausted of elements after determining the average value. While most frequently used with aggregates of numbers,average
will work with any class supportingplus
anddiv
, e.g.:class Stars { int numStars = 0 String toString() { '*' * numStars } Stars plus(Stars other) { new Stars(numStars: numStars + other.numStars) } Stars div(Number divisor) { int newSize = numStars.intdiv(divisor) new Stars(numStars: newSize) } } def stars = [new Stars(numStars: 1), new Stars(numStars: 3)] assert stars*.toString() == ['*', '***'] assert stars.average().toString() == '**'
- Parameters:
self
- an Iterator for the values to average- Returns:
- The average of all the items
- Since:
- 3.0.0
-
average
public static <T> Object average(Iterable<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Averages the result of applying a closure to each item of an Iterable.iter.average(closure)
is equivalent to:iter.collect(closure).average()
.assert 20 == [1, 3].average { it * 10 } assert 3 == ['to', 'from'].average { it.size() }
- Parameters:
self
- an Iterableclosure
- a single parameter closure that returns a (typically) numeric value.- Returns:
- The average of the values returned by applying the closure to each item of the Iterable.
- Since:
- 3.0.0
-
average
public static <T> Object average(Iterator<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Averages the result of applying a closure to each item returned from an iterator.iter.average(closure)
is equivalent to:iter.collect(closure).average()
. The iterator will become exhausted of elements after determining the average value.- Parameters:
self
- An Iteratorclosure
- a single parameter closure that returns a (typically) numeric value.- Returns:
- The average of the values returned by applying the closure to each item from the Iterator.
- Since:
- 3.0.0
-
bitwiseNegate
Bitwise NEGATE a BitSet.- Parameters:
self
- a BitSet- Returns:
- the bitwise NEGATE of the BitSet
- Since:
- 1.5.0
-
bitwiseNegate
Bitwise NEGATE a Number.- Parameters:
left
- a Number- Returns:
- the bitwise NEGATE of the Number
- Since:
- 2.2.0
-
buffered
Returns aBufferedIterator
that allows examining the next element without consuming it.assert [1, 2, 3, 4].iterator().buffered().with { [head(), toList()] } == [1, [1, 2, 3, 4]]
- Parameters:
self
- an iterator object- Returns:
- a BufferedIterator wrapping self
- Since:
- 2.5.0
-
bufferedIterator
Returns aBufferedIterator
that allows examining the next element without consuming it.assert new LinkedHashSet([1,2,3,4]).bufferedIterator().with { [head(), toList()] } == [1, [1,2,3,4]]
- Parameters:
self
- an iterable object- Returns:
- a BufferedIterator for traversing self
- Since:
- 2.5.0
-
bufferedIterator
Returns aBufferedIterator
that allows examining the next element without consuming it.assert [1, 2, 3, 4].bufferedIterator().with { [head(), toList()] } == [1, [1, 2, 3, 4]]
- Parameters:
self
- a list- Returns:
- a BufferedIterator for traversing self
- Since:
- 2.5.0
-
chop
Chops the Iterable into pieces, returning lists with sizes corresponding to the supplied chop sizes. If the Iterable isn't large enough, truncated (possibly empty) pieces are returned. Using a chop size of -1 will cause that piece to contain all remaining items from the Iterable.Example usage:
assert [1, 2, 3, 4].chop(1) == [[1]] assert [1, 2, 3, 4].chop(1,-1) == [[1], [2, 3, 4]] assert ('a'..'h').chop(2, 4) == [['a', 'b'], ['c', 'd', 'e', 'f']] assert ['a', 'b', 'c', 'd', 'e'].chop(3) == [['a', 'b', 'c']] assert ['a', 'b', 'c', 'd', 'e'].chop(1, 2, 3) == [['a'], ['b', 'c'], ['d', 'e']] assert ['a', 'b', 'c', 'd', 'e'].chop(1, 2, 3, 3, 3) == [['a'], ['b', 'c'], ['d', 'e'], [], []]
- Parameters:
self
- an Iterable to be choppedchopSizes
- the sizes for the returned pieces- Returns:
- a list of lists chopping the original iterable into pieces determined by chopSizes
- Since:
- 2.5.2
- See Also:
-
chop
Chops the iterator items into pieces, returning lists with sizes corresponding to the supplied chop sizes. If the iterator is exhausted early, truncated (possibly empty) pieces are returned. Using a chop size of -1 will cause that piece to contain all remaining items from the iterator.- Parameters:
self
- an Iterator to be choppedchopSizes
- the sizes for the returned pieces- Returns:
- a list of lists chopping the original iterator elements into pieces determined by chopSizes
- Since:
- 2.5.2
-
collate
Collates this iterable into sub-lists of lengthsize
. Example:def list = [ 1, 2, 3, 4, 5, 6, 7 ] def coll = list.collate( 3 ) assert coll == [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7 ] ]
- Parameters:
self
- an Iterablesize
- the length of each sub-list in the returned list- Returns:
- a List containing the data collated into sub-lists
- Since:
- 2.4.0
-
collate
Collates this iterable into sub-lists of lengthsize
stepping through the codestep
elements for each subList. Example:def list = [ 1, 2, 3, 4 ] def coll = list.collate( 3, 1 ) assert coll == [ [ 1, 2, 3 ], [ 2, 3, 4 ], [ 3, 4 ], [ 4 ] ]
- Parameters:
self
- an Iterablesize
- the length of each sub-list in the returned liststep
- the number of elements to step through for each sub-list- Returns:
- a List containing the data collated into sub-lists
- Since:
- 2.4.0
-
collate
Collates this iterable into sub-lists of lengthsize
. Any remaining elements in the iterable after the subdivision will be dropped ifkeepRemainder
is false. Example:def list = [ 1, 2, 3, 4, 5, 6, 7 ] def coll = list.collate( 3, false ) assert coll == [ [ 1, 2, 3 ], [ 4, 5, 6 ] ]
- Parameters:
self
- an Iterablesize
- the length of each sub-list in the returned listkeepRemainder
- if true, any remaining elements are returned as sub-lists. Otherwise they are discarded- Returns:
- a List containing the data collated into sub-lists
- Since:
- 2.4.0
-
collate
public static <T> List<List<T>> collate(Iterable<T> self, int size, int step, boolean keepRemainder) Collates this iterable into sub-lists of lengthsize
stepping through the codestep
elements for each sub-list. Any remaining elements in the iterable after the subdivision will be dropped ifkeepRemainder
is false. Example:def list = [ 1, 2, 3, 4 ] assert list.collate( 2, 2, true ) == [ [ 1, 2 ], [ 3, 4 ] ] assert list.collate( 3, 1, true ) == [ [ 1, 2, 3 ], [ 2, 3, 4 ], [ 3, 4 ], [ 4 ] ] assert list.collate( 3, 1, false ) == [ [ 1, 2, 3 ], [ 2, 3, 4 ] ]
- Parameters:
self
- an Iterablesize
- the length of each sub-list in the returned liststep
- the number of elements to step through for each sub-listkeepRemainder
- if true, any remaining elements are returned as sub-lists. Otherwise they are discarded- Returns:
- a List containing the data collated into sub-lists
- Throws:
IllegalArgumentException
- if the step is zero.- Since:
- 2.4.0
-
collect
Iterates through this aggregate Object transforming each item into a new value using Closure.IDENTITY as a transformer, basically returning a list of items copied from the original object.def obj = new Object(); assert obj.collect() == [obj]
- Parameters:
self
- an aggregate Object with an Iterator returning its items- Returns:
- a Collection of the transformed values
- Since:
- 1.8.5
- See Also:
-
collect
Iterates through this aggregate Object transforming each item into a new value using thetransform
closure, returning a list of transformed values.def list = [1, 'a', 1.23, true ] def types = list.collect { it.class } assert types == [Integer, String, BigDecimal, Boolean]
- Parameters:
self
- an aggregate Object with an Iterator returning its itemstransform
- the closure used to transform each item of the aggregate object- Returns:
- a List of the transformed values
- Since:
- 1.0
-
collect
public static <T,C extends Collection<T>> C collect(Object self, C collector, Closure<? extends T> transform) Iterates through this aggregate Object transforming each item into a new value using thetransform
closure and adding it to the suppliedcollector
.- Parameters:
self
- an aggregate Object with an Iterator returning its itemscollector
- the Collection to which the transformed values are addedtransform
- the closure used to transform each item of the aggregate object- Returns:
- the collector with all transformed values added to it
- Since:
- 1.0
-
collect
public static <E,T> List<T> collect(Iterator<E> self, @ClosureParams(FirstGenericType.class) Closure<T> transform) Iterates through this Iterator transforming each item into a new value using thetransform
closure, returning a list of transformed values.- Parameters:
self
- an Iteratortransform
- the closure used to transform each item- Returns:
- a List of the transformed values
- Since:
- 2.5.0
-
collect
public static <E,T, C collectC extends Collection<T>> (Iterator<E> self, C collector, @ClosureParams(FirstGenericType.class) Closure<? extends T> transform) Iterates through this Iterator transforming each item into a new value using thetransform
closure and adding it to the suppliedcollector
.assert [1,2,3].iterator().collect() == [1,2,3]
- Parameters:
self
- an Iteratorcollector
- the Collection to which the transformed values are addedtransform
- the closure used to transform each item- Returns:
- the collector with all transformed values added to it
- Since:
- 2.5.0
-
collect
Iterates through this collection transforming each entry into a new value using Closure.IDENTITY as a transformer, basically returning a list of items copied from the original collection.assert [1,2,3].collect() == [1,2,3]
- Parameters:
self
- an Iterable- Returns:
- a List of the transformed values
- Since:
- 2.5.0
- See Also:
-
collect
public static <E,T> List<T> collect(Iterable<E> self, @ClosureParams(FirstGenericType.class) Closure<T> transform) Iterates through this Iterable transforming each entry into a new value using thetransform
closure returning a list of transformed values.assert [1,2,3].collect { it * 2 } == [2,4,6]
- Parameters:
self
- an Iterabletransform
- the closure used to transform each item of the collection- Returns:
- a List of the transformed values
- Since:
- 2.5.0
-
collect
public static <E,T, C collectC extends Collection<T>> (Iterable<E> self, C collector, @ClosureParams(FirstGenericType.class) Closure<? extends T> transform) Iterates through this collection transforming each value into a new value using thetransform
closure and adding it to the suppliedcollector
.assert [2,4,5,6].collect(new HashSet()) { (int)(it / 2) } == [1,2,3] as Set
- Parameters:
self
- an Iterablecollector
- the Collection to which the transformed values are addedtransform
- the closure used to transform each item- Returns:
- the collector with all transformed values added to it
- Since:
- 2.5.0
-
collect
public static <T,K, C collectV, C extends Collection<T>> (Map<K, V> self, C collector, @ClosureParams(MapEntryOrKeyValue.class) Closure<? extends T> transform) Iterates through this Map transforming each map entry into a new value using thetransform
closure returning thecollector
with all transformed values added to it.assert [a:1, b:2].collect(new HashSet()) { key, value -> key * value } == ["a", "bb"] as Set assert [3:20, 2:30].collect(new HashSet()) { entry -> entry.key * entry.value } == [60] as Set
- Parameters:
self
- a Mapcollector
- the Collection to which transformed values are addedtransform
- the transformation closure which can take one (Map.Entry) or two (key, value) parameters- Returns:
- the collector with all transformed values added to it
- Since:
- 1.0
-
collect
public static <T,K, List<T> collectV> (Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<T> transform) Iterates through this Map transforming each map entry into a new value using thetransform
closure returning a list of transformed values.assert [a:1, b:2].collect { key, value -> key * value } == ["a", "bb"] assert [3:20, 2:30].collect { entry -> entry.key * entry.value } == [60, 60]
- Parameters:
self
- a Maptransform
- the transformation closure which can take one (Map.Entry) or two (key, value) parameters- Returns:
- the resultant list of transformed values
- Since:
- 1.0
-
collectEntries
public static <K,V, Map<K,X, Y> V> collectEntries(Map<X, Y> self, Map<K, V> collector, @ClosureParams(MapEntryOrKeyValue.class) Closure<?> transform) Iterates through this Map transforming each map entry using thetransform
closure returning a map of the transformed entries.assert [a:1, b:2].collectEntries([:]) { k, v -> Map.entry(v, k) } == [1:'a', 2:'b'] assert [a:1, b:2].collectEntries([30:'C']) { key, value -> [(value*10): key.toUpperCase()] } == [10:'A', 20:'B', 30:'C']
Note: When using the list-style of result, the behavior is 'def (key, value) = listResultFromClosure
'. While we strongly discourage using a list of size other than 2, Groovy's normal semantics apply in this case; throwing away elements after the second one and using null for the key or value for the case of a shortened list. If your collector Map doesn't support null keys or values, you might get a runtime error, e.g. NullPointerException or IllegalArgumentException.- Parameters:
self
- a Mapcollector
- the Map into which the transformed entries are puttransform
- the closure used for transforming, which can take one (Map.Entry) or two (key, value) parameters and should return a Map.Entry, a Map or a two-element list containing the resulting key and value- Returns:
- the collector with all transformed values added to it
- Since:
- 1.7.9
- See Also:
-
collectEntries
public static <K,V, Map<K,X, Y> V> collectEntries(Map<X, Y> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<?> transform) Iterates through this Map transforming each entry using thetransform
closure and returning a map of the transformed entries.assert [a:1, b:2].collectEntries { key, value -> [value, key] } == [1:'a', 2:'b'] assert [a:1, b:2].collectEntries { key, value -> [(value*10): key.toUpperCase()] } == [10:'A', 20:'B']
Note: When using the list-style of result, the behavior is 'def (key, value) = listResultFromClosure
'. While we strongly discourage using a list of size other than 2, Groovy's normal semantics apply in this case; throwing away elements after the second one and using null for the key or value for the case of a shortened list. If your Map doesn't support null keys or values, you might get a runtime error, e.g. NullPointerException or IllegalArgumentException.- Parameters:
self
- a Maptransform
- the closure used for transforming, which can take one (Map.Entry) or two (key, value) parameters and should return a Map.Entry, a Map or a two-element list containing the resulting key and value- Returns:
- a Map of the transformed entries
- Since:
- 1.7.9
- See Also:
-
collectEntries
public static <K,V, Map<K,E> V> collectEntries(Iterator<E> self, @ClosureParams(FirstGenericType.class) Closure<?> transform) A variant of collectEntries for Iterators.- Parameters:
self
- an Iteratortransform
- the closure used for transforming, which has an item from self as the parameter and should return a Map.Entry, a Map or a two-element list containing the resulting key and value- Returns:
- a Map of the transformed entries
- Since:
- 1.8.7
- See Also:
-
collectEntries
public static <K,V, Map<K,E> V> collectEntries(Iterable<E> self, @ClosureParams(FirstGenericType.class) Closure<?> transform) Iterates through this Iterable transforming each item using thetransform
closure and returning a map of the resulting transformed entries.def letters = "abc" // collect letters with index using list style assert (0..2).collectEntries { index -> [index, letters[index]] } == [0:'a', 1:'b', 2:'c'] // collect letters with index using map style assert (0..2).collectEntries { index -> [(index): letters[index]] } == [0:'a', 1:'b', 2:'c']
Note: When using the list-style of result, the behavior is 'def (key, value) = listResultFromClosure
'. While we strongly discourage using a list of size other than 2, Groovy's normal semantics apply in this case; throwing away elements after the second one and using null for the key or value for the case of a shortened list.- Parameters:
self
- an Iterabletransform
- the closure used for transforming, which has an item from self as the parameter and should return a Map.Entry, a Map or a two-element list containing the resulting key and value- Returns:
- a Map of the transformed entries
- Since:
- 1.8.7
- See Also:
-
collectEntries
A variant of collectEntries for Iterators using the identity closure as the transform.- Parameters:
self
- an Iterator- Returns:
- a Map of the transformed entries
- Since:
- 1.8.7
- See Also:
-
collectEntries
A variant of collectEntries for Iterable objects using the identity closure as the transform. The source Iterable should contain a list of[key, value]
tuples orMap.Entry
objects.def nums = [1, 10, 100, 1000] def tuples = nums.collect{ [it, it.toString().size()] } assert tuples == [[1, 1], [10, 2], [100, 3], [1000, 4]] def map = tuples.collectEntries() assert map == [1:1, 10:2, 100:3, 1000:4]
- Parameters:
self
- an Iterable- Returns:
- a Map of the transformed entries
- Since:
- 1.8.7
- See Also:
-
collectEntries
public static <K,V, Map<K,E> V> collectEntries(Iterator<E> self, Map<K, V> collector, @ClosureParams(FirstGenericType.class) Closure<?> transform) A variant of collectEntries for Iterators using a supplied map as the destination of transformed entries.- Parameters:
self
- an Iteratorcollector
- the Map into which the transformed entries are puttransform
- the closure used for transforming, which has an item from self as the parameter and should return a Map.Entry, a Map or a two-element list containing the resulting key and value- Returns:
- the collector with all transformed values added to it
- Since:
- 1.8.7
-
collectEntries
public static <K,V, Map<K,E> V> collectEntries(Iterator<E> self, Map<K, V> collector, Function<? super E, K> keyTransform, Function<? super E, V> valueTransform) A variant of collectEntries for Iterators with separate functions for transforming the keys and values. The supplied collector map is used as the destination for transformed entries.- Parameters:
self
- an Iteratorcollector
- the Map into which the transformed entries are putkeyTransform
- a function for transforming Iterator elements into keysvalueTransform
- a function for transforming Iterator elements into values- Returns:
- the collector with all transformed values added to it
- Since:
- 5.0.0
-
collectEntries
public static <K,V, Map<K,E> V> collectEntries(Iterator<E> self, Function<? super E, K> keyTransform, Function<? super E, V> valueTransform) A variant of collectEntries for Iterators with separate functions for transforming the keys and values.- Parameters:
self
- an IteratorkeyTransform
- a function for transforming Iterator elements into keysvalueTransform
- a function for transforming Iterator elements into values- Returns:
- a Map of the transformed entries
- Since:
- 5.0.0
-
collectEntries
public static <K,V, Map<K,E> V> collectEntries(Iterable<E> self, Map<K, V> collector, Function<? super E, K> keyTransform, Function<? super E, V> valueTransform) A variant of collectEntries for Iterables with separate functions for transforming the keys and values. The supplied collector map is used as the destination for transformed entries.def languages = ['Groovy', 'Java', 'Kotlin', 'Scala'] assert languages.collectEntries([clojure:7], String::toLowerCase, String::size) == [clojure:7, groovy:6, java:4, kotlin:6, scala:5]
- Parameters:
self
- an Iterablecollector
- the Map into which the transformed entries are putkeyTransform
- a function for transforming Iterable elements into keysvalueTransform
- a function for transforming Iterable elements into values- Returns:
- the collector with all transformed values added to it
- Since:
- 5.0.0
-
collectEntries
public static <K,V, Map<K,E> V> collectEntries(Iterable<E> self, Function<? super E, K> keyTransform, Function<? super E, V> valueTransform) A variant of collectEntries for Iterables with separate functions for transforming the keys and values.def languages = ['Groovy', 'Java', 'Kotlin', 'Scala'] assert languages.collectEntries(String::toLowerCase, String::size) == [groovy:6, java:4, kotlin:6, scala:5]
- Parameters:
self
- an IterablekeyTransform
- a function for transforming Iterable elements into keysvalueTransform
- a function for transforming Iterable elements into values- Returns:
- a Map of the transformed entries
- Since:
- 5.0.0
-
collectEntries
public static <K,V, Map<K,X, Y> V> collectEntries(Map<X, Y> self, Map<K, V> collector, Function<? super X, K> keyTransform, Function<? super Y, V> valueTransform) A variant of collectEntries for Maps with separate functions for transforming the keys and values. The supplied collector map is used as the destination for transformed entries.- Parameters:
self
- a Mapcollector
- the Map into which the transformed entries are putkeyTransform
- a function for transforming Map keysvalueTransform
- a function for transforming Map values- Returns:
- the collector with all transformed values added to it
- Since:
- 5.0.0
-
collectEntries
public static <K,V, Map<K,X, Y> V> collectEntries(Map<X, Y> self, Function<? super X, K> keyTransform, Function<? super Y, V> valueTransform) A variant of collectEntries for Maps with separate functions for transforming the keys and values.- Parameters:
self
- a MapkeyTransform
- a function for transforming Map keysvalueTransform
- a function for transforming Map values- Returns:
- a Map of the transformed entries
- Since:
- 5.0.0
-
collectEntries
public static <K,V, Map<K,E> V> collectEntries(Iterable<E> self, Map<K, V> collector, @ClosureParams(FirstGenericType.class) Closure<?> transform) Iterates through this Iterable transforming each item using the closure as a transformer into a map entry, returning the supplied map with all the transformed entries added to it.def letters = "abc" // collect letters with index assert (0..2).collectEntries( [:] ) { index -> [index, letters[index]] } == [0:'a', 1:'b', 2:'c'] assert (0..2).collectEntries( [4:'d'] ) { index -> [(index+1): letters[index]] } == [1:'a', 2:'b', 3:'c', 4:'d']
Note: When using the list-style of result, the behavior is 'def (key, value) = listResultFromClosure
'. While we strongly discourage using a list of size other than 2, Groovy's normal semantics apply in this case; throwing away elements after the second one and using null for the key or value for the case of a shortened list. If your collector Map doesn't support null keys or values, you might get a runtime error, e.g. NullPointerException or IllegalArgumentException.- Parameters:
self
- an Iterablecollector
- the Map into which the transformed entries are puttransform
- the closure used for transforming, which has an item from self as the parameter and should return a Map.Entry, a Map or a two-element list containing the resulting key and value- Returns:
- the collector with all transformed values added to it
- Since:
- 1.8.7
- See Also:
-
collectEntries
A variant of collectEntries for Iterators using the identity closure as the transform and a supplied map as the destination of transformed entries.- Parameters:
self
- an Iteratorcollector
- the Map into which the transformed entries are put- Returns:
- the collector with all transformed values added to it
- Since:
- 1.8.7
- See Also:
-
collectEntries
A variant of collectEntries for Iterables using the identity closure as the transform and a supplied map as the destination of transformed entries.- Parameters:
self
- an Iterablecollector
- the Map into which the transformed entries are put- Returns:
- the collector with all transformed values added to it
- Since:
- 1.8.7
- See Also:
-
collectKeys
public static <K,V> Map<K,V> collectKeys(Map<K, V> keys, Map<K, V> collector, Function<? super K, K> keyTransform) Transform a Maps' keys leaving the values unchanged. Similar towithCollectedKeys(Iterable, Map, Function)
but for Maps.def lengths = [Groovy:6, Java:4, Kotlin:6, Scala:5] def firstLetter = (s) -> s[0] assert lengths.collectKeys([C:7], firstLetter) == [C:7, G:6, J:4, K:6, S:5]
- Parameters:
keys
- a Mapcollector
- the Map into which the transformed entries are putkeyTransform
- a function for transforming Map keys- Returns:
- the collector with all transformed values added to it
- Since:
- 5.0.0
-
collectKeys
Transform a Maps' keys leaving the values unchanged. Similar towithCollectedKeys(Iterable, Function)
but for Maps.def lengths = [Groovy:6, Java:4, Kotlin:6, Scala:5] def firstLetter = (s) -> s[0] assert lengths.collectKeys(firstLetter) == [G:6, J:4, K:6, S:5]
- Parameters:
keys
- a MapkeyTransform
- a function for transforming Map keys- Returns:
- a Map of the transformed entries
- Since:
- 5.0.0
-
collectMany
public static <T,E> List<T> collectMany(Iterable<E> self, @ClosureParams(FirstGenericType.class) Closure<? extends Collection<? extends T>> projection) Projects each item from a source Iterable to a collection and concatenates (flattens) the resulting collections into a single list.def nums = 1..10 def squaresAndCubesOfEvens = nums.collectMany{ it % 2 ? [] : [it**2, it**3] } assert squaresAndCubesOfEvens == [4, 8, 16, 64, 36, 216, 64, 512, 100, 1000] def animals = ['CAT', 'DOG', 'ELEPHANT'] as Set def smallAnimals = animals.collectMany{ it.size()
>
3 ? [] : [it.toLowerCase()] } assert smallAnimals == ['cat', 'dog'] def orig = nums as Set def origPlusIncrements = orig.collectMany{ [it, it+1] } assert origPlusIncrements.size() == orig.size() * 2 assert origPlusIncrements.unique().size() == orig.size() + 1- Parameters:
self
- an Iterableprojection
- a projecting Closure returning a collection of items- Returns:
- a list created from the projected collections concatenated (flattened) together
- Since:
- 2.2.0
- See Also:
-
collectMany
public static <T,E, C collectManyC extends Collection<T>> (Iterable<E> self, C collector, @ClosureParams(FirstGenericType.class) Closure<? extends Collection<? extends T>> projection) Projects each item from a source collection to a result collection and concatenates (flattens) the resulting collections adding them into thecollector
.def animals = ['CAT', 'DOG', 'ELEPHANT'] def smallAnimals = animals.collectMany(['ant', 'bee']){ it.size() > 3 ? [] : [it.toLowerCase()] } assert smallAnimals == ['ant', 'bee', 'cat', 'dog'] def nums = 1..5 def origPlusIncrements = nums.collectMany([] as Set){ [it, it+1] } assert origPlusIncrements.size() == nums.size() + 1 @groovy.transform.TypeChecked void test() { LinkedHashSet<String> lhs = ['abc','def'].collectMany(new LinkedHashSet<>()){ it.iterator().collect() } assert lhs == ['a','b','c','d','e','f'] as Set<String> } test()
- Parameters:
self
- an Iterablecollector
- an initial collection to add the projected items toprojection
- a projecting Closure returning a collection of items- Returns:
- the collector with the projected collections concatenated (flattened) into it
- Since:
- 2.2.0
-
collectMany
public static <T,K, C collectManyV, C extends Collection<T>> (Map<K, V> self, C collector, @ClosureParams(MapEntryOrKeyValue.class) Closure<? extends Collection<? extends T>> projection) Projects each item from a source map to a result collection and concatenates (flattens) the resulting collections adding them into thecollector
.def map = [bread:3, milk:5, butter:2] def result = map.collectMany(['x']){ k, v
->
if (k.startsWith('b')) k.toList() } assert result == ['x', 'b', 'r', 'e', 'a', 'd', 'b', 'u', 't', 't', 'e', 'r']- Parameters:
self
- a mapcollector
- an initial collection to add the projected items toprojection
- a projecting Closure returning a collection of items- Returns:
- the collector with the projected collections concatenated (flattened) to it
- Since:
- 1.8.8
-
collectMany
public static <T,K, List<T> collectManyV> (Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<? extends Collection<? extends T>> projection) Projects each item from a source map to a result collection and concatenates (flattens) the resulting collections adding them into a collection.def map = [bread:3, milk:5, butter:2] def result = map.collectMany{ k, v
->
k.startsWith('b') ? k.toList() : [] } assert result == ['b', 'r', 'e', 'a', 'd', 'b', 'u', 't', 't', 'e', 'r']- Parameters:
self
- a mapprojection
- a projecting Closure returning a collection of items- Returns:
- a list created from the projected collections concatenated (flattened) together
- Since:
- 1.8.8
-
collectMany
public static <T,E, C collectManyC extends Collection<T>> (Iterator<E> self, C collector, @ClosureParams(FirstGenericType.class) Closure<? extends Collection<? extends T>> projection) Projects each item from a source iterator to a collection and concatenates (flattens) the resulting collections into a single list.def numsIter = [1, 2, 3, 4, 5, 6].iterator() def squaresAndCubesOfEvens = numsIter.collectMany{ if (it % 2 == 0) [it**2, it**3] } assert squaresAndCubesOfEvens == [4, 8, 16, 64, 36, 216]
var letters = 'a'..'z' var pairs = letters.collectMany{ a -> letters.collectMany{ b -> if (a != b) ["$a$b"] } } assert pairs.join(',').matches('ab,ac,ad,.*,zw,zx,zy')
- Parameters:
self
- an iteratorcollector
- an initial collection to add the projected items toprojection
- a projecting Closure returning a collection of items- Returns:
- the collector with the projected collections concatenated (flattened) to it
- Since:
- 1.8.1
- See Also:
-
collectMany
public static <T,E> List<T> collectMany(Iterator<E> self, @ClosureParams(FirstGenericType.class) Closure<? extends Collection<? extends T>> projection) Projects each item from a source iterator to a collection and concatenates (flattens) the resulting collections into a single list.def numsIter = [1, 2, 3, 4, 5, 6].iterator() def squaresAndCubesOfEvens = numsIter.collectMany{ it % 2 ? [] : [it**2, it**3] } assert squaresAndCubesOfEvens == [4, 8, 16, 64, 36, 216]
- Parameters:
self
- an iteratorprojection
- a projecting Closure returning a collection of items- Returns:
- a list created from the projected collections concatenated (flattened) together
- Since:
- 1.8.1
- See Also:
-
collectNested
Recursively iterates through this collection transforming each non-Collection value into a new value using the closure as a transformer. Returns a potentially nested list of transformed values.assert [2,[4,6],[8],[]] == [1,[2,3],[4],[]].collectNested { it * 2 }
- Parameters:
self
- a collectiontransform
- the closure used to transform each item of the collection- Returns:
- the resultant collection
- Since:
- 1.8.1
-
collectNested
Recursively iterates through this Iterable transforming each non-Collection value into a new value using the closure as a transformer. Returns a potentially nested list of transformed values.assert [2,[4,6],[8],[]] == [1,[2,3],[4],[]].collectNested { it * 2 }
- Parameters:
self
- an Iterabletransform
- the closure used to transform each item of the Iterable- Returns:
- the resultant list
- Since:
- 2.2.0
-
collectNested
Recursively iterates through this Iterable transforming each non-Collection value into a new value using thetransform
closure. Returns a potentially nested collection of transformed values.def x = [1,[2,3],[4],[]].collectNested(new Vector()) { it * 2 } assert x == [2,[4,6],[8],[]] assert x instanceof Vector
- Parameters:
self
- an Iterablecollector
- an initial Collection to which the transformed values are addedtransform
- the closure used to transform each element of the Iterable- Returns:
- the collector with all transformed values added to it
- Since:
- 2.2.0
-
collectValues
public static <K,V> Map<K,V> collectValues(Map<K, V> keys, Map<K, V> collector, Function<? super V, V> valueTransform) Transform a Maps' values leaving the keys unchanged. Similar towithCollectedValues(Iterable, Map, Function)
but for Maps.def lengths = [Groovy:6, Java:4, Kotlin:6, Scala:5] def squared = (e) -> e ** 2 assert lengths.collectValues([Clojure:49], squared) == [Clojure:49, Groovy:36, Java:16, Kotlin:36, Scala:25]
- Parameters:
keys
- a Mapcollector
- the Map into which the transformed entries are putvalueTransform
- a function for transforming Map values- Returns:
- the collector with all transformed values added to it
- Since:
- 5.0.0
-
collectValues
Transform a Maps' values leaving the keys unchanged. Similar towithCollectedValues(Iterable, Function)
but for Maps.def lengths = [Groovy:6, Java:4, Kotlin:6, Scala:5] def squared = (e) -> e ** 2 assert lengths.collectValues(squared) == [Groovy:36, Java:16, Kotlin:36, Scala:25]
- Parameters:
keys
- a MapvalueTransform
- a function for transforming Map values- Returns:
- a Map of the transformed entries
- Since:
- 5.0.0
-
combinations
Finds all combinations of items from the given aggregate of collections.Example usage:
result = [['a', 'b'], [1, 2, 3]].combinations() assert result == [['a', 1], ['b', 1], ['a', 2], ['b', 2], ['a', 3], ['b', 3]]
- Parameters:
self
- an iterable of collections- Returns:
- A list of the combinations (lists).
- Since:
- 2.2.0
- See Also:
-
combinations
public static <T> List<T> combinations(Iterable self, @ClosureParams(value=FromString.class,options="List") Closure<T> function) Finds all combinations of items from the given aggregate of collections, then returns the results of the supplied transform.Example usage:
result = [[2, 3], [4, 5, 6]].combinations { x,y
->
x*y } assert result == [8, 12, 10, 15, 12, 18]- Parameters:
self
- an iterable of collectionsfunction
- a closure to be called on each combination (list)- Returns:
- A list of the results of applying the closure to each combination.
- Since:
- 2.2.0
- See Also:
-
compareTo
Compares a Character and a Number. The ordinal value of the Character is used in the comparison (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Characterright
- a Number- Returns:
- the result of the comparison
- Since:
- 1.0
-
compareTo
Compares a Number and a Character. The ordinal value of the Character is used in the comparison (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Numberright
- a Character- Returns:
- the result of the comparison
- Since:
- 1.0
-
compareTo
Compares two Characters. The ordinal values of the Characters are compared (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Characterright
- a Character- Returns:
- the result of the comparison
- Since:
- 1.0
-
compareTo
Compares two Numbers. Equality (==) for numbers dispatches to this.- Parameters:
left
- a Numberright
- another Number to compare to- Returns:
- the comparison of both numbers
- Since:
- 1.0
-
contains
Returns true if this iterable contains the item.- Parameters:
self
- an Iterable to be checked for containmentitem
- an Object to be checked for containment in this iterable- Returns:
- true if this iterable contains the item
- Since:
- 2.4.0
- See Also:
-
containsAll
Returns true if this iterable contains all the elements in the specified array.- Parameters:
self
- an Iterable to be checked for containmentitems
- array to be checked for containment in this iterable- Returns:
- true if this collection contains all the elements in the specified array
- Since:
- 2.4.0
- See Also:
-
count
Counts the number of occurrences of the given value from the items within this Iterator. Comparison is done using Groovy's == operator (usingcompareTo(value) == 0
orequals(value)
). The iterator will become exhausted of elements after determining the count value.- Parameters:
self
- the Iterator from which we count the number of matching occurrencesvalue
- the value being searched for- Returns:
- the number of occurrences
- Since:
- 1.5.0
-
count
public static <T> Number count(Iterator<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Counts the number of occurrences which satisfy the given closure from the items within this Iterator. The iterator will become exhausted of elements after determining the count value.Example usage:
assert [2,4,2,1,3,5,2,4,3].toSet().iterator().count{ it % 2 == 0 } == 2
- Parameters:
self
- the Iterator from which we count the number of matching occurrencesclosure
- a closure condition- Returns:
- the number of occurrences
- Since:
- 1.8.0
-
count
public static <T,E extends Number> E count(Iterator<T> self, E initialCount, @ClosureParams(FirstGenericType.class) Closure closure) Counts the number of occurrences which satisfy the given closure from the items within this Iterator, adding the count to the initial count. The iterator will become exhausted of elements after determining the count value.Example usage:
assert [2,4,2,1,3,5,2,4,3].toSet().iterator().count(100){ it % 2 == 0 } == 102
- Parameters:
self
- the Iterator from which we count the number of matching occurrencesinitialCount
- start counting from this valueclosure
- a closure condition- Returns:
- the number of occurrences
- Since:
- 4.0.14
-
count
Counts the number of occurrences of the given value inside this Iterable. Comparison is done using Groovy's == operator (usingcompareTo(value) == 0
orequals(value)
).Example usage:
assert [2,4,2,1,3,5,2,4,3].count(4) == 2
- Parameters:
self
- the Iterable within which we count the number of occurrencesvalue
- the value being searched for- Returns:
- the number of occurrences
- Since:
- 2.2.0
-
count
public static <T> Number count(Iterable<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Counts the number of occurrences which satisfy the given closure from inside this Iterable.Example usage:
assert [2,4,2,1,3,5,2,4,3].count{ it % 2 == 0 } == 5
- Parameters:
self
- the Iterable within which we count the number of occurrencesclosure
- a closure condition- Returns:
- the number of occurrences
- Since:
- 2.2.0
-
count
public static <T,E extends Number> E count(Iterable<T> self, E initialCount, @ClosureParams(FirstGenericType.class) Closure closure) Counts the number of occurrences which satisfy the given closure from inside this Iterable.Example usage:
assert [2,4,2,1,3,5,2,4,3].count(100L){ it % 2 == 0 } == 105L
- Parameters:
self
- the Iterable within which we count the number of occurrencesinitialCount
- start counting from this valueclosure
- a closure condition- Returns:
- the number of occurrences
- Since:
- 4.0.14
-
count
public static <K,V> Number count(Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<?> closure) Counts the number of occurrences which satisfy the given closure from inside this map. If the closure takes one parameter then it will be passed the Map.Entry. Otherwise, the closure should take two parameters and will be passed the key and value.Example usage:
assert [a:1, b:1, c:2, d:2].count{ k,v
->
k == 'a'||
v == 2 } == 3- Parameters:
self
- the map within which we count the number of occurrencesclosure
- a 1 or 2 arg Closure condition applying on the entries- Returns:
- the number of occurrences
- Since:
- 1.8.0
-
count
public static <K,V, E countE extends Number> (Map<K, V> self, E initialCount, @ClosureParams(MapEntryOrKeyValue.class) Closure<?> closure) Counts the number of occurrences which satisfy the given closure from inside this map. If the closure takes one parameter then it will be passed the Map.Entry. Otherwise, the closure should take two parameters and will be passed the key and value.Example usage:
assert [a:1, b:1, c:2, d:2].count(100G){ k,v
->
k == 'a'||
v == 2 } == 103G- Parameters:
self
- the map within which we count the number of occurrencesinitialCount
- start counting from this valueclosure
- a 1 or 2 arg Closure condition applying on the entries- Returns:
- the number of occurrences
- Since:
- 4.0.14
-
countBy
public static <K,E> Map<K,Integer> countBy(Iterable<E> self, @ClosureParams(FirstGenericType.class) Closure<K> closure) Sorts all collection members into groups determined by the supplied mapping closure and counts the group size. The closure should return the key that each item should be grouped by. The returned Map will have an entry for each distinct key returned from the closure, with each value being the frequency of items occurring for that group.Example usage:
assert [0:2, 1:3] == [1,2,3,4,5].countBy { it % 2 }
- Parameters:
self
- a collection to group and countclosure
- a closure mapping items to the frequency keys- Returns:
- a new Map grouped by keys with frequency counts
- Since:
- 2.2.0
-
countBy
Creates a multiset-like map of the collection members.Example usage:
assert [1:2, 2:2, 3:1] == [1,2,1,2,3].countBy()
- Parameters:
self
- a collection to group and count- Returns:
- a new Map where the keys are the set of values in the collection and the values are the frequency counts
- Since:
- 5.0.0
-
countBy
public static <K,E> Map<K,Integer> countBy(Iterator<E> self, @ClosureParams(FirstGenericType.class) Closure<K> closure) Sorts all iterator items into groups determined by the supplied mapping closure and counts the group size. The closure should return the key that each item should be grouped by. The returned Map will have an entry for each distinct key returned from the closure, with each value being the frequency of items occurring for that group.Example usage:
assert [1,2,2,2,3].toSet().iterator().countBy{ it % 2 } == [1:2, 0:1]
- Parameters:
self
- an iterator to group and countclosure
- a closure mapping items to the frequency keys- Returns:
- a new Map grouped by keys with frequency counts
- Since:
- 1.8.0
-
countBy
Creates a multiset-like map of the iterator members.Example usage:
assert [1:2, 2:2, 3:1] == [1,2,1,2,3].iterator().countBy()
- Parameters:
self
- an iterator to group and count- Returns:
- a new Map where the keys are the set of values produced by the iterator and the values are the frequency counts
- Since:
- 5.0.0
-
countBy
public static <K,U, Map<K,V> Integer> countBy(Map<U, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<K> closure) Groups the members of a map into groups determined by the supplied mapping closure and counts the frequency of the created groups. The closure will be passed a Map.Entry or key and value (depending on the number of parameters the closure accepts) and should return the key that each item should be grouped under. The resulting map will have an entry for each 'group' key returned by the closure, with values being the frequency counts for that 'group'.def result = [a:1,b:2,c:3,d:4,e:5].countBy { it.value % 2 } assert result == [0:2, 1:3]
- Parameters:
self
- a map to group and countclosure
- a closure mapping entries to frequency count keys- Returns:
- a new Map grouped by keys with frequency counts
- Since:
- 1.8.0
-
disjoint
Returnstrue
if the intersection of two iterables is empty.assert [1,2,3].disjoint([3,4,5]) == false
assert [1,2].disjoint([3,4]) == true
- Parameters:
left
- an Iterableright
- an Iterable- Returns:
- boolean
true
if the intersection of two iterables is empty,false
otherwise. - Since:
- 2.4.0
-
div
Divide a Character by a Number. The ordinal value of the Character is used in the division (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Characterright
- a Number- Returns:
- the Number corresponding to the division of left by right
- Since:
- 1.0
-
div
Divide a Number by a Character. The ordinal value of the Character is used in the division (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Numberright
- a Character- Returns:
- the Number corresponding to the division of left by right
- Since:
- 1.0
-
div
Divide one Character by another. The ordinal values of the Characters are used in the division (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Characterright
- another Character- Returns:
- the Number corresponding to the division of left by right
- Since:
- 1.0
-
downto
Iterates from this number down to the given number, inclusive, decrementing by one each time.- Parameters:
self
- a Numberto
- another Number to go down toclosure
- the closure to call- Since:
- 1.0
-
downto
Iterates from this number down to the given number, inclusive, decrementing by one each time.- Parameters:
self
- a longto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
downto
Iterates from this number down to the given number, inclusive, decrementing by one each time.- Parameters:
self
- a Longto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
downto
Iterates from this number down to the given number, inclusive, decrementing by one each time.- Parameters:
self
- a floatto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
downto
Iterates from this number down to the given number, inclusive, decrementing by one each time.- Parameters:
self
- a Floatto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
downto
Iterates from this number down to the given number, inclusive, decrementing by one each time.- Parameters:
self
- a doubleto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
downto
Iterates from this number down to the given number, inclusive, decrementing by one each time.- Parameters:
self
- a Doubleto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
downto
public static void downto(BigInteger self, Number to, @ClosureParams(FirstParam.class) Closure closure) Iterates from this number down to the given number, inclusive, decrementing by one each time.- Parameters:
self
- a BigIntegerto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
downto
public static void downto(BigDecimal self, Number to, @ClosureParams(FirstParam.class) Closure closure) Iterates from this number down to the given number, inclusive, decrementing by one each time. Each number is passed to the closure. Example:10.5.downto(0) { println it }
Prints numbers 10.5, 9.5 ... to 0.5.- Parameters:
self
- a BigDecimalto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
drop
Drops the given number of elements from the head of this List.def strings = [ 'a', 'b', 'c' ] as SortedSet assert strings.drop( 0 ) == [ 'a', 'b', 'c' ] as SortedSet assert strings.drop( 2 ) == [ 'c' ] as SortedSet assert strings.drop( 5 ) == [] as SortedSet
- Parameters:
self
- the original SortedSetnum
- the number of elements to drop from this Iterable- Returns:
- a SortedSet consisting of all the elements of this Iterable minus the first
num
elements, or an empty list if it has less thannum
elements. - Since:
- 2.4.0
-
drop
Drops the given number of elements from the head of this List.def strings = [ 'a', 'b', 'c' ] assert strings.drop( 0 ) == [ 'a', 'b', 'c' ] assert strings.drop( 2 ) == [ 'c' ] assert strings.drop( 5 ) == []
- Parameters:
self
- the original Listnum
- the number of elements to drop from this Iterable- Returns:
- a List consisting of all the elements of this Iterable minus the first
num
elements, or an empty list if it has less thannum
elements. - Since:
- 1.8.1
-
drop
Drops the given number of elements from the head of this Iterable.def strings = [ 'a', 'b', 'c' ] assert strings.drop( 0 ) == [ 'a', 'b', 'c' ] assert strings.drop( 2 ) == [ 'c' ] assert strings.drop( 5 ) == [] class AbcIterable implements Iterable
{ Iterator iterator() { "abc".iterator() } } def abc = new AbcIterable() assert abc.drop(0) == ['a', 'b', 'c'] assert abc.drop(1) == ['b', 'c'] assert abc.drop(3) == [] assert abc.drop(5) == [] - Parameters:
self
- the original Iterablenum
- the number of elements to drop from this Iterable- Returns:
- a Collection consisting of all the elements of this Iterable minus the first
num
elements, or an empty list if it has less thannum
elements. - Since:
- 1.8.7
-
drop
Drops the given number of key/value pairs from the head of this map if they are available.def strings = [ 'a':10, 'b':20, 'c':30 ] assert strings.drop( 0 ) == [ 'a':10, 'b':20, 'c':30 ] assert strings.drop( 2 ) == [ 'c':30 ] assert strings.drop( 5 ) == [:]
If the map instance does not have ordered keys, then this function could drop a randomnum
entries. Groovy by default uses LinkedHashMap, so this shouldn't be an issue in the main.- Parameters:
self
- the original mapnum
- the number of elements to drop from this map- Returns:
- a map consisting of all key/value pairs of this map except the first
num
ones, or else the empty map, if this map has less thannum
elements. - Since:
- 1.8.1
-
drop
Drops the given number of elements from the head of this iterator if they are available. The original iterator is stepped along bynum
elements.def iteratorCompare( Iterator a, List b ) { a.collect { it } == b } def iter = [ 1, 2, 3, 4, 5 ].listIterator() assert iteratorCompare( iter.drop( 0 ), [ 1, 2, 3, 4, 5 ] ) iter = [ 1, 2, 3, 4, 5 ].listIterator() assert iteratorCompare( iter.drop( 2 ), [ 3, 4, 5 ] ) iter = [ 1, 2, 3, 4, 5 ].listIterator() assert iteratorCompare( iter.drop( 5 ), [] )
- Parameters:
self
- the original iteratornum
- the number of elements to drop from this iterator- Returns:
- The iterator stepped along by
num
elements if they exist. - Since:
- 1.8.1
-
dropRight
Drops the given number of elements from the tail of this SortedSet.def strings = [ 'a', 'b', 'c' ] as SortedSet assert strings.dropRight( 0 ) == [ 'a', 'b', 'c' ] as SortedSet assert strings.dropRight( 2 ) == [ 'a' ] as SortedSet assert strings.dropRight( 5 ) == [] as SortedSet
- Parameters:
self
- the original SortedSetnum
- the number of elements to drop from this SortedSet- Returns:
- a List consisting of all the elements of this SortedSet minus the last
num
elements, or an empty SortedSet if it has less thannum
elements. - Since:
- 2.4.0
-
dropRight
Drops the given number of elements from the tail of this List.def strings = [ 'a', 'b', 'c' ] assert strings.dropRight( 0 ) == [ 'a', 'b', 'c' ] assert strings.dropRight( 2 ) == [ 'a' ] assert strings.dropRight( 5 ) == []
- Parameters:
self
- the original Listnum
- the number of elements to drop from this List- Returns:
- a List consisting of all the elements of this List minus the last
num
elements, or an empty List if it has less thannum
elements. - Since:
- 2.4.0
-
dropRight
Drops the given number of elements from the tail of this Iterable.def strings = [ 'a', 'b', 'c' ] assert strings.dropRight( 0 ) == [ 'a', 'b', 'c' ] assert strings.dropRight( 2 ) == [ 'a' ] assert strings.dropRight( 5 ) == [] class AbcIterable implements Iterable
{ Iterator iterator() { "abc".iterator() } } def abc = new AbcIterable() assert abc.dropRight(0) == ['a', 'b', 'c'] assert abc.dropRight(1) == ['a', 'b'] assert abc.dropRight(3) == [] assert abc.dropRight(5) == [] - Parameters:
self
- the original Iterablenum
- the number of elements to drop from this Iterable- Returns:
- a Collection consisting of all the elements of this Iterable minus the last
num
elements, or an empty list if it has less thannum
elements. - Since:
- 2.4.0
-
dropRight
Drops the given number of elements from the tail of this Iterator.def getObliterator() { "obliter8".iterator() } assert obliterator.dropRight(-1).toList() == ['o', 'b', 'l', 'i', 't', 'e', 'r', '8'] assert obliterator.dropRight(0).toList() == ['o', 'b', 'l', 'i', 't', 'e', 'r', '8'] assert obliterator.dropRight(1).toList() == ['o', 'b', 'l', 'i', 't', 'e', 'r'] assert obliterator.dropRight(4).toList() == ['o', 'b', 'l', 'i'] assert obliterator.dropRight(7).toList() == ['o'] assert obliterator.dropRight(8).toList() == [] assert obliterator.dropRight(9).toList() == []
- Parameters:
self
- the original Iteratornum
- the number of elements to drop- Returns:
- an Iterator consisting of all the elements of this Iterator minus the last
num
elements, or an empty Iterator if it has less thannum
elements. - Since:
- 2.4.0
-
dropWhile
public static <T> SortedSet<T> dropWhile(SortedSet<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Returns a suffix of this SortedSet where elements are dropped from the front while the given Closure evaluates to true. Similar todropWhile(Iterable, groovy.lang.Closure)
except that it attempts to preserve the type of the original SortedSet.def nums = [ 1, 2, 3 ] as SortedSet assert nums.dropWhile{ it
<
4 } == [] as SortedSet assert nums.dropWhile{ it<
2 } == [ 2, 3 ] as SortedSet assert nums.dropWhile{ it != 3 } == [ 3 ] as SortedSet assert nums.dropWhile{ it == 0 } == [ 1, 2, 3 ] as SortedSet- Parameters:
self
- the original SortedSetcondition
- the closure that must evaluate to true to continue dropping elements- Returns:
- the shortest suffix of the given SortedSet such that the given closure condition evaluates to true for each element dropped from the front of the SortedSet
- Since:
- 2.4.0
-
dropWhile
public static <T> List<T> dropWhile(List<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Returns a suffix of this List where elements are dropped from the front while the given Closure evaluates to true. Similar todropWhile(Iterable, groovy.lang.Closure)
except that it attempts to preserve the type of the original list.def nums = [ 1, 3, 2 ] assert nums.dropWhile{ it
<
4 } == [] assert nums.dropWhile{ it<
3 } == [ 3, 2 ] assert nums.dropWhile{ it != 2 } == [ 2 ] assert nums.dropWhile{ it == 0 } == [ 1, 3, 2 ]- Parameters:
self
- the original listcondition
- the closure that must evaluate to true to continue dropping elements- Returns:
- the shortest suffix of the given List such that the given closure condition evaluates to true for each element dropped from the front of the List
- Since:
- 1.8.7
-
dropWhile
public static <T> Collection<T> dropWhile(Iterable<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Returns a suffix of this Iterable where elements are dropped from the front while the given closure evaluates to true.class HorseIterable implements Iterable
{ Iterator iterator() { "horse".iterator() } } def horse = new HorseIterable() assert horse.dropWhile{ it <
'r' } == ['r', 's', 'e'] assert horse.dropWhile{ it<=
'r' } == ['s', 'e']- Parameters:
self
- an Iterablecondition
- the closure that must evaluate to true to continue dropping elements- Returns:
- a Collection containing the shortest suffix of the given Iterable such that the given closure condition evaluates to true for each element dropped from the front of the Iterable
- Since:
- 1.8.7
-
dropWhile
public static <K,V> Map<K,V> dropWhile(Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure condition) Create a suffix of the given Map by dropping as many entries as possible from the front of the original Map such that calling the given closure condition evaluates to true when passed each of the dropped entries (or key/value pairs).def shopping = [milk:1, bread:2, chocolate:3] assert shopping.dropWhile{ it.key.size()
If the map instance does not have ordered keys, then this function could appear to drop random entries. Groovy by default uses LinkedHashMap, so this shouldn't be an issue in the main.<
6 } == [chocolate:3] assert shopping.dropWhile{ it.value % 2 } == [bread:2, chocolate:3] assert shopping.dropWhile{ k, v->
k.size() + v<=
7 } == [chocolate:3]- Parameters:
self
- a Mapcondition
- a 1 (or 2) arg Closure that must evaluate to true for the entry (or key and value) to continue dropping elements- Returns:
- the shortest suffix of the given Map such that the given closure condition evaluates to true for each element dropped from the front of the Map
- Since:
- 1.8.7
-
dropWhile
public static <T> Iterator<T> dropWhile(Iterator<T> self, @ClosureParams(FirstGenericType.class) Closure<?> condition) Creates an Iterator that returns a suffix of the elements from an original Iterator. As many elements as possible are dropped from the front of the original Iterator such that calling the given closure condition evaluates to true when passed each of the dropped elements.def a = 0 def iter = [ hasNext:{ a
<
10 }, next:{ a++ } ] as Iterator assert [].iterator().dropWhile{ it<
3 }.toList() == [] assert [1, 2, 3, 4, 5].iterator().dropWhile{ it<
3 }.toList() == [ 3, 4, 5 ] assert iter.dropWhile{ it<
5 }.toList() == [ 5, 6, 7, 8, 9 ]- Parameters:
self
- the Iteratorcondition
- the closure that must evaluate to true to continue dropping elements- Returns:
- the shortest suffix of elements from the given Iterator such that the given closure condition evaluates to true for each element dropped from the front of the Iterator
- Since:
- 1.8.7
-
dump
Generates a detailed dump string of an object showing its class, hashCode and all accessible fields.- Parameters:
self
- an object- Returns:
- the dump representation
- Since:
- 1.0
-
each
public static <T> T each(T self, @ClosureParams(value=FromString.class,options="?") Closure closure) Iterates through an aggregate type or data structure, passing each item to the given closure. Custom types may utilize this method by simply providing an "iterator()" method. The items returned from the resulting iterator will be passed to the closure.String result = '' ['a', 'b', 'c'].each{ result += it } assert result == 'abc'
- Parameters:
self
- the object over which we iterateclosure
- the closure applied on each element found- Returns:
- the self Object
- Since:
- 1.0
-
each
public static <T> Iterable<T> each(Iterable<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Iterates through an Iterable, passing each item to the given closure.- Parameters:
self
- the Iterable over which we iterateclosure
- the closure applied on each element found- Returns:
- the self Iterable
-
each
public static <T> Iterator<T> each(Iterator<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Iterates through an Iterator, passing each item to the given closure.- Parameters:
self
- the Iterator over which we iterateclosure
- the closure applied on each element found- Returns:
- the self Iterator
- Since:
- 2.4.0
-
each
public static <T> Collection<T> each(Collection<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Iterates through a Collection, passing each item to the given closure.- Parameters:
self
- the Collection over which we iterateclosure
- the closure applied on each element found- Returns:
- the self Collection
- Since:
- 2.4.0
-
each
public static <T> List<T> each(List<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Iterates through a List, passing each item to the given closure.- Parameters:
self
- the List over which we iterateclosure
- the closure applied on each element found- Returns:
- the self List
- Since:
- 2.4.0
-
each
Iterates through a Set, passing each item to the given closure.- Parameters:
self
- the Set over which we iterateclosure
- the closure applied on each element found- Returns:
- the self Set
- Since:
- 2.4.0
-
each
public static <T> SortedSet<T> each(SortedSet<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Iterates through a SortedSet, passing each item to the given closure.- Parameters:
self
- the SortedSet over which we iterateclosure
- the closure applied on each element found- Returns:
- the self SortedSet
- Since:
- 2.4.0
-
each
public static <K,V> Map<K,V> each(Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<?> closure) Allows a Map to be iterated through using a closure. If the closure takes one parameter then it will be passed the Map.Entry otherwise if the closure takes two parameters then it will be passed the key and the value.def result = "" [a:1, b:3].each { key, value
->
result += "$key$value" } assert result == "a1b3"def result = "" [a:1, b:3].each { entry
In general, the order in which the map contents are processed cannot be guaranteed. In practise, specialized forms of Map, e.g. a TreeMap will have its contents processed according to the natural ordering of the map.->
result += entry } assert result == "a=1b=3"- Parameters:
self
- the map over which we iterateclosure
- the 1 or 2 arg closure applied on each entry of the map- Returns:
- returns the self parameter
- Since:
- 1.5.0
-
eachCombination
Applies a function on each combination of the input lists.Example usage:
[[2, 3],[4, 5, 6]].eachCombination { println "Found $it" }
- Parameters:
self
- a Collection of listsfunction
- a closure to be called on each combination- Since:
- 2.2.0
- See Also:
-
eachPermutation
Iterates over all permutations of a collection, running a closure for each iteration.Example usage:
def permutations = [] [1, 2, 3].eachPermutation{ permutations << it } assert permutations == [[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1]]
- Parameters:
self
- the Collection of itemsclosure
- the closure to call for each permutation- Returns:
- the permutations from the list
- Since:
- 1.7.0
-
eachWithIndex
public static <T> T eachWithIndex(T self, @ClosureParams(value=FromString.class,options="?,Integer") Closure closure) Iterates through an aggregate type or data structure, passing each item and the item's index (a counter starting at zero) to the given closure.String result = '' ['a', 'b', 'c'].eachWithIndex{ letter, index
->
result += "$index:$letter" } assert result == '0:a1:b2:c'- Parameters:
self
- an Objectclosure
- a Closure to operate on each item- Returns:
- the self Object
- Since:
- 1.0
-
eachWithIndex
public static <T> Iterable<T> eachWithIndex(Iterable<T> self, @ClosureParams(value=FromString.class,options="T,Integer") Closure closure) Iterates through an iterable type, passing each item and the item's index (a counter starting at zero) to the given closure.- Parameters:
self
- an Iterableclosure
- a Closure to operate on each item- Returns:
- the self Iterable
- Since:
- 2.3.0
-
eachWithIndex
public static <T> Iterator<T> eachWithIndex(Iterator<T> self, @ClosureParams(value=FromString.class,options="T,Integer") Closure closure) Iterates through an iterator type, passing each item and the item's index (a counter starting at zero) to the given closure.- Parameters:
self
- an Iteratorclosure
- a Closure to operate on each item- Returns:
- the self Iterator (now exhausted)
- Since:
- 2.3.0
-
eachWithIndex
public static <T> Collection<T> eachWithIndex(Collection<T> self, @ClosureParams(value=FromString.class,options="T,Integer") Closure closure) Iterates through a Collection, passing each item and the item's index (a counter starting at zero) to the given closure.- Parameters:
self
- a Collectionclosure
- a Closure to operate on each item- Returns:
- the self Collection
- Since:
- 2.4.0
-
eachWithIndex
public static <T> List<T> eachWithIndex(List<T> self, @ClosureParams(value=FromString.class,options="T,Integer") Closure closure) Iterates through a List, passing each item and the item's index (a counter starting at zero) to the given closure.- Parameters:
self
- a Listclosure
- a Closure to operate on each item- Returns:
- the self List
- Since:
- 2.4.0
-
eachWithIndex
public static <T> Set<T> eachWithIndex(Set<T> self, @ClosureParams(value=FromString.class,options="T,Integer") Closure closure) Iterates through a Set, passing each item and the item's index (a counter starting at zero) to the given closure.- Parameters:
self
- a Setclosure
- a Closure to operate on each item- Returns:
- the self Set
- Since:
- 2.4.0
-
eachWithIndex
public static <T> SortedSet<T> eachWithIndex(SortedSet<T> self, @ClosureParams(value=FromString.class,options="T,Integer") Closure closure) Iterates through a SortedSet, passing each item and the item's index (a counter starting at zero) to the given closure.- Parameters:
self
- a SortedSetclosure
- a Closure to operate on each item- Returns:
- the self SortedSet
- Since:
- 2.4.0
-
eachWithIndex
public static <K,V> Map<K,V> eachWithIndex(Map<K, V> self, @ClosureParams(value=MapEntryOrKeyValue.class,options="index=true") Closure<?> closure) Allows a Map to be iterated through using a closure. If the closure takes two parameters then it will be passed the Map.Entry and the item's index (a counter starting at zero) otherwise if the closure takes three parameters then it will be passed the key, the value, and the index.def result = "" [a:1, b:3].eachWithIndex { key, value, index
->
result += "$index($key$value)" } assert result == "0(a1)1(b3)"def result = "" [a:1, b:3].eachWithIndex { entry, index
->
result += "$index($entry)" } assert result == "0(a=1)1(b=3)"- Parameters:
self
- the map over which we iterateclosure
- a 2 or 3 arg Closure to operate on each item- Returns:
- the self Object
- Since:
- 1.5.0
-
equals
Determines if the contents of this list are equal to the contents of the given array in the same order. This returnsfalse
if either collection isnull
.assert [1, "a"].equals( [ 1, "a" ] as Object[] )
- Parameters:
left
- a Listright
- the Object[] being compared to- Returns:
- true if the contents of both collections are equal
- Since:
- 1.5.0
-
equals
Compare the contents of two Lists. Order matters. If numbers exist in the Lists, then they are compared as numbers, for example 2 == 2L. If both lists arenull
, the result is true; otherwise if either list isnull
, the result isfalse
.assert ["a", 2].equals(["a", 2]) assert ![2, "a"].equals("a", 2) assert [2.0, "a"].equals(2L, "a") // number comparison at work
- Parameters:
left
- a Listright
- the List being compared to- Returns:
- boolean
true
if the contents of both lists are identical,false
otherwise. - Since:
- 1.0
-
equals
Compare the contents of two Sets for equality using Groovy's coercion rules.Returns true if the two sets have the same size, and every member of the specified set is contained in this set (or equivalently, every member of this set is contained in the specified set). If numbers exist in the sets, then they are compared as numbers, for example 2 == 2L. If both sets are
null
, the result is true; otherwise if either set isnull
, the result isfalse
. Example usage:Set s1 = ["a", 2] def s2 = [2, 'a'] as Set Set s3 = [3, 'a'] def s4 = [2.0, 'a'] as Set def s5 = [2L, 'a'] as Set assert s1.equals(s2) assert !s1.equals(s3) assert s1.equals(s4) assert s1.equals(s5)
- Parameters:
self
- a Setother
- the Set being compared to- Returns:
- true if the contents of both sets are identical
- Since:
- 1.8.0
-
equals
Compares two Maps treating coerced numerical values as identical.Example usage:
assert [a:2, b:3] == [a:2L, b:3.0]
- Parameters:
self
- this Mapother
- the Map being compared to- Returns:
- true if the contents of both maps are identical
- Since:
- 1.8.0
-
equalsIgnoreZeroSign
Compares this object against the specified object returning the same result asFloat.equals(Object)
but returning true if this object and the specified object are both zero and negative zero respectively or vice versa.- Since:
- 3.0.8
-
equalsIgnoreZeroSign
Compares this object against the specified object returning the same result asDouble.equals(Object)
but returning true if this object and the specified object are both zero and negative zero respectively or vice versa.- Since:
- 3.0.8
-
every
Used to determine if the given predicate closure is valid (i.e. returnstrue
for all items in this data structure). A simple example for a list:def list = [3,4,5] def greaterThanTwo = list.every { it
>
2 }- Parameters:
self
- the object over which we iteratepredicate
- the closure predicate used for matching- Returns:
- true if every iteration of the object matches the closure predicate
- Since:
- 1.0
-
every
public static <T> boolean every(Iterator<T> self, @ClosureParams(FirstGenericType.class) Closure predicate) Used to determine if the given predicate closure is valid (i.e. returnstrue
for all items in this iterator). A simple example for a list:def list = [3,4,5] def greaterThanTwo = list.iterator().every { it
>
2 }- Parameters:
self
- the iterator over which we iteratepredicate
- the closure predicate used for matching- Returns:
- true if every iteration of the object matches the closure predicate
- Since:
- 2.3.0
-
every
public static <T> boolean every(Iterable<T> self, @ClosureParams(FirstGenericType.class) Closure predicate) Used to determine if the given predicate closure is valid (i.e. returnstrue
for all items in this iterable). A simple example for a list:def list = [3,4,5] def greaterThanTwo = list.every { it
>
2 }- Parameters:
self
- the iterable over which we iteratepredicate
- the closure predicate used for matching- Returns:
- true if every iteration of the object matches the closure predicate
- Since:
- 2.3.0
-
every
public static <K,V> boolean every(Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure predicate) Iterates over the entries of a map, and checks whether a predicate is valid for all entries. If the closure takes one parameter then it will be passed the Map.Entry otherwise if the closure takes two parameters then it will be passed the key and the value.def map = [a:1, b:2.0, c:2L] assert !map.every { key, value
->
value instanceof Integer } assert map.every { entry->
entry.value instanceof Number }- Parameters:
self
- the map over which we iteratepredicate
- the 1 or 2 arg Closure predicate used for matching- Returns:
- true if every entry of the map matches the closure predicate
- Since:
- 1.5.0
-
every
Iterates over every element of a collection, and checks whether all elements aretrue
according to the Groovy Truth. Equivalent toself.every({element
->
element})assert [true, true].every() assert [1, 1].every() assert ![1, 0].every()
- Parameters:
self
- the object over which we iterate- Returns:
- true if every item in the collection matches satisfies Groovy truth
- Since:
- 1.5.0
-
find
Finds the first value matching the closure condition.def numbers = [1, 2, 3] def result = numbers.find { it
>
1} assert result == 2- Parameters:
self
- an Object with an iterator returning its valuesclosure
- a closure condition- Returns:
- the first Object found or null if none was found
- Since:
- 1.0
-
find
Finds the first item matching the IDENTITY Closure (i.e. matching Groovy truth).Example:
def items = [null, 0, 0.0, false, '', [], 42, 43] assert items.find() == 42
- Parameters:
self
- an Object with an Iterator returning its values- Returns:
- the first Object found or null if none was found
- Since:
- 1.8.1
- See Also:
-
find
public static <T> T find(Collection<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Finds the first value matching the closure condition. Example:def list = [1,2,3] assert 2 == list.find { it
>
1 }- Parameters:
self
- a Collectionclosure
- a closure condition- Returns:
- the first Object found, in the order of the collections iterator, or null if no element matches
- Since:
- 1.0
-
find
Finds the first item matching the IDENTITY Closure (i.e. matching Groovy truth).Example:
def items = [null, 0, 0.0, false, '', [], 42, 43] assert items.find() == 42
- Parameters:
self
- a Collection- Returns:
- the first Object found or null if none was found
- Since:
- 1.8.1
- See Also:
-
find
public static <K,V> Map.Entry<K,V> find(Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<?> closure) Finds the first entry matching the closure condition. If the closure takes two parameters, the entry key and value are passed. If the closure takes one parameter, the Map.Entry object is passed.assert [a:1, b:3].find { it.value == 3 }.key == "b"
- Parameters:
self
- a Mapclosure
- a 1 or 2 arg Closure condition- Returns:
- the first Object found
- Since:
- 1.0
-
findAll
public static <K,V> Map<K,V> findAll(Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure closure) Finds all entries matching the closure condition. If the closure takes one parameter then it will be passed the Map.Entry. Otherwise if the closure should take two parameters, which will be the key and the value.If the
self
map is one of TreeMap, LinkedHashMap, Hashtable or Properties, the returned Map will preserve that type, otherwise a HashMap will be returned.Example usage:
def result = [a:1, b:2, c:4, d:5].findAll { it.value % 2 == 0 } assert result.every { it instanceof Map.Entry } assert result*.key == ["b", "c"] assert result*.value == [2, 4]
- Parameters:
self
- a Mapclosure
- a 1 or 2 arg Closure condition applying on the entries- Returns:
- a new subMap
- Since:
- 1.0
-
findAll
public static <T> Set<T> findAll(Set<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Finds all values matching the closure condition.assert ([2,4] as Set) == ([1,2,3,4] as Set).findAll { it % 2 == 0 }
- Parameters:
self
- a Setclosure
- a closure condition- Returns:
- a Set of matching values
- Since:
- 2.4.0
-
findAll
public static <T> List<T> findAll(List<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Finds all values matching the closure condition.assert [2,4] == [1,2,3,4].findAll { it % 2 == 0 }
- Parameters:
self
- a Listclosure
- a closure condition- Returns:
- a List of matching values
- Since:
- 2.4.0
-
findAll
public static <T> Collection<T> findAll(Collection<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Finds all values matching the closure condition.assert [2,4] == [1,2,3,4].findAll { it % 2 == 0 }
- Parameters:
self
- a Collectionclosure
- a closure condition- Returns:
- a Collection of matching values
- Since:
- 1.5.6
-
findAll
Finds the items matching the IDENTITY Closure (i.e. matching Groovy truth).Example:
def items = [1, 2, 0, false, true, '', 'foo', [], [4, 5], null] as Set assert items.findAll() == [1, 2, true, 'foo', [4, 5]] as Set
- Parameters:
self
- a Set- Returns:
- a Set of the truthy values
- Since:
- 2.4.0
- See Also:
-
findAll
Finds the items matching the IDENTITY Closure (i.e. matching Groovy truth).Example:
def items = [1, 2, 0, false, true, '', 'foo', [], [4, 5], null] assert items.findAll() == [1, 2, true, 'foo', [4, 5]]
- Parameters:
self
- a List- Returns:
- a List of the truthy values
- Since:
- 2.4.0
- See Also:
-
findAll
Finds the items matching the IDENTITY Closure (i.e. matching Groovy truth).Example:
def items = [1, 2, 0, false, true, '', 'foo', [], [4, 5], null] assert items.findAll() == [1, 2, true, 'foo', [4, 5]]
- Parameters:
self
- a Collection- Returns:
- a Collection of the truthy values
- Since:
- 1.8.1
- See Also:
-
findAll
Finds all items matching the closure condition.- Parameters:
self
- an Object with an Iterator returning its valuesclosure
- a closure condition- Returns:
- a List of the values found
- Since:
- 1.6.0
-
findAll
Finds all items matching the IDENTITY Closure (i.e. matching Groovy truth).Example:
def items = [1, 2, 0, false, true, '', 'foo', [], [4, 5], null] assert items.findAll() == [1, 2, true, 'foo', [4, 5]]
- Parameters:
self
- an Object with an Iterator returning its values- Returns:
- a List of the truthy values
- Since:
- 1.8.1
- See Also:
-
findIndexOf
Iterates over the elements of an aggregate of items and returns the index of the first item that matches the condition specified in the closure.- Parameters:
self
- the iteration object over which to iteratecondition
- the matching condition- Returns:
- an integer that is the index of the first matched object or -1 if no match was found
- Since:
- 1.0
-
findIndexOf
Iterates over the elements of an aggregate of items, starting from a specified startIndex, and returns the index of the first item that matches the condition specified in the closure. Example (aggregate isChronoUnit
enum values):import java.time.temporal.ChronoUnit def nameStartsWithM = { it.name().startsWith('M') } def first = ChronoUnit.findIndexOf(nameStartsWithM) def second = ChronoUnit.findIndexOf(first + 1, nameStartsWithM) def third = ChronoUnit.findIndexOf(second + 1, nameStartsWithM) Set units = [first, second, third] assert !units.contains(-1) // should have found 3 of MICROS, MILLIS, MINUTES, MONTHS, ... assert units.size() == 3 // just check size so as not to rely on order
- Parameters:
self
- the iteration object over which to iteratestartIndex
- start matching from this indexcondition
- the matching condition- Returns:
- an integer that is the index of the first matched object or -1 if no match was found
- Since:
- 1.5.0
-
findIndexOf
public static <T> int findIndexOf(Iterator<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Iterates over the elements of an Iterator and returns the index of the first item that satisfies the condition specified by the closure.- Parameters:
self
- an Iteratorcondition
- the matching condition- Returns:
- an integer that is the index of the first matched object or -1 if no match was found
- Since:
- 2.5.0
-
findIndexOf
public static <T> int findIndexOf(Iterator<T> self, int startIndex, @ClosureParams(FirstGenericType.class) Closure condition) Iterates over the elements of an Iterator, starting from a specified startIndex, and returns the index of the first item that satisfies the condition specified by the closure.- Parameters:
self
- an IteratorstartIndex
- start matching from this indexcondition
- the matching condition- Returns:
- an integer that is the index of the first matched object or -1 if no match was found
- Since:
- 2.5.0
-
findIndexOf
public static <T> int findIndexOf(Iterable<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Iterates over the elements of an Iterable and returns the index of the first item that satisfies the condition specified by the closure.- Parameters:
self
- an Iterablecondition
- the matching condition- Returns:
- an integer that is the index of the first matched object or -1 if no match was found
- Since:
- 2.5.0
-
findIndexOf
public static <T> int findIndexOf(Iterable<T> self, int startIndex, @ClosureParams(FirstGenericType.class) Closure condition) Iterates over the elements of an Iterable, starting from a specified startIndex, and returns the index of the first item that satisfies the condition specified by the closure.- Parameters:
self
- an IterablestartIndex
- start matching from this indexcondition
- the matching condition- Returns:
- an integer that is the index of the first matched object or -1 if no match was found
- Since:
- 2.5.0
-
findIndexValues
Iterates over the elements of an aggregate of items and returns the index values of the items that match the condition specified in the closure.- Parameters:
self
- the iteration object over which to iteratecondition
- the matching condition- Returns:
- a list of numbers corresponding to the index values of all matched objects
- Since:
- 1.5.2
-
findIndexValues
Iterates over the elements of an aggregate of items, starting from a specified startIndex, and returns the index values of the items that match the condition specified in the closure.- Parameters:
self
- the iteration object over which to iteratestartIndex
- start matching from this indexcondition
- the matching condition- Returns:
- a list of numbers corresponding to the index values of all matched objects
- Since:
- 1.5.2
-
findIndexValues
public static <T> List<Number> findIndexValues(Iterator<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Iterates over the elements of an Iterator and returns the index values of the items that match the condition specified in the closure.- Parameters:
self
- an Iteratorcondition
- the matching condition- Returns:
- a list of numbers corresponding to the index values of all matched objects
- Since:
- 2.5.0
-
findIndexValues
public static <T> List<Number> findIndexValues(Iterator<T> self, Number startIndex, @ClosureParams(FirstGenericType.class) Closure condition) Iterates over the elements of an Iterator, starting from a specified startIndex, and returns the index values of the items that match the condition specified in the closure.- Parameters:
self
- an IteratorstartIndex
- start matching from this indexcondition
- the matching condition- Returns:
- a list of numbers corresponding to the index values of all matched objects
- Since:
- 2.5.0
-
findIndexValues
public static <T> List<Number> findIndexValues(Iterable<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Iterates over the elements of an Iterable and returns the index values of the items that match the condition specified in the closure.- Parameters:
self
- an Iterablecondition
- the matching condition- Returns:
- a list of numbers corresponding to the index values of all matched objects
- Since:
- 2.5.0
-
findIndexValues
public static <T> List<Number> findIndexValues(Iterable<T> self, Number startIndex, @ClosureParams(FirstGenericType.class) Closure condition) Iterates over the elements of an Iterable, starting from a specified startIndex, and returns the index values of the items that match the condition specified in the closure.- Parameters:
self
- an IterablestartIndex
- start matching from this indexcondition
- the matching condition- Returns:
- a list of numbers corresponding to the index values of all matched objects
- Since:
- 2.5.0
-
findLastIndexOf
Iterates over the elements of an aggregate of items and returns the index of the last item that matches the condition specified in the closure. Example (aggregate isChronoUnit
enum values):import java.time.temporal.ChronoUnit def nameStartsWithM = { it.name().startsWith('M') } def first = ChronoUnit.findIndexOf(nameStartsWithM) def last = ChronoUnit.findLastIndexOf(nameStartsWithM) // should have found 2 unique index values for MICROS, MILLIS, MINUTES, MONTHS, ... assert first != -1 && last != -1 && first != last
- Parameters:
self
- the iteration object over which to iteratecondition
- the matching condition- Returns:
- an integer that is the index of the last matched object or -1 if no match was found
- Since:
- 1.5.2
-
findLastIndexOf
Iterates over the elements of an aggregate of items, starting from a specified startIndex, and returns the index of the last item that matches the condition specified in the closure.- Parameters:
self
- the iteration object over which to iteratestartIndex
- start matching from this indexcondition
- the matching condition- Returns:
- an integer that is the index of the last matched object or -1 if no match was found
- Since:
- 1.5.2
-
findLastIndexOf
public static <T> int findLastIndexOf(Iterator<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Iterates over the elements of an Iterator and returns the index of the last item that matches the condition specified in the closure.- Parameters:
self
- an Iteratorcondition
- the matching condition- Returns:
- an integer that is the index of the last matched object or -1 if no match was found
- Since:
- 2.5.0
-
findLastIndexOf
public static <T> int findLastIndexOf(Iterator<T> self, int startIndex, @ClosureParams(FirstGenericType.class) Closure condition) Iterates over the elements of an Iterator, starting from a specified startIndex, and returns the index of the last item that matches the condition specified in the closure.- Parameters:
self
- an IteratorstartIndex
- start matching from this indexcondition
- the matching condition- Returns:
- an integer that is the index of the last matched object or -1 if no match was found
- Since:
- 2.5.0
-
findLastIndexOf
public static <T> int findLastIndexOf(Iterable<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Iterates over the elements of an Iterable and returns the index of the last item that matches the condition specified in the closure.- Parameters:
self
- an Iterablecondition
- the matching condition- Returns:
- an integer that is the index of the last matched object or -1 if no match was found
- Since:
- 2.5.0
-
findLastIndexOf
public static <T> int findLastIndexOf(Iterable<T> self, int startIndex, @ClosureParams(FirstGenericType.class) Closure condition) Iterates over the elements of an Iterable, starting from a specified startIndex, and returns the index of the last item that matches the condition specified in the closure.- Parameters:
self
- an IterablestartIndex
- start matching from this indexcondition
- the matching condition- Returns:
- an integer that is the index of the last matched object or -1 if no match was found
- Since:
- 2.5.0
-
findResult
Treats the object as iterable, iterating through the values it represents and returns the first non-null result obtained from calling the closure, otherwise returns null.int[] numbers = [1, 2, 3] assert numbers.findResult { if(it
>
1) return it } == 2 assert numbers.findResult { if(it>
4) return it } == null- Parameters:
self
- an Object with an iterator returning its valuescondition
- a closure that returns a non-null value to indicate that processing should stop and the value should be returned- Returns:
- the first non-null result of the closure
- Since:
- 1.7.5
-
findResult
Treats the object as iterable, iterating through the values it represents and returns the first non-null value, otherwise returns null.class Foo { List items Iterator iterator() { items.iterator() } } assert new Foo(items: [null, 2, 4]).findResult() == 2 assert new Foo(items: [null, null]).findResult() == null
- Parameters:
self
- an Object with an iterator returning its values- Returns:
- the first non-null result of the closure
- Since:
- 4.0.9
-
findResult
Treats the object as iterable, iterating through the values it represents and returns the first non-null result obtained from calling the closure, otherwise returns the defaultResult.int[] numbers = [1, 2, 3] assert numbers.findResult(5) { if(it
>
1) return it } == 2 assert numbers.findResult(5) { if(it>
4) return it } == 5- Parameters:
self
- an Object with an iterator returning its valuesdefaultResult
- an Object that should be returned if all closure results are nullcondition
- a closure that returns a non-null value to indicate that processing should stop and the value should be returned- Returns:
- the first non-null result of the closure, otherwise the default value
- Since:
- 1.7.5
-
findResult
Treats the object as iterable, iterating through the values it represents and returns the first non-null result, otherwise returns the defaultResult.class Foo { List items Iterator iterator() { items.iterator() } } assert new Foo(items: [null, 2, 4]).findResult(5) == 2 assert new Foo(items: [null, null]).findResult(5) == 5
- Parameters:
self
- an Object with an iterator returning its valuesdefaultResult
- an Object that should be returned if all elements are null- Returns:
- the first non-null element, otherwise the default value
- Since:
- 4.0.9
-
findResult
public static <S,T, T findResultU extends T, V extends T> (Iterator<S> self, U defaultResult, @ClosureParams(FirstGenericType.class) Closure<V> condition) Iterates through the Iterator calling the given closure condition for each item but stopping once the first non-null result is found and returning that result. If all are null, the defaultResult is returned.Examples:
def iter = [1,2,3].iterator() assert "Found 2" == iter.findResult("default") { it
>
1 ? "Found $it" : null } assert "default" == iter.findResult("default") { it>
3 ? "Found $it" : null }- Parameters:
self
- an IteratordefaultResult
- an Object that should be returned if all closure results are nullcondition
- a closure that returns a non-null value to indicate that processing should stop and the value should be returned- Returns:
- the first non-null result from calling the closure, or the defaultValue
- Since:
- 2.5.0
-
findResult
Iterates through the Iterator stopping once the first non-null result is found and returning that result. If all are null, the defaultResult is returned.Examples:
assert [null, 1, 2].iterator().findResult('default') == 1 assert [null, null].findResult('default') == 'default'
- Parameters:
self
- an IteratordefaultResult
- an Object that should be returned if all elements are null- Returns:
- the first non-null result from the iterator, or the defaultValue
- Since:
- 4.0.9
-
findResult
public static <T,U> T findResult(Iterator<U> self, @ClosureParams(FirstGenericType.class) Closure<T> condition) Iterates through the Iterator calling the given closure condition for each item but stopping once the first non-null result is found and returning that result. If all results are null, null is returned.- Parameters:
self
- an Iteratorcondition
- a closure that returns a non-null value to indicate that processing should stop and the value should be returned- Returns:
- the first non-null result from calling the closure, or null
- Since:
- 2.5.0
-
findResult
Iterates through the Iterator stopping once the first non-null result is found and returning that result. If all results are null, null is returned.- Parameters:
self
- an Iterator- Returns:
- the first non-null result from the iterator, or null
- Since:
- 4.0.9
-
findResult
public static <S,T, T findResultU extends T, V extends T> (Iterable<S> self, U defaultResult, @ClosureParams(FirstGenericType.class) Closure<V> condition) Iterates through the Iterable calling the given closure condition for each item but stopping once the first non-null result is found and returning that result. If all are null, the defaultResult is returned.Examples:
def list = [1,2,3] assert "Found 2" == list.findResult("default") { it
>
1 ? "Found $it" : null } assert "default" == list.findResult("default") { it>
3 ? "Found $it" : null }- Parameters:
self
- an IterabledefaultResult
- an Object that should be returned if all closure results are nullcondition
- a closure that returns a non-null value to indicate that processing should stop and the value should be returned- Returns:
- the first non-null result from calling the closure, or the defaultValue
- Since:
- 2.5.0
-
findResult
Iterates through the Iterable calling the given closure condition for each item but stopping once the first non-null result is found and returning that result. If all are null, the defaultResult is returned.Examples:
assert [null, 1, 2].findResult('default') == 1 assert [null, null].findResult('default') == 'default'
- Parameters:
self
- an IterabledefaultResult
- an Object that should be returned if all elements in the iterable are null- Returns:
- the first non-null element from the iterable, or the defaultValue
- Since:
- 4.0.9
-
findResult
public static <T,U> T findResult(Iterable<U> self, @ClosureParams(FirstGenericType.class) Closure<T> condition) Iterates through the Iterable calling the given closure condition for each item but stopping once the first non-null result is found and returning that result. If all results are null, null is returned.- Parameters:
self
- an Iterablecondition
- a closure that returns a non-null value to indicate that processing should stop and the value should be returned- Returns:
- the first non-null result from calling the closure, or null
- Since:
- 2.5.0
-
findResult
Iterates through the Iterable stopping once the first non-null result is found and returning that result. If all results are null, null is returned.- Parameters:
self
- an Iterable- Returns:
- the first non-null element from the iterable, or null
- Since:
- 4.0.9
-
findResult
public static <T,K, T findResultV> (Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<T> condition) Returns the first non-null closure result found by passing each map entry to the closure, otherwise null is returned. If the closure takes two parameters, the entry key and value are passed. If the closure takes one parameter, the Map.Entry object is passed.assert "Found b:3" == [a:1, b:3].findResult { if (it.value == 3) return "Found ${it.key}:${it.value}" } assert null == [a:1, b:3].findResult { if (it.value == 9) return "Found ${it.key}:${it.value}" } assert "Found a:1" == [a:1, b:3].findResult { k, v
->
if (k.size() + v == 2) return "Found $k:$v" }- Parameters:
self
- a Mapcondition
- a 1 or 2 arg Closure that returns a non-null value when processing should stop and a value should be returned- Returns:
- the first non-null result collected by calling the closure, or null if no such result was found
- Since:
- 1.7.5
-
findResult
public static <T,U extends T, T findResultV extends T, A, B> (Map<A, B> self, U defaultResult, @ClosureParams(MapEntryOrKeyValue.class) Closure<V> condition) Returns the first non-null closure result found by passing each map entry to the closure, otherwise the defaultResult is returned. If the closure takes two parameters, the entry key and value are passed. If the closure takes one parameter, the Map.Entry object is passed.assert "Found b:3" == [a:1, b:3].findResult("default") { if (it.value == 3) return "Found ${it.key}:${it.value}" } assert "default" == [a:1, b:3].findResult("default") { if (it.value == 9) return "Found ${it.key}:${it.value}" } assert "Found a:1" == [a:1, b:3].findResult("default") { k, v
->
if (k.size() + v == 2) return "Found $k:$v" }- Parameters:
self
- a MapdefaultResult
- an Object that should be returned if all closure results are nullcondition
- a 1 or 2 arg Closure that returns a non-null value when processing should stop and a value should be returned- Returns:
- the first non-null result collected by calling the closure, or the defaultResult if no such result was found
- Since:
- 1.7.5
-
findResults
public static <T,U> Collection<T> findResults(Iterable<U> self, @ClosureParams(FirstGenericType.class) Closure<T> filteringTransform) Iterates through the Iterable transforming items using the supplied closure and collecting any non-null results.Example:
def list = [1,2,3] def result = list.findResults { it
>
1 ? "Found $it" : null } assert result == ["Found 2", "Found 3"]- Parameters:
self
- an IterablefilteringTransform
- a Closure that should return either a non-null transformed value or null for items which should be discarded- Returns:
- the list of non-null transformed values
- Since:
- 2.2.0
-
findResults
Iterates through the Iterable collecting any non-null results.Example:
assert [1, null, 2, null, 3].findResults() == [1, 2, 3]
- Parameters:
self
- an Iterable- Returns:
- the list of non-null values
- Since:
- 4.0.9
-
findResults
public static <T,U> Collection<T> findResults(Iterator<U> self, @ClosureParams(FirstGenericType.class) Closure<T> filteringTransform) Iterates through the Iterator transforming items using the supplied closure and collecting any non-null results.- Parameters:
self
- an IteratorfilteringTransform
- a Closure that should return either a non-null transformed value or null for items which should be discarded- Returns:
- the list of non-null transformed values
- Since:
- 2.5.0
-
findResults
Iterates through the Iterator collecting any non-null results.- Parameters:
self
- an Iterator- Returns:
- the list of non-null values
- Since:
- 4.0.9
-
findResults
public static <T,K, Collection<T> findResultsV> (Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<T> filteringTransform) Iterates through the map transforming items using the supplied closure and collecting any non-null results. If the closure takes two parameters, the entry key and value are passed. If the closure takes one parameter, the Map.Entry object is passed.Example:
def map = [a:1, b:2, hi:2, cat:3, dog:2] def result = map.findResults { k, v
->
k.size() == v ? "Found $k:$v" : null } assert result == ["Found a:1", "Found hi:2", "Found cat:3"]- Parameters:
self
- a MapfilteringTransform
- a 1 or 2 arg Closure that should return either a non-null transformed value or null for items which should be discarded- Returns:
- the list of non-null transformed values
- Since:
- 1.8.1
-
first
Returns the first item from the List.def list = [3, 4, 2] assert list.first() == 3 // check original is unaltered assert list == [3, 4, 2]
- Parameters:
self
- a List- Returns:
- the first item from the List
- Throws:
NoSuchElementException
- if you try to access first() for an empty List- Since:
- 1.5.5
-
first
Returns the first item from the Iterable.def set = [3, 4, 2] as LinkedHashSet assert set.first() == 3 // check original is unaltered assert set == [3, 4, 2] as Set
The first element returned by the Iterable's iterator is returned. If the Iterable doesn't guarantee a defined order it may appear like a random element is returned.- Parameters:
self
- an Iterable- Returns:
- the first item from the Iterable
- Throws:
NoSuchElementException
- if you try to access first() for an empty Iterable- Since:
- 1.8.7
-
flatten
Flatten a Collection. This Collection and any nested arrays or collections have their contents (recursively) added to the new collection.assert [1,2,3,4,5] == [1,[2,3],[[4]],[],5].flatten()
- Parameters:
self
- a Collection to flatten- Returns:
- a flattened Collection
- Since:
- 1.6.0
-
flatten
Flatten an Iterable. This Iterable and any nested arrays or collections have their contents (recursively) added to the new collection.assert [1,2,3,4,5] == [1,[2,3],[[4]],[],5].flatten()
- Parameters:
self
- an Iterable to flatten- Returns:
- a flattened Collection
- Since:
- 1.6.0
-
flatten
Flatten an Iterable. This Iterable and any nested arrays or collections have their contents (recursively) added to the new collection. If flattenOptionals is true, the non-empty optionals are also flattened.var items = [1..2, [3, [4]], Optional.of(5), Optional.empty()] assert items.flatten() == [1, 2, 3, 4, 5] // boolean param determines whether to flatten optionals (false for legacy behavior) assert items.flatten(true) == [1, 2, 3, 4, 5] assert items.flatten(false) == [1, 2, 3, 4, Optional.of(5), Optional.empty()]
- Parameters:
self
- an Iterable to flattenflattenOptionals
- whether to treat an Optional as a container to flatten- Returns:
- a flattened Collection
- Since:
- 5.0.0
-
flatten
Flatten a List. This List and any nested arrays or collections have their contents (recursively) added to the new List.assert [1,2,3,4,5] == [1,[2,3],[[4]],[],5].flatten()
- Parameters:
self
- a List to flatten- Returns:
- a flattened List
- Since:
- 2.4.0
-
flatten
Flatten a Set. This Set and any nested arrays or collections have their contents (recursively) added to the new Set.assert [1,2,3,4,5] as Set == ([1,[2,3],[[4]],[],5] as Set).flatten()
- Parameters:
self
- a Set to flatten- Returns:
- a flattened Set
- Since:
- 2.4.0
-
flatten
Flatten a SortedSet. This SortedSet and any nested arrays or collections have their contents (recursively) added to the new SortedSet.Set nested = [[0,1],[2],3,[4],5] SortedSet sorted = new TreeSet({ a, b
->
(a instanceof List ? a[0] : a)<=>
(b instanceof List ? b[0] : b) } as Comparator) sorted.addAll(nested) assert [0,1,2,3,4,5] as SortedSet == sorted.flatten()- Parameters:
self
- a SortedSet to flatten- Returns:
- a flattened SortedSet
- Since:
- 2.4.0
-
flatten
Flatten an Iterable. This Iterable and any nested arrays, collections, or optionals have their contents (recursively) added to a new collection. Non-Array, non-Collection, non-Optional objects are leaf nodes. The flattenUsing transform can be used to modify leaf nodes. If a leaf node represents some other kind of collective type, the supplied closure should yield the contained items; otherwise, the closure should just return the (optionally modified) leaf.// some examples just transforming the leaf var items = [1..2, [3, [4]]] assert items.flatten(n -> n + 5) == 6..9 assert items.flatten{ 'x' * it } == ['x', 'xx', 'xxx', 'xxxx'] // Here our String is a "container" of day, month, year parts var dates = ['01/02/99', '12/12/23'] assert dates.flatten{ it.split('/') } == [['01', '02', '99'], ['12', '12', '23']] assert dates.flatten{ it.split('/').toList() } == ['01', '02', '99', '12', '12', '23'] // some examples with Maps assert [a:1, b:2].entrySet().flatten{ "$it.key$it.value" } == ['a1', 'b2'] as Set assert [[a:1], [b:2]].flatten{ it.keySet() + it.values() } == ['a', 1, 'b', 2]
- Parameters:
self
- an IterableflattenUsing
- a closure to determine how to flatten non-Array, non-Collection elements- Returns:
- a flattened Collection
- Since:
- 1.6.0
- See Also:
-
flatten
public static <T,E> Collection<T> flatten(Iterable<E> self, boolean flattenOptionals, Closure<?> flattenUsing) Flatten an Iterable. This Iterable and any nested arrays, collections, and potentially Optional elements have their contents (recursively) added to a new collection. Non-container elements are leaf elements. If flattenOptionals is false, Optionals are treated as leaf elements, otherwise they are considered as containers to flatten. The flattenUsing transform can be used to modify leaf nodes. If a leaf node represents some other kind of collective type, the supplied closure should yield the contained item or items; otherwise, the closure should just return the (optionally modified) leaf.var items = ['a'..'b', ['c'], Optional.of('d'), Optional.empty()] var unknown = { it instanceof Optional ? it.orElse('Unknown') : it.toUpperCase() } // by default Optionals are flattened so the ternary in the // 'unknown' closure will never see the optional assert items.flatten(unknown) == ['A', 'B', 'C', 'D'] assert items.flatten(true, unknown) == ['A', 'B', 'C', 'D'] // disable optional flattening and you can provide custom flattening assert items.flatten(false, unknown) == ['A', 'B', 'C', 'd', 'Unknown']
- Parameters:
self
- an IterableflattenOptionals
- whether to treat an Optional as a container to flatten or a leafflattenUsing
- a closure to determine how to flatten leaf elements- Returns:
- a flattened Collection
- Since:
- 5.0.0
-
flatten
Flatten an Optional. This yields a collection containing the Optional value if the Optional is present, or an empty collect otherwise.assert Optional.of(1).flatten() == [1] assert Optional.empty().flatten() == []
- Parameters:
self
- an Optional- Returns:
- a flattened Optional
- Since:
- 5.0.0
-
flattenMany
Flatten an Iterable. This Iterable and any nested arrays, collections or optionals have their contents (recursively) added to a new collection. A transform is applied to any leaf nodes before further flattening.var items = ["1", "2", "foo", "3", "bar"] var toInt = s -> s.number ? Optional.of(s.toInteger()) : Optional.empty() assert items.flattenMany(toInt) == [1, 2, 3] assert items.flattenMany(String::toList) == ['1', '2', 'f', 'o', 'o', '3', 'b', 'a', 'r'] assert items.flattenMany{ it.split(/[aeiou]/) } == ['1', '2', 'f', '3', 'b', 'r'] assert ['01/02/99', '12/12/23'].flattenMany{ it.split('/') } == ['01', '02', '99', '12', '12', '23']
TheflattenMany
method is somewhat similar to thecollectMany
method. WhilecollectMany
works on the basis that the transform closure returns a collection,flattenMany
can return a collection, array, optional or modified element. You should useflattenMany
if you need the extra functionality it offers. Consider usingcollectMany
if you return only collections in the transform, since you will have better type inference in static typing scenarios.- Parameters:
self
- an Iterabletransform
- a transform applied to any leaf elements- Returns:
- a flattened Collection
- Since:
- 5.0.0
- See Also:
-
get
Looks up an item in a Map for the given key and returns the corresponding value. If there is no entry for the given key return instead the default value and also add the key and default value to the map.def map=[:] map.get("a", []) << 5 assert map == [a:[5]]
For a method which doesn't mutate the map, consider instead usingMap.getOrDefault(Object, Object)
or consider using Groovy'sMapWithDefault
often instantiated usingwithDefault(Map, Closure)
or with more optionswithDefault(Map, boolean, boolean, Closure)
.- Parameters:
map
- a Mapkey
- the key to look up the valuedefaultValue
- the value to return and add to the map for this key if there is no entry for the given key- Returns:
- the value of the given key or the default value, added to the map if the key did not exist
- Since:
- 1.0
-
getAt
Allows the subscript operator to be used to lookup dynamic property values.bean[somePropertyNameExpression]
. The normal property notation of groovy is neater and more concise but only works with compile-time known property names.- Parameters:
self
- the object to act uponproperty
- the property name of interest- Returns:
- the property value
- Since:
- 1.0
-
getAt
Support the range subscript operator for a List.def list = [1, "a", 4.5, true] assert list[1..2] == ["a", 4.5]
- Parameters:
self
- a Listrange
- a Range indicating the items to get- Returns:
- a new list instance based on range borders
- Since:
- 1.0
-
getAt
Select a List of items from an eager or lazy List using a Collection to identify the indices to be selected.def list = [].withDefault { 42 } assert list[1,0,2] == [42, 42, 42]
- Parameters:
self
- a ListWithDefaultindices
- a Collection of indices- Returns:
- a new eager or lazy list of the values at the given indices
-
getAt
Support the range subscript operator for an eager or lazy List.def list = [].withDefault { 42 } assert list[1..2] == [null, 42]
- Parameters:
self
- a ListWithDefaultrange
- a Range indicating the items to get- Returns:
- a new eager or lazy list instance based on range borders
-
getAt
Support the range subscript operator for an eager or lazy List.def list = [true, 1, 3.4].withDefault{ 42 }
assert list[0..<0] == []
- Parameters:
self
- a ListWithDefaultrange
- a Range indicating the items to get- Returns:
- a new list instance based on range borders
-
getAt
Support the range subscript operator for a List.def list = [true, 1, 3.4]
assert list[0..<0] == []
- Parameters:
self
- a Listrange
- a Range indicating the items to get- Returns:
- a new list instance based on range borders
- Since:
- 1.0
-
getAt
Select a List of items from a List using a Collection to identify the indices to be selected.def list = [true, 1, 3.4, false] assert list[1,0,2] == [1, true, 3.4]
- Parameters:
self
- a Listindices
- a Collection of indices- Returns:
- a new list of the values at the given indices
- Since:
- 1.0
-
getAt
Support the subscript operator for a List.def list = [2, "a", 5.3] assert list[1] == "a"
- Parameters:
self
- a Listidx
- an index- Returns:
- the value at the given index
- Since:
- 1.0
-
getAt
Support subscript operator for list access. -
getAt
Support the subscript operator for an Iterator. The iterator will be partially exhausted up until the idx entry after returning if a +ve or 0 idx is used, or fully exhausted if a -ve idx is used or no corresponding entry was found. Typical usage:def iter = [2, "a", 5.3].iterator() assert iter[1] == "a"
A more elaborate example:def items = [2, "a", 5.3] def iter = items.iterator() assert iter[-1] == 5.3 // iter exhausted, so reset iter = items.iterator() assert iter[1] == "a" // iter partially exhausted so now idx starts after "a" assert iter[0] == 5.3
- Parameters:
self
- an Iteratoridx
- an index value (-self.size() <= idx < self.size())- Returns:
- the value at the given index (after normalisation) or null if no corresponding value was found
- Since:
- 1.7.2
-
getAt
Support the subscript operator for an Iterable. Typical usage:// custom Iterable example: class MyIterable implements Iterable { Iterator iterator() { [1, 2, 3].iterator() } } def myIterable = new MyIterable() assert myIterable[1] == 2 // Set example: def set = [1,2,3] as LinkedHashSet assert set[1] == 2
- Parameters:
self
- an Iterableidx
- an index value (-self.size() <= idx < self.size()) but using -ve index values will be inefficient- Returns:
- the value at the given index (after normalisation) or null if no corresponding value was found
- Since:
- 2.1.0
-
getAt
Support the subscript operator for a Map.def map = [1:10] assert map[1] == 10
- Parameters:
self
- a Mapkey
- an Object as a key for the map- Returns:
- the value corresponding to the given key
- Since:
- 1.0
-
getAt
Support the subscript operator for a Bitset- Parameters:
self
- a BitSetindex
- index to retrieve- Returns:
- value of the bit at the given index
- Since:
- 1.5.0
- See Also:
-
getAt
Support retrieving a subset of a BitSet using a Range -
getAt
Support the subscript operator for Collection.assert [String, Long, Integer] == ["a",5L,2]["class"]
- Parameters:
coll
- a Collectionproperty
- a String- Returns:
- a List
- Since:
- 1.0
-
getGroovydoc
Gets runtime groovydoc.- Since:
- 3.0.0
-
getIndices
Returns indices of the collection.Example:
assert 0..2 == [5, 6, 7].indices
- Parameters:
self
- a collection- Returns:
- an index range
- Since:
- 2.4.0
-
getLocation
Gets the url of the jar file/source file containing the specified class.- Parameters:
self
- the class- Returns:
- the url of the jar,
null
if the specified class is from JDK - Since:
- 2.5.0
-
getMetaClass
Adds a "metaClass" property to all class objects so you can use the syntaxString.metaClass.myMethod = { println "foo" }
- Parameters:
c
- The java.lang.Class instance- Returns:
- An MetaClass instance
- Since:
- 1.5.0
-
getMetaClass
Obtains a MetaClass for an object either from the registry or in the case of a GroovyObject from the object itself.- Parameters:
obj
- The object in question- Returns:
- The MetaClass
- Since:
- 1.5.0
-
getMetaClass
Obtains a MetaClass for an object either from the registry or in the case of a GroovyObject from the object itself.- Parameters:
obj
- The object in question- Returns:
- The MetaClass
- Since:
- 1.6.0
-
getMetaPropertyValues
Retrieves the list ofMetaProperty
objects for 'self' and wraps it in a list ofPropertyValue
objects that additionally provide the value for each property of 'self'.- Parameters:
self
- the receiver object- Returns:
- list of
PropertyValue
objects - Since:
- 1.0
- See Also:
-
getProperties
Convenience method that callsgetMetaPropertyValues(java.lang.Object)
(self) and provides the data in form of simple key/value pairs, i.e. without type() information.- Parameters:
self
- the receiver object- Returns:
- meta properties as Map of key/value pairs
- Since:
- 1.0
-
getRootLoader
Iterates through the classloader parents until it finds a loader with a class named "org.codehaus.groovy.tools.RootLoader". If there is no such classnull
will be returned. The name is used for comparison because a direct comparison using == may fail as the class may be loaded through different classloaders.- Parameters:
self
- a ClassLoader- Returns:
- the rootLoader for the ClassLoader
- Since:
- 1.5.0
- See Also:
-
grep
Iterates over the collection of items which this Object represents and returns each item that matches the given filter - calling the
method used by switch statements. This method can be used with different kinds of filters like regular expressions, classes, ranges etc. Example:isCase(java.lang.Object, java.lang.Object)
def list = ['a', 'b', 'aa', 'bc', 3, 4.5] assert list.grep( ~/a+/ ) == ['a', 'aa'] assert list.grep( ~/../ ) == ['aa', 'bc'] assert list.grep( Number ) == [ 3, 4.5 ] assert list.grep{ it.toString().size() == 1 } == [ 'a', 'b', 3 ]
- Parameters:
self
- the object over which we iteratefilter
- the filter to perform on the object (using theisCase(java.lang.Object, java.lang.Object)
method)- Returns:
- a collection of objects which match the filter
- Since:
- 1.5.6
-
grep
Iterates over the collection of items and returns each item that matches the given filter - calling the
method used by switch statements. method can be used with different kinds of filters like regular expressions, classes, ranges etc. Example:isCase(java.lang.Object, java.lang.Object)
def list = ['a', 'b', 'aa', 'bc', 3, 4.5] assert list.grep( ~/a+/ ) == ['a', 'aa'] assert list.grep( ~/../ ) == ['aa', 'bc'] assert list.grep( Number ) == [ 3, 4.5 ] assert list.grep{ it.toString().size() == 1 } == [ 'a', 'b', 3 ]
- Parameters:
self
- a collectionfilter
- the filter to perform on each element of the collection (using theisCase(java.lang.Object, java.lang.Object)
method)- Returns:
- a collection of objects which match the filter
- Since:
- 2.0
-
grep
Iterates over the collection of items and returns each item that matches the given filter - calling the
method used by switch statements. This method can be used with different kinds of filters like regular expressions, classes, ranges etc. Example:isCase(java.lang.Object, java.lang.Object)
def list = ['a', 'b', 'aa', 'bc', 3, 4.5] assert list.grep( ~/a+/ ) == ['a', 'aa'] assert list.grep( ~/../ ) == ['aa', 'bc'] assert list.grep( Number ) == [ 3, 4.5 ] assert list.grep{ it.toString().size() == 1 } == [ 'a', 'b', 3 ]
- Parameters:
self
- a Listfilter
- the filter to perform on each element of the collection (using theisCase(java.lang.Object, java.lang.Object)
method)- Returns:
- a List of objects which match the filter
- Since:
- 2.4.0
-
grep
Iterates over the collection of items and returns each item that matches the given filter - calling the
method used by switch statements. This method can be used with different kinds of filters like regular expressions, classes, ranges etc. Example:isCase(java.lang.Object, java.lang.Object)
def set = ['a', 'b', 'aa', 'bc', 3, 4.5] as Set assert set.grep( ~/a+/ ) == ['a', 'aa'] as Set assert set.grep( ~/../ ) == ['aa', 'bc'] as Set assert set.grep( Number ) == [ 3, 4.5 ] as Set assert set.grep{ it.toString().size() == 1 } == [ 'a', 'b', 3 ] as Set
- Parameters:
self
- a Setfilter
- the filter to perform on each element of the collection (using theisCase(java.lang.Object, java.lang.Object)
method)- Returns:
- a Set of objects which match the filter
- Since:
- 2.4.0
-
grep
Iterates over the collection of items which this Object represents and returns each item that matches using the IDENTITY Closure as a filter - effectively returning all elements which satisfy Groovy truth.Example:
def items = [1, 2, 0, false, true, '', 'foo', [], [4, 5], null] assert items.grep() == [1, 2, true, 'foo', [4, 5]]
- Parameters:
self
- the object over which we iterate- Returns:
- a collection of objects which match the filter
- Since:
- 1.8.1
- See Also:
-
grep
Iterates over the collection returning each element that matches using the IDENTITY Closure as a filter - effectively returning all elements which satisfy Groovy truth.Example:
def items = [1, 2, 0, false, true, '', 'foo', [], [4, 5], null] assert items.grep() == [1, 2, true, 'foo', [4, 5]]
- Parameters:
self
- a Collection- Returns:
- a collection of elements satisfy Groovy truth
- Since:
- 2.0
- See Also:
-
grep
Iterates over the collection returning each element that matches using the IDENTITY Closure as a filter - effectively returning all elements which satisfy Groovy truth.Example:
def items = [1, 2, 0, false, true, '', 'foo', [], [4, 5], null] assert items.grep() == [1, 2, true, 'foo', [4, 5]]
- Parameters:
self
- a List- Returns:
- a List of elements satisfy Groovy truth
- Since:
- 2.4.0
- See Also:
-
grep
Iterates over the collection returning each element that matches using the IDENTITY Closure as a filter - effectively returning all elements which satisfy Groovy truth.Example:
def items = [1, 2, 0, false, true, '', 'foo', [], [4, 5], null] as Set assert items.grep() == [1, 2, true, 'foo', [4, 5]] as Set
- Parameters:
self
- a Set- Returns:
- a Set of elements satisfy Groovy truth
- Since:
- 2.4.0
- See Also:
-
groupBy
public static <K,T> Map<K,List<T>> groupBy(Iterable<T> self, @ClosureParams(FirstGenericType.class) Closure<K> closure) Sorts all Iterable members into groups determined by the supplied mapping closure. The closure should return the key that this item should be grouped by. The returned LinkedHashMap will have an entry for each distinct key returned from the closure, with each value being a list of items for that group.Example usage:
assert [0:[2,4,6], 1:[1,3,5]] == [1,2,3,4,5,6].groupBy { it % 2 }
- Parameters:
self
- a collection to groupclosure
- a closure mapping entries on keys- Returns:
- a new Map grouped by keys
- Since:
- 2.2.0
-
groupBy
Sorts all Iterable members into (sub)groups determined by the supplied mapping closures. Each closure should return the key that this item should be grouped by. The returned LinkedHashMap will have an entry for each distinct 'key path' returned from the closures, with each value being a list of items for that 'group path'. Example usage:def result = [1,2,3,4,5,6].groupBy({ it % 2 }, { it
Another example:<
4 }) assert result == [1:[(true):[1, 3], (false):[5]], 0:[(true):[2], (false):[4, 6]]]def sql = groovy.sql.Sql.newInstance(/* ... */) def data = sql.rows("SELECT * FROM a_table").groupBy({ it.column1 }, { it.column2 }, { it.column3 }) if (data.val1.val2.val3) { // there exists a record where: // a_table.column1 == val1 // a_table.column2 == val2, and // a_table.column3 == val3 } else { // there is no such record }
If an empty array of closures is supplied the IDENTITY Closure will be used.- Parameters:
self
- a collection to groupclosures
- an array of closures, each mapping entries on keys- Returns:
- a new Map grouped by keys on each criterion
- Since:
- 2.2.0
- See Also:
-
groupBy
Sorts all Iterable members into (sub)groups determined by the supplied mapping closures. Each closure should return the key that this item should be grouped by. The returned LinkedHashMap will have an entry for each distinct 'key path' returned from the closures, with each value being a list of items for that 'group path'. Example usage:def result = [1,2,3,4,5,6].groupBy([{ it % 2 }, { it
Another example:<
4 }]) assert result == [1:[(true):[1, 3], (false):[5]], 0:[(true):[2], (false):[4, 6]]]def sql = groovy.sql.Sql.newInstance(/* ... */) def data = sql.rows("SELECT * FROM a_table").groupBy([{ it.column1 }, { it.column2 }, { it.column3 }]) if (data.val1.val2.val3) { // there exists a record where: // a_table.column1 == val1 // a_table.column2 == val2, and // a_table.column3 == val3 } else { // there is no such record }
If an empty list of closures is supplied the IDENTITY Closure will be used.- Parameters:
self
- a collection to groupclosures
- a list of closures, each mapping entries on keys- Returns:
- a new Map grouped by keys on each criterion
- Since:
- 2.2.0
- See Also:
-
groupBy
public static <G,K, Map<G,V> Map<K, groupByV>> (Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<G> closure) Groups the members of a map into sub maps determined by the supplied mapping closure. The closure will be passed a Map.Entry or key and value (depending on the number of parameters the closure accepts) and should return the key that each item should be grouped under. The resulting map will have an entry for each 'group' key returned by the closure, with values being the map members from the original map that belong to each group. (If instead of a map, you want a list of map entries use {code}groupEntriesBy{code}.)If the
self
map is one of TreeMap, Hashtable or Properties, the returned Map will preserve that type, otherwise a LinkedHashMap will be returned.def result = [a:1,b:2,c:3,d:4,e:5,f:6].groupBy { it.value % 2 } assert result == [0:[b:2, d:4, f:6], 1:[a:1, c:3, e:5]]
- Parameters:
self
- a map to groupclosure
- a closure mapping entries on keys- Returns:
- a new Map grouped by keys
- Since:
- 1.0
-
groupBy
Groups the members of a map into sub maps determined by the supplied mapping closures. Each closure will be passed a Map.Entry or key and value (depending on the number of parameters the closure accepts) and should return the key that each item should be grouped under. The resulting map will have an entry for each 'group path' returned by all closures, with values being the map members from the original map that belong to each such 'group path'. If theself
map is one of TreeMap, Hashtable, or Properties, the returned Map will preserve that type, otherwise a LinkedHashMap will be returned.def result = [a:1,b:2,c:3,d:4,e:5,f:6].groupBy({ it.value % 2 }, { it.key.next() }) assert result == [1:[b:[a:1], d:[c:3], f:[e:5]], 0:[c:[b:2], e:[d:4], g:[f:6]]]
If an empty array of closures is supplied the IDENTITY Closure will be used.- Parameters:
self
- a map to groupclosures
- an array of closures that map entries on keys- Returns:
- a new map grouped by keys on each criterion
- Since:
- 1.8.1
- See Also:
-
groupBy
Groups the members of a map into sub maps determined by the supplied mapping closures. Each closure will be passed a Map.Entry or key and value (depending on the number of parameters the closure accepts) and should return the key that each item should be grouped under. The resulting map will have an entry for each 'group path' returned by all closures, with values being the map members from the original map that belong to each such 'group path'. If theself
map is one of TreeMap, Hashtable, or Properties, the returned Map will preserve that type, otherwise a LinkedHashMap will be returned.def result = [a:1,b:2,c:3,d:4,e:5,f:6].groupBy([{ it.value % 2 }, { it.key.next() }]) assert result == [1:[b:[a:1], d:[c:3], f:[e:5]], 0:[c:[b:2], e:[d:4], g:[f:6]]]
If an empty list of closures is supplied the IDENTITY Closure will be used.- Parameters:
self
- a map to groupclosures
- a list of closures that map entries on keys- Returns:
- a new map grouped by keys on each criterion
- Since:
- 1.8.1
- See Also:
-
groupAnswer
Groups the current element according to the value- Parameters:
answer
- the map containing the resultselement
- the element to be placedvalue
- the value according to which the element will be placed- Since:
- 1.5.0
-
groupEntriesBy
public static <G,K, Map<G,V> List<Map.Entry<K, groupEntriesByV>>> (Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<G> closure) Groups all map entries into groups determined by the supplied mapping closure. The closure will be passed a Map.Entry or key and value (depending on the number of parameters the closure accepts) and should return the key that each item should be grouped under. The resulting map will have an entry for each 'group' key returned by the closure, with values being the list of map entries that belong to each group. (If instead of a list of map entries, you want an actual map use {code}groupBy{code}.)def result = [a:1,b:2,c:3,d:4,e:5,f:6].groupEntriesBy { it.value % 2 } assert result[0]*.key == ["b", "d", "f"] assert result[1]*.value == [1, 3, 5]
- Parameters:
self
- a map to groupclosure
- a 1 or 2 arg Closure mapping entries on keys- Returns:
- a new Map grouped by keys
- Since:
- 1.5.2
-
hasProperty
Returns true of the implementing MetaClass has a property of the given name
Note that this method will only return true for realised properties and does not take into account implementation of getProperty or propertyMissing
- Parameters:
self
- The object to inspectname
- The name of the property of interest- Returns:
- The found MetaProperty or null if it doesn't exist
- Since:
- 1.6.1
- See Also:
-
head
Returns the first item from the Iterable.def set = [3, 4, 2] as LinkedHashSet assert set.head() == 3 // check original is unaltered assert set == [3, 4, 2] as Set
The first element returned by the Iterable's iterator is returned. If the Iterable doesn't guarantee a defined order it may appear like a random element is returned.- Parameters:
self
- an Iterable- Returns:
- the first item from the Iterable
- Throws:
NoSuchElementException
- if you try to access head() for an empty iterable- Since:
- 2.4.0
-
head
Returns the first item from the List.def list = [3, 4, 2] assert list.head() == 3 assert list == [3, 4, 2]
- Parameters:
self
- a List- Returns:
- the first item from the List
- Throws:
NoSuchElementException
- if you try to access head() for an empty List- Since:
- 1.5.5
-
identity
public static <T,U> T identity(@Target U self, @DelegatesTo(strategy=1) @ClosureParams(FirstParam.class) Closure<T> closure) Allows the closure to be called for the object reference self.- Parameters:
self
- the object to have a closure act uponclosure
- the closure to call on the object- Returns:
- result of calling the closure
- Since:
- 1.0
- See Also:
-
implies
Logical implication of two boolean operands.- Since:
- 1.8.3
-
indexed
Zips an Iterable with indices in (index, value) order. Example usage:assert [0: "a", 1: "b"] == ["a", "b"].indexed() assert ["0: a", "1: b"] == ["a", "b"].indexed().collect { idx, str
->
"$idx: $str" }- Parameters:
self
- an Iterable- Returns:
- a zipped map with indices
- Since:
- 2.4.0
- See Also:
-
indexed
Zips an Iterable with indices in (index, value) order. Example usage:assert [5: "a", 6: "b"] == ["a", "b"].indexed(5) assert ["1: a", "2: b"] == ["a", "b"].indexed(1).collect { idx, str
->
"$idx: $str" }- Parameters:
self
- an Iterableoffset
- an index to start from- Returns:
- a Map (since the keys/indices are unique) containing the elements from the iterable zipped with indices
- Since:
- 2.4.0
- See Also:
-
indexed
Zips an iterator with indices in (index, value) order. Example usage:assert [[0, "a"], [1, "b"]] == ["a", "b"].iterator().indexed().collect{ tuple
->
[tuple.first, tuple.second] } assert ["0: a", "1: b"] == ["a", "b"].iterator().indexed().collect { idx, str->
"$idx: $str" }.toList()- Parameters:
self
- an iterator- Returns:
- a zipped iterator with indices
- Since:
- 2.4.0
- See Also:
-
indexed
Zips an iterator with indices in (index, value) order. Example usage:assert [[5, "a"], [6, "b"]] == ["a", "b"].iterator().indexed(5).toList() assert ["a: 1", "b: 2"] == ["a", "b"].iterator().indexed(1).collect { idx, str
->
"$str: $idx" }.toList()- Parameters:
self
- an iteratoroffset
- an index to start from- Returns:
- a zipped iterator with indices
- Since:
- 2.4.0
- See Also:
-
init
Returns the items from the Iterable excluding the last item. Leaves the original Iterable unchanged.def list = [3, 4, 2] assert list.init() == [3, 4] assert list == [3, 4, 2]
- Parameters:
self
- an Iterable- Returns:
- a Collection without its last element
- Throws:
NoSuchElementException
- if you try to access init() for an empty Iterable- Since:
- 2.4.0
-
init
Returns the items from the List excluding the last item. Leaves the original List unchanged.def list = [3, 4, 2] assert list.init() == [3, 4] assert list == [3, 4, 2]
- Parameters:
self
- a List- Returns:
- a List without its last element
- Throws:
NoSuchElementException
- if you try to access init() for an empty List- Since:
- 2.4.0
-
init
Returns the items from the SortedSet excluding the last item. Leaves the original SortedSet unchanged.def sortedSet = [3, 4, 2] as SortedSet assert sortedSet.init() == [2, 3] as SortedSet assert sortedSet == [3, 4, 2] as SortedSet
- Parameters:
self
- a SortedSet- Returns:
- a SortedSet without its last element
- Throws:
NoSuchElementException
- if you try to access init() for an empty SortedSet- Since:
- 2.4.0
-
init
Returns an Iterator containing all the items from this iterator except the last one.def iter = [3, 4, 2].listIterator() def result = iter.init() assert result.toList() == [3, 4]
- Parameters:
self
- an Iterator- Returns:
- an Iterator without the last element from the original Iterator
- Throws:
NoSuchElementException
- if you try to access init() for an exhausted/empty Iterator- Since:
- 2.4.0
-
inits
Calculates the init values of this Iterable: the first value will be this list of all items from the iterable and the final one will be an empty list, with the intervening values the results of successive applications of init on the items.assert [1, 2, 3, 4].inits() == [[1, 2, 3, 4], [1, 2, 3], [1, 2], [1], []]
- Parameters:
self
- an Iterable- Returns:
- a List of the init values from the given Iterable
- Since:
- 2.5.0
-
inject
public static <T,V extends T> T inject(Object self, @ClosureParams(value=FromString.class,options="T,?") Closure<V> closure) Iterates through the given object, passing the first two elements to the closure. The result is passed back (injected) to the closure along with the third element and so on until all elements have been consumed.- Parameters:
self
- an objectclosure
- a closure- Returns:
- the result of the last closure call
- Throws:
NoSuchElementException
- if the iterator is empty- Since:
- 1.8.7
- See Also:
-
inject
public static <E extends T,T, T injectV extends T> (Iterable<E> self, @ClosureParams(value=FromString.class,options="T,E") Closure<V> closure) Iterates through the given object, passing the first two elements to the closure. The result is passed back (injected) to the closure along with the third element and so on until all elements have been consumed.def items = [1, 2, 3, 4] def value = items.inject { acc, val -> acc * val } assert value == 1 * 2 * 3 * 4 items = [['a','b'], ['b','c'], ['d','b']] value = items.inject { acc, val -> acc.intersect(val) } assert value == ['b'] items = ['j', 'o', 'i', 'n'] as Set value = items.inject(String.&plus) assert value == 'join'
- Parameters:
self
- an iterableclosure
- a closure- Returns:
- the result of the last closure call
- Throws:
NoSuchElementException
- if the iterator is empty- Since:
- 5.0.0
- See Also:
-
inject
public static <T,U extends T, T injectV extends T> (Object self, U initialValue, @ClosureParams(value=FromString.class,options="T,?") Closure<V> closure) Iterates through the given object, passing in the initial value to the closure along with the first item. The result is passed back (injected) into the closure along with the second item. The new result is injected back into the closure along with the third item and so on until further iteration is not possible.Also known as foldLeft or reduce in functional parlance.
- Parameters:
self
- an objectinitialValue
- some initial valueclosure
- a closure- Returns:
- the result of the last closure call
- Since:
- 1.5.0
- See Also:
-
inject
public static <E,T, T injectU extends T, V extends T> (Iterable<E> self, U initialValue, @ClosureParams(value=FromString.class,options="T,E") Closure<V> closure) Iterates through the given object, passing in the initial value to the 2-arg closure along with the first item. The result is passed back (injected) into the closure along with the second item. The new result is injected back into the closure along with the third item and so on until further iteration is not possible.Also known as foldLeft or reduce in functional parlance. Examples:
assert 1*1*2*3*4 == [1,2,3,4].inject(1) { acc, val
Visual representation of the last example above:->
acc * val } assert 0+1+2+3+4 == [1,2,3,4].inject(0) { acc, val->
acc + val } assert 'The quick brown fox' == ['quick', 'brown', 'fox'].inject('The') { acc, val->
acc + ' ' + val } assert 'bat' == ['rat', 'bat', 'cat'].inject('zzz') { min, next->
next<
min ? next : min } def max = { a, b->
[a, b].max() } def animals = ['bat', 'rat', 'cat'] assert 'rat' == animals.inject('aaa', max)initVal animals[0] v v max('aaa', 'bat')
=>
'bat' animals[1] v v max('bat', 'rat')=>
'rat' animals[2] v v max('rat', 'cat')=>
'rat'- Parameters:
self
- an iterableinitialValue
- some initial valueclosure
- a closure- Returns:
- the result of the last closure call
- Since:
- 5.0.0
-
inject
public static <E,T, T injectU extends T, V extends T> (Iterator<E> self, U initialValue, @ClosureParams(value=FromString.class,options="T,E") Closure<V> closure) Iterates through the given iterator, passing in the initial value to the closure along with the first item. The result is passed back (injected) into the closure along with the second item. The new result is injected back into the closure along with the third item and so on until further iteration is not possible.Also known as foldLeft or reduce in functional parlance.
- Parameters:
self
- an iteratorinitialValue
- some initial valueclosure
- a closure- Returns:
- the result of the last closure call
- Since:
- 1.5.0
-
inject
public static <K,V, T injectT, U extends T, W extends T> (Map<K, V> self, U initialValue, @ClosureParams(value=FromString.class,options={"T,Map.Entry<K,V>","T,K,V"}) Closure<W> closure) Iterates through the given map, passing in the initial value to the 2-arg Closure along with the first item (or 3-arg Closure along with the first key and value). The result is passed back (injected) into the closure along with the second item. The new result is injected back into the closure along with the third item and so on until further iteration is not possible.Also known as foldLeft or reduce in functional parlance. Examples:
def map = [a:1, b:2, c:3] assert map.inject([]) { list, k, v
->
list + [k] * v } == ['a', 'b', 'b', 'c', 'c', 'c']- Parameters:
self
- a mapinitialValue
- some initial valueclosure
- a 2 or 3 arg Closure- Returns:
- the result of the last closure call
- Since:
- 1.8.1
-
inspect
Inspects returns the String that matches what would be typed into a terminal to create this object.- Parameters:
self
- any Object- Returns:
- a String that matches what would be typed into a terminal to
create this object. e.g. [1, 'hello'].inspect()
->
[1, 'hello'] - Since:
- 1.0
-
intdiv
Integer Divide a Character by a Number. The ordinal value of the Character is used in the division (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Characterright
- a Number- Returns:
- a Number (an Integer) resulting from the integer division operation
- Since:
- 1.0
-
intdiv
Integer Divide a Number by a Character. The ordinal value of the Character is used in the division (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Numberright
- a Character- Returns:
- a Number (an Integer) resulting from the integer division operation
- Since:
- 1.0
-
intdiv
Integer Divide two Characters. The ordinal values of the Characters are used in the division (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Characterright
- another Character- Returns:
- a Number (an Integer) resulting from the integer division operation
- Since:
- 1.0
-
intdiv
Integer Divide two Numbers.- Parameters:
left
- a Numberright
- another Number- Returns:
- a Number (an Integer) resulting from the integer division operation
- Since:
- 1.0
-
intersect
Create a Collection composed of the intersection of both collections. Any elements that exist in both collections are added to the resultant collection. For collections of custom objects; the objects should implement java.lang.Comparableassert [4,5] == [1,2,3,4,5].intersect([4,5,6,7,8])
By default, Groovy uses aNumberAwareComparator
when determining if an element exists in both collections.- Parameters:
left
- a Collectionright
- a Collection- Returns:
- a Collection as an intersection of both collections
- Since:
- 1.5.6
- See Also:
-
intersect
public static <T> Collection<T> intersect(Collection<T> left, Collection<T> right, Comparator<? super T> comparator) Create a Collection composed of the intersection of both collections. Any elements that exist in both collections are added to the resultant collection. For collections of custom objects; the objects should implement java.lang.Comparableassert [3,4] == [1,2,3,4].intersect([3,4,5,6], Comparator.naturalOrder()) assert [2,4] == [1,2,3,4].intersect([4,8,12,16,20], (x, y)
-> x * x <=> y
)def one = ['a', 'B', 'c', 'd'] def two = ['b', 'C', 'd', 'e'] def compareIgnoreCase = { a, b
->
a.toLowerCase()<=>
b.toLowerCase() } assert one.intersect(two) == ['d'] assert two.intersect(one) == ['d'] assert one.intersect(two, compareIgnoreCase) == ['B', 'c', 'd'] assert two.intersect(one, compareIgnoreCase) == ['b', 'C', 'd']- Parameters:
left
- a Collectionright
- a Collectioncomparator
- a Comparator- Returns:
- a Collection as an intersection of both collections
- Since:
- 2.5.0
-
intersect
Create a Collection composed of the intersection of both iterables. Any elements that exist in both iterables are added to the resultant collection. For iterables of custom objects; the objects should implement java.lang.Comparableassert [4,5] == [1,2,3,4,5].intersect([4,5,6,7,8])
By default, Groovy uses aNumberAwareComparator
when determining if an element exists in both collections.- Parameters:
left
- an Iterableright
- an Iterable- Returns:
- a Collection as an intersection of both iterables
- Since:
- 2.4.0
- See Also:
-
intersect
public static <T> Collection<T> intersect(Iterable<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a Collection composed of the intersection of both iterables. Any elements that exist in both iterables are added to the resultant collection. For iterables of custom objects; the objects should implement java.lang.Comparableassert [3,4] == [1,2,3,4].intersect([3,4,5,6], Comparator.naturalOrder())
- Parameters:
left
- an Iterableright
- an Iterablecomparator
- a Comparator- Returns:
- a Collection as an intersection of both iterables
- Since:
- 2.5.0
-
intersect
public static <T> Collection<T> intersect(Iterable<T> left, Iterable<T> right, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure condition) Create a Collection composed of the intersection of both iterables. Elements from teh first iterable which also occur (according to the comparator closure) in the second iterable are added to the result. If the closure takes a single parameter, the argument passed will be each element, and the closure should return a value used for comparison (either usingComparable.compareTo(java.lang.Object)
orObject.equals(java.lang.Object)
). If the closure takes two parameters, two items from the Iterator will be passed as arguments, and the closure should return an int value (with 0 indicating the items are deemed equal).def one = ['a', 'B', 'c', 'd'] def two = ['b', 'C', 'd', 'e'] def compareIgnoreCase = { it.toLowerCase() } assert one.intersect(two, compareIgnoreCase) == ['B', 'c', 'd'] assert two.intersect(one, compareIgnoreCase) == ['b', 'C', 'd']
- Parameters:
left
- an Iterableright
- an Iterablecondition
- a Closure used to determine unique items- Returns:
- a Collection as an intersection of both iterables
- Since:
- 4.0.0
-
intersect
Create a List composed of the intersection of a List and an Iterable. Any elements that exist in both iterables are added to the resultant collection.assert [4,5] == [1,2,3,4,5].intersect([4,5,6,7,8])
By default, Groovy uses aNumberAwareComparator
when determining if an element exists in both collections.- Parameters:
left
- a Listright
- an Iterable- Returns:
- a List as an intersection of a List and an Iterable
- Since:
- 2.4.0
- See Also:
-
intersect
public static <T> List<T> intersect(List<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a List composed of the intersection of a List and an Iterable. Any elements that exist in both iterables are added to the resultant collection.assert [3,4] == [1,2,3,4].intersect([3,4,5,6])
- Parameters:
left
- a Listright
- an Iterablecomparator
- a Comparator- Returns:
- a List as an intersection of a List and an Iterable
- Since:
- 2.5.0
-
intersect
Create a Set composed of the intersection of a Set and an Iterable. Any elements that exist in both iterables are added to the resultant collection.assert [4,5] as Set == ([1,2,3,4,5] as Set).intersect([4,5,6,7,8])
By default, Groovy uses aNumberAwareComparator
when determining if an element exists in both collections.- Parameters:
left
- a Setright
- an Iterable- Returns:
- a Set as an intersection of a Set and an Iterable
- Since:
- 2.4.0
- See Also:
-
intersect
public static <T> Set<T> intersect(Set<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a Set composed of the intersection of a Set and an Iterable. Any elements that exist in both iterables are added to the resultant collection.assert [3,4] as Set == ([1,2,3,4] as Set).intersect([3,4,5,6], Comparator.naturalOrder())
- Parameters:
left
- a Setright
- an Iterablecomparator
- a Comparator- Returns:
- a Set as an intersection of a Set and an Iterable
- Since:
- 2.5.0
-
intersect
Create a SortedSet composed of the intersection of a SortedSet and an Iterable. Any elements that exist in both iterables are added to the resultant collection.assert [4,5] as SortedSet == ([1,2,3,4,5] as SortedSet).intersect([4,5,6,7,8])
By default, Groovy uses aNumberAwareComparator
when determining if an element exists in both collections.- Parameters:
left
- a SortedSetright
- an Iterable- Returns:
- a Set as an intersection of a SortedSet and an Iterable
- Since:
- 2.4.0
- See Also:
-
intersect
public static <T> SortedSet<T> intersect(SortedSet<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a SortedSet composed of the intersection of a SortedSet and an Iterable. Any elements that exist in both iterables are added to the resultant collection.assert [4,5] as SortedSet == ([1,2,3,4,5] as SortedSet).intersect([4,5,6,7,8])
- Parameters:
left
- a SortedSetright
- an Iterablecomparator
- a Comparator- Returns:
- a Set as an intersection of a SortedSet and an Iterable
- Since:
- 2.5.0
-
intersect
Create a Map composed of the intersection of both maps. Any entries that exist in both maps are added to the resultant map.assert [4:4,5:5] == [1:1,2:2,3:3,4:4,5:5].intersect([4:4,5:5,6:6,7:7,8:8])
assert [1: 1, 2: 2, 3: 3, 4: 4].intersect( [1: 1.0, 2: 2, 5: 5] ) == [1:1, 2:2]
- Parameters:
left
- a mapright
- a map- Returns:
- a Map as an intersection of both maps
- Since:
- 1.7.4
-
invokeMethod
Provide a dynamic method invocation method which can be overloaded in classes to implement dynamic proxies easily.- Parameters:
object
- any Objectmethod
- the name of the method to callarguments
- the arguments to use- Returns:
- the result of the method call
- Since:
- 1.0
-
is
Identity check. Since == is overridden in Groovy with the meaning of equality we need some fallback to check for object identity. Invoke using the 'is' method, like so:def same = this.is(that)
- Parameters:
self
- an objectother
- an object to compare identity with- Returns:
- true if self and other are both references to the same instance, false otherwise
- Since:
- 1.0
-
isAtLeast
Compare a BigDecimal to another. A fluent api style alias forcompareTo
.- Parameters:
left
- a BigDecimalright
- a BigDecimal- Returns:
- true if left is equal to or bigger than right
- Since:
- 3.0.1
-
isAtLeast
Compare a BigDecimal to a String representing a number. A fluent api style alias forcompareTo
.- Parameters:
left
- a BigDecimalright
- a String representing a number- Returns:
- true if left is equal to or bigger than the value represented by right
- Since:
- 3.0.1
-
isCase
Method for overloading the behavior of the 'case' method in switch statements. The default implementation handles arrays types but otherwise simply delegates to Object#equals, but this may be overridden for other types. In this example:switch( a ) { case b: //some code }
"some code" is called whenb.isCase( a )
returnstrue
.- Parameters:
caseValue
- the case valueswitchValue
- the switch value- Returns:
- true if the switchValue is deemed to be equal to the caseValue
- Since:
- 1.0
-
isCase
Special 'Case' implementation for Class, which allows testing whether some switch value is assignable from the given case class. If the switch value is an object,isCase
will return true if the switch value is assignment compatible with the class (case value), i.e. is aninstanceof
the class, for example:def someList = [] switch (someList) { case List: assert true : 'is a list' break case Map: assert false : 'is not a Map' break default: assert false : 'should never get here' break }
If the switch value is a class,isCase
will return true if the switch value is assignable from the given class (case value), i.e. the case class is the same as, or a superclass, or a super-interface of the switch class, for example:switch (ArrayList) { case List: assert true : 'is a list' break case Map: assert false : 'is not a Map' break default: assert false : 'should never get here' break }
- Parameters:
caseValue
- the case valueswitchValue
- the switch value- Returns:
- true if the switchValue is deemed to be assignable from the given class
- Since:
- 1.0
-
isCase
'Case' implementation for collections which tests if the 'switch' operand is contained in any of the 'case' values. For example:switch( 3 ) { case [1,3,5]: assert true break default: assert false }
- Parameters:
caseValue
- the case valueswitchValue
- the switch value- Returns:
- true if the caseValue is deemed to contain the switchValue
- Since:
- 1.0
- See Also:
-
isCase
'Case' implementation for iterable types which tests if the 'switch' operand is contained in any of the 'case' values. For example:Iterable it = {[1,3,5].iterator()} switch( 3 ) { case it: assert true break default: assert false } //GROOVY-7919 assert 1 in it assert 2 !in it
- Parameters:
caseValue
- the case valueswitchValue
- the switch value- Returns:
- true if the caseValue is deemed to contain the switchValue
- Since:
- 5.0.0
- See Also:
-
isCase
'Case' implementation for maps which tests the groovy truth value obtained using the 'switch' operand as key. For example:switch( 'foo' ) { case [foo:true, bar:false]: assert true break default: assert false }
- Parameters:
caseValue
- the case valueswitchValue
- the switch value- Returns:
- the groovy truth value from caseValue corresponding to the switchValue key
- Since:
- 1.7.6
-
isCase
Special 'case' implementation for all numbers, which delegates to thecompareTo()
method for comparing numbers of different types.- Parameters:
caseValue
- the case valueswitchValue
- the switch value- Returns:
- true if the numbers are deemed equal
- Since:
- 1.5.0
-
isDigit
Determines if a character is a digit. Synonym for 'Character.isDigit(this)'.- Parameters:
self
- a Character- Returns:
- true if the character is a digit
- Since:
- 1.5.7
- See Also:
-
isEmpty
Check whether anIterable
has elementsdef items = [1] def iterable = { [ hasNext:{ !items.isEmpty() }, next:{ items.pop() } ] as Iterator } as Iterable assert !iterable.isEmpty() iterable.iterator().next() assert iterable.isEmpty()
- Parameters:
self
- an Iterable- Returns:
- true if the iterable has no elements, false otherwise
- Since:
- 2.5.0
-
isLetter
Determines if a character is a letter. Synonym for 'Character.isLetter(this)'.- Parameters:
self
- a Character- Returns:
- true if the character is a letter
- Since:
- 1.5.7
- See Also:
-
isLetterOrDigit
Determines if a character is a letter or digit. Synonym for 'Character.isLetterOrDigit(this)'.- Parameters:
self
- a Character- Returns:
- true if the character is a letter or digit
- Since:
- 1.5.7
- See Also:
-
isLowerCase
Determines if a Character is lowercase. Synonym for 'Character.isLowerCase(this)'.- Parameters:
self
- a Character- Returns:
- true if the character is lowercase
- Since:
- 1.5.7
- See Also:
-
isNotCase
- Since:
- 4.0.0
-
isNotCase
- Since:
- 4.0.0
-
isNotCase
- Since:
- 4.0.0
-
isNotCase
- Since:
- 4.0.0
-
isNotCase
- Since:
- 4.0.0
-
isNotCase
- Since:
- 4.0.0
-
isUpperCase
Determines if a Character is uppercase. Synonym for 'Character.isUpperCase(this)'.- Parameters:
self
- a Character- Returns:
- true if the character is uppercase
- Since:
- 1.5.7
- See Also:
-
isWhitespace
Determines if a character is a whitespace character. Synonym for 'Character.isWhitespace(this)'.- Parameters:
self
- a Character- Returns:
- true if the character is a whitespace character
- Since:
- 1.5.7
- See Also:
-
iterator
Creates an Iterator for the given Object by converting it to a Collection.- Parameters:
self
- an object- Returns:
- an Iterator for the given Object
- Since:
- 1.0
- See Also:
-
iterator
Supports 'duck-typing' when trying to get an Iterator for each element of a Collection, some of which may already be an Iterator.- Parameters:
self
- an Iterator object- Returns:
- the Iterator itself
- Since:
- 1.5.0
-
iterator
Allows an Enumeration to behave like an Iterable. Note that theremove()
method is unsupported since the underlying Enumeration doesn't provide a mechanism for removing items.- Parameters:
self
- an Enumeration object- Returns:
- an Iterator for the given Enumeration
- Since:
- 1.0
-
iterator
Returns an Iterator for the given Map's entry set.- Since:
- 5.0.0
-
join
Concatenates thetoString()
representation of each item from the Iterator. The iterator will be exhausted of elements.- Parameters:
self
- an Iterator of objects- Returns:
- the joined String
- Since:
- 5.0.0
-
join
Concatenates thetoString()
representation of each item from the Iterable.assert [1,2,3].join() == "123"
- Parameters:
self
- an Iterable of objects- Returns:
- the joined String
- Since:
- 5.0.0
-
join
Concatenates thetoString()
representation of each item from the Iterator, with the given String as a separator between each item. The iterator will become exhausted of elements after producing the resulting conjoined value.- Parameters:
self
- an Iterator of objectsseparator
- a String separator- Returns:
- the joined String
- Since:
- 1.5.5
-
join
Concatenates thetoString()
representation of each item from the Iterable, with the given String as a separator between each item.assert [1,2,3].join(", ") == "1, 2, 3"
- Parameters:
self
- an Iterable of objectsseparator
- a String separator- Returns:
- the joined String
- Since:
- 1.0
-
last
Returns the last item from the List.def list = [3, 4, 2] assert list.last() == 2 // check original is unaltered assert list == [3, 4, 2]
- Parameters:
self
- a List- Returns:
- the last item from the List
- Throws:
NoSuchElementException
- if you try to access last() for an empty List- Since:
- 1.5.5
-
last
An optimized version oflast(List)
.- Since:
- 2.5.15
-
last
Returns the last item from the Iterable.def set = [3, 4, 2] as LinkedHashSet assert set.last() == 2 // check original unaltered assert set == [3, 4, 2] as Set
The last element returned by the Iterable's iterator is returned. If the Iterable doesn't guarantee a defined order it may appear like a random element is returned.- Parameters:
self
- an Iterable- Returns:
- the last item from the Iterable
- Throws:
NoSuchElementException
- if you try to access last() for an empty Iterable- Since:
- 1.8.7
-
leftShift
Overloads the left shift operator to provide an easy way to append objects to a Collection.def list = [1,2] list << 3 assert list == [1,2,3]
- Parameters:
self
- a Collectionvalue
- an Object to be added to the collection.- Returns:
- same collection, after the value was added to it.
- Since:
- 1.0
-
leftShift
Overloads the left shift operator to provide an easy way to append objects to a List.def list = [1,2] list << 3 assert list == [1,2,3]
- Parameters:
self
- a Listvalue
- an Object to be added to the List.- Returns:
- same List, after the value was added to it.
- Since:
- 2.4.0
-
leftShift
Overloads the left shift operator to provide an easy way to append objects to a Set.def set = [1,2] as Set set << 3 assert set == [1,2,3] as Set
- Parameters:
self
- a Setvalue
- an Object to be added to the Set.- Returns:
- same Set, after the value was added to it.
- Since:
- 2.4.0
-
leftShift
Overloads the left shift operator to provide an easy way to append objects to a SortedSet.def set = [1,2] as SortedSet set << 3 assert set == [1,2,3] as SortedSet
- Parameters:
self
- a SortedSetvalue
- an Object to be added to the SortedSet.- Returns:
- same SortedSet, after the value was added to it.
- Since:
- 2.4.0
-
leftShift
public static <T> BlockingQueue<T> leftShift(BlockingQueue<T> self, T value) throws InterruptedException 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 availabledef list = new java.util.concurrent.LinkedBlockingQueue () list << 3 << 2 << 1 assert list.iterator().collect{it} == [3,2,1]
- Parameters:
self
- a Collectionvalue
- an Object to be added to the collection.- Returns:
- same collection, after the value was added to it.
- Throws:
InterruptedException
- Since:
- 1.7.1
-
leftShift
Overloads the left shift operator to provide an easy way to append Map.Entry values to a Map.- Parameters:
self
- a Mapentry
- a Map.Entry to be added to the Map.- Returns:
- same map, after the value has been added to it.
- Since:
- 1.6.0
-
leftShift
Overloads the left shift operator to provide an easy way to put one maps entries into another map. This allows the compact syntaxmap1 << map2
; otherwise it's just a synonym forputAll
though it returns the original map rather than being avoid
method. Example usage:def map = [a:1, b:2] map << [c:3, d:4] assert map == [a:1, b:2, c:3, d:4]
- Parameters:
self
- a Mapother
- another Map whose entries should be added to the original Map.- Returns:
- same map, after the values have been added to it.
- Since:
- 1.7.2
-
leftShift
Implementation of the left shift operator for integral types. Non-integral Number types throw UnsupportedOperationException.- Parameters:
self
- a Number objectoperand
- the shift distance by which to left shift the number- Returns:
- the resulting number
- Since:
- 1.5.0
-
leftShift
Implementation of the left shift operator for BitSets, returning a new BitSet and leaving the original unchanged. TheintValue()
is taken for the shift distance for non-integer operands.- Parameters:
self
- a BitSetoperand
- the shift distance by which to shift the BitSet left- Returns:
- the resulting BitSet
- Since:
- 5.0.0
-
max
Adds max() method to Iterable objects.assert 5 == [2,3,1,5,4].max()
- Parameters:
self
- an Iterable- Returns:
- the maximum value
- Since:
- 2.2.0
- See Also:
-
max
Adds max() method to Iterator objects. The iterator will become exhausted of elements after determining the maximum value.- Parameters:
self
- an Iterator- Returns:
- the maximum value
- Since:
- 1.5.5
-
max
Selects the maximum value found in the Iterable using the given comparator.assert "hello" == ["hello","hi","hey"].max( { a, b
->
a.length()<=>
b.length() } as Comparator )- Parameters:
self
- an Iterablecomparator
- a Comparator- Returns:
- the maximum value or null for an empty Iterable
- Since:
- 2.2.0
- See Also:
-
max
Selects the maximum value found from the Iterator using the given comparator.- Parameters:
self
- an Iteratorcomparator
- a Comparator- Returns:
- the maximum value
- Since:
- 1.5.5
-
max
public static <T> T max(Iterable<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Selects the item in the iterable which when passed as a parameter to the supplied closure returns the maximum value. A null return value represents the least possible return value, so any item for which the supplied closure returns null, won't be selected (unless all items return null). If more than one item has the maximum value, an arbitrary choice is made between the items having the maximum value.If the closure has two parameters it is used like a traditional Comparator. I.e. it should compare its two parameters for order, returning a negative integer, zero, or a positive integer when the first parameter is less than, equal to, or greater than the second respectively. Otherwise, the Closure is assumed to take a single parameter and return a Comparable (typically an Integer) which is then used for further comparison.
assert "hello" == ["hello","hi","hey"].max { it.length() }
assert "hello" == ["hello","hi","hey"].max { a, b
->
a.length()<=>
b.length() }def pets = ['dog', 'elephant', 'anaconda'] def longestName = pets.max{ it.size() } // one of 'elephant' or 'anaconda' assert longestName.size() == 8
- Parameters:
self
- an Iterableclosure
- a 1 or 2 arg Closure used to determine the correct ordering- Returns:
- an item from the Iterable having the maximum value returned by calling the supplied closure with that item as parameter or null for an empty Iterable
- Since:
- 2.2.0
-
max
public static <T> T max(Iterator<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Selects the maximum value found from the Iterator using the closure to determine the correct ordering. The iterator will become exhausted of elements after this operation.If the closure has two parameters it is used like a traditional Comparator. I.e. it should compare its two parameters for order, returning a negative integer, zero, or a positive integer when the first parameter is less than, equal to, or greater than the second respectively. Otherwise, the Closure is assumed to take a single parameter and return a Comparable (typically an Integer) which is then used for further comparison.
- Parameters:
self
- an Iteratorclosure
- a Closure used to determine the correct ordering- Returns:
- the maximum value
- Since:
- 1.5.5
-
max
public static <K,V> Map.Entry<K,V> max(Map<K, V> self, @ClosureParams(value=FromString.class,options={"Map.Entry<K,V>","Map.Entry<K,V>,Map.Entry<K,V>"}) Closure closure) Selects an entry in the map having the maximum calculated value as determined by the supplied closure. If more than one entry has the maximum value, an arbitrary choice is made between the entries having the maximum value.If the closure has two parameters it is used like a traditional Comparator. I.e. it should compare its two parameters for order, returning a negative integer, zero, or a positive integer when the first parameter is less than, equal to, or greater than the second respectively. Otherwise, the Closure is assumed to take a single parameter and return a Comparable (typically an Integer) which is then used for further comparison. An example:
def zoo = [monkeys:6, lions:5, tigers:7] def mostCommonEntry = zoo.max{ it.value } assert mostCommonEntry.value == 7 def leastCommonEntry = zoo.max{ a, b
Edge case for multiple max values:->
b.value<=>
a.value } // double negative! assert leastCommonEntry.value == 5def zoo = [monkeys:6, lions:5, tigers:7] def lengthOfNamePlusNumber = { e
->
e.key.size() + e.value } def ans = zoo.max(lengthOfNamePlusNumber) // one of [monkeys:6, tigers:7] assert lengthOfNamePlusNumber(ans) == 13- Parameters:
self
- a Mapclosure
- a 1 or 2 arg Closure used to determine the correct ordering- Returns:
- the Map.Entry having the maximum value as determined by the closure
- Since:
- 1.7.6
-
metaClass
public static MetaClass metaClass(Class self, @ClosureParams(value=SimpleType.class,options="java.lang.Object") @DelegatesTo(type="groovy.lang.ExpandoMetaClass.DefiningClosure",strategy=3) Closure closure) Sets/updates the metaclass for a given class to a closure.- Parameters:
self
- the class whose metaclass we wish to updateclosure
- the closure representing the new metaclass- Returns:
- the new metaclass value
- Throws:
GroovyRuntimeException
- if the metaclass can't be set for this class- Since:
- 1.6.0
-
metaClass
public static MetaClass metaClass(Object self, @ClosureParams(value=SimpleType.class,options="java.lang.Object") @DelegatesTo(type="groovy.lang.ExpandoMetaClass.DefiningClosure",strategy=3) Closure closure) Sets/updates the metaclass for a given object to a closure.- Parameters:
self
- the object whose metaclass we wish to updateclosure
- the closure representing the new metaclass- Returns:
- the new metaclass value
- Throws:
GroovyRuntimeException
- if the metaclass can't be set for this object- Since:
- 1.6.0
-
min
Adds min() method to Collection objects.assert 2 == [4,2,5].min()
- Parameters:
self
- a Collection- Returns:
- the minimum value
- Since:
- 1.0
- See Also:
-
min
Adds min() method to Iterator objects. The iterator will become exhausted of elements after determining the minimum value.- Parameters:
self
- an Iterator- Returns:
- the minimum value
- Since:
- 1.5.5
- See Also:
-
min
Selects the minimum value found in the Iterable using the given comparator.assert "hi" == ["hello","hi","hey"].min( { a, b
->
a.length()<=>
b.length() } as Comparator )- Parameters:
self
- an Iterablecomparator
- a Comparator- Returns:
- the minimum value or null for an empty Iterable
- Since:
- 2.2.0
- See Also:
-
min
Selects the minimum value found from the Iterator using the given comparator.- Parameters:
self
- an Iteratorcomparator
- a Comparator- Returns:
- the minimum value
- Since:
- 1.5.5
-
min
public static <T> T min(Iterable<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Selects the item in the iterable which when passed as a parameter to the supplied closure returns the minimum value. A null return value represents the least possible return value. If more than one item has the minimum value, an arbitrary choice is made between the items having the minimum value.If the closure has two parameters it is used like a traditional Comparator. I.e. it should compare its two parameters for order, returning a negative integer, zero, or a positive integer when the first parameter is less than, equal to, or greater than the second respectively. Otherwise, the Closure is assumed to take a single parameter and return a Comparable (typically an Integer) which is then used for further comparison.
assert "hi" == ["hello","hi","hey"].min { it.length() }
def lastDigit = { a, b
->
a % 10<=>
b % 10 } assert [19, 55, 91].min(lastDigit) == 91def pets = ['dog', 'cat', 'anaconda'] def shortestName = pets.min{ it.size() } // one of 'dog' or 'cat' assert shortestName.size() == 3
- Parameters:
self
- an Iterableclosure
- a 1 or 2 arg Closure used to determine the correct ordering- Returns:
- an item from the Iterable having the minimum value returned by calling the supplied closure with that item as parameter or null for an empty Iterable
- Since:
- 1.0
- See Also:
-
min
public static <T> T min(Iterator<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Selects the minimum value found from the Iterator using the closure to determine the correct ordering. The iterator will become exhausted of elements after this operation.If the closure has two parameters it is used like a traditional Comparator. I.e. it should compare its two parameters for order, returning a negative integer, zero, or a positive integer when the first parameter is less than, equal to, or greater than the second respectively. Otherwise, the Closure is assumed to take a single parameter and return a Comparable (typically an Integer) which is then used for further comparison.
- Parameters:
self
- an Iteratorclosure
- a Closure used to determine the correct ordering- Returns:
- the minimum value
- Since:
- 1.5.5
-
min
public static <K,V> Map.Entry<K,V> min(Map<K, V> self, @ClosureParams(value=FromString.class,options={"Map.Entry<K,V>","Map.Entry<K,V>,Map.Entry<K,V>"}) Closure closure) Selects an entry in the map having the minimum calculated value as determined by the supplied closure. If more than one entry has the minimum value, an arbitrary choice is made between the entries having the minimum value.If the closure has two parameters it is used like a traditional Comparator. I.e. it should compare its two parameters for order, returning a negative integer, zero, or a positive integer when the first parameter is less than, equal to, or greater than the second respectively. Otherwise, the Closure is assumed to take a single parameter and return a Comparable (typically an Integer) which is then used for further comparison.
def zoo = [monkeys:6, lions:5, tigers:7] def leastCommonEntry = zoo.min{ it.value } assert leastCommonEntry.value == 5 def mostCommonEntry = zoo.min{ a, b
Edge case for multiple min values:->
b.value<=>
a.value } // double negative! assert mostCommonEntry.value == 7def zoo = [monkeys:6, lions:5, tigers:7] def lastCharOfName = { e
->
e.key[-1] } def ans = zoo.min(lastCharOfName) // some random entry assert lastCharOfName(ans) == 's'- Parameters:
self
- a Mapclosure
- a 1 or 2 arg Closure used to determine the correct ordering- Returns:
- the Map.Entry having the minimum value as determined by the closure
- Since:
- 1.7.6
-
minus
Create a Set composed of the elements of the first Set minus the elements of the given Collection.- Parameters:
self
- a Set objectremoveMe
- the items to remove from the Set- Returns:
- the resulting Set
- Since:
- 1.5.0
-
minus
Create a Set composed of the elements of the first Set minus the elements from the given Iterable.- Parameters:
self
- a Set objectremoveMe
- the items to remove from the Set- Returns:
- the resulting Set
- Since:
- 1.8.7
-
minus
Create a Set composed of the elements of the first Set minus the given element.- Parameters:
self
- a Set objectremoveMe
- the element to remove from the Set- Returns:
- the resulting Set
- Since:
- 1.5.0
-
minus
Create a SortedSet composed of the elements of the first SortedSet minus the elements of the given Collection.- Parameters:
self
- a SortedSet objectremoveMe
- the items to remove from the SortedSet- Returns:
- the resulting SortedSet
- Since:
- 2.4.0
-
minus
Create a SortedSet composed of the elements of the first SortedSet minus the elements of the given Iterable.- Parameters:
self
- a SortedSet objectremoveMe
- the items to remove from the SortedSet- Returns:
- the resulting SortedSet
- Since:
- 2.4.0
-
minus
Create a SortedSet composed of the elements of the first SortedSet minus the given element.- Parameters:
self
- a SortedSet objectremoveMe
- the element to remove from the SortedSet- Returns:
- the resulting SortedSet
- Since:
- 2.4.0
-
minus
Create a List composed of the elements of the first list minus every occurrence of elements of the given Collection.assert [1, "a", true, true, false, 5.3] - [true, 5.3] == [1, "a", false]
- Parameters:
self
- a ListremoveMe
- a Collection of elements to remove- Returns:
- a List with the given elements removed
- Since:
- 1.0
-
minus
Create a new Collection composed of the elements of the first Collection minus every occurrence of elements of the given Collection.assert [1, "a", true, true, false, 5.3] - [true, 5.3] == [1, "a", false]
- Parameters:
self
- a CollectionremoveMe
- a Collection of elements to remove- Returns:
- a Collection with the given elements removed
- Since:
- 2.4.0
-
minus
Create a new List composed of the elements of the first List minus every occurrence of elements of the given Iterable.assert [1, "a", true, true, false, 5.3] - [true, 5.3] == [1, "a", false]
- Parameters:
self
- a ListremoveMe
- an Iterable of elements to remove- Returns:
- a new List with the given elements removed
- Since:
- 1.8.7
-
minus
Create a new Collection composed of the elements of the first Iterable minus every occurrence of elements of the given Iterable.assert [1, "a", true, true, false, 5.3] - [true, 5.3] == [1, "a", false]
- Parameters:
self
- an IterableremoveMe
- an Iterable of elements to remove- Returns:
- a new Collection with the given elements removed
- Since:
- 2.4.0
-
minus
public static <T> Collection<T> minus(Iterable<T> self, Iterable<?> removeMe, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure condition) Create a new Collection composed of the elements of the first Iterable minus every matching occurrence as determined by the condition closure of elements of the given Iterable.assert ['a', 'B', 'c', 'D', 'E'].minus(['b', 'C', 'D']) { it.toLowerCase() } == ['a', 'E']
- Parameters:
self
- an IterableremoveMe
- an Iterable of elements to removecondition
- a Closure used to determine unique items- Returns:
- a new Collection with the given elements removed
- Since:
- 4.0.0
-
minus
public static <T> Collection<T> minus(Iterable<T> self, Iterable<?> removeMe, Comparator<? super T> comparator) Create a new Collection composed of the elements of the first Iterable minus every matching occurrence as determined by the condition comparator of elements of the given Iterable.assert ['a', 'B', 'c', 'D', 'E'].minus(['b', 'C', 'D'],
(i, j) -> i.toLowerCase() <=> j.toLowerCase()
) == ['a', 'E']- Parameters:
self
- an IterableremoveMe
- an Iterable of elements to removecomparator
- a Comparator- Returns:
- a new Collection with the given elements removed
- Since:
- 4.0.0
-
minus
Create a new List composed of the elements of the first List minus every occurrence of the given element to remove.assert ["a", 5, 5, true] - 5 == ["a", true]
- Parameters:
self
- a List objectremoveMe
- an element to remove from the List- Returns:
- the resulting List with the given element removed
- Since:
- 1.0
-
minus
Create a new Collection composed of the elements of the first Iterable minus every occurrence of the given element to remove.assert ["a", 5, 5, true] - 5 == ["a", true]
- Parameters:
self
- an Iterable objectremoveMe
- an element to remove from the Iterable- Returns:
- the resulting Collection with the given element removed
- Since:
- 2.4.0
-
minus
Create a Map composed of the entries of the first map minus the entries of the given map.- Parameters:
self
- a map objectremoveMe
- the entries to remove from the map- Returns:
- the resulting map
- Since:
- 1.7.4
-
minus
Subtract a Number from a Character. The ordinal value of the Character is used in the subtraction (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Characterright
- a Number- Returns:
- the Number corresponding to the subtraction of right from left
- Since:
- 1.0
-
minus
Subtract a Character from a Number. The ordinal value of the Character is used in the subtraction (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Numberright
- a Character- Returns:
- the Number corresponding to the subtraction of right from left
- Since:
- 1.0
-
minus
Subtract one Character from another. The ordinal values of the Characters is used in the comparison (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Characterright
- a Character- Returns:
- the Number corresponding to the subtraction of right from left
- Since:
- 1.0
-
mixin
Extend object with category methods. All methods for given class and all super classes will be added to the object.- Parameters:
self
- any ClasscategoryClasses
- a category classes to use- Since:
- 1.6.0
-
mixin
Extend class globally with category methods. All methods for given class and all super classes will be added to the class.- Parameters:
self
- any ClasscategoryClasses
- a category classes to use- Since:
- 1.6.0
-
mixin
Extend class globally with category methods.- Parameters:
self
- any ClasscategoryClass
- a category class to use- Since:
- 1.6.0
-
mixin
Extend class globally with category methods.- Parameters:
self
- any ClasscategoryClass
- a category class to use- Since:
- 1.6.0
-
mixin
Extend class globally with category methods.- Parameters:
self
- any ClasscategoryClass
- a category class to use- Since:
- 1.6.0
-
mixin
Extend class globally with category methods.- Parameters:
self
- any ClasscategoryClass
- a category class to use- Since:
- 1.6.0
-
mod
Performs a division modulus operation.- Parameters:
left
- a Numberright
- another Number to mod- Returns:
- the modulus result
- Since:
- 1.0
-
multiply
Create a Collection composed of the elements of this Iterable, repeated a certain number of times. Note that for non-primitive elements, multiple references to the same instance will be added.assert [1,2,3,1,2,3] == [1,2,3] * 2
Note: if the Iterable happens to not support duplicates, e.g. a Set, then the method will effectively return a Collection with a single copy of the Iterable's items.- Parameters:
self
- an Iterablefactor
- the number of times to append- Returns:
- the multiplied Collection
- Since:
- 2.4.0
-
multiply
Create a List composed of the elements of this Iterable, repeated a certain number of times. Note that for non-primitive elements, multiple references to the same instance will be added.assert [1,2,3,1,2,3] == [1,2,3] * 2
Note: if the Iterable happens to not support duplicates, e.g. a Set, then the method will effectively return a Collection with a single copy of the Iterable's items.- Parameters:
self
- a Listfactor
- the number of times to append- Returns:
- the multiplied List
- Since:
- 2.4.0
-
multiply
Multiply a Character by a Number. The ordinal value of the Character is used in the multiplication (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Characterright
- a Number- Returns:
- the Number corresponding to the multiplication of left by right
- Since:
- 1.0
-
multiply
Multiply a Number by a Character. The ordinal value of the Character is used in the multiplication (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Numberright
- a Character- Returns:
- the multiplication of left by right
- Since:
- 1.0
-
multiply
Multiply two Characters. The ordinal values of the Characters are used in the multiplication (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Characterright
- another Character- Returns:
- the Number corresponding to the multiplication of left by right
- Since:
- 1.0
-
multiply
Multiply a BigDecimal and a Double. Note: This method was added to enforce the Groovy rule of BigDecimal*Double == Double. Without this method, the multiply(BigDecimal) method in BigDecimal would respond and return a BigDecimal instead. Since BigDecimal is preferred over Number, the Number*Number method is not chosen as in older versions of Groovy.- Parameters:
left
- a BigDecimalright
- a Double- Returns:
- the multiplication of left by right
- Since:
- 1.0
-
multiply
Multiply a BigDecimal and a BigInteger. Note: This method was added to enforce the Groovy rule of BigDecimal*long == long. Without this method, the multiply(BigDecimal) method in BigDecimal would respond and return a BigDecimal instead. Since BigDecimal is preferred over Number, the Number*Number method is not chosen as in older versions of Groovy. BigInteger is the fallback for all integer types in Groovy- Parameters:
left
- a BigDecimalright
- a BigInteger- Returns:
- the multiplication of left by right
- Since:
- 1.0
-
newInstance
Convenience method to dynamically create a new instance of this class. Calls the default constructor.- Parameters:
c
- a class- Returns:
- a new instance of this class
- Since:
- 1.0
-
newInstance
Helper to construct a new instance from the given arguments. The constructor is called based on the number and types in the args array. UsenewInstance(null)
or simplynewInstance()
for the default (no-arg) constructor.- Parameters:
c
- a classargs
- the constructor arguments- Returns:
- a new instance of this class.
- Since:
- 1.0
-
next
Increment a Character by one.- Parameters:
self
- a Character- Returns:
- an incremented Character
- Since:
- 1.5.7
-
next
Increment a Number by one.- Parameters:
self
- a Number- Returns:
- an incremented Number
- Since:
- 1.0
-
numberAwareCompareTo
Provides a method that compares two comparables using Groovy's default number aware comparator.- Parameters:
self
- a Comparableother
- another Comparable- Returns:
- a -ve number, 0 or a +ve number according to Groovy's compareTo contract
- Since:
- 1.6.0
-
or
Bitwise OR together two numbers.- Parameters:
left
- a Numberright
- another Number to bitwise OR- Returns:
- the bitwise OR of both Numbers
- Since:
- 1.0
-
or
Bitwise OR together two BitSets. Called when the '|' operator is used between two bit sets.- Parameters:
left
- a BitSetright
- another BitSet to bitwise OR- Returns:
- the bitwise OR of both BitSets
- Since:
- 1.5.0
-
or
Logical disjunction of two boolean operators- Parameters:
left
- left operatorright
- right operator- Returns:
- result of logical disjunction
- Since:
- 1.0
-
or
Create a Set as a union of a Set and an Iterable. Any elements that exist in either are added to the resultant Set.This operation will always create a new object for the result, while the operands remain unchanged.
def a = [1,2,3,4] as Set def b = [3,4,5,6] as Set assert (a | b) == [1,2,3,4,5,6] as Set
- Parameters:
left
- the left Setright
- the right Iterable- Returns:
- the merged Set
- Since:
- 5.0.0
- See Also:
-
or
Create a SortedSet as a union of a SortedSet and an Iterable. Any elements that exist in either are added to the resultant SortedSet.This operation will always create a new object for the result, while the operands remain unchanged.
def a = [1,2,3,4] as SortedSet def b = [3,4,5,6] as Set assert (a | b) == [1,2,3,4,5,6] as SortedSet
- Parameters:
left
- the left SortedSetright
- the right Iterable- Returns:
- the merged SortedSet
- Since:
- 5.0.0
- See Also:
-
permutations
Finds all permutations of an iterable.Example usage:
def result = [1, 2, 3].permutations() assert result == [[3, 2, 1], [3, 1, 2], [1, 3, 2], [2, 3, 1], [2, 1, 3], [1, 2, 3]] as Set
- Parameters:
self
- the Iterable of items- Returns:
- the permutations from the list
- Since:
- 1.7.0
-
permutations
Finds all permutations of an iterable, applies a function to each permutation and collects the result into a list.Example usage:
Set result = [1, 2, 3].permutations { it.collect { v
->
2*v }} assert result == [[6, 4, 2], [6, 2, 4], [2, 6, 4], [4, 6, 2], [4, 2, 6], [2, 4, 6]] as Set- Parameters:
self
- the Iterable of itemsfunction
- the function to apply on each permutation- Returns:
- the list of results of the application of the function on each permutation
- Since:
- 2.2.0
-
plus
Create a Collection as a union of two collections. If the left collection is a Set, then the returned collection will be a Set otherwise a List. This operation will always create a new object for the result, while the operands remain unchanged.assert [1,2,3,4] == [1,2] + [3,4]
- Parameters:
left
- the left Collectionright
- the right Collection- Returns:
- the merged Collection
- Since:
- 1.5.0
-
plus
Create a Collection as a union of two iterables. If the left iterable is a Set, then the returned collection will be a Set otherwise a List. This operation will always create a new object for the result, while the operands remain unchanged.assert [1,2,3,4] == [1,2] + [3,4]
- Parameters:
left
- the left Iterableright
- the right Iterable- Returns:
- the merged Collection
- Since:
- 2.4.0
-
plus
Create a Collection as a union of a Collection and an Iterable. If the left collection is a Set, then the returned collection will be a Set otherwise a List. This operation will always create a new object for the result, while the operands remain unchanged.- Parameters:
left
- the left Collectionright
- the right Iterable- Returns:
- the merged Collection
- Since:
- 1.8.7
- See Also:
-
plus
Create a List as a union of a List and an Iterable. This operation will always create a new object for the result, while the operands remain unchanged.- Parameters:
left
- the left Listright
- the right Iterable- Returns:
- the merged List
- Since:
- 2.4.0
- See Also:
-
plus
Create a List as a union of a List and a Collection. This operation will always create a new object for the result, while the operands remain unchanged.- Parameters:
left
- the left Listright
- the right Collection- Returns:
- the merged List
- Since:
- 2.4.0
- See Also:
-
plus
Create a Set as a union of a Set and an Iterable. This operation will always create a new object for the result, while the operands remain unchanged.- Parameters:
left
- the left Setright
- the right Iterable- Returns:
- the merged Set
- Since:
- 2.4.0
- See Also:
-
plus
Create a Set as a union of a Set and a Collection. This operation will always create a new object for the result, while the operands remain unchanged.- Parameters:
left
- the left Setright
- the right Collection- Returns:
- the merged Set
- Since:
- 2.4.0
- See Also:
-
plus
Create a SortedSet as a union of a SortedSet and an Iterable. This operation will always create a new object for the result, while the operands remain unchanged.- Parameters:
left
- the left SortedSetright
- the right Iterable- Returns:
- the merged SortedSet
- Since:
- 2.4.0
- See Also:
-
plus
Create a SortedSet as a union of a SortedSet and a Collection. This operation will always create a new object for the result, while the operands remain unchanged.- Parameters:
left
- the left SortedSetright
- the right Collection- Returns:
- the merged SortedSet
- Since:
- 2.4.0
- See Also:
-
plus
Creates a new List by inserting all the elements in the specified array to the elements from the original List at the specified index. Shifts the element currently at that index (if any) and any subsequent elements to the right (increasing their indices). The new elements will appear in the resulting List in the order that they occur in the original array. The behavior of this operation is undefined if the list or array operands are modified while the operation is in progress. The original list and array operands remain unchanged.def items = [1, 2, 3] def newItems = items.plus(2, 'a'..'c' as String[]) assert newItems == [1, 2, 'a', 'b', 'c', 3] assert items == [1, 2, 3]
See alsoaddAll
for similar functionality with modify semantics, i.e. which performs the changes on the original list itself.- Parameters:
self
- an original listitems
- array containing elements to be merged with elements from the original listindex
- index at which to insert the first element from the specified array- Returns:
- the new list
- Since:
- 1.8.1
- See Also:
-
plus
Creates a new List by inserting all the elements in the given additions List to the elements from the original List at the specified index. Shifts the element currently at that index (if any) and any subsequent elements to the right (increasing their indices). The new elements will appear in the resulting List in the order that they occur in the original lists. The behavior of this operation is undefined if the original lists are modified while the operation is in progress. The original lists remain unchanged.def items = [1, 2, 3] def newItems = items.plus(2, 'a'..'c') assert newItems == [1, 2, 'a', 'b', 'c', 3] assert items == [1, 2, 3]
See alsoaddAll
for similar functionality with modify semantics, i.e. which performs the changes on the original list itself.- Parameters:
self
- an original Listadditions
- a List containing elements to be merged with elements from the original Listindex
- index at which to insert the first element from the given additions List- Returns:
- the new list
- Since:
- 1.8.1
-
plus
Creates a new List by inserting all the elements in the given Iterable to the elements from this List at the specified index.- Parameters:
self
- an original listadditions
- an Iterable containing elements to be merged with the elements from the original Listindex
- index at which to insert the first element from the given additions Iterable- Returns:
- the new list
- Since:
- 1.8.7
- See Also:
-
plus
Create a collection as a union of a Collection and an Object. If the collection is a Set, then the returned collection will be a Set otherwise a List. This operation will always create a new object for the result, while the operands remain unchanged.assert [1,2,3] == [1,2] + 3
- Parameters:
left
- a Collectionright
- an object to add/append- Returns:
- the resulting Collection
- Since:
- 1.5.0
-
plus
Create a collection as a union of an Iterable and an Object. If the iterable is a Set, then the returned collection will be a Set otherwise a List. This operation will always create a new object for the result, while the operands remain unchanged.assert [1,2,3] == [1,2] + 3
- Parameters:
left
- an Iterableright
- an object to add/append- Returns:
- the resulting Collection
- Since:
- 2.4.0
-
plus
Create a List as a union of a List and an Object. This operation will always create a new object for the result, while the operands remain unchanged.assert [1,2,3] == [1,2] + 3
- Parameters:
left
- a Listright
- an object to add/append- Returns:
- the resulting List
- Since:
- 2.4.0
-
plus
Create a Set as a union of a Set and an Object. This operation will always create a new object for the result, while the operands remain unchanged.assert [1,2,3] == [1,2] + 3
- Parameters:
left
- a Setright
- an object to add/append- Returns:
- the resulting Set
- Since:
- 2.4.0
-
plus
Create a SortedSet as a union of a SortedSet and an Object. This operation will always create a new object for the result, while the operands remain unchanged.assert [1,2,3] == [1,2] + 3
- Parameters:
left
- a SortedSetright
- an object to add/append- Returns:
- the resulting SortedSet
- Since:
- 2.4.0
-
plus
Returns a newMap
containing all entries fromleft
andright
, giving precedence toright
. Any keys appearing in both Maps will appear in the resultant map with values from theright
operand. If theleft
map is one of TreeMap, LinkedHashMap, Hashtable or Properties, the returned Map will preserve that type, otherwise a HashMap will be returned.Roughly equivalent to
Map m = new HashMap(); m.putAll(left); m.putAll(right); return m;
but with some additional logic to preserve theleft
Map type for common cases as described above.assert [a:10, b:20] + [a:5, c:7] == [a:5, b:20, c:7]
- Parameters:
left
- a Mapright
- a Map- Returns:
- a new Map containing all entries from left and right
- Since:
- 1.5.0
-
plus
public static <K,V> Map<K,V> plus(Map<K, V> self, Collection<? extends Map.Entry<? extends K, ? extends V>> entries) Returns a newMap
containing all entries fromself
andentries
, giving precedence toentries
. Any keys appearing in both Maps will appear in the resultant map with values from theentries
operand. Ifself
map is one of TreeMap, LinkedHashMap, Hashtable or Properties, the returned Map will preserve that type, otherwise a HashMap will be returned.- Parameters:
self
- a Mapentries
- a Collection of Map.Entry items to be added to the Map.- Returns:
- a new Map containing all key, value pairs from self and entries
- Since:
- 1.6.1
-
plus
Add a Character and a Number. The ordinal value of the Character is used in the addition (the ordinal value is the unicode value which for simple character sets is the ASCII value). This operation will always create a new object for the result, while the operands remain unchanged.- Parameters:
left
- a Characterright
- a Number- Returns:
- the Number corresponding to the addition of left and right
- Since:
- 1.0
- See Also:
-
plus
Add a Number and a Character. The ordinal value of the Character is used in the addition (the ordinal value is the unicode value which for simple character sets is the ASCII value).- Parameters:
left
- a Numberright
- a Character- Returns:
- The Number corresponding to the addition of left and right
- Since:
- 1.0
- See Also:
-
plus
Add one Character to another. The ordinal values of the Characters are used in the addition (the ordinal value is the unicode value which for simple character sets is the ASCII value). This operation will always create a new object for the result, while the operands remain unchanged.- Parameters:
left
- a Characterright
- a Character- Returns:
- the Number corresponding to the addition of left and right
- Since:
- 1.0
- See Also:
-
plus
Appends a String to the literal of the Map instance.assert '[a:1] is a map' == [a:1] + ' is a map'
- Parameters:
left
- a Mapright
- a String- Returns:
- the concatenated string
- Since:
- 4.0.3
-
plus
Appends a GString to the literal of the Map instance.assert '[a:1] is a map' == [a:1] + " is ${'a'} map"
- Parameters:
left
- a Mapright
- a GString- Returns:
- the concatenated string
- Since:
- 4.0.3
-
pop
Removes the initial item from the List.def list = ["a", false, 2] assert list.pop() == 'a' assert list == [false, 2]
This is similar to pop on a Stack where the first item in the list represents the top of the stack. Note: The behavior of this method changed in Groovy 2.5 to align with Java. If you need the old behavior use 'removeLast'.- Parameters:
self
- a List- Returns:
- the item removed from the List
- Throws:
NoSuchElementException
- if the list is empty- Since:
- 1.0
-
power
Power of a Number to a certain exponent. Called by the '**' operator.- Parameters:
self
- a Numberexponent
- a Number exponent- Returns:
- a Number to the power of a certain exponent
- Since:
- 1.0
-
power
Power of a BigDecimal to an integer certain exponent. If the exponent is positive, call the BigDecimal.pow(int) method to maintain precision. Called by the '**' operator.- Parameters:
self
- a BigDecimalexponent
- an Integer exponent- Returns:
- a Number to the power of the exponent
-
power
Power of a BigInteger to an integer certain exponent. If the exponent is positive, call the BigInteger.pow(int) method to maintain precision. Called by the '**' operator.- Parameters:
self
- a BigIntegerexponent
- an Integer exponent- Returns:
- a Number to the power of the exponent
-
power
Power of an integer to an integer certain exponent. If the exponent is positive, convert to a BigInteger and call BigInteger.pow(int) method to maintain precision. Called by the '**' operator.- Parameters:
self
- an Integerexponent
- an Integer exponent- Returns:
- a Number to the power of the exponent
-
power
Power of a long to an integer certain exponent. If the exponent is positive, convert to a BigInteger and call BigInteger.pow(int) method to maintain precision. Called by the '**' operator.- Parameters:
self
- a Longexponent
- an Integer exponent- Returns:
- a Number to the power of the exponent
-
power
Power of a BigInteger to a BigInteger certain exponent. Called by the '**' operator.- Parameters:
self
- a BigIntegerexponent
- a BigInteger exponent- Returns:
- a BigInteger to the power of the exponent
- Since:
- 2.3.8
-
previous
Decrement a Character by one.- Parameters:
self
- a Character- Returns:
- a decremented Character
- Since:
- 1.5.7
-
previous
Decrement a Number by one.- Parameters:
self
- a Number- Returns:
- a decremented Number
- Since:
- 1.0
-
print
Print a value formatted Groovy style to self if it is a Writer, otherwise to the standard output stream.- Parameters:
self
- any Objectvalue
- the value to print- Since:
- 1.0
-
print
Print a value formatted Groovy style to the print writer.- Parameters:
self
- a PrintWritervalue
- the value to print- Since:
- 1.0
-
print
Print a value formatted Groovy style to the print stream.- Parameters:
self
- a PrintStreamvalue
- the value to print- Since:
- 1.6.0
-
print
Print to a console in interactive format.- Parameters:
self
- any Objectout
- the PrintWriter used for printing- Since:
- 1.0
-
print
Print a value to the standard output stream. This method delegates to the owner to execute the method.- Parameters:
self
- a generated closurevalue
- the value to print- Since:
- 1.0
-
printf
Printf to the standard output stream.- Parameters:
self
- any Objectformat
- a format stringvalues
- values referenced by the format specifiers in the format string- Since:
- 1.0
-
printf
Printf 0 or more values to the standard output stream using a format string. This method delegates to the owner to execute the method.- Parameters:
self
- a generated closureformat
- a format stringvalues
- values referenced by the format specifiers in the format string- Since:
- 3.0.0
-
printf
Printf a value to the standard output stream using a format string. This method delegates to the owner to execute the method.- Parameters:
self
- a generated closureformat
- a format stringvalue
- value referenced by the format specifier in the format string- Since:
- 3.0.0
-
printf
Prints a formatted string using the specified format string and arguments.Examples:
printf ( "Hello, %s!\n" , [ "world" ] as String[] ) printf ( "Hello, %s!\n" , [ "Groovy" ]) printf ( "%d + %d = %d\n" , [ 1 , 2 , 1+2 ] as Integer[] ) printf ( "%d + %d = %d\n" , [ 3 , 3 , 3+3 ]) ( 1..5 ).each { printf ( "-- %d\n" , [ it ] as Integer[] ) } ( 1..5 ).each { printf ( "-- %d\n" , [ it ] as int[] ) } ( 0x41..0x45 ).each { printf ( "-- %c\n" , [ it ] as char[] ) } ( 07..011 ).each { printf ( "-- %d\n" , [ it ] as byte[] ) } ( 7..11 ).each { printf ( "-- %d\n" , [ it ] as short[] ) } ( 7..11 ).each { printf ( "-- %d\n" , [ it ] as long[] ) } ( 7..11 ).each { printf ( "-- %5.2f\n" , [ it ] as float[] ) } ( 7..11 ).each { printf ( "-- %5.2g\n" , [ it ] as double[] ) }
- Parameters:
self
- any Objectformat
- A format stringarg
- Argument which is referenced by the format specifiers in the format string. The type ofarg
should be one of Object[], List, int[], short[], byte[], char[], boolean[], long[], float[], or double[].- Since:
- 1.0
-
println
Print a linebreak to the standard output stream.- Parameters:
self
- any Object- Since:
- 1.0
-
println
Print a linebreak to the standard output stream. This method delegates to the owner to execute the method.- Parameters:
self
- a closure- Since:
- 1.0
-
println
Print a value formatted Groovy style (followed by a newline) to self if it is a Writer, otherwise to the standard output stream.- Parameters:
self
- any Objectvalue
- the value to print- Since:
- 1.0
-
println
Print a value formatted Groovy style (followed by a newline) to the print writer.- Parameters:
self
- a PrintWritervalue
- the value to print- Since:
- 1.0
-
println
Print a value formatted Groovy style (followed by a newline) to the print stream.- Parameters:
self
- any Objectvalue
- the value to print- Since:
- 1.6.0
-
println
Print a value (followed by a newline) to the standard output stream. This method delegates to the owner to execute the method.- Parameters:
self
- a closurevalue
- the value to print- Since:
- 1.0
-
println
Print to a console in interactive format.- Parameters:
self
- any Objectout
- the PrintWriter used for printing- Since:
- 1.0
-
push
Prepends an item to the start of the List.def list = [3, 4, 2] list.push("x") assert list == ['x', 3, 4, 2]
This is similar to push on a Stack where the first item in the list represents the top of the stack. Note: The behavior of this method changed in Groovy 2.5 to align with Java. If you need the old behavior use 'add'.- Parameters:
self
- a Listvalue
- element to be prepended to this list.- Returns:
- true (for legacy compatibility reasons).
- Since:
- 1.5.5
-
putAll
public static <K,V> Map<K,V> putAll(Map<K, V> self, Collection<? extends Map.Entry<? extends K, ? extends V>> entries) Provides an easy way to append multiple Map.Entry values to a Map.- Parameters:
self
- a Mapentries
- a Collection of Map.Entry items to be added to the Map.- Returns:
- the same map, after the items have been added to it.
- Since:
- 1.6.1
-
putAt
Allows the subscript operator to be used to set dynamically named property values.bean[somePropertyNameExpression] = foo
. The normal property notation of groovy is neater and more concise but only works with property names which are known at compile time.- Parameters:
self
- the object to act uponproperty
- the name of the property to setnewValue
- the value to set- Since:
- 1.0
-
putAt
A helper method to allow lists to work with subscript operators.def list = [2, 3] list[0] = 1 assert list == [1, 3]
- Parameters:
self
- a Listidx
- an indexvalue
- the value to put at the given index- Since:
- 1.0
-
putAt
Support subscript operator for list modification. -
putAt
A helper method to allow lists to work with subscript operators.def list = ["a", true]
list[1..<1] = 5
assert list == ["a", 5, true]- Parameters:
self
- a Listrange
- the (in this case empty) subset of the list to setvalue
- the values to put at the given sublist or a Collection of values- Since:
- 1.0
-
putAt
A helper method to allow lists to work with subscript operators.def list = ["a", true]
list[1..<1] = [4, 3, 2]
assert list == ["a", 4, 3, 2, true]- Parameters:
self
- a Listrange
- the (in this case empty) subset of the list to setvalue
- the Collection of values- Since:
- 1.0
- See Also:
-
putAt
List subscript assignment operator when given a range as the index and the assignment operand is a collection. Example:def myList = [4, 3, 5, 1, 2, 8, 10] myList[3..5] = ["a", true] assert myList == [4, 3, 5, "a", true, 10]
Items in the given range are replaced with items from the collection.- Parameters:
self
- a Listrange
- the subset of the list to setcol
- the collection of values to put at the given sublist- Since:
- 1.5.0
-
putAt
List subscript assignment operator when given a range as the index. Example:def myList = [4, 3, 5, 1, 2, 8, 10] myList[3..5] = "b" assert myList == [4, 3, 5, "b", 10]
Items in the given range are replaced with the operand. Thevalue
operand is always treated as a single value.- Parameters:
self
- a Listrange
- the subset of the list to setvalue
- the value to put at the given sublist- Since:
- 1.0
-
putAt
A helper method to allow lists to work with subscript operators.def list = ["a", true, 42, 9.4] list[1, 4] = ["x", false] assert list == ["a", "x", 42, 9.4, false]
- Parameters:
self
- a Listsplice
- the subset of the list to setvalues
- the value to put at the given sublist- Since:
- 1.0
-
putAt
A helper method to allow lists to work with subscript operators.def list = ["a", true, 42, 9.4] list[1, 3] = 5 assert list == ["a", 5, 42, 5]
- Parameters:
self
- a Listsplice
- the subset of the list to setvalue
- the value to put at the given sublist- Since:
- 1.0
-
putAt
A helper method to allow maps to work with subscript operators- Parameters:
self
- a Mapkey
- an Object as a key for the mapvalue
- the value to put into the map- Returns:
- the value corresponding to the given key
- Since:
- 1.0
-
putAt
Support assigning a range of values with a single assignment statement. -
putAt
Support subscript-style assignment for a BitSet.- Parameters:
self
- a BitSetindex
- index of the entry to setvalue
- value- Since:
- 1.5.0
- See Also:
-
remainder
Performs a division modulus operation. Called by the '%' operator.- Parameters:
left
- a Numberright
- another Number to find the remainder- Returns:
- the remainder result
- Since:
- 5.0.0
-
removeAll
Modifies this collection by removing its elements that are contained within the specified object array. See alsofindAll
andgrep
when wanting to produce a new list containing items which don't match some criteria while leaving the original collection unchanged.- Parameters:
self
- a Collection to be modifieditems
- array containing elements to be removed from this collection- Returns:
- true if this collection changed as a result of the call
- Since:
- 1.7.2
- See Also:
-
removeAll
public static <T> boolean removeAll(Collection<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Modifies this collection by removing the elements that are matched according to the specified closure condition.def list = ['a', 'b'] list.removeAll { it == 'b' } assert list == ['a']
See alsofindAll
andgrep
when wanting to produce a new list containing items which match some criteria but leaving the original collection unchanged.- Parameters:
self
- a Collection to be modifiedcondition
- a closure condition- Returns:
- true if this collection changed as a result of the call
- Since:
- 1.7.2
- See Also:
-
removeAll
public static <K,V> boolean removeAll(Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure condition) Modifies this map by removing the elements that are matched according to the specified closure condition. If the closure takes one parameter then it will be passed theMap.Entry
. Otherwise the closure should take two parameters, which will be the key and the value.def map = [a:1, b:2] map.removeAll { k,v
See also->
k == 'b' } assert map == [a:1]findAll
when wanting to produce a new map containing items which match some criteria but leaving the original map unchanged.- Parameters:
self
- a Map to be modifiedcondition
- a 1 or 2 arg Closure condition applying on the entries- Returns:
- true if this map changed as a result of the call
- Since:
- 2.5.0
-
removeAt
Modifies this list by removing the element at the specified position in this list. Returns the removed element. Essentially an alias forList.remove(int)
but with no ambiguity for List<Integer>. Example:def list = [1, 2, 3] list.removeAt(1) assert [1, 3] == list
- Parameters:
self
- a Listindex
- the index of the element to be removed- Returns:
- the element previously at the specified position
- Since:
- 2.4.0
-
removeElement
Modifies this collection by removing a single instance of the specified element from this collection, if it is present. Essentially an alias forCollection.remove(Object)
but with no ambiguity for Collection<Integer>. Example:def list = [1, 2, 3, 2] list.removeElement(2) assert [1, 3, 2] == list
- Parameters:
self
- a Collectiono
- element to be removed from this collection, if present- Returns:
- true if an element was removed as a result of this call
- Since:
- 2.4.0
-
removeLast
Removes the last item from the List.def list = ["a", false, 2] assert list.removeLast() == 2 assert list == ["a", false]
Using add() and removeLast() is similar to push and pop on a Stack where the last item in the list represents the top of the stack.- Parameters:
self
- a List- Returns:
- the item removed from the List
- Throws:
NoSuchElementException
- if the list is empty- Since:
- 2.5.0
-
respondsTo
Returns an object satisfying Groovy truth if the implementing MetaClass responds to a method with the given name and arguments types.
Note that this method's return value is based on realised methods and does not take into account objects or classes that implement invokeMethod or methodMissing
This method is "safe" in that it will always return a value and never throw an exception
- Parameters:
self
- The object to inspectname
- The name of the method of interestargTypes
- The argument types to match against- Returns:
- A List of MetaMethods matching the argument types which will be empty if no matching methods exist
- Since:
- 1.6.0
- See Also:
-
respondsTo
Returns an object satisfying Groovy truth if the implementing MetaClass responds to a method with the given name regardless of the arguments.
Note that this method's return value is based on realised methods and does not take into account objects or classes that implement invokeMethod or methodMissing
This method is "safe" in that it will always return a value and never throw an exception
- Parameters:
self
- The object to inspectname
- The name of the method of interest- Returns:
- A List of MetaMethods matching the given name or an empty list if no matching methods exist
- Since:
- 1.6.1
- See Also:
-
retainAll
Modifies this collection so that it retains only its elements that are contained in the specified array. In other words, removes from this collection all of its elements that are not contained in the specified array. See alsogrep
andfindAll
when wanting to produce a new list containing items which match some specified items but leaving the original collection unchanged.- Parameters:
self
- a Collection to be modifieditems
- array containing elements to be retained from this collection- Returns:
- true if this collection changed as a result of the call
- Since:
- 1.7.2
- See Also:
-
retainAll
public static <T> boolean retainAll(Collection<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Modifies this collection so that it retains only its elements that are matched according to the specified closure condition. In other words, removes from this collection all of its elements that don't match.def list = ['a', 'b'] list.retainAll { it == 'b' } assert list == ['b']
See alsofindAll
andgrep
when wanting to produce a new list containing items which match some criteria but leaving the original collection unchanged.- Parameters:
self
- a Collection to be modifiedcondition
- a closure condition- Returns:
- true if this collection changed as a result of the call
- Since:
- 1.7.2
- See Also:
-
retainAll
public static <K,V> boolean retainAll(Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure condition) Modifies this map so that it retains only its elements that are matched according to the specified closure condition. In other words, removes from this map all of its elements that don't match. If the closure takes one parameter then it will be passed theMap.Entry
. Otherwise the closure should take two parameters, which will be the key and the value.def map = [a:1, b:2] map.retainAll { k,v
See also->
k == 'b' } assert map == [b:2]findAll
when wanting to produce a new map containing items which match some criteria but leaving the original map unchanged.- Parameters:
self
- a Map to be modifiedcondition
- a 1 or 2 arg Closure condition applying on the entries- Returns:
- true if this map changed as a result of the call
- Since:
- 2.5.0
-
reverse
Creates a new List with the identical contents to this list but in reverse order.def list = ["a", 4, false] assert list.reverse() == [false, 4, "a"] assert list == ["a", 4, false]
- Parameters:
self
- a List- Returns:
- a reversed List
- Since:
- 1.0
- See Also:
-
reverse
Reverses the elements in a list. If mutate is true, the original list is modified in place and returned. Otherwise, a new list containing the reversed items is produced.def list = ["a", 4, false] assert list.reverse(false) == [false, 4, "a"] assert list == ["a", 4, false] assert list.reverse(true) == [false, 4, "a"] assert list == [false, 4, "a"]
- Parameters:
self
- a Listmutate
- true if the list itself should be reversed in place and returned, false if a new list should be created- Returns:
- a reversed List
- Since:
- 1.8.1
-
reverse
Reverses the iterator. The original iterator will become exhausted of elements after determining the reversed values. A new iterator for iterating through the reversed values is returned.- Parameters:
self
- an Iterator- Returns:
- a reversed Iterator
- Since:
- 1.5.5
-
reverseEach
public static <K,V> Map<K,V> reverseEach(Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<?> closure) Allows a Map to be iterated through in reverse order using a closure. In general, the order in which the map contents are processed cannot be guaranteed. In practise, specialized forms of Map, e.g. a TreeMap will have its contents processed according to the reverse of the natural ordering of the map.- Parameters:
self
- the map over which we iterateclosure
- the 1 or 2 arg closure applied on each entry of the map- Returns:
- returns the self parameter
- Since:
- 1.7.2
- See Also:
-
reverseEach
public static <T> List<T> reverseEach(List<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Iterate over each element of the list in the reverse order.def result = [] [1,2,3].reverseEach { result << it } assert result == [3,2,1]
- Parameters:
self
- a Listclosure
- a closure to which each item is passed.- Returns:
- the original list
- Since:
- 1.5.0
-
rightShift
Implementation of the right shift operator for integral types. Non-integral Number types throw UnsupportedOperationException.- Parameters:
self
- a Number objectoperand
- the shift distance by which to right shift the number- Returns:
- the resulting number
- Since:
- 1.5.0
-
rightShift
Implementation of the right shift operator for BitSets, returning a new BitSet and leaving the original unchanged. TheintValue()
is taken for the shift distance for non-integer operands.- Parameters:
self
- a BitSetoperand
- the shift distance by which to right shift the BitSet- Returns:
- the resulting BitSet
- Since:
- 5.0.0
-
rightShiftUnsigned
Implementation of the right shift (unsigned) operator for integral types. Non-integral Number types throw UnsupportedOperationException.- Parameters:
self
- a Number objectoperand
- the shift distance by which to right shift (unsigned) the number- Returns:
- the resulting number
- Since:
- 1.5.0
-
rightShiftUnsigned
Implementation of the right shift (unsigned) operator for BitSets, returning a new BitSet and leaving the original unchanged. TheintValue()
is taken for the shift distance for non-integer operands.- Parameters:
self
- a BitSetoperand
- the shift distance by which to right shift (unsigned) the BitSet- Returns:
- the resulting BitSet
- Since:
- 5.0.0
-
round
Round the value- Parameters:
number
- a Float- Returns:
- the rounded value of that Float
- Since:
- 1.0
-
round
Round the value- Parameters:
number
- a Floatprecision
- the number of decimal places to keep- Returns:
- the Float rounded to the number of decimal places specified by precision
- Since:
- 1.6.0
-
round
Round the value- Parameters:
number
- a Double- Returns:
- the rounded value of that Double
- Since:
- 1.0
-
round
Round the value- Parameters:
number
- a Doubleprecision
- the number of decimal places to keep- Returns:
- the Double rounded to the number of decimal places specified by precision
- Since:
- 1.6.4
-
round
Round the valueNote that this method differs from
BigDecimal.round(java.math.MathContext)
which specifies the digits to retain starting from the leftmost nonzero digit. This method rounds the integral part to the nearest whole number.- Parameters:
number
- a BigDecimal- Returns:
- the rounded value of that BigDecimal
- Since:
- 2.5.0
- See Also:
-
round
Round the valueNote that this method differs from
BigDecimal.round(java.math.MathContext)
which specifies the digits to retain starting from the leftmost nonzero digit. This method operates on the fractional part of the number and the precision argument specifies the number of digits to the right of the decimal point to retain.- Parameters:
number
- a BigDecimalprecision
- the number of decimal places to keep- Returns:
- a BigDecimal rounded to the number of decimal places specified by precision
- Since:
- 2.5.0
- See Also:
-
runAfter
Allows a simple syntax for using timers. This timer will execute the given closure after the given delay.- Parameters:
timer
- a timer objectdelay
- the delay in milliseconds before running the closure codeclosure
- the closure to invoke- Returns:
- The timer task which has been scheduled.
- Since:
- 1.5.0
-
setMetaClass
Sets the metaclass for a given class.- Parameters:
self
- the class whose metaclass we wish to setmetaClass
- the new MetaClass- Since:
- 1.6.0
-
setMetaClass
Sets the metaclass for an object.- Parameters:
self
- the object whose metaclass we want to setmetaClass
- the new metaclass value- Since:
- 1.6.0
-
setMetaClass
Sets the metaclass for aGroovyObject
.- Parameters:
self
- the object whose metaclass we want to setmetaClass
- the new metaclass value- Since:
- 2.0.0
-
shuffle
Randomly reorders the elements of the specified list.def list = ["a", 4, false] def origSize = list.size() def origCopy = new ArrayList(list) list.shuffle() assert list.size() == origSize assert origCopy.every{ list.contains(it) }
- Parameters:
self
- a List- Since:
- 3.0.0
- See Also:
-
shuffle
Randomly reorders the elements of the specified list using the specified random instance as the source of randomness.def r = new Random() def list = ["a", 4, false] def origSize = list.size() def origCopy = new ArrayList(list) list.shuffle(r) assert list.size() == origSize assert origCopy.every{ list.contains(it) }
- Parameters:
self
- a List- Since:
- 3.0.0
- See Also:
-
shuffled
Creates a new list containing the elements of the specified list but in a random order.def list = ["a", 4, false] def result = list.shuffled() assert list !== result assert list == ["a", 4, false] assert list.size() == result.size() assert list.every{ result.contains(it) }
- Parameters:
self
- a List- Since:
- 3.0.0
- See Also:
-
shuffled
Creates a new list containing the elements of the specified list but in a random order using the specified random instance as the source of randomness.def r = new Random() def list = ["a", 4, false] def result = list.shuffled(r) assert list !== result assert list == ["a", 4, false] assert list.size() == result.size() assert list.every{ result.contains(it) }
- Parameters:
self
- a List- Since:
- 3.0.0
- See Also:
-
size
Provide the standard Groovysize()
method forIterator
. The iterator will become exhausted of elements after determining the size value.- Parameters:
self
- an Iterator- Returns:
- the length of the Iterator
- Since:
- 1.5.5
-
size
Provide the standard Groovysize()
method forIterable
.def items = [1, 2, 3] def iterable = { [ hasNext:{ !items.isEmpty() }, next:{ items.pop() } ] as Iterator } as Iterable assert iterable.size() == 3
- Parameters:
self
- an Iterable- Returns:
- the length of the Iterable
- Since:
- 2.3.8
-
sort
Sorts the Collection. Assumes that the collection items are comparable and uses their natural ordering to determine the resulting order. If the Collection is a List, it is sorted in place and returned. Otherwise, the elements are first placed into a new list which is then sorted and returned - leaving the original Collection unchanged.assert [1,2,3] == [3,1,2].sort()
- Parameters:
self
- the Iterable to be sorted- Returns:
- the sorted Iterable as a List
- Since:
- 2.2.0
- See Also:
-
sort
Sorts the Iterable. Assumes that the Iterable items are comparable and uses their natural ordering to determine the resulting order. If the Iterable is a List and mutate is true, it is sorted in place and returned. Otherwise, the elements are first placed into a new list which is then sorted and returned - leaving the original Iterable unchanged.assert [1,2,3] == [3,1,2].sort()
def orig = [1, 3, 2] def sorted = orig.sort(false) assert orig == [1, 3, 2] assert sorted == [1, 2, 3]
- Parameters:
self
- the iterable to be sortedmutate
- false will always cause a new list to be created, true will mutate lists in place- Returns:
- the sorted iterable as a List
- Since:
- 2.2.0
-
sort
public static <K,V> Map<K,V> sort(Map<K, V> self, @ClosureParams(value=FromString.class,options={"Map.Entry<K,V>","Map.Entry<K,V>,Map.Entry<K,V>"}) Closure closure) Sorts the elements from the given map into a new ordered map using the closure as a comparator to determine the ordering. The original map is unchanged.def map = [a:5, b:3, c:6, d:4].sort { a, b
->
a.value<=>
b.value } assert map == [b:3, d:4, a:5, c:6]- Parameters:
self
- the original unsorted mapclosure
- a Closure used as a comparator- Returns:
- the sorted map
- Since:
- 1.6.0
-
sort
Sorts the elements from the given map into a new ordered Map using the specified key comparator to determine the ordering. The original map is unchanged.def map = [ba:3, cz:6, ab:5].sort({ a, b
->
a[-1]<=>
b[-1] } as Comparator) assert map*.value == [3, 5, 6]- Parameters:
self
- the original unsorted mapcomparator
- a Comparator- Returns:
- the sorted map
- Since:
- 1.7.2
-
sort
Sorts the elements from the given map into a new ordered Map using the natural ordering of the keys to determine the ordering. The original map is unchanged.map = [ba:3, cz:6, ab:5].sort() assert map*.value == [5, 3, 6]
- Parameters:
self
- the original unsorted map- Returns:
- the sorted map
- Since:
- 1.7.2
-
sort
Sorts the given iterator items into a sorted iterator. The items are assumed to be comparable. The original iterator will become exhausted of elements after completing this method call. A new iterator is produced that traverses the items in sorted order.- Parameters:
self
- the Iterator to be sorted- Returns:
- the sorted items as an Iterator
- Since:
- 1.5.5
-
sort
Sorts the given iterator items into a sorted iterator using the comparator. The original iterator will become exhausted of elements after completing this method call. A new iterator is produced that traverses the items in sorted order.- Parameters:
self
- the Iterator to be sortedcomparator
- a Comparator used for comparing items- Returns:
- the sorted items as an Iterator
- Since:
- 1.5.5
-
sort
Sorts the Iterable using the given Comparator. If the Iterable is a List and mutate is true, it is sorted in place and returned. Otherwise, the elements are first placed into a new list which is then sorted and returned - leaving the original Iterable unchanged.assert ["hi","hey","hello"] == ["hello","hi","hey"].sort(false, { a, b
->
a.length()<=>
b.length() } as Comparator )def orig = ["hello","hi","Hey"] def sorted = orig.sort(false, String.CASE_INSENSITIVE_ORDER) assert orig == ["hello","hi","Hey"] assert sorted == ["hello","Hey","hi"]
- Parameters:
self
- the Iterable to be sortedmutate
- false will always cause a new list to be created, true will mutate lists in placecomparator
- a Comparator used for the comparison- Returns:
- a sorted List
- Since:
- 2.2.0
-
sort
public static <T> Iterator<T> sort(Iterator<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Sorts the given iterator items into a sorted iterator using the Closure to determine the correct ordering. The original iterator will be fully processed after the method call.If the closure has two parameters it is used like a traditional Comparator. I.e. it should compare its two parameters for order, returning a negative integer, zero, or a positive integer when the first parameter is less than, equal to, or greater than the second respectively. Otherwise, the Closure is assumed to take a single parameter and return a Comparable (typically an Integer) which is then used for further comparison.
- Parameters:
self
- the Iterator to be sortedclosure
- a Closure used to determine the correct ordering- Returns:
- the sorted items as an Iterator
- Since:
- 1.5.5
-
sort
public static <T> List<T> sort(Iterable<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Sorts this Iterable using the given Closure to determine the correct ordering. If the Iterable is a List, it is sorted in place and returned. Otherwise, the elements are first placed into a new list which is then sorted and returned - leaving the original Iterable unchanged.If the Closure has two parameters it is used like a traditional Comparator. I.e. it should compare its two parameters for order, returning a negative integer, zero, or a positive integer when the first parameter is less than, equal to, or greater than the second respectively. Otherwise, the Closure is assumed to take a single parameter and return a Comparable (typically an Integer) which is then used for further comparison.
assert ["hi","hey","hello"] == ["hello","hi","hey"].sort { it.length() }
assert ["hi","hey","hello"] == ["hello","hi","hey"].sort { a, b
->
a.length()<=>
b.length() }- Parameters:
self
- the Iterable to be sortedclosure
- a 1 or 2 arg Closure used to determine the correct ordering- Returns:
- a newly created sorted List
- Since:
- 2.2.0
- See Also:
-
sort
public static <T> List<T> sort(Iterable<T> self, boolean mutate, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Sorts this Iterable using the given Closure to determine the correct ordering. If the Iterable is a List and mutate is true, it is sorted in place and returned. Otherwise, the elements are first placed into a new list which is then sorted and returned - leaving the original Iterable unchanged.If the closure has two parameters it is used like a traditional Comparator. I.e. it should compare its two parameters for order, returning a negative integer, zero, or a positive integer when the first parameter is less than, equal to, or greater than the second respectively. Otherwise, the Closure is assumed to take a single parameter and return a Comparable (typically an Integer) which is then used for further comparison.
assert ["hi","hey","hello"] == ["hello","hi","hey"].sort { it.length() }
assert ["hi","hey","hello"] == ["hello","hi","hey"].sort { a, b
->
a.length()<=>
b.length() }def orig = ["hello","hi","Hey"] def sorted = orig.sort(false) { it.toUpperCase() } assert orig == ["hello","hi","Hey"] assert sorted == ["hello","Hey","hi"]
- Parameters:
self
- the Iterable to be sortedmutate
- false will always cause a new list to be created, true will mutate lists in placeclosure
- a 1 or 2 arg Closure used to determine the correct ordering- Returns:
- a newly created sorted List
- Since:
- 2.2.0
-
sort
Avoids doing unnecessary work when sorting an already sorted set (i.e. an identity function for an already sorted set).- Parameters:
self
- an already sorted set- Returns:
- the set
- Since:
- 1.0
-
sort
Avoids doing unnecessary work when sorting an already sorted map (i.e. an identity function for an already sorted map).- Parameters:
self
- an already sorted map- Returns:
- the map
- Since:
- 1.8.1
-
split
Splits all items into two lists based on the closure condition. The first list contains all items matching the closure expression. The second list all those that don't.- Parameters:
self
- an Object with an Iterator returning its valuesclosure
- a closure condition- Returns:
- a List whose first item is the accepted values and whose second item is the rejected values
- Since:
- 1.6.0
-
split
public static <T> Collection<Collection<T>> split(Collection<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Splits all items into two collections based on the closure condition. The first list contains all items which match the closure expression. The second list all those that don't.Example usage:
assert [[2,4],[1,3]] == [1,2,3,4].split { it % 2 == 0 }
- Parameters:
self
- a Collection of valuesclosure
- a closure condition- Returns:
- a List whose first item is the accepted values and whose second item is the rejected values
- Since:
- 1.6.0
-
split
public static <T> List<List<T>> split(List<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Splits all items into two collections based on the closure condition. The first list contains all items which match the closure expression. The second list all those that don't.Example usage:
assert [[2,4],[1,3]] == [1,2,3,4].split { it % 2 == 0 }
- Parameters:
self
- a List of valuesclosure
- a closure condition- Returns:
- a List whose first item is the accepted values and whose second item is the rejected values
- Since:
- 2.4.0
-
split
public static <T> List<Set<T>> split(Set<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Splits all items into two collections based on the closure condition. The first list contains all items which match the closure expression. The second list all those that don't.Example usage:
assert [[2,4] as Set, [1,3] as Set] == ([1,2,3,4] as Set).split { it % 2 == 0 }
- Parameters:
self
- a Set of valuesclosure
- a closure condition- Returns:
- a List whose first item is the accepted values and whose second item is the rejected values
- Since:
- 2.4.0
-
spread
Synonym fortoSpreadMap(java.util.Map)
.- Parameters:
self
- a map- Returns:
- a newly created SpreadMap
- Since:
- 1.0
-
sprintf
Sprintf to a string.- Parameters:
self
- any Objectformat
- a format stringvalues
- values referenced by the format specifiers in the format string- Returns:
- the resulting formatted string
- Since:
- 1.5.0
-
sprintf
Returns a formatted string using the specified format string and arguments.- Parameters:
self
- any Objectformat
- A format stringarg
- Argument which is referenced by the format specifiers in the format string. The type ofarg
should be one of Object[], List, int[], short[], byte[], char[], boolean[], long[], float[], or double[].- Returns:
- the resulting printf'd string
- Since:
- 1.5.0
-
step
Iterates from this number up to the given number using a step increment. Each intermediate number is passed to the given closure. Example:0.step( 10, 2 ) { println it }
Prints even numbers 0 through 8.- Parameters:
self
- a Number to start withto
- a Number to go up to, exclusivestepNumber
- a Number representing the step incrementclosure
- the closure to call- Since:
- 1.0
-
subMap
Creates a sub-Map containing the given keys. This method is similar to List.subList() but uses keys rather than index ranges.assert [1:10, 2:20, 4:40].subMap( [2, 4] ) == [2:20, 4:40]
- Parameters:
map
- a Mapkeys
- a Collection of keys- Returns:
- a new Map containing the given keys
- Since:
- 1.0
-
subMap
Creates a sub-Map containing the given keys. This method is similar to List.subList() but uses keys rather than index ranges. The original map is unaltered.def orig = [1:10, 2:20, 3:30, 4:40] assert orig.subMap([1, 3] as int[]) == [1:10, 3:30] assert orig.subMap([2, 4] as Integer[]) == [2:20, 4:40] assert orig.size() == 4
- Parameters:
map
- a Mapkeys
- an array of keys- Returns:
- a new Map containing the given keys
- Since:
- 2.1.0
-
subsequences
Finds all non-null subsequences of a list.Example usage:
def result = [1, 2, 3].subsequences() assert result == [[1, 2, 3], [1, 3], [2, 3], [1, 2], [1], [2], [3]] as Set
- Parameters:
self
- the List of items- Returns:
- the subsequences from the list
- Since:
- 1.7.0
-
sum
Sums the items in an Iterable. This is equivalent to invoking the "plus" method on all items in the Iterable.assert 1+2+3+4 == [1,2,3,4].sum()
- Parameters:
self
- Iterable of values to add together- Returns:
- The sum of all the items
- Since:
- 2.2.0
- See Also:
-
sum
Sums the items from an Iterator. This is equivalent to invoking the "plus" method on all items from the Iterator. The iterator will become exhausted of elements after determining the sum value.- Parameters:
self
- an Iterator for the values to add together- Returns:
- The sum of all the items
- Since:
- 1.5.5
-
sum
Sums the items in an Iterable, adding the result to some initial value.assert 5+1+2+3+4 == [1,2,3,4].sum(5)
- Parameters:
self
- an Iterable of values to suminitialValue
- the items in the collection will be summed to this initial value- Returns:
- The sum of all the items.
- Since:
- 2.2.0
- See Also:
-
sum
Sums the items from an Iterator, adding the result to some initial value. This is equivalent to invoking the "plus" method on all items from the Iterator. The iterator will become exhausted of elements after determining the sum value.- Parameters:
self
- an Iterator for the values to add togetherinitialValue
- the items in the collection will be summed to this initial value- Returns:
- The sum of all the items
- Since:
- 1.5.5
-
sum
public static <T> Object sum(Iterable<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Sums the result of applying a closure to each item of an Iterable.coll.sum(closure)
is equivalent to:coll.collect(closure).sum()
.assert 4+6+10+12 == [2,3,5,6].sum { it * 2 }
- Parameters:
self
- an Iterableclosure
- a single parameter closure that returns a (typically) numeric value.- Returns:
- The sum of the values returned by applying the closure to each item of the Iterable.
- Since:
- 2.2.0
-
sum
public static <T> Object sum(Iterator<T> self, @ClosureParams(FirstGenericType.class) Closure closure) Sums the result of applying a closure to each item returned from an iterator.iter.sum(closure)
is equivalent to:iter.collect(closure).sum()
. The iterator will become exhausted of elements after determining the sum value.- Parameters:
self
- An Iteratorclosure
- a single parameter closure that returns a (typically) numeric value.- Returns:
- The sum of the values returned by applying the closure to each item from the Iterator.
- Since:
- 1.7.1
-
sum
public static <T> Object sum(Iterable<T> self, Object initialValue, @ClosureParams(FirstGenericType.class) Closure closure) Sums the result of applying a closure to each item of an Iterable to some initial value.iter.sum(initVal, closure)
is equivalent to:iter.collect(closure).sum(initVal)
.assert 50+4+6+10+12 == [2,3,5,6].sum(50) { it * 2 }
- Parameters:
self
- an Iterableclosure
- a single parameter closure that returns a (typically) numeric value.initialValue
- the closure results will be summed to this initial value- Returns:
- The sum of the values returned by applying the closure to each item of the collection.
- Since:
- 1.5.0
-
sum
public static <T> Object sum(Iterator<T> self, Object initialValue, @ClosureParams(FirstGenericType.class) Closure closure) Sums the result of applying a closure to each item of an Iterator to some initial value.iter.sum(initVal, closure)
is equivalent to:iter.collect(closure).sum(initVal)
. The iterator will become exhausted of elements after determining the sum value.- Parameters:
self
- an Iteratorclosure
- a single parameter closure that returns a (typically) numeric value.initialValue
- the closure results will be summed to this initial value- Returns:
- The sum of the values returned by applying the closure to each item from the Iterator.
- Since:
- 1.7.1
-
swap
Swaps two elements at the specified positions.Example:
assert [1, 3, 2, 4] == [1, 2, 3, 4].swap(1, 2)
- Parameters:
self
- a Listi
- a positionj
- a position- Returns:
- self
- Since:
- 2.4.0
- See Also:
-
tail
Returns the items from the List excluding the first item.def list = [3, 4, 2] assert list.tail() == [4, 2] assert list == [3, 4, 2]
- Parameters:
self
- a List- Returns:
- a List without its first element
- Throws:
NoSuchElementException
- if you try to access tail() for an empty List- Since:
- 1.5.6
-
tail
Returns the items from the SortedSet excluding the first item.def sortedSet = [3, 4, 2] as SortedSet assert sortedSet.tail() == [3, 4] as SortedSet assert sortedSet == [3, 4, 2] as SortedSet
- Parameters:
self
- a SortedSet- Returns:
- a SortedSet without its first element
- Throws:
NoSuchElementException
- if you try to access tail() for an empty SortedSet- Since:
- 2.4.0
-
tails
Calculates the tail values of this Iterable: the first value will be this list of all items from the iterable and the final one will be an empty list, with the intervening values the results of successive applications of tail on the items.assert [1, 2, 3, 4].tails() == [[1, 2, 3, 4], [2, 3, 4], [3, 4], [4], []]
- Parameters:
self
- an Iterable- Returns:
- a List of the tail values from the given Iterable
- Since:
- 2.5.0
-
tail
Returns the items from the Iterable excluding the first item.def list = [3, 4, 2] assert list.tail() == [4, 2] assert list == [3, 4, 2]
- Parameters:
self
- an Iterable- Returns:
- a collection without its first element
- Throws:
NoSuchElementException
- if you try to access tail() for an empty Iterable- Since:
- 2.4.0
-
tail
Returns the original iterator after throwing away the first element.- Parameters:
self
- the original iterator- Returns:
- the iterator without its first element
- Throws:
NoSuchElementException
- if you try to access tail() for an exhausted/empty Iterator- Since:
- 1.8.1
-
take
Returns the firstnum
elements from the head of this List.def strings = [ 'a', 'b', 'c' ] assert strings.take( 0 ) == [] assert strings.take( 2 ) == [ 'a', 'b' ] assert strings.take( 5 ) == [ 'a', 'b', 'c' ]
- Parameters:
self
- the original Listnum
- the number of elements to take from this List- Returns:
- a List consisting of the first
num
elements from this List, or else all the elements from the List if it has less thannum
elements. - Since:
- 1.8.1
-
take
Returns the firstnum
elements from the head of this SortedSet.def strings = [ 'a', 'b', 'c' ] as SortedSet assert strings.take( 0 ) == [] as SortedSet assert strings.take( 2 ) == [ 'a', 'b' ] as SortedSet assert strings.take( 5 ) == [ 'a', 'b', 'c' ] as SortedSet
- Parameters:
self
- the original SortedSetnum
- the number of elements to take from this SortedSet- Returns:
- a SortedSet consisting of the first
num
elements from this List, or else all the elements from the SortedSet if it has less thannum
elements. - Since:
- 2.4.0
-
take
Returns the firstnum
elements from the head of this Iterable.def strings = [ 'a', 'b', 'c' ] assert strings.take( 0 ) == [] assert strings.take( 2 ) == [ 'a', 'b' ] assert strings.take( 5 ) == [ 'a', 'b', 'c' ] class AbcIterable implements Iterable
{ Iterator iterator() { "abc".iterator() } } def abc = new AbcIterable() assert abc.take(0) == [] assert abc.take(1) == ['a'] assert abc.take(3) == ['a', 'b', 'c'] assert abc.take(5) == ['a', 'b', 'c'] - Parameters:
self
- the original Iterablenum
- the number of elements to take from this Iterable- Returns:
- a Collection consisting of the first
num
elements from this Iterable, or else all the elements from the Iterable if it has less thannum
elements. - Since:
- 1.8.7
-
take
Returns a new map containing the firstnum
elements from the head of this map. If the map instance does not have ordered keys, then this function could return a randomnum
entries. Groovy by default uses LinkedHashMap, so this shouldn't be an issue in the main.def strings = [ 'a':10, 'b':20, 'c':30 ] assert strings.take( 0 ) == [:] assert strings.take( 2 ) == [ 'a':10, 'b':20 ] assert strings.take( 5 ) == [ 'a':10, 'b':20, 'c':30 ]
- Parameters:
self
- the original mapnum
- the number of elements to take from this map- Returns:
- a new map consisting of the first
num
elements of this map, or else the whole map if it has less thannum
elements. - Since:
- 1.8.1
-
take
Returns an iterator of up to the firstnum
elements from this iterator. The original iterator is stepped along bynum
elements.def a = 0 def iter = [ hasNext:{ true }, next:{ a++ } ] as Iterator def iteratorCompare( Iterator a, List b ) { a.collect { it } == b } assert iteratorCompare( iter.take( 0 ), [] ) assert iteratorCompare( iter.take( 2 ), [ 0, 1 ] ) assert iteratorCompare( iter.take( 5 ), [ 2, 3, 4, 5, 6 ] )
- Parameters:
self
- the Iteratornum
- the number of elements to take from this iterator- Returns:
- an iterator consisting of up to the first
num
elements of this iterator. - Since:
- 1.8.1
-
takeRight
Returns the lastnum
elements from the tail of this Iterable.def strings = [ 'a', 'b', 'c' ] assert strings.takeRight( 0 ) == [] assert strings.takeRight( 2 ) == [ 'b', 'c' ] assert strings.takeRight( 5 ) == [ 'a', 'b', 'c' ] class AbcIterable implements Iterable
{ Iterator iterator() { "abc".iterator() } } def abc = new AbcIterable() assert abc.takeRight(0) == [] assert abc.takeRight(1) == ['c'] assert abc.takeRight(3) == ['a', 'b', 'c'] assert abc.takeRight(5) == ['a', 'b', 'c'] - Parameters:
self
- the original Iterablenum
- the number of elements to take from this Iterable- Returns:
- a Collection consisting of the last
num
elements from this Iterable, or else all the elements from the Iterable if it has less thannum
elements. - Since:
- 2.4.0
-
takeRight
Returns the lastnum
elements from the tail of this List.def strings = [ 'a', 'b', 'c' ] assert strings.takeRight( 0 ) == [] assert strings.takeRight( 2 ) == [ 'b', 'c' ] assert strings.takeRight( 5 ) == [ 'a', 'b', 'c' ]
- Parameters:
self
- the original Listnum
- the number of elements to take from this List- Returns:
- a List consisting of the last
num
elements from this List, or else all the elements from the List if it has less thannum
elements. - Since:
- 2.4.0
-
takeRight
Returns the lastnum
elements from the tail of this SortedSet.def strings = [ 'a', 'b', 'c' ] as SortedSet assert strings.takeRight( 0 ) == [] as SortedSet assert strings.takeRight( 2 ) == [ 'b', 'c' ] as SortedSet assert strings.takeRight( 5 ) == [ 'a', 'b', 'c' ] as SortedSet
- Parameters:
self
- the original SortedSetnum
- the number of elements to take from this SortedSet- Returns:
- a SortedSet consisting of the last
num
elements from this SortedSet, or else all the elements from the SortedSet if it has less thannum
elements. - Since:
- 2.4.0
-
takeWhile
public static <T> List<T> takeWhile(List<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Returns the longest prefix of this list where each element passed to the given closure condition evaluates to true. Similar totakeWhile(Iterable, groovy.lang.Closure)
except that it attempts to preserve the type of the original list.def nums = [ 1, 3, 2 ] assert nums.takeWhile{ it
<
1 } == [] assert nums.takeWhile{ it<
3 } == [ 1 ] assert nums.takeWhile{ it<
4 } == [ 1, 3, 2 ]- Parameters:
self
- the original listcondition
- the closure that must evaluate to true to continue taking elements- Returns:
- a prefix of the given list where each element passed to the given closure evaluates to true
- Since:
- 1.8.7
-
takeWhile
public static <T> Collection<T> takeWhile(Iterable<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Returns a Collection containing the longest prefix of the elements from this Iterable where each element passed to the given closure evaluates to true.class AbcIterable implements Iterable
{ Iterator iterator() { "abc".iterator() } } def abc = new AbcIterable() assert abc.takeWhile{ it <
'b' } == ['a'] assert abc.takeWhile{ it<=
'b' } == ['a', 'b']- Parameters:
self
- an Iterablecondition
- the closure that must evaluate to true to continue taking elements- Returns:
- a Collection containing a prefix of the elements from the given Iterable where each element passed to the given closure evaluates to true
- Since:
- 1.8.7
-
takeWhile
public static <T> SortedSet<T> takeWhile(SortedSet<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Returns the longest prefix of this SortedSet where each element passed to the given closure condition evaluates to true. Similar totakeWhile(Iterable, groovy.lang.Closure)
except that it attempts to preserve the type of the original SortedSet.def nums = [ 1, 2, 3 ] as SortedSet assert nums.takeWhile{ it
<
1 } == [] as SortedSet assert nums.takeWhile{ it<
2 } == [ 1 ] as SortedSet assert nums.takeWhile{ it<
4 } == [ 1, 2, 3 ] as SortedSet- Parameters:
self
- the original SortedSetcondition
- the closure that must evaluate to true to continue taking elements- Returns:
- a prefix of the given SortedSet where each element passed to the given closure evaluates to true
- Since:
- 2.4.0
-
takeWhile
public static <K,V> Map<K,V> takeWhile(Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure condition) Returns the longest prefix of this Map where each entry (or key/value pair) when passed to the given closure evaluates to true.def shopping = [milk:1, bread:2, chocolate:3] assert shopping.takeWhile{ it.key.size()
If the map instance does not have ordered keys, then this function could appear to take random entries. Groovy by default uses LinkedHashMap, so this shouldn't be an issue in the main.<
6 } == [milk:1, bread:2] assert shopping.takeWhile{ it.value % 2 } == [milk:1] assert shopping.takeWhile{ k, v->
k.size() + v<=
7 } == [milk:1, bread:2]- Parameters:
self
- a Mapcondition
- a 1 (or 2) arg Closure that must evaluate to true for the entry (or key and value) to continue taking elements- Returns:
- a prefix of the given Map where each entry (or key/value pair) passed to the given closure evaluates to true
- Since:
- 1.8.7
-
takeWhile
public static <T> Iterator<T> takeWhile(Iterator<T> self, @ClosureParams(FirstGenericType.class) Closure condition) Returns the longest prefix of elements in this iterator where each element passed to the given condition closure evaluates to true.def a = 0 def iter = [ hasNext:{ true }, next:{ a++ } ] as Iterator assert [].iterator().takeWhile{ it
<
3 }.toList() == [] assert [1, 2, 3, 4, 5].iterator().takeWhile{ it<
3 }.toList() == [ 1, 2 ] assert iter.takeWhile{ it<
5 }.toList() == [ 0, 1, 2, 3, 4 ]- Parameters:
self
- the Iteratorcondition
- the closure that must evaluate to true to continue taking elements- Returns:
- a prefix of elements in the given iterator where each element passed to the given closure evaluates to true
- Since:
- 1.8.7
-
tap
public static <T,U> U tap(@Target U self, @DelegatesTo(strategy=1) @ClosureParams(FirstParam.class) Closure<T> closure) Allows the closure to be called for the object reference self (similar towith
) and always returns self.Any method invoked inside the closure will first be invoked on the self reference. For instance, the following method calls to the append() method are invoked on the StringBuilder instance:
def b = new StringBuilder().tap { append('foo') append('bar') } assert b.toString() == 'foobar'
This is commonly used to simplify object creation, such as this example:def p = new Person().tap { firstName = 'John' lastName = 'Doe' }
- Parameters:
self
- the object to have a closure act uponclosure
- the closure to call on the object- Returns:
- self
- Since:
- 2.5.0
- See Also:
-
times
public static void times(Number self, @ClosureParams(value=SimpleType.class,options="int") Closure closure) Executes the closure this many times, starting from zero. The current index is passed to the closure each time. Example:10.times { println it }
Prints the numbers 0 through 9.- Parameters:
self
- a Numberclosure
- the closure to call a number of times- Since:
- 1.0
-
toBoolean
Identity conversion which returns Boolean.TRUE for a true Boolean and Boolean.FALSE for a false Boolean.- Parameters:
self
- a Boolean- Returns:
- the original Boolean
- Since:
- 1.7.6
-
toBigDecimal
Transforms a Number into a BigDecimal.- Parameters:
self
- a Number- Returns:
- a BigDecimal
- Since:
- 1.0
-
toBigInteger
Transforms this Number into a BigInteger.- Parameters:
self
- a Number- Returns:
- a BigInteger
- Since:
- 1.0
-
toDouble
Transforms a Number into a Double.- Parameters:
self
- a Number- Returns:
- a Double
- Since:
- 1.0
-
toFloat
Transforms a Number into a Float.- Parameters:
self
- a Number- Returns:
- a Float
- Since:
- 1.0
-
toInteger
Transforms a Number into an Integer.- Parameters:
self
- a Number- Returns:
- an Integer
- Since:
- 1.0
-
toList
Convert an iterator to a List. The iterator will become exhausted of elements after making this conversion.- Parameters:
self
- an iterator- Returns:
- a List
- Since:
- 1.5.0
-
toList
Convert an Iterable to a List. The Iterable's iterator will become exhausted of elements after making this conversion.Example usage:
def x = [1,2,3] as HashSet assert x.class == HashSet assert x.toList() instanceof List
- Parameters:
self
- an Iterable- Returns:
- a List
- Since:
- 1.8.7
-
toList
Convert an enumeration to a List.- Parameters:
self
- an enumeration- Returns:
- a List
- Since:
- 1.5.0
-
toListString
Returns the string representation of the given list. The string displays the contents of the list, similar to a list literal, i.e.[1, 2, a]
.- Parameters:
self
- a Collection- Returns:
- the string representation
- Since:
- 1.0
-
toListString
Returns the string representation of the given list. The string displays the contents of the list, similar to a list literal, i.e.[1, 2, a]
.- Parameters:
self
- a CollectionmaxSize
- stop after approximately this many characters and append '...'- Returns:
- the string representation
- Since:
- 1.7.3
-
toLong
Transforms a Number into a Long.- Parameters:
self
- a Number- Returns:
- a Long
- Since:
- 1.0
-
toLowerCase
Converts the character to lowercase. Synonym for 'Character.toLowerCase(this)'.- Parameters:
self
- a Character to convert- Returns:
- the lowercase equivalent of the character, if any; otherwise, the character itself.
- Since:
- 1.5.7
- See Also:
-
toMapString
Returns the string representation of this map. The string displays the contents of the map, i.e.[one:1, two:2, three:3]
.- Parameters:
self
- a Map- Returns:
- the string representation
- Since:
- 1.0
-
toMapString
Returns the string representation of this map. The string displays the contents of the map, i.e.[one:1, two:2, three:3]
.- Parameters:
self
- a MapmaxSize
- stop after approximately this many characters and append '...'- Returns:
- the string representation
- Since:
- 1.0
-
toSet
Convert a Collection to a Set. Always returns a new Set even if the Collection is already a Set.Example usage:
def result = [1, 2, 2, 2, 3].toSet() assert result instanceof Set assert result == [1, 2, 3] as Set
- Parameters:
self
- a collection- Returns:
- a Set
- Since:
- 1.8.0
-
toSet
Convert an Iterable to a Set. Always returns a new Set even if the Iterable is already a Set.Example usage:
def result = [1, 2, 2, 2, 3].toSet() assert result instanceof Set assert result == [1, 2, 3] as Set
- Parameters:
self
- an Iterable- Returns:
- a Set
- Since:
- 2.4.0
-
toSet
Convert an iterator to a Set. The iterator will become exhausted of elements after making this conversion.- Parameters:
self
- an iterator- Returns:
- a Set
- Since:
- 1.8.0
-
toSet
Convert an enumeration to a Set.- Parameters:
self
- an enumeration- Returns:
- a Set
- Since:
- 1.8.0
-
toSorted
Sorts the Iterable. Assumes that the Iterable elements are comparable and uses aNumberAwareComparator
to determine the resulting order.NumberAwareComparator
has special treatment for numbers but otherwise uses the natural ordering of the Iterable elements. The elements are first placed into a new list which is then sorted and returned - leaving the original Iterable unchanged.def orig = [1, 3, 2] def sorted = orig.toSorted() assert orig == [1, 3, 2] assert sorted == [1, 2, 3]
- Parameters:
self
- the Iterable to be sorted- Returns:
- the sorted iterable as a List
- Since:
- 2.4.0
- See Also:
-
toSorted
Sorts the Iterable using the given Comparator. The elements are first placed into a new list which is then sorted and returned - leaving the original Iterable unchanged.def orig = ["hello","hi","Hey"] def sorted = orig.toSorted(String.CASE_INSENSITIVE_ORDER) assert orig == ["hello","hi","Hey"] assert sorted == ["hello","Hey","hi"]
- Parameters:
self
- the Iterable to be sortedcomparator
- a Comparator used for the comparison- Returns:
- a sorted List
- Since:
- 2.4.0
-
toSorted
public static <T> List<T> toSorted(Iterable<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Sorts this Iterable using the given Closure to determine the correct ordering. The elements are first placed into a new list which is then sorted and returned - leaving the original Iterable unchanged.If the Closure has two parameters it is used like a traditional Comparator. I.e. it should compare its two parameters for order, returning a negative integer, zero, or a positive integer when the first parameter is less than, equal to, or greater than the second respectively. Otherwise, the Closure is assumed to take a single parameter and return a Comparable (typically an Integer) which is then used for further comparison.
assert ["hi","hey","hello"] == ["hello","hi","hey"].sort { it.length() }
assert ["hi","hey","hello"] == ["hello","hi","hey"].sort { a, b
->
a.length()<=>
b.length() }- Parameters:
self
- the Iterable to be sortedclosure
- a 1 or 2 arg Closure used to determine the correct ordering- Returns:
- a newly created sorted List
- Since:
- 2.4.0
- See Also:
-
toSorted
Sorts the Iterator. Assumes that the Iterator elements are comparable and uses aNumberAwareComparator
to determine the resulting order.NumberAwareComparator
has special treatment for numbers but otherwise uses the natural ordering of the Iterator elements. A new iterator is produced that traverses the items in sorted order.- Parameters:
self
- the Iterator to be sorted- Returns:
- the sorted items as an Iterator
- Since:
- 2.4.0
- See Also:
-
toSorted
Sorts the given iterator items using the comparator. The original iterator will become exhausted of elements after completing this method call. A new iterator is produced that traverses the items in sorted order.- Parameters:
self
- the Iterator to be sortedcomparator
- a Comparator used for comparing items- Returns:
- the sorted items as an Iterator
- Since:
- 2.4.0
-
toSorted
public static <T> Iterator<T> toSorted(Iterator<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Sorts the given iterator items into a sorted iterator using the Closure to determine the correct ordering. The original iterator will be fully processed after the method call.If the closure has two parameters it is used like a traditional Comparator. I.e. it should compare its two parameters for order, returning a negative integer, zero, or a positive integer when the first parameter is less than, equal to, or greater than the second respectively. Otherwise, the Closure is assumed to take a single parameter and return a Comparable (typically an Integer) which is then used for further comparison.
- Parameters:
self
- the Iterator to be sortedclosure
- a Closure used to determine the correct ordering- Returns:
- the sorted items as an Iterator
- Since:
- 2.4.0
- See Also:
-
toSorted
Sorts the elements from the given map into a new ordered map using aNumberAwareComparator
on map entry values to determine the resulting order.NumberAwareComparator
has special treatment for numbers but otherwise uses the natural ordering of the Iterator elements. The original map is unchanged.def map = [a:5L, b:3, c:6, d:4.0].toSorted() assert map.toString() == '[b:3, d:4.0, a:5, c:6]'
- Parameters:
self
- the original unsorted map- Returns:
- the sorted map
- Since:
- 2.4.0
-
toSorted
Sorts the elements from the given map into a new ordered map using the supplied comparator to determine the ordering. The original map is unchanged.def keyComparator = [compare: { e1, e2
->
e1.key<=>
e2.key }] as Comparator def valueComparator = [compare: { e1, e2->
e1.value<=>
e2.value }] as Comparator def map1 = [a:5, b:3, d:4, c:6].toSorted(keyComparator) assert map1.toString() == '[a:5, b:3, c:6, d:4]' def map2 = [a:5, b:3, d:4, c:6].toSorted(valueComparator) assert map2.toString() == '[b:3, d:4, a:5, c:6]'- Parameters:
self
- the original unsorted mapcomparator
- a Comparator used for the comparison- Returns:
- the sorted map
- Since:
- 2.4.0
-
toSorted
public static <K,V> Map<K,V> toSorted(Map<K, V> self, @ClosureParams(value=FromString.class,options={"Map.Entry<K,V>","Map.Entry<K,V>,Map.Entry<K,V>"}) Closure condition) Sorts the elements from the given map into a new ordered map using the supplied Closure condition as a comparator to determine the ordering. The original map is unchanged.If the closure has two parameters it is used like a traditional Comparator. I.e. it should compare its two entry parameters for order, returning a negative integer, zero, or a positive integer when the first parameter is less than, equal to, or greater than the second respectively. Otherwise, the Closure is assumed to take a single entry parameter and return a Comparable (typically an Integer) which is then used for further comparison.
def map = [a:5, b:3, c:6, d:4].toSorted { a, b
->
a.value<=>
b.value } assert map.toString() == '[b:3, d:4, a:5, c:6]'- Parameters:
self
- the original unsorted mapcondition
- a Closure used as a comparator- Returns:
- the sorted map
- Since:
- 2.4.0
-
toSorted
Avoids doing unnecessary work when sorting an already sorted set- Parameters:
self
- an already sorted set- Returns:
- an ordered copy of the sorted set
- Since:
- 2.4.0
-
toSorted
Avoids doing unnecessary work when sorting an already sorted map- Parameters:
self
- an already sorted map- Returns:
- an ordered copy of the map
- Since:
- 2.4.0
-
toSpreadMap
Returns a newSpreadMap
from this map.The example below shows the various possible use cases:
def fn(Map m) { return m.a + m.b + m.c + m.d } assert fn(a:1, b:2, c:3, d:4) == 10 assert fn(a:1, *:[b:2, c:3], d:4) == 10 assert fn([a:1, b:2, c:3, d:4].toSpreadMap()) == 10 assert fn((['a', 1, 'b', 2, 'c', 3, 'd', 4] as Object[]).toSpreadMap()) == 10 assert fn(['a', 1, 'b', 2, 'c', 3, 'd', 4].toSpreadMap()) == 10 assert fn(['abcd'.toList(), 1..4].transpose().flatten().toSpreadMap()) == 10
Note that toSpreadMap() is not normally used explicitly but under the covers by Groovy.- Parameters:
self
- a map to be converted into a SpreadMap- Returns:
- a newly created SpreadMap if this map is not null and its size is positive.
- Since:
- 1.0
- See Also:
-
toSpreadMap
Creates a spreadable map from this list.- Parameters:
self
- a list- Returns:
- a newly created SpreadMap
- Since:
- 1.8.0
- See Also:
-
toSpreadMap
Creates a spreadable map from this iterable.- Parameters:
self
- an iterable- Returns:
- a newly created SpreadMap
- Since:
- 2.4.0
- See Also:
-
toString
Returns the string representation of the given map.- Parameters:
self
- a Map- Returns:
- the string representation
- Since:
- 1.0
- See Also:
-
toString
Returns the string representation of the given collection. The string displays the contents of the collection, i.e.[1, 2, a]
.- Parameters:
self
- a Collection- Returns:
- the string representation
- Since:
- 1.0
- See Also:
-
toString
Create a String representation of this object.- Parameters:
value
- an object- Returns:
- a string.
- Since:
- 1.0
-
toUnique
public static <T> Iterator<T> toUnique(Iterator<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure condition) Returns an iterator equivalent to this iterator but with all duplicated items removed where duplicate (equal) items are deduced by calling the supplied Closure condition.If the supplied Closure takes a single parameter, the argument passed will be each element, and the closure should return a value used for comparison (either using
Comparable.compareTo(java.lang.Object)
orObject.equals(java.lang.Object)
). If the closure takes two parameters, two items from the Iterator will be passed as arguments, and the closure should return an int value (with 0 indicating the items are not unique).def items = "Hello".toList() + [null, null] + "there".toList() def toLower = { it == null ? null : it.toLowerCase() } def noDups = items.iterator().toUnique(toLower).toList() assert noDups == ['H', 'e', 'l', 'o', null, 't', 'r']
assert [1,4] == [1,3,4,5].toUnique { it % 2 }
assert [2,3,4] == [2,3,3,4].toUnique { a, b
->
a<=>
b }- Parameters:
self
- an Iteratorcondition
- a Closure used to determine unique items- Returns:
- an Iterator with no duplicate items
- Since:
- 2.4.0
-
toUnique
Returns an iterator equivalent to this iterator with all duplicated items removed by using the supplied comparator.- Parameters:
self
- an Iteratorcomparator
- a Comparator used to determine unique (equal) items Ifnull
, the Comparable natural ordering of the elements will be used.- Returns:
- an Iterator with no duplicate items
- Since:
- 2.4.0
-
toUnique
Returns an iterator equivalent to this iterator with all duplicated items removed by using the natural ordering of the items.- Parameters:
self
- an Iterator- Returns:
- an Iterator with no duplicate items
- Since:
- 2.4.0
-
toUnique
Returns a Collection containing the items from the Iterable but with duplicates removed. The items in the Iterable are compared by the given Comparator. For each duplicate, the first member which is returned from the Iterable is retained, but all other ones are removed.class Person { def fname, lname String toString() { return fname + " " + lname } } class PersonComparator implements Comparator { int compare(Object o1, Object o2) { Person p1 = (Person) o1 Person p2 = (Person) o2 if (p1.lname != p2.lname) return p1.lname.compareTo(p2.lname) else return p1.fname.compareTo(p2.fname) } boolean equals(Object obj) { return this.equals(obj) } } Person a = new Person(fname:"John", lname:"Taylor") Person b = new Person(fname:"Clark", lname:"Taylor") Person c = new Person(fname:"Tom", lname:"Cruz") Person d = new Person(fname:"Clark", lname:"Taylor") def list = [a, b, c, d] List list2 = list.toUnique(new PersonComparator()) assert list2 == [a, b, c]
&&
list == [a, b, c, d]- Parameters:
self
- an Iterablecomparator
- a Comparator used to determine unique (equal) items Ifnull
, the Comparable natural ordering of the elements will be used.- Returns:
- the Collection of non-duplicate items
- Since:
- 2.4.0
-
toUnique
Returns a List containing the items from the List but with duplicates removed. The items in the List are compared by the given Comparator. For each duplicate, the first member which is returned from the List is retained, but all other ones are removed.class Person { def fname, lname String toString() { return fname + " " + lname } } class PersonComparator implements Comparator { int compare(Object o1, Object o2) { Person p1 = (Person) o1 Person p2 = (Person) o2 if (p1.lname != p2.lname) return p1.lname.compareTo(p2.lname) else return p1.fname.compareTo(p2.fname) } boolean equals(Object obj) { return this.equals(obj) } } Person a = new Person(fname:"John", lname:"Taylor") Person b = new Person(fname:"Clark", lname:"Taylor") Person c = new Person(fname:"Tom", lname:"Cruz") Person d = new Person(fname:"Clark", lname:"Taylor") def list = [a, b, c, d] List list2 = list.toUnique(new PersonComparator()) assert list2 == [a, b, c]
&&
list == [a, b, c, d]- Parameters:
self
- a Listcomparator
- a Comparator used to determine unique (equal) items Ifnull
, the Comparable natural ordering of the elements will be used.- Returns:
- the List of non-duplicate items
- Since:
- 2.4.0
-
toUnique
Returns a Collection containing the items from the Iterable but with duplicates removed using the natural ordering of the items to determine uniqueness.String[] letters = ['c', 'a', 't', 's', 'a', 't', 'h', 'a', 't'] String[] expected = ['c', 'a', 't', 's', 'h'] assert letters.toUnique() == expected
- Parameters:
self
- an Iterable- Returns:
- the Collection of non-duplicate items
- Since:
- 2.4.0
-
toUnique
Returns a List containing the items from the List but with duplicates removed using the natural ordering of the items to determine uniqueness.def letters = ['c', 'a', 't', 's', 'a', 't', 'h', 'a', 't'] def expected = ['c', 'a', 't', 's', 'h'] assert letters.toUnique() == expected
- Parameters:
self
- a List- Returns:
- the List of non-duplicate items
- Since:
- 2.4.0
-
toUnique
public static <T> Collection<T> toUnique(Iterable<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure condition) Returns a Collection containing the items from the Iterable but with duplicates removed. The items in the Iterable are compared by the given Closure condition. For each duplicate, the first member which is returned from the Iterable is retained, but all other ones are removed.If the closure takes a single parameter, each element from the Iterable will be passed to the closure. The closure should return a value used for comparison (either using
Comparable.compareTo(java.lang.Object)
orObject.equals(java.lang.Object)
). If the closure takes two parameters, two items from the Iterable will be passed as arguments, and the closure should return an int value (with 0 indicating the items are not unique).class Person { def fname, lname String toString() { return fname + " " + lname } } Person a = new Person(fname:"John", lname:"Taylor") Person b = new Person(fname:"Clark", lname:"Taylor") Person c = new Person(fname:"Tom", lname:"Cruz") Person d = new Person(fname:"Clark", lname:"Taylor") def list = [a, b, c, d] def list2 = list.toUnique{ p1, p2
->
p1.lname != p2.lname ? p1.lname <=> p2.lname : p1.fname <=> p2.fname } assert( list2 == [a, b, c]&&
list == [a, b, c, d] ) def list3 = list.toUnique{ it.toString() } assert( list3 == [a, b, c]&&
list == [a, b, c, d] )- Parameters:
self
- an Iterablecondition
- a Closure used to determine unique items- Returns:
- a new Collection
- Since:
- 2.4.0
- See Also:
-
toUnique
public static <T> List<T> toUnique(List<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure condition) Returns a List containing the items from the List but with duplicates removed. The items in the List are compared by the given Closure condition. For each duplicate, the first member which is returned from the Iterable is retained, but all other ones are removed.If the closure takes a single parameter, each element from the Iterable will be passed to the closure. The closure should return a value used for comparison (either using
Comparable.compareTo(java.lang.Object)
orObject.equals(java.lang.Object)
). If the closure takes two parameters, two items from the Iterable will be passed as arguments, and the closure should return an int value (with 0 indicating the items are not unique).class Person { def fname, lname String toString() { return fname + " " + lname } } Person a = new Person(fname:"John", lname:"Taylor") Person b = new Person(fname:"Clark", lname:"Taylor") Person c = new Person(fname:"Tom", lname:"Cruz") Person d = new Person(fname:"Clark", lname:"Taylor") def list = [a, b, c, d] def list2 = list.toUnique{ p1, p2
->
p1.lname != p2.lname ? p1.lname <=> p2.lname : p1.fname <=> p2.fname } assert( list2 == [a, b, c]&&
list == [a, b, c, d] ) def list3 = list.toUnique{ it.toString() } assert( list3 == [a, b, c]&&
list == [a, b, c, d] )- Parameters:
self
- a Listcondition
- a Closure used to determine unique items- Returns:
- a new List
- Since:
- 2.4.0
- See Also:
-
toUpperCase
Converts the character to uppercase. Synonym for 'Character.toUpperCase(this)'.- Parameters:
self
- a Character to convert- Returns:
- the uppercase equivalent of the character, if any; otherwise, the character itself.
- Since:
- 1.5.7
- See Also:
-
transpose
Adds GroovyCollections#transpose(List) as a method on lists. A Transpose Function takes a collection of columns and returns a collection of rows. The first row consists of the first element from each column. Successive rows are constructed similarly.Example usage:
def result = [['a', 'b'], [1, 2]].transpose() assert result == [['a', 1], ['b', 2]]
def result = [['a', 'b'], [1, 2], [3, 4]].transpose() assert result == [['a', 1, 3], ['b', 2, 4]]
- Parameters:
self
- a List of lists- Returns:
- a List of the transposed lists
- Since:
- 1.5.0
- See Also:
-
trunc
Truncate the value- Parameters:
number
- a Floatprecision
- the number of decimal places to keep- Returns:
- the Float truncated to the number of decimal places specified by precision
- Since:
- 1.6.0
-
trunc
Truncate the value- Parameters:
number
- a Float- Returns:
- the Float truncated to 0 decimal places
- Since:
- 1.6.0
-
trunc
Truncate the value- Parameters:
number
- a Double- Returns:
- the Double truncated to 0 decimal places
- Since:
- 1.6.4
-
trunc
Truncate the value- Parameters:
number
- a Doubleprecision
- the number of decimal places to keep- Returns:
- the Double truncated to the number of decimal places specified by precision
- Since:
- 1.6.4
-
trunc
Truncate the value- Parameters:
number
- a BigDecimal- Returns:
- a BigDecimal truncated to 0 decimal places
- Since:
- 2.5.0
- See Also:
-
trunc
Truncate the value- Parameters:
number
- a BigDecimalprecision
- the number of decimal places to keep- Returns:
- a BigDecimal truncated to the number of decimal places specified by precision
- Since:
- 2.5.0
- See Also:
-
unaryMinus
Negates the number. Equivalent to the '-' operator when it precedes a single operand, i.e.-10
- Parameters:
left
- a Number- Returns:
- the negation of the number
- Since:
- 1.5.0
-
unaryPlus
Returns the number, effectively being a noop for numbers. Operator overloaded form of the '+' operator when it precedes a single operand, i.e.+10
- Parameters:
left
- a Number- Returns:
- the number
- Since:
- 2.2.0
-
union
Create a Collection composed of the union of both collections. Any elements that exist in either collections are added to the resultant collection, such that no elements are duplicated in the resultant collection. For collections of custom objects; the objects should implement java.lang.Comparableassert [1,2,3,4,5,6,7,8] == [1,2,3,4,5].union([4,5,6,7,8])
By default, Groovy uses aNumberAwareComparator
when determining if an element exists in the resultant collection.- Parameters:
left
- a Collectionright
- a Collection- Returns:
- a Collection as a union of both collections
- Since:
- 5.0.0
- See Also:
-
union
public static <T> Collection<T> union(Collection<T> left, Collection<T> right, Comparator<? super T> comparator) Create a Collection composed of the union of both collections. Any elements that exist in either collections are added to the resultant collection, such that no elements are duplicated in the resultant collection. For collections of custom objects; the objects should implement java.lang.Comparableassert [1,2,3,4,5,6] == [1,2,3,4].union([3,4,5,6], Comparator.naturalOrder()) assert [4,8,12,16,20,1,3] == [4,8,12,16,20].union([1,2,3,4], (x, y)
-> x * x <=> y
)def one = ['a', 'B', 'c', 'd'] def two = ['b', 'C', 'd', 'e'] def compareIgnoreCase = { a, b
->
a.toLowerCase()<=>
b.toLowerCase() } assert one.union(two) == ['a', 'B', 'c', 'd', 'b', 'C', 'e'] assert two.union(one) == ['b', 'C', 'd', 'e', 'a', 'B', 'c'] assert one.union(two, compareIgnoreCase) == ['a', 'B', 'c', 'd', 'e'] assert two.union(one, compareIgnoreCase) == ['b', 'C', 'd', 'e', 'a']- Parameters:
left
- a Collectionright
- a Collectioncomparator
- a Comparator- Returns:
- a Collection as a union of both collections
- Since:
- 5.0.0
-
union
Create a Collection composed of the union of both iterables. Any elements that exist in either iterables are added to the resultant collection, such that no elements are duplicated in the resultant collection. For iterables of custom objects; the objects should implement java.lang.Comparableassert [1,2,3,4,5,6,7,8] == [1,2,3,4,5].union([4,5,6,7,8])
By default, Groovy uses aNumberAwareComparator
when determining if an element already exists in the resultant collection.- Parameters:
left
- an Iterableright
- an Iterable- Returns:
- a Collection as a union of both iterables
- Since:
- 5.0.0
- See Also:
-
union
public static <T> Collection<T> union(Iterable<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a Collection composed of the union of both iterables. Any elements that exist in either iterables are added to the resultant collection, such that no elements are duplicated in the resultant collection. For iterables of custom objects; the objects should implement java.lang.Comparableassert [1,2,3,4,5,6] == [1,2,3,4].union([3,4,5,6], Comparator.naturalOrder())
- Parameters:
left
- an Iterableright
- an Iterablecomparator
- a Comparator- Returns:
- a Collection as a union of both iterables
- Since:
- 5.0.0
-
union
public static <T> Collection<T> union(Iterable<T> left, Iterable<T> right, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure condition) Create a Collection composed of the union of both iterables. Elements from the first iterable and second iterable are added to the result if the elements are not already in the result (according to the comparator closure). If the closure takes a single parameter, the argument passed will be each element, and the closure should return a value used for comparison (either usingComparable.compareTo(java.lang.Object)
orObject.equals(java.lang.Object)
). If the closure takes two parameters, two items from the Iterator will be passed as arguments, and the closure should return an int value (with 0 indicating the items are deemed equal).def one = ['a', 'B', 'c', 'd'] def two = ['b', 'C', 'd', 'e'] def compareIgnoreCase = { it.toLowerCase() } assert one.union(two, compareIgnoreCase) == ['a', 'B', 'c', 'd', 'e'] assert two.union(one, compareIgnoreCase) == ['b', 'C', 'd', 'e', 'a']
- Parameters:
left
- an Iterableright
- an Iterablecondition
- a Closure used to determine unique items- Returns:
- a Collection as a union of both iterables
- Since:
- 5.0.0
-
union
Create a List composed of the union of a List and an Iterable. Any elements that exist in both iterables are added to the resultant collection, such that no elements are duplicated in the resultant collection.assert [1,2,3,4,5,6,7,8] == [1,2,3,4,5].union([4,5,6,7,8])
By default, Groovy uses aNumberAwareComparator
when determining if an element already exists in the resultant collection.- Parameters:
left
- a Listright
- an Iterable- Returns:
- a List as a union of a List and an Iterable
- Since:
- 5.0.0
- See Also:
-
union
Create a List composed of the union of a List and an Iterable. Any elements that exist in either iterables are added to the resultant collection, such that no elements are duplicated in the resultant collection.assert [1,2,3,4,5,6] == [1,2,3,4].union([3,4,5,6])
- Parameters:
left
- a Listright
- an Iterablecomparator
- a Comparator- Returns:
- a List as a union of a List and an Iterable
- Since:
- 5.0.0
-
union
Create a Set composed of the union of a Set and an Iterable. Any elements that exist in either iterables are added to the resultant collection, such that no elements are duplicated in the resultant collection.assert [1,2,3,4,5,6,7,8] as Set == ([1,2,3,4,5] as Set).union([4,5,6,7,8])
By default, Groovy uses aNumberAwareComparator
when determining if an element already exists in the resultant collection.- Parameters:
left
- a Setright
- an Iterable- Returns:
- a Set as a union of a Set and an Iterable
- Since:
- 5.0.0
- See Also:
-
union
Create a Set composed of the union of a Set and an Iterable. Any elements that exist in either iterables are added to the resultant collection, such that no elements are duplicated in the resultant collection.assert [1,2,3,4,5,6] as Set == ([1,2,3,4] as Set).union([3,4,5,6], Comparator.naturalOrder())
- Parameters:
left
- a Setright
- an Iterablecomparator
- a Comparator- Returns:
- a Set as a union of a Set and an Iterable
- Since:
- 5.0.0
-
union
Create a SortedSet composed of the union of a SortedSet and an Iterable. Any elements that exist in either iterables are added to the resultant collection, such that no elements are duplicated in the resultant collection.assert [1,2,3,4,5,6,7,8] as SortedSet == ([1,2,3,4,5] as SortedSet).union([4,5,6,7,8])
By default, Groovy uses aNumberAwareComparator
when determining if an element already exists in the resultant collection.- Parameters:
left
- a SortedSetright
- an Iterable- Returns:
- a Set as a union of a SortedSet and an Iterable
- Since:
- 5.0.0
- See Also:
-
union
public static <T> SortedSet<T> union(SortedSet<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a SortedSet composed of the intersection of a SortedSet and an Iterable. Any elements that exist in either iterables are added to the resultant collection, such that no elements are duplicated in the resultant collection.assert [1,2,3,4,5,6,7,8] as SortedSet == ([1,2,3,4,5] as SortedSet).union([4,5,6,7,8])
- Parameters:
left
- a SortedSetright
- an Iterablecomparator
- a Comparator- Returns:
- a Set as a union of a SortedSet and an Iterable
- Since:
- 2.5.0
-
unique
Returns an iterator equivalent to this iterator with all duplicated items removed by using Groovy's default number-aware comparator. The original iterator will become exhausted of elements after determining the unique values. A new iterator for the unique values will be returned.- Parameters:
self
- an Iterator- Returns:
- a new Iterator of the unique items from the original iterator
- Since:
- 1.5.5
-
unique
Modifies this collection to remove all duplicated items, using Groovy's default number-aware comparator.assert [1,3] == [1,3,3].unique()
- Parameters:
self
- a collection- Returns:
- the now modified collection
- Since:
- 1.0
- See Also:
-
unique
Modifies this List to remove all duplicated items, using Groovy's default number-aware comparator.assert [1,3] == [1,3,3].unique()
- Parameters:
self
- a List- Returns:
- the now modified List
- Since:
- 2.4.0
- See Also:
-
unique
Remove all duplicates from a given Collection using Groovy's default number-aware comparator. If mutate is true, it works by modifying the original object (and also returning it). If mutate is false, a new collection is returned leaving the original unchanged.assert [1,3] == [1,3,3].unique()
def orig = [1, 3, 2, 3] def uniq = orig.unique(false) assert orig == [1, 3, 2, 3] assert uniq == [1, 3, 2]
- Parameters:
self
- a collectionmutate
- false will return a new collection containing the unique items from the collection, true will mutate collections in place and return the original collection- Returns:
- a collection with unique elements
- Since:
- 1.8.1
-
unique
Remove all duplicates from a given List using Groovy's default number-aware comparator. If mutate is true, it works by modifying the original object (and also returning it). If mutate is false, a new collection is returned leaving the original unchanged.assert [1,3] == [1,3,3].unique()
def orig = [1, 3, 2, 3] def uniq = orig.unique(false) assert orig == [1, 3, 2, 3] assert uniq == [1, 3, 2]
- Parameters:
self
- a Listmutate
- false will cause a new List containing unique items from the List to be created, true will mutate List in place- Returns:
- the now modified List
- Since:
- 2.4.0
-
unique
public static <T> Iterator<T> unique(Iterator<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure condition) Returns an iterator equivalent to this iterator but with all duplicated items removed by using a Closure to determine duplicate (equal) items. The original iterator will be fully processed after the call.If the closure takes a single parameter, the argument passed will be each element, and the closure should return a value used for comparison (either using
Comparable.compareTo(java.lang.Object)
orObject.equals(java.lang.Object)
). If the closure takes two parameters, two items from the Iterator will be passed as arguments, and the closure should return an int value (with 0 indicating the items are not unique).- Parameters:
self
- an Iteratorcondition
- a Closure used to determine unique items- Returns:
- the modified Iterator
- Since:
- 1.5.5
-
unique
public static <T> Collection<T> unique(Collection<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) A convenience method for making a collection unique using a Closure to determine duplicate (equal) items.If the closure takes a single parameter, the argument passed will be each element, and the closure should return a value used for comparison (either using
Comparable.compareTo(java.lang.Object)
orObject.equals(java.lang.Object)
). If the closure takes two parameters, two items from the collection will be passed as arguments, and the closure should return an int value (with 0 indicating the items are not unique).assert [1,4] == [1,3,4,5].unique { it % 2 }
assert [2,3,4] == [2,3,3,4].unique { a, b
->
a<=>
b }- Parameters:
self
- a Collectionclosure
- a 1 or 2 arg Closure used to determine unique items- Returns:
- self without any duplicates
- Since:
- 1.0
- See Also:
-
unique
public static <T> List<T> unique(List<T> self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) A convenience method for making a List unique using a Closure to determine duplicate (equal) items.If the closure takes a single parameter, the argument passed will be each element, and the closure should return a value used for comparison (either using
Comparable.compareTo(java.lang.Object)
orObject.equals(java.lang.Object)
). If the closure takes two parameters, two items from the List will be passed as arguments, and the closure should return an int value (with 0 indicating the items are not unique).assert [1,4] == [1,3,4,5].unique { it % 2 }
assert [2,3,4] == [2,3,3,4].unique { a, b
->
a<=>
b }- Parameters:
self
- a Listclosure
- a 1 or 2 arg Closure used to determine unique items- Returns:
- self without any duplicates
- Since:
- 2.4.0
- See Also:
-
unique
public static <T> Collection<T> unique(Collection<T> self, boolean mutate, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) A convenience method for making a collection unique using a Closure to determine duplicate (equal) items. If mutate is true, it works on the receiver object and returns it. If mutate is false, a new collection is returned.If the closure takes a single parameter, each element from the Collection will be passed to the closure. The closure should return a value used for comparison (either using
Comparable.compareTo(java.lang.Object)
orObject.equals(java.lang.Object)
). If the closure takes two parameters, two items from the collection will be passed as arguments, and the closure should return an int value (with 0 indicating the items are not unique).def orig = [1, 3, 4, 5] def uniq = orig.unique(false) { it % 2 } assert orig == [1, 3, 4, 5] assert uniq == [1, 4]
def orig = [2, 3, 3, 4] def uniq = orig.unique(false) { a, b
->
a<=>
b } assert orig == [2, 3, 3, 4] assert uniq == [2, 3, 4]- Parameters:
self
- a Collectionmutate
- false will always cause a new list to be created, true will mutate lists in placeclosure
- a 1 or 2 arg Closure used to determine unique items- Returns:
- self without any duplicates
- Since:
- 1.8.1
-
unique
public static <T> List<T> unique(List<T> self, boolean mutate, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) A convenience method for making a List unique using a Closure to determine duplicate (equal) items. If mutate is true, it works on the receiver object and returns it. If mutate is false, a new collection is returned.If the closure takes a single parameter, each element from the List will be passed to the closure. The closure should return a value used for comparison (either using
Comparable.compareTo(java.lang.Object)
orObject.equals(java.lang.Object)
). If the closure takes two parameters, two items from the collection will be passed as arguments, and the closure should return an int value (with 0 indicating the items are not unique).def orig = [1, 3, 4, 5] def uniq = orig.unique(false) { it % 2 } assert orig == [1, 3, 4, 5] assert uniq == [1, 4]
def orig = [2, 3, 3, 4] def uniq = orig.unique(false) { a, b
->
a<=>
b } assert orig == [2, 3, 3, 4] assert uniq == [2, 3, 4]- Parameters:
self
- a Listmutate
- false will always cause a new list to be created, true will mutate lists in placeclosure
- a 1 or 2 arg Closure used to determine unique items- Returns:
- self without any duplicates
- Since:
- 2.4.0
-
unique
Returns an iterator equivalent to this iterator with all duplicated items removed by using the supplied comparator. The original iterator will be exhausted upon returning.- Parameters:
self
- an Iteratorcomparator
- a Comparator- Returns:
- the modified Iterator
- Since:
- 1.5.5
-
unique
Remove all duplicates from a given Collection. Works on the original object (and also returns it). The order of members in the Collection are compared by the given Comparator. For each duplicate, the first member which is returned by the given Collection's iterator is retained, but all other ones are removed. The given Collection's original order is preserved.class Person { def fname, lname String toString() { return fname + " " + lname } } class PersonComparator implements Comparator { int compare(Object o1, Object o2) { Person p1 = (Person) o1 Person p2 = (Person) o2 if (p1.lname != p2.lname) return p1.lname.compareTo(p2.lname) else return p1.fname.compareTo(p2.fname) } boolean equals(Object obj) { return this.equals(obj) } } Person a = new Person(fname:"John", lname:"Taylor") Person b = new Person(fname:"Clark", lname:"Taylor") Person c = new Person(fname:"Tom", lname:"Cruz") Person d = new Person(fname:"Clark", lname:"Taylor") def list = [a, b, c, d] List list2 = list.unique(new PersonComparator()) assert( list2 == list
&&
list == [a, b, c] )- Parameters:
self
- a Collectioncomparator
- a Comparator- Returns:
- self the now modified collection without duplicates
- Since:
- 1.0
- See Also:
-
unique
Remove all duplicates from a given List. Works on the original object (and also returns it). The order of members in the List are compared by the given Comparator. For each duplicate, the first member which is returned by the given List's iterator is retained, but all other ones are removed. The given List's original order is preserved.class Person { def fname, lname String toString() { return fname + " " + lname } } class PersonComparator implements Comparator { int compare(Object o1, Object o2) { Person p1 = (Person) o1 Person p2 = (Person) o2 if (p1.lname != p2.lname) return p1.lname.compareTo(p2.lname) else return p1.fname.compareTo(p2.fname) } boolean equals(Object obj) { return this.equals(obj) } } Person a = new Person(fname:"John", lname:"Taylor") Person b = new Person(fname:"Clark", lname:"Taylor") Person c = new Person(fname:"Tom", lname:"Cruz") Person d = new Person(fname:"Clark", lname:"Taylor") def list = [a, b, c, d] List list2 = list.unique(new PersonComparator()) assert( list2 == list
&&
list == [a, b, c] )- Parameters:
self
- a Listcomparator
- a Comparator- Returns:
- self the now modified List without duplicates
- Since:
- 2.4.0
- See Also:
-
unique
public static <T> Collection<T> unique(Collection<T> self, boolean mutate, Comparator<? super T> comparator) Remove all duplicates from a given Collection. If mutate is true, it works on the original object (and also returns it). If mutate is false, a new collection is returned. The order of members in the Collection are compared by the given Comparator. For each duplicate, the first member which is returned by the given Collection's iterator is retained, but all other ones are removed. The given Collection's original order is preserved.class Person { def fname, lname String toString() { return fname + " " + lname } } class PersonComparator implements Comparator { int compare(Object o1, Object o2) { Person p1 = (Person) o1 Person p2 = (Person) o2 if (p1.lname != p2.lname) return p1.lname.compareTo(p2.lname) else return p1.fname.compareTo(p2.fname) } boolean equals(Object obj) { return this.equals(obj) } } Person a = new Person(fname:"John", lname:"Taylor") Person b = new Person(fname:"Clark", lname:"Taylor") Person c = new Person(fname:"Tom", lname:"Cruz") Person d = new Person(fname:"Clark", lname:"Taylor") def list = [a, b, c, d] List list2 = list.unique(false, new PersonComparator()) assert( list2 != list
&&
list2 == [a, b, c] )- Parameters:
self
- a Collectionmutate
- false will always cause a new collection to be created, true will mutate collections in placecomparator
- a Comparator- Returns:
- self the collection without duplicates
- Since:
- 1.8.1
-
unique
Remove all duplicates from a given List. If mutate is true, it works on the original object (and also returns it). If mutate is false, a new List is returned. The order of members in the List are compared by the given Comparator. For each duplicate, the first member which is returned by the given List's iterator is retained, but all other ones are removed. The given List's original order is preserved.class Person { def fname, lname String toString() { return fname + " " + lname } } class PersonComparator implements Comparator { int compare(Object o1, Object o2) { Person p1 = (Person) o1 Person p2 = (Person) o2 if (p1.lname != p2.lname) return p1.lname.compareTo(p2.lname) else return p1.fname.compareTo(p2.fname) } boolean equals(Object obj) { return this.equals(obj) } } Person a = new Person(fname:"John", lname:"Taylor") Person b = new Person(fname:"Clark", lname:"Taylor") Person c = new Person(fname:"Tom", lname:"Cruz") Person d = new Person(fname:"Clark", lname:"Taylor") def list = [a, b, c, d] List list2 = list.unique(false, new PersonComparator()) assert( list2 != list
&&
list2 == [a, b, c] )- Parameters:
self
- a Listmutate
- false will always cause a new List to be created, true will mutate List in placecomparator
- a Comparator- Returns:
- self the List without duplicates
- Since:
- 2.4.0
-
upto
Iterates from this number up to the given number, inclusive, incrementing by one each time.- Parameters:
self
- a Numberto
- another Number to go up toclosure
- the closure to call- Since:
- 1.0
-
upto
Iterates from this number up to the given number, inclusive, incrementing by one each time.- Parameters:
self
- a longto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
upto
Iterates from this number up to the given number, inclusive, incrementing by one each time.- Parameters:
self
- a Longto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
upto
Iterates from this number up to the given number, inclusive, incrementing by one each time.- Parameters:
self
- a floatto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
upto
Iterates from this number up to the given number, inclusive, incrementing by one each time.- Parameters:
self
- a Floatto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
upto
Iterates from this number up to the given number, inclusive, incrementing by one each time.- Parameters:
self
- a doubleto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
upto
Iterates from this number up to the given number, inclusive, incrementing by one each time.- Parameters:
self
- a Doubleto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
upto
public static void upto(BigInteger self, Number to, @ClosureParams(FirstParam.class) Closure closure) Iterates from this number up to the given number, inclusive, incrementing by one each time. Example:0.upto( 10 ) { println it }
Prints numbers 0 to 10- Parameters:
self
- a BigIntegerto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
upto
public static void upto(BigDecimal self, Number to, @ClosureParams(FirstParam.class) Closure closure) Iterates from this number up to the given number, inclusive, incrementing by one each time.0.1.upto( 10 ) { println it }
Prints numbers 0.1, 1.1, 2.1... to 9.1- Parameters:
self
- a BigDecimalto
- the end numberclosure
- the code to execute for each number- Since:
- 1.0
-
use
Scoped use method- Parameters:
self
- any ObjectcategoryClass
- a category class to useclosure
- the closure to invoke with the category in place- Returns:
- the value returned from the closure
- Since:
- 1.0
-
use
Scoped use method with list of categories.- Parameters:
self
- any ObjectcategoryClassList
- a list of category classesclosure
- the closure to invoke with the categories in place- Returns:
- the value returned from the closure
- Since:
- 1.0
-
use
Allows you to use a list of categories, specifying the list as varargs.use(CategoryClass1, CategoryClass2) { ... }
This method saves having to wrap the category classes in a list.- Parameters:
self
- any Objectarray
- a list of category classes and a Closure- Returns:
- the value returned from the closure
- Since:
- 1.0
-
with
public static <T,U> T with(@Target U self, @DelegatesTo(strategy=1) @ClosureParams(FirstParam.class) Closure<T> closure) Allows the closure to be called for the object reference self.Any method invoked inside the closure will first be invoked on the self reference. For instance, the following method calls to the append() method are invoked on the StringBuilder instance:
def b = new StringBuilder().with { append('foo') append('bar') return it } assert b.toString() == 'foobar'
This is commonly used to simplify object creation, such as this example:def p = new Person().with { firstName = 'John' lastName = 'Doe' return it }
The other typical usage, uses the self object while creating some value:def fullName = person.with{ "$firstName $lastName" }
- Parameters:
self
- the object to have a closure act uponclosure
- the closure to call on the object- Returns:
- result of calling the closure
- Since:
- 1.5.0
- See Also:
-
with
public static <T,U extends T, T withV extends T> (@Target U self, boolean returnIt, @DelegatesTo(strategy=1) @ClosureParams(FirstParam.class) Closure<V> closure) Allows the closure to be called for the object reference self. Any method invoked inside the closure will first be invoked on the self reference. For example, the following method calls to the append() method are invoked on the StringBuilder instance and then, because 'returning' is true, the self instance is returned:def b = new StringBuilder().with(true) { append('foo') append('bar') } assert b.toString() == 'foobar'
The returning parameter is commonly set to true when using with to simplify object creation, such as this example:def p = new Person().with(true) { firstName = 'John' lastName = 'Doe' }
Alternatively, 'tap' is an alias for 'with(true)', so that method can be used instead. The other main use case for with is when returning a value calculated using self as shown here:def fullName = person.with(false){ "$firstName $lastName" }
Alternatively, 'with' is an alias for 'with(false)', so the boolean parameter can be omitted instead.- Parameters:
self
- the object to have a closure act uponreturnIt
- if true, return the self object; otherwise, the result of calling the closureclosure
- the closure to call on the object- Returns:
- the self object or the result of calling the closure depending on
returnIt
- Since:
- 2.5.0
- See Also:
-
withMethodClosure
A utility method for calling a method closure on an object.- Parameters:
self
- the objectmc
- the method closure- Returns:
- the result of calling the method closure
-
withCollectedKeys
public static <K,V> Map<K,V> withCollectedKeys(Iterator<V> values, Map<K, V> collector, Function<? super V, K> keyTransform) A variant of withCollectedKeys for Iterators.- Parameters:
values
- an Iteratorcollector
- the Map into which the transformed entries are putkeyTransform
- a function for transforming Iterator elements into values- Returns:
- the collector with all transformed values added to it
- Since:
- 5.0.0
- See Also:
-
withCollectedKeys
public static <K,V> Map<K,V> withCollectedKeys(Iterator<V> values, Function<? super V, K> keyTransform) A variant of withCollectedKeys for Iterators.- Parameters:
values
- an IteratorkeyTransform
- a function for transforming Iterator elements into values- Returns:
- a Map of the transformed entries
- Since:
- 5.0.0
- See Also:
-
withCollectedKeys
public static <K,V> Map<K,V> withCollectedKeys(Iterable<V> values, Map<K, V> collector, Function<? super V, K> keyTransform) Transform Iterable elements into Map entries with values unchanged and keys transformed using the supplied function. The supplied map is used as the destination for transformed entries.def languages = ['Groovy', 'Java', 'Kotlin', 'Scala'] def firstLetter = s
This method is a convenience method for->
s[0] assert languages.withCollectedKeys([C:'Clojure'], firstLetter) == [C:'Clojure', G:'Groovy', J:'Java', K:'Kotlin', S:'Scala']collectEntries(Iterable, Map, Function, Function)
with thevalueTransform
replaced byFunction.identity()
or {Closure.IDENTITY}.- Parameters:
values
- an Iterable that will become the added entry valuescollector
- the Map into which the transformed entries are putkeyTransform
- a function for transforming Iterator elements into keys- Returns:
- the collector with all transformed values added to it
- Since:
- 5.0.0
-
withCollectedKeys
public static <K,V> Map<K,V> withCollectedKeys(Iterable<V> values, Function<? super V, K> keyTransform) Transform Iterable elements into Map entries with values unchanged and keys transformed using the supplied function.def languages = ['Groovy', 'Java', 'Kotlin', 'Scala'] def firstLetter = s
This method is a convenience method for->
s[0] assert languages.withCollectedKeys(firstLetter) == [G:'Groovy', J:'Java', K:'Kotlin', S:'Scala']collectEntries(Iterable, Function, Function)
with thevalueTransform
replaced byFunction.identity()
or {Closure.IDENTITY}.- Parameters:
values
- an Iterable that will become the added entry valueskeyTransform
- a function for transforming Iterator elements into keys- Returns:
- the collector with all transformed values added to it
- Since:
- 5.0.0
-
withCollectedValues
public static <K,V> Map<K,V> withCollectedValues(Iterator<K> keys, Map<K, V> collector, Function<? super K, V> valueTransform) A variant of withCollectedValues for Iterators.- Parameters:
keys
- an Iteratorcollector
- the Map into which the transformed entries are putvalueTransform
- a function for transforming Iterator elements into values- Returns:
- the collector with all transformed values added to it
- Since:
- 5.0.0
- See Also:
-
withCollectedValues
public static <K,V> Map<K,V> withCollectedValues(Iterator<K> keys, Function<? super K, V> valueTransform) A variant of withCollectedValues for Iterators.- Parameters:
keys
- an IteratorvalueTransform
- a function for transforming Iterator elements into values- Returns:
- a Map of the transformed entries
- Since:
- 5.0.0
- See Also:
-
withCollectedValues
public static <K,V> Map<K,V> withCollectedValues(Iterable<K> keys, Map<K, V> collector, Function<? super K, V> valueTransform) Transform Iterable elements into Map entries with keys unchanged and values transformed using the supplied function. The supplied collector map is used as the destination for transformed entries.def languages = ['Groovy', 'Java', 'Kotlin', 'Scala'] assert languages.withCollectedValues([Clojure:7], String::size) == [Clojure:7, Groovy:6, Java:4, Kotlin:6, Scala:5]
This method is a convenience method forcollectEntries(Iterable, Map, Function, Function)
with thekeyTransform
replaced byFunction.identity()
or {Closure.IDENTITY}.- Parameters:
keys
- an Iterablecollector
- the Map into which the transformed entries are putvalueTransform
- a function for transforming Iterable elements into values- Returns:
- the collector with all transformed values added to it
- Since:
- 5.0.0
-
withCollectedValues
public static <K,V> Map<K,V> withCollectedValues(Iterable<K> keys, Function<? super K, V> valueTransform) Transform Iterable elements into Map entries with keys unchanged and values transformed using the supplied function.def languages = ['Groovy', 'Java', 'Kotlin', 'Scala'] assert languages.withCollectedValues(String::size) == [Groovy:6, Java:4, Kotlin:6, Scala:5]
This method is a convenience method forcollectEntries(Iterable, Function, Function)
with thekeyTransform
replaced byFunction.identity()
or {Closure.IDENTITY}.- Parameters:
keys
- an IterablevalueTransform
- a function for transforming Iterable elements into values- Returns:
- a Map of the transformed entries
- Since:
- 5.0.0
-
withDefault
public static <K,V> Map<K,V> withDefault(Map<K, V> self, @ClosureParams(FirstGenericType.class) Closure<V> init) Wraps a map using the decorator pattern with a wrapper that intercepts all calls toget(key)
. If an unknown key is found, a default value will be stored into the Map before being returned. The default value stored will be the result of calling the supplied Closure with the key as the parameter to the Closure. Example usage:def map = [a:1, b:2].withDefault{ k
->
k.toCharacter().isLowerCase() ? 10 : -10 } def expected = [a:1, b:2, c:10, D:-10] assert expected.every{ e->
e.value == map[e.key] } def constMap = [:].withDefault{ 42 } assert constMap.foo == 42 assert constMap.size() == 1- Parameters:
self
- a Mapinit
- a Closure which is passed the unknown key- Returns:
- the wrapped Map
- Since:
- 1.7.1
- See Also:
-
withDefault
public static <K,V> Map<K,V> withDefault(Map<K, V> self, boolean autoGrow, boolean autoShrink, @ClosureParams(FirstGenericType.class) Closure<V> init) Wraps a map using the decorator pattern with a wrapper that intercepts all calls toget(key)
andput(key, value)
. If an unknown key is found forget
, a default value will be returned. The default value will be the result of calling the supplied Closure with the key as the parameter to the Closure. IfautoGrow
is set, the value will be stored into the map. IfautoShrink
is set, then an attempt toput
the default value into the map is ignored and indeed any existing value would be removed. If you wish the backing map to be as small as possible, consider settingautoGrow
tofalse
andautoShrink
totrue
. This keeps the backing map as small as possible, i.e. sparse, but also means thatcontainsKey
,keySet
,size
, and other methods will only reflect the sparse values. If you are wrapping an immutable map, you should setautoGrow
andautoShrink
tofalse
. In this scenario, theget
method is essentially a shorthand for callinggetOrDefault
with the default value supplied once as a Closure. Example usage:// sparse map example def answers = [life: 100].withDefault(false, true){ 42 } assert answers.size() == 1 assert answers.foo == 42 assert answers.size() == 1 answers.life = 42 answers.putAll(universe: 42, everything: 42) assert answers.size() == 0 // immutable map example def certainties = [death: true, taxes: true].asImmutable().withDefault(false, false){ false } assert certainties.size() == 2 assert certainties.wealth == false assert certainties.size() == 2
- Parameters:
self
- a MapautoGrow
- whether calling get could potentially grow the map if the key isn't foundautoShrink
- whether calling put with the default value could potentially shrink the mapinit
- a Closure which is passed the unknown key- Returns:
- the wrapped Map
- Since:
- 4.0.1
-
withDefault
public static <T> ListWithDefault<T> withDefault(List<T> self, @ClosureParams(value=SimpleType.class,options="int") Closure<T> init) An alias forwithLazyDefault
which decorates a list allowing it to grow when called with index values outside the normal list bounds.- Parameters:
self
- a Listinit
- a Closure with the target index as parameter which generates the default value- Returns:
- the decorated List
- Since:
- 1.8.7
- See Also:
-
withEagerDefault
public static <T> ListWithDefault<T> withEagerDefault(List<T> self, @ClosureParams(value=SimpleType.class,options="int") Closure<T> init) Decorates a list allowing it to grow when called with a non-existent index value. When called with such values, the list is grown in size and a default value is placed in the list by calling a suppliedinit
Closure. Null values can be stored in the list.How it works: The decorated list intercepts all calls to
getAt(index)
andget(index)
. If an index greater than or equal to the currentsize()
is used, the list will grow automatically up to the specified index. Gaps will be filled by calling theinit
Closure. If generating a default value is a costly operation consider usingwithLazyDefault
.Example usage:
def list = [0, 1].withEagerDefault{ 42 } assert list[0] == 0 assert list[1] == 1 assert list[3] == 42 // default value assert list == [0, 1, 42, 42] // gap filled with default value // illustrate using the index when generating default values def list2 = [5].withEagerDefault{ index
->
index * index } assert list2[3] == 9 assert list2 == [5, 1, 4, 9] // illustrate what happens with null values list2[2] = null assert list2[2] == null assert list2 == [5, 1, null, 9]- Parameters:
self
- a Listinit
- a Closure with the target index as parameter which generates the default value- Returns:
- the wrapped List
- Since:
- 1.8.7
-
withLazyDefault
public static <T> ListWithDefault<T> withLazyDefault(List<T> self, @ClosureParams(value=SimpleType.class,options="int") Closure<T> init) Decorates a list allowing it to grow when called with a non-existent index value. When called with such values, the list is grown in size and a default value is placed in the list by calling a suppliedinit
Closure. Subsequent retrieval operations if finding a null value in the list assume it was set as null from an earlier growing operation and again call theinit
Closure to populate the retrieved value; consequently the list can't be used to store null values.How it works: The decorated list intercepts all calls to
getAt(index)
andget(index)
. If an index greater than or equal to the currentsize()
is used, the list will grow automatically up to the specified index. Gaps will be filled bynull
. If a default value should also be used to fill gaps instead ofnull
, usewithEagerDefault
. IfgetAt(index)
orget(index)
are called and a null value is found, it is assumed that the null value was a consequence of an earlier grow list operation and theinit
Closure is called to populate the value.Example usage:
def list = [0, 1].withLazyDefault{ 42 } assert list[0] == 0 assert list[1] == 1 assert list[3] == 42 // default value assert list == [0, 1, null, 42] // gap filled with null // illustrate using the index when generating default values def list2 = [5].withLazyDefault{ index
->
index * index } assert list2[3] == 9 assert list2 == [5, null, null, 9] assert list2[2] == 4 assert list2 == [5, null, 4, 9] // illustrate what happens with null values list2[2] = null assert list2[2] == 4- Parameters:
self
- a Listinit
- a Closure with the target index as parameter which generates the default value- Returns:
- the decorated List
- Since:
- 1.8.7
-
withIndex
Zips an Iterable with indices in (value, index) order. Example usage:assert [["a", 0], ["b", 1]] == ["a", "b"].withIndex() assert ["0: a", "1: b"] == ["a", "b"].withIndex().collect { str, idx
->
"$idx: $str" }- Parameters:
self
- an Iterable- Returns:
- a zipped list with indices
- Since:
- 2.4.0
- See Also:
-
withIndex
Zips an Iterable with indices in (value, index) order. Example usage:assert [["a", 5], ["b", 6]] == ["a", "b"].withIndex(5) assert ["1: a", "2: b"] == ["a", "b"].withIndex(1).collect { str, idx
->
"$idx: $str" }- Parameters:
self
- an Iterableoffset
- an index to start from- Returns:
- a zipped list with indices
- Since:
- 2.4.0
- See Also:
-
withIndex
Zips an iterator with indices in (value, index) order. Example usage:assert [["a", 0], ["b", 1]] == ["a", "b"].iterator().withIndex().toList() assert ["0: a", "1: b"] == ["a", "b"].iterator().withIndex().collect { str, idx
->
"$idx: $str" }.toList()- Parameters:
self
- an iterator- Returns:
- a zipped iterator with indices
- Since:
- 2.4.0
- See Also:
-
withIndex
Zips an iterator with indices in (value, index) order. Example usage:assert [["a", 5], ["b", 6]] == ["a", "b"].iterator().withIndex(5).toList() assert ["1: a", "2: b"] == ["a", "b"].iterator().withIndex(1).collect { str, idx
->
"$idx: $str" }.toList()- Parameters:
self
- an iteratoroffset
- an index to start from- Returns:
- a zipped iterator with indices
- Since:
- 2.4.0
- See Also:
-
zip
An iterator of all the pairs of two Iterables.def one = ['cat', 'spider'] def two = ['fish', 'monkey'] assert ['catfish', 'spidermonkey'] == one.zip(two).collect{ a, b -> a + b } assert [one, two].transpose() == one.zip(two).toList()
- Parameters:
self
- an Iterableother
- another Iterable- Returns:
- an iterator of all the pairs from self and other
- Since:
- 5.0.0
-
zip
An iterator of all the pairs of two Iterators.def small = [1, 2, 3].iterator() def large = [100, 200, 300].iterator() assert [101, 202, 303] == small.zip(large).collect{ a, b -> a + b } assert [small.toList(), large.toList()].transpose() == small.zip(large).toList()
- Parameters:
self
- an Iteratorother
- another Iterator- Returns:
- an iterator of all the pairs from self and other
- Since:
- 5.0.0
-
withTraits
Dynamically wraps an instance into something which implements the supplied trait classes. It is guaranteed that the returned object will implement the trait interfaces, but the original type of the object is lost (replaced with a proxy).- Parameters:
self
- object to be wrappedtraits
- a list of trait classes- Returns:
- a proxy implementing the trait interfaces
-
xor
Bitwise XOR together two Numbers. Called when the '^' operator is used.- Parameters:
left
- a Numberright
- another Number to bitwise XOR- Returns:
- the bitwise XOR of both Numbers
- Since:
- 1.0
-
xor
Bitwise XOR together two BitSets. Called when the '^' operator is used between two bit sets.- Parameters:
left
- a BitSetright
- another BitSet to bitwise XOR- Returns:
- the bitwise XOR of both BitSets
- Since:
- 1.5.0
-
xor
Exclusive disjunction of two boolean operators- Parameters:
left
- left operatorright
- right operator- Returns:
- result of exclusive disjunction
- Since:
- 1.0
-
xor
Create a Set composed of the symmetric difference of a Set and an Iterable. Any elements that exit in only one are added to the resultant Set.This operation will always create a new object for the result, while the operands remain unchanged.
def a = [1,2,3,4] as Set def b = [3,4,5,6] as Set assert (a ^ b) == [1,2,5,6] as Set
By default, Groovy uses aNumberAwareComparator
when determining if an element exists in both sets.- Parameters:
left
- a Setright
- an Iterable- Returns:
- a Set as a symmetric difference of a Set and an Iterable
- Since:
- 5.0.0
-
xor
Create a Set composed of the symmetric difference of a Set and an Iterable. Any elements that exit in only one are added to the resultant Set.This operation will always create a new object for the result, while the operands remain unchanged.
assert [1,2,5,6] as Set == ([1,2,3,4] as Set).xor([3,4,5,6], Comparator.naturalOrder())
- Parameters:
left
- a Setright
- an Iterablecomparator
- a Comparator- Returns:
- a Set as a symmetric difference of a Set and an Iterable
- Since:
- 5.0.0
-
xor
Create a SortedSet composed of the symmetric difference of a SortedSet and an Iterable. Any elements that exist in only one of the sets are added to the resultant SortedSet.This operation will always create a new object for the result, while the operands remain unchanged.
def a = [1,2,3,4] as SortedSet def b = [3,4,5,6] as Set assert (a ^ b) == [1,2,5,6] as SortedSet
By default, Groovy uses aNumberAwareComparator
when determining if an element exists in both sets.- Parameters:
left
- a SortedSetright
- an Iterable- Returns:
- a SortedSet as a symmetric difference of a SortedSet and an Iterable
- Since:
- 5.0.0
-
xor
public static <T> SortedSet<T> xor(SortedSet<T> left, Iterable<T> right, Comparator<? super T> comparator) Create a SortedSet composed of the symmetric difference of a SortedSet and an Iterable. Any elements that exit in only one are added to the resultant SortedSet.This operation will always create a new object for the result, while the operands remain unchanged.
assert [1,2,5,6] as SortedSet == ([1,2,3,4] as SortedSet).xor([3,4,5,6], Comparator.naturalOrder())
- Parameters:
left
- a SortedSetright
- an Iterablecomparator
- a Comparator- Returns:
- a SortedSet as a symmetric difference of a SortedSet and an Iterable
- Since:
- 5.0.0
-
any
@Deprecated(since="5.0.0") public static <T> boolean any(T[] self, @ClosureParams(Component.class) Closure predicate) Deprecated. -
asBoolean
Deprecated. -
asBoolean
Deprecated. -
asBoolean
Deprecated. -
asBoolean
Deprecated. -
asBoolean
Deprecated. -
asBoolean
Deprecated. -
asBoolean
Deprecated. -
asBoolean
Deprecated. -
asBoolean
Deprecated. -
asType
Deprecated. -
average
Deprecated. -
average
Deprecated. -
average
Deprecated. -
average
Deprecated. -
average
Deprecated. -
average
Deprecated. -
average
Deprecated. -
average
@Deprecated(since="5.0.0") public static <T> Object average(T[] self, @ClosureParams(Component.class) Closure closure) Deprecated. -
chop
Deprecated. -
collate
Deprecated. -
collate
Deprecated. -
collate
@Deprecated(since="5.0.0") public static <T> List<List<T>> collate(T[] self, int size, boolean keepRemainder) Deprecated. -
collate
@Deprecated(since="5.0.0") public static <T> List<List<T>> collate(T[] self, int size, int step, boolean keepRemainder) Deprecated. -
collect
@Deprecated(since="5.0.0") public static <E,T> List<T> collect(E[] self, @ClosureParams(Component.class) Closure<T> transform) Deprecated. -
collect
@Deprecated(since="5.0.0") public static <E,T, C collectC extends Collection<T>> (E[] self, C collector, @ClosureParams(Component.class) Closure<? extends T> transform) Deprecated. -
collectEntries
Deprecated. -
collectEntries
@Deprecated(since="5.0.0") public static <K,V, Map<K,E> V> collectEntries(E[] self, Map<K, V> collector) Deprecated. -
collectEntries
@Deprecated(since="5.0.0") public static <K,V, Map<K,E> V> collectEntries(E[] self, @ClosureParams(Component.class) Closure<?> transform) Deprecated. -
collectEntries
@Deprecated(since="5.0.0") public static <K,V, Map<K,E> V> collectEntries(E[] self, Map<K, V> collector, @ClosureParams(Component.class) Closure<?> transform) Deprecated. -
collectMany
@Deprecated(since="5.0.0") public static <T,E> List<T> collectMany(E[] self, @ClosureParams(Component.class) Closure<? extends Collection<? extends T>> projection) Deprecated. -
collectMany
@Deprecated(since="5.0.0") public static <T,E, C collectManyC extends Collection<T>> (E[] self, C collector, @ClosureParams(Component.class) Closure<? extends Collection<? extends T>> projection) Deprecated. -
collectMany$$bridge
@Deprecated public static <T,K, Collection<T> collectMany$$bridgeV> (Map<K, V> self, @ClosureParams(MapEntryOrKeyValue.class) Closure<? extends Collection<? extends T>> projection) Deprecated. -
contains
Deprecated. -
contains
Deprecated. -
contains
Deprecated. -
contains
Deprecated. -
contains
Deprecated. -
contains
Deprecated. -
contains
Deprecated. -
contains
Deprecated. -
contains
Deprecated. -
count
Deprecated. -
count
Deprecated. -
count
Deprecated. -
count
Deprecated. -
count
Deprecated. -
count
Deprecated. -
count
Deprecated. -
count
Deprecated. -
count
Deprecated. -
count
@Deprecated(since="5.0.0") public static <T> Number count(T[] self, @ClosureParams(Component.class) Closure predicate) Deprecated. -
countBy
@Deprecated(since="5.0.0") public static <K,E> Map<K,Integer> countBy(E[] self, @ClosureParams(Component.class) Closure<K> closure) Deprecated. -
drop
Deprecated. -
dropRight
Deprecated. -
dropWhile
@Deprecated(since="5.0.0") public static <T> T[] dropWhile(T[] self, @ClosureParams(Component.class) Closure<?> condition) Deprecated. -
each
@Deprecated(since="5.0.0") public static <T> T[] each(T[] self, @ClosureParams(Component.class) Closure closure) Deprecated. -
eachByte
@Deprecated(since="5.0.0") public static void eachByte(byte[] self, @ClosureParams(Component.class) Closure closure) Deprecated. -
eachByte
@Deprecated(since="5.0.0") public static void eachByte(Byte[] self, @ClosureParams(Component.class) Closure closure) Deprecated. -
eachWithIndex
@Deprecated(since="5.0.0") public static <T> T[] eachWithIndex(T[] self, @ClosureParams(value=FromString.class,options="T,Integer") Closure closure) Deprecated. -
equals
Deprecated. -
equals
Deprecated. -
every
@Deprecated(since="5.0.0") public static <T> boolean every(T[] self, @ClosureParams(Component.class) Closure predicate) Deprecated. -
find
@Deprecated(since="5.0.0") public static <T> T find(T[] self, @ClosureParams(Component.class) Closure condition) Deprecated. -
findAll
Deprecated. -
findAll
@Deprecated(since="5.0.0") public static <T> List<T> findAll(T[] self, @ClosureParams(Component.class) Closure condition) Deprecated. -
findAll$$bridge
Deprecated. -
findAll$$bridge
Deprecated. -
findAll$$bridge
Deprecated. -
findAll$$bridge
@Deprecated public static <T> Collection<T> findAll$$bridge(T[] self, @ClosureParams(Component.class) Closure condition) Deprecated. -
findIndexValues
@Deprecated(since="5.0.0") public static <T> List<Number> findIndexValues(T[] self, @ClosureParams(Component.class) Closure condition) Deprecated. -
findIndexValues
@Deprecated(since="5.0.0") public static <T> List<Number> findIndexValues(T[] self, Number startIndex, @ClosureParams(Component.class) Closure condition) Deprecated. -
findIndexOf
@Deprecated(since="5.0.0") public static <T> int findIndexOf(T[] self, @ClosureParams(Component.class) Closure condition) Deprecated. -
findIndexOf
@Deprecated(since="5.0.0") public static <T> int findIndexOf(T[] self, int startIndex, @ClosureParams(Component.class) Closure condition) Deprecated. -
findLastIndexOf
@Deprecated(since="5.0.0") public static <T> int findLastIndexOf(T[] self, @ClosureParams(Component.class) Closure condition) Deprecated. -
findLastIndexOf
@Deprecated(since="5.0.0") public static <T> int findLastIndexOf(T[] self, int startIndex, @ClosureParams(Component.class) Closure condition) Deprecated. -
findResult
Deprecated. -
findResult
@Deprecated(since="5.0.0") public static <T,U extends T, T findResultV extends T> (U[] self, V defaultResult) Deprecated. -
findResult
@Deprecated(since="5.0.0") public static <S,T> T findResult(S[] self, @ClosureParams(Component.class) Closure<T> condition) Deprecated. -
findResult
@Deprecated(since="5.0.0") public static <S,T, T findResultU extends T, V extends T> (S[] self, U defaultResult, @ClosureParams(Component.class) Closure<V> condition) Deprecated. -
findResults
Deprecated. -
findResults
@Deprecated(since="5.0.0") public static <T,U> Collection<T> findResults(U[] self, @ClosureParams(Component.class) Closure<T> filteringTransform) Deprecated. -
first
Deprecated. -
flatten
Deprecated. -
flatten
Deprecated. -
flatten
Deprecated. -
flatten
Deprecated. -
flatten
Deprecated. -
flatten
Deprecated. -
flatten
Deprecated. -
flatten
Deprecated. -
flatten
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getAt
Deprecated. -
getIndices
Deprecated. -
getIndices
Deprecated. -
getIndices
Deprecated. -
getIndices
Deprecated. -
getIndices
Deprecated. -
getIndices
Deprecated. -
getIndices
Deprecated. -
getIndices
Deprecated. -
getIndices
Deprecated. -
grep
Deprecated. -
grep
Deprecated. -
groupBy
@Deprecated(since="5.0.0") public static <K,T> Map<K,List<T>> groupBy(T[] self, @ClosureParams(Component.class) Closure<K> closure) Deprecated. -
groupBy
Deprecated. -
groupBy
Deprecated. -
head
Deprecated. -
indexed
Deprecated. -
indexed
Deprecated. -
indexed
Deprecated. -
indexed
Deprecated. -
indexed
Deprecated. -
indexed
Deprecated. -
init
Deprecated. -
inject
@Deprecated(since="5.0.0") public static <E extends T,T, T injectV extends T> (E[] self, @ClosureParams(value=FromString.class,options="T,E") Closure<V> closure) Deprecated. -
inject
@Deprecated(since="5.0.0") public static <E extends T,T, T injectV extends T> (Collection<E> self, @ClosureParams(value=FromString.class,options="T,E") Closure<V> closure) Deprecated. -
inject
@Deprecated(since="5.0.0") public static <E,T, T injectU extends T, V extends T> (E[] self, U initialValue, @ClosureParams(value=FromString.class,options="T,E") Closure<V> closure) Deprecated. -
inject
@Deprecated(since="5.0.0") public static <E,T, T injectU extends T, V extends T> (Collection<E> self, U initialValue, @ClosureParams(value=FromString.class,options="T,E") Closure<V> closure) Deprecated. -
iterator
Deprecated. -
join
Deprecated. -
join
Deprecated. -
join
Deprecated. -
join
Deprecated. -
join
Deprecated. -
join
Deprecated. -
join
Deprecated. -
join
Deprecated. -
join
Deprecated. -
last
Deprecated. -
max
Deprecated. -
max
Deprecated. -
max
Deprecated. -
max
Deprecated. -
max
Deprecated. -
max
@Deprecated(since="5.0.0") public static <T> T max(T[] self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Deprecated. -
min
Deprecated. -
min
Deprecated. -
min
Deprecated. -
min
Deprecated. -
min
Deprecated. -
min
@Deprecated(since="5.0.0") public static <T> T min(T[] self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Deprecated. -
minus
Deprecated. -
minus
Deprecated. -
minus
Deprecated. -
plus
Deprecated. -
plus
Deprecated. -
plus
Deprecated. -
plus
Deprecated. -
primitiveArrayGet
Deprecated.Implements the getAt(int) method for primitive type arrays.- Parameters:
self
- an array objectidx
- the index of interest- Returns:
- the returned value from the array
- Since:
- 1.5.0
-
primitiveArrayGet
Deprecated.Implements the getAt(Range) method for primitive type arrays.- Parameters:
self
- an array objectrange
- the range of indices of interest- Returns:
- the returned values from the array corresponding to the range
- Since:
- 1.5.0
-
primitiveArrayGet
Deprecated.Implements the getAt(Collection) method for primitive type arrays. Each value in the collection argument is assumed to be a valid array index. The value at each index is then added to a list which is returned.- Parameters:
self
- an array objectindices
- the indices of interest- Returns:
- the returned values from the array
- Since:
- 1.0
-
primitiveArrayPut
@Deprecated(since="5.0.0") protected static Object primitiveArrayPut(Object self, int idx, Object newValue) Deprecated.Implements the putAt(int) method for primitive type arrays.- Parameters:
self
- an objectidx
- the index of interestnewValue
- the new value to be put into the index of interest- Returns:
- the added value
- Since:
- 1.5.0
-
putAt
Deprecated. -
reverse
Deprecated. -
reverse
Deprecated. -
reverseEach
@Deprecated(since="5.0.0") public static <T> T[] reverseEach(T[] self, @ClosureParams(Component.class) Closure closure) Deprecated. -
shuffle
Deprecated. -
shuffle
Deprecated. -
shuffled
Deprecated. -
shuffled
Deprecated. -
size
Deprecated. -
size
Deprecated. -
size
Deprecated. -
size
Deprecated. -
size
Deprecated. -
size
Deprecated. -
size
Deprecated. -
size
Deprecated. -
size
Deprecated. -
sort
Deprecated. -
sort
Deprecated. -
sort
Deprecated. -
sort
@Deprecated(since="5.0.0") public static <T> T[] sort(T[] self, boolean mutate, Comparator<? super T> comparator) Deprecated. -
sort
@Deprecated(since="5.0.0") public static <T> T[] sort(T[] self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Deprecated. -
sort
@Deprecated(since="5.0.0") public static <T> T[] sort(T[] self, boolean mutate, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Deprecated. -
split
@Deprecated(since="5.0.0") public static <T> Collection<Collection<T>> split(T[] self, @ClosureParams(Component.class) Closure closure) Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
Deprecated. -
sum
@Deprecated(since="5.0.0") public static <T> Object sum(T[] self, @ClosureParams(Component.class) Closure closure) Deprecated. -
sum
@Deprecated(since="5.0.0") public static <T> Object sum(T[] self, Object initialValue, @ClosureParams(Component.class) Closure closure) Deprecated. -
swap
Deprecated. -
swap
Deprecated. -
swap
Deprecated. -
swap
Deprecated. -
swap
Deprecated. -
swap
Deprecated. -
swap
Deprecated. -
swap
Deprecated. -
swap
Deprecated. -
tail
Deprecated. -
take
Deprecated. -
takeRight
Deprecated. -
takeWhile
@Deprecated(since="5.0.0") public static <T> T[] takeWhile(T[] self, @ClosureParams(Component.class) Closure condition) Deprecated. -
toArrayString
Deprecated. -
toList
Deprecated. -
toList
Deprecated. -
toList
Deprecated. -
toList
Deprecated. -
toList
Deprecated. -
toList
Deprecated. -
toList
Deprecated. -
toList
Deprecated. -
toList
Deprecated. -
toSet
Deprecated. -
toSet
Deprecated. -
toSet
Deprecated. -
toSet
Deprecated. -
toSet
Deprecated. -
toSet
Deprecated. -
toSet
Deprecated. -
toSet
Deprecated. -
toSorted
Deprecated. -
toSorted
@Deprecated(since="5.0.0") public static <T> T[] toSorted(T[] self, Comparator<? super T> comparator) Deprecated. -
toSorted
@Deprecated(since="5.0.0") public static <T> T[] toSorted(T[] self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Deprecated. -
toSpreadMap
Deprecated. -
toString
Deprecated. -
toString
Deprecated. -
toString
Deprecated. -
toString
Deprecated. -
toString
Deprecated. -
toString
Deprecated. -
toString
Deprecated. -
toString
Deprecated. -
toString
Deprecated. -
toUnique
Deprecated. -
toUnique
@Deprecated(since="5.0.0") public static <T> T[] toUnique(T[] self, Comparator<? super T> comparator) Deprecated. -
toUnique
@Deprecated(since="5.0.0") public static <T> T[] toUnique(T[] self, @ClosureParams(value=FromString.class,options={"T","T,T"}) Closure closure) Deprecated. -
transpose
Deprecated. -
transpose
Deprecated. -
transpose
Deprecated. -
union
Deprecated. -
union
Deprecated. -
union
Deprecated. -
union
Deprecated. -
withDefault$$bridge
@Deprecated public static <T> List<T> withDefault$$bridge(List<T> self, @ClosureParams(value=SimpleType.class,options="int") Closure<T> init) Deprecated. -
withLazyDefault$$bridge
@Deprecated public static <T> List<T> withLazyDefault$$bridge(List<T> self, @ClosureParams(value=SimpleType.class,options="int") Closure<T> init) Deprecated. -
withEagerDefault$$bridge
@Deprecated public static <T> List<T> withEagerDefault$$bridge(List<T> self, @ClosureParams(value=SimpleType.class,options="int") Closure<T> init) Deprecated.
-