- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for subTreeIndex (1 sec)
-
src/cmd/vendor/golang.org/x/mod/sumdb/tlog/tlog.go
panic("tlog: bad math in treeProofIndex") } if n == hi { if lo == 0 { return need } return subTreeIndex(lo, hi, need) } if k, _ := maxpow2(hi - lo); n <= lo+k { need = treeProofIndex(lo, lo+k, n, need) need = subTreeIndex(lo+k, hi, need) } else { need = subTreeIndex(lo, lo+k, need) need = treeProofIndex(lo+k, hi, n, need) } return need }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 12 20:38:21 UTC 2023 - 17.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/sumdb/tlog/tile.go
tileOrder := make(map[Tile]int) // tileOrder[tileKey(tiles[i])] = i var tiles []Tile // Plan to fetch tiles necessary to recompute tree hash. // If it matches, those tiles are authenticated. stx := subTreeIndex(0, r.tree.N, nil) stxTileOrder := make([]int, len(stx)) for i, x := range stx { tile, _, _ := tileForIndex(h, x) tile = tileParent(tile, 0, r.tree.N) if j, ok := tileOrder[tile]; ok {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 13K bytes - Viewed (0)