Skip to content

Commit e599c6a

Browse files
committed
Fix whitespace.
1 parent 2cc0453 commit e599c6a

File tree

2 files changed

+9
-9
lines changed

2 files changed

+9
-9
lines changed

compiler/src/dotty/tools/dotc/core/Types.scala

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4930,15 +4930,15 @@ object Types {
49304930
case tp if tp.isTopType || tp.isBottomType =>
49314931
cs
49324932
case tp: AppliedType =>
4933-
foldOver(cs+sym, tp)
4933+
foldOver(cs + sym, tp)
49344934
case tp: RefinedType =>
4935-
foldOver(cs+sym, tp)
4935+
foldOver(cs + sym, tp)
49364936
case tp: TypeRef if tp.info.isTypeAlias =>
49374937
apply(cs, tp.superType)
49384938
case tp: TypeBounds =>
49394939
foldOver(cs, tp)
49404940
case other =>
4941-
foldOver(cs+sym, tp)
4941+
foldOver(cs + sym, tp)
49424942
}
49434943
}
49444944
}

compiler/src/dotty/tools/dotc/typer/Implicits.scala

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -941,7 +941,7 @@ trait Implicits { self: Typer =>
941941
* a diverging search
942942
*/
943943
def tryImplicit(cand: Candidate, contextual: Boolean): SearchResult = {
944-
if(ctx.searchHistory.checkDivergence(cand, pt))
944+
if (ctx.searchHistory.checkDivergence(cand, pt))
945945
SearchFailure(new DivergingImplicit(cand.ref, pt.widenExpr, argument))
946946
else {
947947
val history = ctx.searchHistory.nest(cand, pt)
@@ -1180,7 +1180,7 @@ abstract class SearchHistory { outer =>
11801180
(if (cand1.ref == cand.ref) {
11811181
val wideTp = tp.widenExpr
11821182
lazy val wildTp = wildApprox(wideTp)
1183-
if(belowByname && (wildTp <:< wildPt)) Some(false)
1183+
if (belowByname && (wildTp <:< wildPt)) Some(false)
11841184
else if ((wideTp.typeSize < ptSize && wideTp.coveringSet == ptCoveringSet) || (wildTp == wildPt)) Some(true)
11851185
else None
11861186
} else None) match {
@@ -1197,7 +1197,7 @@ abstract class SearchHistory { outer =>
11971197

11981198
refBynameImplicit(widePt).orElse {
11991199
val bynamePt = isByname(pt)
1200-
if(!byname && !bynamePt) None
1200+
if (!byname && !bynamePt) None
12011201
else {
12021202
@tailrec
12031203
def loop(ois: List[(Candidate, Type)], belowByname: Boolean): Option[Type] = {
@@ -1228,7 +1228,7 @@ final class SearchRoot extends SearchHistory {
12281228

12291229
var implicitDictionary0: mutable.Map[Type, (TermRef, tpd.Tree)] = null
12301230
def implicitDictionary = {
1231-
if(implicitDictionary0 == null)
1231+
if (implicitDictionary0 == null)
12321232
implicitDictionary0 = mutable.Map.empty[Type, (TermRef, tpd.Tree)]
12331233
implicitDictionary0
12341234
}
@@ -1258,7 +1258,7 @@ final class SearchRoot extends SearchHistory {
12581258
}
12591259

12601260
override def emitDictionary(pos: Position, result: SearchResult)(implicit ctx: Context): SearchResult = {
1261-
if(implicitDictionary == null || implicitDictionary.isEmpty) result
1261+
if (implicitDictionary == null || implicitDictionary.isEmpty) result
12621262
else {
12631263
result match {
12641264
case failure: SearchFailure => failure
@@ -1276,7 +1276,7 @@ final class SearchRoot extends SearchHistory {
12761276
case _ => false
12771277
})
12781278
}
1279-
if(in.isEmpty) acc
1279+
if (in.isEmpty) acc
12801280
else prune(in.map(_._2) ++ trees, out, in ++ acc)
12811281
}
12821282

0 commit comments

Comments
 (0)