   /// Returns a `ChunksOfCountCollection<Self>` view presenting the elements in
   /// chunks with count of the given count parameter.
   ///
-  /// - Parameter count: The size of the chunks. If the count parameter is
+  /// - Parameter count: The size of the chunks. If the `count` parameter is
   ///   evenly divided by the count of the base `Collection` all the chunks will
   ///   have the count equals to size. Otherwise, the last chunk will contain
   ///   the remaining elements.

/// A collection that presents the elements of its base collection in
/// `SubSequence` chunks of any given count.
///
/// A `ChunksOfCountCollection` is a lazy view on the base Collection, but it
/// does not implicitly confer laziness on algorithms applied to its result. In
/// other words, for ordinary collections `c`:
///

    _ i: Index, _ distance: Int
  ) -> Int {
    if i == endIndex {
      let remainder = base.count % chunkCount
      // We have to take it into account when calculating offsets.
      if remainder != 0 {
        // Distance "minus" one (at this point distance is negative) because we
        // need to adjust for the last position that have a variadic (remainder)
        // number of elements.
        return ((distance + 1) * chunkCount) - remainder
      }
