Home
last modified time | relevance | path

Searched refs:inputTree (Results 1 – 25 of 90) sorted by relevance

1234

/dports/math/vtk8/VTK-8.2.0/Infovis/Core/
H A DvtkExtractSelectedTree.cxx80 vtkDataSetAttributes * inputEdgeData = inputTree->GetEdgeData(); in BuildTree()
102 inputTree->GetEdges(edges); in BuildTree()
116 inputTree->GetEdgePoints(e.Id, npts, pts); in BuildTree()
131 vtkTree * inputTree = vtkTree::GetData(inputVector[0]); in RequestData() local
165 vtkIdType num = inputTree->GetNumberOfVertices(); in RequestData()
176 vtkIdType num = inputTree->GetNumberOfEdges(); in RequestData()
181 vtkIdType s = inputTree->GetSourceVertex(j); in RequestData()
182 vtkIdType t = inputTree->GetTargetVertex(j); in RequestData()
212 vtkIdType t = inputTree->GetTargetVertex(curEdgeId); in RequestData()
213 vtkIdType s = inputTree->GetSourceVertex(curEdgeId); in RequestData()
[all …]
H A DvtkPruneTreeFilter.cxx59 vtkTree* inputTree = vtkTree::GetData(inputVector[0]); in RequestData() local
62 if (this->ParentVertex < 0 || this->ParentVertex >= inputTree->GetNumberOfVertices()) in RequestData()
65 << " >= " << inputTree->GetNumberOfVertices()); in RequestData()
78 vtkDataSetAttributes *inputVertexData = inputTree->GetVertexData(); in RequestData()
79 vtkDataSetAttributes *inputEdgeData = inputTree->GetEdgeData(); in RequestData()
86 builder->GetFieldData()->DeepCopy(inputTree->GetFieldData()); in RequestData()
90 if (inputTree->GetRoot() != this->ParentVertex) in RequestData()
92 vertStack.push_back(std::make_pair(inputTree->GetRoot(), builder->AddVertex())); in RequestData()
100 inputTree->GetOutEdges(tree_v, it); in RequestData()
/dports/math/vtk9/VTK-9.1.0/Infovis/Core/
H A DvtkExtractSelectedTree.cxx78 vtkDataSetAttributes* inputEdgeData = inputTree->GetEdgeData(); in BuildTree()
99 inputTree->GetEdges(edges); in BuildTree()
112 inputTree->GetEdgePoints(e.Id, npts, pts); in BuildTree()
123 vtkTree* inputTree = vtkTree::GetData(inputVector[0]); in RequestData() local
157 vtkIdType num = inputTree->GetNumberOfVertices(); in RequestData()
168 vtkIdType num = inputTree->GetNumberOfEdges(); in RequestData()
173 vtkIdType s = inputTree->GetSourceVertex(j); in RequestData()
174 vtkIdType t = inputTree->GetTargetVertex(j); in RequestData()
204 vtkIdType t = inputTree->GetTargetVertex(curEdgeId); in RequestData()
205 vtkIdType s = inputTree->GetSourceVertex(curEdgeId); in RequestData()
[all …]
H A DvtkPruneTreeFilter.cxx56 vtkTree* inputTree = vtkTree::GetData(inputVector[0]); in RequestData() local
59 if (this->ParentVertex < 0 || this->ParentVertex >= inputTree->GetNumberOfVertices()) in RequestData()
62 << this->ParentVertex << " >= " << inputTree->GetNumberOfVertices()); in RequestData()
74 vtkDataSetAttributes* inputVertexData = inputTree->GetVertexData(); in RequestData()
75 vtkDataSetAttributes* inputEdgeData = inputTree->GetEdgeData(); in RequestData()
82 builder->GetFieldData()->DeepCopy(inputTree->GetFieldData()); in RequestData()
86 if (inputTree->GetRoot() != this->ParentVertex) in RequestData()
88 vertStack.emplace_back(inputTree->GetRoot(), builder->AddVertex()); in RequestData()
96 inputTree->GetOutEdges(tree_v, it); in RequestData()
/dports/math/vtk6/VTK-6.2.0/Infovis/Core/
H A DvtkExtractSelectedTree.cxx81 vtkDataSetAttributes * inputVertexData = inputTree->GetVertexData(); in BuildTree()
82 vtkDataSetAttributes * inputEdgeData = inputTree->GetEdgeData(); in BuildTree()
104 inputTree->GetEdges(edges); in BuildTree()
118 inputTree->GetEdgePoints(e.Id, npts, pts); in BuildTree()
133 vtkTree * inputTree = vtkTree::GetData(inputVector[0]); in RequestData() local
167 vtkIdType num = inputTree->GetNumberOfVertices(); in RequestData()
178 vtkIdType num = inputTree->GetNumberOfEdges(); in RequestData()
183 vtkIdType s = inputTree->GetSourceVertex(j); in RequestData()
184 vtkIdType t = inputTree->GetTargetVertex(j); in RequestData()
214 vtkIdType t = inputTree->GetTargetVertex(curEdgeId); in RequestData()
[all …]
H A DvtkPruneTreeFilter.cxx61 vtkTree* inputTree = vtkTree::GetData(inputVector[0]); in RequestData() local
64 if (this->ParentVertex < 0 || this->ParentVertex >= inputTree->GetNumberOfVertices()) in RequestData()
67 << " >= " << inputTree->GetNumberOfVertices()); in RequestData()
80 vtkDataSetAttributes *inputVertexData = inputTree->GetVertexData(); in RequestData()
81 vtkDataSetAttributes *inputEdgeData = inputTree->GetEdgeData(); in RequestData()
88 builder->GetFieldData()->DeepCopy(inputTree->GetFieldData()); in RequestData()
92 if (inputTree->GetRoot() != this->ParentVertex) in RequestData()
94 vertStack.push_back(vtksys_stl::make_pair(inputTree->GetRoot(), builder->AddVertex())); in RequestData()
102 inputTree->GetOutEdges(tree_v, it); in RequestData()
/dports/math/vtk8/VTK-8.2.0/Infovis/Layout/
H A DvtkBoxLayoutStrategy.cxx45 vtkTree* inputTree, in Layout() argument
49 if (!inputTree) in Layout()
60 dfs->SetTree(inputTree); in Layout()
67 if (vertex == inputTree->GetRoot()) in Layout()
71 inputTree->GetPoints()->SetPoint(vertex, in Layout()
90 vtkIdType nchildren = inputTree->GetNumberOfChildren(vertex); in Layout()
91 if (!inputTree->IsLeaf(vertex)) in Layout()
105 inputTree->GetChildren(vertex, children); in Layout()
132 inputTree->GetPoints()->SetPoint(child, in Layout()
H A DvtkSliceAndDiceLayoutStrategy.cxx51 vtkTree* inputTree, in Layout() argument
55 if (!inputTree) in Layout()
67 dfs->SetTree(inputTree); in Layout()
76 bool vertical = (inputTree->GetLevel(vertex) % 2) == 1; in Layout()
77 if (vertex == inputTree->GetRoot()) in Layout()
81 inputTree->GetPoints()->SetPoint(vertex, in Layout()
100 inputTree->GetChildren(vertex, it); in Layout()
114 inputTree->GetChildren(vertex, it); in Layout()
148 inputTree->GetPoints()->SetPoint(child, in Layout()
H A DvtkStackedTreeLayoutStrategy.cxx74 if( !inputTree || inputTree->GetNumberOfVertices() == 0 ) in Layout()
103 newTree->ShallowCopy( inputTree ); in Layout()
123 vtkIdType rootId = inputTree->GetRoot(); in Layout()
138 inputTree->GetNumberOfChildren(rootId), in Layout()
142 vtkIdType numVerts = inputTree->GetNumberOfVertices(); in Layout()
214 inputTree->SetPoints(points); in Layout()
219 vtkTree* inputTree, in LayoutEdgePoints() argument
226 newTree->ShallowCopy( inputTree ); in LayoutEdgePoints()
245 if (inputTree->IsLeaf(i)) in LayoutEdgePoints()
295 if( inputTree->IsLeaf(i) ) in LayoutEdgePoints()
[all …]
H A DvtkTreeMapToPolyData.cxx61 vtkTree *inputTree = vtkTree::SafeDownCast( in RequestData() local
68 outputPoints->SetNumberOfPoints(inputTree->GetNumberOfVertices()*4); in RequestData()
74 normals->SetNumberOfTuples(inputTree->GetNumberOfVertices()*4); in RequestData()
77 vtkDataArray* coordArray = this->GetInputArrayToProcess(0, inputTree); in RequestData()
83 vtkDataArray* levelArray = this->GetInputArrayToProcess(1, inputTree); in RequestData()
86 for (int i = 0; i < inputTree->GetNumberOfVertices(); i++) in RequestData()
99 z = this->LevelDeltaZ * inputTree->GetLevel(i); in RequestData()
135 outputPoly->GetCellData()->PassData(inputTree->GetVertexData()); in RequestData()
H A DvtkSquarifyLayoutStrategy.cxx41 vtkTree* inputTree, in Layout() argument
45 if (!inputTree || inputTree->GetNumberOfVertices() == 0) in Layout()
56 for (vtkIdType i = 0; i < inputTree->GetNumberOfVertices(); ++i) in Layout()
59 inputTree->GetPoints()->SetPoint(i, -100, -100, 0); in Layout()
63 vtkIdType rootId = inputTree->GetRoot(); in Layout()
66 inputTree->GetPoints()->SetPoint(rootId, 0.5, 0.5, 0.0); in Layout()
70 this->LayoutChildren(inputTree, coordsArray, sizeArray, in Layout()
71 inputTree->GetNumberOfChildren(rootId), rootId, 0, in Layout()
H A DvtkCirclePackToPolyData.cxx67 vtkTree *inputTree = vtkTree::SafeDownCast( in RequestData() local
72 if( inputTree->GetNumberOfVertices() == 0 ) in RequestData()
77 vtkDataArray* circlesArray = this->GetInputArrayToProcess(0, inputTree); in RequestData()
88 for( int i = 0; i < inputTree->GetNumberOfVertices(); i++ ) in RequestData()
104 progress = static_cast<double>(i) / inputTree->GetNumberOfVertices() * 0.8; in RequestData()
113 vtkDataSetAttributes* const input_vertex_data = inputTree->GetVertexData(); in RequestData()
/dports/math/vtk9/VTK-9.1.0/Infovis/Layout/
H A DvtkSliceAndDiceLayoutStrategy.cxx51 vtkTree* inputTree, vtkDataArray* coordsArray, vtkDataArray* sizeArray) in Layout() argument
53 if (!inputTree) in Layout()
64 dfs->SetTree(inputTree); in Layout()
72 bool vertical = (inputTree->GetLevel(vertex) % 2) == 1; in Layout()
73 if (vertex == inputTree->GetRoot()) in Layout()
80 inputTree->GetPoints()->SetPoint( in Layout()
97 inputTree->GetChildren(vertex, it); in Layout()
111 inputTree->GetChildren(vertex, it); in Layout()
145 inputTree->GetPoints()->SetPoint( in Layout()
H A DvtkBoxLayoutStrategy.cxx45 vtkTree* inputTree, vtkDataArray* coordsArray, vtkDataArray* vtkNotUsed(sizeArray)) in Layout() argument
47 if (!inputTree) in Layout()
57 dfs->SetTree(inputTree); in Layout()
64 if (vertex == inputTree->GetRoot()) in Layout()
71 inputTree->GetPoints()->SetPoint( in Layout()
88 vtkIdType nchildren = inputTree->GetNumberOfChildren(vertex); in Layout()
89 if (!inputTree->IsLeaf(vertex)) in Layout()
102 inputTree->GetChildren(vertex, children); in Layout()
125 inputTree->GetPoints()->SetPoint( in Layout()
H A DvtkStackedTreeLayoutStrategy.cxx72 if (!inputTree || inputTree->GetNumberOfVertices() == 0) in Layout()
82 vtkDataSetAttributes* data = inputTree->GetVertexData(); in Layout()
101 newTree->ShallowCopy(inputTree); in Layout()
121 vtkIdType rootId = inputTree->GetRoot(); in Layout()
135 this->LayoutChildren(inputTree, coordsArray, sizeArray, inputTree->GetNumberOfChildren(rootId), in Layout()
139 vtkIdType numVerts = inputTree->GetNumberOfVertices(); in Layout()
212 inputTree->SetPoints(points); in Layout()
221 newTree->ShallowCopy(inputTree); in LayoutEdgePoints()
240 if (inputTree->IsLeaf(i)) in LayoutEdgePoints()
290 if (inputTree->IsLeaf(i)) in LayoutEdgePoints()
[all …]
H A DvtkTreeMapToPolyData.cxx59 vtkTree* inputTree = vtkTree::SafeDownCast(inInfo->Get(vtkDataObject::DATA_OBJECT())); in RequestData() local
64 outputPoints->SetNumberOfPoints(inputTree->GetNumberOfVertices() * 4); in RequestData()
70 normals->SetNumberOfTuples(inputTree->GetNumberOfVertices() * 4); in RequestData()
73 vtkDataArray* coordArray = this->GetInputArrayToProcess(0, inputTree); in RequestData()
79 vtkDataArray* levelArray = this->GetInputArrayToProcess(1, inputTree); in RequestData()
82 for (int i = 0; i < inputTree->GetNumberOfVertices(); i++) in RequestData()
95 z = this->LevelDeltaZ * inputTree->GetLevel(i); in RequestData()
130 outputPoly->GetCellData()->PassData(inputTree->GetVertexData()); in RequestData()
H A DvtkSquarifyLayoutStrategy.cxx41 vtkTree* inputTree, vtkDataArray* coordsArray, vtkDataArray* sizeArray) in Layout() argument
43 if (!inputTree || inputTree->GetNumberOfVertices() == 0) in Layout()
54 for (vtkIdType i = 0; i < inputTree->GetNumberOfVertices(); ++i) in Layout()
57 inputTree->GetPoints()->SetPoint(i, -100, -100, 0); in Layout()
61 vtkIdType rootId = inputTree->GetRoot(); in Layout()
64 inputTree->GetPoints()->SetPoint(rootId, 0.5, 0.5, 0.0); in Layout()
68 this->LayoutChildren(inputTree, coordsArray, sizeArray, inputTree->GetNumberOfChildren(rootId), in Layout()
H A DvtkCirclePackToPolyData.cxx64 vtkTree* inputTree = vtkTree::SafeDownCast(inInfo->Get(vtkDataObject::DATA_OBJECT())); in RequestData() local
67 if (inputTree->GetNumberOfVertices() == 0) in RequestData()
72 vtkDataArray* circlesArray = this->GetInputArrayToProcess(0, inputTree); in RequestData()
83 for (int i = 0; i < inputTree->GetNumberOfVertices(); i++) in RequestData()
94 progress = static_cast<double>(i) / inputTree->GetNumberOfVertices() * 0.8; in RequestData()
103 vtkDataSetAttributes* const input_vertex_data = inputTree->GetVertexData(); in RequestData()
/dports/math/vtk6/VTK-6.2.0/Infovis/Layout/
H A DvtkSliceAndDiceLayoutStrategy.cxx55 vtkTree* inputTree, in Layout() argument
59 if (!inputTree) in Layout()
71 dfs->SetTree(inputTree); in Layout()
80 bool vertical = (inputTree->GetLevel(vertex) % 2) == 1; in Layout()
81 if (vertex == inputTree->GetRoot()) in Layout()
85 inputTree->GetPoints()->SetPoint(vertex, in Layout()
104 inputTree->GetChildren(vertex, it); in Layout()
118 inputTree->GetChildren(vertex, it); in Layout()
152 inputTree->GetPoints()->SetPoint(child, in Layout()
H A DvtkBoxLayoutStrategy.cxx49 vtkTree* inputTree, in Layout() argument
53 if (!inputTree) in Layout()
64 dfs->SetTree(inputTree); in Layout()
71 if (vertex == inputTree->GetRoot()) in Layout()
75 inputTree->GetPoints()->SetPoint(vertex, in Layout()
94 vtkIdType nchildren = inputTree->GetNumberOfChildren(vertex); in Layout()
95 if (!inputTree->IsLeaf(vertex)) in Layout()
109 inputTree->GetChildren(vertex, children); in Layout()
136 inputTree->GetPoints()->SetPoint(child, in Layout()
H A DvtkStackedTreeLayoutStrategy.cxx76 if( !inputTree || inputTree->GetNumberOfVertices() == 0 ) in Layout()
105 newTree->ShallowCopy( inputTree ); in Layout()
125 vtkIdType rootId = inputTree->GetRoot(); in Layout()
140 inputTree->GetNumberOfChildren(rootId), in Layout()
144 vtkIdType numVerts = inputTree->GetNumberOfVertices(); in Layout()
216 inputTree->SetPoints(points); in Layout()
221 vtkTree* inputTree, in LayoutEdgePoints() argument
228 newTree->ShallowCopy( inputTree ); in LayoutEdgePoints()
247 if (inputTree->IsLeaf(i)) in LayoutEdgePoints()
297 if( inputTree->IsLeaf(i) ) in LayoutEdgePoints()
[all …]
H A DvtkTreeMapToPolyData.cxx63 vtkTree *inputTree = vtkTree::SafeDownCast( in RequestData() local
70 outputPoints->SetNumberOfPoints(inputTree->GetNumberOfVertices()*4); in RequestData()
76 normals->SetNumberOfTuples(inputTree->GetNumberOfVertices()*4); in RequestData()
79 vtkDataArray* coordArray = this->GetInputArrayToProcess(0, inputTree); in RequestData()
85 vtkDataArray* levelArray = this->GetInputArrayToProcess(1, inputTree); in RequestData()
88 for (int i = 0; i < inputTree->GetNumberOfVertices(); i++) in RequestData()
101 z = this->LevelDeltaZ * inputTree->GetLevel(i); in RequestData()
137 outputPoly->GetCellData()->PassData(inputTree->GetVertexData()); in RequestData()
H A DvtkSquarifyLayoutStrategy.cxx45 vtkTree* inputTree, in Layout() argument
49 if (!inputTree || inputTree->GetNumberOfVertices() == 0) in Layout()
60 for (vtkIdType i = 0; i < inputTree->GetNumberOfVertices(); ++i) in Layout()
63 inputTree->GetPoints()->SetPoint(i, -100, -100, 0); in Layout()
67 vtkIdType rootId = inputTree->GetRoot(); in Layout()
70 inputTree->GetPoints()->SetPoint(rootId, 0.5, 0.5, 0.0); in Layout()
74 this->LayoutChildren(inputTree, coordsArray, sizeArray, in Layout()
75 inputTree->GetNumberOfChildren(rootId), rootId, 0, in Layout()
H A DvtkCirclePackToPolyData.cxx69 vtkTree *inputTree = vtkTree::SafeDownCast( in RequestData() local
74 if( inputTree->GetNumberOfVertices() == 0 ) in RequestData()
79 vtkDataArray* circlesArray = this->GetInputArrayToProcess(0, inputTree); in RequestData()
90 for( int i = 0; i < inputTree->GetNumberOfVertices(); i++ ) in RequestData()
106 progress = static_cast<double>(i) / inputTree->GetNumberOfVertices() * 0.8; in RequestData()
115 vtkDataSetAttributes* const input_vertex_data = inputTree->GetVertexData(); in RequestData()
/dports/sysutils/istio/istio-1.6.7/operator/pkg/name/
H A Dname_test.go29 inputTree string
43 inputTree: `
57 inputTree: `
72 inputTree: `
85 inputTree: `
105 if err := yaml.Unmarshal([]byte(tt.args.inputTree), &tree); err != nil {

1234