Graph Core
2.0.2
API
Generated with
Graph Core/scalax.collection/GraphLike/GraphEdgeSet

GraphEdgeSet

scalax.collection.GraphLike.GraphEdgeSet
trait GraphEdgeSet extends EdgeSet

Attributes

Graph
Supertypes
trait EdgeSet
trait Serializable
trait Set[EdgeT]
trait Equals
trait SetOps[EdgeT, Set, Set[EdgeT]]
trait EdgeT => Boolean
trait Iterable[EdgeT]
class Object
trait Matchable
class Any
Show all
Known subtypes

Members list

Value members

Abstract methods

Inherited methods

final def &(that: Set[EdgeT]): C

Attributes

Inherited from:
SetOps
final def &~(that: Set[EdgeT]): C

Attributes

Inherited from:
SetOps
final def ++[B >: EdgeT](suffix: IterableOnce[B]): CC[B]

Attributes

Inherited from:
IterableOps
final def ++(that: IterableOnce[EdgeT]): C

Attributes

Inherited from:
SetOps
final def addString(b: StringBuilder): StringBuilder

Attributes

Inherited from:
IterableOnceOps
final def addString(b: StringBuilder, sep: String): StringBuilder

Attributes

Inherited from:
IterableOnceOps
def andThen[A](g: Boolean => A): T1 => A

Attributes

Inherited from:
Function1
final def apply(elem: EdgeT): Boolean

Attributes

Inherited from:
SetOps
def canEqual(that: Any): Boolean

Attributes

Inherited from:
Set
final override protected def className: String

Attributes

Definition Classes
EdgeSetToString -> Iterable
Inherited from:
EdgeSetToString (hidden)
def collect[B](pf: PartialFunction[EdgeT, B]): CC[B]

Attributes

Inherited from:
IterableOps
def collectFirst[B](pf: PartialFunction[EdgeT, B]): Option[B]

Attributes

Inherited from:
IterableOnceOps
def compose[A](g: A => EdgeT): A => R

Attributes

Inherited from:
Function1
def concat[B >: EdgeT](suffix: IterableOnce[B]): CC[B]

Attributes

Inherited from:
IterableOps
def concat(that: IterableOnce[EdgeT]): C

Attributes

Inherited from:
SetOps
def contains(elem: EdgeT): Boolean

Attributes

Inherited from:
SetOps
def contains(node: NodeT): Boolean

Attributes

Inherited from:
EdgeSet
def copyToArray[B >: EdgeT](xs: Array[B], start: Int, len: Int): Int

Attributes

Inherited from:
IterableOnceOps
def copyToArray[B >: EdgeT](xs: Array[B], start: Int): Int

Attributes

Inherited from:
IterableOnceOps
def copyToArray[B >: EdgeT](xs: Array[B]): Int

Attributes

Inherited from:
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: (EdgeT, B) => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def count(p: EdgeT => Boolean): Int

Attributes

Inherited from:
IterableOnceOps
def diff(that: Set[EdgeT]): Set[EdgeT]

Attributes

Inherited from:
EdgeSet
final def draw(random: Random): EdgeT

Returns a random element of the set if it is nonEmpty otherwise throws IllegalArgumentException. Note that currently a near- but no true-uniform distribution is granted to allow for O(1) implementation.

Returns a random element of the set if it is nonEmpty otherwise throws IllegalArgumentException. Note that currently a near- but no true-uniform distribution is granted to allow for O(1) implementation.

Value parameters

random

a random generator; it is essential that random be instantiated by the caller just once for any sequence of calls

Attributes

Inherited from:
EdgeSet
def drop(n: Int): C

Attributes

Inherited from:
IterableOps
def dropRight(n: Int): C

Attributes

Inherited from:
IterableOps
def dropWhile(p: EdgeT => Boolean): C

Attributes

Inherited from:
IterableOps
override def empty: CC[A]

Attributes

Definition Classes
Inherited from:
IterableFactoryDefaults
override def equals(that: Any): Boolean

