public void testSimpleEscaper() { UnicodeEscaper e = SIMPLE_ESCAPER; String expected = "[0]abyz[128][256][2048][4096]ABYZ[65535]" + "[" + Character.MIN_SUPPLEMENTARY_CODE_POINT + "]" + "0189[" + Character.MAX_CODE_POINT + "]"; assertEquals(expected, escapeAsString(e, TEST_STRING)); }
public void testGrowBuffer() { // need to grow past an initial 1024 byte buffer StringBuilder input = new StringBuilder(); StringBuilder expected = new StringBuilder(); for (int i = 256; i < 1024; i++) { input.append((char) i); expected.append("[" + i + "]"); } assertEquals(expected.toString(), SIMPLE_ESCAPER.escape(input.toString())); }
public void testNopEscaper() { UnicodeEscaper e = NOP_ESCAPER; assertEquals(TEST_STRING, escapeAsString(e, TEST_STRING)); }
public void testFalsePositivesForNextEscapedIndex() { UnicodeEscaper e = new UnicodeEscaper() { // Canonical escaper method that only escapes lower case ASCII letters. @Override protected char[] escape(int cp) { return ('a' <= cp && cp <= 'z') ? new char[] {Character.toUpperCase((char) cp)} : null; } // Inefficient implementation that defines all letters as escapable. @Override protected int nextEscapeIndex(CharSequence csq, int index, int end) { while (index < end && !Character.isLetter(csq.charAt(index))) { index++; } return index; } }; assertEquals("\0HELLO \uD800\uDC00 WORLD!\n", e.escape("\0HeLLo \uD800\uDC00 WorlD!\n")); }
public void testSurrogatePairs() { UnicodeEscaper e = SIMPLE_ESCAPER; // Build up a range of surrogate pair characters to test final int min = Character.MIN_SUPPLEMENTARY_CODE_POINT; final int max = Character.MAX_CODE_POINT; final int range = max - min; final int s1 = min + (1 * range) / 4; final int s2 = min + (2 * range) / 4; final int s3 = min + (3 * range) / 4; final char[] dst = new char[12]; // Put surrogate pairs at odd indices so they can be split easily dst[0] = 'x'; Character.toChars(min, dst, 1); Character.toChars(s1, dst, 3); Character.toChars(s2, dst, 5); Character.toChars(s3, dst, 7); Character.toChars(max, dst, 9); dst[11] = 'x'; String test = new String(dst); // Get the expected result string String expected = "x[" + min + "][" + s1 + "][" + s2 + "][" + s3 + "][" + max + "]x"; assertEquals(expected, escapeAsString(e, test)); }
public void testSimpleEscaper() { UnicodeEscaper e = SIMPLE_ESCAPER; String expected = "[0]abyz[128][256][2048][4096]ABYZ[65535]" + "[" + Character.MIN_SUPPLEMENTARY_CODE_POINT + "]" + "0189[" + Character.MAX_CODE_POINT + "]"; assertEquals(expected, escapeAsString(e, TEST_STRING)); }
public void testGrowBuffer() { // need to grow past an initial 1024 byte buffer StringBuilder input = new StringBuilder(); StringBuilder expected = new StringBuilder(); for (int i = 256; i < 1024; i++) { input.append((char) i); expected.append("[" + i + "]"); } assertEquals(expected.toString(), SIMPLE_ESCAPER.escape(input.toString())); }
public void testNopEscaper() { UnicodeEscaper e = NOP_ESCAPER; assertEquals(TEST_STRING, escapeAsString(e, TEST_STRING)); }
public void testFalsePositivesForNextEscapedIndex() { UnicodeEscaper e = new UnicodeEscaper() { // Canonical escaper method that only escapes lower case ASCII letters. @Override protected char[] escape(int cp) { return ('a' <= cp && cp <= 'z') ? new char[] { Character.toUpperCase((char) cp) } : null; } // Inefficient implementation that defines all letters as escapable. @Override protected int nextEscapeIndex(CharSequence csq, int index, int end) { while (index < end && !Character.isLetter(csq.charAt(index))) { index++; } return index; } }; assertEquals("\0HELLO \uD800\uDC00 WORLD!\n", e.escape("\0HeLLo \uD800\uDC00 WorlD!\n")); }
public void testSurrogatePairs() { UnicodeEscaper e = SIMPLE_ESCAPER; // Build up a range of surrogate pair characters to test final int min = Character.MIN_SUPPLEMENTARY_CODE_POINT; final int max = Character.MAX_CODE_POINT; final int range = max - min; final int s1 = min + (1 * range) / 4; final int s2 = min + (2 * range) / 4; final int s3 = min + (3 * range) / 4; final char[] dst = new char[12]; // Put surrogate pairs at odd indices so they can be split easily dst[0] = 'x'; Character.toChars(min, dst, 1); Character.toChars(s1, dst, 3); Character.toChars(s2, dst, 5); Character.toChars(s3, dst, 7); Character.toChars(max, dst, 9); dst[11] = 'x'; String test = new String(dst); // Get the expected result string String expected = "x[" + min + "][" + s1 + "][" + s2 + "][" + s3 + "][" + max + "]x"; assertEquals(expected, escapeAsString(e, test)); }