OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 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 78 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
89 ++m_size; | 89 ++m_size; |
90 } | 90 } |
91 | 91 |
92 template <typename T> | 92 template <typename T> |
93 inline const T& LinkedStack<T>::peek() { | 93 inline const T& LinkedStack<T>::peek() { |
94 return m_head->m_data; | 94 return m_head->m_data; |
95 } | 95 } |
96 | 96 |
97 template <typename T> | 97 template <typename T> |
98 inline void LinkedStack<T>::pop() { | 98 inline void LinkedStack<T>::pop() { |
99 ASSERT(m_head && m_size); | 99 DCHECK(m_head); |
| 100 DCHECK(m_size); |
100 m_head = m_head->m_next.release(); | 101 m_head = m_head->m_next.release(); |
101 --m_size; | 102 --m_size; |
102 } | 103 } |
103 | 104 |
104 template <typename T> | 105 template <typename T> |
105 inline size_t LinkedStack<T>::size() { | 106 inline size_t LinkedStack<T>::size() { |
106 return m_size; | 107 return m_size; |
107 } | 108 } |
108 | 109 |
109 } // namespace WTF | 110 } // namespace WTF |
110 | 111 |
111 using WTF::LinkedStack; | 112 using WTF::LinkedStack; |
112 | 113 |
113 #endif | 114 #endif |
OLD | NEW |