Téléchargement de l’api backport-util-concurrent50.jar

Author:

Téléchargement de l'api backport-util-concurrent50.jar
Download here
edu.emory.mathcs.backport.java.util.AbstractCollection(Ci-dessous la liste des Méthodes de la classe)

protected void ()
public Object[] toArray()
public Object[] toArray(Object[] a)

edu.emory.mathcs.backport.java.util.AbstractList(Ci-dessous la liste des Méthodes de la classe)

protected void ()
public Object[] toArray()
public Object[] toArray(Object[] a)

edu.emory.mathcs.backport.java.util.AbstractMap(Ci-dessous la liste des Méthodes de la classe)

protected void ()
public java.util.Set keySet()
private static boolean eq(Object o1, Object o2)

edu.emory.mathcs.backport.java.util.AbstractQueue(Ci-dessous la liste des Méthodes de la classe)

protected void ()
public boolean add(Object e)
public Object remove()
public Object element()
public void clear()
public boolean addAll(java.util.Collection c)

edu.emory.mathcs.backport.java.util.AbstractSequentialList(Ci-dessous la liste des Méthodes de la classe)

protected void ()
public Object[] toArray()
public Object[] toArray(Object[] a)

edu.emory.mathcs.backport.java.util.AbstractSet(Ci-dessous la liste des Méthodes de la classe)

protected void ()
public Object[] toArray()
public Object[] toArray(Object[] a)

edu.emory.mathcs.backport.java.util.ArrayDeque(Ci-dessous la liste des Méthodes de la classe)

private void allocateElements(int numElements)
private void doubleCapacity()
private Object[] copyElements(Object[] a)
public void ()
public void (int numElements)
public void (java.util.Collection c)
public void addFirst(Object e)
public void addLast(Object e)
public boolean offerFirst(Object e)
public boolean offerLast(Object e)
public Object removeFirst()
public Object removeLast()
public Object pollFirst()
public Object pollLast()
public Object getFirst()
public Object getLast()
public Object peekFirst()
public Object peekLast()
public boolean removeFirstOccurrence(Object o)
public boolean removeLastOccurrence(Object o)
public boolean add(Object e)
public boolean offer(Object e)
public Object remove()
public Object poll()
public Object element()
public Object peek()
public void push(Object e)
public Object pop()
private void checkInvariants()
private boolean delete(int i)
public int size()
public boolean isEmpty()
public java.util.Iterator iterator()
public java.util.Iterator descendingIterator()
public boolean contains(Object o)
public boolean remove(Object o)
public void clear()
public Object[] toArray()
public Object[] toArray(Object[] a)
public Object clone()
private void writeObject(java.io.ObjectOutputStream s)
		throws java.io.IOException
private void readObject(java.io.ObjectInputStream s)
		throws java.io.IOException, java.lang.ClassNotFoundException
static void ()

edu.emory.mathcs.backport.java.util.Arrays(Ci-dessous la liste des Méthodes de la classe)

private void ()
public static void sort(long[] a)
public static void sort(long[] a, int fromIndex, int toIndex)
public static void sort(int[] a)
public static void sort(int[] a, int fromIndex, int toIndex)
public static void sort(short[] a)
public static void sort(short[] a, int fromIndex, int toIndex)
public static void sort(char[] a)
public static void sort(char[] a, int fromIndex, int toIndex)
public static void sort(byte[] a)
public static void sort(byte[] a, int fromIndex, int toIndex)
public static void sort(double[] a)
public static void sort(double[] a, int fromIndex, int toIndex)
public static void sort(float[] a)
public static void sort(float[] a, int fromIndex, int toIndex)
public static void sort(Object[] a)
public static void sort(Object[] a, int fromIndex, int toIndex)
public static void sort(Object[] a, java.util.Comparator c)
public static void sort(Object[] a, int fromIndex, int toIndex, java.util.Comparator c)
public static int binarySearch(long[] a, long key)
public static int binarySearch(int[] a, int key)
public static int binarySearch(short[] a, short key)
public static int binarySearch(char[] a, char key)
public static int binarySearch(byte[] a, byte key)
public static int binarySearch(double[] a, double key)
public static int binarySearch(float[] a, float key)
public static int binarySearch(Object[] a, Object key)
public static int binarySearch(Object[] a, Object key, java.util.Comparator c)
public static boolean equals(long[] a, long[] a2)
public static boolean equals(int[] a, int[] a2)
public static boolean equals(short[] a, short[] a2)
public static boolean equals(char[] a, char[] a2)
public static boolean equals(byte[] a, byte[] a2)
public static boolean equals(boolean[] a, boolean[] a2)
public static boolean equals(double[] a, double[] a2)
public static boolean equals(float[] a, float[] a2)
public static boolean equals(Object[] a, Object[] a2)
public static void fill(long[] a, long val)
public static void fill(long[] a, int fromIndex, int toIndex, long val)
public static void fill(int[] a, int val)
public static void fill(int[] a, int fromIndex, int toIndex, int val)
public static void fill(short[] a, short val)
public static void fill(short[] a, int fromIndex, int toIndex, short val)
public static void fill(char[] a, char val)
public static void fill(char[] a, int fromIndex, int toIndex, char val)
public static void fill(byte[] a, byte val)
public static void fill(byte[] a, int fromIndex, int toIndex, byte val)
public static void fill(boolean[] a, boolean val)
public static void fill(boolean[] a, int fromIndex, int toIndex, boolean val)
public static void fill(double[] a, double val)
public static void fill(double[] a, int fromIndex, int toIndex, double val)
public static void fill(float[] a, float val)
public static void fill(float[] a, int fromIndex, int toIndex, float val)
public static void fill(Object[] a, Object val)
public static void fill(Object[] a, int fromIndex, int toIndex, Object val)
public static Object[] copyOf(Object[] original, int newLength)
public static Object[] copyOf(Object[] original, int newLength, Class newType)
public static byte[] copyOf(byte[] original, int newLength)
public static short[] copyOf(short[] original, int newLength)
public static int[] copyOf(int[] original, int newLength)
public static long[] copyOf(long[] original, int newLength)
public static char[] copyOf(char[] original, int newLength)
public static float[] copyOf(float[] original, int newLength)
public static double[] copyOf(double[] original, int newLength)
public static boolean[] copyOf(boolean[] original, int newLength)
public static Object[] copyOfRange(Object[] original, int from, int to)
public static Object[] copyOfRange(Object[] original, int from, int to, Class newType)
public static byte[] copyOfRange(byte[] original, int from, int to)
public static short[] copyOfRange(short[] original, int from, int to)
public static int[] copyOfRange(int[] original, int from, int to)
public static long[] copyOfRange(long[] original, int from, int to)
public static char[] copyOfRange(char[] original, int from, int to)
public static float[] copyOfRange(float[] original, int from, int to)
public static double[] copyOfRange(double[] original, int from, int to)
public static boolean[] copyOfRange(boolean[] original, int from, int to)
public static java.util.List asList(Object[] a)
public static int hashCode(long[] a)
public static int hashCode(int[] a)
public static int hashCode(short[] a)
public static int hashCode(char[] a)
public static int hashCode(byte[] a)
public static int hashCode(boolean[] a)
public static int hashCode(float[] a)
public static int hashCode(double[] a)
public static int hashCode(Object[] a)
public static int deepHashCode(Object[] a)
public static boolean deepEquals(Object[] a1, Object[] a2)
public static String toString(long[] a)
public static String toString(int[] a)
public static String toString(short[] a)
public static String toString(char[] a)
public static String toString(byte[] a)
public static String toString(boolean[] a)
public static String toString(float[] a)
public static String toString(double[] a)
public static String toString(Object[] a)
public static String deepToString(Object[] a)
private static void deepToString(Object[] a, StringBuffer buf, java.util.List seen)

edu.emory.mathcs.backport.java.util.Collections(Ci-dessous la liste des Méthodes de la classe)

