org.javimmutable.collections.array.trie32.EmptyTrieNode Maven / Gradle / Ivy

Go to download
///###////////////////////////////////////////////////////////////////////////
//
// 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.array.trie32;

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.StandardCursor;
import org.javimmutable.collections.iterators.EmptyIterator;

import javax.annotation.concurrent.Immutable;

@Immutable
public class EmptyTrieNode
    extends TrieNode
{
    private static final EmptyTrieNode EMPTY = new EmptyTrieNode();

    @SuppressWarnings("unchecked")
    static  EmptyTrieNode instance()
    {
        return (EmptyTrieNode)EMPTY;
    }

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

    @Override
    public T getValueOr(int shift,
                        int index,
                        T defaultValue)
    {
        return defaultValue;
    }

    @Override
    public  V getValueOr(int shift,
                               int index,
                               K key,
                               Transforms transforms,
                               V defaultValue)
    {
        return defaultValue;
    }

    @Override
    public Holder find(int shift,
                          int index)
    {
        return Holders.of();
    }

    @Override
    public  Holder find(int shift,
                                 int index,
                                 K key,
                                 Transforms transforms)
    {
        return Holders.of();
    }

    @Override
    public TrieNode assign(int shift,
                              int index,
                              T value,
                              MutableDelta sizeDelta)
    {
        sizeDelta.add(1);
        return LeafTrieNode.of(index, value);
    }

    @Override
    public  TrieNode assign(int shift,
                                     int index,
                                     K key,
                                     V value,
                                     Transforms transforms,
                                     MutableDelta sizeDelta)
    {
        return LeafTrieNode.of(index, transforms.update(Holders.of(), key, value, sizeDelta));
    }

    @Override
    public TrieNode delete(int shift,
                              int index,
                              MutableDelta sizeDelta)
    {
        return this;
    }

    @Override
    public  TrieNode delete(int shift,
                                     int index,
                                     K key,
                                     Transforms transforms,
                                     MutableDelta sizeDelta)
    {
        return this;
    }

    @Override
    public int getShift()
    {
        return 0;
    }

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

    @Override
    public TrieNode paddedToMinimumDepthForShift(int shift)
    {
        return this;
    }

    @Override
    public Cursor> anyOrderEntryCursor()
    {
        return StandardCursor.of();
    }

    @Override
    public  Cursor> anyOrderEntryCursor(Transforms transforms)
    {
        return StandardCursor.of();
    }

    @Override
    public Cursor anyOrderValueCursor()
    {
        return StandardCursor.of();
    }

    @Override
    public SplitableIterator> anyOrderEntryIterator()
    {
        return EmptyIterator.of();
    }

    @Override
    public  SplitableIterator> anyOrderEntryIterator(Transforms transforms)
    {
        return EmptyIterator.of();
    }

    @Override
    public SplitableIterator anyOrderValueIterator()
    {
        return EmptyIterator.of();
    }
}