rust/src/test/run-pass/trait-cast.rs

70 lines
2.0 KiB
Rust
Raw Normal View History

// 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.
#![feature(managed_boxes)]
2013-10-23 03:49:18 -05:00
// Test cyclic detector when using trait instances.
2013-12-31 17:46:27 -06:00
use std::cell::RefCell;
struct Tree(@RefCell<TreeR>);
struct TreeR {
left: Option<Tree>,
right: Option<Tree>,
val: Box<to_str:Send>
}
trait to_str {
2013-06-22 13:43:15 -05:00
fn to_str_(&self) -> ~str;
}
impl<T:to_str> to_str for Option<T> {
2013-06-22 13:43:15 -05:00
fn to_str_(&self) -> ~str {
match *self {
2014-04-15 20:17:48 -05:00
None => { "none".to_owned() }
Some(ref t) => { "some(".to_owned() + t.to_str_() + ")".to_owned() }
}
}
}
impl to_str for int {
2013-06-22 13:43:15 -05:00
fn to_str_(&self) -> ~str { self.to_str() }
}
impl to_str for Tree {
2013-06-22 13:43:15 -05:00
fn to_str_(&self) -> ~str {
let Tree(t) = *self;
let this = t.borrow();
2014-03-21 00:06:51 -05:00
let (l, r) = (this.left, this.right);
let val = &this.val;
2013-09-29 21:23:57 -05:00
format!("[{}, {}, {}]", val.to_str_(), l.to_str_(), r.to_str_())
}
}
2013-06-22 13:43:15 -05:00
fn foo<T:to_str>(x: T) -> ~str { x.to_str_() }
pub fn main() {
2013-12-31 17:46:27 -06:00
let t1 = Tree(@RefCell::new(TreeR{left: None,
right: None,
val: box 1 as Box<to_str:Send>}));
2013-12-31 17:46:27 -06:00
let t2 = Tree(@RefCell::new(TreeR{left: Some(t1),
right: Some(t1),
val: box 2 as Box<to_str:Send>}));
2014-04-15 20:17:48 -05:00
let expected = "[2, some([1, none, none]), some([1, none, none])]".to_owned();
2013-06-22 13:43:15 -05:00
assert!(t2.to_str_() == expected);
assert!(foo(t2) == expected);
2013-12-31 17:46:27 -06:00
{
let Tree(t1_) = t1;
let mut t1 = t1_.borrow_mut();
2014-03-21 00:06:51 -05:00
t1.left = Some(t2); // create cycle
2013-12-31 17:46:27 -06:00
}
}