Linux vmi284606.contaboserver.net 4.15.0-213-generic #224-Ubuntu SMP Mon Jun 19 13:30:12 UTC 2023 x86_64
Apache/2.4.57 (Ubuntu)
: 167.86.127.34 | : 216.73.217.1
Cant Read [ /etc/named.conf ]
7.2.24-0ubuntu0.18.04.17
root
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
local /
go /
test /
[ HOME SHELL ]
Name
Size
Permission
Action
alias3.dir
[ DIR ]
drwxr-xr-x
bench
[ DIR ]
drwxr-xr-x
chan
[ DIR ]
drwxr-xr-x
closure3.dir
[ DIR ]
drwxr-xr-x
codegen
[ DIR ]
drwxr-xr-x
ddd2.dir
[ DIR ]
drwxr-xr-x
dwarf
[ DIR ]
drwxr-xr-x
fixedbugs
[ DIR ]
drwxr-xr-x
import2.dir
[ DIR ]
drwxr-xr-x
import4.dir
[ DIR ]
drwxr-xr-x
interface
[ DIR ]
drwxr-xr-x
intrinsic.dir
[ DIR ]
drwxr-xr-x
ken
[ DIR ]
drwxr-xr-x
linkname.dir
[ DIR ]
drwxr-xr-x
method4.dir
[ DIR ]
drwxr-xr-x
oldescape_linkname.dir
[ DIR ]
drwxr-xr-x
retjmp.dir
[ DIR ]
drwxr-xr-x
runtime
[ DIR ]
drwxr-xr-x
stress
[ DIR ]
drwxr-xr-x
syntax
[ DIR ]
drwxr-xr-x
uintptrescapes.dir
[ DIR ]
drwxr-xr-x
235.go
1.56
KB
-rw-r--r--
64bit.go
24.83
KB
-rw-r--r--
README.md
577
B
-rw-r--r--
alg.go
822
B
-rw-r--r--
alias.go
588
B
-rw-r--r--
alias1.go
803
B
-rw-r--r--
alias2.go
2.52
KB
-rw-r--r--
alias3.go
187
B
-rw-r--r--
align.go
603
B
-rw-r--r--
append.go
9.09
KB
-rw-r--r--
append1.go
665
B
-rw-r--r--
args.go
374
B
-rw-r--r--
armimm.go
3.85
KB
-rw-r--r--
assign.go
975
B
-rw-r--r--
assign1.go
5.55
KB
-rw-r--r--
atomicload.go
798
B
-rw-r--r--
bigalg.go
2.12
KB
-rw-r--r--
bigmap.go
2.46
KB
-rw-r--r--
blank.go
2.1
KB
-rw-r--r--
blank1.go
703
B
-rw-r--r--
bom.go
406
B
-rw-r--r--
bombad.go
480
B
-rw-r--r--
bounds.go
5.65
KB
-rw-r--r--
chancap.go
1.57
KB
-rw-r--r--
chanlinear.go
2.12
KB
-rw-r--r--
char_lit.go
657
B
-rw-r--r--
char_lit1.go
813
B
-rw-r--r--
checkbce.go
3.56
KB
-rw-r--r--
clearfat.go
1.15
KB
-rw-r--r--
closedchan.go
5.79
KB
-rw-r--r--
closure.go
1.69
KB
-rw-r--r--
closure1.go
280
B
-rw-r--r--
closure2.go
1.69
KB
-rw-r--r--
closure3.go
295
B
-rw-r--r--
closure4.go
364
B
-rw-r--r--
cmp.go
7.63
KB
-rw-r--r--
cmp6.go
2.09
KB
-rw-r--r--
cmplx.go
1.39
KB
-rw-r--r--
cmplxdivide.c
2.05
KB
-rw-r--r--
cmplxdivide.go
868
B
-rw-r--r--
cmplxdivide1.go
240.68
KB
-rw-r--r--
complit.go
1.71
KB
-rw-r--r--
complit1.go
1.48
KB
-rw-r--r--
compos.go
403
B
-rw-r--r--
const.go
4.78
KB
-rw-r--r--
const1.go
3.39
KB
-rw-r--r--
const2.go
605
B
-rw-r--r--
const3.go
659
B
-rw-r--r--
const4.go
1.28
KB
-rw-r--r--
const5.go
835
B
-rw-r--r--
const6.go
834
B
-rw-r--r--
convT2X.go
3.33
KB
-rw-r--r--
convert.go
833
B
-rw-r--r--
convert1.go
3.41
KB
-rw-r--r--
convert2.go
5.05
KB
-rw-r--r--
convert3.go
544
B
-rw-r--r--
convlit.go
2.25
KB
-rw-r--r--
convlit1.go
458
B
-rw-r--r--
copy.go
6.6
KB
-rw-r--r--
copy1.go
763
B
-rw-r--r--
crlf.go
782
B
-rw-r--r--
ddd.go
4.23
KB
-rw-r--r--
ddd1.go
1.56
KB
-rw-r--r--
ddd2.go
252
B
-rw-r--r--
decl.go
926
B
-rw-r--r--
declbad.go
1.4
KB
-rw-r--r--
defer.go
875
B
-rw-r--r--
defererrcheck.go
1.53
KB
-rw-r--r--
deferfin.go
1.12
KB
-rw-r--r--
defernil.go
563
B
-rw-r--r--
deferprint.go
586
B
-rw-r--r--
deferprint.out
126
B
-rw-r--r--
devirt.go
599
B
-rw-r--r--
divide.go
1.22
KB
-rw-r--r--
divmod.go
9.28
KB
-rw-r--r--
empty.go
316
B
-rw-r--r--
env.go
585
B
-rw-r--r--
eof.go
308
B
-rw-r--r--
eof1.go
333
B
-rw-r--r--
escape.go
3.79
KB
-rw-r--r--
escape2.go
35.16
KB
-rw-r--r--
escape2n.go
35.19
KB
-rw-r--r--
escape3.go
524
B
-rw-r--r--
escape4.go
1.3
KB
-rw-r--r--
escape5.go
4.92
KB
-rw-r--r--
escape_array.go
3.64
KB
-rw-r--r--
escape_calls.go
1.26
KB
-rw-r--r--
escape_closure.go
3.94
KB
-rw-r--r--
escape_field.go
2.93
KB
-rw-r--r--
escape_goto.go
674
B
-rw-r--r--
escape_hash_maphash.go
368
B
-rw-r--r--
escape_iface.go
4.51
KB
-rw-r--r--
escape_indir.go
3.39
KB
-rw-r--r--
escape_level.go
1.79
KB
-rw-r--r--
escape_map.go
2.76
KB
-rw-r--r--
escape_param.go
9.11
KB
-rw-r--r--
escape_runtime_atomic.go
874
B
-rw-r--r--
escape_selfassign.go
538
B
-rw-r--r--
escape_slice.go
3.49
KB
-rw-r--r--
escape_struct_param1.go
9.43
KB
-rw-r--r--
escape_struct_param2.go
9.46
KB
-rw-r--r--
escape_struct_return.go
1.04
KB
-rw-r--r--
escape_sync_atomic.go
943
B
-rw-r--r--
escape_unsafe.go
2.16
KB
-rw-r--r--
fibo.go
6.28
KB
-rw-r--r--
finprofiled.go
1.95
KB
-rw-r--r--
float_lit.go
3.95
KB
-rw-r--r--
float_lit2.go
7.88
KB
-rw-r--r--
float_lit3.go
1.78
KB
-rw-r--r--
floatcmp.go
3.03
KB
-rw-r--r--
for.go
844
B
-rw-r--r--
func.go
1.29
KB
-rw-r--r--
func1.go
434
B
-rw-r--r--
func2.go
578
B
-rw-r--r--
func3.go
505
B
-rw-r--r--
func4.go
409
B
-rw-r--r--
func5.go
1.49
KB
-rw-r--r--
func6.go
393
B
-rw-r--r--
func7.go
477
B
-rw-r--r--
func8.go
599
B
-rw-r--r--
funcdup.go
1.19
KB
-rw-r--r--
funcdup2.go
655
B
-rw-r--r--
gc.go
411
B
-rw-r--r--
gc1.go
303
B
-rw-r--r--
gc2.go
972
B
-rw-r--r--
gcgort.go
34.54
KB
-rw-r--r--
gcstring.go
872
B
-rw-r--r--
goprint.go
722
B
-rw-r--r--
goprint.out
65
B
-rw-r--r--
goto.go
8.39
KB
-rw-r--r--
heapsampling.go
9.53
KB
-rw-r--r--
helloworld.go
269
B
-rw-r--r--
helloworld.out
13
B
-rw-r--r--
if.go
1.36
KB
-rw-r--r--
import.go
425
B
-rw-r--r--
import1.go
633
B
-rw-r--r--
import2.go
247
B
-rw-r--r--
import4.go
310
B
-rw-r--r--
import5.go
722
B
-rw-r--r--
import6.go
1.38
KB
-rw-r--r--
index.go
6.42
KB
-rw-r--r--
index0.go
301
B
-rw-r--r--
index1.go
305
B
-rw-r--r--
index2.go
305
B
-rw-r--r--
indirect.go
1.39
KB
-rw-r--r--
indirect1.go
1.53
KB
-rw-r--r--
init.go
432
B
-rw-r--r--
init1.go
1.08
KB
-rw-r--r--
initcomma.go
1.22
KB
-rw-r--r--
initempty.go
604
B
-rw-r--r--
initialize.go
1.24
KB
-rw-r--r--
initializerr.go
1.04
KB
-rw-r--r--
initloop.go
387
B
-rw-r--r--
inline.go
4.33
KB
-rw-r--r--
inline_big.go
12.64
KB
-rw-r--r--
inline_caller.go
1.36
KB
-rw-r--r--
inline_callers.go
1.87
KB
-rw-r--r--
inline_literal.go
1.02
KB
-rw-r--r--
inline_math_bits_rotate.go
569
B
-rw-r--r--
inline_sync.go
1.63
KB
-rw-r--r--
inline_variadic.go
516
B
-rw-r--r--
int_lit.go
387
B
-rw-r--r--
intcvt.go
4.26
KB
-rw-r--r--
intrinsic.go
259
B
-rw-r--r--
intrinsic_atomic.go
791
B
-rw-r--r--
iota.go
1.59
KB
-rw-r--r--
label.go
1007
B
-rw-r--r--
label1.go
1.88
KB
-rw-r--r--
linkmain.go
236
B
-rw-r--r--
linkmain_run.go
1.71
KB
-rw-r--r--
linkname.go
456
B
-rw-r--r--
linkobj.go
3.17
KB
-rw-r--r--
linkx.go
741
B
-rw-r--r--
linkx_run.go
1.65
KB
-rw-r--r--
literal.go
4.99
KB
-rw-r--r--
literal2.go
2.22
KB
-rw-r--r--
live.go
17.83
KB
-rw-r--r--
live1.go
1.29
KB
-rw-r--r--
live2.go
963
B
-rw-r--r--
live_syscall.go
1.13
KB
-rw-r--r--
locklinear.go
3.56
KB
-rw-r--r--
loopbce.go
9.75
KB
-rw-r--r--
makechan.go
1.29
KB
-rw-r--r--
makemap.go
1.5
KB
-rw-r--r--
makenew.go
522
B
-rw-r--r--
mallocfin.go
1.18
KB
-rw-r--r--
map.go
14.91
KB
-rw-r--r--
map1.go
1.39
KB
-rw-r--r--
mapclear.go
1.49
KB
-rw-r--r--
maplinear.go
3.62
KB
-rw-r--r--
mergemul.go
3.16
KB
-rw-r--r--
method.go
5.24
KB
-rw-r--r--
method1.go
727
B
-rw-r--r--
method2.go
1.05
KB
-rw-r--r--
method3.go
570
B
-rw-r--r--
method4.go
230
B
-rw-r--r--
method5.go
6.73
KB
-rw-r--r--
method6.go
465
B
-rw-r--r--
method7.go
940
B
-rw-r--r--
named.go
4.61
KB
-rw-r--r--
named1.go
970
B
-rw-r--r--
nil.go
2.23
KB
-rw-r--r--
nilcheck.go
3.62
KB
-rw-r--r--
nilptr.go
3.06
KB
-rw-r--r--
nilptr2.go
3.6
KB
-rw-r--r--
nilptr3.go
5.56
KB
-rw-r--r--
nilptr4.go
428
B
-rw-r--r--
nilptr5.go
814
B
-rw-r--r--
nilptr5_aix.go
805
B
-rw-r--r--
nilptr5_wasm.go
812
B
-rw-r--r--
nilptr_aix.go
3.09
KB
-rw-r--r--
nosplit.go
10.51
KB
-rw-r--r--
notinheap.go
1.39
KB
-rw-r--r--
notinheap2.go
708
B
-rw-r--r--
notinheap3.go
1.24
KB
-rw-r--r--
nowritebarrier.go
1.2
KB
-rw-r--r--
nul1.go
1.23
KB
-rw-r--r--
opt_branchlikely.go
2.08
KB
-rw-r--r--
parentype.go
424
B
-rw-r--r--
peano.go
2.22
KB
-rw-r--r--
phiopt.go
1.68
KB
-rw-r--r--
print.go
1.56
KB
-rw-r--r--
print.out
247
B
-rw-r--r--
printbig.go
315
B
-rw-r--r--
printbig.out
41
B
-rw-r--r--
prove.go
17.74
KB
-rw-r--r--
range.go
8.14
KB
-rw-r--r--
recover.go
10.64
KB
-rw-r--r--
recover1.go
2.5
KB
-rw-r--r--
recover2.go
1.22
KB
-rw-r--r--
recover3.go
1.64
KB
-rw-r--r--
recover4.go
2.17
KB
-rw-r--r--
recover5.go
408
B
-rw-r--r--
reflectmethod1.go
578
B
-rw-r--r--
reflectmethod2.go
719
B
-rw-r--r--
reflectmethod3.go
651
B
-rw-r--r--
reflectmethod4.go
573
B
-rw-r--r--
rename.go
1.52
KB
-rw-r--r--
rename1.go
1.11
KB
-rw-r--r--
reorder.go
2.1
KB
-rw-r--r--
reorder2.go
7.22
KB
-rw-r--r--
retjmp.go
252
B
-rw-r--r--
return.go
32.69
KB
-rw-r--r--
rotate.go
3.27
KB
-rw-r--r--
rotate0.go
286
B
-rw-r--r--
rotate1.go
286
B
-rw-r--r--
rotate2.go
286
B
-rw-r--r--
rotate3.go
286
B
-rw-r--r--
run.go
46.86
KB
-rw-r--r--
rune.go
603
B
-rw-r--r--
runtime.go
602
B
-rw-r--r--
shift1.go
8.89
KB
-rw-r--r--
shift2.go
1.31
KB
-rw-r--r--
sieve.go
1
KB
-rw-r--r--
sigchld.go
365
B
-rw-r--r--
sigchld.out
17
B
-rw-r--r--
simassign.go
1.12
KB
-rw-r--r--
sinit.go
5.75
KB
-rw-r--r--
sinit_run.go
853
B
-rw-r--r--
sizeof.go
2.95
KB
-rw-r--r--
slice3.go
2.92
KB
-rw-r--r--
slice3err.go
4.48
KB
-rw-r--r--
slicecap.go
1.85
KB
-rw-r--r--
sliceopt.go
735
B
-rw-r--r--
solitaire.go
2.9
KB
-rw-r--r--
stack.go
1.69
KB
-rw-r--r--
stackobj.go
975
B
-rw-r--r--
stackobj2.go
1.55
KB
-rw-r--r--
stackobj3.go
1.42
KB
-rw-r--r--
strcopy.go
674
B
-rw-r--r--
strength.go
1.02
KB
-rw-r--r--
string_lit.go
3.58
KB
-rw-r--r--
stringrange.go
1.45
KB
-rw-r--r--
struct0.go
565
B
-rw-r--r--
switch.go
6.1
KB
-rw-r--r--
switch2.go
778
B
-rw-r--r--
switch3.go
1.19
KB
-rw-r--r--
switch4.go
526
B
-rw-r--r--
switch5.go
2.21
KB
-rw-r--r--
switch6.go
1.1
KB
-rw-r--r--
switch7.go
781
B
-rw-r--r--
tinyfin.go
1.57
KB
-rw-r--r--
torture.go
7.69
KB
-rw-r--r--
turing.go
893
B
-rw-r--r--
typecheck.go
386
B
-rw-r--r--
typecheckloop.go
486
B
-rw-r--r--
typeswitch.go
1.83
KB
-rw-r--r--
typeswitch1.go
1.6
KB
-rw-r--r--
typeswitch2.go
655
B
-rw-r--r--
typeswitch2b.go
598
B
-rw-r--r--
typeswitch3.go
964
B
-rw-r--r--
uintptrescapes.go
250
B
-rw-r--r--
uintptrescapes2.go
2.18
KB
-rw-r--r--
uintptrescapes3.go
1.28
KB
-rw-r--r--
undef.go
758
B
-rw-r--r--
utf.go
1.19
KB
-rw-r--r--
varerr.go
434
B
-rw-r--r--
varinit.go
509
B
-rw-r--r--
writebarrier.go
5.57
KB
-rw-r--r--
zerodivide.go
5.71
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : map.go
// run // Copyright 2009 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. // Test maps, almost exhaustively. // Complexity (linearity) test is in maplinear.go. package main import ( "fmt" "math" "strconv" ) const count = 100 func P(a []string) string { s := "{" for i := 0; i < len(a); i++ { if i > 0 { s += "," } s += `"` + a[i] + `"` } s += "}" return s } func main() { testbasic() testfloat() testnan() } func testbasic() { // Test a map literal. mlit := map[string]int{"0": 0, "1": 1, "2": 2, "3": 3, "4": 4} for i := 0; i < len(mlit); i++ { s := string([]byte{byte(i) + '0'}) if mlit[s] != i { panic(fmt.Sprintf("mlit[%s] = %d\n", s, mlit[s])) } } mib := make(map[int]bool) mii := make(map[int]int) mfi := make(map[float32]int) mif := make(map[int]float32) msi := make(map[string]int) mis := make(map[int]string) mss := make(map[string]string) mspa := make(map[string][]string) // BUG need an interface map both ways too type T struct { i int64 // can't use string here; struct values are only compared at the top level f float32 } mipT := make(map[int]*T) mpTi := make(map[*T]int) mit := make(map[int]T) // mti := make(map[T] int) type M map[int]int mipM := make(map[int]M) var apT [2 * count]*T for i := 0; i < count; i++ { s := strconv.Itoa(i) s10 := strconv.Itoa(i * 10) f := float32(i) t := T{int64(i), f} apT[i] = new(T) apT[i].i = int64(i) apT[i].f = f apT[2*i] = new(T) // need twice as many entries as we use, for the nonexistence check apT[2*i].i = int64(i) apT[2*i].f = f m := M{i: i + 1} mib[i] = (i != 0) mii[i] = 10 * i mfi[float32(i)] = 10 * i mif[i] = 10.0 * f mis[i] = s msi[s] = i mss[s] = s10 mss[s] = s10 as := make([]string, 2) as[0] = s10 as[1] = s10 mspa[s] = as mipT[i] = apT[i] mpTi[apT[i]] = i mipM[i] = m mit[i] = t // mti[t] = i } // test len if len(mib) != count { panic(fmt.Sprintf("len(mib) = %d\n", len(mib))) } if len(mii) != count { panic(fmt.Sprintf("len(mii) = %d\n", len(mii))) } if len(mfi) != count { panic(fmt.Sprintf("len(mfi) = %d\n", len(mfi))) } if len(mif) != count { panic(fmt.Sprintf("len(mif) = %d\n", len(mif))) } if len(msi) != count { panic(fmt.Sprintf("len(msi) = %d\n", len(msi))) } if len(mis) != count { panic(fmt.Sprintf("len(mis) = %d\n", len(mis))) } if len(mss) != count { panic(fmt.Sprintf("len(mss) = %d\n", len(mss))) } if len(mspa) != count { panic(fmt.Sprintf("len(mspa) = %d\n", len(mspa))) } if len(mipT) != count { panic(fmt.Sprintf("len(mipT) = %d\n", len(mipT))) } if len(mpTi) != count { panic(fmt.Sprintf("len(mpTi) = %d\n", len(mpTi))) } // if len(mti) != count { // panic(fmt.Sprintf("len(mti) = %d\n", len(mti))) // } if len(mipM) != count { panic(fmt.Sprintf("len(mipM) = %d\n", len(mipM))) } // if len(mti) != count { // panic(fmt.Sprintf("len(mti) = %d\n", len(mti))) // } if len(mit) != count { panic(fmt.Sprintf("len(mit) = %d\n", len(mit))) } // test construction directly for i := 0; i < count; i++ { s := strconv.Itoa(i) s10 := strconv.Itoa(i * 10) f := float32(i) // BUG m := M(i, i+1) if mib[i] != (i != 0) { panic(fmt.Sprintf("mib[%d] = %t\n", i, mib[i])) } if mii[i] != 10*i { panic(fmt.Sprintf("mii[%d] = %d\n", i, mii[i])) } if mfi[f] != 10*i { panic(fmt.Sprintf("mfi[%d] = %d\n", i, mfi[f])) } if mif[i] != 10.0*f { panic(fmt.Sprintf("mif[%d] = %g\n", i, mif[i])) } if mis[i] != s { panic(fmt.Sprintf("mis[%d] = %s\n", i, mis[i])) } if msi[s] != i { panic(fmt.Sprintf("msi[%s] = %d\n", s, msi[s])) } if mss[s] != s10 { panic(fmt.Sprintf("mss[%s] = %g\n", s, mss[s])) } for j := 0; j < len(mspa[s]); j++ { if mspa[s][j] != s10 { panic(fmt.Sprintf("mspa[%s][%d] = %s\n", s, j, mspa[s][j])) } } if mipT[i].i != int64(i) || mipT[i].f != f { panic(fmt.Sprintf("mipT[%d] = %v\n", i, mipT[i])) } if mpTi[apT[i]] != i { panic(fmt.Sprintf("mpTi[apT[%d]] = %d\n", i, mpTi[apT[i]])) } // if(mti[t] != i) { // panic(fmt.Sprintf("mti[%s] = %s\n", s, mti[t])) // } if mipM[i][i] != i+1 { panic(fmt.Sprintf("mipM[%d][%d] = %d\n", i, i, mipM[i][i])) } // if(mti[t] != i) { // panic(fmt.Sprintf("mti[%v] = %d\n", t, mti[t])) // } if mit[i].i != int64(i) || mit[i].f != f { panic(fmt.Sprintf("mit[%d] = {%d %g}\n", i, mit[i].i, mit[i].f)) } } // test existence with tuple check // failed lookups yield a false value for the boolean. for i := 0; i < count; i++ { s := strconv.Itoa(i) f := float32(i) { _, b := mib[i] if !b { panic(fmt.Sprintf("tuple existence decl: mib[%d]\n", i)) } _, b = mib[i] if !b { panic(fmt.Sprintf("tuple existence assign: mib[%d]\n", i)) } } { _, b := mii[i] if !b { panic(fmt.Sprintf("tuple existence decl: mii[%d]\n", i)) } _, b = mii[i] if !b { panic(fmt.Sprintf("tuple existence assign: mii[%d]\n", i)) } } { _, b := mfi[f] if !b { panic(fmt.Sprintf("tuple existence decl: mfi[%d]\n", i)) } _, b = mfi[f] if !b { panic(fmt.Sprintf("tuple existence assign: mfi[%d]\n", i)) } } { _, b := mif[i] if !b { panic(fmt.Sprintf("tuple existence decl: mif[%d]\n", i)) } _, b = mif[i] if !b { panic(fmt.Sprintf("tuple existence assign: mif[%d]\n", i)) } } { _, b := mis[i] if !b { panic(fmt.Sprintf("tuple existence decl: mis[%d]\n", i)) } _, b = mis[i] if !b { panic(fmt.Sprintf("tuple existence assign: mis[%d]\n", i)) } } { _, b := msi[s] if !b { panic(fmt.Sprintf("tuple existence decl: msi[%d]\n", i)) } _, b = msi[s] if !b { panic(fmt.Sprintf("tuple existence assign: msi[%d]\n", i)) } } { _, b := mss[s] if !b { panic(fmt.Sprintf("tuple existence decl: mss[%d]\n", i)) } _, b = mss[s] if !b { panic(fmt.Sprintf("tuple existence assign: mss[%d]\n", i)) } } { _, b := mspa[s] if !b { panic(fmt.Sprintf("tuple existence decl: mspa[%d]\n", i)) } _, b = mspa[s] if !b { panic(fmt.Sprintf("tuple existence assign: mspa[%d]\n", i)) } } { _, b := mipT[i] if !b { panic(fmt.Sprintf("tuple existence decl: mipT[%d]\n", i)) } _, b = mipT[i] if !b { panic(fmt.Sprintf("tuple existence assign: mipT[%d]\n", i)) } } { _, b := mpTi[apT[i]] if !b { panic(fmt.Sprintf("tuple existence decl: mpTi[apT[%d]]\n", i)) } _, b = mpTi[apT[i]] if !b { panic(fmt.Sprintf("tuple existence assign: mpTi[apT[%d]]\n", i)) } } { _, b := mipM[i] if !b { panic(fmt.Sprintf("tuple existence decl: mipM[%d]\n", i)) } _, b = mipM[i] if !b { panic(fmt.Sprintf("tuple existence assign: mipM[%d]\n", i)) } } { _, b := mit[i] if !b { panic(fmt.Sprintf("tuple existence decl: mit[%d]\n", i)) } _, b = mit[i] if !b { panic(fmt.Sprintf("tuple existence assign: mit[%d]\n", i)) } } // { // _, b := mti[t] // if !b { // panic(fmt.Sprintf("tuple existence decl: mti[%d]\n", i)) // } // _, b = mti[t] // if !b { // panic(fmt.Sprintf("tuple existence assign: mti[%d]\n", i)) // } // } } // test nonexistence with tuple check // failed lookups yield a false value for the boolean. for i := count; i < 2*count; i++ { s := strconv.Itoa(i) f := float32(i) { _, b := mib[i] if b { panic(fmt.Sprintf("tuple nonexistence decl: mib[%d]", i)) } _, b = mib[i] if b { panic(fmt.Sprintf("tuple nonexistence assign: mib[%d]", i)) } } { _, b := mii[i] if b { panic(fmt.Sprintf("tuple nonexistence decl: mii[%d]", i)) } _, b = mii[i] if b { panic(fmt.Sprintf("tuple nonexistence assign: mii[%d]", i)) } } { _, b := mfi[f] if b { panic(fmt.Sprintf("tuple nonexistence decl: mfi[%d]", i)) } _, b = mfi[f] if b { panic(fmt.Sprintf("tuple nonexistence assign: mfi[%d]", i)) } } { _, b := mif[i] if b { panic(fmt.Sprintf("tuple nonexistence decl: mif[%d]", i)) } _, b = mif[i] if b { panic(fmt.Sprintf("tuple nonexistence assign: mif[%d]", i)) } } { _, b := mis[i] if b { panic(fmt.Sprintf("tuple nonexistence decl: mis[%d]", i)) } _, b = mis[i] if b { panic(fmt.Sprintf("tuple nonexistence assign: mis[%d]", i)) } } { _, b := msi[s] if b { panic(fmt.Sprintf("tuple nonexistence decl: msi[%d]", i)) } _, b = msi[s] if b { panic(fmt.Sprintf("tuple nonexistence assign: msi[%d]", i)) } } { _, b := mss[s] if b { panic(fmt.Sprintf("tuple nonexistence decl: mss[%d]", i)) } _, b = mss[s] if b { panic(fmt.Sprintf("tuple nonexistence assign: mss[%d]", i)) } } { _, b := mspa[s] if b { panic(fmt.Sprintf("tuple nonexistence decl: mspa[%d]", i)) } _, b = mspa[s] if b { panic(fmt.Sprintf("tuple nonexistence assign: mspa[%d]", i)) } } { _, b := mipT[i] if b { panic(fmt.Sprintf("tuple nonexistence decl: mipT[%d]", i)) } _, b = mipT[i] if b { panic(fmt.Sprintf("tuple nonexistence assign: mipT[%d]", i)) } } { _, b := mpTi[apT[i]] if b { panic(fmt.Sprintf("tuple nonexistence decl: mpTi[apt[%d]]", i)) } _, b = mpTi[apT[i]] if b { panic(fmt.Sprintf("tuple nonexistence assign: mpTi[apT[%d]]", i)) } } { _, b := mipM[i] if b { panic(fmt.Sprintf("tuple nonexistence decl: mipM[%d]", i)) } _, b = mipM[i] if b { panic(fmt.Sprintf("tuple nonexistence assign: mipM[%d]", i)) } } // { // _, b := mti[t] // if b { // panic(fmt.Sprintf("tuple nonexistence decl: mti[%d]", i)) // } // _, b = mti[t] // if b { // panic(fmt.Sprintf("tuple nonexistence assign: mti[%d]", i)) // } // } { _, b := mit[i] if b { panic(fmt.Sprintf("tuple nonexistence decl: mit[%d]", i)) } _, b = mit[i] if b { panic(fmt.Sprintf("tuple nonexistence assign: mit[%d]", i)) } } } // tests for structured map element updates for i := 0; i < count; i++ { s := strconv.Itoa(i) mspa[s][i%2] = "deleted" if mspa[s][i%2] != "deleted" { panic(fmt.Sprintf("update mspa[%s][%d] = %s\n", s, i%2, mspa[s][i%2])) } mipT[i].i += 1 if mipT[i].i != int64(i)+1 { panic(fmt.Sprintf("update mipT[%d].i = %d\n", i, mipT[i].i)) } mipT[i].f = float32(i + 1) if mipT[i].f != float32(i+1) { panic(fmt.Sprintf("update mipT[%d].f = %g\n", i, mipT[i].f)) } mipM[i][i]++ if mipM[i][i] != (i+1)+1 { panic(fmt.Sprintf("update mipM[%d][%d] = %d\n", i, i, mipM[i][i])) } } // test range on nil map var mnil map[string]int for _, _ = range mnil { panic("range mnil") } } func testfloat() { // Test floating point numbers in maps. // Two map keys refer to the same entry if the keys are ==. // The special cases, then, are that +0 == -0 and that NaN != NaN. { var ( pz = float32(0) nz = math.Float32frombits(1 << 31) nana = float32(math.NaN()) nanb = math.Float32frombits(math.Float32bits(nana) ^ 2) ) m := map[float32]string{ pz: "+0", nana: "NaN", nanb: "NaN", } if m[pz] != "+0" { panic(fmt.Sprintln("float32 map cannot read back m[+0]:", m[pz])) } if m[nz] != "+0" { fmt.Sprintln("float32 map does not treat", pz, "and", nz, "as equal for read") panic(fmt.Sprintln("float32 map does not treat -0 and +0 as equal for read")) } m[nz] = "-0" if m[pz] != "-0" { panic(fmt.Sprintln("float32 map does not treat -0 and +0 as equal for write")) } if _, ok := m[nana]; ok { panic(fmt.Sprintln("float32 map allows NaN lookup (a)")) } if _, ok := m[nanb]; ok { panic(fmt.Sprintln("float32 map allows NaN lookup (b)")) } if len(m) != 3 { panic(fmt.Sprintln("float32 map should have 3 entries:", m)) } m[nana] = "NaN" m[nanb] = "NaN" if len(m) != 5 { panic(fmt.Sprintln("float32 map should have 5 entries:", m)) } } { var ( pz = float64(0) nz = math.Float64frombits(1 << 63) nana = float64(math.NaN()) nanb = math.Float64frombits(math.Float64bits(nana) ^ 2) ) m := map[float64]string{ pz: "+0", nana: "NaN", nanb: "NaN", } if m[nz] != "+0" { panic(fmt.Sprintln("float64 map does not treat -0 and +0 as equal for read")) } m[nz] = "-0" if m[pz] != "-0" { panic(fmt.Sprintln("float64 map does not treat -0 and +0 as equal for write")) } if _, ok := m[nana]; ok { panic(fmt.Sprintln("float64 map allows NaN lookup (a)")) } if _, ok := m[nanb]; ok { panic(fmt.Sprintln("float64 map allows NaN lookup (b)")) } if len(m) != 3 { panic(fmt.Sprintln("float64 map should have 3 entries:", m)) } m[nana] = "NaN" m[nanb] = "NaN" if len(m) != 5 { panic(fmt.Sprintln("float64 map should have 5 entries:", m)) } } { var ( pz = complex64(0) nz = complex(0, math.Float32frombits(1<<31)) nana = complex(5, float32(math.NaN())) nanb = complex(5, math.Float32frombits(math.Float32bits(float32(math.NaN()))^2)) ) m := map[complex64]string{ pz: "+0", nana: "NaN", nanb: "NaN", } if m[nz] != "+0" { panic(fmt.Sprintln("complex64 map does not treat -0 and +0 as equal for read")) } m[nz] = "-0" if m[pz] != "-0" { panic(fmt.Sprintln("complex64 map does not treat -0 and +0 as equal for write")) } if _, ok := m[nana]; ok { panic(fmt.Sprintln("complex64 map allows NaN lookup (a)")) } if _, ok := m[nanb]; ok { panic(fmt.Sprintln("complex64 map allows NaN lookup (b)")) } if len(m) != 3 { panic(fmt.Sprintln("complex64 map should have 3 entries:", m)) } m[nana] = "NaN" m[nanb] = "NaN" if len(m) != 5 { panic(fmt.Sprintln("complex64 map should have 5 entries:", m)) } } { var ( pz = complex128(0) nz = complex(0, math.Float64frombits(1<<63)) nana = complex(5, float64(math.NaN())) nanb = complex(5, math.Float64frombits(math.Float64bits(float64(math.NaN()))^2)) ) m := map[complex128]string{ pz: "+0", nana: "NaN", nanb: "NaN", } if m[nz] != "+0" { panic(fmt.Sprintln("complex128 map does not treat -0 and +0 as equal for read")) } m[nz] = "-0" if m[pz] != "-0" { panic(fmt.Sprintln("complex128 map does not treat -0 and +0 as equal for write")) } if _, ok := m[nana]; ok { panic(fmt.Sprintln("complex128 map allows NaN lookup (a)")) } if _, ok := m[nanb]; ok { panic(fmt.Sprintln("complex128 map allows NaN lookup (b)")) } if len(m) != 3 { panic(fmt.Sprintln("complex128 map should have 3 entries:", m)) } m[nana] = "NaN" m[nanb] = "NaN" if len(m) != 5 { panic(fmt.Sprintln("complex128 map should have 5 entries:", m)) } } } func testnan() { n := 500 m := map[float64]int{} nan := math.NaN() for i := 0; i < n; i++ { m[nan] = 1 } if len(m) != n { panic("wrong size map after nan insertion") } iters := 0 for k, v := range m { iters++ if !math.IsNaN(k) { panic("not NaN") } if v != 1 { panic("wrong value") } } if iters != n { panic("wrong number of nan range iters") } }
Close
