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 rf, Object start){ Object ret = start; Object v = first(); while(true){ ret = rf.invoke(ret, v); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); v = f.invoke(v); } } }
public Object reduce(IFn rf){ Object first = first(); Object ret = first; Object v = f.invoke(first); while(true){ ret = rf.invoke(ret, v); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); v = f.invoke(v); } }
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(); } }
public Object kvreduce(IFn f, Object init){ if(tree != null) init = tree.kvreduce(f,init); if(RT.isReduced(init)) init = ((IDeref)init).deref(); return init; }
public Object kvreduce(IFn f, Object init){ for(int i=0;i < array.length;i+=2){ init = f.invoke(init, array[i], array[i+1]); if(RT.isReduced(init)) return ((IDeref)init).deref(); } return init; }
public Object reduce(IFn f) { Object ret = array[i]; for(int x = i + 1; x < array.length; x++) { ret = f.invoke(ret, array[x]); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); } return ret; }
public Object reduce(IFn f) { Object ret = array[i]; for(int x = i + 1; x < array.length; x++) { ret = f.invoke(ret, array[x]); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); } return ret; }
public Object kvreduce(IFn f, Object init){ if(tree != null) init = tree.kvreduce(f,init); if(RT.isReduced(init)) init = ((IDeref)init).deref(); return init; }
public Object kvreduce(IFn f, Object init){ for(int i=0;i < array.length;i+=2){ init = f.invoke(init, array[i], array[i+1]); if(RT.isReduced(init)) return ((IDeref)init).deref(); } return init; }
public Object reduce(IFn f) { Object ret = array[i]; for(int x = i + 1; x < array.length; x++) { ret = f.invoke(ret, array[x]); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); } return ret; }
public Object reduce(IFn rf, Object start){ Object ret = start; Object v = first(); while(true){ ret = rf.invoke(ret, v); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); v = f.invoke(v); } } }
public Object reduce(IFn f) { Object ret = Numbers.num(array[i]); for(int x = i + 1; x < array.length; x++) { ret = f.invoke(ret, Numbers.num(array[x])); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); } return ret; }
public Object reduce(IFn f) { Object ret = Numbers.num(array[i]); for(int x = i + 1; x < array.length; x++) { ret = f.invoke(ret, Numbers.num(array[x])); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); } return ret; }
public Object reduce(IFn rf){ Object first = first(); Object ret = first; Object v = f.invoke(first); while(true){ ret = rf.invoke(ret, v); if(RT.isReduced(ret)) return ((IDeref)ret).deref(); v = f.invoke(v); } }
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(); } }