aboutsummaryrefslogtreecommitdiffstats
path: root/src/java/com/jogamp/common/util/ArrayHashSet.java
diff options
context:
space:
mode:
authorHarvey Harrison <[email protected]>2013-10-17 21:06:56 -0700
committerHarvey Harrison <[email protected]>2013-10-17 21:06:56 -0700
commit791a2749886f02ec7b8db25bf8862e8269b96da5 (patch)
treec9be31d0bbbe8033b4a6a0cfad91a22b6575ced1 /src/java/com/jogamp/common/util/ArrayHashSet.java
parent5b77e15500b7b19d35976603dd71e8b997b2d8ea (diff)
gluegen: remove trailing whitespace
Signed-off-by: Harvey Harrison <[email protected]>
Diffstat (limited to 'src/java/com/jogamp/common/util/ArrayHashSet.java')
-rw-r--r--src/java/com/jogamp/common/util/ArrayHashSet.java14
1 files changed, 7 insertions, 7 deletions
diff --git a/src/java/com/jogamp/common/util/ArrayHashSet.java b/src/java/com/jogamp/common/util/ArrayHashSet.java
index ed3590a..a125580 100644
--- a/src/java/com/jogamp/common/util/ArrayHashSet.java
+++ b/src/java/com/jogamp/common/util/ArrayHashSet.java
@@ -35,7 +35,7 @@ import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
-/**
+/**
* Hashed ArrayList implementation of the List and Collection interface.
*
* Implementation properties are:
@@ -80,12 +80,12 @@ public class ArrayHashSet<E>
map = new HashMap<E,E>(initialCapacity);
data = new ArrayList<E>(initialCapacity);
}
-
+
public ArrayHashSet(int initialCapacity, float loadFactor) {
map = new HashMap<E,E>(initialCapacity, loadFactor);
data = new ArrayList<E>(initialCapacity);
}
-
+
//
// Cloneable
//
@@ -102,15 +102,15 @@ public class ArrayHashSet<E>
return newObj;
}
-
+
/** Returns this object ordered ArrayList. Use w/ care, it's not a copy. */
public final ArrayList<E> getData() { return data; }
/** Returns this object hash map. Use w/ care, it's not a copy. */
public final HashMap<E,E> getMap() { return map; }
-
+
@Override
public final String toString() { return data.toString(); }
-
+
//
// Collection
//
@@ -408,7 +408,7 @@ public class ArrayHashSet<E>
* Identity method allowing to get the identical object, using the internal hash map.
* <br>
* This is an O(1) operation.
- *
+ *
* @param key hash source to find the identical Object within this list
* @return object from this list, identical to the given <code>key</code> hash code,
* or null if not contained