/*
 * Copyright (c) 2011-2017 Pivotal Software Inc, All Rights Reserved.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *       https://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package reactor.core.publisher;

import java.util.concurrent.atomic.AtomicLongFieldUpdater;

import org.reactivestreams.Subscriber;
import reactor.core.CoreSubscriber;
import reactor.core.Fuseable;
import reactor.util.annotation.Nullable;

Emits a range of integer values.
See Also:
/** * Emits a range of integer values. * * @see <a href="https://github.com/reactor/reactive-streams-commons">Reactive-Streams-Commons</a> */
final class FluxRange extends Flux<Integer> implements Fuseable, SourceProducer<Integer> { final long start; final long end; FluxRange(int start, int count) { if (count < 0) { throw new IllegalArgumentException("count >= required but it was " + count); } long e = (long) start + count; if (e - 1 > Integer.MAX_VALUE) { throw new IllegalArgumentException("start + count must be less than Integer.MAX_VALUE + 1"); } this.start = start; this.end = e; } @Override @SuppressWarnings("unchecked") public void subscribe(CoreSubscriber<? super Integer> actual) { long st = start; long en = end; if (st == en) { Operators.complete(actual); return; } else if (st + 1 == en) { actual.onSubscribe(Operators.scalarSubscription(actual, (int)st)); return; } if (actual instanceof ConditionalSubscriber) { actual.onSubscribe(new RangeSubscriptionConditional((ConditionalSubscriber<? super Integer>) actual, st, en)); return; } actual.onSubscribe(new RangeSubscription(actual, st, en)); } @Override public Object scanUnsafe(Attr key) { if (key == Attr.RUN_STYLE) return Attr.RunStyle.SYNC; return null; } static final class RangeSubscription implements InnerProducer<Integer>, SynchronousSubscription<Integer> { final CoreSubscriber<? super Integer> actual; final long end; volatile boolean cancelled; long index; volatile long requested; static final AtomicLongFieldUpdater<RangeSubscription> REQUESTED = AtomicLongFieldUpdater.newUpdater(RangeSubscription.class, "requested"); RangeSubscription(CoreSubscriber<? super Integer> actual, long start, long end) { this.actual = actual; this.index = start; this.end = end; } @Override public CoreSubscriber<? super Integer> actual() { return actual; } @Override public void request(long n) { if (Operators.validate(n)) { if (Operators.addCap(REQUESTED, this, n) == 0) { if (n == Long.MAX_VALUE) { fastPath(); } else { slowPath(n); } } } } @Override public void cancel() { cancelled = true; } void fastPath() { final long e = end; final Subscriber<? super Integer> a = actual; for (long i = index; i != e; i++) { if (cancelled) { return; } a.onNext((int) i); } if (cancelled) { return; } a.onComplete(); } void slowPath(long n) { final Subscriber<? super Integer> a = actual; long f = end; long e = 0; long i = index; for (; ; ) { if (cancelled) { return; } while (e != n && i != f) { a.onNext((int) i); if (cancelled) { return; } e++; i++; } if (cancelled) { return; } if (i == f) { a.onComplete(); return; } n = requested; if (n == e) { index = i; n = REQUESTED.addAndGet(this, -e); if (n == 0) { return; } e = 0; } } } @Override @Nullable public Object scanUnsafe(Attr key) { if (key == Attr.CANCELLED) return cancelled; if (key == Attr.REQUESTED_FROM_DOWNSTREAM) return requested; if (key == Attr.TERMINATED) return isEmpty(); if (key == Attr.RUN_STYLE) return Attr.RunStyle.SYNC; return InnerProducer.super.scanUnsafe(key); } @Override @Nullable public Integer poll() { long i = index; if (i == end) { return null; } index = i + 1; return (int)i; } @Override public boolean isEmpty() { return index == end; } @Override public void clear() { index = end; } @Override public int size() { return (int)(end - index); } } static final class RangeSubscriptionConditional implements InnerProducer<Integer>, SynchronousSubscription<Integer> { final ConditionalSubscriber<? super Integer> actual; final long end; volatile boolean cancelled; long index; volatile long requested; static final AtomicLongFieldUpdater<RangeSubscriptionConditional> REQUESTED = AtomicLongFieldUpdater.newUpdater(RangeSubscriptionConditional.class, "requested"); RangeSubscriptionConditional(ConditionalSubscriber<? super Integer> actual, long start, long end) { this.actual = actual; this.index = start; this.end = end; } @Override public CoreSubscriber<? super Integer> actual() { return actual; } @Override public void request(long n) { if (Operators.validate(n)) { if (Operators.addCap(REQUESTED, this, n) == 0) { if (n == Long.MAX_VALUE) { fastPath(); } else { slowPath(n); } } } } @Override public void cancel() { cancelled = true; } void fastPath() { final long e = end; final ConditionalSubscriber<? super Integer> a = actual; for (long i = index; i != e; i++) { if (cancelled) { return; } a.tryOnNext((int) i); } if (cancelled) { return; } a.onComplete(); } void slowPath(long n) { final ConditionalSubscriber<? super Integer> a = actual; long f = end; long e = 0; long i = index; for (; ; ) { if (cancelled) { return; } while (e != n && i != f) { boolean b = a.tryOnNext((int) i); if (cancelled) { return; } if (b) { e++; } i++; } if (cancelled) { return; } if (i == f) { a.onComplete(); return; } n = requested; if (n == e) { index = i; n = REQUESTED.addAndGet(this, -e); if (n == 0) { return; } e = 0; } } } @Override public Object scanUnsafe(Attr key) { if (key == Attr.CANCELLED) return cancelled; if (key == Attr.REQUESTED_FROM_DOWNSTREAM) return requested; if (key == Attr.TERMINATED) return isEmpty(); if (key == Attr.RUN_STYLE) return Attr.RunStyle.SYNC; return InnerProducer.super.scanUnsafe(key); } @Override @Nullable public Integer poll() { long i = index; if (i == end) { return null; } index = i + 1; return (int)i; } @Override public boolean isEmpty() { return index == end; } @Override public void clear() { index = end; } @Override public int size() { return (int)(end - index); } } }