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

org.javimmutable.collections.hash.SingleHashValueListNode Maven / Gradle / Ivy

///###////////////////////////////////////////////////////////////////////////
//
// Burton Computer Corporation
// http://www.burton-computer.com
//
// Copyright (c) 2017, Burton Computer Corporation
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
//     Redistributions of source code must retain the above copyright
//     notice, this list of conditions and the following disclaimer.
//
//     Redistributions in binary form must reproduce the above copyright
//     notice, this list of conditions and the following disclaimer in
//     the documentation and/or other materials provided with the
//     distribution.
//
//     Neither the name of the Burton Computer Corporation nor the names
//     of its contributors may be used to endorse or promote products
//     derived from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

package org.javimmutable.collections.hash;

import org.javimmutable.collections.Cursor;
import org.javimmutable.collections.Holder;
import org.javimmutable.collections.Holders;
import org.javimmutable.collections.JImmutableMap;
import org.javimmutable.collections.SplitableIterator;
import org.javimmutable.collections.common.MutableDelta;
import org.javimmutable.collections.cursors.SingleValueCursor;
import org.javimmutable.collections.iterators.SingleValueIterator;

import javax.annotation.Nonnull;
import javax.annotation.Nullable;
import javax.annotation.concurrent.Immutable;

@Immutable
class SingleHashValueListNode
    implements HashValueListNode,
               JImmutableMap.Entry,
               Holder
{
    private final K key;
    private final V value;

    private SingleHashValueListNode(K key,
                                    V value)
    {
        this.key = key;
        this.value = value;
    }

    static  SingleHashValueListNode of(K key,
                                                   V value)
    {
        return new SingleHashValueListNode(key, value);
    }

    @Override
    public Holder getValueForKey(K key)
    {
        return this.key.equals(key) ? this : Holders.of();
    }

    @Override
    public JImmutableMap.Entry getEntryForKey(K key)
    {
        return this.key.equals(key) ? this : null;
    }

    @Override
    public HashValueListNode setValueForKey(K key,
                                                  V value,
                                                  MutableDelta sizeDelta)
    {
        if (key.equals(this.key)) {
            return (this.value == value) ? this : new SingleHashValueListNode(key, value);
        } else {
            sizeDelta.add(1);
            return MultiHashValueListNode.of(this, new SingleHashValueListNode(key, value));
        }
    }

    @Override
    public HashValueListNode deleteValueForKey(K key,
                                                     MutableDelta sizeDelta)
    {
        if (this.key.equals(key)) {
            sizeDelta.subtract(1);
            return null;
        } else {
            return this;
        }
    }

    @Nonnull
    @Override
    public K getKey()
    {
        return key;
    }

    @Override
    public V getValue()
    {
        return value;
    }

    @Override
    public boolean isEmpty()
    {
        return false;
    }

    @Override
    public boolean isFilled()
    {
        return true;
    }

    @Override
    public V getValueOrNull()
    {
        return value;
    }

    @Override
    public V getValueOr(@Nullable V defaultValue)
    {
        return value;
    }

    @Override
    @Nonnull
    public Cursor> cursor()
    {
        return SingleValueCursor.of(this);
    }

    @Nonnull
    @Override
    public SplitableIterator> iterator()
    {
        return SingleValueIterator.of(this);
    }

    @Override
    public boolean equals(Object o)
    {
        if (this == o) {
            return true;
        }
        if (o == null || getClass() != o.getClass()) {
            return false;
        }

        SingleHashValueListNode that = (SingleHashValueListNode)o;

        if (key != null ? !key.equals(that.key) : that.key != null) {
            return false;
        }
        //noinspection RedundantIfStatement
        if (value != null ? !value.equals(that.value) : that.value != null) {
            return false;
        }

        return true;
    }

    @Override
    public int hashCode()
    {
        int result = key != null ? key.hashCode() : 0;
        result = 31 * result + (value != null ? value.hashCode() : 0);
        return result;
    }

    @Override
    public String toString()
    {
        return "SingleValueLeafNode{" +
               "key=" + key +
               ", value=" + value +
               '}';
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy