/**
 * Tests {@link SingletonImmutableTable}.
 *
 * @author Gregory Kick
 */
@GwtCompatible
@NullMarked
public class SingletonImmutableTableTest extends AbstractImmutableTableTest {
  private final ImmutableTable<Character, Integer, String> testTable =
      new SingletonImmutableTable<>('a', 1, "blah");

  public void testHashCode() {
    assertEquals(Objects.hash('a', 1, "blah"), testTable.hashCode());
  }

     * The path separator is {@code /} on all platforms, including Windows.
     * The prefix before the {@code :} character, if present and longer than 1 character, is the syntax.
     * If no syntax is specified, or if its length is 1 character (interpreted as a Windows drive),
     * the default is a Maven-specific variation of the {@code "glob"} pattern.
     *

    Set<Character> positive = Sets.newHashSetWithExpectedSize(chars.length);
    for (char c : chars) {
      positive.add(c);
    }
    for (int c = 0; c <= Character.MAX_VALUE; c++) {
      assertFalse(positive.contains(Character.valueOf((char) c)) ^ m.matches((char) c));
    }
  }

  static char[] randomChars(Random rand, int size) {
    Set<Character> chars = new HashSet<>(size);

    super(false, true, true, false);
  }

  @Override
  Table<Integer, String, Character> makeTable() {
    Table<Integer, String, String> original = HashBasedTable.create();
    return transformValues(original, FIRST_CHARACTER);
  }

  @Override
  protected Map<String, Map<Integer, Character>> makePopulatedMap() {
    Table<Integer, String, String> table = HashBasedTable.create();

    super(false, true, true, true);
  }

  @Override
  Table<String, Integer, Character> makeTable() {
    Table<String, Integer, String> original = HashBasedTable.create();
    return transformValues(original, TableCollectionTest.FIRST_CHARACTER);
  }

  @Override
  protected Map<String, Map<Integer, Character>> makePopulatedMap() {
    Table<String, Integer, String> table = HashBasedTable.create();

#
&
^
$
@
!
~
:
;
+
/
\
《
》
—
－
，
。
、
：
；
！
·
？
“
”
）
（
【
】
［
］
●
# the line below contains an IDEOGRAPHIC SPACE character (Used as a space in Chinese)
　

# English Stop Words

        while (i < bytes.length) {
            byte b = bytes[i];
            if ((b & 0x80) == 0) {
                // Single byte character
                chars[charIndex++] = (char) b;
                i++;
            } else if ((b & 0xE0) == 0xC0) {
                // Two byte character
                if (i + 1 < bytes.length) {
                    chars[charIndex++] = (char) (((b & 0x1F) << 6) | (bytes[i + 1] & 0x3F));

    @ValidateTypeFailure
    public Integer crudMode;

    /** The name of the file configuration (required, maximum 200 characters). */
    @Required
    @Size(max = 200)
    public String name;

    /** The description of the file configuration (maximum 1000 characters). */
    @Size(max = 1000)
    public String description;

    /** The file paths to crawl (required, must be valid file URIs). */

  }

  /**
   * Parses a trie node and returns the number of characters consumed.
   *
   * @param stack The prefixes that precede the characters represented by this node. Each entry of
   *     the stack is in reverse order.
   * @param encoded The serialized trie.
   * @param start An index in the encoded serialized trie to begin reading characters from.
   * @param builder A map builder to which all entries will be added.

 * <td>bytes</td>
 * <td>characters</td>
 * <td>bytes, characters</td>
 * <td>characters</td>
 * </tr>
 * <tr>
 * <th>{@link Reader}</th>
 * <td>characters</td>
 * <td>characters</td>
 * <td>characters</td>
 * <td>characters</td>
 * </tr>
 * <tr>
 * <th>{@link File}</th>
 * <td>bytes</td>
 * <td>characters</td>
 * <td>bytes, characters</td>
 * <td>characters</td>
 * </tr>
 * <tr>