/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF 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
 *
 *   https://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.
 *
 *   SPDX-License-Identifier: Apache-2.0
 */

package org.apache.jena.atlas.lib.cache;

import java.util.Iterator;
import java.util.Objects;
import java.util.function.BiConsumer;
import java.util.function.Function;

import org.apache.jena.atlas.iterator.Iter;
import org.apache.jena.atlas.lib.Cache;

/** A one-slot cache. */
public class Cache1<K, V> implements Cache<K, V> {
    private final BiConsumer<K, V> dropHandler;
    private K cacheKey;
    private V cacheValue;

    public Cache1() {
        this(null);
    }

    public Cache1(BiConsumer<K, V> dropHandler) {
        clear();
        this.dropHandler = dropHandler;
    }

    @Override
    public boolean containsKey(K key) {
        if ( cacheKey == null )
            return false;
        return cacheKey.equals(key);
    }

    @Override
    public V getIfPresent(K key) {
        if ( cacheKey == null )
            return null;
        if ( cacheKey.equals(key) )
            return cacheValue;
        return null;
    }

    @Override
    public V get(K key, Function<K, V> function) {
        return CacheOps.getOrFillSync(this, key, function);
    }

    @Override
    public void clear() {
        if ( cacheKey == null )
            return;

        K k = cacheKey;
        V v = cacheValue;
        cacheKey = null;
        cacheValue = null;

        notifyDrop(k, v);
    }

    @Override
    public boolean isEmpty() {
        return cacheKey == null;
    }

    @Override
    public Iterator<K> keys() {
        return Iter.singletonIterator(cacheKey);
    }

    @Override
    public void put(K key, V thing) {
        if ( Objects.equals(cacheKey, key) && Objects.equals(cacheValue, thing) )
            // No change.
            return;

        // Change
        K k = cacheKey;
        V v = cacheValue;
        // Displaces any existing cached key/value pair
        cacheKey = key;
        cacheValue = thing;
        notifyDrop(k, v);
    }

    @Override
    public void remove(K key) {
        if ( cacheKey == null )
            return;
        if ( cacheKey.equals(key) )
            clear();   // Will notify
    }

    private void notifyDrop(K key, V thing) {
        if ( dropHandler != null && key != null )
            dropHandler.accept(key, thing);
    }

    @Override
    public long size() {
        return (cacheKey == null) ? 0 : 1;
    }

}
