R value = fn.apply((T1) e, rightQ.poll()); sub.requested.decrementAndGet(); onNext.accept(value); R value = fn.apply((T1) e, rightQ.poll()); sub.requested.decrementAndGet(); onNext.accept(value); try { if (!leftQ.isEmpty()) { R value =fn.apply(leftQ.poll(), (T2) e); R value = fn.apply(leftQ.poll(), (T2) e);
Object res = data.poll(); if (res != null) { sub.onNext((nilsafeOut(res)));
@Override protected DirectBuffer allocate() { final OneToOneConcurrentArrayQueue<DirectBuffer> q = BUFFERS.get(); final DirectBuffer buffer = q.poll(); if (buffer != null && buffer.capacity() >= 0) { return buffer; } else { final ByteBuffer bb = allocateDirect(0); return new UnsafeBuffer(bb); } }
@Override protected DirectBuffer allocate() { final OneToOneConcurrentArrayQueue<DirectBuffer> q = BUFFERS.get(); final DirectBuffer buffer = q.poll(); if (buffer != null && buffer.capacity() >= 0) { return buffer; } else { final ByteBuffer bb = allocateDirect(0); return new UnsafeBuffer(bb); } }
R value = fn.apply((T1) e, rightQ.poll()); sub.requested.decrementAndGet(); onNext.accept(value); R value = fn.apply((T1) e, rightQ.poll()); sub.requested.decrementAndGet(); onNext.accept(value); try { if (!leftQ.isEmpty()) { R value =fn.apply(leftQ.poll(), (T2) e); R value = fn.apply(leftQ.poll(), (T2) e);
R value = fn.apply((T1) e, rightQ.poll()); sub.requested.decrementAndGet(); onNext.accept(value); R value = fn.apply((T1) e, rightQ.poll()); sub.requested.decrementAndGet(); onNext.accept(value); try { if (!leftQ.isEmpty()) { R value =fn.apply(leftQ.poll(), (T2) e); R value = fn.apply(leftQ.poll(), (T2) e);
Object res = data.poll(); if (res != null) { sub.onNext((nilsafeOut(res)));
Object res = data.poll(); if (res != null) { sub.onNext((nilsafeOut(res)));