}

    /**
     * @throws Exception
     */
    @Test
    public void testPerformance() throws Exception {
        for (int j = 0; j < 3; ++j) {
            final int num = 100000;
            final Map<String, String> hmap = new HashMap<String, String>();
            final Map<String, String> cimap = new CaseInsensitiveMap<String>();

            long start = System.currentTimeMillis();

	exit 1
fi

./mc cp /tmp/data/file_1.txt sitea/bucket/marker_new
./mc rm sitea/bucket/marker_new

sleep 12s ## sleep for 12s idea is that we give 100ms per object.

./mc ls -r --versions sitea/bucket >/tmp/sitea.txt
./mc ls -r --versions siteb/bucket >/tmp/siteb.txt

out=$(diff -qpruN /tmp/sitea.txt /tmp/siteb.txt)
ret=$?
if [ $ret -ne 0 ]; then

-h | display help dialog

## Benchmarks

Obligatory benchmarks performed on files with arrays of objects, where the decoded objects are to be extracted.

Two file sizes are used -- regular (1.6mb, 1000 objects) and large (128mb, 100000 objects)

input size | lib | MB/s | Allocated
--- | --- | --- | ---
regular | standard | 97 | 3.6MB
regular | jstream | 175 | 2.1MB
large | standard | 92 | 305MB
large | jstream | 404 | 69MB

                                               value="${f:h(sortOrder)}" class="form-control"
                                               min="0" max="100000">
                                    </div>
                                </div>
                                <div class="form-group row">

        long[] testTimes = { 0L, 1000L, 1500000000000L };
        byte[] buffer = new byte[4];

        for (long time : testTimes) {
            SMBUtil.writeUTime(time, buffer, 0);
            long readTime = SMBUtil.readUTime(buffer, 0);

            // Account for precision loss (milliseconds to seconds conversion)
            assertEquals((time / 1000L) * 1000L, readTime);
        }
    }

    @Test

                Arguments.of(999L * 1000L * 1000L, "999 MB"),
                Arguments.of(1000L * 1000L * 1000L, "1.0 GB"),
                Arguments.of(5500L * 1000L * 1000L, "5.5 GB"),
                Arguments.of(10L * 1000L * 1000L * 1000L, "10 GB"),
                Arguments.of(15L * 1000L * 1000L * 1000L, "15 GB"),
                Arguments.of(1000L * 1000L * 1000L * 1000L, "1000 GB"));
    }

                                               value="${f:h(sortOrder)}" class="form-control"
                                               min="0" max="100000">
                                    </div>
                                </div>
                            </div>
                            <div class="card-footer">

        // Set security buffer length to excessive size (> 64KB)
        SMBUtil.writeInt2(128, buffer, 56); // Security buffer offset
        // writeInt2(100000) will truncate to 100000 & 0xFFFF = 34464
        SMBUtil.writeInt2(100000, buffer, 58); // This becomes 34464 due to 16-bit truncation

        // Since 34464 is within the 16-bit range but could still be considered excessive for security buffer,

        final long start2 = System.nanoTime();
        controller.delayBeforeProcessing();
        final long elapsed2 = (System.nanoTime() - start2) / 1000000;
        assertTrue("Second access should delay at least 100ms", elapsed2 >= 90);
    }

    /**
     * Test that cache is thread-safe with concurrent access
     */
    public void test_cacheThreadSafety() {
        final int numTasks = 50;

    assertEscaping(e, "%7F", '\u007f'); // del
    assertEscaping(e, "%C2%80", '\u0080'); // xx-00010,x-000000
    assertEscaping(e, "%DF%BF", '\u07ff'); // xx-11111,x-111111
    assertEscaping(e, "%E0%A0%80", '\u0800'); // xxx-0000,x-100000,x-00,0000
    assertEscaping(e, "%EF%BF%BF", '\uffff'); // xxx-1111,x-111111,x-11,1111
    assertUnicodeEscaping(e, "%F0%90%80%80", '\uD800', '\uDC00');
    assertUnicodeEscaping(e, "%F4%8F%BF%BF", '\uDBFF', '\uDFFF');