jungle 0.1.1

A fast, safe Tree Library in rust.
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

use generic_array::*;
use std::ops::Deref;
use std::ptr;

struct NodePointer<T,N>(*mut Node<T,N>) where N: ArrayLength<NodePointer<T, N>>;
impl<T,N> Copy for NodePointer<T,N> where N: ArrayLength<NodePointer<T, N>> {}
impl<T,N> Clone for NodePointer<T,N> where N: ArrayLength<NodePointer<T, N>> { fn clone(&self) -> NodePointer<T,N> { *self } }

impl<T,N> Default for NodePointer<T,N> 
	where N: ArrayLength<NodePointer<T, N>> {
	fn default() -> Self {
		NodePointer(ptr::null_mut())
	}
}

impl<T,N> Deref for NodePointer<T,N>
	where N: ArrayLength<NodePointer<T, N>> {
	type Target = Node<T,N>;

	fn deref(&self) -> &Node<T,N> {
		unsafe { &*self.0 }
	}
}

struct Node<T,N: ArrayLength<NodePointer<T,N>>> {
	value: T,
	parent: NodePointer<T,N>,
	children: GenericArray<NodePointer<T,N>,N>
}

impl<T,N> Node<T,N>
	where N: ArrayLength<NodePointer<T, N>> {
    fn new(value: T) -> Self{
    	Node {
    		value: value,
    		parent: NodePointer::default(),
    		children: GenericArray::new()
    	}
    }
}

struct Tree<T,N: ArrayLength<NodePointer<T,N>>>(NodePointer<T,N>);

impl<T,N> Tree<T,N>
	where N: ArrayLength<NodePointer<T, N>> {

	fn new(value: T) -> Self {
	    Tree(NodePointer(Box::into_raw(Box::new(Node::new(value)))))
	}

	fn parent(&mut self) -> bool{
		let parent = self.0.parent;
		if parent.0 == ptr::null_mut() {
			false
		} else {
		    self.0 = parent;
		    true
		}
	}

	fn child(&mut self, child: usize) -> bool {
		let child = self.0.children[child];
		if child.0 == ptr::null_mut() {
			false
		} else {
			self.0 = child;
			true
		}
	}
}