com.google.common.collect.MinMaxPriorityQueue.class Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of jelly Show documentation
Show all versions of jelly Show documentation
Java Functional Metaprogramming API
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
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;>;
StackMapTable5 (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; Z T Y T W X u v 5com/google/common/collect/MinMaxPriorityQueue$Builder678 u9 ` a ` e r s S s u ?:; 2com/google/common/collect/MinMaxPriorityQueue$Heap u< N O=8 R O> O?@ S T java/lang/Object ? ? ? ?5A ?B ?CDE ? ? ? ?FG ? ?H ? ? ? ? ?I ? ? ?J ? ? ? ? ? java/util/NoSuchElementExceptionK ?LM ? ? 6com/google/common/collect/MinMaxPriorityQueue$MoveDesc uNO ?PQRSTU ? ? ? ? negative indexVWXY ;com/google/common/collect/MinMaxPriorityQueue$QueueIterator uZ[\] | } 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 min 1 E F N O P Q R O P Q S T U V W X Y T Z T [ T \ 7 ] T \ 8 ^ T \ _ ' ` a b ' ? Y? ? ? ? c p P d ` e b L ? Y? ? *? ? c y f g h i g j P k l m b F
? Y*? ? c ? f
n o i
n p P q r s b : ? Y? ? ?
? c ? f r T P t S s b : ? Y? ? ? ? c ? f S T P t u v b ? M*? +?
N*? Y*-? ? *? Y*-? ? ? *? *? ? *? *? ? *+? ? *? ? ? c &