// $G $F.go && $L $F.$A && ./$A.out

// 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.

package main

import (
	"fmt";
	"strconv";
)

const arraylen = 2; // BUG: shouldn't need this

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() {
	// 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 {
			fmt.printf("mlit[%s] = %d\n", s, mlit[s])
		}
	}

	mib := new(map[int] bool);
	mii := new(map[int] int);
	mfi := new(map[float] int);
	mif := new(map[int] float);
	msi := new(map[string] int);
	mis := new(map[int] string);
	mss := new(map[string] string);
	mspa := new(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 float;
	};
	mipT := new(map[int] *T);
	mpTi := new(map[*T] int);
	mit := new(map[int] T);
	mti := new(map[T] int);

	type M map[int] int;
	mipM := new(map[int] M);

	const count = 1000;
	var apT [2*count]*T;

	for i := 0; i < count; i++ {
		s := strconv.itoa(i);
		s10 := strconv.itoa(i*10);
		f := float(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;
		// BUG m := M{i, i+1};
		m := new(M); m[i] = i+1;
		mib[i] = (i != 0);
		mii[i] = 10*i;
		mfi[float(i)] = 10*i;
		mif[i] = 10.0*f;
		mis[i] = s;
		msi[s] = i;
		mss[s] = s10;
		mss[s] = s10;
		as := new([]string, arraylen);
			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 {
		fmt.printf("len(mib) = %d\n", len(mib));
	}
	if len(mii) != count {
		fmt.printf("len(mii) = %d\n", len(mii));
	}
	if len(mfi) != count {
		fmt.printf("len(mfi) = %d\n", len(mfi));
	}
	if len(mif) != count {
		fmt.printf("len(mif) = %d\n", len(mif));
	}
	if len(msi) != count {
		fmt.printf("len(msi) = %d\n", len(msi));
	}
	if len(mis) != count {
		fmt.printf("len(mis) = %d\n", len(mis));
	}
	if len(mss) != count {
		fmt.printf("len(mss) = %d\n", len(mss));
	}
	if len(mspa) != count {
		fmt.printf("len(mspa) = %d\n", len(mspa));
	}
	if len(mipT) != count {
		fmt.printf("len(mipT) = %d\n", len(mipT));
	}
	if len(mpTi) != count {
		fmt.printf("len(mpTi) = %d\n", len(mpTi));
	}
	if len(mipM) != count {
		fmt.printf("len(mipM) = %d\n", len(mipM));
	}
	if len(mti) != count {
		fmt.printf("len(mti) = %d\n", len(mti));
	}
	if len(mit) != count {
		fmt.printf("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 := float(i);
		t := T{int64(i), f};
		// BUG m := M(i, i+1);
		if mib[i] != (i != 0) {
			fmt.printf("mib[%d] = %t\n", i, mib[i]);
		}
		if(mii[i] != 10*i) {
			fmt.printf("mii[%d] = %d\n", i, mii[i]);
		}
		if(mfi[f] != 10*i) {
			fmt.printf("mfi[%d] = %d\n", i, mfi[f]);
		}
		if(mif[i] != 10.0*f) {
			fmt.printf("mif[%d] = %g\n", i, mif[i]);
		}
		if(mis[i] != s) {
			fmt.printf("mis[%d] = %s\n", i, mis[i]);
		}
		if(msi[s] != i) {
			fmt.printf("msi[%s] = %d\n", s, msi[s]);
		}
		if mss[s] != s10 {
			fmt.printf("mss[%s] = %g\n", s, mss[s]);
		}
		for j := 0; j < arraylen; j++ {
			if mspa[s][j] != s10 {
				fmt.printf("mspa[%s][%d] = %s\n", s, j, mspa[s][j]);
			}
		}
		if(mipT[i].i != int64(i) || mipT[i].f != f) {
			fmt.printf("mipT[%d] = %v\n", i, mipT[i]);
		}
		if(mpTi[apT[i]] != i) {
			fmt.printf("mpTi[apT[%d]] = %d\n", i, mpTi[apT[i]]);
		}
		if (mipM[i][i] != i + 1) {
			fmt.printf("mipM[%d][%d] = %d\n", i, i, mipM[i][i]);
		}
		if(mti[t] != i) {
			fmt.printf("mti[%v] = %d\n", t, mti[t]);
		}
		if(mit[i].i != int64(i) || mit[i].f != f) {
			fmt.printf("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 := float(i);
		t := T{int64(i), f};
		{
			a, b := mib[i];
			if !b {
				fmt.printf("tuple existence decl: mib[%d]\n", i);
			}
			a, b = mib[i];
			if !b {
				fmt.printf("tuple existence assign: mib[%d]\n", i);
			}
		}
		{
			a, b := mii[i];
			if !b {
				fmt.printf("tuple existence decl: mii[%d]\n", i);
			}
			a, b = mii[i];
			if !b {
				fmt.printf("tuple existence assign: mii[%d]\n", i);
			}
		}
		{
			a, b := mfi[f];
			if !b {
				fmt.printf("tuple existence decl: mfi[%d]\n", i);
			}
			a, b = mfi[f];
			if !b {
				fmt.printf("tuple existence assign: mfi[%d]\n", i);
			}
		}
		{
			a, b := mif[i];
			if !b {
				fmt.printf("tuple existence decl: mif[%d]\n", i);
			}
			a, b = mif[i];
			if !b {
				fmt.printf("tuple existence assign: mif[%d]\n", i);
			}
		}
		{
			a, b := mis[i];
			if !b {
				fmt.printf("tuple existence decl: mis[%d]\n", i);
			}
			a, b = mis[i];
			if !b {
				fmt.printf("tuple existence assign: mis[%d]\n", i);
			}
		}
		{
			a, b := msi[s];
			if !b {
				fmt.printf("tuple existence decl: msi[%d]\n", i);
			}
			a, b = msi[s];
			if !b {
				fmt.printf("tuple existence assign: msi[%d]\n", i);
			}
		}
		{
			a, b := mss[s];
			if !b {
				fmt.printf("tuple existence decl: mss[%d]\n", i);
			}
			a, b = mss[s];
			if !b {
				fmt.printf("tuple existence assign: mss[%d]\n", i);
			}
		}
		{
			a, b := mspa[s];
			if !b {
				fmt.printf("tuple existence decl: mspa[%d]\n", i);
			}
			a, b = mspa[s];
			if !b {
				fmt.printf("tuple existence assign: mspa[%d]\n", i);
			}
		}
		{
			a, b := mipT[i];
			if !b {
				fmt.printf("tuple existence decl: mipT[%d]\n", i);
			}
			a, b = mipT[i];
			if !b {
				fmt.printf("tuple existence assign: mipT[%d]\n", i);
			}
		}
		{
			a, b := mpTi[apT[i]];
			if !b {
				fmt.printf("tuple existence decl: mpTi[apT[%d]]\n", i);
			}
			a, b = mpTi[apT[i]];
			if !b {
				fmt.printf("tuple existence assign: mpTi[apT[%d]]\n", i);
			}
		}
		{
			a, b := mipM[i];
			if !b {
				fmt.printf("tuple existence decl: mipM[%d]\n", i);
			}
			a, b = mipM[i];
			if !b {
				fmt.printf("tuple existence assign: mipM[%d]\n", i);
			}
		}
		{
			a, b := mit[i];
			if !b {
				fmt.printf("tuple existence decl: mit[%d]\n", i);
			}
			a, b = mit[i];
			if !b {
				fmt.printf("tuple existence assign: mit[%d]\n", i);
			}
		}
		{
			a, b := mti[t];
			if !b {
				fmt.printf("tuple existence decl: mti[%d]\n", i);
			}
			a, b = mti[t];
			if !b {
				fmt.printf("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 := float(i);
		t := T{int64(i),f};
		{
			a, b := mib[i];
			if b {
				fmt.printf("tuple nonexistence decl: mib[%d]", i);
			}
			a, b = mib[i];
			if b {
				fmt.printf("tuple nonexistence assign: mib[%d]", i);
			}
		}
		{
			a, b := mii[i];
			if b {
				fmt.printf("tuple nonexistence decl: mii[%d]", i);
			}
			a, b = mii[i];
			if b {
				fmt.printf("tuple nonexistence assign: mii[%d]", i);
			}
		}
		{
			a, b := mfi[f];
			if b {
				fmt.printf("tuple nonexistence decl: mfi[%d]", i);
			}
			a, b = mfi[f];
			if b {
				fmt.printf("tuple nonexistence assign: mfi[%d]", i);
			}
		}
		{
			a, b := mif[i];
			if b {
				fmt.printf("tuple nonexistence decl: mif[%d]", i);
			}
			a, b = mif[i];
			if b {
				fmt.printf("tuple nonexistence assign: mif[%d]", i);
			}
		}
		{
			a, b := mis[i];
			if b {
				fmt.printf("tuple nonexistence decl: mis[%d]", i);
			}
			a, b = mis[i];
			if b {
				fmt.printf("tuple nonexistence assign: mis[%d]", i);
			}
		}
		{
			a, b := msi[s];
			if b {
				fmt.printf("tuple nonexistence decl: msi[%d]", i);
			}
			a, b = msi[s];
			if b {
				fmt.printf("tuple nonexistence assign: msi[%d]", i);
			}
		}
		{
			a, b := mss[s];
			if b {
				fmt.printf("tuple nonexistence decl: mss[%d]", i);
			}
			a, b = mss[s];
			if b {
				fmt.printf("tuple nonexistence assign: mss[%d]", i);
			}
		}
		{
			a, b := mspa[s];
			if b {
				fmt.printf("tuple nonexistence decl: mspa[%d]", i);
			}
			a, b = mspa[s];
			if b {
				fmt.printf("tuple nonexistence assign: mspa[%d]", i);
			}
		}
		{
			a, b := mipT[i];
			if b {
				fmt.printf("tuple nonexistence decl: mipT[%d]", i);
			}
			a, b = mipT[i];
			if b {
				fmt.printf("tuple nonexistence assign: mipT[%d]", i);
			}
		}
		{
			a, b := mpTi[apT[i]];
			if b {
				fmt.printf("tuple nonexistence decl: mpTi[apt[%d]]", i);
			}
			a, b = mpTi[apT[i]];
			if b {
				fmt.printf("tuple nonexistence assign: mpTi[apT[%d]]", i);
			}
		}
		{
			a, b := mipM[i];
			if b {
				fmt.printf("tuple nonexistence decl: mipM[%d]", i);
			}
			a, b = mipM[i];
			if b {
				fmt.printf("tuple nonexistence assign: mipM[%d]", i);
			}
		}
		{
			a, b := mti[t];
			if b {
				fmt.printf("tuple nonexistence decl: mti[%d]", i);
			}
			a, b = mti[t];
			if b {
				fmt.printf("tuple nonexistence assign: mti[%d]", i);
			}
		}
		{
			a, b := mit[i];
			if b {
				fmt.printf("tuple nonexistence decl: mit[%d]", i);
			}
			a, b = mit[i];
			if b {
				fmt.printf("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" {
			fmt.printf("update mspa[%s][%d] = %s\n", s, i %2, mspa[s][i % 2]);
		}

		mipT[i].i += 1;
		if mipT[i].i != int64(i)+1 {
			fmt.printf("update mipT[%d].i = %d\n", i, mipT[i].i);
		}
		mipT[i].f = float(i + 1);
		if (mipT[i].f != float(i + 1)) {
			fmt.printf("update mipT[%d].f = %g\n", i, mipT[i].f);
		}

		mipM[i][i]++;
		if mipM[i][i] != (i + 1) + 1 {
			fmt.printf("update mipM[%d][%d] = %i\n", i, i, mipM[i][i]);
		}
	}
}