undefined
.
Eventually, the complete
version will be made available.
In class exercise: SecretCode
OK, we're going to write a Haskell program to encode and decode text files using a secret code.
We'll call it the Brown Fox code. Here's how it works:
- Replace each letter according to the following correspondence:
"abcdefghijklmnopqrstuvwxyz"
to "thequickbrownfxjmpsvlazydg"
But leave any non-letter characters alone.
- Then reverse the order of the lines in the file.
First, we make a lookup list (aka association list) containing each pair of corresponding letters:
> code :: [(Char,Char)]
> code = zip ['a' .. 'z'] cypher ++ zip ['A' .. 'Z'] (map toUpper cypher)
> where
> cypher :: String
> cypher = "thequickbrownfxjmpsvlazydg"
Now, how can we use this lookup list?
Association lists seem like they are probably a pretty common idiom, so let's check Hoogle to see if there is a function to look things up in them automatically...
What type would such a function have? In our case, we want something like:
[(Char,Char)] -> Char -> Char
That is, the function should take a list that maps Char
s to Char
s and a specific Char
, and it should return the corresponding Char
from the list (if it is present). The first hit on Hoogle for this type is the standard library function lookup
:
lookup :: Eq a => a -> [(a,b)] -> Maybe b
Ignoring the Eq a
part for now (we'll talk about it next week), this type makes a lot of sense. It's a bit more general than what we needed (the list doesn't have to contain Char
s), and it returns a Maybe
, because the thing you're looking up might not be in the list.
(Recall that a Maybe a
is either Just v
for some v of type a
, or Nothing.)
So, we can use lookup
to encode a particular character. If we don't have a mapping for a character in our code, (i.e. for punctuation) we should leave it alone.
We'll next need a way to encode a whole line of text. Of course, remembering that String
s are just lists of Char
s, there is a perfect higher-order function in Lec3
that we can use:
Finally, we need a function to encode a whole file. Remember, we want to reverse the order of the lines (so that the last line is first, and so on), then swap the letters in each. The reverse
function in the standard library will come in handy.
However, we also need a way to break a file into lines - we could do this manually by folding over the String
and checking for newlines, but since it seems pretty common, let's check Hoogle instead. Indeed, we find a function of type
String -> [String]
in the standard library to do just this. Furthermore, its counterpart of type
[String] -> String
So...
Don't forget that the . operator is function composition. That is:
(f . g) x = f (g x)
See if you can simplify your definition of encodeContent
using this operator.
OK, now let's construct an IO action that actually reads in a file from disk, encodes it, and writes it back out. We can look at the Haskell Prelude to find functions for reading and writing files.
readFile :: FilePath -> IO String
writeFile :: FilePath -> String -> IO ()
Your function should read from the file 'f', but shouldn't overwrite the file with the encoded version. In Haskell, FilePath
s are just strings, so we can create a new filename by appending a new extension to it.
Finally, lets put it all together into a "main" function that reads in a file name from the standard input stream and swizzles it: