final class IndexedSeqOps[IS[+_], A] extends AnyRef
- Source
- IndexedSeqOps.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- IndexedSeqOps
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new IndexedSeqOps(self: IS[A], v: IndexedSeqSubFunctions { type IxSq[+X] = IS[X] })
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- final def <^>[B](f: (NonEmptyList[A]) ⇒ B)(implicit arg0: Monoid[B]): B
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def adjacentPairs: IS[(A, A)]
- final def allPairs: IS[(A, A)]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- final def breakM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(IS[A], IS[A])]
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def filterM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Applicative[M]): M[IS[A]]
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- final def findM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Option[A]]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- final def groupWhen(p: (A, A) ⇒ Boolean): IS[IS[A]]
- final def groupWhenM[M[_]](p: (A, A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IS[IS[A]]]
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- final def initz: IS[IS[A]]
- final def intersperse(a: A): IS[A]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def mapAccumLeft[B, C](c: C, f: (C, A) ⇒ (C, B)): (C, IS[B])
- final def mapAccumRight[B, C](c: C, f: (C, A) ⇒ (C, B)): (C, IS[B])
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- final def partitionM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Applicative[M]): M[(IS[A], IS[A])]
- final def powerset: IS[IS[A]]
- final def spanM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(IS[A], IS[A])]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- final def tailz: IS[IS[A]]
- final def takeUntilM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IS[A]]
- final def takeWhileM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IS[A]]
- final def toNel: Option[NonEmptyList[A]]
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- final def toZipper: Option[Zipper[A]]
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- final def zipperEnd: Option[Zipper[A]]