/** * @return * @see org.pcollections.MapPSet#size() */ public int size() { return stack.size(); }
@Override public int size() { return contents.size(); }
public int size() { return boxed.size(); }
Random r = new Random(); for(int i=0;i<1000;i++) { if(pvec.size()==0 || r.nextBoolean()) { // add if(r.nextBoolean()) { // append Integer v = r.nextInt(); int k = r.nextInt(pvec.size()+1); Integer v = r.nextInt(); if(k<pvec.size()) assertEquals(list.get(k), pvec.get(k)); int k = r.nextInt(pvec.size()); Integer v = r.nextInt(); list.set(k, v); int j = r.nextInt(pvec.size()), k=0; for(Integer e : pvec) { pvec = pvec.minus(s); assertEquals(list.size(), pvec.size()); UtilityTest.assertEqualsAndHash(list, pvec); UtilityTest.assertEqualsAndHash(pvec, TreePVector.singleton(10).plusAll(1,pvec).minus(0)); int end=r.nextInt(pvec.size()+1), start=r.nextInt(end+1); UtilityTest.assertEqualsAndHash(pvec.subList(start, end), list.subList(start, end));
static <T> OptionalLens<PVector<T>, T> intoPVector(int index) { return of( ts -> index < ts.size() ? Optional.ofNullable(ts.get(index)) : Optional.empty(), (PVector<T> ts, Optional<T> t) -> t.isPresent() ? ts.with(index, t.get()) : ts.with(index, null) ); }
@Override public void forEachRemaining(Consumer<? super R> action) { source.forEachRemaining(t->{ if(data==false) data = true; list.mutate(var -> var.plus(Math.max(0, var.size()), t)); if(list.get().size()==windowSize){ action.accept(finalizer.apply(VectorX.fromIterable(list.get()))); sent = true; for (int i = 0; i < increment && list.get() .size() > 0; i++) list.mutate(var -> var.minus(0)); }else{ sent =false; } }); if(!sent && data){ action.accept(finalizer.apply(VectorX.fromIterable(list.get()))); } } boolean canAdvance = true;
source.subscribeAll(e-> { try { list.mutate(var -> var.plus(Math.max(0, var.size()),e)); if(list.get().size()==windowSize) { .size() > 0; i++) list.mutate(var -> var.minus(0)); }else{ if(!sent[0] && list.get().size()>0) onNext.accept(finalizer.apply(VectorX.fromIterable(list.get()))); onCompleteDs.run();
public Trampoline<T> bounce() { Object input = init(); for (int i=0; i< fns.size();i++) { final Function<Object, Object> next = fns.get(i); if (next instanceof RecFunction) { PVector<Function<Object, Object>> remaining = fns.subList(i+1,fns.size()); PVector<Function<Object, Object>> nextSteps = (PVector) ((RecFunction) next).apply(VOID); nextSteps.addAll(remaining); return new Later(nextSteps).toTrampoline(); } else { input = next.apply(input); } } return Trampoline.done((T) input); } };
@Override public boolean tryAdvance(Consumer<? super R> action) { if(!canAdvance) return false; data = false; for (int i = 0; i < increment && list.get() .size() > 0; i++) list.mutate(var -> var.minus(0)); for (; list.get() .size() < windowSize && canAdvance;) { Mutable<T> box = Mutable.of(null); canAdvance = source.tryAdvance(t -> { box.accept(t); }); if (box.get()!=null) { data =true; list.mutate(var -> var.plus(Math.max(0, var.size()), box.get())); } } if(data) action.accept(finalizer.apply(VectorX.fromIterable(list.get()))); return canAdvance; }
private Queue<T> getNextQueue() { if(index >= this.distributor.getSubscribers().size()){ this.distributor.addQueue(new Queue()); } return this.distributor.getSubscribers().get(index++); }
upstream[0] = source.subscribe(e-> { try { list.mutate(var -> var.plus(Math.max(0, var.size()),e)); if(list.get().size()==windowSize) { sent[0] = true; for (int i = 0; i < increment && list.get() .size() > 0; i++) list.mutate(var -> var.minus(0)); }else if(sub.isOpen){ upstream[0].request(1); },()->{ if(!sent[0] && list.get().size()>0) onNext.accept(finalizer.apply(VectorX.fromIterable(list.get()))); sub.requested.decrementAndGet();
private Queue<T> getNextQueue() { if (index >= this.distributor.getSubscribers() .size()) { this.distributor.addQueue(factory.build()); } return this.distributor.getSubscribers() .get(index++); }
private Object addToVar(Entry e,Mutable<PVector<String>> vars, Object handleNext) { if(!(e.getValue() instanceof Guard)){ PVector<String> vector = vars.get(); vars.set(vector.plus(vector.size(),e.getKey())); } return handleNext; } protected PStack<Entry> getAssigned() {