XArray.java
| Index Score | ||
|---|---|---|
 |
 |
org.geotools.resources |
 |
 |
MrPostman |
View: Reasons, Metrics, Source Code
These are the metrics that contribute to the Enerjy Score for this file, ranked by impact. So the metrics listed at the top influence the score to a greater extent that the metrics listed at the bottom.
| Metric | Description | |
|---|---|---|
| DOC_COMMENT | Number of javadoc comment lines |  |
| COMMENTS | Comment lines | |
| PARAMS | Number of formal parameter declarations | |
| SIZE | Size of the file in bytes | |
| INTERFACE_COMPLEXITY | Interface complexity | |
| DECL_COMMENTS | Comments in declarations | |
| LINES | Number of lines in the source file | |
| FUNCTIONS | Number of function declarations | |
| RETURNS | Number of return points from functions | |
| JAVA0110 | JAVA0110 Incorrect javadoc: no @return tag | |
| JAVA0034 | JAVA0034 Missing braces in if statement | |
| JAVA0108 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| OPERATORS | Number of operators | |
| PROGRAM_LENGTH | Halstead program length | |
| BLOCKS | Number of blocks | |
| UNIQUE_OPERANDS | Number of unique operands | |
| PROGRAM_VOCAB | Halstead program vocabulary | |
| JAVA0117 | JAVA0117 Missing javadoc: method 'method' | |
| CYCLOMATIC | Cyclomatic complexity | |
| PROGRAM_VOLUME | Halstead program volume | |
| JAVA0136 | JAVA0136 N methods defined in class (maximum: M) | |
| EXEC_COMMENTS | Comments in executable code | |
| JAVA0126 | JAVA0126 Method declares unchecked exception in throws | |
| LINE_COMMENT | Number of line comments | |
| LOOPS | Number of loops | |
| EXITS | Procedure exits | |
| COMPARISONS | Number of comparison operators | |
| JAVA0145 | JAVA0145 Tab character used in source file | |
| BLOCK_COMMENT | Number of block comment lines | |
/*
* -*- mode: java; c-basic-indent: 4; indent-tabs-mode: nil -*-
* :indentSize=4:noTabs=true:tabSize=4:indentOnTab=true:indentOnEnter=true:mode=java:
* ex: set tabstop=4 expandtab:
*
* MrPostman - webmail <-> email gateway
* Copyright (C) 2002-2003 MrPostman Development Group
* Projectpage: http://mrbook.org/mrpostman/
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
* In particular, this implies that users are responsible for
* using MrPostman after reading the terms and conditions given
* by their web-mail provider.
*
* You should have received a copy of the GNU General Public License
* Named LICENSE in the base directory of this distribution,
* if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
/*
* Geotools - OpenSource mapping toolkit
* (C) 2002, Centre for Computational Geography
* (C) 2001, Institut de Recherche pour le DÈveloppement
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*
* Contacts:
* UNITED KINGDOM: James Macgill
* mailto:j.macgill@geog.leeds.ac.uk
*
* FRANCE: Surveillance de l'Environnement AssistÈe par Satellite
* Institut de Recherche pour le DÈveloppement / US-Espace
* mailto:seasnet@teledetection.fr
*
* CANADA: Observatoire du Saint-Laurent
* Institut Maurice-Lamontagne
* mailto:osl@osl.gc.ca
*/
package org.geotools.resources;
import java.lang.reflect.Array;
/**
* Simple operations on arrays. This class provides a central place for
* inserting and deleting elements in an array, as well as resizing the array.
* This class may be removed if JavaSoft provide some language construct
* functionally equivalent to C/C++'s <code>realloc</code>.
*
* @version $Id: XArray.java,v 1.5 2003/02/09 23:38:12 lbruand Exp $
* @author Martin Desruisseaux
*/
public final class XArray {
public static final String CVSID = "$Id: XArray.java,v 1.5 2003/02/09 23:38:12 lbruand Exp $";
/**
* All object constructions of this class are forbidden.
*/
private XArray() {
}
/**
* Returns a new table which contains the same elements as
* <code>array</code> but with the <code>length</code> specified.
* If the desired <code>length</code> is longer than the initial
* length of the <code>array</code> table, the returned table will contain
* all the elements of <code>array</code> as well as the elements
* initialised to <code>null</code> at the end of the table. If, on the
* contrary, the desired <code>length</code> is shorter than the initial
* length of the <code>array</code> table, the table will be truncated
* (that is to say the surplus <code>array</code> elements will be
* forgotten). If the length of <code>array</code> is equal to
* <code>length</code>, then <code>array</code> will be returned as it stands.
*
* @param array Table to copy
* @param length Length of the desired table.
* @return Table of the same type as <code>array</code>, of length
* <code>length</code> and containing the data from
* <code>array</code>.
*/
private static Object doResize(final Object array, final int length) {
final int current = Array.getLength(array);
if (current != length) {
final Object newArray = Array.newInstance(array.getClass().getComponentType(), length);
System.arraycopy(array, 0, newArray, 0, Math.min(current, length));
return newArray;
} else {
return array;
}
}
/**
* Returns a new table which contains the same elements as
* <code>array</code> but with the <code>length</code> specified.
* If the desired <code>length</code> is longer than the initial
* length of the <code>array</code> table, the returned table will contain
* all the elements of <code>array</code> as well as the elements
* initialised to <code>null</code> at the end of the table. If, on the
* contrary, the desired <code>length</code> is shorter than the initial
* length of the <code>array</code> table, the table will be truncated
* (that is to say the surplus <code>array</code> elements will be
* forgotten). If the length of <code>array</code> is equal to
* <code>length</code>, then <code>array</code> will be returned as it
* stands.
*
* @param array Table to copy.
* @param length Length of the desired table.
* @return Table of the same type as <code>array</code>, of length
* <code>length</code> and containing the data from
* <code>array</code>.
*/
public static Object[] resize(final Object[] array, final int length) {
return (Object[]) doResize(array, length);
}
/**
* Returns a new table which contains the same elements as
* <code>array</code> but with the <code>length</code> specified.
* If the desired <code>length</code> is longer than the initial
* length of the <code>array</code> table, the returned table will contain
* all the elements of <code>array</code> as well as the elements
* initialised to <code>null</code> at the end of the table. If, on the
* contrary, the desired <code>length</code> is shorter than the initial
* length of the <code>array</code> table, the table will be truncated
* (that is to say the surplus <code>array</code> elements will be
* forgotten). If the length of <code>array</code> is equal to
* <code>length</code>, then <code>array</code> will be returned as it
* stands.
*
* @param array Table to copy.
* @param length Length of the desired table.
* @return Table of the same type as <code>array</code>, of length
* <code>length</code> and containing the data from
* <code>array</code>.
*/
public static double[] resize(final double[] array, final int length) {
return (double[]) doResize(array, length);
}
/**
* Returns a new table which contains the same elements as
* <code>array</code> but with the <code>length</code> specified.
* If the desired <code>length</code> is longer than the initial
* length of the <code>array</code> table, the returned table will contain
* all the elements of <code>array</code> as well as the elements
* initialised to <code>null</code> at the end of the table. If, on the
* contrary, the desired <code>length</code> is shorter than the initial
* length of the <code>array</code> table, the table will be truncated
* (that is to say the surplus <code>array</code> elements will be
* forgotten). If the length of <code>array</code> is equal to
* <code>length</code>, then <code>array</code> will be returned as it
* stands.
*
* @param array Table to copy.
* @param length Length of the desired table.
* @return Table of the same type as <code>array</code>, of length
* <code>length</code> and containing the data from
* <code>array</code>.
*/
public static float[] resize(final float[] array, final int length) {
return (float[]) doResize(array, length);
}
/**
* Returns a new table which contains the same elements as
* <code>array</code> but with the <code>length</code> specified.
* If the desired <code>length</code> is longer than the initial
* length of the <code>array</code> table, the returned table will contain
* all the elements of <code>array</code> as well as the elements
* initialised to <code>null</code> at the end of the table. If, on the
* contrary, the desired <code>length</code> is shorter than the initial
* length of the <code>array</code> table, the table will be truncated
* (that is to say the surplus <code>array</code> elements will be
* forgotten). If the length of <code>array</code> is equal to
* <code>length</code>, then <code>array</code> will be returned as it
* stands.
*
* @param array Table to copy.
* @param length Length of the desired table.
* @return Table of the same type as <code>array</code>, of length
* <code>length</code> and containing the data from
* <code>array</code>.
*/
public static long[] resize(final long[] array, final int length) {
return (long[]) doResize(array, length);
}
/**
* Returns a new table which contains the same elements as
* <code>array</code> but with the <code>length</code> specified.
* If the desired <code>length</code> is longer than the initial
* length of the <code>array</code> table, the returned table will contain
* all the elements of <code>array</code> as well as the elements
* initialised to <code>null</code> at the end of the table. If, on the
* contrary, the desired <code>length</code> is shorter than the initial
* length of the <code>array</code> table, the table will be truncated
* (that is to say the surplus <code>array</code> elements will be
* forgotten). If the length of <code>array</code> is equal to
* <code>length</code>, then <code>array</code> will be returned as it
* stands.
*
* @param array Table to copy.
* @param length Length of the desired table.
* @return Table of the same type as <code>array</code>, of length
* <code>length</code> and containing the data from
* <code>array</code>.
*/
public static int[] resize(final int[] array, final int length) {
return (int[]) doResize(array, length);
}
/**
* Returns a new table which contains the same elements as
* <code>array</code> but with the <code>length</code> specified.
* If the desired <code>length</code> is longer than the initial
* length of the <code>array</code> table, the returned table will contain
* all the elements of <code>array</code> as well as the elements
* initialised to <code>null</code> at the end of the table. If, on the
* contrary, the desired <code>length</code> is shorter than the initial
* length of the <code>array</code> table, the table will be truncated
* (that is to say the surplus <code>array</code> elements will be
* forgotten). If the length of <code>array</code> is equal to
* <code>length</code>, then <code>array</code> will be returned as it
* stands.
*
* @param array Table to copy.
* @param length Length of the desired table.
* @return Table of the same type as <code>array</code>, of length
* <code>length</code> and containing the data from
* <code>array</code>.
*/
public static short[] resize(final short[] array, final int length) {
return (short[]) doResize(array, length);
}
/**
* Returns a new table which contains the same elements as
* <code>array</code> but with the <code>length</code> specified.
* If the desired <code>length</code> is longer than the initial
* length of the <code>array</code> table, the returned table will contain
* all the elements of <code>array</code> as well as the elements
* initialised to <code>null</code> at the end of the table. If, on the
* contrary, the desired <code>length</code> is shorter than the initial
* length of the <code>array</code> table, the table will be truncated
* (that is to say the surplus <code>array</code> elements will be
* forgotten). If the length of <code>array</code> is equal to
* <code>length</code>, then <code>array</code> will be returned as it
* stands.
*
* @param array Table to copy.
* @param length Length of the desired table.
* @return Table of the same type as <code>array</code>, of length
* <code>length</code> and containing the data from
* <code>array</code>.
*/
public static byte[] resize(final byte[] array, final int length) {
return (byte[]) doResize(array, length);
}
/**
* Returns a new table which contains the same elements as
* <code>array</code> but with the <code>length</code> specified.
* If the desired <code>length</code> is longer than the initial
* length of the <code>array</code> table, the returned table will contain
* all the elements of <code>array</code> as well as the elements
* initialised to <code>null</code> at the end of the table. If, on the
* contrary, the desired <code>length</code> is shorter than the initial
* length of the <code>array</code> table, the table will be truncated
* (that is to say the surplus <code>array</code> elements will be
* forgotten). If the length of <code>array</code> is equal to
* <code>length</code>, then <code>array</code> will be returned as it
* stands.
*
* @param array Table to copy.
* @param length Length of the desired table.
* @return Table of the same type as <code>array</code>, of length
* <code>length</code> and containing the data from
* <code>array</code>.
*/
public static char[] resize(final char[] array, final int length) {
return (char[]) doResize(array, length);
}
/**
* Returns a new table which contains the same elements as
* <code>array</code> but with the <code>length</code> specified.
* If the desired <code>length</code> is longer than the initial
* length of the <code>array</code> table, the returned table will contain
* all the elements of <code>array</code> as well as the elements
* initialised to <code>null</code> at the end of the table. If, on the
* contrary, the desired <code>length</code> is shorter than the initial
* length of the <code>array</code> table, the table will be truncated
* (that is to say the surplus <code>array</code> elements will be
* forgotten). If the length of <code>array</code> is equal to
* <code>length</code>, then <code>array</code> will be returned as it
* stands.
*
* @param array Table to copy.
* @param length Length of the desired table.
* @return Table of the same type as <code>array</code>, of length
* <code>length</code> and containing the data from
* <code>array</code>.
*/
public static boolean[] resize(final boolean[] array, final int length) {
return (boolean[]) doResize(array, length);
}
/**
* Grabs elements from the middle of a table.
*
* @param array Table from which to grab elements.
* @param index <code>array</code> index of the first element to grab.
* All subsequent elements of <code>array</code>
* can be moved forward.
* @param length Number of elements to grab.
* @return Table which contains the <code>array</code> data with the
* extracted elements. This method can directly return
* <code>dst</code>, but most often it returns a newly created
* table.
*/
private static Object doRemove(final Object array, final int index, final int length) {
if (length == 0) {
return array;
}
int array_length = Array.getLength(array);
final Object newArray = Array.newInstance(array.getClass().getComponentType(), array_length -= length);
System.arraycopy(array, 0, newArray, 0, index);
System.arraycopy(array, index + length, newArray, index, array_length - index);
return newArray;
}
/**
* Grabs elements from the middle of a table.
*
* @param array Table from which to grab the elements.
* @param index <code>array</code> index of the first element to grab.
* All subsequent <code>array</code> elements can be moved forward.
* @param length Number of elements to grab.
* @return Table which contains the <code>array</code> data with the
* extracted elements. This method can directly return
* <code>dst</code>, but most often it returns a newly created
* table.
*/
public static Object[] remove(final Object[] array, final int index, final int length) {
return (Object[]) doRemove(array, index, length);
}
/**
* Grabs elements from the middle of a table.
*
* @param array Table from which to grab elements.
* @param index <code>array</code> index of the first element to grab.
* All subsequent elements of <code>array</code>
* can be moved forward.
* @param length Number of elements to grab.
* @return Table which contains the <code>array</code> data with the
* extracted elements. This method can directly return
* <code>dst</code>, but most often it returns a newly created
* table.
*/
public static double[] remove(final double[] array, final int index, final int length) {
return (double[]) doRemove(array, index, length);
}
/**
* Grabs elements from the middle of a table.
*
* @param array Table from which to grab elements.
* @param index <code>array</code> index of the first element to grab.
* All subsequent elements of <code>array</code>
* can be moved forward.
* @param length Number of elements to grab.
* @return Table which contains the <code>array</code> data with the
* extracted elements. This method can directly return
* <code>dst</code>, but most often it returns a newly created
* table.
*/
public static float[] remove(final float[] array, final int index, final int length) {
return (float[]) doRemove(array, index, length);
}
/**
* Grabs elements from the middle of a table.
*
* @param array Table from which to grab elements.
* @param index <code>array</code> index of the first element to grab.
* All subsequent elements of <code>array</code>
* can be moved forward.
* @param length Number of elements to grab.
* @return Table which contains the <code>array</code> data with the
* extracted elements. This method can directly return
* <code>dst</code>, but most often it returns a newly created
* table.
*/
public static long[] remove(final long[] array, final int index, final int length) {
return (long[]) doRemove(array, index, length);
}
/**
* Grabs elements from the middle of a table.
*
* @param array Table from which to grab elements.
* @param index <code>array</code> index of the first element to grab.
* All subsequent elements of <code>array</code>
* can be moved forward.
* @param length Number of elements to grab.
* @return Table which contains the <code>array</code> data with the
* extracted elements. This method can directly return
* <code>dst</code>, but most often it returns a newly created
* table.
*/
public static int[] remove(final int[] array, final int index, final int length) {
return (int[]) doRemove(array, index, length);
}
/**
* Grabs elements from the middle of a table.
*
* @param array Table from which to grab elements.
* @param index <code>array</code> index of the first element to grab.
* All subsequent elements of <code>array</code>
* can be moved forward.
* @param length Number of elements to grab.
* @return Table which contains the <code>array</code> data with the
* extracted elements. This method can directly return
* <code>dst</code>, but most often it returns a newly created
* table.
*/
public static short[] remove(final short[] array, final int index, final int length) {
return (short[]) doRemove(array, index, length);
}
/**
* Grabs elements from the middle of a table.
*
* @param array Table from which to grab elements.
* @param index <code>array</code> index of the first element to grab.
* All subsequent elements of <code>array</code>
* can be moved forward.
* @param length Number of elements to grab.
* @return Table which contains the <code>array</code> data with the
* extracted elements. This method can directly return
* <code>dst</code>, but most often it returns a newly created
* table.
*/
public static byte[] remove(final byte[] array, final int index, final int length) {
return (byte[]) doRemove(array, index, length);
}
/**
* Grabs elements from the middle of a table.
*
* @param array Table from which to grab elements.
* @param index <code>array</code> index of the first element to grab.
* All subsequent elements of <code>array</code>
* can be moved forward.
* @param length Number of elements to grab.
* @return Table which contains the <code>array</code> data with the
* extracted elements. This method can directly return
* <code>dst</code>, but most often it returns a newly created
* table.
*/
public static char[] remove(final char[] array, final int index, final int length) {
return (char[]) doRemove(array, index, length);
}
/**
* Grabs elements from the middle of a table.
*
* @param array Table from which to grab elements.
* @param index <code>array</code> index of the first element to grab.
* All subsequent elements of <code>array</code>
* can be moved forward.
* @param length Number of elements to grab.
* @return Table which contains the <code>array</code> data with the
* extracted elements. This method can directly return
* <code>dst</code>, but most often it returns a newly created
* table.
*/
public static boolean[] remove(final boolean[] array, final int index, final int length) {
return (boolean[]) doRemove(array, index, length);
}
/**
* Inserts spaces into the middle of a table. These "spaces" will be made
* up of null elements.
*
* @param array Table in which to insert spaces.
* @param index <code>array</code> index where spaces should be inserted.
* All <code>array</code> elements which have an index equal
* to or higher than <code>index</code> will be moved
* forward.
* @param length Number of spaces to insert.
* @return Table which contains the <code>array</code> data with the
* additional space. This method can directly return
* <code>dst</code>, but most often it returns a newly
* created table.
*/
private static Object doInsert(final Object array, final int index, final int length) {
if (length == 0) {
return array;
}
final int array_length = Array.getLength(array);
final Object newArray = Array.newInstance(array.getClass().getComponentType(), array_length + length);
System.arraycopy(array, 0, newArray, 0, index);
System.arraycopy(array, index, newArray, index + length, array_length - index);
return newArray;
}
/**
* Inserts spaces into the middle of a table. These "spaces" will be made
* up of null elements.
*
* @param array Table in which to insert spaces.
* @param index <code>array</code> index where spaces should be inserted.
* All <code>array</code> elements which have an index equal
* to or higher than <code>index</code> will be moved
* forward.
* @param length Number of spaces to insert.
* @return Table which contains the <code>array</code> data with the
* additional space. This method can directly return
* <code>dst</code>, but most often it returns a newly
* created table.
*/
public static Object[] insert(final Object[] array, final int index, final int length) {
return (Object[]) doInsert(array, index, length);
}
/**
* Inserts spaces into the middle of a table. These "spaces" will be made
* up of zeros.
*
* @param array Table in which to insert spaces.
* @param index <code>array</code> index where spaces should be inserted.
* All <code>array</code> elements which have an index equal
* to or higher than <code>index</code> will be moved
* forward.
* @param length Number of spaces to insert.
* @return Table which contains the <code>array</code> data with the
* additional space. This method can directly return
* <code>dst</code>, but most often it returns a newly
* created table.
*/
public static double[] insert(final double[] array, final int index, final int length) {
return (double[]) doInsert(array, index, length);
}
/**
* Inserts spaces into the middle of a table. These "spaces" will be made
* up of zeros.
*
* @param array Table in which to insert spaces.
* @param index <code>array</code> index where spaces should be inserted.
* All <code>array</code> elements which have an index equal
* to or higher than <code>index</code> will be moved
* forward.
* @param length Number of spaces to insert.
* @return Table which contains the <code>array</code> data with the
* additional space. This method can directly return
* <code>dst</code>, but most often it returns a newly
* created table.
*/
public static float[] insert(final float[] array, final int index, final int length) {
return (float[]) doInsert(array, index, length);
}
/**
* Inserts spaces into the middle of a table. These "spaces" will be made
* up of zeros.
*
* @param array Table in which to insert spaces.
* @param index <code>array</code> index where spaces should be inserted.
* All <code>array</code> elements which have an index equal
* to or higher than <code>index</code> will be moved
* forward.
* @param length Number of spaces to insert.
* @return Table which contains the <code>array</code> data with the
* additional space. This method can directly return
* <code>dst</code>, but most often it returns a newly
* created table.
*/
public static long[] insert(final long[] array, final int index, final int length) {
return (long[]) doInsert(array, index, length);
}
/**
* Inserts spaces into the middle of a table. These "spaces" will be made
* up of zeros.
*
* @param array Table in which to insert spaces.
* @param index <code>array</code> index where spaces should be inserted.
* All <code>array</code> elements which have an index equal
* to or higher than <code>index</code> will be moved
* forward.
* @param length Number of spaces to insert.
* @return Table which contains the <code>array</code> data with the
* additional space. This method can directly return
* <code>dst</code>, but most often it returns a newly
* created table.
*/
public static int[] insert(final int[] array, final int index, final int length) {
return (int[]) doInsert(array, index, length);
}
/**
* Inserts spaces into the middle of a table. These "spaces" will be made
* up of zeros.
*
* @param array Table in which to insert spaces.
* @param index <code>array</code> index where spaces should be inserted.
* All <code>array</code> elements which have an index equal
* to or higher than <code>index</code> will be moved
* forward.
* @param length Number of spaces to insert.
* @return Table which contains the <code>array</code> data with the
* additional space. This method can directly return
* <code>dst</code>, but most often it returns a newly
* created table.
*/
public static short[] insert(final short[] array, final int index, final int length) {
return (short[]) doInsert(array, index, length);
}
/**
* Inserts spaces into the middle of a table. These "spaces" will be made
* up of zeros.
*
* @param array Table in which to insert spaces.
* @param index <code>array</code> index where spaces should be inserted.
* All <code>array</code> elements which have an index equal
* to or higher than <code>index</code> will be moved
* forward.
* @param length Number of spaces to insert.
* @return Table which contains the <code>array</code> data with the
* additional space. This method can directly return
* <code>dst</code>, but most often it returns a newly
* created table.
*/
public static byte[] insert(final byte[] array, final int index, final int length) {
return (byte[]) doInsert(array, index, length);
}
/**
* Inserts spaces into the middle of a table. These "spaces" will be made
* up of zeros.
*
* @param array Table in which to insert spaces.
* @param index <code>array</code> index where spaces should be inserted.
* All <code>array</code> elements which have an index equal
* to or higher than <code>index</code> will be moved
* forward.
* @param length Number of spaces to insert.
* @return Table which contains the <code>array</code> data with the
* additional space. This method can directly return
* <code>dst</code>, but most often it returns a newly
* created table.
*/
public static char[] insert(final char[] array, final int index, final int length) {
return (char[]) doInsert(array, index, length);
}
/**
* Inserts spaces into the middle of a table. These "spaces" will be made
* up of <code>false</code>.
*
* @param array Table in which to insert spaces.
* @param index <code>array</code> index where spaces should be inserted.
* All <code>array</code> elements which have an index equal
* to or higher than <code>index</code> will be moved
* forward.
* @param length Number of spaces to insert.
* @return Table which contains the <code>array</code> data with the
* additional space. This method can directly return
* <code>dst</code>, but most often it returns a newly
* created table.
*/
public static boolean[] insert(final boolean[] array, final int index, final int length) {
return (boolean[]) doInsert(array, index, length);
}
/**
* Inserts a table slice into another table. The <code>src</code> table
* will be entirely or partially inserted into the <code>dst</code> table.
*
* @param src Table to insert into <code>dst</code>.
* @param src_pos Index of the first data item of <code>src</code> to
* insert into <code>dst</code>.
* @param dst Table in which to insert <code>src</code> data.
* @param dst_pos <code>dst</code> index in which to insert
* <code>src</code> data. All elements of
* <code>dst</code> whose index is equal to or greater than
* <code>dst_pos</code> will be moved forward.
* @param length Number of <code>src</code> data items to insert.
* @return Table which contains the combination of <code>src</code>
* and <code>dst</code>. This method can directly return
* <code>dst</code>, but never <code>src</code>. It most
* often returns a newly created table.
*/
private static Object doInsert(final Object src, final int src_pos, final Object dst, final int dst_pos,
final int length) {
if (length == 0) {
return dst;
}
final int dst_length = Array.getLength(dst);
final Object newArray = Array.newInstance(dst.getClass().getComponentType(), dst_length + length);
System.arraycopy(dst, 0, newArray, 0, dst_pos);
System.arraycopy(src, src_pos, newArray, dst_pos, length);
System.arraycopy(dst, dst_pos, newArray, dst_pos + length, dst_length - dst_pos);
return newArray;
}
/**
* Inserts a table slice into another table. The <code>src</code> table
* will be entirely or partially inserted into the <code>dst</code> table.
*
* @param src Tablea to insert into <code>dst</code>.
* @param src_pos Index of the first data item of <code>src</code> to
* insert into <code>dst</code>.
* @param dst Table in which to insert <code>src</code> data.
* @param dst_pos <code>dst</code> index in which to insert
* <code>src</code> data. All elements of
* <code>dst</code> whose index is equal to or greater than
* <code>dst_pos</code> will be moved forward.
* @param length Number of <code>src</code> data items to insert.
* @return Table which contains the combination of <code>src</code>
* and <code>dst</code>. This method can directly return
* <code>dst</code>, but never <code>src</code>. It most
* often returns a newly created table.
*/
public static Object[] insert(final Object[] src, final int src_pos, final Object[] dst, final int dst_pos,
final int length) {
return (Object[]) doInsert(src, src_pos, dst, dst_pos, length);
}
/**
* Inserts a table slice into another table. The <code>src</code> table
* will be entirely or partially inserted into the <code>dst</code> table.
*
* @param src Tablea to insert into <code>dst</code>.
* @param src_pos Index of the first data item of <code>src</code> to
* insert into <code>dst</code>.
* @param dst Table in which to insert <code>src</code> data.
* @param dst_pos <code>dst</code> index in which to insert
* <code>src</code> data. All elements of
* <code>dst</code> whose index is equal to or greater than
* <code>dst_pos</code> will be moved forward.
* @param length Number of <code>src</code> data items to insert.
* @return Table which contains the combination of <code>src</code>
* and <code>dst</code>. This method can directly return
* <code>dst</code>, but never <code>src</code>. It most
* often returns a newly created table.
*/
public static double[] insert(final double[] src, final int src_pos, final double[] dst, final int dst_pos,
final int length) {
return (double[]) doInsert(src, src_pos, dst, dst_pos, length);
}
/**
* Inserts a table slice into another table. The <code>src</code> table
* will be entirely or partially inserted into the <code>dst</code> table.
*
* @param src Tablea to insert into <code>dst</code>.
* @param src_pos Index of the first data item of <code>src</code> to
* insert into <code>dst</code>.
* @param dst Table in which to insert <code>src</code> data.
* @param dst_pos <code>dst</code> index in which to insert
* <code>src</code> data. All elements of
* <code>dst</code> whose index is equal to or greater than
* <code>dst_pos</code> will be moved forward.
* @param length Number of <code>src</code> data items to insert.
* @return Table which contains the combination of <code>src</code>
* and <code>dst</code>. This method can directly return
* <code>dst</code>, but never <code>src</code>. It most
* often returns a newly created table.
*/
public static float[] insert(final float[] src, final int src_pos, final float[] dst, final int dst_pos,
final int length) {
return (float[]) doInsert(src, src_pos, dst, dst_pos, length);
}
/**
* Inserts a table slice into another table. The <code>src</code> table
* will be entirely or partially inserted into the <code>dst</code> table.
*
* @param src Tablea to insert into <code>dst</code>.
* @param src_pos Index of the first data item of <code>src</code> to
* insert into <code>dst</code>.
* @param dst Table in which to insert <code>src</code> data.
* @param dst_pos <code>dst</code> index in which to insert
* <code>src</code> data. All elements of
* <code>dst</code> whose index is equal to or greater than
* <code>dst_pos</code> will be moved forward.
* @param length Number of <code>src</code> data items to insert.
* @return Table which contains the combination of <code>src</code>
* and <code>dst</code>. This method can directly return
* <code>dst</code>, but never <code>src</code>. It most
* often returns a newly created table.
*/
public static long[] insert(final long[] src, final int src_pos, final long[] dst, final int dst_pos,
final int length) {
return (long[]) doInsert(src, src_pos, dst, dst_pos, length);
}
/**
* Inserts a table slice into another table. The <code>src</code> table
* will be entirely or partially inserted into the <code>dst</code> table.
*
* @param src Tablea to insert into <code>dst</code>.
* @param src_pos Index of the first data item of <code>src</code> to
* insert into <code>dst</code>.
* @param dst Table in which to insert <code>src</code> data.
* @param dst_pos <code>dst</code> index in which to insert
* <code>src</code> data. All elements of
* <code>dst</code> whose index is equal to or greater than
* <code>dst_pos</code> will be moved forward.
* @param length Number of <code>src</code> data items to insert.
* @return Table which contains the combination of <code>src</code>
* and <code>dst</code>. This method can directly return
* <code>dst</code>, but never <code>src</code>. It most
* often returns a newly created table.
*/
public static int[] insert(final int[] src, final int src_pos, final int[] dst, final int dst_pos, final int length) {
return (int[]) doInsert(src, src_pos, dst, dst_pos, length);
}
/**
* Inserts a table slice into another table. The <code>src</code> table
* will be entirely or partially inserted into the <code>dst</code> table.
*
* @param src Tablea to insert into <code>dst</code>.
* @param src_pos Index of the first data item of <code>src</code> to
* insert into <code>dst</code>.
* @param dst Table in which to insert <code>src</code> data.
* @param dst_pos <code>dst</code> index in which to insert
* <code>src</code> data. All elements of
* <code>dst</code> whose index is equal to or greater than
* <code>dst_pos</code> will be moved forward.
* @param length Number of <code>src</code> data items to insert.
* @return Table which contains the combination of <code>src</code>
* and <code>dst</code>. This method can directly return
* <code>dst</code>, but never <code>src</code>. It most
* often returns a newly created table.
*/
public static short[] insert(final short[] src, final int src_pos, final short[] dst, final int dst_pos,
final int length) {
return (short[]) doInsert(src, src_pos, dst, dst_pos, length);
}
/**
* Inserts a table slice into another table. The <code>src</code> table
* will be entirely or partially inserted into the <code>dst</code> table.
*
* @param src Tablea to insert into <code>dst</code>.
* @param src_pos Index of the first data item of <code>src</code> to
* insert into <code>dst</code>.
* @param dst Table in which to insert <code>src</code> data.
* @param dst_pos <code>dst</code> index in which to insert
* <code>src</code> data. All elements of
* <code>dst</code> whose index is equal to or greater than
* <code>dst_pos</code> will be moved forward.
* @param length Number of <code>src</code> data items to insert.
* @return Table which contains the combination of <code>src</code>
* and <code>dst</code>. This method can directly return
* <code>dst</code>, but never <code>src</code>. It most
* often returns a newly created table.
*/
public static byte[] insert(final byte[] src, final int src_pos, final byte[] dst, final int dst_pos,
final int length) {
return (byte[]) doInsert(src, src_pos, dst, dst_pos, length);
}
/**
* Inserts a table slice into another table. The <code>src</code> table
* will be entirely or partially inserted into the <code>dst</code> table.
*
* @param src Tablea to insert into <code>dst</code>.
* @param src_pos Index of the first data item of <code>src</code> to
* insert into <code>dst</code>.
* @param dst Table in which to insert <code>src</code> data.
* @param dst_pos <code>dst</code> index in which to insert
* <code>src</code> data. All elements of
* <code>dst</code> whose index is equal to or greater than
* <code>dst_pos</code> will be moved forward.
* @param length Number of <code>src</code> data items to insert.
* @return Table which contains the combination of <code>src</code>
* and <code>dst</code>. This method can directly return
* <code>dst</code>, but never <code>src</code>. It most
* often returns a newly created table.
*/
public static char[] insert(final char[] src, final int src_pos, final char[] dst, final int dst_pos,
final int length) {
return (char[]) doInsert(src, src_pos, dst, dst_pos, length);
}
/**
* Inserts a table slice into another table. The <code>src</code> table
* will be entirely or partially inserted into the <code>dst</code> table.
*
* @param src Tablea to insert into <code>dst</code>.
* @param src_pos Index of the first data item of <code>src</code> to
* insert into <code>dst</code>.
* @param dst Table in which to insert <code>src</code> data.
* @param dst_pos <code>dst</code> index in which to insert
* <code>src</code> data. All elements of
* <code>dst</code> whose index is equal to or greater than
* <code>dst_pos</code> will be moved forward.
* @param length Number of <code>src</code> data items to insert.
* @return Table which contains the combination of <code>src</code>
* and <code>dst</code>. This method can directly return
* <code>dst</code>, but never <code>src</code>. It most
* often returns a newly created table.
*/
public static boolean[] insert(final boolean[] src, final int src_pos, final boolean[] dst, final int dst_pos,
final int length) {
return (boolean[]) doInsert(src, src_pos, dst, dst_pos, length);
}
/**
* Returns <code>true</code> if all elements in the specified array are in increasing order.
* This method is usefull in assertions.
*/
public static boolean isSorted(final byte[] array) {
for (int i = 1; i < array.length; i++) {
if (array[i] < array[i - 1]) {
return false;
}
}
return true;
}
/**
* Returns <code>true</code> if all elements in the specified array are in increasing order.
* This method is usefull in assertions.
*/
public static boolean isSorted(final short[] array) {
for (int i = 1; i < array.length; i++) {
if (array[i] < array[i - 1]) {
return false;
}
}
return true;
}
/**
* Returns <code>true</code> if all elements in the specified array are in increasing order.
* This method is usefull in assertions.
*/
public static boolean isSorted(final int[] array) {
for (int i = 1; i < array.length; i++) {
if (array[i] < array[i - 1]) {
return false;
}
}
return true;
}
/**
* Returns <code>true</code> if all elements in the specified array are in increasing order.
* This method is usefull in assertions.
*/
public static boolean isSorted(final long[] array) {
for (int i = 1; i < array.length; i++) {
if (array[i] < array[i - 1]) {
return false;
}
}
return true;
}
/**
* Returns <code>true</code> if all elements in the specified array are in increasing order.
* Since <code>NaN</code> values are unordered, they may appears anywhere in the array; they
* will be ignored. This method is usefull in assertions.
*/
public static boolean isSorted(final float[] array) {
int previous = 0;
for (int i = 1; i < array.length; i++) {
final float value = array[i];
if (value < array[previous]) {
return false;
}
if (!Float.isNaN(value)) {
previous = i;
}
}
return true;
}
/**
* Returns <code>true</code> if all elements in the specified array are in increasing order.
* Since <code>NaN</code> values are unordered, they may appears anywhere in the array; they
* will be ignored. This method is usefull in assertions.
*/
public static boolean isSorted(final double[] array) {
int previous = 0;
for (int i = 1; i < array.length; i++) {
final double value = array[i];
if (value < array[previous]) {
return false;
}
if (!Double.isNaN(value)) {
previous = i;
}
}
return true;
}
}
The table below shows all metrics for XArray.java.
| Metric | Value | Description | |
|---|---|---|---|
| BLOCKS | 66.00 | Number of blocks | |
| BLOCK_COMMENT | 60.00 | Number of block comment lines | |
| COMMENTS | 756.00 | Comment lines | |
| COMMENT_DENSITY | 4.78 | Comment density | |
| COMPARISONS | 18.00 | Number of comparison operators | |
| CYCLOMATIC | 65.00 | Cyclomatic complexity | |
| DECL_COMMENTS | 50.00 | Comments in declarations | |
| DOC_COMMENT | 696.00 | Number of javadoc comment lines | |
| ELOC | 158.00 | Effective lines of code | |
| EXEC_COMMENTS | 0.00 | Comments in executable code | |
| EXITS | 15.00 | Procedure exits | |
| FUNCTIONS | 47.00 | Number of function declarations | |
| HALSTEAD_DIFFICULTY | 49.21 | Halstead difficulty | |
| HALSTEAD_EFFORT | 0.00 | Halstead effort | |
| INTERFACE_COMPLEXITY | 201.00 | Interface complexity | |
| JAVA0001 | 0.00 | JAVA0001 Package name does not contain only lower case letters | |
| JAVA0002 | 0.00 | JAVA0002 Package name does not begin with a top level domain name or country code | |
| JAVA0003 | 0.00 | JAVA0003 Minimize use of on-demand (.*) imports | |
| JAVA0004 | 0.00 | JAVA0004 Unnecessary import from java.lang | |
| JAVA0005 | 0.00 | JAVA0005 Imports not in specified order | |
| JAVA0006 | 0.00 | JAVA0006 Empty finally block | |
| JAVA0007 | 0.00 | JAVA0007 Should not declare public field | |
| JAVA0008 | 0.00 | JAVA0008 Empty catch block | |
| JAVA0009 | 0.00 | JAVA0009 Protected member in final class | |
| JAVA0010 | 0.00 | JAVA0010 Non-instantiable class does not contain a non-private static member | |
| JAVA0011 | 0.00 | JAVA0011 Abstract class does not contain an abstract method | |
| JAVA0012 | 0.00 | JAVA0012 Non-constructor method with same name as declaring class | |
| JAVA0013 | 0.00 | JAVA0013 Non-blank final field is not static | |
| JAVA0014 | 0.00 | JAVA0014 Class with only static members has non-private constructor | |
| JAVA0015 | 0.00 | JAVA0015 Package class contains public nested type | |
| JAVA0016 | 0.00 | JAVA0016 Abstract class contains public constructor | |
| JAVA0017 | 0.00 | JAVA0017 Class name does not have required form | |
| JAVA0018 | 0.00 | JAVA0018 Method name does not have required form | |
| JAVA0019 | 0.00 | JAVA0019 Interface name does not have required form | |
| JAVA0020 | 0.00 | JAVA0020 Field name does not have required form | |
| JAVA0021 | 0.00 | JAVA0021 Interface method name does not have required form | |
| JAVA0022 | 0.00 | JAVA0022 Static final field name does not have required form | |
| JAVA0023 | 0.00 | JAVA0023 Empty finalize method | |
| JAVA0024 | 0.00 | JAVA0024 Empty class | |
| JAVA0025 | 0.00 | JAVA0025 Method override is empty | |
| JAVA0026 | 0.00 | JAVA0026 Finalize method with parameters | |
| JAVA0029 | 0.00 | JAVA0029 Private method not used | |
| JAVA0030 | 0.00 | JAVA0030 Private field not used | |
| JAVA0031 | 0.00 | JAVA0031 Case statement not properly closed | |
| JAVA0032 | 0.00 | JAVA0032 Switch statement missing default | |
| JAVA0033 | 0.00 | JAVA0033 default: not last case in switch statement | |
| JAVA0034 | 0.00 | JAVA0034 Missing braces in if statement | |
| JAVA0035 | 0.00 | JAVA0035 Missing braces in for statement | |
| JAVA0036 | 0.00 | JAVA0036 Missing braces in while statement | |
| JAVA0038 | 0.00 | JAVA0038 Non-case label in switch statement | |
| JAVA0039 | 0.00 | JAVA0039 Break statement with label | |
| JAVA0040 | 0.00 | JAVA0040 Switch statement contains N cases (maximum: M) | |
| JAVA0041 | 0.00 | JAVA0041 Nested synchronized block | |
| JAVA0042 | 0.00 | JAVA0042 Empty synchronized statement | |
| JAVA0043 | 0.00 | JAVA0043 Inner class does not use outer class | |
| JAVA0044 | 0.00 | JAVA0044 Serializable class with no instance variables | |
| JAVA0045 | 0.00 | JAVA0045 Serializable class with only transient fields | |
| JAVA0046 | 0.00 | JAVA0046 Name of class not derived from Exception ends with 'Exception' | |
| JAVA0047 | 0.00 | JAVA0047 Serializable class derives from invalid base class | |
| JAVA0048 | 0.00 | JAVA0048 Name of class derived from Exception does not end with 'Exception' | |
| JAVA0049 | 0.00 | JAVA0049 Nested block at depth N (maximum: M) | |
| JAVA0050 | 0.00 | JAVA0050 Class derives from java.lang.Error | |
| JAVA0051 | 0.00 | JAVA0051 Class derives from java.lang.RuntimeException | |
| JAVA0052 | 0.00 | JAVA0052 Class derives from java.lang.Throwable | |
| JAVA0053 | 0.00 | JAVA0053 Unused label | |
| JAVA0054 | 0.00 | JAVA0054 Inheritance depth N exceeds maximum M | |
| JAVA0055 | 0.00 | JAVA0055 Class should be interface | |
| JAVA0056 | 0.00 | JAVA0056 Unnecessary abstract modifier for interface or annotation | |
| JAVA0057 | 0.00 | JAVA0057 Unnecessary default constructor | |
| JAVA0058 | 0.00 | JAVA0058 Constructor calls super() | |
| JAVA0059 | 0.00 | JAVA0059 Method override only calls super() | |
| JAVA0061 | 0.00 | JAVA0061 Inaccessible member in anonymous class | |
| JAVA0062 | 0.00 | JAVA0062 Public class missing public member or protected constructor | |
| JAVA0063 | 0.00 | JAVA0063 Identifier name should not contain '$' | |
| JAVA0064 | 0.00 | JAVA0064 N variations of identifier name (maximum: M) | |
| JAVA0065 | 0.00 | JAVA0065 Unnecessary final modifier for method in final class | |
| JAVA0066 | 0.00 | JAVA0066 Unnecessary modifier for interface nested type | |
| JAVA0067 | 0.00 | JAVA0067 Array descriptor on identifier name | |
| JAVA0068 | 0.00 | JAVA0068 Modifiers not declared in recommended order | |
| JAVA0071 | 0.00 | JAVA0071 Strings compared with == | |
| JAVA0073 | 0.00 | JAVA0073 Integer division in floating-point context | |
| JAVA0074 | 0.00 | JAVA0074 Use of Object.notify() | |
| JAVA0075 | 0.00 | JAVA0075 Method parameter hides field | |
| JAVA0076 | 0.00 | JAVA0076 Use of magic number | |
| JAVA0077 | 0.00 | JAVA0077 Private field not used in declaring class | |
| JAVA0078 | 0.00 | JAVA0078 Floating point values compared with == | |
| JAVA0079 | 0.00 | JAVA0079 Use of instance to reference static member | |
| JAVA0080 | 0.00 | JAVA0080 Import declaration not used | |
| JAVA0081 | 0.00 | JAVA0081 Boolean literal in comparison | |
| JAVA0082 | 0.00 | JAVA0082 Unnecessary widening cast | |
| JAVA0083 | 0.00 | JAVA0083 Unnecessary instanceof test | |
| JAVA0084 | 0.00 | JAVA0084 Should use compound assignment operator | |
| JAVA0085 | 0.00 | JAVA0085 Use of sun.* class | |
| JAVA0087 | 0.00 | JAVA0087 Use of Thread.sleep() | |
| JAVA0089 | 0.00 | JAVA0089 Use of restricted package | |
| JAVA0092 | 0.00 | JAVA0092 Use of restricted type | |
| JAVA0093 | 0.00 | JAVA0093 Redundant assignment | |
| JAVA0094 | 0.00 | JAVA0094 Field hides a superclass field | |
| JAVA0095 | 0.00 | JAVA0095 Uninitialized private field | |
| JAVA0096 | 0.00 | JAVA0096 Field in nested class hides outer field | |
| JAVA0098 | 0.00 | JAVA0098 Minimize use of implicit field initializers | |
| JAVA0100 | 0.00 | JAVA0100 Class contains N non-final fields (maximum: M) | |
| JAVA0101 | 0.00 | JAVA0101 Unnecessary modifier for field in interface | |
| JAVA0102 | 0.00 | JAVA0102 Last statement in finalize() not super.finalize() | |
| JAVA0103 | 0.00 | JAVA0103 Explicit call to finalize() | |
| JAVA0104 | 0.00 | JAVA0104 finalize() only calls super.finalize() | |
| JAVA0105 | 0.00 | JAVA0105 Duplicate import declaration | |
| JAVA0106 | 0.00 | JAVA0106 Unnecessary import from current package | |
| JAVA0108 | 6.00 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| JAVA0109 | 0.00 | JAVA0109 Incorrect javadoc: no parameter 'parameter' | |
| JAVA0110 | 6.00 | JAVA0110 Incorrect javadoc: no @return tag | |
| JAVA0111 | 0.00 | JAVA0111 Incorrect javadoc: @return tag for void method | |
| JAVA0112 | 0.00 | JAVA0112 Incorrect javadoc: no exception 'exception' in throws | |
| JAVA0113 | 0.00 | JAVA0113 Incorrect javadoc: no @author tag | |
| JAVA0114 | 0.00 | JAVA0114 Incorrect javadoc: no @version tag | |
| JAVA0115 | 0.00 | JAVA0115 Incorrect javadoc: no @throws or @exception tag for 'exception' | |
| JAVA0116 | 1.00 | JAVA0116 Missing javadoc: field 'field' | |
| JAVA0117 | 0.00 | JAVA0117 Missing javadoc: method 'method' | |
| JAVA0118 | 0.00 | JAVA0118 Missing javadoc: type 'type' | |
| JAVA0119 | 0.00 | JAVA0119 Control variable changed within body of for loop | |
| JAVA0123 | 0.00 | JAVA0123 Use all three components of for loop | |
| JAVA0125 | 0.00 | JAVA0125 Continue statement with label | |
| JAVA0126 | 0.00 | JAVA0126 Method declares unchecked exception in throws | |
| JAVA0128 | 0.00 | JAVA0128 Public constructor in non-public class | |
| JAVA0130 | 0.00 | JAVA0130 Non-static method does not use instance fields | |
| JAVA0131 | 0.00 | JAVA0131 Compatible method does not override base | |
| JAVA0132 | 0.00 | JAVA0132 Method overload with compatible signature | |
| JAVA0133 | 0.00 | JAVA0133 Non-synchronized method overrides synchronized method | |
| JAVA0135 | 0.00 | JAVA0135 Only one of Object.equals and Object.hashCode defined: missing 'method' | |
| JAVA0136 | 1.00 | JAVA0136 N methods defined in class (maximum: M) | |
| JAVA0137 | 0.00 | JAVA0137 Non-abstract class missing constructor | |
| JAVA0138 | 0.00 | JAVA0138 N parameters defined for method (maximum: M) | |
| JAVA0139 | 0.00 | JAVA0139 Definition of main other than public static void main(java.lang.String[]) | |
| JAVA0141 | 0.00 | JAVA0141 Unnecessary modifier for method in interface | |
| JAVA0143 | 0.00 | JAVA0143 Synchronized method | |
| JAVA0144 | 0.00 | JAVA0144 Line exceeds maximum M characters | |
| JAVA0145 | 0.00 | JAVA0145 Tab character used in source file | |
| JAVA0150 | 0.00 | JAVA0150 java.lang.Error (or subclass) thrown | |
| JAVA0153 | 0.00 | JAVA0153 Inefficient conversion of integer to string | |
| JAVA0159 | 0.00 | JAVA0159 Inefficient conversion of string to integer | |
| JAVA0160 | 0.00 | JAVA0160 Method does not throw specified exception | |
| JAVA0161 | 0.00 | JAVA0161 Conditional wait() not in loop | |
| JAVA0163 | 0.00 | JAVA0163 Empty statement | |
| JAVA0165 | 0.00 | JAVA0165 Conflicting return statement in finally block | |
| JAVA0166 | 0.00 | JAVA0166 Generic exception caught | |
| JAVA0167 | 0.00 | JAVA0167 ThreadDeath not rethrown | |
| JAVA0169 | 0.00 | JAVA0169 Unnecessary catch block: exception 'exception' | |
| JAVA0170 | 0.00 | JAVA0170 Caught exception not derived from java.lang.Exception | |
| JAVA0171 | 0.00 | JAVA0171 Unused local variable | |
| JAVA0173 | 0.00 | JAVA0173 Unused method parameter | |
| JAVA0174 | 0.00 | JAVA0174 Assigned local variable never used | |
| JAVA0175 | 0.00 | JAVA0175 Successive assignment to variable | |
| JAVA0176 | 0.00 | JAVA0176 Local variable name does not have required form | |
| JAVA0177 | 0.00 | JAVA0177 Variable declaration missing initializer | |
| JAVA0179 | 0.00 | JAVA0179 Local variable hides visible field | |
| JAVA0233 | 0.00 | JAVA0233 Definition of serialVersionUID other than 'private static final long serialVersionUID' | |
| JAVA0234 | 0.00 | JAVA0234 Class is Serializable but does not define serialVersionUID | |
| JAVA0235 | 0.00 | JAVA0235 Class defines serialVersionUID but does not implement Serializable | |
| JAVA0236 | 0.00 | JAVA0236 Attempt to clone an object which does not implement Cloneable | |
| JAVA0237 | 0.00 | JAVA0237 Class implements Cloneable but does not have public clone method | |
| JAVA0238 | 0.00 | JAVA0238 Clone method does not call super.clone() | |
| JAVA0239 | 0.00 | JAVA0239 Class declares 'readObject' or 'writeObject' but does not implement Serializable | |
| JAVA0240 | 0.00 | JAVA0240 Serializable class which declares readObject or writeObject but not both | |
| JAVA0241 | 0.00 | JAVA0241 'readObject' or 'writeObject' should be declared private in Serializable class | |
| JAVA0242 | 0.00 | JAVA0242 Transient field in non-Serializable class | |
| JAVA0243 | 0.00 | JAVA0243 'readResolve' or 'writeReplace' should be declared private or protected | |
| JAVA0244 | 0.00 | JAVA0244 Field or method name in subclass differs only by case from inherited field or method | |
| JAVA0245 | 0.00 | JAVA0245 JUnit TestCase with non-trivial constructor | |
| JAVA0246 | 0.00 | JAVA0246 JUnit assertXXX statement missing message parameter | |
| JAVA0247 | 0.00 | JAVA0247 JUnit 'setUp()' and 'tearDown()' should call super method | |
| JAVA0248 | 0.00 | JAVA0248 JUnit method 'setUp' or 'tearDown' with incorrect signature | |
| JAVA0249 | 0.00 | JAVA0249 JUnit TestCase 'suite()' should be declared static | |
| JAVA0250 | 0.00 | JAVA0250 JUnit TestCase declares testXXX method with incorrect signature | |
| JAVA0251 | 0.00 | JAVA0251 Use '%n' for line breaks in printf/format for platform independence | |
| JAVA0252 | 0.00 | JAVA0252 'enum' is a Java 1.5 reserved word | |
| JAVA0253 | 0.00 | JAVA0253 Not all enum constants consumed in switch statement | |
| JAVA0254 | 0.00 | JAVA0254 Use enhanced for loop construct instead of Iterator | |
| JAVA0255 | 0.00 | JAVA0255 Result of method invocation not used | |
| JAVA0256 | 0.00 | JAVA0256 Assignment of external collection/array to field | |
| JAVA0257 | 0.00 | JAVA0257 Use of 'Constant Interface' anti-pattern | |
| JAVA0258 | 0.00 | JAVA0258 Implement Iterable for foreach compatibility | |
| JAVA0259 | 0.00 | JAVA0259 Return of collection/array field | |
| JAVA0260 | 0.00 | JAVA0260 Use 'enum' instead of Enumerated Type pattern | |
| JAVA0261 | 0.00 | JAVA0261 Use specialized Enum collection types | |
| JAVA0262 | 0.00 | JAVA0262 Use of char in integer context | |
| JAVA0263 | 0.00 | JAVA0263 Long literal ends with 'l' instead of 'L' | |
| JAVA0264 | 0.00 | JAVA0264 Integer math in long context - check for overflow | |
| JAVA0265 | 0.00 | JAVA0265 Use of Throwable.printStackTrace() | |
| JAVA0266 | 0.00 | JAVA0266 Use of System.out | |
| JAVA0267 | 0.00 | JAVA0267 Use of System.err | |
| JAVA0269 | 0.00 | JAVA0269 Contents of StringBuffer never used | |
| JAVA0270 | 0.00 | JAVA0270 Use Java 5.0 enhanced for loop construct to iterate over all elements in an array | |
| JAVA0271 | 0.00 | JAVA0271 Minimize use of on-demand (.*) static imports | |
| JAVA0272 | 0.00 | JAVA0272 Thread.run() called | |
| JAVA0273 | 0.00 | JAVA0273 Non-final derivative of Thread calls start() in constructor | |
| JAVA0274 | 0.00 | JAVA0274 Serializable class has a synchronized readObject() | |
| JAVA0275 | 0.00 | JAVA0275 Serializable class has a synchronized writeObject() and no other synchronized methods | |
| JAVA0276 | 0.00 | JAVA0276 Unnecessary use of String constructor | |
| JAVA0277 | 0.00 | JAVA0277 Iterator.next() implementation does not throw NoSuchElementException | |
| JAVA0278 | 0.00 | JAVA0278 Unnecessary use of Boolean constructor | |
| JAVA0279 | 0.00 | JAVA0279 Serialization method readObject or readObjectNoData calls an overridable method | |
| JAVA0280 | 0.00 | JAVA0280 IllegalMonitorStateException caught | |
| JAVA0281 | 0.00 | JAVA0281 Iterator.next() not called in loop | |
| JAVA0282 | 0.00 | JAVA0282 Call to Iterator.next() in loop which does not test Iterator.hasNext() | |
| JAVA0283 | 0.00 | JAVA0283 Control variable not updated in loop body | |
| JAVA0284 | 0.00 | JAVA0284 Explicit garbage collection | |
| JAVA0285 | 0.00 | JAVA0285 Dereference of potentially null variable | |
| JAVA0286 | 0.00 | JAVA0286 Dereference of null variable | |
| JAVA0287 | 0.00 | JAVA0287 Unnecessary null check | |
| JAVA0288 | 0.00 | JAVA0288 Inconsistent null check | |
| LINES | 1037.00 | Number of lines in the source file | |
| LINE_COMMENT | 0.00 | Number of line comments | |
| LOC | 223.00 | Lines of code | |
| LOGICAL_LINES | 93.00 | Number of statements | |
| LOOPS | 6.00 | Number of loops | |
| NEST_DEPTH | 3.00 | Maximum nesting depth | |
| OPERANDS | 583.00 | Number of operands | |
| OPERATORS | 1672.00 | Number of operators | |
| PARAMS | 136.00 | Number of formal parameter declarations | |
| PROGRAM_LENGTH | 2255.00 | Halstead program length | |
| PROGRAM_VOCAB | 270.00 | Halstead program vocabulary | |
| PROGRAM_VOLUME | 0.00 | Halstead program volume | |
| RETURNS | 65.00 | Number of return points from functions | |
| SIZE | 49459.00 | Size of the file in bytes | |
| UNIQUE_OPERANDS | 231.00 | Number of unique operands | |
| UNIQUE_OPERATORS | 39.00 | Number of unique operators | |
| WHITESPACE | 58.00 | Number of whitespace lines | |