Mirrors/the-algorithm
2
0
Fork 0
mirror of https://github.com/twitter/the-algorithm.git synced 2024-06-02 17:28:45 +02:00
Code Issues Packages Projects Releases Wiki Activity

Merge 76ce702f9d into 72eda9a24f

Browse Source
This commit is contained in:
ImperiumTakp 2023-07-17 21:40:55 -05:00 committed by GitHub
commit a335c0ee87
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 10 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
src/scala/com/twitter/simclusters_v2/scalding/EigenVectorsForSparseSymmetric.scala
View File

@ -44,22 +44,17 @@ object EigenVectorsForSparseSymmetric {
* @return the constructed matrix * @return the constructed matrix
*/ */
def getMatrix(nonzeros: Iterable[(Int, Int, Double)], nRows: Int, nCols: Int): Matrix = { def getMatrix(nonzeros: Iterable[(Int, Int, Double)], nRows: Int, nCols: Int): Matrix = {
val matrix = new LinkedSparseMatrix(nRows, nCols) val baseCase = (new LinkedSparseMatrix(nRows, nCols), 0, 0, 0)
var numEntries = 0 val partialNonzeros = nonzeros.foldRight(baseCase)
var maxRow = 0 val (matrix, numEntries, maxRow, maxCol) = partialNonzeros{
var maxCol = 0 case ((i, j, v), (matrix, numEntries, maxRow, maxCol) ) => (i, j) match {
case (_, _) if (i > maxRow) && (j > maxCol) => (matrix.set(i, j, v), numEntries += 1, i, j)
nonzeros.foreach { case (_, _) if (i > maxRow) => (matrix.set(i, j, v), numEntries += 1, i, maxCol)
case (i, j, v) => case (_, _) if (j > maxCol) => (matrix.set(i, j, v), numEntries += 1, maxRow, j)
if (i > maxRow) { case (_, _) => (matrix.set(i, j, v), numEntries += 1, maxRow, maxCol)
maxRow = i }
}
if (j > maxCol) {
maxCol = j
}
numEntries += 1
matrix.set(i, j, v)
} }
log.info( log.info(
"Finished building matrix with %d entries and maxRow %d and maxCol %d" "Finished building matrix with %d entries and maxRow %d and maxCol %d"
.format(numEntries, maxRow, maxCol)) .format(numEntries, maxRow, maxCol))