* insertion order.
   */
  private void populateTShapedGraph() {
    putEdge(2, 1);
    putEdge(1, 4);
    putEdge(1, 3);
    putEdge(1, 2); // Duplicate
    putEdge(4, 5);
  }

  // Element Mutation

  @Test
  public void putEdge_existingNodes() {
    assume().that(graphIsMutable()).isTrue();

        queryContext = new QueryContext("test", true);
        queryContext.addHighlightedQuery("text1");
        queryContext.addHighlightedQuery("text2");
        queryContext.addHighlightedQuery("text1"); // Duplicate

        Set<String> highlightedSet = (Set<String>) getMockRequest().getAttribute(Constants.HIGHLIGHT_QUERIES);
        assertNotNull(highlightedSet);
        assertEquals(2, highlightedSet.size());

            decodedContext.decode(buffer, 0, encoded);

            assertArrayEquals(ciphers, decodedContext.getCiphers());
        }

        @Test
        @DisplayName("Should handle duplicate ciphers")
        void testDuplicateCiphers() throws SMBProtocolDecodingException {
            int[] ciphers = { EncryptionNegotiateContext.CIPHER_AES128_CCM, EncryptionNegotiateContext.CIPHER_AES128_CCM,

        assertEquals(1024, decodedHeader.getOriginalMessageSize());
        assertEquals(0x0001, decodedHeader.getFlags());
        assertEquals(testSessionId, decodedHeader.getSessionId());
    }

    // Duplicate testFlags method removed - keeping the first one

    @ParameterizedTest
    @ValueSource(ints = { 0, 1, 64, 1024, 4096, 65536 })
    @DisplayName("Should handle various message sizes")

# Maximum size of alphanumeric terms in documents.
crawler.document.max.alphanum.term.size=20
# Maximum size of symbol terms in documents.
crawler.document.max.symbol.term.size=10
# Whether to remove duplicate terms in documents.
crawler.document.duplicate.term.removed=false
# Unicode space characters for document parsing.

          Function<? super T, ? extends V> valueFunction) {
    checkNotNull(comparator);
    checkNotNull(keyFunction);
    checkNotNull(valueFunction);
    /*
     * We will always fail if there are duplicate keys, and the keys are always sorted by
     * the Comparator, so the entries can come in an arbitrary order -- so we report UNORDERED.
     */
    return Collector.of(

          Function<? super T, ? extends V> valueFunction) {
    checkNotNull(comparator);
    checkNotNull(keyFunction);
    checkNotNull(valueFunction);
    /*
     * We will always fail if there are duplicate keys, and the keys are always sorted by
     * the Comparator, so the entries can come in an arbitrary order -- so we report UNORDERED.
     */
    return Collector.of(

// The name must be a relative path: it must not start with a drive
// letter (e.g. C:) or leading slash, and only forward slashes are
// allowed. To create a directory instead of a file, add a trailing
// slash to the name. Duplicate names will not overwrite previous entries
// and are appended to the zip file.
// The file's contents must be written to the [io.Writer] before the next
// call to [Writer.Create], [Writer.CreateHeader], or [Writer.Close].

				acceptArg = true
			case scanner.Ident:
				if !acceptArg {
					in.Error("bad syntax in definition for macro:", name)
				}
				arg := in.Stack.Text()
				if slices.Contains(args, arg) {
					in.Error("duplicate argument", arg, "in definition for macro:", name)
				}
				args = append(args, arg)
				acceptArg = false
			default:
				in.Error("bad definition for macro:", name)
			}
		}
	}
	var tokens []Token

        assertEquals(roles1.length, roles2.length);
        for (int i = 0; i < roles1.length; i++) {
            assertEquals(roles1[i], roles2[i]);
        }
    }

    // Test annotation with duplicate roles
    @Secured({ "ROLE_USER", "ROLE_ADMIN", "ROLE_USER" })
    static class DuplicateRolesClass {
    }

    public void test_duplicateRoles() {