Version 1.1.0-dev.5.2

dart/sdk/lib/_internal/compiler/implementation/js_backend/namer.dart

 // Copyright (c) 2011, 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 js_backend;
 
 /**
  * Assigns JavaScript identifiers to Dart variables, class-names and members.
  */
 class Namer implements ClosureNamer {
@@ skipping 1163 matching lines @@
     DartType type = constant.representedType;
     JavaScriptBackend backend = compiler.backend;
     String name = backend.rti.getRawTypeRepresentation(type);
     addIdentifier(name);
   }
 
   visitInterceptor(InterceptorConstant constant) {
     addRoot(constant.dispatchedType.element.name);
     add('methods');
   }
-
-  visitDummyReceiver(DummyReceiverConstant constant) {
-    add('dummy_receiver');
-  }
 }
 
 /**
  * Generates canonical hash values for [Constant]s.
  *
  * Unfortunately, [Constant.hashCode] is not stable under minor perturbations,
  * so it can't be used for generating names.  This hasher keeps consistency
  * between runs by basing hash values of the names of elements, rather than
  * their hashCodes.
  */
@@ skipping 57 matching lines @@
     JavaScriptBackend backend = compiler.backend;
     String name = backend.rti.getRawTypeRepresentation(type);
     return _hashString(4, name);
   }
 
   visitInterceptor(InterceptorConstant constant) {
     String typeName = constant.dispatchedType.element.name;
     return _hashString(5, typeName);
   }
 
-  visitDummyReceiver(DummyReceiverConstant constant) {
-    compiler.internalError(
-        'DummyReceiverConstant should never be named and never be subconstant');
-  }
-
   int _hashString(int hash, String s) {
     int length = s.length;
     hash = _combine(hash, length);
     // Increasing stride is O(log N) on large strings which are unlikely to have
     // many collisions.
     for (int i = 0; i < length; i += 1 + (i >> 2)) {
       hash = _combine(hash, s.codeUnitAt(i));
     }
     return hash;
   }
@@ skipping 111 matching lines @@
         if (!first) {
           sb.write('_');
         }
         sb.write('_');
         visit(link.head);
         first = true;
       }
     }
   }
 }