public IPersistentMap without(Object k) { if (k instanceof Keyword) return without(((Keyword) k).getName()); return new IndifferentAccessMap(getMap().without(k)); }
public IPersistentMap without(Object k) throws Exception { if(k instanceof Keyword) return without(((Keyword) k).getName()); return new IndifferentAccessMap(getMap().without(k)); }
static public Object dissoc(Object coll, Object key) { if(coll == null) return null; return ((IPersistentMap) coll).without(key); }
static public Object dissoc(Object coll, Object key) { if(coll == null) return null; return ((IPersistentMap) coll).without(key); }
synchronized public IRef removeWatch(Object key){ watches = watches.without(key); return this; }
synchronized public IRef removeWatch(Object key){ try { watches = watches.without(key); } catch(Exception e) { throw Util.sneakyThrow(e); } return this; }
@Override public IPersistentMap without(Object key) { Object newMap = ((IPersistentMap) map).without(key); return (DynamicObjectInstance) DynamicObject.wrap((Map) newMap, type); }
@Override public IPersistentMap without(Object key) { Mapping m=getMapping(key); if (m==null) return this; return new Environment(map.without(key),dependencies,dependents); }
public void removeAlias(Symbol alias) { IPersistentMap map = getAliases(); while(map.containsKey(alias)) { IPersistentMap newMap = map.without(alias); aliases.compareAndSet(map, newMap); map = getAliases(); } }
public boolean remove(Object k, Object v){ Ref r = bins[binFor(k)]; IPersistentMap map = (IPersistentMap) r.deref(); Entry e = map.entryAt(k); if(e != null && e.getValue().equals(v)) { r.set(map.without(k)); return true; } return false; }
public IPersistentSet disjoin(Object key) { if(contains(key)) return new PersistentTreeSet(meta(),impl.without(key)); return this; }
public IPersistentMap without(Object key) { Map.Entry e = def.keyslots.entryAt(key); if(e != null) throw Util.runtimeException("Can't remove struct key"); IPersistentMap newExt = ext.without(key); if(newExt == ext) return this; return makeNew(_meta, def, vals, newExt); }
@Override public Expression substitute(IPersistentMap bindings) { Expression nv=value.substitute(bindings); if (nv==null) return null; bindings=bindings.without(sym); Expression nbody=body.substitute(bindings); if (nbody==null) return null; return update(sym,nv,nbody); }
public IPersistentSet disjoin(Object key) { if(contains(key)) return new PersistentHashSet(meta(),impl.without(key)); return this; }
public IPersistentMap without(Object key) { Map.Entry e = def.keyslots.entryAt(key); if(e != null) throw Util.runtimeException("Can't remove struct key"); IPersistentMap newExt = ext.without(key); if(newExt == ext) return this; return makeNew(_meta, def, vals, newExt); }
public IPersistentMap without(Object k) { if (k instanceof Keyword) return without(((Keyword) k).getName()); return new IndifferentAccessMap(getMap().without(k)); }
@Override public Expression substitute(IPersistentMap bindings) { Expression[] nis=initials.clone(); for (int i=0; i<initials.length; i++) { nis[i]=initials[i].substitute(bindings); bindings=bindings.without(syms[i]); } Expression nbody=body.substitute(bindings); if (nbody==null) return null; return update(syms,nis,nbody); }
public IPersistentMap without(Object k) { if(k instanceof Keyword) return without(((Keyword) k).getName()); return new IndifferentAccessMap(getMap().without(k)); }
public V remove(Object k){ Ref r = bins[binFor(k)]; IPersistentMap map = (IPersistentMap) r.deref(); Object ret = map.valAt(k); r.set(map.without(k)); return (V) ret; }
public IPersistentMap without(Object k) { if(k instanceof Keyword) return without(((Keyword) k).getName()); return new IndifferentAccessMap(getMap().without(k)); }