Remove flaky wall-clock timing assertion from MultiKeyMap typed array test

The hard 100ms threshold caused CI failures on slower runners (293ms observed).
Correctness assertions for all 1000 entries are retained.

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>

Author: jdereg

src/test/java/com/cedarsoftware/util/MultiKeyMapTypedArrayProcessingTest.java

@@ -202,18 +202,12 @@ void testTypedArrayProcessingPerformance() {
             map.put(array, "value" + i);
         }
 
-        // Test lookup performance - should use fast typed processing
-        long startTime = System.nanoTime();
+        // Test lookup correctness with many entries
         for (int i = 0; i < 1000; i++) {
             int[] lookupArray = {i, i + 1, i + 2};
             String result = map.get(lookupArray);
             assertEquals("value" + i, result);
         }
-        long endTime = System.nanoTime();
-        
-        // Performance test should complete reasonably quickly
-        long durationMs = (endTime - startTime) / 1_000_000;
-        assertTrue(durationMs < 100, "int[] processing should be fast, took " + durationMs + "ms");
 
         assertEquals(1000, map.size());
     }