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
use crate::cursor::{Cursor, CursorMut};
use std::ops::Div;
use crate::df_iter::{DfIter, DfIterMut};
use crate::bf_iter::{BfIter, BfIterMut};
use std::collections::VecDeque;
pub struct Tree<T> {
pub (in crate) data : T,
pub (in crate) children : Vec<Tree<T>>,
}
impl<T> Tree<T>{
pub fn new(data : T) -> Tree<T> {
Tree{
data,
children : Vec::new()
}
}
pub fn add_child(&mut self,child : Tree<T>){
self.children.push(child);
}
pub fn cursor(&self) -> Cursor<'_,T>{
Cursor {
root: &self,
parents: vec![],
now: &self,
}
}
pub fn cursor_mut(&mut self) -> CursorMut<'_,T>{
CursorMut{
root: self as *mut _,
parents: vec![],
now: self as *mut _,
_marker: Default::default()
}
}
pub fn df_iter(&self) -> DfIter<'_,T> {
DfIter {
stack: vec![self]
}
}
pub fn df_iter_mut(&mut self) -> DfIterMut<'_,T> {
DfIterMut {
stack: vec![self]
}
}
pub fn bf_iter(&self) -> BfIter<'_,T>{
let mut v = VecDeque::new();
v.push_back(self);
BfIter {
queue: v
}
}
pub fn bf_iter_mut(&mut self) -> BfIterMut<'_,T>{
let mut v = VecDeque::new();
v.push_back(self);
BfIterMut {
queue: v
}
}
}
impl<T> Div for Tree<T> {
type Output = Tree<T>;
fn div(mut self, rhs: Self) -> Self::Output {
self.add_child(rhs);
self
}
}
#[macro_export]
macro_rules! tr {
($value:expr) => {Tree::new($value)};
}