camelCase constants. Down with ALL_CAPS!

lib/src/nesting.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 dart_style.src.nesting;
 
 import 'chunk.dart';
 import 'line_splitter.dart';
 
 /// Maintains a stack of nested expressions that have currently been split.
@@ skipping 129 matching lines @@
     // though LineSplitter._findBestSplits() will early out of looping over
     // them. Optimize by generating these only as needed.
 
     // Going deeper, so try every indentating for every subset of expression
     // nesting levels between the old and new one.
     return _intermediateDepths(_depth, split.nesting).map((depths) {
       var result = this;
 
       for (var depth in depths) {
         result = new NestingStack._(
-            result, depth, result.indent + INDENTS_PER_NEST);
+            result, depth, result.indent + indentsPerNest);
       }
 
       return new NestingStack._(
-          result, split.nesting, result.indent + INDENTS_PER_NEST);
+          result, split.nesting, result.indent + indentsPerNest);
     }).toList();
   }
 
   /// Given [min] and [max], generates all of the subsets of numbers in that
   /// range (exclusive), including the empty set.
   ///
   /// This is used for determine what sets of intermediate nesting levels to
   /// consider when jumping from a shallow nesting level to a much deeper one.
   /// Subsets are generated in order of increasing length. For example, `(2, 6)`
   /// yields:
@@ skipping 41 matching lines @@
     var nesting = this;
     var levels = [];
     while (nesting != null) {
       levels.add("${nesting._depth}:${nesting.indent}");
       nesting = nesting._parent;
     }
 
     return levels.join(" ");
   }
 }