1 /*
2  * Copyright (c) 2003, 2013, Oracle and/or its affiliates. All rights reserved.
3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4  *
5  * This code is free software; you can redistribute it and/or modify it
6  * under the terms of the GNU General Public License version 2 only, as
7  * published by the Free Software Foundation.  Oracle designates this
8  * particular file as subject to the "Classpath" exception as provided
9  * by Oracle in the LICENSE file that accompanied this code.
10  *
11  * This code is distributed in the hope that it will be useful, but WITHOUT
12  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
14  * version 2 for more details (a copy is included in the LICENSE file that
15  * accompanied this code).
16  *
17  * You should have received a copy of the GNU General Public License version
18  * 2 along with this work; if not, write to the Free Software Foundation,
19  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20  *
21  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22  * or visit www.oracle.com if you need additional information or have any
23  * questions.
24  */
25 
26 package java.util;
27 
28 import dalvik.annotation.compat.UnsupportedAppUsage;
29 
30 @SuppressWarnings({"unchecked", "deprecation", "all"})
31 public class PriorityQueue<E> extends java.util.AbstractQueue<E> implements java.io.Serializable {
32 
PriorityQueue()33     public PriorityQueue() {
34         throw new RuntimeException("Stub!");
35     }
36 
PriorityQueue(int initialCapacity)37     public PriorityQueue(int initialCapacity) {
38         throw new RuntimeException("Stub!");
39     }
40 
PriorityQueue(java.util.Comparator<? super E> comparator)41     public PriorityQueue(java.util.Comparator<? super E> comparator) {
42         throw new RuntimeException("Stub!");
43     }
44 
PriorityQueue(int initialCapacity, java.util.Comparator<? super E> comparator)45     public PriorityQueue(int initialCapacity, java.util.Comparator<? super E> comparator) {
46         throw new RuntimeException("Stub!");
47     }
48 
PriorityQueue(java.util.Collection<? extends E> c)49     public PriorityQueue(java.util.Collection<? extends E> c) {
50         throw new RuntimeException("Stub!");
51     }
52 
PriorityQueue(java.util.PriorityQueue<? extends E> c)53     public PriorityQueue(java.util.PriorityQueue<? extends E> c) {
54         throw new RuntimeException("Stub!");
55     }
56 
PriorityQueue(java.util.SortedSet<? extends E> c)57     public PriorityQueue(java.util.SortedSet<? extends E> c) {
58         throw new RuntimeException("Stub!");
59     }
60 
initFromPriorityQueue(java.util.PriorityQueue<? extends E> c)61     private void initFromPriorityQueue(java.util.PriorityQueue<? extends E> c) {
62         throw new RuntimeException("Stub!");
63     }
64 
initElementsFromCollection(java.util.Collection<? extends E> c)65     private void initElementsFromCollection(java.util.Collection<? extends E> c) {
66         throw new RuntimeException("Stub!");
67     }
68 
initFromCollection(java.util.Collection<? extends E> c)69     private void initFromCollection(java.util.Collection<? extends E> c) {
70         throw new RuntimeException("Stub!");
71     }
72 
grow(int minCapacity)73     private void grow(int minCapacity) {
74         throw new RuntimeException("Stub!");
75     }
76 
hugeCapacity(int minCapacity)77     private static int hugeCapacity(int minCapacity) {
78         throw new RuntimeException("Stub!");
79     }
80 
add(E e)81     public boolean add(E e) {
82         throw new RuntimeException("Stub!");
83     }
84 
offer(E e)85     public boolean offer(E e) {
86         throw new RuntimeException("Stub!");
87     }
88 
peek()89     public E peek() {
90         throw new RuntimeException("Stub!");
91     }
92 
indexOf(java.lang.Object o)93     private int indexOf(java.lang.Object o) {
94         throw new RuntimeException("Stub!");
95     }
96 
remove(java.lang.Object o)97     public boolean remove(java.lang.Object o) {
98         throw new RuntimeException("Stub!");
99     }
100 
removeEq(java.lang.Object o)101     boolean removeEq(java.lang.Object o) {
102         throw new RuntimeException("Stub!");
103     }
104 
contains(java.lang.Object o)105     public boolean contains(java.lang.Object o) {
106         throw new RuntimeException("Stub!");
107     }
108 
toArray()109     public java.lang.Object[] toArray() {
110         throw new RuntimeException("Stub!");
111     }
112 
toArray(T[] a)113     public <T> T[] toArray(T[] a) {
114         throw new RuntimeException("Stub!");
115     }
116 
iterator()117     public java.util.Iterator<E> iterator() {
118         throw new RuntimeException("Stub!");
119     }
120 
size()121     public int size() {
122         throw new RuntimeException("Stub!");
123     }
124 
clear()125     public void clear() {
126         throw new RuntimeException("Stub!");
127     }
128 
poll()129     public E poll() {
130         throw new RuntimeException("Stub!");
131     }
132 
removeAt(int i)133     E removeAt(int i) {
134         throw new RuntimeException("Stub!");
135     }
136 
siftUp(int k, E x)137     private void siftUp(int k, E x) {
138         throw new RuntimeException("Stub!");
139     }
140 
siftUpComparable(int k, E x)141     private void siftUpComparable(int k, E x) {
142         throw new RuntimeException("Stub!");
143     }
144 
siftUpUsingComparator(int k, E x)145     private void siftUpUsingComparator(int k, E x) {
146         throw new RuntimeException("Stub!");
147     }
148 
siftDown(int k, E x)149     private void siftDown(int k, E x) {
150         throw new RuntimeException("Stub!");
151     }
152 
siftDownComparable(int k, E x)153     private void siftDownComparable(int k, E x) {
154         throw new RuntimeException("Stub!");
155     }
156 
siftDownUsingComparator(int k, E x)157     private void siftDownUsingComparator(int k, E x) {
158         throw new RuntimeException("Stub!");
159     }
160 
heapify()161     private void heapify() {
162         throw new RuntimeException("Stub!");
163     }
164 
comparator()165     public java.util.Comparator<? super E> comparator() {
166         throw new RuntimeException("Stub!");
167     }
168 
writeObject(java.io.ObjectOutputStream s)169     private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException {
170         throw new RuntimeException("Stub!");
171     }
172 
readObject(java.io.ObjectInputStream s)173     private void readObject(java.io.ObjectInputStream s)
174             throws java.lang.ClassNotFoundException, java.io.IOException {
175         throw new RuntimeException("Stub!");
176     }
177 
spliterator()178     public final java.util.Spliterator<E> spliterator() {
179         throw new RuntimeException("Stub!");
180     }
181 
182     private static final int DEFAULT_INITIAL_CAPACITY = 11; // 0xb
183 
184     private static final int MAX_ARRAY_SIZE = 2147483639; // 0x7ffffff7
185 
186     private final java.util.Comparator<? super E> comparator;
187 
188     {
189         comparator = null;
190     }
191 
192     @UnsupportedAppUsage
193     transient int modCount;
194 
195     @UnsupportedAppUsage
196     transient java.lang.Object[] queue;
197 
198     private static final long serialVersionUID = -7720805057305804111L; // 0x94da30b4fb3f82b1L
199 
200     @UnsupportedAppUsage
201     int size;
202 
203     @SuppressWarnings({"unchecked", "deprecation", "all"})
204     private final class Itr implements java.util.Iterator<E> {
205 
Itr()206         private Itr() {
207             throw new RuntimeException("Stub!");
208         }
209 
hasNext()210         public boolean hasNext() {
211             throw new RuntimeException("Stub!");
212         }
213 
next()214         public E next() {
215             throw new RuntimeException("Stub!");
216         }
217 
remove()218         public void remove() {
219             throw new RuntimeException("Stub!");
220         }
221 
222         private int cursor;
223 
224         private int expectedModCount;
225 
226         private java.util.ArrayDeque<E> forgetMeNot;
227 
228         private int lastRet = -1; // 0xffffffff
229 
230         private E lastRetElt;
231     }
232 
233     @SuppressWarnings({"unchecked", "deprecation", "all"})
234     static final class PriorityQueueSpliterator<E> implements java.util.Spliterator<E> {
235 
PriorityQueueSpliterator( java.util.PriorityQueue<E> pq, int origin, int fence, int expectedModCount)236         PriorityQueueSpliterator(
237                 java.util.PriorityQueue<E> pq, int origin, int fence, int expectedModCount) {
238             throw new RuntimeException("Stub!");
239         }
240 
getFence()241         private int getFence() {
242             throw new RuntimeException("Stub!");
243         }
244 
trySplit()245         public java.util.PriorityQueue.PriorityQueueSpliterator<E> trySplit() {
246             throw new RuntimeException("Stub!");
247         }
248 
forEachRemaining(java.util.function.Consumer<? super E> action)249         public void forEachRemaining(java.util.function.Consumer<? super E> action) {
250             throw new RuntimeException("Stub!");
251         }
252 
tryAdvance(java.util.function.Consumer<? super E> action)253         public boolean tryAdvance(java.util.function.Consumer<? super E> action) {
254             throw new RuntimeException("Stub!");
255         }
256 
estimateSize()257         public long estimateSize() {
258             throw new RuntimeException("Stub!");
259         }
260 
characteristics()261         public int characteristics() {
262             throw new RuntimeException("Stub!");
263         }
264 
265         private int expectedModCount;
266 
267         private int fence;
268 
269         private int index;
270 
271         private final java.util.PriorityQueue<E> pq;
272 
273         {
274             pq = null;
275         }
276     }
277 }
278