266 lines
6.8 KiB
Rust
266 lines
6.8 KiB
Rust
// Copyright 2012 The Rust Project Developers. See the COPYRIGHT
|
|
// 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.
|
|
|
|
// NB: transitionary, de-mode-ing.
|
|
#[forbid(deprecated_mode)];
|
|
#[forbid(deprecated_pattern)];
|
|
|
|
//! A type that represents one of two alternatives
|
|
|
|
use cmp::Eq;
|
|
use result::Result;
|
|
|
|
/// The either type
|
|
pub enum Either<T, U> {
|
|
Left(T),
|
|
Right(U)
|
|
}
|
|
|
|
pub fn either<T, U, V>(f_left: fn(&T) -> V,
|
|
f_right: fn(&U) -> V, value: &Either<T, U>) -> V {
|
|
/*!
|
|
* Applies a function based on the given either value
|
|
*
|
|
* If `value` is left(T) then `f_left` is applied to its contents, if
|
|
* `value` is right(U) then `f_right` is applied to its contents, and the
|
|
* result is returned.
|
|
*/
|
|
|
|
match *value {
|
|
Left(ref l) => f_left(l),
|
|
Right(ref r) => f_right(r)
|
|
}
|
|
}
|
|
|
|
pub fn lefts<T: Copy, U>(eithers: &[Either<T, U>]) -> ~[T] {
|
|
//! Extracts from a vector of either all the left values
|
|
|
|
do vec::build_sized(eithers.len()) |push| {
|
|
for vec::each(eithers) |elt| {
|
|
match *elt {
|
|
Left(ref l) => { push(*l); }
|
|
_ => { /* fallthrough */ }
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
pub fn rights<T, U: Copy>(eithers: &[Either<T, U>]) -> ~[U] {
|
|
//! Extracts from a vector of either all the right values
|
|
|
|
do vec::build_sized(eithers.len()) |push| {
|
|
for vec::each(eithers) |elt| {
|
|
match *elt {
|
|
Right(ref r) => { push(*r); }
|
|
_ => { /* fallthrough */ }
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// XXX bad copies. take arg by val
|
|
pub fn partition<T: Copy, U: Copy>(eithers: &[Either<T, U>])
|
|
-> (~[T], ~[U]) {
|
|
/*!
|
|
* Extracts from a vector of either all the left values and right values
|
|
*
|
|
* Returns a structure containing a vector of left values and a vector of
|
|
* right values.
|
|
*/
|
|
|
|
let mut lefts: ~[T] = ~[];
|
|
let mut rights: ~[U] = ~[];
|
|
for vec::each(eithers) |elt| {
|
|
match *elt {
|
|
Left(copy l) => lefts.push(l),
|
|
Right(copy r) => rights.push(r)
|
|
}
|
|
}
|
|
return (move lefts, move rights);
|
|
}
|
|
|
|
// XXX bad copies
|
|
pub pure fn flip<T: Copy, U: Copy>(eith: &Either<T, U>) -> Either<U, T> {
|
|
//! Flips between left and right of a given either
|
|
|
|
match *eith {
|
|
Right(copy r) => Left(r),
|
|
Left(copy l) => Right(l)
|
|
}
|
|
}
|
|
|
|
// XXX bad copies
|
|
pub pure fn to_result<T: Copy, U: Copy>(eith: &Either<T, U>)
|
|
-> Result<U, T> {
|
|
/*!
|
|
* Converts either::t to a result::t
|
|
*
|
|
* Converts an `either` type to a `result` type, making the "right" choice
|
|
* an ok result, and the "left" choice a fail
|
|
*/
|
|
|
|
match *eith {
|
|
Right(copy r) => result::Ok(r),
|
|
Left(copy l) => result::Err(l)
|
|
}
|
|
}
|
|
|
|
pub pure fn is_left<T, U>(eith: &Either<T, U>) -> bool {
|
|
//! Checks whether the given value is a left
|
|
|
|
match *eith { Left(_) => true, _ => false }
|
|
}
|
|
|
|
pub pure fn is_right<T, U>(eith: &Either<T, U>) -> bool {
|
|
//! Checks whether the given value is a right
|
|
|
|
match *eith { Right(_) => true, _ => false }
|
|
}
|
|
|
|
// tjc: fix the next two after a snapshot
|
|
pub pure fn unwrap_left<T,U>(eith: Either<T,U>) -> T {
|
|
//! Retrieves the value in the left branch. Fails if the either is Right.
|
|
|
|
match move eith {
|
|
Left(move x) => move x, Right(_) => fail ~"either::unwrap_left Right"
|
|
}
|
|
}
|
|
|
|
pub pure fn unwrap_right<T,U>(eith: Either<T,U>) -> U {
|
|
//! Retrieves the value in the right branch. Fails if the either is Left.
|
|
|
|
match move eith {
|
|
Right(move x) => move x, Left(_) => fail ~"either::unwrap_right Left"
|
|
}
|
|
}
|
|
|
|
impl<T:Eq,U:Eq> Either<T,U> : Eq {
|
|
pure fn eq(&self, other: &Either<T,U>) -> bool {
|
|
match (*self) {
|
|
Left(ref a) => {
|
|
match (*other) {
|
|
Left(ref b) => (*a).eq(b),
|
|
Right(_) => false
|
|
}
|
|
}
|
|
Right(ref a) => {
|
|
match (*other) {
|
|
Left(_) => false,
|
|
Right(ref b) => (*a).eq(b)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
pure fn ne(&self, other: &Either<T,U>) -> bool { !(*self).eq(other) }
|
|
}
|
|
|
|
#[test]
|
|
fn test_either_left() {
|
|
let val = Left(10);
|
|
fn f_left(x: &int) -> bool { *x == 10 }
|
|
fn f_right(_x: &uint) -> bool { false }
|
|
assert (either(f_left, f_right, &val));
|
|
}
|
|
|
|
#[test]
|
|
fn test_either_right() {
|
|
let val = Right(10u);
|
|
fn f_left(_x: &int) -> bool { false }
|
|
fn f_right(x: &uint) -> bool { *x == 10u }
|
|
assert (either(f_left, f_right, &val));
|
|
}
|
|
|
|
#[test]
|
|
fn test_lefts() {
|
|
let input = ~[Left(10), Right(11), Left(12), Right(13), Left(14)];
|
|
let result = lefts(input);
|
|
assert (result == ~[10, 12, 14]);
|
|
}
|
|
|
|
#[test]
|
|
fn test_lefts_none() {
|
|
let input: ~[Either<int, int>] = ~[Right(10), Right(10)];
|
|
let result = lefts(input);
|
|
assert (vec::len(result) == 0u);
|
|
}
|
|
|
|
#[test]
|
|
fn test_lefts_empty() {
|
|
let input: ~[Either<int, int>] = ~[];
|
|
let result = lefts(input);
|
|
assert (vec::len(result) == 0u);
|
|
}
|
|
|
|
#[test]
|
|
fn test_rights() {
|
|
let input = ~[Left(10), Right(11), Left(12), Right(13), Left(14)];
|
|
let result = rights(input);
|
|
assert (result == ~[11, 13]);
|
|
}
|
|
|
|
#[test]
|
|
fn test_rights_none() {
|
|
let input: ~[Either<int, int>] = ~[Left(10), Left(10)];
|
|
let result = rights(input);
|
|
assert (vec::len(result) == 0u);
|
|
}
|
|
|
|
#[test]
|
|
fn test_rights_empty() {
|
|
let input: ~[Either<int, int>] = ~[];
|
|
let result = rights(input);
|
|
assert (vec::len(result) == 0u);
|
|
}
|
|
|
|
#[test]
|
|
fn test_partition() {
|
|
let input = ~[Left(10), Right(11), Left(12), Right(13), Left(14)];
|
|
let (lefts, rights) = partition(input);
|
|
assert (lefts[0] == 10);
|
|
assert (lefts[1] == 12);
|
|
assert (lefts[2] == 14);
|
|
assert (rights[0] == 11);
|
|
assert (rights[1] == 13);
|
|
}
|
|
|
|
#[test]
|
|
fn test_partition_no_lefts() {
|
|
let input: ~[Either<int, int>] = ~[Right(10), Right(11)];
|
|
let (lefts, rights) = partition(input);
|
|
assert (vec::len(lefts) == 0u);
|
|
assert (vec::len(rights) == 2u);
|
|
}
|
|
|
|
#[test]
|
|
fn test_partition_no_rights() {
|
|
let input: ~[Either<int, int>] = ~[Left(10), Left(11)];
|
|
let (lefts, rights) = partition(input);
|
|
assert (vec::len(lefts) == 2u);
|
|
assert (vec::len(rights) == 0u);
|
|
}
|
|
|
|
#[test]
|
|
fn test_partition_empty() {
|
|
let input: ~[Either<int, int>] = ~[];
|
|
let (lefts, rights) = partition(input);
|
|
assert (vec::len(lefts) == 0u);
|
|
assert (vec::len(rights) == 0u);
|
|
}
|
|
|
|
//
|
|
// Local Variables:
|
|
// mode: rust
|
|
// fill-column: 78;
|
|
// indent-tabs-mode: nil
|
|
// c-basic-offset: 4
|
|
// buffer-file-coding-system: utf-8-unix
|
|
// End:
|
|
//
|