// First execution
        String result1 = aggregateLogJob.execute();
        assertNotNull(result1);
        assertTrue(result1.contains("Error 1"));

        // Second execution
        String result2 = aggregateLogJob.execute();
        assertNotNull(result2);
        assertTrue(result2.contains("Error 2"));

        // Results should be independent

                // First mock implementation
            }
        };

        // Create second customizer
        ComponentCustomizer customizer2 = new ComponentCustomizer() {
            @Override
            public void customize(org.lastaflute.di.core.ComponentDef componentDef) {
                // Second mock implementation
            }
        };

        // Set first customizer

        assertTrue(it.hasNext(), "Iterator should have second element");
        assertSame(fe2, it.next(), "Second element must match first page");

        // Next page fetched via fetchMore()
        assertTrue(it.hasNext(), "Iterator should have third element after fetchMore");
        assertSame(fe3, it.next(), "Third element from second page");

				)

				if orchestrated && hostResolveToLocalhost(endpoints[i]) {
					// time elapsed
					timeElapsed := time.Since(startTime)
					// log error only if more than a second has elapsed
					if timeElapsed > time.Second {
						reqInfo.AppendTags("elapsedTime",
							humanize.RelTime(startTime,
								startTime.Add(timeElapsed),
								"elapsed",
								"",
							))

 *   protected void visitWildcardType(WildcardType t) {
 *     throw new IllegalArgumentException("Cannot contain wildcard type.");
 *   }
 * }.visit(type);
 * }
 *
 * <p>One {@code Type} is visited at most once. The second time the same type is visited, it's
 * ignored by {@link #visit}. This avoids infinite recursion caused by recursive type bounds.
 *
 * <p>This class is not thread safe.
 *
 * @author Ben Yu
 */

            // v1 node string follows
            bb.put("\\server1\0".getBytes(StandardCharsets.UTF_16LE));

            // Position for second referral
            bb.position(28); // 8 header + 20 first referral

            // Second Referral v1
            bb.putShort((short) 1); // version
            bb.putShort((short) 22); // size
            bb.putShort((short) 2); // serverType

   * concurrent maps whose content may change while the method is running.
   *
   * <p>The serialized output consists of the number of entries, first key, first value, second key,
   * second value, and so on.
   */
  static <K extends @Nullable Object, V extends @Nullable Object> void writeMap(
      Map<K, V> map, ObjectOutputStream stream) throws IOException {
    stream.writeInt(map.size());

        assertEquals(2, written, "setup packet should write 2 bytes");
        assertEquals(SmbComTransaction.TRANS2_QUERY_FS_INFORMATION, buf[0], "first byte should be subCommand");
        assertEquals((byte) 0x00, buf[1], "second byte should be zero");
    }

    @Test
    @DisplayName("writeParametersWireFormat writes the information level as 2-byte little endian")
    void testWriteParametersWireFormat() {
        int level = 0x1234;

It declares an optional query parameter `q` as a `str`, and then it just returns it.

This is quite simple (not very useful), but will help us focus on how the sub-dependencies work.

## Second dependency, "dependable" and "dependant" { #second-dependency-dependable-and-dependant }

Then you can create another dependency function (a "dependable") that at the same time declares a dependency of its own (so it is a "dependant" too):

        System.arraycopy(file1, 0, buffer, 102, file1.length);

        // Write second FileBothDirectoryInfo at 8 + 104 = 112
        int secondOffset = 112;
        SMBUtil.writeInt4(0, buffer, secondOffset); // NextEntryOffset (0 = last)
        SMBUtil.writeInt4(1, buffer, secondOffset + 4); // FileIndex
        // ... rest of second entry fields (zeros for simplicity)
        for (int i = 8; i < 94; i++) {