
org.apache.hadoop.hbase.client.AsyncBufferedMutatorImpl Maven / Gradle / Ivy
/**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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 org.apache.hadoop.hbase.client;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.concurrent.CompletableFuture;
import java.util.stream.Collectors;
import java.util.stream.Stream;
import org.apache.hadoop.conf.Configuration;
import org.apache.hadoop.hbase.TableName;
import org.apache.yetus.audience.InterfaceAudience;
/**
* The implementation of {@link AsyncBufferedMutator}. Simply wrap an {@link AsyncTable}.
*/
@InterfaceAudience.Private
class AsyncBufferedMutatorImpl implements AsyncBufferedMutator {
private final AsyncTable> table;
private final long writeBufferSize;
private List mutations = new ArrayList<>();
private List> futures = new ArrayList<>();
private long bufferedSize;
private boolean closed;
AsyncBufferedMutatorImpl(AsyncTable> table, long writeBufferSize) {
this.table = table;
this.writeBufferSize = writeBufferSize;
}
@Override
public TableName getName() {
return table.getName();
}
@Override
public Configuration getConfiguration() {
return table.getConfiguration();
}
private void internalFlush() {
List toSend = this.mutations;
if (toSend.isEmpty()) {
return;
}
List> toComplete = this.futures;
assert toSend.size() == toComplete.size();
this.mutations = new ArrayList<>();
this.futures = new ArrayList<>();
bufferedSize = 0L;
Iterator> toCompleteIter = toComplete.iterator();
for (CompletableFuture> future : table.batch(toSend)) {
CompletableFuture toCompleteFuture = toCompleteIter.next();
future.whenComplete((r, e) -> {
if (e != null) {
toCompleteFuture.completeExceptionally(e);
} else {
toCompleteFuture.complete(null);
}
});
}
}
@Override
public CompletableFuture mutate(Mutation mutation) {
CompletableFuture future = new CompletableFuture();
long heapSize = mutation.heapSize();
synchronized (this) {
if (closed) {
future.completeExceptionally(new IOException("Already closed"));
return future;
}
mutations.add(mutation);
futures.add(future);
bufferedSize += heapSize;
if (bufferedSize >= writeBufferSize) {
internalFlush();
}
}
return future;
}
@Override
public List> mutate(List extends Mutation> mutations) {
List> futures =
Stream.> generate(CompletableFuture::new).limit(mutations.size())
.collect(Collectors.toList());
long heapSize = mutations.stream().mapToLong(m -> m.heapSize()).sum();
synchronized (this) {
if (closed) {
IOException ioe = new IOException("Already closed");
futures.forEach(f -> f.completeExceptionally(ioe));
return futures;
}
this.mutations.addAll(mutations);
this.futures.addAll(futures);
bufferedSize += heapSize;
if (bufferedSize >= writeBufferSize) {
internalFlush();
}
}
return futures;
}
@Override
public synchronized void flush() {
internalFlush();
}
@Override
public synchronized void close() {
internalFlush();
closed = true;
}
@Override
public long getWriteBufferSize() {
return writeBufferSize;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy