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

use std::sync::Arc;

use super::{DedupOperation, Dedups, InTupleFnOutVec, SplitIterZip};
use crate::{
    normalized_actions::NormalizedAction, ActionSplit, BlockTree, FilterMapTree, FilterTree,
    IntoZip, MergeIter,
};

impl<T: Sized + Iterator, V: NormalizedAction> TreeBase<V> for T {}

pub trait TreeIter<V: NormalizedAction> {
    fn tree(&self) -> Arc<BlockTree<V>>;
}

#[derive(Clone)]
pub struct TreeIterator<V: NormalizedAction, I: Iterator> {
    tree: Arc<BlockTree<V>>,
    iter: I,
}

impl<I: Iterator, V: NormalizedAction> TreeIterator<V, I> {
    pub fn new(tree: Arc<BlockTree<V>>, iter: I) -> Self {
        Self { tree, iter }
    }
}

impl<I: Iterator, V: NormalizedAction> TreeIter<V> for TreeIterator<V, I> {
    fn tree(&self) -> Arc<BlockTree<V>> {
        self.tree.clone()
    }
}

impl<I: Iterator, V: NormalizedAction> Iterator for TreeIterator<V, I> {
    type Item = I::Item;

    fn next(&mut self) -> Option<Self::Item> {
        self.iter.next()
    }
}

/// Base functionality for TreeIter, These are almost all setup or internal
/// tools used to deal with complexity.
pub trait TreeBase<V: NormalizedAction>: Iterator {
    fn dedup<'a, KS, RS, FromI, Out, Zip>(
        self,
        parent_actions: KS,
        possible_prune_actions: RS,
    ) -> TreeIterator<V, Out>
    where
        Self: Sized + DedupOperation<'a, FromI, Out, V, Self::Item, Zip> + 'a + TreeIter<V>,
        Out: Iterator,
        V: NormalizedAction + 'a,
        KS: 'a,
        RS: 'a,
        Self: TreeIter<V>,
        FromI: IntoZip<Zip>,
        KS: InTupleFnOutVec<V>,
        RS: InTupleFnOutVec<V>,
        <KS as InTupleFnOutVec<V>>::Out: Dedups<V, RS::Out, FromI, Zip>,
        std::vec::IntoIter<V>: ActionSplit<KS::Out, KS, V> + ActionSplit<RS::Out, RS, V>,
        Zip: SplitIterZip<std::vec::IntoIter<V>>,
    {
        let tree = self.tree();
        TreeIterator::new(tree, DedupOperation::dedup(self, parent_actions, possible_prune_actions))
    }

    fn t_full_map<R, F>(self, f: F) -> R
    where
        Self: Sized + TreeIter<V>,
        F: FnMut((Arc<BlockTree<V>>, Self)) -> R,
    {
        let tree = self.tree();
        Iterator::map(std::iter::once((tree, self)), f)
            .next()
            .unwrap()
    }

    fn full_map<R, F>(self, f: F) -> R
    where
        Self: Sized + TreeIter<V>,
        F: FnMut(Self) -> R,
    {
        Iterator::map(std::iter::once(self), f).next().unwrap()
    }

    fn t_full_filter_map<R, F>(self, f: F) -> Option<R>
    where
        Self: Sized + TreeIter<V>,
        F: FnMut((Arc<BlockTree<V>>, Self)) -> Option<R>,
    {
        let tree = self.tree();
        Iterator::filter_map(std::iter::once((tree, self)), f).next()
    }

    fn t_map<R, F>(self, f: F) -> TreeIterator<V, std::iter::Map<Self, F>>
    where
        Self: Sized + TreeIter<V>,
        F: FnMut(Self::Item) -> R,
    {
        let tree = self.tree();
        TreeIterator::new(tree, Iterator::map(self, f))
    }

    fn t_full_filter<F>(self, f: F) -> Option<Self>
    where
        Self: Sized + TreeIter<V>,
        F: FnMut(Arc<BlockTree<V>>, &Self) -> bool,
    {
        let tree = self.tree();
        FilterTree { tree, iter: std::iter::once(self), f }.next()
    }

    fn t_filter<F>(self, f: F) -> TreeIterator<V, FilterTree<V, Self, F>>
    where
        Self: Sized + TreeIter<V>,
        F: for<'a> FnMut(Arc<BlockTree<V>>, &Self::Item) -> bool,
    {
        let tree = self.tree();
        TreeIterator::new(tree.clone(), FilterTree { tree, iter: self, f })
    }

    fn t_filter_map<R, F>(self, f: F) -> TreeIterator<V, FilterMapTree<V, Self, F>>
    where
        Self: Sized + TreeIter<V>,
        F: FnMut(Arc<BlockTree<V>>, Self::Item) -> Option<R>,
    {
        let tree = self.tree();
        TreeIterator::new(tree.clone(), FilterMapTree { tree, iter: self, f })
    }

    fn tree_zip_with<O>(self, other: O) -> TreeIterator<V, Self::Out>
    where
        Self: SplitIterZip<O> + Sized + TreeIter<V>,
        O: Iterator,
    {
        let tree = self.tree();
        TreeIterator::new(tree, SplitIterZip::<O>::zip_with_inner(self, other))
    }

    fn zip_with<O>(self, other: O) -> Self::Out
    where
        Self: SplitIterZip<O> + Sized,
        O: Iterator,
    {
        SplitIterZip::<O>::zip_with_inner(self, other)
    }

    /// Merges the iterator into type O.
    fn merge_iter<O, B>(self) -> TreeIterator<V, B>
    where
        Self: Sized + MergeIter<O, B> + TreeIter<V>,
        B: Iterator<Item = O>,
    {
        let tree = self.tree();
        TreeIterator::new(tree, MergeIter::merge_iter(self))
    }

    fn split_into_actions<FromI, Fns, Out>(self, fns: Fns) -> TreeIterator<V, Out>
    where
        Self: Sized + Iterator + TreeIter<V> + ActionSplit<FromI, Fns, V>,
        Out: Iterator,
        FromI: IntoZip<Out>,
    {
        let tree = self.tree();
        TreeIterator::new(tree, ActionSplit::action_split_impl(self, fns).into_zip())
    }
}