Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
final
def
==(arg0: Any): Boolean
-
final
def
_cons[S, A](head: A, tail: S)(implicit ev: Cons[S, A]): S
-
final
def
_cons1[S, H, T](head: H, tail: T)(implicit ev: Cons1[S, H, T]): S
-
def
_empty[S](implicit ev: Empty[S]): S
-
def
_isEmpty[S](s: S)(implicit ev: Empty[S]): Boolean
-
def
_reverse[S](s: S)(implicit ev: Reverse[S, S]): S
-
final
def
_snoc[S, A](init: S, last: A)(implicit ev: Snoc[S, A]): S
-
final
def
_snoc1[S, I, L](init: I, last: L)(implicit ev: Snoc1[S, I, L]): S
-
final
def
_uncons[S, A](s: S)(implicit ev: Cons[S, A]): Option[(A, S)]
-
final
def
_uncons1[S, H, T](s: S)(implicit ev: Cons1[S, H, T]): (H, T)
-
final
def
_unsnoc[S, A](s: S)(implicit ev: Snoc[S, A]): Option[(S, A)]
-
final
def
_unsnoc1[S, I, L](s: S)(implicit ev: Snoc1[S, I, L]): (I, L)
-
final
def
asInstanceOf[T0]: T0
-
def
at[S, I, A](i: I)(implicit ev: At[S, I, A]): Lens[S, A]
-
implicit
def
atIMap[K, V](implicit arg0: Order[K]): At[==>>[K, V], K, Option[V]]
-
implicit
def
atISet[A](implicit arg0: Order[A]): At[ISet[A], A, Boolean]
-
def
atIndex[S, I, A](implicit ev: At[S, I, Option[A]]): Index[S, I, A]
-
implicit
def
atMap[K, V]: At[Map[K, V], K, Option[V]]
-
implicit
def
atSet[A]: At[Set[A], A, Boolean]
-
val
bigDecimalToInt: Prism[BigDecimal, Int]
-
val
bigDecimalToLong: Prism[BigDecimal, Long]
-
val
bigIntToBoolean: Prism[BigInt, Boolean]
-
val
bigIntToByte: Prism[BigInt, Byte]
-
val
bigIntToChar: Prism[BigInt, Char]
-
val
bigIntToInt: Prism[BigInt, Int]
-
val
bigIntToLong: Prism[BigInt, Long]
-
-
implicit
val
charOrder: Order[Char]
-
-
def
children[A](a: A)(implicit arg0: Plated[A]): List[A]
-
def
clone(): AnyRef
-
implicit
def
cofreeCons1[S[_], A]: Cons1[Cofree[S, A], A, S[Cofree[S, A]]]
-
implicit
def
cofreeEach[S[_], A](implicit arg0: Traverse[S]): Each[Cofree[S, A], A]
-
implicit
def
cofreePlated[S[_], A](implicit arg0: Traverse[S]): Plated[Cofree[S, A]]
-
def
cofreeToStream[A]: Iso[Cofree[Option, A], OneAnd[Stream, A]]
-
def
cofreeToTree[A]: Iso[Cofree[Stream, A], Tree[A]]
-
final
def
cons[S, A](implicit ev: Cons[S, A]): Prism[S, (A, S)]
-
final
def
cons1[S, H, T](implicit ev: Cons1[S, H, T]): Iso[S, (H, T)]
-
def
curry[F, G](implicit ev: Curry[F, G]): Iso[F, G]
-
implicit
def
curry2[A, B, C]: Curry[(A, B) ⇒ C, (A) ⇒ (B) ⇒ C]
-
implicit
def
curry3[A, B, C, D]: Curry[(A, B, C) ⇒ D, (A) ⇒ (B) ⇒ (C) ⇒ D]
-
implicit
def
curry4[A, B, C, D, E]: Curry[(A, B, C, D) ⇒ E, (A) ⇒ (B) ⇒ (C) ⇒ (D) ⇒ E]
-
implicit
def
curry5[A, B, C, D, E, F]: Curry[(A, B, C, D, E) ⇒ F, (A) ⇒ (B) ⇒ (C) ⇒ (D) ⇒ (E) ⇒ F]
-
final
def
disjunctionToEither[E, A]: Iso[\/[E, A], Either[E, A]]
-
final
def
disjunctionToValidation[E, A]: Iso[\/[E, A], Validation[E, A]]
-
-
-
def
each[S, A](implicit ev: Each[S, A]): Traversal[S, A]
-
final
def
eitherToDisjunction[E, A]: Iso[Either[E, A], \/[E, A]]
-
def
empty[S](implicit ev: Empty[S]): Prism[S, Unit]
-
implicit
def
emptyISet[A]: Empty[ISet[A]]
-
implicit
def
emptySet[A]: Empty[Set[A]]
-
-
-
final
def
failure[E, A]: Prism[Validation[E, A], E]
-
def
fifth[S, A](implicit ev: Field5[S, A]): Lens[S, A]
-
def
filterIndex[S, I, A](predicate: (I) ⇒ Boolean)(implicit ev: FilterIndex[S, I, A]): Traversal[S, A]
-
def
finalize(): Unit
-
def
first[S, A](implicit ev: Field1[S, A]): Lens[S, A]
-
final
def
flip[A, B, C]: Iso[(A) ⇒ (B) ⇒ C, (B) ⇒ (A) ⇒ C]
-
final
def
flipped[A, B, C]: ((A) ⇒ (B) ⇒ C) ⇒ (B) ⇒ (A) ⇒ C
-
def
fourth[S, A](implicit ev: Field4[S, A]): Lens[S, A]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
head[S, H, T](implicit ev: Cons1[S, H, T]): Lens[S, H]
-
final
def
headOption[S, A](implicit ev: Cons[S, A]): Optional[S, A]
-
implicit
def
iListCons[A]: Cons[IList[A], A]
-
implicit
def
iListEach[A]: Each[IList[A], A]
-
implicit
def
iListEmpty[A]: Empty[IList[A]]
-
implicit
def
iListFilterIndex[A]: FilterIndex[IList[A], Int, A]
-
implicit
def
iListIndex[A]: Index[IList[A], Int, A]
-
implicit
def
iListReverse[A]: Reverse[IList[A], IList[A]]
-
implicit
def
iListSnoc[A]: Snoc[IList[A], A]
-
final
def
iListToList[A]: Iso[IList[A], List[A]]
-
implicit
def
iMapEach[K, V]: Each[==>>[K, V], V]
-
implicit
def
iMapEmpty[K, V]: Empty[==>>[K, V]]
-
implicit
def
iMapFilterIndex[K, V](implicit arg0: Order[K]): FilterIndex[==>>[K, V], K, V]
-
implicit
def
iMapIndex[K, V](implicit arg0: Order[K]): Index[==>>[K, V], K, V]
-
implicit
def
iNilEmpty[A]: Empty[INil[A]]
-
implicit
def
ilistPlated[A]: Plated[IList[A]]
-
def
index[S, I, A](i: I)(implicit ev: Index[S, I, A]): Optional[S, A]
-
final
def
init[S, I, L](implicit ev: Snoc1[S, I, L]): Lens[S, I]
-
final
def
initOption[S, A](implicit ev: Snoc[S, A]): Optional[S, S]
-
-
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
just[A]: Prism[Maybe[A], A]
-
final
def
last[S, I, L](implicit ev: Snoc1[S, I, L]): Lens[S, L]
-
final
def
lastOption[S, A](implicit ev: Snoc[S, A]): Optional[S, A]
-
final
def
left[A, B]: Prism[\/[A, B], A]
-
final
def
left3[A, B, C]: Prism[Either3[A, B, C], A]
-
final
def
leftMostLabel[A]: Lens[Tree[A], A]
-
implicit
def
listCons[A]: Cons[List[A], A]
-
implicit
def
listEach[A]: Each[List[A], A]
-
implicit
def
listEmpty[A]: Empty[List[A]]
-
implicit
def
listFilterIndex[A]: FilterIndex[List[A], Int, A]
-
implicit
def
listIndex[A]: Index[List[A], Int, A]
-
implicit
def
listPlated[A]: Plated[List[A]]
-
implicit
def
listReverse[A]: Reverse[List[A], List[A]]
-
implicit
def
listSnoc[A]: Snoc[List[A], A]
-
def
listToVector[A]: Iso[List[A], Vector[A]]
-
-
-
-
-
implicit
def
mapEach[K, V]: Each[Map[K, V], V]
-
implicit
def
mapEmpty[K, V]: Empty[Map[K, V]]
-
implicit
def
mapFilterIndex[K, V]: FilterIndex[Map[K, V], K, V]
-
implicit
def
mapIndex[K, V]: Index[Map[K, V], K, V]
-
def
mapToSet[K]: Iso[Map[K, Unit], Set[K]]
-
implicit
def
maybeEach[A]: Each[Maybe[A], A]
-
implicit
def
maybeEmpty[A]: Empty[Maybe[A]]
-
final
def
maybeToOption[A]: Iso[Maybe[A], Option[A]]
-
final
def
middle3[A, B, C]: Prism[Either3[A, B, C], B]
-
-
implicit
def
nelCons1[A]: Cons1[NonEmptyList[A], A, List[A]]
-
implicit
def
nelEach[A]: Each[NonEmptyList[A], A]
-
implicit
def
nelFilterIndex[A]: FilterIndex[NonEmptyList[A], Int, A]
-
implicit
def
nelIndex[A]: Index[NonEmptyList[A], Int, A]
-
implicit
def
nelReverse[A]: Reverse[NonEmptyList[A], NonEmptyList[A]]
-
implicit
def
nelSnoc1[A]: Snoc1[NonEmptyList[A], List[A], A]
-
final
def
nelToOneAnd[A]: Iso[NonEmptyList[A], OneAnd[List, A]]
-
implicit
val
nilEmpty: Empty[Nil.type]
-
-
final
def
nothing[A]: Prism[Maybe[A], Unit]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
implicit
def
oneAndCons1[T[_], A]: Cons1[OneAnd[T, A], A, T[A]]
-
implicit
def
oneAndEach[T[_], A](implicit ev: Each[T[A], A]): Each[OneAnd[T, A], A]
-
implicit
def
oneAndField1[T[_], A]: Field1[OneAnd[T, A], A]
-
implicit
def
oneAndIndex[T[_], A](implicit ev: Index[T[A], Int, A]): Index[OneAnd[T, A], Int, A]
-
implicit
def
optEach[A]: Each[Option[A], A]
-
final
def
optNelToList[A]: Iso[Option[NonEmptyList[A]], List[A]]
-
implicit
def
optionEmpty[A]: Empty[Option[A]]
-
final
def
optionToDisjunction[A]: Iso[Option[A], \/[Unit, A]]
-
def
pCofreeToStream[A, B]: PIso[Cofree[Option, A], Cofree[Option, B], OneAnd[Stream, A], OneAnd[Stream, B]]
-
def
pCofreeToTree[A, B]: PIso[Cofree[Stream, A], Cofree[Stream, B], Tree[A], Tree[B]]
-
final
def
pDisjunctionToEither[E1, E2, A1, A2]: PIso[\/[E1, A1], \/[E2, A2], Either[E1, A1], Either[E2, A2]]
-
final
def
pDisjunctionToValidation[E1, E2, A1, A2]: PIso[\/[E1, A1], \/[E2, A2], Validation[E1, A1], Validation[E2, A2]]
-
final
def
pEitherToDisjunction[E1, E2, A1, A2]: PIso[Either[E1, A1], Either[E2, A2], \/[E1, A1], \/[E2, A2]]
-
final
def
pFailure[E, A, F]: PPrism[Validation[E, A], Validation[F, A], E, F]
-
final
def
pIListToList[A, B]: PIso[IList[A], IList[B], List[A], List[B]]
-
final
def
pJust[A, B]: PPrism[Maybe[A], Maybe[B], A, B]
-
final
def
pLeft[A, B, C]: PPrism[\/[A, B], \/[C, B], A, C]
-
final
def
pLeft3[A, B, C, D]: PPrism[Either3[A, B, C], Either3[D, B, C], A, D]
-
def
pListToVector[A, B]: PIso[List[A], List[B], Vector[A], Vector[B]]
-
final
def
pMaybeToOption[A, B]: PIso[Maybe[A], Maybe[B], Option[A], Option[B]]
-
final
def
pMiddle3[A, B, C, D]: PPrism[Either3[A, B, C], Either3[A, D, C], B, D]
-
final
def
pNelToOneAnd[A, B]: PIso[NonEmptyList[A], NonEmptyList[B], OneAnd[List, A], OneAnd[List, B]]
-
final
def
pOptNelToList[A, B]: PIso[Option[NonEmptyList[A]], Option[NonEmptyList[B]], List[A], List[B]]
-
final
def
pOptionToDisjunction[A, B]: PIso[Option[A], Option[B], \/[Unit, A], \/[Unit, B]]
-
final
def
pRight[A, B, C]: PPrism[\/[A, B], \/[A, C], B, C]
-
final
def
pRight3[A, B, C, D]: PPrism[Either3[A, B, C], Either3[A, B, D], C, D]
-
final
def
pSome[A, B]: PPrism[Option[A], Option[B], A, B]
-
final
def
pStdLeft[A, B, C]: PPrism[Either[A, B], Either[C, B], A, C]
-
final
def
pStdRight[A, B, C]: PPrism[Either[A, B], Either[A, C], B, C]
-
final
def
pSuccess[E, A, B]: PPrism[Validation[E, A], Validation[E, B], A, B]
-
final
def
pValidationToDisjunction[E1, E2, A1, A2]: PIso[Validation[E1, A1], Validation[E2, A2], \/[E1, A1], \/[E2, A2]]
-
def
plate[A](implicit P: Plated[A]): Traversal[A, A]
-
def
remove[S, I, A](i: I)(s: S)(implicit ev: At[S, I, Option[A]]): S
-
def
reverse[S, A](implicit ev: Reverse[S, A]): Iso[S, A]
-
def
reverseFromReverseFunction[S](_reverse: (S) ⇒ S): Reverse[S, S]
-
def
rewrite[A](f: (A) ⇒ Option[A])(a: A)(implicit arg0: Plated[A]): A
-
def
rewriteOf[A](l: Setter[A, A])(f: (A) ⇒ Option[A])(a: A): A
-
final
def
right[A, B]: Prism[\/[A, B], B]
-
final
def
right3[A, B, C]: Prism[Either3[A, B, C], C]
-
final
def
rightMostLabel[A]: Lens[Tree[A], A]
-
final
def
rootLabel[A]: Lens[Tree[A], A]
-
def
second[S, A](implicit ev: Field2[S, A]): Lens[S, A]
-
def
sixth[S, A](implicit ev: Field6[S, A]): Lens[S, A]
-
final
def
snoc[S, A](implicit ev: Snoc[S, A]): Prism[S, (S, A)]
-
final
def
snoc1[S, I, L](implicit ev: Snoc1[S, I, L]): Iso[S, (I, L)]
-
final
def
some[A]: Prism[Option[A], A]
-
final
def
stdLeft[A, B]: Prism[Either[A, B], A]
-
final
def
stdRight[A, B]: Prism[Either[A, B], B]
-
implicit
def
streamCons[A]: Cons[Stream[A], A]
-
implicit
def
streamEach[A]: Each[Stream[A], A]
-
implicit
def
streamEmpty[A]: Empty[Stream[A]]
-
implicit
def
streamFilterIndex[A]: FilterIndex[Stream[A], Int, A]
-
implicit
def
streamIndex[A]: Index[Stream[A], Int, A]
-
implicit
def
streamPlated[A]: Plated[Stream[A]]
-
implicit
def
streamReverse[A]: Reverse[Stream[A], Stream[A]]
-
implicit
def
streamSnoc[A]: Snoc[Stream[A], A]
-
implicit
val
stringCons: Cons[String, Char]
-
implicit
val
stringEach: Each[String, Char]
-
implicit
val
stringEmpty: Empty[String]
-
implicit
val
stringFilterIndex: FilterIndex[String, Int, Char]
-
implicit
val
stringIndex: Index[String, Int, Char]
-
implicit
val
stringPlated: Plated[String]
-
implicit
val
stringReverse: Reverse[String, String]
-
implicit
val
stringSnoc: Snoc[String, Char]
-
val
stringToBoolean: Prism[String, Boolean]
-
val
stringToByte: Prism[String, Byte]
-
val
stringToInt: Prism[String, Int]
-
val
stringToList: Iso[String, List[Char]]
-
val
stringToLong: Prism[String, Long]
-
final
def
subForest[A]: Lens[Tree[A], Stream[Tree[A]]]
-
final
def
success[E, A]: Prism[Validation[E, A], A]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
implicit
def
tagWrapped[A, B]: Wrapped[@@[A, B], A]
-
final
def
tail[S, H, T](implicit ev: Cons1[S, H, T]): Lens[S, T]
-
final
def
tailOption[S, A](implicit ev: Cons[S, A]): Optional[S, S]
-
def
theseToDisjunction[A, B]: Prism[\&/[A, B], \/[A, B]]
-
def
third[S, A](implicit ev: Field3[S, A]): Lens[S, A]
-
implicit
def
toApplyFoldOps[S](value: S): ApplyFoldOps[S]
-
implicit
def
toApplyGetterOps[S](value: S): ApplyGetterOps[S]
-
implicit
def
toApplyIsoOps[S](value: S): ApplyIsoOps[S]
-
implicit
def
toApplyLensOps[S](value: S): ApplyLensOps[S]
-
implicit
def
toApplyOptionalOps[S](value: S): ApplyOptionalOps[S]
-
implicit
def
toApplyPrismOps[S](value: S): ApplyPrismOps[S]
-
implicit
def
toApplySetterOps[S](value: S): ApplySetterOps[S]
-
implicit
def
toApplyTraversalOps[S](value: S): ApplyTraversalOps[S]
-
def
toString(): String
-
def
transform[A](f: (A) ⇒ A)(a: A)(implicit arg0: Plated[A]): A
-
def
transformCounting[A](f: (A) ⇒ Option[A])(a: A)(implicit arg0: Plated[A]): (Int, A)
-
def
transformM[A, M[_]](f: (A) ⇒ M[A])(a: A)(implicit arg0: Plated[A], arg1: Monad[M]): M[A]
-
def
transformOf[A](l: Setter[A, A])(f: (A) ⇒ A)(a: A): A
-
def
traverseEach[S[_], A](implicit arg0: Traverse[S]): Each[S[A], A]
-
def
traverseFilterIndex[S[_], A](zipWithIndex: (S[A]) ⇒ S[(A, Int)])(implicit arg0: Traverse[S]): FilterIndex[S[A], Int, A]
-
implicit
def
treeEach[A]: Each[Tree[A], A]
-
implicit
def
treePlated[A]: Plated[Tree[A]]
-
implicit
def
treeReverse[A]: Reverse[Tree[A], Tree[A]]
-
implicit
def
tuple1Field1[A]: Field1[(A), A]
-
def
tuple1Iso[A]: Iso[(A), A]
-
implicit
def
tuple1Reverse[A]: Reverse[(A), (A)]
-
implicit
def
tuple2Cons1[A1, A2]: Cons1[(A1, A2), A1, A2]
-
implicit
def
tuple2Each[A]: Each[(A, A), A]
-
implicit
def
tuple2Field1[A1, A2]: Field1[(A1, A2), A1]
-
implicit
def
tuple2Field2[A1, A2]: Field2[(A1, A2), A2]
-
implicit
def
tuple2Reverse[A, B]: Reverse[(A, B), (B, A)]
-
implicit
def
tuple2Snoc1[A1, A2]: Snoc1[(A1, A2), A1, A2]
-
implicit
def
tuple3Cons1[A1, A2, A3]: Cons1[(A1, A2, A3), A1, (A2, A3)]
-
implicit
def
tuple3Each[A]: Each[(A, A, A), A]
-
implicit
def
tuple3Field1[A1, A2, A3]: Field1[(A1, A2, A3), A1]
-
implicit
def
tuple3Field2[A1, A2, A3]: Field2[(A1, A2, A3), A2]
-
implicit
def
tuple3Field3[A1, A2, A3]: Field3[(A1, A2, A3), A3]
-
implicit
def
tuple3Reverse[A, B, C]: Reverse[(A, B, C), (C, B, A)]
-
implicit
def
tuple3Snoc1[A1, A2, A3]: Snoc1[(A1, A2, A3), (A1, A2), A3]
-
implicit
def
tuple4Cons1[A1, A2, A3, A4]: Cons1[(A1, A2, A3, A4), A1, (A2, A3, A4)]
-
implicit
def
tuple4Each[A]: Each[(A, A, A, A), A]
-
implicit
def
tuple4Field1[A1, A2, A3, A4]: Field1[(A1, A2, A3, A4), A1]
-
implicit
def
tuple4Field2[A1, A2, A3, A4]: Field2[(A1, A2, A3, A4), A2]
-
implicit
def
tuple4Field3[A1, A2, A3, A4]: Field3[(A1, A2, A3, A4), A3]
-
implicit
def
tuple4Field4[A1, A2, A3, A4]: Field4[(A1, A2, A3, A4), A4]
-
implicit
def
tuple4Reverse[A, B, C, D]: Reverse[(A, B, C, D), (D, C, B, A)]
-
implicit
def
tuple4Snoc1[A1, A2, A3, A4]: Snoc1[(A1, A2, A3, A4), (A1, A2, A3), A4]
-
implicit
def
tuple5Cons1[A1, A2, A3, A4, A5]: Cons1[(A1, A2, A3, A4, A5), A1, (A2, A3, A4, A5)]
-
implicit
def
tuple5Each[A]: Each[(A, A, A, A, A), A]
-
implicit
def
tuple5Field1[A1, A2, A3, A4, A5]: Field1[(A1, A2, A3, A4, A5), A1]
-
implicit
def
tuple5Field2[A1, A2, A3, A4, A5]: Field2[(A1, A2, A3, A4, A5), A2]
-
implicit
def
tuple5Field3[A1, A2, A3, A4, A5]: Field3[(A1, A2, A3, A4, A5), A3]
-
implicit
def
tuple5Field4[A1, A2, A3, A4, A5]: Field4[(A1, A2, A3, A4, A5), A4]
-
implicit
def
tuple5Field5[A1, A2, A3, A4, A5]: Field5[(A1, A2, A3, A4, A5), A5]
-
implicit
def
tuple5Reverse[A, B, C, D, E]: Reverse[(A, B, C, D, E), (E, D, C, B, A)]
-
implicit
def
tuple5Snoc1[A1, A2, A3, A4, A5]: Snoc1[(A1, A2, A3, A4, A5), (A1, A2, A3, A4), A5]
-
implicit
def
tuple6Cons1[A1, A2, A3, A4, A5, A6]: Cons1[(A1, A2, A3, A4, A5, A6), A1, (A2, A3, A4, A5, A6)]
-
implicit
def
tuple6Each[A]: Each[(A, A, A, A, A, A), A]
-
implicit
def
tuple6Field1[A1, A2, A3, A4, A5, A6]: Field1[(A1, A2, A3, A4, A5, A6), A1]
-
implicit
def
tuple6Field2[A1, A2, A3, A4, A5, A6]: Field2[(A1, A2, A3, A4, A5, A6), A2]
-
implicit
def
tuple6Field3[A1, A2, A3, A4, A5, A6]: Field3[(A1, A2, A3, A4, A5, A6), A3]
-
implicit
def
tuple6Field4[A1, A2, A3, A4, A5, A6]: Field4[(A1, A2, A3, A4, A5, A6), A4]
-
implicit
def
tuple6Field5[A1, A2, A3, A4, A5, A6]: Field5[(A1, A2, A3, A4, A5, A6), A5]
-
implicit
def
tuple6Field6[A1, A2, A3, A4, A5, A6]: Field6[(A1, A2, A3, A4, A5, A6), A6]
-
implicit
def
tuple6Reverse[A, B, C, D, E, F]: Reverse[(A, B, C, D, E, F), (F, E, D, C, B, A)]
-
implicit
def
tuple6Snoc1[A1, A2, A3, A4, A5, A6]: Snoc1[(A1, A2, A3, A4, A5, A6), (A1, A2, A3, A4, A5), A6]
-
def
uncurry[F, G](implicit ev: Curry[F, G]): Iso[G, F]
-
def
universe[A](a: A)(implicit arg0: Plated[A]): Stream[A]
-
def
unwrapped[S, A](implicit ev: Wrapped[S, A]): Iso[A, S]
-
final
def
validationToDisjunction[E, A]: Iso[Validation[E, A], \/[E, A]]
-
implicit
def
vectorCons[A]: Cons[Vector[A], A]
-
implicit
def
vectorEach[A]: Each[Vector[A], A]
-
implicit
def
vectorEmpty[A]: Empty[Vector[A]]
-
implicit
def
vectorFilterIndex[A]: FilterIndex[Vector[A], Int, A]
-
implicit
def
vectorIndex[A]: Index[Vector[A], Int, A]
-
implicit
def
vectorPlated[A]: Plated[Vector[A]]
-
implicit
def
vectorReverse[A]: Reverse[Vector[A], Vector[A]]
-
implicit
def
vectorSnoc[A]: Snoc[Vector[A], A]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
wrapped[S, A](implicit ev: Wrapped[S, A]): Iso[S, A]
Deprecated Value Members
-
final
def
nelAndOneIso[A]: Iso[NonEmptyList[A], OneAnd[List, A]]
-
final
def
pNelAndOneIso[A, B]: PIso[NonEmptyList[A], NonEmptyList[B], OneAnd[List, A], OneAnd[List, B]]
-
def
theseDisjunction[A, B]: Prism[\&/[A, B], \/[A, B]]