| /dports/graphics/vpaint/vpaint-1.7/src/Gui/VectorAnimationComplex/ |
| H A D | CycleHelper.cpp | 107 leftNode(0), in CycleHelper()
115 Vertex * leftNode; in CycleHelper() member
140 …Vertex * parentNode() { if(parent->leftNode == this) return parent->rightNode; else return parent-… in CycleHelper()
172 if(!leftNode) in CycleHelper()
174 leftNode = new Vertex(startVertex); in CycleHelper()
175 subcomplexNodes << leftNode; in CycleHelper()
176 vertexToNode[startVertex] = leftNode; in CycleHelper()
178 edge->leftNode = leftNode; in CycleHelper()
179 leftNode->edges << edge; in CycleHelper()
314 Vertex * leftNode = edge->leftNode; in CycleHelper() local
[all …]
|
| /dports/devel/kdevelop/kdevelop-21.12.3/kdevplatform/language/util/ |
| H A D | setrepository.cpp | 163 if (data->leftNode()) { in destroy()
192 if (data.leftNode()) in ~SetNodeDataRequest()
203 Q_ASSERT((data.rightNode() && data.leftNode()) || (!data.rightNode() && !data.leftNode())); in createItem()
209 Q_ASSERT((item->rightNode() && item->leftNode()) || (!item->rightNode() && !item->leftNode())); in createItem()
231 return item->leftNode() == data.leftNode() && item->rightNode() == data.rightNode() && in equals()
295 Q_ASSERT(!node->leftNode() || in localCheck()
311 if (node->leftNode()) in check()
340 if (node.leftNode()) { in dumpDotGraphInternal()
689 if (lhs->leftNode() != rhs->leftNode() || lhs->rightNode() != rhs->rightNode()) in set_equals()
796 const SetNodeData* leftNode = nodeFromIndex(node->leftNode()); in set_contains() local
[all …]
|
| /dports/science/chrono/chrono-7.0.1/src/chrono_thirdparty/HACD/ |
| H A D | hacdRaycastMesh.cpp | 151 RMNode & leftNode = m_rm->m_nodes[m_idLeft]; in Create() local
153 leftNode.m_id = m_idLeft; in Create()
155 leftNode.m_bBox = m_bBox; in Create()
157 leftNode.m_rm = m_rm; in Create()
162 leftNode.m_bBox.m_max.X() = leftNode.m_bBox.m_max.X() - d.X() * 0.5; in Create()
167 leftNode.m_bBox.m_max.Y() = leftNode.m_bBox.m_max.Y() - d.Y() * 0.5; in Create()
172 leftNode.m_bBox.m_max.Z() = leftNode.m_bBox.m_max.Z() - d.Z() * 0.5; in Create()
180 leftNode.m_triIDs.Resize(m_triIDs.Size()); in Create()
195 vertices[v].X() >= leftNode.m_bBox.m_min.X() && in Create()
199 vertices[v].Z() >= leftNode.m_bBox.m_min.Z() ) in Create()
[all …]
|
| /dports/lang/mono/mono-5.10.1.57/mcs/class/Mono.Parallel/Mono.Collections.Concurrent/ |
| H A D | ConcurrentOrderedList.cs | 224 Node rightNode = null, rightNodeNext = null, leftNode = null; in ListDelete()
228 rightNode = ListSearch (key, ref leftNode); in ListDelete()
240 if (Interlocked.CompareExchange (ref leftNode.Next, rightNodeNext, rightNode) != rightNodeNext) in ListDelete()
241 ListSearch (rightNode.Key, ref leftNode); in ListDelete()
248 Node rightNode = null, rightNodeNext = null, leftNode = head; in ListPop()
265 ListSearch (rightNode.Key, ref leftNode); in ListPop()
273 Node rightNode = null, leftNode = null; in ListInsert()
276 rightNode = ListSearch (key, ref leftNode); in ListInsert()
281 if (Interlocked.CompareExchange (ref leftNode.Next, newNode, rightNode) == rightNode) in ListInsert()
288 Node rightNode = null, leftNode = null; in ListFind()
[all …]
|
| /dports/devel/spark/spark-2.1.1/mllib/src/main/scala/org/apache/spark/mllib/tree/model/ |
| H A D | Node.scala | 50 @Since("1.0.0") var leftNode: Option[Node],
71 leftNode.get.predict(features)
77 leftNode.get.predict(features)
89 val leftNodeCopy = if (leftNode.isEmpty) {
92 Some(leftNode.get.deepCopy())
109 2 + leftNode.get.numDescendants + rightNode.get.numDescendants
119 1 + math.max(leftNode.get.subtreeDepth, rightNode.get.subtreeDepth)
147 leftNode.get.subtreeToString(indentFactor + 1) +
155 Iterator.single(this) ++ leftNode.map(_.subtreeIterator).getOrElse(Iterator.empty) ++
238 tmpNode = tmpNode.leftNode.get
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/mongo/db/update/ |
| H A D | update_node.cpp | 42 std::unique_ptr<UpdateNode> UpdateNode::createUpdateNodeByMerging(const UpdateNode& leftNode, in createUpdateNodeByMerging() argument
45 if (leftNode.type == UpdateNode::Type::Object && rightNode.type == UpdateNode::Type::Object) { in createUpdateNodeByMerging()
47 static_cast<const UpdateObjectNode&>(leftNode), in createUpdateNodeByMerging()
50 } else if (leftNode.type == UpdateNode::Type::Array && in createUpdateNodeByMerging()
53 static_cast<const UpdateArrayNode&>(leftNode), in createUpdateNodeByMerging()
|
| /dports/misc/concourse/concourse-6.7.2/vendor/code.cloudfoundry.org/credhub-cli/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 114 for _, leftNode := range lastLayer {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
135 for _, leftNode := range bg.Left {
136 if used[leftNode] {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
145 currentLayer = append(currentLayer, leftNode)
146 used[leftNode] = true
|
| /dports/security/lego/lego-4.5.3/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 119 for _, leftNode := range lastLayer {
125 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
140 for _, leftNode := range bg.Left {
141 if used[leftNode.ID] {
145 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
150 currentLayer = append(currentLayer, leftNode)
151 used[leftNode.ID] = true
|
| /dports/textproc/spiff/spiff-1.0.8/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 115 for _, leftNode := range lastLayer {
121 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
136 for _, leftNode := range bg.Left {
137 if used[leftNode] {
141 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
146 currentLayer = append(currentLayer, leftNode)
147 used[leftNode] = true
|
| /dports/devel/app-builder/app-builder-3.4.2/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 114 for _, leftNode := range lastLayer {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
135 for _, leftNode := range bg.Left {
136 if used[leftNode] {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
145 currentLayer = append(currentLayer, leftNode)
146 used[leftNode] = true
|
| /dports/devel/lazygit/lazygit-0.31.4/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 114 for _, leftNode := range lastLayer {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
135 for _, leftNode := range bg.Left {
136 if used[leftNode] {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
145 currentLayer = append(currentLayer, leftNode)
146 used[leftNode] = true
|
| /dports/security/lego/lego-4.5.3/vendor/github.com/infobloxopen/infoblox-go-client/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 114 for _, leftNode := range lastLayer {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
135 for _, leftNode := range bg.Left {
136 if used[leftNode] {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
145 currentLayer = append(currentLayer, leftNode)
146 used[leftNode] = true
|
| /dports/net/storj/storj-1.45.3/vendor/github.com/cloudfoundry/gosigar/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 114 for _, leftNode := range lastLayer {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
135 for _, leftNode := range bg.Left {
136 if used[leftNode] {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
145 currentLayer = append(currentLayer, leftNode)
146 used[leftNode] = true
|
| /dports/databases/cayley/cayley-0.7.5-2-gcf576ba/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 114 for _, leftNode := range lastLayer {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
135 for _, leftNode := range bg.Left {
136 if used[leftNode] {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
145 currentLayer = append(currentLayer, leftNode)
146 used[leftNode] = true
|
| /dports/net/concourse-fly/concourse-6.7.1/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 119 for _, leftNode := range lastLayer {
125 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
140 for _, leftNode := range bg.Left {
141 if used[leftNode.ID] {
145 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
150 currentLayer = append(currentLayer, leftNode)
151 used[leftNode.ID] = true
|
| /dports/misc/concourse/concourse-6.7.2/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 119 for _, leftNode := range lastLayer {
125 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
140 for _, leftNode := range bg.Left {
141 if used[leftNode.ID] {
145 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
150 currentLayer = append(currentLayer, leftNode)
151 used[leftNode.ID] = true
|
| /dports/www/grafana8/grafana-8.3.6/vendor/github.com/yudai/gojsondiff/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 115 for _, leftNode := range lastLayer {
121 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
136 for _, leftNode := range bg.Left {
137 if used[leftNode] {
141 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
146 currentLayer = append(currentLayer, leftNode)
147 used[leftNode] = true
|
| /dports/www/oauth2-proxy/oauth2-proxy-7.2.0/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 119 for _, leftNode := range lastLayer {
125 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
140 for _, leftNode := range bg.Left {
141 if used[leftNode.ID] {
145 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
150 currentLayer = append(currentLayer, leftNode)
151 used[leftNode.ID] = true
|
| /dports/net/bosh-cli/bosh-cli-5.5.0/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 114 for _, leftNode := range lastLayer {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
135 for _, leftNode := range bg.Left {
136 if used[leftNode] {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
145 currentLayer = append(currentLayer, leftNode)
146 used[leftNode] = true
|
| /dports/net/bosh-bootloader/bosh-bootloader-7.2.12/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 114 for _, leftNode := range lastLayer {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
135 for _, leftNode := range bg.Left {
136 if used[leftNode] {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
145 currentLayer = append(currentLayer, leftNode)
146 used[leftNode] = true
|
| /dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/nomad/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 114 for _, leftNode := range lastLayer {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
135 for _, leftNode := range bg.Left {
136 if used[leftNode] {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
145 currentLayer = append(currentLayer, leftNode)
146 used[leftNode] = true
|
| /dports/dns/blocky/blocky-0.17/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 119 for _, leftNode := range lastLayer {
125 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
140 for _, leftNode := range bg.Left {
141 if used[leftNode.ID] {
145 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
150 currentLayer = append(currentLayer, leftNode)
151 used[leftNode.ID] = true
|
| /dports/misc/concourse/concourse-6.7.2/vendor/github.com/cloudfoundry/socks5-proxy/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 114 for _, leftNode := range lastLayer {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
135 for _, leftNode := range bg.Left {
136 if used[leftNode] {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
145 currentLayer = append(currentLayer, leftNode)
146 used[leftNode] = true
|
| /dports/sysutils/istio/istio-1.6.7/vendor/sigs.k8s.io/service-apis/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 114 for _, leftNode := range lastLayer {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
135 for _, leftNode := range bg.Left {
136 if used[leftNode] {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
145 currentLayer = append(currentLayer, leftNode)
146 used[leftNode] = true
|
| /dports/sysutils/kubectl/kubernetes-1.22.2/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 119 for _, leftNode := range lastLayer {
125 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
140 for _, leftNode := range bg.Left {
141 if used[leftNode.ID] {
145 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
150 currentLayer = append(currentLayer, leftNode)
151 used[leftNode.ID] = true
|