Decorators
This object provides useful extension methods for types defined elsewhere
Attributes
- Graph
-
- Supertypes
- Self type
-
Decorators.type
Members list
Value members
Concrete fields
Extensions
Extensions
Implements a findSymbol method on iterators of Symbols that works like find but avoids Option, replacing None with NoSymbol.
Implements a findSymbol method on iterators of Symbols that works like find but avoids Option, replacing None with NoSymbol.
Attributes
Test whether a list of strings representing phases contains a given phase. See config.CompilerCommand#explainAdvanced for the exact meaning of "contains" here.
Test whether a list of strings representing phases contains a given phase. See config.CompilerCommand#explainAdvanced for the exact meaning of "contains" here.
Attributes
Extension methods for toType/TermName methods on PreNames.
Extension methods for toType/TermName methods on PreNames.
Attributes
Extension methods for toType/TermName methods on PreNames.
Extension methods for toType/TermName methods on PreNames.
Attributes
Create a term name from a string slice, using a common buffer. This avoids some allocation relative to termName(s)
Create a term name from a string slice, using a common buffer. This avoids some allocation relative to termName(s)
Attributes
Interpolator yielding an error message, which undergoes the formatting defined in Message.
Interpolator yielding an error message, which undergoes the formatting defined in Message.
Attributes
Returns the simple class name of x
.
Returns the simple class name of x
.
Attributes
Implements filterConserve, zipWithConserve methods on lists that avoid duplication of list nodes where feasible.
Implements filterConserve, zipWithConserve methods on lists that avoid duplication of list nodes where feasible.
Attributes
Like xs filter p
but returns list xs
itself - instead of a copy - if p
is true for all elements.
Like xs filter p
but returns list xs
itself - instead of a copy - if p
is true for all elements.
Attributes
True if two lists have the same length. Since calling length on linear sequences is Θ(n), it is an inadvisable way to test length equality. This method is Θ(n min m).
True if two lists have the same length. Since calling length on linear sequences is Θ(n), it is an inadvisable way to test length equality. This method is Θ(n min m).
Attributes
Like xs.lazyZip(xs.indices).map(f)
, but returns list xs
itself
Like xs.lazyZip(xs.indices).map(f)
, but returns list xs
itself
- instead of a copy - if function
f
maps all elements ofxs
to themselves.
Attributes
Implements filterConserve, zipWithConserve methods on lists that avoid duplication of list nodes where feasible.
Implements filterConserve, zipWithConserve methods on lists that avoid duplication of list nodes where feasible.
Attributes
Reduce left with op
as long as list xs
is not longer than seqLimit
. Otherwise, split list in two half, reduce each, and combine with op
.
Reduce left with op
as long as list xs
is not longer than seqLimit
. Otherwise, split list in two half, reduce each, and combine with op
.
Attributes
Union on lists seen as sets
Union on lists seen as sets
Attributes
Like xs.lazyZip(ys).map(f)
, but returns list xs
itself
Like xs.lazyZip(ys).map(f)
, but returns list xs
itself
- instead of a copy - if function
f
maps all elements ofxs
to themselves. Also, it is required thatys
is at least as long asxs
.