org.javimmutable.collections.list.EmptyNode Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of javimmutable-collections Show documentation
Library providing immutable/persistent collection classes for Java. While collections are immutable they provide methods for adding and removing values by creating new modified copies of themselves. Each copy shares almost all of its structure with other copies to minimize memory consumption.
There is a newer version: 3.2.1
Show newest version
///###////////////////////////////////////////////////////////////////////////
//
// Burton Computer Corporation
// http://www.burton-computer.com
//
// Copyright (c) 2019, 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.list;

import org.javimmutable.collections.Func2;
import org.javimmutable.collections.Proc1Throws;
import org.javimmutable.collections.Sum1Throws;
import org.javimmutable.collections.iterators.GenericIterator;

import javax.annotation.Nonnull;
import javax.annotation.Nullable;
import javax.annotation.concurrent.Immutable;
import java.util.function.Consumer;

@Immutable
class EmptyNode
    extends AbstractNode
{
    private static EmptyNode INSTANCE = new EmptyNode();

    private EmptyNode()
    {
    }

    @SuppressWarnings("unchecked")
    static  EmptyNode instance()
    {
        return INSTANCE;
    }

    @Override
    boolean isEmpty()
    {
        return true;
    }

    @Override
    int size()
    {
        return 0;
    }

    @Override
    int depth()
    {
        return 0;
    }

    @Override
    T get(int index)
    {
        throw new IndexOutOfBoundsException();
    }

    @Nonnull
    @Override
    AbstractNode append(T value)
    {
        return new OneValueNode<>(value);
    }

    @Nonnull
    @Override
    AbstractNode append(@Nonnull AbstractNode node)
    {
        return node;
    }

    @Nonnull
    @Override
    AbstractNode prepend(T value)
    {
        return new OneValueNode<>(value);
    }

    @Nonnull
    @Override
    AbstractNode prepend(@Nonnull AbstractNode node)
    {
        return node;
    }

    @Nonnull
    @Override
    AbstractNode assign(int index,
                           T value)
    {
        throw new IndexOutOfBoundsException();
    }

    @Nonnull
    @Override
    AbstractNode insert(int index,
                           T value)
    {
        if (index == 0) {
            return new OneValueNode<>(value);
        } else {
            throw new IndexOutOfBoundsException();
        }
    }

    @Nonnull
    @Override
    AbstractNode delete(int index)
    {
        throw new IndexOutOfBoundsException();
    }

    @Nonnull
    @Override
    AbstractNode deleteFirst()
    {
        throw new IndexOutOfBoundsException();
    }

    @Nonnull
    @Override
    AbstractNode deleteLast()
    {
        throw new IndexOutOfBoundsException();
    }

    @Nonnull
    @Override
    AbstractNode prefix(int limit)
    {
        if (limit == 0) {
            return this;
        } else {
            throw new IndexOutOfBoundsException();
        }
    }

    @Override
    void copyTo(T[] array,
                int offset)
    {
    }

    @Nonnull
    @Override
    AbstractNode suffix(int offset)
    {
        if (offset == 0) {
            return this;
        } else {
            throw new IndexOutOfBoundsException();
        }
    }

    @Nullable
    @Override
    public GenericIterator.State iterateOverRange(@Nullable GenericIterator.State parent,
                                                     int offset,
                                                     int limit)
    {
        assert offset == 0 && limit == 0;
        return parent;
    }

    @Override
    public void forEach(Consumer action)
    {
    }

    @Override
    public  void forEachThrows(@Nonnull Proc1Throws proc)
        throws E
    {
    }

    @Override
    public  V reduce(V initialValue,
                        Func2 accumulator)
    {
        return initialValue;
    }

    @Override
    public  V reduceThrows(V initialValue,
                                                   Sum1Throws accumulator)
        throws E
    {
        return initialValue;
    }

    @Override
    public void checkInvariants()
    {
    }
}