@@ -253,16 +253,16 @@ macro_rules! iproduct {
253
253
$I
254
254
) ;
255
255
( @flatten $I: expr, $J: expr, $( $K: expr, ) * ) => (
256
- iproduct!( @flatten $crate:: cons_tuples( iproduct!( $I, $J) ) , $( $K, ) * )
256
+ $crate :: iproduct!( @flatten $crate:: cons_tuples( $crate :: iproduct!( $I, $J) ) , $( $K, ) * )
257
257
) ;
258
258
( $I: expr) => (
259
259
$crate:: __std_iter:: IntoIterator :: into_iter( $I)
260
260
) ;
261
261
( $I: expr, $J: expr) => (
262
- $crate:: Itertools :: cartesian_product( iproduct!( $I) , iproduct!( $J) )
262
+ $crate:: Itertools :: cartesian_product( $crate :: iproduct!( $I) , $crate :: iproduct!( $J) )
263
263
) ;
264
264
( $I: expr, $J: expr, $( $K: expr) ,+) => (
265
- iproduct!( @flatten iproduct!( $I, $J) , $( $K, ) +)
265
+ $crate :: iproduct!( @flatten $crate :: iproduct!( $I, $J) , $( $K, ) +)
266
266
) ;
267
267
}
268
268
@@ -313,7 +313,7 @@ macro_rules! izip {
313
313
314
314
// The "b" identifier is a different identifier on each recursion level thanks to hygiene.
315
315
( @closure $p: pat => ( $( $tup: tt) * ) , $_iter: expr $( , $tail: expr ) * ) => {
316
- izip!( @closure ( $p, b) => ( $( $tup) * , b ) $( , $tail ) * )
316
+ $crate :: izip!( @closure ( $p, b) => ( $( $tup) * , b ) $( , $tail ) * )
317
317
} ;
318
318
319
319
// unary
@@ -323,18 +323,18 @@ macro_rules! izip {
323
323
324
324
// binary
325
325
( $first: expr, $second: expr $( , ) * ) => {
326
- izip!( $first)
326
+ $crate :: izip!( $first)
327
327
. zip( $second)
328
328
} ;
329
329
330
330
// n-ary where n > 2
331
331
( $first: expr $( , $rest: expr ) * $( , ) * ) => {
332
- izip!( $first)
332
+ $crate :: izip!( $first)
333
333
$(
334
334
. zip( $rest)
335
335
) *
336
336
. map(
337
- izip!( @closure a => ( a) $( , $rest ) * )
337
+ $crate :: izip!( @closure a => ( a) $( , $rest ) * )
338
338
)
339
339
} ;
340
340
}
0 commit comments