|
| 1 | +extern crate libcc2rs; |
| 2 | +use libcc2rs::*; |
| 3 | +use std::cell::RefCell; |
| 4 | +use std::collections::BTreeMap; |
| 5 | +use std::io::prelude::*; |
| 6 | +use std::io::{Read, Seek, Write}; |
| 7 | +use std::os::fd::AsFd; |
| 8 | +use std::rc::{Rc, Weak}; |
| 9 | +pub fn main() { |
| 10 | + std::process::exit(main_0()); |
| 11 | +} |
| 12 | +fn main_0() -> i32 { |
| 13 | + let x: Value<i32> = Rc::new(RefCell::new({ |
| 14 | + let a: Value<i32> = Rc::new(RefCell::new(1)); |
| 15 | + let b: Value<i32> = Rc::new(RefCell::new(2)); |
| 16 | + let __result = ((*a.borrow()) + (*b.borrow())); |
| 17 | + __result |
| 18 | + })); |
| 19 | + assert!(((*x.borrow()) == 3)); |
| 20 | + let counter: Value<i32> = Rc::new(RefCell::new(0)); |
| 21 | + let y: Value<i32> = Rc::new(RefCell::new({ |
| 22 | + (*counter.borrow_mut()).postfix_inc(); |
| 23 | + let __result = ((*counter.borrow()) * 10); |
| 24 | + __result |
| 25 | + })); |
| 26 | + assert!(((*y.borrow()) == 10)); |
| 27 | + assert!(((*counter.borrow()) == 1)); |
| 28 | + let z: Value<i32> = Rc::new(RefCell::new({ |
| 29 | + let v: Value<i32> = Rc::new(RefCell::new(5)); |
| 30 | + if ((*v.borrow()) > 0) { |
| 31 | + let __rhs = ((*v.borrow()) * 2); |
| 32 | + (*v.borrow_mut()) = __rhs; |
| 33 | + } |
| 34 | + let __result = (*v.borrow()); |
| 35 | + __result |
| 36 | + })); |
| 37 | + assert!(((*z.borrow()) == 10)); |
| 38 | + assert!( |
| 39 | + ({ |
| 40 | + let inner: Value<i32> = Rc::new(RefCell::new({ |
| 41 | + let a: Value<i32> = Rc::new(RefCell::new(100)); |
| 42 | + let __result = (*a.borrow()); |
| 43 | + __result |
| 44 | + })); |
| 45 | + let __result = (*inner.borrow()); |
| 46 | + __result |
| 47 | + } == 100) |
| 48 | + ); |
| 49 | + return 0; |
| 50 | +} |
0 commit comments