private void ()
public static void sort(java.util.List list)
public static void sort(java.util.List list, java.util.Comparator c)
public static int binarySearch(java.util.List list, Object key)
public static int binarySearch(java.util.List list, Object key, java.util.Comparator c)
public static void reverse(java.util.List list)
public static void shuffle(java.util.List list)
public static void shuffle(java.util.List list, java.util.Random rnd)
public static void swap(java.util.List list, int i, int j)
public static void fill(java.util.List list, Object obj)
public static void copy(java.util.List dest, java.util.List src)
public static Object min(java.util.Collection coll)
public static Object min(java.util.Collection coll, java.util.Comparator comp)
public static Object max(java.util.Collection coll)
public static Object max(java.util.Collection coll, java.util.Comparator comp)
public static void rotate(java.util.List list, int distance)
public static boolean replaceAll(java.util.List list, Object oldVal, Object newVal)
public static int indexOfSubList(java.util.List source, java.util.List target)
public static int lastIndexOfSubList(java.util.List source, java.util.List target)
public static java.util.Collection unmodifiableCollection(java.util.Collection c)
public static java.util.Set unmodifiableSet(java.util.Set s)
public static java.util.SortedSet unmodifiableSortedSet(java.util.SortedSet s)
public static java.util.List unmodifiableList(java.util.List l)
public static java.util.Map unmodifiableMap(java.util.Map m)
public static java.util.SortedMap unmodifiableSortedMap(java.util.SortedMap m)
public static java.util.Collection synchronizedCollection(java.util.Collection c)
public static java.util.Set synchronizedSet(java.util.Set s)
public static java.util.SortedSet synchronizedSortedSet(java.util.SortedSet s)
public static java.util.List synchronizedList(java.util.List l)
public static java.util.Map synchronizedMap(java.util.Map m)
public static java.util.SortedMap synchronizedSortedMap(java.util.SortedMap m)
public static java.util.Collection checkedCollection(java.util.Collection c, Class type)
public static java.util.Set checkedSet(java.util.Set s, Class type)
public static java.util.SortedSet checkedSortedSet(java.util.SortedSet s, Class type)
public static java.util.List checkedList(java.util.List l, Class type)
public static java.util.Map checkedMap(java.util.Map m, Class keyType, Class valueType)
public static java.util.SortedMap checkedSortedMap(java.util.SortedMap m, Class keyType, Class valueType)
public static java.util.Set emptySet()
public static java.util.List emptyList()
public static java.util.Map emptyMap()
public static java.util.Set singleton(Object o)
public static java.util.List singletonList(Object o)
public static java.util.Map singletonMap(Object key, Object value)
public static java.util.List nCopies(int n, Object o)
public static java.util.Comparator reverseOrder()
public static java.util.Comparator reverseOrder(java.util.Comparator cmp)
public static java.util.Enumeration enumeration(java.util.Collection c)
public static java.util.ArrayList list(java.util.Enumeration e)
public static int frequency(java.util.Collection c, Object o)
public static boolean disjoint(java.util.Collection a, java.util.Collection b)
public static boolean addAll(java.util.Collection c, Object[] a)
public static java.util.Set newSetFromMap(java.util.Map map)
public static edu.emory.mathcs.backport.java.util.Queue asLifoQueue(edu.emory.mathcs.backport.java.util.Deque deque)
private static boolean eq(Object o1, Object o2)

edu.emory.mathcs.backport.java.util.Deque(Ci-dessous la liste des Méthodes de la classe)

public abstract void addFirst(Object arg1)
public abstract void addLast(Object arg1)
public abstract boolean offerFirst(Object arg1)
public abstract boolean offerLast(Object arg1)
public abstract Object removeFirst()
public abstract Object removeLast()
public abstract Object pollFirst()
public abstract Object pollLast()
public abstract Object getFirst()
public abstract Object getLast()
public abstract Object peekFirst()
public abstract Object peekLast()
public abstract boolean removeFirstOccurrence(Object arg1)
public abstract boolean removeLastOccurrence(Object arg1)
public abstract boolean add(Object arg1)
public abstract boolean offer(Object arg1)
public abstract Object remove()
public abstract Object poll()
public abstract Object element()
public abstract Object peek()
public abstract void push(Object arg1)
public abstract Object pop()
public abstract boolean remove(Object arg1)
public abstract boolean contains(Object arg1)
public abstract int size()
public abstract java.util.Iterator iterator()
public abstract java.util.Iterator descendingIterator()

