Graph Core
2.0.2
API
Generated with
Graph Core/scalax.collection/scalax.collection.mutable/GraphLike/GraphLikeNodeSet

GraphLikeNodeSet

scalax.collection.mutable.GraphLike.GraphLikeNodeSet
trait GraphLikeNodeSet extends Set[NodeT], GraphNodeSet

Attributes

Graph
Supertypes
trait GraphNodeSet
trait NodeSet
trait Set[NodeT]
trait SetOps[NodeT, Set, Set[NodeT]]
trait Shrinkable[NodeT]
trait Builder[NodeT, Set[NodeT]]
trait Growable[NodeT]
trait Clearable
trait Cloneable[Set[NodeT]]
trait Cloneable
trait Set[NodeT]
trait Equals
trait SetOps[NodeT, Set, Set[NodeT]]
trait NodeT => Boolean
trait Iterable[NodeT]
trait Iterable[NodeT]
class Object
trait Matchable
class Any
Show all
Known subtypes

Members list

Value members

Abstract methods

protected def minusEdges(node: NodeT): Unit

removes all incident edges of node from the edge set leaving the node set unchanged.

removes all incident edges of node from the edge set leaving the node set unchanged.

Value parameters

node

the node the incident edges of which are to be removed from the edge set.

Attributes

Concrete methods

override def clear(): Unit

Attributes

Definition Classes
override def diff(that: Set[NodeT]): Set[NodeT]

Attributes

Definition Classes
override def remove(node: NodeT): Boolean

Attributes

Definition Classes

Inherited methods

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
SetOps
final def ++=(xs: IterableOnce[NodeT]): Growable.this.type

Attributes

Inherited from:
Growable
final def +=(elem: NodeT): Growable.this.type

Attributes

Inherited from:
Growable
final override def -(node: NodeT): NodeSetT

Attributes

Definition Classes
Inherited from:
GraphNodeSet
final def --=(xs: IterableOnce[NodeT]): Shrinkable.this.type

Attributes

Inherited from:
Shrinkable
final def -=(elem: NodeT): Shrinkable.this.type

Attributes

Inherited from:
Shrinkable
def add(elem: NodeT): Boolean

Attributes

Inherited from:
SetOps
def addAll(xs: IterableOnce[NodeT]): Growable.this.type

Attributes

Inherited from:
Growable
def addOne(elem: NodeT): Growable.this.type

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOnceOps
def adjacencyListsToString: String

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
Set
final override protected def className: String

Attributes

Definition Classes
NodeSetToString -> Iterable
Inherited from:
NodeSetToString (hidden)
override def clone(): C

Create a copy of the receiver object.

Create a copy of the receiver object.

The default implementation of the clone method is platform dependent.

Attributes

Returns

a copy of the receiver object.

Note

not specified by SLS as a member of AnyRef

Definition Classes
SetOps -> Cloneable -> Object
Inherited from:
SetOps
def collect[B](pf: PartialFunction[NodeT, B]): CC[B]

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
SetOps
protected def copy: NodeSetT

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOnceOps
def draw(random: Random): NodeT

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

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

Value parameters

random

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

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

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

Any implementation of this method should be an equivalence relation:

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

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

Value parameters

that

the object to compare against this object for equality.

Attributes

Returns

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

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

Attributes

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

Attributes

Inherited from:
IterableOps
def filterInPlace(p: NodeT => Boolean): SetOps.this.type

Attributes

Inherited from:
SetOps
def filterNot(pred: NodeT => Boolean): C

Attributes

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

Attributes

Inherited from:
IterableOnceOps
def find(outerNode: N): Option[NodeT]

Finds the inner node corresponding to outerNode.

Finds the inner node corresponding to outerNode.

Attributes

Returns

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

Inherited from:
NodeSet
def findElem[B](toMatch: B, correspond: (NodeT, B) => Boolean): A

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

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

Value parameters

correspond

function returning whether a given entry corresponds to other

toMatch

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

Attributes

Returns

the entry corresponding to toMatch or null if not contained

Inherited from:
ExtSetMethods
def findElem(elem: NodeT): Option[A]

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Same as foldLeft except the second parameter of opNode.

Same as foldLeft except the second parameter of opNode.

Value parameters

opNode

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

Attributes

Inherited from:
NodeSet
def foldRight[B](z: B)(op: (NodeT, B) => B): B

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableFactoryDefaults
def get(outerNode: N): NodeT

Finds the inner node corresponding to outerNode.

Finds the inner node corresponding to outerNode.

Attributes

Returns

the inner node if found, otherwise NoSuchElementException is thrown.

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOps
protected def handleNotGentlyRemovable: Boolean

Attributes

Inherited from:
GraphNodeSet
override def hashCode(): Int

Calculate a hash code value for the object.

Calculate a hash code value for the object.

The default hashing algorithm is platform dependent.

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

Attributes

Returns

the hash code value for this object.

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

Attributes

