Stack.
npm install @stdlib/dstructs-stackWe believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js. The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases. When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there. To join us in bringing numerical computing to the web, get started by checking us out on GitHub, and please consider financially supporting stdlib. We greatly appreciate your continued support!
About stdlib...
[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url]
> Stack data structure.
``bash`
npm install @stdlib/dstructs-stack
`javascript`
var stack = require( '@stdlib/dstructs-stack' );
#### stack()
Returns a Stack instance.
`javascript`
var s = stack();
// returns
##### s.clear()
Clears a stack.
`javascript
var s = stack();
// returns
// Add values to the stack:
s.push( 'foo' ).push( 'bar' );
// Peek at the top value:
var v = s.first();
// returns 'bar'
// Examine the stack length:
var len = s.length;
// returns 2
// Clear all stack items:
s.clear();
// Peek at the top value:
v = s.first();
// returns undefined
// Examine the stack length:
len = s.length;
// returns 0
`
##### s.first()
Returns the top stack value (i.e., the value which is "first-out"). If the stack is currently empty, the returned value is undefined.
`javascript
var s = stack();
// returns
// Add values to the stack:
s.push( 'foo' ).push( 'bar' );
// Peek at the top value:
var v = s.first();
// returns 'bar'
`
##### s.iterator()
Returns an iterator for iterating over a stack. If an environment supports Symbol.iterator, the returned iterator is iterable.
`javascript
var s = stack();
// Add values to the stack:
s.push( 'foo' ).push( 'bar' );
// Create an iterator:
var it = s.iterator();
// Iterate over the stack...
var v = it.next().value;
// returns 'bar'
v = it.next().value;
// returns 'foo'
var bool = it.next().done;
// returns true
`
Note: in order to prevent confusion arising from stack mutation during iteration, a returned iterator always iterates over a stack "snapshot", which is defined as the list of stack elements at the time of s.iterator() invocation.
##### s.last()
Returns the bottom stack value (i.e., the value which is "last-out"). If the stack is currently empty, the returned value is undefined.
`javascript
var s = stack();
// returns
// Add values to the stack:
s.push( 'foo' ).push( 'bar' );
// Peek at the bottom value:
var v = s.last();
// returns 'foo'
`
##### s.length
Stack length.
`javascript
var s = stack();
// Examine the initial stack length:
var len = s.length;
// returns 0
// Add values to the stack:
s.push( 'foo' ).push( 'bar' );
// Retrieve the current stack length:
len = s.length;
// returns 2
`
##### s.pop()
Removes a value from the stack. If the stack is currently empty, the returned value is undefined.
`javascript
var s = stack();
// Add values to the stack:
s.push( 'foo' ).push( 'bar' );
// Remove the top value:
var v = s.pop();
// returns 'bar'
// Add a new value to the stack:
s.push( 'beep' );
// Remove the top value:
v = s.pop();
// returns 'beep'
`
##### s.push( value )
Adds a value to the stack.
`javascript
var s = stack();
// Add values to the stack:
s.push( 'foo' ).push( 'bar' );
// Remove the top value:
var v = s.pop();
// returns 'bar'
// Add a new value to the stack:
s.push( 'beep' );
// Remove the top value:
v = s.pop();
// returns 'beep'
`
##### s.toArray()
Returns an array of stack values.
`javascript
var s = stack();
// Add values to the stack:
s.push( 'foo' ).push( 'bar' );
// Get an array of stack values:
var vals = s.toArray();
// returns [ 'bar', 'foo' ]
`
Note: the order of the returned array is reverse stack insertion order (i.e., the "newest" stack elements come before the "oldest" stack elements).
##### s.toJSON()
Serializes a stack as JSON.
`javascript
var s = stack();
// Add values to the stack:
s.push( 'foo' ).push( 'bar' );
// Serialize to JSON:
var o = s.toJSON();
// returns { 'type': 'stack', 'data': [ 'bar', 'foo' ] }
`
Note: JSON.stringify() implicitly calls this method when stringifying a stack instance.
- A stack is also known as a Last-In-First-Out (LIFO) queue.
`javascript
var Stack = require( '@stdlib/dstructs-stack' );
// Create a new stack:
var stack = new Stack();
// Add some values to the stack:
stack.push( 'foo' );
stack.push( 'bar' );
stack.push( 'beep' );
stack.push( 'boop' );
// Peek at the top and bottom stack values:
var v = stack.first();
// returns 'boop'
v = stack.last();
// returns 'foo'
// Inspect the stack length:
var len = stack.length;
// returns 4
// Remove the top value:
v = stack.pop();
// returns 'boop'
// Inspect the stack length:
len = stack.length;
// returns 3
// Iterate over the stack:
var iter = stack.iterator();
var i;
for ( i = 0; i < len; i++ ) {
console.log( 'Stack value #%d: %s', i+1, iter.next().value );
}
// Clear the stack:
stack.clear();
// Inspect the stack length:
len = stack.length;
// returns 0
`
*
- [@stdlib/dstructs-fifo][@stdlib/dstructs/fifo]: first-in-first-out (FIFO) queue.
*
This package is part of [stdlib][stdlib], a standard library for JavaScript and Node.js, with an emphasis on numerical and scientific computing. The library provides a collection of robust, high performance libraries for mathematics, statistics, streams, utilities, and more.
For more information on the project, filing bug reports and feature requests, and guidance on how to develop [stdlib][stdlib], see the main project [repository][stdlib].
#### Community
[![Chat][chat-image]][chat-url]
---
See [LICENSE][stdlib-license].
Copyright © 2016-2026. The Stdlib [Authors][stdlib-authors].
[npm-image]: http://img.shields.io/npm/v/@stdlib/dstructs-stack.svg
[npm-url]: https://npmjs.org/package/@stdlib/dstructs-stack
[test-image]: https://github.com/stdlib-js/dstructs-stack/actions/workflows/test.yml/badge.svg?branch=v0.1.1
[test-url]: https://github.com/stdlib-js/dstructs-stack/actions/workflows/test.yml?query=branch:v0.1.1
[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/dstructs-stack/main.svg
[coverage-url]: https://codecov.io/github/stdlib-js/dstructs-stack?branch=main
[chat-image]: https://img.shields.io/badge/zulip-join_chat-brightgreen.svg
[chat-url]: https://stdlib.zulipchat.com
[stdlib]: https://github.com/stdlib-js/stdlib
[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors
[umd]: https://github.com/umdjs/umd
[es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules
[deno-url]: https://github.com/stdlib-js/dstructs-stack/tree/deno
[deno-readme]: https://github.com/stdlib-js/dstructs-stack/blob/deno/README.md
[umd-url]: https://github.com/stdlib-js/dstructs-stack/tree/umd
[umd-readme]: https://github.com/stdlib-js/dstructs-stack/blob/umd/README.md
[esm-url]: https://github.com/stdlib-js/dstructs-stack/tree/esm
[esm-readme]: https://github.com/stdlib-js/dstructs-stack/blob/esm/README.md
[branches-url]: https://github.com/stdlib-js/dstructs-stack/blob/main/branches.md
[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/dstructs-stack/main/LICENSE
[@stdlib/dstructs/fifo]: https://www.npmjs.com/package/@stdlib/dstructs-fifo