fluffl 0.0.5

A cross-platform multimedia layer that exposes opengl,sockets,and audio utilities for desktop and browser
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
139
140
141
142
143
144
145
146
147
148
149

use std::cmp::Ordering;

use super::*;
use crate::mem;

#[derive(Copy, Clone, Debug)]
pub enum StackSignal {
    Push,
    ///pop `n`  times
    Pop {
        n_times: usize,
    },
    Nop,
}

/// Iterates through the list but also tells you how many times you should push or pop from your stack
pub struct StackSignalIterator<'a, T> {
    tree: &'a LinearTree<T>,
    covered_root: bool,
    cur_node: usize,
    node_len: usize,
}
impl<'a, T> StackSignalIterator<'a, T> {
    pub fn new(tree: &'a LinearTree<T>) -> Self {
        let len = tree.len();
        Self {
            tree,
            covered_root: false,
            cur_node: 1,
            node_len: len,
        }
    }
}
impl<'a, T> Iterator for StackSignalIterator<'a, T> {
    type Item = (StackSignal, NodeID, &'a T);

    fn next(&mut self) -> Option<Self::Item> {
        let tree = self.tree;

        if !self.covered_root {
            self.covered_root = true;

            return Some(StackSignal::Nop)
                .zip(tree.node_id.get(0).zip(tree.data.get(0)))
                .map(|(ss, (&nid, data))| (ss, nid, unsafe { data.assume_init_ref() }));
            // return Some((StackSignal::Nop, tree.node_id[0], unsafe {
            //     tree.data[0].assume_init_ref()
            // }));
        }

        let level = &tree.level;
        let data = &tree.data;
        let node_len = self.node_len;
        let cur_node_ref = &mut self.cur_node;

        let cur_node = *cur_node_ref;

        (cur_node < node_len).then(move || {
            *cur_node_ref += 1;
            let cur_level = level[cur_node];
            let diff = cur_level as isize - level[cur_node - 1] as isize;

            let signal = match diff.cmp(&0) {
                Ordering::Equal => StackSignal::Nop,
                Ordering::Greater => StackSignal::Push,
                Ordering::Less => StackSignal::Pop {
                    n_times: diff.unsigned_abs(),
                },
            };

            // let signal = if diff == 0 {
            //     StackSignal::Nop
            // } else if diff > 0 {
            //     StackSignal::Push
            // } else {
            //     StackSignal::Pop {
            //         n_times: diff.abs() as usize,
            //     }
            // };

            (signal, tree.node_id[cur_node], unsafe {
                data[cur_node].assume_init_ref()
            })
        })
    }
}

/// Iterates through the list but also tells you how many times you should push or pop from your stack
pub struct StackSignalIteratorMut<'a, T> {
    tree: &'a mut LinearTree<T>,
    covered_root: bool,
    cur_node: usize,
    node_len: usize,
}
impl<'a, T> StackSignalIteratorMut<'a, T> {
    pub fn new(tree: &'a mut LinearTree<T>) -> Self {
        let len = tree.len();
        Self {
            tree,
            covered_root: false,
            cur_node: 1,
            node_len: len,
        }
    }
}
impl<'a, T> Iterator for StackSignalIteratorMut<'a, T> {
    type Item = (StackSignal, NodeID, &'a mut T);

    fn next(&mut self) -> Option<Self::Item> {
        //allows me to split-borrow the tree
        let tree = unsafe { mem::force_borrow_mut(self.tree) };

        if !self.covered_root {
            self.covered_root = true;
            return Some(StackSignal::Nop)
                .zip(tree.node_id.get(0).copied().zip(tree.data.get_mut(0)))
                .map(|(ss, (nid, data))| (ss, nid, unsafe { data.assume_init_mut() }));
            // return Some((StackSignal::Nop, tree.node_id[0], unsafe {
            //     tree.data[0].assume_init_mut()
            // }));
        }

        let level = &mut tree.level;
        let data = &mut tree.data;
        let node_id = &mut tree.node_id;

        let node_len = self.node_len;
        let cur_node_ref = &mut self.cur_node;
        let cur_node = *cur_node_ref;

        (cur_node < node_len).then(move || {
            *cur_node_ref += 1;
            let cur_level = level[cur_node];
            let diff = cur_level as isize - level[cur_node - 1] as isize;

            let signal = match diff.cmp(&0) {
                Ordering::Equal => StackSignal::Nop,
                Ordering::Greater => StackSignal::Push,
                Ordering::Less => StackSignal::Pop {
                    n_times: diff.unsigned_abs(),
                },
            };

            (signal, node_id[cur_node], unsafe {
                data[cur_node].assume_init_mut()
            })
        })
    }
}