-->
<super-source path="super"/>

<inherits name="com.google.common.annotations.Annotations" />
<inherits name="com.google.common.base.Base" />
<inherits name="com.google.common.collect.Collect" />
<inherits name="com.google.common.primitives.Primitives" />
<inherits name="com.google.common.testing.Testing" />
<inherits name="com.google.gwt.core.Core" />
<inherits name="com.google.gwt.junit.JUnit" />

        assertSame(info, result, "Should return same list instance");
        verify(info, times(1)).clear();
        assertTrue(result.isEmpty(), "List should be cleared");
    }

    // Parameterized test to exercise SMB2 with different recursive and filter values
    @ParameterizedTest(name = "SMB2 param: recursive={0}, filter={1}")
    @CsvSource({ "true, 0", "false, -1" })

    private final D genericDeclaration;
    private final String name;
    private final ImmutableList<Type> bounds;

    TypeVariableImpl(D genericDeclaration, String name, Type[] bounds) {
      disallowPrimitiveType(bounds, "bound for type variable");
      this.genericDeclaration = checkNotNull(genericDeclaration);
      this.name = checkNotNull(name);
      this.bounds = ImmutableList.copyOf(bounds);
    }

    @Keep

        assertEquals("   ", ResourceUtil.resolve(value));

        // Test long property name
        System.setProperty("very.long.property.name.with.many.dots", "long");
        value = "${very.long.property.name.with.many.dots}";
        assertEquals("long", ResourceUtil.resolve(value));

        // Test multiple occurrences of same variable
        System.setProperty("repeat", "X");
        value = "${repeat}${repeat}${repeat}";

<super-source path="super"/>

<inherits name="com.google.common.annotations.Annotations" />
<inherits name="com.google.common.base.Base" />
<inherits name="com.google.common.collect.Collect" />
<inherits name="com.google.common.escape.Escape" />
<inherits name="com.google.common.primitives.Primitives" />
<inherits name="com.google.gwt.core.Core" />
<inherits name="com.google.gwt.user.User" />

        @Test
        void arraysHaveSameLength() {
            assertEquals(WinError.WINERR_CODES.length, WinError.WINERR_MESSAGES.length,
                    "WINERR_CODES and WINERR_MESSAGES should have the same length");
        }

        @Test
        void messagesAlignWithCodes() {
            for (int i = 0; i < WinError.WINERR_CODES.length; i++) {
                int code = WinError.WINERR_CODES[i];

        // Given - Use same key for both encryption and decryption in test
        // In production, client would use clientEncKey/serverDecKey and server would use serverEncKey/clientDecKey
        Smb2EncryptionContext context = new Smb2EncryptionContext(EncryptionNegotiateContext.CIPHER_AES128_GCM, DialectVersion.SMB311,
                testEncryptionKey, testEncryptionKey); // Use same key for test

            names.names[0].name = new UnicodeString("alice", false);
            names.names[0].sid_index = 0;
            // Second is a domain group
            names.names[1] = new lsarpc.LsarTranslatedName();
            names.names[1].sid_type = (short) jcifs.SID.SID_TYPE_DOM_GRP;
            names.names[1].name = new UnicodeString("Domain Users", false);
            names.names[1].sid_index = 0;

  /**
   * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
   * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
   * and ending with the same node.
   *
   * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
   */
  public static <N> boolean hasCycle(Graph<N> graph) {
    int numEdges = graph.edges().size();

  /**
   * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
   * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
   * and ending with the same node.
   *
   * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
   */
  public static <N> boolean hasCycle(Graph<N> graph) {
    int numEdges = graph.edges().size();