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 #include "src/platform.h" | 9 |
| 10 #include "src/base/platform/platform.h" |
10 | 11 |
11 namespace v8 { | 12 namespace v8 { |
12 namespace internal { | 13 namespace internal { |
13 | 14 |
14 | 15 |
15 template<typename T, class P> | 16 template<typename T, class P> |
16 void List<T, P>::Add(const T& element, P alloc) { | 17 void List<T, P>::Add(const T& element, P alloc) { |
17 if (length_ < capacity_) { | 18 if (length_ < capacity_) { |
18 data_[length_++] = element; | 19 data_[length_++] = element; |
19 } else { | 20 } else { |
(...skipping 231 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
251 | 252 |
252 template <typename T> | 253 template <typename T> |
253 int SortedListBSearch(const List<T>& list, T elem) { | 254 int SortedListBSearch(const List<T>& list, T elem) { |
254 return SortedListBSearch<T, ElementCmp<T> > (list, ElementCmp<T>(elem)); | 255 return SortedListBSearch<T, ElementCmp<T> > (list, ElementCmp<T>(elem)); |
255 } | 256 } |
256 | 257 |
257 | 258 |
258 } } // namespace v8::internal | 259 } } // namespace v8::internal |
259 | 260 |
260 #endif // V8_LIST_INL_H_ | 261 #endif // V8_LIST_INL_H_ |
OLD | NEW |