summaryrefslogtreecommitdiff
path: root/libjava/classpath/java/util/LinkedHashSet.java
diff options
context:
space:
mode:
Diffstat (limited to 'libjava/classpath/java/util/LinkedHashSet.java')
-rw-r--r--libjava/classpath/java/util/LinkedHashSet.java2
1 files changed, 1 insertions, 1 deletions
diff --git a/libjava/classpath/java/util/LinkedHashSet.java b/libjava/classpath/java/util/LinkedHashSet.java
index 03b9556062c..2caebaf9306 100644
--- a/libjava/classpath/java/util/LinkedHashSet.java
+++ b/libjava/classpath/java/util/LinkedHashSet.java
@@ -62,7 +62,7 @@ import java.io.Serializable;
* without needing the overhead of <code>TreeSet</code>.
* <p>
*
- * Under ideal circumstances (no collisions), LinkedHashSet offers O(1)
+ * Under ideal circumstances (no collisions), LinkedHashSet offers O(1)
* performance on most operations. In the worst case (all elements map
* to the same hash code -- very unlikely), most operations are O(n).
* <p>