Init

Author: nobrakal

.gitignore

@@ -0,0 +1,22 @@
+dist
+dist-*
+cabal-dev
+*.o
+*.hi
+*.chi
+*.chs.h
+*.dyn_o
+*.dyn_hi
+.hpc
+.hsenv
+.cabal-sandbox/
+cabal.sandbox.config
+*.prof
+*.aux
+*.hp
+*.eventlog
+.stack-work/
+cabal.project.local
+cabal.project.local~
+.HTF/
+.ghc.environment.*

ChangeLog.md

@@ -0,0 +1,5 @@
+# Revision history for bench-graph
+
+## 0.1.0.0  -- YYYY-mm-dd
+
+* First version. Released on an unsuspecting world.

LICENSE

@@ -0,0 +1,30 @@
+Copyright (c) 2018, Alexandre Moine
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above
+      copyright notice, this list of conditions and the following
+      disclaimer in the documentation and/or other materials provided
+      with the distribution.
+
+    * Neither the name of Alexandre Moine nor the names of other
+      contributors may be used to endorse or promote products derived
+      from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

Setup.hs

@@ -0,0 +1,2 @@
+import Distribution.Simple
+main = defaultMain

bench-graph.cabal

@@ -0,0 +1,47 @@
+-- Initial bench-graph.cabal generated by cabal init.  For further 
+-- documentation, see http://haskell.org/cabal/users-guide/
+
+name:                bench-graph
+version:             0.1.0.0
+synopsis:            Bench Graph
+-- description:         
+license:             BSD3
+license-file:        LICENSE
+author:              Alexandre Moine
+maintainer:          [email protected]
+-- copyright:           
+-- category:            
+build-type:          Simple
+extra-source-files:  ChangeLog.md, README.md
+cabal-version:       >=1.10
+
+library
+  exposed-modules:     BenchGraph
+  -- other-modules:       
+  other-extensions:    ExistentialQuantification
+  build-depends:       base >=4.10 && <4.11, criterion >=1.4 && <1.5, deepseq >=1.4 && <1.5
+  hs-source-dirs:      src
+  default-language:    Haskell2010
+
+benchmark benchmark-alga
+    hs-source-dirs:     bench
+    type:               exitcode-stdio-1.0
+    main-is:            Bench.hs
+    build-depends:      algebraic-graphs,
+                        base        >= 4.7     && < 5,
+                        base-compat >= 0.9.1   && < 0.10,
+                        containers  >= 0.5.5.1 && < 0.8,
+                        criterion   >= 1.1,
+                        bench-graph
+    default-language:   Haskell2010
+    GHC-options:        -O2
+                        -Wall
+                        -fno-warn-name-shadowing
+    if impl(ghc >= 8.0)
+        GHC-options:    -Wcompat
+                        -Wincomplete-record-updates
+                        -Wincomplete-uni-patterns
+                        -Wredundant-constraints
+    default-extensions: FlexibleContexts
+                        TypeFamilies
+                        ScopedTypeVariables

bench/Bench.hs

@@ -0,0 +1,23 @@
+{-# LANGUAGE FlexibleInstances #-}
+
+import Criterion.Main
+import BenchGraph
+import Algebra.Graph
+
+-- For example with alga
+instance GraphImpl (Graph Int) where
+  mkGraph = edges
+
+-- A simple consummer
+isEmpty' :: ToFuncToBench (Graph Int)
+isEmpty' = const $ Consummer "IsEmpty" isEmpty
+
+--A simple function
+pathHasEdge :: ToFuncToBench (Graph Int)
+pathHasEdge = FuncWithArg "hasEdge" (uncurry hasEdge) show . take 5 .edgesNotInPath
+
+tenPowers :: [Int]
+tenPowers = 1: map (10*) tenPowers
+
+main :: IO ()
+main = defaultMain $ benchFunc isEmpty' $ map mkPath $ take 5 tenPowers

src/BenchGraph.hs

@@ -0,0 +1,48 @@
+{-# LANGUAGE ExistentialQuantification #-}
+
+module BenchGraph (
+  Edges,
+  ToFuncToBench,
+  FuncToBench (..),
+  GraphImpl,
+  mkGraph,
+  benchFunc,
+  mkPath,
+  edgesNotInPath
+) where
+
+import Criterion.Main
+import Control.DeepSeq (NFData(..))
+
+-- Generic graph
+type Edges = [(Int,Int)]
+
+-- We want to pass the generic graph to create an according function to test
+type ToFuncToBench a = Edges -> FuncToBench a
+
+-- Type used to group different types of functions
+data FuncToBench a = forall b. NFData b => Consummer String (a -> b) 
+  | forall b c. NFData c => FuncWithArg String (b -> a -> c) (b -> String) [b]
+
+-- An interface between our generic graphs and others
+class GraphImpl g where
+  mkGraph :: Edges -> g
+
+-- Main function
+-- Will be cooler if its return a single benchmark with bgroup
+benchFunc :: GraphImpl g => ToFuncToBench g -> [Edges] -> [Benchmark]
+benchFunc tofunc = map (\e -> benchFunc' (tofunc e) e) 
+
+-- Here we bench a single function over a single graph
+benchFunc' :: GraphImpl g => FuncToBench g -> Edges -> Benchmark
+benchFunc' (Consummer name fun) edges = bench name $ nf fun $! mkGraph edges
+benchFunc' (FuncWithArg name fun showArg args ) edges = bgroup name $ map (\arg -> bench (showArg arg) $ nf (fun arg) $! mkGraph edges) args
+
+---------
+
+-- Generic graphs
+mkPath :: Int -> Edges
+mkPath n = take n $ iterate ((\(x,y) -> (x+1,y+1)) :: (Int,Int) -> (Int,Int)) (0,1)
+
+edgesNotInPath :: Edges -> Edges
+edgesNotInPath = map (\(x,y)-> (x-1,y+1))