Function isolatingRunSequences has 59 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function isolatingRunSequences(paragraphCodepoints, paragraphBidiTypes, paragraphLevel = 0) {
  // [1]: By X9., we remove control characters that are not
  //      needed at this stage in bidi algorithm
  const { runs, bidiTypes, levels } = levelRuns(paragraphCodepoints, paragraphBidiTypes, paragraphLevel);

Function resolveBrackets has 58 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function resolveBrackets(bidiTypes, points, sos, eos, level, bidiTypesBeforeW1) {
  // [1]: If any strong type (either L or R) matching the embedding direction
  //      is found, set the type for both brackets in the pair to
  //      match the embedding direction.
  const pairs = bracketPairs(points);

Function bracketPairs has a Cognitive Complexity of 15 (exceeds 5 allowed). Consider refactoring.

Open

function bracketPairs(points, bidiTypes) {
  // [1]: Sort the list of pairs of text positions in ascending order
  //      based on the text position of the opening paired bracket.
  // [*]: "If an opening paired bracket is found and there is no room in the stack,
  //       stop processing BD16 for the remainder of the isolating run sequence."

• Read up
  Read up

Function resolvedWeaksForSequence has 43 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function resolvedWeaksForSequence(codepoints, bidiTypes, sequence) {
  // merge together all the codepoint-slices and bidiType-slices
  // that each run in the sequence take
  const paragraph = codepoints.zip(bidiTypes);
  const [ codepointsFromSequence, bidiTypesFromSequence ] = unzip(

Function levelRuns has 36 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function levelRuns(codepoints, bidiTypes, paragraphLevel = 0) {
  const rules = [
    rle,   // X2.
    lre,   // X3.
    rlo,   // X4.

Function matchingPDIForIndex has a Cognitive Complexity of 12 (exceeds 5 allowed). Consider refactoring.

Open

function matchingPDIForIndex(codepoints, index) {
  if (index >= codepoints.size) { return -1; }
  if (!includes([LRI, RLI, FSI], codepoints.get(index))) { return -1; }

  const after = codepoints.slice(index + 1);

• Read up
  Read up

Function pdi has 34 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function pdi(ch, bidiType, index, state) {
  if (ch !== PDI) return state;
  const isolateOverflow = state.get('overflowIsolateCount');
  const validIsolateCount = state.get('validIsolateCount');

Function bracketPairs has 33 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function bracketPairs(points, bidiTypes) {
  // [1]: Sort the list of pairs of text positions in ascending order
  //      based on the text position of the opening paired bracket.
  // [*]: "If an opening paired bracket is found and there is no room in the stack,
  //       stop processing BD16 for the remainder of the isolating run sequence."

Function pdi has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

function pdi(ch, bidiType, index, state) {
  if (ch !== PDI) return state;
  const isolateOverflow = state.get('overflowIsolateCount');
  const validIsolateCount = state.get('validIsolateCount');

• Read up
  Read up

Function lri has 31 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function lri(ch, bidiType, index, state) {
  if (ch !== LRI) return state;
  const lastEntry = state.get('directionalStatusStack').peek();
  const lastLevel = lastEntry.get('level');

Function rli has 31 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function rli(ch, bidiType, index, state) {
  if (ch !== RLI) return state;
  const lastEntry = state.get('directionalStatusStack').peek();
  const lastLevel = lastEntry.get('level');

Function rli has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

function rli(ch, bidiType, index, state) {
  if (ch !== RLI) return state;
  const lastEntry = state.get('directionalStatusStack').peek();
  const lastLevel = lastEntry.get('level');

• Read up
  Read up

Function lri has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

function lri(ch, bidiType, index, state) {
  if (ch !== LRI) return state;
  const lastEntry = state.get('directionalStatusStack').peek();
  const lastLevel = lastEntry.get('level');

• Read up
  Read up

Function finalState has 27 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  const finalState = points.reduce((state, point, position) => {
    if (state.get('stackoverflow') === true) return state; // [*]

    const stack = state.get('stack');

Function rlo has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

function rlo(ch, bidiType, index, state) {
  if (ch !== RLO) return state;

  const lastLevel = state.get('directionalStatusStack').peek().get('level');
  const isolate = state.get('overflowIsolateCount');

• Read up
  Read up

Function lro has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

function lro(ch, bidiType, index, state) {
  if (ch !== LRO) return state;

  const lastLevel = state.get('directionalStatusStack').peek().get('level');
  const isolate = state.get('overflowIsolateCount');

• Read up
  Read up

Function fsi has 6 arguments (exceeds 4 allowed). Consider refactoring.

Open

function fsi(codepoint, bidiType, index, state, codepoints, bidiTypes) {

Function resolveBrackets has 6 arguments (exceeds 4 allowed). Consider refactoring.

Open

function resolveBrackets(bidiTypes, points, sos, eos, level, bidiTypesBeforeW1) {

Function resolveRemaining has 5 arguments (exceeds 4 allowed). Consider refactoring.

Open

function resolveRemaining(types, codepoints, sos, eos, level) {

Function enToL has 5 arguments (exceeds 4 allowed). Consider refactoring.

Open

function enToL(types, points, sos, eos, level) {