You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@pdfbox.apache.org by le...@apache.org on 2024/06/11 17:24:41 UTC
svn commit: r1918262 - /pdfbox/branches/2.0/pdfbox/src/main/java/org/apache/pdfbox/util/SmallMap.java
Author: lehmi
Date: Tue Jun 11 17:24:41 2024
New Revision: 1918262
URL: http://svn.apache.org/viewvc?rev=1918262&view=rev
Log:
PDFBOX-5660: use number of elements to initialize LinkedHashSet
Modified:
pdfbox/branches/2.0/pdfbox/src/main/java/org/apache/pdfbox/util/SmallMap.java
Modified: pdfbox/branches/2.0/pdfbox/src/main/java/org/apache/pdfbox/util/SmallMap.java
URL: http://svn.apache.org/viewvc/pdfbox/branches/2.0/pdfbox/src/main/java/org/apache/pdfbox/util/SmallMap.java?rev=1918262&r1=1918261&r2=1918262&view=diff
==============================================================================
--- pdfbox/branches/2.0/pdfbox/src/main/java/org/apache/pdfbox/util/SmallMap.java (original)
+++ pdfbox/branches/2.0/pdfbox/src/main/java/org/apache/pdfbox/util/SmallMap.java Tue Jun 11 17:24:41 2024
@@ -281,7 +281,7 @@ public class SmallMap<K, V> implements M
return Collections.emptySet();
}
- Set<K> keys = new LinkedHashSet<K>();
+ Set<K> keys = new LinkedHashSet<K>(mapArr.length >> 1);
for (int kIdx = 0; kIdx < mapArr.length; kIdx+=2)
{
keys.add((K)mapArr[kIdx]);
@@ -377,7 +377,7 @@ public class SmallMap<K, V> implements M
return Collections.emptySet();
}
- Set<java.util.Map.Entry<K, V>> entries = new LinkedHashSet<Entry<K, V>>();
+ Set<java.util.Map.Entry<K, V>> entries = new LinkedHashSet<Entry<K, V>>(mapArr.length >> 1);
for (int kIdx = 0; kIdx < mapArr.length; kIdx+=2)
{
entries.add(new SmallMapEntry(kIdx));