Data.FixFile.Set

This is a data type that can be used with a FixFile to store a set of Ordered items as an unbalanced binary tree. This file is not recommended for use, but exists for educational purposes. It has a simple implementation that is easier to read than some of the more advanced balanced data types.

Documentation

data Set i a

A Fixed (Set i) is a set of items represented as a binary tree.

Instances

Functor (Set i)

Foldable (Set i)

Traversable (Set i)

(Read i, Read a) => Read (Set i a)

(Show i, Show a) => Show (Set i a)

Generic (Set i a)

(Binary i, Binary a) => Binary (Set i a)

type Rep (Set i a)

createSetFile :: (Binary i, Typeable i) => FilePath -> IO (FixFile (Ref (Set i)))

Create a FixFile (Set i).

openSetFile :: (Binary i, Typeable i) => FilePath -> IO (FixFile (Ref (Set i)))

Open a FixFile (Set i).

empty :: Fixed g => g (Set i)

An empty Set.

insertSet :: (Ord i, Fixed g) => i -> g (Set i) -> g (Set i)

Insert an item i into a Fixed recursive Set i.

insertSetT :: (Ord i, Binary i) => i -> Transaction (Ref (Set i)) s ()

Transaction version of insertSet.

deleteSet :: (Ord i, Fixed g) => i -> g (Set i) -> g (Set i)

Delete an item i into a Fixed recursive Set i.

deleteSetT :: (Ord i, Binary i) => i -> Transaction (Ref (Set i)) s ()

Transaction version of deleteSet.

lookupSet :: (Ord i, Fixed g) => i -> g (Set i) -> Bool

Predicate to lookup an item from a Set i.

lookupSetT :: (Ord i, Binary i) => i -> Transaction (Ref (Set i)) s Bool

FTransaction version of lookupSet.

toListSet :: Fixed g => g (Set i) -> [i]

Turn a Fixed recurive structure of Set i into a list.

toListSetT :: Binary i => Transaction (Ref (Set i)) s [i]

Transaction version of toListSet.