while (i > 0) {
            buf[index - i] = value;
            i--;
        }
        return n;
    }

    /**
     * Writes an octet array to the buffer.
     *
     * @param b the byte array to write
     * @param i the starting index in the array
     * @param l the number of bytes to write
     */
    public void writeOctetArray(final byte[] b, final int i, final int l) {

    for (int i = 0; i < 256; i++) {
      key[i] = (byte) i;
      int seed = 256 - i;
      byte[] hash = hashFunction.hash(Arrays.copyOf(key, i), seed);
      System.arraycopy(hash, 0, hashes, i * hashBytes, hash.length);
    }

    // Then hash the result array
    byte[] result = hashFunction.hash(hashes, 0);

    // interpreted in little-endian order.

 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.thumbnail.impl;

import java.io.File;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

import org.codelibs.fess.unit.UnitFessTestCase;

public class CommandGeneratorTest extends UnitFessTestCase {

    private CommandGenerator generator;

                final Object[] values = Arrays.copyOf(oldValues, oldValues.length + newValues.length);
                for (int i = 0; i < newValues.length; i++) {
                    values[values.length - 1 + i] = newValues[i];
                }
                dataMap.put(key, values);
            } else {
                final Object[] values = Arrays.copyOf(oldValues, oldValues.length + 1);

            rpcUuid.node = new byte[6]; // Empty node array

            // Act
            UUID uuid = new UUID(rpcUuid);

            // Assert
            assertNotNull(uuid.node);
            assertEquals(6, uuid.node.length);
            assertArrayEquals(new byte[6], uuid.node, "Empty node array should be copied");
        }
    }

    @Nested

  @SuppressWarnings("DoNotCall")
  public void testRemove() {
    String[] array = {"a", "b", "c"};

    Iterator<String> iterator =
        new UnmodifiableIterator<String>() {
          int i;

          @Override
          public boolean hasNext() {
            return i < array.length;
          }

          @Override
          public String next() {
            if (!hasNext()) {

 * either express or implied. See the License for the specific language
 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.util;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Map;

/**
 * A specialized ArrayList for storing document data with additional metadata.
 * This class extends ArrayList to hold document maps while tracking content size

    }

    /**
     * Simplifies the array.
     *
     * @param values The array.
     * @return The simplified array.
     */
    protected static String[] simplifyArray(final String[] values) {
        return stream(values).get(stream -> stream.filter(StringUtil::isNotBlank).distinct().toArray(n -> new String[n]));
    }

    /**
     * Returns the parameter value array.
     *
     * @param request The request.

      throws BucketOverflowException {
    /*
     * The cast is safe: n==entryArray.length means that we have filled the whole array with Entry
     * instances, in which case it is safe to cast it from an array of nullable entries to an array
     * of non-null entries.
     */
    @SuppressWarnings("nullness")
    Entry<K, V>[] entries =

    /**
     * Returns an array of {@link MethodDesc}.
     *
     * @param methodName
     *            The method name. Must not be {@literal null} or empty string
     * @return An array of {@link MethodDesc}
     */
    MethodDesc[] getMethodDescs(String methodName);

    /**
     * Returns an array of method names.
     *
     * @return An array of method names
     */