GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — JavaScript/Data-Structures/Stack/StackES6.js at master · TheAlgorithms/JavaScript

Expand file tree

/

StackES6.js

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
57 lines (49 loc) · 1.44 KB
/

StackES6.js

Copy path

File metadata and controls

57 lines (49 loc) · 1.44 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/* Stack data-structure. It's work is based on the LIFO method (last-IN-first-OUT).
* It means that elements added to the stack are placed on the top and only the
* last element (from the top) can be reached. After we get access to the last
* element, he pops from the stack.
* This is a class-based implementation of a Stack. It provides functions
* 'push' - to add an element, 'pop' - to remove an element from the top.
* Also it implements 'length', 'last' and 'isEmpty' properties and
* static isStack method to check is an object the instance of Stack class.
*/
// Class declaration
class Stack {
constructor() {
this.stack = []
this.top = 0
}
// Adds a value to the end of the Stack
push(newValue) {
this.stack.push(newValue)
this.top += 1
}
// Returns and removes the last element of the Stack
pop() {
if (this.top !== 0) {
this.top -= 1
return this.stack.pop()
}
throw new Error('Stack Underflow')
}
// Returns the number of elements in the Stack
get length() {
return this.top
}
// Returns true if stack is empty, false otherwise
get isEmpty() {
return this.top === 0
}
// Returns the last element without removing it
get last() {
if (this.top !== 0) {
return this.stack[this.stack.length - 1]
}
return null
}
// Checks if an object is the instance os the Stack class
static isStack(el) {
return el instanceof Stack
}
}
export { Stack }
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.