sealed trait InParam[+N, +E[X <: N] <: EdgeLike[X]] extends Param[N, E]
- N
the type of the nodes (vertices) this graph is passed to by the user.
- E
the kind of the edges (links) this graph is passed to by the user.
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- InParam
- Param
- AnyRef
- Any
Implicitly
- by anyToNode
- by EdgeAssoc
- by ChainingOps
- by CollectionsHaveToParArray
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- All
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (InParam[N, E], B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def ensuring(cond: (InParam[N, E]) ⇒ Boolean, msg: ⇒ Any): InParam[N, E]
- def ensuring(cond: (InParam[N, E]) ⇒ Boolean): InParam[N, E]
- def ensuring(cond: Boolean, msg: ⇒ Any): InParam[N, E]
- def ensuring(cond: Boolean): InParam[N, E]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
isDefined: Boolean
- Definition Classes
- Param
-
final
def
isEdge: Boolean
- Definition Classes
- Param
- def isIn: Boolean
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
isOut: Boolean
- Definition Classes
- Param
-
val
n1: InParam[N, E]
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to EdgeAssoc[InParam[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
pipe[B](f: (InParam[N, E]) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to ChainingOps[InParam[N, E]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
-
val
self: InParam[N, E]
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to ChainingOps[InParam[N, E]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
-
def
stringPrefix: String
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to OuterNode[InParam[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tap[U](f: (InParam[N, E]) ⇒ U): InParam[N, E]
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to ChainingOps[InParam[N, E]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to CollectionsHaveToParArray[InParam[N, E], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (InParam[N, E]) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- val value: InParam[N, E]
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to EdgeAssoc[InParam[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 InParam[N, E] to EdgeAssoc[InParam[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
- def →[B](y: B): (InParam[N, E], B)
Shadowed Implicit Value Members
-
def
isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to OuterNode[InParam[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:(inParam: OuterNode[InParam[N, E]]).isDefined
- Definition Classes
- Param
-
final
def
isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to OuterNode[InParam[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:(inParam: OuterNode[InParam[N, E]]).isEdge
- Definition Classes
- Param
-
def
isIn: Boolean
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to OuterNode[InParam[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:(inParam: OuterNode[InParam[N, E]]).isIn
- Definition Classes
- InParam → Param
-
def
isNode: Boolean
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to OuterNode[InParam[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:(inParam: OuterNode[InParam[N, E]]).isNode
- Definition Classes
- NodeParam
-
final
def
isOut: Boolean
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to OuterNode[InParam[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:(inParam: OuterNode[InParam[N, E]]).isOut
- Definition Classes
- Param
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from InParam[N, E] to OuterNode[InParam[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:(inParam: OuterNode[InParam[N, E]]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.