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

#![allow(dead_code)]

use std::ops::{Index, IndexMut};
use super::Ptr; 


#[derive(Copy, Clone,Default)]
pub struct BinNode<T> {
    pub data: Option<T>,
    pub parent: Ptr,
    pub children: [Ptr; 2],
}
impl<T> BinNode<T> {
    pub fn new() -> Self {
        Self {
            data: None,
            parent: Ptr::null(),
            children: [Ptr::null(); 2],
        }
    }

    pub fn is_leaf(&self) -> bool {
        self.children[0] == Ptr::null() && self.children[1] == Ptr::null()
    }

    pub fn from_data(data: T) -> Self {
        Self {
            data: Some(data),
            parent: Ptr::null(),
            children: [Ptr::null(); 2],
        }
    }

    pub fn with_parent(mut self, parent: Ptr) -> Self {
        self.parent = parent;
        self
    }
}


#[derive(Default)]
pub struct BinaryTree<T> {
    root: Ptr,
    node: Vec<BinNode<T>>,
    pool: Ptr,
}

impl<T> BinaryTree<T> {

    pub fn new() -> Self {
        Self {
            root: Ptr::null(),
            node: Vec::new(),
            pool: Ptr::null(),
        }
    }
    pub fn nodes(&self)->&[BinNode<T>]{
        self.node.as_slice()
    }

    pub fn root(&self) -> Ptr {
        self.root
    }
    pub fn set_root(&mut self, root: Ptr) {
        self.root = root;
    }

    pub fn allocate(&mut self, parent: Ptr, item: T) -> Ptr {
        if self.pool == Ptr::null() {
            self.node.push(BinNode::from_data(item).with_parent(parent));
            Ptr::from(self.node.len() - 1)
        } else {
            let old_pool = self.pool;
            let new_node = self[old_pool].children[0];

            //initalize node
            self[old_pool].children = [Ptr::null(); 2];
            self[old_pool].parent = parent;
            self[old_pool].data = Some(item);

            //update pool pointer
            self.pool = new_node;

            old_pool
        }
    }

    pub fn free(&mut self, ptr: Ptr) -> Option<T> {
        let data = self[ptr].data.take();
        self[ptr].parent = Ptr::null();
        self[ptr].children = [self.pool, Ptr::null()];
        self.pool = ptr;
        data
    }
}
impl<T> Index<Ptr> for BinaryTree<T> {
    type Output = BinNode<T>;
    fn index(&self, index: Ptr) -> &Self::Output {
        &self.node[index.idx as usize]
    }
}
impl<T> IndexMut<Ptr> for BinaryTree<T> {
    fn index_mut(&mut self, index: Ptr) -> &mut Self::Output {
        &mut self.node[index.idx as usize]
    }
}