scalax.collection.constrained.mutable.AdjacencyListGraph

EdgeSet

class EdgeSet extends This.EdgeSet

Annotations: @SerialVersionUID()

Linear Supertypes

This.EdgeSet, This.EdgeSet, This.EdgeSet, This.EdgeSet, This.EdgeSet, Serializable, Serializable, ExtSetMethods[This.EdgeT], Set[This.EdgeT], SetLike[This.EdgeT, Set[This.EdgeT]], Cloneable[Set[This.EdgeT]], Cloneable, Cloneable, Shrinkable[This.EdgeT], Builder[This.EdgeT, Set[This.EdgeT]], Growable[This.EdgeT], Clearable, Scriptable[This.EdgeT], Set[This.EdgeT], SetLike[This.EdgeT, Set[This.EdgeT]], Subtractable[This.EdgeT, Set[This.EdgeT]], GenSet[This.EdgeT], GenericSetTemplate[This.EdgeT, Set], GenSetLike[This.EdgeT, Set[This.EdgeT]], (This.EdgeT) ⇒ Boolean, Iterable[This.EdgeT], Iterable[This.EdgeT], IterableLike[This.EdgeT, Set[This.EdgeT]], Equals, GenIterable[This.EdgeT], GenIterableLike[This.EdgeT, Set[This.EdgeT]], Traversable[This.EdgeT], Mutable, Traversable[This.EdgeT], GenTraversable[This.EdgeT], GenericTraversableTemplate[This.EdgeT, Set], TraversableLike[This.EdgeT, Set[This.EdgeT]], GenTraversableLike[This.EdgeT, Set[This.EdgeT]], Parallelizable[This.EdgeT, ParSet[This.EdgeT]], TraversableOnce[This.EdgeT], GenTraversableOnce[This.EdgeT], FilterMonadic[This.EdgeT, Set[This.EdgeT]], HasNewBuilder[This.EdgeT, Set[This.EdgeT]], AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

EdgeSet
EdgeSet
EdgeSet
EdgeSet
EdgeSet
EdgeSet
Serializable
Serializable
ExtSetMethods
Set
SetLike
Cloneable
Cloneable
Cloneable
Shrinkable
Builder
Growable
Clearable
Scriptable
Set
SetLike
Subtractable
GenSet
GenericSetTemplate
GenSetLike
Function1
Iterable
Iterable
IterableLike
Equals
GenIterable
GenIterableLike
Traversable
Mutable
Traversable
GenTraversable
GenericTraversableTemplate
TraversableLike
GenTraversableLike
Parallelizable
TraversableOnce
GenTraversableOnce
FilterMonadic
HasNewBuilder
AnyRef
Any

Implicitly

by anyToNode
by MonadOps
by CollectionsHaveToParArray
by flattenTraversableOnce
by EdgeAssoc
by predicateToNodePredicate
by TraversableEnrichments
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
def +(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): Set[This.EdgeT]

