Data.Columbia.WithAddress

Documentation

data WithAddress t

Data type for a piece of data that may or may not have an explicit address associated with it. This is nice because I can play with these in pure code to manipulate data, while still remembering all of the explicit term structure.

Instances

Eq t => Eq (WithAddress t)

Methods

(==) :: WithAddress t -> WithAddress t -> Bool

(/=) :: WithAddress t -> WithAddress t -> Bool

Ord t => Ord (WithAddress t)

Methods

compare :: WithAddress t -> WithAddress t -> Ordering

(<) :: WithAddress t -> WithAddress t -> Bool

(<=) :: WithAddress t -> WithAddress t -> Bool

(>) :: WithAddress t -> WithAddress t -> Bool

(>=) :: WithAddress t -> WithAddress t -> Bool

max :: WithAddress t -> WithAddress t -> WithAddress t

min :: WithAddress t -> WithAddress t -> WithAddress t

Show t => Show (WithAddress t)

Methods

showsPrec :: Int -> WithAddress t -> ShowS

show :: WithAddress t -> String

showList :: [WithAddress t] -> ShowS

copoint :: WithAddress t -> t

point :: t -> WithAddress t

addressOf :: WithAddress t -> Word32

dataOf :: WithAddress t -> t

withAddresses :: forall ctx m d. (Data ctx d, Monad m) => PolyTraversal ctx m d

The strategy reads term structure from a file and associates file addresses with it. Bear in mind that the addresses become no good at the moment your reader lock is relinquished, due to GC'ing.

writeBackAddresses :: forall ctx m d. (Data ctx d, Monad m) => PolyTraversalW ctx m d

A strategy to intelligently reconstruct shared structure on disk. It intercepts any subterm with type WithAddress and that associates an address to the data, and writes that address in lieu of writing all of the data, thereby achieving structural sharing. Note that the term structure of WithAddress constructor is skipped and does not get written.

Orphan instances

(Sat (ctx Word32), Sat (ctx (WithAddress t)), Data ctx t) => Data ctx (WithAddress t)

Methods

gfoldl :: Proxy ctx -> (forall b c. Data ctx b => w (b -> c) -> b -> w c) -> (forall g. g -> w g) -> WithAddress t -> w (WithAddress t)

gunfold :: Proxy ctx -> (forall b r. Data ctx b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (WithAddress t)

toConstr :: Proxy ctx -> WithAddress t -> Constr

dataTypeOf :: Proxy ctx -> WithAddress t -> DataType

dataCast1 :: Typeable1 t => Proxy ctx -> (forall b. Data ctx b => w (t b)) -> Maybe (w (WithAddress t))

dataCast2 :: Typeable2 t => Proxy ctx -> (forall b c. (Data ctx b, Data ctx c) => w (t b c)) -> Maybe (w (WithAddress t))

KeyComparable (WithAddress t)

Methods

isKeyed :: WithAddress t -> Bool

keyCompare :: WithAddress t -> WithAddress t -> Ordering

Typeable * t => RW (WithAddress t)

Methods

readData :: Monad m => ReaderT * (SeekableStream m Word8) m (WithAddress t)

writeData :: Monad m => WithAddress t -> ReaderT * (SeekableWriter m Word8) m ()