trait GraphLikeEdgeSet extends MSet[CC.EdgeT] with CC.GraphEdgeSet
- Alphabetic
- By Inheritance
- GraphLikeEdgeSet
- GraphEdgeSet
- EdgeSetToString
- SetToString
- EdgeSet
- Serializable
- ExtSetMethods
- FilterableSet
- Set
- SetOps
- Shrinkable
- Builder
- Growable
- Clearable
- Cloneable
- Cloneable
- Set
- Equals
- SetOps
- Function1
- Iterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- by iterableOnceExtensionMethods
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def contains(node: CC.NodeT): Boolean
- Definition Classes
- EdgeSet
- abstract def contains(elem: CC.EdgeT): Boolean
- Definition Classes
- SetOps
- abstract def find(outerEdge: E): Option[CC.EdgeT]
Finds the inner edge corresponding to
outerEdge
.Finds the inner edge corresponding to
outerEdge
.- returns
the inner node wrapped by
Some
if found, otherwise None.
- Definition Classes
- EdgeSet
- abstract def hasAnyHyperEdge: Boolean
- Definition Classes
- GraphEdgeSet
- abstract def hasAnyMultiEdge: Boolean
- Definition Classes
- GraphEdgeSet
- abstract def hasMixedEdges: Boolean
- Definition Classes
- GraphEdgeSet
- abstract def hasOnlyDiEdges: Boolean
- Definition Classes
- GraphEdgeSet
- abstract def hasOnlyUnDiEdges: Boolean
- Definition Classes
- GraphEdgeSet
- abstract def initialize(edges: Iterable[E]): 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[collection]
- Definition Classes
- EdgeSet
- abstract def iterator: Iterator[CC.EdgeT]
- Definition Classes
- IterableOnce
- abstract def removeWithNodes(edge: CC.EdgeT): Boolean
- abstract def upsert(edge: CC.EdgeT): Boolean
Same as
upsert
at graph level.
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def &(that: Set[CC.EdgeT]): Set[CC.EdgeT]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def &~(that: Set[CC.EdgeT]): Set[CC.EdgeT]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def ++(that: IterableOnce[CC.EdgeT]): Set[CC.EdgeT]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def ++[B >: CC.EdgeT](suffix: IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def ++=(xs: IterableOnce[CC.EdgeT]): GraphLikeEdgeSet.this.type
- Definition Classes
- Growable
- Annotations
- @inline()
- final def +=(elem: CC.EdgeT): GraphLikeEdgeSet.this.type
- Definition Classes
- Growable
- Annotations
- @inline()
- final def --=(xs: IterableOnce[CC.EdgeT]): GraphLikeEdgeSet.this.type
- Definition Classes
- Shrinkable
- Annotations
- @inline()
- final def -=(elem: CC.EdgeT): GraphLikeEdgeSet.this.type
- Definition Classes
- Shrinkable
- Annotations
- @inline()
- def ->[B](y: B): (CC.GraphLikeEdgeSet, B)
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toArrowAssoc[CC.GraphLikeEdgeSet] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def add(elem: CC.EdgeT): Boolean
- Definition Classes
- SetOps
- def addAll(xs: IterableOnce[CC.EdgeT]): GraphLikeEdgeSet.this.type
- Definition Classes
- Growable
- final def addOne(edge: CC.EdgeT): GraphLikeEdgeSet.this.type
- Definition Classes
- GraphLikeEdgeSet → Growable
- Annotations
- @inline()
- final def addString(b: StringBuilder): b.type
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): b.type
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
- Definition Classes
- IterableOnceOps
- def andThen[A](g: (Boolean) => A): (CC.EdgeT) => A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final def apply(elem: CC.EdgeT): Boolean
- Definition Classes
- SetOps → Function1
- Annotations
- @inline()
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def canEqual(that: Any): Boolean
- Definition Classes
- Set → Equals
- final def className: String
- Attributes
- protected
- Definition Classes
- EdgeSetToString → Iterable
- def clear(): Unit
- Definition Classes
- GraphLikeEdgeSet → Builder → Clearable
- def clone(): Set[CC.EdgeT]
- Definition Classes
- SetOps → Cloneable → AnyRef
- final def coll: GraphLikeEdgeSet.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[CC.EdgeT, B]): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[CC.EdgeT, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def compose[A](g: (A) => CC.EdgeT): (A) => Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def concat(that: IterableOnce[CC.EdgeT]): Set[CC.EdgeT]
- Definition Classes
- SetOps
- def concat[B >: CC.EdgeT](suffix: IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps
- def copyToArray[B >: CC.EdgeT](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: CC.EdgeT](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: CC.EdgeT](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: IterableOnce[B])(p: (CC.EdgeT, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (CC.EdgeT) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def diff(that: AnySet[CC.EdgeT]): MSet[CC.EdgeT]
- Definition Classes
- GraphLikeEdgeSet → EdgeSet → SetOps → SetOps
- final def draw(random: Random): CC.EdgeT
Returns a random element of the set if it is
nonEmpty
otherwise throwsIllegalArgumentException
.Returns a random element of the set if it is
nonEmpty
otherwise throwsIllegalArgumentException
. Note that currently a near- but no true-uniform distribution is granted to allow for O(1) implementation.- random
a random generator; it is essential that
random
be instantiated by the caller just once for any sequence of calls
- Definition Classes
- EdgeSet → ExtSetMethods
- def drop(n: Int): Set[CC.EdgeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): Set[CC.EdgeT]
- Definition Classes
- IterableOps
- def dropWhile(p: (CC.EdgeT) => Boolean): Set[CC.EdgeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def empty: Set[CC.EdgeT]
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def ensuring(cond: (CC.GraphLikeEdgeSet) => Boolean, msg: => Any): CC.GraphLikeEdgeSet
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toEnsuring[CC.GraphLikeEdgeSet] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (CC.GraphLikeEdgeSet) => Boolean): CC.GraphLikeEdgeSet
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toEnsuring[CC.GraphLikeEdgeSet] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): CC.GraphLikeEdgeSet
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toEnsuring[CC.GraphLikeEdgeSet] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): CC.GraphLikeEdgeSet
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toEnsuring[CC.GraphLikeEdgeSet] 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
- Set → Equals → AnyRef → Any
- def exists(p: (CC.EdgeT) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: (CC.EdgeT) => Boolean): Set[CC.EdgeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterInPlace(p: (CC.EdgeT) => Boolean): GraphLikeEdgeSet.this.type
- Definition Classes
- SetOps
- def filterNot(pred: (CC.EdgeT) => Boolean): Set[CC.EdgeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def find(p: (CC.EdgeT) => Boolean): Option[CC.EdgeT]
- Definition Classes
- IterableOnceOps
- final def findElem[B](other: B, correspond: (CC.EdgeT, B) => Boolean): CC.EdgeT
Finds an entry in the collection based on
toMatch
'shashCode
and a correspondence function but not on the argument type.Finds an entry in the collection based on
toMatch
'shashCode
and a correspondence function but not on the argument type.- correspond
function returning whether a given entry corresponds to
other
- returns
the entry corresponding to
toMatch
or null if not contained
- Definition Classes
- EdgeSet → ExtSetMethods
- def findElem(elem: CC.EdgeT): Option[CC.EdgeT]
- Definition Classes
- ExtSetMethods
- def flatMap[B](f: (CC.EdgeT) => IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (CC.EdgeT) => IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: CC.EdgeT](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, CC.EdgeT) => B): B
- Definition Classes
- IterableOnceOps
- final def foldLeftOuter[B](z: B)(opEdge: (B, E) => B): B
Same as
foldLeft
except the second parameter ofopEdge
.Same as
foldLeft
except the second parameter ofopEdge
.- opEdge
binary operator that is passed the cumulated value and an outer edge.
- Definition Classes
- EdgeSet
- def foldRight[B](z: B)(op: (CC.EdgeT, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (CC.EdgeT) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (CC.EdgeT) => U): Unit
- Definition Classes
- IterableOnceOps
- def fromSpecific(coll: IterableOnce[CC.EdgeT]): Set[CC.EdgeT]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def groupBy[K](f: (CC.EdgeT) => K): Map[K, Set[CC.EdgeT]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (CC.EdgeT) => K)(f: (CC.EdgeT) => B): Map[K, Set[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (CC.EdgeT) => K)(f: (CC.EdgeT) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Set[CC.EdgeT]]
- Definition Classes
- IterableOps
- def hashCode(): Int
- Definition Classes
- Set → AnyRef → Any
- def head: CC.EdgeT
- Definition Classes
- IterableOps
- def headOption: Option[CC.EdgeT]
- Definition Classes
- IterableOps
- def init: Set[CC.EdgeT]
- Definition Classes
- IterableOps
- def inits: Iterator[Set[CC.EdgeT]]
- Definition Classes
- IterableOps
- def intersect(that: Set[CC.EdgeT]): Set[CC.EdgeT]
- Definition Classes
- SetOps
- def isEmpty: Boolean
- Definition Classes
- IterableOnceOps
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: IterableFactory[Set]
- Definition Classes
- Set → Set → Iterable → Iterable → IterableOps
- def knownSize: Int
- Definition Classes
- SetOps → Growable → IterableOnce
- def last: CC.EdgeT
- Definition Classes
- IterableOps
- def lastOption: Option[CC.EdgeT]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[CC.EdgeT, B, GraphLikeEdgeSet.this.type]
- Definition Classes
- Iterable
- def map[B](f: (CC.EdgeT) => B): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def mapResult[NewTo](f: (Set[CC.EdgeT]) => NewTo): scala.collection.mutable.Builder[CC.EdgeT, NewTo]
- Definition Classes
- Builder
- def max[B >: CC.EdgeT](implicit ord: Ordering[B]): CC.EdgeT
- Definition Classes
- IterableOnceOps
- def maxArity: Int
The maximum arity of all edges in this edge set.
The maximum arity of all edges in this edge set.
- Definition Classes
- EdgeSet
- def maxBy[B](f: (CC.EdgeT) => B)(implicit cmp: Ordering[B]): CC.EdgeT
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (CC.EdgeT) => B)(implicit cmp: Ordering[B]): Option[CC.EdgeT]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: CC.EdgeT](implicit ord: Ordering[B]): Option[CC.EdgeT]
- Definition Classes
- IterableOnceOps
- def min[B >: CC.EdgeT](implicit ord: Ordering[B]): CC.EdgeT
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (CC.EdgeT) => B)(implicit cmp: Ordering[B]): CC.EdgeT
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (CC.EdgeT) => B)(implicit cmp: Ordering[B]): Option[CC.EdgeT]
- Definition Classes
- IterableOnceOps
- def minOption[B >: CC.EdgeT](implicit ord: Ordering[B]): Option[CC.EdgeT]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: scala.collection.mutable.Builder[CC.EdgeT, Set[CC.EdgeT]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def outerIterable: Iterable[E]
Iterable
over thisEdgeSet
mapped to outer edges.Iterable
over thisEdgeSet
mapped to outer edges.- Definition Classes
- EdgeSet
- Annotations
- @inline()
- final def outerIterator: Iterator[E]
Iterator
over thisEdgeSet
mapped to outer edges.Iterator
over thisEdgeSet
mapped to outer edges.- Definition Classes
- EdgeSet
- Annotations
- @inline()
- def partition(p: (CC.EdgeT) => Boolean): (Set[CC.EdgeT], Set[CC.EdgeT])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (CC.EdgeT) => Either[A1, A2]): (Set[A1], Set[A2])
- Definition Classes
- IterableOps
- def product[B >: CC.EdgeT](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def reduce[B >: CC.EdgeT](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: CC.EdgeT](op: (B, CC.EdgeT) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: CC.EdgeT](op: (B, CC.EdgeT) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: CC.EdgeT](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: CC.EdgeT](op: (CC.EdgeT, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: CC.EdgeT](op: (CC.EdgeT, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def remove(elem: CC.EdgeT): Boolean
- Definition Classes
- SetOps
- def render(style: SetStyle, separator: String, withPrefix: Boolean)(implicit ord: Ordering[CC.EdgeT]): String
Sorts all nodes according to
ord
, concatenates them usingseparator
, and prefixes and parenthesizes the result ifwithPrefix
istrue
.Sorts all nodes according to
ord
, concatenates them usingseparator
, and prefixes and parenthesizes the result ifwithPrefix
istrue
.- Definition Classes
- SetToString
- def render(style: SetStyle, separator: String = GraphBase.defaultSeparator, prefix: String = className)(implicit ord: Ordering[CC.EdgeT]): String
Sorts all nodes according to
ord
, concatenates them usingseparator
, and prefixes and parenthesizes the result unlessprefix
is blank.Sorts all nodes according to
ord
, concatenates them usingseparator
, and prefixes and parenthesizes the result unlessprefix
is blank.- Definition Classes
- SetToString
- def result(): Set[CC.EdgeT]
- Definition Classes
- SetOps → Builder
- def reversed: Iterable[CC.EdgeT]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def scan[B >: CC.EdgeT](z: B)(op: (B, B) => B): Set[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, CC.EdgeT) => B): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (CC.EdgeT, B) => B): Set[B]
- Definition Classes
- IterableOps
- def size: Int
- Definition Classes
- IterableOnceOps
- def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
- Definition Classes
- IterableOps
- final def sizeHint(coll: IterableOnce[_], delta: Int): Unit
- Definition Classes
- Builder
- def sizeHint(size: Int): Unit
- Definition Classes
- Builder
- final def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit
- Definition Classes
- Builder
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): Set[CC.EdgeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[Set[CC.EdgeT]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Set[CC.EdgeT]]
- Definition Classes
- IterableOps
- def span(p: (CC.EdgeT) => Boolean): (Set[CC.EdgeT], Set[CC.EdgeT])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (Set[CC.EdgeT], Set[CC.EdgeT])
- Definition Classes
- IterableOps → IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[CC.EdgeT, S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- Set → Iterable
- def subsetOf(that: Set[CC.EdgeT]): Boolean
- Definition Classes
- SetOps
- def subsets(): Iterator[Set[CC.EdgeT]]
- Definition Classes
- SetOps
- def subsets(len: Int): Iterator[Set[CC.EdgeT]]
- Definition Classes
- SetOps
- def subtractAll(xs: IterableOnce[CC.EdgeT]): GraphLikeEdgeSet.this.type
- Definition Classes
- Shrinkable
- final def subtractOne(edge: CC.EdgeT): GraphLikeEdgeSet.this.type
- Definition Classes
- GraphLikeEdgeSet → Shrinkable
- Annotations
- @inline()
- def sum[B >: CC.EdgeT](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: Set[CC.EdgeT]
- Definition Classes
- IterableOps
- def tails: Iterator[Set[CC.EdgeT]]
- Definition Classes
- IterableOps
- def take(n: Int): Set[CC.EdgeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): Set[CC.EdgeT]
- Definition Classes
- IterableOps
- def takeWhile(p: (CC.EdgeT) => Boolean): Set[CC.EdgeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: (CC.EdgeT) => U): Set[CC.EdgeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[CC.EdgeT, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: CC.EdgeT](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: CC.EdgeT]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[CC.EdgeT]
- Definition Classes
- IterableOnceOps
- def toList: List[CC.EdgeT]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[CC.EdgeT, (K, V)]): Map[K, V]
- Definition Classes
- 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.
- Definition Classes
- EdgeSet
- def toSeq: Seq[CC.EdgeT]
- Definition Classes
- IterableOnceOps
- def toSet[B >: CC.EdgeT]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- Definition Classes
- Set → Function1 → Iterable → AnyRef → Any
- def toVector: Vector[CC.EdgeT]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (CC.EdgeT) => Iterable[B]): Set[Set[B]]
- Definition Classes
- IterableOps
- final def union(that: Set[CC.EdgeT]): Set[CC.EdgeT]
- Definition Classes
- SetOps
- Annotations
- @inline()
- def unzip[A1, A2](implicit asPair: (CC.EdgeT) => (A1, A2)): (Set[A1], Set[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (CC.EdgeT) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
- Definition Classes
- IterableOps
- def update(elem: CC.EdgeT, included: Boolean): Unit
- Definition Classes
- SetOps
- def view: View[CC.EdgeT]
- Definition Classes
- IterableOps
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withFilter(p: (CC.EdgeT) => Boolean): WithFilter[CC.EdgeT, [_]Set[_]]
- Definition Classes
- IterableOps
- def withSetFilter(p: (CC.EdgeT) => Boolean): Set[CC.EdgeT] with FilterableSet[CC.EdgeT]
- Definition Classes
- FilterableSet
- def zip[B](that: IterableOnce[B]): Set[(CC.EdgeT, B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: CC.EdgeT, B](that: Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Set[(CC.EdgeT, Int)]
- Definition Classes
- IterableOps → IterableOnceOps
- final def |(that: Set[CC.EdgeT]): Set[CC.EdgeT]
- Definition Classes
- SetOps
- Annotations
- @inline()
Shadowed Implicit Value Members
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toany2stringadd[CC.GraphLikeEdgeSet] 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:(graphLikeEdgeSet: any2stringadd[CC.GraphLikeEdgeSet]).+(other)
- Definition Classes
- any2stringadd
Deprecated Value Members
- def +(elem1: CC.EdgeT, elem2: CC.EdgeT, elems: CC.EdgeT*): Set[CC.EdgeT]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
- def +(elem: CC.EdgeT): Set[CC.EdgeT]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Consider requiring an immutable Set or fall back to Set.union
- def ++:[B >: CC.EdgeT](that: IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
- final def +=(elem1: CC.EdgeT, elem2: CC.EdgeT, elems: CC.EdgeT*): GraphLikeEdgeSet.this.type
- Definition Classes
- Growable
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
++=
akaaddAll
instead of varargs+=
; infix operations with an operand of multiple args will be deprecated
- def -(elem1: CC.EdgeT, elem2: CC.EdgeT, elems: CC.EdgeT*): Set[CC.EdgeT]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs
- def -(elem: CC.EdgeT): Set[CC.EdgeT]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Consider requiring an immutable Set or fall back to Set.diff
- def --(that: IterableOnce[CC.EdgeT]): Set[CC.EdgeT]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Consider requiring an immutable Set
- def -=(elem1: CC.EdgeT, elem2: CC.EdgeT, elems: CC.EdgeT*): GraphLikeEdgeSet.this.type
- Definition Classes
- Shrinkable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.3) Use
--=
akasubtractAll
instead of varargs-=
; infix operations with an operand of multiple args will be deprecated
- def /:[B](z: B)(op: (B, CC.EdgeT) => B): B
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT])./:(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
- final def /:[B](z: B)(op: (B, CC.EdgeT) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- def :\[B](z: B)(op: (CC.EdgeT, B) => B): B
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).:\(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- final def :\[B](z: B)(op: (CC.EdgeT, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, CC.EdgeT) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregate
is not relevant for sequential collections. UsefoldLeft(z)(seqop)
instead.
- def collectFirst[B](f: PartialFunction[CC.EdgeT, B]): Option[B]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).collectFirst(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.collectFirst(...) instead
- def companion: IterableFactory[[_]Set[_]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- def copyToBuffer(dest: Buffer[CC.EdgeT]): Unit
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).copyToBuffer(dest)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.copyToBuffer(...) instead
- final def copyToBuffer[B >: CC.EdgeT](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def count(f: (CC.EdgeT) => Boolean): Int
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).count(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.count(...) instead
- def exists(f: (CC.EdgeT) => Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).exists(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.exists(...) instead
- def filter(f: (CC.EdgeT) => Boolean): Iterator[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).filter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.filter(...) instead
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def find(p: (CC.EdgeT) => Boolean): Option[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).find(p)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.find instead
- def flatMap[B](f: (CC.EdgeT) => IterableOnce[B]): IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).flatMap(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable
- def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).fold(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.fold instead
- def foldLeft[B](z: B)(op: (B, CC.EdgeT) => B): B
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).foldLeft(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
- def foldRight[B](z: B)(op: (CC.EdgeT, B) => B): B
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).foldRight(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- def forall(f: (CC.EdgeT) => Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).forall(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.forall(...) instead
- def foreach[U](f: (CC.EdgeT) => U): Unit
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).foreach(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foreach(...) instead
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toStringFormat[CC.GraphLikeEdgeSet] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)
instead ofvalue.formatted(formatString)
, or use thef""
string interpolator. In Java 15 and later,formatted
resolves to the new method in String which has reversed parameters.
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- def isEmpty: Boolean
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).isEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.isEmpty instead
- def map[B](f: (CC.EdgeT) => B): IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).map(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable
- def max(implicit ord: Ordering[CC.EdgeT]): CC.EdgeT
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).max(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.max instead
- def maxBy[B](f: (CC.EdgeT) => B)(implicit cmp: Ordering[B]): CC.EdgeT
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).maxBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.maxBy(...) instead
- def min(implicit ord: Ordering[CC.EdgeT]): CC.EdgeT
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).min(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.min instead
- def minBy[B](f: (CC.EdgeT) => B)(implicit cmp: Ordering[B]): CC.EdgeT
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).minBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.minBy(...) instead
- def mkString: String
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).mkString
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def mkString(sep: String): String
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).mkString(sep)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def mkString(start: String, sep: String, end: String): String
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).mkString(start, sep, end)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def nonEmpty: Boolean
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).nonEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.nonEmpty instead
- def product(implicit num: Numeric[CC.EdgeT]): CC.EdgeT
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).product(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.product instead
- def reduce(f: (CC.EdgeT, CC.EdgeT) => CC.EdgeT): CC.EdgeT
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).reduce(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduce(...) instead
- def reduceLeft(f: (CC.EdgeT, CC.EdgeT) => CC.EdgeT): CC.EdgeT
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).reduceLeft(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeft(...) instead
- def reduceLeftOption(f: (CC.EdgeT, CC.EdgeT) => CC.EdgeT): Option[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).reduceLeftOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead
- def reduceOption(f: (CC.EdgeT, CC.EdgeT) => CC.EdgeT): Option[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).reduceOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceOption(...) instead
- def reduceRight(f: (CC.EdgeT, CC.EdgeT) => CC.EdgeT): CC.EdgeT
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).reduceRight(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRight(...) instead
- def reduceRightOption(f: (CC.EdgeT, CC.EdgeT) => CC.EdgeT): Option[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).reduceRightOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRightOption(...) instead
- final def repr: Set[CC.EdgeT]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- final def retain(p: (CC.EdgeT) => Boolean): Unit
- Definition Classes
- SetOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use filterInPlace instead
- def sameElements[B >: A](that: IterableOnce[B]): Boolean
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sameElements instead
- def seq: GraphLikeEdgeSet.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- def size: Int
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).size
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.size instead
- def sum(implicit num: Numeric[CC.EdgeT]): CC.EdgeT
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).sum(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sum instead
- def to[C1](factory: Factory[CC.EdgeT, C1]): C1
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).to(factory)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(factory) instead
- def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).toArray(arg0)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toArray
- def toBuffer[B >: A]: Buffer[B]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).toBuffer
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead
- def toIndexedSeq: IndexedSeq[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).toIndexedSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toIndexedSeq instead
- final def toIterable: Iterable[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).toIterable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- final def toIterable: GraphLikeEdgeSet.this.type
- Definition Classes
- Iterable → IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to
toList
ortoSeq
, but it doesn't copy non-immutable collections
- def toIterator: Iterator[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).toIterator
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead
- final def toIterator: Iterator[CC.EdgeT]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- def toList: List[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).toList
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(List) instead
- def toMap[K, V](implicit ev: <:<[CC.EdgeT, (K, V)]): Map[K, V]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).toMap(ev)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(Map) instead
- def toSeq: Seq[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).toSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Seq) instead
- def toSet[B >: A]: Set[B]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).toSet
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Set) instead
- def toStream: Stream[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).toStream
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(LazyList) instead
- final def toStream: Stream[CC.EdgeT]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).toTraversable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- final def toTraversable: Traversable[CC.EdgeT]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to
toList
ortoSeq
, but it doesn't copy non-immutable collections
- def toVector: Vector[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).toVector
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Vector) instead
- def view(from: Int, until: Int): View[CC.EdgeT]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)
- def withFilter(f: (CC.EdgeT) => Boolean): Iterator[CC.EdgeT]
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toIterableOnceExtensionMethods[CC.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLikeEdgeSet: IterableOnceExtensionMethods[CC.EdgeT]).withFilter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.withFilter(...) instead
- def →[B](y: B): (CC.GraphLikeEdgeSet, B)
- Implicit
- This member is added by an implicit conversion from CC.GraphLikeEdgeSet toArrowAssoc[CC.GraphLikeEdgeSet] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->
instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
Welcome to the Graph for Scala API reference. Some suggested entry points:
AnyGraph
immutable.Graph
and its inner nodesmutable.Graph
and its inner nodes.edges
package and its subpackageshyperedges
package and its subpackages.labeled edges
packagemultilabeled edges
packagelabeled hyperedges
packagemultilabeled hyperedges
packageordered labeled hyperedges
packageordered multilabeled hyperedges
objectgeneric
package.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.