Performance/Strings
From HaskellWiki
(Take string/packed string problem from haskell-cafe@ as example) |
(Use fps if your strings are 1G or bigger) |
||
| Line 13: | Line 13: | ||
The packed string libraries have the benefit over arrays of Word8 or | The packed string libraries have the benefit over arrays of Word8 or | ||
Char types, in that they provide the usual list-like operations. | Char types, in that they provide the usual list-like operations. | ||
| + | |||
| + | Some interesting results for FastPackedString are documented | ||
| + | [http://www.cse.unsw.edu.au/~dons/code/fps/README here]. In particular, | ||
| + | it compares FPS against the existing PackedString and [Char] functions, | ||
| + | and is used successfully with 1 gigabyte strings. | ||
==Example== | ==Example== | ||
Revision as of 06:26, 20 April 2006
| Haskell Performance Resource
Constructs: Techniques: |
Contents |
1 Strings
Sometimes the cost of representing strings as lists of Char can be too much. In this case, you can instead use packed strings. There are a number of options:
- The standard Data.PackedString type
- One of the newer packed string libraries, for example FastPackedString
- Unboxed arrays of Word8 or Char
- Ptrs to foreign malloced Word8 buffers
The packed string libraries have the benefit over arrays of Word8 or Char types, in that they provide the usual list-like operations.
Some interesting results for FastPackedString are documented here. In particular, it compares FPS against the existing PackedString and [Char] functions, and is used successfully with 1 gigabyte strings.
2 Example
Pete Chown asked the question:
I want to read a text file. As an example, let's use /usr/share/dict/words and try to print out the last line of the file.
The python version completes in around 0.05s.
2.1 Attempt 1 : [Char]
import System.IO main = readFile "/usr/share/dict/words" >>= putStrLn.last.lines
Run in hugs, this program took several seconds to complete. Problem: interpreted (solution, use a Haskell compiler). Compiled, the program completes in a fairly quick 0.2s. Still, we can do better.
2.2 Attempt 2 : Packed Strings
Using fast, packed strings, we get:
import qualified Data.FastPackedString as P import IO main = P.readFile "/usr/share/dict/words" >>= P.hPut stdout . last . P.lines
Runs in 0.063s
2.3 Attempt 3 : No Lists
Avoid splitting the file into lists at all, and just keep a single buffer (as a C programmer would perhaps do):
import qualified Data.FastPackedString as P import IO main = do P.readFile "/usr/share/dict/words" >>= P.hPut stdout . snd . P.spanEnd (/='\n') . P.init putChar '\n'
Runs in 0.013s
