karo 0.1.2

Spreadsheet export
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

use std::cell::RefCell;
use std::collections::BTreeSet;
use std::rc::Rc;

#[derive(Default, Clone)]
pub(crate) struct WorkbookSheetProperties {
    inner: Rc<RefCell<Inner>>,
}

impl WorkbookSheetProperties {
    pub(crate) fn set_selected(&mut self, index: usize, selected: bool) {
        self.inner.borrow_mut().set_selected(index, selected);
    }

    pub(crate) fn selected(&self, index: usize) -> bool {
        self.inner.borrow().selected(index)
    }

    pub(crate) fn set_hidden(&mut self, index: usize, hidden: bool) {
        self.inner.borrow_mut().set_hidden(index, hidden);
    }

    pub(crate) fn hidden(&self, index: usize) -> bool {
        self.inner.borrow().hidden(index)
    }

    pub(crate) fn set_active(&self, index: usize) {
        self.inner.borrow_mut().set_active(index)
    }

    pub(crate) fn active(&self, index: usize) -> bool {
        self.inner.borrow().active(index)
    }
}

#[derive(Default)]
struct Inner {
    active: Option<usize>,
    selected: BTreeSet<usize>,
    hidden: BTreeSet<usize>,
    count: usize,
}

impl Inner {
    fn set_selected(&mut self, index: usize, selected: bool) {
        if selected {
            self.selected.insert(index);
        } else {
            self.selected.remove(&index);
        }
    }

    fn selected(&self, index: usize) -> bool {
        if self.selected.is_empty() {
            self.automatic_active() == index
        } else {
            self.selected.contains(&index)
        }
    }

    fn set_hidden(&mut self, index: usize, hidden: bool) {
        if hidden {
            self.hidden.insert(index);
        } else {
            self.hidden.remove(&index);
        }
    }

    fn hidden(&self, index: usize) -> bool {
        self.hidden.contains(&index)
            && !self.selected(index)
            && !self.active(index)
    }

    fn active(&self, index: usize) -> bool {
        match self.active {
            Some(i) if i == index => true,
            Some(_) => false,
            None if index == self.automatic_active() => true,
            None => false,
        }
    }

    fn set_active(&mut self, index: usize) {
        self.active = Some(index);
    }

    fn automatic_active(&self) -> usize {
        if let Some(i) = self.active {
            i
        } else {
            // none was selected yet, so we'll find the first that
            // is not hidden.
            for i in 0usize..self.count {
                if !self.hidden.contains(&i) {
                    return i;
                }
            }
            // all sheets are hidden, so the first one is interpreted
            // as active, it will be unhidden automatically.
            0usize
        }
    }
}