Inherited from:
IterableOps
def headOption: Option[A]

Attributes

Inherited from:
IterableOps
def init: C

Attributes

Inherited from:
IterableOps
def inits: Iterator[C]

Attributes

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

Attributes

Inherited from:
SetOps
def isEmpty: Boolean

Attributes

Inherited from:
IterableOnceOps
override def isTraversableAgain: Boolean

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOnce
override def knownSize: Int

Attributes

Definition Classes
Inherited from:
SetOps
def last: A

Attributes

Inherited from:
IterableOps
def lastOption: Option[A]

Attributes

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

Attributes

Inherited from:
Iterable
def lookup(outerNode: N): NodeT

Finds the inner node corresponding to outerNode.

Finds the inner node corresponding to outerNode.

Attributes

Returns

the inner node if found, otherwise null.

Inherited from:
NodeSet
def map[B](f: NodeT => B): CC[B]

Attributes

Inherited from:
IterableOps
def mapResult[NewTo](f: Set[NodeT] => NewTo): Builder[A, NewTo]

Attributes

Inherited from:
Builder
def max[B >: NodeT](implicit ord: Ordering[B]): A

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOnceOps
protected def minus(node: NodeT): Unit

removes node from this node set leaving the edge set unchanged.

removes node from this node set leaving the edge set unchanged.

Value parameters

node

the node to be removed from the node set.

Attributes

Inherited from:
GraphNodeSet
final def mkString: String

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableFactoryDefaults
def nonEmpty: Boolean

Attributes

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

Iterable over this NodeSet mapped to outer nodes.

Iterable over this NodeSet mapped to outer nodes.

Attributes

Inherited from:
NodeSet
final def outerIterator: Iterator[N]

Iterator over this NodeSet mapped to outer nodes.

Iterator over this NodeSet mapped to outer nodes.

Attributes

Inherited from:
NodeSet
def partition(p: NodeT => Boolean): (C, C)

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

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

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

Attributes

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

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

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

Attributes

Inherited from:
SetToString (hidden)
def result(): C

Attributes

Inherited from:
SetOps
protected def reversed: Iterable[A]

Attributes

Inherited from:
IterableOnceOps
def scala$collection$mutable$Cloneable$$super$clone(): Object

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOps
def size: Int

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOps
final def sizeHint(coll: IterableOnce[_], delta: Int): Unit

Attributes

Inherited from:
Builder
def sizeHint(size: Int): Unit

Attributes

Inherited from:
Builder
final def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit

Attributes

Inherited from:
Builder
final def sizeIs: SizeCompareOps

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
SetOps
def subtractAll(xs: IterableOnce[NodeT]): Shrinkable.this.type

Attributes

Inherited from:
Shrinkable
def subtractOne(elem: NodeT): Shrinkable.this.type

Attributes

Inherited from:
Shrinkable
def sum[B >: NodeT](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def tail: C

Attributes

Inherited from:
IterableOps
def tails: Iterator[C]

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOnceOps
def toIndexedSeq: IndexedSeq[A]

Attributes

Inherited from:
IterableOnceOps
def toList: List[A]

Attributes

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

Attributes

Inherited from:
IterableOnceOps
def toOuter: Set[N]

Converts this node set to a set of outer nodes.

Converts this node set to a set of outer nodes.

Attributes

Inherited from:
NodeSet
def toSeq: Seq[A]

Attributes

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

Attributes

Inherited from:
IterableOnceOps
override def toString(): String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Attributes

Returns

a string representation of the object.

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOps
def update(elem: NodeT, included: Boolean): Unit

Attributes

Inherited from:
SetOps
def view: View[A]

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
SetOps

Deprecated and Inherited methods

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

Attributes

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

Attributes

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

Attributes

Deprecated
[Since version 2.13.0] Use ++ instead of ++: for collections of type Iterable
Inherited from:
IterableOps
final def +=(elem1: NodeT, elem2: NodeT, elems: NodeT*): Growable.this.type

Attributes

Deprecated
[Since version 2.13.0] Use `++=` aka `addAll` instead of varargs `+=`; infix operations with an operand of multiple args will be deprecated
Inherited from:
Growable
def -(elem1: NodeT, elem2: NodeT, elems: NodeT*): C

Attributes

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

Attributes

Deprecated
[Since version 2.13.0] Consider requiring an immutable Set
Inherited from:
SetOps
def -=(elem1: NodeT, elem2: NodeT, elems: NodeT*): Shrinkable.this.type

Attributes

Deprecated
[Since version 2.13.3] Use `--=` aka `subtractAll` instead of varargs `-=`; infix operations with an operand of multiple args will be deprecated
Inherited from:
Shrinkable
final def /:[B](z: B)(op: (B, NodeT) => B): B

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from:
IterableOps
final def retain(p: NodeT => Boolean): Unit

Attributes

Deprecated
[Since version 2.13.0] Use filterInPlace instead
Inherited from:
SetOps
def seq: Iterable.this.type

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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