core: Rename to_mut and from_mut to cast_to_mut and cast_from_mut
This commit is contained in:
parent
93e969e356
commit
9dc8e96c5f
26 changed files with 64 additions and 63 deletions
|
|
@ -122,7 +122,7 @@ fn gen_search_keys(graph: graph, n: uint) -> ~[node_id] {
|
|||
*/
|
||||
fn bfs(graph: graph, key: node_id) -> bfs_result {
|
||||
let marks : ~[mut node_id]
|
||||
= vec::to_mut(vec::from_elem(vec::len(graph), -1i64));
|
||||
= vec::cast_to_mut(vec::from_elem(vec::len(graph), -1i64));
|
||||
|
||||
let Q = deque::create();
|
||||
|
||||
|
|
@ -141,7 +141,7 @@ fn bfs(graph: graph, key: node_id) -> bfs_result {
|
|||
};
|
||||
}
|
||||
|
||||
vec::from_mut(move marks)
|
||||
vec::cast_from_mut(move marks)
|
||||
}
|
||||
|
||||
/**
|
||||
|
|
|
|||
|
|
@ -14,9 +14,9 @@ extern mod std;
|
|||
fn fannkuch(n: int) -> int {
|
||||
fn perm1init(i: uint) -> int { return i as int; }
|
||||
|
||||
let perm = vec::to_mut(vec::from_elem(n as uint, 0));
|
||||
let perm1 = vec::to_mut(vec::from_fn(n as uint, |i| perm1init(i)));
|
||||
let count = vec::to_mut(vec::from_elem(n as uint, 0));
|
||||
let perm = vec::cast_to_mut(vec::from_elem(n as uint, 0));
|
||||
let perm1 = vec::cast_to_mut(vec::from_fn(n as uint, |i| perm1init(i)));
|
||||
let count = vec::cast_to_mut(vec::from_elem(n as uint, 0));
|
||||
let mut f = 0;
|
||||
let mut i = 0;
|
||||
let mut k = 0;
|
||||
|
|
|
|||
|
|
@ -151,7 +151,7 @@ fn main() {
|
|||
// initialize each sequence sorter
|
||||
let sizes = ~[1,2,3,4,6,12,18];
|
||||
let streams = vec::map(sizes, |_sz| Some(stream()));
|
||||
let streams = vec::to_mut(move streams);
|
||||
let streams = vec::cast_to_mut(move streams);
|
||||
let mut from_child = ~[];
|
||||
let to_child = vec::mapi(sizes, |ii, sz| {
|
||||
let sz = *sz;
|
||||
|
|
|
|||
|
|
@ -45,7 +45,7 @@ fn eval_At_times_u(u: &[const float], Au: &[mut float]) {
|
|||
}
|
||||
|
||||
fn eval_AtA_times_u(u: &[const float], AtAu: &[mut float]) {
|
||||
let v = vec::to_mut(vec::from_elem(vec::len(u), 0.0));
|
||||
let v = vec::cast_to_mut(vec::from_elem(vec::len(u), 0.0));
|
||||
eval_A_times_u(u, v);
|
||||
eval_At_times_u(v, AtAu);
|
||||
}
|
||||
|
|
@ -62,8 +62,8 @@ fn main() {
|
|||
|
||||
let N = uint::from_str(args[1]).get();
|
||||
|
||||
let u = vec::to_mut(vec::from_elem(N, 1.0));
|
||||
let v = vec::to_mut(vec::from_elem(N, 0.0));
|
||||
let u = vec::cast_to_mut(vec::from_elem(N, 1.0));
|
||||
let v = vec::cast_to_mut(vec::from_elem(N, 0.0));
|
||||
let mut i = 0u;
|
||||
while i < 10u {
|
||||
eval_AtA_times_u(u, v);
|
||||
|
|
|
|||
|
|
@ -42,7 +42,7 @@ fn read_grid(f: io::Reader) -> grid_t {
|
|||
assert f.read_line() == ~"9,9"; /* assert first line is exactly "9,9" */
|
||||
|
||||
let g = vec::from_fn(10u, {|_i|
|
||||
vec::to_mut(vec::from_elem(10u, 0 as u8))
|
||||
vec::cast_to_mut(vec::from_elem(10u, 0 as u8))
|
||||
});
|
||||
while !f.eof() {
|
||||
let comps = str::split_char(str::trim(f.read_line()), ',');
|
||||
|
|
@ -142,7 +142,7 @@ fn main() {
|
|||
// FIXME create sudoku inline since nested vec consts dont work yet
|
||||
// (#3733)
|
||||
let g = vec::from_fn(10u, |_i| {
|
||||
vec::to_mut(vec::from_elem(10u, 0 as u8))
|
||||
vec::cast_to_mut(vec::from_elem(10u, 0 as u8))
|
||||
});
|
||||
g[0][1] = 4u8;
|
||||
g[0][3] = 6u8;
|
||||
|
|
|
|||
|
|
@ -9,8 +9,8 @@
|
|||
// except according to those terms.
|
||||
|
||||
fn main() {
|
||||
use vec::to_mut;
|
||||
log(debug, vec::len(to_mut(~[1, 2])));
|
||||
use vec::cast_to_mut;
|
||||
log(debug, vec::len(cast_to_mut(~[1, 2])));
|
||||
{
|
||||
use vec::*;
|
||||
log(debug, len(~[2]));
|
||||
|
|
|
|||
|
|
@ -72,7 +72,7 @@ fn AsciiArt(width: uint, height: uint, fill: char) -> AsciiArt
|
|||
{
|
||||
let mut line = ~[];
|
||||
vec::grow_set(&mut line, width-1, &'.', '.');
|
||||
push(vec::to_mut(line));
|
||||
push(vec::cast_to_mut(line));
|
||||
}
|
||||
};
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue