TreeSet

scala.collection.immutable.TreeSet
See theTreeSet companion class

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

Attributes

Companion
class
Graph
Supertypes
trait Pure
trait Serializable
class Object
trait Matchable
class Any
Show all
Self type
TreeSet.type

Members list

Value members

Concrete methods

def empty[A : Ordering]: TreeSet[A]
def from[E](it: IterableOnce[E]^)(implicit ordering: Ordering[E]): TreeSet[E]

Inherited methods

def apply[A : Ordering](xs: A*): TreeSet[A]

Attributes

Inherited from:
EvidenceIterableFactory
def fill[A : Ordering](n: Int)(elem: => A): TreeSet[A]

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

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.

Attributes

Returns

A collection that contains the results of n evaluations of elem.

Inherited from:
EvidenceIterableFactory
def iterate[A : Ordering](start: A, len: Int)(f: A -> A): TreeSet[A]

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

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

Attributes

Returns

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

Inherited from:
EvidenceIterableFactory
def tabulate[A : Ordering](n: Int)(f: Int -> A): TreeSet[A]

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

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

Attributes

Returns

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

Inherited from:
EvidenceIterableFactory
def unfold[A : Ordering, S](init: S)(f: S -> Option[(A, S)]): TreeSet[A]

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

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

Attributes

Returns

a collection that produces elements using f until f returns None

Inherited from:
EvidenceIterableFactory

Implicits

Inherited implicits

Attributes

Inherited from:
EvidenceIterableFactory