public static String reverseWithBrackets(CharSequence s) { char[] c = new char[s.length()]; for (int i = c.length - 1, r = 0; i >= 0; i--, r++) { c[r] = matchBracket(s.charAt(i)); } return String.valueOf(c); }
public boolean reverseBracketEqual(String left, String right) { if(left == null) return right == null; if(right == null) return false; if(left.length() != right.length()) return false; for (int l = 0, r = right.length() - 1; r >= 0; r--, l++) { if(left.charAt(l) != matchBracket(right.charAt(r))) return false; } return true; }
t = Category.caseFold(t); if((modes & PerlSubstitution.MODE_BRACKET) > 0) t = Category.matchBracket(t); working[i] = t; t = Category.caseFold(t); if((modes & PerlSubstitution.MODE_BRACKET) > 0) t = Category.matchBracket(t); working[i] = t;
t = Category.caseFold(t); if((modes & PerlSubstitution.MODE_BRACKET) > 0) t = Category.matchBracket(t); working[i] = t; t = Category.caseFold(t); if((modes & PerlSubstitution.MODE_BRACKET) > 0) t = Category.matchBracket(t); working[i] = t;
private static boolean compareRegionsReverse(char[] arr, int off1, int off2, int len, int out, boolean insensitive, boolean bracket) { int p1 = off1 + len - 1; int p2 = off2; if (p1 >= out || p2 >= out) { return false; } char a, b; for (int c = len; c > 0 && p2 < out; c--, p1--, p2++) { a = arr[p1]; b = arr[p2]; if(insensitive) { a = Category.caseFold(a); b = Category.caseFold(b); } if(bracket) { b = Category.matchBracket(b); } if (a != b) { return false; } } return true; }
private static boolean compareRegionsReverse(char[] arr, int off1, int off2, int len, int out, boolean insensitive, boolean bracket) { int p1 = off1 + len - 1; int p2 = off2; if (p1 >= out || p2 >= out) { return false; } char a, b; for (int c = len; c > 0 && p2 < out; c--, p1--, p2++) { a = arr[p1]; b = arr[p2]; if(insensitive) { a = Category.caseFold(a); b = Category.caseFold(b); } if(bracket) { b = Category.matchBracket(b); } if (a != b) { return false; } } return true; }
private static boolean compareRegionsForward(char[] arr, int off1, int off2, int len, int out, boolean insensitive, boolean bracket) { int p1 = off1 + len - 1; int p2 = off2 + len - 1; if (p1 >= out || p2 >= out) { return false; } char a, b; for (int c = len; c > 0; c--, p1--, p2--) { a = arr[p1]; b = arr[p2]; if(insensitive) { a = Category.caseFold(a); b = Category.caseFold(b); } if(bracket) { b = Category.matchBracket(b); } if (a != b) { return false; } } return true; } private static boolean compareRegionsReverse(char[] arr, int off1, int off2, int len, int out,
private static boolean compareRegionsForward(char[] arr, int off1, int off2, int len, int out, boolean insensitive, boolean bracket) { int p1 = off1 + len - 1; int p2 = off2 + len - 1; if (p1 >= out || p2 >= out) { return false; } char a, b; for (int c = len; c > 0; c--, p1--, p2--) { a = arr[p1]; b = arr[p2]; if(insensitive) { a = Category.caseFold(a); b = Category.caseFold(b); } if(bracket) { b = Category.matchBracket(b); } if (a != b) { return false; } } return true; } private static boolean compareRegionsReverse(char[] arr, int off1, int off2, int len, int out,
t = Category.caseFold(t); if((modes & PerlSubstitution.MODE_BRACKET) > 0) t = Category.matchBracket(t); working[i] = t; t = Category.caseFold(t); if((modes & PerlSubstitution.MODE_BRACKET) > 0) t = Category.matchBracket(t); working[i] = t;
t = Category.caseFold(t); if((modes & PerlSubstitution.MODE_BRACKET) > 0) t = Category.matchBracket(t); working[i] = t; t = Category.caseFold(t); if((modes & PerlSubstitution.MODE_BRACKET) > 0) t = Category.matchBracket(t); working[i] = t;