// run
// Copyright 2021 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package main
import (
"fmt"
"math"
"sort"
)
// _Equal reports whether two slices are equal: the same length and all
// elements equal. All floating point NaNs are considered equal.
func _SliceEqual[Elem comparable](s1, s2 []Elem) bool {
if len(s1) != len(s2) {
return false
}
for i, v1 := range s1 {
v2 := s2[i]
if v1 != v2 {
isNaN := func(f Elem) bool { return f != f }
if !isNaN(v1) || !isNaN(v2) {
return false
}
}
}
return true
}
// _Keys returns the keys of the map m.
// The keys will be an indeterminate order.
func _Keys[K comparable, V any](m map[K]V) []K {
r := make([]K, 0, len(m))
for k := range m {
r = append(r, k)
}
return r
}
// _Values returns the values of the map m.
// The values will be in an indeterminate order.
func _Values[K comparable, V any](m map[K]V) []V {
r := make([]V, 0, len(m))
for _, v := range m {
r = append(r, v)
}
return r
}
// _Equal reports whether two maps contain the same key/value pairs.
// _Values are compared using ==.
func _Equal[K, V comparable](m1, m2 map[K]V) bool {
if len(m1) != len(m2) {
return false
}
for k, v1 := range m1 {
if v2, ok := m2[k]; !ok || v1 != v2 {
return false
}
}
return true
}
// _Copy returns a copy of m.
func _Copy[K comparable, V any](m map[K]V) map[K]V {
r := make(map[K]V, len(m))
for k, v := range m {
r[k] = v
}
return r
}
// _Add adds all key/value pairs in m2 to m1. _Keys in m2 that are already
// present in m1 will be overwritten with the value in m2.
func _Add[K comparable, V any](m1, m2 map[K]V) {
for k, v := range m2 {
m1[k] = v
}
}
// _Sub removes all keys in m2 from m1. _Keys in m2 that are not present
// in m1 are ignored. The values in m2 are ignored.
func _Sub[K comparable, V any](m1, m2 map[K]V) {
for k := range m2 {
delete(m1, k)
}
}
// _Intersect removes all keys from m1 that are not present in m2.
// _Keys in m2 that are not in m1 are ignored. The values in m2 are ignored.
func _Intersect[K comparable, V any](m1, m2 map[K]V) {
for k := range m1 {
if _, ok := m2[k]; !ok {
delete(m1, k)
}
}
}
// _Filter deletes any key/value pairs from m for which f returns false.
func _Filter[K comparable, V any](m map[K]V, f func(K, V) bool) {
for k, v := range m {
if !f(k, v) {
delete(m, k)
}
}
}
// _TransformValues applies f to each value in m. The keys remain unchanged.
func _TransformValues[K comparable, V any](m map[K]V, f func(V) V) {
for k, v := range m {
m[k] = f(v)
}
}
var m1 = map[int]int{1: 2, 2: 4, 4: 8, 8: 16}
var m2 = map[int]string{1: "2", 2: "4", 4: "8", 8: "16"}
func TestKeys() {
want := []int{1, 2, 4, 8}
got1 := _Keys(m1)
sort.Ints(got1)
if !_SliceEqual(got1, want) {
panic(fmt.Sprintf("_Keys(%v) = %v, want %v", m1, got1, want))
}
got2 := _Keys(m2)
sort.Ints(got2)
if !_SliceEqual(got2, want) {
panic(fmt.Sprintf("_Keys(%v) = %v, want %v", m2, got2, want))
}
}
func TestValues() {
got1 := _Values(m1)
want1 := []int{2, 4, 8, 16}
sort.Ints(got1)
if !_SliceEqual(got1, want1) {
panic(fmt.Sprintf("_Values(%v) = %v, want %v", m1, got1, want1))
}
got2 := _Values(m2)
want2 := []string{"16", "2", "4", "8"}
sort.Strings(got2)
if !_SliceEqual(got2, want2) {
panic(fmt.Sprintf("_Values(%v) = %v, want %v", m2, got2, want2))
}
}
func TestEqual() {
if !_Equal(m1, m1) {
panic(fmt.Sprintf("_Equal(%v, %v) = false, want true", m1, m1))
}
if _Equal(m1, nil) {
panic(fmt.Sprintf("_Equal(%v, nil) = true, want false", m1))
}
if _Equal(nil, m1) {
panic(fmt.Sprintf("_Equal(nil, %v) = true, want false", m1))
}
if !_Equal[int, int](nil, nil) {
panic("_Equal(nil, nil) = false, want true")
}
if ms := map[int]int{1: 2}; _Equal(m1, ms) {
panic(fmt.Sprintf("_Equal(%v, %v) = true, want false", m1, ms))
}
// Comparing NaN for equality is expected to fail.
mf := map[int]float64{1: 0, 2: math.NaN()}
if _Equal(mf, mf) {
panic(fmt.Sprintf("_Equal(%v, %v) = true, want false", mf, mf))
}
}
func TestCopy() {
m2 := _Copy(m1)
if !_Equal(m1, m2) {
panic(fmt.Sprintf("_Copy(%v) = %v, want %v", m1, m2, m1))
}
m2[16] = 32
if _Equal(m1, m2) {
panic(fmt.Sprintf("_Equal(%v, %v) = true, want false", m1, m2))
}
}
func TestAdd() {
mc := _Copy(m1)
_Add(mc, mc)
if !_Equal(mc, m1) {
panic(fmt.Sprintf("_Add(%v, %v) = %v, want %v", m1, m1, mc, m1))
}
_Add(mc, map[int]int{16: 32})
want := map[int]int{1: 2, 2: 4, 4: 8, 8: 16, 16: 32}
if !_Equal(mc, want) {
panic(fmt.Sprintf("_Add result = %v, want %v", mc, want))
}
}
func TestSub() {
mc := _Copy(m1)
_Sub(mc, mc)
if len(mc) > 0 {
panic(fmt.Sprintf("_Sub(%v, %v) = %v, want empty map", m1, m1, mc))
}
mc = _Copy(m1)
_Sub(mc, map[int]int{1: 0})
want := map[int]int{2: 4, 4: 8, 8: 16}
if !_Equal(mc, want) {
panic(fmt.Sprintf("_Sub result = %v, want %v", mc, want))
}
}
func TestIntersect() {
mc := _Copy(m1)
_Intersect(mc, mc)
if !_Equal(mc, m1) {
panic(fmt.Sprintf("_Intersect(%v, %v) = %v, want %v", m1, m1, mc, m1))
}
_Intersect(mc, map[int]int{1: 0, 2: 0})
want := map[int]int{1: 2, 2: 4}
if !_Equal(mc, want) {
panic(fmt.Sprintf("_Intersect result = %v, want %v", mc, want))
}
}
func TestFilter() {
mc := _Copy(m1)
_Filter(mc, func(int, int) bool { return true })
if !_Equal(mc, m1) {
panic(fmt.Sprintf("_Filter(%v, true) = %v, want %v", m1, mc, m1))
}
_Filter(mc, func(k, v int) bool { return k < 3 })
want := map[int]int{1: 2, 2: 4}
if !_Equal(mc, want) {
panic(fmt.Sprintf("_Filter result = %v, want %v", mc, want))
}
}
func TestTransformValues() {
mc := _Copy(m1)
_TransformValues(mc, func(i int) int { return i / 2 })
want := map[int]int{1: 1, 2: 2, 4: 4, 8: 8}
if !_Equal(mc, want) {
panic(fmt.Sprintf("_TransformValues result = %v, want %v", mc, want))
}
}
func main() {
TestKeys()
TestValues()
TestEqual()
TestCopy()
TestAdd()
TestSub()
TestIntersect()
TestFilter()
TestTransformValues()
}
Directory Contents
Dirs: 70 × Files: 292
!"#$%&'(()*+,-./00123456789 t\
wIDATx ]ys 47Y ƒ - " Rv < f{Ɛ $k l L > L ~h^ 1 [ r G t& h
l F z3O Y ! p A(_g̷ E8 )S 8 c Kb"z ~ 5 J xAL WU < *
5 m;W a pB h ~P J
2 3 6 ҙ .Ƹ P i 4g
F R L P ΪK/D M v (a3
k J
Œ4N5* SH ` SdJ z O J Xՠ V> u ߱ BE&L b2 ?2` tX+ c CB A$ i b C ĀMB E : / # Dx &l =q Ty 0 \p I ( L Ǎ { e
4k ;`u^ｦ eP!( d { )T A 8 O;Ě n >;s6 ! :Nx `[S D HU ~ qJ F}
a g*D 49 / pn k h (t 8NxƐF _!r չ7
ZR R q/5") Ӎ NY 0 x sZ! o
fu , K"$ ? pg 㕣= 1» {h " fh7
y } +7 $ y
" X ą - G P u 4 m >J 5 L =V ' ^@I p ?MS xЌ XV P ! h "C NS9B8̢ ]!K e zA , ӏkbY !< XQ ٿyS| *" f { w 4@[S <
# 0 ! js [m =,~ o
"ݎ DHf Wo $ g ! Vԅ t mB /y Wf V4 c+@x? B ~u " xUN e 0 BĂ)
~J pz!
7 y6]l Ԥ@ P a< O /DHC `≻ N m"$ 0ObB }{ x AO FCG D R ^ "B { WDH UR l@ T
# +"d T ; 0 i D}. 7 ` ' ] w rE &S i ƕiTD EL P _ u h $ Ա FG wVD G L R Zf ' .!] J /ZR oGЍ s Mr Ĥ ʬ 3 Q [3 cL ` ^ p +
( F;# B 5 ' 2Y f [ ϶R0e } E 7
6M aۮ H <& n % L] E}Up x紉, Uw' Q Ǯշo k ވۙ 0N94 VX5 xEDE l D #֤ } C o )W : ^ s 9 bRf iX5u ཱི 4 :[ T 1. | [E 2ؽ Iy\ : o x K G 5
ylP ' uK E
ftb/i[3 .g _ [3M n
G, #NwQ5~
ؚ) | n =Ц"x qg gB ` 듘 ~ x w ?
?
R~ _ u. &V Q K˻ H C ( TN˄+ `C dA n B D 3"Z G ê ^k H_ /- ~ " R_ .8 Z_ 6@ o xg uP ? 3լ @7AM! E7^
- =V L x g-D0 CtmW 7 O G _ WD0 g C w1 r
d w : a | \ *" f nֳ ^ H# f L ` Z ۽hV }S F r0Ù Bć5r] @! NL iQ]{s^=4 d WD " " M;
t" 8 5 e dL| "-*st" ) SWD ?R[S e ooF 20.D ? bo =) A i o d ģ ZҰaO
@E =) i D a &ܟa CϞ y6 ,<%{^x%{f8? `iw^ ?/
M
* IEND B`