trees 0.4.2

General purpose tree data structures
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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176

macro_rules! impl_debug_display_for_collection {
    ( $ty:ident, $($agent:tt)+ ) => {
        use crate::rust::{Debug, Display};

        impl<T:Debug> Debug for $ty<T> {
            fn fmt( &self, f: &mut Formatter ) -> fmt::Result { self.$($agent)+.fmt(f) }
        }

        impl<T:Display> Display for $ty<T> {
            fn fmt( &self, f: &mut Formatter ) -> fmt::Result { write!( f, "{}", self.$($agent)+ )}
        }
    };
}

macro_rules! impl_debug_display_for_forest {
    ( $ty:ident, $($agent:tt)+ ) => {
        use crate::rust::{Debug, Display};

        impl<T:Debug> Debug for $ty<T> {
            fn fmt( &self, f: &mut Formatter ) -> fmt::Result {
                if self.has_no_child() {
                    write!( f, "()" )
                } else {
                    write!( f, "( " )?;
                    for child in self.$($agent)+ {
                        child.fmt(f)?;
                        write!( f, " " )?;
                    }
                    write!( f, ")" )
                }
            }
        }

        impl<T:Display> Display for $ty<T> {
            fn fmt( &self, f: &mut Formatter ) -> fmt::Result {
                if self.has_no_child() {
                    write!( f, "()" )
                } else {
                    write!( f, "( " )?;
                    for child in self.$($agent)+ {
                        write!( f, "{} ", child )?;
                    }
                    write!( f, ")" )
                }
            }
        }
    };
}

macro_rules! impl_order_relations_for_collection {
    ( $ty:ident, $($agent:tt)+ ) => {
        impl<T:PartialEq> PartialEq for $ty<T> {
            fn eq( &self, other: &Self ) -> bool { self.$($agent)+.eq( other.$($agent)+ )}
            fn ne( &self, other: &Self ) -> bool { self.$($agent)+.ne( other.$($agent)+ )}
        }

        impl<T:Eq> Eq for $ty<T> {}

        impl<T:PartialOrd> PartialOrd for $ty<T> {
            fn partial_cmp( &self, other: &Self ) -> Option<Ordering> { self.$($agent)+.partial_cmp( other.$($agent)+ )}
        }

        impl<T:Ord> Ord for $ty<T> {
            fn cmp( &self, other: &Self ) -> Ordering { self.$($agent)+.cmp( other.$($agent)+ )}
        }
    };
}

macro_rules! impl_hash_for_collection {
    ( $ty:ident, $($agent:tt)+ ) => {
        use crate::rust::{Hash, Hasher};

        impl<T:Hash> Hash for $ty<T> {
            fn hash<H:Hasher>( &self, state: &mut H ) { self.$($agent)+.hash( state )}
        }
    };
}

macro_rules! impl_hash_for_forest {
    ( $ty:ident, $($agent:tt)+ ) => {
        use crate::rust::{Hash, Hasher};

        impl<T:Hash> Hash for $ty<T> {
            fn hash<H:Hasher>( &self, state: &mut H ) {
                for child in self.$($agent)+ {
                    child.hash( state )
                }
            }
        }
    };
}

macro_rules! impl_debug_display_for_node {
    ( $ty:ident, $iter:ident, $($data:tt)+ ) => {
        use crate::rust::{Debug, Display};

        impl<T:Debug> Debug for $ty<T> {
            fn fmt( &self, f: &mut Formatter ) -> fmt::Result {
                if self.has_no_child() {
                    self.$($data)+.fmt(f)?;
                    write!( f, "@{:?} ", self as *const _ )
                } else {
                    self.$($data)+.fmt(f)?;
                    write!( f, "@{:?} ", self as *const _ )?;
                    write!( f, "( " )?;
                    for child in self.$iter() {
                        child.fmt(f)?;
                    }
                    write!( f, ")" )
                }
            }
        }

        impl<T:Display> Display for $ty<T> {
            fn fmt( &self, f: &mut Formatter ) -> fmt::Result {
                if self.has_no_child() {
                    write!( f, "{}", self.$($data)+ )
                } else {
                    write!( f, "{}", self.$($data)+ )?;
                    write!( f, "( " )?;
                    for child in self.$iter() {
                        write!( f, "{} ", child )?;
                    }
                    write!( f, ")" )
                }
            }
        }
    };
}

macro_rules! impl_order_relations_for_node {
    ( $ty:ident, $iter:ident, $($data:tt)+ ) => {
        impl<T:PartialEq> PartialEq for $ty<T> {
            fn eq( &self, other: &Self ) -> bool { self.$($data)+ == other.$($data)+ && self.$iter().eq( other.$iter() )}
            fn ne( &self, other: &Self ) -> bool { self.$($data)+ != other.$($data)+ || self.$iter().ne( other.$iter() )}
        }

        impl<T:Eq> Eq for $ty<T> {}

        impl<T:PartialOrd> PartialOrd for $ty<T> {
            fn partial_cmp( &self, other: &Self ) -> Option<Ordering> {
                match self.$($data)+.partial_cmp( &other.$($data)+ ) {
                    None          => None,
                    Some( order ) => match order {
                        Less    => Some( Less ),
                        Greater => Some( Greater ),
                        Equal   => self.$iter().partial_cmp( other.$iter() ),
                    },
                }
            }
        }

        impl<T:Ord> Ord for $ty<T> {
            fn cmp( &self, other: &Self ) -> Ordering {
                match self.$($data)+.cmp( &other.$($data)+ ) {
                    Less    => Less,
                    Greater => Greater,
                    Equal   => self.$iter().cmp( other.$iter() ),
                }
            }
        }
    };
}

macro_rules! impl_hash_for_node {
    ( $ty:ident, $iter:ident, $($data:tt)+ ) => {
        impl<T:Hash> Hash for $ty<T> {
            fn hash<H:Hasher>( &self, state: &mut H ) {
                self.$($data)+.hash( state );
                for child in self.$iter() {
                    child.hash( state );
                }
            }
        }
    };
}