| Index: src/list.h
|
| diff --git a/src/list.h b/src/list.h
|
| index ed54c0d1a74a346481d8d21d8fab46e874ff23ae..ca833cc3ceaba8b91dc6b5aec3e3550dd2bd7e75 100644
|
| --- a/src/list.h
|
| +++ b/src/list.h
|
| @@ -206,13 +206,13 @@ size_t GetMemoryUsedByList(const List<T, P>& list) {
|
| class Map;
|
| template<class> class TypeImpl;
|
| class HeapTypeConfig;
|
| -typedef TypeImpl<HeapTypeConfig> Type;
|
| +typedef TypeImpl<HeapTypeConfig> HeapType;
|
| class Code;
|
| template<typename T> class Handle;
|
| typedef List<Map*> MapList;
|
| typedef List<Code*> CodeList;
|
| typedef List<Handle<Map> > MapHandleList;
|
| -typedef List<Handle<Type> > TypeHandleList;
|
| +typedef List<Handle<HeapType> > TypeHandleList;
|
| typedef List<Handle<Code> > CodeHandleList;
|
|
|
| // Perform binary search for an element in an already sorted
|
|
|