Commit 3a3eec4c authored by partain's avatar partain

[project @ 1996-07-26 21:04:22 by partain]

Final changes for 2.01
parent 4a85ae1b
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface DataTypes where
import GenUtils(Maybe)
import PreludeArray(Array)
class Presentable a where
userFormat :: a -> [Char]
{-# GHC_PRAGMA {-meth-} _A_ 1 _U_ 12 _N_ _S_ "S" _F_ _IF_ARGS_ 1 1 X 1 _/\_ u0 -> \ (u1 :: u0 -> [Char]) -> u1 _N_
{-defm-} _A_ 2 _U_ 02 _N_ _S_ _!_ _F_ _IF_ARGS_ 1 2 XX 3 _/\_ u0 -> \ (u1 :: {{Presentable u0}}) (u2 :: u0) -> _APP_ _TYAPP_ patError# { (u0 -> [Char]) } [ _NOREP_S_ "%DDataTypes.Presentable.userFormat\"", u2 ] _N_ #-}
type AbsGame = Game Token
data Board = Board (Array (Int, Int) BoardSquare) MoveNumber (Maybe Int)
type BoardPos = (Int, Int)
data BoardSquare = VacantSq | WhitesSq Piece | BlacksSq Piece
type ChessFile = Int
type ChessRank = Int
data Colour = Black | White
type ExBoardPos = (Maybe Int, Maybe Int)
data Game a = Game [TagStr] [a]
data MoveNumber = MoveNumber Int Colour
data MoveTok = PieceTok Piece | RankTok Int | FileTok Int | PartCastleTok | CaptureTok | MoveToTok | QueensWith | CheckTok | MateTok
data Piece = King | Queen | Rook | Knight | Bishop | Pawn
data PlayMove = PlayMove Piece (Int, Int) (Int, Int) SpecialMove
data Quantum = QuantumMove [Char] [Char] [Char] Board | QuantumNAG Int | QuantumComment [[Char]] | QuantumResult [Char] | QuantumAnalysis [Quantum] | QuantumPrintBoard
type RealGame = Game Quantum
data Result = Win | Draw | Loss | Unknown
data SpecialMove = NothingSpecial | BigPawnMove | Queening Piece | EnPassant
data SquareContent = Vacant | Friendly | Baddy | OffBoard
data TagStr = TagStr [Char] [Char]
data Token = StringToken [Char] | AsterixToken | LeftABToken | RightABToken | NAGToken Int | NAGAnnToken Int [Char] | SymbolToken [Char] | CommentToken [[Char]] | LeftSBToken | RightSBToken | LeftRBToken | RightRBToken | IntToken Int | PeriodToken | AnalToken [Token]
boardSize :: ((Int, Int), (Int, Int))
{-# GHC_PRAGMA _A_ 0 _N_ _N_ _N_ _N_ _N_ #-}
buildBoard :: [Char] -> Board
{-# GHC_PRAGMA _A_ 0 _U_ 1 _N_ _N_ _N_ _N_ #-}
castleK :: [Char]
{-# GHC_PRAGMA _A_ 0 _N_ _N_ _N_ _N_ _N_ #-}
castleQ :: [Char]
{-# GHC_PRAGMA _A_ 0 _N_ _N_ _N_ _N_ _N_ #-}
changeColour :: Colour -> Colour
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "E" _F_ _IF_ARGS_ 0 1 C 4 \ (u0 :: Colour) -> case u0 of { _ALG_ _ORIG_ DataTypes White -> _!_ _ORIG_ DataTypes Black [] []; _ORIG_ DataTypes Black -> _!_ _ORIG_ DataTypes White [] []; _NO_DEFLT_ } _N_ #-}
charToMoveTok :: Char -> Maybe MoveTok
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(P)" {_A_ 1 _U_ 1 _N_ _N_ _N_ _N_} _N_ _N_ #-}
compExBPandBP :: (Maybe Int, Maybe Int) -> (Int, Int) -> Bool
{-# GHC_PRAGMA _A_ 2 _U_ 11 _N_ _S_ "U(SL)U(LL)" {_A_ 4 _U_ 1111 _N_ _N_ _N_ _N_} _N_ _N_ #-}
decMove :: MoveNumber -> MoveNumber
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(LE)" {_A_ 2 _U_ 21 _N_ _N_ _N_ _N_} _N_ _N_ #-}
displayBoard :: Colour -> Board -> [[Char]]
{-# GHC_PRAGMA _A_ 0 _U_ 21 _N_ _N_ _N_ _N_ #-}
extendBP :: (Int, Int) -> (Maybe Int, Maybe Int)
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(LL)" {_A_ 2 _U_ 22 _N_ _N_ _N_ _N_} _N_ _N_ #-}
extractDestFromPlayMove :: PlayMove -> (Int, Int)
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(AAU(LL)A)" {_A_ 2 _U_ 22 _N_ _N_ _F_ _IF_ARGS_ 0 2 XX 3 \ (u0 :: Int) (u1 :: Int) -> _!_ _TUP_2 [Int, Int] [u0, u1] _N_} _F_ _IF_ARGS_ 0 1 C 2 \ (u0 :: PlayMove) -> case u0 of { _ALG_ _ORIG_ DataTypes PlayMove (u1 :: Piece) (u2 :: (Int, Int)) (u3 :: (Int, Int)) (u4 :: SpecialMove) -> u3; _NO_DEFLT_ } _N_ #-}
extractSpecialFromPlayMove :: PlayMove -> SpecialMove
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(AAAS)" {_A_ 1 _U_ 1 _N_ _N_ _F_ _IF_ARGS_ 0 1 X 1 \ (u0 :: SpecialMove) -> u0 _N_} _F_ _IF_ARGS_ 0 1 C 2 \ (u0 :: PlayMove) -> case u0 of { _ALG_ _ORIG_ DataTypes PlayMove (u1 :: Piece) (u2 :: (Int, Int)) (u3 :: (Int, Int)) (u4 :: SpecialMove) -> u4; _NO_DEFLT_ } _N_ #-}
extractSrcFromPlayMove :: PlayMove -> (Int, Int)
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(AU(LL)AA)" {_A_ 2 _U_ 22 _N_ _N_ _F_ _IF_ARGS_ 0 2 XX 3 \ (u0 :: Int) (u1 :: Int) -> _!_ _TUP_2 [Int, Int] [u0, u1] _N_} _F_ _IF_ARGS_ 0 1 C 2 \ (u0 :: PlayMove) -> case u0 of { _ALG_ _ORIG_ DataTypes PlayMove (u1 :: Piece) (u2 :: (Int, Int)) (u3 :: (Int, Int)) (u4 :: SpecialMove) -> u2; _NO_DEFLT_ } _N_ #-}
getBoardColour :: Board -> Colour
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(AU(AE)A)" {_A_ 1 _U_ 1 _N_ _N_ _F_ _IF_ARGS_ 0 1 X 1 \ (u0 :: Colour) -> u0 _N_} _F_ _IF_ARGS_ 0 1 C 3 \ (u0 :: Board) -> case u0 of { _ALG_ _ORIG_ DataTypes Board (u1 :: Array (Int, Int) BoardSquare) (u2 :: MoveNumber) (u3 :: Maybe Int) -> case u2 of { _ALG_ _ORIG_ DataTypes MoveNumber (u4 :: Int) (u5 :: Colour) -> u5; _NO_DEFLT_ }; _NO_DEFLT_ } _N_ #-}
getHeaderInfo :: [TagStr] -> ([Char], [Char], Maybe Int, Result, [Char], [Char], [Char])
{-# GHC_PRAGMA _A_ 1 _U_ 2 _N_ _N_ _N_ _N_ #-}
getMoveColour :: MoveNumber -> Colour
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(AE)" {_A_ 1 _U_ 1 _N_ _N_ _F_ _IF_ARGS_ 0 1 X 1 \ (u0 :: Colour) -> u0 _N_} _F_ _IF_ARGS_ 0 1 C 2 \ (u0 :: MoveNumber) -> case u0 of { _ALG_ _ORIG_ DataTypes MoveNumber (u1 :: Int) (u2 :: Colour) -> u2; _NO_DEFLT_ } _N_ #-}
getOpenName :: Int -> [Char]
{-# GHC_PRAGMA _A_ 1 _U_ 0 _N_ _S_ "A" {_A_ 0 _N_ _N_ _N_ _N_ _N_} _F_ _IF_ARGS_ 0 1 X 4 \ (u0 :: Int) -> _NOREP_S_ "Foo" _N_ #-}
getOpening :: [Char] -> [Char]
{-# GHC_PRAGMA _A_ 1 _U_ 2 _N_ _S_ "S" _N_ _N_ #-}
getSquarePiece :: BoardSquare -> Maybe Piece
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "S" _N_ _N_ #-}
getTagStr :: [Char] -> [Char] -> [TagStr] -> [Char]
{-# GHC_PRAGMA _A_ 3 _U_ 221 _N_ _S_ "LLS" _N_ _N_ #-}
incMove :: MoveNumber -> MoveNumber
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(LE)" {_A_ 2 _U_ 21 _N_ _N_ _N_ _N_} _N_ _N_ #-}
initMoveNumber :: MoveNumber
{-# GHC_PRAGMA _A_ 0 _N_ _N_ _N_ _N_ _N_ #-}
lookupBoard :: Board -> (Int, Int) -> SquareContent
{-# GHC_PRAGMA _A_ 2 _U_ 11 _N_ _S_ "U(LLA)U(U(P)L)" {_A_ 4 _U_ 1122 _N_ _N_ _N_ _N_} _N_ _N_ #-}
lookupBoardPiece :: Board -> (Int, Int) -> Maybe Piece
{-# GHC_PRAGMA _A_ 2 _U_ 11 _N_ _S_ "U(U(U(SS)P)AA)U(U(P)U(P))" {_A_ 5 _U_ 22222 _N_ _N_ _N_ _N_} _N_ _N_ #-}
lookupBoardSquare :: Board -> (Int, Int) -> BoardSquare
{-# GHC_PRAGMA _A_ 2 _U_ 11 _N_ _S_ "U(U(U(SS)P)AA)U(U(P)U(P))" {_A_ 5 _U_ 22222 _N_ _N_ _N_ _N_} _N_ _N_ #-}
lookupSquare :: Colour -> BoardSquare -> SquareContent
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "LS" _N_ _N_ #-}
mkColBoardSq :: Colour -> Piece -> BoardSquare
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "EL" _F_ _ALWAYS_ \ (u0 :: Colour) (u1 :: Piece) -> case u0 of { _ALG_ _ORIG_ DataTypes White -> _!_ _ORIG_ DataTypes WhitesSq [] [u1]; _ORIG_ DataTypes Black -> _!_ _ORIG_ DataTypes BlacksSq [] [u1]; _NO_DEFLT_ } _N_ #-}
mkPlayMove :: Piece -> (Int, Int) -> (Int, Int) -> PlayMove
{-# GHC_PRAGMA _A_ 3 _U_ 222 _N_ _N_ _N_ _N_ #-}
mkResult :: [Char] -> Result
{-# GHC_PRAGMA _A_ 1 _U_ 2 _N_ _S_ "S" _N_ _N_ #-}
startBoard :: Board
{-# GHC_PRAGMA _A_ 0 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 2 _APP_ _ORIG_ DataTypes buildBoard [ _NOREP_S_ "rnbqkbnr/pppppppp/32/PPPPPPPP/RNBQKBNR" ] _N_ #-}
userFormatBoardPos :: (Int, Int) -> [Char]
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(LL)" {_A_ 2 _U_ 11 _N_ _N_ _N_ _N_} _N_ _N_ #-}
userFormatExBoardPos :: (Maybe Int, Maybe Int) -> [Char]
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(SS)" {_A_ 2 _U_ 11 _N_ _N_ _N_ _N_} _N_ _N_ #-}
userFormatFile :: Int -> [Char]
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _N_ _N_ _N_ #-}
userFormatRank :: Int -> [Char]
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _N_ _N_ _N_ #-}
instance Presentable Board
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 0 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _CONSTM_ Presentable userFormat (Board) _N_
userFormat = _A_ 0 _U_ 1 _N_ _N_ _N_ _N_ #-}
instance Presentable Colour
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 1 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _CONSTM_ Presentable userFormat (Colour) _N_
userFormat = _A_ 1 _U_ 1 _N_ _S_ "E" _N_ _N_ #-}
instance Presentable a => Presentable (Game a)
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 2 _U_ 2 _N_ _S_ "LS" _N_ _N_ #-}
instance Presentable MoveNumber
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 1 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _CONSTM_ Presentable userFormat (MoveNumber) _N_
userFormat = _A_ 1 _U_ 1 _N_ _S_ "U(U(P)E)" {_A_ 2 _U_ 21 _N_ _N_ _N_ _N_} _N_ _N_ #-}
instance Presentable Piece
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 1 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _CONSTM_ Presentable userFormat (Piece) _N_
userFormat = _A_ 1 _U_ 1 _N_ _S_ "E" _N_ _N_ #-}
instance Presentable PlayMove
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 1 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _CONSTM_ Presentable userFormat (PlayMove) _N_
userFormat = _A_ 1 _U_ 1 _N_ _S_ "U(ELLL)" {_A_ 4 _U_ 1111 _N_ _N_ _N_ _N_} _N_ _N_ #-}
instance Presentable Quantum
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 1 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _CONSTM_ Presentable userFormat (Quantum) _N_
userFormat = _A_ 1 _U_ 1 _N_ _S_ "S" _N_ _N_ #-}
instance Presentable Result
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 1 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _CONSTM_ Presentable userFormat (Result) _N_
userFormat = _A_ 1 _U_ 1 _N_ _S_ "E" _N_ _N_ #-}
instance Presentable SpecialMove
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 1 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _CONSTM_ Presentable userFormat (SpecialMove) _N_
userFormat = _A_ 1 _U_ 1 _N_ _S_ "S" _N_ _N_ #-}
instance Presentable SquareContent
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 1 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _CONSTM_ Presentable userFormat (SquareContent) _N_
userFormat = _A_ 1 _U_ 1 _N_ _S_ "E" _N_ _N_ #-}
instance Presentable TagStr
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 1 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _CONSTM_ Presentable userFormat (TagStr) _N_
userFormat = _A_ 1 _U_ 1 _N_ _S_ "U(LL)" {_A_ 2 _U_ 11 _N_ _N_ _N_ _N_} _N_ _N_ #-}
instance Presentable Token
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 1 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _CONSTM_ Presentable userFormat (Token) _N_
userFormat = _A_ 1 _U_ 1 _N_ _S_ "S" _N_ _N_ #-}
instance Presentable a => Presentable [a]
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 2 _U_ 2 _N_ _S_ "LS" _N_ _N_ #-}
instance Eq Colour
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 0 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 3 _!_ _TUP_2 [(Colour -> Colour -> Bool), (Colour -> Colour -> Bool)] [_CONSTM_ Eq (==) (Colour), _CONSTM_ Eq (/=) (Colour)] _N_
(==) = _A_ 2 _U_ 11 _N_ _S_ "EE" _N_ _N_,
(/=) = _A_ 2 _U_ 11 _N_ _S_ "EE" _N_ _N_ #-}
instance Eq Piece
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 0 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 3 _!_ _TUP_2 [(Piece -> Piece -> Bool), (Piece -> Piece -> Bool)] [_CONSTM_ Eq (==) (Piece), _CONSTM_ Eq (/=) (Piece)] _N_
(==) = _A_ 2 _U_ 11 _N_ _S_ "EE" _N_ _N_,
(/=) = _A_ 2 _U_ 11 _N_ _S_ "EE" _N_ _N_ #-}
instance Eq SpecialMove
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 0 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 3 _!_ _TUP_2 [(SpecialMove -> SpecialMove -> Bool), (SpecialMove -> SpecialMove -> Bool)] [_CONSTM_ Eq (==) (SpecialMove), _CONSTM_ Eq (/=) (SpecialMove)] _N_
(==) = _A_ 2 _U_ 22 _N_ _S_ "SS" _N_ _N_,
(/=) = _A_ 2 _U_ 22 _N_ _S_ "SS" _N_ _N_ #-}
instance Eq SquareContent
{-# GHC_PRAGMA _M_ DataTypes {-dfun-} _A_ 0 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 3 _!_ _TUP_2 [(SquareContent -> SquareContent -> Bool), (SquareContent -> SquareContent -> Bool)] [_CONSTM_ Eq (==) (SquareContent), _CONSTM_ Eq (/=) (SquareContent)] _N_
(==) = _A_ 2 _U_ 11 _N_ _S_ "EE" _N_ _N_,
(/=) = _A_ 2 _U_ 11 _N_ _S_ "EE" _N_ _N_ #-}
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface GenUtils where
import PreludeArray(Assoc)
data Maybe a = Nothing | Just a
data MaybeErr a b = Succeeded a | Failed b
arrCond :: Ix a => (a, a) -> [Assoc [a] b] -> [Assoc (a -> Bool) b] -> b -> a -> b
{-# GHC_PRAGMA _A_ 5 _U_ 122222 _N_ _S_ "U(LSSA)U(LL)LLL" _N_ _N_ #-}
arrElem :: Ix a => [a] -> a -> Bool
{-# GHC_PRAGMA _A_ 1 _U_ 122 _N_ _S_ "U(LLLS)" {_A_ 4 _U_ 222122 _N_ _N_ _N_ _N_} _N_ _N_ #-}
assocMaybe :: Eq a => [(a, b)] -> a -> Maybe b
{-# GHC_PRAGMA _A_ 3 _U_ 112 _N_ _S_ "LSL" _N_ _N_ #-}
assocMaybeErr :: Eq a => [(a, b)] -> a -> MaybeErr b [Char]
{-# GHC_PRAGMA _A_ 3 _U_ 112 _N_ _S_ "LSL" _N_ _N_ #-}
cjustify :: Int -> [Char] -> [Char]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "U(P)S" {_A_ 2 _U_ 22 _N_ _N_ _N_ _N_} _N_ _N_ #-}
combinePairs :: Ord a => [(a, b)] -> [(a, [b])]
{-# GHC_PRAGMA _A_ 2 _U_ 22 _N_ _S_ "LS" _N_ _N_ #-}
copy :: Int -> a -> [a]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "U(P)L" {_A_ 2 _U_ 22 _N_ _N_ _N_ _N_} _N_ _N_ #-}
foldb :: (a -> a -> a) -> [a] -> a
{-# GHC_PRAGMA _A_ 2 _U_ 22 _N_ _S_ "LS" _N_ _N_ #-}
formatText :: Int -> [[Char]] -> [[Char]]
{-# GHC_PRAGMA _A_ 1 _U_ 22 _N_ _N_ _N_ _N_ #-}
joinMaybe :: (a -> a -> a) -> Maybe a -> Maybe a -> Maybe a
{-# GHC_PRAGMA _A_ 3 _U_ 111 _N_ _S_ "LSS" _N_ _N_ #-}
ljustify :: Int -> [Char] -> [Char]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "LS" _N_ _N_ #-}
mapAccumL :: (c -> a -> (b, c)) -> c -> [a] -> ([b], c)
{-# GHC_PRAGMA _A_ 3 _U_ 221 _N_ _N_ _N_ _N_ #-}
mapMaybe :: (a -> Maybe b) -> [a] -> [b]
{-# GHC_PRAGMA _A_ 2 _U_ 21 _N_ _S_ "LS" _N_ _N_ #-}
mapMaybeFail :: (a -> Maybe b) -> [a] -> Maybe [b]
{-# GHC_PRAGMA _A_ 2 _U_ 21 _N_ _S_ "LS" _N_ _N_ #-}
maybeMap :: (a -> b) -> Maybe a -> Maybe b
{-# GHC_PRAGMA _A_ 2 _U_ 11 _N_ _S_ "LS" _N_ _N_ #-}
maybeToBool :: Maybe a -> Bool
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "S" _F_ _IF_ARGS_ 1 1 C 4 _/\_ u0 -> \ (u1 :: Maybe u0) -> case u1 of { _ALG_ _ORIG_ GenUtils Nothing -> _!_ False [] []; _ORIG_ GenUtils Just (u2 :: u0) -> _!_ True [] []; _NO_DEFLT_ } _N_ #-}
maybeToObj :: Maybe a -> a
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "S" _F_ _IF_ARGS_ 1 1 C 5 _/\_ u0 -> \ (u1 :: Maybe u0) -> case u1 of { _ALG_ _ORIG_ GenUtils Nothing -> _APP_ _TYAPP_ error { u0 } [ _NOREP_S_ "Trying to extract object from a Nothing" ]; _ORIG_ GenUtils Just (u2 :: u0) -> u2; _NO_DEFLT_ } _N_ #-}
memoise :: Ix a => (a, a) -> (a -> b) -> a -> b
{-# GHC_PRAGMA _A_ 3 _U_ 1122 _N_ _S_ "U(ASSA)U(LL)L" {_A_ 5 _U_ 222222 _N_ _N_ _N_ _N_} _N_ _N_ #-}
mkClosure :: (a -> a -> Bool) -> (a -> a) -> a -> a
{-# GHC_PRAGMA _A_ 3 _U_ 222 _N_ _N_ _N_ _N_ #-}
rjustify :: Int -> [Char] -> [Char]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "U(P)S" {_A_ 2 _U_ 22 _N_ _N_ _N_ _N_} _N_ _N_ #-}
sort :: Ord a => [a] -> [a]
{-# GHC_PRAGMA _A_ 1 _U_ 12 _N_ _N_ _F_ _IF_ARGS_ 1 1 C 5 _/\_ u0 -> \ (u1 :: {{Ord u0}}) -> let {(ua :: u0 -> u0 -> Bool) = case u1 of { _ALG_ _TUP_8 (u2 :: {{Eq u0}}) (u3 :: u0 -> u0 -> Bool) (u4 :: u0 -> u0 -> Bool) (u5 :: u0 -> u0 -> Bool) (u6 :: u0 -> u0 -> Bool) (u7 :: u0 -> u0 -> u0) (u8 :: u0 -> u0 -> u0) (u9 :: u0 -> u0 -> _CMP_TAG) -> u4; _NO_DEFLT_ }} in _APP_ _TYAPP_ _ORIG_ GenUtils sortWith { u0 } [ ua ] _N_ #-}
sortWith :: (a -> a -> Bool) -> [a] -> [a]
{-# GHC_PRAGMA _A_ 2 _U_ 22 _N_ _S_ "LS" _N_ _N_ #-}
space :: Int -> [Char]
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(P)" {_A_ 1 _U_ 2 _N_ _N_ _N_ _N_} _N_ _N_ #-}
instance Eq a => Eq (Maybe a)
{-# GHC_PRAGMA _M_ GenUtils {-dfun-} _A_ 1 _U_ 1 _N_ _N_ _N_ _N_ #-}
instance (Eq a, Eq b) => Eq (MaybeErr a b)
{-# GHC_PRAGMA _M_ GenUtils {-dfun-} _A_ 2 _U_ 11 _N_ _N_ _N_ _N_ #-}
instance Ord a => Ord (Maybe a)
{-# GHC_PRAGMA _M_ GenUtils {-dfun-} _A_ 2 _U_ 22 _N_ _N_ _N_ _N_ #-}
instance Text a => Text (Maybe a)
{-# GHC_PRAGMA _M_ GenUtils {-dfun-} _A_ 1 _U_ 2 _N_ _N_ _N_ _N_ #-}
instance (Text a, Text b) => Text (MaybeErr a b)
{-# GHC_PRAGMA _M_ GenUtils {-dfun-} _A_ 2 _U_ 22 _N_ _N_ _N_ _N_ #-}
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface Interp where
import DataTypes(Game, Quantum, Token)
runInterp :: Game Token -> Game Quantum
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(LL)" {_A_ 2 _U_ 22 _N_ _N_ _N_ _N_} _N_ _N_ #-}
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface InterpUtils where
import DataTypes(Board, Colour, Piece, PlayMove)
import GenUtils(Maybe)
allValidMoves :: Board -> Piece -> (Int -> Bool) -> [PlayMove]
{-# GHC_PRAGMA _A_ 3 _U_ 122 _N_ _S_ "U(U(U(SS)P)U(LL)L)LL" {_A_ 5 _U_ 22222 _N_ _N_ _N_ _N_} _N_ _N_ #-}
createShortMove :: PlayMove -> [Char] -> Board -> [Char]
{-# GHC_PRAGMA _A_ 3 _U_ 122 _N_ _S_ "U(ELLL)LL" _N_ _N_ #-}
disAmb :: (Text b, Eq a, Text a) => (Int, Int) -> [(a, b)] -> [Char]
{-# GHC_PRAGMA _A_ 3 _U_ 21212 _N_ _N_ _N_ _SPECIALISE_ [ Int, Int ] 3 { _A_ 0 _U_ 12 _N_ _N_ _N_ _N_ } #-}
findAMove :: Piece -> (Maybe Int, Maybe Int) -> (Maybe Int, Maybe Int) -> Board -> ([Char], Board)
{-# GHC_PRAGMA _A_ 4 _U_ 2222 _N_ _S_ "LLLU(LLL)" _N_ _N_ #-}
findAPawnMove :: (Maybe Int, Maybe Int) -> (Maybe Int, Maybe Int) -> Maybe Piece -> Board -> ([Char], Board)
{-# GHC_PRAGMA _A_ 0 _U_ 1222 _N_ _N_ _N_ _N_ #-}
findCastleKMove :: Board -> ([Char], Board)
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _N_ _N_ _N_ #-}
findCastleQMove :: Board -> ([Char], Board)
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _N_ _N_ _N_ #-}
getAllMovesFor :: Board -> (Piece, Int, Int) -> [PlayMove]
{-# GHC_PRAGMA _A_ 0 _U_ 21 _N_ _N_ _N_ _N_ #-}
getCurrPieces :: Board -> Piece -> (Int -> Bool) -> [(Piece, Int, Int)]
{-# GHC_PRAGMA _A_ 3 _U_ 122 _N_ _S_ "U(U(U(SS)P)U(AL)A)LL" {_A_ 5 _U_ 12222 _N_ _N_ _N_ _N_} _N_ _N_ #-}
getEPEnd :: Colour -> Int
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "E" _F_ _IF_ARGS_ 0 1 C 6 \ (u0 :: Colour) -> case u0 of { _ALG_ _ORIG_ DataTypes White -> _!_ I# [] [6#]; _ORIG_ DataTypes Black -> _!_ I# [] [3#]; _NO_DEFLT_ } _N_ #-}
getEPStart :: Colour -> Int
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "E" _F_ _IF_ARGS_ 0 1 C 6 \ (u0 :: Colour) -> case u0 of { _ALG_ _ORIG_ DataTypes White -> _!_ I# [] [5#]; _ORIG_ DataTypes Black -> _!_ I# [] [4#]; _NO_DEFLT_ } _N_ #-}
getHomeRank :: Colour -> Int
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "E" _F_ _IF_ARGS_ 0 1 C 6 \ (u0 :: Colour) -> case u0 of { _ALG_ _ORIG_ DataTypes White -> _!_ I# [] [1#]; _ORIG_ DataTypes Black -> _!_ I# [] [8#]; _NO_DEFLT_ } _N_ #-}
makeACastleK :: Board -> Board
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(LU(LE)A)" {_A_ 3 _U_ 122 _N_ _N_ _N_ _N_} _N_ _N_ #-}
makeACastleQ :: Board -> Board
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(LU(LE)A)" {_A_ 3 _U_ 122 _N_ _N_ _N_ _N_} _N_ _N_ #-}
makeAMove :: Board -> PlayMove -> Board
{-# GHC_PRAGMA _A_ 2 _U_ 11 _N_ _S_ "U(LU(LL)A)U(LLLS)" {_A_ 4 _U_ 1221 _N_ _N_ _N_ _N_} _N_ _N_ #-}
movePiece :: Int -> Int -> Board -> Int -> Int -> [(Int, Int)]
{-# GHC_PRAGMA _A_ 5 _U_ 12211 _N_ _S_ "U(P)LU(LLL)U(P)L" {_A_ 5 _U_ 22221 _N_ _N_ _N_ _N_} _N_ _N_ #-}
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface Parser where
import DataTypes(Game, Token)
pgnLexer :: [Char] -> [Token]
{-# GHC_PRAGMA _A_ 0 _U_ 1 _N_ _N_ _N_ _N_ #-}
pgnParser :: (Int -> Bool) -> [Char] -> [Game Token]
{-# GHC_PRAGMA _A_ 0 _U_ 22 _N_ _N_ _N_ _N_ #-}
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface PrintTEX where
import DataTypes(Game, Quantum)
texPrinter :: [Game Quantum] -> [Char]
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _N_ _N_ _N_ #-}
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface Append where
import Types(F, FC, S, SC)
append_ :: [a] -> [a] -> [a]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "SL" _N_ _N_ #-}
append_FC_L_L :: FC -> [Char] -> [Char]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "SL" _N_ _N_ #-}
append_FC_SC_SC :: FC -> SC -> SC
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "SL" _N_ _N_ #-}
append_F_L_L :: F a -> [a] -> [a]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "SL" _N_ _N_ #-}
append_F_S_S :: F Char -> S Char -> S Char
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "SL" _N_ _N_ #-}
append_L_SC_SC :: [Char] -> SC -> SC
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "SL" _N_ _N_ #-}
append_L_S_S :: [Char] -> S Char -> S Char
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "SL" _N_ _N_ #-}
append_SC_L_L :: SC -> [Char] -> [Char]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "SL" _N_ _N_ #-}
append_S_L_L :: S Char -> [Char] -> [Char]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "SL" _N_ _N_ #-}
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface Types where
data F a = FN | F1 a | F2 a a | F3 a a a | F4 a a a a | F5 a a a a a (F a)
data F2 a b = F2N | F21 a b | F22 a b a b | F23 a b a b a b | F24 a b a b a b a b | F25 a b a b a b a b a b (F2 a b)
data F3 a b c = F3N | F31 a b c | F32 a b c a b c | F33 a b c a b c a b c | F34 a b c a b c a b c a b c | F35 a b c a b c a b c a b c a b c (F3 a b c)
data F3I = F3IN | F3I1 Int# Int# Int# | F3I2 Int# Int# Int# Int# Int# Int# | F3I3 Int# Int# Int# Int# Int# Int# Int# Int# Int# | F3I4 Int# Int# Int# Int# Int# Int# Int# Int# Int# Int# Int# Int# | F3I5 Int# Int# Int# Int# Int# Int# Int# Int# Int# Int# Int# Int# Int# Int# Int# F3I
data FC = FCN | FC1 Char# | FC2 Char# Char# | FC3 Char# Char# Char# | FC4 Char# Char# Char# Char# | FC5 Char# Char# Char# Char# Char# FC
data FI = FIN | FI1 Int# | FI2 Int# Int# | FI3 Int# Int# Int# | FI4 Int# Int# Int# Int# | FI5 Int# Int# Int# Int# Int# FI
data S a = SN | S1 a (S a) | S2 a a (S a) | S3 a a a (S a) | S4 a a a a (S a) | S5 a a a a a (S a)
data SC = SCN | SC1 Char# SC | SC2 Char# Char# SC | SC3 Char# Char# Char# SC | SC4 Char# Char# Char# Char# SC | SC5 Char# Char# Char# Char# Char# SC
data SI = SIN | SI1 Int# SI | SI2 Int# Int# SI | SI3 Int# Int# Int# SI | SI4 Int# Int# Int# Int# SI | SI5 Int# Int# Int# Int# Int# SI
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface MaybeStateT where
import PreludeStdIO(Maybe)
type MST a b = a -> Maybe (b, a)
bindMST :: (b -> Maybe (a, b)) -> (a -> b -> Maybe (c, b)) -> b -> Maybe (c, b)
{-# GHC_PRAGMA _A_ 3 _U_ 112 _N_ _S_ "SLL" _N_ _N_ #-}
returnMST :: b -> a -> Maybe (b, a)
{-# GHC_PRAGMA _A_ 2 _U_ 22 _N_ _N_ _N_ _N_ #-}
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface LPA where
type Filter a = [a] -> [a]
type Frame a = [a]
type LPA_Filter = (Float, [Float])
type Signal a = [a]
type Window = [Float]
analyze :: Int -> Int -> [Float] -> (Float, [Float])
{-# GHC_PRAGMA _A_ 3 _U_ 112 _N_ _N_ _N_ _N_ #-}
autocorr :: Fractional a => [a] -> [a]
{-# GHC_PRAGMA _A_ 1 _U_ 22 _N_ _N_ _N_ _SPECIALISE_ [ Float ] 1 { _A_ 1 _U_ 2 _N_ _S_ "S" _N_ _N_ } #-}
cepstra :: (Float, [Float]) -> [Float]
{-# GHC_PRAGMA _A_ 0 _U_ 1 _N_ _N_ _N_ _N_ #-}
check_for_end :: [[a]] -> [[a]]
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "S" _N_ _N_ #-}
combine :: Num a => [a] -> [a] -> [a]
{-# GHC_PRAGMA _A_ 1 _U_ 111 _N_ _N_ _N_ _SPECIALISE_ [ Float ] 1 { _A_ 2 _U_ 11 _N_ _S_ "SS" _N_ _N_ } #-}
delayAdd :: Num a => [a] -> [a] -> [a]
{-# GHC_PRAGMA _A_ 1 _U_ 212 _N_ _N_ _N_ _SPECIALISE_ [ Float ] 1 { _A_ 2 _U_ 12 _N_ _S_ "SL" _N_ _N_ } #-}
dot :: Num a => [a] -> [a] -> a
{-# GHC_PRAGMA _A_ 1 _U_ 211 _N_ _N_ _N_ _SPECIALISE_ [ Float ] 1 { _A_ 2 _U_ 11 _N_ _S_ "SL" _N_ _N_ } #-}
durbin :: Int -> [Float] -> (Float, [Float])
{-# GHC_PRAGMA _A_ 2 _U_ 11 _N_ _S_ "U(P)S" {_A_ 2 _U_ 21 _N_ _N_ _N_ _N_} _N_ _N_ #-}
durbin_step :: Fractional a => [a] -> (a, [a]) -> (a, [a])
{-# GHC_PRAGMA _A_ 1 _U_ 222 _N_ _N_ _N_ _SPECIALISE_ [ Float ] 1 { _A_ 2 _U_ 21 _N_ _S_ "LU(LL)" {_A_ 3 _U_ 222 _N_ _N_ _N_ _N_} _N_ _N_ } #-}
fir :: [Float] -> [Float] -> [Float]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "SL" _N_ _N_ #-}
frames :: Int -> Int -> [a] -> [[a]]
{-# GHC_PRAGMA _A_ 3 _U_ 222 _N_ _N_ _N_ _N_ #-}
hamming_window :: Int -> [Float]
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(P)" {_A_ 1 _U_ 2 _N_ _N_ _N_ _N_} _N_ _N_ #-}
log10 :: Float -> Float
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(P)" {_A_ 1 _U_ 2 _N_ _N_ _N_ _N_} _N_ _N_ #-}
new_as :: Num a => [a] -> a -> [a]
{-# GHC_PRAGMA _A_ 3 _U_ 222 _N_ _S_ "LSL" _N_ _SPECIALISE_ [ Float ] 1 { _A_ 2 _U_ 22 _N_ _S_ "SL" _N_ _N_ } #-}
new_k :: Fractional a => [a] -> (a, [a]) -> a
{-# GHC_PRAGMA _A_ 1 _U_ 122 _N_ _S_ "U(LSAA)" {_A_ 2 _U_ 2121 _N_ _N_ _N_ _N_} _N_ _SPECIALISE_ [ Float ] 1 { _A_ 2 _U_ 21 _N_ _S_ "LU(U(P)S)" {_A_ 3 _U_ 221 _N_ _N_ _N_ _N_} _N_ _N_ } #-}
preemph :: Float -> [Float] -> [Float]
{-# GHC_PRAGMA _A_ 1 _U_ 12 _N_ _N_ _N_ _N_ #-}
tails :: [a] -> [[a]]
{-# GHC_PRAGMA _A_ 1 _U_ 2 _N_ _S_ "S" _N_ _N_ #-}
window :: [Float] -> [Float] -> [Float]
{-# GHC_PRAGMA _A_ 2 _U_ 11 _N_ _S_ "SL" _N_ _N_ #-}
window' :: Num a => [a] -> [a] -> [a] -> [a]
{-# GHC_PRAGMA _A_ 1 _U_ 1112 _N_ _N_ _N_ _SPECIALISE_ [ Float ] 1 { _A_ 3 _U_ 112 _N_ _S_ "SLL" _N_ _N_ } #-}
windows :: Int -> Int -> [Float] -> [[Float]]
{-# GHC_PRAGMA _A_ 2 _U_ 122 _N_ _N_ _N_ _N_ #-}
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface Fast2haskell where
import PreludeArray(Array, Assoc)
import PreludeComplex(Complex)
import PreludeIO(Request, Response)
type Array_type a = Array Int a
type Assoc_type a = Assoc Int a
type Complex_type = Complex Double
type Descr_type = (Int, Int)
abortstr :: [Char] -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 2 _U_ 00 _N_ _S_ "AA" {_A_ 0 _N_ _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _!_ _NIL_ [Request] [] _N_} _F_ _IF_ARGS_ 0 2 XX 1 \ (u0 :: [Char]) (u1 :: [Response]) -> _!_ _NIL_ [Request] [] _N_ #-}
delay :: a -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 2 _U_ 00 _N_ _S_ "A" {_A_ 1 _U_ 0 _N_ _N_ _F_ _IF_ARGS_ 1 1 X 1 _/\_ u0 -> \ (u1 :: [Response]) -> _!_ _NIL_ [Request] [] _N_} _F_ _IF_ARGS_ 1 1 X 2 _/\_ u0 -> \ (u1 :: u0) -> _APP_ _ORIG_ Fast2haskell abortstr [ _NOREP_S_ "delay not implemented" ] _N_ #-}
descr :: a -> b -> (a, b)
{-# GHC_PRAGMA _A_ 2 _U_ 22 _N_ _N_ _F_ _IF_ARGS_ 2 2 XX 3 _/\_ u0 u1 -> \ (u2 :: u0) (u3 :: u1) -> _!_ _TUP_2 [u0, u1] [u2, u3] _N_ #-}
destr_update :: Ix a => Array a b -> a -> b -> Array a b
{-# GHC_PRAGMA _A_ 1 _U_ 1222 _N_ _S_ "U(ASLA)" {_A_ 2 _U_ 22222 _N_ _N_ _N_ _N_} _N_ _N_ #-}
entier :: (Num b, RealFrac a) => a -> b
{-# GHC_PRAGMA _A_ 2 _U_ 112 _N_ _S_ "U(AAAAAAAASA)L" {_A_ 2 _U_ 112 _N_ _N_ _N_ _N_} _N_ _N_ #-}
fix :: (a -> a) -> a
{-# GHC_PRAGMA _A_ 1 _U_ 2 _N_ _S_ "S" _F_ _IF_ARGS_ 1 1 X 4 _/\_ u0 -> \ (u1 :: u0 -> u0) -> _LETREC_ {(u2 :: u0) = _APP_ u1 [ u2 ]} in u2 _N_ #-}
force :: a -> a
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "S" _F_ _IF_ARGS_ 1 1 X 1 _/\_ u0 -> \ (u1 :: u0) -> u1 _N_ #-}
iff :: Bool -> a -> a -> a
{-# GHC_PRAGMA _A_ 3 _U_ 111 _N_ _S_ "ELL" _F_ _IF_ARGS_ 1 3 CXX 4 _/\_ u0 -> \ (u1 :: Bool) (u2 :: u0) (u3 :: u0) -> case u1 of { _ALG_ True -> u2; False -> u3; _NO_DEFLT_ } _N_ #-}
iffrev :: a -> a -> Bool -> a
{-# GHC_PRAGMA _A_ 3 _U_ 111 _N_ _S_ "LLE" _F_ _IF_ARGS_ 1 3 XXC 4 _/\_ u0 -> \ (u1 :: u0) (u2 :: u0) (u3 :: Bool) -> case u3 of { _ALG_ True -> u2; False -> u1; _NO_DEFLT_ } _N_ #-}
indassoc :: Assoc b a -> b
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(SA)" {_A_ 1 _U_ 1 _N_ _N_ _F_ _IF_ARGS_ 2 1 X 1 _/\_ u0 u1 -> \ (u2 :: u1) -> u2 _N_} _F_ _IF_ARGS_ 2 1 C 2 _/\_ u0 u1 -> \ (u2 :: Assoc u1 u0) -> case u2 of { _ALG_ (:=) (u3 :: u1) (u4 :: u0) -> u3; _NO_DEFLT_ } _N_ #-}
land_i :: Int -> Int -> Int
{-# GHC_PRAGMA _A_ 2 _U_ 11 _N_ _S_ "U(P)U(P)" {_A_ 2 _U_ 22 _N_ _N_ _N_ _N_} _N_ _N_ #-}
lnot_i :: Int -> Int
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(P)" {_A_ 1 _U_ 2 _N_ _N_ _N_ _N_} _N_ _N_ #-}
lor_i :: Int -> Int -> Int
{-# GHC_PRAGMA _A_ 2 _U_ 11 _N_ _S_ "U(P)U(P)" {_A_ 2 _U_ 22 _N_ _N_ _N_ _N_} _N_ _N_ #-}
lowbound :: (b, a) -> b
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(SA)" {_A_ 1 _U_ 1 _N_ _N_ _F_ _IF_ARGS_ 2 1 X 1 _/\_ u0 u1 -> \ (u2 :: u1) -> u2 _N_} _F_ _IF_ARGS_ 2 1 C 2 _/\_ u0 u1 -> \ (u2 :: (u1, u0)) -> case u2 of { _ALG_ _TUP_2 (u3 :: u1) (u4 :: u0) -> u3; _NO_DEFLT_ } _N_ #-}
lshift_i :: Int -> Int -> Int
{-# GHC_PRAGMA _A_ 2 _U_ 11 _N_ _S_ "U(P)U(P)" {_A_ 2 _U_ 22 _N_ _N_ _N_ _N_} _N_ _N_ #-}
pair :: [a] -> Bool
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "S" _F_ _IF_ARGS_ 1 1 C 4 _/\_ u0 -> \ (u1 :: [u0]) -> case u1 of { _ALG_ (:) (u2 :: u0) (u3 :: [u0]) -> _!_ True [] []; _NIL_ -> _!_ False [] []; _NO_DEFLT_ } _N_ #-}
rshift_i :: Int -> Int -> Int
{-# GHC_PRAGMA _A_ 2 _U_ 11 _N_ _S_ "U(P)U(P)" {_A_ 2 _U_ 22 _N_ _N_ _N_ _N_} _N_ _N_ #-}
seq :: a -> b -> b
{-# GHC_PRAGMA _A_ 2 _U_ 01 _N_ _S_ "AS" {_A_ 1 _U_ 1 _N_ _N_ _F_ _IF_ARGS_ 2 1 X 1 _/\_ u0 u1 -> \ (u2 :: u1) -> u2 _N_} _F_ _IF_ARGS_ 2 2 XX 1 _/\_ u0 u1 -> \ (u2 :: u0) (u3 :: u1) -> u3 _N_ #-}
strcmp :: [Char] -> [Char] -> Bool
{-# GHC_PRAGMA _A_ 2 _U_ 22 _N_ _N_ _F_ _IF_ARGS_ 0 0 X 1 _CONSTM_ Eq (==) ([Char]) _N_ #-}
tabulate :: (Ix a, Enum a) => (a -> b) -> (a, a) -> Array a b
{-# GHC_PRAGMA _A_ 4 _U_ 1122 _N_ _S_ "U(ASLA)LLU(LL)" {_A_ 5 _U_ 22122 _N_ _N_ _N_ _N_} _N_ _N_ #-}
upbound :: (a, b) -> b
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(AS)" {_A_ 1 _U_ 1 _N_ _N_ _F_ _IF_ARGS_ 2 1 X 1 _/\_ u0 u1 -> \ (u2 :: u1) -> u2 _N_} _F_ _IF_ARGS_ 2 1 C 2 _/\_ u0 u1 -> \ (u2 :: (u0, u1)) -> case u2 of { _ALG_ _TUP_2 (u3 :: u0) (u4 :: u1) -> u4; _NO_DEFLT_ } _N_ #-}
update :: Ix a => Array a b -> a -> b -> Array a b
{-# GHC_PRAGMA _A_ 1 _U_ 1222 _N_ _S_ "U(ASLA)" {_A_ 2 _U_ 22222 _N_ _N_ _N_ _N_} _N_ _N_ #-}
valassoc :: Assoc a b -> b
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(AS)" {_A_ 1 _U_ 1 _N_ _N_ _F_ _IF_ARGS_ 2 1 X 1 _/\_ u0 u1 -> \ (u2 :: u1) -> u2 _N_} _F_ _IF_ARGS_ 2 1 C 2 _/\_ u0 u1 -> \ (u2 :: Assoc u0 u1) -> case u2 of { _ALG_ (:=) (u3 :: u0) (u4 :: u1) -> u4; _NO_DEFLT_ } _N_ #-}
This diff is collapsed.
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface GoferPreludeBits where
cjustify :: Int -> [Char] -> [Char]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "U(P)S" {_A_ 2 _U_ 22 _N_ _N_ _N_ _N_} _N_ _N_ #-}
copy :: Int -> a -> [a]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "U(P)L" {_A_ 2 _U_ 22 _N_ _N_ _N_ _N_} _N_ _N_ #-}
insert :: Ord a => a -> [a] -> [a]
{-# GHC_PRAGMA _A_ 1 _U_ 122 _N_ _N_ _N_ _N_ #-}
layn :: [[Char]] -> [Char]
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _N_ _N_ _N_ #-}
ljustify :: Int -> [Char] -> [Char]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "LS" _N_ _N_ #-}
merge :: Ord a => [a] -> [a] -> [a]
{-# GHC_PRAGMA _A_ 1 _U_ 122 _N_ _N_ _N_ _N_ #-}
qsort :: Ord a => [a] -> [a]
{-# GHC_PRAGMA _A_ 1 _U_ 21 _N_ _N_ _N_ _N_ #-}
rjustify :: Int -> [Char] -> [Char]
{-# GHC_PRAGMA _A_ 2 _U_ 12 _N_ _S_ "U(P)S" {_A_ 2 _U_ 22 _N_ _N_ _N_ _N_} _N_ _N_ #-}
sort :: Ord a => [a] -> [a]
{-# GHC_PRAGMA _A_ 1 _U_ 11 _N_ _N_ _N_ _N_ #-}
space :: Int -> [Char]
{-# GHC_PRAGMA _A_ 1 _U_ 1 _N_ _S_ "U(P)" {_A_ 1 _U_ 2 _N_ _N_ _N_ _N_} _N_ _N_ #-}
undefined :: a
{-# GHC_PRAGMA _A_ 0 _N_ _N_ _S_ _!_ _F_ _IF_ARGS_ 1 0 X 2 _/\_ u0 -> _APP_ _TYAPP_ error { u0 } [ _NOREP_S_ "undefined" ] _N_ #-}
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface Io where
import PreludeIO(Request, Response)
type Io a = (a -> [Response] -> [Request]) -> [Response] -> [Request]
bindIo :: ((a -> [Response] -> [Request]) -> [Response] -> [Request]) -> (a -> (b -> [Response] -> [Request]) -> [Response] -> [Request]) -> (b -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 3 _U_ 1222 _N_ _S_ "SLL" _N_ _N_ #-}
doneIo :: (a -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 2 _U_ 00 _N_ _S_ "AA" {_A_ 0 _N_ _N_ _N_ _F_ _IF_ARGS_ 1 0 X 1 _/\_ u0 -> _!_ _NIL_ [Request] [] _N_} _F_ _IF_ARGS_ 1 2 XX 1 _/\_ u0 -> \ (u1 :: u0 -> [Response] -> [Request]) (u2 :: [Response]) -> _!_ _NIL_ [Request] [] _N_ #-}
ioToDialogue :: ((a -> [Response] -> [Request]) -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 1 _U_ 12 _N_ _S_ "S" _N_ _N_ #-}
processRequestIo :: Request -> (Response -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 3 _U_ 211 _N_ _N_ _N_ _N_ #-}
unitIo :: a -> (a -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 2 _U_ 212 _N_ _S_ "LS" _F_ _IF_ARGS_ 1 2 XX 2 _/\_ u0 -> \ (u1 :: u0) (u2 :: u0 -> [Response] -> [Request]) -> _APP_ u2 [ u1 ] _N_ #-}
{-# GHC_PRAGMA INTERFACE VERSION 5 #-}
interface JobApp where
import JobImp(E)
import PreludeIO(Request, Response)
infixl 0 ##=
infixl 0 >>
infixl 1 >>=
infixl 0 >>>
infixl 1 >>>=
infixr 0 ?
type SJob a b c d = ((b, a), [Char]) -> ((E d, ((c, a), [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]
type STask a b c = ((b, a), [Char]) -> ((E (), ((c, a), [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]
type Task a b = (a, [Char]) -> ((E (), (b, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]
(##=) :: ((a, [Char]) -> ((E b, (a, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]) -> ((a, [Char]) -> ((E c, (a, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]) -> (a, [Char]) -> ((E (b, c), (a, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 3 _U_ 22122 _N_ _S_ "SL" _N_ _N_ #-}
(>>) :: ((b, [Char]) -> ((E a, (c, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]) -> ((c, [Char]) -> ((E d, (c, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]) -> (b, [Char]) -> ((E d, (c, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 3 _U_ 22122 _N_ _S_ "SL" _N_ _N_ #-}
(>>=) :: ((b, [Char]) -> ((E a, (d, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]) -> (a -> (d, [Char]) -> ((E c, (d, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]) -> (b, [Char]) -> ((E c, (d, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 3 _U_ 22122 _N_ _S_ "SLU(LL)" {_A_ 4 _U_ 222222 _N_ _N_ _N_ _N_} _N_ _N_ #-}
(>>>) :: ((c, [Char]) -> ((E a, (b, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]) -> ((b, [Char]) -> ((E e, (d, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]) -> (c, [Char]) -> ((E e, (d, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 3 _U_ 12222 _N_ _N_ _N_ _N_ #-}
(>>>=) :: ((c, [Char]) -> ((E a, (b, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]) -> (a -> (b, [Char]) -> ((E d, (e, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]) -> (c, [Char]) -> ((E d, (e, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 3 _U_ 12222 _N_ _N_ _F_ _IF_ARGS_ 5 0 X 1 _/\_ u0 u1 u2 u3 u4 -> _TYAPP_ _TYAPP_ _TYAPP_ _TYAPP_ _TYAPP_ _ORIG_ JobImp bindJob { u0 } { u1 } { u2 } { u4 } { u3 } _N_ #-}
(?) :: ((a, [Char]) -> ((E b, (a, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]) -> ((a, [Char]) -> ((E b, (a, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]) -> (a, [Char]) -> ((E b, (a, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 3 _U_ 12222 _N_ _S_ "SLL" _N_ _N_ #-}
appendChanJ :: [Char] -> [Char] -> (a, [Char]) -> ((E (), (a, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 2 _U_ 22122 _N_ _N_ _N_ _N_ #-}
appendFileJ :: [Char] -> [Char] -> (a, [Char]) -> ((E (), (a, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 2 _U_ 22122 _N_ _N_ _N_ _N_ #-}
applyToState :: (a -> b) -> (a, [Char]) -> ((E (), (b, [Char])) -> [Response] -> [Request]) -> [Response] -> [Request]
{-# GHC_PRAGMA _A_ 2 _U_ 2222 _N_ _N_ _N_ _N_ #-}