*   <li>if truncating for display to users, there are other considerations that must be taken
   *       into account
   *   <li>the appropriate truncation indicator may be locale-dependent
   *   <li>it is safe to use non-ASCII characters in the truncation indicator
   * </ul>
   *
   * @throws IllegalArgumentException if {@code maxLength} is less than the length of {@code
   *     truncationIndicator}
   * @since 16.0

    Builder.DuplicateKey duplicateKey = null;
    if (tableSize <= BYTE_MAX_SIZE) {
      /*
       * Use 8 bits per entry. The value is unsigned to allow use up to a size of 2^8.
       *
       * The absent indicator of -1 signed becomes 2^8 - 1 unsigned, which reduces the actual max
       * size to 2^8 - 1. However, due to a load factor < 1 the limit is never approached.
       */
      byte[] hashTable = new byte[tableSize];

labels.user_postalCode=Postal Code
labels.postalCode=Postal Code
labels.user_physicalDeliveryOfficeName=Office
labels.physicalDeliveryOfficeName=Office
labels.user_destinationIndicator=Destination Indicator
labels.destinationIndicator=Destination Indicator
labels.user_internationaliSDNNumber=International ISDN Number
labels.internationaliSDNNumber=International ISDN Number
labels.user_state=State
labels.state=State

labels.user_postalCode=Postal Code
labels.postalCode=Postal Code
labels.user_physicalDeliveryOfficeName=Office
labels.physicalDeliveryOfficeName=Office
labels.user_destinationIndicator=Destination Indicator
labels.destinationIndicator=Destination Indicator
labels.user_internationaliSDNNumber=International ISDN Number
labels.internationaliSDNNumber=International ISDN Number
labels.user_state=State
labels.state=State

      // Shift value left while iterating logically through the array.
      result |= (input[offset + i] & 0xFFL) << (i * 8);
    }
    return result;
  }

  /**
   * Store 8 bytes into the provided array at the indicated offset, using the value provided.
   *
   * @param sink the output byte array
   * @param offset the offset into the array at which to start writing
   * @param value the value to write
   */

  /**
   * Value of {@link #publicSuffixIndex()} or {@link #registrySuffixIndex()} which indicates that no
   * relevant suffix was found.
   */
  private static final int NO_SUFFIX_FOUND = -1;

  /**
   * Value of {@link #publicSuffixIndexCache} or {@link #registrySuffixIndexCache} which indicates
   * that they were not initialized yet.
   */
  private static final int SUFFIX_NOT_INITIALIZED = -2;

  /**

    public enum StatsAction {
        /** Indicates that a URL was successfully accessed. */
        ACCESSED,
        /** Indicates that an exception occurred during URL access. */
        ACCESS_EXCEPTION,
        /** Indicates that a child URL was discovered. */
        CHILD_URL,
        /** Indicates that multiple child URLs were discovered. */
        CHILD_URLS,
        /** Indicates that a URL was evaluated for crawling eligibility. */

  override fun toString(): String = path.joinToString(separator = " / ")

  companion object {
    /**
     * A synthetic value that indicates there's no more bytes. Values with equivalent data may also
     * show up in ASN.1 streams to also indicate the end of SEQUENCE, SET or other constructed
     * value.
     */
    private val END_OF_DATA =
      DerHeader(

 * @author Jens Nyman
 * @param <N> Node parameter type
 * @param <V> Value parameter type
 */
final class DirectedGraphConnections<N, V> implements GraphConnections<N, V> {
  /**
   * A wrapper class to indicate a node is both a predecessor and successor while still providing
   * the successor value.
   */
  private static final class PredAndSucc {
    private final Object successorValue;

  @Override
  public void remove(Range<K> rangeToRemove) {
    if (rangeToRemove.isEmpty()) {
      return;
    }

    /*
     * The comments for this method will use [ ] to indicate the bounds of rangeToRemove and ( ) to
     * indicate the bounds of ranges in the range map.
     */
    Entry<Cut<K>, RangeMapEntry<K, V>> mapEntryBelowToTruncate =
        entriesByLowerBound.lowerEntry(rangeToRemove.lowerBound);