io.reactivex.rxjava3.internal.disposables.ListCompositeDisposable Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of redisson-all Show documentation
Show all versions of redisson-all Show documentation
Easy Redis Java client and Real-Time Data Platform. Valkey compatible. Sync/Async/RxJava3/Reactive API. Client side caching. Over 50 Redis based Java objects and services: JCache API, Apache Tomcat, Hibernate, Spring, Set, Multimap, SortedSet, Map, List, Queue, Deque, Semaphore, Lock, AtomicLong, Map Reduce, Bloom filter, Scheduler, RPC
/*
* Copyright (c) 2016-present, RxJava Contributors.
*
* 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
*
* http://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 io.reactivex.rxjava3.internal.disposables;
import java.util.*;
import io.reactivex.rxjava3.disposables.*;
import io.reactivex.rxjava3.exceptions.*;
import io.reactivex.rxjava3.internal.util.ExceptionHelper;
/**
* A disposable container that can hold onto multiple other disposables.
*/
public final class ListCompositeDisposable implements Disposable, DisposableContainer {
List resources;
volatile boolean disposed;
public ListCompositeDisposable() {
}
public ListCompositeDisposable(Disposable... resources) {
Objects.requireNonNull(resources, "resources is null");
this.resources = new LinkedList<>();
for (Disposable d : resources) {
Objects.requireNonNull(d, "Disposable item is null");
this.resources.add(d);
}
}
public ListCompositeDisposable(Iterable extends Disposable> resources) {
Objects.requireNonNull(resources, "resources is null");
this.resources = new LinkedList<>();
for (Disposable d : resources) {
Objects.requireNonNull(d, "Disposable item is null");
this.resources.add(d);
}
}
@Override
public void dispose() {
if (disposed) {
return;
}
List set;
synchronized (this) {
if (disposed) {
return;
}
disposed = true;
set = resources;
resources = null;
}
dispose(set);
}
@Override
public boolean isDisposed() {
return disposed;
}
@Override
public boolean add(Disposable d) {
Objects.requireNonNull(d, "d is null");
if (!disposed) {
synchronized (this) {
if (!disposed) {
List set = resources;
if (set == null) {
set = new LinkedList<>();
resources = set;
}
set.add(d);
return true;
}
}
}
d.dispose();
return false;
}
public boolean addAll(Disposable... ds) {
Objects.requireNonNull(ds, "ds is null");
if (!disposed) {
synchronized (this) {
if (!disposed) {
List set = resources;
if (set == null) {
set = new LinkedList<>();
resources = set;
}
for (Disposable d : ds) {
Objects.requireNonNull(d, "d is null");
set.add(d);
}
return true;
}
}
}
for (Disposable d : ds) {
d.dispose();
}
return false;
}
@Override
public boolean remove(Disposable d) {
if (delete(d)) {
d.dispose();
return true;
}
return false;
}
@Override
public boolean delete(Disposable d) {
Objects.requireNonNull(d, "Disposable item is null");
if (disposed) {
return false;
}
synchronized (this) {
if (disposed) {
return false;
}
List set = resources;
if (set == null || !set.remove(d)) {
return false;
}
}
return true;
}
public void clear() {
if (disposed) {
return;
}
List set;
synchronized (this) {
if (disposed) {
return;
}
set = resources;
resources = null;
}
dispose(set);
}
void dispose(List set) {
if (set == null) {
return;
}
List errors = null;
for (Disposable o : set) {
try {
o.dispose();
} catch (Throwable ex) {
Exceptions.throwIfFatal(ex);
if (errors == null) {
errors = new ArrayList<>();
}
errors.add(ex);
}
}
if (errors != null) {
if (errors.size() == 1) {
throw ExceptionHelper.wrapOrThrow(errors.get(0));
}
throw new CompositeException(errors);
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy