t

scalaz

# IsomorphismFoldable1 

#### trait IsomorphismFoldable1[F[_], G[_]] extends Foldable1[F] with IsomorphismFoldable[F, G]

Source
Isomorphism.scala
Linear Supertypes
Known Subclasses
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. IsomorphismFoldable1
2. IsomorphismFoldable
3. Foldable1
4. Foldable
5. FoldableParent
6. AnyRef
7. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

### Type Members

1. trait FoldableLaw extends AnyRef
Definition Classes
Foldable
2. trait Foldable1Law extends FoldableLaw
Definition Classes
Foldable1

### Abstract Value Members

1. implicit abstract def G: Foldable1[G]
2. abstract def naturalTrans: ~>[F, G]
Attributes
protected[this]
Definition Classes
IsomorphismFoldable

### Concrete Value Members

1. final def !=(arg0: Any)
Definition Classes
AnyRef → Any
2. final def ##(): Int
Definition Classes
AnyRef → Any
3. final def ==(arg0: Any)
Definition Classes
AnyRef → Any
4. def all[A](fa: F[A])(p: (A) ⇒ Boolean)

Whether all `A`s in `fa` yield true from `p`.

Whether all `A`s in `fa` yield true from `p`.

Definition Classes
Foldable
5. def allM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]

`all` with monadic traversal.

`all` with monadic traversal.

Definition Classes
Foldable
6. def any[A](fa: F[A])(p: (A) ⇒ Boolean)

Whether any `A`s in `fa` yield true from `p`.

Whether any `A`s in `fa` yield true from `p`.

Definition Classes
Foldable
7. def anyM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]

`any` with monadic traversal.

`any` with monadic traversal.

Definition Classes
Foldable
8. final def asInstanceOf[T0]: T0
Definition Classes
Any
9. def bicompose[G[_, _]](implicit arg0: Bifoldable[G]): Bifoldable[[α, β]F[G[α, β]]]

The composition of Foldable `F` and Bifoldable `G`, `[x, y]F[G[x, y]]`, is a Bifoldable

The composition of Foldable `F` and Bifoldable `G`, `[x, y]F[G[x, y]]`, is a Bifoldable

Definition Classes
Foldable
10. def clone()
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@native() @throws( ... )
11. def collapse[X[_], A](x: F[A])(implicit A: ApplicativePlus[X]): X[A]
Definition Classes
Foldable
12. def compose[G[_]](implicit arg0: Foldable1[G]): Foldable1[[α]F[G[α]]]

The composition of Foldable1 `F` and `G`, `[x]F[G[x]]`, is a Foldable1

The composition of Foldable1 `F` and `G`, `[x]F[G[x]]`, is a Foldable1

Definition Classes
Foldable1
13. def compose[G[_]](implicit G0: Foldable[G]): Foldable[[α]F[G[α]]]

The composition of Foldables `F` and `G`, `[x]F[G[x]]`, is a Foldable

The composition of Foldables `F` and `G`, `[x]F[G[x]]`, is a Foldable

Definition Classes
Foldable
14. final def count[A](fa: F[A]): Int

Alias for `length`.

Alias for `length`.

Definition Classes
Foldable
15. def distinct[A](fa: F[A])(implicit A: Order[A]): IList[A]

`O(n log n)` complexity

`O(n log n)` complexity

Definition Classes
Foldable
16. def distinct1[A](fa: F[A])(implicit A: Order[A]): NonEmptyList[A]

`O(n log n)` complexity

`O(n log n)` complexity

Definition Classes
Foldable1
17. def distinctBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Equal[B]): IList[A]
Definition Classes
FoldableParent
18. def distinctE[A](fa: F[A])(implicit A: Equal[A]): IList[A]

`O(n2)` complexity

`O(n2)` complexity

Definition Classes
Foldable
19. def distinctE1[A](fa: F[A])(implicit A: Equal[A]): NonEmptyList[A]

