Class

org.apache.spark.sql.collection

BoundedSortedSet

Related Doc: package collection

Permalink

class BoundedSortedSet[K, V <: Comparable[V]] extends TreeSet[(K, V)]

Linear Supertypes
TreeSet[(K, V)], Serializable, Cloneable, NavigableSet[(K, V)], SortedSet[(K, V)], AbstractSet[(K, V)], Set[(K, V)], AbstractCollection[(K, V)], Collection[(K, V)], Iterable[(K, V)], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BoundedSortedSet
  2. TreeSet
  3. Serializable
  4. Cloneable
  5. NavigableSet
  6. SortedSet
  7. AbstractSet
  8. Set
  9. AbstractCollection
  10. Collection
  11. Iterable
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BoundedSortedSet(bound: Int, isRelaxedBound: Boolean)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. def add(data: (K, V)): Boolean

    Permalink
    Definition Classes
    BoundedSortedSet → TreeSet → Set → AbstractCollection → Collection

  5. def addAll(arg0: Collection[_ <: (K, V)]): Boolean

    Permalink
    Definition Classes
    TreeSet → Set → AbstractCollection → Collection

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  7. def ceiling(arg0: (K, V)): (K, V)

    Permalink
    Definition Classes
    TreeSet → NavigableSet

  8. def clear(): Unit

    Permalink
    Definition Classes
    TreeSet → Set → AbstractCollection → Collection

  9. def clone(): AnyRef

    Permalink
    Definition Classes
    TreeSet → AnyRef

  10. def comparator(): Comparator[_ >: (K, V)]

    Permalink
    Definition Classes
    TreeSet → SortedSet

  11. def contains(key: Any): Boolean

    Permalink
    Definition Classes
    BoundedSortedSet → TreeSet → Set → AbstractCollection → Collection

  12. def containsAll(arg0: Collection[_]): Boolean

    Permalink
    Definition Classes
    AbstractCollection → Collection

  13. def descendingIterator(): Iterator[(K, V)]

    Permalink
    Definition Classes
    TreeSet → NavigableSet

  14. def descendingSet(): NavigableSet[(K, V)]

    Permalink
    Definition Classes
    TreeSet → NavigableSet

  15. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  16. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AbstractSet → Set → Collection → AnyRef → Any

  17. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  18. def first(): (K, V)

    Permalink
    Definition Classes
    TreeSet → SortedSet

  19. def floor(arg0: (K, V)): (K, V)

    Permalink
    Definition Classes
    TreeSet → NavigableSet

  20. def forEach(arg0: Consumer[_ >: (K, V)]): Unit

    Permalink
    Definition Classes
    Iterable

  21. def get(key: K): V

    Permalink

  22. def getBound(): Int

    Permalink

  23. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  24. def hashCode(): Int

    Permalink
    Definition Classes
    AbstractSet → Set → Collection → AnyRef → Any

  25. def headSet(arg0: (K, V)): SortedSet[(K, V)]

    Permalink
    Definition Classes
    TreeSet → NavigableSet → SortedSet

  26. def headSet(arg0: (K, V), arg1: Boolean): NavigableSet[(K, V)]

    Permalink
    Definition Classes
    TreeSet → NavigableSet

  27. def higher(arg0: (K, V)): (K, V)

    Permalink
    Definition Classes
    TreeSet → NavigableSet

  28. def isEmpty(): Boolean

    Permalink
    Definition Classes
    TreeSet → Set → AbstractCollection → Collection

  29. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  30. def iterator(): Iterator[(K, V)]

    Permalink
    Definition Classes
    TreeSet → NavigableSet → Set → AbstractCollection → Collection → Iterable

  31. def last(): (K, V)

    Permalink
    Definition Classes
    TreeSet → SortedSet

  32. def lower(arg0: (K, V)): (K, V)

    Permalink
    Definition Classes
    TreeSet → NavigableSet

  33. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  34. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  35. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  36. def parallelStream(): Stream[(K, V)]

    Permalink
    Definition Classes
    Collection

  37. def pollFirst(): (K, V)

    Permalink
    Definition Classes
    TreeSet → NavigableSet

  38. def pollLast(): (K, V)

    Permalink
    Definition Classes
    TreeSet → NavigableSet

  39. def remove(arg0: Any): Boolean

    Permalink
    Definition Classes
    TreeSet → Set → AbstractCollection → Collection

  40. def removeAll(arg0: Collection[_]): Boolean

    Permalink
    Definition Classes
    AbstractSet → Set → AbstractCollection → Collection

  41. def removeIf(arg0: Predicate[_ >: (K, V)]): Boolean

    Permalink
    Definition Classes
    Collection

  42. def retainAll(arg0: Collection[_]): Boolean

    Permalink
    Definition Classes
    AbstractCollection → Collection

  43. def serialize(dos: DataOutputStream): Unit

    Permalink

  44. def size(): Int

    Permalink
    Definition Classes
    TreeSet → Set → AbstractCollection → Collection

  45. def spliterator(): Spliterator[(K, V)]

    Permalink
    Definition Classes
    TreeSet → SortedSet → Set → Collection → Iterable

  46. def stream(): Stream[(K, V)]

    Permalink
    Definition Classes
    Collection

  47. def subSet(arg0: (K, V), arg1: (K, V)): SortedSet[(K, V)]

    Permalink
    Definition Classes
    TreeSet → NavigableSet → SortedSet

  48. def subSet(arg0: (K, V), arg1: Boolean, arg2: (K, V), arg3: Boolean): NavigableSet[(K, V)]

    Permalink
    Definition Classes
    TreeSet → NavigableSet

  49. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  50. def tailSet(arg0: (K, V)): SortedSet[(K, V)]

    Permalink
    Definition Classes
    TreeSet → NavigableSet → SortedSet

  51. def tailSet(arg0: (K, V), arg1: Boolean): NavigableSet[(K, V)]

    Permalink
    Definition Classes
    TreeSet → NavigableSet

  52. def toArray[T](arg0: Array[T]): Array[T]

    Permalink
    Definition Classes
    AbstractCollection → Collection

  53. def toArray(): Array[AnyRef]

    Permalink
    Definition Classes
    AbstractCollection → Collection

  54. def toString(): String

    Permalink
    Definition Classes
    AbstractCollection → AnyRef → Any

  55. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  56. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  57. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from TreeSet[(K, V)]

Inherited from Serializable

Inherited from Cloneable

Inherited from NavigableSet[(K, V)]

Inherited from SortedSet[(K, V)]

Inherited from AbstractSet[(K, V)]

Inherited from Set[(K, V)]

Inherited from AbstractCollection[(K, V)]

Inherited from Collection[(K, V)]

Inherited from Iterable[(K, V)]

Inherited from AnyRef

Inherited from Any

Ungrouped