scala.swing.FormattedTextField.FocusLostBehavior

ValueSet

class ValueSet extends Set[Value] with SetLike[Value, ValueSet]

A class for sets of values Iterating through this set will yield values in increasing order of their ids.

definition classes: Enumeration

Inherits

  1. Set
  2. Set
  3. SetLike
  4. Subtractable
  5. Addable
  6. GenericSetTemplate
  7. Function1
  8. Iterable
  9. Iterable
  10. IterableLike
  11. Equals
  12. Traversable
  13. Immutable
  14. Traversable
  15. GenericTraversableTemplate
  16. TraversableLike
  17. HasNewBuilder
  18. AnyRef
  19. Any

Type Members

  1. class WithFilter extends AnyRef

    A class supporting filtered operations

Value Members

  1. def &(that: Set[Value]): ValueSet

    Computes the intersection between this set and another set

    Computes the intersection between this set and another set.

    that

    the set to intersect with.

    returns

    a new set consisting of all elements that are both in this set and in the given set that.

    definition classes: SetLike
  2. def &~(that: Set[Value]): ValueSet

    The difference of this set and another set

    The difference of this set and another set.

    that

    the set of elements to exclude.

    returns

    a set containing those elements of this set that are not also contained in the given set that.

    definition classes: SetLike
  3. def **(that: Set[Value]): ValueSet

    This method is an alias for intersect

    This method is an alias for intersect. It computes an intersection with set that. It removes all the elements that are not present in that.

    that

    the set to intersect with

    definition classes: SetLike
  4. def +(value: Value): ValueSet

    Creates a new set with an additional element, unless the element is already present

    Creates a new set with an additional element, unless the element is already present.

  5. def +(elem1: Value, elem2: Value, elems: Value*): ValueSet

    Creates a new set with additional elements

    Creates a new set with additional elements.

    This method takes two or more elements to be added. Another overloaded variant of this method handles the case where a single element is added.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    a new set with the given elements added.

    definition classes: Addable
  6. def ++(iter: Iterator[Value]): ValueSet

    Creates a new set by adding all elements produced by an iterator to this set

    Creates a new set by adding all elements produced by an iterator to this set.

    iter

    the iterator producing the added elements.

    returns

    a new set with the given elements added.

    definition classes: Addable
  7. def ++(elems: Traversable[Value]): ValueSet

    Creates a new set by adding all elements contained in another collection to this set

    Creates a new set by adding all elements contained in another collection to this set.

    elems

    the collection containing the added elements.

    returns

    a new set with the given elements added.

    definition classes: Addable
  8. def ++[B >: Value, That](that: Iterator[B])(bf: CanBuildFrom[ValueSet, B, That]): That

    Concatenates this set with the elements of an iterator

    Concatenates this set with the elements of an iterator.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the iterator to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That which contains all elements of this set followed by all elements of that.

    definition classes: TraversableLike
  9. def ++[B >: Value, That](that: Traversable[B])(bf: CanBuildFrom[ValueSet, B, That]): That

    Concatenates this set with the elements of a traversable collection

    Concatenates this set with the elements of a traversable collection.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That which contains all elements of this set followed by all elements of that.

    definition classes: TraversableLike
  10. def -(value: Value): ValueSet

    Creates a new set with a given element removed from this set

    Creates a new set with a given element removed from this set.

  11. def -(elem1: Value, elem2: Value, elems: Value*): ValueSet

    Creates a new set from this set with some elements removed

    Creates a new set from this set with some elements removed.

    This method takes two or more elements to be removed. Another overloaded variant of this method handles the case where a single element is removed.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    a new set that contains all elements of the current set except one less occurrence of each of the given elements.

    definition classes: Subtractable
  12. def --(iter: Iterator[Value]): ValueSet

    Creates a new set from this set by removing all elements produced by an iterator

    Creates a new set from this set by removing all elements produced by an iterator.

    iter

    the iterator producing the removed elements.

    returns

    a new set that contains all elements of the current set except one less occurrence of each of the elements produced by iter.

    definition classes: Subtractable
  13. def --(elems: Traversable[Value]): ValueSet

    Creates a new set from this set by removing all elements of another collection

    Creates a new set from this set by removing all elements of another collection.

    elems

    the collection containing the removed elements.

    returns

    a new set that contains all elements of the current set except one less occurrence of each of the elements of elems.

    definition classes: Subtractable
  14. def /:[B](z: B)(op: (B, Value) ⇒ B): B

    Applies a binary operator to a start value and all elements of this set, going left to right

    Applies a binary operator to a start value and all elements of this set, going left to right.

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this set$, going left to right with the start value z on the left: {{{ op(...op(op(z, x1), x2), ..., xn) }}} where x,,1,,, ..., x,,n,, are the elements of this set.

    definition classes: TraversableLike
  15. def :\[B](z: B)(op: (Value, B) ⇒ B): B

    Applies a binary operator to all elements of this set and a start value, going right to left

    Applies a binary operator to all elements of this set and a start value, going right to left.

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this set$, going right to left with the start value z on the right: {{{ op(x1, op(x2, ... op(xn, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this set.

    definition classes: TraversableLike
  16. def addString(b: StringBuilder): StringBuilder

    Appends all elements of this set to a string builder

    Appends all elements of this set to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this set without any separator string.

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableLike
  17. def addString(b: StringBuilder, sep: String): StringBuilder

    Appends all elements of this set to a string builder using a separator string

    Appends all elements of this set to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this set, separated by the string sep.

    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableLike
  18. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Appends all elements of this set to a string builder using start, end, and separator strings

    Appends all elements of this set to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this set are separated by the string sep.

    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableLike
  19. def andThen[A](g: (Boolean) ⇒ A): (Value) ⇒ A

    (f andThen g)(x) == g(f(x))

    (f andThen g)(x) == g(f(x))

    definition classes: Function1
  20. def apply(elem: Value): Boolean

    Tests if some element is contained in this set

    Tests if some element is contained in this set.

    This method is equivalent to contains. It allows sets to be interpreted as predicates.

    elem

    the element to test for membership.

    returns

    true if elem is contained in this set, false otherwise.

    definition classes: SetLike
  21. def canEqual(that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this set should be compared

    returns

    true, if this set can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    definition classes: IterableLikeEquals
  22. def companion: GenericCompanion[Set[A][A]]

    The factory companion object that builds instances of class Set

    The factory companion object that builds instances of class Set.

    definition classes: SetSetIterableIterableTraversableTraversableGenericTraversableTemplate
  23. def compose[A](g: (A) ⇒ Value): (A) ⇒ Boolean

    (f compose g)(x) == f(g(x))

    (f compose g)(x) == f(g(x))

    definition classes: Function1
  24. def contains(v: Value): Boolean

    Tests if some element is contained in this set

    Tests if some element is contained in this set.

  25. def copyToArray[B >: Value](xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this set to an array

    Copies elements of this set to an array. Fills the given array xs with at most len elements of this set, starting at position start. Copying will stop once either the end of the current set is reached, or the end of the array is reached, or len elements have been copied.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    definition classes: IterableLikeTraversableLike
  26. def copyToArray[B >: Value](xs: Array[B]): Unit

    Copies elements of this set to an array

    Copies elements of this set to an array. Fills the given array xs with all elements of this set, starting at position 0. Copying will stop once either the end of the current set is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableLike
  27. def copyToArray[B >: Value](xs: Array[B], start: Int): Unit

    Copies elements of this set to an array

    Copies elements of this set to an array. Fills the given array xs with all elements of this set, starting at position start. Copying will stop once either the end of the current set is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    definition classes: TraversableLike
  28. def copyToBuffer[B >: Value](dest: Buffer[B]): Unit

    Copies all elements of this set to a buffer

    Copies all elements of this set to a buffer.

    dest

    The buffer to which elements are copied.

    definition classes: TraversableLike
  29. def count(p: (Value) ⇒ Boolean): Int

    Counts the number of elements in the set which satisfy a predicate

    Counts the number of elements in the set which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: TraversableLike
  30. def diff(that: Set[Value]): ValueSet

    Computes the difference of this set and another set

    Computes the difference of this set and another set.

    that

    the set of elements to exclude.

    returns

    a set containing those elements of this set that are not also contained in the given set that.

    definition classes: SetLike
  31. def drop(n: Int): ValueSet

    Selects all elements except first n ones

    Selects all elements except first n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to drop from this set.

    returns

    a set consisting of all elements of this set except the first n ones, or else the empty set, if this set has less than n elements.

    definition classes: TraversableLike
  32. def dropRight(n: Int): ValueSet

    Selects all elements except first n ones

    Selects all elements except first n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    The number of elements to take

    returns

    a set consisting of all elements of this set except the first n ones, or else the empty set, if this set has less than n elements.

    definition classes: IterableLike
  33. def dropWhile(p: (Value) ⇒ Boolean): ValueSet

    Drops longest prefix of elements that satisfy a predicate

    Drops longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    The predicate used to test elements.

    returns

    the longest suffix of this set whose first element does not satisfy the predicate p.

    definition classes: TraversableLike
  34. def elements: Iterator[Value]

  35. def empty: ValueSet

  36. def equals(that: Any): Boolean

    Compares this set with another object for equality

    Compares this set with another object for equality.

    that

    the other object

    returns

    true if that is a set which contains the same elements as this set.

    definition classes: SetLikeEquals ⇐ AnyRef ⇐ Any
  37. def exists(p: (Value) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this set

    Tests whether a predicate holds for some of the elements of this set.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this set, otherwise false.

    definition classes: IterableLikeTraversableLike
  38. def filter(p: (Value) ⇒ Boolean): ValueSet

    Selects all elements of this set which satisfy a predicate

    Selects all elements of this set which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new set consisting of all elements of this set that satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  39. def filterNot(p: (Value) ⇒ Boolean): ValueSet

    Selects all elements of this set which do not satisfy a predicate

    Selects all elements of this set which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new set consisting of all elements of this set that do not satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  40. def find(p: (Value) ⇒ Boolean): Option[Value]

    Finds the first element of the set satisfying a predicate, if any

    Finds the first element of the set satisfying a predicate, if any.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the set that satisfies p, or None if none exists.

    definition classes: IterableLikeTraversableLike
  41. def first: Value

  42. def firstOption: Option[Value]

    None if iterable is empty

    None if iterable is empty.

    definition classes: IterableLike
  43. def flatMap[B, That](f: (Value) ⇒ Traversable[B])(bf: CanBuildFrom[ValueSet, B, That]): That

    Builds a new collection by applying a function to all elements of this set and concatenating the results

    Builds a new collection by applying a function to all elements of this set and concatenating the results.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the given collection-valued function f to each element of this set and concatenating the results.

    definition classes: TraversableLike
  44. def flatten[B](asTraversable: (Value) ⇒ Traversable[B]): Set[B]

    Converts this set of traversable collections into a set in which all element collections are concatenated

    Converts this set of traversable collections into a set in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this set is a Traversable.

    returns

    a new set resulting from concatenating all element sets.

    definition classes: GenericTraversableTemplate
  45. def foldLeft[B](z: B)(op: (B, Value) ⇒ B): B

    Applies a binary operator to a start value and all elements of this set, going left to right

    Applies a binary operator to a start value and all elements of this set, going left to right.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this set$, going left to right with the start value z on the left: {{{ op(...op(z, x1), x2, ..., xn) }}} where x,,1,,, ..., x,,n,, are the elements of this set.

    definition classes: TraversableLike
  46. def foldRight[B](z: B)(op: (Value, B) ⇒ B): B

    Applies a binary operator to all elements of this set and a start value, going right to left

    Applies a binary operator to all elements of this set and a start value, going right to left.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this set$, going right to left with the start value z on the right: {{{ op(x1, op(x2, ... op(xn, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this set.

    definition classes: IterableLikeTraversableLike
  47. def forall(p: (Value) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this set

    Tests whether a predicate holds for all elements of this set.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this set, otherwise false.

    definition classes: IterableLikeTraversableLike
  48. def foreach[U](f: (Value) ⇒ U): Unit

    Applies a function f to all elements of this set

    Applies a function f to all elements of this set.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    U

    the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.

    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

    definition classes: IterableLikeTraversableLike
  49. def genericBuilder[B]: Builder[B, Set[B]]

    The generic builder that builds instances of Set at arbitrary element types

    The generic builder that builds instances of Set at arbitrary element types.

    definition classes: GenericTraversableTemplate
  50. def groupBy[K](f: (Value) ⇒ K): Map[K, ValueSet]

    Partitions this set into a map of sets according to some discriminator function

    Partitions this set into a map of sets according to some discriminator function.

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new set.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to sets such that the following invariant holds: {{{ (xs partition f)(k) = xs filter (x => f(x) == k) }}} That is, every key k is bound to a set of those elements x for which f(x) equals k.

    definition classes: TraversableLike
  51. def hasDefiniteSize: Boolean

    Tests whether this set is known to have a finite size

    Tests whether this set is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    definition classes: TraversableLike
  52. def hashCode(): Int

    Returns a hash code value for the object

    Returns 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.

    definition classes: SetLike ⇐ AnyRef ⇐ Any
  53. def head: Value

    Selects the first element of this set

    Selects the first element of this set.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: IterableLikeTraversableLike
  54. def headOption: Option[Value]

    Optionally selects the first element

    Optionally selects the first element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: TraversableLike
  55. val ids: BitSet

  56. def init: ValueSet

    Selects all elements except the last

    Selects all elements except the last.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: TraversableLike
  57. def intersect(that: Set[Value]): ValueSet

    Computes the intersection between this set and another set

    Computes the intersection between this set and another set.

    that

    the set to intersect with.

    returns

    a new set consisting of all elements that are both in this set and in the given set that.

    definition classes: SetLike
  58. def isEmpty: Boolean

    Tests if this set is empty

    Tests if this set is empty.

    definition classes: SetLikeIterableLikeTraversableLike
  59. def iterator: Iterator[Value]

    Creates a new iterator over all elements contained in this iterable object

    Creates a new iterator over all elements contained in this iterable object.

  60. def last: Value

    Selects the last element

    Selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: TraversableLike
  61. def lastOption: Option[Value]

    Optionally selects the last element

    Optionally selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: TraversableLike
  62. def map[B, That](f: (Value) ⇒ B)(bf: CanBuildFrom[ValueSet, B, That]): That

    Builds a new collection by applying a function to all elements of this set

    Builds a new collection by applying a function to all elements of this set.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the given function f to each element of this set and collecting the results.

    definition classes: TraversableLike
  63. def max[B >: Value](cmp: Ordering[B]): Value

    Finds the largest element

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this set with respect to the ordering cmp.

    definition classes: TraversableLike
  64. def min[B >: Value](cmp: Ordering[B]): Value

    Finds the smallest element

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this set with respect to the ordering cmp.

    definition classes: TraversableLike
  65. def mkString: String

    Displays all elements of this set in a string

    Displays all elements of this set in a string.

    definition classes: TraversableLike
  66. def mkString(sep: String): String

    Displays all elements of this set in a string using a separator string

    Displays all elements of this set in a string using a separator string.

    sep

    the separator string.

    returns

    a string representation of this set. In the resulting string the string representations (w.r.t. the method toString) of all elements of this set are separated by the string sep.

    definition classes: TraversableLike
  67. def mkString(start: String, sep: String, end: String): String

    Displays all elements of this set in a string using start, end, and separator strings

    Displays all elements of this set in a string using start, end, and separator strings.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this set. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this set are separated by the string sep.

    definition classes: TraversableLike
  68. def nonEmpty: Boolean

    Tests whether the set is not empty

    Tests whether the set is not empty.

    definition classes: TraversableLike
  69. def partialMap[B, That](pf: PartialFunction[Value, B])(bf: CanBuildFrom[ValueSet, B, That]): That

    Builds a new collection by applying a partial function to all elements of this set on which the function is defined

    Builds a new collection by applying a partial function to all elements of this set on which the function is defined.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    pf

    the partial function which filters and maps the set.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    definition classes: TraversableLike
  70. def partition(p: (Value) ⇒ Boolean): (ValueSet, ValueSet)

    Partitions this set in two sets according to a predicate

    Partitions this set in two sets according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of sets: the first set consists of all elements that satisfy the predicate p and the second set consists of all elements that don't. The relative order of the elements in the resulting sets is the same as in the original set.

    definition classes: TraversableLike
  71. def product[B >: Value](num: Numeric[B]): B

    Multiplies up the elements of this collection

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

    an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.

    returns

    the product of all elements of this set with respect to the * operator in num.

    definition classes: TraversableLike
  72. def projection: IterableView[Value, ValueSet]

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.

    definition classes: IterableLike
  73. def reduceLeft[B >: Value](op: (B, Value) ⇒ B): B

    Applies a binary operator to all elements of this set, going left to right

    Applies a binary operator to all elements of this set, going left to right.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this set$, going left to right: {{{ op(...(op(x1, x2), ... ) , xn) }}} where x,,1,,, ..., x,,n,, are the elements of this set.

    definition classes: TraversableLike
  74. def reduceLeftOption[B >: Value](op: (B, Value) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this set, going left to right

    Optionally applies a binary operator to all elements of this set, going left to right.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this set is nonempty, None otherwise.

    definition classes: TraversableLike
  75. def reduceRight[B >: Value](op: (Value, B) ⇒ B): B

    Applies a binary operator to all elements of this set, going right to left

    Applies a binary operator to all elements of this set, going right to left.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this set$, going right to left: {{{ op(x1, op(x2, ..., op(xn-1, xn)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this set.

    definition classes: IterableLikeTraversableLike
  76. def reduceRightOption[B >: Value](op: (Value, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this set, going right to left

    Optionally applies a binary operator to all elements of this set, going right to left.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this set is nonempty, None otherwise.

    definition classes: TraversableLike
  77. def repr: ValueSet

    The collection of type set underlying this TraversableLike object

    The collection of type set underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    definition classes: TraversableLike
  78. def sameElements[B >: Value](that: Iterable[B]): Boolean

    Checks if the other iterable collection contains the same elements in the same order as this set

    Checks if the other iterable collection contains the same elements in the same order as this set.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    definition classes: IterableLike
  79. def size: Int

    The size of this set

    The size of this set.

    definition classes: TraversableLike
  80. def slice(from: Int, until: Int): ValueSet

    Selects an interval of elements

    Selects an interval of elements.

    Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    from

    the index of the first returned element in this set.

    until

    the index one past the last returned element in this set.

    returns

    a set containing the elements starting at index from and extending up to (but not including) index until of this set.

    definition classes: IterableLikeTraversableLike
  81. def span(p: (Value) ⇒ Boolean): (ValueSet, ValueSet)

    Spits this set into a prefix/suffix pair according to a predicate

    Spits this set into a prefix/suffix pair according to a predicate.

    Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    the test predicate

    returns

    a pair consisting of the longest prefix of this set whose elements all satisfy p, and the rest of this set.

    definition classes: TraversableLike
  82. def splitAt(n: Int): (ValueSet, ValueSet)

    Splits this set into two at a given position

    Splits this set into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the position at which to split.

    returns

    a pair of sets consisting of the first n elements of this set, and the other elements.

    definition classes: TraversableLike
  83. def stringPrefix: String

    Defines the prefix of this object's toString representation

    Defines the prefix of this object's toString representation.

  84. def subsetOf(that: Set[Value]): Boolean

    Tests whether this set is a subset of another set

    Tests whether this set is a subset of another set.

    that

    the set to test.

    returns

    true if this set is a subset of that, i.e. if every element of this set is also an element of that.

    definition classes: SetLike
  85. def sum[B >: Value](num: Numeric[B]): B

    Sums up the elements of this collection

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

    an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.

    returns

    the sum of all elements of this set with respect to the + operator in num.

    definition classes: TraversableLike
  86. def tail: ValueSet

    Selects all elements except the first

    Selects all elements except the first.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: TraversableLike
  87. def take(n: Int): ValueSet

    Selects first n elements

    Selects first n elements.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    Tt number of elements to take from this set.

    returns

    a set consisting only of the first n elements of this set, or else the whole set, if it has less than n elements.

    definition classes: IterableLikeTraversableLike
  88. def takeRight(n: Int): ValueSet

    Selects last n elements

    Selects last n elements.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to take

    returns

    a set consisting only of the last n elements of this set, or else the whole set, if it has less than n elements.

    definition classes: IterableLike
  89. def takeWhile(p: (Value) ⇒ Boolean): ValueSet

    Takes longest prefix of elements that satisfy a predicate

    Takes longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    The predicate used to test elements.

    returns

    the longest prefix of this set whose elements all satisfy the predicate p.

    definition classes: IterableLikeTraversableLike
  90. def toArray[B >: Value](arg0: ClassManifest[B]): Array[B]

    Converts this set to an array

    Converts this set to an array.

    B

    the type of the elements of the array. A ClassManifest for this type must be available.

    returns

    an array containing all elements of this set.

    definition classes: TraversableLike
  91. def toIndexedSeq[B >: Value]: IndexedSeq[B]

    Converts this set to an indexed sequence

    Converts this set to an indexed sequence.

    definition classes: TraversableLike
  92. def toIterable: Iterable[Value]

    Converts this set to an iterable collection

    Converts this set to an iterable collection.

    Note: Will not terminate for infinite-sized collections.

    definition classes: IterableLikeTraversableLike
  93. def toList: List[Value]

    Converts this set to a list

    Converts this set to a list.

    definition classes: TraversableLike
  94. def toSeq: Seq[Value]

    Converts this set to a sequence

    Converts this set to a sequence.

    definition classes: TraversableLike
  95. def toSet[B >: Value]: Set[B]

    Converts this set to a set

    Converts this set to a set.

    definition classes: TraversableLike
  96. def toStream: Stream[Value]

    Converts this set to a stream

    Converts this set to a stream.

    definition classes: IterableLikeTraversableLike
  97. def toString(): String

    Converts this set to a string

    Converts this set to a string

    definition classes: SetLikeTraversableLike ⇐ AnyRef ⇐ Any
  98. def transpose[B](asTraversable: (Value) ⇒ Traversable[B]): Set[Set[B]]

    Transposes this set of traversable collections into

    Transposes this set of traversable collections into

    definition classes: GenericTraversableTemplate
  99. def union(that: Set[Value]): ValueSet

    Computes the union between of set and another set

    Computes the union between of set and another set.

    that

    the set to form the union with.

    returns

    a new set consisting of all elements that are in this set or in the given set that.

    definition classes: SetLike
  100. def unzip[A1, A2](asPair: (Value) ⇒ (A1, A2)): (Set[A1], Set[A2])

    Converts this set of pairs into two collections of the first and second halfs of each pair

    Converts this set of pairs into two collections of the first and second halfs of each pair.

    asPair

    an implicit conversion which asserts that the element type of this set is a pair.

    returns

    a pair sets, containing the first, respectively second half of each element pair of this set.

    definition classes: GenericTraversableTemplate
  101. def view(from: Int, until: Int): IterableView[Value, ValueSet]

    Creates a non-strict view of a slice of this set

    Creates a non-strict view of a slice of this set.

    Note: the difference between view and slice is that view produces a view of the current set, whereas slice produces a new set.

    Note: view(from, to) is equivalent to view.slice(from, to)

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this set, starting at index from and extending up to (but not including) index until.

    definition classes: IterableLikeTraversableLike
  102. def view: IterableView[Value, ValueSet]

    Creates a non-strict view of this set

    Creates a non-strict view of this set.

    definition classes: IterableLikeTraversableLike
  103. def withFilter(p: (Value) ⇒ Boolean): WithFilter

    Creates a non-strict filter of this set

    Creates a non-strict filter of this set.

    Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    the predicate used to test elements.

    returns

    an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this set which satify the predicate p.

    definition classes: TraversableLike
  104. def zip[A1 >: Value, B, That](that: Iterable[B])(bf: CanBuildFrom[ValueSet, (A1, B), That]): That

    Returns a set formed from this set and another iterable collection by combining corresponding elements in pairs

    Returns a set formed from this set and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this set and that. The length of the returned collection is the minimum of the lengths of this set$ and that.

    definition classes: IterableLike
  105. def zipAll[B, A1 >: Value, That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[ValueSet, (A1, B), That]): That

    Returns a set formed from this set and another iterable collection by combining corresponding elements in pairs

    Returns a set formed from this set and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this set is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this set.

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this set and that. The length of the returned collection is the maximum of the lengths of this set$ and that. If this set is shorter than that, thisElem values are used to pad the result. If that is shorter than this set, thatElem values are used to pad the result.

    definition classes: IterableLike
  106. def zipWithIndex[A1 >: Value, That](bf: CanBuildFrom[ValueSet, (A1, Int), That]): That

    Zips this set with its indices

    Zips this set with its indices.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

    A new collection of type That containing pairs consisting of all elements of this set paired with their index. Indices start at 0.

    definition classes: IterableLike
  107. def |(that: Set[Value]): ValueSet

    Computes the union between this set and another set

    Computes the union between this set and another set.

    that

    the set to form the union with.

    returns

    a new set consisting of all elements that are in this set or in the given set that.

    definition classes: SetLike

Instance constructors

  1. new ValueSet()