`O(n2)` complexity

`O(n2)` complexity

Definition Classes
Foldable1
20. def element[A](fa: F[A], a: A)(implicit arg0: Equal[A])

Whether `a` is an element of `fa`.

Whether `a` is an element of `fa`.

Definition Classes
Foldable
21. final def empty[A](fa: F[A])

always return `false`

always return `false`

Definition Classes
Foldable1Foldable
22. final def eq(arg0: AnyRef)
Definition Classes
AnyRef
23. def equals(arg0: Any)
Definition Classes
AnyRef → Any
24. def extrema[A](fa: F[A])(implicit arg0: Order[A]): Option[(A, A)]

The smallest and largest elements of `fa` or None if `fa` is empty

The smallest and largest elements of `fa` or None if `fa` is empty

Definition Classes
FoldableParent
25. def extremaBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[(A, A)]

The elements (amin, amax) of `fa` which yield the smallest and largest values of `f(a)`, respectively, or None if `fa` is empty

The elements (amin, amax) of `fa` which yield the smallest and largest values of `f(a)`, respectively, or None if `fa` is empty

Definition Classes
FoldableParent
26. def extremaOf[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[(B, B)]

The smallest and largest values of `f(a)` for each element `a` of `fa` , or None if `fa` is empty

The smallest and largest values of `f(a)` for each element `a` of `fa` , or None if `fa` is empty

Definition Classes
FoldableParent
27. def filterLength[A](fa: F[A])(f: (A) ⇒ Boolean): Int
Definition Classes
FoldableParent
28. def finalize(): Unit
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
29. def findLeft[A](fa: F[A])(f: (A) ⇒ Boolean): Option[A]
Definition Classes
Foldable
30. final def findMapM[M[_], A, B](fa: F[A])(f: (A) ⇒ M[Option[B]])(implicit arg0: Monad[M]): M[Option[B]]

map elements in a Foldable with a monadic function and return the first element that is mapped successfully

map elements in a Foldable with a monadic function and return the first element that is mapped successfully

Definition Classes
Foldable
31. def findRight[A](fa: F[A])(f: (A) ⇒ Boolean): Option[A]
Definition Classes
Foldable
32. def fold[M](t: F[M])(implicit arg0: Monoid[M]): M

Combine the elements of a structure using a monoid.

Combine the elements of a structure using a monoid.

Definition Classes
Foldable
33. def fold1[M](t: F[M])(implicit arg0: Semigroup[M]): M
Definition Classes
Foldable1
34. def fold1Opt[A](fa: F[A])(implicit arg0: Semigroup[A]): Option[A]

Like `fold` but returning `None` if the foldable is empty and `Some` otherwise

Like `fold` but returning `None` if the foldable is empty and `Some` otherwise

Definition Classes
FoldableParent
35. def foldLeft[A, B](fa: F[A], z: B)(f: (B, A) ⇒ B): B

Left-associative fold of a structure.

Left-associative fold of a structure.

Definition Classes
IsomorphismFoldableFoldable
36. def foldLeft1[A](fa: F[A])(f: (A, A) ⇒ A): A

Left-associative fold of a structure.

Left-associative fold of a structure.

Definition Classes
Foldable1
37. def foldLeft1Opt[A](fa: F[A])(f: (A, A) ⇒ A): Option[A]
Definition Classes
Foldable
38. def foldLeftM[G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit M: Monad[G]): G[B]

Left-associative, monadic fold of a structure.

Left-associative, monadic fold of a structure.

Definition Classes
Foldable
39. def foldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit F: Monoid[B]): B

Map each element of the structure to a scalaz.Monoid, and combine the results.

Map each element of the structure to a scalaz.Monoid, and combine the results.

Definition Classes
IsomorphismFoldableFoldable
40. final def foldMap1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Semigroup[B]): B

Map each element of the structure to a scalaz.Semigroup, and combine the results.

