}

    /**
     * Encodes a small integer (1 byte) in NDR format.
     *
     * @param s the small integer value to encode
     */
    public void enc_ndr_small(final int s) {
        buf[index] = (byte) (s & 0xFF);
        advance(1);
    }

    /**
     * Decodes a small integer (1 byte) from NDR format.
     *
     * @return the decoded small integer value
     */

      Collection<Integer> indexes, int scale, double[] dataset);

  static double getMinValue(double[] array, int from) {
    // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the
    // method signature: we always search to the end of the array.
    int min = from;
    for (int i = from + 1; i < array.length; i++) {
      if (array[min] > array[i]) {
        min = i;
      }

	},
}

var internal32KByteBuffer = bpool.Pool[*[]byte]{
	New: func() *[]byte {
		m := make([]byte, 0, biggerBufMin)
		return &m
	},
}

// GetByteBuffer can be replaced with a function that returns a small
// byte buffer.
// When replacing PutByteBuffer should also be replaced
// There is no minimum size.
var GetByteBuffer = func() []byte {
	b := *internalByteBuffer.Get()
	return b[:0]
}

/**
 * Split a list of elements into nearly even sublist. If an element is too large, largeElementSplitFunction will be used to split the large element into several smaller pieces;
 * if some elements are too small, they will be aggregated by smallElementAggregateFunction.
 *
 * @param list the list to split, must be ordered by size desc
 * @param toIntFunction the function used to map the element to its "size"

    protected CrawlingConfigHelper crawlingConfigHelper;

    // ===================================================================================
    //                                                                        Small Helper
    //                                                                        ============

    /**
     * Sets up HTML data for admin pages.
     * <p>

import java.util.Optional;

import org.junit.jupiter.api.DisplayName;
import org.junit.jupiter.api.Test;

/**
 * Tests for {@link DosError}.  Since {@link DosError} only contains
 * constants, the tests exercise the data and small helper logic in this
 * test class.
 */
public class DosErrorTest {
    private static Optional<Integer> findNtStatus(int dosErrorCode) {

import static org.mockito.Mockito.when;

import org.junit.jupiter.api.DisplayName;
import org.junit.jupiter.api.Nested;
import org.junit.jupiter.api.Test;

/**
 * Unit tests for {@link SmbFileFilter}. The filter interface is small; the
 * tests focus on the contract that implementations should honour and the
 * interaction with {@link SmbFile} instances. The tests make heavy use of
 * Mockito to guarantee that implementation classes do not inadvertently

        byte[] buffer = new byte[4];

        // Set error code to 0
        setErrorCode(response, 0);

        // ArrayIndexOutOfBoundsException is thrown when buffer is too small
        assertThrows(ArrayIndexOutOfBoundsException.class, () -> {
            response.readDataWireFormat(buffer, 0, buffer.length);
        });
    }

    @Test
    void testEngineDigestWithInsufficientBuffer() {
        // Test engineDigest with buffer too small
        HMACT64 hmac = new HMACT64(TEST_KEY);
        hmac.engineUpdate(TEST_DATA, 0, TEST_DATA.length);

        byte[] buffer = new byte[10];
        // Should throw exception when buffer is too small
        assertThrows(IllegalStateException.class, () -> hmac.engineDigest(buffer, 0, 10));
    }

    @Test

for idx in {1..10}; do
	# generate random nr of blocks
	COUNT=$((RANDOM % 100 + 100))
	# generate random content
	dd if=/dev/urandom bs=50K count="${COUNT}" of="${SRC_DIR}"/file"$idx"
done

# create small object that will be inlined into xl.meta
dd if=/dev/urandom bs=50K count=1 of="${INLINED_DIR}"/inlined

if ./mc cp --quiet --recursive "${SRC_DIR}/" "${ALIAS_NAME}"/"${BUCKET}"/initial-data/; then