micro--go-micro
c7657f73f4
goreleaser / goreleaser (push) Has been cancelled
* test(harness): read agent plan from the scoped store
The store-scoping change moved an agent's plan from the default table
key agent/{name}/plan to its own table (database "agent", table {name},
key "plan"). The plan-delegate harness tests still read the old key and
failed with 'not found'; read through store.Scope(mem, "agent", name)
like the agent does.
* docs: orient agents-first across README, landing, and docs overview
Lead with agents (then services and flows), surface MCP + A2A as the
interop story, and frame agents as services. Landing hero and feature
grid reordered agents-first with an A2A gateway card.
* v6: module path go-micro.dev/v6, TLS secure by default, NewService
Cut v6. Three breaking changes, bundled so the major bump is paid once:
- Module path go-micro.dev/v5 -> go-micro.dev/v6 across all imports + go.mod.
- TLS verification on by default (was off). MICRO_TLS_SECURE removed;
MICRO_TLS_INSECURE=true opts out for self-signed/dev.
- micro.NewService(name, opts...) is the canonical service constructor,
symmetric with NewAgent/NewFlow; micro.New kept as a deprecated alias;
the old name-less NewService(opts...) removed. Generators emit NewService.
Also ports the JWT auth token provider in-module (go-micro.dev/v6/auth/jwt/token
on golang-jwt/jwt/v5), dropping the v5-pinned github.com/micro/plugins/v5/auth/jwt
and the deprecated dgrijalva/jwt-go.
Docs/README/landing updated to v6 and @latest; v5->v6 migration guide added;
CHANGELOG cut as [6.0.0]. Blog posts left at their historical versions.
---------
Co-authored-by: Claude <noreply@anthropic.com>
52 行
972 B
Go
52 行
972 B
Go
package selector
|
|
|
|
import (
|
|
"math/rand"
|
|
"sync"
|
|
|
|
"go-micro.dev/v6/registry"
|
|
)
|
|
|
|
// Random is a random strategy algorithm for node selection.
|
|
func Random(services []*registry.Service) Next {
|
|
nodes := make([]*registry.Node, 0, len(services))
|
|
|
|
for _, service := range services {
|
|
nodes = append(nodes, service.Nodes...)
|
|
}
|
|
|
|
return func() (*registry.Node, error) {
|
|
if len(nodes) == 0 {
|
|
return nil, ErrNoneAvailable
|
|
}
|
|
|
|
i := rand.Int() % len(nodes)
|
|
return nodes[i], nil
|
|
}
|
|
}
|
|
|
|
// RoundRobin is a roundrobin strategy algorithm for node selection.
|
|
func RoundRobin(services []*registry.Service) Next {
|
|
nodes := make([]*registry.Node, 0, len(services))
|
|
|
|
for _, service := range services {
|
|
nodes = append(nodes, service.Nodes...)
|
|
}
|
|
|
|
var i = rand.Int()
|
|
var mtx sync.Mutex
|
|
|
|
return func() (*registry.Node, error) {
|
|
if len(nodes) == 0 {
|
|
return nil, ErrNoneAvailable
|
|
}
|
|
|
|
mtx.Lock()
|
|
node := nodes[i%len(nodes)]
|
|
i++
|
|
mtx.Unlock()
|
|
|
|
return node, nil
|
|
}
|
|
}
|