Data.IxSet.Typed.Conversions

Conversions from ixset-typed to other containers.

Documentation

toHashMap :: (Hashable a, IsIndexOf a xs) => IxSet xs k -> HashMap a [k]

Convert an `IxSet to a HashMap.

toHashMapBy :: (Hashable a, IsIndexOf a xs) => IxSet xs k -> (a -> [k] -> k') -> HashMap a k'

Convert an IxSet to a HashMap via a function on the index and associated list.

toHashMapByM :: (Monad m, Hashable a, IsIndexOf a xs) => IxSet xs k -> (a -> [k] -> m k') -> m (HashMap a k')

Monadic variant of toHashMapBy.

toHashMapBy' :: (Hashable a, IsIndexOf a xs, Indexable xs k) => IxSet xs k -> (a -> IxSet xs k -> k') -> HashMap a k'

Like toHashMapBy, but uses a function on the requeried IxSet for that key.

toHashMapByM' :: (Monad m, Hashable a, IsIndexOf a xs, Indexable xs k) => IxSet xs k -> (a -> IxSet xs k -> m k') -> m (HashMap a k')

Like toHashMapByM, but uses a function on the requeried IxSet for that key.

toZipperAsc :: forall proxy ix ixs a m. (IsIndexOf ix ixs, MonadThrow m) => proxy ix -> IxSet ixs a -> m (Zipper [] a)

Convert an IxSet to a Zipper by descending sort on an index.

toZipperDesc :: forall proxy ix ixs a m. (IsIndexOf ix ixs, MonadThrow m) => proxy ix -> IxSet ixs a -> m (Zipper [] a)

Convert an IxSet to a Zipper by descending sort on an index.

toAscCofreeList :: (Ord b, IsIndexOf ix ixs) => (ix -> c) -> (a -> c) -> (a -> b) -> IxSet ixs a -> [Cofree [] c]

Convert an IxSet to a list of Cofree by grouping on one of its indices. The result will be sorted in ascending order on the index. The elements will be sorted according to the Ord instance on b.

toAscCofreeListM :: (Ord b, IsIndexOf ix ixs, Monad m) => (ix -> m c) -> (a -> c) -> (a -> b) -> IxSet ixs a -> m [Cofree [] c]

Monadic version of toAscCofreeList.

toDescCofreeList :: (Ord b, IsIndexOf ix ixs) => (ix -> c) -> (a -> c) -> (a -> b) -> IxSet ixs a -> [Cofree [] c]

Convert an IxSet to a list of Cofree by grouping on one of its indices. The result will be sorted in descending order on the index. The elements will be sorted according to the Ord instance on b.

toDescCofreeListM :: (Ord b, IsIndexOf ix ixs, Monad m) => (ix -> m c) -> (a -> c) -> (a -> b) -> IxSet ixs a -> m [Cofree [] c]

Monadic version of toDescCofreeList.