All Downloads are FREE. Search and download functionalities are using the official Maven repository.

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

The newest version!
????2c	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
+1234InnerClasses
QueueIteratorHeapMoveDescBuilderminHeap4Lcom/google/common/collect/MinMaxPriorityQueue$Heap;	Signature9Lcom/google/common/collect/MinMaxPriorityQueue.Heap;maxHeapmaximumSizeIRuntimeInvisibleAnnotations1Lcom/google/common/annotations/VisibleForTesting;queue[Ljava/lang/Object;sizemodCountEVEN_POWERS_OF_TWO
ConstantValueODD_POWERS_OF_TWODEFAULT_CAPACITYcreate1()Lcom/google/common/collect/MinMaxPriorityQueue;CodeLineNumberTableV;>()Lcom/google/common/collect/MinMaxPriorityQueue;E(Ljava/lang/Iterable;)Lcom/google/common/collect/MinMaxPriorityQueue;LocalVariableTableinitialContentsLjava/lang/Iterable;LocalVariableTypeTableLjava/lang/Iterable<+TE;>;p;>(Ljava/lang/Iterable<+TE;>;)Lcom/google/common/collect/MinMaxPriorityQueue;	orderedByO(Ljava/util/Comparator;)Lcom/google/common/collect/MinMaxPriorityQueue$Builder;
comparatorLjava/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)Vthis/Lcom/google/common/collect/MinMaxPriorityQueue;builder7Lcom/google/common/collect/MinMaxPriorityQueue$Builder;	queueSizeordering$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()Iadd(Ljava/lang/Object;)ZelementLjava/lang/Object;TE;(TE;)ZaddAll(Ljava/util/Collection;)Zi$Ljava/util/Iterator;newElementsLjava/util/Collection;modifiedZLjava/util/Collection<+TE;>;
StackMapTable5(Ljava/util/Collection<+TE;>;)ZofferinsertIndexpoll()Ljava/lang/Object;()TE;elementData(I)Ljava/lang/Object;index(I)TE;peekgetMaxElementIndex	pollFirstremoveFirst	peekFirstpollLast
removeLastpeekLastremoveAt;(I)Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;actualLastElement
lastElementAt	toTricklechanges8Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;=Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;2@(I)Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;fillHoleM(ILjava/lang/Object;)Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;heapvacated	bubbledTo?C(ITE;)Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;removeAndGetvalueheapForIndex7(I)Lcom/google/common/collect/MinMaxPriorityQueue$Heap;i<(I)Lcom/google/common/collect/MinMaxPriorityQueue.Heap;isEvenLevel(I)ZoneBasedisIntact()Ziterator()Ljava/util/Iterator;()Ljava/util/Iterator;clear()VtoArray()[Ljava/lang/Object;copyTo()Ljava/util/Comparator;()Ljava/util/Comparator<-TE;>;capacityinitialQueueSize(IILjava/lang/Iterable;)IinitialSizeconfiguredExpectedSizeresultLjava/lang/Iterable<*>;(IILjava/lang/Iterable<*>;)IgrowIfNeedednewCapacitynewQueuecalculateNewCapacityoldCapacitycapAtMaximumSize(II)Il(Lcom/google/common/collect/MinMaxPriorityQueue$Builder;ILcom/google/common/collect/MinMaxPriorityQueue$1;)Vx0x1x21Lcom/google/common/collect/MinMaxPriorityQueue$1;
access$500D(Lcom/google/common/collect/MinMaxPriorityQueue;)[Ljava/lang/Object;
access$6002(Lcom/google/common/collect/MinMaxPriorityQueue;)I
access$7004Ljava/util/AbstractQueue;
SourceFileMinMaxPriorityQueue.java$Lcom/google/common/annotations/Beta;ZTYTWXuv5com/google/common/collect/MinMaxPriorityQueue$Builder678u9`a`ersSsu?:;2com/google/common/collect/MinMaxPriorityQueue$Heapu<NO=8RO>O?@STjava/lang/Object????5A?B?CDE????FG??H?????I???J????? java/util/NoSuchElementExceptionK?LM??6com/google/common/collect/MinMaxPriorityQueue$MoveDescuNO?PQRSTU????negative indexVWXY;com/google/common/collect/MinMaxPriorityQueue$QueueIteratoruZ[\]|}java/util/CollectionY?^_?????`a?b?-com/google/common/collect/MinMaxPriorityQueuejava/util/AbstractQueue/com/google/common/collect/MinMaxPriorityQueue$1java/util/Iterator"com/google/common/collect/Orderingnatural&()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;)Vreverse	otherHeap
access$300:(Lcom/google/common/collect/MinMaxPriorityQueue$Builder;)IhasNextnext$com/google/common/base/PreconditionscheckNotNull&(Ljava/lang/Object;)Ljava/lang/Object;bubbleUp(ILjava/lang/Object;)VisEmptycompareElementsremovecheckPositionIndexgetCorrectLastElement(Ljava/lang/Object;)I'(Ljava/lang/Object;Ljava/lang/Object;)Vreplaced
fillHoleAt(I)IbubbleUpAlternatingLevels(ILjava/lang/Object;)ItryCrossOverAndBubbleUpN(IILjava/lang/Object;)Lcom/google/common/collect/MinMaxPriorityQueue$MoveDesc;
checkState(ZLjava/lang/Object;)V
access$4008(Lcom/google/common/collect/MinMaxPriorityQueue$Heap;I)Zc(Lcom/google/common/collect/MinMaxPriorityQueue;Lcom/google/common/collect/MinMaxPriorityQueue$1;)Vjava/lang/System	arraycopy*(Ljava/lang/Object;ILjava/lang/Object;II)Vjava/lang/Mathmaxcom/google/common/math/IntMathcheckedMultiplymin1EF	NOPQROPQSTUVWXYTZT[T\7]T\8^T\_'	`ab'?Y????cpPd	`ebL?Y??*?	?cyfghigjPk	lmbF
?Y*??c?f
noi
npPq	rsb:?Y???
?c?frTPt	Ssb:?Y????c?fSTPtuvb?M*?+?
N*?Y*-??*?Y*-???*?*??*?*??*+??*???c&	??	??&?1?<?D?L?f*MwxMyzM{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?c3fwx?Tiw~P???bZ*? ??*?"?c8fwxiw~?D?P???b?6*?? ??*??#???c? A"C$Gf6wxi6w~? @??bA*?$?cPfwxiw~P???bA*?%?cYfwxiw~P???bA*?&?cafwxiw~P???b]*? ??**?'?!?cifwxiw~?G?P???be*? ??(Y?)?**?'?!?crsufwxiw~?P???b]*? ??**?'?"?c}fwxiw~?G?P???bq?*??*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?UV??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?Tiw~?C?P???bp#`<??5?67~8~???c???f#?T?T??@@UV??b? <*??*??9???????c?
????f?T wxi w~?
??UV??bF
?:Y*?;?crf
wxi
w~P???b?<*??*?S????*??cw
xwz{f?Twxiw~?	????bf*??L*?+*??<+?c??fwx?Xiw~n?bD*??=?c?fwxiw~P???bB*???c?fwxiw~UV??b?+??>,?>?,?>??6?@>?A?c????%?f4?T+?T+ST+gh?Ti+g??	
@?P?UV??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
STu?ba*+??cif*wx?z?T??iw~??b/*??cif?x??b/*??cif?x??b/*??cif?xP???U?I*GE:EJEK-ELEM




© 2015 - 2024 Weber Informatics LLC | Privacy Policy