This repository has been archived by the owner on Aug 11, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 3k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
support abbreviated versions of commands
- Loading branch information
Showing
2 changed files
with
160 additions
and
38 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,106 @@ | ||
|
||
module.exports = exports = abbrev.abbrev = abbrev | ||
|
||
abbrev.monkeyPatch = monkeyPatch | ||
|
||
function monkeyPatch () { | ||
Array.prototype.abbrev = function () { return abbrev(this) } | ||
Object.prototype.abbrev = function () { return abbrev(Object.keys(this)) } | ||
} | ||
|
||
function abbrev (list) { | ||
if (arguments.length !== 1 || !Array.isArray(list)) { | ||
list = Array.prototype.slice.call(arguments, 0) | ||
} | ||
for (var i = 0, l = list.length, args = [] ; i < l ; i ++) { | ||
args[i] = typeof list[i] === "string" ? list[i] : String(list[i]) | ||
} | ||
|
||
// sort them lexicographically, so that they're next to their nearest kin | ||
args = args.sort(lexSort) | ||
|
||
// walk through each, seeing how much it has in common with the next and previous | ||
var abbrevs = {} | ||
, prev = "" | ||
for (var i = 0, l = args.length ; i < l ; i ++) { | ||
var current = args[i] | ||
, next = args[i + 1] || "" | ||
, nextMatches = true | ||
, prevMatches = true | ||
if (current === next) continue | ||
for (var j = 0, cl = current.length ; j < cl ; j ++) { | ||
var curChar = current.charAt(j) | ||
nextMatches = nextMatches && curChar === next.charAt(j) | ||
prevMatches = prevMatches && curChar === prev.charAt(j) | ||
if (nextMatches || prevMatches) continue | ||
else { | ||
j ++ | ||
break | ||
} | ||
} | ||
prev = current | ||
if (j === cl) { | ||
abbrevs[current] = current | ||
continue | ||
} | ||
for (var a = current.substr(0, j) ; j <= cl ; j ++) { | ||
abbrevs[a] = current | ||
a += current.charAt(j) | ||
} | ||
} | ||
return abbrevs | ||
} | ||
|
||
function lexSort (a, b) { | ||
return a === b ? 0 : a > b ? 1 : -1 | ||
} | ||
|
||
|
||
// tests | ||
if (module === require.main) { | ||
|
||
var assert = require("assert") | ||
, sys | ||
sys = require(process.binding("native").util ? "util" : "sys") | ||
|
||
console.log("running tests") | ||
function test (list, expect) { | ||
var actual = abbrev(list) | ||
assert.deepEqual(actual, expect, | ||
"abbrev("+sys.inspect(list)+") === " + sys.inspect(expect) + "\n"+ | ||
"actual: "+sys.inspect(actual)) | ||
actual = abbrev.apply(exports, list) | ||
assert.deepEqual(abbrev.apply(exports, list), expect, | ||
"abbrev("+list.map(JSON.stringify).join(",")+") === " + sys.inspect(expect) + "\n"+ | ||
"actual: "+sys.inspect(actual)) | ||
} | ||
|
||
test([ "ruby", "ruby", "rules", "rules", "rules" ], | ||
{ rub: 'ruby' | ||
, ruby: 'ruby' | ||
, rul: 'rules' | ||
, rule: 'rules' | ||
, rules: 'rules' | ||
}) | ||
test(["fool", "foom", "pool", "pope"], | ||
{ fool: 'fool' | ||
, foom: 'foom' | ||
, poo: 'pool' | ||
, pool: 'pool' | ||
, pop: 'pope' | ||
, pope: 'pope' | ||
}) | ||
test(["a", "ab", "abc", "abcd", "abcde", "acde"], | ||
{ a: 'a' | ||
, ab: 'ab' | ||
, abc: 'abc' | ||
, abcd: 'abcd' | ||
, abcde: 'abcde' | ||
, ac: 'acde' | ||
, acd: 'acde' | ||
, acde: 'acde' | ||
}) | ||
|
||
console.log("pass") | ||
|
||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters