Подростки распылили перцовый баллончик на пассажиров электрички под Петербургом20:54
3014353410http://paper.people.com.cn/rmrb/pc/content/202603/05/content_30143534.htmlhttp://paper.people.com.cn/rmrb/pad/content/202603/05/content_30143534.html11921 坚定制度自信 实现良好开局（社论）
，更多细节参见同城约会
Российский телеведущий пожаловался на испражняющихся на улицах одной страны людей20:47，更多细节参见快连下载安装
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.