Skip to content

Commit cf4a9ae

Browse files
committed
Fixed fmt!, tests, doc-tests.
1 parent df9ddc6 commit cf4a9ae

File tree

7 files changed

+31
-25
lines changed

7 files changed

+31
-25
lines changed

doc/rust.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -844,7 +844,7 @@ mod quux {
844844
pub fn bar() { }
845845
pub fn baz() { }
846846
}
847-
847+
848848
pub use quux::foo::*;
849849
}
850850
~~~~
@@ -1242,7 +1242,7 @@ trait Num {
12421242
impl float: Num {
12431243
static pure fn from_int(n: int) -> float { n as float }
12441244
}
1245-
let x: float = Num::from_int(42);
1245+
let x: float = Num::from_int(42);
12461246
~~~~
12471247

12481248
Traits may inherit from other traits. For example, in
@@ -1615,7 +1615,7 @@ The following are examples of structure expressions:
16151615
~~~~
16161616
# struct Point { x: float, y: float }
16171617
# struct TuplePoint(float, float);
1618-
# mod game { pub struct User { name: &str, age: uint, mut score: uint } }
1618+
# mod game { pub struct User { name: &str, age: uint, mut score: uint } }
16191619
# use game;
16201620
Point {x: 10f, y: 20f};
16211621
TuplePoint(10f, 20f);
@@ -2812,7 +2812,7 @@ trait Printable {
28122812
}
28132813
28142814
impl int: Printable {
2815-
fn to_str() -> ~str { int::to_str(self, 10) }
2815+
fn to_str() -> ~str { int::to_str(self) }
28162816
}
28172817
28182818
fn print(a: @Printable) {

doc/tutorial-tasks.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -473,7 +473,7 @@ fn stringifier(channel: &DuplexStream<~str, uint>) {
473473
let mut value: uint;
474474
loop {
475475
value = channel.recv();
476-
channel.send(uint::to_str(value, 10));
476+
channel.send(uint::to_str(value));
477477
if value == 0 { break; }
478478
}
479479
}
@@ -497,7 +497,7 @@ Here is the code for the parent task:
497497
# let mut value: uint;
498498
# loop {
499499
# value = channel.recv();
500-
# channel.send(uint::to_str(value, 10u));
500+
# channel.send(uint::to_str(value));
501501
# if value == 0u { break; }
502502
# }
503503
# }

src/libcore/num/num.rs

Lines changed: 7 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -422,6 +422,12 @@ pub pure fn to_str_bytes_common<T: Num Zero One Eq Ord Round Copy>(
422422
buf = buf.slice(0, i + 1);
423423
}
424424
}
425+
} // If exact and trailing '.', just cut that
426+
else {
427+
let max_i = buf.len() - 1;
428+
if buf[max_i] == '.' as u8 {
429+
buf = buf.slice(0, max_i);
430+
}
425431
}
426432

427433
(buf, false)
@@ -678,4 +684,4 @@ pub pure fn from_str_common<T: Num Zero One Ord Copy>(
678684
) -> Option<T> {
679685
from_str_bytes_common(str::to_bytes(buf), radix, negative,
680686
fractional, special, exponent, empty_zero)
681-
}
687+
}

