"esteja", "estejamos", "estejam", "estivesse", "estivéssemos", "estivessem", "estiver", "estivermos", "estiverem", "hei", "há", "havemos", "hão", "houve", "houvemos", "houveram", "houvera", "houvéramos", "haja", "hajamos", "hajam", "houvesse", "houvéssemos", "houvessem", "houver", "houvermos", "houverem", "houverei", "houverá", "houveremos", "houverão", "houveria", "houveríamos", "houveriam", "sou", "somos", "são", "era", "éramos", "eram", "fui", "foi", "fomos", "foram", "fora", "fôramos", "seja", "sejamos",...

"esteja", "estejamos", "estejam", "estivesse", "estivéssemos", "estivessem", "estiver", "estivermos", "estiverem", "hei", "há", "havemos", "hão", "houve", "houvemos", "houveram", "houvera", "houvéramos", "haja", "hajamos", "hajam", "houvesse", "houvéssemos", "houvessem", "houver", "houvermos", "houverem", "houverei", "houverá", "houveremos", "houverão", "houveria", "houveríamos", "houveriam", "sou", "somos", "são", "era", "éramos", "eram", "fui", "foi", "fomos", "foram", "fora", "fôramos", "seja", "sejamos",...

labels.searchlog_log_type_search_zeroclick=Zero Click Count
labels.searchlog_log_type_search_count_hour=Search Count/Hour
labels.searchlog_log_type_search_count_day=Search Count/Day
labels.searchlog_log_type_search_user_hour=User Count/Hour
labels.searchlog_log_type_search_user_day=User Count/Day
labels.searchlog_log_type_search_reqtimeavg_hour=Request Average Time/Hour
labels.searchlog_log_type_search_reqtimeavg_day=Request Average Time/Day

labels.data_crawling_button_create_job=Créer une nouvelle tâche
labels.wizard_title_configuration=Assistant de configuration
labels.wizard_start_title=Configuration facile
labels.wizard_start_desc=Vous pouvez créer facilement un paramètre d'exploration à l'aide de l'assistant de configuration.
labels.wizard_start_button=Démarrer la configuration
labels.wizard_button_cancel=Annuler

        final Map<String, Object> inner = new LinkedHashMap<>();
        inner.put("key", "value");
        final Map<String, Object> outer = new LinkedHashMap<>();
        outer.put("inner", inner);
        source.put("nested", outer);

        final String json = new JsonIndexExportFormatter().format(source, Collections.emptySet());

        mixedMap.put(null, "test");
        assertEquals(228L, MemoryUtil.sizeOf(mixedMap));

        // Nested maps
        Map<String, Map<String, String>> nestedMap = new HashMap<>();
        nestedMap.put("outer", Maps.map("inner", "value").$());
        assertEquals(183L, MemoryUtil.sizeOf(nestedMap));
    }

    @Test
    public void test_sizeOf_customObjects() {

        innerBoolQueryBuilder.add(innerTermQuery, BooleanClause.Occur.MUST);
        BooleanQuery innerBooleanQuery = innerBoolQueryBuilder.build();

        // Create outer BooleanQuery
        BooleanQuery.Builder outerBoolQueryBuilder = new BooleanQuery.Builder();
        outerBoolQueryBuilder.add(innerBooleanQuery, BooleanClause.Occur.SHOULD);

labels.searchlog_log_type_search_zeroclick=Zero Click Count
labels.searchlog_log_type_search_count_hour=Search Count/Hour
labels.searchlog_log_type_search_count_day=Search Count/Day
labels.searchlog_log_type_search_user_hour=User Count/Hour
labels.searchlog_log_type_search_user_day=User Count/Day
labels.searchlog_log_type_search_reqtimeavg_hour=Request Average Time/Hour
labels.searchlog_log_type_search_reqtimeavg_day=Request Average Time/Day

,"foreignobject","hatch","hatchpath","mesh","meshgradient","meshpatch","meshrow","missing-glyph","script","set","solidcolor","unknown","use"]),I=i(["math","menclose","merror","mfenced","mfrac","mglyph","mi","mlabeledtr","mmultiscripts","mn","mo","mover","mpadded","mphantom","mroot","mrow","ms","mspace","msqrt","mstyle","msub","msup","msubsup","mtable","mtd","mtext","mtr","munder","munderover","mprescripts"]),M=i(["maction","maligngroup","malignmark","mlongdiv","mscarries","mscarry","msgroup","ms...

        assertTrue(queryFieldConfig.searchFieldSet.contains("field2"));
        assertTrue(queryFieldConfig.searchFieldSet.contains("field3"));
    }

    /**
     * Test performance improvement of Set-based lookup over array-based lookup.
     * This is a micro-benchmark to demonstrate the O(1) vs O(n) improvement.
     */
    @Test
    public void test_lookupPerformance_SetFasterThanArray() {
        // Create a large array of fields