úÎ!H      "Provides the PartialOrd Typeclass.(c) 2016 Moritz SchulteBSD3mtesseract@silverratio.net experimentalPOSIXSafe`  partial-orderLess-than-or-equal relation. partial-order3Bigger-than-or-equal relation. Defined in terms of . partial-order'Equality relation. Defined in terms of . partial-order)Inequality relation. Defined in terms of . partial-order1Less-than relation relation. Defined in terms of  and . partial-order*Bigger-than relation. Defined in terms of  and . partial-order#Compare function, returning either  an Ordering or . partial-order>Return True if the first list is a sublist of the second list. partial-orderWCompute the list of all elements that are not less than any other element in the list.  partial-orderYCompute the list of all elements that are not bigger than any other element in the list.  partial-orderRVersion of the traditional elem function using the PartialOrd notion of equality.  partial-orderUVersion of the traditional notElem function using the PartialOrd notion of equality.  partial-orderQVersion of the traditional nub function using the PartialOrd notion of equality.  partial-order:Define the partial order in terms of the sublist relation. partial-order9Define the partial order in terms of the subset relation. partial-orderGDerive the partial order from the total order for the following types:        ,partial-order-0.2.0.0-41W3SuTvKJ49GkUR84cBcMData.PartialOrd PartialOrd<=>===/=<>comparemaximaminimaelemnotElemnub$fPartialOrd[]$fPartialOrdSet$fPartialOrdFloat$fPartialOrdDouble$fPartialOrdInteger$fPartialOrdIntbase GHC.MaybeJustNothing isSublistOf