pkg/unittest: dartfmt

pkg/unittest/lib/src/iterable_matchers.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 unittest.matcher;
 
 /**
  * Returns a matcher which matches [Iterable]s in which all elements
  * match the given [matcher].
  */
@@ skipping 138 matching lines @@
     }
   }
 }
 
 /**
  * Returns a matcher which matches [Iterable]s whose elements match the matchers
  * in [expected], but not necessarily in the same order.
  *
  *  Note that this is `O(n^2)` and so should only be used on small objects.
  */
-Matcher unorderedMatches(Iterable expected) =>
-    new _UnorderedMatches(expected);
+Matcher unorderedMatches(Iterable expected) => new _UnorderedMatches(expected);
 
 class _UnorderedMatches extends Matcher {
   final List<Matcher> _expected;
 
   _UnorderedMatches(Iterable expected)
       : _expected = expected.map(wrapMatcher).toList();
 
   String _test(item) {
-    if (item is !Iterable) return 'not iterable';
+    if (item is! Iterable) return 'not iterable';
     item = item.toList();
 
     // Check the lengths are the same.
     if (_expected.length > item.length) {
       return 'has too few elements (${item.length} < ${_expected.length})';
     } else if (_expected.length < item.length) {
       return 'has too many elements (${item.length} > ${_expected.length})';
     }
 
     var matched = new List<bool>.filled(item.length, false);
@@ skipping 85 matching lines @@
       return mismatchDescription.
           add('has ').
           addDescriptionOf(matchState["actual"]).
           add(' which is not $_description ').
           addDescriptionOf(matchState["expected"]).
           add(' at index ${matchState["index"]}');
     }
   }
 }