| Copyright | Copyright (c) 1998 2008 Chris Okasaki |
|---|---|
| License | MIT; see COPYRIGHT file for terms and conditions |
| Maintainer | robdockins AT fastmail DOT fm |
| Stability | internal (unstable) |
| Portability | GHC / Hugs (MPTC and FD) |
| Safe Haskell | None |
| Language | Haskell2010 |
Data.Edison.Coll.Defaults
Description
This module provides default implementations of many of the collection methods. The functions in this module are used to fill out collection implementations and are not intended to be used directly by end users.
Documentation
insertSeqUsingUnion :: (CollX c a, Sequence seq) => seq a -> c -> c Source #
insertSeqUsingFoldr :: (CollX c a, Sequence seq) => seq a -> c -> c Source #
memberUsingFold :: Coll c a => c -> a -> Bool Source #
countUsingMember :: SetX c a => a -> c -> Int Source #
lookupAllUsingLookupM :: (Set c a, Sequence seq) => a -> c -> seq a Source #
deleteSeqUsingDelete :: (CollX c a, Sequence seq) => seq a -> c -> c Source #
unionSeqUsingFoldl :: (CollX c a, Sequence seq) => seq c -> c Source #
unionSeqUsingFoldl' :: (CollX c a, Sequence seq) => seq c -> c Source #
unionSeqUsingReduce :: (CollX c a, Sequence seq) => seq c -> c Source #
fromSeqUsingFoldr :: (CollX c a, Sequence seq) => seq a -> c Source #
fromSeqUsingUnionSeq :: (CollX c a, Sequence seq) => seq a -> c Source #
toSeqUsingFold :: (Coll c a, Sequence seq) => c -> seq a Source #
unsafeInsertMaxUsingUnsafeAppend :: OrdCollX c a => a -> c -> c Source #
toOrdSeqUsingFoldr :: (OrdColl c a, Sequence seq) => c -> seq a Source #
unsafeFromOrdSeqUsingUnsafeInsertMin :: (OrdCollX c a, Sequence seq) => seq a -> c Source #
disjointUsingToOrdList :: OrdColl c a => c -> c -> Bool Source #
intersectWitnessUsingToOrdList :: (OrdColl c a, Monad m) => c -> c -> m (a, a) Source #
lookupUsingLookupM :: Coll c a => a -> c -> a Source #
lookupUsingLookupAll :: Coll c a => a -> c -> a Source #
lookupMUsingLookupAll :: (Coll c a, Monad m) => a -> c -> m a Source #
lookupWithDefaultUsingLookupAll :: Coll c a => a -> a -> c -> a Source #
lookupWithDefaultUsingLookupM :: Coll c a => a -> a -> c -> a Source #
deleteMaxUsingMaxView :: OrdColl c a => c -> c Source #
fromSeqWithUsingInsertWith :: (Set c a, Sequence seq) => (a -> a -> a) -> seq a -> c Source #
insertUsingInsertWith :: Set c a => a -> c -> c Source #
unionUsingUnionWith :: Set c a => c -> c -> c Source #
filterUsingOrdLists :: OrdColl c a => (a -> Bool) -> c -> c Source #
partitionUsingOrdLists :: OrdColl c a => (a -> Bool) -> c -> (c, c) Source #
intersectionUsingIntersectionWith :: Set c a => c -> c -> c Source #
differenceUsingOrdLists :: OrdSet c a => c -> c -> c Source #
symmetricDifferenceUsingDifference :: SetX c a => c -> c -> c Source #
properSubsetUsingOrdLists :: OrdSet c a => c -> c -> Bool Source #
subsetUsingOrdLists :: OrdSet c a => c -> c -> Bool Source #
properSubsetOnOrdLists :: Ord t => [t] -> [t] -> Bool Source #
subsetOnOrdLists :: Ord t => [t] -> [t] -> Bool Source #
insertSeqWithUsingInsertWith :: (Set c a, Sequence seq) => (a -> a -> a) -> seq a -> c -> c Source #
unionlUsingUnionWith :: Set c a => c -> c -> c Source #
unionrUsingUnionWith :: Set c a => c -> c -> c Source #
unionWithUsingOrdLists :: OrdSet c a => (a -> a -> a) -> c -> c -> c Source #
unionSeqWithUsingReducer :: (Set c a, Sequence seq) => (a -> a -> a) -> seq c -> c Source #
intersectionWithUsingOrdLists :: OrdSet c a => (a -> a -> a) -> c -> c -> c Source #
unsafeMapMonotonicUsingFoldr :: (OrdColl cin a, OrdCollX cout b) => (a -> b) -> cin -> cout Source #
compareUsingToOrdList :: OrdColl c a => c -> c -> Ordering Source #