úΊW     "Provides the PartialOrd Typeclass.(c) 2016 Moritz SchulteBSD3mtesseract@silverratio.net experimentalPOSIXSafe\Less-than-or-equal relation.3Bigger-than-or-equal relation. Defined in terms of .'Equality relation. Defined in terms of .)Inequality relation. Defined in terms of .1Less-than relation relation. Defined in terms of  and .*Bigger-than relation. Defined in terms of  and .#Compare function, returning either  an Ordering or .>Return True if the first list is a sublist of the second list.WCompute the list of all elements that are not less than any other element in the list. YCompute the list of all elements that are not bigger than any other element in the list. RVersion of the traditional elem function using the PartialOrd notion of equality. UVersion of the traditional notElem function using the PartialOrd notion of equality. QVersion of the traditional nub function using the PartialOrd notion of equality. :Define the partial order in terms of the sublist relation.9Define the partial order in terms of the subset relation.GDerive the partial order from the total order for the following types:            +partial-order-0.1.2.1-jBbAi924GBBMlxRRwrcmcData.PartialOrd PartialOrd<=>===/=<>comparemaximaminimaelemnotElemnub$fPartialOrd[]$fPartialOrdSet$fPartialOrdFloat$fPartialOrdDouble$fPartialOrdInteger$fPartialOrdIntbaseGHC.BaseJustNothing isSublistOfextrema