/dports/math/clingo/clingo-5.5.1/libgringo/gringo/ground/ |
H A D | dependency.hh | 105 typename G::Node *graphNode = nullptr; member 231 for (auto &z : std::get<1>(y)) { x->graphNode->insertEdge(*z->graphNode); } in analyze() 241 for (auto &graphNode : scc) { graphNode->data->negSCC = negSCC; } in analyze() local 243 for (auto &graphNode : scc) { in analyze() local 245 for (auto &x : graphNode->data->depend) { in analyze() 253 … for (auto &graphNode : scc) { graphNode->data->graphNode = &gg.insertNode(graphNode->data); } in analyze() local 254 for (auto &graphNode : scc) { in analyze() local 255 for (auto &x : graphNode->data->depend) { in analyze() 258 … if (y->negSCC == negSCC) { graphNode->data->graphNode->insertEdge(*y->graphNode); } in analyze() 267 for (auto &graphNode : scc) { graphNode->data->posSCC = posSCC; } in analyze() local [all …]
|
/dports/cad/opencascade/opencascade-7.6.0/src/TFunction/ |
H A D | TFunction_IFunction.cxx | 46 graphNode->RemoveAllPrevious(); in NewFunction() 47 graphNode->RemoveAllNext(); in NewFunction() 48 graphNode->SetStatus(TFunction_ES_WrongDefinition); in NewFunction() 73 Handle(TFunction_GraphNode) graphNode; in DeleteFunction() local 74 if (L.FindAttribute(TFunction_GraphNode::GetID(), graphNode)) in DeleteFunction() 77 const TColStd_MapOfInteger& next = graphNode->GetNext(); in DeleteFunction() 102 L.ForgetAttribute(graphNode); in DeleteFunction() 142 graphNode->RemoveAllPrevious(); in UpdateDependencies() 143 graphNode->RemoveAllNext(); in UpdateDependencies() 438 Handle(TFunction_GraphNode) graphNode; in Handle() local [all …]
|
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/cmd/compile/internal/types2/ |
H A D | initorder.go | 64 n := heap.Pop(&pq).(*graphNode) 187 type graphNode struct { struct 196 func (n *graphNode) cost() int { argument 200 type nodeSet map[*graphNode]bool 202 func (s *nodeSet) add(p *graphNode) { argument 212 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 214 M := make(map[dependency]*graphNode) 218 M[obj] = &graphNode{obj: obj} 237 var G, funcG []*graphNode // separate non-functions and functions 296 type nodeQueue []*graphNode
|
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/go/types/ |
H A D | initorder.go | 64 n := heap.Pop(&pq).(*graphNode) 181 type graphNode struct { struct 190 func (n *graphNode) cost() int { argument 194 type nodeSet map[*graphNode]bool 196 func (s *nodeSet) add(p *graphNode) { argument 206 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 208 M := make(map[dependency]*graphNode) 212 M[obj] = &graphNode{obj: obj} 231 var G, funcG []*graphNode // separate non-functions and functions 290 type nodeQueue []*graphNode
|
/dports/x11-toolkits/qt5-quick3d/kde-qtquick3d-5.15.2p19/src/quick3d/ |
H A D | qquick3dscenemanager.cpp | 193 QSSGRenderNode *graphNode = static_cast<QSSGRenderNode *>(itemPriv->spatialNode); in updateDirtySpatialNode() local 195 if (graphNode && graphNode->parent && dirty & QQuick3DObjectPrivate::ParentChanged) { in updateDirtySpatialNode() 201 graphNode->parent->removeChild(*graphNode); in updateDirtySpatialNode() 202 parentGraphNode->addChild(*graphNode); in updateDirtySpatialNode() 207 if (graphNode && graphNode->parent == nullptr) { in updateDirtySpatialNode() 220 parentGraphNode->addChild(*graphNode); in updateDirtySpatialNode() 229 static_cast<QSSGRenderNode *>(sceneRoot->spatialNode)->addChild(*graphNode); in updateDirtySpatialNode()
|
/dports/lang/gcc12-devel/gcc-12-20211205/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/lang/gcc8/gcc-8.5.0/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/net/google-cloud-sdk-app-engine-go/platform/google_appengine/goroot-1.9/src/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/lang/gcc10/gcc-10.3.0/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/lang/go-devel/go-dragonfly-amd64-bootstrap/src/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/lang/gcc11/gcc-11.2.0/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/lang/gcc11-devel/gcc-11-20211009/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/lang/gcc9-devel/gcc-9-20211007/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/devel/riscv64-gcc/gcc-8.3.0/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/devel/avr-gcc/gcc-10.2.0/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/lang/gcc10-devel/gcc-10-20211008/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/lang/gcc9/gcc-9.4.0/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/lang/gcc9-aux/gcc-9.1.0/libgo/go/go/types/ |
H A D | initorder.go | 63 n := heap.Pop(&pq).(*graphNode) 180 type graphNode struct { struct 187 type nodeSet map[*graphNode]bool 189 func (s *nodeSet) add(p *graphNode) { argument 199 func dependencyGraph(objMap map[Object]*declInfo) []*graphNode { 201 M := make(map[dependency]*graphNode) 205 M[obj] = &graphNode{obj: obj} 229 var G []*graphNode 270 type nodeQueue []*graphNode
|
/dports/math/ogdf/OGDF/src/ogdf/fileformats/ |
H A D | GraphIO_graphml.cpp | 54 pugi::xml_node graphNode = xmlNode.append_child("graph"); in writeGraphTag() local 55 graphNode.append_attribute("id") = "G"; in writeGraphTag() 58 return graphNode; in writeGraphTag() 440 writeGraphMLNode(graphNode, v); in writeGraphML() 444 writeGraphMLEdge(graphNode, e); in writeGraphML() 465 writeGraphMLCluster(graphNode, G, C.rootCluster(), 0); in writeGraphML() 468 writeGraphMLEdge(graphNode, e); in writeGraphML() 492 writeGraphMLNode(graphNode, GA, v); in writeGraphML() 496 writeGraphMLEdge(graphNode, GA, e); in writeGraphML() 519 writeGraphMLCluster(graphNode, CA, C.rootCluster(), 0); in writeGraphML() [all …]
|
/dports/misc/usd/USD-21.11/pxr/usd/pcp/ |
H A D | node.cpp | 90 const PcpPrimIndex_Graph::_Node& graphNode = \ 92 return graphNode.varName; \ 101 const PcpPrimIndex_Graph::_Node& graphNode = \ 103 if (graphNode.varName == \ 106 return graphNode.varName; \ 111 const PcpPrimIndex_Graph::_Node& graphNode = \ 113 if (graphNode.varName != val) { \
|