/*
 * Copyright 2014 Higher Frequency Trading
 *
 * http://www.higherfrequencytrading.com
 *
 * 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 net.openhft.chronicle.map;

import net.openhft.chronicle.hash.ChronicleHash;
import net.openhft.chronicle.hash.serialization.BytesReader;
import net.openhft.lang.io.Bytes;
import net.openhft.lang.io.serialization.BytesMarshaller;
import net.openhft.lang.model.Byteable;
import org.jetbrains.annotations.NotNull;

import java.io.Closeable;
import java.util.Map;
import java.util.concurrent.ConcurrentMap;

/**
 * Extension of {@link ConcurrentMap} interface, stores the data off-heap.
 *
 * <p>For information on <ul> <li>how to construct a {@code ChronicleMap}</li> <li>{@code ChronicleMap}
 * flavors and properties</li> <li>available configurations</li> </ul> see {@link AbstractChronicleMapBuilder}
 * documentation.
 *
 * <p>Functionally this interface defines some methods supporting garbage-free off-heap programming: {@link
 * #getUsing(Object, Object)}, {@link #acquireUsing(Object, Object)}.
 *
 * <p>Roughly speaking, {@code ChronicleMap} compares keys and values by their binary serialized form, that
 * shouldn't necessary be the same equality relation as defined by built-in {@link Object#equals(Object)}
 * method, which is prescribed by general {@link Map} contract.
 *
 * <p>Note that {@code ChronicleMap} extends {@link Closeable}, don't forget to {@linkplain #close() close}
 * map when it is no longer needed.
 *
 * @param <K> the map key type
 * @param <V> the map value type
 */
public interface ChronicleMap<K, V> extends ConcurrentMap<K, V>, ChronicleHash {
    /**
     * Returns the number of entries in this map.
     *
     * @return number of entries in this map
     * @see Map#size()
     */
    long longSize();

    /**
     * Returns the value to which the specified key is mapped, or {@code null} if this map contains no mapping
     * for the key.
     *
     * <p>If the value class allows reusing, particularly if it is a {@link Byteable} subclass, consider
     * {@link #getUsing(Object, Object)} method instead of this to reduce garbage creation.
     *
     * @param key the key whose associated value is to be returned
     * @return the value to which the specified key is mapped after this method call, or {@code null} if no
     * value is mapped
     * @see #getUsing(Object, Object)
     */
    @Override
    V get(Object key);

    /**
     * Returns the value to which the specified key is mapped, read to the provided {@code value} object, if
     * possible, or returns {@code null}, if this map contains no mapping for the key.
     *
     * <p>If the specified key is present in the map, the value data is read to the provided {@code value}
     * object via value marshaller's {@link BytesMarshaller#read(Bytes, Object) read(Bytes, value)} or value
     * reader's {@link BytesReader#read(Bytes, long, Object) read(Bytes, size, value)} method, depending on
     * what deserialization strategy is configured on the builder, using which this map was constructed. If
     * the value deserializer is able to reuse the given {@code value} object, calling this method instead of
     * {@link #get(Object)} could help to reduce garbage creation.
     *
     * <p>The provided {@code value} object is allowed to be {@code null}, in this case {@code
     * map.getUsing(key, null)} call is semantically equivalent to simple {@code map.get(key)} call.
     *
     * @param key        the key whose associated value is to be returned
     * @param usingValue the object to read value data in, if possible
     * @return the value to which the specified key is mapped, or {@code null} if this map contains no mapping
     * for the key
     * @see #get(Object)
     * @see #acquireUsing(Object, Object)
     * @see OnHeapUpdatableChronicleMapBuilder#valueMarshaller(BytesMarshaller)
     */
    V getUsing(K key, V usingValue);

