Home
last modified time | relevance | path

Searched refs:NodeId (Results 1 – 25 of 3038) sorted by relevance

12345678910>>...122

/dports/science/elmerfem/elmerfem-release-9.0/fem/tests/HelmholtzFEM/
H A DCircleInBox.mif13 NodeId: 1 3 0 0
14 NodeId: 2 4 1 0
15 NodeId: 3 5 1 1
16 NodeId: 4 6 0 1
17 NodeId: 5 -1 0.75 0.5
23 NodeId: 11 -1 0.716506 0.625
29 NodeId: 17 -1 0.625 0.716506
35 NodeId: 23 -1 0.5 0.75
53 NodeId: 41 -1 0.25 0.5
71 NodeId: 59 -1 0.5 0.25
[all …]
/dports/science/elmerfem/elmerfem-release-9.0/fem/tests/linearsolvers_cmplx/
H A DCircleInBox.mif13 NodeId: 1 3 0 0
14 NodeId: 2 4 1 0
15 NodeId: 3 5 1 1
16 NodeId: 4 6 0 1
17 NodeId: 5 -1 0.75 0.5
23 NodeId: 11 -1 0.716506 0.625
29 NodeId: 17 -1 0.625 0.716506
35 NodeId: 23 -1 0.5 0.75
53 NodeId: 41 -1 0.25 0.5
71 NodeId: 59 -1 0.5 0.25
[all …]
/dports/science/elmerfem/elmerfem-release-9.0/fem/tests/HelmholtzBEM/
H A DCircleInBox.mif13 NodeId: 1 3 0 0
14 NodeId: 2 4 1 0
15 NodeId: 3 5 1 1
16 NodeId: 4 6 0 1
17 NodeId: 5 -1 0.75 0.5
23 NodeId: 11 -1 0.716506 0.625
29 NodeId: 17 -1 0.625 0.716506
35 NodeId: 23 -1 0.5 0.75
53 NodeId: 41 -1 0.25 0.5
71 NodeId: 59 -1 0.5 0.25
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/BN/learning/
H A DMiic.h57 using CondThreePoints = std::tuple< NodeId, NodeId, NodeId, std::vector< NodeId > >;
60 using ThreePoints = std::tuple< NodeId, NodeId, NodeId >;
200 HashTable< std::pair< NodeId, NodeId >, std::vector< NodeId > >& sepSet,
217 HashTable< std::pair< NodeId, NodeId >, std::vector< NodeId > >& sepSet,
230 const HashTable< std::pair< NodeId, NodeId >, std::vector< NodeId > >& sepSet);
243 const HashTable< std::pair< NodeId, NodeId >, std::vector< NodeId > >& sepSet);
256 const HashTable< std::pair< NodeId, NodeId >, std::vector< NodeId > >& sepSet);
284 const HashTable< std::pair< NodeId, NodeId >, std::vector< NodeId > >& sepSet);
296 const HashTable< std::pair< NodeId, NodeId >, std::vector< NodeId > >& sepSet,
318 bool isForbidenArc_(NodeId x, NodeId y) const;
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphs/algorithms/triangulations/
H A DincrementalTriangulation.h91 void eraseNode(const NodeId node);
95 void addEdge(const NodeId X, const NodeId Y);
109 Idx eliminationOrder(const NodeId);
125 NodeId createdJunctionTreeClique(const NodeId id);
136 NodeId createdMaxPrimeSubgraph(const NodeId id);
187 NodeProperty< NodeId > _mps_of_clique_;
214 void _markAffectedMPSsByRemoveLink_(const NodeId My, const NodeId Mz, const Edge& edge);
223 void _performRemoveNode_(const NodeId node, const NodeId My, const NodeId Mz);
226 void _performAddNode_(const NodeId node);
238 std::vector< std::pair< NodeId, NodeId > >& merged_cliques,
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/BN/
H A DBayesNet.h239 NodeId add(const DiscreteVariable& var, NodeId id);
256 NodeId
274 void erase(NodeId varId);
397 void addArc(NodeId tail, NodeId head);
421 void eraseArc(NodeId tail, NodeId head);
458 void reverseArc(NodeId tail, NodeId head);
509 NodeId addNoisyOR(const DiscreteVariable& var, GUM_SCALAR external_weight, NodeId id);
510 NodeId addNoisyORNet(const DiscreteVariable& var, GUM_SCALAR external_weight, NodeId id);
524 NodeId addNoisyAND(const DiscreteVariable& var, GUM_SCALAR external_weight, NodeId id);
546 NodeId addLogit(const DiscreteVariable& var, GUM_SCALAR external_weight, NodeId id);
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/stattests/
H A DcorrectedMutualInformation.h59 using allocator_type = ALLOC< NodeId >;
95 = Bijection< NodeId, std::size_t, ALLOC< std::size_t > >(),
227 double score(NodeId var1, NodeId var2);
232 const std::vector< NodeId, ALLOC< NodeId > >& conditioning_ids);
235 double score(NodeId var1, NodeId var2, NodeId var3);
241 const std::vector< NodeId, ALLOC< NodeId > >& conditioning_ids);
367 const std::vector< NodeId, ALLOC< NodeId > > _empty_conditioning_set_;
376 const std::vector< NodeId, ALLOC< NodeId > >& vars_z);
382 const std::vector< NodeId, ALLOC< NodeId > >& vars_ui);
387 const std::vector< NodeId, ALLOC< NodeId > >& vars_z);
[all …]
H A DidCondSet.h61 using value_type = NodeId;
62 using reference = NodeId&;
110 NodeId operator*() const;
168 const Sequence< NodeId, ALLOC< NodeId > >* _seq_{nullptr};
222 IdCondSet(const std::vector< NodeId, ALLOC< NodeId > >& ids,
235 const std::vector< NodeId, ALLOC< NodeId > >& rhs_ids,
253 const std::vector< NodeId, ALLOC< NodeId > >& rhs_ids,
272 const std::vector< NodeId, ALLOC< NodeId > >& rhs_ids,
362 const Sequence< NodeId, ALLOC< NodeId > >& ids() const;
392 void erase(const NodeId id);
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/PRM/gspan/
H A Dpattern.h107 LabelData& label(NodeId i, NodeId j);
110 const LabelData& label(NodeId i, NodeId j) const;
137 void addArc(NodeId i, NodeId j, LabelData& l);
140 bool exists(NodeId id) const;
143 bool exists(NodeId tail, NodeId head) const;
180 EdgeCode& edgeCode(NodeId tail, NodeId head);
186 const EdgeCode& edgeCode(NodeId tail, NodeId head) const;
196 void remove(NodeId node);
227 bool _expandCodeIsMinimal_(NodeId u, NodeId v);
235 bool _rec_(Pattern& p, Bijection< NodeId, NodeId >& node_map, NodeId u, NodeId v);
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_BNLEARNING/
H A DParamEstimatorMLTestSuite.h142 std::vector< double > v02 = param_estimator.parameters(gum::NodeId(0), {gum::NodeId(2)}); in test1()
146 std::vector< double > v01 = param_estimator.parameters(gum::NodeId(0), {gum::NodeId(1)}); in test1()
150 std::vector< double > v21 = param_estimator.parameters(gum::NodeId(2), {gum::NodeId(1)}); in test1()
165 std::vector< double > w02 = param_estimator2.parameters(gum::NodeId(0), {gum::NodeId(2)}); in test1()
168 std::vector< double > w01 = param_estimator2.parameters(gum::NodeId(0), {gum::NodeId(1)}); in test1()
171 std::vector< double > w21 = param_estimator2.parameters(gum::NodeId(2), {gum::NodeId(1)}); in test1()
185 std::vector< double > x02 = param_estimator3.parameters(gum::NodeId(0), {gum::NodeId(2)}); in test1()
188 std::vector< double > x01 = param_estimator3.parameters(gum::NodeId(0), {gum::NodeId(1)}); in test1()
191 std::vector< double > x21 = param_estimator3.parameters(gum::NodeId(2), {gum::NodeId(1)}); in test1()
205 std::vector< double > y02 = param_estimator4->parameters(gum::NodeId(0), {gum::NodeId(2)}); in test1()
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/ID/
H A DinfluenceDiagram.h163 bool isChanceNode(NodeId varId) const;
217 NodeId add(const DiscreteVariable& variable, NodeId id = 0);
233 NodeId addChanceNode(const DiscreteVariable& variable, NodeId id = 0);
249 NodeId addUtilityNode(const DiscreteVariable& variable, NodeId id = 0);
262 NodeId addDecisionNode(const DiscreteVariable& variable, NodeId id = 0);
305 void erase(NodeId id);
341 void addArc(NodeId tail, NodeId head);
363 void eraseArc(NodeId tail, NodeId head);
394 bool existsPathBetween(NodeId src, NodeId dest) const;
424 NodeId addNode_(const DiscreteVariable& variableType, NodeId DesiredId);
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphs/parts/
H A DarcGraphPart.h82 Signaler2< NodeId, NodeId > onArcAdded; // onArcAdded(tail,head)
83 Signaler2< NodeId, NodeId > onArcDeleted; // onArcDeleted(tail,head)
134 virtual void addArc(NodeId tail, NodeId head);
153 bool existsArc(NodeId tail, NodeId head) const;
179 NodeSet family(NodeId id) const;
187 NodeSet descendants(NodeId id) const;
196 NodeSet ancestors(NodeId id) const;
222 void eraseParents(NodeId id);
236 void eraseChildren(NodeId id);
276 std::vector< NodeId > directedPath(NodeId node1, NodeId node2) const;
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphs/
H A DcliqueGraph.h100 virtual void addEdge(const NodeId first, const NodeId second);
115 NodeId addNode(const NodeSet& clique);
119 virtual NodeId addNode();
129 virtual void addNode(const NodeId id);
135 virtual void eraseNode(const NodeId node);
157 NodeId container(const NodeId idNode) const;
173 virtual void addToClique(const NodeId clique_id, const NodeId node_id);
180 virtual void eraseFromClique(const NodeId clique_id, const NodeId node_id);
192 const NodeSet& separator(const NodeId clique1, const NodeId clique) const;
198 std::vector< NodeId > containerPath(const NodeId node1, const NodeId node2) const;
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/multidim/implementations/
H A DmultiDimFunctionGraphManager.h118 void setRootNode(const NodeId& root);
143 virtual NodeId addInternalNode(const DiscreteVariable* var, NodeId* sons) = 0;
152 NodeId addInternalNode_(const DiscreteVariable* var, NodeId* sons);
167 NodeId addInternalNode(const DiscreteVariable* var, NodeId nid);
191 void eraseNode(NodeId id, NodeId replacingId = 0, bool updateParents = true);
205 void setSon(const NodeId& node, const Idx& modality, const NodeId& sonNode);
241 void migrateNode_(const NodeId& x, const NodeId& y);
263 NodeId nodeRedundancyCheck_(const DiscreteVariable* var, NodeId* sonsMap);
278 NodeId _checkIsomorphism_(const DiscreteVariable* var, NodeId* sons);
364 virtual NodeId addInternalNode(const DiscreteVariable* var, NodeId* sons);
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp43 void link(NodeId Src, NodeId Dst) { in link()
47 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
48 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
81 bool identical(NodeId Id1, NodeId Id2) const;
84 bool isMatchingPossible(NodeId Id1, NodeId Id2) const;
98 NodeId findCandidate(const Mapping &M, NodeId Id1) const;
149 bool isInSubtree(NodeId Id, NodeId SubtreeRoot) const;
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
284 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder()
580 std::vector<std::pair<NodeId, NodeId>> Matches; in getMatchingNodes()
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp42 void link(NodeId Src, NodeId Dst) { in link()
46 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
47 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
80 bool identical(NodeId Id1, NodeId Id2) const;
83 bool isMatchingPossible(NodeId Id1, NodeId Id2) const;
97 NodeId findCandidate(const Mapping &M, NodeId Id1) const;
148 bool isInSubtree(NodeId Id, NodeId SubtreeRoot) const;
214 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
283 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder()
579 std::vector<std::pair<NodeId, NodeId>> Matches; in getMatchingNodes()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp43 void link(NodeId Src, NodeId Dst) { in link()
47 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
48 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
81 bool identical(NodeId Id1, NodeId Id2) const;
84 bool isMatchingPossible(NodeId Id1, NodeId Id2) const;
98 NodeId findCandidate(const Mapping &M, NodeId Id1) const;
149 bool isInSubtree(NodeId Id, NodeId SubtreeRoot) const;
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
284 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder()
580 std::vector<std::pair<NodeId, NodeId>> Matches; in getMatchingNodes()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp43 void link(NodeId Src, NodeId Dst) { in link()
47 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
48 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
81 bool identical(NodeId Id1, NodeId Id2) const;
84 bool isMatchingPossible(NodeId Id1, NodeId Id2) const;
98 NodeId findCandidate(const Mapping &M, NodeId Id1) const;
149 bool isInSubtree(NodeId Id, NodeId SubtreeRoot) const;
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
284 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder()
580 std::vector<std::pair<NodeId, NodeId>> Matches; in getMatchingNodes()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp43 void link(NodeId Src, NodeId Dst) { in link()
47 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
48 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
81 bool identical(NodeId Id1, NodeId Id2) const;
84 bool isMatchingPossible(NodeId Id1, NodeId Id2) const;
98 NodeId findCandidate(const Mapping &M, NodeId Id1) const;
149 bool isInSubtree(NodeId Id, NodeId SubtreeRoot) const;
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
284 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder()
580 std::vector<std::pair<NodeId, NodeId>> Matches; in getMatchingNodes()
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp43 void link(NodeId Src, NodeId Dst) { in link()
47 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
48 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
81 bool identical(NodeId Id1, NodeId Id2) const;
84 bool isMatchingPossible(NodeId Id1, NodeId Id2) const;
98 NodeId findCandidate(const Mapping &M, NodeId Id1) const;
149 bool isInSubtree(NodeId Id, NodeId SubtreeRoot) const;
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
284 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder()
580 std::vector<std::pair<NodeId, NodeId>> Matches; in getMatchingNodes()
[all …]
/dports/devel/llvm10/llvm-10.0.1.src/tools/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp42 void link(NodeId Src, NodeId Dst) { in link()
46 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
47 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
80 bool identical(NodeId Id1, NodeId Id2) const;
83 bool isMatchingPossible(NodeId Id1, NodeId Id2) const;
97 NodeId findCandidate(const Mapping &M, NodeId Id1) const;
148 bool isInSubtree(NodeId Id, NodeId SubtreeRoot) const;
214 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
283 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder()
579 std::vector<std::pair<NodeId, NodeId>> Matches; in getMatchingNodes()
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/tools/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp43 void link(NodeId Src, NodeId Dst) { in link()
47 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
48 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
81 bool identical(NodeId Id1, NodeId Id2) const;
84 bool isMatchingPossible(NodeId Id1, NodeId Id2) const;
98 NodeId findCandidate(const Mapping &M, NodeId Id1) const;
149 bool isInSubtree(NodeId Id, NodeId SubtreeRoot) const;
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
284 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder()
580 std::vector<std::pair<NodeId, NodeId>> Matches; in getMatchingNodes()
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp43 void link(NodeId Src, NodeId Dst) { in link()
47 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
48 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
81 bool identical(NodeId Id1, NodeId Id2) const;
84 bool isMatchingPossible(NodeId Id1, NodeId Id2) const;
98 NodeId findCandidate(const Mapping &M, NodeId Id1) const;
149 bool isInSubtree(NodeId Id, NodeId SubtreeRoot) const;
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
284 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder()
580 std::vector<std::pair<NodeId, NodeId>> Matches; in getMatchingNodes()
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp43 void link(NodeId Src, NodeId Dst) { in link()
47 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
48 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
81 bool identical(NodeId Id1, NodeId Id2) const;
84 bool isMatchingPossible(NodeId Id1, NodeId Id2) const;
98 NodeId findCandidate(const Mapping &M, NodeId Id1) const;
149 bool isInSubtree(NodeId Id, NodeId SubtreeRoot) const;
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
284 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder()
580 std::vector<std::pair<NodeId, NodeId>> Matches; in getMatchingNodes()
[all …]
/dports/devel/llvm90/llvm-9.0.1.src/tools/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp42 void link(NodeId Src, NodeId Dst) { in link()
46 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
47 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
80 bool identical(NodeId Id1, NodeId Id2) const;
83 bool isMatchingPossible(NodeId Id1, NodeId Id2) const;
97 NodeId findCandidate(const Mapping &M, NodeId Id1) const;
148 bool isInSubtree(NodeId Id, NodeId SubtreeRoot) const;
214 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
283 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder()
579 std::vector<std::pair<NodeId, NodeId>> Matches; in getMatchingNodes()
[all …]

12345678910>>...122