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.
14 const arraylen = 2; // BUG: shouldn't need this
16 func P(a []string) string {
18 for i := 0; i < len(a); i++ {
22 s += `"` + 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);
63 for i := 0; i < count; i++ {
65 s10 := strconv.Itoa(i*10);
71 apT[2*i] = new(T); // need twice as many entries as we use, for the nonexistence check
72 apT[2*i].i = int64(i);
83 as := make([]string, arraylen);
95 if len(mib) != count {
96 fmt.Printf("len(mib) = %d\n", len(mib));
98 if len(mii) != count {
99 fmt.Printf("len(mii) = %d\n", len(mii));
101 if len(mfi) != count {
102 fmt.Printf("len(mfi) = %d\n", len(mfi));
104 if len(mif) != count {
105 fmt.Printf("len(mif) = %d\n", len(mif));
107 if len(msi) != count {
108 fmt.Printf("len(msi) = %d\n", len(msi));
110 if len(mis) != count {
111 fmt.Printf("len(mis) = %d\n", len(mis));
113 if len(mss) != count {
114 fmt.Printf("len(mss) = %d\n", len(mss));
116 if len(mspa) != count {
117 fmt.Printf("len(mspa) = %d\n", len(mspa));
119 if len(mipT) != count {
120 fmt.Printf("len(mipT) = %d\n", len(mipT));
122 if len(mpTi) != count {
123 fmt.Printf("len(mpTi) = %d\n", len(mpTi));
125 // if len(mti) != count {
126 // fmt.Printf("len(mti) = %d\n", len(mti));
128 if len(mipM) != count {
129 fmt.Printf("len(mipM) = %d\n", len(mipM));
131 // if len(mti) != count {
132 // fmt.Printf("len(mti) = %d\n", len(mti));
134 if len(mit) != count {
135 fmt.Printf("len(mit) = %d\n", len(mit));
138 // test construction directly
139 for i := 0; i < count; i++ {
140 s := strconv.Itoa(i);
141 s10 := strconv.Itoa(i*10);
144 // BUG m := M(i, i+1);
145 if mib[i] != (i != 0) {
146 fmt.Printf("mib[%d] = %t\n", i, mib[i]);
149 fmt.Printf("mii[%d] = %d\n", i, mii[i]);
152 fmt.Printf("mfi[%d] = %d\n", i, mfi[f]);
154 if(mif[i] != 10.0*f) {
155 fmt.Printf("mif[%d] = %g\n", i, mif[i]);
158 fmt.Printf("mis[%d] = %s\n", i, mis[i]);
161 fmt.Printf("msi[%s] = %d\n", s, msi[s]);
164 fmt.Printf("mss[%s] = %g\n", s, mss[s]);
166 for j := 0; j < arraylen; j++ {
167 if mspa[s][j] != s10 {
168 fmt.Printf("mspa[%s][%d] = %s\n", s, j, mspa[s][j]);
171 if(mipT[i].i != int64(i) || mipT[i].f != f) {
172 fmt.Printf("mipT[%d] = %v\n", i, mipT[i]);
174 if(mpTi[apT[i]] != i) {
175 fmt.Printf("mpTi[apT[%d]] = %d\n", i, mpTi[apT[i]]);
178 // fmt.Printf("mti[%s] = %s\n", s, mti[t]);
180 if (mipM[i][i] != i + 1) {
181 fmt.Printf("mipM[%d][%d] = %d\n", i, i, mipM[i][i]);
184 // fmt.Printf("mti[%v] = %d\n", t, mti[t]);
186 if(mit[i].i != int64(i) || mit[i].f != f) {
187 fmt.Printf("mit[%d] = {%d %g}\n", i, mit[i].i, mit[i].f);
191 // test existence with tuple check
192 // failed lookups yield a false value for the boolean.
193 for i := 0; i < count; i++ {
194 s := strconv.Itoa(i);
200 fmt.Printf("tuple existence decl: mib[%d]\n", i);
204 fmt.Printf("tuple existence assign: mib[%d]\n", i);
210 fmt.Printf("tuple existence decl: mii[%d]\n", i);
214 fmt.Printf("tuple existence assign: mii[%d]\n", i);
220 fmt.Printf("tuple existence decl: mfi[%d]\n", i);
224 fmt.Printf("tuple existence assign: mfi[%d]\n", i);
230 fmt.Printf("tuple existence decl: mif[%d]\n", i);
234 fmt.Printf("tuple existence assign: mif[%d]\n", i);
240 fmt.Printf("tuple existence decl: mis[%d]\n", i);
244 fmt.Printf("tuple existence assign: mis[%d]\n", i);
250 fmt.Printf("tuple existence decl: msi[%d]\n", i);
254 fmt.Printf("tuple existence assign: msi[%d]\n", i);
260 fmt.Printf("tuple existence decl: mss[%d]\n", i);
264 fmt.Printf("tuple existence assign: mss[%d]\n", i);
270 fmt.Printf("tuple existence decl: mspa[%d]\n", i);
274 fmt.Printf("tuple existence assign: mspa[%d]\n", i);
280 fmt.Printf("tuple existence decl: mipT[%d]\n", i);
284 fmt.Printf("tuple existence assign: mipT[%d]\n", i);
288 a, b := mpTi[apT[i]];
290 fmt.Printf("tuple existence decl: mpTi[apT[%d]]\n", i);
294 fmt.Printf("tuple existence assign: mpTi[apT[%d]]\n", i);
300 fmt.Printf("tuple existence decl: mipM[%d]\n", i);
304 fmt.Printf("tuple existence assign: mipM[%d]\n", i);
310 fmt.Printf("tuple existence decl: mit[%d]\n", i);
314 fmt.Printf("tuple existence assign: mit[%d]\n", i);
320 // fmt.Printf("tuple existence decl: mti[%d]\n", i);
324 // fmt.Printf("tuple existence assign: mti[%d]\n", i);
329 // test nonexistence with tuple check
330 // failed lookups yield a false value for the boolean.
331 for i := count; i < 2*count; i++ {
332 s := strconv.Itoa(i);
338 fmt.Printf("tuple nonexistence decl: mib[%d]", i);
342 fmt.Printf("tuple nonexistence assign: mib[%d]", i);
348 fmt.Printf("tuple nonexistence decl: mii[%d]", i);
352 fmt.Printf("tuple nonexistence assign: mii[%d]", i);
358 fmt.Printf("tuple nonexistence decl: mfi[%d]", i);
362 fmt.Printf("tuple nonexistence assign: mfi[%d]", i);
368 fmt.Printf("tuple nonexistence decl: mif[%d]", i);
372 fmt.Printf("tuple nonexistence assign: mif[%d]", i);
378 fmt.Printf("tuple nonexistence decl: mis[%d]", i);
382 fmt.Printf("tuple nonexistence assign: mis[%d]", i);
388 fmt.Printf("tuple nonexistence decl: msi[%d]", i);
392 fmt.Printf("tuple nonexistence assign: msi[%d]", i);
398 fmt.Printf("tuple nonexistence decl: mss[%d]", i);
402 fmt.Printf("tuple nonexistence assign: mss[%d]", i);
408 fmt.Printf("tuple nonexistence decl: mspa[%d]", i);
412 fmt.Printf("tuple nonexistence assign: mspa[%d]", i);
418 fmt.Printf("tuple nonexistence decl: mipT[%d]", i);
422 fmt.Printf("tuple nonexistence assign: mipT[%d]", i);
426 a, b := mpTi[apT[i]];
428 fmt.Printf("tuple nonexistence decl: mpTi[apt[%d]]", i);
432 fmt.Printf("tuple nonexistence assign: mpTi[apT[%d]]", i);
438 fmt.Printf("tuple nonexistence decl: mipM[%d]", i);
442 fmt.Printf("tuple nonexistence assign: mipM[%d]", i);
448 // fmt.Printf("tuple nonexistence decl: mti[%d]", i);
452 // fmt.Printf("tuple nonexistence assign: mti[%d]", i);
458 fmt.Printf("tuple nonexistence decl: mit[%d]", i);
462 fmt.Printf("tuple nonexistence assign: mit[%d]", i);
468 // tests for structured map element updates
469 for i := 0; i < count; i++ {
470 s := strconv.Itoa(i);
471 mspa[s][i % 2] = "deleted";
472 if mspa[s][i % 2] != "deleted" {
473 fmt.Printf("update mspa[%s][%d] = %s\n", s, i %2, mspa[s][i % 2]);
477 if mipT[i].i != int64(i)+1 {
478 fmt.Printf("update mipT[%d].i = %d\n", i, mipT[i].i);
480 mipT[i].f = float(i + 1);
481 if (mipT[i].f != float(i + 1)) {
482 fmt.Printf("update mipT[%d].f = %g\n", i, mipT[i].f);
486 if mipM[i][i] != (i + 1) + 1 {
487 fmt.Printf("update mipM[%d][%d] = %i\n", i, i, mipM[i][i]);