bitsy-wallet/PDFJet/src/main/java/com/pdfjet/Bidi.java

236 lines
8.0 KiB
Java

/**
* Bidi.java
*
Copyright (c) 2018, Innovatics Inc.
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and / or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package com.pdfjet;
import java.util.*;
/**
* Provides BIDI processing for Arabic and Hebrew.
*
* Please see Example_27.
*/
public class Bidi {
/*
General,Isolated,End,Middle,Beginning
*/
private static char[] forms = new char[] {
'\u0623','\uFE83','\uFE84','\u0623','\u0623',
'\u0628','\uFE8F','\uFE90','\uFE92','\uFE91',
'\u062A','\uFE95','\uFE96','\uFE98','\uFE97',
'\u062B','\uFE99','\uFE9A','\uFE9C','\uFE9B',
'\u062C','\uFE9D','\uFE9E','\uFEA0','\uFE9F',
'\u062D','\uFEA1','\uFEA2','\uFEA4','\uFEA3',
'\u062E','\uFEA5','\uFEA6','\uFEA8','\uFEA7',
'\u062F','\uFEA9','\uFEAA','\u062F','\u062F',
'\u0630','\uFEAB','\uFEAC','\u0630','\u0630',
'\u0631','\uFEAD','\uFEAE','\u0631','\u0631',
'\u0632','\uFEAF','\uFEB0','\u0632','\u0632',
'\u0633','\uFEB1','\uFEB2','\uFEB4','\uFEB3',
'\u0634','\uFEB5','\uFEB6','\uFEB8','\uFEB7',
'\u0635','\uFEB9','\uFEBA','\uFEBC','\uFEBB',
'\u0636','\uFEBD','\uFEBE','\uFEC0','\uFEBF',
'\u0637','\uFEC1','\uFEC2','\uFEC4','\uFEC3',
'\u0638','\uFEC5','\uFEC6','\uFEC8','\uFEC7',
'\u0639','\uFEC9','\uFECA','\uFECC','\uFECB',
'\u063A','\uFECD','\uFECE','\uFED0','\uFECF',
'\u0641','\uFED1','\uFED2','\uFED4','\uFED3',
'\u0642','\uFED5','\uFED6','\uFED8','\uFED7',
'\u0643','\uFED9','\uFEDA','\uFEDC','\uFEDB',
'\u0644','\uFEDD','\uFEDE','\uFEE0','\uFEDF',
'\u0645','\uFEE1','\uFEE2','\uFEE4','\uFEE3',
'\u0646','\uFEE5','\uFEE6','\uFEE8','\uFEE7',
'\u0647','\uFEE9','\uFEEA','\uFEEC','\uFEEB',
'\u0648','\uFEED','\uFEEE','\u0648','\u0648',
'\u064A','\uFEF1','\uFEF2','\uFEF4','\uFEF3',
'\u0622','\uFE81','\uFE82','\u0622','\u0622',
'\u0629','\uFE93','\uFE94','\u0629','\u0629',
'\u0649','\uFEEF','\uFEF0','\u0649','\u0649',
};
private static boolean isArabicLetter(char ch) {
for (int i = 0; i < forms.length; i += 5) {
if (ch == forms[i]) {
return true;
}
}
return false;
}
/**
* Reorders the string so that Arabic and Hebrew text flows from right
* to left while numbers and Latin text flows from left to right.
*
* @param str the input string.
* @return the reordered string.
*/
public static String reorderVisually(String str) {
StringBuilder buf1 = new StringBuilder();
StringBuilder buf2 = new StringBuilder();
boolean right_to_left = true;
for (int i = 0; i < str.length(); i++) {
char ch = str.charAt(i);
if (ch == '\u200E') {
// LRM U+200E LEFT-TO-RIGHT MARK Left-to-right zero-width character
right_to_left = false;
continue;
}
if (ch == '\u200F' || ch == '\u061C') {
// RLM U+200F RIGHT-TO-LEFT MARK Right-to-left zero-width non-Arabic character
// ALM U+061C ARABIC LETTER MARK Right-to-left zero-width Arabic character
right_to_left = true;
continue;
}
if (isArabic(ch) ||
isHebrew(ch) ||
ch == '«' || ch == '»' ||
ch == '(' || ch == ')' ||
ch == '[' || ch == ']') {
right_to_left = true;
if (buf2.length() > 0) {
buf1.append(process(buf2));
buf2.setLength(0);
}
if (ch == '«') {
buf1.append('»');
}
else if (ch == '»') {
buf1.append('«');
}
else if (ch == '(') {
buf1.append(')');
}
else if (ch == ')') {
buf1.append('(');
}
else if (ch == '[') {
buf1.append(']');
}
else if (ch == ']') {
buf1.append('[');
}
else {
buf1.append(ch);
}
}
else if (isAlphaNumeric(ch)) {
right_to_left = false;
buf2.append(ch);
}
else {
if (right_to_left) {
buf1.append(ch);
}
else {
buf2.append(ch);
}
}
}
if (buf2.length() > 0) {
buf1.append(process(buf2));
}
StringBuilder buf3 = new StringBuilder();
for (int i = (buf1.length() - 1); i >= 0; i--) {
char ch = buf1.charAt(i);
if (isArabicLetter(ch)) {
char prev_ch = (i > 0) ? buf1.charAt(i - 1) : '\u0000';
char next_ch = (i < (buf1.length() - 1)) ? buf1.charAt(i + 1) : '\u0000';
for (int j = 0; j < forms.length; j += 5) {
if (ch == forms[j]) {
if (!isArabicLetter(prev_ch) && !isArabicLetter(next_ch)) {
buf3.append(forms[j + 1]); // Isolated
}
else if (isArabicLetter(prev_ch) && !isArabicLetter(next_ch)) {
buf3.append(forms[j + 2]); // End
}
else if (isArabicLetter(prev_ch) && isArabicLetter(next_ch)) {
buf3.append(forms[j + 3]); // Middle
}
else if (!isArabicLetter(prev_ch) && isArabicLetter(next_ch)) {
buf3.append(forms[j + 4]); // Beginning
}
}
}
}
else {
buf3.append(ch);
}
}
return buf3.toString();
}
public static boolean isArabic(char ch) {
return (ch >= 0x600 && ch <= 0x6FF);
}
private static boolean isHebrew(char ch) {
return (ch >= 0x0591 && ch <= 0x05F4);
}
private static boolean isAlphaNumeric(char ch) {
if (ch >= '0' && ch <= '9') {
return true;
}
if (ch >= 'a' && ch <= 'z') {
return true;
}
if (ch >= 'A' && ch <= 'Z') {
return true;
}
return false;
}
private static StringBuilder process(StringBuilder buf) {
StringBuilder buf1 = buf.reverse();
StringBuilder buf2 = new StringBuilder();
StringBuilder buf3 = new StringBuilder();
for (int i = 0; i < buf1.length(); i++) {
char ch = buf1.charAt(i);
if (ch == ' ' || ch == ',' || ch == '.' || ch == '-') {
buf2.append(ch);
continue;
}
buf3.append(buf1.substring(i));
buf3.append(buf2.reverse());
break;
}
return buf3;
}
}