Îõ³h& ¿ Ì      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJK Safe-Inferred5?Àë • partialordAs above, but with minima partialordÞSets of incomparable elements, with a monoidal structure obtained by taking the maximal ones.ÿUnfortunately, we need a full ordering for these to work (since they use sets), though we don't assume this ordering has any compatibility with the partial order. The monoid structures are most efficient with pre-reduced sets as the left-hand argument. partialord3Lists partially ordered by the subsequence relation  partialord+Lists partially ordered by suffix inclusion  partialord+Lists partially ordered by prefix inclusion partialord*Lists partially ordered by infix inclusion partialordÓA typeclass expressing partially ordered types: any two elements are related by a . partialordÜA helper type for constructing partial orderings where everything is equal or incomparable. partialordÛA helper type for constructing partial orderings from total orderings (using deriving via) partialord™A data type representing relationships between two objects in a poset: they can be related (by EQ', LT' or GT'; like EQ, LT or GT), or unrelated (NT').! partialord+Convert an ordering into a partial ordering" partialord)Convert a partial ordering to an ordering# partialord+Convert an ordering into a partial ordering$ partialord Convert from  and  to a partial ordering% partialordAre they LT', EQ', GT'& partialordÂFind the maxima of a list (passing it through the machinery above)' partialordÂFind the minima of a list (passing it through the machinery above)) partialordéA comparison (less than or equal, greater than or equal) holds if and only if it does on both arguments./ partialordThis is equivalent to 5 compare' (a,b) (c,d) = compare' a c <> compare' b d€but may be more efficient: if compare' a1 a2 is LT' or GT' we seek less information about b1 and b2 (and this can be faster).J partialord.It's hard to imagine another sensible instanceK partialord.It's hard to imagine another sensible instance(  !"#$%&'( !"#$%&'   Safe-Inferred LMNOPQRSÔ         !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNÏ'partialord-0.0.0-FqclYOqjptJKEv7mV1ksMNData.PartialOrdPaths_partialordMinimaminSetMaximamaxSetSubsequnSubseqSuffixunSuffixPrefixunPrefixInfixunInfix PartialOrdcompare'leqgeqDiscrete getDiscreteFullyOrdgetOrdPartialOrderingEQ'LT'GT'NT'fromOrd toMaybeOrd fromMaybeOrd fromLeqGeq comparablemaximaminima$fMonoidPartialOrdering$fSemigroupPartialOrdering$fPartialOrdIntSet$fPartialOrdSet$fPartialOrd(,,,,)$fPartialOrd(,,,)$fPartialOrd(,,)$fPartialOrd(,)$fPartialOrd()$fPartialOrdDiscrete$fPartialOrdFullyOrd$fPartialOrdInfix$fPartialOrdPrefix$fPartialOrdSuffix$fPartialOrdSubseq$fMonoidMaxima$fSemigroupMaxima$fMonoidMinima$fSemigroupMinima $fEqSubseq $fShowSubseq $fEqSuffix $fShowSuffix $fEqPrefix $fShowPrefix $fEqInfix $fShowInfix $fEqDiscrete$fShowDiscrete $fEqFullyOrd $fOrdFullyOrd$fShowFullyOrd$fEqPartialOrdering$fShowPartialOrdering$fPartialOrdInteger$fPartialOrdIntversiongetDataFileName getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDir