diff options
| author | Stephen Blott | 2016-01-28 16:59:46 +0000 |
|---|---|---|
| committer | Stephen Blott | 2016-01-28 16:59:46 +0000 |
| commit | 4c6c3210639bcf23f33b419963d930743062811a (patch) | |
| tree | e0eb80e68a5f9f3b256678f73abcdd5b1eb28041 /content_scripts/link_hints.coffee | |
| parent | 75463367b337bd600e9c8a9e4d56ca06da341527 (diff) | |
| download | vimium-4c6c3210639bcf23f33b419963d930743062811a.tar.bz2 | |
Simplify hint-string generation; simplification.
Diffstat (limited to 'content_scripts/link_hints.coffee')
| -rw-r--r-- | content_scripts/link_hints.coffee | 9 |
1 files changed, 4 insertions, 5 deletions
diff --git a/content_scripts/link_hints.coffee b/content_scripts/link_hints.coffee index 4ced15f6..61ea1e37 100644 --- a/content_scripts/link_hints.coffee +++ b/content_scripts/link_hints.coffee @@ -444,13 +444,12 @@ class AlphabetHints offset = 0 while hints.length - offset < linkCount or hints.length == 1 hint = hints[offset++] - hints.push hint + ch for ch in @linkHintCharacters + hints.push ch + hint for ch in @linkHintCharacters hints = hints[offset...offset+linkCount] - # This shuffles the hints so that they're scattered; hints starting with the same character are spread - # evenly throughout the array. We reverse each hint, then sort them, then reverse them again. - hints = (hint.split("").reverse().join "" for hint in hints).sort() - return (hint.split("").reverse().join "" for hint in hints) + # Shuffle the hints so that they're scattered; hints starting with the same character are spread evenly + # throughout the array. + return hints.sort().map (str) -> str.reverse() getMatchingHints: (hintMarkers) -> matchString = @hintKeystrokeQueue.join "" |