- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for subTreeHash (0.16 sec)
-
src/cmd/vendor/golang.org/x/mod/sumdb/tlog/tlog.go
func subTreeIndex(lo, hi int64, need []int64) []int64 { // See subTreeHash below for commentary. for lo < hi { k, level := maxpow2(hi - lo + 1) if lo&(k-1) != 0 { panic("tlog: bad math in subTreeIndex") } need = append(need, StoredHashIndex(level, lo>>uint(level))) lo += k } return need } // subTreeHash computes the hash for the subtree containing records [lo, hi),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 12 20:38:21 UTC 2023 - 17.9K bytes - Viewed (0)