- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for subTreeIndex (0.46 sec)
-
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)