b7d1ec0604
Change-Id: I8066b22cb87e09fb160de3b8ff2d8fdde6ec3dcf Reviewed-on: https://go-review.googlesource.com/c/tools/+/675815 Reviewed-by: David Chase <drchase@google.com> Auto-Submit: Alan Donovan <adonovan@google.com> Reviewed-by: Alan Donovan <adonovan@google.com> LUCI-TryBot-Result: Go LUCI <golang-scoped@luci-project-accounts.iam.gserviceaccount.com>
36 lines
855 B
Go
36 lines
855 B
Go
// Copyright 2025 The Go MCP SDK Authors. All rights reserved.
|
|
// Use of this source code is governed by an MIT-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package util
|
|
|
|
import (
|
|
"cmp"
|
|
"iter"
|
|
"slices"
|
|
)
|
|
|
|
// Helpers below are copied from gopls' moremaps package.
|
|
|
|
// Sorted returns an iterator over the entries of m in key order.
|
|
func Sorted[M ~map[K]V, K cmp.Ordered, V any](m M) iter.Seq2[K, V] {
|
|
// TODO(adonovan): use maps.Sorted if proposal #68598 is accepted.
|
|
return func(yield func(K, V) bool) {
|
|
keys := KeySlice(m)
|
|
slices.Sort(keys)
|
|
for _, k := range keys {
|
|
if !yield(k, m[k]) {
|
|
break
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// KeySlice returns the keys of the map M, like slices.Collect(maps.Keys(m)).
|
|
func KeySlice[M ~map[K]V, K comparable, V any](m M) []K {
|
|
r := make([]K, 0, len(m))
|
|
for k := range m {
|
|
r = append(r, k)
|
|
}
|
|
return r
|
|
}
|