Map each element of the structure to a scalaz.Semigroup, and combine the results.

Definition Classes
IsomorphismFoldable1Foldable1
41. def foldMap1Opt[A, B](fa: F[A])(f: (A) ⇒ B)(implicit F: Semigroup[B]): Option[B]

As `foldMap` but returning `None` if the foldable is empty and `Some` otherwise

As `foldMap` but returning `None` if the foldable is empty and `Some` otherwise

Definition Classes
Foldable1Foldable
42. final def foldMapLeft1[A, B](fa: F[A])(z: (A) ⇒ B)(f: (B, A) ⇒ B): B

Left-associative fold of a structure.

Left-associative fold of a structure.

Definition Classes
IsomorphismFoldable1Foldable1
43. def foldMapLeft1Opt[A, B](fa: F[A])(z: (A) ⇒ B)(f: (B, A) ⇒ B): Option[B]
Definition Classes
Foldable1Foldable
44. def foldMapM[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit B: Monoid[B], G: Monad[G]): G[B]

Specialization of foldRightM when `B` has a `Monoid`.

Specialization of foldRightM when `B` has a `Monoid`.

Definition Classes
Foldable
45. final def foldMapRight1[A, B](fa: F[A])(z: (A) ⇒ B)(f: (A, ⇒ B) ⇒ B): B

Right-associative fold of a structure.

Right-associative fold of a structure.

Definition Classes
IsomorphismFoldable1Foldable1
46. def foldMapRight1Opt[A, B](fa: F[A])(z: (A) ⇒ B)(f: (A, ⇒ B) ⇒ B): Option[B]
Definition Classes
Foldable1Foldable
47. def foldRight[A, B](fa: F[A], z: ⇒ B)(f: (A, ⇒ B) ⇒ B): B

Right-associative fold of a structure.

Right-associative fold of a structure.

Definition Classes
IsomorphismFoldableFoldable
48. def foldRight1[A](fa: F[A])(f: (A, ⇒ A) ⇒ A): A

Right-associative fold of a structure.

Right-associative fold of a structure.

Definition Classes
Foldable1
49. def foldRight1Opt[A](fa: F[A])(f: (A, ⇒ A) ⇒ A): Option[A]
Definition Classes
Foldable
50. def foldRightM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (A, ⇒ B) ⇒ G[B])(implicit M: Monad[G]): G[B]

Right-associative, monadic fold of a structure.

Right-associative, monadic fold of a structure.

Definition Classes
Foldable
51. def foldable1Law
Definition Classes
Foldable1
52. val foldable1Syntax: Foldable1Syntax[F]
Definition Classes
Foldable1
53. def foldableLaw
Definition Classes
Foldable
54. val foldableSyntax: FoldableSyntax[F]
Definition Classes
Foldable
55. final def foldl[A, B](fa: F[A], z: B)(f: (B) ⇒ (A) ⇒ B): B

Curried version of `foldLeft`

Curried version of `foldLeft`

Definition Classes
Foldable
56. final def foldl1[A](fa: F[A])(f: (A) ⇒ (A) ⇒ A): A

Curried `foldLeft1`.

Curried `foldLeft1`.

Definition Classes
Foldable1
57. def foldl1Opt[A](fa: F[A])(f: (A) ⇒ (A) ⇒ A): Option[A]
Definition Classes
Foldable1Foldable
58. final def foldlM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (B) ⇒ (A) ⇒ G[B])(implicit M: Monad[G]): G[B]

Curried version of `foldLeftM`

Curried version of `foldLeftM`

Definition Classes
Foldable
59. final def foldr[A, B](fa: F[A], z: ⇒ B)(f: (A) ⇒ (⇒ B) ⇒ B): B

Curried version of `foldRight`

Curried version of `foldRight`

Definition Classes
Foldable
60. final def foldr1[A](fa: F[A])(f: (A) ⇒ (⇒ A) ⇒ A): A

