TransitionArray::Search() now returns insertion index if the entry was not found.

src/objects.h

Index: src/objects.h
diff --git a/src/objects.h b/src/objects.h
index 0f2cfc0f11cf469aed61169d24892a25dca0234e..d12896fb94d8d1aa2b0dce522c819f59dd3905e3 100644
--- a/src/objects.h
+++ b/src/objects.h
@@ -3145,12 +3145,9 @@ class DescriptorArray: public FixedArray {
 
 enum SearchMode { ALL_ENTRIES, VALID_ENTRIES };
 
-template<SearchMode search_mode, typename T>
-inline int LinearSearch(T* array, Name* name, int len, int valid_entries);
-
-
-template<SearchMode search_mode, typename T>
-inline int Search(T* array, Name* name, int valid_entries = 0);
+template <SearchMode search_mode, typename T>
+inline int Search(T* array, Name* name, int valid_entries = 0,
+                  int* out_insertion_index = NULL);
 
 
 // HashTable is a subclass of FixedArray that implements a hash table