High performance memcached client for Ruby
Repository Index
142,187 visible repositories in the index
1–5 of 5 · Most stars
Find a needle (a document or record) in a haystack using string similarity and (optionally) regular expression rules. Uses Dice's Coefficient (aka Pair Similiarity) and Levenshtein Distance internally.
An Alfred 2 workflow that makes it easy to kill misbehaving processes. It is, in essence, a way to easily find processes by name and kill them using `kill -9`.
Calculates edit distance using Damerau-Levenshtein algorithm
Fast string edit distance computation, using the Damerau-Levenshtein algorithm.