GenericStack<T>

package haxe.ds

Available on all platforms

A stack of elements.

This class is generic, which means one type is generated for each type parameter T on static targets. For example:

• new GenericStack<Int>() generates GenericStack_Int
• new GenericStack<String>() generates GenericStack_String

The generated name is an implementation detail and should not be relied upon.

See also:

• https://haxe.org/manual/std-GenericStack.html

Constructor

new()

Creates a new empty GenericStack.

Variables

head:GenericCell<T>

Methods

inlineadd(item:T):Void

Pushes element item onto the stack.

inlinefirst():Null<T>

Returns the topmost stack element without removing it.

If the stack is empty, null is returned.

inlineisEmpty():Bool

Tells if the stack is empty.

iterator():Iterator<T>

Returns an iterator over the elements of this GenericStack.

inlinepop():Null<T>

Returns the topmost stack element and removes it.

If the stack is empty, null is returned.

remove(v:T):Bool

Removes the first element which is equal to v according to the == operator.

This method traverses the stack until it finds a matching element and unlinks it, returning true.

If no matching element is found, false is returned.

toString():String

Returns a String representation of this GenericStack.