• Home
• net.sourceforge.plantuml
• plantuml
• 1.2024.6
• 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

????4
h?	8?	8?	8?
8?
??

?

?

?

?

?
G?

??
?	8?
??	8?	




	8


8
@
?
?



	
8


8



8

8

8




8



8

8

8

8


)?





8


.
	.




 

!
8
"
8
#
$


%
&UUUU????

'
(
<
)

*
+	
,
-@
.

/
0
8
1
8
2

3
4

/
5
6
7
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;
RuntimeVisibleTypeAnnotations
5Lorg/checkerframework/checker/nullness/qual/Nullable;
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;>;
MethodParameters
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
8Lcom/google/errorprone/annotations/CanIgnoreReturnValue;
addAll
(Ljava/util/Collection;)Z
newElements
Ljava/util/Collection;
modified

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

StackMapTable
8
(Ljava/util/Collection<+TE;>;)Z
offer
insertIndex
poll
()Ljava/lang/Object;
()TE;
RuntimeVisibleAnnotations
Ljavax/annotation/CheckForNull;
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;
@(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
0Lcom/google/common/annotations/J2ktIncompatible;
()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/collect/ElementTypesAreNonnullByDefault;
-Lcom/google/common/annotations/GwtCompatible;
5com/google/common/collect/MinMaxPriorityQueue$Builder\T[TWXxy
9
:
;x
<bcbguvSvx?
=
>
2com/google/common/collect/MinMaxPriorityQueue$Heapx
?NO
@
;RO
AO
B
CST
java/lang/Object????
D?
E?
F
G
H????
I
J??
K???
L
M
H??
N???
O?????
 java/util/NoSuchElementException
P?
Q
R??
6com/google/common/collect/MinMaxPriorityQueue$MoveDescx
S
T?
U
V
W
X
Y
Z????
negative index
[
\
-com/google/common/collect/MinMaxPriorityQueue
]
^
;com/google/common/collect/MinMaxPriorityQueue$QueueIteratorx
_
`
a
b?
java/util/Collection[?
c
d?????
e
f?
g?
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
java/util/Objects
requireNonNull
compareElements
remove
checkPositionIndex
swapWithConceptuallyLastElement
(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
min18G	NO
PQRO
PQST
U
VWX
Y


Z[T\T]T
^9_T
^:`T
^a'	bcd'?
Y?
???
e
nPf	bgdL
?
Y?
?*?	?e
wh
ijk
ilm
iPn	opdF

?
Y*
??e
?h

qrk

qsm
qPt	uvd:
?
Y?
??
?e
?h
uTm
uPw	Svd:
?
Y?
???e
?h
STm
SPwxyd?M*?+?
N*?Y*-??*?Y*-???*?*??*?*??*+??*???e&	??	??&?1?<?D?L?h*Mz{M|}
M~T	D?k Mz?M|?
	D?m	|~P?
[?
dA

*??e
?h
z{k
z?
??d\*+?W?e


hz{??
kz???
m
?P?U
?
??d?(=+?
N-?
?-?
:*?W=????e


!
#
&
h*	??(z{(??
&??k 	??(z?(??
??	
??m
?P?U
?
??d?B+?W*Y?`?*Y?Z`?=*?*?+?*?*??*?+???e
"
#
$
&
*)
+h Bz{B??
'?TkBz?B??
?	?<
@
m
?P?U
?
??dZ
*? ?
?*?!?e

2h
z{k
z??DP??
?U
???dP
*?2?"?e

;h
z{
?T
k

z?m
?P?
??dZ
*? ?
?*?#?e

Ah
z{k
z??DP??
???
d?
6*?? 
??*??$???e
F 
H"
J$
Nh
6z{k
6z?? 

@

??dA

*?%?e

Yh
z{k
z?P??
?U
?
??dA

*?&?e

ch
z{k
z?P?U
?
??dA

*?'?e

lh
z{k
z?P??
?
??d]
*? ?
?**?(?!?e

vh
z{k
z??GP??
?U
?
??de
*? ??)Y?*?**?(?!?e
?
?
?h
z{k
z??
P?U
?
??d]
*? ?
?**?(?#?e

?h
z{k
z??GP??
???d
??*??+W*Y?`?*Y?d?*??*?*?
S
?**??#M**??,?,>?*?*?
S
?**??#:*?*?
S*?-:?!??.Y,?/??.Y,?0?/??eN
?	
?
?
?%
?/
?1
?:
?G
?L
?V
?X
?b
?l
?u
?z
?
??
??
?h>?z{??T
:a??GT?Tb9??u&??k*?z?:a??b9??u&???1?&
?1.
m
?P??
?U
V???d?>*?N-?16-,?26?-,?3???.Y,*?#?/?
?e
?
?

?
?
?&
?h>>z{>?T
>??8?O
1?T(?Tk >z?>??8?Q??&

@.m	??P??
???dp*?#M*?4W,?e
?
?
?h z{?T
??kz???m
?P???df
?5?
*??*??e

?hz{?T
k
z??Cm
?P???dt'`??<??6?79~:~???e
?
?
?h'?T?T
??
@
@
m
?U
V??d? <*??*??;???

????e

h?T
 z{k
 z??
?
?U
V
??dF

?+?e???hz{?X
k
z?U
?
q?dD

*????e
?h
z{k
z?P???dB

*???e
?h
z{k
z?U
V??d?+??>,?@?,?@?A
6?B>?C?e??
????%?h4?T+?T+ST
+ij?Tk
+i??	
@
?
m
?SiP?U
V??
d?+*?*???!*?D<?M*?,*???>*,??e????%?*?h ?T
?X+z{k
+z??
*??
d?%*??<@?`h?
l?E=*??C?e???h %z{?T
	?Tk
%z???
F

??d>
d?F`?e
?h
~T
ST
m	~Sx?
da*+??e
gh*z{?}
?T??k
z???
d/

*??e
gh
?{??
d/

*??e
gh
?{??
d/

*??e
gh
?{P????
?U
?I*H<8J8K.8L
8M