blob: 7216a065969bb328790bd0c2fb9712a3316d57a0 (
plain) (
blame)
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
/*******************************************************************************
* Copyright (c) 2007, 2013 Oracle. All rights reserved.
* This program and the accompanying materials are made available under the
* terms of the Eclipse Public License v1.0, which accompanies this distribution
* and is available at http://www.eclipse.org/legal/epl-v10.html.
*
* Contributors:
* Oracle - initial API and implementation
******************************************************************************/
package org.eclipse.jpt.common.utility.internal.collection;
import java.io.Serializable;
import java.util.Collection;
import java.util.EmptyStackException;
import java.util.LinkedList;
import java.util.NoSuchElementException;
import org.eclipse.jpt.common.utility.collection.Stack;
/**
* Linked list implementation of the {@link Stack} interface.
* @param <E> the type of elements maintained by the stack
* @see LinkedList
*/
public class LinkedStack<E>
implements Stack<E>, Cloneable, Serializable
{
private LinkedList<E> elements;
private static final long serialVersionUID = 1L;
// ********** constructors **********
/**
* Construct an empty stack.
*/
public LinkedStack() {
super();
this.elements = new LinkedList<E>();
}
/**
* Construct a stack containing the elements of the specified
* collection. The stack will pop its elements in reverse of the
* order they are returned by the collection's iterator (i.e. the
* last element returned by the collection's iterator will be the
* first element returned by {@link #pop()}).
*/
public LinkedStack(Collection<? extends E> collection) {
super();
this.elements = new LinkedList<E>(collection);
}
// ********** Stack implementation **********
public void push(E element) {
this.elements.addLast(element);
}
public E pop() {
try {
return this.elements.removeLast();
} catch (NoSuchElementException ex) {
throw new EmptyStackException();
}
}
public E peek() {
try {
return this.elements.getLast();
} catch (NoSuchElementException ex) {
throw new EmptyStackException();
}
}
public boolean isEmpty() {
return this.elements.isEmpty();
}
// ********** standard methods **********
@Override
public LinkedStack<E> clone() {
try {
@SuppressWarnings("unchecked")
LinkedStack<E> clone = (LinkedStack<E>) super.clone();
@SuppressWarnings("unchecked")
LinkedList<E> list = (LinkedList<E>) this.elements.clone();
clone.elements = list;
return clone;
} catch (CloneNotSupportedException ex) {
throw new InternalError();
}
}
/**
* Print the elements in the order in which they are "pushed" on to
* the stack (as opposed to the order in which they will be "popped"
* off of the stack).
*/
@Override
public String toString() {
return this.elements.toString();
}
}
|
