Copyright | (c) Keith Wansbrough 200 and Uni Bremen 2005 |
---|---|

License | GPLv2 or higher, see LICENSE.txt |

Maintainer | Christian.Maeder@dfki.de |

Stability | provisional |

Portability | portable |

Safe Haskell | Safe |

Support for partial orders

## Synopsis

- type POrder a = a -> a -> Maybe Ordering
- totalOrder :: Ord a => POrder a
- equivBy :: POrder a -> [a] -> [[a]]
- minimalBy :: POrder a -> [a] -> ([a], [a])
- rankBy :: POrder a -> [a] -> [[a]]
- class Partial a where
- equiv :: Partial a => [a] -> [[a]]
- minimal :: Partial a => [a] -> ([a], [a])
- rank :: Partial a => [a] -> [[a]]