org.redisson.api.RMapReactive Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of redisson Show documentation

Redis Java client with features of In-Memory Data Grid

There is a newer version: 3.45.1

/**
 * Copyright 2014 Nikita Koksharov, Nickolay Borbit
 *
 * 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 org.redisson.api;

import java.util.Map;
import java.util.Set;

import org.reactivestreams.Publisher;

/**
 *  map functions
 *
 * @author Nikita Koksharov
 *
 * @param  key
 * @param  value
 */
public interface RMapReactive extends RExpirableReactive {

    Publisher> getAll(Set keys);

    Publisher putAll(Map map);

    Publisher addAndGet(K key, Number value);

    Publisher containsValue(Object value);

    Publisher containsKey(Object key);

    Publisher size();

    /**
     * Removes keys from map by one operation in  manner
     *
     * Works faster than RMap.remove but not returning
     * the value associated with key
     *
     * @param keys
     * @return the number of keys that were removed from the hash, not including specified but non existing keys
     */
    Publisher fastRemove(K ... keys);

    /**
     * Associates the specified value with the specified key
     * in  manner.
     *
     * Works faster than RMap.put but not returning
     * the previous value associated with key
     *
     * @param key
     * @param value
     * @return true if key is a new key in the hash and value was set.
     *         false if key already exists in the hash and the value was updated.
     */
    Publisher fastPut(K key, V value);

    Publisher get(K key);

    Publisher put(K key, V value);

    Publisher remove(K key);

    Publisher replace(K key, V value);

    Publisher replace(K key, V oldValue, V newValue);

    Publisher remove(Object key, Object value);

    Publisher putIfAbsent(K key, V value);

    Publisher> entryIterator();

    Publisher valueIterator();

    Publisher keyIterator();

}