1/*
2 * Copyright (C) 2011 Apple Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 *
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
14 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
15 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
17 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
18 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
19 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
20 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
21 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
22 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
23 * THE POSSIBILITY OF SUCH DAMAGE.
24 */
25
26#pragma once
27
28namespace WTF {
29
30template <typename Node> class SinglyLinkedList {
31public:
32 SinglyLinkedList();
33
34 bool isEmpty();
35
36 void push(Node*);
37 Node* pop();
38
39private:
40 Node* m_head;
41};
42
43template <typename Node> inline SinglyLinkedList<Node>::SinglyLinkedList()
44 : m_head(0)
45{
46}
47
48template <typename Node> inline bool SinglyLinkedList<Node>::isEmpty()
49{
50 return !m_head;
51}
52
53template <typename Node> inline void SinglyLinkedList<Node>::push(Node* node)
54{
55 ASSERT(node);
56 node->setNext(m_head);
57 m_head = node;
58}
59
60template <typename Node> inline Node* SinglyLinkedList<Node>::pop()
61{
62 Node* tmp = m_head;
63 m_head = m_head->next();
64 return tmp;
65}
66
67}
68
69using WTF::SinglyLinkedList;
70