@@ -31,7 +31,7 @@ would not typecheck if an implicit was declared like this for type `T`
31
31
This definition effectively says that value of type ` T ` can (only) be
32
32
compared with ` == ` or ` != ` to other values of type ` T ` . The definition
33
33
is used only for type checking; it has no significance for runtime
34
- behavior, since ` == ` always maps to ` equals ` and ` != ` alwatys maps to
34
+ behavior, since ` == ` always maps to ` equals ` and ` != ` always maps to
35
35
the negation of ` equals ` . The right hand side of the definition is a value
36
36
that has any ` Eq ` instance as its type. Here is the definition of class
37
37
` Eq ` and its companion object:
@@ -63,7 +63,7 @@ other numbers, sequences only comparable to other
63
63
sequences and sets only comparable to other sets.
64
64
65
65
There's also a "fallback" instance named ` eqAny ` that allows comparisons
66
- over all types that do not themeselves have an ` Eq ` instance. ` eqAny ` is
66
+ over all types that do not themselves have an ` Eq ` instance. ` eqAny ` is
67
67
defined as follows:
68
68
69
69
def eqAny[L, R]: Eq[L, R] = Eq
@@ -102,8 +102,7 @@ The precise rules for equality checking are as follows.
102
102
103
103
Here _ lifting_ a type ` S ` means replacing all references to abstract types
104
104
in covariant positions of ` S ` by their upper bound, and to replacing
105
- all refinement types in in covariant positions of ` S ` by their parent.
106
- The purpose if lifte
105
+ all refinement types in covariant positions of ` S ` by their parent.
107
106
108
107
More on multiversal equality is found in a [ blog post] ( http://www.scala-lang.org/blog/2016/05/06/multiversal-equality.html )
109
108
and a [ Github issue] ( https://github.com/lampepfl/dotty/issues/1247 ) .
0 commit comments