OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2014 Google Inc. All rights reserved. | 2 * Copyright (C) 2014 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 15 matching lines...) Expand all Loading... |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #ifndef HeapLinkedStack_h | 31 #ifndef HeapLinkedStack_h |
32 #define HeapLinkedStack_h | 32 #define HeapLinkedStack_h |
33 | 33 |
34 #include "platform/heap/Heap.h" | 34 #include "platform/heap/Heap.h" |
35 #include "platform/heap/Visitor.h" | 35 #include "platform/heap/Visitor.h" |
| 36 #include "wtf/Allocator.h" |
36 | 37 |
37 namespace blink { | 38 namespace blink { |
38 | 39 |
39 template <typename T> | 40 template <typename T> |
40 class HeapLinkedStack : public GarbageCollected<HeapLinkedStack<T>> { | 41 class HeapLinkedStack : public GarbageCollected<HeapLinkedStack<T>> { |
41 public: | 42 public: |
42 HeapLinkedStack() : m_size(0) { } | 43 HeapLinkedStack() : m_size(0) { } |
43 | 44 |
44 bool isEmpty(); | 45 bool isEmpty(); |
45 | 46 |
(...skipping 59 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
105 } | 106 } |
106 | 107 |
107 template <typename T> | 108 template <typename T> |
108 inline size_t HeapLinkedStack<T>::size() | 109 inline size_t HeapLinkedStack<T>::size() |
109 { | 110 { |
110 return m_size; | 111 return m_size; |
111 } | 112 } |
112 | 113 |
113 template<typename T> | 114 template<typename T> |
114 class TraceEagerlyTrait<HeapLinkedStack<T>> { | 115 class TraceEagerlyTrait<HeapLinkedStack<T>> { |
| 116 STATIC_ONLY(TraceEagerlyTrait); |
115 public: | 117 public: |
116 static const bool value = TraceEagerlyTrait<T>::value; | 118 static const bool value = TraceEagerlyTrait<T>::value; |
117 }; | 119 }; |
118 | 120 |
119 } // namespace blink | 121 } // namespace blink |
120 | 122 |
121 #endif // HeapLinkedStack_h | 123 #endif // HeapLinkedStack_h |
OLD | NEW |