Curried `foldRight1`.

Curried `foldRight1`.

Definition Classes
Foldable1
61. def foldr1Opt[A](fa: F[A])(f: (A) ⇒ (⇒ A) ⇒ A): Option[A]
Definition Classes
Foldable1Foldable
62. final def foldrM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (A) ⇒ (⇒ B) ⇒ G[B])(implicit M: Monad[G]): G[B]

Curried version of `foldRightM`

Curried version of `foldRightM`

Definition Classes
Foldable
63. final def getClass(): Class[_]
Definition Classes
AnyRef → Any
Annotations
@native()
64. def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native()
65. def index[A](fa: F[A], i: Int): Option[A]

returns

the element at index `i` in a `Some`, or `None` if the given index falls outside of the range

Definition Classes
Foldable
66. def indexOr[A](fa: F[A], default: ⇒ A, i: Int): A

returns

the element at index `i`, or `default` if the given index falls outside of the range

Definition Classes
Foldable
67. def intercalate[A](fa: F[A], a: A)(implicit arg0: Monoid[A]): A

Insert an `A` between every A, yielding the sum.

Insert an `A` between every A, yielding the sum.

Definition Classes
Foldable1Foldable
68. def intercalate1[A](fa: F[A], a: A)(implicit A: Semigroup[A]): A

Insert an `A` between every A, yielding the sum.

Insert an `A` between every A, yielding the sum.

Definition Classes
Foldable1
69. final def isInstanceOf[T0]
Definition Classes
Any
70. def length[A](fa: F[A]): Int

Deforested alias for `toStream(fa).size`.

Deforested alias for `toStream(fa).size`.

Definition Classes
Foldable
71. def longDigits[A](fa: F[A])(implicit d: <:<[A, Digit]): Long
Definition Classes
Foldable
72. def maximum[A](fa: F[A])(implicit arg0: Order[A]): Option[A]

The greatest element of `fa`, or None if `fa` is empty.

The greatest element of `fa`, or None if `fa` is empty.

Definition Classes
Foldable1Foldable
73. def maximum1[A](fa: F[A])(implicit arg0: Order[A]): A

The greatest element of `fa`.

The greatest element of `fa`.

Definition Classes
Foldable1
74. def maximumBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[A]

The element `a` of `fa` which yields the greatest value of `f(a)`, or None if `fa` is empty.

The element `a` of `fa` which yields the greatest value of `f(a)`, or None if `fa` is empty.

Definition Classes
Foldable1Foldable
75. def maximumBy1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): A

The element `a` of `fa` which yield the greatest value of `f(a)`.

The element `a` of `fa` which yield the greatest value of `f(a)`.

Definition Classes
Foldable1
76. def maximumOf[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[B]

The greatest value of `f(a)` for each element `a` of `fa`, or None if `fa` is empty.

The greatest value of `f(a)` for each element `a` of `fa`, or None if `fa` is empty.

Definition Classes
Foldable1Foldable
77. def maximumOf1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): B

The greatest value of `f(a)` for each element `a` of `fa`.

The greatest value of `f(a)` for each element `a` of `fa`.

Definition Classes
Foldable1
78. def minimum[A](fa: F[A])(implicit arg0: Order[A]): Option[A]

The smallest element of `fa`, or None if `fa` is empty.

The smallest element of `fa`, or None if `fa` is empty.

Definition Classes
Foldable1Foldable
79. def minimum1[A](fa: F[A])(implicit arg0: Order[A]): A

The smallest element of `fa`.

The smallest element of `fa`.

Definition Classes
Foldable1
80. def minimumBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[A]

The element `a` of `fa` which yields the smallest value of `f(a)`, or None if `fa` is empty.

The element `a` of `fa` which yields the smallest value of `f(a)`, or None if `fa` is empty.

Definition Classes
Foldable1Foldable
81. def minimumBy1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): A

The element `a` of `fa` which yield the smallest value of `f(a)`.

