class GraphNodeTraverse[E] extends Traverse[[β$2$]Graph[E, β$2$]]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- GraphNodeTraverse
- Traverse
- UnorderedTraverse
- Foldable
- FoldableNFunctions
- UnorderedFoldable
- Functor
- Invariant
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new GraphNodeTraverse()(implicit id: Identifiable[Any])
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def as[A, B](fa: Graph[E, A], b: B): Graph[E, B]
- Definition Classes
- Functor
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- def collectFirst[A, B](fa: Graph[E, A])(pf: PartialFunction[A, B]): Option[B]
- Definition Classes
- Foldable
- def collectFirstSome[A, B](fa: Graph[E, A])(f: (A) => Option[B]): Option[B]
- Definition Classes
- Foldable
- def collectFirstSomeM[G[_], A, B](fa: Graph[E, A])(f: (A) => G[Option[B]])(implicit G: Monad[G]): G[Option[B]]
- Definition Classes
- Foldable
- def collectFold[A, B](fa: Graph[E, A])(f: PartialFunction[A, B])(implicit B: Monoid[B]): B
- Definition Classes
- Foldable
- def collectFoldSome[A, B](fa: Graph[E, A])(f: (A) => Option[B])(implicit B: Monoid[B]): B
- Definition Classes
- Foldable
- def combineAll[A](fa: Graph[E, A])(implicit arg0: Monoid[A]): A
- Definition Classes
- Foldable
- def combineAllOption[A](fa: Graph[E, A])(implicit ev: Semigroup[A]): Option[A]
- Definition Classes
- Foldable
- def compose[G[_]](implicit arg0: Traverse[G]): Traverse[[α]Graph[E, G[α]]]
- Definition Classes
- Traverse
- def compose[G[_]](implicit arg0: Foldable[G]): Foldable[[α]Graph[E, G[α]]]
- Definition Classes
- Foldable
- def compose[G[_]](implicit arg0: Functor[G]): Functor[[α]Graph[E, G[α]]]
- Definition Classes
- Functor
- def compose[G[_]](implicit arg0: Invariant[G]): Invariant[[α]Graph[E, G[α]]]
- Definition Classes
- Invariant
- def composeContravariant[G[_]](implicit arg0: Contravariant[G]): Contravariant[[α]Graph[E, G[α]]]
- Definition Classes
- Functor → Invariant
- def composeFunctor[G[_]](implicit arg0: Functor[G]): Invariant[[α]Graph[E, G[α]]]
- Definition Classes
- Invariant
- def count[A](fa: Graph[E, A])(p: (A) => Boolean): Long
- Definition Classes
- UnorderedFoldable
- def dropWhile_[A](fa: Graph[E, A])(p: (A) => Boolean): List[A]
- Definition Classes
- Foldable
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def exists[A](fa: Graph[E, A])(p: (A) => Boolean): Boolean
- Definition Classes
- Foldable → UnorderedFoldable
- def existsM[G[_], A](fa: Graph[E, A])(p: (A) => G[Boolean])(implicit G: Monad[G]): G[Boolean]
- Definition Classes
- Foldable
- def filter_[A](fa: Graph[E, A])(p: (A) => Boolean): List[A]
- Definition Classes
- Foldable
- def find[A](fa: Graph[E, A])(f: (A) => Boolean): Option[A]
- Definition Classes
- Foldable
- def findM[G[_], A](fa: Graph[E, A])(p: (A) => G[Boolean])(implicit G: Monad[G]): G[Option[A]]
- Definition Classes
- Foldable
- 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
- 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
- final def fmap[A, B](fa: Graph[E, A])(f: (A) => B): Graph[E, B]
- Definition Classes
- Functor
- def fold[A](fa: Graph[E, A])(implicit A: Monoid[A]): A
- Definition Classes
- Foldable
- def foldA[G[_], A](fga: Graph[E, G[A]])(implicit G: Applicative[G], A: Monoid[A]): G[A]
- Definition Classes
- Foldable
- def foldK[G[_], A](fga: Graph[E, G[A]])(implicit G: MonoidK[G]): G[A]
- Definition Classes
- Foldable
- def foldLeft[A, B](fa: Graph[E, A], b: B)(f: (B, A) => B): B
- Definition Classes
- GraphNodeTraverse → Foldable
- 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
- 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
- def foldMap[A, B](fa: Graph[E, A])(f: (A) => B)(implicit B: Monoid[B]): B
- Definition Classes
- Foldable
- 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
- def foldMapK[G[_], A, B](fa: Graph[E, A])(f: (A) => G[B])(implicit G: MonoidK[G]): G[B]
- Definition Classes
- Foldable
- 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
- def foldRight[A, B](fa: Graph[E, A], lb: Eval[B])(f: (A, Eval[B]) => Eval[B]): Eval[B]
- Definition Classes
- GraphNodeTraverse → Foldable
- 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
- def forall[A](fa: Graph[E, A])(p: (A) => Boolean): Boolean
- Definition Classes
- Foldable → UnorderedFoldable
- def forallM[G[_], A](fa: Graph[E, A])(p: (A) => G[Boolean])(implicit G: Monad[G]): G[Boolean]
- Definition Classes
- Foldable
- def fproduct[A, B](fa: Graph[E, A])(f: (A) => B): Graph[E, (A, B)]
- Definition Classes
- Functor
- def fproductLeft[A, B](fa: Graph[E, A])(f: (A) => B): Graph[E, (B, A)]
- Definition Classes
- Functor
- def get[A](fa: Graph[E, A])(idx: Long): Option[A]
- Definition Classes
- Foldable
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def ifF[A](fb: Graph[E, Boolean])(ifTrue: => A, ifFalse: => A): Graph[E, A]
- Definition Classes
- Functor
- def imap[A, B](fa: Graph[E, A])(f: (A) => B)(g: (B) => A): Graph[E, B]
- Definition Classes
- Functor → Invariant
- def intercalate[A](fa: Graph[E, A], a: A)(implicit A: Monoid[A]): A
- Definition Classes
- Foldable
- def intersperseList[A](xs: List[A], x: A): List[A]
- Attributes
- protected
- Definition Classes
- Foldable
- def isEmpty[A](fa: Graph[E, A]): Boolean
- Definition Classes
- Foldable → UnorderedFoldable
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def lift[A, B](f: (A) => B): (Graph[E, A]) => Graph[E, B]
- Definition Classes
- Functor
- def map[A, B](fa: Graph[E, A])(f: (A) => B): Graph[E, B]
- Definition Classes
- Traverse → Functor
- def mapWithIndex[A, B](fa: Graph[E, A])(f: (A, Int) => B): Graph[E, B]
- Definition Classes
- Traverse
- def maximumByList[A, B](fa: Graph[E, A])(f: (A) => B)(implicit arg0: Order[B]): List[A]
- Definition Classes
- Foldable
- def maximumByOption[A, B](fa: Graph[E, A])(f: (A) => B)(implicit arg0: Order[B]): Option[A]
- Definition Classes
- Foldable
- def maximumList[A](fa: Graph[E, A])(implicit A: Order[A]): List[A]
- Definition Classes
- Foldable
- def maximumOption[A](fa: Graph[E, A])(implicit A: Order[A]): Option[A]
- Definition Classes
- Foldable
- def minimumByList[A, B](fa: Graph[E, A])(f: (A) => B)(implicit arg0: Order[B]): List[A]
- Definition Classes
- Foldable
- def minimumByOption[A, B](fa: Graph[E, A])(f: (A) => B)(implicit arg0: Order[B]): Option[A]
- Definition Classes
- Foldable
- def minimumList[A](fa: Graph[E, A])(implicit A: Order[A]): List[A]
- Definition Classes
- Foldable
- def minimumOption[A](fa: Graph[E, A])(implicit A: Order[A]): Option[A]
- Definition Classes
- Foldable
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nonEmpty[A](fa: Graph[E, A]): Boolean
- Definition Classes
- Foldable → UnorderedFoldable
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- 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
- 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
- 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
- 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
- def productAll[A](fa: Graph[E, A])(implicit A: Numeric[A]): A
- Definition Classes
- Foldable
- def reduceLeftOption[A](fa: Graph[E, A])(f: (A, A) => A): Option[A]
- Definition Classes
- Foldable
- def reduceLeftToOption[A, B](fa: Graph[E, A])(f: (A) => B)(g: (B, A) => B): Option[B]
- Definition Classes
- Foldable
- def reduceRightOption[A](fa: Graph[E, A])(f: (A, Eval[A]) => Eval[A]): Eval[Option[A]]
- Definition Classes
- Foldable
- def reduceRightToOption[A, B](fa: Graph[E, A])(f: (A) => B)(g: (A, Eval[B]) => Eval[B]): Eval[Option[B]]
- Definition Classes
- Foldable
- def sequence[G[_], A](fga: Graph[E, G[A]])(implicit arg0: Applicative[G]): G[Graph[E, A]]
- Definition Classes
- Traverse
- def sequence_[G[_], A](fga: Graph[E, G[A]])(implicit arg0: Applicative[G]): G[Unit]
- Definition Classes
- Foldable
- def size[A](fa: Graph[E, A]): Long
- Definition Classes
- UnorderedFoldable
- def sliding10[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A)]
- Definition Classes
- FoldableNFunctions
- def sliding11[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A)]
- Definition Classes
- FoldableNFunctions
- def sliding12[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A)]
- Definition Classes
- FoldableNFunctions
- def sliding13[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A)]
- Definition Classes
- FoldableNFunctions
- 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
- 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
- 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
- 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
- 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
- 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
- def sliding2[A](fa: Graph[E, A]): List[(A, A)]
- Definition Classes
- FoldableNFunctions
- 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
- 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
- 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
- def sliding3[A](fa: Graph[E, A]): List[(A, A, A)]
- Definition Classes
- FoldableNFunctions
- def sliding4[A](fa: Graph[E, A]): List[(A, A, A, A)]
- Definition Classes
- FoldableNFunctions
- def sliding5[A](fa: Graph[E, A]): List[(A, A, A, A, A)]
- Definition Classes
- FoldableNFunctions
- def sliding6[A](fa: Graph[E, A]): List[(A, A, A, A, A, A)]
- Definition Classes
- FoldableNFunctions
- def sliding7[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A)]
- Definition Classes
- FoldableNFunctions
- def sliding8[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A)]
- Definition Classes
- FoldableNFunctions
- def sliding9[A](fa: Graph[E, A]): List[(A, A, A, A, A, A, A, A, A)]
- Definition Classes
- FoldableNFunctions
- def sumAll[A](fa: Graph[E, A])(implicit A: Numeric[A]): A
- Definition Classes
- Foldable
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def takeWhile_[A](fa: Graph[E, A])(p: (A) => Boolean): List[A]
- Definition Classes
- Foldable
- def toIterable[A](fa: Graph[E, A]): Iterable[A]
- Definition Classes
- Foldable
- def toList[A](fa: Graph[E, A]): List[A]
- Definition Classes
- Foldable
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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
- def traverseTap[G[_], A, B](fa: Graph[E, A])(f: (A) => G[B])(implicit arg0: Applicative[G]): G[Graph[E, A]]
- Definition Classes
- Traverse
- 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
- def traverse_[G[_], A, B](fa: Graph[E, A])(f: (A) => G[B])(implicit G: Applicative[G]): G[Unit]
- Definition Classes
- Foldable
- def tupleLeft[A, B](fa: Graph[E, A], b: B): Graph[E, (B, A)]
- Definition Classes
- Functor
- def tupleRight[A, B](fa: Graph[E, A], b: B): Graph[E, (A, B)]
- Definition Classes
- Functor
- def unorderedFold[A](fa: Graph[E, A])(implicit arg0: CommutativeMonoid[A]): A
- Definition Classes
- Foldable → UnorderedFoldable
- def unorderedFoldMap[A, B](fa: Graph[E, A])(f: (A) => B)(implicit arg0: CommutativeMonoid[B]): B
- Definition Classes
- Foldable → UnorderedFoldable
- def unorderedSequence[G[_], A](fga: Graph[E, G[A]])(implicit arg0: CommutativeApplicative[G]): G[Graph[E, A]]
- Definition Classes
- Traverse → UnorderedTraverse
- 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
- def unzip[A, B](fab: Graph[E, (A, B)]): (Graph[E, A], Graph[E, B])
- Definition Classes
- Functor
- def void[A](fa: Graph[E, A]): Graph[E, Unit]
- Definition Classes
- Functor
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def widen[A, B >: A](fa: Graph[E, A]): Graph[E, B]
- Definition Classes
- Functor
- def zipWithIndex[A](fa: Graph[E, A]): Graph[E, (A, Int)]
- Definition Classes
- Traverse