Browse by Keyword: "matching"
bipartite-matching Maximum unweighted bipartite matching
bipartite-vertex-cover Minimal vertex cover for bipartite graphs
bop Bop is a very fast Boyer-Moore parser/matcher optimized for string and buffer patterns (<= 255 bytes), then it is ideal for parsing multipart/form-data streams, that have a pattern / boundary length < ~70 bytes.
clj-fuzzy A handy collection of algorithms dealing with fuzzy strings and phonetics.
coffee-pattern coffee-pattern: write pattern matching in CoffeeScript syntax
file-pattern Flexible pattern matching library for filenames and paths.
func-match Functional pettern matching
fuzzy.js Approximate (fuzzy) string matching just like you are used to from Sublime Text and others.
grunt-to-double-quotes Replaces single ( escaped or otherwise ) quotes with double quotes.
grunt-to-single-quotes Replaces double ( escaped or otherwise ) quotes with single quotes.
grunt-wildamd Grunt task to generate AMD namespace modules from module dependencies that use globbing (pattern matching) syntax
levenshtein-damerau A quick and easy Damerau Levenshtein implementation (not a Levenshtein only operation which doesn't do look aheads or transpositions).
murl murl is fast url pattern matching and replacing
node-match Simple chain pattern matching library for node.js
phase-align Finds patterns in ndarrays
skodld A quick and easy Damerau Levenshtein implementation (not a Levenshtein only operation which doesn't do look aheads or transpositions).
splearch Pattern matching regex abstraction based on Ruby's Dir.glob
to-double-quotes Convert matching single-quotes to double-quotes: I 'love' unicorns => I "love" unicorns
to-single-quotes Convert matching double-quotes to single-quotes: I "love" unicorns => I 'love' unicorns
url-pattern url-pattern is easy pattern matching and segment extraction for urls, domains, filepaths and any string composed of segments joined by a seperator character