Addressing review comments of #336

Author: DarkDimius

src/dotty/tools/dotc/transform/FullParameterization.scala

@@ -150,6 +150,8 @@ trait FullParameterization {
    *  fully parameterized method definition derived from `originalDef`, which
    *  has `derived` as symbol and `fullyParameterizedType(originalDef.symbol.info)`
    *  as info.
+   *  `abstractOverClass` defines weather the DefDef should abstract over type parameters
+   *  of class that contained original defDef
    */
   def fullyParameterizedDef(derived: TermSymbol, originalDef: DefDef, abstractOverClass: Boolean = true)(implicit ctx: Context): Tree =
     polyDefDef(derived, trefs => vrefss => {
@@ -216,7 +218,7 @@ trait FullParameterization {
     })
 
   /** A forwarder expression which calls `derived`, passing along
-   *  - the type parameters and enclosing class parameters of `originalDef`,
+   *  - if `abstractOverClass` the type parameters and enclosing class parameters of originalDef`,
    *  - the `this` of the enclosing class,
    *  - the value parameters of the original method `originalDef`.
    */

tests/pos/tailcall/i321.scala

@@ -3,7 +3,7 @@ import scala.annotation.tailrec
  * Illustrates that abstracting over type arguments without triggering Ycheck failure is tricky
  *
  * go1.loop refers to type parameter of i321, and captures value f
- * if goo1.loop will abstract over T it will need to cast f or will trigger a Ycheck failure.
+ * if go1.loop will abstract over T it will need to cast f or will trigger a Ycheck failure.
  * One could decide to not abstract over type parameters in tail calls, but this leads us to go2 example
  *
  * In go2 we should abstract over i321.T, as we need to change it in recursive call.