| OLD | NEW |
| 1 // Copyright 2006-2009 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2009 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef V8_LIST_INL_H_ | 5 #ifndef V8_LIST_INL_H_ |
| 6 #define V8_LIST_INL_H_ | 6 #define V8_LIST_INL_H_ |
| 7 | 7 |
| 8 #include "src/list.h" | 8 #include "src/list.h" |
| 9 | 9 |
| 10 #include "src/base/macros.h" | 10 #include "src/base/macros.h" |
| 11 #include "src/base/platform/platform.h" | 11 #include "src/base/platform/platform.h" |
| 12 #include "src/utils.h" |
| 12 | 13 |
| 13 namespace v8 { | 14 namespace v8 { |
| 14 namespace internal { | 15 namespace internal { |
| 15 | 16 |
| 16 | 17 |
| 17 template<typename T, class P> | 18 template<typename T, class P> |
| 18 void List<T, P>::Add(const T& element, P alloc) { | 19 void List<T, P>::Add(const T& element, P alloc) { |
| 19 if (length_ < capacity_) { | 20 if (length_ < capacity_) { |
| 20 data_[length_++] = element; | 21 data_[length_++] = element; |
| 21 } else { | 22 } else { |
| (...skipping 261 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 283 template <typename T> | 284 template <typename T> |
| 284 int SortedListBSearch(const List<T>& list, T elem) { | 285 int SortedListBSearch(const List<T>& list, T elem) { |
| 285 return SortedListBSearch<T, ElementCmp<T> > (list, ElementCmp<T>(elem)); | 286 return SortedListBSearch<T, ElementCmp<T> > (list, ElementCmp<T>(elem)); |
| 286 } | 287 } |
| 287 | 288 |
| 288 | 289 |
| 289 } // namespace internal | 290 } // namespace internal |
| 290 } // namespace v8 | 291 } // namespace v8 |
| 291 | 292 |
| 292 #endif // V8_LIST_INL_H_ | 293 #endif // V8_LIST_INL_H_ |
| OLD | NEW |