当前位置: 首页>>代码示例>>C#>>正文


C# TreeNode.GetData方法代码示例

本文整理汇总了C#中TreeNode.GetData方法的典型用法代码示例。如果您正苦于以下问题:C# TreeNode.GetData方法的具体用法?C# TreeNode.GetData怎么用?C# TreeNode.GetData使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在TreeNode的用法示例。


在下文中一共展示了TreeNode.GetData方法的2个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C#代码示例。

示例1: ProcessShape

        //
        // Create the actual equation and continue processing recursively.
        //
        private void ProcessShape(Region currOuterRegion, TreeNode<Figure> currShape,
                                 List<TreeNode<Figure>> currHierarchyRoots, ComplexRegionEquation currEquation,
                                 double currArea, KnownMeasurementsAggregator known)
        {
            // Acquire the sub-shape.
            Figure currentFigure = currShape.GetData();

            // See what regions compose the subshape.
            ShapeRegion childShapeRegion = new ShapeRegion(currentFigure);

            // Make a copy of the current outer regions
            Region regionCopy = new Region(currOuterRegion);

            // Remove all regions from the outer region; if successful, recur on the new outer shape.
            if (regionCopy.Remove(childShapeRegion.atoms))
            {
                // Update the equation: copy and modify
                ComplexRegionEquation eqCopy = new ComplexRegionEquation(currEquation);
                eqCopy.AppendSubtraction(childShapeRegion);

                // Compute new area
                double currAreaCopy = currArea;
                if (currAreaCopy > 0)
                {
                    double currShapeArea = currentFigure.GetArea(known);

                    currAreaCopy = currShapeArea < 0 ? -1 : currAreaCopy - currShapeArea;
                }

                // Recur.
                SolveHelper(regionCopy, currHierarchyRoots, eqCopy, currAreaCopy, known);
            }
        }
开发者ID:wcatykid,项目名称:GeoShader,代码行数:36,代码来源:AreaSolutionGenerator.cs

示例2: DFSSearch

 private void DFSSearch(TreeNode<string> X,int y){
 //melakukan penelusuran secara DFS dan mencetak node yang dikunjungi
     Space(y);
     treeString+="Name = " + X.GetData() + " | Children = " + X.GetChildren().Count+"\n";
     if (X.GetParent() != null) countVisited++;
     Search1(X.GetData(), X.GetType());
     float progress = (float)countVisited / (float)countTotal;
     Console.WriteLine("[Progress]" + progress * 100 + "[/Progress]");
     foreach (var child in X.GetChildren())
     {
         int z = y + 7;
         DFSSearch(child, z);
     }
 }
开发者ID:ivanandrianto,项目名称:Local-Search-Engine,代码行数:14,代码来源:Explorer.cs


注:本文中的TreeNode.GetData方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。