Make Iterable.toSet say that it returns a Set with the same equality as the Iterable's contains met…

sdk/lib/collection/splay_tree.dart

Index: sdk/lib/collection/splay_tree.dart
diff --git a/sdk/lib/collection/splay_tree.dart b/sdk/lib/collection/splay_tree.dart
index ccd56365c9880217497b43354b464ca81510e315..44457ccc830e34538b238131b35092516d4c8758 100644
--- a/sdk/lib/collection/splay_tree.dart
+++ b/sdk/lib/collection/splay_tree.dart
@@ -597,6 +597,13 @@ class _SplayTreeKeyIterable<K> extends IterableBase<K>
   int get length => _tree._count;
   bool get isEmpty => _tree._count == 0;
   Iterator<K> get iterator => new _SplayTreeKeyIterator<K>(_tree);
+  Set<K> toSet() {
+    SplayTreeSet<K> set =
+        new SplayTreeSet<K>(_tree._comparator, _tree._validKey);
+    set._count = _tree._count;
+    set._root = set._copyNode(_tree._root);
+    return set;
+  }
 }
 
 class _SplayTreeValueIterable<K, V> extends IterableBase<V>
@@ -779,14 +786,16 @@ class SplayTreeSet<E> extends _SplayTree<E> with IterableMixin<E>, SetMixin<E> {
   SplayTreeSet<E> _clone() {
     var set = new SplayTreeSet<E>(_comparator, _validKey);
     set._count = _count;
-    set._root = _cloneNode(_root);
+    set._root = _copyNode(_root);
     return set;
   }
 
-  _SplayTreeNode<E> _cloneNode(_SplayTreeNode<E> node) {
+  // Copies the structure of a SplayTree into a new similar structure.
+  // Works on _SplayTreeMapNode as well, but only copies the keys,
+  _SplayTreeNode<E> _copyNode(_SplayTreeNode<E> node) {
     if (node == null) return null;
-    return new _SplayTreeNode<E>(node.key)..left = _cloneNode(node.left)
-                                          ..right = _cloneNode(node.right);
+    return new _SplayTreeNode<E>(node.key)..left = _copyNode(node.left)
+                                          ..right = _copyNode(node.right);
   }
 
   void clear() { _clear(); }