i = inc(i);
      }
      return false;
    } finally {
      monitor.leave();
    }
  }

  /**
   * Returns an array containing all of the elements in this queue, in proper sequence.
   *
   * <p>The returned array will be "safe" in that no references to it are maintained by this queue.
   * (In other words, this method must allocate a new array). The caller is thus free to modify the

     */
    public StringSettingsSource(CharSequence settings, String location) {
        super(settings, location);
    }

    /**
     * Gets the character sequence of this settings source.
     *
     * @return The underlying character stream, never {@code null}.
     * @deprecated instead use {@link #getContent()}
     */
    @Deprecated
    public String getSettings() {

    assertEquals(expected, murmur3_128(seed).hashBytes(input));
    assertEquals(expected, murmur3_128(seed).newHasher().putBytes(input).hash());
  }

  /** Returns a {@link HashCode} for a sequence of longs, in big-endian order. */
  private static HashCode toHashCode(long... longs) {
    ByteBuffer bb = ByteBuffer.wrap(new byte[longs.length * 8]).order(ByteOrder.LITTLE_ENDIAN);
    for (long x : longs) {

                    throw new IOException("Invalid UTF-8 sequence");
                }
                uni[ui] |= (ch & 0x3F) << 6;
                ch = src[si++] & 0xFF;
                uni[ui] |= ch & 0x3F;
                if ((ch & 0xC0) != 0x80 || uni[ui] < 0x800) {
                    throw new IOException("Invalid UTF-8 sequence");
                }
            } else {

        // NULL byte injection
        assertEquals("admin\\00", LdapUtil.escapeValue("admin\0"));

        // Escape sequence confusion
        assertEquals("admin\\5c\\2a", LdapUtil.escapeValue("admin\\*"));
    }

  private Graphs() {}

  // Graph query methods

  /**
   * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
   * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
   * and ending with the same node.
   *
   * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
   */

        }
        duplicateHostList.add(duplicateHost);
    }

    /**
     * Converts a URL using all configured duplicate host rules.
     * Applies each duplicate host rule in sequence to transform the URL
     * according to the configured patterns.
     *
     * @param url the URL to convert
     * @return the converted URL after applying all duplicate host rules,

        /** The high field of the timestamp multiplexed with the version number */
        public short time_hi_and_version;
        /** The high field of the clock sequence multiplexed with the variant */
        public byte clock_seq_hi_and_reserved;
        /** The low field of the clock sequence */
        public byte clock_seq_low;
        /** The spatially unique node identifier */
        public byte[] node;

        @Override

   *
   * @throws IllegalStateException if there has been a call to {@link #peek()} since the most recent
   *     call to {@link #next()} and this implementation does not support this sequence of calls
   *     (optional)
   */
  @Override
  void remove();

 *
 * @author mbechler
 */
public interface SMBSigningDigest {

    /**
     * Performs MAC signing of the SMB. This is done as follows.
     * The signature field of the SMB is overwritten with the sequence number;
     * The MD5 digest of the MAC signing key + the entire SMB is taken;
     * The first 8 bytes of this are placed in the signature field.
     *
     * @param data
     *            The data.