Copyright | (c) 2020 Edwin Westbrook |
---|---|
License | BSD3 |
Maintainer | westbrook@galois.com |
Stability | experimental |
Portability | GHC |
Safe Haskell | None |
Language | Haskell2010 |
Synopsis
- data NameSet k
- data SomeName k = SomeName (Name a)
- empty :: NameSet k
- singleton :: Name (a :: k) -> NameSet k
- fromList :: [SomeName k] -> NameSet k
- toList :: NameSet k -> [SomeName k]
- insert :: Name (a :: k) -> NameSet k -> NameSet k
- delete :: Name (a :: k) -> NameSet k -> NameSet k
- member :: Name (a :: k) -> NameSet k -> Bool
- null :: NameSet k -> Bool
- size :: NameSet k -> Int
- union :: NameSet k -> NameSet k -> NameSet k
- unions :: Foldable f => f (NameSet k) -> NameSet k
- difference :: NameSet k -> NameSet k -> NameSet k
- (\\) :: NameSet k -> NameSet k -> NameSet k
- intersection :: NameSet k -> NameSet k -> NameSet k
- map :: (forall (a :: k). Name a -> Name a) -> NameSet k -> NameSet k
- foldr :: (forall (a :: k). Name a -> r -> r) -> r -> NameSet k -> r
- foldl :: (forall (a :: k). r -> Name a -> r) -> r -> NameSet k -> r
- liftNameSet :: Mb ctx (NameSet (k :: Type)) -> NameSet k
Documentation
A Name
of some unknown type of kind k
Instances
NuMatching (SomeName k) Source # | |
Defined in Data.Binding.Hobbits.NameSet nuMatchingProof :: MbTypeRepr (SomeName k) Source # |
difference :: NameSet k -> NameSet k -> NameSet k Source #
Take the set of all elements of the first NameSet
not in the second
map :: (forall (a :: k). Name a -> Name a) -> NameSet k -> NameSet k Source #
Map a function across all elements of a NameSet
foldr :: (forall (a :: k). Name a -> r -> r) -> r -> NameSet k -> r Source #
Perform a right fold of a function across all elements of a NameSet