 | EdisonCore-1.2.1.1: A library of efficent, purely-functional data structures (Core Implementations) | Source code | Contents | Index |
|
| Data.Edison.Coll.UnbalancedSet | | Portability | GHC, Hugs (MPTC and FD) | | Stability | stable | | Maintainer | robdockins AT fastmail DOT fm |
|
|
|
|
|
| Description |
| Sets implemented as unbalanced binary search trees.
|
|
| Synopsis |
|
| data Set a | | | empty :: Set a | | | singleton :: a -> Set a | | | fromSeq :: (Ord a, Sequence seq) => seq a -> Set a | | | insert :: Ord a => a -> Set a -> Set a | | | insertSeq :: (Ord a, Sequence seq) => seq a -> Set a -> Set a | | | union :: Ord a => Set a -> Set a -> Set a | | | unionSeq :: (Ord a, Sequence seq) => seq (Set a) -> Set a | | | delete :: Ord a => a -> Set a -> Set a | | | deleteAll :: Ord a => a -> Set a -> Set a | | | deleteSeq :: (Ord a, Sequence seq) => seq a -> Set a -> Set a | | | null :: Set a -> Bool | | | size :: Set a -> Int | | | member :: Ord a => a -> Set a -> Bool | | | count :: Ord a => a -> Set a -> Int | | | strict :: Set a -> Set a | | | structuralInvariant :: Ord a => Set a -> Bool | | | toSeq :: (Ord a, Sequence seq) => Set a -> seq a | | | lookup :: Ord a => a -> Set a -> a | | | lookupM :: (Ord a, Monad m) => a -> Set a -> m a | | | lookupAll :: (Ord a, Sequence seq) => a -> Set a -> seq a | | | lookupWithDefault :: Ord a => a -> a -> Set a -> a | | | fold :: (a -> b -> b) -> b -> Set a -> b | | | fold' :: (a -> b -> b) -> b -> Set a -> b | | | fold1 :: (a -> a -> a) -> Set a -> a | | | fold1' :: (a -> a -> a) -> Set a -> a | | | filter :: Ord a => (a -> Bool) -> Set a -> Set a | | | partition :: Ord a => (a -> Bool) -> Set a -> (Set a, Set a) | | | strictWith :: (a -> b) -> Set a -> Set a | | | deleteMin :: Ord a => Set a -> Set a | | | deleteMax :: Ord a => Set a -> Set a | | | unsafeInsertMin :: Ord a => a -> Set a -> Set a | | | unsafeInsertMax :: Ord a => a -> Set a -> Set a | | | unsafeFromOrdSeq :: (Ord a, Sequence seq) => seq a -> Set a | | | unsafeAppend :: Ord a => Set a -> Set a -> Set a | | | filterLT :: Ord a => a -> Set a -> Set a | | | filterLE :: Ord a => a -> Set a -> Set a | | | filterGT :: Ord a => a -> Set a -> Set a | | | filterGE :: Ord a => a -> Set a -> Set a | | | partitionLT_GE :: Ord a => a -> Set a -> (Set a, Set a) | | | partitionLE_GT :: Ord a => a -> Set a -> (Set a, Set a) | | | partitionLT_GT :: Ord a => a -> Set a -> (Set a, Set a) | | | minView :: Monad m => Set a -> m (a, Set a) | | | minElem :: Set a -> a | | | maxView :: Monad m => Set a -> m (a, Set a) | | | maxElem :: Set a -> a | | | foldr :: (a -> b -> b) -> b -> Set a -> b | | | foldr' :: (a -> b -> b) -> b -> Set a -> b | | | foldl :: (b -> a -> b) -> b -> Set a -> b | | | foldl' :: (b -> a -> b) -> b -> Set a -> b | | | foldr1 :: (a -> a -> a) -> Set a -> a | | | foldr1' :: (a -> a -> a) -> Set a -> a | | | foldl1 :: (a -> a -> a) -> Set a -> a | | | foldl1' :: (a -> a -> a) -> Set a -> a | | | toOrdSeq :: (Ord a, Sequence seq) => Set a -> seq a | | | unsafeMapMonotonic :: Ord a => (a -> a) -> Set a -> Set a | | | intersection :: Ord a => Set a -> Set a -> Set a | | | difference :: Ord a => Set a -> Set a -> Set a | | | symmetricDifference :: Ord a => Set a -> Set a -> Set a | | | properSubset :: Ord a => Set a -> Set a -> Bool | | | subset :: Ord a => Set a -> Set a -> Bool | | | fromSeqWith :: (Ord a, Sequence seq) => (a -> a -> a) -> seq a -> Set a | | | insertWith :: Ord a => (a -> a -> a) -> a -> Set a -> Set a | | | insertSeqWith :: (Ord a, Sequence seq) => (a -> a -> a) -> seq a -> Set a -> Set a | | | unionl :: Ord a => Set a -> Set a -> Set a | | | unionr :: Ord a => Set a -> Set a -> Set a | | | unionWith :: Ord a => (a -> a -> a) -> Set a -> Set a -> Set a | | | unionSeqWith :: (Ord a, Sequence seq) => (a -> a -> a) -> seq (Set a) -> Set a | | | intersectionWith :: Ord a => (a -> a -> a) -> Set a -> Set a -> Set a | | | moduleName :: String |
|
|
|
| Set type
|
|
|
Instances | |
|
|
| CollX operations
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Coll operations
|
|
|
|
|
|
|
|
|
|
|
|
| fold :: (a -> b -> b) -> b -> Set a -> b | Source |
|
|
| fold' :: (a -> b -> b) -> b -> Set a -> b | Source |
|
|
|
|
|
|
|
|
|
|
|
|
| OrdCollX operations
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| OrdColl operations
|
|
|
|
|
|
|
|
|
|
| foldr :: (a -> b -> b) -> b -> Set a -> b | Source |
|
|
| foldr' :: (a -> b -> b) -> b -> Set a -> b | Source |
|
|
| foldl :: (b -> a -> b) -> b -> Set a -> b | Source |
|
|
| foldl' :: (b -> a -> b) -> b -> Set a -> b | Source |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| SetX operations
|
|
|
|
|
|
|
|
|
|
|
|
| Set operations
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Documentation
|
|
|
|
| Produced by Haddock version 2.3.0 |