/dports/net/grive2/grive2-ffb744a/libgrive/src/xml/ |
H A D | NodeSet.cc | 30 NodeSet::NodeSet() : in NodeSet() function in gr::xml::NodeSet 40 NodeSet::NodeSet( iterator first, iterator last ) : in NodeSet() function in gr::xml::NodeSet 46 NodeSet::NodeSet( const NodeSet& n ) : in NodeSet() function in gr::xml::NodeSet 53 NodeSet& NodeSet::operator=( const NodeSet& ns ) in operator =() 55 NodeSet tmp( ns ) ; in operator =() 60 void NodeSet::Swap( NodeSet& ns ) in Swap() 67 NodeSet::iterator NodeSet::begin() const in begin() 72 NodeSet::iterator NodeSet::end() const in end() 86 NodeSet result ; in Find() 117 NodeSet NodeSet::operator[]( const std::string& name ) const in operator []() [all …]
|
H A D | NodeSet.hh | 32 class NodeSet class 40 NodeSet() ; 41 NodeSet( const NodeSet& n ) ; 42 NodeSet( iterator first, iterator last ) ; 44 NodeSet& operator=( const NodeSet& ns ) ; 45 void Swap( NodeSet& ns ) ; 55 NodeSet Find( const std::string& name, const std::string& value ) const ; 59 NodeSet operator[]( const std::string& name ) const ; 68 std::ostream& operator<<( std::ostream& os, const NodeSet& node ) ;
|
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/lib/ |
H A D | ExsltSets.java | 66 NodeSet ns1 = new NodeSet(nl1); in leading() 67 NodeSet leadNodes = new NodeSet(); in leading() 101 NodeSet ns1 = new NodeSet(nl1); in trailing() 130 NodeSet ns1 = new NodeSet(nl1); in intersection() 131 NodeSet ns2 = new NodeSet(nl2); in intersection() 132 NodeSet inter = new NodeSet(); in intersection() 160 NodeSet ns1 = new NodeSet(nl1); in difference() 161 NodeSet ns2 = new NodeSet(nl2); in difference() 163 NodeSet diff = new NodeSet(); in difference() 192 NodeSet dist = new NodeSet(); in distinct() [all …]
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/lib/ |
H A D | ExsltSets.java | 66 NodeSet ns1 = new NodeSet(nl1); in leading() 67 NodeSet leadNodes = new NodeSet(); in leading() 101 NodeSet ns1 = new NodeSet(nl1); in trailing() 130 NodeSet ns1 = new NodeSet(nl1); in intersection() 131 NodeSet ns2 = new NodeSet(nl2); in intersection() 132 NodeSet inter = new NodeSet(); in intersection() 160 NodeSet ns1 = new NodeSet(nl1); in difference() 161 NodeSet ns2 = new NodeSet(nl2); in difference() 163 NodeSet diff = new NodeSet(); in difference() 192 NodeSet dist = new NodeSet(); in distinct() [all …]
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/lib/ |
H A D | ExsltSets.java | 66 NodeSet ns1 = new NodeSet(nl1); in leading() 67 NodeSet leadNodes = new NodeSet(); in leading() 101 NodeSet ns1 = new NodeSet(nl1); in trailing() 130 NodeSet ns1 = new NodeSet(nl1); in intersection() 131 NodeSet ns2 = new NodeSet(nl2); in intersection() 132 NodeSet inter = new NodeSet(); in intersection() 160 NodeSet ns1 = new NodeSet(nl1); in difference() 161 NodeSet ns2 = new NodeSet(nl2); in difference() 163 NodeSet diff = new NodeSet(); in difference() 192 NodeSet dist = new NodeSet(); in distinct() [all …]
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/lib/ |
H A D | ExsltSets.java | 66 NodeSet ns1 = new NodeSet(nl1); in leading() 67 NodeSet leadNodes = new NodeSet(); in leading() 101 NodeSet ns1 = new NodeSet(nl1); in trailing() 130 NodeSet ns1 = new NodeSet(nl1); in intersection() 131 NodeSet ns2 = new NodeSet(nl2); in intersection() 132 NodeSet inter = new NodeSet(); in intersection() 160 NodeSet ns1 = new NodeSet(nl1); in difference() 161 NodeSet ns2 = new NodeSet(nl2); in difference() 163 NodeSet diff = new NodeSet(); in difference() 192 NodeSet dist = new NodeSet(); in distinct() [all …]
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/lib/ |
H A D | ExsltSets.java | 66 NodeSet ns1 = new NodeSet(nl1); in leading() 67 NodeSet leadNodes = new NodeSet(); in leading() 101 NodeSet ns1 = new NodeSet(nl1); in trailing() 130 NodeSet ns1 = new NodeSet(nl1); in intersection() 131 NodeSet ns2 = new NodeSet(nl2); in intersection() 132 NodeSet inter = new NodeSet(); in intersection() 160 NodeSet ns1 = new NodeSet(nl1); in difference() 161 NodeSet ns2 = new NodeSet(nl2); in difference() 163 NodeSet diff = new NodeSet(); in difference() 192 NodeSet dist = new NodeSet(); in distinct() [all …]
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/lib/ |
H A D | ExsltSets.java | 66 NodeSet ns1 = new NodeSet(nl1); in leading() 67 NodeSet leadNodes = new NodeSet(); in leading() 101 NodeSet ns1 = new NodeSet(nl1); in trailing() 130 NodeSet ns1 = new NodeSet(nl1); in intersection() 131 NodeSet ns2 = new NodeSet(nl2); in intersection() 132 NodeSet inter = new NodeSet(); in intersection() 160 NodeSet ns1 = new NodeSet(nl1); in difference() 161 NodeSet ns2 = new NodeSet(nl2); in difference() 163 NodeSet diff = new NodeSet(); in difference() 192 NodeSet dist = new NodeSet(); in distinct() [all …]
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/lib/ |
H A D | ExsltSets.java | 66 NodeSet ns1 = new NodeSet(nl1); in leading() 67 NodeSet leadNodes = new NodeSet(); in leading() 101 NodeSet ns1 = new NodeSet(nl1); in trailing() 130 NodeSet ns1 = new NodeSet(nl1); in intersection() 131 NodeSet ns2 = new NodeSet(nl2); in intersection() 132 NodeSet inter = new NodeSet(); in intersection() 160 NodeSet ns1 = new NodeSet(nl1); in difference() 161 NodeSet ns2 = new NodeSet(nl2); in difference() 163 NodeSet diff = new NodeSet(); in difference() 192 NodeSet dist = new NodeSet(); in distinct() [all …]
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/lib/ |
H A D | ExsltSets.java | 66 NodeSet ns1 = new NodeSet(nl1); in leading() 67 NodeSet leadNodes = new NodeSet(); in leading() 101 NodeSet ns1 = new NodeSet(nl1); in trailing() 130 NodeSet ns1 = new NodeSet(nl1); in intersection() 131 NodeSet ns2 = new NodeSet(nl2); in intersection() 132 NodeSet inter = new NodeSet(); in intersection() 160 NodeSet ns1 = new NodeSet(nl1); in difference() 161 NodeSet ns2 = new NodeSet(nl2); in difference() 163 NodeSet diff = new NodeSet(); in difference() 192 NodeSet dist = new NodeSet(); in distinct() [all …]
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jaxp/src/com/sun/org/apache/xalan/internal/lib/ |
H A D | ExsltSets.java | 66 NodeSet ns1 = new NodeSet(nl1); in leading() 67 NodeSet leadNodes = new NodeSet(); in leading() 101 NodeSet ns1 = new NodeSet(nl1); in trailing() 130 NodeSet ns1 = new NodeSet(nl1); in intersection() 131 NodeSet ns2 = new NodeSet(nl2); in intersection() 132 NodeSet inter = new NodeSet(); in intersection() 160 NodeSet ns1 = new NodeSet(nl1); in difference() 161 NodeSet ns2 = new NodeSet(nl2); in difference() 163 NodeSet diff = new NodeSet(); in difference() 192 NodeSet dist = new NodeSet(); in distinct() [all …]
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jaxp/src/com/sun/org/apache/xalan/internal/lib/ |
H A D | ExsltSets.java | 66 NodeSet ns1 = new NodeSet(nl1); in leading() 67 NodeSet leadNodes = new NodeSet(); in leading() 101 NodeSet ns1 = new NodeSet(nl1); in trailing() 130 NodeSet ns1 = new NodeSet(nl1); in intersection() 131 NodeSet ns2 = new NodeSet(nl2); in intersection() 132 NodeSet inter = new NodeSet(); in intersection() 160 NodeSet ns1 = new NodeSet(nl1); in difference() 161 NodeSet ns2 = new NodeSet(nl2); in difference() 163 NodeSet diff = new NodeSet(); in difference() 192 NodeSet dist = new NodeSet(); in distinct() [all …]
|
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphicalModels/ |
H A D | DAGmodel.h | 115 const NodeSet& parents(const NodeId id) const; 119 NodeSet parents(const NodeSet& ids) const; 128 NodeSet family(const NodeId id) const; 129 NodeSet family(const std::string& name) const; 137 const NodeSet& children(const NodeId id) const; 141 NodeSet children(const NodeSet& ids) const; 151 NodeSet descendants(const NodeId id) const; 152 NodeSet descendants(const std::string& name) const; 161 NodeSet ancestors(const NodeId id) const; 162 NodeSet ancestors(const std::string& name) const; [all …]
|
H A D | DAGmodel_inl.h | 55 INLINE const NodeSet& DAGmodel::parents(const std::string& name) const { in parents() 59 INLINE NodeSet DAGmodel::family(const NodeId id) const { return dag_.family(id); } in family() 61 INLINE NodeSet DAGmodel::family(const std::string& name) const { in family() 66 INLINE const NodeSet& DAGmodel::children(const std::string& name) const { in children() 70 INLINE NodeSet DAGmodel::children(const NodeSet& ids) const { return dag_.children(ids); } in children() 76 INLINE NodeSet DAGmodel::parents(const NodeSet& ids) const { return dag_.children(ids); } in parents() 78 INLINE NodeSet DAGmodel::parents(const std::vector< std::string >& names) const { in parents() 92 INLINE NodeSet DAGmodel::descendants(const std::string& name) const { in descendants() 98 INLINE NodeSet DAGmodel::ancestors(const std::string& name) const { in ancestors() 109 INLINE UndiGraph DAGmodel::moralizedAncestralGraph(const NodeSet& nodes) const { in moralizedAncestralGraph() [all …]
|
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/MN/inference/tools/ |
H A D | jointTargetedMNInference.h | 157 virtual void addJointTarget(const NodeSet& joint_target) final; 162 virtual void eraseJointTarget(const NodeSet& joint_target) final; 165 virtual bool isJointTarget(const NodeSet& vars) const final; 168 virtual const Set< NodeSet >& jointTargets() const noexcept final; 185 Potential< GUM_SCALAR > evidenceJointImpact(const NodeSet& targets, const NodeSet& evs); 245 GUM_SCALAR jointMutualInformation(const NodeSet& targets); 259 virtual bool isExactJointComputable_(const NodeSet& vars); 260 virtual NodeSet superForJointComputable_(const NodeSet& vars); 267 virtual void onJointTargetAdded_(const NodeSet& set) = 0; 271 virtual void onJointTargetErased_(const NodeSet& set) = 0; [all …]
|
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/wrappers/pyAgrum/pyLibs/causal/ |
H A D | _dSeparation.py | 52 def _reduce_moralize(bn: "pyAgrum.BayesNet", x: NodeSet, y: NodeSet, zset: NodeSet) -> "pyAgrum.Und… argument 95 def _is_path_x_y(g_undi: "pyAgrum.UndiGraph", sx: NodeSet, sy: NodeSet, marked: NodeSet = None) -> … argument 137 def isDSep_tech2(bn: "pyAgrum.BayesNet", sx: NodeSet, sy: NodeSet, zset: NodeSet) -> bool: argument 157 def isDSep_parents(bn: "pyAgrum.BayesNet", sx: NodeSet, sy: NodeSet, zset: NodeSet) -> bool: argument 163 def _isDSep_tech2_parents(bn: "pyAgrum.BayesNet", sx: NodeSet, sy: NodeSet, zset: NodeSet) -> bool: argument 197 def _isDSep_tech2_children(bn: "pyAgrum.BayesNet", sx: NodeSet, sy: NodeSet, zset: NodeSet) -> bool: argument 265 …endants(bn: "pyAgrum.BayesNet", x: NodeId, marked: NodeSet = None, ensdesc: NodeSet = None) -> Nod… argument 312 def _barren_nodes(bn: "pyAgrum.BayesNet", interest: NodeSet = None) -> NodeSet: argument 375 def _blocked(bn: "pyAgrum.BayesNet", pht: bool, x: NodeSet, y: NodeSet, setz: NodeSet, argument 442 def isDSep_tech1(bn: "pyAgrum.BayesNet", sx: NodeSet, sy: NodeSet, setz: NodeSet, reduced=False) ->… argument [all …]
|
/dports/math/gecode/gecode-0916a1a/gecode/int/ |
H A D | bin-packing.hh | 197 NodeSet(void); 199 NodeSet(Region& r, int n); 201 NodeSet(Region& r, int n, const NodeSet& ns); 222 static bool iwn(NodeSet& iwa, const NodeSet& a, 223 NodeSet& iwb, const NodeSet& b, 231 NodeSet n; 246 const NodeSet& ns; 251 Nodes(const NodeSet& ns); 271 NodeSet n; 285 int pivot(const NodeSet& a, const NodeSet& b) const; [all …]
|
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/BN/inference/tools/ |
H A D | jointTargetedInference.h | 94 virtual const Potential< GUM_SCALAR >& jointPosterior(const NodeSet& nodes) final; 157 virtual void addJointTarget(const NodeSet& joint_target) final; 162 virtual void eraseJointTarget(const NodeSet& joint_target) final; 165 virtual bool isJointTarget(const NodeSet& vars) const final; 168 virtual const Set< NodeSet >& jointTargets() const noexcept final; 185 Potential< GUM_SCALAR > evidenceJointImpact(const NodeSet& targets, const NodeSet& evs); 245 GUM_SCALAR jointMutualInformation(const NodeSet& targets); 262 virtual void onJointTargetAdded_(const NodeSet& set) = 0; 266 virtual void onJointTargetErased_(const NodeSet& set) = 0; 278 virtual const Potential< GUM_SCALAR >& jointPosterior_(const NodeSet& set) = 0; [all …]
|
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/mesquite/unit/ |
H A D | NodeSetTest.cpp | 77 NodeSet set; in test_init() 83 NodeSet set; in test_clear() 97 NodeSet set; in test_set_get_clear_simple() 130 NodeSet set; in test_set_get_clear_dim() 163 NodeSet set; in test_set_node() 189 NodeSet set; in test_clear_node() 218 NodeSet set; in test_num_nodes() 250 NodeSet set; in test_have_any() 346 NodeSet set; in test_set_all() 364 NodeSet set; in test_clear_all() [all …]
|
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphs/parts/ |
H A D | arcGraphPart_inl.h | 61 NodeSet res{id}; in family() 66 INLINE NodeSet ArcGraphPart::children(const NodeSet& ids) const { in children() 67 NodeSet res; in children() 74 INLINE NodeSet ArcGraphPart::parents(const NodeSet& ids) const { in parents() 75 NodeSet res; in parents() 82 INLINE NodeSet ArcGraphPart::family(const NodeSet& ids) const { in family() 83 NodeSet res; in family() 125 NodeSet& parents = *(_parents_[id]); in eraseParents() 139 NodeSet& children = *(_children_[id]); in eraseChildren() 158 NodeSet& parents = *(_parents_[id]); in unvirtualizedEraseParents() [all …]
|
H A D | arcGraphPart.h | 171 const NodeSet& parents(NodeId id) const; 179 NodeSet family(NodeId id) const; 187 NodeSet descendants(NodeId id) const; 196 NodeSet ancestors(NodeId id) const; 199 NodeSet children(const NodeSet& ids) const; 202 NodeSet parents(const NodeSet& ids) const; 205 NodeSet family(const NodeSet& ids) const; 212 const NodeSet& children(NodeId id) const; 304 mutable NodeProperty< NodeSet* > _parents_; 307 mutable NodeProperty< NodeSet* > _children_;
|
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphs/ |
H A D | cliqueGraph.h | 115 NodeId addNode(const NodeSet& clique); 124 virtual void addNode(const NodeId id, const NodeSet& clique); 146 const NodeSet& clique(const NodeId idClique) const; 186 const NodeSet& separator(const Edge& edge) const; 240 NodeProperty< NodeSet > _cliques_; 243 EdgeProperty< NodeSet > _separators_; 254 NodeSet visited_cliques; 261 NodeSet nodes_other_components; 264 NodeSet nodes_DFS_forbidden; 267 NodeSet nodes_DFS_seen; [all …]
|
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/BN/ |
H A D | IBayesNet.h | 220 NodeSet minimalCondSet(NodeId target, const NodeSet& soids) const; 228 NodeSet minimalCondSet(const NodeSet& targets, const NodeSet& soids) const; 232 const NodeSet& soids, 233 NodeSet& minimal, 234 NodeSet& alreadyVisitedUp, 235 NodeSet& alreadyVisitedDn) const; 237 const NodeSet& soids, 238 NodeSet& minimal, 239 NodeSet& alreadyVisitedUp, 240 NodeSet& alreadyVisitedDn) const;
|
/dports/devel/onetbb/oneTBB-2021.4.0/include/oneapi/tbb/detail/ |
H A D | _flow_graph_nodes_deduction.h | 106 template <typename NodeSet> 119 template <typename NodeSet> 122 template <typename NodeSet> 126 template <typename NodeSet> 127 buffer_node(const NodeSet&) 130 template <typename NodeSet> 131 queue_node(const NodeSet&) 144 template <typename NodeSet> 146 ->priority_queue_node<decide_on_set_t<NodeSet>, std::less<decide_on_set_t<NodeSet>>>; 195 template <typename NodeSet> [all …]
|
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/light/ |
H A D | nodeset.go | 31 type NodeSet struct { struct 40 func NewNodeSet() *NodeSet { 41 return &NodeSet{ 47 func (db *NodeSet) Put(key []byte, value []byte) error { argument 64 func (db *NodeSet) Delete(key []byte) error { argument 73 func (db *NodeSet) Get(key []byte) ([]byte, error) { argument 84 func (db *NodeSet) Has(key []byte) (bool, error) { argument 90 func (db *NodeSet) KeyCount() int { argument 98 func (db *NodeSet) DataSize() int { argument 106 func (db *NodeSet) NodeList() NodeList { argument [all …]
|