/*
 * Copyright (c) 2018 Goldman Sachs.
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * and Eclipse Distribution License v. 1.0 which accompany this distribution.
 * The Eclipse Public License is available at http://www.eclipse.org/legal/epl-v10.html
 * and the Eclipse Distribution License is available at
 * http://www.eclipse.org/org/documents/edl-v10.php.
 */

package org.eclipse.collections.impl.stack.immutable.primitive;

import java.io.IOException;
import java.io.Serializable;

import org.eclipse.collections.api.CharIterable;
import org.eclipse.collections.api.LazyCharIterable;
import org.eclipse.collections.api.RichIterable;
import org.eclipse.collections.api.bag.primitive.MutableCharBag;
import org.eclipse.collections.api.block.function.primitive.CharToObjectFunction;
import org.eclipse.collections.api.block.function.primitive.ObjectCharIntToObjectFunction;
import org.eclipse.collections.api.block.function.primitive.ObjectCharToObjectFunction;
import org.eclipse.collections.api.block.predicate.primitive.CharPredicate;
import org.eclipse.collections.api.block.procedure.primitive.CharIntProcedure;
import org.eclipse.collections.api.block.procedure.primitive.CharProcedure;
import org.eclipse.collections.api.iterator.CharIterator;
import org.eclipse.collections.api.list.primitive.CharList;
import org.eclipse.collections.api.list.primitive.MutableCharList;
import org.eclipse.collections.api.set.primitive.MutableCharSet;
import org.eclipse.collections.api.stack.ImmutableStack;
import org.eclipse.collections.api.stack.primitive.CharStack;
import org.eclipse.collections.api.stack.primitive.ImmutableCharStack;
import org.eclipse.collections.impl.bag.mutable.primitive.CharHashBag;
import org.eclipse.collections.impl.factory.Lists;
import org.eclipse.collections.impl.factory.Stacks;
import org.eclipse.collections.impl.factory.primitive.CharStacks;
import org.eclipse.collections.impl.iterator.UnmodifiableCharIterator;
import org.eclipse.collections.impl.lazy.primitive.LazyCharIterableAdapter;
import org.eclipse.collections.impl.list.mutable.primitive.CharArrayList;
import org.eclipse.collections.impl.set.mutable.primitive.CharHashSet;
import org.eclipse.collections.impl.stack.mutable.primitive.CharArrayStack;

