isomorphism

----------------------------------------------------------------------
vertex group
0x00004394 - 0x000043c3
0x4394 flags: 1073741826
0x4398 (16 bytes skipped): 
0x43a8 vertex array bytes array, # entries: 135800
0x43ac vertex array bytes array offset: 0x47178
0x43b0 (8 bytes skipped): 
0x43b8 vertex array stride bytes: 40

isomorphism

{-# LANGUAGE NoMonomorphismRestriction #-}
{-# LANGUAGE Rank2Types #-}
{-# LANGUAGE PolyKinds #-}
module A where

import Control.Lens
import Data.Vinyl
import GHC.TypeLits

class A f where

isomorphism

module Main where

import Data.Vector.Storable as V

main = do
    print $ V.fromList [1..9 :: Float]

-- output:
-- "fromList [5.831554e-39,5.831554e-39,1.0,1.0,1.0,1.0,1.0,1.0,1.0]"

isomorphism

module Main where

import GHCJS.DOM
import GHCJS.DOM.Types
import GHCJS.DOM.Document
import GHCJS.DOM.EventM

main = do
    Just doc <- currentDocument
    connect "keydown" doc $ do

isomorphism

module A where

import GHCJS.Types

newtype Foo = Foo (JSRef ())

foreign import javascript unsafe "" foo :: IO Foo

{- Output:

isomorphism

module Map 
    ( RoomId, Connection
    , Room(..), Map
    , describeRoom
    , numberRooms
    , generateMap
    , Wumpus (..)
    ) where

-- use a proper key/value lookup data structure instead of lists

isomorphism

-- Suggested changes for http://codereview.stackexchange.com/q/7623/4949 
module Nim where 

import Data.List
import Data.Maybe
import qualified Data.Map as Map

--Domain 
--Nim is a mathematical game of strategy 

isomorphism

	Sun Jan  1 20:57 2012 Time and Allocation Profiling Report  (Final)

	   Main +RTS -sstderr -p -RTS

	total time  =        8.30 secs   (415 ticks @ 20 ms)
	total alloc = 519,870,364 bytes  (excludes profiling overheads)

COST CENTRE MODULE %time %alloc

calcRoots Main  74.7   38.7

isomorphism

import Data.Set (Set)
import qualified Data.Set as S

bindSet :: (Ord a, Ord b) => Set a -> (a -> Set b) -> Set b
bindSet s k = S.unions . S.toList $ S.map k s

foldSet :: (Ord a ) => (a -> b -> Set a) -> a -> [b] -> Set a
foldSet _ a [] = S.singleton a
foldSet f a (x:xs) = bindSet (f a x) (\fax -> foldSet f fax xs)

isomorphism

module Main where

import Control.Monad.State
import Data.Map (Map)
import qualified Data.Map as M
import Data.Set (Set)
import qualified Data.Set as S
import Data.List (isPrefixOf, intercalate)
import Data.Char (toLower)