Data.TrieSet

Set type

data TSet a

Instances

TKey a => Eq (TSet a)

(TKey a, Ord a) => Ord (TSet a)

(TKey a, Show a) => Show (TSet a)

TKey a => Monoid (TSet a)

Operators

(\\) :: TKey a => TSet a -> TSet a -> TSet a

Query

null :: TKey a => TSet a -> Bool

size :: TKey a => TSet a -> Int

member :: TKey a => a -> TSet a -> Bool

notMember :: TKey a => a -> TSet a -> Bool

isSubsetOf :: TKey a => TSet a -> TSet a -> Bool

isProperSubsetOf :: TKey a => TSet a -> TSet a -> Bool

Construction

empty :: TKey a => TSet a

singleton :: TKey a => a -> TSet a

insert :: TKey a => a -> TSet a -> TSet a

delete :: TKey a => a -> TSet a -> TSet a

Combine

union :: TKey a => TSet a -> TSet a -> TSet a

symmetricDifference :: TKey a => TSet a -> TSet a -> TSet a

intersection :: TKey a => TSet a -> TSet a -> TSet a

difference :: TKey a => TSet a -> TSet a -> TSet a

Filter

filter :: TKey a => (a -> Bool) -> TSet a -> TSet a

partition :: TKey a => (a -> Bool) -> TSet a -> (TSet a, TSet a)

split :: TKey a => a -> TSet a -> (TSet a, TSet a)

splitMember :: TKey a => a -> TSet a -> (TSet a, Bool, TSet a)

Map

map :: (TKey a, TKey b) => (a -> b) -> TSet a -> TSet b

mapMonotonic :: (TKey a, TKey b) => (a -> b) -> TSet a -> TSet b

Fold

fold :: TKey a => (a -> b -> b) -> b -> TSet a -> b

foldl :: TKey b => (a -> b -> a) -> a -> TSet b -> a

foldr :: TKey a => (a -> b -> b) -> b -> TSet a -> b

Min/Max

findMin :: TKey a => TSet a -> a

findMax :: TKey a => TSet a -> a

deleteMin :: TKey a => TSet a -> TSet a

deleteMax :: TKey a => TSet a -> TSet a

deleteFindMin :: TKey a => TSet a -> (a, TSet a)

deleteFindMax :: TKey a => TSet a -> (a, TSet a)

minView :: TKey a => TSet a -> Maybe (a, TSet a)

maxView :: TKey a => TSet a -> Maybe (a, TSet a)

Conversion

List

elems :: TKey a => TSet a -> [a]

toList :: TKey a => TSet a -> [a]

fromList :: TKey a => [a] -> TSet a

Ordered lists

toAscList :: TKey a => TSet a -> [a]

fromAscList :: TKey a => [a] -> TSet a

fromDistinctAscList :: TKey a => [a] -> TSet a