windows-bindgen 0.66.0

Code generator for Windows metadata
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

use super::*;

// This uses BTree rather than Hash as we're getting close to writing the tokens in sorted order.
#[derive(Debug)]
pub struct TypeTree {
    pub namespace: &'static str,
    pub nested: BTreeMap<&'static str, Self>,
    pub types: BTreeSet<Type>,
}

impl TypeTree {
    pub fn new(dependencies: &TypeMap) -> Self {
        let mut tree = Self::with_namespace("");

        for (tn, types) in dependencies.iter() {
            let tree = tree.insert_namespace(tn.namespace());
            types.iter().for_each(|ty| {
                tree.types.insert(ty.clone());
            });
        }

        tree
    }

    // This is used to provide a flat iterator of trees so that they can be processed in parallel.
    pub fn flatten_trees(&self) -> Vec<&Self> {
        let mut flatten = if self.namespace.is_empty() {
            vec![]
        } else {
            vec![self]
        };
        flatten.extend(self.nested.values().flat_map(|tree| tree.flatten_trees()));
        flatten
    }

    // This is used to actually remove the tree structure and just have a flat iterator or types
    // that just happen to be sorted, thanks to BTreeSet, so that a flat list of types can be
    // generated in sort order.
    pub fn flatten_types(mut self) -> BTreeSet<Type> {
        fn flatten(set: &mut BTreeSet<Type>, tree: &mut TypeTree) {
            set.append(&mut tree.types);

            for tree in tree.nested.values_mut() {
                flatten(set, tree);
            }
        }

        let mut types = BTreeSet::new();
        flatten(&mut types, &mut self);
        types
    }

    pub fn feature(&self) -> String {
        self.namespace.split_once('.').unwrap().1.replace('.', "_")
    }

    fn with_namespace(namespace: &'static str) -> Self {
        Self {
            namespace,
            nested: BTreeMap::new(),
            types: BTreeSet::new(),
        }
    }

    fn insert_namespace(&mut self, namespace: &'static str) -> &mut Self {
        fn insert_namespace<'a>(
            parent: &'a mut TypeTree,
            namespace: &'static str,
            pos: usize,
        ) -> &'a mut TypeTree {
            if let Some(next) = namespace[pos..].find('.') {
                let next = pos + next;

                let parent = parent
                    .nested
                    .entry(&namespace[pos..next])
                    .or_insert_with(|| TypeTree::with_namespace(&namespace[..next]));

                insert_namespace(parent, namespace, next + 1)
            } else {
                parent
                    .nested
                    .entry(&namespace[pos..])
                    .or_insert_with(|| TypeTree::with_namespace(namespace))
            }
        }

        if namespace.is_empty() {
            self
        } else {
            insert_namespace(self, namespace, 0)
        }
    }
}