| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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_H_ | 5 #ifndef V8_LIST_H_ |
| 6 #define V8_LIST_H_ | 6 #define V8_LIST_H_ |
| 7 | 7 |
| 8 #include "src/checks.h" |
| 8 #include "src/utils.h" | 9 #include "src/utils.h" |
| 9 | 10 |
| 10 namespace v8 { | 11 namespace v8 { |
| 11 namespace internal { | 12 namespace internal { |
| 12 | 13 |
| 13 template<typename T> class Vector; | 14 template<typename T> class Vector; |
| 14 | 15 |
| 15 // ---------------------------------------------------------------------------- | 16 // ---------------------------------------------------------------------------- |
| 16 // The list is a template for very light-weight lists. We are not | 17 // The list is a template for very light-weight lists. We are not |
| 17 // using the STL because we want full control over space and speed of | 18 // using the STL because we want full control over space and speed of |
| (...skipping 187 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 205 template <typename T, class P> | 206 template <typename T, class P> |
| 206 int SortedListBSearch(const List<T>& list, P cmp); | 207 int SortedListBSearch(const List<T>& list, P cmp); |
| 207 template <typename T> | 208 template <typename T> |
| 208 int SortedListBSearch(const List<T>& list, T elem); | 209 int SortedListBSearch(const List<T>& list, T elem); |
| 209 | 210 |
| 210 | 211 |
| 211 } } // namespace v8::internal | 212 } } // namespace v8::internal |
| 212 | 213 |
| 213 | 214 |
| 214 #endif // V8_LIST_H_ | 215 #endif // V8_LIST_H_ |
| OLD | NEW |