All Downloads are FREE. Search and download functionalities are using the official Maven repository.
  • Log In
  • Register

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

    /*
 * Copyright 2016 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.AsyncResult;
import io.vertx.core.Context;
import io.vertx.core.Handler;
import io.vertx.core.Promise;
import io.vertx.core.Vertx;
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 Vertx vertx;
  private final AdvancedCache cache;

  public InfinispanAsyncMapImpl(Vertx vertx, Cache cache) {
    this.vertx = vertx;
    this.cache = cache.getAdvancedCache();
  }

  private  void whenComplete(CompletableFuture completableFuture, Promise future) {
    // Context must be created in the calling thread to ensure the proper context is used
    Context context = vertx.getOrCreateContext();
    completableFuture.whenComplete((v, t) -> {
      if (t != null) {
        context.runOnContext(h -> future.fail(t));
      } else {
        context.runOnContext(h -> future.complete(v));
      }
    });
  }

  @Override
  public void get(K k, Handler> resultHandler) {
    Object kk = DataConverter.toCachedObject(k);
    Promise vertxPromise = Promise.promise();
    vertxPromise.future().map(DataConverter::fromCachedObject).setHandler(resultHandler);
    whenComplete(cache.getAsync(kk), vertxPromise);
  }

  @Override
  public void put(K k, V v, Handler> completionHandler) {
    Object kk = DataConverter.toCachedObject(k);
    Object vv = DataConverter.toCachedObject(v);
    Promise vertxPromise = Promise.promise();
    vertxPromise.future().map((Void) null).setHandler(completionHandler);
    whenComplete(cache.withFlags(Flag.IGNORE_RETURN_VALUES).putAsync(kk, vv), vertxPromise);
  }

  @Override
  public void put(K k, V v, long ttl, Handler> completionHandler) {
    Object kk = DataConverter.toCachedObject(k);
    Object vv = DataConverter.toCachedObject(v);
    Promise vertxPromise = Promise.promise();
    vertxPromise.future().map((Void) null).setHandler(completionHandler);
    whenComplete(cache.withFlags(Flag.IGNORE_RETURN_VALUES).putAsync(kk, vv, ttl, TimeUnit.MILLISECONDS), vertxPromise);
  }

  @Override
  public void putIfAbsent(K k, V v, Handler> completionHandler) {
    Object kk = DataConverter.toCachedObject(k);
    Object vv = DataConverter.toCachedObject(v);
    Promise vertxPromise = Promise.promise();
    vertxPromise.future().map(DataConverter::fromCachedObject).setHandler(completionHandler);
    whenComplete(cache.putIfAbsentAsync(kk, vv), vertxPromise);
  }

  @Override
  public void putIfAbsent(K k, V v, long ttl, Handler> completionHandler) {
    Object kk = DataConverter.toCachedObject(k);
    Object vv = DataConverter.toCachedObject(v);
    Promise vertxPromise = Promise.promise();
    vertxPromise.future().map(DataConverter::fromCachedObject).setHandler(completionHandler);
    whenComplete(cache.putIfAbsentAsync(kk, vv, ttl, TimeUnit.MILLISECONDS), vertxPromise);
  }

  @Override
  public void remove(K k, Handler> resultHandler) {
    Object kk = DataConverter.toCachedObject(k);
    Promise vertxPromise = Promise.promise();
    vertxPromise.future().map(DataConverter::fromCachedObject).setHandler(resultHandler);
    whenComplete(cache.removeAsync(kk), vertxPromise);
  }

  @Override
  public void removeIfPresent(K k, V v, Handler> resultHandler) {
    Object kk = DataConverter.toCachedObject(k);
    Object vv = DataConverter.toCachedObject(v);
    Promise vertxPromise = Promise.promise();
    vertxPromise.future().setHandler(resultHandler);
    whenComplete(cache.removeAsync(kk, vv), vertxPromise);
  }

  @Override
  public void replace(K k, V v, Handler> resultHandler) {
    Object kk = DataConverter.toCachedObject(k);
    Object vv = DataConverter.toCachedObject(v);
    Promise vertxPromise = Promise.promise();
    vertxPromise.future().map(DataConverter::fromCachedObject).setHandler(resultHandler);
    whenComplete(cache.replaceAsync(kk, vv), vertxPromise);
  }

  @Override
  public void replaceIfPresent(K k, V oldValue, V newValue, Handler> resultHandler) {
    Object kk = DataConverter.toCachedObject(k);
    Object oo = DataConverter.toCachedObject(oldValue);
    Object nn = DataConverter.toCachedObject(newValue);
    Promise vertxPromise = Promise.promise();
    vertxPromise.future().setHandler(resultHandler);
    whenComplete(cache.replaceAsync(kk, oo, nn), vertxPromise);
  }

  @Override
  public void clear(Handler> resultHandler) {
    Promise vertxPromise = Promise.promise();
    vertxPromise.future().setHandler(resultHandler);
    whenComplete(cache.clearAsync(), vertxPromise);
  }

  @Override
  public void size(Handler> resultHandler) {
    vertx.executeBlocking(future -> future.complete(cache.size()), false, resultHandler);
  }

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

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

  @Override
  public void entries(Handler>> resultHandler) {
    vertx.executeBlocking(future -> {
      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);
      }
      future.complete(result);
    }, false, resultHandler);
  }

  @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