Documentation

@strictfp
abstract class Documentation[T, A <: Int, B >: String, -X, +Y](c1: String, val c2: List[T]) extends Seq[T] with Product with Serializable

This class is used for testing tasty doc generation

Type parameters:
T

class type parameter

Value parameters:
c1

class parameter 1

c2

class parameter 2

Constructor:

create new object

Authors:

Bryan Abate

Companion:
object
Source:
Documentation.scala
trait Product
trait Seq[T]
trait Equals
trait SeqOps[T, Seq, Seq[T]]
trait Int => T
trait Iterable[T]
trait IterableOps[T, Seq, Seq[T]]
trait IterableOnceOps[T, Seq, Seq[T]]
trait IterableOnce[T]
class Object
trait Matchable
class Any
class DocumentationInheritance[T, A, B, X, Y]
class ClassExtendingDocumentation[T, A, B, X, Y]
class ClassLevel4[T, A, B, X, Y]

Value members

Constructors

def this(ac: String)

Auxiliary constructor

Auxiliary constructor

Value parameters:
ac

auxiliary parameter

Source:
Documentation.scala
def this(x: T)

Concrete methods

def apply(idx: Int): T
def docWithMd: Nothing

An example documention with markdown formatting

An example documention with markdown formatting

I'm bold

I'm italic

some code

def someScalaCode(x: String) = println("Hello " + x)

Title of level 1

Title of level 1

  1. I'm a list
  • Multilevel List 1. level 2

    1. level 2 2
  • level 1 again

  • multilevel try2

    • try2 level2
Source:
Documentation.scala
override def length: Int
Definition Classes
Source:
Documentation.scala
def loremIpsum[T](a: T): Map[T, T]

Lorem ipsum

Lorem ipsum

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Curabitur scelerisque facilisis sapien a lobortis. Fusce ultricies erat ante, sit amet bibendum orci commodo in. Sed elementum tempus ipsum id sodales. Ut quis nisi vitae turpis lacinia mattis id nec orci. Nullam tincidunt accumsan nisl, ac maximus quam eleifend tincidunt. Nunc ipsum nulla, mattis vitae auctor blandit, euismod sit amet elit. Proin sed porttitor nisi. Curabitur tristique pretium nisi. Vestibulum sagittis condimentum blandit. In ac consequat odio, in fermentum turpis. In hac habitasse platea dictumst. Proin scelerisque est sed magna fermentum, at ullamcorper purus porta. Aliquam posuere arcu elit, molestie fermentum justo malesuada non. In eget massa risus. Proin rutrum maximus arcu, et lacinia est suscipit nec. Morbi varius odio pretium turpis ornare, ut sollicitudin nunc egestas. Aliquam pulvinar massa odio, id tempor purus suscipit id. Nunc imperdiet sapien ligula, ut pretium lacus efficitur sit amet. Sed sed urna sed erat tempus sagittis quis eget elit. Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia curae; Duis accumsan hendrerit nunc, in sagittis tellus. Vivamus mattis ligula sed dolor lacinia iaculis. Pellentesque vel turpis est. Nam pellentesque diam id arcu pharetra, et consectetur eros facilisis. Aliquam erat volutpat.

Phasellus ac quam pretium, convallis dui id, vestibulum nibh. Fusce vulputate interdum ullamcorper. Sed nec erat varius, sagittis ipsum eget, interdum ex. Ut sed leo sit amet ligula ullamcorper facilisis et convallis tellus. Nullam consectetur vitae lorem vel mattis. Suspendisse ultrices ornare leo, ut porttitor est finibus vel. Ut faucibus arcu eget sapien lobortis, a luctus arcu posuere. Vivamus faucibus mauris facilisis enim ornare dapibus.

