aboutsummaryrefslogtreecommitdiff
path: root/test/map.go
diff options
context:
space:
mode:
authorRob Pike <r@golang.org>2008-09-15 14:27:15 -0700
committerRob Pike <r@golang.org>2008-09-15 14:27:15 -0700
commit6f38063369a55d3cc4f67ee236214dcbbf511c09 (patch)
treebefbd05c22e2bf55f78b62b03e23c971f5b1c054 /test/map.go
parenta43033a315700dd222d1f54fecc384f092ba6613 (diff)
downloadgo-6f38063369a55d3cc4f67ee236214dcbbf511c09.tar.gz
go-6f38063369a55d3cc4f67ee236214dcbbf511c09.zip
update bugs
delete bug100.go since the compiler is doing what we agreed. R=gri OCL=15367 CL=15367
Diffstat (limited to 'test/map.go')
-rw-r--r--test/map.go98
1 files changed, 3 insertions, 95 deletions
diff --git a/test/map.go b/test/map.go
index c5544e5297..33658bae0f 100644
--- a/test/map.go
+++ b/test/map.go
@@ -4,7 +4,6 @@
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
-
package main
import fmt "fmt"
@@ -169,100 +168,6 @@ func main() {
}
}
- // test existence with zero check
- // failed lookups yield the 'zero' of the type.
- // a later loop uses the more reliable tuple check.
- for i := 1; i < count; i++ { // loop from 1 to avoid the real 'zeros'
- s := F.d(i).str();
- f := float(i);
- // BUG t := T(s, f);
- var t T; t.s = s; t.f = f;
- // BUG m := M(i, i+1);
- if mib[i] == false {
- F.s("existence: mib[").d(i).s("] == false").putnl();
- }
- if mii[i] == 0 {
- F.s("existence: mii[").d(i).s("] == 0").putnl();
- }
- if mfi[f] == 0 {
- F.s("existence: mfi[").g(f).s("] == 0").putnl();
- }
- if mif[i] == 0.0 {
- F.s("existence: mif[").d(i).s("] == 0.0").putnl();
- }
- if mis[i] == "" {
- F.s("existence: mis[").d(i).s("] == ``").putnl();
- }
- if msi[s] == 0 {
- F.s("existence: msi[").s(s).s("] == 0").putnl();
- }
- if mss[s] == `` {
- F.s("existence: mss[").s(s).s("] == ``").putnl();
- }
- if mspa[s] == nil {
- F.s("existence: mspa[").s(s).s("] == ``").putnl();
- }
- if mipT[i] == nil {
- F.s("existence: mipT[").d(i).s("] == nil").putnl();
- }
- if mpTi[apT[i]] == 0 {
- F.s("existence: mpTi[apT[").d(i).s("]] == 0").putnl();
- }
-// if mti[t] == 0 {
-// //emit stdout <- format("haskey mti[%s] false", string(t));
-// }
- if mipM[i] == nil {
- F.s("existence: mipM[").d(i).s("] == nil").putnl();
- }
- }
-
- // test nonexistence with zero check
- // failed lookups yield the 'zero' of the type.
- // a later loop uses the more reliable tuple check.
- for i := count; i < 2*count; i++ {
- s := F.d(i).str();
- f := float(i);
- // BUG t := T(s, f);
- var t T; t.s = s; t.f = f;
- // BUG m := M(i, i+1);
- if mib[i] != false {
- F.s("nonexistence: mib[").d(i).s("] != false").putnl();
- }
- if mii[i] != 0 {
- F.s("nonexistence: mii[").d(i).s("] != 0").putnl();
- }
- if mfi[f] != 0 {
- F.s("nonexistence: mfi[").g(f).s("] != 0").putnl();
- }
- if mif[i] != 0.0 {
- F.s("nonexistence: mif[").d(i).s("] != 0.0").putnl();
- }
- if mis[i] != `` {
- F.s("nonexistence: mis[").d(i).s("] != ``").putnl();
- }
- if msi[s] != 0 {
- F.s("nonexistence: msi[").s(s).s("] != 0").putnl();
- }
- if mss[s] != `` {
- F.s("nonexistence: mss[").s(s).s("] != ``").putnl();
- }
- if mspa[s] != nil {
- F.s("nonexistence: mspa[").s(s).s("] != ``").putnl();
- }
- if mipT[i] != nil {
- F.s("nonexistence: mipT[").d(i).s("] != nil").putnl();
- }
- if mpTi[apT[i]] != 0 {
- F.s("nonexistence: mpTi[apT[").d(i).s("]] != 0").putnl();
- }
-// if mti[t] != 0 {
-// // emit stdout <- format("haskey mti[%s] false", string(t));
-//
- if mipM[i] != nil {
- F.s("nonexistence: mipM[").d(i).s("] != nil").putnl();
- }
- }
-
// test existence with tuple check
// failed lookups yield a false value for the boolean.
for i := 0; i < count; i++ {
@@ -506,6 +411,9 @@ func main() {
}
}
}
+
+ print("skipping increment test until bug060 is fixed\n");
+ return;
// tests for structured map element updates
for i := 0; i < count; i++ {