1

我正在尝试使用 Monads 在 Haskell 中实现 LZW 压缩，这是迄今为止我的代码与测试用例：

{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE FlexibleContexts #-}
import Control.Monad.State
import Control.Monad.Writer
import Data.Char (chr, ord)
import Data.List (isPrefixOf, maximumBy)
import Data.Function
import Test.QuickCheck

type Dictionary = [String]

dictionary :: Dictionary
dictionary = [[chr x] | x <- [0..127]]


test_dictionary =
  [ map ord (concat dictionary) == [0..127]
  , all (\str -> length str == 1) dictionary
  ]

prefixes :: String -> Dictionary -> [(Int, String)]
prefixes str dict = [(x, dict!!x) | x <- [0..length dict - 1], isPrefixOf (dict!!x) str]

test_prefixes =
  [ prefixes "" dictionary == []
  , prefixes "appletree" []   == []
  , prefixes "appletree" ["ap", "apple", "tree", "pear"] == [(0, "ap"), (1, "apple")]
  , prefixes "babe" dictionary                    == [(98, "b")]
  ]

longest :: [(Int, String)] -> (Int, String)
longest prefs = maximumBy (compare `on` (\(x,y) -> length y)) prefs

test_longest =
  [ longest [(30, "a"), (20, "abc"), (15, "ab")]  == (20, "abc")
  , longest [(30, "a"), (20, "abc"), (15, "abc")] == (15, "abc")
  ]

instance MonadState Dictionary ((->) Dictionary) where
    get = \s -> s

munch :: MonadState Dictionary m => String -> m (Int, String, String)
munch str = do
        dict <- get
        let longst = longest (prefixes str dict)
        return (fst longst, snd longst, [str!!x | x <- [length (snd longst)..length str - 1]])

test_munch =
  [ evalState (munch "a")      ["a"]            == (0, "a", "")
  , evalState (munch "appletree") ["a"]            == (0, "a", "ppletree")
  , evalState (munch "peach") ["a", "ba", "b"] == (1, "ba", "be")
  ]

instance MonadState m (StateT Dictionary ((->) m)) where

append :: MonadState Dictionary m => String -> String -> m ()
append s "" = return ()
append s w = do
        dict <- get
        let newWord = s ++ (take 1 w)
        if (notElem newWord dict)
        then do
            put (dict++[newWord])
        else return ()

test_append =
  [ execState (append "a" "")   []         == []
  , execState (append "a" "")   dictionary == dictionary
  , execState (append "a" "bc") []         == ["ab"]
  , execState (append "a" "bc") ["ab"]     == ["ab"]
  ]

encode :: String -> WriterT [Int] (State Dictionary) ()
encode "" = return ()
encode w = do
        dict <- get
        let (a, b, c) = (munch w) dict
        if length dict < 256
        then do
            tell [a]
            put ((append b c) dict)
            encode c
        else return ()

test_encode =
  [ evalState (execWriterT (encode ""))         []         == []
  , evalState (execWriterT (encode "aaa"))      ["a"]      == [0, 1]
  , evalState (execWriterT (encode "aaaa"))     ["a"]      == [0, 1, 0]
  , evalState (execWriterT (encode "aaaaa"))    ["a"]      == [0, 1, 1]
  , evalState (execWriterT (encode "abababab")) ["a", "b"] == [0, 1, 2, 4, 1]
  , evalState (execWriterT (encode "aaabbbccc")) dictionary
    == [97, 128, 98, 130, 99, 132]
  ]

decode :: [Int] -> WriterT String (State Dictionary) ()
decode [] = return ()
decode [x] = do
    dict <- get
    tell (dict!!x)
decode (x:xs) = do
    dict <- get
    let f = dict!!x
    let s = if(length dict > head xs) 
            then dict!!head xs
            else f
    tell f
    put (append f s) dict
    decode xs

    test_decode =
  [ evalState (execWriterT (decode []))           []         == []
  , evalState (execWriterT (decode [0]))          ["a"]      == "a"
  , evalState (execWriterT (decode [0, 1, 1, 0])) ["a", "b"] == "abba"
  , evalState (execWriterT (decode [0, 1, 2, 0])) ["a", "b"] == "ababa"
  , evalState (execWriterT (decode [0, 1, 2, 4, 1])) ["a", "b"] == "abababab"
  , evalState (execWriterT (decode [97, 128, 98, 130, 99, 132])) dictionary
    == "aaabbbccc"
  ]

compress :: String -> [Int]
compress w = evalState (execWriterT (encode w)) dictionary

test_compress =
  [ compress ""          == []
  , compress "a"         == [97]
  , compress "aaa"       == [97, 128]
  , compress "aaabbbccc" == [97, 128, 98, 130, 99, 132]
  ]

decompress :: [Int] -> String
decompress list = evalState (execWriterT (decode list)) dictionary

test_decompress =
  [ decompress []                          == ""
  , decompress [97]                        == "a"
  , decompress [97, 128]                   == "aaa"
  , decompress [97, 128, 98, 130, 99, 132] == "aaabbbccc"
  ]

prop_compressDecompress :: String -> Bool
prop_compressDecompress w = do
    let tmp = [chr (div (ord x) 2) | x <- w]
    decompress (compress tmp) == tmp

compressFile :: FilePath -> FilePath -> IO ()
compressFile source target = do
    s <- readFile source
    let compressed = compress s
    let chars = [chr x | x <- compressed]
    writeFile target chars

decompressFile  :: FilePath -> FilePath -> IO ()
decompressFile  source target = do
    s <- readFile source
    let code = [ord x | x <- s]
    let decompressed = decompress code
    writeFile target decompressed

allTests = [test_dictionary, test_prefixes, test_longest, test_munch, test_append 
    ,test_encode
    --, test_decode, test_compress, test_decompress
    ]

main = do
    --quickCheck prop_compressDecompress
    print (allTests, and (concat allTests))

使用此代码，我收到以下错误（指使用 put in "encode" 和 "decode" 函数）：

Main.hs@80:13-80:16 没有使用 put 引起的 (MonadState () (StateT Dictionary Data.Functor.Identity.Identity)) 的实例

我试图定义这个实例，但我能做到的最好的是“实例声明之间的功能依赖冲突”错误。我知道没有 Monads 有更简单的解决方案，但我必须使用它们，而且函数的类型也不能修改。

你能帮我解决我在这里做错了什么吗？

4

2 回答 2

4

您不需要编写任何实例。您只是以错误的方式使用append和munch。

append有类型MonadState Dictionary m => String -> String -> m ()。如果f和s是字符串，则append f s产生一个状态修改动作，最终返回一个().

put有类型MonadState s m => s -> m ()。put用参数替换当前状态s。

鉴于此，put (append f s) dict意义不大。你应该提供put一个参数。你不必在那里做任何事情dict；使用 State monad 的一个核心点是 state 是隐式的，不需要传递它。

此外，append f s它本身已经更新了状态。所以你在这里想要的只是简单append f s的，而不是put (append x y) dict.

encodewith中有类似的错误munch；它只有一个String参数，所以(munch w) dict是错误的。再次，无需触摸dict。此外，由于munch w产生一元结果，您必须使用<-而不是绑定结果let。所以，你应该let (a, b, c) = (much w dict)用(a, b, c) <- munch w.

于 2015-03-15T13:14:04.547 回答
1 
put ((append b c) dict)

看起来不对。append已经是一个单子动作，所以应该足够用了

append b c
于 2015-03-15T13:13:04.713 回答