- Timestamp:
- 06/08/11 10:42:57 (13 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/GP.Grammar.Editor/HeuristicLab.Problems.DataAnalysis.Symbolic.Views/3.4/InteractiveSymbolicDataAnalysisSolutionSimplifierView.cs
r6256 r6387 95 95 List<ISymbolicExpressionTreeNode> nodeList = Content.Model.SymbolicExpressionTree.Root.GetSubtree(0).IterateNodesPrefix().ToList(); 96 96 foreach (var parent in nodeList) { 97 for (int subTreeIndex = 0; subTreeIndex < parent.Subtree sCount; subTreeIndex++) {97 for (int subTreeIndex = 0; subTreeIndex < parent.SubtreeCount; subTreeIndex++) { 98 98 var child = parent.GetSubtree(subTreeIndex); 99 99 if (!(child.Symbol is Constant) && nodeImpacts[child].IsAlmost(0.0)) { … … 105 105 106 106 // show only interesting part of solution 107 if (tree.Root.Subtree sCount > 1)107 if (tree.Root.SubtreeCount > 1) 108 108 this.treeChart.Tree = new SymbolicExpressionTree(tree.Root); // RPB + ADFs 109 109 else … … 130 130 var tree = Content.Model.SymbolicExpressionTree; 131 131 foreach (SymbolicExpressionTreeNode treeNode in tree.IterateNodesPostfix()) { 132 for (int i = 0; i < treeNode.Subtree sCount; i++) {132 for (int i = 0; i < treeNode.SubtreeCount; i++) { 133 133 ISymbolicExpressionTreeNode subTree = treeNode.GetSubtree(i); 134 134 // only allow to replace nodes for which a replacement value is known (replacement value for ADF nodes are not available) … … 137 137 138 138 // show only interesting part of solution 139 if (tree.Root.Subtree sCount > 1)139 if (tree.Root.SubtreeCount > 1) 140 140 this.treeChart.Tree = new SymbolicExpressionTree(tree.Root); // RPB + ADFs 141 141 else
Note: See TracChangeset
for help on using the changeset viewer.