diff options
author | Paolo G. Giarrusso <p.giarrusso@gmail.com> | 2016-10-06 21:33:18 +0200 |
---|---|---|
committer | Paolo G. Giarrusso <p.giarrusso@gmail.com> | 2016-10-07 16:03:33 +0200 |
commit | b8203c8968d9934b91e468790c84a5d9bf76d806 (patch) | |
tree | b1790a0d04c4bd78323a56d67dfcd5387059e920 /src/dotty/tools/dotc/transform | |
parent | 3bb27d468cb06894c72b9f2cfba854ad49d68a74 (diff) | |
download | dotty-b8203c8968d9934b91e468790c84a5d9bf76d806.tar.gz dotty-b8203c8968d9934b91e468790c84a5d9bf76d806.tar.bz2 dotty-b8203c8968d9934b91e468790c84a5d9bf76d806.zip |
Fix typos
Diffstat (limited to 'src/dotty/tools/dotc/transform')
-rw-r--r-- | src/dotty/tools/dotc/transform/TreeTransform.scala | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/dotty/tools/dotc/transform/TreeTransform.scala b/src/dotty/tools/dotc/transform/TreeTransform.scala index 52a3ad94e..45fa3d607 100644 --- a/src/dotty/tools/dotc/transform/TreeTransform.scala +++ b/src/dotty/tools/dotc/transform/TreeTransform.scala @@ -42,7 +42,7 @@ object TreeTransforms { * the general dispatch overhead as opposed to the concrete work done in transformations. So that leaves us with * 0.2sec, or roughly 600M processor cycles. * - * Now, to the amount of work that needs to be done. The codebase produces of about 250'000 trees after typechecking. + * Now, to the amount of work that needs to be done. The codebase produces an average of about 250'000 trees after typechecking. * Transformations are likely to make this bigger so let's assume 300K trees on average. We estimate to have about 100 * micro-transformations. Let's say 5 transformation groups of 20 micro-transformations each. (by comparison, * scalac has in excess of 20 phases, and most phases do multiple transformations). There are then 30M visits @@ -208,7 +208,7 @@ object TreeTransforms { if (cls.getDeclaredMethods.exists(_.getName == name)) cls != classOf[TreeTransform] else hasRedefinedMethod(cls.getSuperclass, name) - /** Create an index array `next` of size one larger than teh size of `transforms` such that + /** Create an index array `next` of size one larger than the size of `transforms` such that * for each index i, `next(i)` is the smallest index j such that * * i <= j |