Fix bug in internal SplayTreeIterator constructor.

sdk/lib/collection/splay_tree.dart

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 part of dart.collection;
 
 typedef bool _Predicate<T>(T value);
 
 /**
  * A node in a splay tree. It holds the sorting key and the left
@@ skipping 507 matching lines @@
         _modificationCount = tree._modificationCount,
         _splayCount = tree._splayCount {
     _findLeftMostDescendent(tree._root);
   }
 
   _SplayTreeIterator.startAt(_SplayTree tree, var startKey)
       : _tree = tree,
         _modificationCount = tree._modificationCount {
     int compare = tree._splay(startKey);
     _splayCount = tree._splayCount;
-    _findLeftMostDescendent(compare < 0 ? tree._root.right : tree._root);
+    if (compare < 0) {
+      // Don't include the root, start at the next element after the root.
+      _findLeftMostDescendent(tree._root.right);
+    } else {
+      _workList.add(tree._root);
+    }
   }
 
   T get current {
     if (_currentNode == null) return null;
     return _getValue(_currentNode);
   }
 
-  _SplayTreeNode _findStartNode(T key) {
-
-  }
-
   void _findLeftMostDescendent(_SplayTreeNode node) {
     while (node != null) {
       _workList.add(node);
       node = node.left;
     }
   }
 
   /**
    * Called when the tree structure of the tree has changed.
    *
@@ skipping 267 matching lines @@
 
   bool containsAll(Iterable<Object> other) {
     for (var element in other) {
       if (!this.contains(element)) return false;
     }
     return true;
   }
 
   void clear() { _clear(); }
 }