The element `a` of `fa` which yield the smallest value of `f(a)`.

Definition Classes
Foldable1
82. def minimumOf[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[B]

The smallest value of `f(a)` for each element `a` of `fa`, or None if `fa` is empty.

The smallest value of `f(a)` for each element `a` of `fa`, or None if `fa` is empty.

Definition Classes
Foldable1Foldable
83. def minimumOf1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): B

The smallest value of `f(a)` for each element `a` of `fa`.

The smallest value of `f(a)` for each element `a` of `fa`.

Definition Classes
Foldable1
84. def msuml[G[_], A](fa: F[G[A]])(implicit G: PlusEmpty[G]): G[A]
Definition Classes
Foldable
85. def msuml1[G[_], A](fa: F[G[A]])(implicit G: Plus[G]): G[A]
Definition Classes
Foldable1
86. def msumlU[GA](fa: F[GA])(implicit G: Unapply[PlusEmpty, GA]): M[A]
Definition Classes
FoldableParent
87. final def ne(arg0: AnyRef)
Definition Classes
AnyRef
88. final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
89. final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
90. def product[G[_]](implicit G0: Foldable1[G]): Foldable1[[α](F[α], G[α])]

The product of Foldable1 `F` and `G`, `[x](F[x], G[x]])`, is a Foldable1

The product of Foldable1 `F` and `G`, `[x](F[x], G[x]])`, is a Foldable1

Definition Classes
Foldable1
91. def product[G[_]](implicit G0: Foldable[G]): Foldable[[α](F[α], G[α])]

The product of Foldables `F` and `G`, `[x](F[x], G[x]])`, is a Foldable

The product of Foldables `F` and `G`, `[x](F[x], G[x]])`, is a Foldable

Definition Classes
Foldable
92. def product0[G[_]](implicit G0: Foldable[G]): Foldable1[[α](F[α], G[α])]

The product of Foldable1 `F` and Foldable `G`, `[x](F[x], G[x]])`, is a Foldable1

The product of Foldable1 `F` and Foldable `G`, `[x](F[x], G[x]])`, is a Foldable1

Definition Classes
Foldable1
93. def product0[G[_]](implicit G0: Foldable1[G]): Foldable1[[α](F[α], G[α])]

The product of Foldable `F` and Foldable1 `G`, `[x](F[x], G[x]])`, is a Foldable1

The product of Foldable `F` and Foldable1 `G`, `[x](F[x], G[x]])`, is a Foldable1

Definition Classes
Foldable
94. def scanLeft1[A](fa: F[A])(f: (A, A) ⇒ A): NonEmptyList[A]
Definition Classes
Foldable1
95. def scanRight1[A](fa: F[A])(f: (A, A) ⇒ A): NonEmptyList[A]
Definition Classes
Foldable1
96. def selectSplit[A](fa: F[A])(p: (A) ⇒ Boolean): List[NonEmptyList[A]]

Selects groups of elements that satisfy p and discards others.

Selects groups of elements that satisfy p and discards others.

Definition Classes
Foldable
97. def sequence1_[M[_], A](fa: F[M[A]])(implicit a: Apply[M], x: Semigroup[M[A]]): M[Unit]
Definition Classes
Foldable1
98. def sequenceF_[M[_], A](ffa: F[Free[M, A]]): Free[M, Unit]

`sequence_` for Free.

`sequence_` for Free. collapses into a single Free *

Definition Classes
Foldable
99. def sequenceS_[S, A](fga: F[State[S, A]]): State[S, Unit]

`sequence_` specialized to `State` *

`sequence_` specialized to `State` *

Definition Classes
Foldable
100. def sequence_[M[_], A](fa: F[M[A]])(implicit a: Applicative[M]): M[Unit]

Strict sequencing in an applicative functor `M` that ignores the value in `fa`.

Strict sequencing in an applicative functor `M` that ignores the value in `fa`.