Compares the receiver object (this) with the argument object (that) for equivalence.

Compares the receiver object (this) with the argument object (that) for equivalence.

Any implementation of this method should be an equivalence relation:

  • It is reflexive: for any instance x of type Any, x.equals(x) should return true.
  • It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
  • It is transitive: for any instances x, y, and z of type Any if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

Value parameters

that

the object to compare against this object for equality.

Attributes

Returns

true if the receiver object is equivalent to the argument; false otherwise.

Definition Classes
Set -> Equals -> Any
Inherited from:
Set
def exists(p: EdgeT => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def filter(pred: EdgeT => Boolean): C

Attributes

Inherited from:
IterableOps
def filterNot(pred: EdgeT => Boolean): C

Attributes

Inherited from:
IterableOps
def find(p: EdgeT => Boolean): Option[A]

Attributes

Inherited from:
IterableOnceOps
def find(outerEdge: E): Option[EdgeT]

Finds the inner edge corresponding to outerEdge.

Finds the inner edge corresponding to outerEdge.

Attributes

Returns

the inner node wrapped by Some if found, otherwise None.

Inherited from:
EdgeSet
final def findElem[B](other: B, correspond: (EdgeT, B) => Boolean): EdgeT

Finds an entry in the collection based on toMatch's hashCode and a correspondence function but not on the argument type.

Finds an entry in the collection based on toMatch's hashCode and a correspondence function but not on the argument type.

Value parameters

correspond

function returning whether a given entry corresponds to other

toMatch

a value not necessarily of type A; the entry to be searched for must have the same hashCode and be equal to this argument

Attributes

Returns

the entry corresponding to toMatch or null if not contained

Inherited from:
EdgeSet
def findElem(elem: EdgeT): Option[A]

Attributes

Inherited from:
ExtSetMethods
def flatMap[B](f: EdgeT => IterableOnce[B]): CC[B]

Attributes

Inherited from:
IterableOps
def flatten[B](implicit asIterable: EdgeT => IterableOnce[B]): CC[B]

Attributes

Inherited from:
IterableOps
def fold[A1 >: EdgeT](z: A1)(op: (A1, A1) => A1): A1

Attributes

Inherited from:
IterableOnceOps
def foldLeft[B](z: B)(op: (B, EdgeT) => B): B

Attributes

Inherited from:
IterableOnceOps
final def foldLeftOuter[B](z: B)(opEdge: (B, E) => B): B

Same as foldLeft except the second parameter of opEdge.

Same as foldLeft except the second parameter of opEdge.

Value parameters

opEdge

binary operator that is passed the cumulated value and an outer edge.

Attributes

Inherited from:
EdgeSet
def foldRight[B](z: B)(op: (EdgeT, B) => B): B

Attributes

Inherited from:
IterableOnceOps
def forall(p: EdgeT => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def foreach[U](f: EdgeT => U): Unit

Attributes

Inherited from:
IterableOnceOps
protected def fromSpecific(coll: IterableOnce[EdgeT]): CC[A]

Attributes

Inherited from:
IterableFactoryDefaults
def groupBy[K](f: EdgeT => K): Map[K, C]

Attributes

Inherited from:
IterableOps
def groupMap[K, B](key: EdgeT => K)(f: EdgeT => B): Map[K, CC[B]]

Attributes

Inherited from:
IterableOps
def groupMapReduce[K, B](key: EdgeT => K)(f: EdgeT => B)(reduce: (B, B) => B): Map[K, B]

Attributes

Inherited from:
IterableOps
def grouped(size: Int): Iterator[C]

Attributes

Inherited from:
IterableOps
override def hashCode(): Int

Calculate a hash code value for the object.

Calculate a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

Attributes

Returns

the hash code value for this object.

Definition Classes
Set -> Any
Inherited from:
Set
def head: A

Attributes

Inherited from:
IterableOps
def headOption: Option[A]

Attributes

Inherited from:
IterableOps
def init: C

Attributes

Inherited from:
IterableOps
def inits: Iterator[C]

Attributes

Inherited from:
IterableOps
def intersect(that: Set[EdgeT]): C

Attributes

Inherited from:
SetOps
def isEmpty: Boolean

Attributes

Inherited from:
IterableOnceOps
override def isTraversableAgain: Boolean

Attributes

Definition Classes
Inherited from:
IterableOps
override def iterableFactory: IterableFactory[Set]

Attributes

Definition Classes
Inherited from:
Set
def iterator: Iterator[A]

Attributes

Inherited from:
IterableOnce
def knownSize: Int

Attributes

Inherited from:
IterableOnce
def last: A

Attributes

Inherited from:
IterableOps
def lastOption: Option[A]

Attributes

Inherited from:
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, Iterable]

Attributes

Inherited from:
Iterable
def map[B](f: EdgeT => B): CC[B]

Attributes

Inherited from:
IterableOps
def max[B >: EdgeT](implicit ord: Ordering[B]): A

Attributes

Inherited from:
IterableOnceOps
def maxArity: Int

The maximum arity of all edges in this edge set.

The maximum arity of all edges in this edge set.

Attributes

Inherited from:
EdgeSet
def maxBy[B](f: EdgeT => B)(implicit ord: Ordering[B]): A

Attributes

Inherited from:
IterableOnceOps
def maxByOption[B](f: EdgeT => B)(implicit ord: Ordering[B]): Option[A]

Attributes

Inherited from:
IterableOnceOps
def maxOption[B >: EdgeT](implicit ord: Ordering[B]): Option[A]

Attributes

Inherited from:
IterableOnceOps
def min[B >: EdgeT](implicit ord: Ordering[B]): A

Attributes

Inherited from:
IterableOnceOps
def minBy[B](f: EdgeT => B)(implicit ord: Ordering[B]): A

Attributes

Inherited from:
IterableOnceOps
def minByOption[B](f: EdgeT => B)(implicit ord: Ordering[B]): Option[A]

Attributes

Inherited from:
IterableOnceOps
def minOption[B >: EdgeT](implicit ord: Ordering[B]): Option[A]

Attributes

Inherited from:
IterableOnceOps
final def mkString: String

Attributes

Inherited from:
IterableOnceOps
final def mkString(sep: String): String

Attributes

Inherited from:
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String

Attributes

Inherited from:
IterableOnceOps
protected def newSpecificBuilder: Builder[A, CC[A]]

Attributes

Inherited from:
IterableFactoryDefaults
def nonEmpty: Boolean

Attributes

Inherited from:
IterableOnceOps
final def outerIterable: Iterable[E]

Iterable over this EdgeSet mapped to outer edges.

Iterable over this EdgeSet mapped to outer edges.

Attributes

Inherited from:
EdgeSet
final def outerIterator: Iterator[E]

Iterator over this EdgeSet mapped to outer edges.

Iterator over this EdgeSet mapped to outer edges.

Attributes

Inherited from:
EdgeSet
def partition(p: EdgeT => Boolean): (C, C)

Attributes

Inherited from:
IterableOps
def partitionMap[A1, A2](f: EdgeT => Either[A1, A2]): (CC[A1], CC[A2])

Attributes

Inherited from:
IterableOps
def product[B >: EdgeT](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def reduce[B >: EdgeT](op: (B, B) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceLeft[B >: EdgeT](op: (B, EdgeT) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceLeftOption[B >: EdgeT](op: (B, EdgeT) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reduceOption[B >: EdgeT](op: (B, B) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reduceRight[B >: EdgeT](op: (EdgeT, B) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceRightOption[B >: EdgeT](op: (EdgeT, B) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def render(style: SetStyle, separator: String, withPrefix: Boolean)(implicit ord: Ordering[EdgeT]): String

Sorts all nodes according to ord, concatenates them using separator, and prefixes and parenthesizes the result if withPrefix is true.

Sorts all nodes according to ord, concatenates them using separator, and prefixes and parenthesizes the result if withPrefix is true.

Attributes

Inherited from:
SetToString (hidden)
def render(style: SetStyle, separator: String, prefix: String)(implicit ord: Ordering[EdgeT]): String

Sorts all nodes according to ord, concatenates them using separator, and prefixes and parenthesizes the result unless prefix is blank.

Sorts all nodes according to ord, concatenates them using separator, and prefixes and parenthesizes the result unless prefix is blank.

Attributes

Inherited from:
SetToString (hidden)
protected def reversed: Iterable[A]

Attributes

Inherited from:
IterableOnceOps
def scan[B >: EdgeT](z: B)(op: (B, B) => B): CC[B]

Attributes

Inherited from:
IterableOps
def scanLeft[B](z: B)(op: (B, EdgeT) => B): CC[B]

Attributes

Inherited from:
IterableOps
def scanRight[B](z: B)(op: (EdgeT, B) => B): CC[B]

Attributes

Inherited from:
IterableOps
def size: Int

Attributes

Inherited from:
IterableOnceOps
def sizeCompare(that: Iterable[_]): Int

Attributes

Inherited from:
IterableOps
def sizeCompare(otherSize: Int): Int

Attributes

Inherited from:
IterableOps
final def sizeIs: SizeCompareOps

Attributes

Inherited from:
IterableOps
def slice(from: Int, until: Int): C

Attributes

Inherited from:
IterableOps
def sliding(size: Int, step: Int): Iterator[C]

Attributes

Inherited from:
IterableOps
def sliding(size: Int): Iterator[C]

Attributes

Inherited from:
IterableOps
def span(p: EdgeT => Boolean): (C, C)

Attributes

Inherited from:
IterableOps
override def splitAt(n: Int): (C, C)

Attributes

Definition Classes
Inherited from:
IterableOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[EdgeT, S]): S

Attributes

Inherited from:
IterableOnce
def subsetOf(that: Set[EdgeT]): Boolean

Attributes

Inherited from:
SetOps
def subsets(): Iterator[C]

Attributes

Inherited from:
SetOps
def subsets(len: Int): Iterator[C]

Attributes

Inherited from:
SetOps
def sum[B >: EdgeT](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def tail: C

Attributes

Inherited from:
IterableOps
def tails: Iterator[C]

Attributes

Inherited from:
IterableOps
def take(n: Int): C

Attributes

Inherited from:
IterableOps
def takeRight(n: Int): C

Attributes

Inherited from:
IterableOps
def takeWhile(p: EdgeT => Boolean): C

Attributes

Inherited from:
IterableOps
override def tapEach[U](f: EdgeT => U): C

Attributes

Definition Classes
Inherited from:
IterableOps
def to[C1](factory: Factory[EdgeT, C1]): C1

Attributes

Inherited from:
IterableOnceOps
def toArray[B >: EdgeT : ClassTag]: Array[B]

Attributes

Inherited from:
IterableOnceOps
final def toBuffer[B >: EdgeT]: Buffer[B]

Attributes

Inherited from:
IterableOnceOps
def toIndexedSeq: IndexedSeq[A]

Attributes

Inherited from:
IterableOnceOps
def toList: List[A]

Attributes

Inherited from:
IterableOnceOps
def toMap[K, V](implicit ev: EdgeT <:< (K, V)): Map[K, V]

Attributes

Inherited from:
IterableOnceOps
def toOuter: Set[E]

Converts this edge set to a set of outer edges.

Converts this edge set to a set of outer edges.

Attributes

Inherited from:
EdgeSet
def toSeq: Seq[A]

Attributes

Inherited from:
IterableOnceOps
def toSet[B >: EdgeT]: Set[B]

Attributes

Inherited from:
IterableOnceOps
override def toString(): String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Attributes

Returns

a string representation of the object.

Definition Classes
Set -> Function1 -> Iterable -> Any
Inherited from:
Set
def toVector: Vector[A]

Attributes

Inherited from:
IterableOnceOps
def transpose[B](implicit asIterable: EdgeT => Iterable[B]): CC[CC[B]]

Attributes

Inherited from:
IterableOps
final def union(that: Set[EdgeT]): C

Attributes

Inherited from:
SetOps
def unzip[A1, A2](implicit asPair: EdgeT => (A1, A2)): (CC[A1], CC[A2])

Attributes

Inherited from:
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: EdgeT => (A1, A2, A3)): (CC[A1], CC[A2], CC[A3])

Attributes

Inherited from:
IterableOps
def view: View[A]

Attributes

Inherited from:
IterableOps
def withFilter(p: EdgeT => Boolean): WithFilter[A, CC]

Attributes

Inherited from:
IterableOps
def withSetFilter(p: EdgeT => Boolean): Set[A] & FilterableSet[A]

Attributes

Inherited from:
FilterableSet
def zip[B](that: IterableOnce[B]): CC[(A, B)]

Attributes

Inherited from:
IterableOps
def zipAll[A1 >: EdgeT, B](that: Iterable[B], thisElem: A1, thatElem: B): CC[(A1, B)]

Attributes

Inherited from:
IterableOps
def zipWithIndex: CC[(A, Int)]

Attributes

Inherited from:
IterableOps
final def |(that: Set[EdgeT]): C

Attributes

Inherited from:
SetOps

Deprecated and Inherited methods

def +(elem1: EdgeT, elem2: EdgeT, elems: EdgeT*): C

Attributes

Deprecated
[Since version 2.13.0] Use ++ with an explicit collection argument instead of + with varargs
Inherited from:
SetOps
def +(elem: EdgeT): C

Attributes

Deprecated
[Since version 2.13.0] Consider requiring an immutable Set or fall back to Set.union
Inherited from:
SetOps
def ++:[B >: EdgeT](that: IterableOnce[B]): CC[B]

Attributes

Deprecated
[Since version 2.13.0] Use ++ instead of ++: for collections of type Iterable
Inherited from:
IterableOps
def -(elem1: EdgeT, elem2: EdgeT, elems: EdgeT*): C

Attributes

Deprecated
[Since version 2.13.0] Use &- with an explicit collection argument instead of - with varargs
Inherited from:
SetOps
def -(elem: EdgeT): C

Attributes

Deprecated
[Since version 2.13.0] Consider requiring an immutable Set or fall back to Set.diff
Inherited from:
SetOps
def --(that: IterableOnce[EdgeT]): C

Attributes

Deprecated
[Since version 2.13.0] Consider requiring an immutable Set
Inherited from:
SetOps
final def /:[B](z: B)(op: (B, EdgeT) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
final def :\[B](z: B)(op: (EdgeT, B) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from:
IterableOnceOps
def aggregate[B](z: => B)(seqop: (B, EdgeT) => B, combop: (B, B) => B): B

Attributes

Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from:
IterableOnceOps
def companion: IterableFactory[CC]

Attributes

Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
final def copyToBuffer[B >: EdgeT](dest: Buffer[B]): Unit

Attributes

Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from:
IterableOnceOps
def hasDefiniteSize: Boolean

Attributes

Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from:
IterableOnceOps
final def repr: C

Attributes

Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from:
IterableOps
def seq: Iterable.this.type

Attributes

Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from:
Iterable
final def toIterable: Iterable.this.type

Attributes

Deprecated
[Since version 2.13.7] toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
Iterable
final def toIterator: Iterator[A]

Attributes

Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from:
IterableOnceOps
final def toStream: Stream[A]

Attributes

Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from:
IterableOnceOps
final def toTraversable: Iterable[A]

Attributes

Deprecated
[Since version 2.13.0] toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
IterableOps
def view(from: Int, until: Int): View[A]

Attributes

Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Inherited from:
IterableOps
Generated with