ilyakooo0/vty
1
0
Fork 0
mirror of https://github.com/ilyakooo0/vty.git synced 2024-12-01 14:36:27 +03:00
Code Issues Projects Releases Wiki Activity

When looking at input for an event, don't look too deep.

Browse Source
This commit is contained in:
Dmitry Ivanov 2014-09-22 02:44:09 +07:00
parent 6ba874c22e
commit bb55988f03
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
src/Graphics/Vty/Input/Classify.hs
View File

@ -30,6 +30,7 @@ compile :: ClassifyMap -> [Char] -> KClass
compile table = cl' where
-- take all prefixes and create a set of these
prefixSet = S.fromList $ concatMap (init . inits . fst) $ table
maxValidInputLength = maximum (map (length . fst) table)
eventForInput = M.fromList table
cl' [] = Prefix
cl' inputBlock = case M.lookup inputBlock eventForInput of
@ -45,7 +46,7 @@ compile table = cl' where
-- H: There will always be one match. The prefixSet contains, by definition, all
-- prefixes of an event.
False ->
let inputPrefixes = reverse $ tail $ inits inputBlock
let inputPrefixes = reverse $ take maxValidInputLength $ tail $ inits inputBlock
in case mapMaybe (\s -> (,) s `fmap` M.lookup s eventForInput) inputPrefixes of
(s,e) : _ -> Valid e (drop (length s) inputBlock)
-- neither a prefix or a full event.