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
|
/*
* Copyright (C) 2013 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef LinkedStack_h
#define LinkedStack_h
#include "wtf/Allocator.h"
#include "wtf/OwnPtr.h"
namespace WTF {
template <typename T>
class LinkedStack {
USING_FAST_MALLOC(LinkedStack);
public:
LinkedStack() : m_size(0) { }
// Iterative cleanup to prevent stack overflow problems.
~LinkedStack()
{
OwnPtr<Node> ptr = m_head.release();
while (ptr)
ptr = ptr->m_next.release();
}
bool isEmpty();
void push(const T&);
const T& peek();
void pop();
size_t size();
private:
class Node {
USING_FAST_MALLOC(LinkedStack::Node);
public:
Node(const T&, PassOwnPtr<Node> next);
T m_data;
OwnPtr<Node> m_next;
};
#if COMPILER(MSVC)
friend struct ::WTF::OwnedPtrDeleter<Node>;
#endif
OwnPtr<Node> m_head;
size_t m_size;
};
template <typename T>
LinkedStack<T>::Node::Node(const T& data, PassOwnPtr<Node> next)
: m_data(data)
, m_next(next)
{
}
template <typename T>
inline bool LinkedStack<T>::isEmpty()
{
return !m_head;
}
template <typename T>
inline void LinkedStack<T>::push(const T& data)
{
m_head = adoptPtr(new Node(data, m_head.release()));
++m_size;
}
template <typename T>
inline const T& LinkedStack<T>::peek()
{
return m_head->m_data;
}
template <typename T>
inline void LinkedStack<T>::pop()
{
ASSERT(m_head && m_size);
m_head = m_head->m_next.release();
--m_size;
}
template <typename T>
inline size_t LinkedStack<T>::size()
{
return m_size;
}
} // namespace WTF
using WTF::LinkedStack;
#endif
|
