Sat Jul 25 22:20:04 BST 2009 Ian Lynagh <igloo@earth.li>
* Make the code compatible with the stricter labelled-field parsing rules
diff -rN -u old-haskeline/System/Console/Haskeline/Backend/DumbTerm.hs new-haskeline/System/Console/Haskeline/Backend/DumbTerm.hs
|
old
|
new
|
|
| 87 | 87 | if length xs1' > p || newP >= w |
| 88 | 88 | then refitLine (xs2,ys2) |
| 89 | 89 | else do -- we haven't moved outside the margins |
| 90 | | put Window {pos=newP} |
| | 90 | put $ Window {pos=newP} |
| 91 | 91 | case (xs1',xs2') of |
| 92 | 92 | ([],[]) | ys1 == ys2 -> return () -- no change |
| 93 | 93 | (_,[]) | xs1' ++ ys1 == ys2 -> -- moved left |
| … |
… |
|
| 106 | 106 | w <- maxWidth |
| 107 | 107 | let xs' = dropFrames w xs |
| 108 | 108 | let p = length xs' |
| 109 | | put Window {pos=p} |
| | 109 | put $ Window {pos=p} |
| 110 | 110 | let ys' = take (w - p) ys |
| 111 | 111 | let k = length ys' |
| 112 | 112 | printText $ cr ++ graphemesToString (xs' ++ ys') |
diff -rN -u old-haskeline/System/Console/Haskeline/Backend/Posix.hsc new-haskeline/System/Console/Haskeline/Backend/Posix.hsc
|
old
|
new
|
|
| 60 | 60 | rows :: CUShort <- (#peek struct winsize,ws_row) ws |
| 61 | 61 | cols :: CUShort <- (#peek struct winsize,ws_col) ws |
| 62 | 62 | if ret >= 0 |
| 63 | | then return $ Just Layout {height=fromEnum rows,width=fromEnum cols} |
| | 63 | then return $ Just $ Layout {height=fromEnum rows,width=fromEnum cols} |
| 64 | 64 | else return Nothing |
| 65 | 65 | |
| 66 | 66 | unsafeHandleToFD :: Handle -> IO FD |
| 67 | 67 | unsafeHandleToFD h = |
| 68 | | withHandle_ "unsafeHandleToFd" h $ \Handle__{haDevice=dev} -> do |
| | 68 | withHandle_ "unsafeHandleToFd" h $ \(Handle__{haDevice=dev}) -> do |
| 69 | 69 | case cast dev of |
| 70 | 70 | Nothing -> ioError (ioeSetErrorString (mkIOError IllegalOperation |
| 71 | 71 | "unsafeHandleToFd" (Just h) Nothing) |
| … |
… |
|
| 80 | 80 | return $ Just $ Layout {height=read r,width=read c} |
| 81 | 81 | |
| 82 | 82 | tryGetLayouts :: [IO (Maybe Layout)] -> IO Layout |
| 83 | | tryGetLayouts [] = return Layout {height=24,width=80} |
| | 83 | tryGetLayouts [] = return $ Layout {height=24,width=80} |
| 84 | 84 | tryGetLayouts (f:fs) = do |
| 85 | 85 | ml <- f |
| 86 | 86 | case ml of |
| … |
… |
|
| 254 | 254 | encoders <- liftM2 Encoders (openEncoder codeset) (openPartialDecoder codeset) |
| 255 | 255 | case ttyH of |
| 256 | 256 | Nothing -> return fileRT |
| 257 | | Just h -> return fileRT { |
| | 257 | Just h -> return $ fileRT { |
| 258 | 258 | closeTerm = closeTerm fileRT >> hClose h, |
| 259 | 259 | -- NOTE: could also alloc Encoders once for each call to wrapRunTerm |
| 260 | 260 | termOps = Just $ tOps encoders h |
| … |
… |
|
| 283 | 283 | let encoder str = join $ fmap ($ str) $ openEncoder codeset |
| 284 | 284 | let decoder str = join $ fmap ($ str) $ openDecoder codeset |
| 285 | 285 | decoder' <- openPartialDecoder codeset |
| 286 | | return RunTerm {putStrOut = \str -> encoder str >>= putTerm, |
| | 286 | return $ RunTerm {putStrOut = \str -> encoder str >>= putTerm, |
| 287 | 287 | closeTerm = setLocale oldLocale >> return (), |
| 288 | 288 | wrapInterrupt = withSigIntHandler, |
| 289 | 289 | encodeForTerm = encoder, |
diff -rN -u old-haskeline/System/Console/Haskeline/Backend/Terminfo.hs new-haskeline/System/Console/Haskeline/Backend/Terminfo.hs
|
old
|
new
|
|
| 43 | 43 | bellAudible' <- bell `mplus` return mempty |
| 44 | 44 | bellVisual' <- visualBell `mplus` return mempty |
| 45 | 45 | wrapLine' <- getWrapLine nl' (leftA' 1) |
| 46 | | return Actions{leftA = leftA', rightA = rightA',upA = upA', |
| | 46 | return $ Actions{leftA = leftA', rightA = rightA',upA = upA', |
| 47 | 47 | clearToLineEnd = clearToLineEnd', nl = nl',cr = cr', |
| 48 | 48 | bellAudible = bellAudible', bellVisual = bellVisual', |
| 49 | 49 | clearAllA = clearAll', |
| … |
… |
|
| 141 | 141 | tinfoLayout term = return $ getCapability term $ do |
| 142 | 142 | r <- termColumns |
| 143 | 143 | c <- termLines |
| 144 | | return Layout {height=r,width=c} |
| | 144 | return $ Layout {height=r,width=c} |
| 145 | 145 | |
| 146 | 146 | terminfoKeys :: Terminal -> [(String,Key)] |
| 147 | 147 | terminfoKeys term = catMaybes $ map getSequence keyCapabilities |
| … |
… |
|
| 176 | 176 | TermPos {termRow=r,termCol=c} <- get |
| 177 | 177 | if c+n < w |
| 178 | 178 | then do |
| 179 | | put TermPos {termRow=r,termCol=c+n} |
| | 179 | put $ TermPos {termRow=r,termCol=c+n} |
| 180 | 180 | output (right n) |
| 181 | 181 | else do |
| 182 | 182 | let m = c+n |
| 183 | 183 | let linesDown = m `div` w |
| 184 | 184 | let newCol = m `rem` w |
| 185 | | put TermPos {termRow=r+linesDown, termCol=newCol} |
| | 185 | put $ TermPos {termRow=r+linesDown, termCol=newCol} |
| 186 | 186 | output $ cr <#> mreplicate linesDown nl <#> right newCol |
| 187 | 187 | |
| 188 | 188 | changeLeft n = do |
| … |
… |
|
| 190 | 190 | TermPos {termRow=r,termCol=c} <- get |
| 191 | 191 | if c - n >= 0 |
| 192 | 192 | then do |
| 193 | | put TermPos {termRow = r,termCol = c-n} |
| | 193 | put $ TermPos {termRow = r,termCol = c-n} |
| 194 | 194 | output (left n) |
| 195 | 195 | else do |
| 196 | 196 | let m = n - c |
| 197 | 197 | let linesUp = 1 + ((m-1) `div` w) |
| 198 | 198 | let newCol = (-m) `mod` w -- mod returns positive # |
| 199 | | put TermPos {termRow = r - linesUp, termCol=newCol} |
| | 199 | put $ TermPos {termRow = r - linesUp, termCol=newCol} |
| 200 | 200 | output $ cr <#> up linesUp <#> right newCol |
| 201 | 201 | |
| 202 | 202 | -- TODO: I think if we wrap this all up in one call to output, it'll be faster... |
| … |
… |
|
| 214 | 214 | if length str < roomLeft |
| 215 | 215 | then do |
| 216 | 216 | posixEncode (graphemesToString str) >>= output . text |
| 217 | | put TermPos{termRow=r, termCol=c+length str} |
| | 217 | put $ TermPos{termRow=r, termCol=c+length str} |
| 218 | 218 | return [] |
| 219 | 219 | else do |
| 220 | 220 | let (thisLine,rest) = splitAt roomLeft str |
| 221 | 221 | bstr <- posixEncode (graphemesToString thisLine) |
| 222 | 222 | output (text bstr <#> wrapLine) |
| 223 | | put TermPos {termRow=r+1,termCol=0} |
| | 223 | put $ TermPos {termRow=r+1,termCol=0} |
| 224 | 224 | return rest |
| 225 | 225 | |
| 226 | 226 | drawLineDiffT :: LineChars -> LineChars -> DrawM () |
| … |
… |
|
| 236 | 236 | changeLeft (length ys2) |
| 237 | 237 | |
| 238 | 238 | linesLeft :: Layout -> TermPos -> Int -> Int |
| 239 | | linesLeft Layout {width=w} TermPos {termCol = c} n |
| | 239 | linesLeft (Layout {width=w}) (TermPos {termCol = c}) n |
| 240 | 240 | | c + n < w = 1 |
| 241 | 241 | | otherwise = 1 + div (c+n) w |
| 242 | 242 | |
diff -rN -u old-haskeline/System/Console/Haskeline/Command/History.hs new-haskeline/System/Console/Haskeline/Command/History.hs
|
old
|
new
|
|
| 13 | 13 | deriving Show |
| 14 | 14 | |
| 15 | 15 | prevHistoryM :: [Grapheme] -> HistLog -> Maybe ([Grapheme],HistLog) |
| 16 | | prevHistoryM _ HistLog {pastHistory = []} = Nothing |
| 17 | | prevHistoryM s HistLog {pastHistory=ls:past, futureHistory=future} |
| | 16 | prevHistoryM _ (HistLog {pastHistory = []}) = Nothing |
| | 17 | prevHistoryM s (HistLog {pastHistory=ls:past, futureHistory=future}) |
| 18 | 18 | = Just (ls, |
| 19 | 19 | HistLog {pastHistory=past, futureHistory= s:future}) |
| 20 | 20 | |
| … |
… |
|
| 163 | 163 | delLastChar s = s {searchTerm = minit (searchTerm s)} |
| 164 | 164 | minit xs = if null xs then [] else init xs |
| 165 | 165 | oneMoreChar c = doSearch True . addChar c |
| 166 | | searchMore d s = doSearch False s {direction=d} |
| | 166 | searchMore d s = doSearch False (s {direction=d}) |
diff -rN -u old-haskeline/System/Console/Haskeline/Command/Undo.hs new-haskeline/System/Console/Haskeline/Command/Undo.hs
|
old
|
new
|
|
| 28 | 28 | _ -> False |
| 29 | 29 | |
| 30 | 30 | undoPast, redoFuture :: Save s => s -> Undo -> (s,Undo) |
| 31 | | undoPast ls u@Undo {pastUndo = []} = (ls,u) |
| 32 | | undoPast ls u@Undo {pastUndo = (pastLS:lss)} |
| | 31 | undoPast ls u@(Undo {pastUndo = []}) = (ls,u) |
| | 32 | undoPast ls u@(Undo {pastUndo = (pastLS:lss)}) |
| 33 | 33 | = (restore pastLS, u {pastUndo = lss, futureRedo = save ls : futureRedo u}) |
| 34 | 34 | |
| 35 | | redoFuture ls u@Undo {futureRedo = []} = (ls,u) |
| 36 | | redoFuture ls u@Undo {futureRedo = (futureLS:lss)} |
| | 35 | redoFuture ls u@(Undo {futureRedo = []}) = (ls,u) |
| | 36 | redoFuture ls u@(Undo {futureRedo = (futureLS:lss)}) |
| 37 | 37 | = (restore futureLS, u {futureRedo = lss, pastUndo = save ls : pastUndo u}) |
| 38 | 38 | |
| 39 | 39 | |
diff -rN -u old-haskeline/System/Console/Haskeline/IO.hs new-haskeline/System/Console/Haskeline/IO.hs
|
old
|
new
|
|
| 61 | 61 | reqV <- newEmptyMVar |
| 62 | 62 | finished <- newEmptyMVar |
| 63 | 63 | tid <- forkIO (runHaskeline settings reqV finished) |
| 64 | | return HD {requestVar = reqV, forkedThread = tid, |
| 65 | | subthreadFinished = finished} |
| | 64 | return $ HD {requestVar = reqV, forkedThread = tid, |
| | 65 | subthreadFinished = finished} |
| 66 | 66 | |
| 67 | 67 | runHaskeline :: Settings IO -> MVar (Maybe Request) -> MVar () -> IO () |
| 68 | 68 | runHaskeline settings reqV finished = runInputT settings loop |
diff -rN -u old-haskeline/System/Console/Haskeline/Key.hs new-haskeline/System/Console/Haskeline/Key.hs
|
old
|
new
|
|
| 44 | 44 | simpleKey = Key noModifier |
| 45 | 45 | |
| 46 | 46 | metaKey :: Key -> Key |
| 47 | | metaKey (Key m bc) = Key m {hasMeta = True} bc |
| | 47 | metaKey (Key m bc) = Key (m {hasMeta = True}) bc |
| 48 | 48 | |
| 49 | 49 | simpleChar, metaChar, ctrlChar :: Char -> Key |
| 50 | 50 | simpleChar = simpleKey . KeyChar |
| … |
… |
|
| 113 | 113 | |
| 114 | 114 | canonicalizeKey :: Key -> Key |
| 115 | 115 | canonicalizeKey (Key m (KeyChar c)) |
| 116 | | | hasControl m = Key m {hasControl = False} |
| | 116 | | hasControl m = Key (m {hasControl = False}) |
| 117 | 117 | (KeyChar (setControlBits c)) |
| 118 | | | hasShift m = Key m {hasShift = False} (KeyChar (toUpper c)) |
| | 118 | | hasShift m = Key (m {hasShift = False}) (KeyChar (toUpper c)) |
| 119 | 119 | canonicalizeKey k = k |
diff -rN -u old-haskeline/System/Console/Haskeline/Vi.hs new-haskeline/System/Console/Haskeline/Vi.hs
|
old
|
new
|
|
| 383 | 383 | } |
| 384 | 384 | |
| 385 | 385 | searchText :: SearchEntry -> [Grapheme] |
| 386 | | searchText SearchEntry {entryState = IMode xs ys} = reverse xs ++ ys |
| | 386 | searchText (SearchEntry {entryState = IMode xs ys}) = reverse xs ++ ys |
| 387 | 387 | |
| 388 | 388 | instance LineState SearchEntry where |
| 389 | 389 | beforeCursor prefix se = beforeCursor (prefix ++ [searchChar se]) |
| … |
… |
|
| 416 | 416 | let toSearch' = if null toSearch |
| 417 | 417 | then (lastSearch vstate) |
| 418 | 418 | else toSearch |
| 419 | | result <- doSearch False SearchMode { |
| | 419 | result <- doSearch False (SearchMode { |
| 420 | 420 | searchTerm = toSearch', |
| 421 | 421 | foundHistory = save cm, -- TODO: not needed |
| 422 | | direction = dir} |
| | 422 | direction = dir}) |
| 423 | 423 | case result of |
| 424 | 424 | Left e -> effect e >> setState cm |
| 425 | 425 | Right sm -> do |
| 426 | | put vstate {lastSearch = toSearch'} |
| | 426 | put $ vstate {lastSearch = toSearch'} |
| 427 | 427 | setState (restore (foundHistory sm)) |
diff -rN -u old-haskeline/configure new-haskeline/configure
|
old
|
new
|
|
| 1 | | #!/bin/sh |
| 2 | | # Dummy file to be run by autoconfUserHooks. |