assertEquals(0, filteredEnvMap.size());

        envMap.put("FESS_ENV_TEST", "123");
        filteredEnvMap = systemHelper.getFilteredEnvMap("^FESS_ENV.*");
        assertEquals(1, filteredEnvMap.size());
        assertEquals("123", filteredEnvMap.get("FESS_ENV_TEST"));

        filteredEnvMap = systemHelper.getFilteredEnvMap("^XFESS_ENV.*");
        assertEquals(0, filteredEnvMap.size());

        envMap.put("", "123");

  private final ImmutableMap<K, V> map;

  ImmutableMapKeySet(ImmutableMap<K, V> map) {
    this.map = map;
  }

  @Override
  public int size() {
    return map.size();
  }

  @Override
  public UnmodifiableIterator<K> iterator() {
    return map.keyIterator();
  }

  @Override
  public boolean contains(@Nullable Object object) {

    }

    /**
     * Gets the scroll size for search operations.
     *
     * @return The scroll size.
     */
    public int getScrollSize() {
        return scrollSize;
    }

    /**
     * Sets the scroll size for search operations.
     *
     * @param scrollSize The scroll size.
     */
    public void setScrollSize(final int scrollSize) {

     *
     * @throws CIFSException if an error occurs while releasing the handle
     */
    void release() throws CIFSException;

    /**
     * Returns the initial size of the file when it was opened
     *
     * @return the file size when it was opened
     */
    long getInitialSize();

        this.bytes = b;
        this.off = off;
        this.len = len;
    }

    /**
     * {@inheritDoc}
     *
     * @see jcifs.Encodable#size()
     */
    @Override
    public int size() {
        return this.len;
    }

    /**
     * {@inheritDoc}
     *
     * @see jcifs.Encodable#encode(byte[], int)
     */
    @Override

          List<? extends E> list,
          int foundIndex) {
        // Of course, we have to use binary search to find the precise
        // breakpoint...
        int lower = foundIndex;
        int upper = list.size() - 1;
        // Everything between lower and upper inclusive compares at >= 0.
        while (lower < upper) {
          int middle = (lower + upper + 1) >>> 1;
          int c = comparator.compare(list.get(middle), key);

                        : targetName.toUpperCase().getBytes(getOEMEncoding());
                size += targetBytes.length;
            } else {
                flags &= 0xffffffff ^ NTLMSSP_REQUEST_TARGET;
            }
        }

        if (targetInformationBytes != null) {
            size += targetInformationBytes.length;
            flags |= NTLMSSP_NEGOTIATE_TARGET_INFO;
        }

            + Long.numberOfLeadingZeros(~b);
    if (leadingZeros > Long.SIZE + 1) {
      return a * b;
    }
    // the return value if we will overflow (which we calculate by overflowing a long :) )
    long limit = Long.MAX_VALUE + ((a ^ b) >>> (Long.SIZE - 1));
    if (leadingZeros < Long.SIZE | (a < 0 & b == Long.MIN_VALUE)) {
      // overflow
      return limit;
    }
    long result = a * b;

     */
    public void setRequestTimeout(final String bulkRequestTimeout) {
        requestTimeout = bulkRequestTimeout;
    }

    /**
     * Sets the request cache size.
     * @param requestCacheSize The request cache size.
     */
    public void setRequestCacheSize(final int requestCacheSize) {
        this.requestCacheSize = requestCacheSize;
    }

    /**
     * Sets the script language.

 * Multiset#entrySet()} method, plus optionally overriding {@link #add(Object, int)} and {@link
 * #remove(Object, int)} to enable modifications to the multiset.
 *
 * <p>The {@link #count} and {@link #size} implementations all iterate across the set returned by
 * {@link Multiset#entrySet()}, as do many methods acting on the set returned by {@link
 * #elementSet()}. Override those methods for better performance.
 *