assertNotNull(security1, "Security ACEs should not be null");
            assertNotNull(security2, "Security ACEs with resolve should not be null");
            assertNotNull(shareSecurity, "Share security ACEs should not be null");
            assertEquals(1, security1.length, "Should return expected number of ACEs");
            assertEquals(1, security2.length, "Should return expected number of ACEs");

            throw new SMBProtocolDecodingException("Invalid negotiate context count: " + negotiateContextCount + " (must be 0-100)");
        }

        bufferIndex += 4;

        // Validate sufficient buffer space for server GUID and capabilities
        if (buffer.length < bufferIndex + 16 + 4 + 4 + 4 + 4) {
            throw new SMBProtocolDecodingException("Buffer too small for server GUID and capabilities section");
        }

    /**
     * Happy-path: a filter that accepts any name.
     */
    @ParameterizedTest
    @DisplayName("accepts any non-null/any string")
    @ValueSource(strings = { "file.txt", "data.DAT", "a", "x.y.z", "  spaced  " })
    void acceptsAnyNameReturnsTrue(String input) throws Exception {
        SmbFilenameFilter filter = (dir, name) -> true;

        boolean result = filter.accept(mockDir, input);

     *
     * @return the buffer capacity
     */
    public int getCapacity() {
        return buf.length - start;
    }

    /**
     * Returns the available space at the tail of the buffer.
     *
     * @return the available tail space
     */
    public int getTailSpace() {
        return buf.length - index;
    }

    /**
     * Returns the underlying byte buffer.
     *

import org.codelibs.fess.util.ComponentUtil;

/**
 * Job for purging expired thumbnail files from the system.
 * This job removes thumbnail files that have exceeded their configured expiration time
 * to prevent disk space from being consumed by old thumbnails.
 */
public class PurgeThumbnailJob {
    /** Logger instance for this class */
    private static final Logger logger = LogManager.getLogger(PurgeThumbnailJob.class);

    /**

  }

  /**
   * Returns {@code n!}, that is, the product of the first {@code n} positive integers, or {@code 1}
   * if {@code n == 0}.
   *
   * <p><b>Warning:</b> the result takes <i>O(n log n)</i> space, so use cautiously.
   *
   * <p>This uses an efficient binary recursive algorithm to compute the factorial with balanced
   * multiplies. It also removes all the 2s from the intermediate products (shifting them back in at

  grep -v "twine" $REQUIREMENTS > requirements_without_twine.txt
  REQUIREMENTS=requirements_without_twine.txt
fi

# Disable the cache dir to save image space, and install packages

      <match value="#EXTM3U" type="string" offset="0"/>
    </magic>
  </mime-type>
  <mime-type type="application/vnd.apple.pages">
    <root-XML localName="document" namespaceURI="http://developer.apple.com/namespaces/sl" />
    <sub-class-of type="application/vnd.apple.iwork" />
    <glob pattern="*.pages"/>
  </mime-type>
  <mime-type type="application/vnd.apple.numbers">

// This input was created by taking the instruction productions in
// the old assembler's (8a's) grammar and hand-writing complete
// instructions for each rule, to guarantee we cover the same space.

#include "../../../../../runtime/textflag.h"

TEXT foo(SB), DUPOK|NOSPLIT, $0

// LTYPE1 nonrem	{ outcode(int($1), &$2); }
	SETCC	AX
	SETCC	foo+4(SB)

// LTYPE2 rimnon	{ outcode(int($1), &$2); }
	DIVB	AX
	DIVB	foo+4(SB)
	PUSHL	$foo+4(SB)

    // deal with camel conversion
    StringBuilder out = null;
    int i = 0;
    int j = -1;
    while ((j = wordBoundary.indexIn(s, ++j)) != -1) {
      if (i == 0) {
        // include some extra space for separators
        out = new StringBuilder(s.length() + 4 * format.wordSeparator.length());
        out.append(format.normalizeFirstWord(s.substring(i, j)));
      } else {