Roll to pickup pool changes

packages/csslib/lib/src/analyzer.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 csslib.parser;
 
 // TODO(terry): Add optimizing phase to remove duplicated selectors in the same
 //              selector group (e.g., .btn, .btn { color: red; }).  Also, look
 //              at simplifying selectors expressions too (much harder).
 // TODO(terry): Detect invalid directive usage.  All @imports must occur before
@@ skipping 204 matching lines @@
 
     // Remove nested rules; they're all flatten and in the _expandedRuleSets.
     node.declarationGroup.declarations
         .removeWhere((declaration) => declaration is RuleSet);
 
     _nestedSelectorGroup = oldNestedSelectorGroups;
 
     // If any expandedRuleSets and we're back at the top-level rule set then
     // there were nested rule set(s).
     if (_parentRuleSet == null) {
-      if (!_expandedRuleSets.isEmpty) {
+      if (_expandedRuleSets.isNotEmpty) {
         // Remember ruleset to replace with these flattened rulesets.
         _expansions[node] = _expandedRuleSets;
         _expandedRuleSets = [];
       }
       assert(_flatDeclarationGroup == null);
       assert(_nestedSelectorGroup == null);
     }
   }
 
   /**
@@ skipping 35 matching lines @@
     if (!hasThis) {
       // If no & in the sector group then prefix with the parent selector.
       newSequence.addAll(parent);
       newSequence.addAll(_convertToDescendentSequence(current));
     } else {
       for (var sequence in current) {
         if (sequence.simpleSelector.isThis) {
           // Substitue the & with the parent selector and only use a combinator
           // descendant if & is prefix by a sequence with an empty name e.g.,
           // "... + &", "&", "... ~ &", etc.
-          var hasPrefix = !newSequence.isEmpty &&
-              !newSequence.last.simpleSelector.name.isEmpty;
+          var hasPrefix = newSequence.isNotEmpty &&
+              newSequence.last.simpleSelector.name.isNotEmpty;
           newSequence.addAll(
               hasPrefix ? _convertToDescendentSequence(parent) : parent);
         } else {
           newSequence.add(sequence);
         }
       }
     }
 
     return newSequence;
   }
@@ skipping 606 matching lines @@
   }
 }
 
 /** Find all @extend to create inheritance. */
 class AllExtends extends Visitor {
   final Map<String, List<SelectorGroup>> inherits =
       new Map<String, List<SelectorGroup>>();
 
   SelectorGroup _currSelectorGroup;
   int _currDeclIndex;
-  List<int> _extendsToRemove = [];
+  final List<int> _extendsToRemove = [];
 
   void visitRuleSet(RuleSet node) {
     var oldSelectorGroup = _currSelectorGroup;
     _currSelectorGroup = node.selectorGroup;
 
     super.visitRuleSet(node);
 
     _currSelectorGroup = oldSelectorGroup;
   }
 
@@ skipping 84 matching lines @@
             isLastNone = false;
           }
         } else {
           isLastNone = simpleSeq.isCombinatorNone;
         }
       }
     }
     super.visitSelectorGroup(node);
   }
 }