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 SkTLList_DEFINED | 8 #ifndef SkTLList_DEFINED |
9 #define SkTLList_DEFINED | 9 #define SkTLList_DEFINED |
10 | 10 |
(...skipping 180 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
191 | 191 |
192 public: | 192 public: |
193 typedef typename INHERITED::IterStart IterStart; | 193 typedef typename INHERITED::IterStart IterStart; |
194 //!< Start the iterator at the head of the list. | 194 //!< Start the iterator at the head of the list. |
195 static const IterStart kHead_IterStart = INHERITED::kHead_IterStart; | 195 static const IterStart kHead_IterStart = INHERITED::kHead_IterStart; |
196 //!< Start the iterator at the tail of the list. | 196 //!< Start the iterator at the tail of the list. |
197 static const IterStart kTail_IterStart = INHERITED::kTail_IterStart; | 197 static const IterStart kTail_IterStart = INHERITED::kTail_IterStart; |
198 | 198 |
199 Iter() {} | 199 Iter() {} |
200 | 200 |
201 Iter(const SkTLList& list, IterStart start = kHead_IterStart) { | 201 Iter(const SkTLList& list, IterStart start) { |
202 INHERITED::init(list.fList, start); | 202 INHERITED::init(list.fList, start); |
203 } | 203 } |
204 | 204 |
205 T* init(const SkTLList& list, IterStart start = kHead_IterStart) { | 205 T* init(const SkTLList& list, IterStart start) { |
206 return this->nodeToObj(INHERITED::init(list.fList, start)); | 206 return this->nodeToObj(INHERITED::init(list.fList, start)); |
207 } | 207 } |
208 | 208 |
209 T* get() { return this->nodeToObj(INHERITED::get()); } | 209 T* get() { return this->nodeToObj(INHERITED::get()); } |
210 | 210 |
211 T* next() { return this->nodeToObj(INHERITED::next()); } | 211 T* next() { return this->nodeToObj(INHERITED::next()); } |
212 | 212 |
213 T* prev() { return this->nodeToObj(INHERITED::prev()); } | 213 T* prev() { return this->nodeToObj(INHERITED::prev()); } |
214 | 214 |
215 Iter& operator= (const Iter& iter) { INHERITED::operator=(iter); return
*this; } | 215 Iter& operator= (const Iter& iter) { INHERITED::operator=(iter); return
*this; } |
(...skipping 178 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
394 #define SkNEW_INSERT_IN_LLIST_AFTER(list, location, type_name, args) \ | 394 #define SkNEW_INSERT_IN_LLIST_AFTER(list, location, type_name, args) \ |
395 (new ((list), SkTLList< type_name >::kAfter_Placement, (location)) type_name
args) | 395 (new ((list), SkTLList< type_name >::kAfter_Placement, (location)) type_name
args) |
396 | 396 |
397 #define SkNEW_INSERT_AT_LLIST_HEAD(list, type_name, args) \ | 397 #define SkNEW_INSERT_AT_LLIST_HEAD(list, type_name, args) \ |
398 SkNEW_INSERT_IN_LLIST_BEFORE((list), (list)->headIter(), type_name, args) | 398 SkNEW_INSERT_IN_LLIST_BEFORE((list), (list)->headIter(), type_name, args) |
399 | 399 |
400 #define SkNEW_INSERT_AT_LLIST_TAIL(list, type_name, args) \ | 400 #define SkNEW_INSERT_AT_LLIST_TAIL(list, type_name, args) \ |
401 SkNEW_INSERT_IN_LLIST_AFTER((list), (list)->tailIter(), type_name, args) | 401 SkNEW_INSERT_IN_LLIST_AFTER((list), (list)->tailIter(), type_name, args) |
402 | 402 |
403 #endif | 403 #endif |
OLD | NEW |