Rename Constant to ConstantValue and ConstExp to ConstantExpression.

sdk/lib/_internal/compiler/implementation/dart_backend/backend_ast_nodes.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.
 
 library backend_ast_nodes;
 
 import '../constants/values.dart' as values;
 import '../dart_types.dart' as types;
 import '../elements/elements.dart' as elements;
 import '../tree/tree.dart' as tree;
@@ skipping 326 matching lines @@
   final String name;
 
   elements.Element element;
 
   Identifier(this.name);
 
   bool get assignable => true;
 }
 
 class Literal extends Expression {
-  final values.PrimitiveConstant value;
+  final values.PrimitiveConstantValue value;
 
   Literal(this.value);
 }
 
 class LiteralList extends Expression {
   final bool isConst;
   final TypeAnnotation typeArgument;
   final List<Expression> values;
 
   LiteralList(this.values, { this.typeArgument, this.isConst: false });
@@ skipping 446 matching lines @@
         write(' : ');
         writeExp(e.elseExpression, EXPRESSION);
       });
     } else if (e is Identifier) {
       write(e.name);
     } else if (e is Literal) {
       if (e.value.isString) {
         writeStringLiteral(e);
       }
       else if (e.value.isDouble) {
-        double v = e.value.value;
+        double v = e.value.primitiveValue;
         if (v == double.INFINITY) {
           withPrecedence(MULTIPLICATIVE, () {
             write('1/0.0');
           });
         } else if (v == double.NEGATIVE_INFINITY) {
           withPrecedence(MULTIPLICATIVE, () {
             write('-1/0.0');
           });
         } else if (v.isNaN) {
           withPrecedence(MULTIPLICATIVE, () {
@@ skipping 460 matching lines @@
   ];
 
   static StringLiteralOutput analyzeStringLiteral(Expression node) {
     // TODO(sigurdm,kmillikin): This might be a bit too expensive. Benchmark.
     // Flatten the StringConcat tree.
     List parts = []; // Expression or int (char node)
     void collectParts(Expression e) {
       if (e is StringConcat) {
         e.expressions.forEach(collectParts);
       } else if (e is Literal && e.value.isString) {
-        for (int char in e.value.value) {
+        for (int char in e.value.primitiveValue) {
           parts.add(char);
         }
       } else {
         parts.add(e);
       }
     }
     collectParts(node);
 
     // We use a dynamic algorithm to compute the optimal way of printing
     // the string literal.
@@ skipping 229 matching lines @@
   final StringChunk previous;
   final tree.StringQuoting quoting;
   num cost;
 
   OpenStringChunk(this.previous, this.quoting, this.cost);
 
   StringChunk end(int endIndex) {
     return new StringChunk(previous, quoting, endIndex);
   }
 }