/*
* Copyright 2014 Goldman Sachs.
*
* 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 com.gs.collections.impl.stack.immutable.primitive;
import java.io.IOException;
import java.io.Serializable;
import com.gs.collections.api.DoubleIterable;
import com.gs.collections.api.LazyDoubleIterable;
import com.gs.collections.api.bag.primitive.MutableDoubleBag;
import com.gs.collections.api.block.function.primitive.DoubleToObjectFunction;
import com.gs.collections.api.block.function.primitive.ObjectDoubleToObjectFunction;
import com.gs.collections.api.block.predicate.primitive.DoublePredicate;
import com.gs.collections.api.block.procedure.primitive.DoubleProcedure;
import com.gs.collections.api.iterator.DoubleIterator;
import com.gs.collections.api.list.primitive.DoubleList;
import com.gs.collections.api.list.primitive.MutableDoubleList;
import com.gs.collections.api.set.primitive.MutableDoubleSet;
import com.gs.collections.api.stack.ImmutableStack;
import com.gs.collections.api.stack.primitive.DoubleStack;
import com.gs.collections.api.stack.primitive.ImmutableDoubleStack;
import com.gs.collections.impl.bag.mutable.primitive.DoubleHashBag;
import com.gs.collections.impl.factory.Stacks;
import com.gs.collections.impl.factory.primitive.DoubleStacks;
import com.gs.collections.impl.lazy.primitive.LazyDoubleIterableAdapter;
import com.gs.collections.impl.list.mutable.primitive.DoubleArrayList;
import com.gs.collections.impl.set.mutable.primitive.DoubleHashSet;
import com.gs.collections.impl.stack.mutable.primitive.DoubleArrayStack;
import net.jcip.annotations.Immutable;
/**
* ImmutableDoubleSingletonStack is an optimization for {@link ImmutableDoubleStack} of size 1.
* This file was automatically generated from template file immutablePrimitiveSingletonStack.stg.
*/
@Immutable
final class ImmutableDoubleSingletonStack implements ImmutableDoubleStack, Serializable
{
private static final long serialVersionUID = 1L;
private final double element1;
ImmutableDoubleSingletonStack(double element)
{
this.element1 = element;
}
public DoubleIterator doubleIterator()
{
return DoubleArrayStack.newStackWith(this.element1).doubleIterator();
}
public void forEach(DoubleProcedure procedure)
{
procedure.value(this.element1);
}
public int count(DoublePredicate predicate)
{
return predicate.accept(this.element1) ? 1 : 0;
}
public boolean anySatisfy(DoublePredicate predicate)
{
return predicate.accept(this.element1);
}
public boolean allSatisfy(DoublePredicate predicate)
{
return predicate.accept(this.element1);
}
public boolean noneSatisfy(DoublePredicate predicate)
{
return !predicate.accept(this.element1);
}
public double peek()
{
return this.element1;
}
public DoubleList peek(int count)
{
this.checkNegativeCount(count);
if (count == 0)
{
return new DoubleArrayList(0);
}
if (count == 1)
{
return DoubleArrayList.newListWith(this.element1);
}
throw new IllegalArgumentException("Count must be less than or equal to size: Count = " + count + " Size = 1");
}
public double peekAt(int index)
{
this.checkNegativeCount(index);
if (index == 0)
{
return this.element1;
}
throw new IllegalArgumentException("Index must be less than size: Index = " + index + " Size = 1");
}
public ImmutableDoubleStack select(DoublePredicate predicate)
{
return predicate.accept(this.element1) ? DoubleStacks.immutable.with(this.element1)
: DoubleStacks.immutable.with();
}
public ImmutableDoubleStack reject(DoublePredicate predicate)
{
return predicate.accept(this.element1) ? DoubleStacks.immutable.with()
: DoubleStacks.immutable.with(this.element1);
}
public double detectIfNone(DoublePredicate predicate, double ifNone)
{
return predicate.accept(this.element1) ? this.element1 : ifNone;
}
public <V> ImmutableStack<V> collect(DoubleToObjectFunction<? extends V> function)
{
return Stacks.immutable.with(function.valueOf(this.element1));
}
public double sum()
{
return this.element1;
}
public double max()
{
return this.element1;
}
public double maxIfEmpty(double defaultValue)
{
return this.element1;
}
public double min()
{
return this.element1;
}
public double minIfEmpty(double defaultValue)
{
return this.element1;
}
public double average()
{
return this.element1;
}
public double median()
{
return this.element1;
}
public double[] toSortedArray()
{
return new double[]{this.element1};
}
public MutableDoubleList toSortedList()
{
return DoubleArrayList.newListWith(this.element1);
}
public double[] toArray()
{
return new double[]{this.element1};
}
public boolean contains(double value)
{
return Double.compare(this.element1, value) == 0;
}
public boolean containsAll(double... source)
{
for (double value : source)
{
if (Double.compare(this.element1, value) != 0)
{
return false;
}
}
return true;
}
public boolean containsAll(DoubleIterable source)
{
for (DoubleIterator iterator = source.doubleIterator(); iterator.hasNext(); )
{
if (Double.compare(this.element1, iterator.next()) != 0)
{
return false;
}
}
return true;
}
public MutableDoubleList toList()
{
return DoubleArrayList.newListWith(this.element1);
}
public MutableDoubleSet toSet()
{
return DoubleHashSet.newSetWith(this.element1);
}
public MutableDoubleBag toBag()
{
return DoubleHashBag.newBagWith(this.element1);
}
public LazyDoubleIterable asLazy()
{
return new LazyDoubleIterableAdapter(this);
}
public ImmutableDoubleStack toImmutable()
{
return this;
}
public ImmutableDoubleStack push(double element)
{
return DoubleStacks.immutable.with(this.element1, element);
}
public ImmutableDoubleStack pop()
{
return DoubleStacks.immutable.with();
}
public ImmutableDoubleStack pop(int count)
{
this.checkNegativeCount(count);
if (count == 0)
{
return this;
}
if (count == 1)
{
return DoubleStacks.immutable.with();
}
throw new IllegalArgumentException("Count must be less than size: Count = " + count + " Size = 1");
}
private void checkNegativeCount(int count)
{
if (count < 0)
{
throw new IllegalArgumentException("Count must be positive but was " + count);
}
}
public int size()
{
return 1;
}
public boolean isEmpty()
{
return false;
}
public boolean notEmpty()
{
return true;
}
public <T> T injectInto(T injectedValue, ObjectDoubleToObjectFunction<? super T, ? extends T> function)
{
return function.valueOf(injectedValue, this.element1);
}
@Override
public boolean equals(Object otherStack)
{
if (otherStack == this)
{
return true;
}
if (!(otherStack instanceof DoubleStack))
{
return false;
}
DoubleStack stack = (DoubleStack) otherStack;
if (stack.size() != 1)
{
return false;
}
return Double.compare(this.element1, stack.peek()) == 0;
}
@Override
public int hashCode()
{
return 31 + (int) (Double.doubleToLongBits(this.element1) ^ Double.doubleToLongBits(this.element1) >>> 32);
}
@Override
public String toString()
{
return "[" + this.element1 + ']';
}
public String makeString()
{
return this.makeString(", ");
}
public String makeString(String separator)
{
return this.makeString("", separator, "");
}
public String makeString(String start, String separator, String end)
{
Appendable stringBuilder = new StringBuilder();
this.appendString(stringBuilder, start, separator, end);
return stringBuilder.toString();
}
public void appendString(Appendable appendable)
{
this.appendString(appendable, ", ");
}
public void appendString(Appendable appendable, String separator)
{
this.appendString(appendable, "", separator, "");
}
public void appendString(Appendable appendable, String start, String separator, String end)
{
try
{
appendable.append(start);
appendable.append(String.valueOf(this.element1));
appendable.append(end);
}
catch (IOException e)
{
throw new RuntimeException(e);
}
}
}