Updated charted DEP to 0.4.X

packages/charted/lib/layout/src/treemap_layout.dart

 /*
  * Copyright 2015 Google Inc. All rights reserved.
  *
  * Use of this source code is governed by a BSD-style
  * license that can be found in the LICENSE file or at
  * https://developers.google.com/open-source/licenses/bsd
  */
 part of charted.layout;
 
 /// PaddingFunction takes a node and generates the padding for the particular
 /// node
 typedef List PaddingFunction(TreeMapNode node);
 
 /**
  * Utility layout class which recursively subdivides area into rectangles which
  * can be used to quickly visualize the size of any node in the tree.
  */
-class TreeMapLayout extends HierarchyLayout {
+class TreeMapLayout extends HierarchyLayout<TreeMapNode> {
   /// Rectangular subdivision; squareness controlled via the target ratio.
   static const TREEMAP_LAYOUT_SQUARIFY = 0;
 
   /// Horizontal subdivision.
   static const TREEMAP_LAYOUT_SLICE = 1;
 
   /// Vertical subdivision.
   static const TREEMAP_LAYOUT_DICE = 2;
 
   /// Alternating between horizontal and vertical subdivision.
@@ skipping 127 matching lines @@
   }
 
   /// Recursively compute each nodes (and its children nodes) position and size
   /// base on the node's property and layout mode.
   void _squarify(TreeMapNode node) {
     var children = node.children;
     if (children.isNotEmpty) {
       var rect = _treeMapPad(node, paddingFunction(node));
       List<TreeMapNode> nodes = [];
       var area = 0;
-      var remaining = new List.from(children);
+      var remaining = new List<TreeMapNode>.from(children);
       var score,
           n,
           best = double.INFINITY,
           length = (mode == TREEMAP_LAYOUT_SLICE)
               ? rect.width
               : (mode == TREEMAP_LAYOUT_DICE)
                   ? rect.height
                   : (mode == TREEMAP_LAYOUT_SLICE_DICE)
                       ? (node.depth & 1 == 1) ? rect.height : rect.width
                       : math.min(rect.width, rect.height);
@@ skipping 19 matching lines @@
         _position(nodes, length, rect, true, area);
         nodes.clear();
         area = 0;
       }
       children.forEach(_squarify);
     }
   }
 }
 
 class TreeMapNode extends HierarchyNode {
+  final List<TreeMapNode> children = <TreeMapNode>[];
+
   /// The minimum x-coordinate of the node position.
   num x = 0;
 
   /// The minimum y-coordinate of the node position.
   num y = 0;
 
   /// The x-extent of the node position.
   num dx = 0;
 
   /// The y-extent of the node position.
   num dy = 0;
 
   /// The area the node should take up.
   num area = 0;
 
   /// Attribute for the last node in the row, only used for sticky layout.
   bool sticky = false;
 }