
com.google.gson.internal.LinkedHashTreeMap.class Maven / Gradle / Ivy
???? 1p M ?
M ?
Q ? M ? M ? M ? ?
? M ? M ? M ?
M
M
M
M
?
M
M ? ?!
M"
# $ %
&
'
M(
)*
M+ M,-
6 ? .
M/
M0 M12
<3 M45
?3
M67
B ?8
D ?
B9
B:
D;
D<
D=>
K?@
AB
O ?CD KeySet InnerClasses EntrySetE LinkedTreeMapIterator
AvlBuilder AvlIterator Node
NATURAL_ORDER Ljava/util/Comparator; Signature .Ljava/util/Comparator;
comparator Ljava/util/Comparator<-TK;>; table 2[Lcom/google/gson/internal/LinkedHashTreeMap$Node; :[Lcom/google/gson/internal/LinkedHashTreeMap$Node; header 1Lcom/google/gson/internal/LinkedHashTreeMap$Node; 9Lcom/google/gson/internal/LinkedHashTreeMap$Node; size I modCount threshold entrySet 5Lcom/google/gson/internal/LinkedHashTreeMap$EntrySet; =Lcom/google/gson/internal/LinkedHashTreeMap.EntrySet; keySet 3Lcom/google/gson/internal/LinkedHashTreeMap$KeySet; ;Lcom/google/gson/internal/LinkedHashTreeMap.KeySet; $assertionsDisabled Z ()V Code LineNumberTable LocalVariableTable this ,Lcom/google/gson/internal/LinkedHashTreeMap; LocalVariableTypeTable 4Lcom/google/gson/internal/LinkedHashTreeMap; (Ljava/util/Comparator;)V (Ljava/util/Comparator<-TK;>;)V ()I get &(Ljava/lang/Object;)Ljava/lang/Object; key Ljava/lang/Object; node (Ljava/lang/Object;)TV; containsKey (Ljava/lang/Object;)Z put 8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; value created result TK; TV; (TK;TV;)TV; clear next e remove find F(Ljava/lang/Object;Z)Lcom/google/gson/internal/LinkedHashTreeMap$Node; child
comparableKey Ljava/lang/Comparable; create hash index nearest
comparison *Ljava/lang/Comparable; ?(TK;Z)Lcom/google/gson/internal/LinkedHashTreeMap$Node; findByObject E(Ljava/lang/Object;)Lcom/google/gson/internal/LinkedHashTreeMap$Node; Ljava/lang/ClassCastException; M(Ljava/lang/Object;)Lcom/google/gson/internal/LinkedHashTreeMap$Node; findByEntryG Entry H(Ljava/util/Map$Entry;)Lcom/google/gson/internal/LinkedHashTreeMap$Node; entry Ljava/util/Map$Entry; mine valuesEqual Ljava/util/Map$Entry<**>; T(Ljava/util/Map$Entry<**>;)Lcom/google/gson/internal/LinkedHashTreeMap$Node; equal '(Ljava/lang/Object;Ljava/lang/Object;)Z a b
secondaryHash (I)I h removeInternal 5(Lcom/google/gson/internal/LinkedHashTreeMap$Node;Z)V adjacent
leftHeight rightHeight unlink left right originalParent =(Lcom/google/gson/internal/LinkedHashTreeMap$Node;Z)V removeInternalByKey replaceInParent e(Lcom/google/gson/internal/LinkedHashTreeMap$Node;Lcom/google/gson/internal/LinkedHashTreeMap$Node;)V replacement parent u(Lcom/google/gson/internal/LinkedHashTreeMap$Node;Lcom/google/gson/internal/LinkedHashTreeMap$Node;)V rebalance rightLeft
rightRight rightRightHeight rightLeftHeight
rightDelta leftLeft leftRight leftRightHeight leftLeftHeight leftDelta delta
unbalanced insert
rotateLeft 4(Lcom/google/gson/internal/LinkedHashTreeMap$Node;)V root pivot pivotLeft
pivotRight <(Lcom/google/gson/internal/LinkedHashTreeMap$Node;)V rotateRight ()Ljava/util/Set; 0()Ljava/util/Set;>; ()Ljava/util/Set; doubleCapacity f([Lcom/google/gson/internal/LinkedHashTreeMap$Node;)[Lcom/google/gson/internal/LinkedHashTreeMap$Node; leftSize rightSize i oldTable oldCapacity newTable iterator 8Lcom/google/gson/internal/LinkedHashTreeMap$AvlIterator; leftBuilder 7Lcom/google/gson/internal/LinkedHashTreeMap$AvlBuilder; rightBuilder @Lcom/google/gson/internal/LinkedHashTreeMap$AvlIterator; ?Lcom/google/gson/internal/LinkedHashTreeMap$AvlBuilder; ?([Lcom/google/gson/internal/LinkedHashTreeMap$Node;)[Lcom/google/gson/internal/LinkedHashTreeMap$Node; writeReplace ()Ljava/lang/Object;
ExceptionsH _Ljava/util/AbstractMap;Ljava/io/Serializable;
SourceFile LinkedHashTreeMap.java \ ] t } t u h i j i ` ] /com/google/gson/internal/LinkedHashTreeMap$Node e f b c k i ? ? ? ? java/lang/NullPointerException key == null tI ? ?JKL ? fM f ? ?NO ? ? java/lang/Comparable ? ?PQRST ? f ? f java/lang/ClassCastException java/lang/StringBuilderUVWXYZ[ is not Comparable\Y t] ? ? ? u^ ?_ ? ? ?` ? ? fa ibcdc ? ?efg ? ? r s java/lang/AssertionError ? i ? ? ? ? l m 3com/google/gson/internal/LinkedHashTreeMap$EntrySet th o p 1com/google/gson/internal/LinkedHashTreeMap$KeySet ? ? 6com/google/gson/internal/LinkedHashTreeMap$AvlIterator 5com/google/gson/internal/LinkedHashTreeMap$AvlBuilderi ? ?cijk ? ?c java/util/LinkedHashMap tl *com/google/gson/internal/LinkedHashTreeMapmn ,com/google/gson/internal/LinkedHashTreeMap$1 java/util/AbstractMap java/io/Serializable @com/google/gson/internal/LinkedHashTreeMap$LinkedTreeMapIteratoro java/util/Map$Entry java/io/ObjectStreamException (Ljava/lang/String;)V java/util/Arrays fill (([Ljava/lang/Object;Ljava/lang/Object;)V prev java/lang/Object hashCode compareTo (Ljava/lang/Object;)I java/util/Comparator compare '(Ljava/lang/Object;Ljava/lang/Object;)I getClass ()Ljava/lang/Class; java/lang/Class getName ()Ljava/lang/String; append -(Ljava/lang/String;)Ljava/lang/StringBuilder; toString ?(Lcom/google/gson/internal/LinkedHashTreeMap$Node;Ljava/lang/Object;ILcom/google/gson/internal/LinkedHashTreeMap$Node;Lcom/google/gson/internal/LinkedHashTreeMap$Node;)V getKey getValue equals height last 3()Lcom/google/gson/internal/LinkedHashTreeMap$Node; first java/lang/Math max (II)I /(Lcom/google/gson/internal/LinkedHashTreeMap;)V reset (I)V add (Ljava/util/Map;)V desiredAssertionStatus ()Z
java/util/Map 1 M Q R
\ ] ^ _ ` ] ^ a b c ^ d e f ^ g h i j i k i l m ^ n o p ^ q r s t u v H *? ? ? w
= > x y z { y | t } v ? E*? *? *? *+? +? ? ? *? Y? ? *? ?
**?
?l*?
?l`? ? w " H 3 4 I L ( M 1 N D O x E y z E ` ] { E y | E ` a ^ ~ h v A *? ? w R x y z { y | ? ? v q *+? M,?
,?
? ? w
V W x y z ? ?
? f { y |
? g ^ ? ? ? v T *+? ? ? ? w [ x y z ? ? { y | ? ? v ? #+?
? Y? ?*+? N-?
:-,?
? w _ ` b c d e x 4 # y z # ? ? # ? ? ? f ? ? { 4 # y | # ? ? # ? ? ? g ? ? ^ ? ? u v ? E*?
? *? *Y? `? *? L+? M,+? ,? N,,Z? ? -M???+++Z? ? ? w . i j
k n o &