You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@mahout.apache.org by sr...@apache.org on 2010/09/26 23:49:06 UTC
svn commit: r1001529 -
/mahout/trunk/math/src/test/java/org/apache/mahout/math/decomposer/SolverTest.java
Author: srowen
Date: Sun Sep 26 21:49:06 2010
New Revision: 1001529
URL: http://svn.apache.org/viewvc?rev=1001529&view=rev
Log:
Revert part of that last change again as Hudson strikes back
Modified:
mahout/trunk/math/src/test/java/org/apache/mahout/math/decomposer/SolverTest.java
Modified: mahout/trunk/math/src/test/java/org/apache/mahout/math/decomposer/SolverTest.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/test/java/org/apache/mahout/math/decomposer/SolverTest.java?rev=1001529&r1=1001528&r2=1001529&view=diff
==============================================================================
--- mahout/trunk/math/src/test/java/org/apache/mahout/math/decomposer/SolverTest.java (original)
+++ mahout/trunk/math/src/test/java/org/apache/mahout/math/decomposer/SolverTest.java Sun Sep 26 21:49:06 2010
@@ -84,7 +84,7 @@ public abstract class SolverTest extends
double entryMean) {
SparseRowMatrix m = new SparseRowMatrix(new int[]{numRows, numCols});
//double n = 0;
- Random r = RandomUtils.getRandom();
+ Random r = new Random(1234L);
for (int i = 0; i < nonNullRows; i++) {
SequentialAccessSparseVector v = new SequentialAccessSparseVector(numCols);
for (int j = 0; j < entriesPerRow; j++) {