handled java compiler warnings

Deflaktor · Sep 7, 2014 · cecaebf · cecaebf
1 parent 8ec870f
commit cecaebf
Show file tree

Hide file tree

Showing 8 changed files with 69 additions and 4 deletions.
diff --git a/.idea/inspectionProfiles/Project_Default.xml b/.idea/inspectionProfiles/Project_Default.xml
diff --git a/.idea/inspectionProfiles/profiles_settings.xml b/.idea/inspectionProfiles/profiles_settings.xml
diff --git a/core/build.gradle b/core/build.gradle
@@ -12,8 +12,10 @@ jar {
 
 task apiDocs(type: Javadoc) {
 	source = sourceSets.main.allJava
-	options.addStringOption "bottom", "Copyright &copy; 2013-2014 Matthew D. Michelotti"
+	//options.addStringOption "bottom", "Copyright &copy; 2013-2014 Matthew D. Michelotti"
 	options.setWindowTitle "Collider $version API"
+	options.setBottom "Copyright &copy; 2013-2014 Matthew D. Michelotti"
+	options.setDocTitle "Collider $version API"
 }
 
 task sourcesJar(type: Jar, dependsOn: classes) {

diff --git a/core/src/com/matthewmichelotti/collider/Collider.java b/core/src/com/matthewmichelotti/collider/Collider.java
@@ -31,8 +31,6 @@
  * @author Matthew Michelotti
  */
 
-//TODO check for Java warnings
-
 public final class Collider {
 	private Field field;
 	private double time = 0.0;

diff --git a/core/src_gdx_util/com/matthewmichelotti/collider/Array.java b/core/src_gdx_util/com/matthewmichelotti/collider/Array.java
@@ -53,6 +53,8 @@
 /** A resizable, ordered or unordered array of objects. If unordered, this class avoids a memory copy when removing elements (the
  * last element is moved to the removed element's position).
  * @author Nathan Sweet */
+//MM: added suppress warnings unchecked, unused
+@SuppressWarnings({"unchecked", "unused"})
 //MM: changed class from public to package-private
 class Array<T> implements Iterable<T> {
 	/** Provides direct access to the underlying array. If the Array's generic type is not Object, this field may only be accessed

diff --git a/core/src_gdx_util/com/matthewmichelotti/collider/LongMap.java b/core/src_gdx_util/com/matthewmichelotti/collider/LongMap.java
@@ -50,6 +50,8 @@
  * depending on hash collisions. Load factors greater than 0.91 greatly increase the chances the map will have to rehash to the
  * next higher POT size.
  * @author Nathan Sweet */
+//MM: added suppress warnings unchecked, unused
+@SuppressWarnings({"unchecked", "unused"})
 //MM: changed class from public to package-private
 class LongMap<V> implements Iterable<LongMap.Entry<V>> {
 	private static final int PRIME1 = 0xbe1f14b1;

diff --git a/core/src_gdx_util/com/matthewmichelotti/collider/ObjectSet.java b/core/src_gdx_util/com/matthewmichelotti/collider/ObjectSet.java
@@ -54,6 +54,8 @@
  * hash collisions. Load factors greater than 0.91 greatly increase the chances the set will have to rehash to the next higher POT
  * size.
  * @author Nathan Sweet */
+//MM: added suppress warnings unchecked, unused
+@SuppressWarnings({"unchecked", "unused"})
 //MM: changed class from public to package-private
 class ObjectSet<T> implements Iterable<T> {
 	private static final int PRIME1 = 0xbe1f14b1;

diff --git a/core/src_gdx_util/com/matthewmichelotti/collider/RandomXS128.java b/core/src_gdx_util/com/matthewmichelotti/collider/RandomXS128.java
@@ -172,7 +172,7 @@ public boolean nextBoolean () {
 	 * This implementation uses {@link #nextLong()} internally. */
 	@Override
 	public void nextBytes (final byte[] bytes) {
-		int n = 0;
+		int n; // = 0; //MM: commented this assignment
 		int i = bytes.length;
 		while (i != 0) {
 			n = i < 8 ? i : 8; // min(i, 8);