private void registerAndConfigureDistributionArchivesExtension(Project project) {
        container = project.container(DistributionArchive.class, name -> {
            var subProjectDir = archiveToSubprojectName(name);
            var copyDistributionTaskName = "build" + capitalize(name.substring(0, name.length() - 3));
            TaskContainer tasks = project.getTasks();

        private final String name;

        public TestScriptEngine() {
            this("testEngine");
        }

        public TestScriptEngine(String name) {
            super();
            this.name = name;
        }

        @Override
        protected String getName() {
            return name;
        }

        @Override

  public Object[] toArray() {
    /*
     * If we could, we'd declare the no-arg `Collection.toArray()` to return "Object[] but elements
     * have the same nullness as E." Since we can't, we declare it to return nullable elements, and
     * we can override it in our non-null-guaranteeing subtypes to present a better signature to
     * their users.
     *

		// Test case  1-4.
		// Cases with invalid bucket name.
		{bucketName: ".test", objName: "obj", PartID: 1, expectedError: fmt.Errorf("%s", "Bucket name invalid: .test")},
		{bucketName: "------", objName: "obj", PartID: 1, expectedError: fmt.Errorf("%s", "Bucket name invalid: ------")},
		{
			bucketName: "$this-is-not-valid-too", objName: "obj", PartID: 1,
			expectedError: fmt.Errorf("%s", "Bucket name invalid: $this-is-not-valid-too"),
		},

        FessUserNotFoundException exception1 = new FessUserNotFoundException("user1");
        FessUserNotFoundException exception2 = new FessUserNotFoundException("user2");

        // Both instances should be of the same class
        assertEquals(exception1.getClass(), exception2.getClass());
    }

    @Test
    public void test_stackTrace() {
        // Test that the exception has a proper stack trace

public class MavenExecutionPlan implements Iterable<ExecutionPlanItem> {

    /*
      At the moment, this class is totally immutable, and this is in line with thoughts about the
      pre-calculated execution plan that stays the same during the execution.

      If deciding to add mutable state to this class, it should be at least considered to
      separate this into a separate mutable structure.

    */

	if err != nil {
		t.Fatalf("Failed to get a new credential: %v", err)
	}
	testCases := []struct {
		cred           Credentials
		ccred          Credentials
		expectedResult bool
	}{
		// Same Credentialss.
		{cred, cred, true},
		// Empty credentials to compare.
		{cred, Credentials{}, false},
		// Empty credentials.
		{Credentials{}, cred, false},
		// Two different credentialss

            assertEquals(TEST_STRING.getBytes(StandardCharsets.UTF_16LE).length, result.length, "Length should match UTF-16LE encoding");
            assertArrayEquals(TEST_STRING.getBytes(StandardCharsets.UTF_16LE), result, "Should produce same bytes as UTF-16LE encoding");
        }

        @Test
        @DisplayName("getUNIBytes should handle Unicode characters correctly")
        void testGetUNIBytesWithUnicode() {
            // When

    // Compute the hash table.
    char[] table = new char[chooseTableSize(size)];
    int mask = table.length - 1;
    for (int c = chars.nextSetBit(0); c != -1; c = chars.nextSetBit(c + 1)) {
      // Compute the filter at the same time.
      filter |= 1L << c;
      int index = smear(c) & mask;
      while (true) {
        // Check for empty.
        if (table[index] == 0) {
          table[index] = (char) c;
          break;
        }

   * {@code node}'s outgoing edges in the direction (if any) of the edge.
   *
   * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing
   * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}.
   *
   * <p>Some algorithms that operate on a {@code SuccessorsFunction} may produce undesired results