Unbound.Util

Various utilities for the Unbound library.

Documentation

class Foldable f => Collection f where

Collections are foldable types that support empty, singleton, union, and map operations. The result of a free variable calculation may be any collection. Instances are provided for lists, sets, and multisets.

Minimal complete definition

emptyC, singleton, union, cmap

Methods

emptyC :: f a

An empty collection. Must be the identity for union.

singleton :: a -> f a

Create a singleton collection.

union :: Ord a => f a -> f a -> f a

An associative combining operation. The Ord constraint is in order to accommodate sets.

cmap :: (Ord a, Ord b) => (a -> b) -> f a -> f b

Collections must be functorial. The normal Functor class won't do because of the Ord constraint on sets.

Instances

Collection []

Lists are containers under concatenation. Lists preserve ordering and multiplicity of elements.

Methods

emptyC :: [a]

singleton :: a -> [a]

union :: Ord a => [a] -> [a] -> [a]

cmap :: (Ord a, Ord b) => (a -> b) -> [a] -> [b]

Collection Set

Sets are containers under union, which preserve only occurrence, not multiplicity or ordering.

Methods

emptyC :: Set a

singleton :: a -> Set a

union :: Ord a => Set a -> Set a -> Set a

cmap :: (Ord a, Ord b) => (a -> b) -> Set a -> Set b

Collection Multiset

Multisets are containers which preserve multiplicity but not ordering.

Methods

emptyC :: Multiset a

singleton :: a -> Multiset a

union :: Ord a => Multiset a -> Multiset a -> Multiset a

cmap :: (Ord a, Ord b) => (a -> b) -> Multiset a -> Multiset b

unions :: (Ord a, Collection f) => [f a] -> f a

Combine a list of containers into one.

fromList :: (Ord a, Collection f) => [a] -> f a

Create a collection from a list of elements.

filterC :: (Collection f, Ord a) => f (Maybe a) -> f a

Remove the Nothings from a collection.

newtype Multiset a

A simple representation of multisets.

Constructors

Multiset (Map a Int)

Instances

Foldable Multiset

Methods

fold :: Monoid m => Multiset m -> m

foldMap :: Monoid m => (a -> m) -> Multiset a -> m

foldr :: (a -> b -> b) -> b -> Multiset a -> b

foldr' :: (a -> b -> b) -> b -> Multiset a -> b

foldl :: (b -> a -> b) -> b -> Multiset a -> b

foldl' :: (b -> a -> b) -> b -> Multiset a -> b

foldr1 :: (a -> a -> a) -> Multiset a -> a

foldl1 :: (a -> a -> a) -> Multiset a -> a

toList :: Multiset a -> [a]

null :: Multiset a -> Bool

length :: Multiset a -> Int

elem :: Eq a => a -> Multiset a -> Bool

maximum :: Ord a => Multiset a -> a

minimum :: Ord a => Multiset a -> a

sum :: Num a => Multiset a -> a

product :: Num a => Multiset a -> a

Collection Multiset

Multisets are containers which preserve multiplicity but not ordering.

Methods

emptyC :: Multiset a

singleton :: a -> Multiset a

union :: Ord a => Multiset a -> Multiset a -> Multiset a

cmap :: (Ord a, Ord b) => (a -> b) -> Multiset a -> Multiset b

disjoint :: Ord a => Set a -> Set a -> Bool

Determine whether two sets have an empty intersection