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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
/*
* Copyright (C)2005-2012 Haxe Foundation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
package haxe.ds;
#if (flash || cpp)
@:generic
#end
class GenericCell<T> {
public var elt : T;
public var next : GenericCell<T>;
public function new(elt,next) { this.elt = elt; this.next = next; }
}
#if cpp
@:generic
private class GenericStackIterator<T> extends cpp.FastIterator<T> {
public var current : GenericCell<T>;
override public function hasNext():Bool { return current!=null; }
override public function next():T { var result = current.elt; current = current.next; return result; }
public function new(head) { current = head; }
}
#end
/**
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.
**/
#if (flash || cpp)
@:generic
#end
class GenericStack<T> {
public var head : GenericCell<T>;
/**
Creates a new empty GenericStack.
**/
public function new() {
}
/**
Pushes element `item` onto the stack.
**/
public inline function add( item : T ) {
head = new GenericCell<T>(item,head);
}
/**
Returns the topmost stack element without removing it.
If the stack is empty, null is returned.
**/
public inline function first() : Null<T> {
return if( head == null ) null else head.elt;
}
/**
Returns the topmost stack element and removes it.
If the stack is empty, null is returned.
**/
public inline function pop() : Null<T> {
var k = head;
if( k== null )
return null;
else {
head = k.next;
return k.elt;
}
}
/**
Tells if the stack is empty.
**/
public inline function isEmpty() : Bool {
return (head == null);
}
/**
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.
**/
public function remove( v : T ) : Bool {
var prev:GenericCell<T> = null;
var l = head;
while( l != null ) {
if( l.elt == v ) {
if( prev == null )
head = l.next;
else
prev.next = l.next;
break;
}
prev = l;
l = l.next;
}
return (l != null);
}
#if cpp
/**
Returns an iterator over the elements of `this` GenericStack.
**/
public function iterator() : Iterator<T> {
return new GenericStackIterator<T>(head);
}
#else
/**
Returns an iterator over the elements of `this` GenericStack.
**/
public function iterator() : Iterator<T> {
var l = head;
return {
hasNext : function() {
return l != null;
},
next : function() {
var k = l;
l = k.next;
return k.elt;
}
};
}
#end
/**
Returns a String representation of `this` GenericStack.
**/
public function toString() {
var a = new Array();
var l = head;
while( l != null ) {
a.push(l.elt);
l = l.next;
}
return "{"+a.join(",")+"}";
}
}
|
