Елизавета Городищева (Редактор отдела «Экономика»)
around a year ago, we built a regex engine in F# that not only outperformed the ones in dotnet, but went above and beyond competing with every other industrial regex engine on a large set of industry-standard benchmarks. additionally, it supports the full set of boolean operators (union, intersection, complement) and even a form of context-aware lookarounds, which no other engine has while preserving O(n) search-time complexity. the paper was published at POPL 2025, and i figured it’s time to open source the engine and share the story behind it. consider it a much more casual and chatty version of the paper, with more focus on engineering aspects that went into it.
。业内人士推荐PDF资料作为进阶阅读
Benchmarks of Performance-core only Bartlett Lake CPU emerge
МИД Азербайджана отреагировал на атаки иранских дронов14:03
�������ǂނɂ́A�R�����g�̗��p�K���ɓ��ӂ��u�A�C�e�B���f�B�AID�v�����сuITmedia �r�W�l�X�I�����C���ʐM�v�̓o�^���K�v�ł