public Object first() { return new MapEntry(fields.get(i), values.get(i)); }
public Object next() { if (i < basecnt) { Object k = basefields.nth(i); i++; return MapEntry.create(k, rec.valAt(k)); } else { return extmap.next(); } }
private void tryAdvance() { while ((iterator == null || !iterator.hasNext()) && parentIterator.hasNext()) { MapEntry entry = (MapEntry) parentIterator.next(); ISet set = (ISet) entry.val(); long fullOffset = offset + ((Long)entry.key()) << log2LeafSize; iterator = set == null ? null : set.elements(fullOffset, reverse); } }
public Object getValue(){ return val(); }
public Object getKey(){ return key(); }
for (Object item : ns.getMappings()) { MapEntry entry = (MapEntry) item; if (entry.getValue() instanceof Var) { Var var = (Var) entry.getValue(); if (var.ns.toString().equals(namespace)) { String name = entry.getKey().toString(); if (var.deref() instanceof IFn) { Function f = new ClojureFunction(name, var.fn());
MapEntry e2 = (MapEntry) i2.next(); while (true) { long k1 = (Long) e1.key(); long k2 = (Long) e2.key(); if (k1 == k2 && e1.val() != null && e2.val() != null) { node = node.assoc(k1, epoch, null, ((ISet)e1.val()).difference(epoch, (ISet) e2.val())); if (!i1.hasNext() || !i2.hasNext()) break; e1 = (MapEntry) i1.next(); e2 = (MapEntry) i2.next(); } else if (k1 <= k2 && e1.val() != null) { node = node.assoc(k1, epoch, null, e1.val()); if (!i1.hasNext()) break; e1 = (MapEntry) i1.next(); } else { if (!i2.hasNext()) { node = node.assoc(k1, epoch, null, e1.val()); break; node = node.assoc((Long)e1.key(), epoch, null, e1.val());
public Object getValue(){ return val(); }
public Object getKey(){ return key(); }
public Object first() { return new MapEntry(fields.get(i), values.get(i)); }
public ISet intersection(final long epoch, ISet sv) { IntSet s = (IntSet) sv; Iterator i1 = map.iterator(INode.IterationType.ENTRIES, false); Iterator i2 = s.map.iterator(INode.IterationType.ENTRIES, false); // one is empty, so is the intersection if (!i1.hasNext() || !i2.hasNext()) { return new IntSet(leafSize); } INode node = Nodes.Empty.EMPTY; MapEntry e1 = (MapEntry) i1.next(); MapEntry e2 = (MapEntry) i2.next(); while (true) { long k1 = (Long) e1.key(); long k2 = (Long) e2.key(); if (k1 == k2 && e1.val() != null && e2.val() != null) { node = node.assoc(k1, epoch, null, ((ISet)e1.val()).intersection(epoch, (ISet)e2.val())); if (!i1.hasNext() || !i2.hasNext()) break; e1 = (MapEntry) i1.next(); e2 = (MapEntry) i2.next(); } else if (k1 < k2) { if (!i1.hasNext()) break; e1 = (MapEntry) i1.next(); } else { if (!i2.hasNext()) break; e2 = (MapEntry) i2.next(); } } return new IntSet(leafSize, log2LeafSize, node); }
public Object invoke(Object key, Object val) { return new MapEntry(key, val); } };
public Object first(){ return new MapEntry(array[i],array[i+1]); }
public Iterator iterator(final IterationType type, boolean reverse) { return new Iterator() { boolean iterated = false; public boolean hasNext() { return !iterated; } 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 void remove() { throw new UnsupportedOperationException(); } }; }
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; }