*/
  public final void set(int i, double newValue) {
    long next = doubleToRawLongBits(newValue);
    longs.set(i, next);
  }

  /**
   * Eventually sets the element at position {@code i} to the given value.
   *
   * @param i the index
   * @param newValue the new value
   */
  public final void lazySet(int i, double newValue) {
    long next = doubleToRawLongBits(newValue);
    longs.lazySet(i, next);
  }

                return Integer.valueOf(from);
              }
            });

    Iterator<Integer> resultIterator = result.iterator();
    resultIterator.next();

    assertThrows(NumberFormatException.class, () -> resultIterator.next());
  }

  public void testNullFriendlyTransform() {
    List<@Nullable Integer> input = asList(1, 2, null, 3);
    Iterable<String> result =
        Iterables.transform(

            throw new NoAvailableChannelException("No healthy channels available");
        }

        if (availableChannels.size() == 1) {
            return availableChannels.iterator().next();
        }

        switch (strategy) {
        case ROUND_ROBIN:
            return selectRoundRobin(availableChannels);

        case LEAST_LOADED:
            return selectLeastLoaded(availableChannels);

    }

    /**
     * Checks if there is a next page available.
     *
     * @return true if there is a next page, false otherwise
     */
    public boolean isExistNextPage() {
        return existNextPage;
    }

    /**
     * Sets whether there is a next page available.
     *
     * @param existNextPage true if there is a next page, false otherwise
     */

                        public boolean hasNext() {
                            return false;
                        }

                        @Override
                        public Entry<Object, Object> next() {
                            throw new NoSuchElementException();
                        }
                    };
                }

                @Override
                public int size() {

            final Map.Entry property = (Map.Entry) properties.next();
            final String key = (String) property.getKey();
            final StringBuilder value = new StringBuilder();
            final Iterator values = ((List) property.getValue()).iterator();
            while (values.hasNext()) {
                value.append(values.next());
                if (values.hasNext()) {
                    value.append(", ");

   *
   * If this flag is set, the next four
   * bytes represent the mask key. These bytes appear after any additional bytes specified by [B1_MASK_LENGTH].
   */
  internal const val B1_FLAG_MASK = 128

  /**
   * Byte 1 mask for the payload length.
   *
   * If this value is [PAYLOAD_SHORT], the next two
   * bytes represent the length. If this value is [PAYLOAD_LONG], the next eight bytes
   * represent the length.
   */

                    }

                    @Override
                    public Entry<String, String> next() {
                      return transform(iterator.next());
                    }

                    private Entry<String, String> transform(Entry<String, String> next) {
                      return new Entry<String, String>() {

                        @Override

 * ----------
 *
 * 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
 * earliest one wins. This applies to both executions scheduled with [TaskRunner.Queue.schedule] and

     *
     * @return the expiration time of this entry
     */
    long getExpiration();

    /**
     * Get the next referral in the chain
     *
     * @return pointer to next referral, points to self if there is no further referral
     */
    DfsReferralData next();

    /**
     * Get the complete UNC path link for this referral
     *
     * @return the link
     */
    String getLink();