Rename fletch -> dartino

pkg/dartino_compiler/lib/src/dynamic_call_enqueuer.dart

 // Copyright (c) 2015, the Dartino 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.md file.
 
-library fletchc.dynamic_call_enqueuer;
+library dartino_compiler.dynamic_call_enqueuer;
 
 import 'dart:collection' show
     Queue;
 
 import 'package:compiler/src/universe/selector.dart' show
     Selector;
 
 import 'package:compiler/src/universe/use.dart' show
     DynamicUse;
 
@@ skipping 10 matching lines @@
     MemberElement,
     Name;
 
 import 'package:compiler/src/common/names.dart' show
     Identifiers,
     Names;
 
 import 'package:compiler/src/util/util.dart' show
     Hashing;
 
-import 'fletch_compiler_implementation.dart' show
-    FletchCompilerImplementation;
+import 'dartino_compiler_implementation.dart' show
+    DartinoCompilerImplementation;
 
-import 'fletch_enqueuer.dart' show
+import 'dartino_enqueuer.dart' show
     shouldReportEnqueuingOfElement;
 
-import 'fletch_registry.dart' show
+import 'dartino_registry.dart' show
     ClosureKind;
 
 abstract class UsageRecorder {
   void recordElementUsage(Element element, Selector selector);
 
   void recordClosurizationUsage(Closurization closurization, Selector selector);
 
   void recordTypeTest(ClassElement element, InterfaceType type);
 }
 
 /// Implements the dynamic part of the tree-shaking algorithm.
 ///
 /// By "dynamic" part we mean the part that is about matching instantiated
 /// classes with called instance methods.
 class DynamicCallEnqueuer {
-  final FletchCompilerImplementation compiler;
+  final DartinoCompilerImplementation compiler;
 
   final Set<ClassElement> instantiatedClasses = new Set<ClassElement>();
 
   final Queue<ClassElement> pendingInstantiatedClasses =
       new Queue<ClassElement>();
 
   final Set<Selector> enqueuedSelectors = new Set<Selector>();
 
   final Queue<Selector> pendingSelectors = new Queue<Selector>();
 
@@ skipping 158 matching lines @@
     if (element.isInstanceMember) {
       ClassElement modifiedClass = element.enclosingClass;
       revisitClass(modifiedClass);
       MemberElement member = element;
       for (ClassElement cls in instantiatedClasses) {
         // TODO(ahe): Make O(1).
         if (cls.lookupByName(member.memberName) == member) {
           revisitClass(cls);
           // Once we have found one class that implements [member], we're
           // done. When we later call [enqueueInstanceMethods] (via
-          // [FletchEnqueuer.processQueue]) the method will be enqueued again
+          // [DartinoEnqueuer.processQueue]) the method will be enqueued again
           // (if it exists).
           break;
         }
       }
     }
     List<Closurization> toBeRemoved = <Closurization>[];
     for (Closurization closurization in implicitClosurizations) {
       if (closurization.function == element) {
         toBeRemoved.add(closurization);
       }
@@ skipping 40 matching lines @@
         kind = kind,
         hashCode = Hashing.mixHashCodeBits(function.hashCode, kind.hashCode);
 
   bool operator ==(other) {
     return other is Closurization &&
         function == other.function && kind == other.kind;
   }
 
   String toString() => "Closurization($function, $kind)";
 }