Pass the correct capacity in # of entries when creating a CompactHashStore from a Hash literal

Author: eregon

src/main/java/org/truffleruby/core/hash/HashLiteralNode.java

@@ -30,6 +30,10 @@ protected HashLiteralNode(RubyNode[] keyValues) {
         this.keyValues = keyValues;
     }
 
+    protected int getNumberOfEntries() {
+        return keyValues.length >> 1;
+    }
+
     public static HashLiteralNode create(RubyNode[] keyValues, RubyLanguage language) {
         if (keyValues.length == 0) {
             return new EmptyHashStore.EmptyHashLiteralNode();

src/main/java/org/truffleruby/core/hash/library/BucketsHashStore.java

@@ -578,7 +578,7 @@ public static final class BucketHashLiteralNode extends HashLiteralNode {
 
         public BucketHashLiteralNode(RubyNode[] keyValues) {
             super(keyValues);
-            bucketsCount = growthCapacityGreaterThan(keyValues.length / 2);
+            bucketsCount = growthCapacityGreaterThan(getNumberOfEntries());
         }
 
         @ExplodeLoop

src/main/java/org/truffleruby/core/hash/library/CompactHashStore.java

@@ -628,18 +628,18 @@ public CompactHashLiteralNode(RubyNode[] keyValues) {
         @ExplodeLoop
         @Override
         public Object execute(VirtualFrame frame) {
-            CompactHashStore store = new CompactHashStore(keyValues.length);
+            CompactHashStore store = new CompactHashStore(getNumberOfEntries());
             RubyHash hash = new RubyHash(coreLibrary().hashClass,
                     getLanguage().hashShape,
                     getContext(),
                     store,
                     0,
                     false);
+
             for (int i = 0; i < keyValues.length; i += 2) {
                 Object key = keyValues[i].execute(frame);
-                Object val = keyValues[i + 1].execute(frame);
-
-                hashes.set(store, hash, key, val, false);
+                Object value = keyValues[i + 1].execute(frame);
+                hashes.set(store, hash, key, value, false);
             }
             return hash;
         }