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

com.github.edgar615.util.vertx.sharedata.SyncMap Maven / Gradle / Ivy

There is a newer version: 1.0.14
Show newest version
/*
 * Copyright (c) 2011-2016 The original author or authors
 *
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * and Apache License v2.0 which accompanies this distribution.
 *
 *      The Eclipse Public License is available at
 *      http://www.eclipse.org/legal/epl-v10.html
 *
 *      The Apache License v2.0 is available at
 *      http://www.opensource.org/licenses/apache2.0.php
 *
 * You may elect to redistribute this code under either of these licenses.
 */

package com.github.edgar615.util.vertx.sharedata;

import io.vertx.core.AsyncResult;
import io.vertx.core.Handler;
import io.vertx.core.Vertx;
import io.vertx.core.impl.VertxInternal;
import io.vertx.core.spi.cluster.ClusterManager;

import java.util.ArrayList;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;

/**
 * An asynchronous map facade. The underlying map is either a distributed sync map, or a
 * local map.
 * 

* It does not implement all Map method on purpose, just the required ones. *

* 这段代码是从Vert.x的Service Discovery组件中复制,因为有些地方也需要类似的功能,但是又不想引入过多的包. * 在service-discovery组件中这个类叫做:AsyncMap * * @author Clement Escoffier */ public class SyncMap { private final Vertx vertx; private final Map delegateMap; /** * Creates a new async map. * * @param vertx the vert.x instance * @param name the name of the underlying structure (either a local map for non-clustered * vert.x, or a sync map for clustered vert.x) */ public SyncMap(Vertx vertx, String name) { this.vertx = vertx; ClusterManager clusterManager = ((VertxInternal) vertx).getClusterManager(); if (clusterManager == null) { delegateMap = new LocalMapWrapper<>(vertx.sharedData().getLocalMap(name)); } else { delegateMap = clusterManager.getSyncMap(name); } } public void getAll(Handler>> asyncResultHandler) { vertx.>executeBlocking( future -> { Map map = new LinkedHashMap<>(); delegateMap.entrySet().stream() .forEach(entry -> map.put(entry.getKey(), entry.getValue())); future.complete(map); }, asyncResultHandler ); } public void keySet(Handler>> asyncResultHandler) { vertx.>executeBlocking( future -> future.complete(delegateMap.keySet()), asyncResultHandler ); } public void values(Handler>> asyncResultHandler) { vertx.>executeBlocking( future -> future.complete(new ArrayList<>(delegateMap.values())), asyncResultHandler ); } public void get(K k, Handler> handler) { vertx.executeBlocking( future -> future.complete(delegateMap.get(k)), handler ); } public void put(K k, V v, Handler> handler) { vertx.executeBlocking( future -> { delegateMap.put(k, v); future.complete(); }, handler ); } public void remove(K k, Handler> handler) { vertx.executeBlocking( future -> future.complete(delegateMap.remove(k)), handler ); } public void size(Handler> handler) { vertx.executeBlocking( future -> future.complete(delegateMap.size()), handler ); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy