/libcore/ojluni/src/main/java/java/util/ |
D | EnumSet.java | 79 public abstract class EnumSet<E extends Enum<E>> extends AbstractSet<E> 85 final Class<E> elementType; 94 EnumSet(Class<E>elementType, Enum<?>[] universe) { in EnumSet() 108 public static <E extends Enum<E>> EnumSet<E> noneOf(Class<E> elementType) { in noneOf() 129 public static <E extends Enum<E>> EnumSet<E> allOf(Class<E> elementType) { in allOf() 130 EnumSet<E> result = noneOf(elementType); in allOf() 150 public static <E extends Enum<E>> EnumSet<E> copyOf(EnumSet<E> s) { in copyOf() 168 public static <E extends Enum<E>> EnumSet<E> copyOf(Collection<E> c) { in copyOf() 170 return ((EnumSet<E>)c).clone(); in copyOf() 174 Iterator<E> i = c.iterator(); in copyOf() [all …]
|
D | NavigableSet.java | 90 public interface NavigableSet<E> extends SortedSet<E> { 103 E lower(E e); in lower() 117 E floor(E e); in floor() 131 E ceiling(E e); in ceiling() 145 E higher(E e); in higher() 153 E pollFirst(); in pollFirst() 161 E pollLast(); in pollLast() 168 Iterator<E> iterator(); in iterator() 185 NavigableSet<E> descendingSet(); in descendingSet() 193 Iterator<E> descendingIterator(); in descendingIterator() [all …]
|
D | Deque.java | 192 public interface Deque<E> extends Queue<E> { 210 void addFirst(E e); in addFirst() 231 void addLast(E e); in addLast() 249 boolean offerFirst(E e); in offerFirst() 267 boolean offerLast(E e); in offerLast() 277 E removeFirst(); in removeFirst() 287 E removeLast(); in removeLast() 295 E pollFirst(); in pollFirst() 303 E pollLast(); in pollLast() 314 E getFirst(); in getFirst() [all …]
|
D | TreeSet.java | 92 public class TreeSet<E> extends AbstractSet<E> 93 implements NavigableSet<E>, Cloneable, java.io.Serializable 98 private transient NavigableMap<E,Object> m; 106 TreeSet(NavigableMap<E,Object> m) { in TreeSet() argument 124 this(new TreeMap<E,Object>()); in TreeSet() 140 public TreeSet(Comparator<? super E> comparator) { in TreeSet() 158 public TreeSet(Collection<? extends E> c) { in TreeSet() 170 public TreeSet(SortedSet<E> s) { in TreeSet() 180 public Iterator<E> iterator() { in iterator() 190 public Iterator<E> descendingIterator() { in descendingIterator() [all …]
|
D | LinkedList.java | 83 public class LinkedList<E> 84 extends AbstractSequentialList<E> 85 implements List<E>, Deque<E>, Cloneable, java.io.Serializable 94 transient Node<E> first; 101 transient Node<E> last; 117 public LinkedList(Collection<? extends E> c) { in LinkedList() 125 private void linkFirst(E e) { in linkFirst() 126 final Node<E> f = first; in linkFirst() 127 final Node<E> newNode = new Node<>(null, e, f); in linkFirst() 140 void linkLast(E e) { in linkLast() [all …]
|
D | SortedSet.java | 108 public interface SortedSet<E> extends Set<E> { 118 Comparator<? super E> comparator(); in comparator() 151 SortedSet<E> subSet(E fromElement, E toElement); in subSet() 178 SortedSet<E> headSet(E toElement); in headSet() 205 SortedSet<E> tailSet(E fromElement); in tailSet() 213 E first(); in first() 221 E last(); in last() 255 default Spliterator<E> spliterator() { in spliterator() 256 return new Spliterators.IteratorSpliterator<E>( in spliterator() 259 public Comparator<? super E> getComparator() { in spliterator()
|
D | AbstractList.java | 71 public abstract class AbstractList<E> extends AbstractCollection<E> implements List<E> { 107 public boolean add(E e) { in add() 117 abstract public E get(int index); in get() 131 public E set(int index, E element) { in set() 147 public void add(int index, E element) { in add() 160 public E remove(int index) { in remove() 178 ListIterator<E> it = listIterator(); in indexOf() 203 ListIterator<E> it = listIterator(size()); in lastIndexOf() 256 public boolean addAll(int index, Collection<? extends E> c) { in addAll() 259 for (E e : c) { in addAll() [all …]
|
D | List.java | 111 public interface List<E> extends Collection<E> { 152 Iterator<E> iterator(); in iterator() 238 boolean add(E e); in add() 307 boolean addAll(Collection<? extends E> c); in addAll() 336 boolean addAll(int index, Collection<? extends E> c); in addAll() 409 default void replaceAll(UnaryOperator<E> operator) { in replaceAll() 411 final ListIterator<E> li = this.listIterator(); in replaceAll() 498 default void sort(Comparator<? super E> c) { in sort() 501 ListIterator<E> i = this.listIterator(); in sort() 504 i.set((E) e); in sort() [all …]
|
D | PriorityQueue.java | 82 public class PriorityQueue<E> extends AbstractQueue<E> 108 private final Comparator<? super E> comparator; 147 public PriorityQueue(Comparator<? super E> comparator) { in PriorityQueue() 163 Comparator<? super E> comparator) { in PriorityQueue() 189 public PriorityQueue(Collection<? extends E> c) { in PriorityQueue() 191 SortedSet<? extends E> ss = (SortedSet<? extends E>) c; in PriorityQueue() 192 this.comparator = (Comparator<? super E>) ss.comparator(); in PriorityQueue() 196 PriorityQueue<? extends E> pq = (PriorityQueue<? extends E>) c; in PriorityQueue() 197 this.comparator = (Comparator<? super E>) pq.comparator(); in PriorityQueue() 221 public PriorityQueue(PriorityQueue<? extends E> c) { in PriorityQueue() [all …]
|
D | AbstractSequentialList.java | 69 public abstract class AbstractSequentialList<E> extends AbstractList<E> { 86 public E get(int index) { in get() 113 public E set(int index, E element) { in set() 115 ListIterator<E> e = listIterator(index); in set() 116 E oldVal = e.next(); in set() 144 public void add(int index, E element) { in add() 169 public E remove(int index) { in remove() 171 ListIterator<E> e = listIterator(index); in remove() 172 E outCast = e.next(); in remove() 212 public boolean addAll(int index, Collection<? extends E> c) { in addAll() [all …]
|
D | ArrayDeque.java | 87 public class ArrayDeque<E> extends AbstractCollection<E> 88 implements Deque<E>, Cloneable, Serializable 195 public ArrayDeque(Collection<? extends E> c) { in ArrayDeque() 210 public void addFirst(E e) { in addFirst() 226 public void addLast(E e) { in addLast() 241 public boolean offerFirst(E e) { in offerFirst() 253 public boolean offerLast(E e) { in offerLast() 261 public E removeFirst() { in removeFirst() 262 E x = pollFirst(); in removeFirst() 271 public E removeLast() { in removeLast() [all …]
|
D | AbstractQueue.java | 64 public abstract class AbstractQueue<E> 65 extends AbstractCollection<E> 66 implements Queue<E> { 94 public boolean add(E e) { in add() 112 public E remove() { in remove() 113 E x = poll(); in remove() 131 public E element() { in element() 132 E x = peek(); in element() 180 public boolean addAll(Collection<? extends E> c) { in addAll() 186 for (E e : c) in addAll()
|
D | Queue.java | 135 public interface Queue<E> extends Collection<E> { 153 boolean add(E e); in add() 172 boolean offer(E e); in offer() 182 E remove(); in remove() 190 E poll(); in poll() 200 E element(); in element() 208 E peek(); in peek()
|
D | ArrayList.java | 119 public class ArrayList<E> extends AbstractList<E> 120 implements List<E>, RandomAccess, Cloneable, java.io.Serializable 190 public ArrayList(Collection<? extends E> c) { in ArrayList() 435 public E get(int index) { in get() 439 return (E) elementData[index]; in get() 451 public E set(int index, E element) { in set() 455 E oldValue = (E) elementData[index]; in set() 466 public boolean add(E e) { in add() 481 public void add(int index, E element) { in add() 501 public E remove(int index) { in remove() [all …]
|
D | Collections.java | 1061 static class UnmodifiableCollection<E> implements Collection<E>, Serializable { 1064 final Collection<? extends E> c; 1066 UnmodifiableCollection(Collection<? extends E> c) { in UnmodifiableCollection() 1079 public Iterator<E> iterator() { in iterator() 1080 return new Iterator<E>() { in iterator() 1081 private final Iterator<? extends E> i = c.iterator(); in iterator() 1084 public E next() {return i.next();} in iterator() 1089 public void forEachRemaining(Consumer<? super E> action) { in iterator() 1096 public boolean add(E e) { in add() 1106 public boolean addAll(Collection<? extends E> coll) { in addAll() [all …]
|
D | Vector.java | 83 public class Vector<E> 84 extends AbstractList<E> 85 implements List<E>, RandomAccess, Cloneable, java.io.Serializable 170 public Vector(Collection<? extends E> c) { in Vector() 338 public Enumeration<E> elements() { in elements() 339 return new Enumeration<E>() { in elements() 346 public E nextElement() { in elements() 472 public synchronized E elementAt(int index) { in elementAt() 487 public synchronized E firstElement() { in firstElement() 501 public synchronized E lastElement() { in lastElement() [all …]
|
D | HashSet.java | 89 public class HashSet<E> 90 extends AbstractSet<E> 91 implements Set<E>, Cloneable, java.io.Serializable 95 private transient HashMap<E,Object> map; 117 public HashSet(Collection<? extends E> c) { in HashSet() 171 public Iterator<E> iterator() { in iterator() 218 public boolean add(E e) { in add() 255 HashSet<E> newSet = (HashSet<E>) super.clone(); in clone() 256 newSet.map = (HashMap<E, Object>) map.clone(); in clone() 286 for (E e : map.keySet()) in writeObject() [all …]
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
D | ConcurrentSkipListSet.java | 96 public class ConcurrentSkipListSet<E> 97 extends AbstractSet<E> 98 implements NavigableSet<E>, Cloneable, java.io.Serializable { 107 private final ConcurrentNavigableMap<E,Object> m; 114 m = new ConcurrentSkipListMap<E,Object>(); in ConcurrentSkipListSet() 125 public ConcurrentSkipListSet(Comparator<? super E> comparator) { in ConcurrentSkipListSet() 126 m = new ConcurrentSkipListMap<E,Object>(comparator); in ConcurrentSkipListSet() 140 public ConcurrentSkipListSet(Collection<? extends E> c) { in ConcurrentSkipListSet() 141 m = new ConcurrentSkipListMap<E,Object>(); in ConcurrentSkipListSet() 153 public ConcurrentSkipListSet(SortedSet<E> s) { in ConcurrentSkipListSet() [all …]
|
D | BlockingDeque.java | 207 public interface BlockingDeque<E> extends BlockingQueue<E>, Deque<E> { 228 void addFirst(E e); in addFirst() 243 void addLast(E e); in addLast() 259 boolean offerFirst(E e); in offerFirst() 275 boolean offerLast(E e); in offerLast() 289 void putFirst(E e) throws InterruptedException; in putFirst() 303 void putLast(E e) throws InterruptedException; in putLast() 324 boolean offerFirst(E e, long timeout, TimeUnit unit) in offerFirst() 346 boolean offerLast(E e, long timeout, TimeUnit unit) in offerLast() 356 E takeFirst() throws InterruptedException; in takeFirst() [all …]
|
D | ConcurrentLinkedDeque.java | 93 public class ConcurrentLinkedDeque<E> 94 extends AbstractCollection<E> 95 implements Deque<E>, java.io.Serializable { 263 private transient volatile Node<E> head; 277 private transient volatile Node<E> tail; 282 Node<E> prevTerminator() { in prevTerminator() 283 return (Node<E>) PREV_TERMINATOR; in prevTerminator() 287 Node<E> nextTerminator() { in nextTerminator() 288 return (Node<E>) NEXT_TERMINATOR; in nextTerminator() 291 static final class Node<E> { [all …]
|
D | LinkedBlockingDeque.java | 77 public class LinkedBlockingDeque<E> 78 extends AbstractQueue<E> 79 implements BlockingDeque<E>, java.io.Serializable { 110 static final class Node<E> { 114 E item; 122 Node<E> prev; 130 Node<E> next; 132 Node(E x) { in Node() 142 transient Node<E> first; 149 transient Node<E> last; [all …]
|
D | ConcurrentLinkedQueue.java | 106 public class ConcurrentLinkedQueue<E> extends AbstractQueue<E> 107 implements Queue<E>, java.io.Serializable { 181 private static class Node<E> { 182 volatile E item; 183 volatile Node<E> next; 190 static <E> Node<E> newNode(E item) { in newNode() 191 Node<E> node = new Node<E>(); in newNode() 196 static <E> boolean casItem(Node<E> node, E cmp, E val) { in casItem() 200 static <E> void lazySetNext(Node<E> node, Node<E> val) { in lazySetNext() 204 static <E> boolean casNext(Node<E> node, Node<E> cmp, Node<E> val) { in casNext() [all …]
|
D | LinkedBlockingQueue.java | 80 public class LinkedBlockingQueue<E> extends AbstractQueue<E> 81 implements BlockingQueue<E>, java.io.Serializable { 122 static class Node<E> { 123 E item; 131 Node<E> next; 133 Node(E x) { item = x; } in Node() 146 transient Node<E> head; 152 private transient Node<E> last; 198 private void enqueue(Node<E> node) { in enqueue() 209 private E dequeue() { in dequeue() [all …]
|
D | BlockingQueue.java | 181 public interface BlockingQueue<E> extends Queue<E> { 200 boolean add(E e); in add() 219 boolean offer(E e); in offer() 233 void put(E e) throws InterruptedException; in put() 253 boolean offer(E e, long timeout, TimeUnit unit) in offer() 263 E take() throws InterruptedException; in take() 277 E poll(long timeout, TimeUnit unit) in poll() 351 int drainTo(Collection<? super E> c); in drainTo() 376 int drainTo(Collection<? super E> c, int maxElements); in drainTo()
|
/libcore/ojluni/src/main/java/java/util/concurrent/atomic/ |
D | AtomicReferenceArray.java | 52 public class AtomicReferenceArray<E> implements java.io.Serializable { 103 public AtomicReferenceArray(E[] array) { in AtomicReferenceArray() 123 public final E get(int i) { in get() 128 private E getRaw(long offset) { in getRaw() 129 return (E) U.getObjectVolatile(array, offset); in getRaw() 138 public final void set(int i, E newValue) { in set() 149 public final void lazySet(int i, E newValue) { in lazySet() 162 public final E getAndSet(int i, E newValue) { in getAndSet() 163 return (E)U.getAndSetObject(array, checkedByteOffset(i), newValue); in getAndSet() 176 public final boolean compareAndSet(int i, E expect, E update) { in compareAndSet() [all …]
|