|
|
|
|
|
| Documentation |
|
| data IxSet a |
| Constructors | | Instances | | Typeable1 IxSet | | (Data ctx a, Sat (ctx (IxSet a)), Sat (ctx ([] a)), Indexable a b, Data a, Ord a) => Data ctx (IxSet a) | | Data a => Data (IxSet a) | | (Ord a, Read a, Data a, Indexable a b) => Read (IxSet a) | | (Ord a, Show a) => Show (IxSet a) | | (Show a, Indexable a b, Data a, Ord a) => Monoid (IxSet a) | | Version (IxSet a) | | (Serialize a, Ord a, Data a, Indexable a b) => Serialize (IxSet a) | | (Indexable a b, Data a, Ord a, Default a) => Default (IxSet a) |
|
|
|
| iSetConstr :: Constr |
|
| ixSetConstr :: Constr |
|
| ixSetDataType :: DataType |
|
| class Data b => Indexable a b | a -> b where |
| | Methods | | empty :: IxSet a | | | calcs :: a -> b |
| | Instances | |
|
|
| inferIxSet :: String -> Name -> Name -> [Name] -> Q [Dec] |
|
| flatten :: (Typeable a, Data a) => a -> [Dynamic] |
|
| type IndexOp = forall k a. (Ord k, Ord a) => k -> a -> Map k (Set a) -> Map k (Set a) |
|
| change :: (Data a, Ord a, Data b, Indexable a b) => IndexOp -> a -> IxSet a -> IxSet a |
|
| insert :: (Data a, Ord a, Data b, Indexable a b) => a -> IxSet a -> IxSet a |
|
| delete :: (Data a, Ord a, Data b, Indexable a b) => a -> IxSet a -> IxSet a |
|
| updateIx :: (Indexable a b, Ord a, Data a, Typeable k) => k -> a -> IxSet a -> IxSet a |
|
| toSet :: Ord a => IxSet a -> Set a |
|
| toSet' :: Ord a => [Ix a] -> Set a |
|
| fromSet :: (Indexable a b, Ord a, Data a) => Set a -> IxSet a |
|
| fromSet' :: (Indexable a b, Ord a, Data a) => Set a -> IxSet a |
|
| fromList :: (Indexable a b, Ord a, Data a) => [a] -> IxSet a |
|
| size :: Ord a => IxSet a -> Int |
|
| toList :: Ord a => IxSet a -> [a] |
|
| toList' :: Ord a => [Ix a] -> [a] |
|
| getOne :: Ord a => IxSet a -> Maybe a |
|
| getOneOr :: Ord a => a -> IxSet a -> a |
|
| (&&&) :: (Ord a, Data a, Indexable a b) => IxSet a -> IxSet a -> IxSet a |
|
| (|||) :: (Ord a, Data a, Indexable a b) => IxSet a -> IxSet a -> IxSet a |
|
| union :: (Ord a, Data a, Indexable a b) => IxSet a -> IxSet a -> IxSet a |
|
| intersection :: (Ord a, Data a, Indexable a b) => IxSet a -> IxSet a -> IxSet a |
|
| (@<) :: (Indexable a b, Data a, Ord a, Typeable k) => IxSet a -> k -> IxSet a |
|
| (@>) :: (Indexable a b, Data a, Ord a, Typeable k) => IxSet a -> k -> IxSet a |
|
| (@<=) :: (Indexable a b, Data a, Ord a, Typeable k) => IxSet a -> k -> IxSet a |
|
| (@>=) :: (Indexable a b, Data a, Ord a, Typeable k) => IxSet a -> k -> IxSet a |
|
| (@=) :: (Indexable a b, Data a, Ord a, Typeable k) => IxSet a -> k -> IxSet a |
|
| (@>=<) :: (Indexable a b, Data a, Ord a, Typeable k) => IxSet a -> (k, k) -> IxSet a |
|
| (@><=) :: (Indexable a b, Data a, Ord a, Typeable k) => IxSet a -> (k, k) -> IxSet a |
|
| (@>=<=) :: (Indexable a b, Data a, Ord a, Typeable k) => IxSet a -> (k, k) -> IxSet a |
|
| (@><) :: (Indexable a b, Data a, Ord a, Typeable k) => IxSet a -> (k, k) -> IxSet a |
|
| (@*) :: (Indexable a b, Data a, Ord a, Typeable k) => IxSet a -> [k] -> IxSet a |
|
| (@+) :: (Indexable a b, Data a, Ord a, Typeable k) => IxSet a -> [k] -> IxSet a |
|
| getEQ :: (Indexable a b, Data a, Ord a, Typeable k) => k -> IxSet a -> IxSet a |
|
| getLT :: (Indexable a b, Data a, Ord a, Typeable k) => k -> IxSet a -> IxSet a |
|
| getGT :: (Indexable a b, Data a, Ord a, Typeable k) => k -> IxSet a -> IxSet a |
|
| getLTE :: (Indexable a b, Data a, Ord a, Typeable k) => k -> IxSet a -> IxSet a |
|
| getGTE :: (Indexable a b, Data a, Ord a, Typeable k) => k -> IxSet a -> IxSet a |
|
| getRange :: (Indexable a b, Typeable k, Ord a, Data a) => k -> k -> IxSet a -> IxSet a |
|
| groupBy :: (Typeable k, Typeable t) => IxSet t -> [(k, [t])] |
|
| getOrd :: (Indexable a b, Ord a, Data a, Typeable k) => Ordering -> k -> IxSet a -> IxSet a |
|
| Produced by Haddock version 2.1.0 |