mirror of
https://github.com/OffchainLabs/prysm.git
synced 2026-01-08 23:18:15 -05:00
* Ran gopls modernize to fix everything go run golang.org/x/tools/gopls/internal/analysis/modernize/cmd/modernize@latest -fix -test ./... * Override rules_go provided dependency for golang.org/x/tools to v0.38.0. To update this, checked out rules_go, then ran `bazel run //go/tools/releaser -- upgrade-dep -mirror=false org_golang_x_tools` and copied the patches. * Fix buildtag violations and ignore buildtag violations in external * Introduce modernize analyzer package. * Add modernize "any" analyzer. * Fix violations of any analyzer * Add modernize "appendclipped" analyzer. * Fix violations of appendclipped * Add modernize "bloop" analyzer. * Add modernize "fmtappendf" analyzer. * Add modernize "forvar" analyzer. * Add modernize "mapsloop" analyzer. * Add modernize "minmax" analyzer. * Fix violations of minmax analyzer * Add modernize "omitzero" analyzer. * Add modernize "rangeint" analyzer. * Fix violations of rangeint. * Add modernize "reflecttypefor" analyzer. * Fix violations of reflecttypefor analyzer. * Add modernize "slicescontains" analyzer. * Add modernize "slicessort" analyzer. * Add modernize "slicesdelete" analyzer. This is disabled by default for now. See https://go.dev/issue/73686. * Add modernize "stringscutprefix" analyzer. * Add modernize "stringsbuilder" analyzer. * Fix violations of stringsbuilder analyzer. * Add modernize "stringsseq" analyzer. * Add modernize "testingcontext" analyzer. * Add modernize "waitgroup" analyzer. * Changelog fragment * gofmt * gazelle * Add modernize "newexpr" analyzer. * Disable newexpr until go1.26 * Add more details in WORKSPACE on how to update the override * @nalepae feedback on min() * gofmt * Fix violations of forvar
116 lines
2.0 KiB
Go
116 lines
2.0 KiB
Go
package peers
|
|
|
|
import (
|
|
"fmt"
|
|
"slices"
|
|
"testing"
|
|
|
|
"github.com/OffchainLabs/prysm/v7/testing/require"
|
|
"github.com/libp2p/go-libp2p/core/peer"
|
|
)
|
|
|
|
func TestPickBest(t *testing.T) {
|
|
best := testPeerIds(10)
|
|
cases := []struct {
|
|
name string
|
|
busy map[peer.ID]bool
|
|
n int
|
|
best []peer.ID
|
|
expected []peer.ID
|
|
}{
|
|
{
|
|
name: "",
|
|
n: 0,
|
|
},
|
|
{
|
|
name: "none busy",
|
|
n: 1,
|
|
expected: best[0:1],
|
|
},
|
|
{
|
|
name: "all busy except last",
|
|
n: 1,
|
|
busy: testBusyMap(best[0 : len(best)-1]),
|
|
expected: best[len(best)-1:],
|
|
},
|
|
{
|
|
name: "all busy except i=5",
|
|
n: 1,
|
|
busy: testBusyMap(slices.Concat(best[0:5], best[6:])),
|
|
expected: []peer.ID{best[5]},
|
|
},
|
|
{
|
|
name: "all busy - 0 results",
|
|
n: 1,
|
|
busy: testBusyMap(best),
|
|
},
|
|
{
|
|
name: "first half busy",
|
|
n: 5,
|
|
busy: testBusyMap(best[0:5]),
|
|
expected: best[5:],
|
|
},
|
|
{
|
|
name: "back half busy",
|
|
n: 5,
|
|
busy: testBusyMap(best[5:]),
|
|
expected: best[0:5],
|
|
},
|
|
{
|
|
name: "pick all ",
|
|
n: 10,
|
|
expected: best,
|
|
},
|
|
{
|
|
name: "none available",
|
|
n: 10,
|
|
best: []peer.ID{},
|
|
},
|
|
{
|
|
name: "not enough",
|
|
n: 10,
|
|
best: best[0:1],
|
|
expected: best[0:1],
|
|
},
|
|
{
|
|
name: "not enough, some busy",
|
|
n: 10,
|
|
best: best[0:6],
|
|
busy: testBusyMap(best[0:5]),
|
|
expected: best[5:6],
|
|
},
|
|
}
|
|
for _, c := range cases {
|
|
name := fmt.Sprintf("n=%d", c.n)
|
|
if c.name != "" {
|
|
name += " " + c.name
|
|
}
|
|
t.Run(name, func(t *testing.T) {
|
|
if c.best == nil {
|
|
c.best = best
|
|
}
|
|
pb := pickBest(c.busy, c.n, c.best)
|
|
require.Equal(t, len(c.expected), len(pb))
|
|
for i := range c.expected {
|
|
require.Equal(t, c.expected[i], pb[i])
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
func testBusyMap(b []peer.ID) map[peer.ID]bool {
|
|
m := make(map[peer.ID]bool)
|
|
for i := range b {
|
|
m[b[i]] = true
|
|
}
|
|
return m
|
|
}
|
|
|
|
func testPeerIds(n int) []peer.ID {
|
|
pids := make([]peer.ID, n)
|
|
for i := range pids {
|
|
pids[i] = peer.ID(fmt.Sprintf("%d", i))
|
|
}
|
|
return pids
|
|
}
|