Docs4dev
Docs
scala / 3.2 / scala / collection / immutable / treeset$.html

Object TreeSet.TreeSet

Companion class • Source code

object TreeSet extends SortedIterableFactory[TreeSet]

This object provides a set of operations to create Iterable values.

Supertypes
trait SortedIterableFactory[TreeSet]
trait EvidenceIterableFactory[TreeSet, Ordering]
trait Serializable
class Object
trait Matchable
class Any
Self type
TreeSet.type

Concrete methods

Source
def empty[A : Ordering]: TreeSet[A]

Source
def from[E](it: IterableOnce[E])(implicit ordering: Ordering[E]): TreeSet[E]

Source
def newBuilder[A](implicit ordering: Ordering[A]): ReusableBuilder[A, TreeSet[A]]

Inherited methods

Source
def apply[A : Ordering](xs: A*): CC[A]

Inherited from EvidenceIterableFactory

Source
def fill[A : Ordering](n: Int)(elem: => A): CC[A]

Produces a collection containing the results of some element computation a number of times.

Value parameters
elem

the element computation

n

the number of elements contained in the collection.
Returns

A collection that contains the results of n evaluations of elem.
Inherited from EvidenceIterableFactory

Source
def iterate[A : Ordering](start: A, len: Int)(f: A => A): CC[A]

Produces a collection containing repeated applications of a function to a start value.

Value parameters
f

the function that's repeatedly applied

len

the number of elements contained in the collection

start

the start value of the collection
Returns

a collection with len values in the sequence start, f(start), f(f(start)), ...
Inherited from EvidenceIterableFactory

Source
def tabulate[A : Ordering](n: Int)(f: Int => A): CC[A]

Produces a collection containing values of a given function over a range of integer values starting from 0.

Value parameters
f

The function computing element values

n

The number of elements in the collection
Returns

A collection consisting of elements f(0), ..., f(n -1)
Inherited from EvidenceIterableFactory

Source
def unfold[A : Ordering, S](init: S)(f: S => Option[(A, S)]): CC[A]

Produces a collection that uses a function f to produce elements of type A and update an internal state of type S.

Type parameters
A

Type of the elements

S

Type of the internal state
Value parameters
f

Computes the next element (or returns None to signal the end of the collection)

init

State initial value
Returns

a collection that produces elements using f until f returns None
Inherited from EvidenceIterableFactory

Inherited implicits

Source
implicit def evidenceIterableFactory[A : Ordering]: Factory[A, CC[A]]

Inherited from EvidenceIterableFactory

© 2002-2022 EPFL, with contributions from Lightbend.
Licensed under the Apache License, Version 2.0.
https://scala-lang.org/api/3.2.0/scala/collection/immutable/TreeSet$.html