echoes 0.12.0

Find duplicated Rust doctests, functions and contexts
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138

//! Exhaustive small graph comparison through the public API.

use std::collections::BTreeMap;
use std::fmt::Write as _;

#[path = "support/dependency_value_oracle.rs"]
mod value_oracle;
use value_oracle::{Value, operation};

#[path = "support/permutations.rs"]
mod permutations;
use permutations::permutations;

#[derive(Clone, Copy)]
enum Producer {
    Argument(usize),
    Previous(usize),
    Pair(usize, usize),
}

fn models(n: usize) -> Vec<Vec<Producer>> {
    fn extend(n: usize, prefix: &mut Vec<Producer>, out: &mut Vec<Vec<Producer>>) {
        if prefix.len() == n {
            out.push(prefix.clone());
            return;
        }
        let available = prefix.len();
        let choices = [Producer::Argument(0), Producer::Argument(1)]
            .into_iter()
            .chain((0..available).map(Producer::Previous))
            .chain((0..available).flat_map(move |left| {
                (0..available).map(move |right| Producer::Pair(left, right))
            }));
        for next in choices {
            prefix.push(next);
            extend(n, prefix, out);
            prefix.pop();
        }
    }
    let mut out = Vec::new();
    extend(n, &mut Vec::new(), &mut out);
    out
}

fn number(order: &[usize], node: usize) -> usize {
    order
        .iter()
        .position(|&candidate| candidate == node)
        .unwrap()
}

fn oracle(nodes: &[Producer], roots: [usize; 2]) -> String {
    let mut values: Vec<Value> = Vec::with_capacity(nodes.len());
    for node in nodes {
        let value = match *node {
            Producer::Argument(port) => {
                operation('&', [Value::Parameter(port), Value::Literal(15)])
            }
            Producer::Previous(input) => operation('^', [values[input].clone(), Value::Literal(1)]),
            Producer::Pair(left, right) => {
                operation('^', [values[left].clone(), values[right].clone()])
            }
        };
        values.push(value);
    }
    format!("{:?},{:?}", values[roots[0]], values[roots[1]])
}

fn source(nodes: &[Producer], roots: [usize; 2], order: &[usize], raw: bool) -> String {
    let names: Vec<_> = (0..nodes.len())
        .map(|node| {
            if raw {
                ["r#type", "r#match", "r#loop"][node].to_owned()
            } else {
                format!("value{}", nodes.len() - node)
            }
        })
        .collect();
    let mut source = "fn compute(first: u32, second: u32) -> (u32, u32) {".to_owned();
    for &node in order {
        let expression = match nodes[node] {
            Producer::Argument(port) => {
                format!("{} & 15u32", ["first", "second"][port])
            }
            Producer::Previous(input) => format!("{} ^ 1u32", names[input]),
            Producer::Pair(left, right) => format!("{} ^ {}", names[left], names[right]),
        };
        write!(source, "let {} = {expression};", names[node]).unwrap();
    }
    write!(source, "({}, {}) }}", names[roots[0]], names[roots[1]]).unwrap();
    source
}

#[test]
fn all_small_legal_schedules_and_renamings_match_the_independent_graph_oracle() {
    let mut forms_by_graph = BTreeMap::<String, String>::new();
    let mut graphs_by_form = BTreeMap::<String, String>::new();
    for n in 1..=3 {
        let orders = permutations(n);
        for nodes in models(n) {
            for first in 0..n {
                for second in 0..n {
                    let roots = [first, second];
                    let graph = oracle(&nodes, roots);
                    for order in &orders {
                        if order.iter().any(|&node| match nodes[node] {
                            Producer::Previous(input) => {
                                number(order, input) >= number(order, node)
                            }
                            Producer::Pair(left, right) => {
                                number(order, left) >= number(order, node)
                                    || number(order, right) >= number(order, node)
                            }
                            Producer::Argument(_) => false,
                        }) {
                            continue;
                        }
                        for raw in [false, true] {
                            let source = source(&nodes, roots, order, raw);
                            let form = syn_canon::canonicalize(syn::parse_str(&source).unwrap())
                                .to_string();
                            if let Some(existing) = forms_by_graph.get(&graph) {
                                assert_eq!(existing, &form, "legal schedule {source}");
                            } else {
                                forms_by_graph.insert(graph.clone(), form.clone());
                            }
                            if let Some(existing) = graphs_by_form.get(&form) {
                                assert_eq!(existing, &graph, "distinct graph {source}");
                            } else {
                                graphs_by_form.insert(form, graph.clone());
                            }
                        }
                    }
                }
            }
        }
    }
}