// 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",

    hostAddresses.remove(hostname)
    return this
  }

  @Throws(UnknownHostException::class)
  fun lookup(
    hostname: String,
    index: Int,
  ): InetAddress = hostAddresses[hostname]!![index]

  @Throws(UnknownHostException::class)
  override fun lookup(hostname: String): List<InetAddress> {
    requestedHosts.add(hostname)
    return hostAddresses[hostname] ?: throw UnknownHostException()
  }

        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++) {

	return word == "JMP" || word == "CALL" || word == "Call" || word == "Br" || word == "BrIf"
}

func archX86(linkArch *obj.LinkArch) *Arch {
	register := make(map[string]int16)
	// Create maps for easy lookup of instruction names etc.
	for i, s := range x86.Register {
		register[s] = int16(i + x86.REG_AL)
	}
	// Pseudo-registers.
	register["SB"] = RSB
	register["FP"] = RFP
	register["PC"] = RPC

        // 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: {}",

  const val FLAG_COMPRESSED = 0x20 // Used for data.

  /** Lookup table for valid frame types. */
  private val FRAME_NAMES =
    arrayOf(
      "DATA",
      "HEADERS",
      "PRIORITY",
      "RST_STREAM",
      "SETTINGS",
      "PUSH_PROMISE",
      "PING",
      "GOAWAY",
      "WINDOW_UPDATE",
      "CONTINUATION",
    )

  /**

        // Test deeply nested exception causes
        Exception level3 = new Exception("Level 3: Database connection failed");
        Exception level2 = new Exception("Level 2: User lookup failed", level3);
        Exception level1 = new Exception("Level 1: Authentication service error", level2);
        SsoProcessException topLevel = new SsoProcessException("SSO process failed", level1);

      int chunkShift) {
    this.trieData = new ChunksCharSequence(trieDataChunks, chunkShift);
    this.stringPool = new ChunksCharSequence(stringPoolChunks, chunkShift);
  }

  /**
   * Performs a lookup for the public suffix of the given labels, considering all public suffix
   * types. Returns the index of the leftmost label in the public suffix, or -1 if no match found.
   *

    }

    @Test
    public void test_load_sameTermDifferentHosts() {
        List<RelatedQuery> testData = new ArrayList<>();
        testData.add(createRelatedQuery("search", new String[] { "find", "lookup" }, "site1.com"));
        testData.add(createRelatedQuery("search", new String[] { "query", "discover" }, "site2.com"));
        mockBhv.setTestData(testData);

        relatedQueryHelper.load();

        ),
    ),
    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()
        }