Use quanified superclass of Eq1/Ord1 to derive instance when available

src/Data/Fix.hs

@@ -9,6 +9,7 @@
 {-# LANGUAGE UndecidableInstances      #-}
 
 #define HAS_POLY_TYPEABLE MIN_VERSION_base(4,7,0)
+#define HAS_QUANTIFIED_FUNCTOR_CLASSES MIN_VERSION_base(4,18,0)
 
 #if HAS_POLY_TYPEABLE
 {-# LANGUAGE StandaloneDeriving        #-}
@@ -97,7 +98,7 @@ import Prelude (const, error, undefined)
 
 import Control.Monad        (liftM)
 import Data.Function        (on)
-import Data.Functor.Classes (Eq1, Ord1, Read1, Show1, compare1, eq1, readsPrec1, showsPrec1)
+import Data.Functor.Classes (Eq1, Ord1, Read1, Show1, readsPrec1, showsPrec1)
 import Data.Hashable        (Hashable (..))
 import Data.Hashable.Lifted (Hashable1, hashWithSalt1)
 import Data.Typeable        (Typeable)
@@ -114,6 +115,10 @@ import Data.Data (Data)
 import Data.Data
 #endif
 
+#if !HAS_QUANTIFIED_FUNCTOR_CLASSES
+import Data.Functor.Classes (compare1, eq1)
+#endif
+
 -- $setup
 -- >>> :set -XDeriveFunctor
 -- >>> import Prelude
@@ -191,10 +196,24 @@ unwrapFix = unFix
 -------------------------------------------------------------------------------
 
 instance Eq1 f => Eq (Fix f) where
+#if HAS_QUANTIFIED_FUNCTOR_CLASSES
+    Fix a == Fix b = a == b
+#else
     Fix a == Fix b = eq1 a b
+#endif
 
 instance Ord1 f => Ord (Fix f) where
+#if HAS_QUANTIFIED_FUNCTOR_CLASSES
+    compare (Fix a) (Fix b) = compare a b
+    min (Fix a) (Fix b) = Fix (min a b)
+    max (Fix a) (Fix b) = Fix (max a b)
+    Fix a >= Fix b = a >= b
+    Fix a > Fix b = a > b
+    Fix a < Fix b = a < b
+    Fix a <= Fix b = a <= b
+#else
     compare (Fix a) (Fix b) = compare1 a b
+#endif
 
 instance Show1 f => Show (Fix f) where
     showsPrec d (Fix a) =