Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(1048)

Side by Side Diff: third_party/WebKit/Source/wtf/LinkedStack.h

Issue 2547053003: s/ passed(...) / WTF::passed(...) / to avoid future ambiguity w/ base::Passed. (Closed)
Patch Set: Rebasing... Created 4 years ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
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 67 matching lines...) Expand 10 before | Expand all | Expand 10 after
78 LinkedStack<T>::Node::Node(const T& data, std::unique_ptr<Node> next) 78 LinkedStack<T>::Node::Node(const T& data, std::unique_ptr<Node> next)
79 : m_data(data), m_next(next) {} 79 : m_data(data), m_next(next) {}
80 80
81 template <typename T> 81 template <typename T>
82 inline bool LinkedStack<T>::isEmpty() { 82 inline bool LinkedStack<T>::isEmpty() {
83 return !m_head; 83 return !m_head;
84 } 84 }
85 85
86 template <typename T> 86 template <typename T>
87 inline void LinkedStack<T>::push(const T& data) { 87 inline void LinkedStack<T>::push(const T& data) {
88 m_head = wrapUnique(new Node(data, m_head.release())); 88 m_head = WTF::wrapUnique(new Node(data, m_head.release()));
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 ASSERT(m_head && m_size);
100 m_head = m_head->m_next.release(); 100 m_head = m_head->m_next.release();
101 --m_size; 101 --m_size;
102 } 102 }
103 103
104 template <typename T> 104 template <typename T>
105 inline size_t LinkedStack<T>::size() { 105 inline size_t LinkedStack<T>::size() {
106 return m_size; 106 return m_size;
107 } 107 }
108 108
109 } // namespace WTF 109 } // namespace WTF
110 110
111 using WTF::LinkedStack; 111 using WTF::LinkedStack;
112 112
113 #endif 113 #endif
OLDNEW
« no previous file with comments | « third_party/WebKit/Source/wtf/HashTable.h ('k') | third_party/WebKit/Source/wtf/ListHashSetTest.cpp » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698