All Downloads are FREE. Search and download functionalities are using the official Maven repository.

io.vertx.ext.cluster.infinispan.impl.InfinispanAsyncMapImpl Maven / Gradle / Ivy

There is a newer version: 5.0.0.CR3
Show newest version
/*
 * Copyright 2021 Red Hat, Inc.
 *
 * Red Hat 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 io.vertx.ext.cluster.infinispan.impl;

import io.vertx.core.Future;
import io.vertx.core.impl.VertxInternal;
import io.vertx.core.shareddata.AsyncMap;
import io.vertx.core.streams.ReadStream;
import io.vertx.ext.cluster.infinispan.InfinispanAsyncMap;
import org.infinispan.AdvancedCache;
import org.infinispan.Cache;
import org.infinispan.context.Flag;
import org.infinispan.stream.CacheCollectors;

import java.util.AbstractMap.SimpleImmutableEntry;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.concurrent.CompletableFuture;
import java.util.concurrent.TimeUnit;
import java.util.stream.Collectors;

import static java.util.stream.Collectors.*;

/**
 * @author Thomas Segismont
 */
public class InfinispanAsyncMapImpl implements AsyncMap, InfinispanAsyncMap {

  private final VertxInternal vertx;
  private final AdvancedCache cache;
  private final AdvancedCache ignoreReturnCache;

  public InfinispanAsyncMapImpl(VertxInternal vertx, Cache cache) {
    this.vertx = vertx;
    this.cache = cache.getAdvancedCache();
    ignoreReturnCache = this.cache.withFlags(Flag.IGNORE_RETURN_VALUES);
  }

  @Override
  public Future get(K k) {
    byte[] kk = DataConverter.toCachedObject(k);
    return Future.fromCompletionStage(cache.getAsync(kk), vertx.getOrCreateContext())
      .map(DataConverter::fromCachedObject);
  }

  @Override
  public Future put(K k, V v) {
    byte[] kk = DataConverter.toCachedObject(k);
    byte[] vv = DataConverter.toCachedObject(v);
    return Future.fromCompletionStage(ignoreReturnCache.putAsync(kk, vv), vertx.getOrCreateContext()).mapEmpty();
  }

  @Override
  public Future put(K k, V v, long ttl) {
    byte[] kk = DataConverter.toCachedObject(k);
    byte[] vv = DataConverter.toCachedObject(v);
    CompletableFuture completionStage = ignoreReturnCache.putAsync(kk, vv, ttl, TimeUnit.MILLISECONDS);
    return Future.fromCompletionStage(completionStage, vertx.getOrCreateContext()).mapEmpty();
  }

  @Override
  public Future putIfAbsent(K k, V v) {
    byte[] kk = DataConverter.toCachedObject(k);
    byte[] vv = DataConverter.toCachedObject(v);
    return Future.fromCompletionStage(cache.putIfAbsentAsync(kk, vv), vertx.getOrCreateContext()).map(DataConverter::fromCachedObject);
  }

  @Override
  public Future putIfAbsent(K k, V v, long ttl) {
    byte[] kk = DataConverter.toCachedObject(k);
    byte[] vv = DataConverter.toCachedObject(v);
    CompletableFuture completionStage = cache.putIfAbsentAsync(kk, vv, ttl, TimeUnit.MILLISECONDS);
    return Future.fromCompletionStage(completionStage, vertx.getOrCreateContext()).map(DataConverter::fromCachedObject);
  }

  @Override
  public Future remove(K k) {
    byte[] kk = DataConverter.toCachedObject(k);
    return Future.fromCompletionStage(cache.removeAsync(kk), vertx.getOrCreateContext()).map(DataConverter::fromCachedObject);
  }

  @Override
  public Future removeIfPresent(K k, V v) {
    byte[] kk = DataConverter.toCachedObject(k);
    byte[] vv = DataConverter.toCachedObject(v);
    return Future.fromCompletionStage(cache.removeAsync(kk, vv), vertx.getOrCreateContext());
  }

