match-string is a javascript function who return a regexp for match a string with all of his accents possible
Match string like Sublime Text
a library that provides a simple and efficient way to match string against glob patterns.
simple persistent cookiejar system
Match a Unicode property or property alias to its canonical property name per the algorithm used for RegExp Unicode property escapes in ECMAScript.
A regex to match any full character, considering weird character ranges.
Get the first path that exists on disk of multiple paths
Convert globs to regular expressions
Match human-quality input to potential matches by edit distance.
A tiny, PEG-like system for building language grammars with regexes.
Match balanced character pairs, like "{" and "}"
Match a Unicode property or property alias to its canonical property name per the algorithm used for RegExp Unicode property escapes in ECMAScript.
Find multiple RegExp matches in a string
A simple function to check whether a mimetype matches the specified mimetype (with wildcard support)
Matches strings against configurable strings, globs, regular expressions, and/or functions
RegExp Match Indices polyfill
Dependency-free request URI matcher
Match balanced character pairs, like "{" and "}"
Regular expression for matching ANSI escape codes
Robust diff, match and patch algorithms to perform operations required for synchronizing plain text
Express style path to RegExp utility
Compile ES2015 Unicode regex to ES5
Provides metadata and conversions from repository urls for GitHub, Bitbucket and GitLab
Match nodes in a unified-latex AST
Lightweight pattern-matching utilities for strings and sequences, with a proc-macro for ergonomic syntax
Proc-macro to provide ergonomic pattern-matching syntax for the `match-string` crate
calculate Jaro Winkler distance.
Flex matching short abbreviations against longer strings is a boon in productivity for typists. Applications like Quicksilver, LaunchBar, and Launchy have made this method of keyboard entry a popular one.
calculate Jaro Winkler distance.
Mustermann is your personal string matching expert. As an expert in the field of strings and patterns, Mustermann keeps its runtime dependencies to a minimum and is fully covered with specs and documentation. Given a string pattern, Mustermann will turn it into an object that behaves like a regular expression and has comparable performance characteristics.
Amatch is a library for approximate string matching and searching in strings. Several algorithms can be used to do this, and it's also possible to compute a similarity metric number between 0.0 and 1.0 for two given strings.
Implements Regexp#match?, String#match? and Symbol#match? in Ruby < 2.4.
Port of http://github.com/sunlightlabs/jellyfish
Parse semantic version strings into comparable objects with support for sorting, finding the latest version, and checking constraint satisfaction.
An algorithm that allows searching for members of a known set of strings appearing as substrings of a larger string in time linear to both the size of the string and the size of the set
Parsey matches a string with a pattern to retrieve data from it.
Helps to match keywords with string of words
== FEATURES/PROBLEMS: * Partial string matching * The algorithm is not particularly performant == SYNOPSIS: require 'goto_string' s = %w(goto_string is a small library that implements a substring matching and ranking algorithm. The matching and ranking is similar to that found in Quicksilver or TextMate) GotoString::Matcher.match('string', s) #=> [["goto_string", "goto_string", 0.679259259259259, [["string", 5]]], ["substring", "substring", 0.461481481481481, [["s", 0], ["tring", 4]]]] An array is returned which contains one entry for each match. Matches are ordered by rank. Each match is itself an array, containing the following elements: [ "original candidate", "matched string", rank, [["substring_1", offset], ["substring_2", offset], ... ] ] You can optionally pass a block to the match method which will get each candidate passed to it. The return value of the block is what will be used for matching. This is so you can pass in arrays of complex objects as candidates: GotoString::Matcher.match( "goto", Project.find(:all) ) do |p| p.name end The resulting matches will contain a reference to the matched string (the project name) as well as the project (the original candidate) == REQUIREMENTS: * None
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.