trait NodeSet extends (GraphLike.this)#NodeSet
- Alphabetic
- By Inheritance
- NodeSet
- NodeSet
- NodeSet
- NodeSet
- 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 EdgeAssoc
- by predicateToNodePredicate
- by TraversableEnrichments
- by anyToNode
- by ChainingOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def addOne(elem: (GraphLike.this)#NodeT): NodeSet.this.type
- Definition Classes
- Growable
- abstract def contains(elem: (GraphLike.this)#NodeT): Boolean
- Definition Classes
- SetOps
- abstract def copy: (GraphLike.this)#NodeSetT
- Attributes
- protected
- Definition Classes
- NodeSet
- abstract def draw(random: Random): (GraphLike.this)#NodeT
- Definition Classes
- NodeSet → ExtSetMethods
- abstract def find(outerNode: N): Option[(GraphLike.this)#NodeT]
- Definition Classes
- NodeSet
- abstract def findElem[B](toMatch: B, correspond: ((GraphLike.this)#NodeT, B) => Boolean): (GraphLike.this)#NodeT
- Definition Classes
- ExtSetMethods
- abstract def get(outerNode: N): (GraphLike.this)#NodeT
- Definition Classes
- NodeSet
- abstract def initialize(nodes: Iterable[N], edges: Iterable[E[N]]): Unit
- Attributes
- protected[collection]
- Definition Classes
- NodeSet
- abstract def iterator: Iterator[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOnce
- abstract def lookup(outerNode: N): (GraphLike.this)#NodeT
- Definition Classes
- NodeSet
- abstract def minus(node: (GraphLike.this)#NodeT): Unit
- Attributes
- protected
- Definition Classes
- NodeSet
- abstract def minusEdges(node: (GraphLike.this)#NodeT): Unit
- Attributes
- protected
- Definition Classes
- NodeSet
- abstract def subtractOne(elem: (GraphLike.this)#NodeT): NodeSet.this.type
- Definition Classes
- Shrinkable
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- final def &(that: Set[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def &~(that: Set[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def ++(that: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def ++[B >: (GraphLike.this)#NodeT](suffix: scala.collection.IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def ++=(xs: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): NodeSet.this.type
- Definition Classes
- Growable
- Annotations
- @inline()
- final def +=(elem: (GraphLike.this)#NodeT): NodeSet.this.type
- Definition Classes
- Growable
- Annotations
- @inline()
- final def -(node: (GraphLike.this)#NodeT): (GraphLike.this)#NodeSetT
- Definition Classes
- NodeSet → SetOps
- final def --=(xs: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): NodeSet.this.type
- Definition Classes
- Shrinkable
- Annotations
- @inline()
- def -=(elem1: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): NodeSet.this.type
- Definition Classes
- Shrinkable
- final def -=(elem: (GraphLike.this)#NodeT): NodeSet.this.type
- Definition Classes
- Shrinkable
- Annotations
- @inline()
- def ->[B](y: B): ((GraphLike.this)#NodeSet, B)
- final def -?=(node: (GraphLike.this)#NodeT): NodeSet.this.type
- Definition Classes
- NodeSet
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def add(elem: (GraphLike.this)#NodeT): Boolean
- Definition Classes
- SetOps
- def addAll(xs: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): NodeSet.this.type
- Definition Classes
- Growable
- final def addString(b: StringBuilder): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- IterableOnceOps
- def adjacencyListsToString: String
- Definition Classes
- NodeSet
- def andThen[A](g: (Boolean) => A): ((GraphLike.this)#NodeT) => A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final def apply(elem: (GraphLike.this)#NodeT): Boolean
- Definition Classes
- SetOps → Function1
- Annotations
- @inline()
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def asSortedString(separator: String)(implicit ord: (GraphLike.this)#NodeOrdering): String
- Definition Classes
- NodeSet
- def canEqual(that: Any): Boolean
- Definition Classes
- Set → Equals
- def checkedRemove(fake: (GraphLike.this)#NodeT, ripple: Boolean): Either[ConstraintViolation, Boolean]
- Attributes
- protected
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clear(): Unit
- Definition Classes
- NodeSet → Builder → Clearable
- def clone(): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps → Cloneable → AnyRef
- final def coll: NodeSet.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[(GraphLike.this)#NodeT, B]): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[(GraphLike.this)#NodeT, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def compose[A](g: (A) => (GraphLike.this)#NodeT): (A) => Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def concat(that: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps
- def concat[B >: (GraphLike.this)#NodeT](suffix: scala.collection.IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps
- def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- def corresponds[B](that: scala.collection.IterableOnce[B])(p: ((GraphLike.this)#NodeT, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: ((GraphLike.this)#NodeT) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def diff(that: AnySet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
- Definition Classes
- NodeSet → NodeSet → SetOps → SetOps
- def drop(n: Int): Set[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): Set[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps
- def dropWhile(p: ((GraphLike.this)#NodeT) => Boolean): Set[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def empty: Set[(GraphLike.this)#NodeT]
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def ensuring(cond: ((GraphLike.this)#NodeSet) => Boolean, msg: => Any): (GraphLike.this)#NodeSet
- def ensuring(cond: ((GraphLike.this)#NodeSet) => Boolean): (GraphLike.this)#NodeSet
- def ensuring(cond: Boolean, msg: => Any): (GraphLike.this)#NodeSet
- def ensuring(cond: Boolean): (GraphLike.this)#NodeSet
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- Set → Equals → AnyRef → Any
- def exists(p: ((GraphLike.this)#NodeT) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: ((GraphLike.this)#NodeT) => Boolean): Set[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterInPlace(p: ((GraphLike.this)#NodeT) => Boolean): NodeSet.this.type
- Definition Classes
- SetOps
- def filterNot(pred: ((GraphLike.this)#NodeT) => Boolean): Set[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def find(p: ((GraphLike.this)#NodeT) => Boolean): Option[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOnceOps
- def findElem(elem: (GraphLike.this)#NodeT): Option[(GraphLike.this)#NodeT]
- Definition Classes
- ExtSetMethods
- def flatMap[B](f: ((GraphLike.this)#NodeT) => scala.collection.IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: ((GraphLike.this)#NodeT) => scala.collection.IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: (GraphLike.this)#NodeT](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: ((GraphLike.this)#NodeT) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: ((GraphLike.this)#NodeT) => U): Unit
- Definition Classes
- IterableOnceOps
- def formatted(fmtstr: String): String
- def fromSpecific(coll: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def groupBy[K](f: ((GraphLike.this)#NodeT) => K): Map[K, Set[(GraphLike.this)#NodeT]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: ((GraphLike.this)#NodeT) => K)(f: ((GraphLike.this)#NodeT) => B): Map[K, Set[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: ((GraphLike.this)#NodeT) => K)(f: ((GraphLike.this)#NodeT) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Set[(GraphLike.this)#NodeT]]
- Definition Classes
- IterableOps
- def handleNotGentlyRemovable: Boolean
- Attributes
- protected
- Definition Classes
- NodeSet
- def hashCode(): Int
- Definition Classes
- Set → AnyRef → Any
- def head: (GraphLike.this)#NodeT
- Definition Classes
- IterableOps
- def headOption: Option[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps
- def init: Set[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps
- def inits: Iterator[Set[(GraphLike.this)#NodeT]]
- Definition Classes
- IterableOps
- def intersect(that: Set[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps
- def isDefined: Boolean
- final def isEdge: Boolean
- def isEmpty: Boolean
- Definition Classes
- IterableOnceOps
- def isIn: Boolean
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isNode: Boolean
- final def isOut: Boolean
- 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: (GraphLike.this)#NodeT
- Definition Classes
- IterableOps
- def lastOption: Option[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[(GraphLike.this)#NodeT, B, NodeSet.this.type]
- Definition Classes
- Iterable
- def map[B](f: ((GraphLike.this)#NodeT) => B): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def mapResult[NewTo](f: (Set[(GraphLike.this)#NodeT]) => NewTo): Builder[(GraphLike.this)#NodeT, NewTo]
- Definition Classes
- Builder
- def max[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): (GraphLike.this)#NodeT
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): Option[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): Option[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOnceOps
- def min[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): (GraphLike.this)#NodeT
- Definition Classes
- IterableOnceOps
- def minBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): Option[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOnceOps
- def minOption[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): Option[(GraphLike.this)#NodeT]
- 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
- val n1: (GraphLike.this)#NodeSet
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def partition(p: ((GraphLike.this)#NodeT) => Boolean): (Set[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: ((GraphLike.this)#NodeT) => Either[A1, A2]): (Set[A1], Set[A2])
- Definition Classes
- IterableOps
- def pipe[B](f: ((GraphLike.this)#NodeSet) => B): B
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toChainingOps[(GraphLike.this)#NodeSet] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def product[B >: (GraphLike.this)#NodeT](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def productElementNames: Iterator[String]
- def reduce[B >: (GraphLike.this)#NodeT](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: (GraphLike.this)#NodeT](op: (B, (GraphLike.this)#NodeT) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: (GraphLike.this)#NodeT](op: (B, (GraphLike.this)#NodeT) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: (GraphLike.this)#NodeT](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: (GraphLike.this)#NodeT](op: ((GraphLike.this)#NodeT, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: (GraphLike.this)#NodeT](op: ((GraphLike.this)#NodeT, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- final def remove(node: (GraphLike.this)#NodeT): Boolean
- Definition Classes
- NodeSet → NodeSet → SetOps
- final def removeGently(node: (GraphLike.this)#NodeT): Boolean
- Definition Classes
- NodeSet → NodeSet
- def removeGently_?(fake: (GraphLike.this)#NodeT): Either[ConstraintViolation, Boolean]
- def remove_?(fake: (GraphLike.this)#NodeT): Either[ConstraintViolation, Boolean]
- def result(): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps → Builder
- def reversed: Iterable[(GraphLike.this)#NodeT]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def scan[B >: (GraphLike.this)#NodeT](z: B)(op: (B, B) => B): Set[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): Set[B]
- Definition Classes
- IterableOps
- val self: (GraphLike.this)#NodeSet
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toChainingOps[(GraphLike.this)#NodeSet] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- 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: scala.collection.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[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[Set[(GraphLike.this)#NodeT]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Set[(GraphLike.this)#NodeT]]
- Definition Classes
- IterableOps
- def span(p: ((GraphLike.this)#NodeT) => Boolean): (Set[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (Set[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT])
- Definition Classes
- IterableOps → IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[(GraphLike.this)#NodeT, S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Definition Classes
- NodeSet → Set → Iterable
- def subsetOf(that: Set[(GraphLike.this)#NodeT]): Boolean
- Definition Classes
- SetOps
- def subsets(): Iterator[Set[(GraphLike.this)#NodeT]]
- Definition Classes
- SetOps
- def subsets(len: Int): Iterator[Set[(GraphLike.this)#NodeT]]
- Definition Classes
- SetOps
- final def subtract(node: (GraphLike.this)#NodeT, rippleDelete: Boolean, minusNode: ((GraphLike.this)#NodeT) => Unit, minusEdges: ((GraphLike.this)#NodeT) => Unit): Boolean
- Attributes
- protected[collection]
- Definition Classes
- NodeSet
- def subtractAll(xs: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): NodeSet.this.type
- Definition Classes
- Shrinkable
- def sum[B >: (GraphLike.this)#NodeT](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- val t: Set[(GraphLike.this)#NodeT]
- def tail: Set[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps
- def tails: Iterator[Set[(GraphLike.this)#NodeT]]
- Definition Classes
- IterableOps
- def take(n: Int): Set[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): Set[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps
- def takeWhile(p: ((GraphLike.this)#NodeT) => Boolean): Set[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def tap[U](f: ((GraphLike.this)#NodeSet) => U): (GraphLike.this)#NodeSet
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toChainingOps[(GraphLike.this)#NodeSet] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def tapEach[U](f: ((GraphLike.this)#NodeT) => U): Set[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[(GraphLike.this)#NodeT, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: (GraphLike.this)#NodeT](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: (GraphLike.this)#NodeT]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOnceOps
- final def toIterable: NodeSet.this.type
- Definition Classes
- Iterable → IterableOps
- def toList: List[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[(GraphLike.this)#NodeT, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toOuter: Set[N]
- Definition Classes
- NodeSet
- def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[(GraphLike.this)#NodeT, E]]
- def toSeq: Seq[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOnceOps
- def toSet[B >: (GraphLike.this)#NodeT]: Set[B]
- Definition Classes
- IterableOnceOps
- def toSortedString(separator: String)(implicit ord: (GraphLike.this)#NodeOrdering): String
- Definition Classes
- NodeSet
- def toString(): String
- Definition Classes
- Set → Function1 → Iterable → AnyRef → Any
- def toVector: Vector[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: ((GraphLike.this)#NodeT) => Iterable[B]): Set[Set[B]]
- Definition Classes
- IterableOps
- final def union(that: Set[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps
- Annotations
- @inline()
- def unzip[A1, A2](implicit asPair: ((GraphLike.this)#NodeT) => (A1, A2)): (Set[A1], Set[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: ((GraphLike.this)#NodeT) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
- Definition Classes
- IterableOps
- def update(elem: (GraphLike.this)#NodeT, included: Boolean): Unit
- Definition Classes
- SetOps
- val value: (GraphLike.this)#NodeSet
- def view: View[(GraphLike.this)#NodeT]
- 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: ((GraphLike.this)#NodeT) => Boolean): WithFilter[(GraphLike.this)#NodeT, [_]Set[_]]
- Definition Classes
- IterableOps
- def withSetFilter(p: ((GraphLike.this)#NodeT) => Boolean): Set[(GraphLike.this)#NodeT] with FilterableSet[(GraphLike.this)#NodeT]
- Definition Classes
- FilterableSet
- def zip[B](that: scala.collection.IterableOnce[B]): Set[((GraphLike.this)#NodeT, B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: (GraphLike.this)#NodeT, B](that: Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Set[((GraphLike.this)#NodeT, Int)]
- Definition Classes
- IterableOps → IterableOnceOps
- final def |(that: Set[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps
- Annotations
- @inline()
- def ~[N >: N1](n2: N): UnDiEdge[N]
- def ~>[N >: N1](n2: N): DiEdge[N]
Shadowed Implicit Value Members
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toany2stringadd[(GraphLike.this)#NodeSet] 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:(nodeSet: any2stringadd[(GraphLike.this)#NodeSet]).+(other)
- Definition Classes
- any2stringadd
- def andThen[A](g: (Boolean) => A): (Param[(GraphLike.this)#NodeT, EI]) => A
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet to(Param[(GraphLike.this)#NodeT, 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:(nodeSet: (Param[(GraphLike.this)#NodeT, EI]) => Boolean).andThen(g)
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def apply(v1: Param[(GraphLike.this)#NodeT, EI]): Boolean
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet to(Param[(GraphLike.this)#NodeT, 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:(nodeSet: (Param[(GraphLike.this)#NodeT, EI]) => Boolean).apply(v1)
- Definition Classes
- Function1
- def compose[A](g: (A) => Param[(GraphLike.this)#NodeT, EI]): (A) => Boolean
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet to(Param[(GraphLike.this)#NodeT, 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:(nodeSet: (Param[(GraphLike.this)#NodeT, EI]) => Boolean).compose(g)
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def stringPrefix: String
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toOuterNode[(GraphLike.this)#NodeSet] 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:(nodeSet: OuterNode[(GraphLike.this)#NodeSet]).stringPrefix
- Definition Classes
- NodeParam
- def toString(): String
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet to(Param[(GraphLike.this)#NodeT, 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:(nodeSet: (Param[(GraphLike.this)#NodeT, EI]) => Boolean).toString()
- Definition Classes
- Function1 → AnyRef → Any
- def toString(): String
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toOuterNode[(GraphLike.this)#NodeSet] 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:(nodeSet: OuterNode[(GraphLike.this)#NodeSet]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
Deprecated Value Members
- def +(elem1: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
- def +(elem: (GraphLike.this)#NodeT): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Consider requiring an immutable Set or fall back to Set.union
- def ++:[B >: (GraphLike.this)#NodeT](that: scala.collection.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: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): NodeSet.this.type
- Definition Classes
- Growable
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
++=
(addAll) instead of varargs+=
- def -(elem1: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs
- def --(that: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Consider requiring an immutable Set
- def /:[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): B
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT])./:(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, (GraphLike.this)#NodeT) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- def :\[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): B
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).:\(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- final def :\[B](z: B)(op: ((GraphLike.this)#NodeT, 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, (GraphLike.this)#NodeT) => 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[(GraphLike.this)#NodeT, B]): Option[B]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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("Use iterableFactory instead", "2.13.0") @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- def copyToBuffer(dest: Buffer[(GraphLike.this)#NodeT]): Unit
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).copyToBuffer(dest)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.copyToBuffer(...) instead
- final def copyToBuffer[B >: (GraphLike.this)#NodeT](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def count(f: ((GraphLike.this)#NodeT) => Boolean): Int
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).count(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.count(...) instead
- def exists(f: ((GraphLike.this)#NodeT) => Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).exists(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.exists(...) instead
- def filter(f: ((GraphLike.this)#NodeT) => Boolean): Iterator[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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
- Deprecated
(Since version ) see corresponding Javadoc for more information.
- def find(p: ((GraphLike.this)#NodeT) => Boolean): Option[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).find(p)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.find instead
- def flatMap[B](f: ((GraphLike.this)#NodeT) => scala.collection.IterableOnce[B]): scala.collection.IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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 (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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, (GraphLike.this)#NodeT) => B): B
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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: ((GraphLike.this)#NodeT, B) => B): B
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).foldRight(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- def forall(f: ((GraphLike.this)#NodeT) => Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).forall(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.forall(...) instead
- def foreach[U](f: ((GraphLike.this)#NodeT) => U): Unit
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).foreach(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foreach(...) instead
- 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 (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).isEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.isEmpty instead
- def map[B](f: ((GraphLike.this)#NodeT) => B): scala.collection.IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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[(GraphLike.this)#NodeT]): (GraphLike.this)#NodeT
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).max(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.max instead
- def maxBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).maxBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.maxBy(...) instead
- def min(implicit ord: Ordering[(GraphLike.this)#NodeT]): (GraphLike.this)#NodeT
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).min(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.min instead
- def minBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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 (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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 (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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 (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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 (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).nonEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.nonEmpty instead
- def product(implicit num: Numeric[(GraphLike.this)#NodeT]): (GraphLike.this)#NodeT
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).product(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.product instead
- def reduce(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): (GraphLike.this)#NodeT
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduce(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduce(...) instead
- def reduceLeft(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): (GraphLike.this)#NodeT
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceLeft(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeft(...) instead
- def reduceLeftOption(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): Option[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceLeftOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead
- def reduceOption(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): Option[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceOption(...) instead
- def reduceRight(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): (GraphLike.this)#NodeT
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceRight(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRight(...) instead
- def reduceRightOption(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): Option[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceRightOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRightOption(...) instead
- final def repr: Set[(GraphLike.this)#NodeT]
- 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: ((GraphLike.this)#NodeT) => Boolean): Unit
- Definition Classes
- SetOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use filterInPlace instead
- def sameElements[B >: A](that: scala.collection.IterableOnce[B]): Boolean
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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: NodeSet.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 (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).size
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.size instead
- def sum(implicit num: Numeric[(GraphLike.this)#NodeT]): (GraphLike.this)#NodeT
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).sum(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sum instead
- def to[C1](factory: Factory[(GraphLike.this)#NodeT, C1]): C1
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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 (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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 (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toBuffer
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead
- def toIndexedSeq: IndexedSeq[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toIndexedSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toIndexedSeq instead
- final def toIterable: Iterable[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toIterable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- def toIterator: Iterator[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toIterator
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead
- final def toIterator: Iterator[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- def toList: List[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toList
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(List) instead
- def toMap[K, V](implicit ev: <:<[(GraphLike.this)#NodeT, (K, V)]): Map[K, V]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toMap(ev)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(Map) instead
- def toNodeInSet: Set[N]
- Definition Classes
- NodeSet
- Annotations
- @deprecated
- Deprecated
(Since version 1.8.0) Use toOuter instead
- def toSeq: Seq[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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 (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toSet
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Set) instead
- def toStream: Stream[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toStream
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(LazyList) instead
- final def toStream: Stream[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toTraversable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- final def toTraversable: Traversable[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- def toVector: Vector[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).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[(GraphLike.this)#NodeT]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)
- def withFilter(f: ((GraphLike.this)#NodeT) => Boolean): Iterator[(GraphLike.this)#NodeT]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] 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:(nodeSet: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).withFilter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.withFilter(...) instead
- def →[B](y: B): ((GraphLike.this)#NodeSet, B)
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#NodeSet toArrowAssoc[(GraphLike.this)#NodeSet] 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.