xan 0.57.1

The CSV magician
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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204

// use crate::collections::{hash_map::Entry, HashMap};
// use std::hash::Hash;

#[derive(Debug)]
pub struct UnionFindEntry {
    pub parent: usize,
    pub size: usize,
}

#[derive(Debug)]
pub struct UnionFind {
    entries: Vec<UnionFindEntry>,
}

impl UnionFind {
    // pub fn new() -> Self {
    //     Self {
    //         entries: Vec::new(),
    //     }
    // }

    pub fn with_capacity(capacity: usize) -> Self {
        let mut entries = Vec::new();

        for i in 0..capacity {
            entries.push(UnionFindEntry { parent: i, size: 1 });
        }

        Self { entries }
    }

    // pub fn make_set(&mut self) -> usize {
    //     let i = self.entries.len();

    //     self.entries.push(UnionFindEntry { parent: i, size: 1 });

    //     i
    // }

    pub fn find(&self, x: usize) -> usize {
        let mut root = x;

        loop {
            let parent = self.entries[root].parent;

            if parent == root {
                break;
            }

            root = parent;
        }

        root
    }

    fn find_mut(&mut self, mut x: usize) -> usize {
        let mut root = x;

        loop {
            let parent = self.entries[root].parent;

            if parent == root {
                break;
            }

            root = parent;
        }

        // Path compression
        loop {
            let entry = &mut self.entries[x];

            if entry.parent == root {
                break;
            }

            let parent = entry.parent;
            entry.parent = root;
            x = parent;
        }

        root
    }

    pub fn union(&mut self, mut x: usize, mut y: usize) {
        x = self.find_mut(x);
        y = self.find_mut(y);

        if x == y {
            return;
        }

        let x_size = self.entries[x].size;
        let y_size = self.entries[y].size;

        if x_size > y_size {
            self.entries[y].parent = x;
            self.entries[x].size += y_size;
        } else {
            self.entries[x].parent = y;
            self.entries[y].size += x_size;
        }
    }

    pub fn leaders(&self) -> impl Iterator<Item = &UnionFindEntry> {
        self.entries.iter().enumerate().filter_map(|(i, entry)| {
            if i != entry.parent {
                None
            } else {
                Some(entry)
            }
        })
    }

    pub fn largest(&self) -> Option<usize> {
        let mut max: Option<&UnionFindEntry> = None;

        for entry in self.leaders() {
            match max {
                None => {
                    max = Some(entry);
                }
                Some(current_entry) => {
                    if entry.size > current_entry.size {
                        max = Some(entry);
                    }
                }
            }
        }

        max.map(|entry| entry.parent)
    }

    pub fn size(&self, index: usize) -> usize {
        let entry = &self.entries[index];
        debug_assert!(entry.parent == index);
        entry.size
    }

    pub fn sizes(&self) -> impl Iterator<Item = usize> + '_ {
        self.leaders().map(|entry| entry.size)
    }
}

// #[derive(Debug)]
// pub struct UnionFindMap<K: Hash + Eq> {
//     inner: UnionFind,
//     map: HashMap<K, usize>,
// }

// impl<K: Hash + Eq> UnionFindMap<K> {
//     pub fn new() -> Self {
//         Self {
//             inner: UnionFind::new(),
//             map: HashMap::new(),
//         }
//     }

//     pub fn len(&self) -> usize {
//         self.map.len()
//     }

//     pub fn is_empty(&self) -> bool {
//         self.len() == 0
//     }

//     fn get(&mut self, node: K) -> usize {
//         match self.map.entry(node) {
//             Entry::Occupied(entry) => *entry.get(),
//             Entry::Vacant(entry) => *entry.insert(self.inner.make_set()),
//         }
//     }

//     pub fn union(&mut self, source: K, target: K) {
//         let x = self.get(source);
//         let y = self.get(target);

//         self.inner.union(x, y);
//     }

//     pub fn nodes(self) -> impl Iterator<Item = (K, usize)> {
//         self.map.into_iter().map(move |(node, i)| {
//             let label = self.inner.find(i);

//             (node, label)
//         })
//     }

//     pub fn largest_component(self) -> impl Iterator<Item = K> {
//         let largest = self.inner.largest().unwrap();

//         self.map.into_iter().flat_map(move |(node, i)| {
//             if self.inner.find(i) == largest {
//                 Some(node)
//             } else {
//                 None
//             }
//         })
//     }

//     pub fn sizes(&self) -> impl Iterator<Item = usize> + '_ {
//         self.inner.sizes()
//     }
// }