Definition Classes
SetLike → SetLike
Annotations
@migration
Migration
(Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.
def +(elem: This.EdgeT): Set[This.EdgeT]

Definition Classes
SetLike → SetLike → GenSetLike
Annotations
@migration
Migration
(Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.
def ++(xs: GenTraversableOnce[This.EdgeT]): Set[This.EdgeT]

Definition Classes
SetLike → SetLike
Annotations
@migration
Migration
(Changed in version 2.8.0) ++ creates a new set. Use ++= to add elements to this set and return that set itself.
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
def ++=(xs: TraversableOnce[This.EdgeT]): EdgeSet.this.type

Definition Classes
Growable
final def +=(edge: This.EdgeT): EdgeSet.this.type

Definition Classes
EdgeSet → SetLike → Builder → Growable
Annotations
@inline()
def +=(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): EdgeSet.this.type

Definition Classes
Growable
def -(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): Set[This.EdgeT]

Definition Classes
SetLike → Subtractable
Annotations
@migration
Migration
(Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.
def -(elem: This.EdgeT): Set[This.EdgeT]

Definition Classes
SetLike → SetLike → Subtractable → GenSetLike
Annotations
@migration
Migration
(Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.
def --(xs: GenTraversableOnce[This.EdgeT]): Set[This.EdgeT]

Definition Classes
SetLike → Subtractable
Annotations
@migration
Migration
(Changed in version 2.8.0) -- creates a new set. Use --= to remove elements from this set and return that set itself.
def --=(xs: TraversableOnce[This.EdgeT]): EdgeSet.this.type

Definition Classes
Shrinkable
final def -=(edge: This.EdgeT): EdgeSet.this.type

Definition Classes
EdgeSet → SetLike → Shrinkable
Annotations
@inline()
def -=(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): EdgeSet.this.type

Definition Classes
Shrinkable
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
def add(edge: This.EdgeT): Boolean

Definition Classes
EdgeSet → EdgeSet → SetLike
final def addEdge(edge: This.EdgeT): Unit

Attributes
protected[scalax.collection]
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)(implicit ord: This.EdgeOrdering): String

Definition Classes
EdgeSet
def canEqual(that: Any): Boolean

Definition Classes
IterableLike → Equals
def checkedRemove(edge: This.EdgeT, forced: Boolean, remove: (This.EdgeT) ⇒ Boolean): Boolean
generic constrained subtraction
generic constrained subtraction

Attributes
protected
def clear(): Unit

Definition Classes
SetLike → Builder → Growable → Clearable
def clone(): Set[This.EdgeT]

Definition Classes
SetLike → Cloneable → AnyRef
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 → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → 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

Definition Classes
EdgeSet → EdgeSet
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

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]

Definition Classes
EdgeSet → EdgeSet
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

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

Definition Classes
EdgeSet → EdgeSet
def hasAnyMultiEdge: Boolean

Definition Classes
EdgeSet → EdgeSet
def hasDefiniteSize: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
final def hasMixedEdges: Boolean

Definition Classes
EdgeSet → EdgeSet
final def hasOnlyDiEdges: Boolean

Definition Classes
EdgeSet → EdgeSet
final def hasOnlyUnDiEdges: Boolean

Definition Classes
EdgeSet → EdgeSet
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

Attributes
protected[scalax.collection]
Definition Classes
EdgeSet → EdgeSet
var initialized: Boolean

Attributes
protected[scalax.collection.mutable.AdjacencyListGraph]
Definition Classes
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
final 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
Param
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
final 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
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 mapResult[NewTo](f: (Set[This.EdgeT]) ⇒ NewTo): Builder[This.EdgeT, NewTo]

Definition Classes
Builder
def max[B >: This.EdgeT](implicit cmp: Ordering[B]): This.EdgeT

Definition Classes
TraversableOnce → GenTraversableOnce
final def maxArity: Int

Definition Classes
EdgeSet → EdgeSet
Annotations
@inline()
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 → 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 → 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 remove(edge: This.EdgeT): Boolean

Definition Classes
EdgeSet → EdgeSet → SetLike
def removeWithNodes(edge: This.EdgeT): Boolean

Definition Classes
EdgeSet → EdgeSet → EdgeSet
def repr: Set[This.EdgeT]

Definition Classes
TraversableLike → GenTraversableLike
def result(): Set[This.EdgeT]

Definition Classes
SetLike → Builder
def retain(p: (This.EdgeT) ⇒ Boolean): Unit

Definition Classes
SetLike
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 scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
def seq: Set[This.EdgeT]

Definition Classes
Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
def size: Int

Definition Classes
EdgeSet → GenTraversableLike → TraversableOnce → GenTraversableOnce
def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

Definition Classes
Builder
def sizeHint(coll: TraversableLike[_, _]): Unit

Definition Classes
Builder
def sizeHint(size: Int): Unit

Definition Classes
Builder
def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

Definition Classes
Builder
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
val t: Set[This.EdgeT]

Implicit
This member is added by an implicit conversion from This.EdgeSet to TraversableEnrichments[This.EdgeT, Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
Definition Classes
TraversableEnrichments
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]]

Definition Classes
EdgeSet
def toOuterNodes[E[X <: N] <: EdgeLike[X]]: Seq[InParam[This.EdgeT, E]]

Implicit
This member is added by an implicit conversion from This.EdgeSet to TraversableEnrichments[This.EdgeT, Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
Definition Classes
TraversableEnrichments
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 → SetLike → TraversableOnce → GenTraversableOnce
def toSet[B >: This.EdgeT]: Set[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSortedString(separator: String)(implicit ord: This.EdgeOrdering): String

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) transpose throws an IllegalArgumentException if 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
def update(elem: This.EdgeT, included: Boolean): Unit

Definition Classes
SetLike
def upsert(edge: This.EdgeT): Boolean

Definition Classes
EdgeSet → EdgeSet
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]

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

Deprecated Value Members

def <<(cmd: Message[This.EdgeT]): Unit

Definition Classes
SetLike → Scriptable
Annotations
@deprecated
Deprecated
(Since version 2.11.0) scripting is deprecated
def toEdgeInSet: Set[E[N]]

Definition Classes
EdgeSet
Annotations
@deprecated
Deprecated
(Since version 1.8.0) Use toOuter instead

Inherited from This.EdgeSet

Inherited from Serializable

Inherited from ExtSetMethods[This.EdgeT]

Inherited from Set[This.EdgeT]

Inherited from SetLike[This.EdgeT, Set[This.EdgeT]]

Inherited from Cloneable[Set[This.EdgeT]]

Inherited from Cloneable

Inherited from Shrinkable[This.EdgeT]

Inherited from Builder[This.EdgeT, Set[This.EdgeT]]

Inherited from Growable[This.EdgeT]

Inherited from Clearable

Inherited from Scriptable[This.EdgeT]

Inherited from Set[This.EdgeT]

Packages

EdgeSet 

class EdgeSet extends This.EdgeSet

Instance Constructors

Type Members

Value Members

Shadowed Implicit Value Members

Deprecated Value Members

Inherited from This.EdgeSet

Inherited from This.EdgeSet

Inherited from This.EdgeSet

Inherited from This.EdgeSet

Inherited from This.EdgeSet

Inherited from Serializable

Inherited from Serializable

Inherited from ExtSetMethods[This.EdgeT]

Inherited from Set[This.EdgeT]

Inherited from SetLike[This.EdgeT, Set[This.EdgeT]]

Inherited from Cloneable[Set[This.EdgeT]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[This.EdgeT]

Inherited from Builder[This.EdgeT, Set[This.EdgeT]]

Inherited from Growable[This.EdgeT]

Inherited from Clearable

Inherited from Scriptable[This.EdgeT]

Inherited from Set[This.EdgeT]

Inherited from SetLike[This.EdgeT, Set[This.EdgeT]]

Inherited from Subtractable[This.EdgeT, Set[This.EdgeT]]

Inherited from GenSet[This.EdgeT]

Inherited from GenericSetTemplate[This.EdgeT, Set]

Inherited from GenSetLike[This.EdgeT, Set[This.EdgeT]]

Inherited from (This.EdgeT) ⇒ Boolean

Inherited from Iterable[This.EdgeT]

Inherited from Iterable[This.EdgeT]

Inherited from IterableLike[This.EdgeT, Set[This.EdgeT]]

Inherited from Equals

Inherited from GenIterable[This.EdgeT]

Inherited from GenIterableLike[This.EdgeT, Set[This.EdgeT]]

Inherited from Traversable[This.EdgeT]

Inherited from Mutable

Inherited from Traversable[This.EdgeT]

Inherited from GenTraversable[This.EdgeT]

Inherited from GenericTraversableTemplate[This.EdgeT, Set]

Inherited from TraversableLike[This.EdgeT, Set[This.EdgeT]]

Inherited from GenTraversableLike[This.EdgeT, Set[This.EdgeT]]

Inherited from Parallelizable[This.EdgeT, ParSet[This.EdgeT]]

Inherited from TraversableOnce[This.EdgeT]

Inherited from GenTraversableOnce[This.EdgeT]

Inherited from FilterMonadic[This.EdgeT, Set[This.EdgeT]]

Inherited from HasNewBuilder[This.EdgeT, Set[This.EdgeT]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from This.EdgeSet to OuterNode[This.EdgeSet]

Inherited by implicit conversion MonadOps from This.EdgeSet to MonadOps[This.EdgeT]

Inherited by implicit conversion CollectionsHaveToParArray from This.EdgeSet to CollectionsHaveToParArray[This.EdgeSet, T]

Inherited by implicit conversion flattenTraversableOnce from This.EdgeSet to FlattenOps[This.NodeT]

Inherited by implicit conversion EdgeAssoc from This.EdgeSet to EdgeAssoc[This.EdgeSet]

Inherited by implicit conversion predicateToNodePredicate from This.EdgeSet to (Param[This.EdgeT, EI]) ⇒ Boolean

Inherited by implicit conversion TraversableEnrichments from This.EdgeSet to TraversableEnrichments[This.EdgeT, Set]

Inherited by implicit conversion any2stringadd from This.EdgeSet to any2stringadd[This.EdgeSet]

Inherited by implicit conversion StringFormat from This.EdgeSet to StringFormat[This.EdgeSet]

Inherited by implicit conversion Ensuring from This.EdgeSet to Ensuring[This.EdgeSet]

Inherited by implicit conversion ArrowAssoc from This.EdgeSet to ArrowAssoc[This.EdgeSet]

Inherited by implicit conversion alternateImplicit from This.EdgeSet to ForceImplicitAmbiguity

Ungrouped

EdgeSet