return ((Map<?, ?>) value).isEmpty();
      } else if (value instanceof Optional) {
        return !((Optional) value).isPresent();
      } else if (value.getClass().isArray()) {
        return Array.getLength(value) == 0;
      }
      return false;
    }

    /**
     * Returns a string in the format specified by {@link MoreObjects#toStringHelper(Object)}.
     *

public final class InternalFutures {
  /**
   * Usually returns {@code null} but, if the given {@code Future} has failed, may <i>optionally</i>
   * return the cause of the failure. "Failure" means specifically "completed with an exception"; it
   * does not include "was cancelled." To be explicit: If this method returns a non-null value,
   * then:
   *
   * <ul>
   *   <li>{@code isDone()} must return {@code true}

    return Collections.newSetFromMap(new ConcurrentHashMap<E, Boolean>());
  }

  static <E extends @Nullable Object> Set<E> newLinkedHashSetWithExpectedSize(int expectedSize) {
    return Sets.newLinkedHashSetWithExpectedSize(expectedSize);
  }

  /**
   * Returns the platform preferred map implementation that preserves insertion order when used only
   * for insertions.
   */

 *
 * <p>The {@code getInputStream()} method provides an InputStream to read the cached content.
 * If the content is cached in a file, it returns a FileInputStream. If the content is cached in memory,
 * it returns a ByteArrayInputStream.
 *
 * <p>Example usage:
 * <pre>
 * {@code
 * // In-memory caching
 * byte[] data = "example data".getBytes();

    checkNotNull(nodeToChildrenFunction);
    return new TreeTraverser<T>() {
      @Override
      public Iterable<T> children(T root) {
        return nodeToChildrenFunction.apply(root);
      }
    };
  }

  /** Returns the children of the specified node. Must not contain null. */
  public abstract Iterable<T> children(T root);

  /**

      offset += entry.getCount();
    }
    return offset;
  }

  @Override
  public boolean equals(@Nullable Object object) {
    return Multisets.equalsImpl(this, object);
  }

  @Override
  public int hashCode() {
    return Sets.hashCodeImpl(entrySet());
  }

  @Override
  public String toString() {
    return entrySet().toString();
  }

  /**

/**
 * A unit of work that can be executed one or more times.
 *
 * Recurrence
 * ----------
 *
 * Tasks control their recurrence schedule. The [runOnce] function returns -1L to signify that the
 * task should not be executed again. Otherwise it returns a delay until the next execution.
 *
 * A task has at most one next execution. If the same task instance is scheduled multiple times, the

        @Override
        public String getName() {
            return name;
        }

        @Override
        public int getType() {
            return type;
        }

        @Override
        public int getAttributes() {
            return attributes;
        }

        @Override
        public long createTime() {
            return createTime;
        }

        @Override

    }

    /**
     * Returns the capabilities of the connected share.
     *
     * @return the capabilities
     */
    public int getCapabilities() {
        return this.capabilities;
    }

    /**
     * Returns the maximal access rights that the user has on this share.
     *
     * @return the maximalAccess
     */
    public int getMaximalAccess() {
        return this.maximalAccess;
    }

        return this.credentialType;
    }

    /**
     * Returns the server signature used to validate PAC integrity.
     * @return the server signature
     */
    public PacSignature getServerSignature() {
        return this.serverSignature;
    }

    /**
     * Returns the KDC signature used to validate PAC authenticity.
     * @return the KDC signature
     */
    public PacSignature getKdcSignature() {