class EdgeSet extends This.EdgeSet
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- EdgeSet
- EdgeSet
- EdgeSet
- EdgeSet
- Serializable
- Serializable
- ExtSetMethods
- Set
- SetLike
- Subtractable
- GenSet
- GenericSetTemplate
- GenSetLike
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- Function1
- AnyRef
- Any
Implicitly
- by anyToNode
- by CollectionsHaveToParArray
- by MonadOps
- by flattenTraversableOnce
- by EdgeAssoc
- by predicateToNodePredicate
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new EdgeSet()
Type Members
-
type
Self = Set[This.EdgeT]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
&(that: GenSet[This.EdgeT]): Set[This.EdgeT]
- Definition Classes
- GenSetLike
-
def
&~(that: GenSet[This.EdgeT]): Set[This.EdgeT]
- Definition Classes
- GenSetLike
-
final
def
+(edge: This.EdgeT): Set[This.EdgeT]
- Definition Classes
- EdgeSet → SetLike → GenSetLike
- Annotations
- @inline()
-
def
+(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): Set[This.EdgeT]
- Definition Classes
- SetLike
-
def
++(elems: GenTraversableOnce[This.EdgeT]): Set[This.EdgeT]
- Definition Classes
- SetLike
-
def
++[B >: This.EdgeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: This.EdgeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: This.EdgeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
- Definition Classes
- TraversableLike
-
final
def
+=(edge: This.EdgeT): EdgeSet.this.type
- Attributes
- protected[scalax.collection.immutable.AdjacencyListGraph]
- Annotations
- @inline()
-
final
def
-(edge: This.EdgeT): Set[This.EdgeT]
- Definition Classes
- EdgeSet → SetLike → Subtractable → GenSetLike
- Annotations
- @inline()
-
def
-(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): Set[This.EdgeT]
- Definition Classes
- Subtractable
-
def
--(xs: GenTraversableOnce[This.EdgeT]): Set[This.EdgeT]
- Definition Classes
- Subtractable
-
def
->[B](y: B): (This.EdgeSet, B)
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to ArrowAssoc[This.EdgeSet] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
def
/:[B](z: B)(op: (B, This.EdgeT) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: (This.EdgeT, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
addEdge(edge: This.EdgeT): Unit
- Attributes
- protected[scalax.collection.immutable]
- Definition Classes
- EdgeSet → EdgeSet
- Annotations
- @inline()
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, This.EdgeT) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
andThen[A](g: (Boolean) ⇒ A): (This.EdgeT) ⇒ A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
apply(elem: This.EdgeT): Boolean
- Definition Classes
- GenSetLike → Function1
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
asSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: This.EdgeOrdering = defaultEdgeOrdering): String
Sorts all edges according to
ordand concatenates them usingseparator.Sorts all edges according to
ordand concatenates them usingseparator.- separator
to separate edges by.
- ord
custom ordering.
- returns
sorted and concatenated string representation of this edge set.
- Definition Classes
- EdgeSet
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B, That](pf: PartialFunction[This.EdgeT, B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[This.EdgeT, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Set]
- Definition Classes
- Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
-
def
compose[A](g: (A) ⇒ This.EdgeT): (A) ⇒ Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
final
def
contains(edge: This.EdgeT): Boolean
- Definition Classes
- EdgeSet → SetLike → GenSetLike
- final def contains(node: This.NodeT): Boolean
-
def
copyToArray[B >: This.EdgeT](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: This.EdgeT](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: This.EdgeT](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: This.EdgeT](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (This.EdgeT) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
diff(that: GenSet[This.EdgeT]): Set[This.EdgeT]
- Definition Classes
- SetLike → GenSetLike
-
final
def
draw(random: Random): This.EdgeT
Returns a random element of the set if it is
nonEmptyotherwise throwsIllegalArgumentException.Returns a random element of the set if it is
nonEmptyotherwise throwsIllegalArgumentException.- random
a random generator; it is essential that
randombe instantiated by the caller just once for any sequence of calls
- Definition Classes
- EdgeSet → ExtSetMethods
-
def
drop(n: Int): Set[This.EdgeT]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): Set[This.EdgeT]
- Definition Classes
- IterableLike
-
def
dropWhile(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
empty: Set[This.EdgeT]
- Definition Classes
- GenericSetTemplate
-
def
ensuring(cond: (This.EdgeSet) ⇒ Boolean, msg: ⇒ Any): This.EdgeSet
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to Ensuring[This.EdgeSet] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (This.EdgeSet) ⇒ Boolean): This.EdgeSet
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to Ensuring[This.EdgeSet] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): This.EdgeSet
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to Ensuring[This.EdgeSet] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): This.EdgeSet
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to Ensuring[This.EdgeSet] 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
- GenSetLike → Equals → AnyRef → Any
-
def
exists(p: (This.EdgeT) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
find(elem: E[N]): Option[This.EdgeT]
Finds the inner edge corresponding to
outerEdge. -
def
find(p: (This.EdgeT) ⇒ Boolean): Option[This.EdgeT]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
findElem[B](other: B, correspond: (This.EdgeT, B) ⇒ Boolean): This.EdgeT
Finds an entry in the collection based on
toMatch'shashCodeand a correspondence function but not on the argument type.Finds an entry in the collection based on
toMatch'shashCodeand a correspondence function but not on the argument type.- correspond
function returning whether a given entry corresponds to
other- returns
the entry corresponding to
toMatchor null if not contained
- Definition Classes
- EdgeSet → ExtSetMethods
-
def
flatMap[B, That](f: (This.EdgeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (This.EdgeT) ⇒ GenTraversableOnce[B]): Set[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: This.EdgeT](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, This.EdgeT) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (This.EdgeT, B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
forall(p: (This.EdgeT) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (This.EdgeT) ⇒ U): Unit
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to StringFormat[This.EdgeSet] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
def
genericBuilder[B]: Builder[B, Set[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
groupBy[K](f: (This.EdgeT) ⇒ K): Map[K, Set[This.EdgeT]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[Set[This.EdgeT]]
- Definition Classes
- IterableLike
- final def hasAnyHyperEdge: Boolean
- final lazy val hasAnyMultiEdge: Boolean
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- final def hasMixedEdges: Boolean
- final def hasOnlyDiEdges: Boolean
- final def hasOnlyUnDiEdges: Boolean
-
def
hashCode(): Int
- Definition Classes
- GenSetLike → AnyRef → Any
-
def
head: This.EdgeT
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[This.EdgeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: Set[This.EdgeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
initialize(edges: Traversable[E[N]]): Unit
This method is called by the primary constructor.
This method is called by the primary constructor. It must be defined by the trait responsible for the implementation of the graph representation.
- edges
The outer edges that the edge set of this graph is to be populated with. Nodes being the end of any of these edges will be added to the node set.
- Attributes
- protected[scalax.collection]
- Definition Classes
- EdgeSet → EdgeSet
-
def
inits: Iterator[Set[This.EdgeT]]
- Definition Classes
- TraversableLike
-
def
intersect(that: GenSet[This.EdgeT]): Set[This.EdgeT]
- Definition Classes
- GenSetLike
-
def
isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
-
def
isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isEmpty: Boolean
- Definition Classes
- SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
isIn: Boolean
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isNode: Boolean
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isOut: Boolean
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
final
def
iterator: Iterator[This.EdgeT]
- Definition Classes
- EdgeSet → GenSetLike → IterableLike → GenIterableLike
-
def
last: This.EdgeT
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[This.EdgeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
map[B, That](f: (This.EdgeT) ⇒ B)(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
- Definition Classes
- SetLike → TraversableLike → GenTraversableLike → FilterMonadic
- Annotations
- @migration
- Migration
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.
-
def
max[B >: This.EdgeT](implicit cmp: Ordering[B]): This.EdgeT
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
lazy val
maxArity: Int
The maximum arity of all edges in this edge set.
-
def
maxBy[B](f: (This.EdgeT) ⇒ B)(implicit cmp: Ordering[B]): This.EdgeT
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: This.EdgeT](implicit cmp: Ordering[B]): This.EdgeT
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (This.EdgeT) ⇒ B)(implicit cmp: Ordering[B]): This.EdgeT
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
val
n1: This.EdgeSet
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to EdgeAssoc[This.EdgeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[This.EdgeT, Set[This.EdgeT]]
- Attributes
- protected[this]
- Definition Classes
- SetLike → TraversableLike → HasNewBuilder
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
par: ParSet[This.EdgeT]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[This.EdgeT, ParSet[This.EdgeT]]
- Attributes
- protected[this]
- Definition Classes
- SetLike → TraversableLike → Parallelizable
-
def
partition(p: (This.EdgeT) ⇒ Boolean): (Set[This.EdgeT], Set[This.EdgeT])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: This.EdgeT](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: This.EdgeT](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: This.EdgeT](op: (B, This.EdgeT) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: This.EdgeT](op: (B, This.EdgeT) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: This.EdgeT](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: This.EdgeT](op: (This.EdgeT, B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: This.EdgeT](op: (This.EdgeT, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: Set[This.EdgeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reversed: List[This.EdgeT]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
sameElements[B >: This.EdgeT](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
def
scan[B >: This.EdgeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[This.EdgeT], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, This.EdgeT) ⇒ B)(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (This.EdgeT, B) ⇒ B)(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRighthas changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
seq: Set[This.EdgeT]
- Definition Classes
- Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- EdgeSet → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): Set[This.EdgeT]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[Set[This.EdgeT]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[Set[This.EdgeT]]
- Definition Classes
- IterableLike
-
def
span(p: (This.EdgeT) ⇒ Boolean): (Set[This.EdgeT], Set[This.EdgeT])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (Set[This.EdgeT], Set[This.EdgeT])
- Definition Classes
- TraversableLike → GenTraversableLike
-
final
def
statistics(edge: This.EdgeT, plus: Boolean): Boolean
- Attributes
- protected
- Definition Classes
- EdgeSet
-
def
stringPrefix: String
- Definition Classes
- EdgeSet → SetLike → TraversableLike → GenTraversableLike
-
def
subsetOf(that: GenSet[This.EdgeT]): Boolean
- Definition Classes
- GenSetLike
-
def
subsets(): Iterator[Set[This.EdgeT]]
- Definition Classes
- SetLike
-
def
subsets(len: Int): Iterator[Set[This.EdgeT]]
- Definition Classes
- SetLike
-
def
sum[B >: This.EdgeT](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: Set[This.EdgeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Set[This.EdgeT]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Set[This.EdgeT]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): Set[This.EdgeT]
- Definition Classes
- IterableLike
-
def
takeWhile(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: Iterable[This.EdgeT]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, This.EdgeT, Col[This.EdgeT]]): Col[This.EdgeT]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: This.EdgeT](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[A1 >: This.EdgeT]: Buffer[A1]
- Definition Classes
- SetLike → TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: Set[This.EdgeT]): Iterable[This.EdgeT]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
toIndexedSeq: IndexedSeq[This.EdgeT]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[This.EdgeT]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[This.EdgeT]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[This.EdgeT]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[This.EdgeT, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toOuter: Set[E[N]]
Converts this edge set to a set of outer edges.
Converts this edge set to a set of outer edges.
- Definition Classes
- EdgeSet
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to CollectionsHaveToParArray[This.EdgeSet, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (This.EdgeSet) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toSeq: Seq[This.EdgeT]
- Definition Classes
- SetLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: This.EdgeT]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: This.EdgeOrdering = defaultEdgeOrdering): String
Sorts all edges according to
ord, concatenates them usingseparatorand prefixes and parenthesizes the result withstringPrefix.Sorts all edges according to
ord, concatenates them usingseparatorand prefixes and parenthesizes the result withstringPrefix.- separator
to separate edges by.
- ord
custom ordering.
- returns
sorted, concatenated and prefixed string representation of this edge set.
- Definition Classes
- EdgeSet
-
def
toStream: Stream[This.EdgeT]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- SetLike → Function1 → TraversableLike → AnyRef → Any
-
def
toTraversable: Traversable[This.EdgeT]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[This.EdgeT]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transpose[B](implicit asTraversable: (This.EdgeT) ⇒ GenTraversableOnce[B]): Set[Set[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transposethrows anIllegalArgumentExceptionif collections are not uniformly sized.
-
def
union(that: GenSet[This.EdgeT]): Set[This.EdgeT]
- Definition Classes
- SetLike → GenSetLike
-
def
unzip[A1, A2](implicit asPair: (This.EdgeT) ⇒ (A1, A2)): (Set[A1], Set[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (This.EdgeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
- Definition Classes
- GenericTraversableTemplate
-
val
value: This.EdgeSet
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- OuterNode → NodeParam
-
def
view(from: Int, until: Int): IterableView[This.EdgeT, Set[This.EdgeT]]
- Definition Classes
- IterableLike → TraversableLike
-
def
view: IterableView[This.EdgeT, Set[This.EdgeT]]
- Definition Classes
- IterableLike → TraversableLike
-
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
withFilter(p: (This.EdgeT) ⇒ Boolean): FilterMonadic[This.EdgeT, Set[This.EdgeT]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
withSetFilter(p: (This.EdgeT) ⇒ Boolean): FilteredSet[This.EdgeT]
Returns a lazily filtered immutable Set.
Returns a lazily filtered immutable Set.
- Definition Classes
- ExtSetMethods
-
def
zip[A1 >: This.EdgeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipAll[B, A1 >: This.EdgeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipWithIndex[A1 >: This.EdgeT, That](implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
|(that: GenSet[This.EdgeT]): Set[This.EdgeT]
- Definition Classes
- GenSetLike
-
def
~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to EdgeAssoc[This.EdgeSet] 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 This.EdgeSet to EdgeAssoc[This.EdgeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
-
def
→[B](y: B): (This.EdgeSet, B)
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to ArrowAssoc[This.EdgeSet] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
Shadowed Implicit Value Members
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to any2stringadd[This.EdgeSet] 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:(edgeSet: any2stringadd[This.EdgeSet]).+(other)
- Definition Classes
- any2stringadd
-
def
andThen[A](g: (Boolean) ⇒ A): (Param[This.EdgeT, EI]) ⇒ A
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to (Param[This.EdgeT, 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:(edgeSet: (Param[This.EdgeT, EI]) ⇒ Boolean).andThen(g)
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
apply(v1: Param[This.EdgeT, EI]): Boolean
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to (Param[This.EdgeT, 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:(edgeSet: (Param[This.EdgeT, EI]) ⇒ Boolean).apply(v1)
- Definition Classes
- Function1
-
def
compose[A](g: (A) ⇒ Param[This.EdgeT, EI]): (A) ⇒ Boolean
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to (Param[This.EdgeT, 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:(edgeSet: (Param[This.EdgeT, EI]) ⇒ Boolean).compose(g)
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
filter(p: (This.EdgeT) ⇒ Boolean): TraversableOnce[This.EdgeT]
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to MonadOps[This.EdgeT] performed by method MonadOps in scala.collection.TraversableOnce.
- 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:(edgeSet: MonadOps[This.EdgeT]).filter(p)
- Definition Classes
- MonadOps
-
def
flatMap[B](f: (This.EdgeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to MonadOps[This.EdgeT] performed by method MonadOps in scala.collection.TraversableOnce.
- 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:(edgeSet: MonadOps[This.EdgeT]).flatMap(f)
- Definition Classes
- MonadOps
-
def
flatten: Iterator[This.NodeT]
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to FlattenOps[This.NodeT] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (Iterable[This.NodeT]) ⇒ TraversableOnce[This.NodeT] is in scope.
- 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:(edgeSet: FlattenOps[This.NodeT]).flatten
- Definition Classes
- FlattenOps
-
def
map[B](f: (This.EdgeT) ⇒ B): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to MonadOps[This.EdgeT] performed by method MonadOps in scala.collection.TraversableOnce.
- 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:(edgeSet: MonadOps[This.EdgeT]).map(f)
- Definition Classes
- MonadOps
-
def
stringPrefix: String
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] 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:(edgeSet: OuterNode[This.EdgeSet]).stringPrefix
- Definition Classes
- NodeParam
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] 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:(edgeSet: OuterNode[This.EdgeSet]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to (Param[This.EdgeT, 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:(edgeSet: (Param[This.EdgeT, EI]) ⇒ Boolean).toString()
- Definition Classes
- Function1 → AnyRef → Any
-
def
withFilter(p: (This.EdgeT) ⇒ Boolean): Iterator[This.EdgeT]
- Implicit
- This member is added by an implicit conversion from This.EdgeSet to MonadOps[This.EdgeT] performed by method MonadOps in scala.collection.TraversableOnce.
- 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:(edgeSet: MonadOps[This.EdgeT]).withFilter(p)
- Definition Classes
- MonadOps
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.