    /**
     * The method is similar {@link  V getUsing(K key, V usingValue);}  but in addition read locks the map
     * segment to operations to be performed atomically. ( see the example below )
     *
     * Returns the  ReadContext which holds a map segment lock and provides method to get the value ( to which
     * the specified key is mapped)  atomically ( see example below for an explanation ), read to the provided
     * {@code value} object, if possible, or returns {@code null}, if this map contains no mapping for the
     * key.
     *
     * <p>If the specified key is present in the map, the readContext.value() uses the provided {@code
     * usingValue} object via value marshaller's {@link BytesMarshaller#read(Bytes, Object) read(Bytes,
     * value)} or value reader's {@link BytesReader#read(Bytes, long, Object) read(Bytes, size, value)}
     * method, depending on what deserialization strategy is configured on the builder, using which this map
     * was constructed. If the value deserializer is able to reuse the given {@code usingValue} object,
     * calling this method instead of {@link #get(Object)} could help to reduce garbage creation.
     * <pre>{@code
     * try (ReadContext rc = map.getUsingLocked(key, bond)) {
     *    if (rc.present ()) { // check whether the key was present
     *    long issueDate = bond.getIssueDate();
     *    String symbol = bond.getSymbol();
     * // add your logic here ( the lock will ensure this bond can not be changed by another thread )
     * }
     * } // the read lock is released here
     * }</pre>
     * To ensure that you can read the 'issueDate' and 'symbol' can be read atomically, these values must be
     * read while the segment lock is in place.
     *
     *
     * <p>The provided {@code value} object is allowed to be {@code null}, in this case
     *
     * @param key        the key whose associated value is to be returned
     * @param usingValue the object to read value data in, if possible
     * @return the read context containing the value to which the specified key is mapped
     *
     * no mapping for the key
     * @see #get(Object)
     * @see #getUsing(Object, Object)
     * @see OnHeapUpdatableChronicleMapBuilder#valueMarshaller(BytesMarshaller)
     */
    @NotNull
    ReadContext<K, V> getUsingLocked(@NotNull K key, @NotNull V usingValue);

    /**
     * Acquire a value for a key, creating if absent.
     *
     * <p>If the specified key is absent in the map, {@linkplain AbstractChronicleMapBuilder#defaultValue(Object)
     * default value} is taken or {@linkplain AbstractChronicleMapBuilder#defaultValueProvider(DefaultValueProvider)
     * default value provider} is called. Then this object is put to this map for the specified key.
     *
     * <p>Then, either if the key was initially absent in the map or already present, the value is
     * deserialized just as during {@link #getUsing(Object, Object) getUsing(key, usingValue)} call, passed
     * the same {@code key} and {@code usingValue} as into this method call. This means, as in {@link
     * #getUsing}, {@code usingValue} could safely be {@code null}, in this case a new value instance is
     * created to deserialize the data.
     *
     * In code, {@code acquireUsing} is specified as :
     * <pre>{@code
     * V acquireUsing(K key, V usingValue) {
     *     if (!containsKey(key))
     *         put(key, defaultValue(key));
     *     return getUsing(key, usingValue);
     * }}</pre>
     *
     *
     * Where {@code defaultValue(key)} returns either {@linkplain AbstractChronicleMapBuilder#defaultValue(Object)
     * default value} or {@link AbstractChronicleMapBuilder#defaultValueProvider(DefaultValueProvider)
     * defaultValueProvider.}
     *
     * <p>If the {@code ChronicleMap} is off-heap updatable, i. e. created via {@link
     * ChronicleMapBuilder} builder (values are {@tlink Byteable}), there is one more option of
     * what to do if the key is absent in the map, see {@link ChronicleMapBuilder#prepareValueBytesOnAcquire(PrepareValueBytes)}.
     * By default, value bytes are just zeroed out, no default value, either provided for key or constant, is
     * put for the absent key.
     *
     * @param key        the key whose associated value is to be returned
     * @param usingValue the object to read value data in, if present. Can not be null
     * @return value to which the given key is mapping after this call, either found or created
     * @see #getUsing(Object, Object)
     */
    V acquireUsing(@NotNull K key, V usingValue);


    @NotNull
    WriteContext<K, V> acquireUsingLocked(@NotNull K key, @NotNull V usingValue);

    /**
     * Apply a mapping to the value returned by a key and return a result.
     * A read lock is assumed.
     *
     * @param key      to apply the mapping to
     * @param function to calculate a result
     * @param <R>      return type.
     * @return the result of the function.
     */
    <R> R mapForKey(K key, @NotNull Function<? super V, R> function);

    /**
     * Apply a mutator to the value for a key and return a result.
     * A write lock is assumed.
     *
     * @param key     to apply the mapping to
     * @param mutator to alter the value and calculate a result
     * @param <R>     return type.
     * @return the result of the function.
     */
    <R> R updateForKey(K key, @NotNull Mutator<? super V, R> mutator);

}