minus
Returns a list containing all elements of the original collection without the first occurrence of the given element.
Returns a list containing all elements of the original collection except the elements contained in the given elements array.
The elements array may be converted to a HashSet to speed up the operation, thus the elements are required to have
a correct and stable implementation of hashCode() that doesn't change between successive invocations.
Returns a list containing all elements of the original collection except the elements contained in the given elements collection.
The elements collection may be converted to a HashSet to speed up the operation, thus the elements are required to have
a correct and stable implementation of hashCode() that doesn't change between successive invocations.
Returns a list containing all elements of the original collection except the elements contained in the given elements sequence.
The elements sequence may be converted to a HashSet to speed up the operation, thus the elements are required to have
a correct and stable implementation of hashCode() that doesn't change between successive invocations.
Returns a set containing all elements of the original set except the given element.
The returned set preserves the element iteration order of the original set.
Returns a set containing all elements of the original set except the elements contained in the given elements array.
The returned set preserves the element iteration order of the original set.
The elements array may be converted to a HashSet to speed up the operation, thus the elements are required to have
a correct and stable implementation of hashCode() that doesn't change between successive invocations.
Returns a set containing all elements of the original set except the elements contained in the given elements collection.
The returned set preserves the element iteration order of the original set.
The elements collection may be converted to a HashSet to speed up the operation, thus the elements are required to have
a correct and stable implementation of hashCode() that doesn't change between successive invocations.
Returns a set containing all elements of the original set except the elements contained in the given elements sequence.
The returned set preserves the element iteration order of the original set.
The elements sequence may be converted to a HashSet to speed up the operation, thus the elements are required to have
a correct and stable implementation of hashCode() that doesn't change between successive invocations.
Returns a map containing all entries of the original map except the entry with the given key.
The returned map preserves the entry iteration order of the original map.
Returns a map containing all entries of the original map except those entries the keys of which are contained in the given keys collection.
The returned map preserves the entry iteration order of the original map.
Returns a map containing all entries of the original map except those entries the keys of which are contained in the given keys array.
The returned map preserves the entry iteration order of the original map.