<c:set var="facetFound" value="F"/>
				<c:forEach var="queryEntry" items="${facetQueryView.queryMap}">
					<c:if test="${facetResponse.queryCountMap[queryEntry.value] > 0}">
						<li class="list-group-item"><la:link
								href="/search?q=${f:u(q)}&ex_q=${f:u(queryEntry.value)}&sdh=${f:u(fe:sdh(sdh))}${fe:pagingQuery(queryEntry.value)}${fe:facetQuery()}${fe:geoQuery()}">

   *
   * <p>Even if the input range is empty, if it is connected on both sides by ranges mapped to the
   * same value those two ranges will be coalesced.
   *
   * <p><b>Note:</b> coalescing requires calling {@code .equals()} on any connected values, which
   * may be expensive depending on the value type. Using this method on range maps with large values
   * such as {@link Collection} types is discouraged.
   *
   * @since 22.0
   */

     *
     * @param value the integer value to convert
     * @param length the desired length of the hex string
     * @return the hexadecimal string representation
     */
    public static String bin_to_hex(int value, final int length) {
        final char[] arr = new char[length];
        int ai = arr.length;
        while (ai-- > 0) {
            arr[ai] = HEXCHARS[value & 0xF];
            value >>>= 4;
        }

				case reflect.Slice, reflect.Array:
					if _, ok := v[key].(driver.Valuer); ok {
						conds = append(conds, clause.Eq{Column: column, Value: v[key]})
					} else if _, ok := v[key].(Valuer); ok {
						conds = append(conds, clause.Eq{Column: column, Value: v[key]})
					} else {
						// optimize reflect value length
						valueLen := reflectValue.Len()
						values := make([]interface{}, valueLen)
						for i := 0; i < valueLen; i++ {

	config.KV{
		Key:   Speed,
		Value: "default",
	},
	config.KV{
		Key:           IdleSpeed,
		Value:         "",
		HiddenIfEmpty: true,
	},
	config.KV{
		Key:   ExcessVersions,
		Value: "100",
	},
	config.KV{
		Key:   ExcessFolders,
		Value: "50000",
	},

	// Deprecated Oct 2022
	config.KV{
		Key:           Delay,
		Value:         "",
		HiddenIfEmpty: true,
	},

  // in the short hash. We saw that a mask of 0x7f would keep the 7-bit value 0x6f from a full
  // hashcode of 0x89abcdef. The imaginary `hash` value would then be the remaining top 25 bits,
  // 0x89abcd80. To this is added (or'd) the `next` value, which is an index within `entries`
  // (and therefore within `keys` and `values`) of another entry that has the same short hash

                if (cookieKey.equals(cookie.getName())) {
                    final String value = cookie.getValue();
                    if (logger.isDebugEnabled()) {
                        logger.debug("{}:{}", cookieKey, value);
                    }
                    if (StringUtil.isNotEmpty(value)) {
                        parseRoleSet(value, encryptedCookieValue, roleSet);
                    }
                }
            }

    }

    /**
     * Reads a 16-bit character value with proper alignment.
     * @return the character value
     * @throws IOException if an I/O error occurs
     */
    public char readChar() throws IOException {
        align(2);
        return this.dis.readChar();
    }

    /**
     * Reads a single byte value.
     * @return the byte value
     * @throws IOException if an I/O error occurs
     */

        T value = entry.getValue();
        mapBuilder.put(type, cast(type, value));
      }
      return this;
    }

    private static <T> T cast(Class<T> type, Object value) {
      return Primitives.wrap(type).cast(value);
    }

    /**
     * Returns a new immutable class-to-instance map containing the entries provided to this
     * builder.
     *

            }
            if (excludeFields.contains(field)) {
                continue;
            }

            final Object value = entry.getValue();
            if (value instanceof Collection) {
                for (final Object item : (Collection<?>) value) {
                    html.append("<meta name=\"fess:")
                            .append(escapeHtml(field))
                            .append("\" content=\"")