class UserConstrainedGraphImpl[N, E[+X] <: EdgeLikeIn[X]] extends DefaultGraphImpl[N, E] with UserConstrainedGraph[N, E, DefaultGraphImpl[N, E]]
- Annotations
- @SerialVersionUID()
Linear Supertypes
Type Hierarchy
Ordering
- Alphabetic
- By Inheritance
Inherited
- UserConstrainedGraphImpl
- UserConstrainedGraph
- DefaultGraphImpl
- GraphTraversalImpl
- State
- TraverserImpl
- AdjacencyListGraph
- AdjacencyListGraph
- AdjacencyListBase
- Graph
- Graph
- GraphLike
- Constrained
- ConstraintMethods
- GraphOps
- Graph
- Graph
- GraphLike
- GraphDegree
- GraphTraversal
- GraphBase
- Serializable
- GraphAsSet
- Set
- Equals
- SetOps
- Function1
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
Implicitly
- by iterableOnceExtensionMethods
- by EdgeAssoc
- by predicateToNodePredicate
- by anyToNode
- by ChainingOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new UserConstrainedGraphImpl(iniNodes: Iterable[N] = Nil, iniEdges: Iterable[E[N]] = Nil)(implicit edgeT: ClassTag[E[N]], config: DefaultGraphImpl.Config)
Type Members
- final class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl
- Attributes
- protected
- Definition Classes
- DefaultGraphImpl
- Annotations
- @SerialVersionUID()
- sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractIterable[T]
- Definition Classes
- GraphTraversal
- class AnyEdgeLazyCycle extends (GraphTraversalImpl.this)#AnyEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- class AnyEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- abstract class Component extends Properties
- Definition Classes
- GraphTraversal
- case class ComponentTraverser extends (GraphTraversalImpl.this)#ComponentTraverser with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- type Config = ConstrainedConfig
- Attributes
- protected
- Definition Classes
- DefaultGraphImpl → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike
- trait Cycle extends Path
- Definition Classes
- GraphTraversal
- type CycleNodeOrTopologicalOrder = Either[NodeT, TopologicalOrder[NodeT]]
- Definition Classes
- GraphTraversal
- trait DegreeFunction extends ((GraphDegree.this)#NodeT) => Int
- Definition Classes
- GraphDegree
- type DegreeNodeSeqEntry = (Int, NodeT)
- Definition Classes
- GraphDegree
- final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]
- Definition Classes
- GraphDegree
- trait DownUpTraverser[A, +This <: (GraphTraversalImpl.this)#DownUpTraverser[A, This]] extends (GraphTraversalImpl.this)#TraverserMethods[A, This] with (GraphTraversalImpl.this)#Impl[A, This]
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- trait Edge extends Serializable
- Definition Classes
- GraphBase
- class EdgeBase extends InnerEdgeParam[N, E, (collection.GraphLike.this)#NodeT, E] with (collection.GraphLike.this)#InnerEdge
- Definition Classes
- GraphLike
- type EdgeFilter = (EdgeT) => Boolean
- Definition Classes
- GraphBase
- sealed trait EdgeOrdering extends Ordering[GraphBase.EdgeT] with ElemOrdering
- Definition Classes
- GraphBase
- class EdgeSet extends immutable.AdjacencyListGraph.This.EdgeSet with InclExcl[immutable.AdjacencyListGraph.This.EdgeT, Set[immutable.AdjacencyListGraph.This.EdgeT]]
- Definition Classes
- AdjacencyListGraph
- type EdgeSetT = EdgeSet
- Definition Classes
- AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphBase
- type EdgeT = EdgeBase
- Definition Classes
- AdjacencyListGraph → GraphLike → GraphBase
- sealed trait ElemOrdering extends AnyRef
- Attributes
- protected
- Definition Classes
- GraphBase
- trait ExtendedNodeVisitor[U] extends (GraphTraversal.NodeT) => U
- Definition Classes
- GraphTraversal
- trait Filter[T] extends (T) => Boolean
- Definition Classes
- GraphDegree
- abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef
- Attributes
- protected
- Definition Classes
- GraphTraversal
- trait Impl[A, +This <: GraphTraversalImpl.Traverser[A, This] with GraphTraversalImpl.Impl[A, This]] extends GraphTraversalImpl.TraverserMethods[A, This] with GraphTraversalImpl.Traverser[A, This]
- Attributes
- protected[collection]
- Definition Classes
- TraverserImpl
- trait InnerEdge extends (collection.GraphLike.this)#InnerEdge
- Definition Classes
- GraphLike
- case class InnerEdgeTraverser extends (GraphTraversalImpl.this)#InnerEdgeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#EdgeT, (GraphTraversalImpl.this)#InnerEdgeTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- sealed trait InnerElem extends AnyRef
- Definition Classes
- GraphBase
- case class InnerElemTraverser extends (GraphTraversalImpl.this)#InnerElemTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElemTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- trait InnerNode extends (AdjacencyListBase.this)#InnerNode
- Definition Classes
- AdjacencyListBase
- case class InnerNodeDownUpTraverser extends (GraphTraversalImpl.this)#InnerNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, (GraphTraversalImpl.this)#NodeT), (GraphTraversalImpl.this)#InnerNodeDownUpTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- abstract class InnerNodeImpl extends immutable.AdjacencyListGraph.This.NodeBase with immutable.AdjacencyListGraph.This.InnerNode
- Definition Classes
- AdjacencyListGraph
- trait InnerNodeState extends AnyRef
- Definition Classes
- State
- trait InnerNodeTraversalImpl extends (GraphTraversalImpl.this)#TraverserInnerNode with (GraphTraversalImpl.this)#InnerNodeState
- Definition Classes
- GraphTraversalImpl
- case class InnerNodeTraverser extends (GraphTraversalImpl.this)#InnerNodeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#NodeT, (GraphTraversalImpl.this)#InnerNodeTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- case class Layer extends Product with Serializable
- Definition Classes
- GraphTraversal
- final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
- Definition Classes
- GraphTraversal
- type Layers = Iterable[Layer]
- Definition Classes
- GraphTraversal
- abstract class LazyPath extends (GraphTraversalImpl.this)#Path
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- final class MapPathTraversable[T] extends Iterable[T]
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- class MinWeightEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- class MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- class MultiEdgeLazyPath extends (GraphTraversalImpl.this)#LazyPath
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- trait Node extends Serializable
- Definition Classes
- GraphBase
- type NodeFilter = (NodeT) => Boolean
- Definition Classes
- GraphBase
- sealed trait NodeOrdering extends Ordering[GraphBase.NodeT] with ElemOrdering
- Definition Classes
- GraphBase
- class NodeSet extends immutable.AdjacencyListGraph.This.NodeSet
- Definition Classes
- AdjacencyListGraph
- type NodeSetT = NodeSet
- Definition Classes
- AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphBase
- type NodeT = NodeBase
- Definition Classes
- DefaultGraphImpl → GraphTraversalImpl → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphTraversal → GraphBase
- case class OuterEdgeTraverser extends (GraphTraversalImpl.this)#OuterEdgeTraverser with (GraphTraversalImpl.this)#Impl[E[N], (GraphTraversalImpl.this)#OuterEdgeTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- case class OuterElemTraverser extends (GraphTraversalImpl.this)#TraverserMethods[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with (GraphTraversalImpl.this)#OuterElemTraverser with (GraphTraversalImpl.this)#Impl[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- case class OuterNodeDownUpTraverser extends (GraphTraversalImpl.this)#OuterNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- case class OuterNodeTraverser extends (GraphTraversalImpl.this)#OuterNodeTraverser with (GraphTraversalImpl.this)#Impl[N, (GraphTraversalImpl.this)#OuterNodeTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- trait Path extends Walk
- Definition Classes
- GraphTraversal
- class PathBuilder extends (GraphTraversalImpl.this)#WalkBuilder with (GraphTraversalImpl.this)#PathBuilder
- Definition Classes
- GraphTraversalImpl
- trait Properties extends SubgraphProperties
- Attributes
- protected
- Definition Classes
- GraphTraversal
- final class ReverseStackTraversable[S <: NodeElement] extends Iterable[(GraphTraversalImpl.this)#NodeT]
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- abstract class SimpleLazyPath extends (GraphTraversalImpl.this)#LazyPath
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- class StrongComponentImpl extends (GraphTraversalImpl.this)#Component
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- case class StrongComponentTraverser extends (GraphTraversalImpl.this)#StrongComponentTraverser with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- trait SubgraphProperties extends AnyRef
- Attributes
- protected
- Definition Classes
- GraphTraversal
- type ThisGraph = UserConstrainedGraphImpl.this.type
- Attributes
- protected
- Definition Classes
- GraphLike
- type TopoSortSetup = (Buffer[NodeT], Map[NodeT, Int], Option[NodeT])
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]
- Definition Classes
- GraphTraversal
- trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with CompatTraversable[A]
- Definition Classes
- GraphTraversal
- trait TraverserInnerNode extends GraphTraversal.InnerNode
- Definition Classes
- GraphTraversal
- abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]
- Attributes
- protected
- Definition Classes
- GraphTraversal
- trait Walk extends Iterable[GraphTraversal.InnerElem]
- Definition Classes
- GraphTraversal
- class WalkBuilder extends (GraphTraversalImpl.this)#WalkBuilder
- Definition Classes
- GraphTraversalImpl
- class WeakComponentImpl extends (GraphTraversalImpl.this)#Component
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- class Weight extends AnyRef
- Definition Classes
- GraphTraversal
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- final def &(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def &~(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def +(node: N): DefaultGraphImpl[N, E]
- Definition Classes
- AdjacencyListGraph → AdjacencyListGraph → GraphLike
- final def +(elem: Param[N, E]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphOps
- final def +#(e: E[N]): DefaultGraphImpl[N, E]
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph → GraphLike
- final def +#?(e: E[N]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph → GraphLike
- final def ++(that: scala.collection.IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def ++[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): AnySet[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def ++?(elems: scala.IterableOnce[Param[N, E]]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
Same as
++but $Info. - final def +?(node: N): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
Same as
+but $Info.Same as
+but $Info.- Definition Classes
- AdjacencyListGraph → GraphOps
- def +?(elem: Param[N, E]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
Same as
+but $Info. - final def -(node: N): DefaultGraphImpl[N, E]
- Definition Classes
- AdjacencyListGraph → AdjacencyListGraph → GraphLike
- final def -(elem: Param[N, E]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphOps
- final def -!#(e: E[N]): DefaultGraphImpl[N, E]
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph → AdjacencyListGraph → GraphLike
- final def -!#?(e: E[N]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph
- final def -#(e: E[N]): DefaultGraphImpl[N, E]
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph → GraphLike
- final def -#?(e: E[N]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph → GraphLike
- final def --(elems: scala.IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphOps
- def --?(elems: scala.IterableOnce[Param[N, E]]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
Same as
--but $Info. - def ->[B](y: B): (UserConstrainedGraphImpl[N, E], B)
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toArrowAssoc[UserConstrainedGraphImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- final def -?(n: N): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
Same as
-but $Info.Same as
-but $Info.- Definition Classes
- AdjacencyListGraph → GraphOps
- def -?(elem: Param[N, E]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
Same as
-but $Info. - final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- var _edges: EdgeSetT
- Attributes
- protected[this]
- Definition Classes
- DefaultGraphImpl
- var _nodes: NodeSetT
- Attributes
- protected[this]
- Definition Classes
- DefaultGraphImpl
- final def addString(b: StringBuilder): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- IterableOnceOps
- def allNodes(passedNodes: Iterable[N], passedEdges: Iterable[E[N]]): Set[N]
Consolidates all outer nodes of the arguments by adding the edge ends of
passedEdgestopassedNodes.Consolidates all outer nodes of the arguments by adding the edge ends of
passedEdgestopassedNodes.- Attributes
- protected
- Definition Classes
- ConstraintMethods
- def andThen[A](g: (Boolean) => A): (Param[N, E]) => A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final val anyEdge: EdgeFilter
- Definition Classes
- GraphBase
- final def anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]
- Definition Classes
- GraphTraversal
- Annotations
- @inline()
- final val anyNode: NodeFilter
- Definition Classes
- GraphBase
- final lazy val anyOrdering: AnyOrdering[N]
- Attributes
- protected
- Definition Classes
- GraphBase
- final def apply(elem: Param[N, E]): Boolean
- Definition Classes
- SetOps → Function1
- Annotations
- @inline()
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
- Definition Classes
- GraphLike
- final def bulkOp(elems: IterableOnce[Param[N, E]], isPlusPlus: Boolean): DefaultGraphImpl[N, E]
- Attributes
- protected
- Definition Classes
- GraphLike → GraphAsSet
- def canEqual(that: Any): Boolean
- Definition Classes
- Set → Equals
- def checkSuspended: Boolean
- Attributes
- protected
- Definition Classes
- GraphLike
- def checkedMinusEdge(edge: E[N], simple: Boolean, copy: (E[N], EdgeT) => DefaultGraphImpl[N, E]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
- Attributes
- protected
- Definition Classes
- GraphLike
- def checkedMinusNode(node: N, forced: Boolean, copy: (N, NodeT) => DefaultGraphImpl[N, E]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
- Attributes
- protected
- Definition Classes
- GraphLike
- def checkedPlus(contained: => Boolean, preAdd: => PreCheckResult, copy: => DefaultGraphImpl[N, E], nodes: => Iterable[N], edges: => Iterable[E[N]]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
- Attributes
- protected
- Definition Classes
- GraphLike
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit
- Attributes
- protected
- Definition Classes
- State
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def coll: UserConstrainedGraphImpl.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[Param[N, E], B]): AnySet[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
- Definition Classes
- IterableOnceOps
- def componentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): ComponentTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
- def compose[A](g: (A) => Param[N, E]): (A) => Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final def concat(elems: scala.IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphOps
- def concat[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): AnySet[B]
- Definition Classes
- IterableOps
- implicit val config: DefaultGraphImpl.Config
- Definition Classes
- UserConstrainedGraphImpl → DefaultGraphImpl → GraphLike
- final val constraint: Constraint[N, [+X]E[X], DefaultGraphImpl[N, E]]
- Definition Classes
- UserConstrainedGraphImpl → UserConstrainedGraph
- final val constraintFactory: ConstraintCompanion[Constraint]
- Definition Classes
- UserConstrainedGraphImpl → GraphLike
- def contains(elem: Param[N, E]): Boolean
- Definition Classes
- GraphLike → SetOps
- final def copy(nodes: Iterable[N], edges: Iterable[E[N]]): DefaultGraphImpl[N, E]
- Attributes
- protected
- Definition Classes
- UserConstrainedGraphImpl → AdjacencyListGraph
- def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: Param[N, E]](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- def copy_?(nodes: Iterable[N], edges: Iterable[E[N]]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
- Definition Classes
- UserConstrainedGraphImpl → AdjacencyListGraph
- def corresponds[B](that: scala.collection.IterableOnce[B])(p: (Param[N, E], B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (Param[N, E]) => Boolean): Int
- Definition Classes
- IterableOnceOps
- final def cycle(results: Option[(NodeT, ArrayStack[CycleStackElem])], edgeFilter: EdgeFilter): Option[Cycle]
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- final def cycle(maybeStart: Option[NodeT], stack: ArrayStack[Element], edgeFilter: EdgeFilter): Option[Cycle]
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- final lazy val defaultEdgeOrdering: EdgeOrdering
- Definition Classes
- GraphBase
- final lazy val defaultNodeOrdering: NodeOrdering
- Definition Classes
- GraphBase
- final def defaultPathSize: Int
- Attributes
- protected
- Definition Classes
- GraphTraversal
- Annotations
- @inline()
- def degreeCount(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): SortedMap[Int, Int]
- Definition Classes
- GraphDegree
- def degreeNodeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): Seq[DegreeNodeSeqEntry]
- Definition Classes
- GraphDegree
- def degreeNodesMap(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): SortedMap[Int, AnySet[NodeT]]
- Definition Classes
- GraphDegree
- def degreeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): Seq[Int]
- Definition Classes
- GraphDegree
- def degreeSet(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): SortedSet[Int]
- Definition Classes
- GraphDegree
- def diff(that: AnySet[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphAsSet → SetOps
- def drop(n: Int): DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps
- def dropWhile(p: (Param[N, E]) => Boolean): DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def dump(store: FlagStore): ExtBitSet
- Attributes
- protected
- Definition Classes
- State
- def dumpDirty: ExtBitSet
- Definition Classes
- State
- def dumpInUse: ExtBitSet
- Definition Classes
- State
- def edgeIterator: Iterator[EdgeT]
- Definition Classes
- AdjacencyListBase
- implicit val edgeT: ClassTag[E[N]]
- Definition Classes
- UserConstrainedGraphImpl → DefaultGraphImpl → GraphLike
- implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]
- Attributes
- protected
- Definition Classes
- GraphBase
- final def edges: EdgeSet
- Definition Classes
- DefaultGraphImpl → AdjacencyListGraph → GraphBase
- Annotations
- @inline()
- final def empty: DefaultGraphImpl[N, E]
- Definition Classes
- DefaultGraphImpl → Graph → Graph → Graph → Graph → GraphAsSet → IterableFactoryDefaults → IterableOps
- Annotations
- @inline()
- def ensuring(cond: (UserConstrainedGraphImpl[N, E]) => Boolean, msg: => Any): UserConstrainedGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEnsuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (UserConstrainedGraphImpl[N, E]) => Boolean): UserConstrainedGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEnsuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): UserConstrainedGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEnsuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): UserConstrainedGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEnsuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- GraphLike → Set → Equals → AnyRef → Any
- def excl(elem: Param[N, E]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphLike
- def exists(p: (Param[N, E]) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- final def expectedMaxNodes(divisor: Int, min: Int): Int
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- def filter(pred: (Param[N, E]) => Boolean): DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterNot(pred: (Param[N, E]) => Boolean): DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- final def find(outerEdge: E[N]): Option[EdgeT]
- Definition Classes
- GraphLike
- Annotations
- @inline()
- final def find(outerNode: N): Option[NodeT]
- Definition Classes
- GraphLike
- Annotations
- @inline()
- def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
- Definition Classes
- IterableOnceOps
- final def findCycle[U](implicit visitor: (InnerElem) => U): Option[Cycle]
- Definition Classes
- GraphTraversal
- final def findCycleContaining[U](node: NodeT)(implicit visitor: (InnerElem) => U): Option[Cycle]
- Definition Classes
- GraphTraversal
- def flatMap[B](f: (Param[N, E]) => scala.collection.IterableOnce[B]): AnySet[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (Param[N, E]) => scala.collection.IterableOnce[B]): AnySet[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
- Definition Classes
- IterableOnceOps
- final def forInDegrees(nodes: Traversable[NodeT] with SubgraphProperties, maybeHandle: Option[Handle], includeAnyway: Option[NodeT], includeInDegree: NodeFilter, fillInDegrees: Boolean): TopoSortSetup
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
- def forall(p: (Param[N, E]) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (Param[N, E]) => U): Unit
- Definition Classes
- IterableOnceOps
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toStringFormat[UserConstrainedGraphImpl[N, E]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
- def fromSpecific(coll: IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
- Attributes
- protected
- Definition Classes
- GraphAsSet → IterableFactoryDefaults → IterableOps
- final def get(outerEdge: E[N]): EdgeT
- Definition Classes
- GraphLike
- Annotations
- @inline()
- final def get(outerNode: N): NodeT
- Definition Classes
- GraphLike
- Annotations
- @inline()
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def getOrElse(outerEdge: E[N], default: EdgeT): EdgeT
- Definition Classes
- GraphLike
- Annotations
- @inline()
- final def getOrElse(outerNode: N, default: NodeT): NodeT
- Definition Classes
- GraphLike
- Annotations
- @inline()
- final val graphCompanion: DefaultGraphImpl.type
- Definition Classes
- DefaultGraphImpl → GraphLike → GraphAsSet
- def graphSize: Int
- Definition Classes
- GraphBase
- def groupBy[K](f: (Param[N, E]) => K): Map[K, DefaultGraphImpl[N, E]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B): Map[K, AnySet[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[DefaultGraphImpl[N, E]]
- Definition Classes
- IterableOps
- def hashCode(): Int
- Definition Classes
- Set → AnyRef → Any
- def having(node: NodeFilter, edge: EdgeFilter): PartialFunction[Param[N, E], Boolean]
- Definition Classes
- GraphLike
- def head: Param[N, E]
- Definition Classes
- IterableOps
- def headOption: Option[Param[N, E]]
- Definition Classes
- IterableOps
- def incl(elem: Param[N, E]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphLike
- def init: DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps
- final def initialize(nodes: Iterable[N], edges: Iterable[E[N]]): Unit
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph → GraphBase
- def initializeFrom(in: ObjectInputStream, nodes: NodeSetT, edges: EdgeSetT): Unit
- Attributes
- protected
- Definition Classes
- AdjacencyListBase
- def inits: Iterator[DefaultGraphImpl[N, E]]
- Definition Classes
- IterableOps
- def innerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerEdgeTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
- def innerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerElemTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
- def innerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeDownUpTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
- def innerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
- def intersect(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- SetOps
- final def isAcyclic: Boolean
- Definition Classes
- GraphTraversal
- Annotations
- @inline()
- def isComplete: Boolean
- Definition Classes
- GraphTraversal
- def isConnected: Boolean
- Definition Classes
- GraphTraversal
- final def isCustomEdgeFilter(f: EdgeFilter): Boolean
- Definition Classes
- GraphBase
- Annotations
- @inline()
- final def isCustomNodeFilter(f: NodeFilter): Boolean
- Definition Classes
- GraphBase
- Annotations
- @inline()
- final def isCyclic: Boolean
- Definition Classes
- GraphTraversal
- Annotations
- @inline()
- def isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- def isDirected: Boolean
- Definition Classes
- GraphLike → GraphBase
- final val isDirectedT: Boolean
- Attributes
- protected
- Definition Classes
- GraphLike
- final def isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- def isEmpty: Boolean
- Definition Classes
- IterableOnceOps
- def isHyper: Boolean
- Definition Classes
- GraphLike → GraphBase
- final val isHyperT: Boolean
- Attributes
- protected
- Definition Classes
- GraphLike
- def isIn: Boolean
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isMixed: Boolean
- Definition Classes
- GraphLike → GraphBase
- def isMulti: Boolean
- Definition Classes
- GraphLike → GraphBase
- final val isMultiT: Boolean
- Attributes
- protected
- Definition Classes
- GraphLike
- def isNode: Boolean
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
- final def isOut: Boolean
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- final def isTrivial: Boolean
- Definition Classes
- GraphBase
- Annotations
- @inline()
- def iterableFactory: IterableFactory[Set]
- Definition Classes
- Set → Iterable → IterableOps
- def iterator: Iterator[Param[N, E]]
- Definition Classes
- GraphLike → IterableOnce
- def knownSize: Int
- Definition Classes
- Graph → IterableOnce
- def last: Param[N, E]
- Definition Classes
- IterableOps
- def lastOption: Option[Param[N, E]]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[Param[N, E], B, UserConstrainedGraphImpl.this.type]
- Definition Classes
- Iterable
- def map[NN, EE[+X] <: EdgeLikeIn[X]](f: (Param[N, E]) => Param[NN, EE])(implicit edgeT: ClassTag[EE[NN]]): DefaultGraphImpl[NN, EE]
- Definition Classes
- GraphAsSet
- def map[B](f: (Param[N, E]) => B): AnySet[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def max[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
- Definition Classes
- IterableOnceOps
- def maxDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): Int
- Definition Classes
- GraphDegree
- def maxOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
- Definition Classes
- IterableOnceOps
- def min[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
- Definition Classes
- IterableOnceOps
- def minDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): Int
- Definition Classes
- GraphDegree
- def minOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
- Definition Classes
- IterableOnceOps
- final def minusIsolated(n: N): DefaultGraphImpl[N, E]
- Definition Classes
- AdjacencyListGraph → AdjacencyListGraph → GraphLike
- final def minusIsolated_?(n: N): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
- Definition Classes
- AdjacencyListGraph
- def minusMinus(delNodes: Iterable[N], delEdges: Iterable[E[N]]): DefaultGraphImpl[N, E]
- Attributes
- protected
- Definition Classes
- GraphLike → GraphLike
- def minusMinusNodesEdges(delNodes: Iterable[N], delEdges: Iterable[E[N]]): (Set[N], Set[E[N]])
- Attributes
- protected
- Definition Classes
- GraphLike
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- val n1: UserConstrainedGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEdgeAssoc[UserConstrainedGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def newEdge(innerEdge: E[NodeT]): EdgeT
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph → GraphBase
- final def newEdgeTArray(size: Int): Array[EdgeT]
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph → AdjacencyListBase
- Annotations
- @inline()
- final def newNode(n: N): NodeT
- Attributes
- protected
- Definition Classes
- AdjacencyListBase → GraphBase
- Annotations
- @inline()
- final def newNodeSet: NodeSetT
- Attributes
- protected
- Definition Classes
- DefaultGraphImpl → AdjacencyListBase
- Annotations
- @inline()
- final def newNodeWithHints(n: N, h: Hints): NodeBase
- Attributes
- protected
- Definition Classes
- DefaultGraphImpl → AdjacencyListBase
- Annotations
- @inline()
- def newPathBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) => Option[EdgeT]): PathBuilder
- Definition Classes
- GraphTraversalImpl → GraphTraversal
- def newSpecificBuilder: Builder[Param[N, E], DefaultGraphImpl[N, E]]
- Attributes
- protected
- Definition Classes
- GraphAsSet → IterableFactoryDefaults → IterableOps
- def newWalkBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) => Option[EdgeT]): WalkBuilder
- Definition Classes
- GraphTraversalImpl → GraphTraversal
- def nextHandle: Handle
- Attributes
- protected
- Definition Classes
- State
- final val noNode: NodeFilter
- Definition Classes
- GraphBase
- final def nodes: NodeSet
- Definition Classes
- DefaultGraphImpl → AdjacencyListGraph → GraphBase
- Annotations
- @inline()
- def nodesToAdd(passedNodes: Iterable[N], passedEdges: Iterable[E[N]]): Set[N]
- Attributes
- protected
- Definition Classes
- ConstraintMethods
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
- final def nonTrivial: Boolean
- Definition Classes
- GraphBase
- Annotations
- @inline()
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def order: Int
- Definition Classes
- GraphBase
- def outerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterEdgeTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
- def outerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterElemTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
- def outerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeDownUpTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
- def outerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
- final def partition(elems: IterableOnce[Param[N, E]]): Partitions[N, E]
- Attributes
- protected
- Definition Classes
- GraphLike
- def partition(p: (Param[N, E]) => Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (Param[N, E]) => Either[A1, A2]): (AnySet[A1], AnySet[A2])
- Definition Classes
- IterableOps
- def pipe[B](f: (UserConstrainedGraphImpl[N, E]) => B): B
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toChainingOps[UserConstrainedGraphImpl[N, E]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def plusPlus(newNodes: Iterable[N], newEdges: Iterable[E[N]]): DefaultGraphImpl[N, E]
- Attributes
- protected
- Definition Classes
- GraphLike → GraphLike
- def postAdd(newGraph: DefaultGraphImpl[N, E], passedNodes: Iterable[N], passedEdges: Iterable[E[N]], preCheck: PreCheckResult): Either[PostCheckFailure, DefaultGraphImpl[N, E]]
- Definition Classes
- UserConstrainedGraph
- def postSubtract(newGraph: DefaultGraphImpl[N, E], passedNodes: Iterable[N], passedEdges: Iterable[E[N]], preCheck: PreCheckResult): Either[PostCheckFailure, DefaultGraphImpl[N, E]]
- Definition Classes
- UserConstrainedGraph
- def preAdd(elems: InParam[N, E]*): PreCheckResult
- Definition Classes
- UserConstrainedGraph
- def preAdd(edge: E[N]): PreCheckResult
- Definition Classes
- UserConstrainedGraph
- def preAdd(node: N): PreCheckResult
- Definition Classes
- UserConstrainedGraph
- def preCreate(nodes: Iterable[N], edges: Iterable[E[N]]): PreCheckResult
- Definition Classes
- UserConstrainedGraph
- def preSubtract(nodes: => Set[NodeT], edges: => Set[EdgeT], simple: Boolean): PreCheckResult
- Definition Classes
- UserConstrainedGraph
- def preSubtract(edge: EdgeT, simple: Boolean): PreCheckResult
- Definition Classes
- UserConstrainedGraph
- def preSubtract(node: NodeT, forced: Boolean): PreCheckResult
- Definition Classes
- UserConstrainedGraph
- def product[B >: Param[N, E]](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def productElementNames: Iterator[String]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Product
- def reduce[B >: Param[N, E]](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: Param[N, E]](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def releaseHandle(handle: Handle): Unit
- Attributes
- protected
- Definition Classes
- State
- def reversed: Iterable[Param[N, E]]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def scan[B >: Param[N, E]](z: B)(op: (B, B) => B): AnySet[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, Param[N, E]) => B): AnySet[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (Param[N, E], B) => B): AnySet[B]
- Definition Classes
- IterableOps
- final val self: UserConstrainedGraphImpl[N, E]
When extending
Constraint,selfwill denote the attached constrained graph.When extending
Constraint,selfwill denote the attached constrained graph. The factory methods of the companion objectscalax.collection.constrained.Graphinitializeselfto the correct graph instance. When extendingConstrained,selfwill denotethisgraph.- Definition Classes
- UserConstrainedGraphImpl → ConstraintMethods
- final def serializeTo(out: ObjectOutputStream): Unit
- Attributes
- protected
- Definition Classes
- AdjacencyListBase
- def size: Int
- Definition Classes
- IterableOnceOps
- def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
- Definition Classes
- IterableOps
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[N, E]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[DefaultGraphImpl[N, E]]
- Definition Classes
- IterableOps
- def span(p: (Param[N, E]) => Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
- Definition Classes
- IterableOps → IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[Param[N, E], S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Definition Classes
- GraphLike → GraphLike → Set → Iterable
- def strongComponentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): StrongComponentTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
- def subsetOf(that: Set[Param[N, E]]): Boolean
- Definition Classes
- SetOps
- def subsets(): Iterator[DefaultGraphImpl[N, E]]
- Definition Classes
- SetOps
- def subsets(len: Int): Iterator[DefaultGraphImpl[N, E]]
- Definition Classes
- SetOps
- def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps
- def tails: Iterator[DefaultGraphImpl[N, E]]
- Definition Classes
- IterableOps
- def take(n: Int): DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps
- def takeWhile(p: (Param[N, E]) => Boolean): DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def tap[U](f: (UserConstrainedGraphImpl[N, E]) => U): UserConstrainedGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toChainingOps[UserConstrainedGraphImpl[N, E]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def tapEach[U](f: (Param[N, E]) => U): DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[Param[N, E], C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: Param[N, E]]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[Param[N, E]]
- Definition Classes
- IterableOnceOps
- final def toIterable: UserConstrainedGraphImpl.this.type
- Definition Classes
- Iterable → IterableOps
- def toList: List[Param[N, E]]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[Param[N, E]]
- Definition Classes
- IterableOnceOps
- def toSet[B >: Param[N, E]]: Set[B]
- Definition Classes
- IterableOnceOps
- def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
- Definition Classes
- GraphLike
- def toString(): String
- Definition Classes
- GraphLike → Set → Function1 → Iterable → AnyRef → Any
- def toVector: Vector[Param[N, E]]
- Definition Classes
- IterableOnceOps
- final def topologicalSort[U](implicit visitor: (InnerElem) => U): CycleNodeOrTopologicalOrder
- Definition Classes
- GraphTraversal
- final def topologicalSortByComponent[U](implicit visitor: (InnerElem) => U): Iterable[CycleNodeOrTopologicalOrder]
- Definition Classes
- GraphTraversal
- def totalDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): Int
- Definition Classes
- GraphDegree
- def totalWeight: Double
- Definition Classes
- GraphBase
- def transpose[B](implicit asIterable: (Param[N, E]) => Iterable[B]): AnySet[AnySet[B]]
- Definition Classes
- IterableOps
- final def union(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- SetOps
- Annotations
- @inline()
- def unzip[A1, A2](implicit asPair: (Param[N, E]) => (A1, A2)): (AnySet[A1], AnySet[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) => (A1, A2, A3)): (AnySet[A1], AnySet[A2], AnySet[A3])
- Definition Classes
- IterableOps
- val value: UserConstrainedGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- OuterNode → NodeParam
- def view: View[Param[N, E]]
- Definition Classes
- IterableOps
- 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 withFilter(p: (Param[N, E]) => Boolean): WithFilter[Param[N, E], [_]AnySet[_]]
- Definition Classes
- IterableOps
- def withHandle[T](reuse: Option[Handle])(block: (Handle) => T): T
- Attributes
- protected
- Definition Classes
- State
- def withHandles[T](nr: Int, reuse: Array[Handle])(block: (Array[Handle]) => T): T
- Attributes
- protected
- Definition Classes
- State
- final def withoutChecks[R](exec: => R): R
- Attributes
- protected
- Definition Classes
- GraphLike
- def zip[B](that: scala.collection.IterableOnce[B]): AnySet[(Param[N, E], B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: Param[N, E], B](that: Iterable[B], thisElem: A1, thatElem: B): AnySet[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: AnySet[(Param[N, E], Int)]
- Definition Classes
- IterableOps → IterableOnceOps
- final def |(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- SetOps
- Annotations
- @inline()
- def ~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEdgeAssoc[UserConstrainedGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
- def ~>[N >: N1](n2: N): DiEdge[N]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEdgeAssoc[UserConstrainedGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
- object Edge extends Serializable
- Definition Classes
- GraphBase
- Annotations
- @transient()
- object InnerNode extends Serializable
- Definition Classes
- GraphBase
- object Node extends Serializable
- Definition Classes
- GraphBase
- Annotations
- @transient()
- object TraverserInnerNode extends Serializable
- Definition Classes
- GraphTraversal
- Annotations
- @transient()
Shadowed Implicit Value Members
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toany2stringadd[UserConstrainedGraphImpl[N, E]] performed by method any2stringadd in scala.Predef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: any2stringadd[UserConstrainedGraphImpl[N, E]]).+(other)
- Definition Classes
- any2stringadd
- def andThen[A](g: (Boolean) => A): (Param[Param[N, E], EI]) => A
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: (Param[Param[N, E], EI]) => Boolean).andThen(g)
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def apply(v1: Param[Param[N, E], EI]): Boolean
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: (Param[Param[N, E], EI]) => Boolean).apply(v1)
- Definition Classes
- Function1
- def compose[A](g: (A) => Param[Param[N, E], EI]): (A) => Boolean
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: (Param[Param[N, E], EI]) => Boolean).compose(g)
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- val self: UserConstrainedGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toChainingOps[UserConstrainedGraphImpl[N, E]] performed by method ChainingOps in scalax.collection.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: ChainingOps[UserConstrainedGraphImpl[N, E]]).self
- Definition Classes
- ChainingOps
- def stringPrefix: String
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: OuterNode[UserConstrainedGraphImpl[N, E]]).stringPrefix
- Definition Classes
- NodeParam
- def toString(): String
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: (Param[Param[N, E], EI]) => Boolean).toString()
- Definition Classes
- Function1 → AnyRef → Any
- def toString(): String
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: OuterNode[UserConstrainedGraphImpl[N, E]]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
Deprecated Value Members
- def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
- def ++:[B >: Param[N, E]](that: scala.collection.IterableOnce[B]): AnySet[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
- def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs
- def -!(elem: Param[N, E]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphLike
- Annotations
- @deprecated
- Deprecated
(Since version 1.13) When deleting an edge, to get nodes deleted that become isolated, delete them beforehand.
- def --!(elems: IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphLike
- Annotations
- @deprecated
- Deprecated
(Since version 1.13) When deleting edges, to get nodes deleted that become isolated, delete them beforehand.
- def /:[B](z: B)(op: (B, Param[N, E]) => B): B
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]])./:(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
- final def /:[B](z: B)(op: (B, Param[N, E]) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- def :\[B](z: B)(op: (Param[N, E], B) => B): B
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).:\(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- final def :\[B](z: B)(op: (Param[N, E], B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, Param[N, E]) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregateis not relevant for sequential collections. UsefoldLeft(z)(seqop)instead.
- def collectFirst[B](f: PartialFunction[Param[N, E], B]): Option[B]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).collectFirst(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.collectFirst(...) instead
- def companion: IterableFactory[[_]AnySet[_]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- def copyToBuffer(dest: Buffer[Param[N, E]]): Unit
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).copyToBuffer(dest)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.copyToBuffer(...) instead
- final def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= collinstead
- def count(f: (Param[N, E]) => Boolean): Int
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).count(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.count(...) instead
- def exists(f: (Param[N, E]) => Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).exists(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.exists(...) instead
- def filter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).filter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.filter(...) instead
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated @deprecated
- Deprecated
(Since version ) see corresponding Javadoc for more information.
- def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).find(p)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.find instead
- def flatMap[B](f: (Param[N, E]) => scala.collection.IterableOnce[B]): scala.collection.IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).flatMap(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable
- def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).fold(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.fold instead
- def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).foldLeft(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
- def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).foldRight(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- def forall(f: (Param[N, E]) => Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).forall(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.forall(...) instead
- def foreach[U](f: (Param[N, E]) => U): Unit
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).foreach(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foreach(...) instead
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- def isEmpty: Boolean
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).isEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.isEmpty instead
- def map[B](f: (Param[N, E]) => B): scala.collection.IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).map(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable
- def max(implicit ord: Ordering[Param[N, E]]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).max(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.max instead
- def maxBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).maxBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.maxBy(...) instead
- def min(implicit ord: Ordering[Param[N, E]]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).min(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.min instead
- def minBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).minBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.minBy(...) instead
- def mkString: String
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).mkString
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def mkString(sep: String): String
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).mkString(sep)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def mkString(start: String, sep: String, end: String): String
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).mkString(start, sep, end)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def nonEmpty: Boolean
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).nonEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.nonEmpty instead
- def product(implicit num: Numeric[Param[N, E]]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).product(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.product instead
- def reduce(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduce(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduce(...) instead
- def reduceLeft(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceLeft(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeft(...) instead
- def reduceLeftOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceLeftOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead
- def reduceOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceOption(...) instead
- def reduceRight(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceRight(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRight(...) instead
- def reduceRightOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceRightOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRightOption(...) instead
- final def repr: DefaultGraphImpl[N, E]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- def sameElements[B >: A](that: scala.collection.IterableOnce[B]): Boolean
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sameElements instead
- def seq: UserConstrainedGraphImpl.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- def size: Int
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).size
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.size instead
- def sum(implicit num: Numeric[Param[N, E]]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).sum(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sum instead
- def to[C1](factory: Factory[Param[N, E], C1]): C1
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).to(factory)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(factory) instead
- def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toArray(arg0)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toArray
- def toBuffer[B >: A]: Buffer[B]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toBuffer
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead
- def toIndexedSeq: IndexedSeq[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toIndexedSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toIndexedSeq instead
- final def toIterable: Iterable[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toIterable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- def toIterator: Iterator[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toIterator
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead
- final def toIterator: Iterator[Param[N, E]]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- def toList: List[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toList
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(List) instead
- def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toMap(ev)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(Map) instead
- def toSeq: Seq[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Seq) instead
- def toSet[B >: A]: Set[B]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toSet
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Set) instead
- def toStream: Stream[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toStream
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(LazyList) instead
- final def toStream: Stream[Param[N, E]]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toTraversable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- final def toTraversable: Traversable[Param[N, E]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- def toVector: Vector[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toVector
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Vector) instead
- def view(from: Int, until: Int): View[Param[N, E]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)
- def withFilter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).withFilter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.withFilter(...) instead
- def →[B](y: B): (UserConstrainedGraphImpl[N, E], B)
- Implicit
- This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toArrowAssoc[UserConstrainedGraphImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.