X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=Data%2FArray.hs;h=09c4f651e1485c4582c0a3f43708100fcdfdaaf3;hb=08d4c25e140431877ce473622f3705e7a05485bc;hp=263f9707c669dafb9cf62060e7dfb8650db68d65;hpb=75b671155210ea7a5c7070760092a93744cce053;p=ghc-base.git

diff --git a/Data/Array.hs b/Data/Array.hs
index 263f970..09c4f65 100644
--- a/Data/Array.hs
+++ b/Data/Array.hs
@@ -73,22 +73,6 @@ import Array		-- Haskell'98 arrays
 #endif
 
 import Data.Typeable
-#include "Typeable.h"
-INSTANCE_TYPEABLE2(Array,arrayTc,"Array")
-
-#ifdef __GLASGOW_HASKELL__
-
--- This instance preserves data abstraction at the cost of inefficiency.
--- We omit reflection services for the sake of data abstraction.
-
-instance (Typeable a, Data b, Ix a) => Data (Array a b)
- where
-  gfoldl f z a = z (listArray (bounds a)) `f` (elems a)
-  toConstr _   = error "toConstr"
-  gunfold _ _  = error "gunfold"
-  dataTypeOf _ = mkNorepType "Data.Array.Array"
-
-#endif
 
 {- $intro
 Haskell provides indexable /arrays/, which may be thought of as functions