OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2012 Google Inc. | 2 * Copyright 2012 Google Inc. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
6 */ | 6 */ |
7 | 7 |
8 #ifndef SkTSet_DEFINED | 8 #ifndef SkTSet_DEFINED |
9 #define SkTSet_DEFINED | 9 #define SkTSet_DEFINED |
10 | 10 |
(...skipping 181 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
192 */ | 192 */ |
193 void rewind() { | 193 void rewind() { |
194 SkASSERT(fSetArray); | 194 SkASSERT(fSetArray); |
195 SkASSERT(fOrderedArray); | 195 SkASSERT(fOrderedArray); |
196 fSetArray->rewind(); | 196 fSetArray->rewind(); |
197 fOrderedArray->rewind(); | 197 fOrderedArray->rewind(); |
198 } | 198 } |
199 | 199 |
200 /** Reserves memory for the set. | 200 /** Reserves memory for the set. |
201 */ | 201 */ |
202 void setReserve(size_t reserve) { | 202 void setReserve(int reserve) { |
203 SkASSERT(fSetArray); | 203 SkASSERT(fSetArray); |
204 SkASSERT(fOrderedArray); | 204 SkASSERT(fOrderedArray); |
205 fSetArray->setReserve(reserve); | 205 fSetArray->setReserve(reserve); |
206 fOrderedArray->setReserve(reserve); | 206 fOrderedArray->setReserve(reserve); |
207 } | 207 } |
208 | 208 |
209 /** Returns true if the array contains this element. | 209 /** Returns true if the array contains this element. |
210 */ | 210 */ |
211 bool contains(const T& elem) const { | 211 bool contains(const T& elem) const { |
212 SkASSERT(fSetArray); | 212 SkASSERT(fSetArray); |
(...skipping 134 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
347 } else { | 347 } else { |
348 *posToInsertSorted = iMin + 1; | 348 *posToInsertSorted = iMin + 1; |
349 } | 349 } |
350 } | 350 } |
351 | 351 |
352 return -1; | 352 return -1; |
353 } | 353 } |
354 }; | 354 }; |
355 | 355 |
356 #endif | 356 #endif |
OLD | NEW |