Fix for translation of \!= to \!identical(), but use == and \!= for Enum.

pkg/analyzer/lib/src/generated/utilities_collection.dart

 // Copyright (c) 2014, 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.
 
 // This code was auto-generated, is not intended to be edited, and is subject to
 // significant change. Please see the README file for more information.
 
 library engine.utilities.collection;
 
 import 'java_core.dart';
@@ skipping 318 matching lines @@
 }
 
 /**
  * Instances of the class `SccFinder` implement Tarjan's Algorithm for finding the strongly
  * connected components in a graph.
  */
 class DirectedGraph_SccFinder<N> {
   /**
    * The graph to work with.
    */
-  DirectedGraph<N> _graph;
+  final DirectedGraph<N> _graph;
 
   /**
    * The index used to uniquely identify the depth of nodes.
    */
   int _index = 0;
 
   /**
    * The stack of nodes that are being visited in order to identify components.
    */
   List<N> _stack = new List<N>();
 
   /**
    * A table mapping nodes to information about the nodes that is used by this algorithm.
    */
   Map<N, DirectedGraph_NodeInfo<N>> _nodeMap = new Map<N, DirectedGraph_NodeInfo<N>>();
 
   /**
    * Initialize a newly created finder.
    */
-  DirectedGraph_SccFinder(DirectedGraph<N> graph) : super() {
-    this._graph = graph;
-  }
+  DirectedGraph_SccFinder(this._graph) : super();
 
   /**
    * Return a list containing the nodes that are part of the strongly connected component that
    * contains the given node.
    *
    * @param node the node used to identify the strongly connected component to be returned
    * @return the nodes that are part of the strongly connected component that contains the given
    *         node
    */
   List<N> componentContaining(N node) => _strongConnect(node).component;
@@ skipping 53 matching lines @@
     //
     // If v is a root node, pop the stack and generate an SCC
     //
     if (vInfo.lowlink == vInfo.index) {
       List<N> component = new List<N>();
       N w;
       do {
         w = _pop();
         component.add(w);
         _nodeMap[w].component = component;
-      } while (w != v);
+      } while (!identical(w, v));
     }
     return vInfo;
   }
 }
 
 /**
  * The class `ListUtilities` defines utility methods useful for working with [List
  ].
  */
 class ListUtilities {
   /**
    * Add all of the elements in the given array to the given list.
    *
    * @param list the list to which the elements are to be added
    * @param elements the elements to be added to the list
    */
   static void addAll(List list, List<Object> elements) {
     int count = elements.length;
     for (int i = 0; i < count; i++) {
       list.add(elements[i]);
     }
   }
 }