Skip to content

Commit dc902ef

Browse files
committed
---
yaml --- r: 1700 b: refs/heads/master c: 0cf16e7 h: refs/heads/master v: v3
1 parent fce3eb8 commit dc902ef

File tree

5 files changed

+21
-20
lines changed

5 files changed

+21
-20
lines changed

[refs]

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,2 +1,2 @@
11
---
2-
refs/heads/master: 368eb4bab615feb99e203eecdcec6d0be02f5b42
2+
refs/heads/master: 0cf16e77ca5a0b9f9dfaaab4dfe253d7a9cc5cce

trunk/src/lib/_vec.rs

Lines changed: 15 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -35,7 +35,7 @@ fn alloc_mut[T](uint n_elts) -> vec[mutable T] {
3535
ret rustrt.vec_alloc_mut[vec[mutable T], T](n_elts);
3636
}
3737

38-
fn refcount[T](vec[T] v) -> uint {
38+
fn refcount[T](vec[mutable? T] v) -> uint {
3939
auto r = rustrt.refcount[T](v);
4040
if (r == dbg.const_refcount) {
4141
ret r;
@@ -94,29 +94,29 @@ fn init_elt_mut[T](&T t, uint n_elts) -> vec[mutable T] {
9494
ret v;
9595
}
9696

97-
fn buf[T](vec[T] v) -> vbuf {
97+
fn buf[T](vec[mutable? T] v) -> vbuf {
9898
ret rustrt.vec_buf[T](v, 0u);
9999
}
100100

101-
fn len[T](vec[T] v) -> uint {
101+
fn len[T](vec[mutable? T] v) -> uint {
102102
ret rustrt.vec_len[T](v);
103103
}
104104

105-
fn len_set[T](vec[T] v, uint n) {
105+
fn len_set[T](vec[mutable? T] v, uint n) {
106106
rustrt.vec_len_set[T](v, n);
107107
}
108108

109-
fn buf_off[T](vec[T] v, uint offset) -> vbuf {
109+
fn buf_off[T](vec[mutable? T] v, uint offset) -> vbuf {
110110
check (offset < len[T](v));
111111
ret rustrt.vec_buf[T](v, offset);
112112
}
113113

114-
fn print_debug_info[T](vec[T] v) {
114+
fn print_debug_info[T](vec[mutable? T] v) {
115115
rustrt.vec_print_debug_info[T](v);
116116
}
117117

118118
// Returns elements from [start..end) from v.
119-
fn slice[T](vec[T] v, uint start, uint end) -> vec[T] {
119+
fn slice[T](vec[mutable? T] v, uint start, uint end) -> vec[T] {
120120
check (start <= end);
121121
check (end <= len[T](v));
122122
auto result = alloc[T](end - start);
@@ -128,15 +128,15 @@ fn slice[T](vec[T] v, uint start, uint end) -> vec[T] {
128128
ret result;
129129
}
130130

131-
fn shift[T](&mutable vec[T] v) -> T {
131+
fn shift[T](&mutable vec[mutable? T] v) -> T {
132132
auto ln = len[T](v);
133133
check(ln > 0u);
134134
auto e = v.(0);
135135
v = slice[T](v, 1u, ln);
136136
ret e;
137137
}
138138

139-
fn pop[T](&mutable vec[T] v) -> T {
139+
fn pop[T](&mutable vec[mutable? T] v) -> T {
140140
auto ln = len[T](v);
141141
check(ln > 0u);
142142
ln -= 1u;
@@ -145,34 +145,35 @@ fn pop[T](&mutable vec[T] v) -> T {
145145
ret e;
146146
}
147147

148-
fn push[T](&mutable vec[T] v, &T t) {
148+
fn push[T](&mutable vec[mutable? T] v, &T t) {
149149
v += vec(t);
150150
}
151151

152-
fn unshift[T](&mutable vec[T] v, &T t) {
152+
fn unshift[T](&mutable vec[mutable? T] v, &T t) {
153153
auto res = alloc[T](len[T](v) + 1u);
154154
res += vec(t);
155155
res += v;
156156
v = res;
157157
}
158158

159-
fn grow[T](&mutable vec[T] v, int n, &T initval) {
159+
fn grow[T](&mutable vec[mutable? T] v, int n, &T initval) {
160160
let int i = n;
161161
while (i > 0) {
162162
i -= 1;
163163
v += vec(initval);
164164
}
165165
}
166166

167-
fn map[T, U](&option.operator[T,U] f, &vec[T] v) -> vec[U] {
167+
fn map[T, U](&option.operator[T,U] f, &vec[mutable? T] v) -> vec[U] {
168168
let vec[U] u = alloc[U](len[T](v));
169169
for (T ve in v) {
170170
u += vec(f(ve));
171171
}
172172
ret u;
173173
}
174174

175-
fn map2[T,U,V](&operator2[T,U,V] f, &vec[T] v0, &vec[U] v1) -> vec[V] {
175+
fn map2[T,U,V](&operator2[T,U,V] f, &vec[mutable? T] v0, &vec[mutable? U] v1)
176+
-> vec[V] {
176177
auto v0_len = len[T](v0);
177178
if (v0_len != len[U](v1)) {
178179
fail;

trunk/src/lib/bitv.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@ fn create(uint nbits, bool init) -> t {
2121
elt = 0u;
2222
}
2323

24-
auto storage = _vec.init_elt[mutable uint](elt, nbits / uint_bits() + 1u);
24+
auto storage = _vec.init_elt_mut[uint](elt, nbits / uint_bits() + 1u);
2525
ret rec(storage = storage, nbits = nbits);
2626
}
2727

trunk/src/lib/map.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -29,7 +29,7 @@ fn mk_hashmap[K, V](&hashfn[K] hasher, &eqfn[K] eqer) -> hashmap[K, V] {
2929
}
3030

3131
fn make_buckets[K, V](uint nbkts) -> vec[mutable bucket[K, V]] {
32-
ret _vec.init_elt[mutable bucket[K, V]](nil[K, V], nbkts);
32+
ret _vec.init_elt_mut[bucket[K, V]](nil[K, V], nbkts);
3333
}
3434

3535
// Derive two hash functions from the one given by taking the upper

trunk/src/lib/sha1.rs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -73,7 +73,7 @@ fn mk_sha1() -> sha1 {
7373
0xCA62C1D6u32);
7474

7575
let int t; // Loop counter
76-
let vec[mutable u32] w = _vec.init_elt[mutable u32](0u32, 80u);
76+
let vec[mutable u32] w = _vec.init_elt_mut[u32](0u32, 80u);
7777

7878
// Initialize the first 16 words of the vector w
7979
t = 0;
@@ -261,10 +261,10 @@ fn mk_sha1() -> sha1 {
261261
}
262262
}
263263

264-
auto st = rec(h = _vec.init_elt[mutable u32](0u32, digest_buf_len),
264+
auto st = rec(h = _vec.init_elt_mut[u32](0u32, digest_buf_len),
265265
mutable len_low = 0u32,
266266
mutable len_high = 0u32,
267-
msg_block = _vec.init_elt[mutable u8](0u8, msg_block_len),
267+
msg_block = _vec.init_elt_mut[u8](0u8, msg_block_len),
268268
mutable msg_block_idx = 0u,
269269
mutable computed = false);
270270
auto sh = sha1(st);

0 commit comments

Comments
 (0)