| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2005, 2006, 2008 Apple Inc. All rights reserved. | 2 * Copyright (C) 2005, 2006, 2008 Apple Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * This library is free software; you can redistribute it and/or | 4 * This library is free software; you can redistribute it and/or |
| 5 * modify it under the terms of the GNU Library General Public | 5 * modify it under the terms of the GNU Library General Public |
| 6 * License as published by the Free Software Foundation; either | 6 * License as published by the Free Software Foundation; either |
| 7 * version 2 of the License, or (at your option) any later version. | 7 * version 2 of the License, or (at your option) any later version. |
| 8 * | 8 * |
| 9 * This library is distributed in the hope that it will be useful, | 9 * This library is distributed in the hope that it will be useful, |
| 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| (...skipping 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 74 iterator begin() { return m_impl.begin(); } | 74 iterator begin() { return m_impl.begin(); } |
| 75 iterator end() { return m_impl.end(); } | 75 iterator end() { return m_impl.end(); } |
| 76 const_iterator begin() const { return m_impl.begin(); } | 76 const_iterator begin() const { return m_impl.begin(); } |
| 77 const_iterator end() const { return m_impl.end(); } | 77 const_iterator end() const { return m_impl.end(); } |
| 78 | 78 |
| 79 iterator find(const ValueType& value) { return m_impl.find(value); } | 79 iterator find(const ValueType& value) { return m_impl.find(value); } |
| 80 const_iterator find(const ValueType& value) const { | 80 const_iterator find(const ValueType& value) const { |
| 81 return m_impl.find(value); | 81 return m_impl.find(value); |
| 82 } | 82 } |
| 83 bool contains(const ValueType& value) const { return m_impl.contains(value); } | 83 bool contains(const ValueType& value) const { return m_impl.contains(value); } |
| 84 unsigned count(const ValueType& value) const { return m_impl.get(value); } | 84 unsigned count(const ValueType& value) const { return m_impl.at(value); } |
| 85 | 85 |
| 86 // Increases the count if an equal value is already present the return value | 86 // Increases the count if an equal value is already present the return value |
| 87 // is a pair of an iterator to the new value's location, and a bool that is | 87 // is a pair of an iterator to the new value's location, and a bool that is |
| 88 // true if an new entry was added. | 88 // true if an new entry was added. |
| 89 AddResult add(const ValueType&); | 89 AddResult add(const ValueType&); |
| 90 | 90 |
| 91 // Generalized add(), adding the value N times. | 91 // Generalized add(), adding the value N times. |
| 92 AddResult add(const ValueType&, unsigned); | 92 AddResult add(const ValueType&, unsigned); |
| 93 | 93 |
| 94 // Reduces the count of the value, and removes it if count goes down to | 94 // Reduces the count of the value, and removes it if count goes down to |
| (...skipping 84 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 179 Vector<T> vector; | 179 Vector<T> vector; |
| 180 copyToVector(*this, vector); | 180 copyToVector(*this, vector); |
| 181 return vector; | 181 return vector; |
| 182 } | 182 } |
| 183 | 183 |
| 184 } // namespace WTF | 184 } // namespace WTF |
| 185 | 185 |
| 186 using WTF::HashCountedSet; | 186 using WTF::HashCountedSet; |
| 187 | 187 |
| 188 #endif // WTF_HashCountedSet_h | 188 #endif // WTF_HashCountedSet_h |
| OLD | NEW |