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

Warning: Set is unbalanced and not recommended.

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

Instances

Functor (Set i)

Methods

fmap :: (a -> b) -> Set i a -> Set i b

(<$) :: a -> Set i b -> Set i a

Foldable (Set i)

Methods

fold :: Monoid m => Set i m -> m

foldMap :: Monoid m => (a -> m) -> Set i a -> m

foldr :: (a -> b -> b) -> b -> Set i a -> b

foldr' :: (a -> b -> b) -> b -> Set i a -> b

foldl :: (b -> a -> b) -> b -> Set i a -> b

foldl' :: (b -> a -> b) -> b -> Set i a -> b

foldr1 :: (a -> a -> a) -> Set i a -> a

foldl1 :: (a -> a -> a) -> Set i a -> a

toList :: Set i a -> [a]

null :: Set i a -> Bool

length :: Set i a -> Int

elem :: Eq a => a -> Set i a -> Bool

maximum :: Ord a => Set i a -> a

minimum :: Ord a => Set i a -> a

sum :: Num a => Set i a -> a

product :: Num a => Set i a -> a

Traversable (Set i)

Methods

traverse :: Applicative f => (a -> f b) -> Set i a -> f (Set i b)

sequenceA :: Applicative f => Set i (f a) -> f (Set i a)

mapM :: Monad m => (a -> m b) -> Set i a -> m (Set i b)

sequence :: Monad m => Set i (m a) -> m (Set i a)

FixedFoldable (Set i)

Methods

foldMapF :: (Fixed g, Monoid m, (* ~ a) (Alg (Set i))) => (a -> m) -> g (Set i) -> m

FixedAlg (Set i)

Associated Types

type Alg (Set i :: * -> *) :: *

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

Methods

readsPrec :: Int -> ReadS (Set i a)

readList :: ReadS [Set i a]

readPrec :: ReadPrec (Set i a)

readListPrec :: ReadPrec [Set i a]

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

Methods

showsPrec :: Int -> Set i a -> ShowS

show :: Set i a -> String

showList :: [Set i a] -> ShowS

Generic (Set i a)

Associated Types

type Rep (Set i a) :: * -> *

Methods

from :: Set i a -> Rep (Set i a) x

to :: Rep (Set i a) x -> Set i a

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

Methods

put :: Set i a -> Put

get :: Get (Set i a)

putList :: [Set i a] -> Put

type Alg (Set i)

type Alg (Set i) = i

type Rep (Set i a)

type Rep (Set i a) = D1 (MetaData "Set" "Data.FixFile.Set" "fixfile-0.4.0.0-6Rx1TzJaeAW4euV9dndAsy" False) ((:+:) (C1 (MetaCons "Empty" PrefixI False) U1) (C1 (MetaCons "Node" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 i)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 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.