1 // $G $F.go && $L $F.$A && ./$A.out
3 // Copyright 2009 The Go Authors. All rights reserved.
4 // Use of this source code is governed by a BSD-style
5 // license that can be found in the LICENSE file.
16 func P(a []string) string {
18 for i := 0; i < len(a); i++ {
29 // Test a map literal.
30 mlit := map[string] int { "0":0, "1":1, "2":2, "3":3, "4":4 }
31 for i := 0; i < len(mlit); i++ {
32 s := string([]byte{byte(i)+'0'})
34 fmt.Printf("mlit[%s] = %d\n", s, mlit[s])
38 mib := make(map[int] bool)
39 mii := make(map[int] int)
40 mfi := make(map[float] int)
41 mif := make(map[int] float)
42 msi := make(map[string] int)
43 mis := make(map[int] string)
44 mss := make(map[string] string)
45 mspa := make(map[string] []string)
46 // BUG need an interface map both ways too
49 i int64 // can't use string here; struct values are only compared at the top level
52 mipT := make(map[int] *T)
53 mpTi := make(map[*T] int)
54 mit := make(map[int] T)
55 // mti := make(map[T] int)
58 mipM := make(map[int] M)
62 for i := 0; i < count; i++ {
64 s10 := strconv.Itoa(i*10)
70 apT[2*i] = new(T) // need twice as many entries as we use, for the nonexistence check
82 as := make([]string, 2)
94 if len(mib) != count {
95 fmt.Printf("len(mib) = %d\n", len(mib))
97 if len(mii) != count {
98 fmt.Printf("len(mii) = %d\n", len(mii))
100 if len(mfi) != count {
101 fmt.Printf("len(mfi) = %d\n", len(mfi))
103 if len(mif) != count {
104 fmt.Printf("len(mif) = %d\n", len(mif))
106 if len(msi) != count {
107 fmt.Printf("len(msi) = %d\n", len(msi))
109 if len(mis) != count {
110 fmt.Printf("len(mis) = %d\n", len(mis))
112 if len(mss) != count {
113 fmt.Printf("len(mss) = %d\n", len(mss))
115 if len(mspa) != count {
116 fmt.Printf("len(mspa) = %d\n", len(mspa))
118 if len(mipT) != count {
119 fmt.Printf("len(mipT) = %d\n", len(mipT))
121 if len(mpTi) != count {
122 fmt.Printf("len(mpTi) = %d\n", len(mpTi))
124 // if len(mti) != count {
125 // fmt.Printf("len(mti) = %d\n", len(mti))
127 if len(mipM) != count {
128 fmt.Printf("len(mipM) = %d\n", len(mipM))
130 // if len(mti) != count {
131 // fmt.Printf("len(mti) = %d\n", len(mti))
133 if len(mit) != count {
134 fmt.Printf("len(mit) = %d\n", len(mit))
137 // test construction directly
138 for i := 0; i < count; i++ {
140 s10 := strconv.Itoa(i*10)
142 // BUG m := M(i, i+1)
143 if mib[i] != (i != 0) {
144 fmt.Printf("mib[%d] = %t\n", i, mib[i])
147 fmt.Printf("mii[%d] = %d\n", i, mii[i])
150 fmt.Printf("mfi[%d] = %d\n", i, mfi[f])
152 if(mif[i] != 10.0*f) {
153 fmt.Printf("mif[%d] = %g\n", i, mif[i])
156 fmt.Printf("mis[%d] = %s\n", i, mis[i])
159 fmt.Printf("msi[%s] = %d\n", s, msi[s])
162 fmt.Printf("mss[%s] = %g\n", s, mss[s])
164 for j := 0; j < len(mspa[s]); j++ {
165 if mspa[s][j] != s10 {
166 fmt.Printf("mspa[%s][%d] = %s\n", s, j, mspa[s][j])
169 if(mipT[i].i != int64(i) || mipT[i].f != f) {
170 fmt.Printf("mipT[%d] = %v\n", i, mipT[i])
172 if(mpTi[apT[i]] != i) {
173 fmt.Printf("mpTi[apT[%d]] = %d\n", i, mpTi[apT[i]])
176 // fmt.Printf("mti[%s] = %s\n", s, mti[t])
178 if (mipM[i][i] != i + 1) {
179 fmt.Printf("mipM[%d][%d] = %d\n", i, i, mipM[i][i])
182 // fmt.Printf("mti[%v] = %d\n", t, mti[t])
184 if(mit[i].i != int64(i) || mit[i].f != f) {
185 fmt.Printf("mit[%d] = {%d %g}\n", i, mit[i].i, mit[i].f)
189 // test existence with tuple check
190 // failed lookups yield a false value for the boolean.
191 for i := 0; i < count; i++ {
197 fmt.Printf("tuple existence decl: mib[%d]\n", i)
201 fmt.Printf("tuple existence assign: mib[%d]\n", i)
207 fmt.Printf("tuple existence decl: mii[%d]\n", i)
211 fmt.Printf("tuple existence assign: mii[%d]\n", i)
217 fmt.Printf("tuple existence decl: mfi[%d]\n", i)
221 fmt.Printf("tuple existence assign: mfi[%d]\n", i)
227 fmt.Printf("tuple existence decl: mif[%d]\n", i)
231 fmt.Printf("tuple existence assign: mif[%d]\n", i)
237 fmt.Printf("tuple existence decl: mis[%d]\n", i)
241 fmt.Printf("tuple existence assign: mis[%d]\n", i)
247 fmt.Printf("tuple existence decl: msi[%d]\n", i)
251 fmt.Printf("tuple existence assign: msi[%d]\n", i)
257 fmt.Printf("tuple existence decl: mss[%d]\n", i)
261 fmt.Printf("tuple existence assign: mss[%d]\n", i)
267 fmt.Printf("tuple existence decl: mspa[%d]\n", i)
271 fmt.Printf("tuple existence assign: mspa[%d]\n", i)
277 fmt.Printf("tuple existence decl: mipT[%d]\n", i)
281 fmt.Printf("tuple existence assign: mipT[%d]\n", i)
287 fmt.Printf("tuple existence decl: mpTi[apT[%d]]\n", i)
291 fmt.Printf("tuple existence assign: mpTi[apT[%d]]\n", i)
297 fmt.Printf("tuple existence decl: mipM[%d]\n", i)
301 fmt.Printf("tuple existence assign: mipM[%d]\n", i)
307 fmt.Printf("tuple existence decl: mit[%d]\n", i)
311 fmt.Printf("tuple existence assign: mit[%d]\n", i)
317 // fmt.Printf("tuple existence decl: mti[%d]\n", i)
321 // fmt.Printf("tuple existence assign: mti[%d]\n", i)
326 // test nonexistence with tuple check
327 // failed lookups yield a false value for the boolean.
328 for i := count; i < 2*count; i++ {
334 fmt.Printf("tuple nonexistence decl: mib[%d]", i)
338 fmt.Printf("tuple nonexistence assign: mib[%d]", i)
344 fmt.Printf("tuple nonexistence decl: mii[%d]", i)
348 fmt.Printf("tuple nonexistence assign: mii[%d]", i)
354 fmt.Printf("tuple nonexistence decl: mfi[%d]", i)
358 fmt.Printf("tuple nonexistence assign: mfi[%d]", i)
364 fmt.Printf("tuple nonexistence decl: mif[%d]", i)
368 fmt.Printf("tuple nonexistence assign: mif[%d]", i)
374 fmt.Printf("tuple nonexistence decl: mis[%d]", i)
378 fmt.Printf("tuple nonexistence assign: mis[%d]", i)
384 fmt.Printf("tuple nonexistence decl: msi[%d]", i)
388 fmt.Printf("tuple nonexistence assign: msi[%d]", i)
394 fmt.Printf("tuple nonexistence decl: mss[%d]", i)
398 fmt.Printf("tuple nonexistence assign: mss[%d]", i)
404 fmt.Printf("tuple nonexistence decl: mspa[%d]", i)
408 fmt.Printf("tuple nonexistence assign: mspa[%d]", i)
414 fmt.Printf("tuple nonexistence decl: mipT[%d]", i)
418 fmt.Printf("tuple nonexistence assign: mipT[%d]", i)
424 fmt.Printf("tuple nonexistence decl: mpTi[apt[%d]]", i)
428 fmt.Printf("tuple nonexistence assign: mpTi[apT[%d]]", i)
434 fmt.Printf("tuple nonexistence decl: mipM[%d]", i)
438 fmt.Printf("tuple nonexistence assign: mipM[%d]", i)
444 // fmt.Printf("tuple nonexistence decl: mti[%d]", i)
448 // fmt.Printf("tuple nonexistence assign: mti[%d]", i)
454 fmt.Printf("tuple nonexistence decl: mit[%d]", i)
458 fmt.Printf("tuple nonexistence assign: mit[%d]", i)
464 // tests for structured map element updates
465 for i := 0; i < count; i++ {
467 mspa[s][i % 2] = "deleted"
468 if mspa[s][i % 2] != "deleted" {
469 fmt.Printf("update mspa[%s][%d] = %s\n", s, i %2, mspa[s][i % 2])
473 if mipT[i].i != int64(i)+1 {
474 fmt.Printf("update mipT[%d].i = %d\n", i, mipT[i].i)
476 mipT[i].f = float(i + 1)
477 if (mipT[i].f != float(i + 1)) {
478 fmt.Printf("update mipT[%d].f = %g\n", i, mipT[i].f)
482 if mipM[i][i] != (i + 1) + 1 {
483 fmt.Printf("update mipM[%d][%d] = %i\n", i, i, mipM[i][i])
487 // test range on nil map
488 var mnil map[string] int
489 for _, _ = range mnil {