@Beta @GwtCompatible public final class Escapers extends Object
Escaper instances.| Modifier and Type | Class and Description | 
|---|---|
| static class  | Escapers.BuilderA builder for simple, fast escapers. | 
| Modifier and Type | Method and Description | 
|---|---|
| static Escapers.Builder | builder()Returns a builder for creating simple, fast escapers. | 
| static String | computeReplacement(CharEscaper escaper,
                  char c)Returns a string that would replace the given character in the specified escaper, or  nullif no replacement should be made. | 
| static String | computeReplacement(UnicodeEscaper escaper,
                  int cp)Returns a string that would replace the given character in the specified escaper, or  nullif no replacement should be made. | 
| static Escaper | nullEscaper()Returns an  Escaperthat does no escaping, passing all character data through unchanged. | 
public static Escaper nullEscaper()
Escaper that does no escaping, passing all character data through unchanged.public static Escapers.Builder builder()
The initial state of the builder is such that:
safeMin == Character.MIN_VALUE
   safeMax == Character.MAX_VALUE
   unsafeReplacement == null
 For performance reasons escapers created by this builder are not Unicode aware and will not validate the well-formedness of their input.
public static String computeReplacement(CharEscaper escaper, char c)
null if no replacement should be made. This method is intended for use in tests through the
 EscaperAsserts class; production users of CharEscaper should limit themselves
 to its public interface.c - the character to escape if necessarynull if no escaping was neededpublic static String computeReplacement(UnicodeEscaper escaper, int cp)
null if no replacement should be made. This method is intended for use in tests through the
 EscaperAsserts class; production users of UnicodeEscaper should limit
 themselves to its public interface.cp - the Unicode code point to escape if necessarynull if no escaping was neededCopyright © 2010–2018. All rights reserved.