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 : range.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 the 'for range' construct. package main // test range over channels func gen(c chan int, lo, hi int) { for i := lo; i <= hi; i++ { c <- i } close(c) } func seq(lo, hi int) chan int { c := make(chan int) go gen(c, lo, hi) return c } const alphabet = "abcdefghijklmnopqrstuvwxyz" func testblankvars() { n := 0 for range alphabet { n++ } if n != 26 { println("for range: wrong count", n, "want 26") panic("fail") } n = 0 for _ = range alphabet { n++ } if n != 26 { println("for _ = range: wrong count", n, "want 26") panic("fail") } n = 0 for _, _ = range alphabet { n++ } if n != 26 { println("for _, _ = range: wrong count", n, "want 26") panic("fail") } s := 0 for i, _ := range alphabet { s += i } if s != 325 { println("for i, _ := range: wrong sum", s, "want 325") panic("fail") } r := rune(0) for _, v := range alphabet { r += v } if r != 2847 { println("for _, v := range: wrong sum", r, "want 2847") panic("fail") } } func testchan() { s := "" for i := range seq('a', 'z') { s += string(i) } if s != alphabet { println("Wanted lowercase alphabet; got", s) panic("fail") } n := 0 for range seq('a', 'z') { n++ } if n != 26 { println("testchan wrong count", n, "want 26") panic("fail") } } // test that range over slice only evaluates // the expression after "range" once. var nmake = 0 func makeslice() []int { nmake++ return []int{1, 2, 3, 4, 5} } func testslice() { s := 0 nmake = 0 for _, v := range makeslice() { s += v } if nmake != 1 { println("range called makeslice", nmake, "times") panic("fail") } if s != 15 { println("wrong sum ranging over makeslice", s) panic("fail") } x := []int{10, 20} y := []int{99} i := 1 for i, x[i] = range y { break } if i != 0 || x[0] != 10 || x[1] != 99 { println("wrong parallel assignment", i, x[0], x[1]) panic("fail") } } func testslice1() { s := 0 nmake = 0 for i := range makeslice() { s += i } if nmake != 1 { println("range called makeslice", nmake, "times") panic("fail") } if s != 10 { println("wrong sum ranging over makeslice", s) panic("fail") } } func testslice2() { n := 0 nmake = 0 for range makeslice() { n++ } if nmake != 1 { println("range called makeslice", nmake, "times") panic("fail") } if n != 5 { println("wrong count ranging over makeslice", n) panic("fail") } } // test that range over []byte(string) only evaluates // the expression after "range" once. func makenumstring() string { nmake++ return "\x01\x02\x03\x04\x05" } func testslice3() { s := byte(0) nmake = 0 for _, v := range []byte(makenumstring()) { s += v } if nmake != 1 { println("range called makenumstring", nmake, "times") panic("fail") } if s != 15 { println("wrong sum ranging over []byte(makenumstring)", s) panic("fail") } } // test that range over array only evaluates // the expression after "range" once. func makearray() [5]int { nmake++ return [5]int{1, 2, 3, 4, 5} } func testarray() { s := 0 nmake = 0 for _, v := range makearray() { s += v } if nmake != 1 { println("range called makearray", nmake, "times") panic("fail") } if s != 15 { println("wrong sum ranging over makearray", s) panic("fail") } } func testarray1() { s := 0 nmake = 0 for i := range makearray() { s += i } if nmake != 1 { println("range called makearray", nmake, "times") panic("fail") } if s != 10 { println("wrong sum ranging over makearray", s) panic("fail") } } func testarray2() { n := 0 nmake = 0 for range makearray() { n++ } if nmake != 1 { println("range called makearray", nmake, "times") panic("fail") } if n != 5 { println("wrong count ranging over makearray", n) panic("fail") } } func makearrayptr() *[5]int { nmake++ return &[5]int{1, 2, 3, 4, 5} } func testarrayptr() { nmake = 0 x := len(makearrayptr()) if x != 5 || nmake != 1 { println("len called makearrayptr", nmake, "times and got len", x) panic("fail") } nmake = 0 x = cap(makearrayptr()) if x != 5 || nmake != 1 { println("cap called makearrayptr", nmake, "times and got len", x) panic("fail") } s := 0 nmake = 0 for _, v := range makearrayptr() { s += v } if nmake != 1 { println("range called makearrayptr", nmake, "times") panic("fail") } if s != 15 { println("wrong sum ranging over makearrayptr", s) panic("fail") } } func testarrayptr1() { s := 0 nmake = 0 for i := range makearrayptr() { s += i } if nmake != 1 { println("range called makearrayptr", nmake, "times") panic("fail") } if s != 10 { println("wrong sum ranging over makearrayptr", s) panic("fail") } } func testarrayptr2() { n := 0 nmake = 0 for range makearrayptr() { n++ } if nmake != 1 { println("range called makearrayptr", nmake, "times") panic("fail") } if n != 5 { println("wrong count ranging over makearrayptr", n) panic("fail") } } // test that range over string only evaluates // the expression after "range" once. func makestring() string { nmake++ return "abcd☺" } func teststring() { var s rune nmake = 0 for _, v := range makestring() { s += v } if nmake != 1 { println("range called makestring", nmake, "times") panic("fail") } if s != 'a'+'b'+'c'+'d'+'☺' { println("wrong sum ranging over makestring", s) panic("fail") } x := []rune{'a', 'b'} i := 1 for i, x[i] = range "c" { break } if i != 0 || x[0] != 'a' || x[1] != 'c' { println("wrong parallel assignment", i, x[0], x[1]) panic("fail") } y := []int{1, 2, 3} r := rune(1) for y[r], r = range "\x02" { break } if r != 2 || y[0] != 1 || y[1] != 0 || y[2] != 3 { println("wrong parallel assignment", r, y[0], y[1], y[2]) panic("fail") } } func teststring1() { s := 0 nmake = 0 for i := range makestring() { s += i } if nmake != 1 { println("range called makestring", nmake, "times") panic("fail") } if s != 10 { println("wrong sum ranging over makestring", s) panic("fail") } } func teststring2() { n := 0 nmake = 0 for range makestring() { n++ } if nmake != 1 { println("range called makestring", nmake, "times") panic("fail") } if n != 5 { println("wrong count ranging over makestring", n) panic("fail") } } // test that range over map only evaluates // the expression after "range" once. func makemap() map[int]int { nmake++ return map[int]int{0: 'a', 1: 'b', 2: 'c', 3: 'd', 4: '☺'} } func testmap() { s := 0 nmake = 0 for _, v := range makemap() { s += v } if nmake != 1 { println("range called makemap", nmake, "times") panic("fail") } if s != 'a'+'b'+'c'+'d'+'☺' { println("wrong sum ranging over makemap", s) panic("fail") } } func testmap1() { s := 0 nmake = 0 for i := range makemap() { s += i } if nmake != 1 { println("range called makemap", nmake, "times") panic("fail") } if s != 10 { println("wrong sum ranging over makemap", s) panic("fail") } } func testmap2() { n := 0 nmake = 0 for range makemap() { n++ } if nmake != 1 { println("range called makemap", nmake, "times") panic("fail") } if n != 5 { println("wrong count ranging over makemap", n) panic("fail") } } // test that range evaluates the index and value expressions // exactly once per iteration. var ncalls = 0 func getvar(p *int) *int { ncalls++ return p } func testcalls() { var i, v int si := 0 sv := 0 for *getvar(&i), *getvar(&v) = range [2]int{1, 2} { si += i sv += v } if ncalls != 4 { println("wrong number of calls:", ncalls, "!= 4") panic("fail") } if si != 1 || sv != 3 { println("wrong sum in testcalls", si, sv) panic("fail") } ncalls = 0 for *getvar(&i), *getvar(&v) = range [0]int{} { println("loop ran on empty array") panic("fail") } if ncalls != 0 { println("wrong number of calls:", ncalls, "!= 0") panic("fail") } } func main() { testblankvars() testchan() testarray() testarray1() testarray2() testarrayptr() testarrayptr1() testarrayptr2() testslice() testslice1() testslice2() testslice3() teststring() teststring1() teststring2() testmap() testmap1() testmap2() testcalls() }
Close
