Type Members
-
type
IxSq[+A] = IndexedSeq[A]
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
<^>[A, B](as: IxSq[A])(f: (NonEmptyList[A]) ⇒ B)(implicit arg0: Monoid[B]): B
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
adjacentPairs[A](as: IxSq[A]): IxSq[(A, A)]
-
final
def
allPairs[A](as: IxSq[A]): IxSq[(A, A)]
-
final
def
asInstanceOf[T0]: T0
-
final
def
breakM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(IxSq[A], IxSq[A])]
-
final
def
buildIxSq[A, B]: CanBuildFrom[IxSq[A], B, IxSq[B]]
-
def
clone(): AnyRef
-
final
def
empty[A]: IndexedSeq[Nothing]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
final
def
filterM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IxSq[A]]
-
def
finalize(): Unit
-
final
def
findM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Option[A]]
-
-
final
def
getClass(): Class[_]
-
final
def
groupByM[A, M[_]](as: IxSq[A])(p: (A, A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IxSq[IxSq[A]]]
-
def
hashCode(): Int
-
implicit
def
indexedSeqEqual[A](implicit A0: Equal[A]): IndexedSeqEqual[A, IndexedSeq[A]]
-
-
implicit
def
indexedSeqMonoid[A]: Monoid[IndexedSeq[A]]
-
implicit
def
indexedSeqOrder[A](implicit A0: Order[A]): Order[IndexedSeq[A]]
-
implicit
def
indexedSeqShow[A](implicit arg0: Show[A]): Show[IndexedSeq[A]]
-
-
final
def
initz[A](as: IxSq[A]): IxSq[IxSq[A]]
-
final
def
intercalate[A](as1: IxSq[IxSq[A]], as2: IxSq[A]): IxSq[A]
-
final
def
intersperse[A](as: IxSq[A], a: A): IxSq[A]
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
mapAccumLeft[A, B, C](as: IxSq[A])(c: C, f: (C, A) ⇒ (C, B)): (C, IxSq[B])
-
final
def
mapAccumRight[A, B, C](as: IxSq[A])(c: C, f: (C, A) ⇒ (C, B)): (C, IxSq[B])
-
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
partitionM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(IxSq[A], IxSq[A])]
-
final
def
powerset[A](as: IxSq[A]): IxSq[IxSq[A]]
-
final
def
spanM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(IxSq[A], IxSq[A])]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
final
def
tailz[A](as: IxSq[A]): IxSq[IxSq[A]]
-
final
def
takeUntilM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IxSq[A]]
-
final
def
takeWhileM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IxSq[A]]
-
final
def
toNel[A](as: IxSq[A]): Option[NonEmptyList[A]]
-
def
toString(): String
-
final
def
toZipper[A](as: IxSq[A]): Option[Zipper[A]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
zipperEnd[A](as: IxSq[A]): Option[Zipper[A]]
Inherited from AnyRef
Inherited from Any
