--- /dev/null
+module PreludeBuiltin where
+
+--- 5-tuples ------------------------------------------
+
+import Cls
+import Core
+import IChar
+import IInt
+import IList
+import List ( (++), foldr )
+import Prel ( (&&), (.) )
+import PS ( _PackedString, _unpackPS )
+import Text
+
+instance (Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a,b,c,d,e) where
+ (a1,a2,a3,a4,a5) == (b1,b2,b3,b4,b5) = a1 == b1 && a2 == b2 && a3 == b3 && a4 == b4 && a5 == b5
+ aaaaa /= bbbbb = if (aaaaa == bbbbb) then False else True
+
+instance (Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a,b,c,d,e) where
+ a < b = case _tagCmp a b of { _LT -> True; _EQ -> False; _GT -> False }
+ a <= b = case _tagCmp a b of { _LT -> True; _EQ -> True; _GT -> False }
+ a >= b = case _tagCmp a b of { _LT -> False; _EQ -> True; _GT -> True }
+ a > b = case _tagCmp a b of { _LT -> False; _EQ -> False; _GT -> True }
+
+ max a b = case _tagCmp a b of { _LT -> b; _EQ -> a; _GT -> a }
+ min a b = case _tagCmp a b of { _LT -> a; _EQ -> a; _GT -> b }
+
+ _tagCmp (a1, b1, c1, d1, e1) (a2, b2, c2, d2, e2)
+ = case (_tagCmp a1 a2) of {
+ _LT -> _LT;
+ _GT -> _GT;
+ _EQ -> case _tagCmp b1 b2 of {
+ _LT -> _LT;
+ _GT -> _GT;
+ _EQ -> case _tagCmp c1 c2 of {
+ _LT -> _LT;
+ _GT -> _GT;
+ _EQ -> case _tagCmp d1 d2 of {
+ _LT -> _LT;
+ _GT -> _GT;
+ _EQ -> _tagCmp e1 e2
+ }
+ }
+ }
+ }
+
+instance (Ix a1, Ix a2, Ix a3, Ix a4, Ix a5) => Ix (a1,a2,a3,a4,a5) where
+ range ((l1,l2,l3,l4,l5),(u1,u2,u3,u4,u5)) =
+ [(i1,i2,i3,i4,i5) | i1 <- range (l1,u1),
+ i2 <- range (l2,u2),
+ i3 <- range (l3,u3),
+ i4 <- range (l4,u4),
+ i5 <- range (l5,u5)]
+
+ index ((l1,l2,l3,l4,l5),(u1,u2,u3,u4,u5)) (i1,i2,i3,i4,i5) =
+ index (l5,u5) i5 + rangeSize (l5,u5) * (
+ index (l4,u4) i4 + rangeSize (l4,u4) * (
+ index (l3,u3) i3 + rangeSize (l3,u3) * (
+ index (l2,u2) i2 + rangeSize (l2,u2) * (
+ index (l1,u1) i1))))
+ where
+ rangeSize (l,u) = index (l,u) u + (1 :: Int)
+
+ inRange ((l1,l2,l3,l4,l5),(u1,u2,u3,u4,u5)) (i1,i2,i3,i4,i5) =
+ inRange (l1,u1) i1 && inRange (l2,u2) i2 &&
+ inRange (l3,u3) i3 && inRange (l4,u4) i4 && inRange (l5,u5) i5
+
+-- ToDo: something for Binary
+
+instance (Text a, Text b, Text c, Text d, Text e) => Text (a, b, c, d, e) where
+ readsPrec p = readParen False
+ (\a -> [((w,x,y,z,v), l) | ("(",b) <- lex a,
+ (w,c) <- reads b,
+ (",",d) <- lex c,
+ (x,e) <- reads d,
+ (",",f) <- lex e,
+ (y,g) <- reads f,
+ (",",h) <- lex g,
+ (z,i) <- reads h,
+ (",",j) <- lex i,
+ (v,k) <- reads j,
+ (")",l) <- lex k ] )
+
+ showsPrec p (v,w,x,y,z) = showChar '(' . shows v . showString ", " .
+ shows w . showString ", " .
+ shows x . showString ", " .
+ shows y . showString ", " .
+ shows z . showChar ')'
+
+#if defined(__UNBOXED_INSTANCES__)
+
+-- We only create SPECIALIZED instances unboxed tuples
+-- which have all the same unboxed component
+
+-- {-# SPECIALIZE instance Eq (Char#,Char#,Char#,Char#,Char#) #-}
+-- {-# SPECIALIZE instance Ord (Char#,Char#,Char#,Char#,Char#) #-}
+-- {-# SPECIALIZE instance Ix (Char#,Char#,Char#,Char#,Char#) #-}
+-- {-# SPECIALIZE instance Text (Char#,Char#,Char#,Char#,Char#) #-}
+
+-- {-# SPECIALIZE instance Eq (Int#,Int#,Int#,Int#,Int#) #-}
+-- {-# SPECIALIZE instance Ord (Int#,Int#,Int#,Int#,Int#) #-}
+-- {-# SPECIALIZE instance Ix (Int#,Int#,Int#,Int#,Int#) #-}
+-- {-# SPECIALIZE instance Text (Int#,Int#,Int#,Int#,Int#) #-}
+
+-- {-# SPECIALIZE instance Eq (Double#,Double#,Double#,Double#,Double#) #-}
+-- {-# SPECIALIZE instance Ord (Double#,Double#,Double#,Double#,Double#) #-}
+-- {-# SPECIALIZE instance Text (Double#,Double#,Double#,Double#,Double#) #-}
+
+#endif