(s, o)
| 10010 | return s |
| 10011 | } |
| 10012 | function Ke(s, o) { |
| 10013 | var i, |
| 10014 | a = Je(s) |
| 10015 | for (s = 0; a; ) { |
| 10016 | if (3 === a.nodeType) { |
| 10017 | if (((i = s + a.textContent.length), s <= o && i >= o)) |
| 10018 | return { node: a, offset: o - s } |
| 10019 | s = i |
| 10020 | } |
| 10021 | e: { |
| 10022 | for (; a; ) { |
| 10023 | if (a.nextSibling) { |
| 10024 | a = a.nextSibling |
| 10025 | break e |
| 10026 | } |
| 10027 | a = a.parentNode |
| 10028 | } |
| 10029 | a = void 0 |
| 10030 | } |
| 10031 | a = Je(a) |
| 10032 | } |
| 10033 | } |
| 10034 | function Le(s, o) { |
| 10035 | return ( |
| 10036 | !(!s || !o) && |