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


#[ cfg( not( feature = "no_std" ) ) ]
pub( crate ) mod private
{
  use ::itertools::process_results;

  // fn collect_results< I, T, E >( iter : I ) -> core::result::Result< Vec< T >, E >
  // where
  //   I : Iterator< Item = core::result::Result< T, E > > + Clone,
  //   E : core::fmt::Debug,
  // {
  //   for e in iter.clone()
  //   {
  //     if e.is_err()
  //     {
  //       e?;
  //     }
  //   }
  //   Ok( iter.map( | e | e.unwrap() ).collect() )
  // }

  /// Extension of iterator.

  pub trait IterExt
  where
    Self : core::iter::Iterator,
  {
    /// Iterate each element and return `core::Result::Err` if any element is error.
    fn map_result< F, RE, El >( self, f : F ) -> core::result::Result< Vec< El >, RE >
    where
      Self : Sized + Clone,
      // Self : Sized,
      F : FnMut( < Self as core::iter::Iterator >::Item ) -> core::result::Result< El, RE >,
      RE : core::fmt::Debug,
      // El : Clone,
      // core::result::Result< El, RE > : Clone,
    ;
  }

  impl< Iterator > IterExt for Iterator
  where
    Iterator : core::iter::Iterator,
  {
    fn map_result< F, RE, El >( self, f : F ) -> core::result::Result< Vec< El >, RE >
    where
      Self : Sized + Clone,
      F : FnMut( < Self as core::iter::Iterator >::Item ) -> core::result::Result< El, RE >,
      RE : core::fmt::Debug,
      // El : Clone,
      // core::result::Result< El, RE > : Clone,
    {
      let vars_maybe = self.map( f );
      let vars : Vec< _ > = process_results( vars_maybe, | iter | iter.collect() )?;
      // let vars = collect_results( vars_maybe.clone() )?;
      Ok( vars )
      // let result : ( Vec< _ >, Vec< _ >, Vec< _ > )
      // = vars.into_iter().multiunzip();
      // Ok( result )
    }
  }

}

#[ doc( inline ) ]
#[ allow( unused_imports ) ]
#[ cfg( feature = "enabled" ) ]
pub use protected::*;

/// Protected namespace of the module.
#[ cfg( feature = "enabled" ) ]
pub mod protected
{
  #[ doc( inline ) ]
  #[ allow( unused_imports ) ]
  pub use super::orphan::*;
}

/// Orphan namespace of the module.
#[ cfg( feature = "enabled" ) ]
pub mod orphan
{
  #[ doc( inline ) ]
  #[ allow( unused_imports ) ]
  pub use super::exposed::*;
}

/// Exposed namespace of the module.
pub mod exposed
{
  #[ doc( inline ) ]
  #[ allow( unused_imports ) ]
  pub use super::prelude::*;

  #[ doc( inline ) ]
  #[ allow( unused_imports ) ]
  pub use ::itertools::
  {
    all,
    any,
    assert_equal,
    chain,
    cloned,
    concat,
    cons_tuples,
    diff_with,
    enumerate,
    equal,
    fold,
    interleave,
    intersperse,
    intersperse_with,
    iterate,
    join,
    kmerge,
    kmerge_by,
    max,
    merge,
    merge_join_by,
    min,
    multipeek,
    multiunzip,
    multizip,
    partition,
    peek_nth,
    process_results,
    put_back,
    put_back_n,
    rciter,
    repeat_n,
    rev,
    sorted,
    unfold,
    // zip,
    zip_eq,
  };

  #[ cfg( not( feature = "no_std" ) ) ]
  #[ doc( inline ) ]
  #[ allow( unused_imports ) ]
  pub use std::iter::zip;

}

/// Prelude to use essentials: `use my_module::prelude::*`.
pub mod prelude
{

  #[ doc( inline ) ]
  #[ allow( unused_imports ) ]
  pub use ::itertools::
  {
    Diff,
    Either,
    EitherOrBoth,
    FoldWhile,
    MinMaxResult,
    Position,
    Itertools,
    /*MultiUnzip,*/
    PeekingNext,
  };

  #[ doc( inline ) ]
  #[ allow( unused_imports ) ]
  #[ cfg( not( feature = "no_std" ) ) ]
  pub use super::private::IterExt;

}