org.apache.mahout.math.drm

RLikeDrmOps

class RLikeDrmOps[K] extends DrmLikeOps[K]

Linear Supertypes
DrmLikeOps[K], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. RLikeDrmOps
  2. DrmLikeOps
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RLikeDrmOps(drm: DrmLike[K])

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def %*%(that: Vector): DrmLike[K]

  5. def %*%(that: Matrix): DrmLike[K]

  6. def %*%[B](that: DrmLike[B]): DrmLike[K]

  7. def *(that: Double): DrmLike[K]

  8. def *(that: DrmLike[K]): DrmLike[K]

  9. def *:(that: Double): DrmLike[K]

  10. def +(that: Double): DrmLike[K]

  11. def +(that: DrmLike[K]): DrmLike[K]

  12. def +:(that: Double): DrmLike[K]

  13. def -(that: Double): DrmLike[K]

  14. def -(that: DrmLike[K]): DrmLike[K]

  15. def -:(that: Double): DrmLike[K]

  16. def /(that: Double): DrmLike[K]

  17. def /(that: DrmLike[K]): DrmLike[K]

  18. def /:(that: Double): DrmLike[K]

  19. def :%*%(that: Vector): DrmLike[K]

  20. def :%*%(that: Matrix): DrmLike[K]

  21. def :%*%[B](that: DrmLike[B]): DrmLike[K]

  22. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  23. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  24. def ^(that: Double): DrmLike[K]

  25. def apply(f: (Double) ⇒ Double, evalZeros: T = AutoBooleanEnum.AUTO): OpAewUnaryFunc[K]

    Apply a function element-wise.

    Apply a function element-wise.

    f

    element-wise function

    evalZeros

    Do we have to process zero elements? true, false, auto: if auto, we will test the supplied function for f(0) != 0, and depending on the result, will decide if we want evaluation for zero elements. WARNING: the AUTO setting may not always work correctly for functions that are meant to run in a specific backend context, or non-deterministic functions, such as {-1,0,1} random generators.

    returns

    new DRM with the element-wise function applied.

    Definition Classes
    DrmLikeOps
  26. def apply(rowRange: Range, colRange: Range): DrmLike[K]

    Slicing the DRM.

    Slicing the DRM. Should eventually work just like in-core drm (e.g. A(0 until 5, 5 until 15)).<P>

    The all-range is denoted by '::', e.g.: A(::, 0 until 5).<P>

    Row range is currently unsupported except for the all-range. When it will be fully supported, the input must be Int-keyed, i.e. of DrmLike[Int] type for non-all-range specifications.

    rowRange

    Row range. This must be '::' (all-range) unless matrix rows are keyed by Int key.

    colRange

    col range. Must be a sub-range of 0 until ncol. '::' denotes all-range.

    Definition Classes
    DrmLikeOps
  27. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  28. def cbind(that: Double): DrmLike[K]

  29. def cbind(that: DrmLike[K]): DrmLike[K]

  30. def clone(): AnyRef

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

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

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

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

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

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

    Definition Classes
    Any
  37. def mapBlock[R](ncol: Int = 1, identicallyPartitioned: Boolean = true)(bmf: ((Array[K], Matrix)) ⇒ (Array[R], Matrix))(implicit arg0: ClassTag[R]): DrmLike[R]

    Map matrix block-wise vertically.

    Map matrix block-wise vertically. Blocks of the new matrix can be modified original block matrices; or they could be completely new matrices with new keyset. In the latter case, output matrix width must be specified with ncol parameter.<P>

    New block heights must be of the same height as the original geometry.<P>

    R
    ncol

    new matrix' width (only needed if width changes).

    bmf
    returns

    Definition Classes
    DrmLikeOps
  38. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  39. final def notify(): Unit

    Definition Classes
    AnyRef
  40. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  41. def par(min: Int = 1, exact: Int = 1, auto: Boolean = false): OpPar[K]

    Parallelism adjustments.

    Parallelism adjustments. <P/>

    Change only one of parameters from default value to choose new parallelism adjustment strategy. <P/>

    E.g. use

      drmA.par(auto = true)
    
    to use automatic parallelism adjustment. <P/>

    Parallelism here in API is fairly abstract concept, and actual value interpretation is left for a particular backend strategy. However, it is usually equivalent to number of map tasks or data splits. <P/>

    min

    If changed from default, ensures the product has at least that much parallelism.

    exact

    if changed from default, ensures the pipeline product has exactly that much parallelism.

    auto

    If changed from default, engine-specific automatic parallelism adjustment strategy is applied.

    Definition Classes
    DrmLikeOps
  42. def rbind(that: DrmLike[K]): DrmLike[K]

  43. def rowSumsMap(): Map[String, Double]

    rowSums method for non-int keyed matrices.

    rowSums method for non-int keyed matrices.

    Slight problem here is the limitation of in-memory representation of Colt's Matrix, which can only have String row labels. Therefore, internally we do ".toString()" call on each key object, and then put it into Matrix row label bindings, at which point they are coerced to be Strings.

    This is obviously a suboptimal behavior, so as TODO we have here future enhancements of collect'.

    returns

    map of row keys into row sums, front-end collected.

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

    Definition Classes
    AnyRef
  45. def t: DrmLike[Int]

  46. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from DrmLikeOps[K]

Inherited from AnyRef

Inherited from Any

Ungrouped