A change in the way we place TransitionElementKinds in the tree.

src/objects.h

Index: src/objects.h
diff --git a/src/objects.h b/src/objects.h
index 59b781b1c2470a738f1dbb5e7920e62ed1a46951..5ae7399056acd4ec01e350991e7a8956da149cf0 100644
--- a/src/objects.h
+++ b/src/objects.h
@@ -4731,6 +4731,10 @@ class Code: public HeapObject {
 };
 
 
+MaybeObject* AddMissingElementsTransitions(Map* map, ElementsKind to_kind);
+Map* FindClosestElementsTransition(Map* map, ElementsKind to_kind);
+
+
 // All heap objects have a Map that describes their structure.
 //  A Map contains information about:
 //  - Size information about the object
@@ -5150,7 +5154,6 @@ class Map: public HeapObject {
   // elements_kind that's found in |candidates|, or null handle if no match is
   // found at all.
   Handle<Map> FindTransitionedMap(MapHandleList* candidates);
-  Map* FindTransitionedMap(MapList* candidates);
 
   // Zaps the contents of backing data structures. Note that the
   // heap verifier (i.e. VerifyMarkingVisitor) relies on zapping of objects