Skip to content

Instantly share code, notes, and snippets.

View alexbiehl's full-sized avatar

Alexander Biehl alexbiehl

  • Freelancer
  • Hamburg, Germany
View GitHub Profile
name: conduit-combinators
version: 0.3.1
id: conduit-combinators-0.3.1-fad4632107c92f13b4d7aac18fd4445e
license: MIT
copyright:
maintainer: michael@snoyman.com
stability:
homepage: https://github.com/fpco/conduit-combinators
package-url:
synopsis: Commonly used conduit functions, for both chunked and unchunked data
Tue Jun 30 10:19 2015 Time and Allocation Profiling Report (Final)
trie-insert +RTS -p -hy -RTS
total time = 21.43 secs (21426 ticks @ 1000 us, 1 processor)
total alloc = 21,044,266,488 bytes (excludes profiling overheads)
COST CENTRE MODULE %time %alloc
main.\ Main 54.1 53.5
{-# LANGUAGE KindSignatures, DataKinds, TypeFamilies, ScopedTypeVariables, FlexibleInstances, FlexibleContexts, UndecidableInstances, BangPatterns, GeneralizedNewtypeDeriving, ExistentialQuantification, RankNTypes #-}
import GHC.TypeLits
import Data.Proxy
import Control.Monad.Reader
import Control.Monad.IO.Class
-- Dummy class for protocol-buffers wire class
class Wire a where
{-# LANGUAGE ViewPatterns #-}
import Data.Sequence (Seq, ViewL (..), viewl, (<|), (|>))
import qualified Data.Sequence as Seq
import qualified Data.StringMap as StringMap
import Data.StringMap.Base (StringMap (..), deepNorm)
import Text.Show.Pretty
-- build tree of this shape ('*' means root)
--
-- *
@alexbiehl
alexbiehl / SearchService.hs
Created January 11, 2016 08:05
Example of how to use protocol-buffers service definitions
-- $ hprotoc search.proto
-- $ stach ghc SearchService.hs
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE ExistentialQuantification #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE BangPatterns, CPP, MagicHash, UnboxedTuples, GeneralizedNewtypeDeriving, NoImplicitPrelude #-}
module Data.MHeap1 where
import GHC.Base
data MHeap a = MHeap { mhValues :: SmallMutableArray# RealWorld a
, mhCount :: Int#
, mhCapacity :: Int#
}
-- | Creates an empty heap with capacity 0.
{-# LANGUAGE ExistentialQuantification #-}
import Conduit
import Data.Foldable
data Event = Event
data Command = Command
data Die = Die
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE ScopedTypeVariables #-}
import Control.Monad.Primitive
import qualified Data.Vector.Generic.Mutable as GM
import qualified Data.Vector.Unboxed as UV
import qualified Data.Vector.Unboxed.Mutable as UM
import qualified Data.Vector.Algorithms.Insertion as Insertion
import Control.Monad
{-# LANGUAGE GADTs #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE BangPatterns #-}
import Control.Arrow
import Foreign.Ptr
import Data.Word
import Data.Bits
import Foreign.Storable
import Data.ByteString (ByteString)
{-# LANGUAGE RankNTypes #-}
module Hunt.IO.Decoder where
import Data.Bits
import Data.ByteString (ByteString)
import qualified Data.ByteString.Internal as ByteString
import Data.Word
import Foreign.Ptr
import Foreign.Storable