Quisque pharetra et orci non aliquet. Sed urna ipsum, commodo et ultricies sed, volutpat at nunc. Cras non lectus ac mauris lobortis efficitur vel ac ante. Mauris vestibulum risus at mauris pretium, vel iaculis dolor pretium. Nam fringilla fermentum lacus et varius. Nulla pulvinar maximus tortor, et venenatis ipsum luctus id. Integer hendrerit tellus felis, eget hendrerit dolor aliquam sit amet.

Aenean elementum risus sed enim egestas, vitae imperdiet urna eleifend. Donec elementum leo neque, eu consequat eros placerat vel. Integer pulvinar sem feugiat, tincidunt erat a, porta nulla. Mauris eu urna egestas, facilisis ex sodales, sollicitudin quam. Integer porta metus et nunc blandit lacinia. Integer posuere mauris et dui ornare, a finibus neque tristique. Cras sit amet lectus nunc. Nam facilisis tincidunt efficitur.

Source:
Documentation.scala
def methodsWithImplicit(x: Int)(implicit imp: Int, notImp: String): Nothing
def methodsWithParams(x: T, y: Int): List[Map[Int, T]]

Test methods with params

Test methods with params

Value parameters:
x

parameter 1

y

parameter 2

Returns:

something is returned

Source:
Documentation.scala
def table(foo: String): Nothing

 

 

How to convert ...

to a PartialFunction

to an optional Function

to an extractor

from a PartialFunction

Predef.identity

lift

Predef.identity

from optional Function

Function1.UnliftOps#unlift or Function.unlift

Predef.identity

Function1.UnliftOps#unlift

from an extractor

{ case extractor(x) => x }

extractor.unapply _

Predef.identity

 

Source:
Documentation.scala

Inherited methods

