Remove remaining references to option::t outside option itself

This commit is contained in:
Tim Chevalier 2012-02-01 16:49:36 -08:00
parent 4eb92d4177
commit 49cb3fc7df
4 changed files with 12 additions and 12 deletions

View file

@ -103,7 +103,7 @@ pure fn to_digit(c: char) -> u8 unsafe {
brief = "Convert a char to the corresponding digit. Returns none when \
character is not a valid hexadecimal digit."
)]
pure fn maybe_digit(c: char) -> option::t<u8> {
pure fn maybe_digit(c: char) -> option<u8> {
alt c {
'0' to '9' { option::some(c as u8 - ('0' as u8)) }
'a' to 'z' { option::some(c as u8 + 10u8 - ('a' as u8)) }

View file

@ -69,7 +69,7 @@ mod ct {
// A formatted conversion from an expression to a string
type conv =
{param: option::t<int>,
{param: option<int>,
flags: [flag],
width: count,
precision: count,
@ -115,7 +115,7 @@ mod ct {
ret pieces;
}
fn peek_num(s: str, i: uint, lim: uint) ->
option::t<{num: uint, next: uint}> {
option<{num: uint, next: uint}> {
if i >= lim { ret none; }
let c = s[i];
if !('0' as u8 <= c && c <= '9' as u8) { ret option::none; }
@ -145,7 +145,7 @@ mod ct {
next: ty.next};
}
fn parse_parameter(s: str, i: uint, lim: uint) ->
{param: option::t<int>, next: uint} {
{param: option<int>, next: uint} {
if i >= lim { ret {param: none, next: i}; }
let num = peek_num(s, i, lim);
ret alt num {

View file

@ -122,7 +122,7 @@ fn spawn(+f: fn~()) -> task {
}
fn spawn_inner(-f: fn~(),
notify: option::t<comm::chan<task_notification>>) -> task unsafe {
notify: option<comm::chan<task_notification>>) -> task unsafe {
let closure: *rust_closure = unsafe::reinterpret_cast(ptr::addr_of(f));
#debug("spawn: closure={%x,%x}", (*closure).fnptr, (*closure).envptr);
let id = rustrt::new_task();

View file

@ -230,7 +230,7 @@ Returns:
An option containing the last element of `v` if `v` is not empty, or
none if `v` is empty.
*/
pure fn last<T: copy>(v: [const T]) -> option::t<T> {
pure fn last<T: copy>(v: [const T]) -> option<T> {
if len(v) == 0u { ret none; }
ret some(v[len(v) - 1u]);
}
@ -445,7 +445,7 @@ Apply a function to each element of a vector and return the results
If function `f` returns `none` then that element is excluded from
the resulting vector.
*/
fn filter_map<T: copy, U: copy>(v: [const T], f: fn(T) -> option::t<U>)
fn filter_map<T: copy, U: copy>(v: [const T], f: fn(T) -> option<U>)
-> [U] {
let result = [];
for elem: T in v {
@ -599,7 +599,7 @@ Apply function `f` to each element of `v`, starting from the first.
When function `f` returns true then an option containing the element
is returned. If `f` matches no elements then none is returned.
*/
fn find<T: copy>(v: [T], f: fn(T) -> bool) -> option::t<T> {
fn find<T: copy>(v: [T], f: fn(T) -> bool) -> option<T> {
for elt: T in v { if f(elt) { ret some(elt); } }
ret none;
}
@ -614,7 +614,7 @@ Returns:
option::some(uint) - The first index containing a matching value
option::none - No elements matched
*/
fn position<T>(x: T, v: [T]) -> option::t<uint> {
fn position<T>(x: T, v: [T]) -> option<uint> {
let i: uint = 0u;
while i < len(v) { if x == v[i] { ret some::<uint>(i); } i += 1u; }
ret none;
@ -625,7 +625,7 @@ Function: position_pred
Find the first index for which the value matches some predicate
*/
fn position_pred<T>(v: [T], f: fn(T) -> bool) -> option::t<uint> {
fn position_pred<T>(v: [T], f: fn(T) -> bool) -> option<uint> {
let i: uint = 0u;
while i < len(v) { if f(v[i]) { ret some::<uint>(i); } i += 1u; }
ret none;
@ -1010,7 +1010,7 @@ mod tests {
pure fn is_equal(&&x: uint, &&y:uint) -> bool { ret x == y; }
fn square_if_odd(&&n: uint) -> option::t<uint> {
fn square_if_odd(&&n: uint) -> option<uint> {
ret if n % 2u == 1u { some(n * n) } else { none };
}
@ -1267,7 +1267,7 @@ mod tests {
assert (w[1] == 9u);
assert (w[2] == 25u);
fn halve(&&i: int) -> option::t<int> {
fn halve(&&i: int) -> option<int> {
if i % 2 == 0 {
ret option::some::<int>(i / 2);
} else { ret option::none::<int>; }