// Set-based lookup should be significantly faster
        // Note: This is a rough check - exact performance depends on JVM, hardware, etc.
        // We expect Set lookup to be at least as fast as array lookup for large datasets
        assertTrue("Set-based lookup should be faster or comparable to array-based lookup for large datasets",

        queryFieldConfig.setSearchFields(fields);

        // Test field at the end (worst case for array lookup, but same for Set)
        String testField = "field999";

        // Warm up
        for (int i = 0; i < 100; i++) {
            queryCommand.isSearchField(testField);
        }

        // Measure Set-based lookup
        long startTime = System.nanoTime();
        for (int i = 0; i < 10000; i++) {

        // Retrieve direct groups synchronously (parent group lookup is deferred)
        processDirectMemberOf(user, groupList, roleList, groupIdsForParentLookup, "https://graph.microsoft.com/v1.0/me/memberOf");

        if (logger.isDebugEnabled()) {
            logger.debug("[updateMemberOf] Direct groups retrieved. Total groups: {}, Total roles: {}, Group IDs for parent lookup: {}",

        ),
    ),
    MIT(
        "MIT License",
        "https://opensource.org/licenses/MIT",
        listOf("The MIT License", "MIT License", "MIT"),
    );

    companion object {
        /** Lookup map built lazily from all [aliases] across all entries. */
        val byPomName: Map<String, License> by lazy {
            entries.flatMap { lic -> lic.aliases.map { alias -> alias to lic } }.toMap()
        }

      long edgeCount) {
    this.isDirected = builder.directed;
    this.allowsSelfLoops = builder.allowsSelfLoops;
    this.nodeOrder = builder.nodeOrder.cast();
    // Prefer the heavier "MapRetrievalCache" for nodes if lookup is expensive.
    this.nodeConnections =
        (nodeConnections instanceof TreeMap)
            ? new MapRetrievalCache<>(nodeConnections)
            : new MapIteratorCache<>(nodeConnections);

    this.allowsSelfLoops = builder.allowsSelfLoops;
    this.nodeOrder = builder.nodeOrder.cast();
    this.edgeOrder = builder.edgeOrder.cast();
    // Prefer the heavier "MapRetrievalCache" for nodes if lookup is expensive. This optimizes
    // methods that access the same node(s) repeatedly, such as Graphs.removeEdgesConnecting().
    this.nodeConnections =
        (nodeConnections instanceof TreeMap)

}

func (schema *Schema) LookUpField(name string) *Field {
	if field, ok := schema.FieldsByDBName[name]; ok {
		return field
	}
	if field, ok := schema.FieldsByName[name]; ok {
		return field
	}

	// Lookup field using namer-driven ColumnName
	if schema.namer == nil {
		return nil
	}
	namerColumnName := schema.namer.ColumnName(schema.Table, name)
	if field, ok := schema.FieldsByDBName[namerColumnName]; ok {
		return field

     * This method handles the resolution of SPNEGO credentials by checking
     * if the user is an admin user or needs to be authenticated through LDAP.
     *
     * @param resolver The credential resolver to use for user lookup
     */
    @Override
    public void resolveCredential(final LoginCredentialResolver resolver) {
        resolver.resolve(SpnegoCredential.class, credential -> {

    @Test
    public void test_getDataStore_nullName() {
        DataStore retrieved = dataStoreFactory.getDataStore(null);
        assertNull(retrieved);
    }

    // Test getDataStore with case insensitive lookup
    @Test
    public void test_getDataStore_caseInsensitive() {
        TestDataStore dataStore = new TestDataStore("TestStore");
        dataStoreFactory.add("MyStore", dataStore);

            throw new LlmException("LLM streaming chat request failed", e);
        }
    }

    /**
     * Gets the available LLM client, performing a single lookup.
     *
     * @return the available LLM client
     * @throws LlmException if LLM client is not available
     */
    protected LlmClient getAvailableClient() {
        final String llmType = getLlmType();