@@ -28,22 +28,22 @@ import std::int;
28
28
29
29
//fn vec_reverse(&<T> v) -> [T] { ... }
30
30
31
- fn vec_omit < T > ( v : & [ T ] , i : uint ) -> [ T ] {
31
+ fn vec_omit < @ T > ( v : & [ T ] , i : uint ) -> [ T ] {
32
32
slice ( v, 0 u, i) + slice ( v, i + 1 u, len ( v) )
33
33
}
34
- fn vec_dup < T > ( v : & [ T ] , i : uint ) -> [ T ] {
34
+ fn vec_dup < @ T > ( v : & [ T ] , i : uint ) -> [ T ] {
35
35
slice ( v, 0 u, i) + [ v[ i] ] + slice ( v, i, len ( v) )
36
36
}
37
- fn vec_swadj < T > ( v : & [ T ] , i : uint ) -> [ T ] {
37
+ fn vec_swadj < @ T > ( v : & [ T ] , i : uint ) -> [ T ] {
38
38
slice ( v, 0 u, i) + [ v[ i + 1 u] , v[ i] ] + slice ( v, i + 2 u, len ( v) )
39
39
}
40
- fn vec_prefix < T > ( v : & [ T ] , i : uint ) -> [ T ] { slice ( v, 0 u, i) }
41
- fn vec_suffix < T > ( v : & [ T ] , i : uint ) -> [ T ] { slice ( v, i, len ( v) ) }
40
+ fn vec_prefix < @ T > ( v : & [ T ] , i : uint ) -> [ T ] { slice ( v, 0 u, i) }
41
+ fn vec_suffix < @ T > ( v : & [ T ] , i : uint ) -> [ T ] { slice ( v, i, len ( v) ) }
42
42
43
- fn vec_poke < T > ( v : & [ T ] , i : uint , x : & T ) -> [ T ] {
43
+ fn vec_poke < @ T > ( v : & [ T ] , i : uint , x : & T ) -> [ T ] {
44
44
slice ( v, 0 u, i) + [ x] + slice ( v, i + 1 u, len ( v) )
45
45
}
46
- fn vec_insert < T > ( v : & [ T ] , i : uint , x : & T ) -> [ T ] {
46
+ fn vec_insert < @ T > ( v : & [ T ] , i : uint , x : & T ) -> [ T ] {
47
47
slice ( v, 0 u, i) + [ x] + slice ( v, i, len ( v) )
48
48
}
49
49
@@ -54,7 +54,7 @@ iter ix(skip_low: uint, skip_high: uint, length: uint) -> uint {
54
54
}
55
55
56
56
// Returns a bunch of modified versions of v, some of which introduce new elements (borrowed from xs).
57
- fn vec_edits < T > ( v : & [ T ] , xs : & [ T ] ) -> [ [ T ] ] {
57
+ fn vec_edits < @ T > ( v : & [ T ] , xs : & [ T ] ) -> [ [ T ] ] {
58
58
let edits: [ [ T ] ] = [ ] ;
59
59
let Lv : uint = len ( v) ;
60
60
0 commit comments