(s)
| 20986 | ) |
| 20987 | } |
| 20988 | function doEndMatch(s) { |
| 20989 | const i = s[0], |
| 20990 | a = o.substr(s.index), |
| 20991 | u = endOfMode(U, s, a) |
| 20992 | if (!u) return we |
| 20993 | const _ = U |
| 20994 | _.skip |
| 20995 | ? (Y += i) |
| 20996 | : (_.returnEnd || _.excludeEnd || (Y += i), |
| 20997 | processBuffer(), |
| 20998 | _.excludeEnd && (Y = i)) |
| 20999 | do { |
| 21000 | ;(U.className && z.closeNode(), |
| 21001 | U.skip || U.subLanguage || (Z += U.relevance), |
| 21002 | (U = U.parent)) |
| 21003 | } while (U !== u.parent) |
| 21004 | return ( |
| 21005 | u.starts && |
| 21006 | (u.endSameAsBegin && (u.starts.endRe = u.endRe), startNewMode(u.starts)), |
| 21007 | _.returnEnd ? 0 : i.length |
| 21008 | ) |
| 21009 | } |
| 21010 | let C = {} |
| 21011 | function processLexeme(i, u) { |
| 21012 | const w = u && u[0] |
no test coverage detected