*
     * @return the deviceState
     */
    public final int getDeviceState() {
        return this.deviceState;
    }

    /**
     * Gets the action taken.
     *
     * @return the action
     */
    public final int getAction() {
        return this.action;
    }

    /**
     * Gets the server file identifier.
     *
     * @return the serverFid
     */

      assertTrue(Thread.holdsLock(mutex));
      return delegate.poll();
    }

    @Override
    public E remove() {
      assertTrue(Thread.holdsLock(mutex));
      return delegate.remove();
    }

    @Override
    public boolean remove(Object object) {
      assertTrue(Thread.holdsLock(mutex));
      return delegate.remove(object);
    }

    @Override
    public @Nullable E peek() {

    @Override
    public String asTableDbName() {
        return asEsIndexType();
    }

    @Override
    protected String asEsIndex() {
        return "fess_config.scheduled_job";
    }

    @Override
    public String asEsIndexType() {
        return "scheduled_job";
    }

    @Override
    public String asEsSearchType() {
        return "scheduled_job";
    }

    @Override

                .append("\n");

        return sb.toString();
    }

    public boolean isAsList() {
        return asList;
    }

    public MetadataResolutionRequest setAsList(boolean asList) {
        this.asList = asList;
        return this;
    }

    public boolean isAsDirtyTree() {
        return asDirtyTree;
    }

    return forwardMultiset();
  }

  @Override
  public SortedMultiset<E> descendingMultiset() {
    return forwardMultiset();
  }

  @Override
  public @Nullable Entry<E> firstEntry() {
    return forwardMultiset().lastEntry();
  }

  @Override
  public @Nullable Entry<E> lastEntry() {
    return forwardMultiset().firstEntry();
  }

  abstract Iterator<Entry<E>> entryIterator();

        this.type = type;
        return this;
    }

    /**
     * Gets the fragment size.
     *
     * @return the fragment size in characters
     */
    public int getFragmentSize() {
        return fragmentSize;
    }

    /**
     * Sets the fragment size with fluent interface.
     *
     * @param fragmentSize the fragment size in characters
     * @return this HighlightInfo instance for method chaining
     */

            }
            return new AbstractMap<String, String>() {
              @Override
              public Set<Entry<String, String>> entrySet() {
                return map.entrySet();
              }

              @Override
              public @Nullable String put(String key, String value) {
                checkNotNull(key);
                return map.put(key, value);
              }

    return tailMap(key, true).firstEntry();
  }

  @Override
  public @Nullable Entry<K, V> higherEntry(@ParametricNullness K key) {
    return tailMap(key, false).firstEntry();
  }

  @Override
  public @Nullable K lowerKey(@ParametricNullness K key) {
    return Maps.keyOrNull(lowerEntry(key));
  }

  @Override
  public @Nullable K floorKey(@ParametricNullness K key) {

        return registrationId;
    }

    /**
     * Gets the share name.
     *
     * @return the share name
     */
    public String getShareName() {
        return shareName;
    }

    /**
     * Gets the server address.
     *
     * @return the server address
     */
    public InetAddress getServerAddress() {
        return serverAddress;
    }

  /**
   * Remove {@code edge} from the set of incoming edges. Returns the former predecessor node.
   *
   * <p>In the undirected case, returns {@code null} if {@code isSelfLoop} is true.
   */
  @CanIgnoreReturnValue
  @Nullable N removeInEdge(E edge, boolean isSelfLoop);

  /** Remove {@code edge} from the set of outgoing edges. Returns the former successor node. */
  @CanIgnoreReturnValue
  N removeOutEdge(E edge);