Matrix2

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

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

   

   Definition Classes

   AnyRef → Any

4. def J[R, C, V](implicit ordR: Ordering[R], ordC: Ordering[C], ring: Ring[V], mj: MatrixJoiner2): Product[R, Unit, C, V]

   

5. def apply[R, C, V](t: TypedPipe[(R, C, V)], hint: SizeHint)(implicit arg0: Ordering[R], arg1: Ordering[C]): Matrix2[R, C, V]

   

6. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    

    Definition Classes

    AnyRef → Any

12. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

13. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

15. final def notify(): Unit

    

    Definition Classes

    AnyRef

16. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

17. def optimize[V](mf: Matrix2[Any, Any, V]): (BigInt, Matrix2[Any, Any, V])

    

    This function walks the input tree, finds basic blocks to optimize, i.e.

    This function walks the input tree, finds basic blocks to optimize, i.e. matrix product chains that are not interrupted by summations. One example: A*B*C*(D+E)*(F*G) => "basic blocks" are ABC, D, E, and FG

    + it now does "global" optimization - i.e. over optimize over basic blocks. In the above example, we'd treat (D+E) as a temporary matrix T and optimize the whole chain ABCTFG

    Not sure if making use of distributivity to generate more variants would be good. In the above example, we could also generate ABCDFG + ABCEFG and have basic blocks: ABCDFG, and ABCEFG. But this would be almost twice as much work with the current cost estimation.

18. def optimizeProductChain[V](p: IndexedSeq[Matrix2[Any, Any, V]], product: Option[(Ring[V], MatrixJoiner2)]): (BigInt, Matrix2[Any, Any, V])

    

    The original prototype that employs the standard O(n^3) dynamic programming procedure to optimize a matrix chain factorization.

    The original prototype that employs the standard O(n^3) dynamic programming procedure to optimize a matrix chain factorization.

    Now, it also "prefers" more spread out / bushy / less deep factorization which reflects more the Map/Reduce nature.

19. def read[R, C, V](t: TypedSource[(R, C, V)], hint: SizeHint)(implicit ordr: Ordering[R], ordc: Ordering[C]): Matrix2[R, C, V]

    

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

    

    Definition Classes

    AnyRef

21. def toString(): String

    

    Definition Classes

    AnyRef → Any

22. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )