|
| 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::Seek; |
| 7 | +use std::io::{Read, Write}; |
| 8 | +use std::os::fd::AsFd; |
| 9 | +use std::rc::{Rc, Weak}; |
| 10 | +#[derive(Clone, Default)] |
| 11 | +pub struct Point { |
| 12 | + pub x: Value<i32>, |
| 13 | + pub y: Value<i32>, |
| 14 | +} |
| 15 | +impl ByteRepr for Point {} |
| 16 | +#[derive(Clone, Default)] |
| 17 | +pub struct Line { |
| 18 | + pub start: Value<Point>, |
| 19 | + pub end: Value<Point>, |
| 20 | +} |
| 21 | +impl ByteRepr for Line {} |
| 22 | +#[derive(Clone, Default)] |
| 23 | +pub struct Node { |
| 24 | + pub value: Value<i32>, |
| 25 | + pub next: Value<Ptr<Node>>, |
| 26 | +} |
| 27 | +impl ByteRepr for Node {} |
| 28 | +#[derive(Clone, Copy, PartialEq, Debug, Default)] |
| 29 | +enum Color { |
| 30 | + #[default] |
| 31 | + RED = 0, |
| 32 | + GREEN = 1, |
| 33 | + BLUE = 2, |
| 34 | +} |
| 35 | +#[derive(Clone, Default)] |
| 36 | +pub struct Inner { |
| 37 | + pub a: Value<i32>, |
| 38 | + pub b: Value<i32>, |
| 39 | +} |
| 40 | +impl ByteRepr for Inner {} |
| 41 | +#[derive(Clone, Default)] |
| 42 | +pub struct Container { |
| 43 | + pub inner: Value<Inner>, |
| 44 | + pub color: Value<Color>, |
| 45 | + pub count: Value<i32>, |
| 46 | +} |
| 47 | +impl ByteRepr for Container {} |
| 48 | +pub fn main() { |
| 49 | + std::process::exit(main_0()); |
| 50 | +} |
| 51 | +fn main_0() -> i32 { |
| 52 | + let p: Value<Point> = Rc::new(RefCell::new(Point { |
| 53 | + x: Rc::new(RefCell::new(10)), |
| 54 | + y: Rc::new(RefCell::new(20)), |
| 55 | + })); |
| 56 | + assert!(((*(*p.borrow()).x.borrow()) == 10)); |
| 57 | + assert!(((*(*p.borrow()).y.borrow()) == 20)); |
| 58 | + let l: Value<Line> = Rc::new(RefCell::new(Line { |
| 59 | + start: Rc::new(RefCell::new(Point { |
| 60 | + x: Rc::new(RefCell::new(1)), |
| 61 | + y: Rc::new(RefCell::new(2)), |
| 62 | + })), |
| 63 | + end: Rc::new(RefCell::new(Point { |
| 64 | + x: Rc::new(RefCell::new(3)), |
| 65 | + y: Rc::new(RefCell::new(4)), |
| 66 | + })), |
| 67 | + })); |
| 68 | + assert!(((*(*(*l.borrow()).start.borrow()).x.borrow()) == 1)); |
| 69 | + assert!(((*(*(*l.borrow()).end.borrow()).y.borrow()) == 4)); |
| 70 | + let a: Value<Node> = Rc::new(RefCell::new(Node { |
| 71 | + value: Rc::new(RefCell::new(1)), |
| 72 | + next: Rc::new(RefCell::new(Default::default())), |
| 73 | + })); |
| 74 | + let b: Value<Node> = Rc::new(RefCell::new(Node { |
| 75 | + value: Rc::new(RefCell::new(2)), |
| 76 | + next: Rc::new(RefCell::new((a.as_pointer()))), |
| 77 | + })); |
| 78 | + assert!( |
| 79 | + ((*(*(*(*b.borrow()).next.borrow()).upgrade().deref()) |
| 80 | + .value |
| 81 | + .borrow()) |
| 82 | + == 1) |
| 83 | + ); |
| 84 | + let c: Value<Container> = Rc::new(RefCell::new(Container { |
| 85 | + inner: Rc::new(RefCell::new(Inner { |
| 86 | + a: Rc::new(RefCell::new(5)), |
| 87 | + b: Rc::new(RefCell::new(6)), |
| 88 | + })), |
| 89 | + color: Rc::new(RefCell::new((Color::GREEN as Color))), |
| 90 | + count: Rc::new(RefCell::new(42)), |
| 91 | + })); |
| 92 | + assert!(((*(*(*c.borrow()).inner.borrow()).a.borrow()) == 5)); |
| 93 | + assert!(((*(*(*c.borrow()).inner.borrow()).b.borrow()) == 6)); |
| 94 | + assert!((((*(*c.borrow()).color.borrow()) as u32) == (Color::GREEN as u32))); |
| 95 | + assert!(((*(*c.borrow()).count.borrow()) == 42)); |
| 96 | + let c2: Value<Container> = <Value<Container>>::default(); |
| 97 | + (*(*c2.borrow()).color.borrow_mut()) = (Color::BLUE as Color); |
| 98 | + assert!((((*(*c2.borrow()).color.borrow()) as u32) == 2_u32)); |
| 99 | + return 0; |
| 100 | +} |
0 commit comments