src/libstd/time.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -926,7 +926,7 @@ mod tests {
926926
let s0 = precise_time_s();
927927
let ns1 = precise_time_ns();
928928

929-
log(debug, ~"s0=" + float::to_str(s0, 9u) + ~" sec");
929+
log(debug, ~"s0=" + float::to_str_digits(s0, 9u) + ~" sec");
930930
assert s0 > 0.;
931931
let ns0 = (s0 * 1000000000.) as u64;
932932
log(debug, ~"ns0=" + u64::str(ns0) + ~" ns");

src/test/bench/core-map.rs

Lines changed: 15 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -75,12 +75,12 @@ fn old_str_benchmarks(rng: @rand::Rng, num_keys: uint, results: &mut Results) {
7575
let map = map::HashMap();
7676
do timed(&mut results.sequential_strings) {
7777
for uint::range(0, num_keys) |i| {
78-
let s = uint::to_str(i, 10);
78+
let s = uint::to_str(i);
7979
map.insert(s, i);
8080
}
8181

8282
for uint::range(0, num_keys) |i| {
83-
let s = uint::to_str(i, 10);
83+
let s = uint::to_str(i);
8484
assert map.get(s) == i;
8585
}
8686
}
@@ -90,7 +90,7 @@ fn old_str_benchmarks(rng: @rand::Rng, num_keys: uint, results: &mut Results) {
9090
let map = map::HashMap();
9191
do timed(&mut results.random_strings) {
9292
for uint::range(0, num_keys) |i| {
93-
let s = uint::to_str(rng.next() as uint, 10);
93+
let s = uint::to_str(rng.next() as uint);
9494
map.insert(s, i);
9595
}
9696
}
@@ -99,11 +99,11 @@ fn old_str_benchmarks(rng: @rand::Rng, num_keys: uint, results: &mut Results) {
9999
{
100100
let map = map::HashMap();
101101
for uint::range(0, num_keys) |i| {
102-
map.insert(uint::to_str(i, 10), i);
102+
map.insert(uint::to_str(i), i);
103103
}
104104
do timed(&mut results.delete_strings) {
105105
for uint::range(0, num_keys) |i| {
106-
assert map.remove(uint::to_str(i, 10));
106+
assert map.remove(uint::to_str(i));
107107
}
108108
}
109109
}
@@ -151,12 +151,12 @@ fn linear_str_benchmarks(rng: @rand::Rng, num_keys: uint, results: &mut Results)
151151
let mut map = LinearMap::new();
152152
do timed(&mut results.sequential_strings) {
153153
for uint::range(0, num_keys) |i| {
154-
let s = uint::to_str(i, 10);
154+
let s = uint::to_str(i);
155155
map.insert(s, i);
156156
}
157157

158158
for uint::range(0, num_keys) |i| {
159-
let s = uint::to_str(i, 10);
159+
let s = uint::to_str(i);
160160
assert map.find(&s).unwrap() == &i;
161161
}
162162
}
@@ -166,7 +166,7 @@ fn linear_str_benchmarks(rng: @rand::Rng, num_keys: uint, results: &mut Results)
166166
let mut map = LinearMap::new();
167167
do timed(&mut results.random_strings) {
168168
for uint::range(0, num_keys) |i| {
169-
let s = uint::to_str(rng.next() as uint, 10);
169+
let s = uint::to_str(rng.next() as uint);
170170
map.insert(s, i);
171171
}
172172
}
@@ -175,11 +175,11 @@ fn linear_str_benchmarks(rng: @rand::Rng, num_keys: uint, results: &mut Results)
175175
{
176176
let mut map = LinearMap::new();
177177
for uint::range(0, num_keys) |i| {
178-
map.insert(uint::to_str(i, 10), i);
178+
map.insert(uint::to_str(i), i);
179179
}
180180
do timed(&mut results.delete_strings) {
181181
for uint::range(0, num_keys) |i| {
182-
assert map.remove(&uint::to_str(i, 10));
182+
assert map.remove(&uint::to_str(i));
183183
}
184184
}
185185
}
@@ -227,12 +227,12 @@ fn tree_str_benchmarks(rng: @rand::Rng, num_keys: uint, results: &mut Results) {
227227
let mut map = TreeMap::new();
228228
do timed(&mut results.sequential_strings) {
229229
for uint::range(0, num_keys) |i| {
230-
let s = uint::to_str(i, 10);
230+
let s = uint::to_str(i);
231231
map.insert(s, i);
232232
}
233233

234234
for uint::range(0, num_keys) |i| {
235-
let s = uint::to_str(i, 10);
235+
let s = uint::to_str(i);
236236
assert map.find(&s).unwrap() == &i;
237237
}
238238
}
@@ -242,7 +242,7 @@ fn tree_str_benchmarks(rng: @rand::Rng, num_keys: uint, results: &mut Results) {
242242
let mut map = TreeMap::new();
243243
do timed(&mut results.random_strings) {
244244
for uint::range(0, num_keys) |i| {
245-
let s = uint::to_str(rng.next() as uint, 10);
245+
let s = uint::to_str(rng.next() as uint);
246246
map.insert(s, i);
247247
}
248248
}
@@ -251,11 +251,11 @@ fn tree_str_benchmarks(rng: @rand::Rng, num_keys: uint, results: &mut Results) {
251251
{
252252
let mut map = TreeMap::new();
253253
for uint::range(0, num_keys) |i| {
254-
map.insert(uint::to_str(i, 10), i);
254+
map.insert(uint::to_str(i), i);
255255
}
256256
do timed(&mut results.delete_strings) {
257257
for uint::range(0, num_keys) |i| {
258-
assert map.remove(&uint::to_str(i, 10));
258+
assert map.remove(&uint::to_str(i));
259259
}
260260
}
261261
}

src/test/bench/core-uint-to-str.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@ fn main() {
2121
let n = uint::from_str(args[1]).get();
2222

2323
for uint::range(0u, n) |i| {
24-
let x = uint::to_str(i, 10u);
24+
let x = uint::to_str(i);
2525
log(debug, x);
2626
}
2727
}

src/test/run-pass/core-export-f64-sqrt.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -14,5 +14,5 @@ pub fn main() {
1414

1515
let digits: uint = 10 as uint;
1616

17-
::core::io::println(float::to_str(f64::sqrt(42.0f64) as float, digits));
17+
::core::io::println(float::to_str_digits(f64::sqrt(42.0f64) as float, digits));
1818
}

0 commit comments

Comments
 (0)