| /dports/lang/mono/mono-5.10.1.57/mcs/class/Mono.Parallel/Mono.Collections.Concurrent/ |
| H A D | ConcurrentOrderedList.cs | 204 rightNode = t; in ListSearch()
207 if (rightNode != tail && rightNode.Next.Marked) in ListSearch()
210 return rightNode; in ListSearch()
214 if (rightNode != tail && rightNode.Next.Marked) in ListSearch()
217 return rightNode; in ListSearch()
229 if (rightNode == tail || rightNode.Key != key) in ListDelete()
232 data = rightNode.Data; in ListDelete()
252 rightNode = head.Next; in ListPop()
253 if (rightNode == tail) in ListPop()
277 if (rightNode != tail && rightNode.Key == key) in ListInsert()
[all …]
|
| /dports/lang/mono/mono-5.10.1.57/mcs/class/System.Web/System.Collections.Concurrent/ |
| H A D | SplitOrderedList.cs | 340 rightNode = t; in ListSearch()
343 if (rightNode != tail && rightNode.Next.Marked) in ListSearch()
346 return rightNode; in ListSearch()
350 if (rightNode != tail && rightNode.Next.Marked) in ListSearch()
353 return rightNode; in ListSearch()
366 if (rightNode == tail || rightNode.Key != key || !comparer.Equals (subKey, rightNode.SubKey)) in ListDelete()
369 data = rightNode.Data; in ListDelete()
395 …if (rightNode != tail && rightNode.Key == key && comparer.Equals (newNode.SubKey, rightNode.SubKey… in ListInsert()
398 newNode.Next = rightNode; in ListInsert()
412 data = rightNode; in ListFind()
[all …]
|
| /dports/irc/smuxi/smuxi-1.1/lib/ServiceStack/src/ServiceStack.Common/Net30/ |
| H A D | SplitOrderedList.cs | 349 rightNode = t; in ListSearch()
352 if (rightNode != tail && rightNode.Next.Marked) in ListSearch()
355 return rightNode; in ListSearch()
360 if (rightNode != tail && rightNode.Next.Marked) in ListSearch()
376 if (rightNode == tail || rightNode.Key != key) in ListDelete()
379 data = rightNode.Data; in ListDelete()
392 … if (Interlocked.CompareExchange (ref leftNode.Next, rightNodeNext, rightNode) != rightNode) in ListDelete()
407 …if (rightNode != tail && rightNode.Key == key && comparer.Equals (newNode.SubKey, rightNode.SubKey… in ListInsert()
413 … if (Interlocked.CompareExchange (ref leftNode.Next, newNode, rightNode) == rightNode) in ListInsert()
424 data = rightNode; in ListFind()
[all …]
|
| /dports/sysutils/istio/istio-1.6.7/vendor/github.com/antlr/antlr4/runtime/CSharp/runtime/CSharp/Antlr4.Runtime/Sharpen/Compat/ |
| H A D | SplitOrderedList.cs | 340 rightNode = t; in ListSearch()
343 if (rightNode != tail && rightNode.Next.Marked) in ListSearch()
346 return rightNode; in ListSearch()
350 if (rightNode != tail && rightNode.Next.Marked) in ListSearch()
353 return rightNode; in ListSearch()
366 if (rightNode == tail || rightNode.Key != key || !comparer.Equals (subKey, rightNode.SubKey)) in ListDelete()
369 data = rightNode.Data; in ListDelete()
395 …if (rightNode != tail && rightNode.Key == key && comparer.Equals (newNode.SubKey, rightNode.SubKey… in ListInsert()
398 newNode.Next = rightNode; in ListInsert()
412 data = rightNode; in ListFind()
[all …]
|
| /dports/graphics/vpaint/vpaint-1.7/src/Gui/VectorAnimationComplex/ |
| H A D | CycleHelper.cpp | 108 rightNode(0), in CycleHelper()
116 Vertex * rightNode; in CycleHelper() member
184 if(!rightNode) in CycleHelper()
186 rightNode = new Vertex(endVertex); in CycleHelper()
187 subcomplexNodes << rightNode; in CycleHelper()
188 vertexToNode[endVertex] = rightNode; in CycleHelper()
190 edge->rightNode = rightNode; in CycleHelper()
191 rightNode->edges << edge; in CycleHelper()
315 Vertex * rightNode = edge->rightNode; in CycleHelper() local
326 if(rightNode != leftNode && rightNode->edges.size() == 0) in CycleHelper()
[all …]
|
| /dports/devel/kdevelop/kdevelop-21.12.3/kdevplatform/language/util/ |
| H A D | setrepository.cpp | 194 if (data.rightNode()) 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()
228 Q_ASSERT((item->rightNode() && item->leftNode()) || (!item->rightNode() && !item->leftNode())); in equals()
231 return item->leftNode() == data.leftNode() && item->rightNode() == data.rightNode() && in equals()
294 Q_ASSERT((node->leftNode() && node->rightNode()) || (!node->leftNode() && !node->rightNode())); in localCheck()
313 if (node->rightNode()) in check()
343 Q_ASSERT(node.rightNode()); in dumpDotGraphInternal()
689 if (lhs->leftNode() != rhs->leftNode() || lhs->rightNode() != rhs->rightNode()) in set_equals()
801 const SetNodeData* rightNode = nodeFromIndex(node->rightNode()); in set_contains() local
[all …]
|
| /dports/devel/spark/spark-2.1.1/mllib/src/main/scala/org/apache/spark/mllib/tree/model/ |
| H A D | Node.scala | 51 @Since("1.0.0") var rightNode: Option[Node],
73 rightNode.get.predict(features)
79 rightNode.get.predict(features)
94 val rightNodeCopy = if (rightNode.isEmpty) {
97 Some(rightNode.get.deepCopy())
109 2 + leftNode.get.numDescendants + rightNode.get.numDescendants
119 1 + math.max(leftNode.get.subtreeDepth, rightNode.get.subtreeDepth)
149 rightNode.get.subtreeToString(indentFactor + 1)
156 rightNode.map(_.subtreeIterator).getOrElse(Iterator.empty)
240 tmpNode = tmpNode.rightNode.get
|
| /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 | 115 for _, rightNode := range bg.Right {
116 if used[rightNode] {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
125 currentLayer = append(currentLayer, rightNode)
126 used[rightNode] = true
128 if matching.Free(rightNode) {
134 for _, rightNode := range lastLayer {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /dports/security/lego/lego-4.5.3/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 120 for _, rightNode := range bg.Right {
121 if used[rightNode.ID] {
125 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
130 currentLayer = append(currentLayer, rightNode)
131 used[rightNode.ID] = true
133 if matching.Free(rightNode) {
139 for _, rightNode := range lastLayer {
145 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /dports/textproc/spiff/spiff-1.0.8/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 116 for _, rightNode := range bg.Right {
117 if used[rightNode] {
121 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
126 currentLayer = append(currentLayer, rightNode)
127 used[rightNode] = true
129 if matching.Free(rightNode) {
135 for _, rightNode := range lastLayer {
141 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /dports/devel/app-builder/app-builder-3.4.2/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 115 for _, rightNode := range bg.Right {
116 if used[rightNode] {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
125 currentLayer = append(currentLayer, rightNode)
126 used[rightNode] = true
128 if matching.Free(rightNode) {
134 for _, rightNode := range lastLayer {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /dports/devel/lazygit/lazygit-0.31.4/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 115 for _, rightNode := range bg.Right {
116 if used[rightNode] {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
125 currentLayer = append(currentLayer, rightNode)
126 used[rightNode] = true
128 if matching.Free(rightNode) {
134 for _, rightNode := range lastLayer {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /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 | 115 for _, rightNode := range bg.Right {
116 if used[rightNode] {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
125 currentLayer = append(currentLayer, rightNode)
126 used[rightNode] = true
128 if matching.Free(rightNode) {
134 for _, rightNode := range lastLayer {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /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 | 115 for _, rightNode := range bg.Right {
116 if used[rightNode] {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
125 currentLayer = append(currentLayer, rightNode)
126 used[rightNode] = true
128 if matching.Free(rightNode) {
134 for _, rightNode := range lastLayer {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /dports/databases/cayley/cayley-0.7.5-2-gcf576ba/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 115 for _, rightNode := range bg.Right {
116 if used[rightNode] {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
125 currentLayer = append(currentLayer, rightNode)
126 used[rightNode] = true
128 if matching.Free(rightNode) {
134 for _, rightNode := range lastLayer {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /dports/net/concourse-fly/concourse-6.7.1/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 120 for _, rightNode := range bg.Right {
121 if used[rightNode.ID] {
125 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
130 currentLayer = append(currentLayer, rightNode)
131 used[rightNode.ID] = true
133 if matching.Free(rightNode) {
139 for _, rightNode := range lastLayer {
145 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /dports/misc/concourse/concourse-6.7.2/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 120 for _, rightNode := range bg.Right {
121 if used[rightNode.ID] {
125 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
130 currentLayer = append(currentLayer, rightNode)
131 used[rightNode.ID] = true
133 if matching.Free(rightNode) {
139 for _, rightNode := range lastLayer {
145 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /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 | 116 for _, rightNode := range bg.Right {
117 if used[rightNode] {
121 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
126 currentLayer = append(currentLayer, rightNode)
127 used[rightNode] = true
129 if matching.Free(rightNode) {
135 for _, rightNode := range lastLayer {
141 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /dports/www/oauth2-proxy/oauth2-proxy-7.2.0/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 120 for _, rightNode := range bg.Right {
121 if used[rightNode.ID] {
125 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
130 currentLayer = append(currentLayer, rightNode)
131 used[rightNode.ID] = true
133 if matching.Free(rightNode) {
139 for _, rightNode := range lastLayer {
145 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /dports/net/bosh-cli/bosh-cli-5.5.0/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 115 for _, rightNode := range bg.Right {
116 if used[rightNode] {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
125 currentLayer = append(currentLayer, rightNode)
126 used[rightNode] = true
128 if matching.Free(rightNode) {
134 for _, rightNode := range lastLayer {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /dports/net/bosh-bootloader/bosh-bootloader-7.2.12/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 115 for _, rightNode := range bg.Right {
116 if used[rightNode] {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
125 currentLayer = append(currentLayer, rightNode)
126 used[rightNode] = true
128 if matching.Free(rightNode) {
134 for _, rightNode := range lastLayer {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /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 | 115 for _, rightNode := range bg.Right {
116 if used[rightNode] {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
125 currentLayer = append(currentLayer, rightNode)
126 used[rightNode] = true
128 if matching.Free(rightNode) {
134 for _, rightNode := range lastLayer {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /dports/dns/blocky/blocky-0.17/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
| H A D | bipartitegraphmatching.go | 120 for _, rightNode := range bg.Right {
121 if used[rightNode.ID] {
125 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
130 currentLayer = append(currentLayer, rightNode)
131 used[rightNode.ID] = true
133 if matching.Free(rightNode) {
139 for _, rightNode := range lastLayer {
145 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /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 | 115 for _, rightNode := range bg.Right {
116 if used[rightNode] {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
125 currentLayer = append(currentLayer, rightNode)
126 used[rightNode] = true
128 if matching.Free(rightNode) {
134 for _, rightNode := range lastLayer {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|
| /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 | 115 for _, rightNode := range bg.Right {
116 if used[rightNode] {
120 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
125 currentLayer = append(currentLayer, rightNode)
126 used[rightNode] = true
128 if matching.Free(rightNode) {
134 for _, rightNode := range lastLayer {
140 edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
|