additional SDK fixes. This gets all of them, once we upgrade to new analyzer

tool/input_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 48 matching lines @@
    * Counter incremented whenever the tree structure changes.
    *
    * Used to detect that an in-place traversal cannot use
    * cached information that relies on the tree structure.
    */
   int _splayCount = 0;
 
   /** Comparison used to compare keys. */
   int _compare(K key1, K key2);
 
+  Comparator<K> get _comparator;
+
+  _Predicate<Object> get _validKey;
+
   /**
    * Perform the splay operation for the given key. Moves the node with
    * the given key to the top of the tree.  If no node has the given
    * key, the last node on the search path is moved to the top of the
    * tree. This is the simplified top-down splaying algorithm from:
    * "Self-adjusting Binary Search Trees" by Sleator and Tarjan.
    *
    * Returns the result of comparing the new root of the tree to [key].
    * Returns -1 if the table is empty.
    */
@@ skipping 748 matching lines @@
     return new _SplayTreeNode<E>(node.key)..left = _copyNode(node.left)
                                           ..right = _copyNode(node.right);
   }
 
   void clear() { _clear(); }
 
   Set<E> toSet() => _clone();
 
   String toString() => IterableBase.iterableToFullString(this, '{', '}');
 }