| 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 19 matching lines...) Expand all Loading... |
| 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 | 36 |
| 37 namespace blink { | 37 namespace blink { |
| 38 | 38 |
| 39 template <typename T> | 39 template <typename T> |
| 40 class HeapLinkedStack : public GarbageCollected<HeapLinkedStack<T> > { | 40 class HeapLinkedStack : public GarbageCollected<HeapLinkedStack<T>> { |
| 41 public: | 41 public: |
| 42 HeapLinkedStack() : m_size(0) { } | 42 HeapLinkedStack() : m_size(0) { } |
| 43 | 43 |
| 44 bool isEmpty(); | 44 bool isEmpty(); |
| 45 | 45 |
| 46 void push(const T&); | 46 void push(const T&); |
| 47 const T& peek(); | 47 const T& peek(); |
| 48 void pop(); | 48 void pop(); |
| 49 | 49 |
| 50 size_t size(); | 50 size_t size(); |
| (...skipping 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 104 --m_size; | 104 --m_size; |
| 105 } | 105 } |
| 106 | 106 |
| 107 template <typename T> | 107 template <typename T> |
| 108 inline size_t HeapLinkedStack<T>::size() | 108 inline size_t HeapLinkedStack<T>::size() |
| 109 { | 109 { |
| 110 return m_size; | 110 return m_size; |
| 111 } | 111 } |
| 112 | 112 |
| 113 template<typename T> | 113 template<typename T> |
| 114 class TraceEagerlyTrait<HeapLinkedStack<T> > { | 114 class TraceEagerlyTrait<HeapLinkedStack<T>> { |
| 115 public: | 115 public: |
| 116 static const bool value = TraceEagerlyTrait<T>::value; | 116 static const bool value = TraceEagerlyTrait<T>::value; |
| 117 }; | 117 }; |
| 118 | 118 |
| 119 } // namespace blink | 119 } // namespace blink |
| 120 | 120 |
| 121 #endif // HeapLinkedStack_h | 121 #endif // HeapLinkedStack_h |
| OLD | NEW |