Home
last modified time | relevance | path

Searched defs:comparable (Results 1 – 25 of 146) sorted by relevance

123456

/aosp_15_r20/prebuilts/go/linux-x86/test/typeparam/mapsimp.dir/
Da.go9 func SliceEqual[Elem comparable](s1, s2 []Elem) bool {
27 func Keys[K comparable, V any](m map[K]V) []K {
37 func Values[K comparable, V any](m map[K]V) []V {
47 func Equal[K, V comparable](m1, m2 map[K]V) bool {
60 func Copy[K comparable, V any](m map[K]V) map[K]V {
70 func Add[K comparable, V any](m1, m2 map[K]V) {
78 func Sub[K comparable, V any](m1, m2 map[K]V) {
86 func Intersect[K comparable, V any](m1, m2 map[K]V) {
95 func Filter[K comparable, V any](m map[K]V, f func(K, V) bool) {
104 func TransformValues[K comparable, V any](m map[K]V, f func(V) V) {
/aosp_15_r20/prebuilts/go/linux-x86/test/typeparam/
Dmaps.go17 func _SliceEqual[Elem comparable](s1, s2 []Elem) bool {
35 func _Keys[K comparable, V any](m map[K]V) []K {
45 func _Values[K comparable, V any](m map[K]V) []V {
55 func _Equal[K, V comparable](m1, m2 map[K]V) bool {
68 func _Copy[K comparable, V any](m map[K]V) map[K]V {
78 func _Add[K comparable, V any](m1, m2 map[K]V) {
86 func _Sub[K comparable, V any](m1, m2 map[K]V) {
94 func _Intersect[K comparable, V any](m1, m2 map[K]V) {
103 func _Filter[K comparable, V any](m map[K]V, f func(K, V) bool) {
112 func _TransformValues[K comparable, V any](m map[K]V, f func(V) V) {
Dequal.go11 func f[T comparable](t, u T) bool {
17 func g[T comparable](t T, i interface{}) bool {
41 func k[T comparable](t T, i interface{}) bool {
Dsets.go16 func _SliceEqual[Elem comparable](s1, s2 []Elem) bool {
38 func _Make[Elem comparable]() _Set[Elem] {
75 func _Equal[Elem comparable](s1, s2 _Set[Elem]) bool {
Dissue51303.go31 func IntersectSS[E comparable](x, y [][]E) [][]E {
53 func SetEq[S []E, E comparable](x, y S) bool { argument
/aosp_15_r20/prebuilts/go/linux-x86/src/internal/concurrent/
Dhashtriemap_test.go203 func testAll[K, V comparable](t *testing.T, m *HashTrieMap[K, V], testData map[K]V, yield func(K, V…
228 func expectPresent[K, V comparable](t *testing.T, key K, want V) func(got V, ok bool) {
242 func expectMissing[K, V comparable](t *testing.T, key K, want V) func(got V, ok bool) {
261 func expectLoaded[K, V comparable](t *testing.T, key K, want V) func(got V, loaded bool) {
275 func expectStored[K, V comparable](t *testing.T, key K, want V) func(got V, loaded bool) {
289 func expectDeleted[K, V comparable](t *testing.T, key K, old V) func(deleted bool) {
300 func expectNotDeleted[K, V comparable](t *testing.T, key K, old V) func(deleted bool) {
337 func dumpMap[K, V comparable](ht *HashTrieMap[K, V]) {
341 func dumpNode[K, V comparable](ht *HashTrieMap[K, V], n *node[K, V], depth int) {
Dhashtriemap.go29 func NewHashTrieMap[K, V comparable]() *HashTrieMap[K, V] {
326 func newIndirectNode[K, V comparable](parent *indirect[K, V]) *indirect[K, V] {
348 func newEntryNode[K, V comparable](key K, value V) *entry[K, V] {
/aosp_15_r20/build/soong/android/
H A Dutil.go159 func IndexList[T comparable](t T, list []T) int {
168 func InList[T comparable](t T, list []T) bool {
172 func setFromList[T comparable](l []T) map[T]bool {
218 func ListSetDifference[T comparable](l1, l2 []T) (bool, []T, []T) {
240 func HasIntersection[T comparable](l1, l2 []T) bool {
374 func firstUnique[T comparable](slice []T) []T {
383 func firstUniqueInPlace[T comparable](slice []T) []T {
414 func firstUniqueMap[T comparable](in []T) []T {
666 func AppendIfNotZero[T comparable](slice []T, value T) []T {
/aosp_15_r20/prebuilts/go/linux-x86/src/maps/
Diter.go12 func All[Map ~map[K]V, K comparable, V any](m Map) iter.Seq2[K, V] {
25 func Keys[Map ~map[K]V, K comparable, V any](m Map) iter.Seq[K] {
38 func Values[Map ~map[K]V, K comparable, V any](m Map) iter.Seq[V] {
50 func Insert[Map ~map[K]V, K comparable, V any](m Map, seq iter.Seq2[K, V]) {
58 func Collect[K comparable, V any](seq iter.Seq2[K, V]) map[K]V {
Dmaps.go17 func Equal[M1, M2 ~map[K]V, K, V comparable](m1 M1, m2 M2) bool { argument
31 func EqualFunc[M1 ~map[K]V1, M2 ~map[K]V2, K comparable, V1, V2 any](m1 M1, m2 M2, eq func(V1, V2) …
50 func Clone[M ~map[K]V, K comparable, V any](m M) M {
62 func Copy[M1 ~map[K]V, M2 ~map[K]V, K comparable, V any](dst M1, src M2) {
69 func DeleteFunc[M ~map[K]V, K comparable, V any](m M, del func(K, V) bool) {
/aosp_15_r20/prebuilts/go/linux-x86/src/internal/types/testdata/fixedbugs/
Dissue50755.go10 func f1[K1 comparable, E1 any](m1 map[K1]E1) {}
27 func f4[M4 map[K4]int, K4 comparable](m4 M4) {}
29 func f5[M5 map[K5]int, K5 comparable](m5 M5) {
35 func Copy[MC ~map[KC]VC, KC comparable, VC any](dst, src MC) {
41 func Merge[MM ~map[KM]VM, KM comparable, VM any](ms ...MM) MM {
Dissue51158.go8 func f[M map[K]int, K comparable](m M) {
13 func f1[M map[K]int, K comparable](m M) {
16 func f2[M map[K]int, K comparable](m M) {
Dissue50646.go7 func f1[_ comparable]() {}
8 func f2[_ interface{ comparable }]() {}
12 func _[P comparable, Q ~int, R any]() {
Dissue51376.go9 func f[M ~map[K]V, K comparable, V any](M) {}
10 func g[M map[K]V, K comparable, V any](M) {}
12 func _[M1 ~map[K]V, M2 map[K]V, K comparable, V any]() {
Dissue51257.go7 func f[_ comparable]() {}
13 func _[P1 comparable, P2 S2]() {
29 func NewSetFromSlice[T comparable](items []T) *Set[T] {
Dissue51472.go7 func _[T comparable](x T) {
11 func _[T interface{interface{comparable}}](x T) {
15 func _[T interface{comparable; interface{comparable}}](x T) {
Dissue48712.go7 func _[P comparable](x, y P) {
16 func _[P comparable](x P, y any) {
Dissue47411.go7 func f[_ comparable]() {}
10 func _[P comparable,
Dissue40789.go21 func copyMap[M Map[K, V], K comparable, V any](m M) M { argument
35 func f[B A[X], X comparable]() B { argument
/aosp_15_r20/prebuilts/go/linux-x86/src/internal/types/testdata/spec/
Dcomparable1.19.go9 func f1[_ comparable]() {}
10 func f2[_ interface{ comparable }]() {}
14 func _[P comparable, Q ~int, R any]() {
Dcomparable.go7 func f1[_ comparable]() {}
8 func f2[_ interface{ comparable }]() {}
12 func _[P comparable, Q ~int, R any]() {
/aosp_15_r20/prebuilts/go/linux-x86/src/slices/
Dslices.go20 func Equal[S ~[]E, E comparable](s1, s2 S) bool { argument
96 func Index[S ~[]E, E comparable](s S, v E) int { argument
117 func Contains[S ~[]E, E comparable](s S, v E) bool { argument
358 func Compact[S ~[]E, E comparable](s S) S { argument
/aosp_15_r20/prebuilts/go/linux-x86/src/internal/types/testdata/check/
Dbuiltins1.go138 func _[T M4[K, V], K comparable, V any](m T) { argument
229 func _[T comparable]() {
264 func _[T comparable]() {
299 func _[T comparable]() {
/aosp_15_r20/prebuilts/go/linux-x86/test/typeparam/setsimp.dir/
Da.go9 func SliceEqual[Elem comparable](s1, s2 []Elem) bool {
31 func Make[Elem comparable]() Set[Elem] {
68 func Equal[Elem comparable](s1, s2 Set[Elem]) bool {
/aosp_15_r20/prebuilts/go/linux-x86/src/unique/
Dhandle.go32 func Make[T comparable](value T) Handle[T] {
114 func addUniqueMap[T comparable](typ *abi.Type) *uniqueMap[T] {

123456