Class

net.sansa_stack.inference.flink.utils.DataSetUtils

DataSetOps

Related Doc: package DataSetUtils

Permalink

implicit class DataSetOps[T] extends AnyRef

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DataSetOps
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DataSetOps(dataset: DataSet[T])(implicit arg0: ClassTag[T], arg1: TypeInformation[T])

    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. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  13. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  14. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  15. def partitionBy(f: (T) ⇒ Boolean): (DataSet[T], DataSet[T])

    Permalink

    Splits a DataSet into two parts based on the given filter function.

    Splits a DataSet into two parts based on the given filter function. Note, that filtering is done twice on the same data twice, thus, caching beforehand is recommended!

    f

    the boolean filter function

    returns

    two DataSets

  16. def subtract[K](other: DataSet[T], keySelectorThis: (T) ⇒ K, keySelectorOther: (T) ⇒ K)(implicit arg0: ClassTag[K], arg1: TypeInformation[K]): DataSet[T]

    Permalink

    Returns a DataSet with the elements from this that are not in other.

    Returns a DataSet with the elements from this that are not in other. A key selector function for both datasets has to be given.

    other

    the DataSet containing the element to be subtracted

    returns

    the DataSet

  17. def subtract(other: DataSet[T]): DataSet[T]

    Permalink

    Returns a DataSet with the elements from this that are not in other.

    Returns a DataSet with the elements from this that are not in other.

    other

    the DataSet containing the element to be subtracted

    returns

    the DataSet

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

    Permalink
    Definition Classes
    AnyRef
  19. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  20. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long): Unit

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

Inherited from AnyRef

Inherited from Any

Ungrouped