prop_countConsumed (Positive (min (2^10) -> n)) (Positive (min (2^20) -> a)) (Positive k) =
            runner1 (enumPureNChunk [1..] n iter) == (a, a)
  where
    iter = countConsumed . joinI $ (takeUpTo (a + k) ><> Iter.take a) Iter.last

-- ---------------------------------------------
-- Nested Iteratees

-- take, mapStream, convStream, and takeR
prop_countConsumed (Positive (min (2^10) -> n)) (Positive (min (2^20) -> a)) (Positive k) =
            runner1 (enumPureNChunk [1..] n iter) == (a, a)
  where
    iter = countConsumed . joinI $ (takeUpTo (a + k) ><> Iter.take a) Iter.last

-- ---------------------------------------------
-- Nested Iteratees

-- take, mapStream, convStream, and takeR
prop_countConsumed (Positive (min (2^10) -> n)) (Positive (min (2^20) -> a)) (Positive k) =
            runner1 (enumPureNChunk [1..] n iter) == (a, a)
  where
    iter = countConsumed . joinI $ (takeUpTo (a + k) ><> Iter.take a) Iter.last

-- ---------------------------------------------
-- Nested Iteratees

-- take, mapStream, convStream, and takeR