Copyright | (c) Masahiro Sakai 2021 |
---|---|
License | BSD-style |
Maintainer | masahiro.sakai@gmail.com |
Stability | unstable |
Portability | non-portable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Synopsis
- class ItemOrder a where
- compareItem :: proxy a -> Int -> Int -> Ordering
- data AscOrder
- data DescOrder
- withDefaultOrder :: forall r. (forall a. ItemOrder a => Proxy a -> r) -> r
- withAscOrder :: forall r. (Proxy AscOrder -> r) -> r
- withDescOrder :: forall r. (Proxy DescOrder -> r) -> r
- withCustomOrder :: forall r. (Int -> Int -> Ordering) -> (forall a. ItemOrder a => Proxy a -> r) -> r
- newtype OrderedItem a = OrderedItem Int
- data Level a
- = NonTerminal !Int
- | Terminal
Item ordering
withDefaultOrder :: forall r. (forall a. ItemOrder a => Proxy a -> r) -> r Source #
Currently the default order is AscOrder
withAscOrder :: forall r. (Proxy AscOrder -> r) -> r Source #
withDescOrder :: forall r. (Proxy DescOrder -> r) -> r Source #
withCustomOrder :: forall r. (Int -> Int -> Ordering) -> (forall a. ItemOrder a => Proxy a -> r) -> r Source #
Ordered item
newtype OrderedItem a Source #
Instances
Eq (OrderedItem a) Source # | |
Defined in Data.DecisionDiagram.BDD.Internal.ItemOrder (==) :: OrderedItem a -> OrderedItem a -> Bool # (/=) :: OrderedItem a -> OrderedItem a -> Bool # | |
ItemOrder a => Ord (OrderedItem a) Source # | |
Defined in Data.DecisionDiagram.BDD.Internal.ItemOrder compare :: OrderedItem a -> OrderedItem a -> Ordering # (<) :: OrderedItem a -> OrderedItem a -> Bool # (<=) :: OrderedItem a -> OrderedItem a -> Bool # (>) :: OrderedItem a -> OrderedItem a -> Bool # (>=) :: OrderedItem a -> OrderedItem a -> Bool # max :: OrderedItem a -> OrderedItem a -> OrderedItem a # min :: OrderedItem a -> OrderedItem a -> OrderedItem a # | |
Show (OrderedItem a) Source # | |
Defined in Data.DecisionDiagram.BDD.Internal.ItemOrder showsPrec :: Int -> OrderedItem a -> ShowS # show :: OrderedItem a -> String # showList :: [OrderedItem a] -> ShowS # |