Function getBidiPartAt

external/.scrollLibs.js:1677–1701

(order, ch, sticky)

  var bidiOther = null
  function getBidiPartAt(order, ch, sticky) {
    var found
    bidiOther = null
    for (var i = 0; i < order.length; ++i) {
      var cur = order[i]
      if (cur.from < ch && cur.to > ch) {
        return i
      }
      if (cur.to == ch) {
        if (cur.from != cur.to && sticky == "before") {
          found = i
        } else {
          bidiOther = i
        }
      }
      if (cur.from == ch) {
        if (cur.from != cur.to && sticky != "before") {
          found = i
        } else {
          bidiOther = i
        }
      }
    }
    return found != null ? found : bidiOther
  }

  // Bidirectional ordering algorithm
  // See http://unicode.org/reports/tr9/tr9-13.html for the algorithm