 }
 
 
-/**
-  A stepwise (lazy-ish) implementation of the Knuth Shuffle (a.k.a. Fisher-Yates Shuffle),
-  using a sequence of indices for the input. Elements (indices) from
-  the input sequence are returned in a random order until exhaustion.
-*/
+/// A stepwise (lazy-ish) implementation of the Knuth Shuffle (a.k.a. Fisher-Yates Shuffle),
+/// using a sequence of indices for the input. Elements (indices) from
+/// the input sequence are returned in a random order until exhaustion.
 
 struct IndexShuffler<I: ForwardIndexType>: SequenceType, GeneratorType
 {

      // return the new random Index.
      return i[step]
    }

    return nil
  }

  func generate() -> IndexShuffler
  {
    return self
  }
}

  var i: [I]

  init<S: SequenceType where S.Generator.Element == I>(_ input: S)
  {
    self.init(Array(input))
  }
