1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
// 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 vector
//export Vector, New;
/*
import vector "vector"
v := vector.New();
v.Insert(0, new(Foo));
v.Append(new(Foo));
v.Remove(0);
for i := 0; i < v.Len(); i++ { f(v.At(i)); }
*/
type Element interface {
}
export type Vector struct {
elem *[]Element;
}
export func New() *Vector {
v := new(Vector);
v.elem = new([]Element, 8) [0 : 0]; // capacity must be > 0!
return v;
}
func (v *Vector) Len() int {
return len(v.elem);
}
func (v *Vector) At(i int) Element {
// range check unnecessary - done by runtime
return v.elem[i];
}
func (v *Vector) Remove(i int) Element {
ret := v.elem[i];
n := v.Len();
// range check unnecessary - done by runtime
for j := i + 1; j < n; j++ {
v.elem[j - 1] = v.elem[j];
}
var e Element;
v.elem[n - 1] = e; // don't set to nil - may not be legal in the future
v.elem = v.elem[0 : n - 1];
return ret;
}
func (v *Vector) Reset() {
v.elem = v.elem[0:0];
}
func (v *Vector) Insert(i int, e Element) {
n := v.Len();
// range check unnecessary - done by runtime
// grow array by doubling its capacity
if n == cap(v.elem) {
a := new([]Element, n*2);
for j := 0; j < n; j++ {
a[j] = v.elem[j];
}
v.elem = a;
}
// make a hole
v.elem = v.elem[0 : n + 1];
for j := n; j > i; j-- {
v.elem[j] = v.elem[j-1];
}
v.elem[i] = e;
}
func (v *Vector) Append(e Element) {
v.Insert(len(v.elem), e);
}
/*
type I struct { val int; }; // BUG: can't be local;
func Test() {
i0 := new(I); i0.val = 0;
i1 := new(I); i1.val = 11;
i2 := new(I); i2.val = 222;
i3 := new(I); i3.val = 3333;
i4 := new(I); i4.val = 44444;
v := New();
print("hi\n");
v.Insert(0, i4);
v.Insert(0, i3);
v.Insert(0, i2);
v.Insert(0, i1);
v.Insert(0, i0);
for i := 0; i < v.Len(); i++ {
x := convert(*I, v.At(i));
print(i, " ", v.At(i).(*I).val, "\n");
}
}
export Test;
*/
|
