bidi.js 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327
  1. /**
  2. * @licstart The following is the entire license notice for the
  3. * Javascript code in this page
  4. *
  5. * Copyright 2021 Mozilla Foundation
  6. *
  7. * Licensed under the Apache License, Version 2.0 (the "License");
  8. * you may not use this file except in compliance with the License.
  9. * You may obtain a copy of the License at
  10. *
  11. * http://www.apache.org/licenses/LICENSE-2.0
  12. *
  13. * Unless required by applicable law or agreed to in writing, software
  14. * distributed under the License is distributed on an "AS IS" BASIS,
  15. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  16. * See the License for the specific language governing permissions and
  17. * limitations under the License.
  18. *
  19. * @licend The above is the entire license notice for the
  20. * Javascript code in this page
  21. */
  22. "use strict";
  23. Object.defineProperty(exports, "__esModule", {
  24. value: true
  25. });
  26. exports.bidi = bidi;
  27. var _util = require("../shared/util.js");
  28. const baseTypes = ["BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "S", "B", "S", "WS", "B", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "B", "B", "B", "S", "WS", "ON", "ON", "ET", "ET", "ET", "ON", "ON", "ON", "ON", "ON", "ES", "CS", "ES", "CS", "CS", "EN", "EN", "EN", "EN", "EN", "EN", "EN", "EN", "EN", "EN", "CS", "ON", "ON", "ON", "ON", "ON", "ON", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "ON", "ON", "ON", "ON", "ON", "ON", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "ON", "ON", "ON", "ON", "BN", "BN", "BN", "BN", "BN", "BN", "B", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "BN", "CS", "ON", "ET", "ET", "ET", "ET", "ON", "ON", "ON", "ON", "L", "ON", "ON", "BN", "ON", "ON", "ET", "ET", "EN", "EN", "ON", "L", "ON", "ON", "ON", "EN", "L", "ON", "ON", "ON", "ON", "ON", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "ON", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "L", "ON", "L", "L", "L", "L", "L", "L", "L", "L"];
  29. const arabicTypes = ["AN", "AN", "AN", "AN", "AN", "AN", "ON", "ON", "AL", "ET", "ET", "AL", "CS", "AL", "ON", "ON", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "AL", "AL", "", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "AN", "AN", "AN", "AN", "AN", "AN", "AN", "AN", "AN", "AN", "ET", "AN", "AN", "AL", "AL", "AL", "NSM", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "AL", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "AN", "ON", "NSM", "NSM", "NSM", "NSM", "NSM", "NSM", "AL", "AL", "NSM", "NSM", "ON", "NSM", "NSM", "NSM", "NSM", "AL", "AL", "EN", "EN", "EN", "EN", "EN", "EN", "EN", "EN", "EN", "EN", "AL", "AL", "AL", "AL", "AL", "AL"];
  30. function isOdd(i) {
  31. return (i & 1) !== 0;
  32. }
  33. function isEven(i) {
  34. return (i & 1) === 0;
  35. }
  36. function findUnequal(arr, start, value) {
  37. let j, jj;
  38. for (j = start, jj = arr.length; j < jj; ++j) {
  39. if (arr[j] !== value) {
  40. return j;
  41. }
  42. }
  43. return j;
  44. }
  45. function setValues(arr, start, end, value) {
  46. for (let j = start; j < end; ++j) {
  47. arr[j] = value;
  48. }
  49. }
  50. function reverseValues(arr, start, end) {
  51. for (let i = start, j = end - 1; i < j; ++i, --j) {
  52. const temp = arr[i];
  53. arr[i] = arr[j];
  54. arr[j] = temp;
  55. }
  56. }
  57. function createBidiText(str, isLTR, vertical = false) {
  58. let dir = "ltr";
  59. if (vertical) {
  60. dir = "ttb";
  61. } else if (!isLTR) {
  62. dir = "rtl";
  63. }
  64. return {
  65. str,
  66. dir
  67. };
  68. }
  69. const chars = [];
  70. const types = [];
  71. function bidi(str, startLevel, vertical) {
  72. let isLTR = true;
  73. const strLength = str.length;
  74. if (strLength === 0 || vertical) {
  75. return createBidiText(str, isLTR, vertical);
  76. }
  77. chars.length = strLength;
  78. types.length = strLength;
  79. let numBidi = 0;
  80. let i, ii;
  81. for (i = 0; i < strLength; ++i) {
  82. chars[i] = str.charAt(i);
  83. const charCode = str.charCodeAt(i);
  84. let charType = "L";
  85. if (charCode <= 0x00ff) {
  86. charType = baseTypes[charCode];
  87. } else if (0x0590 <= charCode && charCode <= 0x05f4) {
  88. charType = "R";
  89. } else if (0x0600 <= charCode && charCode <= 0x06ff) {
  90. charType = arabicTypes[charCode & 0xff];
  91. if (!charType) {
  92. (0, _util.warn)("Bidi: invalid Unicode character " + charCode.toString(16));
  93. }
  94. } else if (0x0700 <= charCode && charCode <= 0x08ac) {
  95. charType = "AL";
  96. }
  97. if (charType === "R" || charType === "AL" || charType === "AN") {
  98. numBidi++;
  99. }
  100. types[i] = charType;
  101. }
  102. if (numBidi === 0) {
  103. isLTR = true;
  104. return createBidiText(str, isLTR);
  105. }
  106. if (startLevel === -1) {
  107. if (numBidi / strLength < 0.3) {
  108. isLTR = true;
  109. startLevel = 0;
  110. } else {
  111. isLTR = false;
  112. startLevel = 1;
  113. }
  114. }
  115. const levels = [];
  116. for (i = 0; i < strLength; ++i) {
  117. levels[i] = startLevel;
  118. }
  119. const e = isOdd(startLevel) ? "R" : "L";
  120. const sor = e;
  121. const eor = sor;
  122. let lastType = sor;
  123. for (i = 0; i < strLength; ++i) {
  124. if (types[i] === "NSM") {
  125. types[i] = lastType;
  126. } else {
  127. lastType = types[i];
  128. }
  129. }
  130. lastType = sor;
  131. let t;
  132. for (i = 0; i < strLength; ++i) {
  133. t = types[i];
  134. if (t === "EN") {
  135. types[i] = lastType === "AL" ? "AN" : "EN";
  136. } else if (t === "R" || t === "L" || t === "AL") {
  137. lastType = t;
  138. }
  139. }
  140. for (i = 0; i < strLength; ++i) {
  141. t = types[i];
  142. if (t === "AL") {
  143. types[i] = "R";
  144. }
  145. }
  146. for (i = 1; i < strLength - 1; ++i) {
  147. if (types[i] === "ES" && types[i - 1] === "EN" && types[i + 1] === "EN") {
  148. types[i] = "EN";
  149. }
  150. if (types[i] === "CS" && (types[i - 1] === "EN" || types[i - 1] === "AN") && types[i + 1] === types[i - 1]) {
  151. types[i] = types[i - 1];
  152. }
  153. }
  154. for (i = 0; i < strLength; ++i) {
  155. if (types[i] === "EN") {
  156. for (let j = i - 1; j >= 0; --j) {
  157. if (types[j] !== "ET") {
  158. break;
  159. }
  160. types[j] = "EN";
  161. }
  162. for (let j = i + 1; j < strLength; ++j) {
  163. if (types[j] !== "ET") {
  164. break;
  165. }
  166. types[j] = "EN";
  167. }
  168. }
  169. }
  170. for (i = 0; i < strLength; ++i) {
  171. t = types[i];
  172. if (t === "WS" || t === "ES" || t === "ET" || t === "CS") {
  173. types[i] = "ON";
  174. }
  175. }
  176. lastType = sor;
  177. for (i = 0; i < strLength; ++i) {
  178. t = types[i];
  179. if (t === "EN") {
  180. types[i] = lastType === "L" ? "L" : "EN";
  181. } else if (t === "R" || t === "L") {
  182. lastType = t;
  183. }
  184. }
  185. for (i = 0; i < strLength; ++i) {
  186. if (types[i] === "ON") {
  187. const end = findUnequal(types, i + 1, "ON");
  188. let before = sor;
  189. if (i > 0) {
  190. before = types[i - 1];
  191. }
  192. let after = eor;
  193. if (end + 1 < strLength) {
  194. after = types[end + 1];
  195. }
  196. if (before !== "L") {
  197. before = "R";
  198. }
  199. if (after !== "L") {
  200. after = "R";
  201. }
  202. if (before === after) {
  203. setValues(types, i, end, before);
  204. }
  205. i = end - 1;
  206. }
  207. }
  208. for (i = 0; i < strLength; ++i) {
  209. if (types[i] === "ON") {
  210. types[i] = e;
  211. }
  212. }
  213. for (i = 0; i < strLength; ++i) {
  214. t = types[i];
  215. if (isEven(levels[i])) {
  216. if (t === "R") {
  217. levels[i] += 1;
  218. } else if (t === "AN" || t === "EN") {
  219. levels[i] += 2;
  220. }
  221. } else {
  222. if (t === "L" || t === "AN" || t === "EN") {
  223. levels[i] += 1;
  224. }
  225. }
  226. }
  227. let highestLevel = -1;
  228. let lowestOddLevel = 99;
  229. let level;
  230. for (i = 0, ii = levels.length; i < ii; ++i) {
  231. level = levels[i];
  232. if (highestLevel < level) {
  233. highestLevel = level;
  234. }
  235. if (lowestOddLevel > level && isOdd(level)) {
  236. lowestOddLevel = level;
  237. }
  238. }
  239. for (level = highestLevel; level >= lowestOddLevel; --level) {
  240. let start = -1;
  241. for (i = 0, ii = levels.length; i < ii; ++i) {
  242. if (levels[i] < level) {
  243. if (start >= 0) {
  244. reverseValues(chars, start, i);
  245. start = -1;
  246. }
  247. } else if (start < 0) {
  248. start = i;
  249. }
  250. }
  251. if (start >= 0) {
  252. reverseValues(chars, start, levels.length);
  253. }
  254. }
  255. for (i = 0, ii = chars.length; i < ii; ++i) {
  256. const ch = chars[i];
  257. if (ch === "<" || ch === ">") {
  258. chars[i] = "";
  259. }
  260. }
  261. return createBidiText(chars.join(""), isLTR);
  262. }