| Copyright | (c) Masahiro Sakai 2021 |
|---|---|
| License | BSD-style |
| Maintainer | masahiro.sakai@gmail.com |
| Stability | unstable |
| Portability | non-portable |
| Safe Haskell | Safe-Inferred |
| Language | Haskell2010 |
Data.DecisionDiagram.BDD.Internal.ItemOrder
Contents
Description
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
- data Level a
- = NonTerminal !Int
- | Terminal
Item ordering
class ItemOrder a where Source #
Instances
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 #