You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@mahout.apache.org by ss...@apache.org on 2013/06/12 22:57:00 UTC
svn commit: r1492424 - in /mahout/trunk:
core/src/main/java/org/apache/mahout/classifier/df/data/
core/src/main/java/org/apache/mahout/clustering/spectral/eigencuts/
core/src/main/java/org/apache/mahout/common/distance/
core/src/main/java/org/apache/ma...
Author: ssc
Date: Wed Jun 12 20:57:00 2013
New Revision: 1492424
URL: http://svn.apache.org/r1492424
Log:
MAHOUT-1258 Another shot at findbugs and checkstyle
Modified:
mahout/trunk/core/src/main/java/org/apache/mahout/classifier/df/data/Data.java
mahout/trunk/core/src/main/java/org/apache/mahout/clustering/spectral/eigencuts/EigencutsDriver.java
mahout/trunk/core/src/main/java/org/apache/mahout/clustering/spectral/eigencuts/EigencutsSensitivityJob.java
mahout/trunk/core/src/main/java/org/apache/mahout/common/distance/DistanceMeasure.java
mahout/trunk/core/src/main/java/org/apache/mahout/ep/EvolutionaryProcess.java
mahout/trunk/core/src/main/java/org/apache/mahout/ep/State.java
mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/DistributedRowMatrix.java
mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/ABtDenseOutJob.java
mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/YtYJob.java
mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/qr/GivensThinSolver.java
mahout/trunk/core/src/test/java/org/apache/mahout/math/hadoop/MathHelper.java
mahout/trunk/integration/src/main/java/org/apache/mahout/cf/taste/impl/recommender/slopeone/jdbc/MySQLJDBCDiffStorage.java
mahout/trunk/math/src/main/java/org/apache/mahout/math/CardinalityException.java
mahout/trunk/math/src/main/java/org/apache/mahout/math/Centroid.java
mahout/trunk/math/src/main/java/org/apache/mahout/math/FileBasedSparseBinaryMatrix.java
mahout/trunk/math/src/main/java/org/apache/mahout/math/SequentialAccessSparseVector.java
mahout/trunk/math/src/main/java/org/apache/mahout/math/Vector.java
mahout/trunk/math/src/main/java/org/apache/mahout/math/VectorBinaryAggregate.java
mahout/trunk/math/src/main/java/org/apache/mahout/math/VectorBinaryAssign.java
mahout/trunk/math/src/main/java/org/apache/mahout/math/jet/random/engine/MersenneTwister.java
mahout/trunk/math/src/main/java/org/apache/mahout/math/list/package-info.java
mahout/trunk/math/src/main/java/org/apache/mahout/math/map/package-info.java
mahout/trunk/math/src/test/java/org/apache/mahout/math/AbstractVectorTest.java
Modified: mahout/trunk/core/src/main/java/org/apache/mahout/classifier/df/data/Data.java
URL: http://svn.apache.org/viewvc/mahout/trunk/core/src/main/java/org/apache/mahout/classifier/df/data/Data.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/core/src/main/java/org/apache/mahout/classifier/df/data/Data.java (original)
+++ mahout/trunk/core/src/main/java/org/apache/mahout/classifier/df/data/Data.java Wed Jun 12 20:57:00 2013
@@ -26,7 +26,7 @@ import java.util.List;
import java.util.Random;
/**
- * Holds a list of vectors and their corresponding Dataset. contains various OPERATIONS that deals with the
+ * Holds a list of vectors and their corresponding Dataset. contains various operations that deals with the
* vectors (subset, count,...)
*
*/
Modified: mahout/trunk/core/src/main/java/org/apache/mahout/clustering/spectral/eigencuts/EigencutsDriver.java
URL: http://svn.apache.org/viewvc/mahout/trunk/core/src/main/java/org/apache/mahout/clustering/spectral/eigencuts/EigencutsDriver.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/core/src/main/java/org/apache/mahout/clustering/spectral/eigencuts/EigencutsDriver.java (original)
+++ mahout/trunk/core/src/main/java/org/apache/mahout/clustering/spectral/eigencuts/EigencutsDriver.java Wed Jun 12 20:57:00 2013
@@ -212,7 +212,7 @@ public class EigencutsDriver extends Abs
/**
* Iteratively loops through the list, converting it to a Vector of double
- * primitives worthy of other Mahout OPERATIONS
+ * primitives worthy of other Mahout operations
*/
private static Vector listToVector(Collection<Double> list) {
Vector retval = new DenseVector(list.size());
Modified: mahout/trunk/core/src/main/java/org/apache/mahout/clustering/spectral/eigencuts/EigencutsSensitivityJob.java
URL: http://svn.apache.org/viewvc/mahout/trunk/core/src/main/java/org/apache/mahout/clustering/spectral/eigencuts/EigencutsSensitivityJob.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/core/src/main/java/org/apache/mahout/clustering/spectral/eigencuts/EigencutsSensitivityJob.java (original)
+++ mahout/trunk/core/src/main/java/org/apache/mahout/clustering/spectral/eigencuts/EigencutsSensitivityJob.java Wed Jun 12 20:57:00 2013
@@ -32,7 +32,7 @@ import org.apache.mahout.math.Vector;
import org.apache.mahout.math.VectorWritable;
/**
- * <p>There are a quite a few OPERATIONS bundled within this mapper. Gather 'round
+ * <p>There are a quite a few operations bundled within this mapper. Gather 'round
* and listen, all of ye.</p>
*
* <p>The input to this job is eight items:</p>
Modified: mahout/trunk/core/src/main/java/org/apache/mahout/common/distance/DistanceMeasure.java
URL: http://svn.apache.org/viewvc/mahout/trunk/core/src/main/java/org/apache/mahout/common/distance/DistanceMeasure.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/core/src/main/java/org/apache/mahout/common/distance/DistanceMeasure.java (original)
+++ mahout/trunk/core/src/main/java/org/apache/mahout/common/distance/DistanceMeasure.java Wed Jun 12 20:57:00 2013
@@ -35,7 +35,7 @@ public interface DistanceMeasure extends
double distance(Vector v1, Vector v2);
/**
- * Optimized version of distance metric for sparse vectors. This distance computation requires OPERATIONS
+ * Optimized version of distance metric for sparse vectors. This distance computation requires operations
* proportional to the number of non-zero elements in the vector instead of the cardinality of the vector.
*
* @param centroidLengthSquare
Modified: mahout/trunk/core/src/main/java/org/apache/mahout/ep/EvolutionaryProcess.java
URL: http://svn.apache.org/viewvc/mahout/trunk/core/src/main/java/org/apache/mahout/ep/EvolutionaryProcess.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/core/src/main/java/org/apache/mahout/ep/EvolutionaryProcess.java (original)
+++ mahout/trunk/core/src/main/java/org/apache/mahout/ep/EvolutionaryProcess.java Wed Jun 12 20:57:00 2013
@@ -66,7 +66,7 @@ import java.util.concurrent.Future;
* @param <T> The payload class.
*/
public class EvolutionaryProcess<T extends Payload<U>, U> implements Writable, Closeable {
- // used to execute OPERATIONS on the population in thread parallel.
+ // used to execute operations on the population in thread parallel.
private ExecutorService pool;
// threadCount is serialized so that we can reconstruct the thread pool
Modified: mahout/trunk/core/src/main/java/org/apache/mahout/ep/State.java
URL: http://svn.apache.org/viewvc/mahout/trunk/core/src/main/java/org/apache/mahout/ep/State.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/core/src/main/java/org/apache/mahout/ep/State.java (original)
+++ mahout/trunk/core/src/main/java/org/apache/mahout/ep/State.java Wed Jun 12 20:57:00 2013
@@ -34,7 +34,7 @@ import java.util.concurrent.atomic.Atomi
/**
* Records evolutionary state and provides a mutation operation for recorded-step meta-mutation.
*
- * You provide the payload, this class provides the mutation OPERATIONS. During mutation,
+ * You provide the payload, this class provides the mutation operations. During mutation,
* the payload is copied and after the state variables are changed, they are passed to the
* payload.
*
Modified: mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/DistributedRowMatrix.java
URL: http://svn.apache.org/viewvc/mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/DistributedRowMatrix.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/DistributedRowMatrix.java (original)
+++ mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/DistributedRowMatrix.java Wed Jun 12 20:57:00 2013
@@ -47,7 +47,7 @@ import com.google.common.collect.Iterato
/**
* DistributedRowMatrix is a FileSystem-backed VectorIterable in which the vectors live in a
- * SequenceFile<WritableComparable,VectorWritable>, and distributed OPERATIONS are executed as M/R passes on
+ * SequenceFile<WritableComparable,VectorWritable>, and distributed operations are executed as M/R passes on
* Hadoop. The usage is as follows: <p>
* <p>
* <pre>
Modified: mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/ABtDenseOutJob.java
URL: http://svn.apache.org/viewvc/mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/ABtDenseOutJob.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/ABtDenseOutJob.java (original)
+++ mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/ABtDenseOutJob.java Wed Jun 12 20:57:00 2013
@@ -253,7 +253,7 @@ public final class ABtDenseOutJob {
* conditions will never kick in. Or, the only situation where we
* can't fit Y_i block in memory is when A input is much sparser
* than k+p per row. But if this is the case, then we'd be looking
- * at very few elements without engaging them in any OPERATIONS so
+ * at very few elements without engaging them in any operations so
* even then it should be ok.
*/
if (j < aRowBegin) {
Modified: mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/YtYJob.java
URL: http://svn.apache.org/viewvc/mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/YtYJob.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/YtYJob.java (original)
+++ mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/YtYJob.java Wed Jun 12 20:57:00 2013
@@ -62,7 +62,7 @@ public final class YtYJob {
* we keep yRow in a dense form here but keep an eye not to dense up while
* doing YtY products. I am not sure that sparse vector would create much
* performance benefits since we must to assume that y would be more often
- * dense than sparse, so for bulk dense OPERATIONS that would perform
+ * dense than sparse, so for bulk dense operations that would perform
* somewhat better than a RandomAccessSparse vector frequent updates.
*/
private Vector yRow;
Modified: mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/qr/GivensThinSolver.java
URL: http://svn.apache.org/viewvc/mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/qr/GivensThinSolver.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/qr/GivensThinSolver.java (original)
+++ mahout/trunk/core/src/main/java/org/apache/mahout/math/hadoop/stochasticsvd/qr/GivensThinSolver.java Wed Jun 12 20:57:00 2013
@@ -30,8 +30,8 @@ import org.apache.mahout.math.Vector;
import org.apache.mahout.math.hadoop.stochasticsvd.UpperTriangular;
/**
- * Givens Thin solver. Standard Givens OPERATIONS are reordered in a way that
- * helps us to push them thru MapReduce OPERATIONS in a block fashion.
+ * Givens Thin solver. Standard Givens operations are reordered in a way that
+ * helps us to push them thru MapReduce operations in a block fashion.
*/
public class GivensThinSolver {
Modified: mahout/trunk/core/src/test/java/org/apache/mahout/math/hadoop/MathHelper.java
URL: http://svn.apache.org/viewvc/mahout/trunk/core/src/test/java/org/apache/mahout/math/hadoop/MathHelper.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/core/src/test/java/org/apache/mahout/math/hadoop/MathHelper.java (original)
+++ mahout/trunk/core/src/test/java/org/apache/mahout/math/hadoop/MathHelper.java Wed Jun 12 20:57:00 2013
@@ -44,7 +44,7 @@ import org.easymock.IArgumentMatcher;
import org.junit.Assert;
/**
- * a collection of small helper methods useful for unit-testing mathematical OPERATIONS
+ * a collection of small helper methods useful for unit-testing mathematical operations
*/
public final class MathHelper {
Modified: mahout/trunk/integration/src/main/java/org/apache/mahout/cf/taste/impl/recommender/slopeone/jdbc/MySQLJDBCDiffStorage.java
URL: http://svn.apache.org/viewvc/mahout/trunk/integration/src/main/java/org/apache/mahout/cf/taste/impl/recommender/slopeone/jdbc/MySQLJDBCDiffStorage.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/integration/src/main/java/org/apache/mahout/cf/taste/impl/recommender/slopeone/jdbc/MySQLJDBCDiffStorage.java (original)
+++ mahout/trunk/integration/src/main/java/org/apache/mahout/cf/taste/impl/recommender/slopeone/jdbc/MySQLJDBCDiffStorage.java Wed Jun 12 20:57:00 2013
@@ -25,7 +25,7 @@ import org.apache.mahout.cf.taste.impl.m
* MySQL-specific implementation. Should be used in conjunction with a
* {@link org.apache.mahout.cf.taste.impl.model.jdbc.MySQLJDBCDataModel}. This
* implementation stores item-item diffs in a MySQL database and encapsulates some other slope-one-specific
- * OPERATIONS that are needed on the preference data in the database. It assumes the database has a schema
+ * operations that are needed on the preference data in the database. It assumes the database has a schema
* like:
* </p>
*
Modified: mahout/trunk/math/src/main/java/org/apache/mahout/math/CardinalityException.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/main/java/org/apache/mahout/math/CardinalityException.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/math/src/main/java/org/apache/mahout/math/CardinalityException.java (original)
+++ mahout/trunk/math/src/main/java/org/apache/mahout/math/CardinalityException.java Wed Jun 12 20:57:00 2013
@@ -18,7 +18,7 @@
package org.apache.mahout.math;
/**
- * Exception thrown when there is a cardinality mismatch in matrix or vector OPERATIONS.
+ * Exception thrown when there is a cardinality mismatch in matrix or vector operations.
* For example, vectors of differing cardinality cannot be added.
*/
public class CardinalityException extends IllegalArgumentException {
Modified: mahout/trunk/math/src/main/java/org/apache/mahout/math/Centroid.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/main/java/org/apache/mahout/math/Centroid.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/math/src/main/java/org/apache/mahout/math/Centroid.java (original)
+++ mahout/trunk/math/src/main/java/org/apache/mahout/math/Centroid.java Wed Jun 12 20:57:00 2013
@@ -20,7 +20,7 @@ package org.apache.mahout.math;
import org.apache.mahout.math.function.Functions;
/**
- * A centroid is a weighted vector. We have it delegate to the vector itself for lots of OPERATIONS
+ * A centroid is a weighted vector. We have it delegate to the vector itself for lots of operations
* to make it easy to use vector search classes and such.
*/
public class Centroid extends WeightedVector {
Modified: mahout/trunk/math/src/main/java/org/apache/mahout/math/FileBasedSparseBinaryMatrix.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/main/java/org/apache/mahout/math/FileBasedSparseBinaryMatrix.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/math/src/main/java/org/apache/mahout/math/FileBasedSparseBinaryMatrix.java (original)
+++ mahout/trunk/math/src/main/java/org/apache/mahout/math/FileBasedSparseBinaryMatrix.java Wed Jun 12 20:57:00 2013
@@ -438,7 +438,7 @@ public final class FileBasedSparseBinary
}
/**
- * Copy the vector for fast OPERATIONS.
+ * Copy the vector for fast operations.
*
* @return a Vector
*/
Modified: mahout/trunk/math/src/main/java/org/apache/mahout/math/SequentialAccessSparseVector.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/main/java/org/apache/mahout/math/SequentialAccessSparseVector.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/math/src/main/java/org/apache/mahout/math/SequentialAccessSparseVector.java (original)
+++ mahout/trunk/math/src/main/java/org/apache/mahout/math/SequentialAccessSparseVector.java Wed Jun 12 20:57:00 2013
@@ -30,7 +30,7 @@ import org.apache.mahout.math.function.F
* one int[], one double[]. If there are <b>k</b> non-zero elements in the vector, this implementation has
* O(log(k)) random-access read performance, and O(k) random-access write performance, which is far below that
* of the hashmap based {@link org.apache.mahout.math.RandomAccessSparseVector RandomAccessSparseVector}. This
- * class is primarily used for OPERATIONS where the all the elements will be accessed in a read-only fashion
+ * class is primarily used for operations where the all the elements will be accessed in a read-only fashion
* sequentially: methods which operate not via get() or set(), but via iterateNonZero(), such as (but not limited
* to) :</p>
* <ul>
Modified: mahout/trunk/math/src/main/java/org/apache/mahout/math/Vector.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/main/java/org/apache/mahout/math/Vector.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/math/src/main/java/org/apache/mahout/math/Vector.java (original)
+++ mahout/trunk/math/src/main/java/org/apache/mahout/math/Vector.java Wed Jun 12 20:57:00 2013
@@ -396,12 +396,12 @@ public interface Vector extends Cloneabl
double getDistanceSquared(Vector v);
/**
- * Gets an estimate of the cost (in number of OPERATIONS) it takes to lookup a random element in this vector.
+ * Gets an estimate of the cost (in number of operations) it takes to lookup a random element in this vector.
*/
double getLookupCost();
/**
- * Gets an estimate of the cost (in number of OPERATIONS) it takes to advance an iterator through the nonzero
+ * Gets an estimate of the cost (in number of operations) it takes to advance an iterator through the nonzero
* elements of this vector.
*/
double getIteratorAdvanceCost();
Modified: mahout/trunk/math/src/main/java/org/apache/mahout/math/VectorBinaryAggregate.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/main/java/org/apache/mahout/math/VectorBinaryAggregate.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/math/src/main/java/org/apache/mahout/math/VectorBinaryAggregate.java (original)
+++ mahout/trunk/math/src/main/java/org/apache/mahout/math/VectorBinaryAggregate.java Wed Jun 12 20:57:00 2013
@@ -6,7 +6,7 @@ import org.apache.mahout.math.set.OpenIn
import java.util.Iterator;
/**
- * Abstract class encapsulating different algorithms that perform the Vector OPERATIONS aggregate().
+ * Abstract class encapsulating different algorithms that perform the Vector operations aggregate().
* x.aggregte(y, fa, fc), for x and y Vectors and fa, fc DoubleDouble functions:
* - applies the function fc to every element in x and y, fc(xi, yi)
* - constructs a result iteratively, r0 = fc(x0, y0), ri = fc(r_{i-1}, fc(xi, yi)).
Modified: mahout/trunk/math/src/main/java/org/apache/mahout/math/VectorBinaryAssign.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/main/java/org/apache/mahout/math/VectorBinaryAssign.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/math/src/main/java/org/apache/mahout/math/VectorBinaryAssign.java (original)
+++ mahout/trunk/math/src/main/java/org/apache/mahout/math/VectorBinaryAssign.java Wed Jun 12 20:57:00 2013
@@ -7,7 +7,7 @@ import org.apache.mahout.math.set.OpenIn
import java.util.Iterator;
/**
- * Abstract class encapsulating different algorithms that perform the Vector OPERATIONS assign().
+ * Abstract class encapsulating different algorithms that perform the Vector operations assign().
* x.assign(y, f), for x and y Vectors and f a DoubleDouble function:
* - applies the function f to every element in x and y, f(xi, yi)
* - assigns xi = f(xi, yi) for all indices i
Modified: mahout/trunk/math/src/main/java/org/apache/mahout/math/jet/random/engine/MersenneTwister.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/main/java/org/apache/mahout/math/jet/random/engine/MersenneTwister.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/math/src/main/java/org/apache/mahout/math/jet/random/engine/MersenneTwister.java (original)
+++ mahout/trunk/math/src/main/java/org/apache/mahout/math/jet/random/engine/MersenneTwister.java Wed Jun 12 20:57:00 2013
@@ -132,8 +132,8 @@ import java.util.Date;
MersenneTwister generates random numbers in batches of 624 numbers at a time, so
the caching and pipelining of modern systems is exploited.
The generator is implemented to generate the output by using the fastest arithmetic
- OPERATIONS only: 32-bit additions and bit OPERATIONS (no division, no multiplication, no mod).
- These OPERATIONS generate sequences of 32 random bits (<tt>int</tt>'s).
+ operations only: 32-bit additions and bit operations (no division, no multiplication, no mod).
+ These operations generate sequences of 32 random bits (<tt>int</tt>'s).
<tt>long</tt>'s are formed by concatenating two 32 bit <tt>int</tt>'s.
<tt>float</tt>'s are formed by dividing the interval <tt>[0.0,1.0]</tt> into 2<sup>32</sup>
sub intervals, then randomly choosing one subinterval.
Modified: mahout/trunk/math/src/main/java/org/apache/mahout/math/list/package-info.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/main/java/org/apache/mahout/math/list/package-info.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/math/src/main/java/org/apache/mahout/math/list/package-info.java (original)
+++ mahout/trunk/math/src/main/java/org/apache/mahout/math/list/package-info.java Wed Jun 12 20:57:00 2013
@@ -17,9 +17,9 @@
* <tt>double</tt>, etc.
* </li>
* <li>Compact representations</li>
- * <li>A number of general purpose list OPERATIONS including: adding, inserting,
+ * <li>A number of general purpose list operations including: adding, inserting,
* removing, iterating, searching, sorting, extracting ranges and copying. All
- * OPERATIONS are designed to perform well on mass data.
+ * operations are designed to perform well on mass data.
* </li>
* <li>Support for quick access to list elements. This is achieved by bounds-checking
* and non-bounds-checking accessor methods as well as zero-copy transformations
@@ -90,7 +90,7 @@
* </td>
* </table>
* <p> For efficiency, all classes provide back doors to enable getting/setting the
- * backing array directly. In this way, the high level OPERATIONS of these classes
+ * backing array directly. In this way, the high level operations of these classes
* can be used where appropriate, and one can switch to <tt>[]</tt>-array index
* notations where necessary. The key methods for this are <tt>public <ElementType>[]
* elements()</tt> and <tt>public void elements(<ElementType>[])</tt>. The
@@ -101,7 +101,7 @@
* algorithm (or other algorithm) can operate on the returned primitive array.
* The latter method forces a list to internally hold a user provided array. Using
* this approach one can avoid needing to copy the elements into the list.
- * <p>As a consequence, OPERATIONS on primitive arrays, Colt lists and JAL algorithms
+ * <p>As a consequence, operations on primitive arrays, Colt lists and JAL algorithms
* can freely be mixed at zero-copy overhead.
* <p> Note that such special treatment certainly breaks encapsulation. This functionality
* is provided for performance reasons only and should only be used when absolutely
Modified: mahout/trunk/math/src/main/java/org/apache/mahout/math/map/package-info.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/main/java/org/apache/mahout/math/map/package-info.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/math/src/main/java/org/apache/mahout/math/map/package-info.java (original)
+++ mahout/trunk/math/src/main/java/org/apache/mahout/math/map/package-info.java Wed Jun 12 20:57:00 2013
@@ -16,7 +16,7 @@
* </li>
* <li>Compact representations</li>
* <li>Support for quick access to associations</li>
- * <li>A number of general purpose map OPERATIONS</li>
+ * <li>A number of general purpose map operations</li>
* </ul>
* <p>File-based I/O can be achieved through the standard Java built-in serialization
* mechanism. All classes implement the {@link java.io.Serializable} interface.
@@ -187,7 +187,7 @@
* </ul>
* Resizing large hash maps can be time consuming, <tt>O(size())</tt>, and should be avoided if possible (maintaining
* primes is not the reason).
- * Unnecessary growing OPERATIONS can be avoided if the number of associations is known before they are added, or can be
+ * Unnecessary growing operations can be avoided if the number of associations is known before they are added, or can be
* estimated.<p>
* In such a case good parameters are as follows:
* <p>
@@ -229,7 +229,7 @@
* <b>Performance:</b>
* <p>
* Time complexity:
- * <br>The classes offer <i>expected</i> time complexity <tt>O(1)</tt> (i.e. constant time) for the basic OPERATIONS
+ * <br>The classes offer <i>expected</i> time complexity <tt>O(1)</tt> (i.e. constant time) for the basic operations
* <tt>put</tt>, <tt>get</tt>, <tt>removeKey</tt>, <tt>containsKey</tt> and <tt>size</tt>,
* assuming the hash function disperses the elements properly among the buckets.
* Otherwise, pathological cases, although highly improbable, can occur, degrading performance to <tt>O(N)</tt> in the
Modified: mahout/trunk/math/src/test/java/org/apache/mahout/math/AbstractVectorTest.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/test/java/org/apache/mahout/math/AbstractVectorTest.java?rev=1492424&r1=1492423&r2=1492424&view=diff
==============================================================================
--- mahout/trunk/math/src/test/java/org/apache/mahout/math/AbstractVectorTest.java (original)
+++ mahout/trunk/math/src/test/java/org/apache/mahout/math/AbstractVectorTest.java Wed Jun 12 20:57:00 2013
@@ -13,7 +13,7 @@ import org.junit.Test;
/**
* Makes sure that a vector under test acts the same as a DenseVector or RandomAccessSparseVector
- * (according to whether it is dense or sparse). Most OPERATIONS need to be done within a reasonable
+ * (according to whether it is dense or sparse). Most operations need to be done within a reasonable
* tolerance.
*
* The idea is that a new vector implementation can extend AbstractVectorTest to get pretty high