summaryrefslogtreecommitdiff
path: root/gcc/testsuite/go.test/test/vectors.go
diff options
context:
space:
mode:
authorupstream source tree <ports@midipix.org>2015-03-15 20:14:05 -0400
committerupstream source tree <ports@midipix.org>2015-03-15 20:14:05 -0400
commit554fd8c5195424bdbcabf5de30fdc183aba391bd (patch)
tree976dc5ab7fddf506dadce60ae936f43f58787092 /gcc/testsuite/go.test/test/vectors.go
downloadcbb-gcc-4.6.4-554fd8c5195424bdbcabf5de30fdc183aba391bd.tar.bz2
cbb-gcc-4.6.4-554fd8c5195424bdbcabf5de30fdc183aba391bd.tar.xz
obtained gcc-4.6.4.tar.bz2 from upstream website;upstream
verified gcc-4.6.4.tar.bz2.sig; imported gcc-4.6.4 source tree from verified upstream tarball. downloading a git-generated archive based on the 'upstream' tag should provide you with a source tree that is binary identical to the one extracted from the above tarball. if you have obtained the source via the command 'git clone', however, do note that line-endings of files in your working directory might differ from line-endings of the respective files in the upstream repository.
Diffstat (limited to 'gcc/testsuite/go.test/test/vectors.go')
-rw-r--r--gcc/testsuite/go.test/test/vectors.go64
1 files changed, 64 insertions, 0 deletions
diff --git a/gcc/testsuite/go.test/test/vectors.go b/gcc/testsuite/go.test/test/vectors.go
new file mode 100644
index 000000000..ed5905da3
--- /dev/null
+++ b/gcc/testsuite/go.test/test/vectors.go
@@ -0,0 +1,64 @@
+// $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 "container/vector"
+
+
+type S struct {
+ val int
+}
+
+
+func (p *S) Init(val int) *S {
+ p.val = val
+ return p
+}
+
+
+func test0() {
+ v := new(vector.Vector)
+ if v.Len() != 0 {
+ print("len = ", v.Len(), "\n")
+ panic("fail")
+ }
+}
+
+
+func test1() {
+ var a [1000]*S
+ for i := 0; i < len(a); i++ {
+ a[i] = new(S).Init(i)
+ }
+
+ v := new(vector.Vector)
+ for i := 0; i < len(a); i++ {
+ v.Insert(0, a[i])
+ if v.Len() != i+1 {
+ print("len = ", v.Len(), "\n")
+ panic("fail")
+ }
+ }
+
+ for i := 0; i < v.Len(); i++ {
+ x := v.At(i).(*S)
+ if x.val != v.Len()-i-1 {
+ print("expected ", i, ", found ", x.val, "\n")
+ panic("fail")
+ }
+ }
+
+ for v.Len() > 10 {
+ v.Delete(10)
+ }
+}
+
+
+func main() {
+ test0()
+ test1()
+}