Skip to content

Use randomly structured Set and Map in benchmarks #86

Use randomly structured Set and Map in benchmarks

Use randomly structured Set and Map in benchmarks #86

Workflow file for this run

name: MicroHs CI for containers
on:
push:
branches: [ "master" ]
pull_request:
branches: [ "master" ]
jobs:
build-mhs-containers:
runs-on: ubuntu-latest
steps:
- name: checkout containers repo
uses: actions/checkout@v4
with:
path: cont
- name: checkout mhs repo
uses: actions/checkout@v4
with:
repository: augustss/MicroHs
ref: stable-1
path: mhs
- name: make mhs
run: |
cd mhs
make
# It's pretty ugly with the list of modules here, but I don't know a nice way of getting it from the cabal file.
# I'll make it nicer with mcabal later.
- name: compile containers package
run: |
cd mhs
MHSCPPHS=./bin/cpphs ./bin/mhs -Pcontainers-test -ocontainers-test.pkg -i../cont/containers/src -XCPP -I../cont/containers/include Data.Containers.ListUtils Data.IntMap Data.IntMap.Lazy Data.IntMap.Strict Data.IntMap.Strict.Internal Data.IntMap.Internal Data.IntMap.Internal.Debug Data.IntMap.Merge.Lazy Data.IntMap.Merge.Strict Data.IntSet.Internal Data.IntSet.Internal.IntTreeCommons Data.IntSet Data.Map Data.Map.Lazy Data.Map.Merge.Lazy Data.Map.Strict.Internal Data.Map.Strict Data.Map.Merge.Strict Data.Map.Internal Data.Map.Internal.Debug Data.Set.Internal Data.Set Data.Graph Data.Sequence Data.Sequence.Internal Data.Sequence.Internal.Sorting Data.Tree Utils.Containers.Internal.BitUtil Utils.Containers.Internal.BitQueue Utils.Containers.Internal.StrictPair