*
   * <p>A failing {@link TearDown} may or may not fail a tl4j test, depending on the version of
   * JUnit test case you are running under. To avoid failing in the face of an exception regardless
   * of JUnit version, implement a {@link SloppyTearDown} instead.
   *
   * <p>tl4j details: For backwards compatibility, {@code junit3.TearDownTestCase} currently does

     * face inherited. If an inherited ACE is added to a parent the Windows
     * ACL editor will rebuild all children ACEs and set this flag accordingly.
     *
     * @return whether this is an inherited ACE
     */
    boolean isInherited();

    /**
     * Returns true if this ACE is an allow ACE and false if it is a deny ACE.
     *

 * this structure is never mutated, it provides a thread-safe view of the backing map.
 *
 * <p>The {@link MapIteratorCache} assumes ownership of the backing map, and cannot guarantee
 * correctness in the face of external mutations to the backing map. As such, it is <b>strongly</b>
 * recommended that the caller does not persist a reference to the backing map (unless the backing
 * map is immutable).
 *

 * and access mask of each ACE. If the SID matches, the allow/deny flags
 * and access mask are considered. If the ACE is a "deny"
 * ACE and <i>any</i> of the desired access bits match bits in the access
 * mask of the ACE, the whole access check fails. If the ACE is an "allow"
 * ACE and <i>all</i> of the bits in the desired access bits match bits in
 * the access mask of the ACE, the access check is successful. Otherwise,

"contra", "cu", "cum", "cumva", "curând", "curînd", "da", "dă", "dacă", "dar", "datorită", "de", "deci", "deja", "deoarece", "departe", "deşi", "din", "dinaintea", "dintr", "dintre", "drept", "după", "ea", "ei", "el", "ele", "eram", "este", "eşti", "eu", "face", "fără", "fi", "fie", "fiecare", "fii", "fim", "fiţi", "iar", "ieri", "îi", "îl", "îmi", "împotriva", "în ", "înainte", "înaintea", "încât", "încît", "încotro", "între", "întrucât", "întrucît", "îţi", "la", "lângă", "le", "li", "lîngă", "lor", "lui",...

,sBAGF,KACE,kBAAA,mBAAA,UAAA,oBAKJ,0BACE,KACE,QAAA,EAGF,GACE,QAAA,GANJ,kBACE,KACE,QAAA,EAGF,GACE,QAAA,GAIJ,2BACE,KACE,QAAA,EAGF,GACE,QAAA,GANJ,mBACE,KACE,QAAA,EAGF,GACE,QAAA,GAIJ,yBACE,GACE,kBAAA,mBAAA,UAAA,UAAA,mBAAA,UAEF,IACE,kBAAA,qBAAA,cAAA,UAAA,qBAAA,cAEF,IACE,kBAAA,kBAAA,aAAA,UAAA,kBAAA,aAEF,IACE,kBAAA,iBAAA,UAAA,UAAA,iBAAA,UAEF,IACE,kBAAA,oBAAA,aAAA,UAAA,oBAAA,aAEF,IACE,kBAAA,oBAAA,cAAA,UAAA,oBAAA,cAEF,IACE,kBAAA,oBAAA,UAAA,UAAA,oBAAA,UAEF,IACE,kBAAA,mBAAA,cAAA,UAAA,mBAAA,cAEF,IACE,kBAAA,...

AA,4BAAA,2BAAA,2BCHF,WACE,QAAA,YACA,IAAA,QACA,YAAA,OACA,8BAAA,0DAAA,sBAAA,0DACA,sBAAA,OACA,4BAAA,OAAA,oBAAA,OAEA,eACE,YAAA,EACA,MAAA,IACA,OAAA,IACA,KAAA,axCIE,WAAA,IAAA,YAAA,UAIA,uCwCZJ,exCaM,WAAA,MwCDJ,mCAAA,2BACE,UAAA,qDCnBN,OACE,SAAA,SACA,MAAA,KAEA,eACE,QAAA,MACA,YAAA,uBACA,QAAA,GAGF,SACE,SAAA,SACA,IAAA,EACA,KAAA,EACA,MAAA,KACA,OAAA,KAKF,WACE,kBAAA,KADF,WACE,kBAAA,IADF,YACE,kBAAA,OADF,YACE,kBAAA,eCrBJ,WACE,SAAA,MACA,IAAA,EACA,MAAA,EACA,KAAA,EACA,QAAA,KAGF,cACE,SAAA,MACA,MAAA,EACA,OAAA,EACA,KA...

 * and access mask of each ACE. If the SID matches, the allow/deny flags
 * and access mask are considered. If the ACE is a "deny"
 * ACE and <i>any</i> of the desired access bits match bits in the access
 * mask of the ACE, the whole access check fails. If the ACE is an "allow"
 * ACE and <i>all</i> of the bits in the desired access bits match bits in
 * the access mask of the ACE, the access check is successful. Otherwise,

            split(values[1], "\t").of(subStream -> subStream.map(String::trim).filter(StringUtil::isNotEmpty).forEach(v -> {
                final String[] facet = StringUtils.split(v, "=", 2);
                if (facet.length == 2) {
                    facetQueryView.addQuery(facet[0], facet[1]);
                }
            }));
            facetQueryView.init();
            facetQueryViewList.add(facetQueryView);

    public String[] query;

    /** Maximum number of facet values to return */
    public Integer size;

    /** Minimum document count required for a facet value to be included */
    public Long minDocCount;

    /** Sort order for facet values (e.g., "count.desc", "term.asc") */
    public String sort;

    /** Value to use for documents that don't have the facet field */
    public String missing;

    /**