Trait

higherkindness.droste.util

DefaultTraverse

Related Doc: package util

Permalink

trait DefaultTraverse[F[_]] extends Traverse[F]

Linear Supertypes
Traverse[F], UnorderedTraverse[F], Foldable[F], UnorderedFoldable[F], Functor[F], Invariant[F], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DefaultTraverse
  2. Traverse
  3. UnorderedTraverse
  4. Foldable
  5. UnorderedFoldable
  6. Functor
  7. Invariant
  8. Serializable
  9. Serializable
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def traverse[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]

    Permalink
    Definition Classes
    Traverse

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def as[A, B](fa: F[A], b: B): F[B]

    Permalink
    Definition Classes
    Functor
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def collectFirst[A, B](fa: F[A])(pf: PartialFunction[A, B]): Option[B]

    Permalink
    Definition Classes
    Foldable
  8. def collectFirstSome[A, B](fa: F[A])(f: (A) ⇒ Option[B]): Option[B]

    Permalink
    Definition Classes
    Foldable
  9. def combineAll[A](fa: F[A])(implicit arg0: Monoid[A]): A

    Permalink
    Definition Classes
    Foldable
  10. def compose[G[_]](implicit arg0: Traverse[G]): Traverse[[α]F[G[α]]]

    Permalink
    Definition Classes
    Traverse
  11. def compose[G[_]](implicit arg0: Foldable[G]): Foldable[[α]F[G[α]]]

    Permalink
    Definition Classes
    Foldable
  12. def compose[G[_]](implicit arg0: Functor[G]): Functor[[α]F[G[α]]]

    Permalink
    Definition Classes
    Functor
  13. def compose[G[_]](implicit arg0: Invariant[G]): Invariant[[α]F[G[α]]]

    Permalink
    Definition Classes
    Invariant
  14. def composeContravariant[G[_]](implicit arg0: Contravariant[G]): Contravariant[[α]F[G[α]]]

    Permalink
    Definition Classes
    Functor → Invariant
  15. def composeFunctor[G[_]](implicit arg0: Functor[G]): Invariant[[α]F[G[α]]]

    Permalink
    Definition Classes
    Invariant
  16. def dropWhile_[A](fa: F[A])(p: (A) ⇒ Boolean): List[A]

    Permalink
    Definition Classes
    Foldable
  17. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  18. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  19. def exists[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    Foldable → UnorderedFoldable
  20. def existsM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]

    Permalink
    Definition Classes
    Foldable
  21. def filter_[A](fa: F[A])(p: (A) ⇒ Boolean): List[A]

    Permalink
    Definition Classes
    Foldable
  22. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  23. def find[A](fa: F[A])(f: (A) ⇒ Boolean): Option[A]

    Permalink
    Definition Classes
    Foldable
  24. def flatSequence[G[_], A](fgfa: F[G[F[A]]])(implicit G: Applicative[G], F: FlatMap[F]): G[F[A]]

    Permalink
    Definition Classes
    Traverse
  25. def flatTraverse[G[_], A, B](fa: F[A])(f: (A) ⇒ G[F[B]])(implicit G: Applicative[G], F: FlatMap[F]): G[F[B]]

    Permalink
    Definition Classes
    Traverse
  26. final def fmap[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

    Permalink
    Definition Classes
    Functor
  27. def fold[A](fa: F[A])(implicit A: Monoid[A]): A

    Permalink
    Definition Classes
    Foldable
  28. def foldK[G[_], A](fga: F[G[A]])(implicit G: MonoidK[G]): G[A]

    Permalink
    Definition Classes
    Foldable
  29. def foldLeft[A, B](fa: F[A], b: B)(f: (B, A) ⇒ B): B

    Permalink
    Definition Classes
    DefaultTraverse → Foldable
  30. final def foldLeftM[G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit G: Monad[G]): G[B]

    Permalink
    Definition Classes
    Foldable
  31. def foldM[G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit G: Monad[G]): G[B]

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

    Permalink
    Definition Classes
    DefaultTraverse → Foldable
  33. def foldMapM[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: Monad[G], B: Monoid[B]): G[B]

    Permalink
    Definition Classes
    Foldable
  34. def foldRight[A, B](fa: F[A], lb: Eval[B])(f: (A, Eval[B]) ⇒ Eval[B]): Eval[B]

    Permalink
    Definition Classes
    DefaultTraverse → Foldable
  35. def forall[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    Foldable → UnorderedFoldable
  36. def forallM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]

    Permalink
    Definition Classes
    Foldable
  37. def fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]

    Permalink
    Definition Classes
    Functor
  38. def get[A](fa: F[A])(idx: Long): Option[A]

    Permalink
    Definition Classes
    Foldable
  39. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  40. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  41. def imap[A, B](fa: F[A])(f: (A) ⇒ B)(g: (B) ⇒ A): F[B]

    Permalink
    Definition Classes
    Functor → Invariant
  42. def intercalate[A](fa: F[A], a: A)(implicit A: Monoid[A]): A

    Permalink
    Definition Classes
    Foldable
  43. def intersperseList[A](xs: List[A], x: A): List[A]

    Permalink
    Attributes
    protected
    Definition Classes
    Foldable
  44. def isEmpty[A](fa: F[A]): Boolean

    Permalink
    Definition Classes
    Foldable → UnorderedFoldable
  45. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  46. def lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]

    Permalink
    Definition Classes
    Functor
  47. def map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

    Permalink
    Definition Classes
    Traverse → Functor
  48. def mapWithIndex[A, B](fa: F[A])(f: (A, Int) ⇒ B): F[B]

    Permalink
    Definition Classes
    Traverse
  49. def maximumOption[A](fa: F[A])(implicit A: Order[A]): Option[A]

    Permalink
    Definition Classes
    Foldable
  50. def minimumOption[A](fa: F[A])(implicit A: Order[A]): Option[A]

    Permalink
    Definition Classes
    Foldable
  51. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  52. def nonEmpty[A](fa: F[A]): Boolean

    Permalink
    Definition Classes
    Foldable → UnorderedFoldable
  53. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  54. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  55. def partitionEither[A, B, C](fa: F[A])(f: (A) ⇒ Either[B, C])(implicit A: Alternative[F]): (F[B], F[C])

    Permalink
    Definition Classes
    Foldable
  56. def reduceLeftOption[A](fa: F[A])(f: (A, A) ⇒ A): Option[A]

    Permalink
    Definition Classes
    Foldable
  57. def reduceLeftToOption[A, B](fa: F[A])(f: (A) ⇒ B)(g: (B, A) ⇒ B): Option[B]

    Permalink
    Definition Classes
    Foldable
  58. def reduceRightOption[A](fa: F[A])(f: (A, Eval[A]) ⇒ Eval[A]): Eval[Option[A]]

    Permalink
    Definition Classes
    Foldable
  59. def reduceRightToOption[A, B](fa: F[A])(f: (A) ⇒ B)(g: (A, Eval[B]) ⇒ Eval[B]): Eval[Option[B]]

    Permalink
    Definition Classes
    Foldable
  60. def sequence[G[_], A](fga: F[G[A]])(implicit arg0: Applicative[G]): G[F[A]]

    Permalink
    Definition Classes
    Traverse
  61. def sequence_[G[_], A](fga: F[G[A]])(implicit arg0: Applicative[G]): G[Unit]

    Permalink
    Definition Classes
    Foldable
  62. def size[A](fa: F[A]): Long

    Permalink
    Definition Classes
    UnorderedFoldable
  63. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  64. def takeWhile_[A](fa: F[A])(p: (A) ⇒ Boolean): List[A]

    Permalink
    Definition Classes
    Foldable
  65. def toList[A](fa: F[A]): List[A]

    Permalink
    Definition Classes
    Foldable
  66. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  67. def traverseWithIndexM[G[_], A, B](fa: F[A])(f: (A, Int) ⇒ G[B])(implicit G: Monad[G]): G[F[B]]

    Permalink
    Definition Classes
    Traverse
  68. def traverse_[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: Applicative[G]): G[Unit]

    Permalink
    Definition Classes
    Foldable
  69. def tupleLeft[A, B](fa: F[A], b: B): F[(B, A)]

    Permalink
    Definition Classes
    Functor
  70. def tupleRight[A, B](fa: F[A], b: B): F[(A, B)]

    Permalink
    Definition Classes
    Functor
  71. def unorderedFold[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): A

    Permalink
    Definition Classes
    Foldable → UnorderedFoldable
  72. def unorderedFoldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: CommutativeMonoid[B]): B

    Permalink
    Definition Classes
    Foldable → UnorderedFoldable
  73. def unorderedSequence[G[_], A](fga: F[G[A]])(implicit arg0: CommutativeApplicative[G]): G[F[A]]

    Permalink
    Definition Classes
    Traverse → UnorderedTraverse
  74. def unorderedTraverse[G[_], A, B](sa: F[A])(f: (A) ⇒ G[B])(implicit arg0: CommutativeApplicative[G]): G[F[B]]

    Permalink
    Definition Classes
    Traverse → UnorderedTraverse
  75. def void[A](fa: F[A]): F[Unit]

    Permalink
    Definition Classes
    Functor
  76. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  77. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  78. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  79. def widen[A, B >: A](fa: F[A]): F[B]

    Permalink
    Definition Classes
    Functor
  80. def zipWithIndex[A](fa: F[A]): F[(A, Int)]

    Permalink
    Definition Classes
    Traverse

Inherited from Traverse[F]

Inherited from UnorderedTraverse[F]

Inherited from Foldable[F]

Inherited from UnorderedFoldable[F]

Inherited from Functor[F]

Inherited from Invariant[F]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped