OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2015 Google Inc. All rights reserved. | 2 * Copyright 2015 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style | 4 * Use of this source code is governed by a BSD-style |
5 * license that can be found in the LICENSE file or at | 5 * license that can be found in the LICENSE file or at |
6 * https://developers.google.com/open-source/licenses/bsd | 6 * https://developers.google.com/open-source/licenses/bsd |
7 */ | 7 */ |
8 part of charted.layout; | 8 part of charted.layout; |
9 | 9 |
10 typedef int SortFunction(HierarchyNode a, HierarchyNode b); | 10 typedef int SortFunction(HierarchyNode a, HierarchyNode b); |
(...skipping 73 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
84 | 84 |
85 /// The label to show for each block of hierarchy | 85 /// The label to show for each block of hierarchy |
86 String label = ''; | 86 String label = ''; |
87 | 87 |
88 /// The node value, as returned by the value accessor. | 88 /// The node value, as returned by the value accessor. |
89 dynamic value; | 89 dynamic value; |
90 | 90 |
91 /// The depth of the node, starting at 0 for the root. | 91 /// The depth of the node, starting at 0 for the root. |
92 int depth = 0; | 92 int depth = 0; |
93 } | 93 } |
OLD | NEW |