• Home
• io.relayr
• java-sdk
• 1.2.1
• source code
• MinMaxPriorityQueue.class

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

com.google.common.collect.MinMaxPriorityQueue.class Maven / Gradle / Ivy

????2
c	E?	E?	E?
E??
??
?
?
?
?
?
F?
??
?	E?
??	E?	?
?	E



E
>








E
	
E




E

E

E

E



E

E

E

E


(?





E


-
	-







E

E
 
!


"UUUU????

#
$
:
%

&
'	
(
)>
*

+
,
E
-
E
.

/
0

+
1
2
3
4

InnerClasses

QueueIterator
Heap
MoveDesc
Builder
minHeap
4Lcom/google/common/collect/MinMaxPriorityQueue$Heap;
	Signature
9Lcom/google/common/collect/MinMaxPriorityQueue.Heap;
maxHeap
maximumSize

I
RuntimeInvisibleAnnotations
1Lcom/google/common/annotations/VisibleForTesting;
queue
[Ljava/lang/Object;
size
modCount
EVEN_POWERS_OF_TWO

ConstantValue
ODD_POWERS_OF_TWO
DEFAULT_CAPACITY
create
1()Lcom/google/common/collect/MinMaxPriorityQueue;
Code
LineNumberTable
V;>()Lcom/google/common/collect/MinMaxPriorityQueue;
E(Ljava/lang/Iterable;)Lcom/google/common/collect/MinMaxPriorityQueue;
LocalVariableTable
initialContents
Ljava/lang/Iterable;
LocalVariableTypeTable
Ljava/lang/Iterable<+TE;>;
p;>(Ljava/lang/Iterable<+TE;>;)Lcom/google/common/collect/MinMaxPriorityQueue;
	orderedBy
O(Ljava/util/Comparator;)Lcom/google/common/collect/MinMaxPriorityQueue$Builder;

comparator
Ljava/util/Comparator;
Ljava/util/Comparator;
o(Ljava/util/Comparator;)Lcom/google/common/collect/MinMaxPriorityQueue$Builder;
expectedSize
:(I)Lcom/google/common/collect/MinMaxPriorityQueue$Builder;
R(I)Lcom/google/common/collect/MinMaxPriorityQueue$Builder;

;(Lcom/google/common/collect/MinMaxPriorityQueue$Builder;I)V
this
/Lcom/google/common/collect/MinMaxPriorityQueue;
builder
7Lcom/google/common/collect/MinMaxPriorityQueue$Builder;
	queueSize
ordering
$Lcom/google/common/collect/Ordering;
4Lcom/google/common/collect/MinMaxPriorityQueue;
=Lcom/google/common/collect/MinMaxPriorityQueue$Builder<-TE;>;
)Lcom/google/common/collect/Ordering;
A(Lcom/google/common/collect/MinMaxPriorityQueue$Builder<-TE;>;I)V
()I
add
(Ljava/lang/Object;)Z
element
Ljava/lang/Object;
TE;
(TE;)Z
addAll
(Ljava/util/Collection;)Z
i$
Ljava/util/Iterator;
newElements
Ljava/util/Collection;
modified

Z
Ljava/util/Collection<+TE;>;

StackMapTable
5
(Ljava/util/Collection<+TE;>;)Z
offer
insertIndex
poll
()Ljava/lang/Object;


()TE;
elementData
(I)Ljava/lang/Object;
index
(I)TE;
peek
getMaxElementIndex
	pollFirst
removeFirst
	peekFirst
pollLast

removeLast
peekLast
removeAt
;(I)Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;
actualLastElement

lastElementAt
	toTrickle
changes
8Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;
=Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;
2

@(I)Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;
fillHole
M(ILjava/lang/Object;)Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;
heap
vacated
	bubbledTo?
C(ITE;)Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;
removeAndGet
value
heapForIndex
7(I)Lcom/google/common/collect/MinMaxPriorityQueue$Heap;

i
<(I)Lcom/google/common/collect/MinMaxPriorityQueue.Heap;
isEvenLevel
(I)Z
oneBased
isIntact
()Z
iterator
()Ljava/util/Iterator;
()Ljava/util/Iterator;
clear
()V
toArray
()[Ljava/lang/Object;
copyTo
()Ljava/util/Comparator;
()Ljava/util/Comparator<-TE;>;
capacity
initialQueueSize
(IILjava/lang/Iterable;)I
initialSize
configuredExpectedSize
result
Ljava/lang/Iterable<*>;
(IILjava/lang/Iterable<*>;)I
growIfNeeded
newCapacity
newQueue
calculateNewCapacity
oldCapacity
capAtMaximumSize
(II)I
l(Lcom/google/common/collect/MinMaxPriorityQueue$Builder;ILcom/google/common/collect/MinMaxPriorityQueue$1;)V
x0
x1
x2
1Lcom/google/common/collect/MinMaxPriorityQueue$1;

access$500
D(Lcom/google/common/collect/MinMaxPriorityQueue;)[Ljava/lang/Object;

access$600
2(Lcom/google/common/collect/MinMaxPriorityQueue;)I

access$700
4Ljava/util/AbstractQueue;

SourceFile
MinMaxPriorityQueue.java
$Lcom/google/common/annotations/Beta;ZTYTWXuv
5com/google/common/collect/MinMaxPriorityQueue$Builder
6
7
8u
9`a`ersSsu?
:
;
2com/google/common/collect/MinMaxPriorityQueue$Heapu
<NO
=
8RO
>O
?
@ST
java/lang/Object????
5
A?
B?
C
D
E????
F
G??
H?????
I???
J?????
 java/util/NoSuchElementException
K?
L
M??
6com/google/common/collect/MinMaxPriorityQueue$MoveDescu
N
O?
P
Q
R
S
T
U????
negative index
V
W
X
Y
;com/google/common/collect/MinMaxPriorityQueue$QueueIteratoru
Z
[
\
]|}
java/util/CollectionY?
^
_?????
`
a?
b?
-com/google/common/collect/MinMaxPriorityQueue
java/util/AbstractQueue
/com/google/common/collect/MinMaxPriorityQueue$1
java/util/Iterator
"com/google/common/collect/Ordering
natural
&()Lcom/google/common/collect/Ordering;
J(Ljava/util/Comparator;Lcom/google/common/collect/MinMaxPriorityQueue$1;)V

access$200
](Lcom/google/common/collect/MinMaxPriorityQueue$Builder;)Lcom/google/common/collect/Ordering;
V(Lcom/google/common/collect/MinMaxPriorityQueue;Lcom/google/common/collect/Ordering;)V
reverse
	otherHeap

access$300
:(Lcom/google/common/collect/MinMaxPriorityQueue$Builder;)I
hasNext
next
$com/google/common/base/Preconditions
checkNotNull
&(Ljava/lang/Object;)Ljava/lang/Object;
bubbleUp
(ILjava/lang/Object;)V
isEmpty
compareElements
remove
checkPositionIndex
getCorrectLastElement
(Ljava/lang/Object;)I
'(Ljava/lang/Object;Ljava/lang/Object;)V
replaced

fillHoleAt
(I)I
bubbleUpAlternatingLevels
(ILjava/lang/Object;)I
tryCrossOverAndBubbleUp
N(IILjava/lang/Object;)Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;

checkState
(ZLjava/lang/Object;)V

access$400
8(Lcom/google/common/collect/MinMaxPriorityQueue$Heap;I)Z
c(Lcom/google/common/collect/MinMaxPriorityQueue;Lcom/google/common/collect/MinMaxPriorityQueue$1;)V
java/lang/System
	arraycopy
*(Ljava/lang/Object;ILjava/lang/Object;II)V
java/lang/Math
max
com/google/common/math/IntMath
checkedMultiply
min1EF	NO
PQRO
PQST
U
VWXYTZT[T
\7]T
\8^T
\_'	`ab'?Y?
???
c
bPd	`ebL
?Y?
?*?	?c
kf
ghi
gjPk	lmbF

?Y*
??c
tf

noi

npPq	rsb:
?Y?
??
?c
}f
rTPt	Ssb:
?Y?
???c
?f
STPtuvb?M*?+?
N*?Y*-??*?Y*-???*?*??*?*??*+??*???c&	??	??&?1?<?D?L?f*MwxMyz
M{T	D|}i Mw~My
	D|?P?
Y?
bA

*??c
?f
wxi
w~
??b\*+?W?c
??fwx??
iw~??
P?
??b?(=+?
N-?
?-?
:*?W=????c



!
#
&
f4	??	??(wx(??
&??i 	??(w~(??
??	
??P?
??b?B+?W*Y?
`?
*Y?Z`?=*?*?+?*?*??*?+???c




)
f BwxB??
'?TiBw~B??
?	?<
@
P?
??bZ
*? ?
?*?!?c

f
wxi
w~?D?P???bM*?2?c

"fwx?T
i
w~P?
??bZ
*? ?
?*?"?c

&f
wxi
w~?D?P???
b?
6*?? 
??*??#???c
- 
/"
1$
5f
6wxi
6w~? 

@

??bA

*?$?c

>f
wxi
w~P?
??bA

*?%?c

Gf
wxi
w~P?
??bA

*?&?c

Of
wxi
w~P?
??b]
*? ?
?**?'?!?c

Wf
wxi
w~?G?P?
??be
*? ??(Y?)?**?'?!?c
`
a
cf
wxi
w~?
P?
??b]
*? ?
?**?'?"?c

kf
wxi
w~?G?P???b
q?*??*W*Y?
`?
*Y?d?*??*?*?
S
?**??"M**??,?+>**??":*?*?
S*?,:?!??-Y,?.??-Y,?/?.??cB
~	

?
?%
?/
?1
?:
?G
?Q
?[
?d
?i
?n
?y
??
?f>?wx??T
:P??GC?TQ9??d&??i*?w~:P??Q9??d&???1?G?
?
??
P?U
V??b?>*?N-?06-,?16?-,?2???-Y,*?"?.?
?c
?
?

?
?
?&
?f>>wx>?T
>??8?O
1?T(?Ti >w~>??8?Q??&?

@?P???bp*?"M*?3W,?c
?
?
?f wx?T
??iw~??P???bf
?4?
*??*??c

?fwx?T
i
w~?C?P???bp#`<??5?67~8~???c
?
?
?f#?T?T
??
@
@
U
V??b? <*??*??9???

????c
?

?
?
?
?f?T
 wxi
 w~?
?
?U
V
??bF

?:Y*
?;?c
cf

wxi

w~P?
??
b?<*??*?
S?

???*??cg
hgjkf?T
wxi
w~?	?
?
??
bf*??L*?+*??<+?cnopfwx?X
i
w~
n?bD

*??=?c
yf
wxi
w~P???bB

*???c
}f
wxi
w~U
V??b?+??>,?>?,?>??
6?@>?A?c????%?f4?T+?T+ST
+gh?Ti
+g??	
@
?
P?U
V??
b?+*?*???!*?B<?M*?,*???<*,??c????%?*?f ?T
?X+wxi
+w~?
*??
b?%*??<@?`h?
l?C=*??A?c???f %wx?T
	?Ti
%w~??
F

??
b>
d?D`?c
?f
{T
ST
u?
ba*+??c
[f*wx?z
?T??i
w~??
b/

*??c
[f
?x??
b/

*??c
[f
?x??
b/

*?
?c
[f
?xP???U
?I*GE:EJEK-ELEM