public Object first() { return new MapEntry(fields.get(i), values.get(i)); }
public Object first() { return new MapEntry(fields.get(i), values.get(i)); }
public Object invoke(Object key, Object val) { return new MapEntry(key, val); } };
public Object first(){ return new MapEntry(array[i],array[i+1]); }
public Object first() { return new MapEntry(fields.get(i), values.get(i)); }
public Object first() { return new MapEntry(fields.get(i), values.get(i)); }
public Object first() { return new MapEntry(fields.get(i), values.get(i)); }
public Object next() { if (iterated) { throw new NoSuchElementException(); } else { iterated = true; switch(type) { case KEYS: return key; case VALS: return value; case ENTRIES: return new clojure.lang.MapEntry(key, value); default: throw new IllegalStateException(); } } }
public IMapEntry entryAt(Object key){ int i = indexOf(key); if(i >= 0) return new MapEntry(array[i],array[i+1]); return null; }
static public Object find(Object coll, Object key){ if(coll == null) return null; else if(coll instanceof Associative) return ((Associative) coll).entryAt(key); else { Map m = (Map) coll; if(m.containsKey(key)) return new MapEntry(key, m.get(key)); return null; } }
public Object first() { if(s != null) return s.first(); return new MapEntry(array[i], array[i+1]); }
public Object reduce(IFn f, Object init) { return f.invoke(init, new clojure.lang.MapEntry(key, value)); }
public ISeq seq(){ ISeq s = root != null ? root.nodeSeq() : null; return hasNull ? new Cons(new MapEntry(null, nullValue), s) : s; }
public Object first(){ return new MapEntry(keys.first(), vals[i]); }
public IMapEntry entryAt(Object key){ Map.Entry e = def.keyslots.entryAt(key); if(e != null) { return new MapEntry(e.getKey(), vals[(Integer) e.getValue()]); } return ext.entryAt(key); }
public Object next() { if (i < basecnt) { Object k = basefields.nth(i); i++; return new MapEntry(k, rec.valAt(k)); } else { return extmap.next(); } }
public IMapEntry find(int shift, int hash, Object key){ int idx = findIndex(key); if(idx < 0) return null; if(Util.equiv(key, array[idx])) return new MapEntry(array[idx], array[idx+1]); return null; }
public IMapEntry entryAt(Object key){ if(key == null) return hasNull ? new MapEntry(null, nullValue) : null; return (root != null) ? root.find(0, hash(key), key) : null; }
public IMapEntry entryAt(Object key){ if(Util.isInteger(key)) { int i = ((Number) key).intValue(); if(i >= 0 && i < count()) return new MapEntry(key, nth(i)); } return null; }
public IMapEntry find(int shift, int hash, Object key){ int bit = bitpos(hash, shift); if((bitmap & bit) == 0) return null; int idx = index(bit); Object keyOrNull = array[2*idx]; Object valOrNode = array[2*idx+1]; if(keyOrNull == null) return ((INode) valOrNode).find(shift + 5, hash, key); if(Util.equiv(key, keyOrNull)) return new MapEntry(keyOrNull, valOrNode); return null; }