Definition Classes
Foldable
101. def splitBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Equal[B]): IList[(B, NonEmptyList[A])]

Splits the elements into groups that produce the same result by a function f.

Splits the elements into groups that produce the same result by a function f.

Definition Classes
FoldableParent
102. def splitByRelation[A](fa: F[A])(r: (A, A) ⇒ Boolean): IList[NonEmptyList[A]]

Splits into groups of elements that are transitively dependant by a relation r.

Splits into groups of elements that are transitively dependant by a relation r.

Definition Classes
FoldableParent
103. def splitWith[A](fa: F[A])(p: (A) ⇒ Boolean): List[NonEmptyList[A]]

Splits the elements into groups that alternatively satisfy and don't satisfy the predicate p.

Splits the elements into groups that alternatively satisfy and don't satisfy the predicate p.

Definition Classes
Foldable
104. def suml[A](fa: F[A])(implicit A: Monoid[A]): A
Definition Classes
Foldable
105. def suml1[A](fa: F[A])(implicit A: Semigroup[A]): A
Definition Classes
Foldable1
106. def suml1Opt[A](fa: F[A])(implicit A: Semigroup[A]): Option[A]
Definition Classes
Foldable
107. def sumr[A](fa: F[A])(implicit A: Monoid[A]): A
Definition Classes
Foldable
108. def sumr1[A](fa: F[A])(implicit A: Semigroup[A]): A
Definition Classes
Foldable1
109. def sumr1Opt[A](fa: F[A])(implicit A: Semigroup[A]): Option[A]
Definition Classes
Foldable
110. final def synchronized[T0](arg0: ⇒ T0): T0
Definition Classes
AnyRef
111. def toEphemeralStream[A](fa: F[A]): EphemeralStream[A]
Definition Classes
Foldable
112. def toIList[A](fa: F[A]): IList[A]
Definition Classes
Foldable
113. def toList[A](fa: F[A]): List[A]
Definition Classes
Foldable
114. def toNel[A](fa: F[A]): NonEmptyList[A]
Definition Classes
Foldable1
115. def toSet[A](fa: F[A]): Set[A]
Definition Classes
Foldable
116. def toStream[A](fa: F[A]): Stream[A]
Definition Classes
Foldable
117. def toString()
Definition Classes
AnyRef → Any
118. def toVector[A](fa: F[A]): Vector[A]
Definition Classes
Foldable
119. def traverse1_[M[_], A, B](fa: F[A])(f: (A) ⇒ M[B])(implicit a: Apply[M], x: Semigroup[M[B]]): M[Unit]
Definition Classes
Foldable1
120. def traverseS_[S, A, B](fa: F[A])(f: (A) ⇒ State[S, B]): State[S, Unit]

`traverse_` specialized to `State` *

`traverse_` specialized to `State` *

Definition Classes
Foldable
121. final def traverseU_[A, GB](fa: F[A])(f: (A) ⇒ GB)(implicit G: Unapply[Applicative, GB]): M[Unit]

A version of `traverse_` that infers the type constructor `M`.

A version of `traverse_` that infers the type constructor `M`.

Definition Classes
Foldable
122. def traverse_[M[_], A, B](fa: F[A])(f: (A) ⇒ M[B])(implicit a: Applicative[M]): M[Unit]

Strict traversal in an applicative functor `M` that ignores the result of `f`.

Strict traversal in an applicative functor `M` that ignores the result of `f`.

Definition Classes
Foldable
123. final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
124. final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
125. final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@native() @throws( ... )

### Deprecated Value Members

1. def to[A, G[_]](fa: F[A])(implicit c: CanBuildFrom[Nothing, A, G[A]]): G[A]

Definition Classes
Foldable
Annotations
@deprecated
Deprecated

(Since version 7.2.22) removed in scalaz 7.3

Exceptions thrown

`NoSuchMethodException` if Scala 2.13 or later