jfischoff

{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE FunctionalDependencies #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE TypeOperators  #-}
{-# LANGUAGE GADTs  #-}

jfischoff

{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE FunctionalDependencies #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE TypeOperators  #-}
{-# LANGUAGE GADTs  #-}

jfischoff

{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE UndecidableInstances #-}
{-# LANGUAGE OverlappingInstances #-}
{-# LANGUAGE FunctionalDependencies #-}

jfischoff

{-# LANGUAGE FlexibleContexts  #-}
{-# LANGUAGE ScopedTypeVariables  #-}
{-# LANGUAGE UndecidableInstances  #-}
{-# LANGUAGE GeneralizedNewtypeDeriving  #-}
{-# LANGUAGE StandaloneDeriving  #-}
module Approx where
import Data.Reflection
import Data.Proxy
import Foreign.Storable

jfischoff

foldRRec :: forall f xs c a b p.
            RecAll f xs c 
         => p c
         -> (forall x. c x => x -> a) 
         -> (a -> b -> b) 
         -> b 
         -> NP f xs
         -> b
foldRRec p convert f z xs 
  = foldRRec' convert f z 

jfischoff

data Edit a
    = Insert a
    | Delete a
    | Same   a 
    deriving (Show, Eq)
    
isSame :: Edit a -> Bool
isSame x = case x of
  Insert {} -> False
  Delete {} -> False

jfischoff

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs

jfischoff

mkPackageRule packageDir = do
    desc      <- parseCabalPackage packageDir
    let version      = show $ pkgVersion $ package desc
        srcs         = collectSrcs       desc
        dependencies = collectDeps       desc
        libPath      = [str|cabal-dev/lib/libHS$packageDir$-$version$.a|]
    want libPath
    libPath *> \_ -> do
        need $ srcs ++ dependencies
        system' "cabal-dev"  ["install", packageDir ++ "/", "--force-reinstalls", 

jfischoff

module Control.Monad.Error.Restricted.Partial where
import Control.Applicative
import Data.Foldable (asum)
import qualified Data.HashMap.Strict as H
import Control.Monad hiding (msum)
import Data.Hashable
import Data.Foldable
import Data.Traversable
import Data.Monoid
import Data.Maybe

jfischoff

{-# LANGUAGE PolyKinds, DataKinds, TemplateHaskell, TypeFamilies,
    GADTs, TypeOperators, RankNTypes, FlexibleContexts, UndecidableInstances,
    FlexibleInstances, ScopedTypeVariables, MultiParamTypeClasses,
    OverlappingInstances, TemplateHaskell #-}
module Oxymoron.Regions.TAssociativeArray where
import Data.Singletons    

singletons [d| data AssocArray a b = AssocArray [(a, b)] |]

type instance ('AssocArray xs) :==: ('AssocArray ys) =