abstract class IdealRange extends Seq[IdealInt]
Extremely simple class for iterating over intervals of integers
TODO: this should be removed
- Alphabetic
- By Inheritance
- IdealRange
- Seq
- SeqOps
- Seq
- Equals
- SeqOps
- PartialFunction
- Function1
- Iterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new IdealRange()
Abstract Value Members
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ++[B >: IdealInt](suffix: IterableOnce[B]): Seq[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def ++:[B >: IdealInt](prefix: IterableOnce[B]): Seq[B]
- Definition Classes
- SeqOps → IterableOps
- Annotations
- @inline()
- final def +:[B >: IdealInt](elem: B): Seq[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def :+[B >: IdealInt](elem: B): Seq[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def :++[B >: IdealInt](suffix: IterableOnce[B]): Seq[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def addString(b: StringBuilder): b.type
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): b.type
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
- Definition Classes
- IterableOnceOps
- def andThen[C](k: PartialFunction[IdealInt, C]): PartialFunction[Int, C]
- Definition Classes
- PartialFunction
- def andThen[C](k: (IdealInt) => C): PartialFunction[Int, C]
- Definition Classes
- PartialFunction → Function1
- def appended[B >: IdealInt](elem: B): Seq[B]
- Definition Classes
- SeqOps
- def appendedAll[B >: IdealInt](suffix: IterableOnce[B]): Seq[B]
- Definition Classes
- SeqOps
- def applyOrElse[A1 <: Int, B1 >: IdealInt](x: A1, default: (A1) => B1): B1
- Definition Classes
- PartialFunction
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def canEqual(that: Any): Boolean
- Definition Classes
- Seq → Equals
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
- final def coll: IdealRange.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[IdealInt, B]): Seq[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[IdealInt, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def combinations(n: Int): Iterator[Seq[IdealInt]]
- Definition Classes
- SeqOps
- def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, IdealInt]
- Definition Classes
- PartialFunction
- def compose[A](g: (A) => Int): (A) => IdealInt
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final def concat[B >: IdealInt](suffix: IterableOnce[B]): Seq[B]
- Definition Classes
- SeqOps → IterableOps
- Annotations
- @inline()
- def contains[A1 >: IdealInt](elem: A1): Boolean
- Definition Classes
- SeqOps
- def containsSlice[B >: IdealInt](that: Seq[B]): Boolean
- Definition Classes
- SeqOps
- def copyToArray[B >: IdealInt](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: IdealInt](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: IdealInt](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: Seq[B])(p: (IdealInt, B) => Boolean): Boolean
- Definition Classes
- SeqOps
- def corresponds[B](that: IterableOnce[B])(p: (IdealInt, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (IdealInt) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def diff[B >: IdealInt](that: Seq[B]): Seq[IdealInt]
- Definition Classes
- SeqOps
- def distinct: Seq[IdealInt]
- Definition Classes
- SeqOps
- def distinctBy[B](f: (IdealInt) => B): Seq[IdealInt]
- Definition Classes
- SeqOps
- def drop(n: Int): Seq[IdealInt]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): Seq[IdealInt]
- Definition Classes
- IterableOps
- def dropWhile(p: (IdealInt) => Boolean): Seq[IdealInt]
- Definition Classes
- IterableOps → IterableOnceOps
- def elementWise: ElementWiseExtractor[Int, IdealInt]
- Definition Classes
- PartialFunction
- def empty: Seq[IdealInt]
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def endsWith[B >: IdealInt](that: Iterable[B]): Boolean
- Definition Classes
- SeqOps
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(o: Any): Boolean
- Definition Classes
- Seq → Equals → AnyRef → Any
- def exists(p: (IdealInt) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: (IdealInt) => Boolean): Seq[IdealInt]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterNot(pred: (IdealInt) => Boolean): Seq[IdealInt]
- Definition Classes
- IterableOps → IterableOnceOps
- def find(p: (IdealInt) => Boolean): Option[IdealInt]
- Definition Classes
- IterableOnceOps
- def findLast(p: (IdealInt) => Boolean): Option[IdealInt]
- Definition Classes
- SeqOps
- def flatMap[B](f: (IdealInt) => IterableOnce[B]): Seq[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (IdealInt) => IterableOnce[B]): Seq[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: IdealInt](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, IdealInt) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (IdealInt, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (IdealInt) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (IdealInt) => U): Unit
- Definition Classes
- IterableOnceOps
- def fromSpecific(coll: IterableOnce[IdealInt]): Seq[IdealInt]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def groupBy[K](f: (IdealInt) => K): Map[K, Seq[IdealInt]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (IdealInt) => K)(f: (IdealInt) => B): Map[K, Seq[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (IdealInt) => K)(f: (IdealInt) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Seq[IdealInt]]
- Definition Classes
- IterableOps
- def hashCode(): Int
- Definition Classes
- Seq → AnyRef → Any
- def head: IdealInt
- Definition Classes
- IterableOps
- def headOption: Option[IdealInt]
- Definition Classes
- IterableOps
- def indexOf[B >: IdealInt](elem: B): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def indexOf[B >: IdealInt](elem: B, from: Int): Int
- Definition Classes
- SeqOps
- def indexOfSlice[B >: IdealInt](that: Seq[B]): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def indexOfSlice[B >: IdealInt](that: Seq[B], from: Int): Int
- Definition Classes
- SeqOps
- def indexWhere(p: (IdealInt) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def indexWhere(p: (IdealInt) => Boolean, from: Int): Int
- Definition Classes
- SeqOps
- def indices: Range
- Definition Classes
- SeqOps
- def init: Seq[IdealInt]
- Definition Classes
- IterableOps
- def inits: Iterator[Seq[IdealInt]]
- Definition Classes
- IterableOps
- def intersect[B >: IdealInt](that: Seq[B]): Seq[IdealInt]
- Definition Classes
- SeqOps
- def isDefinedAt(idx: Int): Boolean
- Definition Classes
- SeqOps
- def isEmpty: Boolean
- Definition Classes
- SeqOps → IterableOnceOps
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: SeqFactory[Seq]
- Definition Classes
- Seq → Seq → Iterable → Iterable → IterableOps
- def knownSize: Int
- Definition Classes
- IterableOnce
- def last: IdealInt
- Definition Classes
- IterableOps
- def lastIndexOf[B >: IdealInt](elem: B, end: Int): Int
- Definition Classes
- SeqOps
- def lastIndexOfSlice[B >: IdealInt](that: Seq[B]): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def lastIndexOfSlice[B >: IdealInt](that: Seq[B], end: Int): Int
- Definition Classes
- SeqOps
- def lastIndexWhere(p: (IdealInt) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def lastIndexWhere(p: (IdealInt) => Boolean, end: Int): Int
- Definition Classes
- SeqOps
- def lastOption: Option[IdealInt]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[IdealInt, B, IdealRange.this.type]
- Definition Classes
- Iterable
- def lengthCompare(that: Iterable[_]): Int
- Definition Classes
- SeqOps
- def lengthCompare(len: Int): Int
- Definition Classes
- SeqOps
- final def lengthIs: SizeCompareOps
- Definition Classes
- SeqOps
- Annotations
- @inline()
- def lift: (Int) => Option[IdealInt]
- Definition Classes
- PartialFunction
- def map[B](f: (IdealInt) => B): Seq[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def max[B >: IdealInt](implicit ord: Ordering[B]): IdealInt
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (IdealInt) => B)(implicit ord: Ordering[B]): IdealInt
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (IdealInt) => B)(implicit ord: Ordering[B]): Option[IdealInt]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: IdealInt](implicit ord: Ordering[B]): Option[IdealInt]
- Definition Classes
- IterableOnceOps
- def min[B >: IdealInt](implicit ord: Ordering[B]): IdealInt
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (IdealInt) => B)(implicit ord: Ordering[B]): IdealInt
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (IdealInt) => B)(implicit ord: Ordering[B]): Option[IdealInt]
- Definition Classes
- IterableOnceOps
- def minOption[B >: IdealInt](implicit ord: Ordering[B]): Option[IdealInt]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[IdealInt, Seq[IdealInt]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def occCounts[B](sq: Seq[B]): Map[B, Int]
- Attributes
- protected[collection]
- Definition Classes
- SeqOps
- def orElse[A1 <: Int, B1 >: IdealInt](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
- def padTo[B >: IdealInt](len: Int, elem: B): Seq[B]
- Definition Classes
- SeqOps
- def partition(p: (IdealInt) => Boolean): (Seq[IdealInt], Seq[IdealInt])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (IdealInt) => Either[A1, A2]): (Seq[A1], Seq[A2])
- Definition Classes
- IterableOps
- def patch[B >: IdealInt](from: Int, other: IterableOnce[B], replaced: Int): Seq[B]
- Definition Classes
- SeqOps
- def permutations: Iterator[Seq[IdealInt]]
- Definition Classes
- SeqOps
- def prepended[B >: IdealInt](elem: B): Seq[B]
- Definition Classes
- SeqOps
- def prependedAll[B >: IdealInt](prefix: IterableOnce[B]): Seq[B]
- Definition Classes
- SeqOps
- def product[B >: IdealInt](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def reduce[B >: IdealInt](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: IdealInt](op: (B, IdealInt) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: IdealInt](op: (B, IdealInt) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: IdealInt](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: IdealInt](op: (IdealInt, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: IdealInt](op: (IdealInt, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reverse: Seq[IdealInt]
- Definition Classes
- SeqOps
- def reverseIterator: Iterator[IdealInt]
- Definition Classes
- SeqOps
- def reversed: Iterable[IdealInt]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def runWith[U](action: (IdealInt) => U): (Int) => Boolean
- Definition Classes
- PartialFunction
- def sameElements[B >: IdealInt](that: IterableOnce[B]): Boolean
- Definition Classes
- SeqOps
- def scan[B >: IdealInt](z: B)(op: (B, B) => B): Seq[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, IdealInt) => B): Seq[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (IdealInt, B) => B): Seq[B]
- Definition Classes
- IterableOps
- def search[B >: IdealInt](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
- Definition Classes
- SeqOps
- def search[B >: IdealInt](elem: B)(implicit ord: Ordering[B]): SearchResult
- Definition Classes
- SeqOps
- def segmentLength(p: (IdealInt) => Boolean, from: Int): Int
- Definition Classes
- SeqOps
- final def segmentLength(p: (IdealInt) => Boolean): Int
- Definition Classes
- SeqOps
- final def size: Int
- Definition Classes
- SeqOps → IterableOnceOps
- final def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- SeqOps → IterableOps
- final def sizeCompare(otherSize: Int): Int
- Definition Classes
- SeqOps → IterableOps
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): Seq[IdealInt]
- Definition Classes
- IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[Seq[IdealInt]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Seq[IdealInt]]
- Definition Classes
- IterableOps
- def sortBy[B](f: (IdealInt) => B)(implicit ord: Ordering[B]): Seq[IdealInt]
- Definition Classes
- SeqOps
- def sortWith(lt: (IdealInt, IdealInt) => Boolean): Seq[IdealInt]
- Definition Classes
- SeqOps
- def sorted[B >: IdealInt](implicit ord: Ordering[B]): Seq[IdealInt]
- Definition Classes
- SeqOps
- def span(p: (IdealInt) => Boolean): (Seq[IdealInt], Seq[IdealInt])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (Seq[IdealInt], Seq[IdealInt])
- Definition Classes
- IterableOps → IterableOnceOps
- def startsWith[B >: IdealInt](that: IterableOnce[B], offset: Int): Boolean
- Definition Classes
- SeqOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[IdealInt, S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- Seq → Iterable
- def sum[B >: IdealInt](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: Seq[IdealInt]
- Definition Classes
- IterableOps
- def tails: Iterator[Seq[IdealInt]]
- Definition Classes
- IterableOps
- def take(n: Int): Seq[IdealInt]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): Seq[IdealInt]
- Definition Classes
- IterableOps
- def takeWhile(p: (IdealInt) => Boolean): Seq[IdealInt]
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: (IdealInt) => U): Seq[IdealInt]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[IdealInt, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: IdealInt](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: IdealInt]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[IdealInt]
- Definition Classes
- IterableOnceOps
- def toList: List[IdealInt]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[IdealInt, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- final def toSeq: IdealRange.this.type
- Definition Classes
- Seq → IterableOnceOps
- def toSet[B >: IdealInt]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- Definition Classes
- Seq → Function1 → Iterable → AnyRef → Any
- def toVector: Vector[IdealInt]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (IdealInt) => Iterable[B]): Seq[Seq[B]]
- Definition Classes
- IterableOps
- def unapply(a: Int): Option[IdealInt]
- Definition Classes
- PartialFunction
- def unzip[A1, A2](implicit asPair: (IdealInt) => (A1, A2)): (Seq[A1], Seq[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (IdealInt) => (A1, A2, A3)): (Seq[A1], Seq[A2], Seq[A3])
- Definition Classes
- IterableOps
- def updated[B >: IdealInt](index: Int, elem: B): Seq[B]
- Definition Classes
- SeqOps
- def view: SeqView[IdealInt]
- Definition Classes
- SeqOps → IterableOps
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withFilter(p: (IdealInt) => Boolean): WithFilter[IdealInt, [_]Seq[_]]
- Definition Classes
- IterableOps
- def zip[B](that: IterableOnce[B]): Seq[(IdealInt, B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: IdealInt, B](that: Iterable[B], thisElem: A1, thatElem: B): Seq[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Seq[(IdealInt, Int)]
- Definition Classes
- IterableOps → IterableOnceOps
Deprecated Value Members
- final def /:[B](z: B)(op: (B, IdealInt) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: (IdealInt, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, IdealInt) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) For sequential collections, prefer
foldLeft(z)(seqop)
. For parallel collections, useParIterableLike#aggregate
.
- def companion: IterableFactory[[_]Seq[_]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- final def copyToBuffer[B >: IdealInt](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- final def prefixLength(p: (IdealInt) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use segmentLength instead of prefixLength
- final def repr: Seq[IdealInt]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- def reverseMap[B](f: (IdealInt) => B): Seq[B]
- Definition Classes
- SeqOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
- def seq: IdealRange.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def toIterable: IdealRange.this.type
- Definition Classes
- Iterable → IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to
toList
ortoSeq
, but it doesn't copy non-immutable collections
- final def toIterator: Iterator[IdealInt]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[IdealInt]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[IdealInt]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to
toList
ortoSeq
, but it doesn't copy non-immutable collections
- final def union[B >: IdealInt](that: Seq[B]): Seq[B]
- Definition Classes
- SeqOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
concat
instead
- def view(from: Int, until: Int): View[IdealInt]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)