user0/rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

removed math leftovers from std

Browse source
This commit is contained in:
Stefan Plantikow 2011-12-20 07:55:15 +01:00
parent 28b825d846
commit b957916e06
11 changed files with 8 additions and 850 deletions
Download patch file Download diff file Expand all files Collapse all files

3
src/comp/back/rpath.rs
View file

@ -3,7 +3,6 @@ import std::fs;
import std::os_fs;
import vec;
import std::map;
import std::math;
import str;
import uint;
import metadata::cstore;
@ -129,7 +128,7 @@ fn get_relative_to(abs1: fs::path, abs2: fs::path) -> fs::path {
assert len1 > 0u;
assert len2 > 0u;
let max_common_path = math::min(len1, len2) - 1u;
let max_common_path = float::min(len1, len2) - 1u;
let start_idx = 0u;
while start_idx < max_common_path
&& split1[start_idx] == split2[start_idx] {

3
src/comp/middle/ty.rs
View file

@ -4,7 +4,6 @@ import uint;
import std::ufind;
import std::map;
import std::map::hashmap;
import std::math;
import option;
import option::none;
import option::some;
@ -1754,7 +1753,7 @@ mod unify {
// Unifies two sets.
fn union(cx: @ctxt, set_a: uint, set_b: uint,
variance: variance) -> union_result {
ufind::grow(cx.vb.sets, math::max(set_a, set_b) + 1u);
ufind::grow(cx.vb.sets, float::max(set_a, set_b) + 1u);
let root_a = ufind::find(cx.vb.sets, set_a);
let root_b = ufind::find(cx.vb.sets, set_b);

2
src/comp/util/common.rs
View file

@ -1,5 +1,5 @@
import core::{str, option};
import std::math::{max, min};
import core::float::{max, min};
import std::map::hashmap;
import option::{some};
import syntax::ast;