final def ++[B >: T](suffix: IterableOnce[B]): Seq[B]
Inherited from:
IterableOps
final override def ++:[B >: T](prefix: IterableOnce[B]): Seq[B]
Definition Classes
Inherited from:
SeqOps
final def +:[B >: T](elem: B): Seq[B]
Inherited from:
SeqOps
final def :+[B >: T](elem: B): Seq[B]
Inherited from:
SeqOps
final def :++[B >: T](suffix: IterableOnce[B]): Seq[B]
Inherited from:
SeqOps
Inherited from:
IterableOnceOps
Inherited from:
PartialFunction
override def andThen[C](k: T => C): PartialFunction[Int, C]
Definition Classes
Inherited from:
PartialFunction
def appended[B >: T](elem: B): Seq[B]
Inherited from:
SeqOps
def appendedAll[B >: T](suffix: IterableOnce[B]): Seq[B]
Inherited from:
SeqOps
def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: A1 => B1): B1
Inherited from:
PartialFunction
def canEqual(that: Any): Boolean
Inherited from:
Seq
def collect[B](pf: PartialFunction[T, B]): Seq[B]
Inherited from:
IterableOps
def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
Inherited from:
IterableOnceOps
Inherited from:
SeqOps
Inherited from:
PartialFunction
def compose[A](g: A => Int): A => T
Inherited from:
Function1
final override def concat[B >: T](suffix: IterableOnce[B]): Seq[B]
Definition Classes
Inherited from:
SeqOps
def contains[A1 >: T](elem: A1): Boolean
Inherited from:
SeqOps
def containsSlice[B >: T](that: Seq[B]): Boolean
Inherited from:
SeqOps
def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int
Inherited from:
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: T](xs: Array[B], start: Int): Int
Inherited from:
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: T](xs: Array[B]): Int
Inherited from:
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
Inherited from:
IterableOnceOps
def corresponds[B](that: Seq[B])(p: (T, B) => Boolean): Boolean
Inherited from:
SeqOps
def count(p: T => Boolean): Int
Inherited from:
IterableOnceOps
def diff[B >: T](that: Seq[B]): Seq[T]
Inherited from:
SeqOps
def distinct: Seq[T]
Inherited from:
SeqOps
def distinctBy[B](f: T => B): Seq[T]
Inherited from:
SeqOps
def drop(n: Int): Seq[T]
Inherited from:
IterableOps
def dropRight(n: Int): Seq[T]
Inherited from:
IterableOps
def dropWhile(p: T => Boolean): Seq[T]
Inherited from:
IterableOps
override def empty: Seq[T]
def endsWith[B >: T](that: Iterable[B]): Boolean
Inherited from:
SeqOps
override def equals(o: Any): Boolean
Definition Classes
Seq -> Equals -> Any
Inherited from:
Seq
def exists(p: T => Boolean): Boolean
Inherited from:
IterableOnceOps
def filter(pred: T => Boolean): Seq[T]
Inherited from:
IterableOps
def filterNot(pred: T => Boolean): Seq[T]
Inherited from:
IterableOps
def find(p: T => Boolean): Option[T]
Inherited from:
IterableOnceOps
def findLast(p: T => Boolean): Option[T]
Inherited from:
SeqOps
def flatMap[B](f: T => IterableOnce[B]): Seq[B]
Inherited from:
IterableOps
def flatten[B](implicit asIterable: T => IterableOnce[B]): Seq[B]
Inherited from:
IterableOps
def fold[A1 >: T](z: A1)(op: (A1, A1) => A1): A1
Inherited from:
IterableOnceOps
def foldLeft[B](z: B)(op: (B, T) => B): B
Inherited from:
IterableOnceOps
def foldRight[B](z: B)(op: (T, B) => B): B
Inherited from:
IterableOnceOps
def forall(p: T => Boolean): Boolean
Inherited from:
IterableOnceOps
def foreach[U](f: T => U): Unit
Inherited from:
IterableOnceOps
protected def fromSpecific(coll: IterableOnce[T]): Seq[T]
def groupBy[K](f: T => K): Map[K, Seq[T]]
Inherited from:
IterableOps
def groupMap[K, B](key: T => K)(f: T => B): Map[K, Seq[B]]
Inherited from:
IterableOps
def groupMapReduce[K, B](key: T => K)(f: T => B)(reduce: (B, B) => B): Map[K, B]
Inherited from:
IterableOps
def grouped(size: Int): Iterator[Seq[T]]
Inherited from:
IterableOps
override def hashCode(): Int
Definition Classes
Seq -> Any
Inherited from:
Seq
def head: T
Inherited from:
IterableOps
Inherited from:
IterableOps
@deprecatedOverriding(message = "Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", since = "2.13.0")
def indexOf[B >: T](elem: B): Int
Inherited from:
SeqOps
def indexOf[B >: T](elem: B, from: Int): Int
Inherited from:
SeqOps
@deprecatedOverriding(message = "Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", since = "2.13.0")
def indexOfSlice[B >: T](that: Seq[B]): Int
Inherited from:
SeqOps
def indexOfSlice[B >: T](that: Seq[B], from: Int): Int
Inherited from:
SeqOps
@deprecatedOverriding(message = "Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", since = "2.13.0")
def indexWhere(p: T => Boolean): Int
Inherited from:
SeqOps
def indexWhere(p: T => Boolean, from: Int): Int
Inherited from:
SeqOps
Inherited from:
SeqOps
def init: Seq[T]
Inherited from:
IterableOps
def inits: Iterator[Seq[T]]
Inherited from:
IterableOps
def intersect[B >: T](that: Seq[B]): Seq[T]
Inherited from:
SeqOps
Inherited from:
SeqOps
override def isEmpty: Boolean
Definition Classes
Inherited from:
SeqOps
Definition Classes
Inherited from:
IterableOps
Definition Classes
Inherited from:
Seq
Inherited from:
IterableOnce
def last: T
Inherited from:
IterableOps
def lastIndexOf[B >: T](elem: B, end: Int): Int
Inherited from:
SeqOps
@deprecatedOverriding(message = "Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", since = "2.13.0")
def lastIndexOfSlice[B >: T](that: Seq[B]): Int
Inherited from:
SeqOps
def lastIndexOfSlice[B >: T](that: Seq[B], end: Int): Int
Inherited from:
SeqOps
@deprecatedOverriding(message = "Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", since = "2.13.0")
def lastIndexWhere(p: T => Boolean): Int
Inherited from:
SeqOps
def lastIndexWhere(p: T => Boolean, end: Int): Int
Inherited from:
SeqOps
Inherited from:
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[T, B, Documentation[T, A, B, X, Y]]
Inherited from:
Iterable
def lengthCompare(that: Iterable[_]): Int
Inherited from:
SeqOps
def lengthCompare(len: Int): Int
Inherited from:
SeqOps
Inherited from:
SeqOps
def lift: Int => Option[T]
Inherited from:
PartialFunction
def map[B](f: T => B): Seq[B]
Inherited from:
IterableOps
def max[B >: T](implicit ord: Ordering[B]): T
Inherited from:
IterableOnceOps
def maxBy[B](f: T => B)(implicit cmp: Ordering[B]): T
Inherited from:
IterableOnceOps
def maxByOption[B](f: T => B)(implicit cmp: Ordering[B]): Option[T]
Inherited from:
IterableOnceOps
def maxOption[B >: T](implicit ord: Ordering[B]): Option[T]
Inherited from:
IterableOnceOps
def min[B >: T](implicit ord: Ordering[B]): T
Inherited from:
IterableOnceOps
def minBy[B](f: T => B)(implicit cmp: Ordering[B]): T
Inherited from:
IterableOnceOps
def minByOption[B](f: T => B)(implicit cmp: Ordering[B]): Option[T]
Inherited from:
IterableOnceOps
def minOption[B >: T](implicit ord: Ordering[B]): Option[T]
Inherited from:
IterableOnceOps
final def mkString: String
Inherited from:
IterableOnceOps
final def mkString(sep: String): String
Inherited from:
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String
Inherited from:
IterableOnceOps
protected def newSpecificBuilder: Builder[T, Seq[T]]
@deprecatedOverriding(message = "nonEmpty is defined as !isEmpty; override isEmpty instead", since = "2.13.0")
Inherited from:
IterableOnceOps
def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Inherited from:
PartialFunction
def padTo[B >: T](len: Int, elem: B): Seq[B]
Inherited from:
SeqOps
def partition(p: T => Boolean): (Seq[T], Seq[T])
Inherited from:
IterableOps
def partitionMap[A1, A2](f: T => Either[A1, A2]): (Seq[A1], Seq[A2])
Inherited from:
IterableOps
def patch[B >: T](from: Int, other: IterableOnce[B], replaced: Int): Seq[B]
Inherited from:
SeqOps
Inherited from:
SeqOps
def prepended[B >: T](elem: B): Seq[B]
Inherited from:
SeqOps
def prependedAll[B >: T](prefix: IterableOnce[B]): Seq[B]
Inherited from:
SeqOps
def product[B >: T](implicit num: Numeric[B]): B
Inherited from:
IterableOnceOps
Inherited from:
Product
def productElement(n: Int): Any
Inherited from:
Product
Inherited from:
Product
Inherited from:
Product
Inherited from:
Product
def reduce[B >: T](op: (B, B) => B): B
Inherited from:
IterableOnceOps
def reduceLeft[B >: T](op: (B, T) => B): B
Inherited from:
IterableOnceOps
def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
Inherited from:
IterableOnceOps
def reduceOption[B >: T](op: (B, B) => B): Option[B]
Inherited from:
IterableOnceOps
def reduceRight[B >: T](op: (T, B) => B): B
Inherited from:
IterableOnceOps
def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
Inherited from:
IterableOnceOps
def reverse: Seq[T]
Inherited from:
SeqOps
Inherited from:
SeqOps
protected def reversed: Iterable[T]
Inherited from:
IterableOnceOps
def runWith[U](action: T => U): Int => Boolean
Inherited from:
PartialFunction
def sameElements[B >: T](that: IterableOnce[B]): Boolean
Inherited from:
SeqOps
Inherited from:
SeqOps
def scan[B >: T](z: B)(op: (B, B) => B): Seq[B]
Inherited from:
IterableOps
def scanLeft[B](z: B)(op: (B, T) => B): Seq[B]
Inherited from:
IterableOps
def scanRight[B](z: B)(op: (T, B) => B): Seq[B]
Inherited from:
IterableOps
def search[B >: T](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
Inherited from:
SeqOps
def search[B >: T](elem: B)(implicit ord: Ordering[B]): SearchResult
Inherited from:
SeqOps
def segmentLength(p: T => Boolean, from: Int): Int
Inherited from:
SeqOps
final def segmentLength(p: T => Boolean): Int
Inherited from:
SeqOps
final override def size: Int
Definition Classes
Inherited from:
SeqOps
final override def sizeCompare(that: Iterable[_]): Int
Definition Classes
Inherited from:
SeqOps
final override def sizeCompare(otherSize: Int): Int
Definition Classes
Inherited from:
SeqOps
Inherited from:
IterableOps
def slice(from: Int, until: Int): Seq[T]
Inherited from:
IterableOps
def sliding(size: Int, step: Int): Iterator[Seq[T]]
Inherited from:
IterableOps
def sliding(size: Int): Iterator[Seq[T]]
Inherited from:
IterableOps
def sortBy[B](f: T => B)(implicit ord: Ordering[B]): Seq[T]
Inherited from:
SeqOps
def sortWith(lt: (T, T) => Boolean): Seq[T]
Inherited from:
SeqOps
def sorted[B >: T](implicit ord: Ordering[B]): Seq[T]
Inherited from:
SeqOps
def span(p: T => Boolean): (Seq[T], Seq[T])
Inherited from:
IterableOps
override def splitAt(n: Int): (Seq[T], Seq[T])
Definition Classes
Inherited from:
IterableOps
def startsWith[B >: T](that: IterableOnce[B], offset: Int): Boolean
Inherited from:
SeqOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S
Inherited from:
IterableOnce
def sum[B >: T](implicit num: Numeric[B]): B
Inherited from:
IterableOnceOps
def tail: Seq[T]
Inherited from:
IterableOps
def tails: Iterator[Seq[T]]
Inherited from:
IterableOps
def take(n: Int): Seq[T]
Inherited from:
IterableOps
def takeRight(n: Int): Seq[T]
Inherited from:
IterableOps
def takeWhile(p: T => Boolean): Seq[T]
Inherited from:
IterableOps
override def tapEach[U](f: T => U): Seq[T]
Definition Classes
Inherited from:
IterableOps
def to[C1](factory: Factory[T, C1]): C1
Inherited from:
IterableOnceOps
def toArray[B >: T : ClassTag]: Array[B]
Inherited from:
IterableOnceOps
final def toBuffer[B >: T]: Buffer[B]
Inherited from:
IterableOnceOps
def toList: List[T]
Inherited from:
IterableOnceOps
def toMap[K, V](implicit ev: T <:< (K, V)): Map[K, V]
Inherited from:
IterableOnceOps
def toSeq: Seq[T]
Inherited from:
IterableOnceOps
def toSet[B >: T]: Set[B]
Inherited from:
IterableOnceOps
override def toString(): String
Definition Classes
Seq -> Function1 -> Iterable -> Any
Inherited from:
Seq
Inherited from:
IterableOnceOps
def transpose[B](implicit asIterable: T => Iterable[B]): Seq[Seq[B]]
Inherited from:
IterableOps
def unapply(a: Int): Option[T]
Inherited from:
PartialFunction
def unzip[A1, A2](implicit asPair: T => (A1, A2)): (Seq[A1], Seq[A2])
Inherited from:
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: T => (A1, A2, A3)): (Seq[A1], Seq[A2], Seq[A3])
Inherited from:
IterableOps
def updated[B >: T](index: Int, elem: B): Seq[B]
Inherited from:
SeqOps
override def view: SeqView[T]
Definition Classes
Inherited from:
SeqOps
def withFilter(p: T => Boolean): WithFilter[T, Seq]
Inherited from:
IterableOps
def zip[B](that: IterableOnce[B]): Seq[(T, B)]
Inherited from:
IterableOps
def zipAll[A1 >: T, B](that: Iterable[B], thisElem: A1, thatElem: B): Seq[(A1, B)]
Inherited from:
IterableOps
def zipWithIndex: Seq[(T, Int)]
Inherited from:
IterableOps

