Explore >> Select a destination
|
You are here 
|
docs.rs | ||
| | | | |
blog.burntsushi.net
|
|
| | | | | I blog mostly about my own programming projects. | |
| | | | |
blog.stevenlevithan.com
|
|
| | | | | Over the last few years, I've occasionally commented on JavaScript's RegExp API, syntax, and behavior on the ES-Discuss mailing list. Recently, JavaScript inventor Brendan Eich suggested that, in order to get more discussion going, I write up a list of regex changes to consider for future ECMAScript standards (or as he humorously put it, have... | |
| | | | |
github.com
|
|
| | | | | A low level regular expression library that uses deterministic finite automata. - BurntSushi/regex-automata | |
| | | | |
blog.nelhage.com
|
|
| | | Back in January of 2012, Russ Cox posted an excellent blog post detailing how Google Code Search had worked, using a trigram index. By that point, I'd already implemented early versions of my own livegrep source-code search engine, using a different indexing approach that I developed independently, with input from a few friends. This post is my long-overdue writeup of how it works. Suffix Arrays A suffix array is a data structure used for full-text search and other applications, primarily these days in the field of bioinformatics. | ||
