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 95 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
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 = IS_EAGERLY_TRACED_HEAP_COLLECTION(T); | 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 |