Use SortedListBSearch instead of custom one in heap profiler

src/list.h

 // Copyright 2011 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 155 matching lines @@
 class Map;
 class Code;
 template<typename T> class Handle;
 typedef List<Map*> MapList;
 typedef List<Code*> CodeList;
 typedef List<Handle<Map> > MapHandleList;
 typedef List<Handle<Code> > CodeHandleList;
 
 // Perform binary search for an element in an already sorted
 // list. Returns the index of the element of -1 if it was not found.
-template <typename T>
-int SortedListBSearch(
-    const List<T>& list, T elem, int (*cmp)(const T* x, const T* y));
+template <typename T, typename P>
+int SortedListBSearch(const List<T>& list, P cmp);

[mnaganov (inactive), 2012/04/10 09:30:55]

I think, some words of comments need to be added about the comparator functor.

And should it be 'class P' instead of 'typename P'? There is no syntax
difference, but you don't expect primitive types as the second template
argument, do you?

[yurys, 2012/04/10 09:42:34]

Done.
Fixed. In theory it may be a function but this is unlikely.

 template <typename T>
 int SortedListBSearch(const List<T>& list, T elem);
 
 
 } }  // namespace v8::internal
 
 
 #endif  // V8_LIST_H_