Home
last modified time | relevance | path

Searched refs:inputNode (Results 1 – 25 of 150) sorted by relevance

123456

/dports/math/vtk9/VTK-9.1.0/Filters/Extraction/
H A DvtkConvertSelection.cxx233 if (inputNode->GetSelectionList() == nullptr || in ConvertToBlockSelection()
245 tempSel->AddNode(inputNode); in ConvertToBlockSelection()
248 inputNode = tempOutput->GetNode(0); in ConvertToBlockSelection()
336 vtkSelectionNode* inputNode = input->GetNode(n); in ConvertCompositeDataSet() local
394 tempSel->AddNode(inputNode); in ConvertCompositeDataSet()
436 tempSelection->AddNode(inputNode); in ConvertFromQueryNodeCompositeDataSet()
477 int type = inputNode->GetFieldType(); in ConvertFromQueryNodeCompositeDataSet()
519 vtkSelectionNode* inputNode = input->GetNode(n); in Convert() local
522 outputNode->ShallowCopy(inputNode); in Convert()
528 inputNode->GetContentType() == this->OutputType) in Convert()
[all …]
/dports/math/vtk6/VTK-6.2.0/Filters/Extraction/
H A DvtkConvertSelection.cxx244 tempSel->AddNode(inputNode); in ConvertToBlockSelection()
247 inputNode = tempOutput->GetNode(0); in ConvertToBlockSelection()
303 vtkSelectionNode* inputNode = input->GetNode(n); in ConvertCompositeDataSet() local
354 tempSel->AddNode(inputNode); in ConvertCompositeDataSet()
396 vtkSelectionNode* inputNode = input->GetNode(n); in Convert() local
400 outputNode->ShallowCopy(inputNode); in Convert()
406 inputNode->GetContentType() == this->OutputType) in Convert()
448 this->OutputType == inputNode->GetContentType() && in Convert()
607 indices->DeepCopy(inputNode->GetSelectionList()); in Convert()
783 node->SetFieldType(inputNode->GetFieldType()); in Convert()
[all …]
/dports/math/vtk8/VTK-8.2.0/Filters/Extraction/
H A DvtkConvertSelection.cxx244 tempSel->AddNode(inputNode); in ConvertToBlockSelection()
247 inputNode = tempOutput->GetNode(0); in ConvertToBlockSelection()
303 vtkSelectionNode* inputNode = input->GetNode(n); in ConvertCompositeDataSet() local
354 tempSel->AddNode(inputNode); in ConvertCompositeDataSet()
396 vtkSelectionNode* inputNode = input->GetNode(n); in Convert() local
400 outputNode->ShallowCopy(inputNode); in Convert()
406 inputNode->GetContentType() == this->OutputType) in Convert()
448 this->OutputType == inputNode->GetContentType() && in Convert()
614 indices->DeepCopy(inputNode->GetSelectionList()); in Convert()
804 node->SetFieldType(inputNode->GetFieldType()); in Convert()
[all …]
/dports/databases/pg_citus/citus-10.2.3/src/backend/distributed/worker/
H A Dworker_shard_visibility.c29 static bool ReplaceTableVisibleFunctionWalker(Node *inputNode);
265 ReplaceTableVisibleFunction(Node *inputNode) in ReplaceTableVisibleFunction() argument
273 ReplaceTableVisibleFunctionWalker(inputNode); in ReplaceTableVisibleFunction()
293 ReplaceTableVisibleFunctionWalker(Node *inputNode) in ReplaceTableVisibleFunctionWalker() argument
295 if (inputNode == NULL) in ReplaceTableVisibleFunctionWalker()
300 if (IsA(inputNode, FuncExpr)) in ReplaceTableVisibleFunctionWalker()
302 FuncExpr *functionToProcess = (FuncExpr *) inputNode; in ReplaceTableVisibleFunctionWalker()
317 return expression_tree_walker(inputNode, ReplaceTableVisibleFunctionWalker, in ReplaceTableVisibleFunctionWalker()
321 else if (IsA(inputNode, Query)) in ReplaceTableVisibleFunctionWalker()
323 return query_tree_walker((Query *) inputNode, ReplaceTableVisibleFunctionWalker, in ReplaceTableVisibleFunctionWalker()
[all …]
/dports/www/grafana8/grafana-8.3.6/public/app/core/utils/
H A Ddag.ts2 inputNode?: Node;
17 link(inputNode: Node, outputNode: Node) {
18 if (!inputNode) {
27 this.inputNode = inputNode;
30 this._linkTo(inputNode, 1);
37 const inode = this.inputNode;
85 return this.inputEdges.find((e) => e.inputNode?.name === from.name);
88 return this.inputEdges.find((e) => e.inputNode?.name === from);
106 const inputEdgesNodes = e.inputNode?.inputEdges.map((e) => e.inputNode);
208 let inputEdges = n.inputEdges.map((e: Edge) => e.inputNode?.name).join(', ');
H A Ddag.test.ts64 const actual = nodeA.getOptimizedInputEdges().map((e) => e.inputNode);
70 const actual = nodeB.getOptimizedInputEdges().map((e) => e.inputNode);
76 const actual = nodeC.getOptimizedInputEdges().map((e) => e.inputNode);
82 const actual = nodeD.getOptimizedInputEdges().map((e) => e.inputNode);
88 const actual = nodeE.getOptimizedInputEdges().map((e) => e.inputNode);
/dports/devel/qtcreator/qt-creator-opensource-src-5.0.3/src/plugins/qmldesigner/designercore/model/
H A Dmodelmerger.cpp63 static void syncVariantProperties(ModelNode &outputNode, const ModelNode &inputNode) in syncVariantProperties() argument
65 foreach (const VariantProperty &property, inputNode.variantProperties()) { in syncVariantProperties()
75 static void syncAuxiliaryProperties(ModelNode &outputNode, const ModelNode &inputNode) in syncAuxiliaryProperties() argument
77 auto tmp = inputNode.auxiliaryData(); in syncAuxiliaryProperties()
84 foreach (const BindingProperty &bindingProperty, inputNode.bindingProperties()) { in syncBindingProperties()
91 foreach (const SignalHandlerProperty &signalProperty, inputNode.signalProperties()) { in syncSignalHandlerProperties()
98 if (!inputNode.id().isEmpty()) in syncId()
99 outputNode.setIdWithoutRefactoring(idRenamingHash.value(inputNode.id())); in syncId()
140 static void syncNodeProperties(ModelNode &outputNode, const ModelNode &inputNode, in syncNodeProperties() argument
144 foreach (const NodeProperty &nodeProperty, inputNode.nodeProperties()) { in syncNodeProperties()
[all …]
H A Dstylesheetmerger.cpp100 for (const NodeProperty &nodeProperty : inputNode.nodeProperties()) { in syncNodeProperties()
115 for (const NodeListProperty &nodeListProperty : inputNode.nodeListProperties()) { in syncNodeListProperties()
125 void StylesheetMerger::syncVariantProperties(ModelNode &outputNode, const ModelNode &inputNode) in syncVariantProperties() argument
127 for (const VariantProperty &variantProperty : inputNode.variantProperties()) { in syncVariantProperties()
134 auto tmp = inputNode.auxiliaryData(); in syncAuxiliaryProperties()
141 for (const BindingProperty &bindingProperty : inputNode.bindingProperties()) { in syncBindingProperties()
146 void StylesheetMerger::syncId(ModelNode &outputNode, ModelNode &inputNode) in syncId() argument
148 if (!inputNode.id().isEmpty()) { in syncId()
149 QString id = inputNode.id(); in syncId()
150 QString renamedId = m_idReplacementHash.value(inputNode.id()); in syncId()
[all …]
/dports/devel/qtcreator/qt-creator-opensource-src-5.0.3/src/plugins/qmldesigner/designercore/include/
H A Dstylesheetmerger.h58 …void syncNodeProperties(ModelNode &outputNode, const ModelNode &inputNode, bool skipDuplicates = f…
59 …void syncNodeListProperties(ModelNode &outputNode, const ModelNode &inputNode, bool skipDuplicates…
60 void syncId(ModelNode &outputNode, ModelNode &inputNode);
61 void syncBindingProperties(ModelNode &outputNode, const ModelNode &inputNode);
62 void syncAuxiliaryProperties(ModelNode &outputNode, const ModelNode &inputNode);
63 void syncVariantProperties(ModelNode &outputNode, const ModelNode &inputNode);
/dports/lang/mono/mono-5.10.1.57/mcs/class/referencesource/System.Data.Entity/System/Data/Query/PlanCompiler/
H A DITreeGenerator.cs643 return inputNode; in EnsureRelOp()
793 return inputNode; in VisitBoundExpressionPushBindingScope()
813 inputNode = EnsureRelOp(inputNode); in VisitBoundExpression()
821 return inputNode; in VisitBoundExpression()
1406 inputNode, in CreateLimitNode()
1442 … inputNode.Child0 = CreateLimitNode(inputNode.Child0, limitNode, expression.WithTies); in Visit()
2455 Node inputNode; in Visit()
2877 inputNode = in VisitSortArguments()
2880 inputNode, in VisitSortArguments()
2887 return inputNode; in VisitSortArguments()
[all …]
/dports/misc/mnn/MNN-1.2.0/tools/converter/source/tensorflow/
H A DTmpGraph.cpp312 if (inputNode->opType == "Identity") { in _genMinGraph()
313 inputNode = this->_getTmpNode(inputNode->inEdges[0]); in _genMinGraph()
317 inputNode->isCovered = true; in _genMinGraph()
373 if (inputNode->opType == "Identity") { in _genMinGraph()
374 inputNode = _getTmpNode(inputNode->inEdges[0]); in _genMinGraph()
376 DCHECK("Const" == inputNode->opType); in _genMinGraph()
377 inputNode->isCovered = true; in _genMinGraph()
382 if (inputNode->opType == "Identity") { in _genMinGraph()
383 inputNode = _getTmpNode(inputNode->inEdges[0]); in _genMinGraph()
385 DCHECK("Const" == inputNode->opType); in _genMinGraph()
[all …]
/dports/devel/jna/jna-5.7.0/contrib/platform/test/com/sun/jna/platform/win32/
H A DCfgmgr32Test.java52 int inputNode = rootNode; in testDevNode() local
53 assertEquals(Cfgmgr32.CR_SUCCESS, Cfgmgr32.INSTANCE.CM_Get_Child(outputNode, inputNode, 0)); in testDevNode()
56 inputNode = outputNode.getValue(); in testDevNode()
58 … assertEquals(Cfgmgr32.CR_SUCCESS, Cfgmgr32.INSTANCE.CM_Get_Parent(outputNode, inputNode, 0)); in testDevNode()
60 } while (Cfgmgr32.CR_SUCCESS == Cfgmgr32.INSTANCE.CM_Get_Sibling(outputNode, inputNode, 0)); in testDevNode()
/dports/math/vtk9/VTK-9.1.0/Filters/Parallel/
H A DvtkAngularPeriodicFilter.cxx112 vtkDataObject* inputNode = input->GetDataSet(loc); in CreatePeriodicDataSet() local
126 if (inputNode != nullptr) in CreatePeriodicDataSet()
129 inputNode->GetFieldData()->GetArray(this->GetRotationArrayName()); in CreatePeriodicDataSet()
173 if (periodsNb > 0 && inputNode != nullptr) in CreatePeriodicDataSet()
176 vtkDataObject* firstDataSet = inputNode->NewInstance(); in CreatePeriodicDataSet()
177 firstDataSet->ShallowCopy(inputNode); in CreatePeriodicDataSet()
184 this->AppendPeriodicPiece(angle, iPiece, inputNode, multiPiece); in CreatePeriodicDataSet()
209 double angle, vtkIdType iPiece, vtkDataObject* inputNode, vtkMultiPieceDataSet* multiPiece) in AppendPeriodicPiece() argument
211 vtkPointSet* dataset = vtkPointSet::SafeDownCast(inputNode); in AppendPeriodicPiece()
246 transformFilter->SetInputData(inputNode); in AppendPeriodicPiece()
/dports/math/vtk8/VTK-8.2.0/Filters/Parallel/
H A DvtkAngularPeriodicFilter.cxx115 vtkDataObject* inputNode = input->GetDataSet(loc); in CreatePeriodicDataSet() local
129 if (inputNode != nullptr) in CreatePeriodicDataSet()
132 inputNode->GetFieldData()->GetArray(this->GetRotationArrayName()); in CreatePeriodicDataSet()
176 if (periodsNb > 0 && inputNode != nullptr) in CreatePeriodicDataSet()
179 vtkDataObject* firstDataSet = inputNode->NewInstance(); in CreatePeriodicDataSet()
180 firstDataSet->ShallowCopy(inputNode); in CreatePeriodicDataSet()
187 this->AppendPeriodicPiece(angle, iPiece, inputNode, multiPiece); in CreatePeriodicDataSet()
213 vtkIdType iPiece, vtkDataObject* inputNode, vtkMultiPieceDataSet* multiPiece) in AppendPeriodicPiece() argument
215 vtkPointSet* dataset = vtkPointSet::SafeDownCast(inputNode); in AppendPeriodicPiece()
251 transformFilter->SetInputData(inputNode); in AppendPeriodicPiece()
/dports/biology/p5-Bio-MAGETAB/Bio-MAGETAB-1.31/t/
H A D003_sdrf.t70 inputNode => $nodes[-1],
118 inputNode => $nodes[1],
142 inputNode => $nodes3[2],
151 inputNode => $nodes4[2],
166 inputNode => $nodes5[0],
170 inputNode => $le,
H A D003_edge.t54 inputNode => $so,
63 inputNode => [],
74 inputNode => $sa,
101 lives_ok( sub{ $obj2 = Bio::MAGETAB::Edge->new( inputNode => $ex, outputNode => $ex2 ) },
/dports/lang/mono/mono-5.10.1.57/mcs/class/System.Web/Test/mainsoft/NunitWeb/NunitWeb/
H A DFormRequest.cs81 foreach (XmlNode inputNode in formNode.SelectNodes ("//html:input", nsmgr)) in ExtractFormAndHiddenControls()
83 foreach (XmlNode inputNode in doc.SelectNodes ("//html:input[@type='hidden']", nsmgr)) in ExtractFormAndHiddenControls()
87 bc.Name = inputNode.Attributes["name"].Value; in ExtractFormAndHiddenControls()
90 if (inputNode.Attributes["value"] != null) in ExtractFormAndHiddenControls()
91 bc.Value = inputNode.Attributes["value"].Value; in ExtractFormAndHiddenControls()
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/utils/IdealGraphVisualizer/ServerCompiler/src/main/java/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java45 public InputNode inputNode; field in ServerCompilerScheduler.Node
181 block.addNode(n.inputNode.getId()); in buildBlocks()
308 block.addNode(n.inputNode.getId()); in scheduleLatest()
340 b.addNode(n.inputNode.getId()); in markWithBlock()
349 b.addNode(s.inputNode.getId()); in markWithBlock()
358 b.addNode(s.inputNode.getId()); in markWithBlock()
579 InputNode inputNode = node.inputNode; in findRoot() local
580 String s = inputNode.getProperties().get("name"); in findRoot()
589 if (minNode == null || node.inputNode.getId() < minNode.inputNode.getId()) { in findRoot()
614 node.inputNode = n; in buildUpGraph()
[all …]
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/utils/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java42 public InputNode inputNode; field in ServerCompilerScheduler.Node
168 block.addNode(n.inputNode.getId()); in buildBlocks()
286 block.addNode(n.inputNode.getId()); in scheduleLatest()
318 b.addNode(n.inputNode.getId()); in markWithBlock()
327 b.addNode(s.inputNode.getId()); in markWithBlock()
336 b.addNode(s.inputNode.getId()); in markWithBlock()
549 return n.inputNode.getProperties().get("name").equals("Phi"); in isPhi()
557 InputNode inputNode = node.inputNode; in findRoot() local
558 String s = inputNode.getProperties().get("name"); in findRoot()
567 if (minNode == null || node.inputNode.getId() < minNode.inputNode.getId()) { in findRoot()
[all …]
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/utils/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java42 public InputNode inputNode; field in ServerCompilerScheduler.Node
168 block.addNode(n.inputNode.getId()); in buildBlocks()
286 block.addNode(n.inputNode.getId()); in scheduleLatest()
318 b.addNode(n.inputNode.getId()); in markWithBlock()
327 b.addNode(s.inputNode.getId()); in markWithBlock()
336 b.addNode(s.inputNode.getId()); in markWithBlock()
549 return n.inputNode.getProperties().get("name").equals("Phi"); in isPhi()
557 InputNode inputNode = node.inputNode; in findRoot() local
558 String s = inputNode.getProperties().get("name"); in findRoot()
567 if (minNode == null || node.inputNode.getId() < minNode.inputNode.getId()) { in findRoot()
[all …]
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/utils/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java42 public InputNode inputNode; field in ServerCompilerScheduler.Node
168 block.addNode(n.inputNode.getId()); in buildBlocks()
286 block.addNode(n.inputNode.getId()); in scheduleLatest()
318 b.addNode(n.inputNode.getId()); in markWithBlock()
327 b.addNode(s.inputNode.getId()); in markWithBlock()
336 b.addNode(s.inputNode.getId()); in markWithBlock()
549 return n.inputNode.getProperties().get("name").equals("Phi"); in isPhi()
557 InputNode inputNode = node.inputNode; in findRoot() local
558 String s = inputNode.getProperties().get("name"); in findRoot()
567 if (minNode == null || node.inputNode.getId() < minNode.inputNode.getId()) { in findRoot()
[all …]
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/utils/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java42 public InputNode inputNode; field in ServerCompilerScheduler.Node
168 block.addNode(n.inputNode.getId()); in buildBlocks()
286 block.addNode(n.inputNode.getId()); in scheduleLatest()
318 b.addNode(n.inputNode.getId()); in markWithBlock()
327 b.addNode(s.inputNode.getId()); in markWithBlock()
336 b.addNode(s.inputNode.getId()); in markWithBlock()
549 return n.inputNode.getProperties().get("name").equals("Phi"); in isPhi()
557 InputNode inputNode = node.inputNode; in findRoot() local
558 String s = inputNode.getProperties().get("name"); in findRoot()
567 if (minNode == null || node.inputNode.getId() < minNode.inputNode.getId()) { in findRoot()
[all …]
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/utils/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java42 public InputNode inputNode; field in ServerCompilerScheduler.Node
168 block.addNode(n.inputNode.getId()); in buildBlocks()
286 block.addNode(n.inputNode.getId()); in scheduleLatest()
318 b.addNode(n.inputNode.getId()); in markWithBlock()
327 b.addNode(s.inputNode.getId()); in markWithBlock()
336 b.addNode(s.inputNode.getId()); in markWithBlock()
549 return n.inputNode.getProperties().get("name").equals("Phi"); in isPhi()
557 InputNode inputNode = node.inputNode; in findRoot() local
558 String s = inputNode.getProperties().get("name"); in findRoot()
567 if (minNode == null || node.inputNode.getId() < minNode.inputNode.getId()) { in findRoot()
[all …]
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/utils/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java42 public InputNode inputNode; field in ServerCompilerScheduler.Node
168 block.addNode(n.inputNode.getId()); in buildBlocks()
286 block.addNode(n.inputNode.getId()); in scheduleLatest()
318 b.addNode(n.inputNode.getId()); in markWithBlock()
327 b.addNode(s.inputNode.getId()); in markWithBlock()
336 b.addNode(s.inputNode.getId()); in markWithBlock()
549 return n.inputNode.getProperties().get("name").equals("Phi"); in isPhi()
557 InputNode inputNode = node.inputNode; in findRoot() local
558 String s = inputNode.getProperties().get("name"); in findRoot()
567 if (minNode == null || node.inputNode.getId() < minNode.inputNode.getId()) { in findRoot()
[all …]
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/utils/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java42 public InputNode inputNode; field in ServerCompilerScheduler.Node
168 block.addNode(n.inputNode.getId()); in buildBlocks()
286 block.addNode(n.inputNode.getId()); in scheduleLatest()
318 b.addNode(n.inputNode.getId()); in markWithBlock()
327 b.addNode(s.inputNode.getId()); in markWithBlock()
336 b.addNode(s.inputNode.getId()); in markWithBlock()
549 return n.inputNode.getProperties().get("name").equals("Phi"); in isPhi()
557 InputNode inputNode = node.inputNode; in findRoot() local
558 String s = inputNode.getProperties().get("name"); in findRoot()
567 if (minNode == null || node.inputNode.getId() < minNode.inputNode.getId()) { in findRoot()
[all …]

123456