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" |
(...skipping 16 matching lines...) Expand all Loading... |
27 template<typename T, class P> | 27 template<typename T, class P> |
28 void List<T, P>::AddAll(const List<T, P>& other, P alloc) { | 28 void List<T, P>::AddAll(const List<T, P>& other, P alloc) { |
29 AddAll(other.ToVector(), alloc); | 29 AddAll(other.ToVector(), alloc); |
30 } | 30 } |
31 | 31 |
32 | 32 |
33 template<typename T, class P> | 33 template<typename T, class P> |
34 void List<T, P>::AddAll(const Vector<T>& other, P alloc) { | 34 void List<T, P>::AddAll(const Vector<T>& other, P alloc) { |
35 int result_length = length_ + other.length(); | 35 int result_length = length_ + other.length(); |
36 if (capacity_ < result_length) Resize(result_length, alloc); | 36 if (capacity_ < result_length) Resize(result_length, alloc); |
37 if (base::is_fundamental<T>()) { | 37 if (std::is_fundamental<T>()) { |
38 memcpy(data_ + length_, other.start(), sizeof(*data_) * other.length()); | 38 memcpy(data_ + length_, other.start(), sizeof(*data_) * other.length()); |
39 } else { | 39 } else { |
40 for (int i = 0; i < other.length(); i++) data_[length_ + i] = other.at(i); | 40 for (int i = 0; i < other.length(); i++) data_[length_ + i] = other.at(i); |
41 } | 41 } |
42 length_ = result_length; | 42 length_ = result_length; |
43 } | 43 } |
44 | 44 |
45 | 45 |
46 // Use two layers of inlining so that the non-inlined function can | 46 // Use two layers of inlining so that the non-inlined function can |
47 // use the same implementation as the inlined version. | 47 // use the same implementation as the inlined version. |
(...skipping 235 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
283 template <typename T> | 283 template <typename T> |
284 int SortedListBSearch(const List<T>& list, T elem) { | 284 int SortedListBSearch(const List<T>& list, T elem) { |
285 return SortedListBSearch<T, ElementCmp<T> > (list, ElementCmp<T>(elem)); | 285 return SortedListBSearch<T, ElementCmp<T> > (list, ElementCmp<T>(elem)); |
286 } | 286 } |
287 | 287 |
288 | 288 |
289 } // namespace internal | 289 } // namespace internal |
290 } // namespace v8 | 290 } // namespace v8 |
291 | 291 |
292 #endif // V8_LIST_INL_H_ | 292 #endif // V8_LIST_INL_H_ |
OLD | NEW |