Safe Haskell	Safe
Language	Haskell98

Data.IFF

Description

ToDo:

Lazy read and write.

Problem on writing: If the length of data is computed lazily, then you must seek back to the file position where the size is stored. That is for writing of lazily generated data we need a seekable file device.

Documentation

data T Source #

Constructors

Cons
Fields chunkId :: ChunkId chunk :: Chunk

Instances

Show T Source #
Methods showsPrec :: Int -> T -> ShowS # show :: T -> String # showList :: [T] -> ShowS #
Binary T Source #
Methods put :: T -> Put # get :: Get T # putList :: [T] -> Put #

data Chunk Source #

Constructors

Form
Fields parts :: [T]
List
Fields props :: [T] parts :: [T]
Cat
Fields parts :: [T]
Prop
Fields parts :: [T]
Chunk
Fields content :: ByteString

Instances

Show Chunk Source #
Methods showsPrec :: Int -> Chunk -> ShowS # show :: Chunk -> String # showList :: [Chunk] -> ShowS #

data ChunkId Source #

Instances

Eq ChunkId Source #
Methods (==) :: ChunkId -> ChunkId -> Bool # (/=) :: ChunkId -> ChunkId -> Bool #
Show ChunkId Source #
Methods showsPrec :: Int -> ChunkId -> ShowS # show :: ChunkId -> String # showList :: [ChunkId] -> ShowS #

chunkIdFromString :: String -> ChunkId Source #

chunkIdToString :: ChunkId -> String Source #

fromByteString :: ByteString -> Maybe T Source #

toByteString :: T -> ByteString Source #