public Object first(){ if(_seed == UNREALIZED_SEED) { _seed = f.invoke(prevSeed); } return _seed; }
/** * Read one object from the String s. Reads data in the * <a href="http://edn-format.org">edn format</a>. * @param s a String * @return an Object, or nil. */ public static Object read(String s) { return EDN_READ_STRING.invoke(s); }
private TransformerIterator(IFn xform, Iterator sourceIter, boolean multi) { this.sourceIter = sourceIter; this.xf = (IFn) xform.invoke(new AFn() { public Object invoke() { return null; } public Object invoke(Object acc) { return acc; } public Object invoke(Object acc, Object o) { buffer = buffer.add(o); return acc; } }); this.multi = multi; }
IFn printLength = Clojure.var("clojure.core", "*print-length*"); IFn deref = Clojure.var("clojure.core", "deref"); deref.invoke(printLength);
IFn map = Clojure.var("clojure.core", "map"); IFn inc = Clojure.var("clojure.core", "inc"); map.invoke(inc, Clojure.read("[1 2 3]"));
void execute(){ try { exec.execute(this); } catch(Throwable error) { if(agent.errorHandler != null) { try { agent.errorHandler.invoke(agent, error); } catch(Throwable e) {} // ignore errorHandler errors } } }
public Object reduce(IFn f, Object init) { long x = start; Object ret = init; for(int i=0; i<count; i++) { ret = f.invoke(ret, x); if(RT.isReduced(ret)) return ret; x += step; } return ret; }
public Object invoke(Object arg1) { load(); return fn.invoke(arg1); }
public Object invoke(Object arg1, Object arg2) { load(); return fn.invoke(arg1,arg2); }
public Object invoke(Object arg1, Object arg2, Object arg3) { load(); return fn.invoke(arg1,arg2,arg3); }
@Override public Object getValueAndReset() { MemoryUsage memUsage = (MemoryUsage) _getUsage.invoke(); HashMap m = new HashMap(); m.put("maxBytes", memUsage.getMax()); m.put("committedBytes", memUsage.getCommitted()); m.put("initBytes", memUsage.getInit()); m.put("usedBytes", memUsage.getUsed()); m.put("virtualFreeBytes", memUsage.getMax() - memUsage.getUsed()); m.put("unusedBytes", memUsage.getCommitted() - memUsage.getUsed()); return m; } }
public Object reduce(IFn f) { Object acc = start; long i = start + step; while(! boundsCheck.exceededBounds(i)) { acc = f.invoke(acc, i); if (acc instanceof Reduced) return ((Reduced)acc).deref(); i += step; } return acc; }
public Object reduce(IFn f, Object start){ Object ret = start; if(count == INFINITE){ while(true){ ret = f.invoke(ret, val); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); } } else { for(long i=0; i<count; i++){ ret = f.invoke(ret, val); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); } return ret; } }
public Object reduce(IFn f, Object val) { Object acc = val; long i = start; do { acc = f.invoke(acc, i); if (RT.isReduced(acc)) return ((Reduced)acc).deref(); i += step; } while(! boundsCheck.exceededBounds(i)); return acc; }
public Object reduce(IFn f, Object start){ Object ret = start; ISeq s = current(); while(true){ ret = f.invoke(ret, s.first()); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); s = s.next(); if(s == null) s = all; } } }
public Object reduce(IFn f){ ISeq s = current(); Object ret = s.first(); while(true) { s = s.next(); if(s == null) s = all; ret = f.invoke(ret, s.first()); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); } }