edu.emory.mathcs.backport.java.util.LinkedList(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (java.util.Collection c)
public int size()
public boolean isEmpty()
public boolean contains(Object o)
public int indexOf(Object o)
public int lastIndexOf(Object o)
public Object[] toArray()
public Object[] toArray(Object[] a)
public boolean add(Object o)
public boolean remove(Object o)
public boolean addAll(java.util.Collection c)
public boolean addAll(int index, java.util.Collection c)
public void clear()
public Object get(int index)
public Object set(int index, Object element)
public void add(int index, Object element)
public Object remove(int index)
public java.util.ListIterator listIterator()
public java.util.ListIterator listIterator(int index)
public void addFirst(Object e)
public void addLast(Object e)
public boolean offerFirst(Object e)
public boolean offerLast(Object e)
public Object removeFirst()
public Object removeLast()
public Object pollFirst()
public Object pollLast()
public Object getFirst()
public Object getLast()
public Object peekFirst()
public Object peekLast()
public boolean removeFirstOccurrence(Object o)
public boolean removeLastOccurrence(Object o)
public boolean offer(Object e)
public Object remove()
public Object poll()
public Object element()
public Object peek()
public void push(Object e)
public Object pop()
public java.util.Iterator descendingIterator()
private void writeObject(java.io.ObjectOutputStream out)
		throws java.io.IOException
private void readObject(java.io.ObjectInputStream in)
		throws java.io.IOException, java.lang.ClassNotFoundException
public Object clone()

edu.emory.mathcs.backport.java.util.NavigableMap(Ci-dessous la liste des Méthodes de la classe)

public abstract Object lowerKey(Object arg1)
public abstract Object floorKey(Object arg1)
public abstract Object ceilingKey(Object arg1)
public abstract Object higherKey(Object arg1)
public abstract edu.emory.mathcs.backport.java.util.NavigableMap descendingMap()
public abstract edu.emory.mathcs.backport.java.util.NavigableSet navigableKeySet()
public abstract edu.emory.mathcs.backport.java.util.NavigableSet descendingKeySet()
public abstract edu.emory.mathcs.backport.java.util.NavigableMap subMap(Object arg1, boolean arg2, Object arg3, boolean arg4)
public abstract edu.emory.mathcs.backport.java.util.NavigableMap headMap(Object arg1, boolean arg2)
public abstract edu.emory.mathcs.backport.java.util.NavigableMap tailMap(Object arg1, boolean arg2)
public abstract java.util.SortedMap subMap(Object arg1, Object arg2)
public abstract java.util.SortedMap headMap(Object arg1)
public abstract java.util.SortedMap tailMap(Object arg1)

edu.emory.mathcs.backport.java.util.NavigableSet(Ci-dessous la liste des Méthodes de la classe)

public abstract Object lower(Object arg1)
public abstract Object floor(Object arg1)
public abstract Object ceiling(Object arg1)
public abstract Object higher(Object arg1)
public abstract Object pollFirst()
public abstract Object pollLast()
public abstract java.util.Iterator iterator()
public abstract edu.emory.mathcs.backport.java.util.NavigableSet descendingSet()
public abstract java.util.Iterator descendingIterator()
public abstract edu.emory.mathcs.backport.java.util.NavigableSet subSet(Object arg1, boolean arg2, Object arg3, boolean arg4)
public abstract edu.emory.mathcs.backport.java.util.NavigableSet headSet(Object arg1, boolean arg2)
public abstract edu.emory.mathcs.backport.java.util.NavigableSet tailSet(Object arg1, boolean arg2)
public abstract java.util.SortedSet subSet(Object arg1, Object arg2)
public abstract java.util.SortedSet headSet(Object arg1)
public abstract java.util.SortedSet tailSet(Object arg1)

edu.emory.mathcs.backport.java.util.PriorityQueue(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (int initialCapacity)
public void (java.util.Comparator comparator)
public void (int initialCapacity, java.util.Comparator comparator)
public void (edu.emory.mathcs.backport.java.util.PriorityQueue q)
public void (java.util.SortedSet s)
public void (java.util.Collection c)
public java.util.Iterator iterator()
public java.util.Comparator comparator()
public boolean offer(Object o)
public Object peek()
public Object poll()
public int size()
private int percolateDown(int idx, Object e)
private int percolateUp(int idx, Object e)
public boolean add(Object o)
public Object remove()
public Object element()
public boolean isEmpty()
public boolean contains(Object o)
public Object[] toArray()
public Object[] toArray(Object[] a)
public boolean remove(Object o)
private Object removeAt(int i)
public void clear()
private void writeObject(java.io.ObjectOutputStream os)
		throws java.io.IOException
private void readObject(java.io.ObjectInputStream is)
		throws java.io.IOException, java.lang.ClassNotFoundException
static void ()

edu.emory.mathcs.backport.java.util.Queue(Ci-dessous la liste des Méthodes de la classe)

public abstract boolean add(Object arg1)
public abstract boolean offer(Object arg1)
public abstract Object remove()
public abstract Object poll()
public abstract Object element()
public abstract Object peek()

edu.emory.mathcs.backport.java.util.TreeMap(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (java.util.Comparator comparator)
public void (java.util.SortedMap map)
public void (java.util.Map map)
public int size()
public void clear()
public Object clone()
public Object put(Object key, Object value)
public Object get(Object key)
public boolean containsKey(Object key)
public java.util.Set entrySet()
void buildFromSorted(java.util.Iterator itr, int size)
private static boolean eq(Object o1, Object o2)
private static int compare(Object o1, Object o2, java.util.Comparator cmp)
public Object lowerKey(Object key)
public Object floorKey(Object key)
public Object ceilingKey(Object key)
public Object higherKey(Object key)
public edu.emory.mathcs.backport.java.util.NavigableMap descendingMap()
public edu.emory.mathcs.backport.java.util.NavigableSet descendingKeySet()
public java.util.SortedMap subMap(Object fromKey, Object toKey)
public java.util.SortedMap headMap(Object toKey)
public java.util.SortedMap tailMap(Object fromKey)
public edu.emory.mathcs.backport.java.util.NavigableMap subMap(Object fromKey, boolean fromInclusive, Object toKey, boolean toInclusive)
public edu.emory.mathcs.backport.java.util.NavigableMap headMap(Object toKey, boolean toInclusive)
public edu.emory.mathcs.backport.java.util.NavigableMap tailMap(Object fromKey, boolean fromInclusive)
public java.util.Comparator comparator()
final java.util.Comparator reverseComparator()
public Object firstKey()
public Object lastKey()
public boolean isEmpty()
public boolean containsValue(Object value)
public Object remove(Object key)
public void putAll(java.util.Map map)
public java.util.Set keySet()
public edu.emory.mathcs.backport.java.util.NavigableSet navigableKeySet()
private void writeObject(java.io.ObjectOutputStream out)
		throws java.io.IOException
private void readObject(java.io.ObjectInputStream in)
		throws java.io.IOException, java.lang.ClassNotFoundException

edu.emory.mathcs.backport.java.util.TreeSet(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (java.util.Comparator comparator)
public void (java.util.Collection c)
public void (java.util.SortedSet s)
private void (edu.emory.mathcs.backport.java.util.NavigableMap map)
public Object lower(Object e)
public Object floor(Object e)
public Object ceiling(Object e)
public Object higher(Object e)
public Object pollFirst()
public Object pollLast()
public java.util.Iterator iterator()
public java.util.Iterator descendingIterator()
public java.util.SortedSet subSet(Object fromElement, Object toElement)
public java.util.SortedSet headSet(Object toElement)
public java.util.SortedSet tailSet(Object fromElement)
public edu.emory.mathcs.backport.java.util.NavigableSet subSet(Object fromElement, boolean fromInclusive, Object toElement, boolean toInclusive)
public edu.emory.mathcs.backport.java.util.NavigableSet headSet(Object toElement, boolean toInclusive)
public edu.emory.mathcs.backport.java.util.NavigableSet tailSet(Object fromElement, boolean fromInclusive)
public edu.emory.mathcs.backport.java.util.NavigableSet descendingSet()
public java.util.Comparator comparator()
public Object first()
public Object last()
public int size()
public boolean isEmpty()
public boolean contains(Object o)
public Object[] toArray()
public Object[] toArray(Object[] a)
public boolean add(Object o)
public boolean remove(Object o)
public boolean addAll(java.util.Collection c)
public void clear()
public Object clone()
private static boolean eq(Object o1, Object o2)
private void writeObject(java.io.ObjectOutputStream out)
		throws java.io.IOException
private void readObject(java.io.ObjectInputStream in)
		throws java.io.IOException, java.lang.ClassNotFoundException
static void ()

edu.emory.mathcs.backport.java.util.concurrent.AbstractExecutorService(Ci-dessous la liste des Méthodes de la classe)

public void ()
protected edu.emory.mathcs.backport.java.util.concurrent.RunnableFuture newTaskFor(Runnable runnable, Object value)
protected edu.emory.mathcs.backport.java.util.concurrent.RunnableFuture newTaskFor(edu.emory.mathcs.backport.java.util.concurrent.Callable callable)
public edu.emory.mathcs.backport.java.util.concurrent.Future submit(Runnable task)
public edu.emory.mathcs.backport.java.util.concurrent.Future submit(Runnable task, Object result)
public edu.emory.mathcs.backport.java.util.concurrent.Future submit(edu.emory.mathcs.backport.java.util.concurrent.Callable task)
private Object doInvokeAny(java.util.Collection tasks, boolean timed, long nanos)
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.ExecutionException, edu.emory.mathcs.backport.java.util.concurrent.TimeoutException
public Object invokeAny(java.util.Collection tasks)
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.ExecutionException
public Object invokeAny(java.util.Collection tasks, long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.ExecutionException, edu.emory.mathcs.backport.java.util.concurrent.TimeoutException
public java.util.List invokeAll(java.util.Collection tasks)
		throws java.lang.InterruptedException
public java.util.List invokeAll(java.util.Collection tasks, long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
static void ()

edu.emory.mathcs.backport.java.util.concurrent.ArrayBlockingQueue(Ci-dessous la liste des Méthodes de la classe)

final int inc(int i)
private void insert(Object x)
private Object extract()
void removeAt(int i)
public void (int capacity)
public void (int capacity, boolean fair)
public void (int capacity, boolean fair, java.util.Collection c)
public boolean add(Object e)
public boolean offer(Object e)
public void put(Object e)
		throws java.lang.InterruptedException
public boolean offer(Object e, long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public Object poll()
public Object take()
		throws java.lang.InterruptedException
public Object poll(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public Object peek()
public int size()
public int remainingCapacity()
public boolean remove(Object o)
public boolean contains(Object o)
public Object[] toArray()
public Object[] toArray(Object[] a)
public String toString()
public void clear()
public int drainTo(java.util.Collection c)
public int drainTo(java.util.Collection c, int maxElements)
public java.util.Iterator iterator()

edu.emory.mathcs.backport.java.util.concurrent.BlockingDeque(Ci-dessous la liste des Méthodes de la classe)

public abstract void addFirst(Object arg1)
public abstract void addLast(Object arg1)
public abstract boolean offerFirst(Object arg1)
public abstract boolean offerLast(Object arg1)
public abstract void putFirst(Object arg1)
		throws java.lang.InterruptedException
public abstract void putLast(Object arg1)
		throws java.lang.InterruptedException
public abstract boolean offerFirst(Object arg1, long arg2, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg4)
		throws java.lang.InterruptedException
public abstract boolean offerLast(Object arg1, long arg2, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg4)
		throws java.lang.InterruptedException
public abstract Object takeFirst()
		throws java.lang.InterruptedException
public abstract Object takeLast()
		throws java.lang.InterruptedException
public abstract Object pollFirst(long arg1, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg3)
		throws java.lang.InterruptedException
public abstract Object pollLast(long arg1, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg3)
		throws java.lang.InterruptedException
public abstract boolean removeFirstOccurrence(Object arg1)
public abstract boolean removeLastOccurrence(Object arg1)
public abstract boolean add(Object arg1)
public abstract boolean offer(Object arg1)
public abstract void put(Object arg1)
		throws java.lang.InterruptedException
public abstract boolean offer(Object arg1, long arg2, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg4)
		throws java.lang.InterruptedException
public abstract Object remove()
public abstract Object poll()
public abstract Object take()
		throws java.lang.InterruptedException
public abstract Object poll(long arg1, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg3)
		throws java.lang.InterruptedException
public abstract Object element()
public abstract Object peek()
public abstract boolean remove(Object arg1)
public abstract boolean contains(Object arg1)
public abstract int size()
public abstract java.util.Iterator iterator()
public abstract void push(Object arg1)

edu.emory.mathcs.backport.java.util.concurrent.BlockingQueue(Ci-dessous la liste des Méthodes de la classe)

public abstract boolean add(Object arg1)
public abstract boolean offer(Object arg1)
public abstract void put(Object arg1)
		throws java.lang.InterruptedException
public abstract boolean offer(Object arg1, long arg2, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg4)
		throws java.lang.InterruptedException
public abstract Object take()
		throws java.lang.InterruptedException
public abstract Object poll(long arg1, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg3)
		throws java.lang.InterruptedException
public abstract int remainingCapacity()
public abstract boolean remove(Object arg1)
public abstract boolean contains(Object arg1)
public abstract int drainTo(java.util.Collection arg1)
public abstract int drainTo(java.util.Collection arg1, int arg2)

edu.emory.mathcs.backport.java.util.concurrent.BrokenBarrierException(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (String message)

edu.emory.mathcs.backport.java.util.concurrent.Callable(Ci-dessous la liste des Méthodes de la classe)

public abstract Object call()
		throws java.lang.Exception

edu.emory.mathcs.backport.java.util.concurrent.CancellationException(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (String message)

edu.emory.mathcs.backport.java.util.concurrent.CompletionService(Ci-dessous la liste des Méthodes de la classe)

public abstract edu.emory.mathcs.backport.java.util.concurrent.Future submit(edu.emory.mathcs.backport.java.util.concurrent.Callable arg1)
public abstract edu.emory.mathcs.backport.java.util.concurrent.Future submit(Runnable arg1, Object arg2)
public abstract edu.emory.mathcs.backport.java.util.concurrent.Future take()
		throws java.lang.InterruptedException
public abstract edu.emory.mathcs.backport.java.util.concurrent.Future poll()
public abstract edu.emory.mathcs.backport.java.util.concurrent.Future poll(long arg1, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg3)
		throws java.lang.InterruptedException

edu.emory.mathcs.backport.java.util.concurrent.ConcurrentHashMap(Ci-dessous la liste des Méthodes de la classe)

private static int hash(int h)
public void (int initialCapacity, float loadFactor, int concurrencyLevel)
public void (int initialCapacity, float loadFactor)
public void (int initialCapacity)
public void ()
public void (java.util.Map m)
public boolean isEmpty()
public int size()
public Object get(Object key)
public boolean containsKey(Object key)
public boolean containsValue(Object value)
public boolean contains(Object value)
public Object put(Object key, Object value)
public Object putIfAbsent(Object key, Object value)
public void putAll(java.util.Map m)
public Object remove(Object key)
public boolean remove(Object key, Object value)
public boolean replace(Object key, Object oldValue, Object newValue)
public Object replace(Object key, Object value)
public void clear()
public java.util.Set keySet()
public java.util.Collection values()
public java.util.Set entrySet()
public java.util.Enumeration keys()
public java.util.Enumeration elements()
private void writeObject(java.io.ObjectOutputStream s)
		throws java.io.IOException
private void readObject(java.io.ObjectInputStream s)
		throws java.io.IOException, java.lang.ClassNotFoundException

edu.emory.mathcs.backport.java.util.concurrent.ConcurrentLinkedQueue(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (java.util.Collection c)
public boolean add(Object e)
public boolean offer(Object e)
public Object poll()
public Object peek()
public boolean isEmpty()
public int size()
public boolean contains(Object o)
public boolean remove(Object o)
public java.util.Iterator iterator()
private void writeObject(java.io.ObjectOutputStream s)
		throws java.io.IOException
private void readObject(java.io.ObjectInputStream s)
		throws java.io.IOException, java.lang.ClassNotFoundException
static void ()

edu.emory.mathcs.backport.java.util.concurrent.ConcurrentMap(Ci-dessous la liste des Méthodes de la classe)

public abstract Object putIfAbsent(Object arg1, Object arg2)
public abstract boolean remove(Object arg1, Object arg2)
public abstract boolean replace(Object arg1, Object arg2, Object arg3)
public abstract Object replace(Object arg1, Object arg2)

edu.emory.mathcs.backport.java.util.concurrent.ConcurrentNavigableMap(Ci-dessous la liste des Méthodes de la classe)

public abstract edu.emory.mathcs.backport.java.util.NavigableMap subMap(Object arg1, boolean arg2, Object arg3, boolean arg4)
public abstract edu.emory.mathcs.backport.java.util.NavigableMap headMap(Object arg1, boolean arg2)
public abstract edu.emory.mathcs.backport.java.util.NavigableMap tailMap(Object arg1, boolean arg2)
public abstract java.util.SortedMap subMap(Object arg1, Object arg2)
public abstract java.util.SortedMap headMap(Object arg1)
public abstract java.util.SortedMap tailMap(Object arg1)
public abstract edu.emory.mathcs.backport.java.util.NavigableMap descendingMap()
public abstract edu.emory.mathcs.backport.java.util.NavigableSet navigableKeySet()
public abstract java.util.Set keySet()
public abstract edu.emory.mathcs.backport.java.util.NavigableSet descendingKeySet()

edu.emory.mathcs.backport.java.util.concurrent.ConcurrentSkipListMap(Ci-dessous la liste des Méthodes de la classe)

final void initialize()
private Comparable comparable(Object key)
		throws java.lang.ClassCastException
int compare(Object k1, Object k2)
		throws java.lang.ClassCastException
boolean inHalfOpenRange(Object key, Object least, Object fence)
boolean inOpenRange(Object key, Object least, Object fence)
private Object doGet(Object okey)
private Object getUsingFindNode(Comparable key)
private Object doPut(Object kkey, Object value, boolean onlyIfAbsent)
private int randomLevel()
final Object doRemove(Object okey, Object value)
private void tryReduceLevel()
private void clearIndexToFirst()
public void ()
public void (java.util.Comparator comparator)
public void (java.util.Map m)
public void (java.util.SortedMap m)
public Object clone()
private void buildFromSorted(java.util.SortedMap map)
private void writeObject(java.io.ObjectOutputStream s)
		throws java.io.IOException
private void readObject(java.io.ObjectInputStream s)
		throws java.io.IOException, java.lang.ClassNotFoundException
public boolean containsKey(Object key)
public Object get(Object key)
public Object put(Object key, Object value)
public Object remove(Object key)
public boolean containsValue(Object value)
public int size()
public boolean isEmpty()
public void clear()
public java.util.Set keySet()
public edu.emory.mathcs.backport.java.util.NavigableSet navigableKeySet()
public java.util.Collection values()
public java.util.Set entrySet()
public edu.emory.mathcs.backport.java.util.NavigableMap descendingMap()
public edu.emory.mathcs.backport.java.util.NavigableSet descendingKeySet()
public boolean equals(Object o)
public Object putIfAbsent(Object key, Object value)
public boolean remove(Object key, Object value)
public boolean replace(Object key, Object oldValue, Object newValue)
public Object replace(Object key, Object value)
public java.util.Comparator comparator()
public Object firstKey()
public Object lastKey()
public edu.emory.mathcs.backport.java.util.NavigableMap subMap(Object fromKey, boolean fromInclusive, Object toKey, boolean toInclusive)
public edu.emory.mathcs.backport.java.util.NavigableMap headMap(Object toKey, boolean inclusive)
public edu.emory.mathcs.backport.java.util.NavigableMap tailMap(Object fromKey, boolean inclusive)
public java.util.SortedMap subMap(Object fromKey, Object toKey)
public java.util.SortedMap headMap(Object toKey)
public java.util.SortedMap tailMap(Object fromKey)
public Object lowerKey(Object key)
public Object floorKey(Object key)
public Object ceilingKey(Object key)
public Object higherKey(Object key)
java.util.Iterator keyIterator()
java.util.Iterator valueIterator()
java.util.Iterator entryIterator()
static final java.util.List toList(java.util.Collection c)
static void ()

edu.emory.mathcs.backport.java.util.concurrent.ConcurrentSkipListSet(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (java.util.Comparator comparator)
public void (java.util.Collection c)
public void (java.util.SortedSet s)
void (edu.emory.mathcs.backport.java.util.concurrent.ConcurrentNavigableMap m)
public Object clone()
public int size()
public boolean isEmpty()
public boolean contains(Object o)
public boolean add(Object e)
public boolean remove(Object o)
public void clear()
public java.util.Iterator iterator()
public java.util.Iterator descendingIterator()
public boolean equals(Object o)
public boolean removeAll(java.util.Collection c)
public Object lower(Object e)
public Object floor(Object e)
public Object ceiling(Object e)
public Object higher(Object e)
public Object pollFirst()
public Object pollLast()
public java.util.Comparator comparator()
public Object first()
public Object last()
public edu.emory.mathcs.backport.java.util.NavigableSet subSet(Object fromElement, boolean fromInclusive, Object toElement, boolean toInclusive)
public edu.emory.mathcs.backport.java.util.NavigableSet headSet(Object toElement, boolean inclusive)
public edu.emory.mathcs.backport.java.util.NavigableSet tailSet(Object fromElement, boolean inclusive)
public java.util.SortedSet subSet(Object fromElement, Object toElement)
public java.util.SortedSet headSet(Object toElement)
public java.util.SortedSet tailSet(Object fromElement)
public edu.emory.mathcs.backport.java.util.NavigableSet descendingSet()

edu.emory.mathcs.backport.java.util.concurrent.CopyOnWriteArrayList(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (java.util.Collection c)
public void (Object[] array)
final Object[] getArray()
final void setArray(Object[] array)
public int size()
public boolean isEmpty()
private static int search(Object[] array, Object subject, int pos, int end)
private static int reverseSearch(Object[] array, Object subject, int start, int pos)
public boolean contains(Object o)
public java.util.Iterator iterator()
public Object[] toArray()
public Object[] toArray(Object[] a)
public boolean add(Object o)
public boolean addIfAbsent(Object o)
public int addAllAbsent(java.util.Collection c)
public boolean remove(Object o)
public boolean containsAll(java.util.Collection c)
public boolean addAll(java.util.Collection c)
public boolean addAll(int index, java.util.Collection c)
public boolean removeAll(java.util.Collection c)
public boolean retainAll(java.util.Collection c)
public void clear()
public Object clone()
public boolean equals(Object o)
public int hashCode()
public Object get(int index)
public Object set(int index, Object element)
public void add(int index, Object element)
public Object remove(int index)
public int indexOf(Object o)
public int indexOf(Object o, int index)
public int lastIndexOf(Object o)
public int lastIndexOf(Object o, int index)
public java.util.ListIterator listIterator()
public java.util.ListIterator listIterator(int index)
public java.util.List subList(int fromIndex, int toIndex)
private void writeObject(java.io.ObjectOutputStream out)
		throws java.io.IOException
private void readObject(java.io.ObjectInputStream in)
		throws java.io.IOException, java.lang.ClassNotFoundException
public String toString()
private static boolean eq(Object o1, Object o2)

edu.emory.mathcs.backport.java.util.concurrent.CopyOnWriteArraySet(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (java.util.Collection c)
public int size()
public boolean isEmpty()
public boolean contains(Object o)
public Object[] toArray()
public Object[] toArray(Object[] a)
public void clear()
public boolean remove(Object o)
public boolean add(Object e)
public boolean containsAll(java.util.Collection c)
public boolean addAll(java.util.Collection c)
public boolean removeAll(java.util.Collection c)
public boolean retainAll(java.util.Collection c)
public java.util.Iterator iterator()
public boolean equals(Object o)
private static boolean eq(Object o1, Object o2)

edu.emory.mathcs.backport.java.util.concurrent.CountDownLatch(Ci-dessous la liste des Méthodes de la classe)

public void (int count)
public void await()
		throws java.lang.InterruptedException
public boolean await(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public void countDown()
public long getCount()
public String toString()

edu.emory.mathcs.backport.java.util.concurrent.CyclicBarrier(Ci-dessous la liste des Méthodes de la classe)

private void nextGeneration()
private void breakBarrier()
private int dowait(boolean timed, long nanos)
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.BrokenBarrierException, edu.emory.mathcs.backport.java.util.concurrent.TimeoutException
public void (int parties, Runnable barrierAction)
public void (int parties)
public int getParties()
public int await()
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.BrokenBarrierException
public int await(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.BrokenBarrierException, edu.emory.mathcs.backport.java.util.concurrent.TimeoutException
public boolean isBroken()
public void reset()
public int getNumberWaiting()

edu.emory.mathcs.backport.java.util.concurrent.DelayQueue(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (java.util.Collection c)
public boolean add(Object e)
public boolean offer(Object e)
public void put(Object e)
public boolean offer(Object e, long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
public Object poll()
public Object take()
		throws java.lang.InterruptedException
public Object poll(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public Object peek()
public int size()
public int drainTo(java.util.Collection c)
public int drainTo(java.util.Collection c, int maxElements)
public void clear()
public int remainingCapacity()
public Object[] toArray()
public Object[] toArray(Object[] a)
public boolean remove(Object o)
public java.util.Iterator iterator()
static void ()

edu.emory.mathcs.backport.java.util.concurrent.Delayed(Ci-dessous la liste des Méthodes de la classe)

public abstract long getDelay(edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg1)

edu.emory.mathcs.backport.java.util.concurrent.Exchanger(Ci-dessous la liste des Méthodes de la classe)

private Object doExchange(Object item, boolean timed, long nanos)
private final int hashIndex()
private void createSlot(int index)
public void ()
public Object exchange(Object x)
		throws java.lang.InterruptedException
public Object exchange(Object x, long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.TimeoutException
static void ()

edu.emory.mathcs.backport.java.util.concurrent.ExecutionException(Ci-dessous la liste des Méthodes de la classe)

protected void ()
protected void (String message)
public void (String message, Throwable cause)
public void (Throwable cause)

edu.emory.mathcs.backport.java.util.concurrent.Executor(Ci-dessous la liste des Méthodes de la classe)

public abstract void execute(Runnable arg1)

edu.emory.mathcs.backport.java.util.concurrent.ExecutorCompletionService(Ci-dessous la liste des Méthodes de la classe)

private edu.emory.mathcs.backport.java.util.concurrent.RunnableFuture newTaskFor(edu.emory.mathcs.backport.java.util.concurrent.Callable task)
private edu.emory.mathcs.backport.java.util.concurrent.RunnableFuture newTaskFor(Runnable task, Object result)
public void (edu.emory.mathcs.backport.java.util.concurrent.Executor executor)
public void (edu.emory.mathcs.backport.java.util.concurrent.Executor executor, edu.emory.mathcs.backport.java.util.concurrent.BlockingQueue completionQueue)
public edu.emory.mathcs.backport.java.util.concurrent.Future submit(edu.emory.mathcs.backport.java.util.concurrent.Callable task)
public edu.emory.mathcs.backport.java.util.concurrent.Future submit(Runnable task, Object result)
public edu.emory.mathcs.backport.java.util.concurrent.Future take()
		throws java.lang.InterruptedException
public edu.emory.mathcs.backport.java.util.concurrent.Future poll()
public edu.emory.mathcs.backport.java.util.concurrent.Future poll(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException

edu.emory.mathcs.backport.java.util.concurrent.ExecutorService(Ci-dessous la liste des Méthodes de la classe)

public abstract void shutdown()
public abstract java.util.List shutdownNow()
public abstract boolean isShutdown()
public abstract boolean isTerminated()
public abstract boolean awaitTermination(long arg1, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg3)
		throws java.lang.InterruptedException
public abstract edu.emory.mathcs.backport.java.util.concurrent.Future submit(edu.emory.mathcs.backport.java.util.concurrent.Callable arg1)
public abstract edu.emory.mathcs.backport.java.util.concurrent.Future submit(Runnable arg1, Object arg2)
public abstract edu.emory.mathcs.backport.java.util.concurrent.Future submit(Runnable arg1)
public abstract java.util.List invokeAll(java.util.Collection arg1)
		throws java.lang.InterruptedException
public abstract java.util.List invokeAll(java.util.Collection arg1, long arg2, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg4)
		throws java.lang.InterruptedException
public abstract Object invokeAny(java.util.Collection arg1)
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.ExecutionException
public abstract Object invokeAny(java.util.Collection arg1, long arg2, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg4)
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.ExecutionException, edu.emory.mathcs.backport.java.util.concurrent.TimeoutException

edu.emory.mathcs.backport.java.util.concurrent.Executors(Ci-dessous la liste des Méthodes de la classe)

public static edu.emory.mathcs.backport.java.util.concurrent.ExecutorService newFixedThreadPool(int nThreads)
public static edu.emory.mathcs.backport.java.util.concurrent.ExecutorService newFixedThreadPool(int nThreads, edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory threadFactory)
public static edu.emory.mathcs.backport.java.util.concurrent.ExecutorService newSingleThreadExecutor()
public static edu.emory.mathcs.backport.java.util.concurrent.ExecutorService newSingleThreadExecutor(edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory threadFactory)
public static edu.emory.mathcs.backport.java.util.concurrent.ExecutorService newCachedThreadPool()
public static edu.emory.mathcs.backport.java.util.concurrent.ExecutorService newCachedThreadPool(edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory threadFactory)
public static edu.emory.mathcs.backport.java.util.concurrent.ScheduledExecutorService newSingleThreadScheduledExecutor()
public static edu.emory.mathcs.backport.java.util.concurrent.ScheduledExecutorService newSingleThreadScheduledExecutor(edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory threadFactory)
public static edu.emory.mathcs.backport.java.util.concurrent.ScheduledExecutorService newScheduledThreadPool(int corePoolSize)
public static edu.emory.mathcs.backport.java.util.concurrent.ScheduledExecutorService newScheduledThreadPool(int corePoolSize, edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory threadFactory)
public static edu.emory.mathcs.backport.java.util.concurrent.ExecutorService unconfigurableExecutorService(edu.emory.mathcs.backport.java.util.concurrent.ExecutorService executor)
public static edu.emory.mathcs.backport.java.util.concurrent.ScheduledExecutorService unconfigurableScheduledExecutorService(edu.emory.mathcs.backport.java.util.concurrent.ScheduledExecutorService executor)
public static edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory defaultThreadFactory()
public static edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory privilegedThreadFactory()
public static edu.emory.mathcs.backport.java.util.concurrent.Callable callable(Runnable task, Object result)
public static edu.emory.mathcs.backport.java.util.concurrent.Callable callable(Runnable task)
public static edu.emory.mathcs.backport.java.util.concurrent.Callable callable(java.security.PrivilegedAction action)
public static edu.emory.mathcs.backport.java.util.concurrent.Callable callable(java.security.PrivilegedExceptionAction action)
public static edu.emory.mathcs.backport.java.util.concurrent.Callable privilegedCallable(edu.emory.mathcs.backport.java.util.concurrent.Callable callable)
public static edu.emory.mathcs.backport.java.util.concurrent.Callable privilegedCallableUsingCurrentClassLoader(edu.emory.mathcs.backport.java.util.concurrent.Callable callable)
private void ()

edu.emory.mathcs.backport.java.util.concurrent.Future(Ci-dessous la liste des Méthodes de la classe)

public abstract boolean cancel(boolean arg1)
public abstract boolean isCancelled()
public abstract boolean isDone()
public abstract Object get()
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.ExecutionException
public abstract Object get(long arg1, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg3)
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.ExecutionException, edu.emory.mathcs.backport.java.util.concurrent.TimeoutException

edu.emory.mathcs.backport.java.util.concurrent.FutureTask(Ci-dessous la liste des Méthodes de la classe)

public void (edu.emory.mathcs.backport.java.util.concurrent.Callable callable)
public void (Runnable runnable, Object result)
public boolean isCancelled()
public boolean isDone()
public boolean cancel(boolean mayInterruptIfRunning)
public Object get()
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.ExecutionException
public Object get(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException, edu.emory.mathcs.backport.java.util.concurrent.ExecutionException, edu.emory.mathcs.backport.java.util.concurrent.TimeoutException
protected void done()
protected void set(Object v)
protected void setException(Throwable t)
public void run()
protected boolean runAndReset()

edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingDeque(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (int capacity)
public void (java.util.Collection c)
private boolean linkFirst(Object e)
private boolean linkLast(Object e)
private Object unlinkFirst()
private Object unlinkLast()
public void addFirst(Object e)
public void addLast(Object e)
public boolean offerFirst(Object e)
public boolean offerLast(Object e)
public void putFirst(Object e)
		throws java.lang.InterruptedException
public void putLast(Object e)
		throws java.lang.InterruptedException
public boolean offerFirst(Object e, long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public boolean offerLast(Object e, long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public Object removeFirst()
public Object removeLast()
public Object pollFirst()
public Object pollLast()
public Object takeFirst()
		throws java.lang.InterruptedException
public Object takeLast()
		throws java.lang.InterruptedException
public Object pollFirst(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public Object pollLast(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public Object getFirst()
public Object getLast()
public Object peekFirst()
public Object peekLast()
public boolean removeFirstOccurrence(Object o)
public boolean removeLastOccurrence(Object o)
public boolean add(Object e)
public boolean offer(Object e)
public void put(Object e)
		throws java.lang.InterruptedException
public boolean offer(Object e, long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public Object remove()
public Object poll()
public Object take()
		throws java.lang.InterruptedException
public Object poll(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public Object element()
public Object peek()
public int remainingCapacity()
public int drainTo(java.util.Collection c)
public int drainTo(java.util.Collection c, int maxElements)
public void push(Object e)
public Object pop()
public boolean remove(Object o)
public int size()
public boolean contains(Object o)
public Object[] toArray()
public Object[] toArray(Object[] a)
public String toString()
public void clear()
public java.util.Iterator iterator()
public java.util.Iterator descendingIterator()
private void writeObject(java.io.ObjectOutputStream s)
		throws java.io.IOException
private void readObject(java.io.ObjectInputStream s)
		throws java.io.IOException, java.lang.ClassNotFoundException

edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue(Ci-dessous la liste des Méthodes de la classe)

private void signalNotEmpty()
private void signalNotFull()
private void insert(Object x)
private Object extract()
private void fullyLock()
private void fullyUnlock()
public void ()
public void (int capacity)
public void (java.util.Collection c)
public int size()
public int remainingCapacity()
public void put(Object e)
		throws java.lang.InterruptedException
public boolean offer(Object e, long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public boolean offer(Object e)
public Object take()
		throws java.lang.InterruptedException
public Object poll(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public Object poll()
public Object peek()
public boolean remove(Object o)
public Object[] toArray()
public Object[] toArray(Object[] a)
public String toString()
public void clear()
public int drainTo(java.util.Collection c)
public int drainTo(java.util.Collection c, int maxElements)
public java.util.Iterator iterator()
private void writeObject(java.io.ObjectOutputStream s)
		throws java.io.IOException
private void readObject(java.io.ObjectInputStream s)
		throws java.io.IOException, java.lang.ClassNotFoundException
static void ()

edu.emory.mathcs.backport.java.util.concurrent.PriorityBlockingQueue(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (int initialCapacity)
public void (int initialCapacity, java.util.Comparator comparator)
public void (java.util.Collection c)
public boolean add(Object e)
public boolean offer(Object e)
public void put(Object e)
public boolean offer(Object e, long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
public Object poll()
public Object take()
		throws java.lang.InterruptedException
public Object poll(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public Object peek()
public java.util.Comparator comparator()
public int size()
public int remainingCapacity()
public boolean remove(Object o)
public boolean contains(Object o)
public Object[] toArray()
public String toString()
public int drainTo(java.util.Collection c)
public int drainTo(java.util.Collection c, int maxElements)
public void clear()
public Object[] toArray(Object[] a)
public java.util.Iterator iterator()
private void writeObject(java.io.ObjectOutputStream s)
		throws java.io.IOException
static void ()

edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionException(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (String message)
public void (String message, Throwable cause)
public void (Throwable cause)

edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionHandler(Ci-dessous la liste des Méthodes de la classe)

public abstract void rejectedExecution(Runnable arg1, edu.emory.mathcs.backport.java.util.concurrent.ThreadPoolExecutor arg2)

edu.emory.mathcs.backport.java.util.concurrent.RunnableFuture(Ci-dessous la liste des Méthodes de la classe)

public abstract void run()

edu.emory.mathcs.backport.java.util.concurrent.RunnableScheduledFuture(Ci-dessous la liste des Méthodes de la classe)

public abstract boolean isPeriodic()

edu.emory.mathcs.backport.java.util.concurrent.ScheduledExecutorService(Ci-dessous la liste des Méthodes de la classe)

public abstract edu.emory.mathcs.backport.java.util.concurrent.ScheduledFuture schedule(Runnable arg1, long arg2, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg4)
public abstract edu.emory.mathcs.backport.java.util.concurrent.ScheduledFuture schedule(edu.emory.mathcs.backport.java.util.concurrent.Callable arg1, long arg2, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg4)
public abstract edu.emory.mathcs.backport.java.util.concurrent.ScheduledFuture scheduleAtFixedRate(Runnable arg1, long arg2, long arg4, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg6)
public abstract edu.emory.mathcs.backport.java.util.concurrent.ScheduledFuture scheduleWithFixedDelay(Runnable arg1, long arg2, long arg4, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg6)

edu.emory.mathcs.backport.java.util.concurrent.ScheduledThreadPoolExecutor(Ci-dessous la liste des Méthodes de la classe)

final long now()
boolean canRunInCurrentRunState(boolean periodic)
private void delayedExecute(edu.emory.mathcs.backport.java.util.concurrent.RunnableScheduledFuture task)
void reExecutePeriodic(edu.emory.mathcs.backport.java.util.concurrent.RunnableScheduledFuture task)
void onShutdown()
protected edu.emory.mathcs.backport.java.util.concurrent.RunnableScheduledFuture decorateTask(Runnable runnable, edu.emory.mathcs.backport.java.util.concurrent.RunnableScheduledFuture task)
protected edu.emory.mathcs.backport.java.util.concurrent.RunnableScheduledFuture decorateTask(edu.emory.mathcs.backport.java.util.concurrent.Callable callable, edu.emory.mathcs.backport.java.util.concurrent.RunnableScheduledFuture task)
public void (int corePoolSize)
public void (int corePoolSize, edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory threadFactory)
public void (int corePoolSize, edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionHandler handler)
public void (int corePoolSize, edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory threadFactory, edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionHandler handler)
public edu.emory.mathcs.backport.java.util.concurrent.ScheduledFuture schedule(Runnable command, long delay, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
public edu.emory.mathcs.backport.java.util.concurrent.ScheduledFuture schedule(edu.emory.mathcs.backport.java.util.concurrent.Callable callable, long delay, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
public edu.emory.mathcs.backport.java.util.concurrent.ScheduledFuture scheduleAtFixedRate(Runnable command, long initialDelay, long period, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
public edu.emory.mathcs.backport.java.util.concurrent.ScheduledFuture scheduleWithFixedDelay(Runnable command, long initialDelay, long delay, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
public void execute(Runnable command)
public edu.emory.mathcs.backport.java.util.concurrent.Future submit(Runnable task)
public edu.emory.mathcs.backport.java.util.concurrent.Future submit(Runnable task, Object result)
public edu.emory.mathcs.backport.java.util.concurrent.Future submit(edu.emory.mathcs.backport.java.util.concurrent.Callable task)
public void setContinueExistingPeriodicTasksAfterShutdownPolicy(boolean value)
public boolean getContinueExistingPeriodicTasksAfterShutdownPolicy()
public void setExecuteExistingDelayedTasksAfterShutdownPolicy(boolean value)
public boolean getExecuteExistingDelayedTasksAfterShutdownPolicy()
public void shutdown()
public java.util.List shutdownNow()
public edu.emory.mathcs.backport.java.util.concurrent.BlockingQueue getQueue()
static void ()

edu.emory.mathcs.backport.java.util.concurrent.Semaphore(Ci-dessous la liste des Méthodes de la classe)

public void (int permits)
public void (int permits, boolean fair)
public void acquire()
		throws java.lang.InterruptedException
public void acquireUninterruptibly()
public boolean tryAcquire()
public boolean tryAcquire(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public void release()
public void acquire(int permits)
		throws java.lang.InterruptedException
public void acquireUninterruptibly(int permits)
public boolean tryAcquire(int permits)
public boolean tryAcquire(int permits, long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public void release(int permits)
public int availablePermits()
public int drainPermits()
protected void reducePermits(int reduction)
public boolean isFair()
public final boolean hasQueuedThreads()
public final int getQueueLength()
protected java.util.Collection getQueuedThreads()
public String toString()

edu.emory.mathcs.backport.java.util.concurrent.SynchronousQueue(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (boolean fair)
public void put(Object o)
		throws java.lang.InterruptedException
public boolean offer(Object o, long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public boolean offer(Object e)
public Object take()
		throws java.lang.InterruptedException
public Object poll(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public Object poll()
public boolean isEmpty()
public int size()
public int remainingCapacity()
public void clear()
public boolean contains(Object o)
public boolean remove(Object o)
public boolean containsAll(java.util.Collection c)
public boolean removeAll(java.util.Collection c)
public boolean retainAll(java.util.Collection c)
public Object peek()
public java.util.Iterator iterator()
public Object[] toArray()
public Object[] toArray(Object[] a)
public int drainTo(java.util.Collection c)
public int drainTo(java.util.Collection c, int maxElements)
private void writeObject(java.io.ObjectOutputStream s)
		throws java.io.IOException
private void readObject(java.io.ObjectInputStream s)
		throws java.io.IOException, java.lang.ClassNotFoundException
static void ()

edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory(Ci-dessous la liste des Méthodes de la classe)

public abstract Thread newThread(Runnable arg1)

edu.emory.mathcs.backport.java.util.concurrent.ThreadPoolExecutor(Ci-dessous la liste des Méthodes de la classe)

private static int runStateOf(int c)
private static int workerCountOf(int c)
private static int ctlOf(int r, int w)
private void advanceRunState(int targetState)
final void tryTerminate()
private void decrementWorkerCount()
private void checkShutdownAccess()
private void interruptWorkers()
private void interruptIdleWorkers(boolean onlyOne)
private void interruptIdleWorkers()
private void clearInterruptsForTaskRun()
final void reject(Runnable command)
void onShutdown()
final boolean isRunningOrShutdown(boolean shutdownOK)
private java.util.List drainQueue()
private boolean addWorker(Runnable firstTask, boolean core)
private Runnable getTask()
public void (int corePoolSize, int maximumPoolSize, long keepAliveTime, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit, edu.emory.mathcs.backport.java.util.concurrent.BlockingQueue workQueue)
public void (int corePoolSize, int maximumPoolSize, long keepAliveTime, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit, edu.emory.mathcs.backport.java.util.concurrent.BlockingQueue workQueue, edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory threadFactory)
public void (int corePoolSize, int maximumPoolSize, long keepAliveTime, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit, edu.emory.mathcs.backport.java.util.concurrent.BlockingQueue workQueue, edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionHandler handler)
public void (int corePoolSize, int maximumPoolSize, long keepAliveTime, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit, edu.emory.mathcs.backport.java.util.concurrent.BlockingQueue workQueue, edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory threadFactory, edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionHandler handler)
public void execute(Runnable command)
public void shutdown()
public java.util.List shutdownNow()
public boolean isShutdown()
public boolean isTerminating()
public boolean isTerminated()
public boolean awaitTermination(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
protected void finalize()
public void setThreadFactory(edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory threadFactory)
public edu.emory.mathcs.backport.java.util.concurrent.ThreadFactory getThreadFactory()
public void setRejectedExecutionHandler(edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionHandler handler)
public edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionHandler getRejectedExecutionHandler()
public void setCorePoolSize(int corePoolSize)
public int getCorePoolSize()
public boolean prestartCoreThread()
public int prestartAllCoreThreads()
public boolean allowsCoreThreadTimeOut()
public void allowCoreThreadTimeOut(boolean value)
public void setMaximumPoolSize(int maximumPoolSize)
public int getMaximumPoolSize()
public void setKeepAliveTime(long time, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
public long getKeepAliveTime(edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
public edu.emory.mathcs.backport.java.util.concurrent.BlockingQueue getQueue()
public boolean remove(Runnable task)
public void purge()
public int getPoolSize()
public int getActiveCount()
public int getLargestPoolSize()
public long getTaskCount()
public long getCompletedTaskCount()
protected void beforeExecute(Thread t, Runnable r)
protected void afterExecute(Runnable r, Throwable t)
protected void terminated()
static void ()

edu.emory.mathcs.backport.java.util.concurrent.TimeUnit(Ci-dessous la liste des Méthodes de la classe)

public static edu.emory.mathcs.backport.java.util.concurrent.TimeUnit[] values()
public static edu.emory.mathcs.backport.java.util.concurrent.TimeUnit valueOf(String name)
void (int index, String name)
static long x(long d, long m, long over)
public abstract long convert(long arg1, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg3)
public abstract long toNanos(long arg1)
public abstract long toMicros(long arg1)
public abstract long toMillis(long arg1)
public abstract long toSeconds(long arg1)
public abstract long toMinutes(long arg1)
public abstract long toHours(long arg1)
public abstract long toDays(long arg1)
abstract int excessNanos(long arg1, long arg3)
public String name()
public int ordinal()
protected Object readResolve()
		throws java.io.ObjectStreamException
public void timedWait(Object obj, long timeout)
		throws java.lang.InterruptedException
public void timedJoin(Thread thread, long timeout)
		throws java.lang.InterruptedException
public void sleep(long timeout)
		throws java.lang.InterruptedException
public String toString()
static void ()

edu.emory.mathcs.backport.java.util.concurrent.TimeoutException(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (String message)

edu.emory.mathcs.backport.java.util.concurrent.atomic.AtomicBoolean(Ci-dessous la liste des Méthodes de la classe)

public void (boolean initialValue)
public void ()
public final void lazySet(boolean newValue)

edu.emory.mathcs.backport.java.util.concurrent.atomic.AtomicInteger(Ci-dessous la liste des Méthodes de la classe)

public void (int initialValue)
public void ()
public final void lazySet(int newValue)

edu.emory.mathcs.backport.java.util.concurrent.atomic.AtomicIntegerArray(Ci-dessous la liste des Méthodes de la classe)

public void (int length)
public void (int[] array)
public final void lazySet(int i, int newValue)

edu.emory.mathcs.backport.java.util.concurrent.atomic.AtomicLong(Ci-dessous la liste des Méthodes de la classe)

public void (long initialValue)
public void ()
public final void lazySet(long newValue)

edu.emory.mathcs.backport.java.util.concurrent.atomic.AtomicLongArray(Ci-dessous la liste des Méthodes de la classe)

public void (int length)
public void (long[] array)
public final void lazySet(int i, long newValue)

edu.emory.mathcs.backport.java.util.concurrent.atomic.AtomicMarkableReference(Ci-dessous la liste des Méthodes de la classe)

public void (Object initialRef, boolean initialMark)
public Object getReference()
public boolean isMarked()
public Object get(boolean[] markHolder)
public boolean weakCompareAndSet(Object expectedReference, Object newReference, boolean expectedMark, boolean newMark)
public boolean compareAndSet(Object expectedReference, Object newReference, boolean expectedMark, boolean newMark)
public void set(Object newReference, boolean newMark)
public boolean attemptMark(Object expectedReference, boolean newMark)

edu.emory.mathcs.backport.java.util.concurrent.atomic.AtomicReference(Ci-dessous la liste des Méthodes de la classe)

public void (Object initialValue)
public void ()
public final void lazySet(Object newValue)

edu.emory.mathcs.backport.java.util.concurrent.atomic.AtomicReferenceArray(Ci-dessous la liste des Méthodes de la classe)

public void (int length)
public void (Object[] array)
public final void lazySet(int i, Object newValue)

edu.emory.mathcs.backport.java.util.concurrent.atomic.AtomicStampedReference(Ci-dessous la liste des Méthodes de la classe)

public void (Object initialRef, int initialStamp)
public Object getReference()
public int getStamp()
public Object get(int[] stampHolder)
public boolean weakCompareAndSet(Object expectedReference, Object newReference, int expectedStamp, int newStamp)
public boolean compareAndSet(Object expectedReference, Object newReference, int expectedStamp, int newStamp)
public void set(Object newReference, int newStamp)
public boolean attemptStamp(Object expectedReference, int newStamp)

edu.emory.mathcs.backport.java.util.concurrent.helpers.AbstractOwnableQueuedSynchronizer(Ci-dessous la liste des Méthodes de la classe)

protected void ()
protected final void setExclusiveOwnerThread(Thread t)
protected final Thread getExclusiveOwnerThread()

edu.emory.mathcs.backport.java.util.concurrent.helpers.FIFOWaitQueue(Ci-dessous la liste des Méthodes de la classe)

public void ()
public boolean hasNodes()
public int getLength()
public java.util.Collection getWaitingThreads()
public boolean isWaiting(Thread thread)

edu.emory.mathcs.backport.java.util.concurrent.helpers.NanoTimer(Ci-dessous la liste des Méthodes de la classe)

public abstract long nanoTime()

edu.emory.mathcs.backport.java.util.concurrent.helpers.ThreadHelpers(Ci-dessous la liste des Méthodes de la classe)

private void ()

edu.emory.mathcs.backport.java.util.concurrent.helpers.Utils(Ci-dessous la liste des Méthodes de la classe)

private void ()
public static long nanoTime()
public static long awaitNanos(edu.emory.mathcs.backport.java.util.concurrent.locks.Condition cond, long nanosTimeout)
		throws java.lang.InterruptedException
public static Object[] collectionToArray(java.util.Collection c)
public static Object[] collectionToArray(java.util.Collection c, Object[] a)

edu.emory.mathcs.backport.java.util.concurrent.helpers.WaitQueue(Ci-dessous la liste des Méthodes de la classe)

public void ()
public abstract boolean hasNodes()
public abstract int getLength()
public abstract java.util.Collection getWaitingThreads()
public abstract boolean isWaiting(Thread arg1)

edu.emory.mathcs.backport.java.util.concurrent.locks.Condition(Ci-dessous la liste des Méthodes de la classe)

public abstract void await()
		throws java.lang.InterruptedException
public abstract void awaitUninterruptibly()
public abstract boolean await(long arg1, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg3)
		throws java.lang.InterruptedException
public abstract boolean awaitUntil(java.util.Date arg1)
		throws java.lang.InterruptedException
public abstract void signal()
public abstract void signalAll()

edu.emory.mathcs.backport.java.util.concurrent.locks.ConditionObjectWrapper(Ci-dessous la liste des Méthodes de la classe)

public void awaitUninterruptibly()
public void await()
		throws java.lang.InterruptedException
public boolean await(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public boolean await(long timeout, java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public long awaitNanos(long timeout)
		throws java.lang.InterruptedException
public boolean awaitUntil(java.util.Date deadline)
		throws java.lang.InterruptedException
public void signal()
public void signalAll()

edu.emory.mathcs.backport.java.util.concurrent.locks.Lock(Ci-dessous la liste des Méthodes de la classe)

public abstract void lock()
public abstract void lockInterruptibly()
		throws java.lang.InterruptedException
public abstract boolean tryLock()
public abstract boolean tryLock(long arg1, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit arg3)
		throws java.lang.InterruptedException
public abstract void unlock()
public abstract edu.emory.mathcs.backport.java.util.concurrent.locks.Condition newCondition()

edu.emory.mathcs.backport.java.util.concurrent.locks.ReadWriteLock(Ci-dessous la liste des Méthodes de la classe)

public abstract edu.emory.mathcs.backport.java.util.concurrent.locks.Lock readLock()
public abstract edu.emory.mathcs.backport.java.util.concurrent.locks.Lock writeLock()

edu.emory.mathcs.backport.java.util.concurrent.locks.ReentrantLock(Ci-dessous la liste des Méthodes de la classe)

public void ()
public void (boolean fair)
public void lock()
public void lockInterruptibly()
		throws java.lang.InterruptedException
public boolean tryLock()
public boolean tryLock(long timeout, edu.emory.mathcs.backport.java.util.concurrent.TimeUnit unit)
		throws java.lang.InterruptedException
public void unlock()
public edu.emory.mathcs.backport.java.util.concurrent.locks.Condition newCondition()
public int getHoldCount()
public boolean isHeldByCurrentThread()
public boolean isLocked()
public final boolean isFair()
protected Thread getOwner()
public final boolean hasQueuedThreads()
public final boolean hasQueuedThread(Thread thread)
public final int getQueueLength()
protected java.util.Collection getQueuedThreads()
public boolean hasWaiters(edu.emory.mathcs.backport.java.util.concurrent.locks.Condition condition)
public int getWaitQueueLength(edu.emory.mathcs.backport.java.util.concurrent.locks.Condition condition)
protected java.util.Collection getWaitingThreads(edu.emory.mathcs.backport.java.util.concurrent.locks.Condition condition)
public String toString()

edu.emory.mathcs.backport.java.util.concurrent.locks.ReentrantReadWriteLock(Ci-dessous la liste des Méthodes de la classe)

public void ()
public edu.emory.mathcs.backport.java.util.concurrent.locks.Lock writeLock()
public edu.emory.mathcs.backport.java.util.concurrent.locks.Lock readLock()
public final boolean isFair()
protected Thread getOwner()
public int getReadLockCount()
public boolean isWriteLocked()
public boolean isWriteLockedByCurrentThread()
public int getWriteHoldCount()
public int getReadHoldCount()
public final boolean hasQueuedThreads()
public final int getQueueLength()
public String toString()
Categories: Téléchargement
Tags: , , , , , , , , , , , , , , , , ,

Leave a Reply

Your email address will not be published. Required fields are marked *