object vector extends IndexedSeqSubVector with VectorInstances with IndexedSeqSubFunctions
- Source
- Vector.scala
- Alphabetic
- By Inheritance
- vector
- IndexedSeqSubFunctions
- VectorInstances
- VectorInstances0
- IndexedSeqSubVector
- IndexedSeqSub
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
type
IxSq[+A] = Vector[A]
- Definition Classes
- IndexedSeqSubVector → IndexedSeqSub
Value Members
-
object
generic
extends IndexedSeqSubVector with IndexedSeqSubInstances
- Definition Classes
- VectorInstances
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
<^>[A, B](as: IxSq[A])(f: (NonEmptyList[A]) ⇒ B)(implicit arg0: Monoid[B]): B
Returns
f
applied to the contents ofas
if non-empty, otherwise, the zero element of theMonoid
for the typeB
.Returns
f
applied to the contents ofas
if non-empty, otherwise, the zero element of theMonoid
for the typeB
.- Definition Classes
- IndexedSeqSubFunctions
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
adjacentPairs[A](as: IxSq[A]): IxSq[(A, A)]
[(as(0), as(1)), (as(1), as(2)), ... (as(size-2), as(size-1))]
[(as(0), as(1)), (as(1), as(2)), ... (as(size-2), as(size-1))]
- Definition Classes
- IndexedSeqSubFunctions
-
final
def
allPairs[A](as: IxSq[A]): IxSq[(A, A)]
Combinations of
as
andas
, excluding same-element pairs.Combinations of
as
andas
, excluding same-element pairs.- Definition Classes
- IndexedSeqSubFunctions
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
final
def
breakM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(IxSq[A], IxSq[A])]
spanM
withp
's complement.spanM
withp
's complement.- Definition Classes
- IndexedSeqSubFunctions
-
final
def
buildIxSq[A, B]: CanBuildFrom[IxSq[A], B, IxSq[B]]
- Attributes
- protected
- Definition Classes
- IndexedSeqSubVector → IndexedSeqSub
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
covariant: Traverse[VectorInstances.generic.IxSq] with MonadPlus[VectorInstances.generic.IxSq] with Each[VectorInstances.generic.IxSq] with Index[VectorInstances.generic.IxSq] with Length[VectorInstances.generic.IxSq] with Zip[VectorInstances.generic.IxSq] with Unzip[VectorInstances.generic.IxSq] with IsEmpty[VectorInstances.generic.IxSq] with Align[VectorInstances.generic.IxSq] { def toIndexedSeq[A](fa: scalaz.std.vector.generic.IxSq[A]): scalaz.std.vector.generic.IxSq[A] }
- Attributes
- protected
- Definition Classes
- IndexedSeqSubVector → IndexedSeqSub
-
final
def
empty[A]: Vector[Nothing]
- Attributes
- protected
- Definition Classes
- IndexedSeqSubVector → IndexedSeqSub
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
filterM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit F: Applicative[M]): M[IxSq[A]]
- Definition Classes
- IndexedSeqSubFunctions
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
findM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Option[A]]
Run
p(a)
s left-to-right until it yields a true value, answeringSome(that)
, orNone
if nothing matchedp
.Run
p(a)
s left-to-right until it yields a true value, answeringSome(that)
, orNone
if nothing matchedp
.- Definition Classes
- IndexedSeqSubFunctions
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
final
def
groupWhen[A](as: IxSq[A])(p: (A, A) ⇒ Boolean): IxSq[IxSq[A]]
groupWhenM
specialized to scalaz.Id.Id.groupWhenM
specialized to scalaz.Id.Id.- Definition Classes
- IndexedSeqSubFunctions
-
final
def
groupWhenM[A, M[_]](as: IxSq[A])(p: (A, A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IxSq[IxSq[A]]]
Split at each point where
p(as(n), as(n+1))
yields false.Split at each point where
p(as(n), as(n+1))
yields false.- Definition Classes
- IndexedSeqSubFunctions
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
initz[A](as: IxSq[A]): IxSq[IxSq[A]]
[
empty IxSq, as take 1, as take 2, ..., as]
[
empty IxSq, as take 1, as take 2, ..., as]
- Definition Classes
- IndexedSeqSubFunctions
-
final
def
intersperse[A](as: IxSq[A], a: A): IxSq[A]
Intersperse the element
a
between each adjacent pair of elements inas
Intersperse the element
a
between each adjacent pair of elements inas
- Definition Classes
- IndexedSeqSubFunctions
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
mapAccumLeft[A, B, C](as: IxSq[A])(c: C, f: (C, A) ⇒ (C, B)): (C, IxSq[B])
All of the
B
s, in order, and the finalC
acquired by a stateful left fold overas
.All of the
B
s, in order, and the finalC
acquired by a stateful left fold overas
.- Definition Classes
- IndexedSeqSubFunctions
-
final
def
mapAccumRight[A, B, C](as: IxSq[A])(c: C, f: (C, A) ⇒ (C, B)): (C, IxSq[B])
All of the
B
s, in orderas
-wise, and the finalC
acquired by a stateful right fold overas
.All of the
B
s, in orderas
-wise, and the finalC
acquired by a stateful right fold overas
.- Definition Classes
- IndexedSeqSubFunctions
-
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[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit F: Applicative[M]): M[(IxSq[A], IxSq[A])]
A pair of passing and failing values of
as
againstp
.A pair of passing and failing values of
as
againstp
.- Definition Classes
- IndexedSeqSubFunctions
-
final
def
powerset[A](as: IxSq[A]): IxSq[IxSq[A]]
- Definition Classes
- IndexedSeqSubFunctions
-
final
def
spanM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(IxSq[A], IxSq[A])]
A pair of the longest prefix of passing
as
againstp
, and the remainder.A pair of the longest prefix of passing
as
againstp
, and the remainder.- Definition Classes
- IndexedSeqSubFunctions
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
final
def
tailz[A](as: IxSq[A]): IxSq[IxSq[A]]
[as, as.tail, as.tail.tail, ...,
empty IxSq]
[as, as.tail, as.tail.tail, ...,
empty IxSq]
- Definition Classes
- IndexedSeqSubFunctions
-
final
def
takeUntilM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IxSq[A]]
Run
p(a)
s and collectas
whilep
yields false.Run
p(a)
s and collectas
whilep
yields false. Don't run anyp
s after the first true.- Definition Classes
- IndexedSeqSubFunctions
-
final
def
takeWhileM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IxSq[A]]
Run
p(a)
s and collectas
whilep
yields true.Run
p(a)
s and collectas
whilep
yields true. Don't run anyp
s after the first false.- Definition Classes
- IndexedSeqSubFunctions
-
final
def
toNel[A](as: IxSq[A]): Option[NonEmptyList[A]]
- Definition Classes
- IndexedSeqSubFunctions
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
toZipper[A](as: IxSq[A]): Option[Zipper[A]]
- Definition Classes
- IndexedSeqSubFunctions
-
implicit
def
vectorEqual[A](implicit A0: Equal[A]): Equal[Vector[A]]
- Definition Classes
- VectorInstances0
-
implicit
val
vectorInstance: Traverse[VectorInstances.generic.IxSq] with MonadPlus[VectorInstances.generic.IxSq] with Each[VectorInstances.generic.IxSq] with Index[VectorInstances.generic.IxSq] with Length[VectorInstances.generic.IxSq] with Zip[VectorInstances.generic.IxSq] with Unzip[VectorInstances.generic.IxSq] with IsEmpty[VectorInstances.generic.IxSq] with Align[VectorInstances.generic.IxSq] { def toIndexedSeq[A](fa: scalaz.std.vector.generic.IxSq[A]): scalaz.std.vector.generic.IxSq[A] }
- Definition Classes
- VectorInstances
-
implicit
def
vectorMonoid[A]: Monoid[Vector[A]]
- Definition Classes
- VectorInstances
-
implicit
def
vectorOrder[A](implicit A0: Order[A]): Order[Vector[A]]
- Definition Classes
- VectorInstances
-
implicit
def
vectorShow[A](implicit arg0: Show[A]): Show[Vector[A]]
- Definition Classes
- VectorInstances
-
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[A](as: IxSq[A]): Option[Zipper[A]]
- Definition Classes
- IndexedSeqSubFunctions
- object vectorSyntax extends ToVectorOps