setHeaderStart(response, 64);

        // Create a long filename
        StringBuilder longName = new StringBuilder();
        for (int i = 0; i < 100; i++) {
            longName.append("test");
        }
        String fileName = longName.toString();
        byte[] fileNameBytes = fileName.getBytes("UnicodeLittleUnmarked");

        // Write structure header

        // Given - Create a very long path
        StringBuilder longPathBuilder = new StringBuilder("\\\\server\\");
        for (int i = 0; i < 1000; i++) {
            longPathBuilder.append("a");
        }
        String longPath = longPathBuilder.toString();

        Smb2TreeConnectRequest req = new Smb2TreeConnectRequest(mockConfig, longPath);
        byte[] buffer = new byte[4096];

// returns (slice of full buffers, remaining bytes before delim, total number
// of bytes in the combined first two elements, error).
// The complete result is equal to
// `bytes.Join(append(fullBuffers, finalFragment), nil)`, which has a
// length of `totalLen`. The result is structured in this way to allow callers
// to minimize allocations and copies.

      StringBuilder message = new StringBuilder(requireNonNull(super.getMessage()));
      for (Throwable t = conflictingStackTrace; t != null; t = t.getCause()) {
        message.append(", ").append(t.getMessage());
      }
      return message.toString();
    }
  }

  /**
   * Internal Lock implementations implement the {@code CycleDetectingLock} interface, allowing the

        // Prepare test data with long filename (255 characters)
        StringBuilder longName = new StringBuilder();
        for (int i = 0; i < 255; i++) {
            longName.append((char) ('a' + (i % 26)));
        }
        String expectedFilename = longName.toString();
        byte[] buffer = createValidBuffer(expectedFilename, "LONGNA~1.TXT", true);

        // Decode

    /**
     * Test rule with very long rule ID
     */
    public void test_veryLongRuleId() {
        StringBuilder longId = new StringBuilder();
        for (int i = 0; i < 1000; i++) {
            longId.append("verylongruleid_");
        }

        TestRule rule = new TestRule(longId.toString(), new TestResponseProcessor("longProcessor"), true);

        assertEquals(longId.toString(), rule.getRuleId());

            OutputStream os4 = mockResource.openOutputStream(true, 1, 2, 3);

            // Then
            assertNotNull(os1, "Default output stream should not be null");
            assertNotNull(os2, "Output stream with append should not be null");
            assertNotNull(os3, "Output stream with sharing should not be null");
            assertNotNull(os4, "Output stream with full params should not be null");

	add = func(path dataUsageHash) {
		e, ok := d.Cache[path.Key()]
		if !ok {
			return
		}
		if len(e.Children) == 0 {
			return
		}
		sz := d.sizeRecursive(path.Key())
		leaves = append(leaves, struct {
			objects uint64
			path    dataUsageHash
		}{objects: sz.Objects, path: path})
		for ch := range e.Children {
			add(dataUsageHash(ch))
		}
	}

	// Add path recursively.

    boolean done = doneSignal.await(1, SECONDS);
    if (!done) {
      StringBuilder builder = new StringBuilder();
      for (StackTraceElement trace : thread.getStackTrace()) {
        builder.append("\tat ").append(trace).append('\n');
      }
      fail(builder.toString());
    }
  }

  /**
   * Returns an iterable containing all combinations of maximumSize, expireAfterAccess/Write,

     */
    public void test_ruleId_edgeCases() {
        // Very long rule ID
        StringBuilder longId = new StringBuilder();
        for (int i = 0; i < 1000; i++) {
            longId.append("verylongruleid");
        }
        testRule.setRuleId(longId.toString());
        assertEquals(longId.toString(), testRule.getRuleId());

        // Special characters in rule ID