Packages

class GraphNodeTraverse[E] extends Traverse[[β$2$]Graph[E, β$2$]]

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

Instance Constructors

  1. new GraphNodeTraverse()(implicit id: Identifiable[Any])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def as[A, B](fa: Graph[E, A], b: B): Graph[E, B]
    Definition Classes
    Functor
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  7. def collectFirst[A, B](fa: Graph[E, A])(pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    Foldable
  8. def collectFirstSome[A, B](fa: Graph[E, A])(f: (A) => Option[B]): Option[B]
    Definition Classes
    Foldable
  9. def collectFirstSomeM[G[_], A, B](fa: Graph[E, A])(f: (A) => G[Option[B]])(implicit G: Monad[G]): G[Option[B]]
    Definition Classes
    Foldable
  10. def collectFold[A, B](fa: Graph[E, A])(f: PartialFunction[A, B])(implicit B: Monoid[B]): B
    Definition Classes
    Foldable
  11. def collectFoldSome[A, B](fa: Graph[E, A])(f: (A) => Option[B])(implicit B: Monoid[B]): B
    Definition Classes
    Foldable
  12. def combineAll[A](fa: Graph[E, A])(implicit arg0: Monoid[A]): A
    Definition Classes
    Foldable
  13. def combineAllOption[A](fa: Graph[E, A])(implicit ev: Semigroup[A]): Option[A]
    Definition Classes
    Foldable
  14. def compose[G[_]](implicit arg0: Traverse[G]): Traverse[[α]Graph[E, G[α]]]
    Definition Classes
    Traverse
  15. def compose[G[_]](implicit arg0: Foldable[G]): Foldable[[α]Graph[E, G[α]]]
    Definition Classes
    Foldable
  16. def compose[G[_]](implicit arg0: Functor[G]): Functor[[α]Graph[E, G[α]]]
    Definition Classes
    Functor
  17. def compose[G[_]](implicit arg0: Invariant[G]): Invariant[[α]Graph[E, G[α]]]
    Definition Classes
    Invariant
  18. def composeContravariant[G[_]](implicit arg0: Contravariant[G]): Contravariant[[α]Graph[E, G[α]]]
    Definition Classes
    Functor → Invariant
  19. def composeFunctor[G[_]](implicit arg0: Functor[G]): Invariant[[α]Graph[E, G[α]]]
    Definition Classes
    Invariant
  20. def count[A](fa: Graph[E, A])(p: (A) => Boolean): Long
    Definition Classes
    UnorderedFoldable
  21. def dropWhile_[A](fa: Graph[E, A])(p: (A) => Boolean): List[A]
    Definition Classes
    Foldable
  22. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  24. def exists[A](fa: Graph[E, A])(p: (A) => Boolean): Boolean
    Definition Classes
    Foldable → UnorderedFoldable
  25. def existsM[G[_], A](fa: Graph[E, A])(p: (A) => G[Boolean])(implicit G: Monad[G]): G[Boolean]
    Definition Classes
    Foldable
  26. def filter_[A](fa: Graph[E, A])(p: (A) => Boolean): List[A]
    Definition Classes
    Foldable
  27. def find[A](fa: Graph[E, A])(f: (A) => Boolean): Option[A]
    Definition Classes
    Foldable
  28. def findM[G[_], A](fa: Graph[E, A])(p: (A) => G[Boolean])(implicit G: Monad[G]): G[Option[A]]
    Definition Classes
    Foldable
  29. def flatSequence[G[_], A](fgfa: Graph[E, G[Graph[E, A]]])(implicit G: Applicative[G], F: FlatMap[[β$2$]Graph[E, β$2$]]): G[Graph[E, A]]
    Definition Classes
    Traverse
  30. def flatTraverse[G[_], A, B](fa: Graph[E, A])(f: (A) => G[Graph[E, B]])(implicit G: Applicative[G], F: FlatMap[[β$2$]Graph[E, β$2$]]): G[Graph[E, B]]
    Definition Classes
    Traverse
  31. final def fmap[A, B](fa: Graph[E, A])(f: (A) => B): Graph[E, B]
    Definition Classes
    Functor
  32. def fold[A](fa: Graph[E, A])(implicit A: Monoid[A]): A
    Definition Classes
    Foldable
  33. def foldA[G[_], A](fga: Graph[E, G[A]])(implicit G: Applicative[G], A: Monoid[A]): G[A]
    Definition Classes
    Foldable
  34. def foldK[G[_], A](fga: Graph[E, G[A]])(implicit G: MonoidK[G]): G[A]
    Definition Classes
    Foldable
  35. def foldLeft[A, B](fa: Graph[E, A], b: B)(f: (B, A) => B): B
    Definition Classes
    GraphNodeTraverse → Foldable
  36. final def foldLeftM[G[_], A, B](fa: Graph[E, A], z: B)(f: (B, A) => G[B])(implicit G: Monad[G]): G[B]
    Definition Classes
    Foldable
  37. def foldM[G[_], A, B](fa: Graph[E, A], z: B)(f: (B, A) => G[B])(implicit G: Monad[G]): G[B]
    Definition Classes
    Foldable
  38. def foldMap[A, B](fa: Graph[E, A])(f: (A) => B)(implicit B: Monoid[B]): B
    Definition Classes
    Foldable
  39. def foldMapA[G[_], A, B](fa: Graph[E, A])(f: (A) => G[B])(implicit G: Applicative[G], B: Monoid[B]): G[B]
    Definition Classes
    Foldable
  40. def foldMapK[G[_], A, B](fa: Graph[E, A])(f: (A) => G[B])(implicit G: MonoidK[G]): G[B]
    Definition Classes
    Foldable
  41. def foldMapM[G[_], A, B](fa: Graph[E, A])(f: (A) => G[B])(implicit G: Monad[G], B: Monoid[B]): G[B]
    Definition Classes
    Foldable
  42. def foldRight[A, B](fa: Graph[E, A], lb: Eval[B])(f: (A, Eval[B]) => Eval[B]): Eval[B]
    Definition Classes
    GraphNodeTraverse → Foldable
  43. def foldRightDefer[G[_], A, B](fa: Graph[E, A], gb: G[B])(fn: (A, G[B]) => G[B])(implicit arg0: Defer[G]): G[B]
    Definition Classes
    Foldable
  44. def forall[A](fa: Graph[E, A])(p: (A) => Boolean): Boolean
    Definition Classes
    Foldable → UnorderedFoldable
  45. def forallM[G[_], A](fa: Graph[E, A])(p: (A) => G[Boolean])(implicit G: Monad[G]): G[Boolean]
    Definition Classes
    Foldable
  46. def fproduct[A, B](fa: Graph[E, A])(f: (A) => B): Graph[E, (A, B)]
    Definition Classes
    Functor
  47. def fproductLeft[A, B](fa: Graph[E, A])(f: (A) => B): Graph[E, (B, A)]
    Definition Classes
    Functor
  48. def get[A](fa: Graph[E, A])(idx: Long): Option[A]
    Definition Classes
    Foldable
  49. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  50. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  51. def ifF[A](fb: Graph[E, Boolean])(ifTrue: => A, ifFalse: => A): Graph[E, A]
    Definition Classes
    Functor
  52. def imap[A, B](fa: Graph[E, A])(f: (A) => B)(g: (B) => A): Graph[E, B]
    Definition Classes
    Functor → Invariant
  53. def intercalate[A](fa: Graph[E, A], a: A)(implicit A: Monoid[A]): A
    Definition Classes
    Foldable
  54. def intersperseList[A](xs: List[A], x: A): List[A]
    Attributes
    protected
    Definition Classes
    Foldable
  55. def isEmpty[A](fa: Graph[E, A]): Boolean
    Definition Classes
    Foldable → UnorderedFoldable
  56. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  57. def lift[A, B](f: (A) => B): (Graph[E, A]) => Graph[E, B]
    Definition Classes
    Functor
  58. def map[A, B](fa: Graph[E, A])(f: (A) => B): Graph[E, B]
    Definition Classes
    Traverse → Functor
  59. def mapWithIndex[A, B](fa: Graph[E, A])(f: (A, Int) => B): Graph[E, B]
    Definition Classes
    Traverse
  60. def maximumByList[A, B](fa: Graph[E, A])(f: (A) => B)(implicit arg0: Order[B]): List[A]
    Definition Classes
    Foldable
  61. def maximumByOption[A, B](fa: Graph[E, A])(f: (A) => B)(implicit arg0: Order[B]): Option[A]
    Definition Classes
    Foldable
  62. def maximumList[A](fa: Graph[E, A])(implicit A: Order[A]): List[A]
    Definition Classes
    Foldable
  63. def maximumOption[A](fa: Graph[E, A])(implicit A: Order[A]): Option[A]
    Definition Classes
    Foldable
  64. def minimumByList[A, B](fa: Graph[E, A])(f: (A) => B)(implicit arg0: Order[B]): List[A]
    Definition Classes
    Foldable
  65. def minimumByOption[A, B](fa: Graph[E, A])(f: (A) => B)(implicit arg0: Order[B]): Option[A]
    Definition Classes
    Foldable
  66. def minimumList[A](fa: Graph[E, A])(implicit A: Order[A]): List[A]
    Definition Classes
    Foldable
  67. def minimumOption[A](fa: Graph[E, A])(implicit A: Order[A]): Option[A]
    Definition Classes
    Foldable
  68. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  69. def nonEmpty[A](fa: Graph[E, A]): Boolean
    Definition Classes
    Foldable → UnorderedFoldable
  70. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  71. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  72. def partitionBifold[H[_, _], A, B, C](fa: Graph[E, A])(f: (A) => H[B, C])(implicit A: Alternative[[β$2$]Graph[E, β$2$]], H: Bifoldable[H]): (Graph[E, B], Graph[E, C])
    Definition Classes
    Foldable
  73. def partitionBifoldM[G[_], H[_, _], A, B, C](fa: Graph[E, A])(f: (A) => G[H[B, C]])(implicit A: Alternative[[β$2$]Graph[E, β$2$]], M: Monad[G], H: Bifoldable[H]): G[(Graph[E, B], Graph[E, C])]
    Definition Classes
    Foldable
  74. def partitionEither[A, B, C](fa: Graph[E, A])(f: (A) => Either[B, C])(implicit A: Alternative[[β$2$]Graph[E, β$2$]]): (Graph[E, B], Graph[E, C])
    Definition Classes
    Foldable
  75. def partitionEitherM[G[_], A, B, C](fa: Graph[E, A])(f: (A) => G[Either[B, C]])(implicit A: Alternative[[β$2$]Graph[E, β$2$]], M: Monad[G]): G[(Graph[E, B], Graph[E, C])]
    Definition Classes
    Foldable
  76. def productAll[A](fa: Graph[E, A])(implicit A: Numeric[A]): A
    Definition Classes
    Foldable
  77. def reduceLeftOption[A](fa: Graph[E, A])(f: (A, A) => A): Option[A]
    Definition Classes
    Foldable
  78. def reduceLeftToOption[A, B](fa: Graph[E, A])(f: (A) => B)(g: (B, A) => B): Option[B]
    Definition Classes
    Foldable
  79. def reduceRightOption[A](fa: Graph[E, A])(f: (A, Eval[A]) => Eval[A]): Eval[Option[A]]
    Definition Classes
    Foldable
  80. def reduceRightToOption[A, B](fa: Graph[E, A])(f: (A) => B)(g: (A, Eval[B]) => Eval[B]): Eval[Option[B]]
    Definition Classes
    Foldable
  81. def sequence[G[_], A](fga: Graph[E, G[A]])(implicit arg0: Applicative[G]): G[Graph[E, A]]
    Definition Classes
    Traverse
  82. def sequence_[G[_], A](fga: Graph[E, G[A]])(implicit arg0: Applicative[G]): G[Unit]
    Definition Classes
    Foldable
  83. def size[A](fa: Graph[E, A]): Long
    Definition Classes
    UnorderedFoldable
  84. def sliding10[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  85. def sliding11[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  86. def sliding12[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  87. def sliding13[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  88. def sliding14[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  89. def sliding15[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  90. def sliding16[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  91. def sliding17[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  92. def sliding18[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  93. def sliding19[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  94. def sliding2[A](fa: Graph[E, A]): List[(A, A)]
    Definition Classes
    FoldableNFunctions
  95. def sliding20[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  96. def sliding21[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  97. def sliding22[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  98. def sliding3[A](fa: Graph[E, A]): List[(A, A, A)]
    Definition Classes
    FoldableNFunctions
  99. def sliding4[A](fa: Graph[E, A]): List[(A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  100. def sliding5[A](fa: Graph[E, A]): List[(A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  101. def sliding6[A](fa: Graph[E, A]): List[(A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  102. def sliding7[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  103. def sliding8[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  104. def sliding9[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  105. def sumAll[A](fa: Graph[E, A])(implicit A: Numeric[A]): A
    Definition Classes
    Foldable
  106. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  107. def takeWhile_[A](fa: Graph[E, A])(p: (A) => Boolean): List[A]
    Definition Classes
    Foldable
  108. def toIterable[A](fa: Graph[E, A]): Iterable[A]
    Definition Classes
    Foldable
  109. def toList[A](fa: Graph[E, A]): List[A]
    Definition Classes
    Foldable
  110. def toString(): String
    Definition Classes
    AnyRef → Any
  111. def traverse[G[_], A, B](fa: Graph[E, A])(f: (A) => G[B])(implicit ap: Applicative[G]): G[Graph[E, B]]
    Definition Classes
    GraphNodeTraverse → Traverse
  112. def traverseTap[G[_], A, B](fa: Graph[E, A])(f: (A) => G[B])(implicit arg0: Applicative[G]): G[Graph[E, A]]
    Definition Classes
    Traverse
  113. def traverseWithIndexM[G[_], A, B](fa: Graph[E, A])(f: (A, Int) => G[B])(implicit G: Monad[G]): G[Graph[E, B]]
    Definition Classes
    Traverse
  114. def traverse_[G[_], A, B](fa: Graph[E, A])(f: (A) => G[B])(implicit G: Applicative[G]): G[Unit]
    Definition Classes
    Foldable
  115. def tupleLeft[A, B](fa: Graph[E, A], b: B): Graph[E, (B, A)]
    Definition Classes
    Functor
  116. def tupleRight[A, B](fa: Graph[E, A], b: B): Graph[E, (A, B)]
    Definition Classes
    Functor
  117. def unorderedFold[A](fa: Graph[E, A])(implicit arg0: CommutativeMonoid[A]): A
    Definition Classes
    Foldable → UnorderedFoldable
  118. def unorderedFoldMap[A, B](fa: Graph[E, A])(f: (A) => B)(implicit arg0: CommutativeMonoid[B]): B
    Definition Classes
    Foldable → UnorderedFoldable
  119. def unorderedSequence[G[_], A](fga: Graph[E, G[A]])(implicit arg0: CommutativeApplicative[G]): G[Graph[E, A]]
    Definition Classes
    Traverse → UnorderedTraverse
  120. def unorderedTraverse[G[_], A, B](sa: Graph[E, A])(f: (A) => G[B])(implicit arg0: CommutativeApplicative[G]): G[Graph[E, B]]
    Definition Classes
    Traverse → UnorderedTraverse
  121. def unzip[A, B](fab: Graph[E, (A, B)]): (Graph[E, A], Graph[E, B])
    Definition Classes
    Functor
  122. def void[A](fa: Graph[E, A]): Graph[E, Unit]
    Definition Classes
    Functor
  123. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  124. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  125. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  126. def widen[A, B >: A](fa: Graph[E, A]): Graph[E, B]
    Definition Classes
    Functor
  127. def zipWithIndex[A](fa: Graph[E, A]): Graph[E, (A, Int)]
    Definition Classes
    Traverse

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from Traverse[[β$2$]Graph[E, β$2$]]

Inherited from UnorderedTraverse[[β$2$]Graph[E, β$2$]]

Inherited from Foldable[[β$2$]Graph[E, β$2$]]

Inherited from FoldableNFunctions[[β$2$]Graph[E, β$2$]]

Inherited from UnorderedFoldable[[β$2$]Graph[E, β$2$]]

Inherited from Functor[[β$2$]Graph[E, β$2$]]

Inherited from Invariant[[β$2$]Graph[E, β$2$]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped