both of these approaches use NFAs under the hood, which means O(m * n) matching. our approach is fundamentally different: we encode lookaround information directly in the automaton via derivatives, which gives us O(n) matching with a small constant. the trade-off is that we restrict lookarounds to a normalized form (?<=R1)R2(?=R3) where R1/R2/R3 themselves don’t contain lookarounds. the oracle-based approaches support more general nesting, but pay for it in the matching loop. one open question i have is how they handle memory for the oracle table - if you read a gigabyte of text, do you keep a gigabyte-sized table in memory for each lookaround in the pattern?
«Били в одно место». Российский газовоз уничтожен украинскими дронами в Средиземном море. Что известно об атаке и судьбе моряков14:20
，这一点在safew官方版本下载中也有详细论述
‘암살자’ B-2 이어 ‘죽음의 백조’ B-1B 떴다…美 “이란 미사일시설 초토화”
The true impact of the wet winter may not be visible until spring, when butterflies that usually fill hedgerows and gardens may be noticeably absent.
，这一点在heLLoword翻译官方下载中也有详细论述
Feel free to comment in English below o/，这一点在safew官方版本下载中也有详细论述
nvcc 可用 （nvcc --version）