Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
package breeze.linalg
import breeze.generic.UFunc
import breeze.linalg.operators.OpSet
import breeze.math.Semiring
import breeze.storage.Zero
import scala.reflect.ClassTag
/**
* @author Rakesh Chalasani
*/
object tile extends UFunc {
// implementations
implicit def tile_DV_Impl2[T](implicit ct: ClassTag[T], z: Zero[T],
set: OpSet.InPlaceImpl2[DenseVector[T], DenseVector[T]]): Impl2[DenseVector[T], Int, DenseVector[T]] = {
new Impl2[DenseVector[T],Int,DenseVector[T]] {
def apply(x:DenseVector[T], n:Int):DenseVector[T] = {
// DenseVector is column-major, i.e., it can be considered a matrix of size (v.length x 1)
val out = DenseVector.zeros[T](x.length * n)
var i = 0
while(i < n) {
out(i*x.length until (i+1)*x.length) := x
i += 1
}
out
}
}
}
implicit def tile_DV_Impl3[T:ClassTag:Zero](implicit impl2: Impl2[DenseVector[T], Int, DenseVector[T]],
set: OpSet.InPlaceImpl2[DenseVector[T], DenseVector[T]]):
Impl3[DenseVector[T], Int, Int, DenseMatrix[T]] =
new Impl3[DenseVector[T],Int, Int, DenseMatrix[T]] {
def apply(x: DenseVector[T], m: Int, n: Int): DenseMatrix[T] = {
// DenseVector is column-major, i.e., it can be considered a matrix of size (v.length x 1)
// So, first construct the tiled column.
val col = impl2(x, m)
// Now, replicate the col.
val out = DenseMatrix.zeros[T](x.length * m, n)
var i = 0
while (i < n) {
out(::,i) := col
i += 1
}
out
}
}
implicit def tile_DM_Impl2[T:ClassTag:Zero](implicit set: OpSet.InPlaceImpl2[DenseVector[T], DenseVector[T]]): Impl2[DenseMatrix[T], Int, DenseMatrix[T]] =
new Impl2[DenseMatrix[T], Int, DenseMatrix[T]] {
def apply(x: DenseMatrix[T], m: Int):DenseMatrix[T] = {
// Replicate each column 'm' times.
val out = DenseMatrix.zeros[T](x.rows * m, x.cols)
var i = 0
while(i < x.cols) {
val column = x(::, i)
var j = 0
while(j < m) {
out(j*x.rows until (j+1)*x.rows, i) := column
j += 1
}
i += 1
}
out
}
}
implicit def tile_DM_Impl3[T:ClassTag:Zero](implicit impl2:Impl2[DenseMatrix[T],Int, DenseMatrix[T]],
set: OpSet.InPlaceImpl2[DenseMatrix[T], DenseMatrix[T]]):
Impl3[DenseMatrix[T], Int, Int, DenseMatrix[T]] =
new Impl3[DenseMatrix[T], Int, Int, DenseMatrix[T]] {
def apply(x: DenseMatrix[T], m: Int, n:Int):DenseMatrix[T] = {
// First, replicate each column 'm' times.
val columnTiledMatrix = impl2(x,m)
if (n == 1)
return columnTiledMatrix
// Nom, replicate the columnTiledMatrix 'n' times.
val out = DenseMatrix.zeros[T](x.rows * m, x.cols * n)
var i = 0
while(i < n) {
out(::,i*x.cols until (i+1)*x.cols) := columnTiledMatrix
i += 1
}
out
}
}
}
