Add skeleton of the flat HLists

shaped.cabal

@@ -1,6 +1,3 @@
--- Initial shaped.cabal generated by cabal init.  For further 
--- documentation, see http://haskell.org/cabal/users-guide/
-
 name:                shaped
 version:             0.1.0.0
 synopsis:            Another flavor of generic programming
@@ -9,16 +6,13 @@ license:             BSD3
 license-file:        LICENSE
 author:              Dan Peebles
 maintainer:          pumpkingod@gmail.com
--- copyright:           
 category:            Data
 build-type:          Simple
--- extra-source-files:  
 cabal-version:       >=1.10
 
 library
-  exposed-modules:     Data.Shaped, Data.Shaped.Generics, Data.Shaped.TH
-  -- other-modules:       
+  exposed-modules:     Data.Shaped, Data.Shaped.Generics, Data.Shaped.TH, Data.Shaped.Types, Data.Shaped.Product
   other-extensions:    GADTs, EmptyCase, MagicHash, DataKinds, PolyKinds, LambdaCase, ViewPatterns, TypeFamilies, DeriveGeneric, TypeOperators, KindSignatures, FlexibleContexts, FlexibleInstances, DefaultSignatures, ScopedTypeVariables, UndecidableInstances, ExistentialQuantification
-  build-depends:       base >=4.7 && <4.8
+  build-depends:       base >=4.7 && <4.8, ghc-prim
   hs-source-dirs:      src
-  default-language:    Haskell2010
+  default-language:    Haskell2010

src/Data/Shaped/Product.hs

@@ -0,0 +1,41 @@
+{-# LANGUAGE MagicHash #-}
+{-# LANGUAGE DataKinds #-}
+{-# LANGUAGE PolyKinds #-}
+{-# LANGUAGE TypeFamilies #-}
+{-# LANGUAGE UnboxedTuples #-}
+{-# LANGUAGE TypeOperators #-}
+{-# LANGUAGE KindSignatures #-}
+{-# LANGUAGE FlexibleInstances #-}
+module Data.Shaped.Product where
+
+import GHC.Prim
+import GHC.Types
+import GHC.IO
+
+-- This doesn't seem entirely worthless... worth coming up with a decent API for it
+-- including perhaps how to actually construct these things... :)
+
+type family Map (f :: a -> b) (xs :: [a]) :: [b] where
+  Map f '[] = '[]
+  Map f (x ': xs) = f x ': Map f xs
+
+data Product (ts :: [*])   = Product (Array# Any)
+data Elem    (ts :: [*]) t = Elem Int#
+data Length  (ts :: [*])   = Length Int#
+
+pget :: Product ts -> Elem ts t -> t
+pget (Product arr#) (Elem i#) = case indexArray# arr# i# of (# x #) -> unsafeCoerce# x
+
+plength :: Product ts -> Length ts
+plength (Product arr#) = Length (sizeofArray# arr#)
+
+pelems :: Product ts -> Product (Map (Elem ts) ts)
+pelems = undefined
+
+
+
+
+
+reallyUnsafeElem :: Int -> Elem ts t
+reallyUnsafeElem (I# i#) = Elem i#
+