when(mockTree.areSignaturesActive()).thenReturn(false);
            when(mockConfig.getReceiveBufferSize()).thenReturn(0x200000); // large to allow big block size
            when(mockTree.getReceiveBufferSize()).thenReturn(0x200000);
            when(mockTree.getMaximumBufferSize()).thenReturn(0x200000);

            // Make TYPE_FILESYSTEM path, not named pipe

        },

        /**
         * Show suggestion box and update ARIA attributes
         */
        showSuggestionBox: function () {
          $boxElement.css("display", "block");
          $textArea.attr("aria-expanded", "true");
        },

        /**
         * Create and display the autocomplete suggestion list
         */
        createAutoCompleteList: function (obj) {

      }

    @JvmName("-addInterceptor") // Prefix with '-' to prevent ambiguous overloads from Java.
    inline fun addInterceptor(crossinline block: (chain: Interceptor.Chain) -> Response) =
      addInterceptor(Interceptor { chain -> block(chain) })

    /**
     * Returns a modifiable list of interceptors that observe a single network request and response.

                  : t;
          releaseShared(finalState);
        } else if (getState() == COMPLETING) {
          // If some other thread is currently completing the future, block until
          // they are done so we can guarantee completion.
          acquireShared(-1);
        }
        return doCompletion;
      }
    }

        // This test uses a real MD5 instance to verify the HMAC calculation logic
        // HMACT64 is a modified HMAC-MD5 where the key is truncated at 64 bytes
        // instead of being hashed when it exceeds the block size.

        byte[] key = { (byte) 0x0b, (byte) 0x0b, (byte) 0x0b, (byte) 0x0b, (byte) 0x0b, (byte) 0x0b, (byte) 0x0b, (byte) 0x0b, (byte) 0x0b,

     * Pipe instance although this is not a requirement (e.g. a
     * read-only named pipe would write data to this stream on
     * connection). Reading from this stream may block. Therefore it
     * may be necessary that an addition thread be used to read and
     * write to a Named Pipe.
     * @return the input stream for reading from this pipe
     * @throws IOException if an I/O error occurs

                throw new JobNotFoundException("Process for " + sessionId + " is not running.");
            }
        }

        // Perform I/O operations outside synchronized block to avoid blocking other threads
        try {
            final OutputStream out = process.getOutputStream();
            IOUtils.write(command + "\n", out, Constants.CHARSET_UTF_8);
            out.flush();

	pathbuf := make([]byte, len(prefix)+len(path)+len(`\`))
	copy(pathbuf, prefix)
	n := len(path)
	r, w := 0, len(prefix)
	for r < n {
		switch {
		case os.IsPathSeparator(path[r]):
			// empty block
			r++
		case path[r] == '.' && (r+1 == n || os.IsPathSeparator(path[r+1])):
			// /./
			r++
		case r+1 < n && path[r] == '.' && path[r+1] == '.' && (r+2 == n || os.IsPathSeparator(path[r+2])):

                        return true;
                    }
                    String packageName = getPackageName(file);
                    // we pass through package-info.java files for packages we have not seen before, block the rest
                    boolean notSeeBefore = packagesSeenBefore.add(packageName);
                    if (notSeeBefore) {
                        canonicalPackageInfos.add(file.getAbsoluteFile());
                    }

import java.util.concurrent.Future;
import java.util.concurrent.atomic.AtomicReference;
import org.jspecify.annotations.Nullable;

/**
 * Serializes execution of tasks, somewhat like an "asynchronous {@code synchronized} block." Each
 * {@linkplain #submit enqueued} callable will not be submitted to its associated executor until the
 * previous callable has returned -- and, if the previous callable was an {@link AsyncCallable}, not