  @Override
  public Future replace(K k, V v) {
    byte[] kk = DataConverter.toCachedObject(k);
    byte[] vv = DataConverter.toCachedObject(v);
    return Future.fromCompletionStage(cache.replaceAsync(kk, vv), vertx.getOrCreateContext()).map(DataConverter::fromCachedObject);
  }

  @Override
  public Future replace(K k, V v, long ttl) {
    byte[] kk = DataConverter.toCachedObject(k);
    byte[] vv = DataConverter.toCachedObject(v);
    return Future.fromCompletionStage(cache.replaceAsync(kk, vv, ttl, TimeUnit.MILLISECONDS), vertx.getOrCreateContext()).map(DataConverter::fromCachedObject);
  }

  @Override
  public Future replaceIfPresent(K k, V oldValue, V newValue) {
    byte[] kk = DataConverter.toCachedObject(k);
    byte[] oo = DataConverter.toCachedObject(oldValue);
    byte[] nn = DataConverter.toCachedObject(newValue);
    return Future.fromCompletionStage(cache.replaceAsync(kk, oo, nn), vertx.getOrCreateContext());
  }

  @Override
  public Future replaceIfPresent(K k, V oldValue, V newValue, long ttl) {
    byte[] kk = DataConverter.toCachedObject(k);
    byte[] oo = DataConverter.toCachedObject(oldValue);
    byte[] nn = DataConverter.toCachedObject(newValue);
    return Future.fromCompletionStage(cache.replaceAsync(kk, oo, nn, ttl, TimeUnit.MILLISECONDS), vertx.getOrCreateContext());
  }

  @Override
  public Future clear() {
    return Future.fromCompletionStage(cache.clearAsync(), vertx.getOrCreateContext());
  }

  @Override
  public Future size() {
    return vertx.executeBlocking(future -> future.complete(cache.size()), false);
  }

  @Override
  public Future> keys() {
    return vertx.executeBlocking(promise -> {
      Set cacheKeys = cache.keySet().stream().collect(CacheCollectors.serializableCollector(Collectors::toSet));
      promise.complete(cacheKeys.stream().map(DataConverter::fromCachedObject).collect(toSet()));
    }, false);
  }

  @Override
  public Future> values() {
    return vertx.executeBlocking(promise -> {
      List cacheValues = cache.values().stream().collect(CacheCollectors.serializableCollector(Collectors::toList));
      promise.complete(cacheValues.stream().map(DataConverter::fromCachedObject).collect(toList()));
    }, false);
  }

  @Override
  public Future> entries() {
    return vertx.executeBlocking(promise -> {
      Map cacheEntries = cache.entrySet().stream()
        .collect(CacheCollectors.serializableCollector(() -> toMap(Entry::getKey, Entry::getValue)));
      Map result = new HashMap<>();
      for (Entry entry : cacheEntries.entrySet()) {
        K k = DataConverter.fromCachedObject(entry.getKey());
        V v = DataConverter.fromCachedObject(entry.getValue());
        result.put(k, v);
      }
      promise.complete(result);
    }, false);
  }

  @Override
  public ReadStream keyStream() {
    return new CloseableIteratorCollectionStream<>(vertx.getOrCreateContext(), cache::keySet, DataConverter::fromCachedObject);
  }

  @Override
  public ReadStream valueStream() {
    return new CloseableIteratorCollectionStream<>(vertx.getOrCreateContext(), cache::values, DataConverter::fromCachedObject);
  }

  @Override
  public ReadStream> entryStream() {
    return new CloseableIteratorCollectionStream<>(vertx.getOrCreateContext(), cache::entrySet, cacheEntry -> {
      K key = DataConverter.fromCachedObject(cacheEntry.getKey());
      V value = DataConverter.fromCachedObject(cacheEntry.getValue());
      return new SimpleImmutableEntry<>(key, value);
    });
  }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy