OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserv
ed. | 2 * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserv
ed. |
3 * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com> | 3 * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com> |
4 * | 4 * |
5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
9 * | 9 * |
10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
(...skipping 230 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
241 | 241 |
242 AddResult insertBefore(ValuePeekInType beforeValue, ValuePeekInType newValue
); | 242 AddResult insertBefore(ValuePeekInType beforeValue, ValuePeekInType newValue
); |
243 AddResult insertBefore(iterator it, ValuePeekInType newValue) { return m_imp
l.template add<NodeHashFunctions>(newValue, it.node()); } | 243 AddResult insertBefore(iterator it, ValuePeekInType newValue) { return m_imp
l.template add<NodeHashFunctions>(newValue, it.node()); } |
244 | 244 |
245 void remove(ValuePeekInType); | 245 void remove(ValuePeekInType); |
246 void remove(iterator); | 246 void remove(iterator); |
247 void clear() { m_impl.clear(); } | 247 void clear() { m_impl.clear(); } |
248 template<typename Collection> | 248 template<typename Collection> |
249 void removeAll(const Collection& other) { WTF::removeAll(*this, other); } | 249 void removeAll(const Collection& other) { WTF::removeAll(*this, other); } |
250 | 250 |
251 using HasInlinedTraceMethodMarker = int; | |
252 template<typename VisitorDispatcher> | 251 template<typename VisitorDispatcher> |
253 void trace(VisitorDispatcher visitor) { m_impl.trace(visitor); } | 252 void trace(VisitorDispatcher visitor) { m_impl.trace(visitor); } |
254 | 253 |
255 int64_t modifications() const { return m_impl.modifications(); } | 254 int64_t modifications() const { return m_impl.modifications(); } |
256 void checkModifications(int64_t mods) const { m_impl.checkModifications(mods
); } | 255 void checkModifications(int64_t mods) const { m_impl.checkModifications(mods
); } |
257 | 256 |
258 private: | 257 private: |
259 Node* anchor() { return reinterpret_cast<Node*>(&m_anchor); } | 258 Node* anchor() { return reinterpret_cast<Node*>(&m_anchor); } |
260 const Node* anchor() const { return reinterpret_cast<const Node*>(&m_anchor)
; } | 259 const Node* anchor() const { return reinterpret_cast<const Node*>(&m_anchor)
; } |
261 Node* firstNode() { return reinterpret_cast<Node*>(m_anchor.m_next); } | 260 Node* firstNode() { return reinterpret_cast<Node*>(m_anchor.m_next); } |
(...skipping 464 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
726 struct NeedsTracing<LinkedHashSet<T, U, V>> { | 725 struct NeedsTracing<LinkedHashSet<T, U, V>> { |
727 static const bool value = false; | 726 static const bool value = false; |
728 }; | 727 }; |
729 #endif | 728 #endif |
730 | 729 |
731 } | 730 } |
732 | 731 |
733 using WTF::LinkedHashSet; | 732 using WTF::LinkedHashSet; |
734 | 733 |
735 #endif /* WTF_LinkedHashSet_h */ | 734 #endif /* WTF_LinkedHashSet_h */ |
OLD | NEW |