*/
  Map<K, V> entriesOnlyOnRight();

  /**
   * Returns an unmodifiable map containing the entries that appear in both maps; that is, the
   * intersection of the two maps.
   */
  Map<K, V> entriesInCommon();

  /**
   * Returns an unmodifiable map describing keys that appear in both maps, but with different
   * values.
   */
  Map<K, ValueDifference<V>> entriesDiffering();

  /**

  Murmur3_32HashFunction(int seed, boolean supplementaryPlaneFix) {
    this.seed = seed;
    this.supplementaryPlaneFix = supplementaryPlaneFix;
  }

  @Override
  public int bits() {
    return 32;
  }

  @Override
  public Hasher newHasher() {
    return new Murmur3_32Hasher(seed);
  }

  @Override
  public String toString() {
    return "Hashing.murmur3_32(" + seed + ")";

import org.jspecify.annotations.Nullable;

/**
 * To be implemented by test generators of things that can contain elements. Such things include
 * both {@link Collection} and {@link Map}; since there isn't an established collective noun that
 * encompasses both of these, 'container' is used.
 *
 * @author George van den Driessche
 */
@GwtCompatible
@NullMarked

 * text during indexing and search operations.
 *
 * <p>Each mapping item consists of one or more input character sequences that are mapped to a single output
 * character sequence. The mapping supports both original values and new values for update operations.</p>
 */
public class CharMappingItem extends DictionaryItem {
    /**
     * Array of input character sequences that will be mapped to the output sequence.

        value = "${spaces}";
        assertEquals("   ", ResourceUtil.resolve(value));

        // Test long property name
        System.setProperty("very.long.property.name.with.many.dots", "long");
        value = "${very.long.property.name.with.many.dots}";
        assertEquals("long", ResourceUtil.resolve(value));

        // Test multiple occurrences of same variable
        System.setProperty("repeat", "X");

    /**
     * Number of bytes processed so far mod. 2 power of 64.
     */
    private long count;

    /**
     * 512 bits input buffer = 16 x 32-bit words holds until reaches 512 bits.
     */
    private byte[] buffer = new byte[BLOCK_LENGTH];

    /**
     * 512 bits work buffer = 16 x 32-bit words
     */
    private final int[] X = new int[16];

    // Constructors

        assertEquals(message, exception.getMessage());
        assertNull(exception.getCause());
    }

    public void test_constructor_withNullMessageAndCause() {
        // Test constructor with both null message and cause
        FessSystemException exception = new FessSystemException(null, null);

        assertNull(exception.getMessage());
        assertNull(exception.getCause());
    }

        value: Int,
        prefixMask: Int,
        bits: Int,
      ) {
        var value = value
        // Write the raw value for a single byte value.
        if (value < prefixMask) {
          out.writeByte(bits or value)
          return
        }

        // Write the mask to start a multibyte value.
        out.writeByte(bits or prefixMask)
        value -= prefixMask

            // "c) bits 7 to 1 of the first subsequent octet shall not all be zero."
            if (0 == tagNo) {
                throw new IOException("corrupted stream - invalid high tag number found");
            }

            while ((b & 0x80) != 0) {
                if (tagNo >>> 24 != 0) {
                    throw new IOException("Tag number more than 31 bits");
                }

  /**
   * Determines whether two possibly-null objects are equal. Returns:
   *
   * <ul>
   *   <li>{@code true} if {@code a} and {@code b} are both null.
   *   <li>{@code true} if {@code a} and {@code b} are both non-null and they are equal according to
   *       {@link Object#equals(Object)}.
   *   <li>{@code false} in all other situations.
   * </ul>
   *