uniplate 0.4.6

Simple, boilerplate-free operations on tree-shaped data types
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49

#![allow(dead_code)]
//! Using derive with a simple container type (a binary tree)

use std::collections::VecDeque;

// Using a mix of where clauses and type parameter bounds, to show that either works.
//
// Note that Uniplate does not walk into T here.
use uniplate::{Biplate, Uniplate};
#[derive(Eq, PartialEq, Uniplate, Clone)]
#[biplate(to=T)]
enum BinaryTree<T: PartialEq + Eq>
where
    T: Ord,
    T: Clone,
{
    Leaf(T),
    Branch(T, Box<BinaryTree<T>>, Box<BinaryTree<T>>),
}

pub fn main() {
    let tree1: BinaryTree<String> = BinaryTree::Leaf("Hello".into());
    let tree2: BinaryTree<String> = BinaryTree::Branch(
        "World".into(),
        Box::new(tree1.clone()),
        Box::new(tree1.clone()),
    );
    let tree3: BinaryTree<String> = BinaryTree::Branch(
        "Foo".into(),
        Box::new(tree1.clone()),
        Box::new(tree2.clone()),
    );

    let tree1_universe: VecDeque<String> = VecDeque::from(["Hello".into()]);
    let tree2_universe: VecDeque<String> =
        VecDeque::from(["World".into(), "Hello".into(), "Hello".into()]);

    let tree3_universe: VecDeque<String> = VecDeque::from([
        "Foo".into(),
        "Hello".into(),
        "World".into(),
        "Hello".into(),
        "Hello".into(),
    ]);

    assert_eq!(tree1_universe, Biplate::<String>::universe_bi(&tree1));
    assert_eq!(tree2_universe, Biplate::<String>::universe_bi(&tree2));
    assert_eq!(tree3_universe, Biplate::<String>::universe_bi(&tree3));
}