ImmutableCharSingletonStack is an optimization for ImmutableCharStack of size 1. This file was automatically generated from template file immutablePrimitiveSingletonStack.stg.
/** * ImmutableCharSingletonStack is an optimization for {@link ImmutableCharStack} of size 1. * This file was automatically generated from template file immutablePrimitiveSingletonStack.stg. */
final class ImmutableCharSingletonStack implements ImmutableCharStack, Serializable { private static final long serialVersionUID = 1L; private final char element1; ImmutableCharSingletonStack(char element) { this.element1 = element; } @Override public CharIterator charIterator() { return new UnmodifiableCharIterator(CharArrayStack.newStackWith(this.element1).charIterator()); } @Override public void forEach(CharProcedure procedure) { this.each(procedure); }
Since:7.0.
/** * @since 7.0. */
@Override public void each(CharProcedure procedure) { procedure.value(this.element1); } @Override public int count(CharPredicate predicate) { return predicate.accept(this.element1) ? 1 : 0; } @Override public boolean anySatisfy(CharPredicate predicate) { return predicate.accept(this.element1); } @Override public boolean allSatisfy(CharPredicate predicate) { return predicate.accept(this.element1); } @Override public boolean noneSatisfy(CharPredicate predicate) { return !predicate.accept(this.element1); } @Override public char peek() { return this.element1; } @Override public CharList peek(int count) { this.checkNegativeCount(count); if (count == 0) { return new CharArrayList(0); } if (count == 1) { return CharArrayList.newListWith(this.element1); } throw new IllegalArgumentException("Count must be less than or equal to size: Count = " + count + " Size = 1"); } @Override public char 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"); } @Override public ImmutableCharStack select(CharPredicate predicate) { return predicate.accept(this.element1) ? CharStacks.immutable.with(this.element1) : CharStacks.immutable.with(); } @Override public ImmutableCharStack reject(CharPredicate predicate) { return predicate.accept(this.element1) ? CharStacks.immutable.with() : CharStacks.immutable.with(this.element1); } @Override public char detectIfNone(CharPredicate predicate, char ifNone) { return predicate.accept(this.element1) ? this.element1 : ifNone; } @Override public <V> ImmutableStack<V> collect(CharToObjectFunction<? extends V> function) { return Stacks.immutable.with(function.valueOf(this.element1)); } @Override public long sum() { return this.element1; } @Override public char max() { return this.element1; } @Override public char maxIfEmpty(char defaultValue) { return this.element1; } @Override public char min() { return this.element1; } @Override public char minIfEmpty(char defaultValue) { return this.element1; } @Override public double average() { return this.element1; } @Override public double median() { return this.element1; } @Override public char[] toSortedArray() { return new char[]{this.element1}; } @Override public MutableCharList toSortedList() { return CharArrayList.newListWith(this.element1); } @Override public char[] toArray() { return new char[]{this.element1}; } @Override public boolean contains(char value) { return this.element1 == value; } @Override public boolean containsAll(char... source) { for (char value : source) { if (this.element1 != value) { return false; } } return true; } @Override public boolean containsAll(CharIterable source) { for (CharIterator iterator = source.charIterator(); iterator.hasNext(); ) { if (this.element1 != iterator.next()) { return false; } } return true; } @Override public MutableCharList toList() { return CharArrayList.newListWith(this.element1); } @Override public MutableCharSet toSet() { return CharHashSet.newSetWith(this.element1); } @Override public MutableCharBag toBag() { return CharHashBag.newBagWith(this.element1); } @Override public LazyCharIterable asLazy() { return new LazyCharIterableAdapter(this); } @Override public ImmutableCharStack toImmutable() { return this; } @Override public ImmutableCharStack push(char element) { return CharStacks.immutable.with(this.element1, element); } @Override public ImmutableCharStack pop() { return CharStacks.immutable.with(); } @Override public ImmutableCharStack pop(int count) { this.checkNegativeCount(count); if (count == 0) { return this; } if (count == 1) { return CharStacks.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); } } @Override public int size() { return 1; } @Override public boolean isEmpty() { return false; } @Override public boolean notEmpty() { return true; } @Override public <T> T injectInto(T injectedValue, ObjectCharToObjectFunction<? super T, ? extends T> function) { return function.valueOf(injectedValue, this.element1); } @Override public RichIterable<CharIterable> chunk(int size) { if (size <= 0) { throw new IllegalArgumentException("Size for groups must be positive but was: " + size); } return Lists.immutable.with(this); } @Override public char getFirst() { throw new UnsupportedOperationException(this.getClass().getSimpleName() + ".getFirst() not implemented yet"); } @Override public int indexOf(char value) { throw new UnsupportedOperationException(this.getClass().getSimpleName() + ".indexOf() not implemented yet"); } @Override public <T> T injectIntoWithIndex(T injectedValue, ObjectCharIntToObjectFunction<? super T, ? extends T> function) { throw new UnsupportedOperationException(this.getClass().getSimpleName() + ".injectIntoWithIndex() not implemented yet"); } @Override public void forEachWithIndex(CharIntProcedure procedure) { throw new UnsupportedOperationException(this.getClass().getSimpleName() + ".forEachWithIndex() not implemented yet"); } @Override public boolean equals(Object otherStack) { if (otherStack == this) { return true; } if (!(otherStack instanceof CharStack)) { return false; } CharStack stack = (CharStack) otherStack; if (stack.size() != 1) { return false; } return this.element1 == stack.peek(); } @Override public int hashCode() { return 31 + (int) this.element1; } @Override public String toString() { return "[" + this.element1 + ']'; } @Override public String makeString() { return this.makeString(", "); } @Override public String makeString(String separator) { return this.makeString("", separator, ""); } @Override public String makeString(String start, String separator, String end) { Appendable stringBuilder = new StringBuilder(); this.appendString(stringBuilder, start, separator, end); return stringBuilder.toString(); } @Override public void appendString(Appendable appendable) { this.appendString(appendable, ", "); } @Override public void appendString(Appendable appendable, String separator) { this.appendString(appendable, "", separator, ""); } @Override 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); } } }