Edit C:\Program Files\Java\jre8\lib\java\util\LinkedHashMap.class
Êþº¾ 4 æ ()V (I)V (IF)V (IFZ)V (Ljava/io/ObjectOutputStream;)V &(Ljava/lang/Object;)Ljava/lang/Object; (Ljava/lang/Object;)Z '(Ljava/lang/Object;Ljava/lang/Object;)V (Z)V <init> Code ConstantValue Entry Exceptions I InnerClasses J LineNumberTable Ljava/lang/Object; Node Signature SourceFile StackMapTable Z accept accessOrder after afterNodeAccess afterNodeInsertion afterNodeRemoval apply before clear containsValue entrySet equals forEach get getNode getOrDefault hash head internalWriteEntries java/io/IOException java/io/ObjectOutputStream java/lang/NullPointerException java/lang/Object java/util/Collection )java/util/ConcurrentModificationException java/util/HashMap java/util/HashMap$Node java/util/HashMap$TreeNode java/util/LinkedHashMap java/util/LinkedHashMap$Entry +java/util/LinkedHashMap$LinkedEntryIterator &java/util/LinkedHashMap$LinkedEntrySet *java/util/LinkedHashMap$LinkedHashIterator )java/util/LinkedHashMap$LinkedKeyIterator $java/util/LinkedHashMap$LinkedKeySet +java/util/LinkedHashMap$LinkedValueIterator $java/util/LinkedHashMap$LinkedValues java/util/Map java/util/Map$Entry java/util/Set java/util/function/BiConsumer java/util/function/BiFunction key keySet linkNodeLast modCount newNode newTreeNode putMapEntries reinitialize removeEldestEntry removeNode replaceAll replacementNode replacementTreeNode serialVersionUID tail transferLinks value values writeObject4ÀN\lÀû , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B Ljava/util/Collection; Ljava/util/LinkedHashMap$Entry; 'Ljava/util/LinkedHashMap$Entry<TK;TV;>; Ljava/util/Set; \<K:Ljava/lang/Object;V:Ljava/lang/Object;>Ljava/util/HashMap<TK;TV;>;Ljava/util/Map<TK;TV;>; (Ljava/lang/Object;)I (Ljava/lang/Object;)TV; (Ljava/lang/Object;)V (Ljava/lang/Object;TV;)TV; ()Ljava/util/Collection; ()Ljava/util/Collection<TV;>; (Ljava/util/HashMap$Node;)V #(Ljava/util/HashMap$Node<TK;TV;>;)V (Ljava/util/LinkedHashMap;)V "(Ljava/util/LinkedHashMap$Entry;)V *(Ljava/util/LinkedHashMap$Entry<TK;TV;>;)V (Ljava/util/Map;)V (Ljava/util/Map;Z)V (Ljava/util/Map<+TK;+TV;>;)V (Ljava/util/Map$Entry;)Z (Ljava/util/Map$Entry<TK;TV;>;)Z ()Ljava/util/Set; ()Ljava/util/Set<TK;>; "(Ljava/util/function/BiConsumer;)V ,(Ljava/util/function/BiConsumer<-TK;-TV;>;)V "(Ljava/util/function/BiFunction;)V 0(Ljava/util/function/BiFunction<-TK;-TV;+TV;>;)V -(ILjava/lang/Object;)Ljava/util/HashMap$Node; I(ITK;TV;Ljava/util/HashMap$Node<TK;TV;>;)Ljava/util/HashMap$Node<TK;TV;>; M(ITK;TV;Ljava/util/HashMap$Node<TK;TV;>;)Ljava/util/HashMap$TreeNode<TK;TV;>; A(Ljava/util/LinkedHashMap$Entry;Ljava/util/LinkedHashMap$Entry;)V Q(Ljava/util/LinkedHashMap$Entry<TK;TV;>;Ljava/util/LinkedHashMap$Entry<TK;TV;>;)V 0()Ljava/util/Set<Ljava/util/Map$Entry<TK;TV;>;>; 8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; @(ILjava/lang/Object;Ljava/lang/Object;Ljava/util/HashMap$Node;)V A(ILjava/lang/Object;Ljava/lang/Object;ZZ)Ljava/util/HashMap$Node; J(Ljava/util/HashMap$Node;Ljava/util/HashMap$Node;)Ljava/util/HashMap$Node; b(Ljava/util/HashMap$Node<TK;TV;>;Ljava/util/HashMap$Node<TK;TV;>;)Ljava/util/HashMap$Node<TK;TV;>; N(Ljava/util/HashMap$Node;Ljava/util/HashMap$Node;)Ljava/util/HashMap$TreeNode; f(Ljava/util/HashMap$Node<TK;TV;>;Ljava/util/HashMap$Node<TK;TV;>;)Ljava/util/HashMap$TreeNode<TK;TV;>; W(ILjava/lang/Object;Ljava/lang/Object;Ljava/util/HashMap$Node;)Ljava/util/HashMap$Node; [(ILjava/lang/Object;Ljava/lang/Object;Ljava/util/HashMap$Node;)Ljava/util/HashMap$TreeNode; ) F C S T o p p * p Q p # r D r ! J ) t U v $ z | E } I ? K ? ' ? R ? ? ? L ? _ ? a ? a ? a ? a ¡ a ¢ a £ a ¤ b ? b ? b ? b ? b Y « Z ¥ [ ¬ ] ¥ ^ ¥ ^ ¦ ^ § ^ ¨ ^ © ` ¶ a ª a a ¯ a ° a ± a ³ a ´ a · b ¶ d ® g ® i ® m ² n µ LinkedEntryIterator LinkedEntrySet LinkedHashIterator LinkedHashMap.java LinkedKeyIterator LinkedKeySet LinkedValueIterator LinkedValues TreeNode ! a ^ j P V ? * p q ? Q p q E } ` !*´ ½M*+µ ½,Ç *+µ ¼§ +,µ Ä,+µ ñ ü b ß à á â ä å ç ~ R ? ? :,+´ ÄZµ ÄN,+´ ÃZµ Ã:-Ç *,µ ¼§ -,µ ÃÇ *,µ ½§ ,µ ı ý ! b b &