twin/xmonad-contrib
1
0
Fork 0
mirror of https://github.com/xmonad/xmonad-contrib.git synced 2025-08-01 12:41:52 -07:00
Code Issues Packages Projects Releases Wiki Activity

Fix -Wincomplete-uni-patterns warnings

Browse Source 
I am not proud of this.
This commit is contained in:
Tomas Janousek
2021-10-31 17:14:59 +00:00
parent 5f3a6210a2
commit 8197cd9105
29 changed files with 124 additions and 105 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
XMonad/Prompt/FuzzyMatch.hs
View File

@@ -20,6 +20,7 @@ module XMonad.Prompt.FuzzyMatch ( -- * Usage
) where
import XMonad.Prelude
import qualified Data.List.NonEmpty as NE
-- $usage
--
@@ -84,12 +85,12 @@ rankMatch q s = (if null matches then (maxBound, maxBound) else minimum matches,
rankMatches :: String -> String -> [(Int, Int)]
rankMatches [] _ = [(0, 0)]
rankMatches q s = map (\(l, r) -> (r - l, l)) $ findShortestMatches q s
rankMatches (q:qs) s = map (\(l, r) -> (r - l, l)) $ findShortestMatches (q :| qs) s
findShortestMatches :: String -> String -> [(Int, Int)]
findShortestMatches :: NonEmpty Char -> String -> [(Int, Int)]
findShortestMatches q s = foldl' extendMatches spans oss
where (os:oss) = map (findOccurrences s) q
spans = [(o, o) | o <- os]
where (os :| oss) = NE.map (findOccurrences s) q
spans = [(o, o) | o <- os]
findOccurrences :: String -> Char -> [Int]
findOccurrences s c = map snd $ filter ((toLower c ==) . toLower . fst) $ zip s [0..]