IntArray
.
*
- * @param element
- * int which should be added
+ * @param element int which should be added
*/
public final void add(int element) {
int index = (length++) & 0x3FF;
@@ -55,8 +54,7 @@ public final void add(int element) {
/**
* Add int[] to IntArray
.
*
- * @param elements
- * int[] which should be added
+ * @param elements int[] which should be added
*/
public final void addAll(int[] elements) {
int free = (length & 0x3FF);
@@ -78,8 +76,7 @@ public final void addAll(int[] elements) {
/**
* Get int at index from IntArray
.
*
- * @param index
- * index of int which should be returned
+ * @param index index of int which should be returned
* @return int at index
* @throws IndexOutOfBoundsException
*/
diff --git a/src/main/java/org/eclipse/mat/collect/ArrayIntCompressed.java b/src/main/java/org/eclipse/mat/collect/ArrayIntCompressed.java
index 328634e..675d41a 100644
--- a/src/main/java/org/eclipse/mat/collect/ArrayIntCompressed.java
+++ b/src/main/java/org/eclipse/mat/collect/ArrayIntCompressed.java
@@ -32,8 +32,7 @@ public class ArrayIntCompressed {
* Create IntArrayCompressed
from bytes formerly got from
* {@link #toByteArray()}.
*
- * @param bytes
- * bytes formerly got from {@link #toByteArray()}
+ * @param bytes bytes formerly got from {@link #toByteArray()}
*/
public ArrayIntCompressed(byte[] bytes) {
// Take data structure
@@ -47,12 +46,9 @@ public ArrayIntCompressed(byte[] bytes) {
* the number of leading and trailing clear bits. Everything else is stored
* in the internal data structure.
*
- * @param size
- * number of ints to be stored
- * @param leadingClearBits
- * number of leading clear bits
- * @param trailingClearBits
- * number of trailing clear bits
+ * @param size number of ints to be stored
+ * @param leadingClearBits number of leading clear bits
+ * @param trailingClearBits number of trailing clear bits
*/
public ArrayIntCompressed(int size, int leadingClearBits, int trailingClearBits) {
// Initialize data structure
@@ -63,8 +59,7 @@ public ArrayIntCompressed(int size, int leadingClearBits, int trailingClearBits)
* Create IntArrayCompressed
from ints representing the data to
* be stored in compressed form.
*
- * @param ints
- * ints representing the data to be stored in compressed form
+ * @param ints ints representing the data to be stored in compressed form
*/
public ArrayIntCompressed(int[] ints) {
// Call more general constructor
@@ -75,12 +70,9 @@ public ArrayIntCompressed(int[] ints) {
* Create IntArrayCompressed
from ints representing the data to
* be stored in compressed form (from offset to offset+length).
*
- * @param ints
- * ints representing the data to be stored in compressed form
- * @param offset
- * offset from which on to compress the ints
- * @param length
- * number of ints to compress from the given array
+ * @param ints ints representing the data to be stored in compressed form
+ * @param offset offset from which on to compress the ints
+ * @param length number of ints to compress from the given array
*/
public ArrayIntCompressed(int[] ints, int offset, int length) {
// Determine leading and trailing clear bits
@@ -119,10 +111,8 @@ private void init(int size, int varyingBits, int trailingClearBits) {
/**
* Set value at the given index.
*
- * @param index
- * index at which the value should be set
- * @param value
- * value to be set at the given index
+ * @param index index at which the value should be set
+ * @param value value to be set at the given index
*/
public void set(int index, int value) {
value >>>= trailingClearBits;
@@ -144,8 +134,7 @@ public void set(int index, int value) {
/**
* Get value from the given index.
*
- * @param index
- * index at which the value should be set
+ * @param index index at which the value should be set
* @return value found at the given index
*/
public int get(int index) {
@@ -174,7 +163,7 @@ public int get(int index) {
* IntArrayCompressed
can be reconstructed.
*
* @return bytes representing the internal data structure with which an
- * IntArrayCompressed
can be reconstructed
+ * IntArrayCompressed
can be reconstructed
*/
public byte[] toByteArray() {
// Return data structure
diff --git a/src/main/java/org/eclipse/mat/collect/ArrayLongCompressed.java b/src/main/java/org/eclipse/mat/collect/ArrayLongCompressed.java
index 5e5a404..e9099b8 100644
--- a/src/main/java/org/eclipse/mat/collect/ArrayLongCompressed.java
+++ b/src/main/java/org/eclipse/mat/collect/ArrayLongCompressed.java
@@ -32,8 +32,7 @@ public class ArrayLongCompressed {
* Create LongArrayCompressed
from bytes formerly got from
* {@link #toByteArray()}.
*
- * @param bytes
- * bytes formerly got from {@link #toByteArray()}
+ * @param bytes bytes formerly got from {@link #toByteArray()}
*/
public ArrayLongCompressed(byte[] bytes) {
// Take data structure
@@ -47,12 +46,9 @@ public ArrayLongCompressed(byte[] bytes) {
* stored, the number of leading and trailing clear bits. Everything else is
* stored in the internal data structure.
*
- * @param size
- * number of longs to be stored
- * @param leadingClearBits
- * number of leading clear bits
- * @param trailingClearBits
- * number of trailing clear bits
+ * @param size number of longs to be stored
+ * @param leadingClearBits number of leading clear bits
+ * @param trailingClearBits number of trailing clear bits
*/
public ArrayLongCompressed(int size, int leadingClearBits, int trailingClearBits) {
// Initialize data structure
@@ -63,8 +59,7 @@ public ArrayLongCompressed(int size, int leadingClearBits, int trailingClearBits
* Create LongArrayCompressed
from longs representing the data
* to be stored in compressed form.
*
- * @param longs
- * longs representing the data to be stored in compressed form
+ * @param longs longs representing the data to be stored in compressed form
*/
public ArrayLongCompressed(long[] longs) {
// Call more general constructor
@@ -75,12 +70,9 @@ public ArrayLongCompressed(long[] longs) {
* Create LongArrayCompressed
from longs representing the data
* to be stored in compressed form (from offset to offset+length).
*
- * @param longs
- * longs representing the data to be stored in compressed form
- * @param offset
- * offset from which on to compress the longs
- * @param length
- * number of longs to compress from the given array
+ * @param longs longs representing the data to be stored in compressed form
+ * @param offset offset from which on to compress the longs
+ * @param length number of longs to compress from the given array
*/
public ArrayLongCompressed(long[] longs, int offset, int length) {
// Determine leading and trailing clear bits
@@ -119,10 +111,8 @@ private void init(int size, int varyingBits, int trailingClearBits) {
/**
* Set value at the given index.
*
- * @param index
- * index at which the value should be set
- * @param value
- * value to be set at the given index
+ * @param index index at which the value should be set
+ * @param value value to be set at the given index
*/
public void set(int index, long value) {
value >>>= trailingClearBits;
@@ -144,8 +134,7 @@ public void set(int index, long value) {
/**
* Get value from the given index.
*
- * @param index
- * index at which the value should be set
+ * @param index index at which the value should be set
* @return value found at the given index
*/
public long get(int index) {
@@ -174,7 +163,7 @@ public long get(int index) {
* LongArrayCompressed
can be reconstructed.
*
* @return bytes representing the internal data structure with which an
- * LongArrayCompressed
can be reconstructed
+ * LongArrayCompressed
can be reconstructed
*/
public byte[] toByteArray() {
// Return data structure
diff --git a/src/main/java/org/eclipse/mat/collect/HashMapIntLong.java b/src/main/java/org/eclipse/mat/collect/HashMapIntLong.java
index 874a5ff..150af8f 100644
--- a/src/main/java/org/eclipse/mat/collect/HashMapIntLong.java
+++ b/src/main/java/org/eclipse/mat/collect/HashMapIntLong.java
@@ -25,7 +25,7 @@ public interface Entry {
private static NoSuchElementException noSuchElementException = new NoSuchElementException(
"This is static exception, there is no stack trace available. It is thrown by get() method.");
- //$NON-NLS-1$
+ //$NON-NLS-1$
private static final long serialVersionUID = 1L;
diff --git a/src/main/java/org/eclipse/mat/hprof/Pass1Parser.java b/src/main/java/org/eclipse/mat/hprof/Pass1Parser.java
index 11dc820..267a56e 100644
--- a/src/main/java/org/eclipse/mat/hprof/Pass1Parser.java
+++ b/src/main/java/org/eclipse/mat/hprof/Pass1Parser.java
@@ -40,7 +40,7 @@
public class Pass1Parser extends AbstractParser {
private static final Pattern PATTERN_OBJ_ARRAY = Pattern.compile("^(\\[+)L(.*);$"); //$NON-NLS-1$
private static final Pattern PATTERN_PRIMITIVE_ARRAY = Pattern.compile("^(\\[+)(.)$");
- //$NON-NLS-1$
+ //$NON-NLS-1$
private HashMapLongObject
* Performance: Fast - in memory.
*
- * @param name
- * name for the class
- * @param includeSubClasses
- * flag indicating whether or not to include also classes derived
- * from matching classes (the name isn't taken into account for
- * sub classes anymore)
+ * @param name name for the class
+ * @param includeSubClasses flag indicating whether or not to include also classes derived
+ * from matching classes (the name isn't taken into account for
+ * sub classes anymore)
* @return collection of matching classes
* @throws SnapshotException
*/
@@ -115,12 +113,10 @@ public Collection
* Performance: Fast - in memory, but needs iteration over all classes.
*
- * @param namePattern
- * name pattern for the class (regular expression)
- * @param includeSubClasses
- * flag indicating whether or not to include also classes derived
- * from matching classes (the name isn't taken into account for
- * sub classes anymore)
+ * @param namePattern name pattern for the class (regular expression)
+ * @param includeSubClasses flag indicating whether or not to include also classes derived
+ * from matching classes (the name isn't taken into account for
+ * sub classes anymore)
* @return collection of matching classes
* @throws SnapshotException
*/
@@ -169,8 +165,7 @@ public Collection
* Performance: Relatively fast - single index operation.
*
- * @param objectId
- * object which is referenced
+ * @param objectId object which is referenced
* @return objects referencing the given object
* @throws SnapshotException
*/
@@ -181,8 +176,7 @@ public Collection
* Performance: Relatively fast - single index operation.
*
- * @param objectId
- * object which is referencing
+ * @param objectId object which is referencing
* @return objects referenced by the given object
* @throws SnapshotException
*/
@@ -198,11 +192,9 @@ public Collection
* Performance: Relatively fast - single index operation.
*
- * @param objectId
- * id of object you want a convenient object abstraction for
+ * @param objectId id of object you want a convenient object abstraction for
* @return object abstracting the real Java Object from the heap dump
- * identified by the given id
+ * identified by the given id
* @throws SnapshotException
*/
public IObject getObject(int objectId) throws SnapshotException;
@@ -476,8 +445,7 @@ public int[] getTopAncestorsInDominatorTree(int[] objectIds, IProgressListener l
*
* Performance: Fast - in memory.
*
- * @param objectId
- * id of object you want the GC root info for
+ * @param objectId id of object you want the GC root info for
* @return null if this object is no GC root or GCRootInfo[] if it is
* @throws SnapshotException
*/
@@ -489,10 +457,9 @@ public int[] getTopAncestorsInDominatorTree(int[] objectIds, IProgressListener l
*
* Performance: Relatively fast - single index operation.
*
- * @param objectId
- * id of object you want the convenient class abstraction for
+ * @param objectId id of object you want the convenient class abstraction for
* @return object abstracting the real Java Class this object was an
- * instance of in the heap dump identified by the given id
+ * instance of in the heap dump identified by the given id
* @throws SnapshotException
*/
public IClass getClassOf(int objectId) throws SnapshotException;
@@ -503,8 +470,7 @@ public int[] getTopAncestorsInDominatorTree(int[] objectIds, IProgressListener l
* Performance: Usually fast - in memory for non-array objects and single
* index operation for array objects.
*
- * @param objectId
- * id of object for which you want the heap size for
+ * @param objectId id of object for which you want the heap size for
* @return heap size for the given object
* @throws SnapshotException
*/
@@ -517,8 +483,7 @@ public int[] getTopAncestorsInDominatorTree(int[] objectIds, IProgressListener l
* size of a set of objects is much faster than iterating over the ids and
* calling getHeapSize for each single object
*
- * @param objectIds
- * ids of the objects for which you want the heap size for
+ * @param objectIds ids of the objects for which you want the heap size for
* @return total heap size for the given object set
* @throws SnapshotException
*/
@@ -534,10 +499,9 @@ public int[] getTopAncestorsInDominatorTree(int[] objectIds, IProgressListener l
*
* Performance: Relatively fast - single index operation.
*
- * @param objectId
- * id of object for which you want the retained heap size for
+ * @param objectId id of object for which you want the retained heap size for
* @return retained heap size for the given object or 0 if no dominator tree
- * was calculated
+ * was calculated
* @throws SnapshotException
*/
public long getRetainedHeapSize(int objectId) throws SnapshotException;
@@ -576,8 +540,7 @@ public int[] getTopAncestorsInDominatorTree(int[] objectIds, IProgressListener l
*
* Performance: Fast - in memory.
*
- * @param objectId
- * id of object you want the address for
+ * @param objectId id of object you want the address for
* @return object address
* @throws SnapshotException
*/
@@ -589,8 +552,7 @@ public int[] getTopAncestorsInDominatorTree(int[] objectIds, IProgressListener l
*
* Performance: Fast - binary search in memory.
*
- * @param objectAddress
- * address of object you want the id for
+ * @param objectAddress address of object you want the id for
* @return object id
* @throws SnapshotException
*/
@@ -611,7 +573,7 @@ public int[] getTopAncestorsInDominatorTree(int[] objectIds, IProgressListener l
*
*
* @return SnapshotAddons - extended information, e.g. perm info, OoM stack
- * trace info, JVM arguments, etc.
+ * trace info, JVM arguments, etc.
* @throws SnapshotException
*/
public A getSnapshotAddons(Class addon) throws SnapshotException;
@@ -622,8 +584,8 @@ public int[] getTopAncestorsInDominatorTree(int[] objectIds, IProgressListener l
*
*
* @return IThreadStack - an object representing the call stack of the
- * thread. Returns null if no info is available for the object, or
- * no stack info is available at all
+ * thread. Returns null if no info is available for the object, or
+ * no stack info is available at all
* @throws SnapshotException
* @since 0.8
*/
diff --git a/src/main/java/org/eclipse/mat/snapshot/MultiplePathsFromGCRootsClassRecord.java b/src/main/java/org/eclipse/mat/snapshot/MultiplePathsFromGCRootsClassRecord.java
index 8d00dc8..0165d3c 100644
--- a/src/main/java/org/eclipse/mat/snapshot/MultiplePathsFromGCRootsClassRecord.java
+++ b/src/main/java/org/eclipse/mat/snapshot/MultiplePathsFromGCRootsClassRecord.java
@@ -66,8 +66,6 @@ record = new MultiplePathsFromGCRootsClassRecord(clazz, nextLevel, fromRoots, sn
/**
* This method is used only when the record is built. Adds one path to the
* set of paths
- *
- * @param path
*/
public void addPath(int[] path) {
paths.add(path);
@@ -77,7 +75,7 @@ public void addPath(int[] path) {
* Get all the paths going through the object (getObjectId())
*
* @return Listnull
if the creation date is not
- * known
+ * known
*/
public Date getCreationDate() {
return creationDate != null ? new Date(creationDate.getTime()) : null;
@@ -187,7 +178,7 @@ public int getNumberOfClassLoaders() {
* Get number of bytes used in the heap (the allocated memory may be higher)
*
* @return number of bytes used in the heap (the allocated memory may be
- * higher)
+ * higher)
*/
public long getUsedHeapSize() {
return usedHeapSize;
diff --git a/src/main/java/org/eclipse/mat/snapshot/extension/IClassSpecificNameResolver.java b/src/main/java/org/eclipse/mat/snapshot/extension/IClassSpecificNameResolver.java
index f17ec63..33a700f 100644
--- a/src/main/java/org/eclipse/mat/snapshot/extension/IClassSpecificNameResolver.java
+++ b/src/main/java/org/eclipse/mat/snapshot/extension/IClassSpecificNameResolver.java
@@ -26,8 +26,7 @@ public interface IClassSpecificNameResolver {
/**
* Resolve the name for snapshot object.
*
- * @param object
- * object for which the name should be resolved
+ * @param object object for which the name should be resolved
* @return name for snapshot object
* @throws SnapshotException
*/
diff --git a/src/main/java/org/eclipse/mat/snapshot/model/IObject.java b/src/main/java/org/eclipse/mat/snapshot/model/IObject.java
index 233c398..ff462de 100644
--- a/src/main/java/org/eclipse/mat/snapshot/model/IObject.java
+++ b/src/main/java/org/eclipse/mat/snapshot/model/IObject.java
@@ -81,7 +81,7 @@ public interface Type {
* Get retained heap size of this object.
*
* @return retained heap size of this object (returns 0 if the dominator
- * tree wasn't calculated for the corresponding snapshot)
+ * tree wasn't calculated for the corresponding snapshot)
*/
public long getRetainedHeapSize();
@@ -98,7 +98,7 @@ public interface Type {
* char[].
*
* @return class specific name of the given snapshot object or null if it
- * can't be resolved
+ * can't be resolved
*/
public String getClassSpecificName();
@@ -107,7 +107,7 @@ public interface Type {
* {@link #getClassSpecificName()}.
*
* @return concatenation of {@link #getTechnicalName()} and
- * {@link #getClassSpecificName()}
+ * {@link #getClassSpecificName()}
*/
public String getDisplayName();
@@ -116,7 +116,7 @@ public interface Type {
* the name of the field over which it was referenced.
*
* @return list of snapshot objects referenced from this snapshot object
- * with the name of the field over which it was referenced
+ * with the name of the field over which it was referenced
*/
public ListUNKNOWN
the
- * implementation is free to indicate progress in a way which
- * doesn't require the total number of work units in advance.
+ * @param name the name (or description) of the main task
+ * @param totalWork the total number of work units into which the main task is
+ * been subdivided. If the value is UNKNOWN
the
+ * implementation is free to indicate progress in a way which
+ * doesn't require the total number of work units in advance.
*/
public void beginTask(String name, int totalWork);
@@ -87,7 +85,7 @@ public class OperationCanceledException extends RuntimeException {
* requested.
*
* @return true
if cancellation has been requested, and
- * false
otherwise
+ * false
otherwise
* @see #setCanceled(boolean)
*/
public boolean isCanceled();
@@ -95,10 +93,9 @@ public class OperationCanceledException extends RuntimeException {
/**
* Sets the cancel state to the given value.
*
- * @param value
- * true
indicates that cancelation has been
- * requested (but not necessarily acknowledged);
- * false
clears this flag
+ * @param value true
indicates that cancelation has been
+ * requested (but not necessarily acknowledged);
+ * false
clears this flag
* @see #isCanceled()
*/
public void setCanceled(boolean value);
@@ -107,8 +104,7 @@ public class OperationCanceledException extends RuntimeException {
* Notifies that a subtask of the main task is beginning. Subtasks are
* optional; the main task might not have subtasks.
*
- * @param name
- * the name (or description) of the subtask
+ * @param name the name (or description) of the subtask
*/
public void subTask(String name);
@@ -117,8 +113,7 @@ public class OperationCanceledException extends RuntimeException {
* completed. Note that this amount represents an installment, as opposed to
* a cumulative amount of work done to date.
*
- * @param work
- * the number of work units just completed
+ * @param work the number of work units just completed
*/
public void worked(int work);
@@ -143,13 +138,10 @@ public enum Severity {
/**
* Sends a message to the user.
*
- * @param severity
- * Severity as defined in {@link Severity}
- * @param message
- * The message localized to the current locale.
- * @param exception
- * The relevant low-level exception, or null
if
- * none.
+ * @param severity Severity as defined in {@link Severity}
+ * @param message The message localized to the current locale.
+ * @param exception The relevant low-level exception, or null
if
+ * none.
*/
public void sendUserMessage(Severity severity, String message, Throwable exception);
}