Left: | ||
Right: |
LEFT | RIGHT |
---|---|
1 /* | 1 /* |
2 * This file is part of Adblock Plus <https://adblockplus.org/>, | 2 * This file is part of Adblock Plus <https://adblockplus.org/>, |
3 * Copyright (C) 2006-2017 eyeo GmbH | 3 * Copyright (C) 2006-2017 eyeo GmbH |
4 * | 4 * |
5 * Adblock Plus is free software: you can redistribute it and/or modify | 5 * Adblock Plus is free software: you can redistribute it and/or modify |
6 * it under the terms of the GNU General Public License version 3 as | 6 * it under the terms of the GNU General Public License version 3 as |
7 * published by the Free Software Foundation. | 7 * published by the Free Software Foundation. |
8 * | 8 * |
9 * Adblock Plus is distributed in the hope that it will be useful, | 9 * Adblock Plus 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 215 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
226 const_iterator begin() const | 226 const_iterator begin() const |
227 { | 227 { |
228 return const_iterator(&mBuckets[0], &mBuckets[mBucketCount]); | 228 return const_iterator(&mBuckets[0], &mBuckets[mBucketCount]); |
229 } | 229 } |
230 | 230 |
231 const_iterator end() const | 231 const_iterator end() const |
232 { | 232 { |
233 return const_iterator(&mBuckets[mBucketCount], &mBuckets[mBucketCount]); | 233 return const_iterator(&mBuckets[mBucketCount], &mBuckets[mBucketCount]); |
234 } | 234 } |
235 | 235 |
236 size_type max_size() const | |
sergei
2017/04/12 12:04:31
What about capacity instead of max_size, though ma
Wladimir Palant
2017/04/13 13:04:39
Ouch, I misread what std::map::max_size() does. Th
| |
237 { | |
238 return mBucketCount; | |
239 } | |
240 | |
241 size_type size() const | 236 size_type size() const |
242 { | 237 { |
243 return mEntryCount; | 238 return mEntryCount; |
244 } | 239 } |
245 }; | 240 }; |
246 | 241 |
247 struct StringSetEntry | 242 struct StringSetEntry |
248 { | 243 { |
249 StringSetEntry() {} | 244 StringSetEntry() {} |
250 StringSetEntry(const String& key) | 245 StringSetEntry(const String& key) |
(...skipping 102 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
353 const_reference find(const String& key) const | 348 const_reference find(const String& key) const |
354 { | 349 { |
355 return super::find(key); | 350 return super::find(key); |
356 } | 351 } |
357 | 352 |
358 reference find(const String& key) | 353 reference find(const String& key) |
359 { | 354 { |
360 return reference(this, key, super::find_bucket(key)); | 355 return reference(this, key, super::find_bucket(key)); |
361 } | 356 } |
362 }; | 357 }; |
LEFT | RIGHT |