projects / apple / javascriptcore.git / blame
| Commit | Line | Data |
|---|---|---|
| 14957cd0 A |
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 | #ifndef SinglyLinkedList_h | |
| 27 | #define SinglyLinkedList_h | |
| 28 | ||
| 29 | namespace WTF { | |
| 30 | ||
| 31 | template <typename Node> class SinglyLinkedList { | |
| 32 | public: | |
| 33 | SinglyLinkedList(); | |
| 34 | ||
| 35 | bool isEmpty(); | |
| 36 | ||
| 37 | void push(Node*); | |
| 38 | Node* pop(); | |
| 39 | ||
| 40 | private: | |
| 41 | Node* m_head; | |
| 42 | }; | |
| 43 | ||
| 44 | template <typename Node> inline SinglyLinkedList<Node>::SinglyLinkedList() | |
| 45 | : m_head(0) | |
| 46 | { | |
| 47 | } | |
| 48 | ||
| 49 | template <typename Node> inline bool SinglyLinkedList<Node>::isEmpty() | |
| 50 | { | |
| 51 | return !m_head; | |
| 52 | } | |
| 53 | ||
| 54 | template <typename Node> inline void SinglyLinkedList<Node>::push(Node* node) | |
| 55 | { | |
| 56 | ASSERT(node); | |
| 57 | node->setNext(m_head); | |
| 58 | m_head = node; | |
| 59 | } | |
| 60 | ||
| 61 | template <typename Node> inline Node* SinglyLinkedList<Node>::pop() | |
| 62 | { | |
| 63 | Node* tmp = m_head; | |
| 64 | m_head = m_head->next(); | |
| 65 | return tmp; | |
| 66 | } | |
| 67 | ||
| 68 | } | |
| 69 | ||
| 70 | using WTF::SinglyLinkedList; | |
| 71 | ||
| 72 | #endif |