Client and backend. Every class listed here is shared: the same code is compiled into your app and into your server. The package's page in the client API lists all of it, including any classes that exist only in the app.
package java.util
Types
class AbstractCollection | Class AbstractCollection is an abstract implementation of the Collection interface. |
class AbstractList | AbstractList is an abstract implementation of the List interface, optimized for a backing store which supports random access. |
class AbstractMap | This class is an abstract implementation of the Map interface. |
class AbstractQueue | AbstractQueue is an abstract class which implements some of the methods in Queue. |
class AbstractSequentialList | AbstractSequentialList is an abstract implementation of the List interface. |
class AbstractSet | An AbstractSet is an abstract implementation of the Set interface. |
class ArrayDeque | An implementation of Deque, backed by an array. |
class ArrayList | ArrayList is an implementation of List, backed by an array. |
class Arrays | Arrays contains static methods which operate on arrays. |
class BitSet | The BitSet class implements a bit field. |
class Calendar | Calendar is an abstract base class for converting between a Date object and a set of integer fields such as YEAR, MONTH, DAY, HOUR, and so on. |
interface Collection | Collection is the root of the collection hierarchy. |
class Collections | Collections contains static methods which operate on Collection classes. |
interface Comparator | A Comparator is used to compare two objects to determine their ordering with respect to each other. |
class ConcurrentModificationException | An ConcurrentModificationException is thrown when a Collection is modified and an existing iterator on the Collection is used to modify the Collection as well. |
class Date | The class Date represents a specific instant in time, with millisecond precision. |
interface Deque | A kind of collection that can insert or remove element at both ends(“double ended queue”). |
class Dictionary | Note: Do not use this class since it is obsolete. Please use the Map interface for new implementations. |
class EmptyStackException | Thrown by methods in the Stack class to indicate that the stack is empty. |
interface Enumeration | An object that implements the Enumeration interface generates a series of elements, one at a time. |
interface EventListener | EventListener is the superclass of all event listener interfaces. |
class EventListenerProxy | This abstract class provides a simple wrapper for objects of type EventListener. |
class HashMap | HashMap is an implementation of Map. |
class HashSet | HashSet is an implementation of a Set. |
class Hashtable | Hashtable associates keys with values. |
class IdentityHashMap | IdentityHashMap is a variant on HashMap which tests equality by reference instead of equality by value. |
interface Iterator | An Iterator is used to sequence over a collection of objects. |
class LinkedHashMap | LinkedHashMap is a variant of HashMap. |
class LinkedHashSet | LinkedHashSet is a variant of HashSet. |
class LinkedList | LinkedList is an implementation of List, backed by a linked list. |
interface List | A List is a collection which maintains an ordering for its elements. |
interface ListIterator | An ListIterator is used to sequence over a List of objects. |
class Locale | |
interface Map | A Map is a data structure consisting of a set of keys and values in which each key is mapped to a single value. |
interface NavigableMap | NavigableMap is a SortedMap with navigation methods answering the closest matches for specified item. |
interface NavigableSet | NavigableSet is a SortedSet with navigation methods answering the closest matches for specified item. |
class NoSuchElementException | Thrown by the nextElement method of an Enumeration to indicate that there are no more elements in the enumeration. |
class Objects | This is a compatibility class which supports the java.util.Objects API. |
class Observable | Observable is used to notify a group of Observer objects when a change occurs. |
interface Observer | Observer is the interface to be implemented by objects that receive notification of updates on an Observable object. |
class PriorityQueue | A PriorityQueue holds elements on a priority heap, which orders the elements according to their natural order or according to the comparator specified at construction time. |
interface Queue | This kind of collection provides advanced operations compared to basic collections, such as insertion, extraction, and inspection. |
class Random | An instance of this class is used to generate a stream of pseudorandom numbers. |
interface RandomAccess | RandomAccess is implemented by List implementations that support fast (usually constant time) random access. |
interface Set | A Set is a data structure which does not allow duplicate elements. |
interface SortedMap | A map that has its keys ordered. |
interface SortedSet | SortedSet is a Set which iterates over its elements in a sorted order. |
class Stack | Stack is a Last-In/First-Out(LIFO) data structure which represents a stack of objects. |
class StringTokenizer | The StringTokenizer class allows an application to break a string into tokens by performing code point comparison. |
class TimeZone | TimeZone represents a time zone offset, and also figures out daylight savings. |
class Timer | |
class TimerTask | |
class TreeMap | TreeMap is an implementation of SortedMap. |
class TreeSet | TreeSet is an implementation of SortedSet. |
class Vector | Vector is a variable size contiguous indexable array of objects. |