String string = o.toString();
                            int i = string.length() - 1;
                            while (i >= 0) {
                                char c = string.charAt(i);
                                if (c == '\n' || c == '\r' || c == ' ') {
                                    i--;
                                } else {
                                    break;

        if (matchWordFirst && !hiraganaQuery && singleWordQuery && text.contains(query)) {
            if (query.length() == 1) {
                return UnicodeBlock.of(query.charAt(0)) != UnicodeBlock.HIRAGANA;
            }
            return true;
        }
        return false;
    }

    public static final String MIN_ELEMENT = "a";
    public static final String AFTER_LAST = "z";
    public static final String AFTER_LAST_2 = "zz";
  }

  public static class Chars extends SampleElements<Character> {
    public Chars() {
      // elements aren't sorted, to better test SortedSet iteration ordering
      super('b', 'a', 'c', 'd', 'e');
    }
  }

  public static class Enums extends SampleElements<AnEnum> {

  private final char innerNodeCode;

  /** The character used for a leaf node in the trie encoding */
  private final char leafNodeCode;

  PublicSuffixType(char innerNodeCode, char leafNodeCode) {
    this.innerNodeCode = innerNodeCode;
    this.leafNodeCode = leafNodeCode;
  }

  char getLeafNodeCode() {
    return leafNodeCode;
  }

  char getInnerNodeCode() {
    return innerNodeCode;

        assertNotNull(result);
        // Hexdump uses uppercase letters
        // Note: completionFilter is displayed with 4 hex chars, not 8
        assertTrue(result.contains("fid=0xFFFF"));
        assertTrue(result.contains("filter=0xFFFF")); // Only 4 hex chars are shown
        assertTrue(result.contains("watchTree=true"));
    }

    @Test
    @DisplayName("Test toString method with zero values")

    public Escaper build() {
      return new ArrayBasedCharEscaper(replacementMap, safeMin, safeMax) {
        private final char @Nullable [] replacementChars =
            unsafeReplacement != null ? unsafeReplacement.toCharArray() : null;

        @Override
        protected char @Nullable [] escapeUnsafe(char c) {
          return replacementChars;
        }
      };
    }
  }

  /**

        assertEquals("abc", permissionHelper.encode("abc"));
        assertEquals("abc", permissionHelper.decode("abc"));

        assertEquals("special@chars", permissionHelper.encode("special@chars"));
        assertEquals("special@chars", permissionHelper.decode("special@chars"));
    }

    }
  }

  public void testUtf8() {
    char[] charsA = new char[128];
    char[] charsB = new char[128];

    for (int i = 0; i < charsA.length; i++) {
      if (i < 100) {
        charsA[i] = 'a';
        charsB[i] = 'a';
      } else {
        // Both two-byte characters, but must be different
        charsA[i] = (char) (0x0180 + i);
        charsB[i] = (char) (0x0280 + i);
      }
    }

  static CharEscaper createSimpleCharEscaper(ImmutableMap<Character, char[]> replacementMap) {
    return new CharEscaper() {
      @Override
      protected char @Nullable [] escape(char c) {
        return replacementMap.get(c);
      }
    };
  }

  // A trivial non-optimized escaper for testing.
  static UnicodeEscaper createSimpleUnicodeEscaper(ImmutableMap<Integer, char[]> replacementMap) {
    return new UnicodeEscaper() {

TF_Function* TF_GraphToFunctionWithControlOutputs(
    const TF_Graph* fn_body, const char* fn_name,
    unsigned char append_hash_to_fn_name, int num_opers,
    const TF_Operation* const* opers, int ninputs, const TF_Output* inputs,
    int noutputs, const TF_Output* outputs, const char* const* output_names,
    int ncontrol_outputs, const TF_Operation* const* control_outputs,
    const char* const* control_output_names, const TF_FunctionOptions* opts,