long bits = doubleToRawLongBits(d);
    bits &= SIGNIFICAND_MASK;
    return (exponent == MIN_EXPONENT - 1) ? bits << 1 : bits | IMPLICIT_BIT;
  }

  static boolean isFinite(double d) {
    return getExponent(d) <= MAX_EXPONENT;
  }

  static boolean isNormal(double d) {
    return getExponent(d) >= MIN_EXPONENT;
  }

  /*
   * Returns x scaled by a power of 2 such that it is in the range [1, 2). Assumes x is positive,

     * Uses O(1) Set lookup for improved performance.
     *
     * @param field the field name to check
     * @return true if the field can be used for sorting, false otherwise
     */
    protected boolean isSortField(final String field) {
        return sortFieldSet != null && sortFieldSet.contains(field);
    }

    /**
     * Checks if the specified field can be used for faceted search.

  @Override
  public int size() {
    Map<K, V> delegate = delegateOrNull();
    return (delegate != null) ? delegate.size() : size;
  }

  @Override
  public boolean isEmpty() {
    return size() == 0;
  }

  @Override
  public boolean containsValue(@Nullable Object value) {
    Map<K, V> delegate = delegateOrNull();
    if (delegate != null) {
      return delegate.containsValue(value);
    }

     * @param state
     *            <code>true</code> to enable XInclude.
     * @return <code>true</code> if the XInclude state was successfully set.
     */
    public static boolean setXIncludeAware(final SAXParserFactory spf, final boolean state) {
        assertArgumentNotNull("spf", spf);

        try {
            spf.setXIncludeAware(state);
            return true;
        } catch (final RuntimeException e) {

  }

  @Override
  public final boolean hasNext() {
    return position < size;
  }

  @Override
  @ParametricNullness
  public final E next() {
    if (!hasNext()) {
      throw new NoSuchElementException();
    }
    return get(position++);
  }

  @Override
  public final int nextIndex() {
    return position;
  }

  @Override
  public final boolean hasPrevious() {
    return position > 0;

  }

  IncidentEdgeSet(ArchetypeGraph<N> graph, N node, EdgeType edgeType) {
    this.graph = graph;
    this.node = node;
    this.edgeType = edgeType;
  }

  @Override
  public boolean remove(@Nullable Object o) {
    throw new UnsupportedOperationException();
  }

  @Override
  public int size() {
    if (graph.isDirected()) {
      return predecessorsOrEmpty(node).size()

            throw new StorageException("Failed to download " + objectName, e);
        }
    }

    @Override
    public void deleteObject(final String objectName) {
        try {
            final boolean deleted = storage.delete(BlobId.of(bucket, objectName));
            if (!deleted && logger.isDebugEnabled()) {
                logger.debug("Object may not exist: {}", objectName);
            }

 * This class is not thread safe.
 *
 * [rfc_6455]: http://tools.ietf.org/html/rfc6455
 */
class WebSocketReader(
  private val isClient: Boolean,
  val source: BufferedSource,
  private val frameCallback: FrameCallback,
  private val perMessageDeflate: Boolean,
  private val noContextTakeover: Boolean,
) : Closeable {
  private var closed = false
  private var receivedCloseFrame = false

  // Stateful data about the current frame.

    state = State.DONE;
    return null;
  }

  @Override
  public final boolean hasNext() {
    checkState(state != State.FAILED);
    switch (state) {
      case DONE:
        return false;
      case READY:
        return true;
      default:
    }
    return tryToComputeNext();
  }

  private boolean tryToComputeNext() {
    state = State.FAILED; // temporary pessimism
    next = computeNext();

     *
     * @param items the array of elements to iterate (must not be {@literal null})
     */
    public ArrayIterator(final T... items) {
        this.items = items;
    }

    @Override
    public boolean hasNext() {
        return index < items.length;
    }

    @Override
    public T next() {
        try {
            final T o = items[index];
            index++;
            return o;