2013-10-31 17:09:24 -05:00
|
|
|
// Copyright 2012-2013 The Rust Project Developers. See the COPYRIGHT
|
2012-12-03 18:48:01 -06:00
|
|
|
// file at the top-level directory of this distribution and at
|
|
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
|
|
// option. This file may not be copied, modified, or distributed
|
|
|
|
// except according to those terms.
|
|
|
|
|
2013-12-24 10:08:28 -06:00
|
|
|
//! Signaling success or failure states (`Result` type)
|
2011-12-13 18:25:51 -06:00
|
|
|
|
2013-07-02 14:47:32 -05:00
|
|
|
use clone::Clone;
|
2012-09-04 13:12:17 -05:00
|
|
|
use cmp::Eq;
|
2013-10-31 17:09:24 -05:00
|
|
|
use fmt;
|
2013-12-20 22:56:07 -06:00
|
|
|
use iter::{Iterator, FromIterator};
|
2013-12-06 15:23:23 -06:00
|
|
|
use option::{None, Option, Some};
|
2013-11-01 06:25:36 -05:00
|
|
|
use str::OwnedStr;
|
2013-08-03 18:59:24 -05:00
|
|
|
use to_str::ToStr;
|
|
|
|
|
|
|
|
/// `Result` is a type that represents either success (`Ok`) or failure (`Err`).
|
2013-11-01 06:25:36 -05:00
|
|
|
#[deriving(Clone, DeepClone, Eq, Ord, TotalEq, TotalOrd, ToStr)]
|
2013-08-03 18:59:24 -05:00
|
|
|
pub enum Result<T, E> {
|
2013-12-06 15:23:23 -06:00
|
|
|
/// Contains the success value
|
2012-08-26 18:54:31 -05:00
|
|
|
Ok(T),
|
2013-12-06 15:23:23 -06:00
|
|
|
|
2012-07-04 16:53:12 -05:00
|
|
|
/// Contains the error value
|
2013-08-03 18:59:24 -05:00
|
|
|
Err(E)
|
2011-12-13 18:25:51 -06:00
|
|
|
}
|
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
/////////////////////////////////////////////////////////////////////////////
|
|
|
|
// Type implementation
|
|
|
|
/////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
2013-12-06 15:23:23 -06:00
|
|
|
impl<T, E> Result<T, E> {
|
2013-10-31 17:09:24 -05:00
|
|
|
/////////////////////////////////////////////////////////////////////////
|
|
|
|
// Querying the contained values
|
|
|
|
/////////////////////////////////////////////////////////////////////////
|
2013-04-10 15:11:35 -05:00
|
|
|
|
2013-07-24 22:41:13 -05:00
|
|
|
/// Returns true if the result is `Ok`
|
2013-06-18 16:45:18 -05:00
|
|
|
#[inline]
|
2013-07-26 20:03:44 -05:00
|
|
|
pub fn is_ok(&self) -> bool {
|
|
|
|
match *self {
|
|
|
|
Ok(_) => true,
|
|
|
|
Err(_) => false
|
|
|
|
}
|
|
|
|
}
|
2012-04-01 17:44:01 -05:00
|
|
|
|
2013-07-24 22:41:13 -05:00
|
|
|
/// Returns true if the result is `Err`
|
2013-06-18 16:45:18 -05:00
|
|
|
#[inline]
|
2013-07-26 20:03:44 -05:00
|
|
|
pub fn is_err(&self) -> bool {
|
|
|
|
!self.is_ok()
|
|
|
|
}
|
2012-04-01 17:44:01 -05:00
|
|
|
|
2012-12-18 20:55:19 -06:00
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
/////////////////////////////////////////////////////////////////////////
|
2013-12-06 15:23:23 -06:00
|
|
|
// Adapter for each variant
|
2013-10-31 17:09:24 -05:00
|
|
|
/////////////////////////////////////////////////////////////////////////
|
|
|
|
|
2013-12-06 15:23:23 -06:00
|
|
|
/// Convert from `Result<T, E>` to `Option<T>`
|
2013-06-18 16:45:18 -05:00
|
|
|
#[inline]
|
2013-12-06 15:23:23 -06:00
|
|
|
pub fn ok(self) -> Option<T> {
|
2013-07-26 20:03:57 -05:00
|
|
|
match self {
|
2013-12-06 15:23:23 -06:00
|
|
|
Ok(x) => Some(x),
|
|
|
|
Err(_) => None,
|
2013-07-26 20:03:57 -05:00
|
|
|
}
|
|
|
|
}
|
2012-12-18 20:55:19 -06:00
|
|
|
|
2013-12-06 15:23:23 -06:00
|
|
|
/// Convert from `Result<T, E>` to `Option<E>`
|
2013-06-18 16:45:18 -05:00
|
|
|
#[inline]
|
2013-12-06 15:23:23 -06:00
|
|
|
pub fn err(self) -> Option<E> {
|
2013-10-31 17:09:24 -05:00
|
|
|
match self {
|
2013-12-06 15:23:23 -06:00
|
|
|
Ok(_) => None,
|
|
|
|
Err(x) => Some(x),
|
2013-10-31 17:09:24 -05:00
|
|
|
}
|
2013-08-03 18:59:24 -05:00
|
|
|
}
|
|
|
|
|
2013-12-06 15:23:23 -06:00
|
|
|
/////////////////////////////////////////////////////////////////////////
|
|
|
|
// Adapter for working with references
|
|
|
|
/////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
/// Convert from `Result<T, E>` to `Result<&T, &E>`
|
2013-08-03 18:59:24 -05:00
|
|
|
#[inline]
|
2013-12-06 15:23:23 -06:00
|
|
|
pub fn as_ref<'r>(&'r self) -> Result<&'r T, &'r E> {
|
|
|
|
match *self {
|
|
|
|
Ok(ref x) => Ok(x),
|
|
|
|
Err(ref x) => Err(x),
|
2013-08-03 18:59:24 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-12-06 15:23:23 -06:00
|
|
|
/// Convert from `Result<T, E>` to `Result<&mut T, &mut E>`
|
2013-08-03 18:59:24 -05:00
|
|
|
#[inline]
|
2013-12-06 15:23:23 -06:00
|
|
|
pub fn as_mut<'r>(&'r mut self) -> Result<&'r mut T, &'r mut E> {
|
|
|
|
match *self {
|
|
|
|
Ok(ref mut x) => Ok(x),
|
|
|
|
Err(ref mut x) => Err(x),
|
2013-07-26 20:03:57 -05:00
|
|
|
}
|
|
|
|
}
|
2012-12-18 20:55:19 -06:00
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
/////////////////////////////////////////////////////////////////////////
|
|
|
|
// Transforming contained values
|
|
|
|
/////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
/// Maps an `Result<T, E>` to `Result<U, E>` by applying a function to an
|
|
|
|
/// contained `Ok` value, leaving an `Err` value untouched.
|
2013-08-04 18:05:25 -05:00
|
|
|
///
|
2013-10-31 17:09:24 -05:00
|
|
|
/// This function can be used to compose the results of two functions.
|
2013-08-04 18:05:25 -05:00
|
|
|
///
|
|
|
|
/// Example:
|
|
|
|
///
|
2013-11-21 19:23:21 -06:00
|
|
|
/// let res = read_file(file).map(|buf| {
|
2013-08-04 18:05:25 -05:00
|
|
|
/// parse_bytes(buf)
|
2013-11-21 19:23:21 -06:00
|
|
|
/// })
|
2013-08-04 18:05:25 -05:00
|
|
|
#[inline]
|
2013-11-18 23:15:42 -06:00
|
|
|
pub fn map<U>(self, op: |T| -> U) -> Result<U,E> {
|
2013-08-04 18:05:25 -05:00
|
|
|
match self {
|
|
|
|
Ok(t) => Ok(op(t)),
|
|
|
|
Err(e) => Err(e)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
/// Maps an `Result<T, E>` to `Result<T, F>` by applying a function to an
|
|
|
|
/// contained `Err` value, leaving an `Ok` value untouched.
|
2013-08-04 18:05:25 -05:00
|
|
|
///
|
2013-10-31 17:09:24 -05:00
|
|
|
/// This function can be used to pass through a successful result while handling
|
|
|
|
/// an error.
|
2013-08-04 18:05:25 -05:00
|
|
|
#[inline]
|
2013-11-18 23:15:42 -06:00
|
|
|
pub fn map_err<F>(self, op: |E| -> F) -> Result<T,F> {
|
2013-08-04 18:05:25 -05:00
|
|
|
match self {
|
|
|
|
Ok(t) => Ok(t),
|
|
|
|
Err(e) => Err(op(e))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
////////////////////////////////////////////////////////////////////////
|
|
|
|
// Boolean operations on the values, eager and lazy
|
|
|
|
/////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
/// Returns `res` if the result is `Ok`, otherwise returns the `Err` value of `self`.
|
|
|
|
#[inline]
|
|
|
|
pub fn and<U>(self, res: Result<U, E>) -> Result<U, E> {
|
2013-09-11 14:52:17 -05:00
|
|
|
match self {
|
|
|
|
Ok(_) => res,
|
2013-10-31 17:09:24 -05:00
|
|
|
Err(e) => Err(e),
|
2013-09-11 14:52:17 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
/// Calls `op` if the result is `Ok`, otherwise returns the `Err` value of `self`.
|
2013-08-03 18:59:24 -05:00
|
|
|
///
|
2013-10-31 17:09:24 -05:00
|
|
|
/// This function can be used for control flow based on result values
|
2013-06-18 16:45:18 -05:00
|
|
|
#[inline]
|
2013-11-18 23:15:42 -06:00
|
|
|
pub fn and_then<U>(self, op: |T| -> Result<U, E>) -> Result<U, E> {
|
2013-07-22 19:27:53 -05:00
|
|
|
match self {
|
|
|
|
Ok(t) => op(t),
|
2013-07-24 22:41:13 -05:00
|
|
|
Err(e) => Err(e),
|
2013-07-22 19:27:53 -05:00
|
|
|
}
|
2012-05-26 22:33:08 -05:00
|
|
|
}
|
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
/// Returns `res` if the result is `Err`, otherwise returns the `Ok` value of `self`.
|
2013-09-11 14:52:17 -05:00
|
|
|
#[inline]
|
|
|
|
pub fn or(self, res: Result<T, E>) -> Result<T, E> {
|
|
|
|
match self {
|
|
|
|
Ok(_) => self,
|
|
|
|
Err(_) => res,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
/// Calls `op` if the result is `Err`, otherwise returns the `Ok` value of `self`.
|
2013-08-03 18:59:24 -05:00
|
|
|
///
|
2013-10-31 17:09:24 -05:00
|
|
|
/// This function can be used for control flow based on result values
|
2013-06-18 16:45:18 -05:00
|
|
|
#[inline]
|
2013-11-18 23:15:42 -06:00
|
|
|
pub fn or_else<F>(self, op: |E| -> Result<T, F>) -> Result<T, F> {
|
2013-07-22 19:27:53 -05:00
|
|
|
match self {
|
|
|
|
Ok(t) => Ok(t),
|
2013-07-24 22:41:13 -05:00
|
|
|
Err(e) => op(e),
|
2013-07-22 19:27:53 -05:00
|
|
|
}
|
2012-05-26 22:33:08 -05:00
|
|
|
}
|
2012-06-22 19:32:52 -05:00
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
/////////////////////////////////////////////////////////////////////////
|
|
|
|
// Common special cases
|
|
|
|
/////////////////////////////////////////////////////////////////////////
|
2012-06-22 19:32:52 -05:00
|
|
|
|
2013-12-06 15:23:23 -06:00
|
|
|
/// Unwraps a result, yielding the content of an `Ok`.
|
|
|
|
/// Fails if the value is an `Err`.
|
2013-06-18 16:45:18 -05:00
|
|
|
#[inline]
|
2013-12-06 15:23:23 -06:00
|
|
|
pub fn unwrap(self) -> T {
|
|
|
|
match self {
|
|
|
|
Ok(t) => t,
|
|
|
|
Err(_) => fail!("called `Result::unwrap()` on an `Err` value")
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Unwraps a result, yielding the content of an `Err`.
|
|
|
|
/// Fails if the value is an `Ok`.
|
|
|
|
#[inline]
|
|
|
|
pub fn unwrap_err(self) -> E {
|
|
|
|
match self {
|
|
|
|
Ok(_) => fail!("called `Result::unwrap_err()` on an `Ok` value"),
|
|
|
|
Err(e) => e
|
2013-07-22 20:41:53 -05:00
|
|
|
}
|
|
|
|
}
|
2013-08-03 18:59:24 -05:00
|
|
|
}
|
2012-06-22 19:32:52 -05:00
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
/////////////////////////////////////////////////////////////////////////////
|
|
|
|
// Trait implementations
|
|
|
|
/////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
2013-10-16 13:35:45 -05:00
|
|
|
impl<T: fmt::Default, E: fmt::Default> fmt::Default for Result<T, E> {
|
|
|
|
#[inline]
|
|
|
|
fn fmt(s: &Result<T, E>, f: &mut fmt::Formatter) {
|
|
|
|
match *s {
|
|
|
|
Ok(ref t) => write!(f.buf, "Ok({})", *t),
|
|
|
|
Err(ref e) => write!(f.buf, "Err({})", *e)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
/////////////////////////////////////////////////////////////////////////////
|
|
|
|
// Free functions
|
|
|
|
/////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
2013-12-20 22:56:07 -06:00
|
|
|
/// Takes each element in the `Iterator`: if it is an `Err`, no further
|
|
|
|
/// elements are taken, and the `Err` is returned. Should no `Err` occur, a
|
|
|
|
/// vector containing the values of each `Result` is returned.
|
2013-08-03 18:59:24 -05:00
|
|
|
///
|
|
|
|
/// Here is an example which increments every integer in a vector,
|
|
|
|
/// checking for overflow:
|
|
|
|
///
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
/// fn inc_conditionally(x: uint) -> Result<uint, &'static str> {
|
2013-08-03 18:59:24 -05:00
|
|
|
/// if x == uint::max_value { return Err("overflow"); }
|
|
|
|
/// else { return Ok(x+1u); }
|
|
|
|
/// }
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
/// let v = [1u, 2, 3];
|
|
|
|
/// let res = collect(v.iter().map(|&x| inc_conditionally(x)));
|
|
|
|
/// assert!(res == Ok(~[2u, 3, 4]));
|
2013-06-18 16:45:18 -05:00
|
|
|
#[inline]
|
2013-12-20 22:56:07 -06:00
|
|
|
pub fn collect<T, E, Iter: Iterator<Result<T, E>>, V: FromIterator<T>>(iter: Iter) -> Result<V, E> {
|
|
|
|
// FIXME(#11084): This should be twice as fast once this bug is closed.
|
|
|
|
let mut iter = iter.scan(None, |state, x| {
|
|
|
|
match x {
|
|
|
|
Ok(x) => Some(x),
|
|
|
|
Err(err) => {
|
|
|
|
*state = Some(err);
|
|
|
|
None
|
|
|
|
}
|
2012-03-13 19:46:16 -05:00
|
|
|
}
|
2013-12-20 22:56:07 -06:00
|
|
|
});
|
|
|
|
|
|
|
|
let v: V = FromIterator::from_iterator(&mut iter);
|
|
|
|
|
|
|
|
match iter.state {
|
|
|
|
Some(err) => Err(err),
|
|
|
|
None => Ok(v),
|
2012-03-13 19:46:16 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
/// Perform a fold operation over the result values from an iterator.
|
2013-08-03 18:59:24 -05:00
|
|
|
///
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
/// If an `Err` is encountered, it is immediately returned.
|
|
|
|
/// Otherwise, the folded value is returned.
|
2013-06-18 16:45:18 -05:00
|
|
|
#[inline]
|
2013-11-18 23:15:42 -06:00
|
|
|
pub fn fold<T,
|
|
|
|
V,
|
|
|
|
E,
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
Iter: Iterator<Result<T, E>>>(
|
|
|
|
mut iterator: Iter,
|
|
|
|
mut init: V,
|
2013-11-18 23:15:42 -06:00
|
|
|
f: |V, T| -> V)
|
|
|
|
-> Result<V, E> {
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
for t in iterator {
|
|
|
|
match t {
|
|
|
|
Ok(v) => init = f(init, v),
|
|
|
|
Err(u) => return Err(u)
|
2012-03-13 19:46:16 -05:00
|
|
|
}
|
|
|
|
}
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
Ok(init)
|
2012-03-13 19:46:16 -05:00
|
|
|
}
|
|
|
|
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
/// Perform a trivial fold operation over the result values
|
|
|
|
/// from an iterator.
|
|
|
|
///
|
|
|
|
/// If an `Err` is encountered, it is immediately returned.
|
|
|
|
/// Otherwise, a simple `Ok(())` is returned.
|
2013-06-18 16:45:18 -05:00
|
|
|
#[inline]
|
2013-11-18 23:15:42 -06:00
|
|
|
pub fn fold_<T,E,Iter:Iterator<Result<T,E>>>(iterator: Iter) -> Result<(),E> {
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
fold(iterator, (), |_, _| ())
|
2012-03-22 22:06:01 -05:00
|
|
|
}
|
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
/////////////////////////////////////////////////////////////////////////////
|
|
|
|
// Tests
|
|
|
|
/////////////////////////////////////////////////////////////////////////////
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
|
2012-01-17 19:28:21 -06:00
|
|
|
#[cfg(test)]
|
|
|
|
mod tests {
|
2013-07-24 22:25:18 -05:00
|
|
|
use super::*;
|
2014-01-07 00:33:37 -06:00
|
|
|
use prelude::*;
|
2013-08-04 18:05:25 -05:00
|
|
|
|
2013-09-08 10:01:16 -05:00
|
|
|
use iter::range;
|
2012-12-27 19:53:04 -06:00
|
|
|
|
2013-07-24 22:25:18 -05:00
|
|
|
pub fn op1() -> Result<int, ~str> { Ok(666) }
|
2013-09-11 14:52:17 -05:00
|
|
|
pub fn op2() -> Result<int, ~str> { Err(~"sadface") }
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
pub fn test_and() {
|
|
|
|
assert_eq!(op1().and(Ok(667)).unwrap(), 667);
|
2013-10-31 17:09:24 -05:00
|
|
|
assert_eq!(op1().and(Err::<(), ~str>(~"bad")).unwrap_err(), ~"bad");
|
2012-01-17 19:28:21 -06:00
|
|
|
|
2013-09-11 14:52:17 -05:00
|
|
|
assert_eq!(op2().and(Ok(667)).unwrap_err(), ~"sadface");
|
2013-10-31 17:09:24 -05:00
|
|
|
assert_eq!(op2().and(Err::<(), ~str>(~"bad")).unwrap_err(), ~"sadface");
|
2012-03-13 16:39:28 -05:00
|
|
|
}
|
2012-01-17 19:28:21 -06:00
|
|
|
|
2013-09-11 14:52:17 -05:00
|
|
|
#[test]
|
|
|
|
pub fn test_and_then() {
|
|
|
|
assert_eq!(op1().and_then(|i| Ok::<int, ~str>(i + 1)).unwrap(), 667);
|
|
|
|
assert_eq!(op1().and_then(|_| Err::<int, ~str>(~"bad")).unwrap_err(), ~"bad");
|
|
|
|
|
|
|
|
assert_eq!(op2().and_then(|i| Ok::<int, ~str>(i + 1)).unwrap_err(), ~"sadface");
|
|
|
|
assert_eq!(op2().and_then(|_| Err::<int, ~str>(~"bad")).unwrap_err(), ~"sadface");
|
|
|
|
}
|
2012-01-17 19:28:21 -06:00
|
|
|
|
|
|
|
#[test]
|
2013-09-11 14:52:17 -05:00
|
|
|
pub fn test_or() {
|
|
|
|
assert_eq!(op1().or(Ok(667)).unwrap(), 666);
|
|
|
|
assert_eq!(op1().or(Err(~"bad")).unwrap(), 666);
|
|
|
|
|
|
|
|
assert_eq!(op2().or(Ok(667)).unwrap(), 667);
|
|
|
|
assert_eq!(op2().or(Err(~"bad")).unwrap_err(), ~"bad");
|
2012-01-17 19:28:21 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2013-09-11 14:52:17 -05:00
|
|
|
pub fn test_or_else() {
|
|
|
|
assert_eq!(op1().or_else(|_| Ok::<int, ~str>(667)).unwrap(), 666);
|
|
|
|
assert_eq!(op1().or_else(|e| Err::<int, ~str>(e + "!")).unwrap(), 666);
|
|
|
|
|
|
|
|
assert_eq!(op2().or_else(|_| Ok::<int, ~str>(667)).unwrap(), 667);
|
|
|
|
assert_eq!(op2().or_else(|e| Err::<int, ~str>(e + "!")).unwrap_err(), ~"sadface!");
|
2012-01-17 19:28:21 -06:00
|
|
|
}
|
2012-05-26 22:33:08 -05:00
|
|
|
|
|
|
|
#[test]
|
2013-01-29 13:47:18 -06:00
|
|
|
pub fn test_impl_map() {
|
2013-10-31 17:09:24 -05:00
|
|
|
assert_eq!(Ok::<~str, ~str>(~"a").map(|x| x + "b"), Ok(~"ab"));
|
|
|
|
assert_eq!(Err::<~str, ~str>(~"a").map(|x| x + "b"), Err(~"a"));
|
2012-05-26 22:33:08 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2013-01-29 13:47:18 -06:00
|
|
|
pub fn test_impl_map_err() {
|
2013-10-31 17:09:24 -05:00
|
|
|
assert_eq!(Ok::<~str, ~str>(~"a").map_err(|x| x + "b"), Ok(~"a"));
|
|
|
|
assert_eq!(Err::<~str, ~str>(~"a").map_err(|x| x + "b"), Err(~"ab"));
|
2012-05-26 22:33:08 -05:00
|
|
|
}
|
2012-10-22 20:31:13 -05:00
|
|
|
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
#[test]
|
|
|
|
fn test_collect() {
|
2013-12-20 22:56:07 -06:00
|
|
|
let v: Result<~[int], ()> = collect(range(0, 0).map(|_| Ok::<int, ()>(0)));
|
|
|
|
assert_eq!(v, Ok(~[]));
|
|
|
|
|
|
|
|
let v: Result<~[int], ()> = collect(range(0, 3).map(|x| Ok::<int, ()>(x)));
|
|
|
|
assert_eq!(v, Ok(~[0, 1, 2]));
|
|
|
|
|
|
|
|
let v: Result<~[int], int> = collect(range(0, 3)
|
|
|
|
.map(|x| if x > 1 { Err(x) } else { Ok(x) }));
|
|
|
|
assert_eq!(v, Err(2));
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
|
|
|
|
// test that it does not take more elements than it needs
|
2013-10-21 15:08:31 -05:00
|
|
|
let functions = [|| Ok(()), || Err(1), || fail!()];
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
|
2013-12-20 22:56:07 -06:00
|
|
|
let v: Result<~[()], int> = collect(functions.iter().map(|f| (*f)()));
|
|
|
|
assert_eq!(v, Err(1));
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_fold() {
|
|
|
|
assert_eq!(fold_(range(0, 0)
|
|
|
|
.map(|_| Ok::<(), ()>(()))),
|
|
|
|
Ok(()));
|
|
|
|
assert_eq!(fold(range(0, 3)
|
|
|
|
.map(|x| Ok::<int, ()>(x)),
|
|
|
|
0, |a, b| a + b),
|
|
|
|
Ok(3));
|
|
|
|
assert_eq!(fold_(range(0, 3)
|
|
|
|
.map(|x| if x > 1 { Err(x) } else { Ok(()) })),
|
|
|
|
Err(2));
|
|
|
|
|
|
|
|
// test that it does not take more elements than it needs
|
2013-10-21 15:08:31 -05:00
|
|
|
let functions = [|| Ok(()), || Err(1), || fail!()];
|
std: Replace map_vec, map_vec2, iter_vec2 in std::result
Replace these with three functions based on iterators: collect, fold,
and fold_. The mapping part is replaced by iterator .map(), so the part
that these functions do is to accumulate the final Result<,> value.
* `result::collect` gathers `Iterator<Result<V, U>>` to `Result<~[V], U>`
* `result::fold` folds `Iterator<Result<T, E>>` to `Result<V, E>`
* `result::fold_` folds `Iterator<Result<T, E>>` to `Result<(), E>`
2013-08-12 13:24:05 -05:00
|
|
|
|
|
|
|
assert_eq!(fold_(functions.iter()
|
|
|
|
.map(|f| (*f)())),
|
|
|
|
Err(1));
|
|
|
|
}
|
2013-09-11 11:26:59 -05:00
|
|
|
|
2013-10-16 13:35:45 -05:00
|
|
|
#[test]
|
|
|
|
pub fn test_to_str() {
|
|
|
|
let ok: Result<int, ~str> = Ok(100);
|
|
|
|
let err: Result<int, ~str> = Err(~"Err");
|
|
|
|
|
|
|
|
assert_eq!(ok.to_str(), ~"Ok(100)");
|
|
|
|
assert_eq!(err.to_str(), ~"Err(Err)");
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
pub fn test_fmt_default() {
|
|
|
|
let ok: Result<int, ~str> = Ok(100);
|
|
|
|
let err: Result<int, ~str> = Err(~"Err");
|
|
|
|
|
|
|
|
assert_eq!(format!("{}", ok), ~"Ok(100)");
|
|
|
|
assert_eq!(format!("{}", err), ~"Err(Err)");
|
|
|
|
}
|
2012-01-17 19:28:21 -06:00
|
|
|
}
|