/*
 * Java Genetic Algorithm Library (@__identifier__@).
 * Copyright (c) @__year__@ Franz Wilhelmstötter
 *
 * 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.
 *
 * Author:
 *    Franz Wilhelmstötter (franz.wilhelmstoetter@gmx.at)
 */
package org.jenetics.internal.util;

/**
 * @author <a href="mailto:franz.wilhelmstoetter@gmx.at">Franz Wilhelmstötter</a>
 * @version 2.0 &mdash; <em>$Date: 2014-03-16 $</em>
 * @since 2.0
 */
public final class Stack<T> {

	private Node<T> _tail = null;

	public void push(final T value) {
		_tail = new Node<>(value, _tail);
	}

	public T pop() {
		T value = null;
		if (_tail != null) {
			value = _tail._value;
			_tail = _tail._previous;
		}

		return value;
	}


	private static final class Node<T> {
		final T _value;
		final Node<T> _previous;

		Node(final T value, final Node<T> previous) {
			_value = value;
			_previous = previous;
		}
	}
}

@@ -775,16 +775,362 @@
 l;%0A%0A/**%0A
+ * Minimal implementation of stack data-structure. %7B@code Null%7D values are not%0A * permitted, but not checked.%0A *%0A * %5Bcode%5D%0A * final Stack%3CInteger%3E stack = new Stack%3C%3E();%0A * for (int i = 0; i %3C 10; ++i) %7B%0A *     stack.push(i);%0A * %7D%0A *%0A * for (Integer i = stack.pop(); i != null; i = stack.pop()) %7B%0A *     System.out.println(i);%0A * %7D%0A * %5B/code%5D%0A *%0A
  * @auth

Add javadoc.