-Clazz.load(["java.util.HashMap"],"java.util.LinkedHashMap",["java.lang.IllegalStateException","java.util.AbstractCollection","$.AbstractSet","java.util.MapEntry.Type","java.util.NoSuchElementException"],function(){\r
-c$=Clazz.decorateAsClass(function(){\r
-this.accessOrder=false;\r
-this.head=null;\r
-this.tail=null;\r
-Clazz.instantialize(this,arguments);\r
-},java.util,"LinkedHashMap",java.util.HashMap);\r
-Clazz.makeConstructor(c$,\r
-function(){\r
-Clazz.superConstructor(this,java.util.LinkedHashMap);\r
-this.accessOrder=false;\r
-this.head=null;\r
-});\r
-Clazz.makeConstructor(c$,\r
-function(s){\r
-Clazz.superConstructor(this,java.util.LinkedHashMap,[s]);\r
-this.accessOrder=false;\r
-this.head=null;\r
-},"~N");\r
-Clazz.makeConstructor(c$,\r
-function(s,lf){\r
-Clazz.superConstructor(this,java.util.LinkedHashMap,[s,lf]);\r
-this.accessOrder=false;\r
-this.head=null;\r
-this.tail=null;\r
-},"~N,~N");\r
-Clazz.makeConstructor(c$,\r
-function(s,lf,order){\r
-Clazz.superConstructor(this,java.util.LinkedHashMap,[s,lf]);\r
-this.accessOrder=order;\r
-this.head=null;\r
-this.tail=null;\r
-},"~N,~N,~B");\r
-Clazz.makeConstructor(c$,\r
-function(m){\r
-Clazz.superConstructor(this,java.util.LinkedHashMap,[]);\r
-this.accessOrder=false;\r
-this.head=null;\r
-this.tail=null;\r
-this.putAll(m);\r
-},"java.util.Map");\r
-Clazz.overrideMethod(c$,"newElementArray",\r
-function(s){\r
-return new Array(s);\r
-},"~N");\r
-Clazz.overrideMethod(c$,"get",\r
-function(key){\r
-var m=this.getEntry(key);\r
-if(m==null){\r
-return null;\r
-}if(this.accessOrder&&this.tail!==m){\r
-var p=m.chainBackward;\r
-var n=m.chainForward;\r
-n.chainBackward=p;\r
-if(p!=null){\r
-p.chainForward=n;\r
-}else{\r
-this.head=n;\r
-}m.chainForward=null;\r
-m.chainBackward=this.tail;\r
-this.tail.chainForward=m;\r
-this.tail=m;\r
-}return m.value;\r
-},"~O");\r
-Clazz.overrideMethod(c$,"createEntry",\r
-function(key,index,value){\r
-var m=new java.util.LinkedHashMap.LinkedHashMapEntry(key,value);\r
-m.next=this.elementData[index];\r
-this.elementData[index]=m;\r
-this.linkEntry(m);\r
-return m;\r
-},"~O,~N,~O");\r
-Clazz.overrideMethod(c$,"put",\r
-function(key,value){\r
-var index=this.getModuloHash(key);\r
-var m=this.findEntry(key,index);\r
-if(m==null){\r
-this.modCount++;\r
-if(++this.elementCount>this.threshold){\r
-this.rehash();\r
-index=key==null?0:(key.hashCode()&0x7FFFFFFF)%this.elementData.length;\r
-}m=this.createEntry(key,index,null);\r
-}else{\r
-this.linkEntry(m);\r
-}var result=m.value;\r
-m.value=value;\r
-if(this.removeEldestEntry(this.head)){\r
-this.remove(this.head.key);\r
-}return result;\r
-},"~O,~O");\r
-Clazz.defineMethod(c$,"linkEntry",\r
-function(m){\r
-if(this.tail===m){\r
-return;\r
-}if(this.head==null){\r
-this.head=this.tail=m;\r
-return;\r
-}var p=m.chainBackward;\r
-var n=m.chainForward;\r
-if(p==null){\r
-if(n!=null){\r
-if(this.accessOrder){\r
-this.head=n;\r
-n.chainBackward=null;\r
-m.chainBackward=this.tail;\r
-m.chainForward=null;\r
-this.tail.chainForward=m;\r
-this.tail=m;\r
-}}else{\r
-m.chainBackward=this.tail;\r
-m.chainForward=null;\r
-this.tail.chainForward=m;\r
-this.tail=m;\r
-}return;\r
-}if(n==null){\r
-return;\r
-}if(this.accessOrder){\r
-p.chainForward=n;\r
-n.chainBackward=p;\r
-m.chainForward=null;\r
-m.chainBackward=this.tail;\r
-this.tail.chainForward=m;\r
-this.tail=m;\r
-}},"java.util.LinkedHashMap.LinkedHashMapEntry");\r
-Clazz.overrideMethod(c$,"entrySet",\r
-function(){\r
-return new java.util.LinkedHashMap.LinkedHashMapEntrySet(this);\r
-});\r
-Clazz.overrideMethod(c$,"keySet",\r
-function(){\r
-if(this.$keySet==null){\r
-this.$keySet=((Clazz.isClassDefined("java.util.LinkedHashMap$1")?0:java.util.LinkedHashMap.$LinkedHashMap$1$()),Clazz.innerTypeInstance(java.util.LinkedHashMap$1,this,null));\r
-}return this.$keySet;\r
-});\r
-Clazz.overrideMethod(c$,"values",\r
-function(){\r
-if(this.valuesCollection==null){\r
-this.valuesCollection=((Clazz.isClassDefined("java.util.LinkedHashMap$2")?0:java.util.LinkedHashMap.$LinkedHashMap$2$()),Clazz.innerTypeInstance(java.util.LinkedHashMap$2,this,null));\r
-}return this.valuesCollection;\r
-});\r
-Clazz.overrideMethod(c$,"remove",\r
-function(key){\r
-var m=this.removeEntry(key);\r
-if(m==null){\r
-return null;\r
-}var p=m.chainBackward;\r
-var n=m.chainForward;\r
-if(p!=null){\r
-p.chainForward=n;\r
-}else{\r
-this.head=n;\r
-}if(n!=null){\r
-n.chainBackward=p;\r
-}else{\r
-this.tail=p;\r
-}return m.value;\r
-},"~O");\r
-Clazz.defineMethod(c$,"removeEldestEntry",\r
-function(eldest){\r
-return false;\r
-},"java.util.Map.Entry");\r
-Clazz.defineMethod(c$,"clear",\r
-function(){\r
-Clazz.superCall(this,java.util.LinkedHashMap,"clear",[]);\r
-this.head=this.tail=null;\r
-});\r
-Clazz.defineMethod(c$,"clone",\r
-function(){\r
-var map=Clazz.superCall(this,java.util.LinkedHashMap,"clone",[]);\r
-map.clear();\r
-for(var entry,$entry=this.entrySet().iterator();$entry.hasNext()&&((entry=$entry.next())||true);){\r
-map.put(entry.getKey(),entry.getValue());\r
-}\r
-return map;\r
-});\r
-c$.$LinkedHashMap$1$=function(){\r
-Clazz.pu$h(self.c$);\r
-c$=Clazz.declareAnonymous(java.util,"LinkedHashMap$1",java.util.AbstractSet);\r
-Clazz.overrideMethod(c$,"contains",\r
-function(object){\r
-return this.b$["java.util.LinkedHashMap"].containsKey(object);\r
-},"~O");\r
-Clazz.overrideMethod(c$,"size",\r
-function(){\r
-return this.b$["java.util.LinkedHashMap"].size();\r
-});\r
-Clazz.overrideMethod(c$,"clear",\r
-function(){\r
-this.b$["java.util.LinkedHashMap"].clear();\r
-});\r
-Clazz.overrideMethod(c$,"remove",\r
-function(key){\r
-if(this.b$["java.util.LinkedHashMap"].containsKey(key)){\r
-this.b$["java.util.LinkedHashMap"].remove(key);\r
-return true;\r
-}return false;\r
-},"~O");\r
-Clazz.overrideMethod(c$,"iterator",\r
-function(){\r
-return new java.util.LinkedHashMap.LinkedHashIterator(((Clazz.isClassDefined("java.util.LinkedHashMap$1$1")?0:java.util.LinkedHashMap.$LinkedHashMap$1$1$()),Clazz.innerTypeInstance(java.util.LinkedHashMap$1$1,this,null)),this.b$["java.util.LinkedHashMap"]);\r
-});\r
-c$=Clazz.p0p();\r
-};\r
-c$.$LinkedHashMap$1$1$=function(){\r
-Clazz.pu$h(self.c$);\r
-c$=Clazz.declareAnonymous(java.util,"LinkedHashMap$1$1",null,java.util.MapEntry.Type);\r
-Clazz.overrideMethod(c$,"get",\r
-function(entry){\r
-return entry.key;\r
-},"java.util.MapEntry");\r
-c$=Clazz.p0p();\r
-};\r
-c$.$LinkedHashMap$2$=function(){\r
-Clazz.pu$h(self.c$);\r
-c$=Clazz.declareAnonymous(java.util,"LinkedHashMap$2",java.util.AbstractCollection);\r
-Clazz.overrideMethod(c$,"contains",\r
-function(object){\r
-return this.b$["java.util.LinkedHashMap"].containsValue(object);\r
-},"~O");\r
-Clazz.overrideMethod(c$,"size",\r
-function(){\r
-return this.b$["java.util.LinkedHashMap"].size();\r
-});\r
-Clazz.overrideMethod(c$,"clear",\r
-function(){\r
-this.b$["java.util.LinkedHashMap"].clear();\r
-});\r
-Clazz.overrideMethod(c$,"iterator",\r
-function(){\r
-return new java.util.LinkedHashMap.LinkedHashIterator(((Clazz.isClassDefined("java.util.LinkedHashMap$2$1")?0:java.util.LinkedHashMap.$LinkedHashMap$2$1$()),Clazz.innerTypeInstance(java.util.LinkedHashMap$2$1,this,null)),this.b$["java.util.LinkedHashMap"]);\r
-});\r
-c$=Clazz.p0p();\r
-};\r
-c$.$LinkedHashMap$2$1$=function(){\r
-Clazz.pu$h(self.c$);\r
-c$=Clazz.declareAnonymous(java.util,"LinkedHashMap$2$1",null,java.util.MapEntry.Type);\r
-Clazz.overrideMethod(c$,"get",\r
-function(entry){\r
-return entry.value;\r
-},"java.util.MapEntry");\r
-c$=Clazz.p0p();\r
-};\r
-Clazz.pu$h(self.c$);\r
-c$=Clazz.declareType(java.util.LinkedHashMap,"LinkedHashIterator",java.util.HashMap.HashMapIterator);\r
-Clazz.makeConstructor(c$,\r
-function(a,b){\r
-Clazz.superConstructor(this,java.util.LinkedHashMap.LinkedHashIterator,[a,b]);\r
-this.entry=b.head;\r
-},"java.util.MapEntry.Type,java.util.LinkedHashMap");\r
-Clazz.overrideMethod(c$,"hasNext",\r
-function(){\r
-return(this.entry!=null);\r
-});\r
-Clazz.overrideMethod(c$,"next",\r
-function(){\r
-this.checkConcurrentMod();\r
-if(!this.hasNext()){\r
-throw new java.util.NoSuchElementException();\r
-}var a=this.type.get(this.entry);\r
-this.lastEntry=this.entry;\r
-this.entry=(this.entry).chainForward;\r
-this.canRemove=true;\r
-return a;\r
-});\r
-Clazz.overrideMethod(c$,"remove",\r
-function(){\r
-this.checkConcurrentMod();\r
-if(!this.canRemove){\r
-throw new IllegalStateException();\r
-}this.canRemove=false;\r
-this.associatedMap.modCount++;\r
-var a=this.associatedMap.getModuloHash(this.lastEntry.key);\r
-var b=this.associatedMap.elementData[a];\r
-if(b===this.lastEntry){\r
-this.associatedMap.elementData[a]=this.lastEntry.next;\r
-}else{\r
-while(b.next!=null){\r
-if(b.next===this.lastEntry){\r
-break;\r
-}b=b.next;\r
-}\r
-b.next=this.lastEntry.next;\r
-}var c=this.lastEntry;\r
-var d=c.chainBackward;\r
-var e=c.chainForward;\r
-var f=this.associatedMap;\r
-if(d!=null){\r
-d.chainForward=e;\r
-if(e!=null){\r
-e.chainBackward=d;\r
-}else{\r
-f.tail=d;\r
-}}else{\r
-f.head=e;\r
-if(e!=null){\r
-e.chainBackward=null;\r
-}else{\r
-f.tail=null;\r
-}}this.associatedMap.elementCount--;\r
-this.expectedModCount++;\r
-});\r
-c$=Clazz.p0p();\r
-Clazz.pu$h(self.c$);\r
-c$=Clazz.declareType(java.util.LinkedHashMap,"LinkedHashMapEntrySet",java.util.HashMap.HashMapEntrySet);\r
-Clazz.overrideMethod(c$,"iterator",\r
-function(){\r
-return new java.util.LinkedHashMap.LinkedHashIterator(((Clazz.isClassDefined("java.util.LinkedHashMap$LinkedHashMapEntrySet$1")?0:java.util.LinkedHashMap.LinkedHashMapEntrySet.$LinkedHashMap$LinkedHashMapEntrySet$1$()),Clazz.innerTypeInstance(java.util.LinkedHashMap$LinkedHashMapEntrySet$1,this,null)),this.hashMap());\r
-});\r
-c$.$LinkedHashMap$LinkedHashMapEntrySet$1$=function(){\r
-Clazz.pu$h(self.c$);\r
-c$=Clazz.declareAnonymous(java.util,"LinkedHashMap$LinkedHashMapEntrySet$1",null,java.util.MapEntry.Type);\r
-Clazz.overrideMethod(c$,"get",\r
-function(a){\r
-return a;\r
-},"java.util.MapEntry");\r
-c$=Clazz.p0p();\r
-};\r
-c$=Clazz.p0p();\r
-Clazz.pu$h(self.c$);\r
-c$=Clazz.decorateAsClass(function(){\r
-this.chainForward=null;\r
-this.chainBackward=null;\r
-Clazz.instantialize(this,arguments);\r
-},java.util.LinkedHashMap,"LinkedHashMapEntry",java.util.HashMap.Entry);\r
-Clazz.makeConstructor(c$,\r
-function(a,b){\r
-Clazz.superConstructor(this,java.util.LinkedHashMap.LinkedHashMapEntry,[a,b]);\r
-this.chainForward=null;\r
-this.chainBackward=null;\r
-},"~O,~O");\r
-Clazz.defineMethod(c$,"clone",\r
-function(){\r
-var a=Clazz.superCall(this,java.util.LinkedHashMap.LinkedHashMapEntry,"clone",[]);\r
-a.chainBackward=this.chainBackward;\r
-a.chainForward=this.chainForward;\r
-var b=a.next;\r
-if(b!=null){\r
-a.next=b.clone();\r
-}return a;\r
-});\r
-c$=Clazz.p0p();\r
-});\r
+Clazz.load(["java.util.HashMap"],"java.util.LinkedHashMap",["java.lang.IllegalStateException","java.util.AbstractCollection","$.AbstractSet","java.util.MapEntry.Type","java.util.NoSuchElementException"],function(){
+c$=Clazz.decorateAsClass(function(){
+this.accessOrder=false;
+this.head=null;
+this.tail=null;
+Clazz.instantialize(this,arguments);
+},java.util,"LinkedHashMap",java.util.HashMap);
+Clazz.makeConstructor(c$,
+function(){
+Clazz.superConstructor(this,java.util.LinkedHashMap);
+this.accessOrder=false;
+this.head=null;
+});
+Clazz.makeConstructor(c$,
+function(s){
+Clazz.superConstructor(this,java.util.LinkedHashMap,[s]);
+this.accessOrder=false;
+this.head=null;
+},"~N");
+Clazz.makeConstructor(c$,
+function(s,lf){
+Clazz.superConstructor(this,java.util.LinkedHashMap,[s,lf]);
+this.accessOrder=false;
+this.head=null;
+this.tail=null;
+},"~N,~N");
+Clazz.makeConstructor(c$,
+function(s,lf,order){
+Clazz.superConstructor(this,java.util.LinkedHashMap,[s,lf]);
+this.accessOrder=order;
+this.head=null;
+this.tail=null;
+},"~N,~N,~B");
+Clazz.makeConstructor(c$,
+function(m){
+Clazz.superConstructor(this,java.util.LinkedHashMap,[]);
+this.accessOrder=false;
+this.head=null;
+this.tail=null;
+this.putAll(m);
+},"java.util.Map");
+Clazz.overrideMethod(c$,"newElementArray",
+function(s){
+return new Array(s);
+},"~N");
+Clazz.overrideMethod(c$,"get",
+function(key){
+var m=this.getEntry(key);
+if(m==null){
+return null;
+}if(this.accessOrder&&this.tail!==m){
+var p=m.chainBackward;
+var n=m.chainForward;
+n.chainBackward=p;
+if(p!=null){
+p.chainForward=n;
+}else{
+this.head=n;
+}m.chainForward=null;
+m.chainBackward=this.tail;
+this.tail.chainForward=m;
+this.tail=m;
+}return m.value;
+},"~O");
+Clazz.overrideMethod(c$,"createEntry",
+function(key,index,value){
+var m=new java.util.LinkedHashMap.LinkedHashMapEntry(key,value);
+m.next=this.elementData[index];
+this.elementData[index]=m;
+this.linkEntry(m);
+return m;
+},"~O,~N,~O");
+Clazz.overrideMethod(c$,"put",
+function(key,value){
+var index=this.getModuloHash(key);
+var m=this.findEntry(key,index);
+if(m==null){
+this.modCount++;
+if(++this.elementCount>this.threshold){
+this.rehash();
+index=key==null?0:(key.hashCode()&0x7FFFFFFF)%this.elementData.length;
+}m=this.createEntry(key,index,null);
+}else{
+this.linkEntry(m);
+}var result=m.value;
+m.value=value;
+if(this.removeEldestEntry(this.head)){
+this.remove(this.head.key);
+}return result;
+},"~O,~O");
+Clazz.defineMethod(c$,"linkEntry",
+function(m){
+if(this.tail===m){
+return;
+}if(this.head==null){
+this.head=this.tail=m;
+return;
+}var p=m.chainBackward;
+var n=m.chainForward;
+if(p==null){
+if(n!=null){
+if(this.accessOrder){
+this.head=n;
+n.chainBackward=null;
+m.chainBackward=this.tail;
+m.chainForward=null;
+this.tail.chainForward=m;
+this.tail=m;
+}}else{
+m.chainBackward=this.tail;
+m.chainForward=null;
+this.tail.chainForward=m;
+this.tail=m;
+}return;
+}if(n==null){
+return;
+}if(this.accessOrder){
+p.chainForward=n;
+n.chainBackward=p;
+m.chainForward=null;
+m.chainBackward=this.tail;
+this.tail.chainForward=m;
+this.tail=m;
+}},"java.util.LinkedHashMap.LinkedHashMapEntry");
+Clazz.overrideMethod(c$,"entrySet",
+function(){
+return new java.util.LinkedHashMap.LinkedHashMapEntrySet(this);
+});
+Clazz.overrideMethod(c$,"keySet",
+function(){
+if(this.$keySet==null){
+this.$keySet=((Clazz.isClassDefined("java.util.LinkedHashMap$1")?0:java.util.LinkedHashMap.$LinkedHashMap$1$()),Clazz.innerTypeInstance(java.util.LinkedHashMap$1,this,null));
+}return this.$keySet;
+});
+Clazz.overrideMethod(c$,"values",
+function(){
+if(this.valuesCollection==null){
+this.valuesCollection=((Clazz.isClassDefined("java.util.LinkedHashMap$2")?0:java.util.LinkedHashMap.$LinkedHashMap$2$()),Clazz.innerTypeInstance(java.util.LinkedHashMap$2,this,null));
+}return this.valuesCollection;
+});
+Clazz.overrideMethod(c$,"remove",
+function(key){
+var m=this.removeEntry(key);
+if(m==null){
+return null;
+}var p=m.chainBackward;
+var n=m.chainForward;
+if(p!=null){
+p.chainForward=n;
+}else{
+this.head=n;
+}if(n!=null){
+n.chainBackward=p;
+}else{
+this.tail=p;
+}return m.value;
+},"~O");
+Clazz.defineMethod(c$,"removeEldestEntry",
+function(eldest){
+return false;
+},"java.util.Map.Entry");
+Clazz.defineMethod(c$,"clear",
+function(){
+Clazz.superCall(this,java.util.LinkedHashMap,"clear",[]);
+this.head=this.tail=null;
+});
+Clazz.defineMethod(c$,"clone",
+function(){
+var map=Clazz.superCall(this,java.util.LinkedHashMap,"clone",[]);
+map.clear();
+for(var entry,$entry=this.entrySet().iterator();$entry.hasNext()&&((entry=$entry.next())||true);){
+map.put(entry.getKey(),entry.getValue());
+}
+return map;
+});
+c$.$LinkedHashMap$1$=function(){
+Clazz.pu$h(self.c$);
+c$=Clazz.declareAnonymous(java.util,"LinkedHashMap$1",java.util.AbstractSet);
+Clazz.overrideMethod(c$,"contains",
+function(object){
+return this.b$["java.util.LinkedHashMap"].containsKey(object);
+},"~O");
+Clazz.overrideMethod(c$,"size",
+function(){
+return this.b$["java.util.LinkedHashMap"].size();
+});
+Clazz.overrideMethod(c$,"clear",
+function(){
+this.b$["java.util.LinkedHashMap"].clear();
+});
+Clazz.overrideMethod(c$,"remove",
+function(key){
+if(this.b$["java.util.LinkedHashMap"].containsKey(key)){
+this.b$["java.util.LinkedHashMap"].remove(key);
+return true;
+}return false;
+},"~O");
+Clazz.overrideMethod(c$,"iterator",
+function(){
+return new java.util.LinkedHashMap.LinkedHashIterator(((Clazz.isClassDefined("java.util.LinkedHashMap$1$1")?0:java.util.LinkedHashMap.$LinkedHashMap$1$1$()),Clazz.innerTypeInstance(java.util.LinkedHashMap$1$1,this,null)),this.b$["java.util.LinkedHashMap"]);
+});
+c$=Clazz.p0p();
+};
+c$.$LinkedHashMap$1$1$=function(){
+Clazz.pu$h(self.c$);
+c$=Clazz.declareAnonymous(java.util,"LinkedHashMap$1$1",null,java.util.MapEntry.Type);
+Clazz.overrideMethod(c$,"get",
+function(entry){
+return entry.key;
+},"java.util.MapEntry");
+c$=Clazz.p0p();
+};
+c$.$LinkedHashMap$2$=function(){
+Clazz.pu$h(self.c$);
+c$=Clazz.declareAnonymous(java.util,"LinkedHashMap$2",java.util.AbstractCollection);
+Clazz.overrideMethod(c$,"contains",
+function(object){
+return this.b$["java.util.LinkedHashMap"].containsValue(object);
+},"~O");
+Clazz.overrideMethod(c$,"size",
+function(){
+return this.b$["java.util.LinkedHashMap"].size();
+});
+Clazz.overrideMethod(c$,"clear",
+function(){
+this.b$["java.util.LinkedHashMap"].clear();
+});
+Clazz.overrideMethod(c$,"iterator",
+function(){
+return new java.util.LinkedHashMap.LinkedHashIterator(((Clazz.isClassDefined("java.util.LinkedHashMap$2$1")?0:java.util.LinkedHashMap.$LinkedHashMap$2$1$()),Clazz.innerTypeInstance(java.util.LinkedHashMap$2$1,this,null)),this.b$["java.util.LinkedHashMap"]);
+});
+c$=Clazz.p0p();
+};
+c$.$LinkedHashMap$2$1$=function(){
+Clazz.pu$h(self.c$);
+c$=Clazz.declareAnonymous(java.util,"LinkedHashMap$2$1",null,java.util.MapEntry.Type);
+Clazz.overrideMethod(c$,"get",
+function(entry){
+return entry.value;
+},"java.util.MapEntry");
+c$=Clazz.p0p();
+};
+Clazz.pu$h(self.c$);
+c$=Clazz.declareType(java.util.LinkedHashMap,"LinkedHashIterator",java.util.HashMap.HashMapIterator);
+Clazz.makeConstructor(c$,
+function(a,b){
+Clazz.superConstructor(this,java.util.LinkedHashMap.LinkedHashIterator,[a,b]);
+this.entry=b.head;
+},"java.util.MapEntry.Type,java.util.LinkedHashMap");
+Clazz.overrideMethod(c$,"hasNext",
+function(){
+return(this.entry!=null);
+});
+Clazz.overrideMethod(c$,"next",
+function(){
+this.checkConcurrentMod();
+if(!this.hasNext()){
+throw new java.util.NoSuchElementException();
+}var a=this.type.get(this.entry);
+this.lastEntry=this.entry;
+this.entry=(this.entry).chainForward;
+this.canRemove=true;
+return a;
+});
+Clazz.overrideMethod(c$,"remove",
+function(){
+this.checkConcurrentMod();
+if(!this.canRemove){
+throw new IllegalStateException();
+}this.canRemove=false;
+this.associatedMap.modCount++;
+var a=this.associatedMap.getModuloHash(this.lastEntry.key);
+var b=this.associatedMap.elementData[a];
+if(b===this.lastEntry){
+this.associatedMap.elementData[a]=this.lastEntry.next;
+}else{
+while(b.next!=null){
+if(b.next===this.lastEntry){
+break;
+}b=b.next;
+}
+b.next=this.lastEntry.next;
+}var c=this.lastEntry;
+var d=c.chainBackward;
+var e=c.chainForward;
+var f=this.associatedMap;
+if(d!=null){
+d.chainForward=e;
+if(e!=null){
+e.chainBackward=d;
+}else{
+f.tail=d;
+}}else{
+f.head=e;
+if(e!=null){
+e.chainBackward=null;
+}else{
+f.tail=null;
+}}this.associatedMap.elementCount--;
+this.expectedModCount++;
+});
+c$=Clazz.p0p();
+Clazz.pu$h(self.c$);
+c$=Clazz.declareType(java.util.LinkedHashMap,"LinkedHashMapEntrySet",java.util.HashMap.HashMapEntrySet);
+Clazz.overrideMethod(c$,"iterator",
+function(){
+return new java.util.LinkedHashMap.LinkedHashIterator(((Clazz.isClassDefined("java.util.LinkedHashMap$LinkedHashMapEntrySet$1")?0:java.util.LinkedHashMap.LinkedHashMapEntrySet.$LinkedHashMap$LinkedHashMapEntrySet$1$()),Clazz.innerTypeInstance(java.util.LinkedHashMap$LinkedHashMapEntrySet$1,this,null)),this.hashMap());
+});
+c$.$LinkedHashMap$LinkedHashMapEntrySet$1$=function(){
+Clazz.pu$h(self.c$);
+c$=Clazz.declareAnonymous(java.util,"LinkedHashMap$LinkedHashMapEntrySet$1",null,java.util.MapEntry.Type);
+Clazz.overrideMethod(c$,"get",
+function(a){
+return a;
+},"java.util.MapEntry");
+c$=Clazz.p0p();
+};
+c$=Clazz.p0p();
+Clazz.pu$h(self.c$);
+c$=Clazz.decorateAsClass(function(){
+this.chainForward=null;
+this.chainBackward=null;
+Clazz.instantialize(this,arguments);
+},java.util.LinkedHashMap,"LinkedHashMapEntry",java.util.HashMap.Entry);
+Clazz.makeConstructor(c$,
+function(a,b){
+Clazz.superConstructor(this,java.util.LinkedHashMap.LinkedHashMapEntry,[a,b]);
+this.chainForward=null;
+this.chainBackward=null;
+},"~O,~O");
+Clazz.defineMethod(c$,"clone",
+function(){
+var a=Clazz.superCall(this,java.util.LinkedHashMap.LinkedHashMapEntry,"clone",[]);
+a.chainBackward=this.chainBackward;
+a.chainForward=this.chainForward;
+var b=a.next;
+if(b!=null){
+a.next=b.clone();
+}return a;
+});
+c$=Clazz.p0p();
+});
git://source.jalview.org / jalviewjs.git / blobdiff