protected int maxRedirectCount;

    /** Executor service for concurrent processing of file operations. */
    private final ExecutorService executor;

    /** Timeout in seconds for executor service termination during shutdown. */
    private int executorTerminationTimeout = 300;

    /**
     * Constructs a new FileListIndexUpdateCallbackImpl with the specified parameters.
     *

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

import org.codelibs.fess.annotation.Secured;
import org.codelibs.fess.app.web.admin.accesstoken.AdminAccesstokenAction;
import org.codelibs.fess.app.web.admin.backup.AdminBackupAction;
import org.codelibs.fess.app.web.admin.badword.AdminBadwordAction;

        // Create first index with alias
        client.admin().indices().prepareCreate(index1).addAlias(new Alias(aliasName)).execute().actionGet();

        // Create second index and add to same alias
        client.admin().indices().prepareCreate(index2).execute().actionGet();
        client.admin().indices().prepareAliases().addAlias(index2, aliasName).execute().actionGet();

        assertDoesNotThrow(() -> outputStream.write(data, 0, 10)); // valid - will consume first mock (10)
        assertDoesNotThrow(() -> outputStream.write(data, 5, 5)); // valid - will consume second mock (5)
    }

    @Test
    void testAppendMode() throws IOException, CIFSException {
        // Given
        when(mockTreeHandle.isSMB2()).thenReturn(true);

    input_tensors->emplace_back(node, idx);

    const auto& iter = input_nodes->find(node);
    if (iter == input_nodes->end()) {
      input_nodes->insert({node, {idx}});
    } else {
      auto& indices = iter->second;
      if (std::find(indices.begin(), indices.end(), idx) != indices.end()) {
        return InvalidArgument("TF_Output ", node->name(), ":", idx,
                               " appears more than once in the input list");

        // Encode from first instance
        byte[] encodedBuffer = new byte[8];
        firstInstance.encode(encodedBuffer, 0);

        // Decode into second instance
        FileInternalInfo secondInstance = new FileInternalInfo();
        secondInstance.decode(encodedBuffer, 0, encodedBuffer.length);

        // Verify both instances have same values

    long cacheByteCount = 1024L * 1024L * 100L;

    Cache cache = new Cache(new File(args[0]), cacheByteCount);
    OkHttpClient client = new OkHttpClient.Builder()
        .cache(cache)
        .callTimeout(5, TimeUnit.SECONDS)
        .build();

    Crawler crawler = new Crawler(client, queueLimit, hostLimit);
    crawler.queue.add(HttpUrl.get(args[1]));
    crawler.parallelDrainQueue(threadCount);
  }

	return s, nil
}

// cleanup ".trash/" folder every 5m minutes with sufficient sleep cycles, between each
// deletes a dynamic sleeper is used with a factor of 10 ratio with max delay between
// deletes to be 2 seconds.
func (s *erasureSets) cleanupDeletedObjects(ctx context.Context) {
	timer := time.NewTimer(globalAPIConfig.getDeleteCleanupInterval())
	defer timer.Stop()

	for {
		select {
		case <-ctx.Done():
			return

        assertNotNull(output);
        assertTrue(output.contains("00000:"));
        assertTrue(output.contains("00010:")); // Second line offset

        // Verify first line contains bytes 0-15
        assertTrue(output.contains(" 00 01 02 03 04 05 06 07 08 09 0A 0B 0C 0D 0E 0F"));
        // Verify second line contains bytes 16-31
        assertTrue(output.contains(" 10 11 12 13 14 15 16 17 18 19 1A 1B 1C 1D 1E 1F"));
    }

        int cleaned = forceCleanup();

        // Shutdown executor
        cleanupExecutor.shutdown();
        try {
            if (!cleanupExecutor.awaitTermination(5, TimeUnit.SECONDS)) {
                cleanupExecutor.shutdownNow();
            }
        } catch (InterruptedException e) {
            cleanupExecutor.shutdownNow();
            Thread.currentThread().interrupt();
        }