* quickly, since the row key is provided. However, {@code column(columnKey).size()} takes longer,
 * since an iteration across all row keys occurs.
 *
 * <p>Because a {@code TreeBasedTable} has unique sorted values for a given row, both {@code
 * row(rowKey)} and {@code rowMap().get(rowKey)} are {@link SortedMap} instances, instead of the
 * {@link Map} specified in the {@link Table} interface.
 *

    private int structureSize;
    private int flags;
    private Smb2LeaseKey leaseKey;
    private int leaseState;
    private long leaseDuration;

    /**
     * Constructs an SMB2 lease break response with the given configuration.
     *
     * @param config the configuration for this response
     */
    public Smb2LeaseBreakResponse(Configuration config) {
        super(config);
    }

    /**

                throw new FessSystemException("Failed to access log files.", e);
            }
        }
        return logFileItems;
    }

    /**
     * Checks if the given filename is a log file.
     *
     * @param name the filename to check
     * @return true if the filename ends with .log or .log.gz, false otherwise
     */
    public static boolean isLogFilename(final String name) {

     */
    public void add(final String mimetype, final String filetype) {
        mimetypeMap.put(mimetype, filetype);
    }

    /**
     * Retrieves the file type for a given MIME type.
     *
     * @param mimetype the MIME type to look up
     * @return the corresponding file type, or the default value if not found
     */
    public String get(final String mimetype) {

        final String key = entity.getVirtualHost();
        return StringUtil.isBlank(key) ? StringUtil.EMPTY : key;
    }

    /**
     * Retrieves related queries for a given search term.
     * The search is performed using the current virtual host context and
     * the query term is converted to lowercase for case-insensitive matching.
     *

      int i = 0;
      for (Object e : elements) {
        array[i++] = (Double) e;
      }
      return create(array);
    }

    /**
     * Creates a new collection containing the given elements; implement this method instead of
     * {@link #create(Object...)}.
     */
    protected abstract List<Double> create(Double[] elements);

    @Override
    public Double[] createArray(int length) {

 * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
 * breadth first traversal) that only need a way of accessing the successors of a node in a graph.
 *
 * <h3>Usage</h3>
 *
 * Given an algorithm, for example:
 *
 * {@snippet :
 * public <N> someGraphAlgorithm(N startNode, SuccessorsFunction<N> successorsFunction);
 * }
 *
 * you will invoke it depending on the graph representation you're using.
 *

      return clazz.getDeclaredField(enumValue.name());
    } catch (NoSuchFieldException impossible) {
      throw new AssertionError(impossible);
    }
  }

  /**
   * Returns an optional enum constant for the given type, using {@link Enum#valueOf}. If the
   * constant does not exist, {@link Optional#absent} is returned. A common use case is for parsing
   * user input or falling back to a default enum constant. For example, {@code

import java.lang.annotation.Retention;
import java.lang.annotation.RetentionPolicy;
import java.lang.annotation.Target;

import org.apache.maven.api.annotations.Experimental;

/**
 * Indicates that a given field will be injected with the result of
 * a dependency collection or resolution request. Whether a collection
 * or resolution request is performed is controlled by the {@link #pathScope()}

    private MessageDigest md5;

    private byte[] ipad = new byte[BLOCK_LENGTH];

    private byte[] opad = new byte[BLOCK_LENGTH];

    /**
     * Creates an HMACT64 instance which uses the given secret key material.
     *
     * @param key The key material to use in hashing.
     */
    public HMACT64(final byte[] key) {
        super("HMACT64");
        final int length = Math.min(key.length, BLOCK_LENGTH);