- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for newBitset (0.12 sec)
-
src/cmd/compile/internal/ssa/poset.go
// and mark as part of the paths any node that has a children which is already // part of the path (or is dst itself). func (po *poset) findpaths(cur, dst uint32) bitset { seen := newBitset(int(po.lastidx + 1)) path := newBitset(int(po.lastidx + 1)) path.Set(dst) po.findpaths1(cur, dst, seen, path) return path } func (po *poset) findpaths1(cur, dst uint32, seen bitset, path bitset) { if cur == dst {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 04 17:23:05 UTC 2023 - 37.2K bytes - Viewed (0) -
plugin/pkg/auth/authorizer/node/graph.go
if edgeCount < g.destinationEdgeThreshold { delete(g.destinationEdgeIndex, n.ID()) return } // get or create the index index := g.destinationEdgeIndex[n.ID()] if index == nil { index = newIntSet() } else { index.reset() } // populate the index g.graph.VisitFrom(n, func(dest graph.Node) bool { if destinationEdge, ok := g.graph.EdgeBetween(n, dest).(*destinationEdge); ok {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 07 21:22:55 UTC 2024 - 17.5K bytes - Viewed (0)