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
use crate::cursor::{Cursor, CursorMut}; use std::ops::Div; use crate::dfs_iter::{DfsIter, DfsIterMut}; use crate::bfs_iter::{BfsIter, BfsIterMut}; 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 dfs_iter(&self) -> DfsIter<'_,T> { DfsIter{ stack: vec![self] } } pub fn dfs_iter_mut(&mut self) -> DfsIterMut<'_,T> { DfsIterMut{ stack: vec![self] } } pub fn bfs_iter(&self) -> BfsIter<'_,T>{ let mut v = VecDeque::new(); v.push_back(self); BfsIter{ queue: v } } pub fn bfs_iter_mut(&mut self) -> BfsIterMut<'_,T>{ let mut v = VecDeque::new(); v.push_back(self); BfsIterMut{ 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)}; }