OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 147 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
158 void ResizeAddInternal(const T& element); | 158 void ResizeAddInternal(const T& element); |
159 | 159 |
160 // Resize the list. | 160 // Resize the list. |
161 void Resize(int new_capacity); | 161 void Resize(int new_capacity); |
162 | 162 |
163 DISALLOW_COPY_AND_ASSIGN(List); | 163 DISALLOW_COPY_AND_ASSIGN(List); |
164 }; | 164 }; |
165 | 165 |
166 class Map; | 166 class Map; |
167 class Code; | 167 class Code; |
| 168 template<typename T> class Handle; |
168 typedef List<Map*> MapList; | 169 typedef List<Map*> MapList; |
169 typedef List<Code*> CodeList; | 170 typedef List<Code*> CodeList; |
| 171 typedef List<Handle<Map> > MapHandleList; |
| 172 typedef List<Handle<Code> > CodeHandleList; |
170 | 173 |
171 // Perform binary search for an element in an already sorted | 174 // Perform binary search for an element in an already sorted |
172 // list. Returns the index of the element of -1 if it was not found. | 175 // list. Returns the index of the element of -1 if it was not found. |
173 template <typename T> | 176 template <typename T> |
174 int SortedListBSearch( | 177 int SortedListBSearch( |
175 const List<T>& list, T elem, int (*cmp)(const T* x, const T* y)); | 178 const List<T>& list, T elem, int (*cmp)(const T* x, const T* y)); |
176 template <typename T> | 179 template <typename T> |
177 int SortedListBSearch(const List<T>& list, T elem); | 180 int SortedListBSearch(const List<T>& list, T elem); |
178 | 181 |
| 182 // Unwraps each handle in the source list to a pointer at |
| 183 // the corresponding position in the destination list. |
| 184 // Returns the destination list. |
| 185 // Both list must have the same length. |
| 186 |
| 187 template <class T> |
| 188 List<T*>* UnwrapHandleList(List<T*>* destination, List<Handle<T> >* source); |
| 189 |
| 190 |
179 } } // namespace v8::internal | 191 } } // namespace v8::internal |
180 | 192 |
181 | 193 |
182 #endif // V8_LIST_H_ | 194 #endif // V8_LIST_H_ |
OLD | NEW |