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 #

Constructors

Cons
Fields chunkId :: ChunkId chunk :: Chunk

Instances

Show T #
Instance details Defined in Data.IFF Methods showsPrec :: Int -> T -> ShowS # show :: T -> String # showList :: [T] -> ShowS #
Binary T #
Instance details Defined in Data.IFF Methods put :: T -> Put # get :: Get T # putList :: [T] -> Put #

data Chunk #

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 #
Instance details Defined in Data.IFF Methods showsPrec :: Int -> Chunk -> ShowS # show :: Chunk -> String # showList :: [Chunk] -> ShowS #

data ChunkId #

Instances

Eq ChunkId #
Instance details Defined in Data.IFF Methods (==) :: ChunkId -> ChunkId -> Bool # (/=) :: ChunkId -> ChunkId -> Bool #
Show ChunkId #
Instance details Defined in Data.IFF Methods showsPrec :: Int -> ChunkId -> ShowS # show :: ChunkId -> String # showList :: [ChunkId] -> ShowS #

chunkIdFromString :: String -> ChunkId #

chunkIdToString :: ChunkId -> String #

fromByteString :: ByteString -> Maybe T #

toByteString :: T -> ByteString #