Deprecated and Inherited methods

@inline @deprecated(message = "Use foldLeft instead of /:", since = "2.13.0")
final def /:[B](z: B)(op: (B, T) => B): B
Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
@inline @deprecated(message = "Use foldRight instead of :\\", since = "2.13.0")
final def :\[B](z: B)(op: (T, B) => B): B
Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from:
IterableOnceOps
@deprecated(message = "`aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.", since = "2.13.0")
def aggregate[B](z: => B)(seqop: (B, T) => B, combop: (B, B) => B): B
Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from:
IterableOnceOps
@inline @deprecatedOverriding(message = "Use iterableFactory instead", since = "2.13.0") @deprecated(message = "Use iterableFactory instead", since = "2.13.0")
Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
@inline @deprecated(message = "Use `dest ++= coll` instead", since = "2.13.0")
final def copyToBuffer[B >: T](dest: Buffer[B]): Unit
Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from:
IterableOnceOps
@deprecated(message = "Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)", since = "2.13.0")
Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from:
IterableOnceOps
@inline @deprecated(message = "Use segmentLength instead of prefixLength", since = "2.13.0")
final def prefixLength(p: T => Boolean): Int
Deprecated
[Since version 2.13.0] Use segmentLength instead of prefixLength
Inherited from:
SeqOps
@deprecated(message = "Use coll instead of repr in a collection implementation, use the collection value itself from the outside", since = "2.13.0")
final def repr: Seq[T]
Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from:
IterableOps
@deprecated(message = "Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)", since = "2.13.0")
def reverseMap[B](f: T => B): Seq[B]
Deprecated
[Since version 2.13.0] Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
Inherited from:
SeqOps
@deprecated(message = "Iterable.seq always returns the iterable itself", since = "2.13.0")
def seq: Documentation[T, A, B, X, Y]
Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from:
Iterable
@deprecated(message = "toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections", since = "2.13.7")
final def toIterable: Documentation[T, A, B, X, Y]
Deprecated
[Since version 2.13.7] toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
Iterable
@inline @deprecated(message = "Use .iterator instead of .toIterator", since = "2.13.0")
final def toIterator: Iterator[T]
Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from:
IterableOnceOps
@inline @deprecated(message = "Use .to(LazyList) instead of .toStream", since = "2.13.0")
final def toStream: Stream[T]
Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from:
IterableOnceOps
@deprecated(message = "toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections", since = "2.13.0")
final def toTraversable: Iterable[T]
Deprecated
[Since version 2.13.0] toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
IterableOps
@inline @deprecated(message = "Use `concat` instead", since = "2.13.0")
final def union[B >: T](that: Seq[B]): Seq[B]
Deprecated
[Since version 2.13.0] Use `concat` instead
Inherited from:
SeqOps
@deprecated(message = "Use .view.slice(from, until) instead of .view(from, until)", since = "2.13.0")
def view(from: Int, until: Int): View[T]
Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Inherited from:
IterableOps

Abstract fields

val refinementTest: Graph { def x: Int; def x2: innerDocumentationClass; type Y = String; val z: Boolean; }

Concrete fields

var iAmAVar: Nothing
val v: Int

Test value

Test value

Source:
Documentation.scala