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 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303
#[ cfg( not( feature = "no_std" ) ) ]
pub( crate ) mod private
{
use ::itertools::process_results;
use clone_dyn_types::CloneDyn;
/// Trait that encapsulates an iterator with specific characteristics and implemetning `CloneDyn`.
///
/// The `_IterTrait` trait is designed to represent iterators that may yield references to items ( `&'a T` ).
/// These iterators must also implement the `ExactSizeIterator` and `DoubleEndedIterator` traits.
/// This combination ensures that the iterator can:
/// - Provide an exact size hint ( `ExactSizeIterator` ),
/// - Be traversed from both ends ( `DoubleEndedIterator` ).
///
/// Additionally, the iterator must implement the `CloneDyn` trait, which allows cloning of trait objects.
///
/// # Example
/// ```rust
/// use iter_tools::_IterTrait;
///
/// // Example struct that implements Iterator, ExactSizeIterator, DoubleEndedIterator, and CloneDyn.
/// #[ derive( Clone ) ]
/// struct MyIterator
/// {
/// // internal fields
/// }
///
/// impl Iterator for MyIterator
/// {
/// type Item = i32;
///
/// fn next( &mut self ) -> Option< Self::Item >
/// {
/// // implementation
/// Some( 1 )
/// }
/// }
///
/// impl ExactSizeIterator for MyIterator
/// {
/// fn len( &self ) -> usize
/// {
/// // implementation
/// 1
/// }
/// }
///
/// impl DoubleEndedIterator for MyIterator
/// {
/// fn next_back( &mut self ) -> Option< Self::Item >
/// {
/// // implementation
/// Some( 1 )
/// }
/// }
///
/// ```
pub trait _IterTrait< 'a, T >
where
T : 'a,
Self : Iterator< Item = T > + ExactSizeIterator< Item = T > + DoubleEndedIterator,
Self : CloneDyn,
{
}
impl< 'a, T, I > _IterTrait< 'a, T > for I
where
T : 'a,
Self : Iterator< Item = T > + ExactSizeIterator< Item = T > + DoubleEndedIterator,
Self : CloneDyn,
{
}
/// Trait that encapsulates a clonable iterator with specific characteristics, tailored for use with the `syn` crate.
///
/// The `IterTrait` trait is designed to represent iterators that may yield references to items ( `&'a T` ) within the `syn` crate.
/// These iterators must also implement the `ExactSizeIterator`, `DoubleEndedIterator`, and `Clone` traits.
/// This combination ensures that the iterator can:
/// - Provide an exact size hint ( `ExactSizeIterator` ),
/// - Be traversed from both ends ( `DoubleEndedIterator` ),
/// - Be clonable ( `Clone` ).
///
pub trait IterTrait< 'a, T >
where
T : 'a,
Self : _IterTrait< 'a, T > + Clone,
{
}
impl< 'a, T, I > IterTrait< 'a, T > for I
where
T : 'a,
Self : _IterTrait< 'a, T > + Clone,
{
}
/// Implement `Clone` for boxed `_IterTrait` trait objects.
///
/// This allows cloning of boxed iterators that implement `_IterTrait`.
#[ allow( non_local_definitions ) ]
impl< 'c, T > Clone for Box< dyn _IterTrait< 'c, T > + 'c >
{
#[ inline ]
fn clone( &self ) -> Self
{
clone_dyn_types::clone_into_box( &**self )
}
}
#[ allow( non_local_definitions ) ]
impl< 'c, T > Clone for Box< dyn _IterTrait< 'c, T > + Send + 'c >
{
#[ inline ]
fn clone( &self ) -> Self
{
clone_dyn_types::clone_into_box( &**self )
}
}
#[ allow( non_local_definitions ) ]
impl< 'c, T > Clone for Box< dyn _IterTrait< 'c, T > + Sync + 'c >
{
#[ inline ]
fn clone( &self ) -> Self
{
clone_dyn_types::clone_into_box( &**self )
}
}
#[ allow( non_local_definitions ) ]
impl< 'c, T > Clone for Box< dyn _IterTrait< 'c, T > + Send + Sync + 'c >
{
#[ inline ]
fn clone( &self ) -> Self
{
clone_dyn_types::clone_into_box( &**self )
}
}
/// Type alias for boxed `_IterTrait` trait objects.
///
/// Prefer `BoxedIter` over `impl _IterTrait` when using trait objects ( `dyn _IterTrait` ) because the concrete type in return is less restrictive than `impl _IterTrait`.
///
pub type BoxedIter< 'a, T > = Box< dyn _IterTrait< 'a, T > + 'a >;
/// Extension of iterator.
// xxx : review
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,
F : FnMut( < Self as core::iter::Iterator >::Item ) -> core::result::Result< El, RE >,
RE : core::fmt::Debug,
;
}
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,
{
let vars_maybe = self.map( f );
let vars : Vec< _ > = process_results( vars_maybe, | iter | iter.collect() )?;
Ok( vars )
}
}
}
#[ 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::*;
#[ 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,
Itertools,
};
#[ cfg( not( feature = "no_std" ) ) ]
#[ doc( inline ) ]
#[ allow( unused_imports ) ]
pub use std::iter::zip;
}
/// Exposed namespace of the module.
#[ allow( unused_imports ) ]
pub mod exposed
{
use super::*;
#[ doc( inline ) ]
#[ allow( unused_imports ) ]
pub use super::prelude::*;
#[ doc( inline ) ]
#[ allow( unused_imports ) ]
pub use super::private::
{
_IterTrait,
IterTrait,
BoxedIter,
};
}
/// 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,
PeekingNext,
};
#[ doc( inline ) ]
#[ allow( unused_imports ) ]
#[ cfg( not( feature = "no_std" ) ) ]
pub use super::private::IterExt;
}