@Override public int count() { return map.count(); }
public int count(){ return impl.count(); }
public int count(){ return impl.count(); }
public int size(){ int n = 0; for(int i = 0; i < bins.length; i++) { n += mapAt(i).count(); } return n; }
public int size(){ int n = 0; for(int i = 0; i < bins.length; i++) { n += mapAt(i).count(); } return n; }
public Set<Entry<K, V>> entrySet(){ final ArrayList<Map.Entry<K, V>> entries = new ArrayList(bins.length); for(int i = 0; i < bins.length; i++) { IPersistentMap map = mapAt(i); if(map.count() > 0) entries.addAll((Collection) RT.seq(map)); } return new AbstractSet<Entry<K, V>>(){ public Iterator iterator(){ return Collections.unmodifiableList(entries).iterator(); } public int size(){ return entries.size(); } }; }
public Set<Entry<K, V>> entrySet(){ final ArrayList<Map.Entry<K, V>> entries = new ArrayList(bins.length); for(int i = 0; i < bins.length; i++) { IPersistentMap map = mapAt(i); if(map.count() > 0) entries.addAll((Collection) RT.seq(map)); } return new AbstractSet<Entry<K, V>>(){ public Iterator iterator(){ return Collections.unmodifiableList(entries).iterator(); } public int size(){ return entries.size(); } }; }
public void clear(){ for(int i = 0; i < bins.length; i++) { Ref r = bins[i]; IPersistentMap map = (IPersistentMap) r.deref(); if(map.count() > 0) { r.set(PersistentHashMap.EMPTY); } } }
static public boolean mapEquals(IPersistentMap m1, Object obj){ if(m1 == obj) return true; if(!(obj instanceof Map)) return false; Map m = (Map) obj; if(m.size() != m1.count()) return false; for(ISeq s = m1.seq(); s != null; s = s.next()) { Map.Entry e = (Map.Entry) s.first(); boolean found = m.containsKey(e.getKey()); if(!found || !Util.equals(e.getValue(), m.get(e.getKey()))) return false; } return true; }
public void clear(){ for(int i = 0; i < bins.length; i++) { Ref r = bins[i]; IPersistentMap map = (IPersistentMap) r.deref(); if(map.count() > 0) { r.set(PersistentHashMap.EMPTY); } } }
static public boolean mapEquals(IPersistentMap m1, Object obj){ if(m1 == obj) return true; if(!(obj instanceof Map)) return false; Map m = (Map) obj; if(m.size() != m1.count()) return false; for(ISeq s = m1.seq(); s != null; s = s.next()) { Map.Entry e = (Map.Entry) s.first(); boolean found = m.containsKey(e.getKey()); if(!found || !Util.equals(e.getValue(), m.get(e.getKey()))) return false; } return true; }
static public PersistentStructMap construct(Def def, ISeq valseq){ Object[] vals = new Object[def.keyslots.count()]; IPersistentMap ext = PersistentHashMap.EMPTY; for(int i = 0; i < vals.length && valseq != null; valseq = valseq.next(), i++) { vals[i] = valseq.first(); } if(valseq != null) throw new IllegalArgumentException("Too many arguments to struct constructor"); return new PersistentStructMap(null, def, vals, ext); }
static public PersistentStructMap construct(Def def, ISeq valseq){ Object[] vals = new Object[def.keyslots.count()]; IPersistentMap ext = PersistentHashMap.EMPTY; for(int i = 0; i < vals.length && valseq != null; valseq = valseq.next(), i++) { vals[i] = valseq.first(); } if(valseq != null) throw new IllegalArgumentException("Too many arguments to struct constructor"); return new PersistentStructMap(null, def, vals, ext); }
public void notifyWatches(Object oldval, Object newval){ IPersistentMap ws = watches; if(ws.count() > 0) { for(ISeq s = ws.seq(); s != null; s = s.next()) { Map.Entry e = (Map.Entry) s.first(); IFn fn = (IFn) e.getValue(); if(fn != null) fn.invoke(e.getKey(), this, oldval, newval); } } } }
public void notifyWatches(Object oldval, Object newval){ IPersistentMap ws = watches; if(ws.count() > 0) { for(ISeq s = ws.seq(); s != null; s = s.next()) { Map.Entry e = (Map.Entry) s.first(); IFn fn = (IFn) e.getValue(); try { if(fn != null) fn.invoke(e.getKey(), this, oldval, newval); } catch(Exception e1) { throw Util.sneakyThrow(e1); } } } } }
static public PersistentStructMap create(Def def, ISeq keyvals){ Object[] vals = new Object[def.keyslots.count()]; IPersistentMap ext = PersistentHashMap.EMPTY; for(; keyvals != null; keyvals = keyvals.next().next()) { if(keyvals.next() == null) throw new IllegalArgumentException(String.format("No value supplied for key: %s", keyvals.first())); Object k = keyvals.first(); Object v = RT.second(keyvals); Map.Entry e = def.keyslots.entryAt(k); if(e != null) vals[(Integer) e.getValue()] = v; else ext = ext.assoc(k, v); } return new PersistentStructMap(null, def, vals, ext); }
static public PersistentStructMap create(Def def, ISeq keyvals){ Object[] vals = new Object[def.keyslots.count()]; IPersistentMap ext = PersistentHashMap.EMPTY; for(; keyvals != null; keyvals = keyvals.next().next()) { if(keyvals.next() == null) throw new IllegalArgumentException(String.format("No value supplied for key: %s", keyvals.first())); Object k = keyvals.first(); Object v = RT.second(keyvals); Map.Entry e = def.keyslots.entryAt(k); if(e != null) vals[(Integer) e.getValue()] = v; else ext = ext.assoc(k, v); } return new PersistentStructMap(null, def, vals, ext); }
Expr meta = mm.count()==0 ? null:analyze(context == C.EVAL ? context : C.EXPRESSION, mm); return new DefExpr((String) SOURCE.deref(), lineDeref(), columnDeref(), v, analyze(context == C.EVAL ? context : C.EXPRESSION, RT.third(form), v.sym.name),
public Environment define(Symbol key, Expression body, IPersistentMap bindings) { if (bindings.count()>0) { Expression newBody=body.substitute(bindings); if (newBody!=body) newBody=newBody.optimise(); // re-optimise if needed
gen.endMethod(); if (this.isDeftype() && this.fields.count() > this.hintedFields.count())