Source std Vector.nas
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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
# Copyright (C) 2014 onox
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
#
# NOTE! This copyright does *not* cover user models that use these Nasal
# services by normal function calls - this is merely considered normal use
# of the code, and does *not* fall under the heading of "derived work."
#load only once (via /Nasal/std.nas) not via C++ module loader
if (ishash(globals["std"]) and ishash(std["Vector"]))
return;
var Vector = {
new: func (vector=nil, name="") {
var m = {
parents: [Vector],
name: name,
vector: [],
_callback: func,
};
if (isvec(vector)) {
m.vector = vector;
}
return m;
},
# add callback for writes (insert() and append())
# will be called as f(index, item), compare insert() below
addCallback: func (f) {
if (isfunc(f)) {
me._callback = f;
return me;
}
return nil;
},
getName: func () {
return me.name;
},
size: func {
return size(me.vector);
},
clear: func {
me.vector = [];
},
append: func (item) {
append(me.vector, item);
me._callback(me.size() - 1, item);
},
extend: func (other_vector) {
# Extend the vector with another vector, appending the items of
# the other vector to this vector
me.vector = me.vector ~ other_vector;
},
insert: func (index, item) {
# Insert the given item at the given index before the old item
# at that index. Any index greater than n-1 where n is the size of
# the vector will append the given item at the end. Any index smaller
# or equal to -n will insert the item at the beginning of the vector.
#
# For example, if the vector contains ["a", "b", "c"], then the
# following operations can happen:
#
# insert(0, "d") => ["d", "a", "b", "c"]
# insert(2, "e") => ["a", "b", "e", "c"]
# insert(3, "f") => ["a", "b", "c", "f"]
# insert(-3, "g") => ["f", "a", "b", "c"]
index = math.min(index, me.size());
if (index < 0) {
index = math.max(0, me.size() + index);
}
me.vector = subvec(me.vector, 0, index) ~ [item] ~ subvec(me.vector, index);
me._callback(index, item);
return me.vector;
},
pop: func (index=nil) {
# Remove and return the item at the given index. If index
# is not given, then it will remove and return the last item.
# A negative index represents the position from the end.
#
# For example, if the vector contains ["a", "b", "c"], then the
# following operations can happen:
#
# pop(0) => "a"
# pop(2) => "c"
# pop(-1) => "c"
# pop(-3) => "a"
#
# Thus the range is -n .. n-1 where n is the size of the vector.
# IndexError is raised if the index is out of range.
if (index != nil) {
if (index < -me.size() or index >= me.size()) {
die("IndexError: index out of range");
}
if (index < 0) {
index = me.size() + index;
}
var item = me.vector[index];
me.vector = subvec(me.vector, 0, index) ~ subvec(me.vector, index + 1);
return item;
}
else {
return pop(me.vector);
}
},
index: func (item) {
# Return first index of the given item. Raises a ValueError
# if the item is not in the vector.
var i = vecindex(me.vector, item);
if (i == nil) die("ValueError: item not in the vector");
return i;
},
contains: func (item) {
# Return true if the vector contains the item, false otherwise
return vecindex(me.vector, item) != nil;
},
remove: func (item) {
# Remove the first occurrence of the given item. Raises a
# ValueError if the item is not present in the vector.
me.pop(me.index(item));
}
};