abstract
class
IdealRange extends Seq[IdealInt]
Instance Constructors
-
new
IdealRange()
Type Members
-
type
Self = Seq[IdealInt]
-
class
WithFilter extends FilterMonadic[A, Repr]
Abstract Value Members
-
abstract
def
apply(idx: Int): IdealInt
-
abstract
def
iterator: Iterator[IdealInt]
-
abstract
def
length: Int
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
++[B >: IdealInt, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
++:[B >: IdealInt, That](that: Traversable[B])(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
++:[B >: IdealInt, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
+:[B >: IdealInt, That](elem: B)(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
/:[B](z: B)(op: (B, IdealInt) ⇒ B): B
-
def
:+[B >: IdealInt, That](elem: B)(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
:\[B](z: B)(op: (IdealInt, B) ⇒ B): B
-
final
def
==(arg0: Any): Boolean
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: ⇒ B)(seqop: (B, IdealInt) ⇒ B, combop: (B, B) ⇒ B): B
-
def
andThen[C](k: (IdealInt) ⇒ C): PartialFunction[Int, C]
-
def
applyOrElse[A1 <: Int, B1 >: IdealInt](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
def
collect[B, That](pf: PartialFunction[IdealInt, B])(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
collectFirst[B](pf: PartialFunction[IdealInt, B]): Option[B]
-
def
combinations(n: Int): Iterator[Seq[IdealInt]]
-
def
companion: GenericCompanion[Seq]
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ IdealInt
-
def
contains[A1 >: IdealInt](elem: A1): Boolean
-
def
containsSlice[B](that: GenSeq[B]): Boolean
-
def
copyToArray[B >: IdealInt](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: IdealInt](xs: Array[B]): Unit
-
def
copyToArray[B >: IdealInt](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: IdealInt](dest: Buffer[B]): Unit
-
def
corresponds[B](that: GenSeq[B])(p: (IdealInt, B) ⇒ Boolean): Boolean
-
def
count(p: (IdealInt) ⇒ Boolean): Int
-
def
diff[B >: IdealInt](that: GenSeq[B]): Seq[IdealInt]
-
def
distinct: Seq[IdealInt]
-
def
drop(n: Int): Seq[IdealInt]
-
def
dropRight(n: Int): Seq[IdealInt]
-
def
dropWhile(p: (IdealInt) ⇒ Boolean): Seq[IdealInt]
-
def
endsWith[B](that: GenSeq[B]): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
def
exists(p: (IdealInt) ⇒ Boolean): Boolean
-
def
filter(p: (IdealInt) ⇒ Boolean): Seq[IdealInt]
-
def
filterNot(p: (IdealInt) ⇒ Boolean): Seq[IdealInt]
-
def
find(p: (IdealInt) ⇒ Boolean): Option[IdealInt]
-
def
flatMap[B, That](f: (IdealInt) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
flatten[B](implicit asTraversable: (IdealInt) ⇒ GenTraversableOnce[B]): Seq[B]
-
def
fold[A1 >: IdealInt](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, IdealInt) ⇒ B): B
-
def
foldRight[B](z: B)(op: (IdealInt, B) ⇒ B): B
-
def
forall(p: (IdealInt) ⇒ Boolean): Boolean
-
def
foreach[U](f: (IdealInt) ⇒ U): Unit
-
def
genericBuilder[B]: Builder[B, Seq[B]]
-
final
def
getClass(): Class[_]
-
def
groupBy[K](f: (IdealInt) ⇒ K): Map[K, Seq[IdealInt]]
-
def
grouped(size: Int): Iterator[Seq[IdealInt]]
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
-
def
headOption: Option[IdealInt]
-
def
indexOf[B >: IdealInt](elem: B, from: Int): Int
-
def
indexOf[B >: IdealInt](elem: B): Int
-
def
indexOfSlice[B >: IdealInt](that: GenSeq[B], from: Int): Int
-
def
indexOfSlice[B >: IdealInt](that: GenSeq[B]): Int
-
def
indexWhere(p: (IdealInt) ⇒ Boolean, from: Int): Int
-
def
indexWhere(p: (IdealInt) ⇒ Boolean): Int
-
def
indices: Range
-
-
def
inits: Iterator[Seq[IdealInt]]
-
def
intersect[B >: IdealInt](that: GenSeq[B]): Seq[IdealInt]
-
def
isDefinedAt(idx: Int): Boolean
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
-
def
lastIndexOf[B >: IdealInt](elem: B, end: Int): Int
-
def
lastIndexOf[B >: IdealInt](elem: B): Int
-
def
lastIndexOfSlice[B >: IdealInt](that: GenSeq[B], end: Int): Int
-
def
lastIndexOfSlice[B >: IdealInt](that: GenSeq[B]): Int
-
def
lastIndexWhere(p: (IdealInt) ⇒ Boolean, end: Int): Int
-
def
lastIndexWhere(p: (IdealInt) ⇒ Boolean): Int
-
def
lastOption: Option[IdealInt]
-
def
lengthCompare(len: Int): Int
-
def
lift: (Int) ⇒ Option[IdealInt]
-
def
map[B, That](f: (IdealInt) ⇒ B)(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
max[B >: IdealInt](implicit cmp: Ordering[B]): IdealInt
-
def
maxBy[B](f: (IdealInt) ⇒ B)(implicit cmp: Ordering[B]): IdealInt
-
def
min[B >: IdealInt](implicit cmp: Ordering[B]): IdealInt
-
def
minBy[B](f: (IdealInt) ⇒ B)(implicit cmp: Ordering[B]): IdealInt
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
-
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
orElse[A1 <: Int, B1 >: IdealInt](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
-
def
padTo[B >: IdealInt, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
par: ParSeq[IdealInt]
-
def
parCombiner: Combiner[IdealInt, ParSeq[IdealInt]]
-
-
def
patch[B >: IdealInt, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
permutations: Iterator[Seq[IdealInt]]
-
def
prefixLength(p: (IdealInt) ⇒ Boolean): Int
-
def
product[B >: IdealInt](implicit num: Numeric[B]): B
-
def
reduce[A1 >: IdealInt](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: IdealInt](op: (B, IdealInt) ⇒ B): B
-
def
reduceLeftOption[B >: IdealInt](op: (B, IdealInt) ⇒ B): Option[B]
-
def
reduceOption[A1 >: IdealInt](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: IdealInt](op: (IdealInt, B) ⇒ B): B
-
def
reduceRightOption[B >: IdealInt](op: (IdealInt, B) ⇒ B): Option[B]
-
-
def
reverse: Seq[IdealInt]
-
def
reverseIterator: Iterator[IdealInt]
-
def
reverseMap[B, That](f: (IdealInt) ⇒ B)(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
reversed: List[IdealInt]
-
def
runWith[U](action: (IdealInt) ⇒ U): (Int) ⇒ Boolean
-
def
sameElements[B >: IdealInt](that: GenIterable[B]): Boolean
-
def
scan[B >: IdealInt, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, IdealInt) ⇒ B)(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
scanRight[B, That](z: B)(op: (IdealInt, B) ⇒ B)(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
segmentLength(p: (IdealInt) ⇒ Boolean, from: Int): Int
-
-
def
size: Int
-
def
slice(from: Int, until: Int): Seq[IdealInt]
-
def
sliding(size: Int, step: Int): Iterator[Seq[IdealInt]]
-
def
sliding(size: Int): Iterator[Seq[IdealInt]]
-
def
sortBy[B](f: (IdealInt) ⇒ B)(implicit ord: Ordering[B]): Seq[IdealInt]
-
-
def
sorted[B >: IdealInt](implicit ord: Ordering[B]): Seq[IdealInt]
-
-
def
splitAt(n: Int): (Seq[IdealInt], Seq[IdealInt])
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
-
def
startsWith[B](that: GenSeq[B]): Boolean
-
def
stringPrefix: String
-
def
sum[B >: IdealInt](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
def
tails: Iterator[Seq[IdealInt]]
-
def
take(n: Int): Seq[IdealInt]
-
def
takeRight(n: Int): Seq[IdealInt]
-
def
takeWhile(p: (IdealInt) ⇒ Boolean): Seq[IdealInt]
-
def
thisCollection: Seq[IdealInt]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, IdealInt, Col[IdealInt]]): Col[IdealInt]
-
def
toArray[B >: IdealInt](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: IdealInt]: Buffer[B]
-
def
toCollection(repr: Seq[IdealInt]): Seq[IdealInt]
-
def
toIndexedSeq: IndexedSeq[IdealInt]
-
def
toIterable: Iterable[IdealInt]
-
def
toIterator: Iterator[IdealInt]
-
def
toList: List[IdealInt]
-
def
toMap[T, U](implicit ev: <:<[IdealInt, (T, U)]): Map[T, U]
-
-
def
toSet[B >: IdealInt]: Set[B]
-
def
toStream: Stream[IdealInt]
-
def
toString(): String
-
def
toTraversable: Traversable[IdealInt]
-
def
toVector: Vector[IdealInt]
-
def
transpose[B](implicit asTraversable: (IdealInt) ⇒ GenTraversableOnce[B]): Seq[Seq[B]]
-
def
union[B >: IdealInt, That](that: GenSeq[B])(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
unzip[A1, A2](implicit asPair: (IdealInt) ⇒ (A1, A2)): (Seq[A1], Seq[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (IdealInt) ⇒ (A1, A2, A3)): (Seq[A1], Seq[A2], Seq[A3])
-
def
updated[B >: IdealInt, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Seq[IdealInt], B, That]): That
-
def
view(from: Int, until: Int): SeqView[IdealInt, Seq[IdealInt]]
-
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
wait(): Unit
-
def
withFilter(p: (IdealInt) ⇒ Boolean): FilterMonadic[IdealInt, Seq[IdealInt]]
-
def
zip[A1 >: IdealInt, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Seq[IdealInt], (A1, B), That]): That
-
def
zipAll[B, A1 >: IdealInt, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Seq[IdealInt], (A1, B), That]): That
-
def
zipWithIndex[A1 >: IdealInt, That](implicit bf: CanBuildFrom[Seq[IdealInt], (A1, Int), That]): That
Deprecated Value Members
-
def
finalize(): Unit
Inherited from Equals
Inherited from GenericTraversableTemplate[IdealInt, Seq]
Inherited from TraversableOnce[IdealInt]
Inherited from GenTraversableOnce[IdealInt]
Inherited from HasNewBuilder[IdealInt, Seq[ap.basetypes.IdealInt] @scala.annotation.unchecked.uncheckedVariance]
Inherited from PartialFunction[Int, IdealInt]
Inherited from AnyRef
Inherited from Any
Extremely simple class for iterating over intervals of integers
TODO: this should be removed