@@ -8923,12 +8923,12 @@ public final Maybe<T> reduce(BiFunction<T, T, T> reducer) {
8923
8923
* the application of this operator via {@link #defer(Callable)}:
8924
8924
* <pre><code>
8925
8925
* ObservableSource<T> source = ...
8926
- * ObservableSource .defer(() -> source.reduce(new ArrayList<>(), (list, item) -> list.add(item)));
8926
+ * Observable .defer(() -> source.reduce(new ArrayList<>(), (list, item) -> list.add(item)));
8927
8927
*
8928
8928
* // alternatively, by using compose to stay fluent
8929
8929
*
8930
8930
* source.compose(o ->
8931
- * ObservableSource .defer(() -> o.reduce(new ArrayList<>(), (list, item) -> list.add(item)))
8931
+ * Observable .defer(() -> o.reduce(new ArrayList<>(), (list, item) -> list.add(item)))
8932
8932
* );
8933
8933
* </code></pre>
8934
8934
* <dl>
@@ -8972,12 +8972,12 @@ public final <R> Single<R> reduce(R seed, BiFunction<R, ? super T, R> reducer) {
8972
8972
* the application of this operator via {@link #defer(Callable)}:
8973
8973
* <pre><code>
8974
8974
* ObservableSource<T> source = ...
8975
- * ObservableSource .defer(() -> source.reduce(new ArrayList<>(), (list, item) -> list.add(item)));
8975
+ * Observable .defer(() -> source.reduce(new ArrayList<>(), (list, item) -> list.add(item)));
8976
8976
*
8977
8977
* // alternatively, by using compose to stay fluent
8978
8978
*
8979
8979
* source.compose(o ->
8980
- * ObservableSource .defer(() -> o.reduce(new ArrayList<>(), (list, item) -> list.add(item)))
8980
+ * Observable .defer(() -> o.reduce(new ArrayList<>(), (list, item) -> list.add(item)))
8981
8981
* );
8982
8982
* </code></pre>
8983
8983
* <dl>
@@ -10034,12 +10034,12 @@ public final Observable<T> scan(BiFunction<T, T, T> accumulator) {
10034
10034
* the application of this operator via {@link #defer(Callable)}:
10035
10035
* <pre><code>
10036
10036
* ObservableSource<T> source = ...
10037
- * ObservableSource .defer(() -> source.scan(new ArrayList<>(), (list, item) -> list.add(item)));
10037
+ * Observable .defer(() -> source.scan(new ArrayList<>(), (list, item) -> list.add(item)));
10038
10038
*
10039
10039
* // alternatively, by using compose to stay fluent
10040
10040
*
10041
10041
* source.compose(o ->
10042
- * ObservableSource .defer(() -> o.scan(new ArrayList<>(), (list, item) -> list.add(item)))
10042
+ * Observable .defer(() -> o.scan(new ArrayList<>(), (list, item) -> list.add(item)))
10043
10043
* );
10044
10044
* </code></pre>
10045
10045
* <dl>
@@ -10083,12 +10083,12 @@ public final <R> Observable<R> scan(final R initialValue, BiFunction<R, ? super
10083
10083
* the application of this operator via {@link #defer(Callable)}:
10084
10084
* <pre><code>
10085
10085
* ObservableSource<T> source = ...
10086
- * ObservableSource .defer(() -> source.scan(new ArrayList<>(), (list, item) -> list.add(item)));
10086
+ * Observable .defer(() -> source.scan(new ArrayList<>(), (list, item) -> list.add(item)));
10087
10087
*
10088
10088
* // alternatively, by using compose to stay fluent
10089
10089
*
10090
10090
* source.compose(o ->
10091
- * ObservableSource .defer(() -> o.scan(new ArrayList<>(), (list, item) -> list.add(item)))
10091
+ * Observable .defer(() -> o.scan(new ArrayList<>(), (list, item) -> list.add(item)))
10092
10092
* );
10093
10093
* </code></pre>
10094
10094
* <dl>
0 commit comments