AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
Stack.java
Go to the documentation of this file.
1package aud;
2
4import java.util.NoSuchElementException;
5
8public class Stack<T> extends AbstractStack<T> {
9 Vector<T> data_;
10
11 public Stack() { data_=new Vector<T>(); }
12
13 @Override
14 public boolean is_empty() { return data_.empty(); }
15
16 @Override
17 public T top() throws NoSuchElementException {
18 if (data_.empty())
19 throw new NoSuchElementException();
20 return data_.back();
21 }
22
23 public T pop() throws NoSuchElementException {
24 if (data_.empty())
25 throw new NoSuchElementException();
26 T obj=data_.back();
27 data_.pop_back();
28 return obj;
29 }
30
31 public void push(T x) {
32 data_.push_back(x);
33 }
34}
Implementation of a stack based on aud.Vector.
Definition: Stack.java:8
void push(T x)
Push x onto stack.
Definition: Stack.java:31
boolean is_empty()
Is stack empty?
Definition: Stack.java:14
T pop()
Pop element from stack.
Definition: Stack.java:23
T top()
Get stack top.
Definition: Stack.java:17
Stack()
Definition: Stack.java:11
Implementation of an array-based vector.
Definition: Vector.java:44
Interface for an ADT stack.
abstract data types
AuD lecture: Data structures, algorithms, examples.