Package-level declarations
Collection types, such as Iterable, Collection, List, Set, Map and related top-level and extension functions.
Collection types, such as Iterable, Collection, List, Set, Map and related top-level and extension functions.
Types
A generic collection of elements. Methods in this interface support only read-only access to the collection; read/write access is supported through the MutableCollection interface.
A generic collection of elements. Methods in this interface support only read-only access to the collection; read/write access is supported through the MutableCollection interface.
Classes that inherit from this interface can be represented as a sequence of elements that can be iterated over.
An iterator over a collection or another entity that can be represented as a sequence of elements. Allows to sequentially access the elements.
A generic ordered collection of elements. Methods in this interface support only read-only access to the list; read/write access is supported through the MutableList interface.
A generic ordered collection of elements. Methods in this interface support only read-only access to the list; read/write access is supported through the MutableList interface.
An iterator over a collection that supports indexed access.
An iterator over a collection that supports indexed access.
A collection that holds pairs of objects (keys and values) and supports efficiently retrieving the value corresponding to each key. Map keys are unique; the map holds only one value for each key. Methods in this interface support only read-only access to the map; read-write access is supported through the MutableMap interface.
A collection that holds pairs of objects (keys and values) and supports efficiently retrieving the value corresponding to each key. Map keys are unique; the map holds only one value for each key. Methods in this interface support only read-only access to the map; read-write access is supported through the MutableMap interface.
A generic collection of elements that supports adding and removing elements.
A generic collection of elements that supports adding and removing elements.
Classes that inherit from this interface can be represented as a sequence of elements that can be iterated over and that supports removing elements during iteration.
Classes that inherit from this interface can be represented as a sequence of elements that can be iterated over and that supports removing elements during iteration.
An iterator over a mutable collection. Provides the ability to remove elements while iterating.
An iterator over a mutable collection. Provides the ability to remove elements while iterating.
A generic ordered collection of elements that supports adding and removing elements.
A generic ordered collection of elements that supports adding and removing elements.
An iterator over a mutable collection that supports indexed access. Provides the ability to add, modify and remove elements while iterating.
An iterator over a mutable collection that supports indexed access. Provides the ability to add, modify and remove elements while iterating.
A modifiable collection that holds pairs of objects (keys and values) and supports efficiently retrieving the value corresponding to each key. Map keys are unique; the map holds only one value for each key.
A generic unordered collection of elements that does not support duplicate elements, and supports adding and removing elements.
A generic unordered collection of elements that does not support duplicate elements, and supports adding and removing elements.
A generic unordered collection of elements that does not support duplicate elements. Methods in this interface support only read-only access to the set; read/write access is supported through the MutableSet interface.
A generic unordered collection of elements that does not support duplicate elements. Methods in this interface support only read-only access to the set; read/write access is supported through the MutableSet interface.
Functions
Searches the array or the range of the array for the provided element using the binary search algorithm. The array is expected to be sorted, otherwise the result is undefined.
Searches the array or the range of the array for the provided element using the binary search algorithm. The array is expected to be sorted according to the specified comparator, otherwise the result is undefined.
Appends all elements that are instances of specified class to the given destination.
Creates an Iterator for an java.util.Enumeration, allowing to use it in for loops.
Creates a new instance of the specialized implementation of LinkedHashSet with the specified String elements, which elements the keys as properties of JS object without hashing them.
Sorts the array in-place according to the natural order of its elements.
Sorts a range in the array in-place.
Sorts the array in-place according to the order specified by the given comparison function.
Returns a new java.util.SortedSet with the given elements.
Returns a new java.util.SortedSet with the given comparator and elements.
Creates a new instance of the specialized implementation of HashSet with the specified String elements, which elements the keys as properties of JS object without hashing them.
Converts this Map to a Properties object.
Converts this Map to a SortedMap. The resulting SortedMap determines the equality and order of keys according to their natural sorting order.
Converts this Map to a SortedMap. The resulting SortedMap determines the equality and order of keys according to the sorting order provided by the given comparator.
Returns a new SortedSet of all elements.