on cc3bbd7 help sign in
.circleci/config.yml+277−74
since splitsnapshots
unifiedsplit
@@ -1,7 +1,7 @@
1version: 2.1
1version: 2.1
2
2
3#-----------------------------------------------------------------------------
3#-----------------------------------------------------------------------------
4−# packcheck-0.7.0
4+# packcheck-0.4.2
5# Packcheck global environment variables
5# Packcheck global environment variables
6#-----------------------------------------------------------------------------
6#-----------------------------------------------------------------------------
7
7
@@ -11,8 +11,6 @@ env: &env
11 # Common options
11 # Common options
12 # ------------------------------------------------------------------------
12 # ------------------------------------------------------------------------
13 # GHC_OPTIONS: "-Werror"
13 # GHC_OPTIONS: "-Werror"
14− # For updating see: https://downloads.haskell.org/~ghcup/
15− GHCUP_VERSION: 0.1.20.0
16 CABAL_REINIT_CONFIG: "y"
14 CABAL_REINIT_CONFIG: "y"
17 LC_ALL: "C.UTF-8"
15 LC_ALL: "C.UTF-8"
18
16
@@ -24,6 +22,7 @@ env: &env
24 # DISABLE_DOCS: "y"
22 # DISABLE_DOCS: "y"
25 # DISABLE_SDIST_BUILD: "y"
23 # DISABLE_SDIST_BUILD: "y"
26 # DISABLE_DIST_CHECKS: "y"
24 # DISABLE_DIST_CHECKS: "y"
25+ ENABLE_INSTALL: "y"
27
26
28 # ------------------------------------------------------------------------
27 # ------------------------------------------------------------------------
29 # stack options
28 # stack options
@@ -39,12 +38,15 @@ env: &env
39 # cabal options
38 # cabal options
40 # ------------------------------------------------------------------------
39 # ------------------------------------------------------------------------
41 CABAL_CHECK_RELAX: "y"
40 CABAL_CHECK_RELAX: "y"
41+ CABAL_NO_SANDBOX: "y"
42+ CABAL_HACKAGE_MIRROR: "hackage.haskell.org:http://hackage.fpcomplete.com"
42 CABAL_BUILD_OPTIONS: "-j1 --flag limit-build-mem"
43 CABAL_BUILD_OPTIONS: "-j1 --flag limit-build-mem"
43
44
44 # ------------------------------------------------------------------------
45 # ------------------------------------------------------------------------
45 # Where to find the required tools
46 # Where to find the required tools
46 # ------------------------------------------------------------------------
47 # ------------------------------------------------------------------------
47− PATH: /sbin:/usr/sbin:/bin:/usr/bin
48+ PATH: /opt/ghc/bin:/opt/ghcjs/bin:/sbin:/usr/sbin:/bin:/usr/bin
49+ TOOLS_DIR: /opt
48
50
49 # ------------------------------------------------------------------------
51 # ------------------------------------------------------------------------
50 # Location of packcheck.sh (the shell script invoked to perform CI tests ).
52 # Location of packcheck.sh (the shell script invoked to perform CI tests ).
@@ -57,15 +59,15 @@ env: &env
57 # If you have not committed packcheck.sh in your repo at PACKCHECK
59 # If you have not committed packcheck.sh in your repo at PACKCHECK
58 # then it is automatically pulled from this URL.
60 # then it is automatically pulled from this URL.
59 PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
61 PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
60− PACKCHECK_GITHUB_COMMIT: "f6cfd7b7a33b4bf6fd63cce6a3fb3d26f5031403"
62+ PACKCHECK_GITHUB_COMMIT: "35efa99b2082d13722b8a0183ac6455df98e91b9"
61
63
62executors:
64executors:
63 amd64-executor:
65 amd64-executor:
64 docker:
66 docker:
65− - image: ubuntu:latest
67+ - image: ubuntu:xenial
66 x86-executor:
68 x86-executor:
67 docker:
69 docker:
68− - image: i386/ubuntu:focal
70+ - image: i386/ubuntu:eoan
69
71
70#-----------------------------------------------------------------------------
72#-----------------------------------------------------------------------------
71# Common utility stuff, not to be modified usually
73# Common utility stuff, not to be modified usually
@@ -77,50 +79,38 @@ preinstall: &preinstall
77 # required for https/cache save and restore
79 # required for https/cache save and restore
78 apt-get install -y ca-certificates
80 apt-get install -y ca-certificates
79
81
80− # Alternative way of installing ghc and cabal, directly from
82+ # required to (re)generate the configure script
81− # haskell.org instead of using ghcup. NOTE: this is for Debian
82− # only and is debian release specific.
83− # gnupg is required for apt-key to work
84− #apt-get install -y gnupg
85− #apt-key adv --keyserver keyserver.ubuntu.com --recv-keys BA3CBA3FFE22B574
86− #echo "deb http://downloads.haskell.org/debian buster main" >> /etc/apt/sources.list
87− #apt-get update
88−
89− # required for outbound https for stack and for stack setup
90− apt-get install -y netbase xz-utils make
83+ apt-get install -y autoconf
91− apt-get install -y zlib1g-dev
92
84
93− # For ghcup to install ghc
85+ # For ghc and cabal-install packages from hvr's ppa
94− if test -n "$GHCUP_VERSION"
86+ # gnupg is required for apt-key to work
95− then
87+ apt-get install -y gnupg
88+ apt-get install -y apt-transport-https
89+ apt-key adv --keyserver keyserver.ubuntu.com --recv-keys BA3CBA3FFE22B574
96− apt-get install -y gcc
90+ apt-get install -y software-properties-common
97− apt-get install -y g++
91+ add-apt-repository -y ppa:hvr/ghc
98− fi
92+ # echo "deb http://downloads.haskell.org/debian stretch main" >> /etc/apt/sources.list
93+ echo "deb-src http://ppa.launchpad.net/hvr/ghc/ubuntu xenial main" >> /etc/apt/sources.list
94+ apt-get update
99
95
100− # libgmp required by ghc for linking
96+ # required for packcheck
101− apt-get install -y libgmp-dev
97+ apt-get install -y curl
102− apt-get install -y libtinfo-dev
103
98
104− # Required by cabal when git URL is specified in project file
99+ # required for circleci.
100+ apt-get install -y libcurl4-gnutls-dev
105 apt-get install -y git
101 apt-get install -y git
102+ apt-get install -y libtinfo-dev
106
103
107− # Required for and by packcheck
104+ # required for outbound https for stack and for stack setup
108− apt-get install -y curl
105+ apt-get install -y netbase xz-utils make
109
106
107+project-preinstall: &project-preinstall
108+ run: |
110 # Get packcheck if needed
109 # Get packcheck if needed
111− if test ! -e "$PACKCHECK"
110+ CURL=$(which curl)
112− then
113− if test -z "$PACKCHECK_GITHUB_COMMIT"
114− then
115− die "PACKCHECK_GITHUB_COMMIT is not specified."
116− fi
117− PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
111+ PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
118− curl --fail -sL -o "$PACKCHECK" $PACKCHECK_URL || exit 1
112+ if test ! -e "$PACKCHECK"; then $CURL -sL -o "$PACKCHECK" $PACKCHECK_URL; fi;
119− chmod +x $PACKCHECK
120− elif test ! -x "$PACKCHECK"
121− then
122− chmod +x $PACKCHECK
113+ chmod +x $PACKCHECK
123− fi
124
114
125restore: &restore
115restore: &restore
126 # Needs to happen after installing ca-certificates
116 # Needs to happen after installing ca-certificates
@@ -136,71 +126,270 @@ save: &save
136 save_cache:
126 save_cache:
137 key: v1-{{ .Environment.CIRCLE_JOB }}-{{ .Branch }}
127 key: v1-{{ .Environment.CIRCLE_JOB }}-{{ .Branch }}
138 paths:
128 paths:
139− - ~/.local
140 - ~/.cabal
129 - ~/.cabal
130+ - ~/.ghc
131+ - ~/.local
141 - ~/.stack
132 - ~/.stack
142− - ~/.ghcup
143
133
144#-----------------------------------------------------------------------------
134#-----------------------------------------------------------------------------
145# Build matrix
135# Build matrix
146#-----------------------------------------------------------------------------
136#-----------------------------------------------------------------------------
147
137
148jobs:
138jobs:
149− cabal-ghc-8_6_5:
139+ cabal-ghc-8_10_4:
150 <<: *env
140 <<: *env
151 executor: amd64-executor
141 executor: amd64-executor
152 steps:
142 steps:
143+ - *preinstall
153 - checkout
144 - checkout
145+ - *project-preinstall
154 - *restore
146 - *restore
155− - *preinstall
156 - run:
147 - run:
157 environment:
148 environment:
158− GHCVER: "8.6.5"
159− CABAL_VERSION: "3.6.2.0"
160 CABAL_PROJECT: "cabal.project"
149 CABAL_PROJECT: "cabal.project"
161− DISABLE_SDIST_BUILD: "yes"
150+ DISABLE_TEST: "yes"
162− CABAL_BUILD_OPTIONS: "--flag debug --flag -opt"
151+ DISABLE_BENCH: "yes"
152+ DISABLE_DIST_CHECKS: "yes"
163 command: |
153 command: |
154+ apt-get install -y ghc-8.10.4
155+ apt-get install -y cabal-install-3.4
164 bash -c "$PACKCHECK cabal"
156 bash -c "$PACKCHECK cabal"
165 - *save
157 - *save
166− cabal-ghc-9_8_1-docspec:
158+ stack-ghc-8_8:
167 <<: *env
159 <<: *env
168 executor: amd64-executor
160 executor: amd64-executor
169 steps:
161 steps:
162+ - *preinstall
170 - checkout
163 - checkout
164+ - *project-preinstall
171 - *restore
165 - *restore
166+ - run:
167+ name: GHC 8.8 + stack lts-16.12
168+ environment:
169+ BUILD: "stack"
170+ RESOLVER: "lts-16.12"
171+ SDIST_OPTIONS: "--ignore-check"
172+ STACK_BUILD_OPTIONS: "--flag streamly-benchmarks:-opt"
173+ command: |
174+ apt-get build-dep -y ghc-8.8.4
175+ apt-get install -y cabal-install-3.2
176+ bash -c "$PACKCHECK $BUILD"
177+ - *save
178+ cabal-ghc-8_6_5:
179+ <<: *env
180+ executor: amd64-executor
181+ steps:
172 - *preinstall
182 - *preinstall
183+ - checkout
184+ - *project-preinstall
185+ - *restore
186+ - run: |
187+ apt-get install -y ghc-8.6.3
188+ apt-get install -y cabal-install-2.4
189+ bash -c "$PACKCHECK cabal-v2"
190+ - *save
191+ cabal-ghc-8_4_4:
192+ <<: *env
193+ executor: x86-executor
194+ steps:
195+ - *preinstall
196+ - checkout
197+ - *project-preinstall
198+ - *restore
199+ - run:
200+ name: GHC 8.4.4 + x86 + debug
201+ environment:
202+ BUILD: "cabal-v2"
203+ GHCVER: "8.4.4"
204+ CABAL_BUILD_OPTIONS: "--flag debug --flag limit-build-mem"
205+ command: |
206+ apt-get install -y ghc-8.4.4
207+ apt-get install -y cabal-install-3.2
208+ bash -c "$PACKCHECK $BUILD"
209+ - *save
210+ cabal-ghc-8_2_2:
211+ <<: *env
212+ executor: amd64-executor
213+ steps:
214+ - *preinstall
215+ - checkout
216+ - *project-preinstall
217+ - *restore
173 - run:
218 - run:
174 environment:
219 environment:
175− GHCVER: "9.8.1"
220+ BUILD: "cabal-v2"
176− CABAL_VERSION: "3.10.1.0"
177− CABAL_PROJECT: "cabal.project.doctest"
178− DISABLE_SDIST_BUILD: "y"
179− DISABLE_TEST: "y"
221+ DISABLE_TEST: "yes"
180− DISABLE_BENCH: "y"
222+ DISABLE_BENCH: "yes"
181− DISABLE_DOCS: "y"
223+ DISABLE_DOCS: "yes"
182− ENABLE_DOCSPEC: "y"
224+ DISABLE_SDIST_BUILD: "yes"
183− DOCSPEC_URL: https://github.com/phadej/cabal-extras/releases/download/cabal-docspec-0.0.0.20210111/cabal-docspec-0.0.0.20210111.xz
225+ DISABLE_DIST_CHECKS: "yes"
184− DOCSPEC_OPTIONS: "--timeout 60 --check-properties --property-variables xs"
185 command: |
226 command: |
227+ apt-get install -y ghc-8.2.2
228+ apt-get install -y cabal-install-3.2
186− bash -c "$PACKCHECK cabal"
229+ bash -c "$PACKCHECK $BUILD"
187 - *save
230 - *save
188− hlint-trailing-spaces:
231+ cabal-ghc-8_0_2:
189 <<: *env
232 <<: *env
190 executor: amd64-executor
233 executor: amd64-executor
191 steps:
234 steps:
235+ - *preinstall
192 - checkout
236 - checkout
237+ - *project-preinstall
193 - *restore
238 - *restore
239+ - run:
240+ environment:
241+ BUILD: "cabal-v2"
242+ DISABLE_TEST: "yes"
243+ DISABLE_BENCH: "yes"
244+ DISABLE_DOCS: "yes"
245+ DISABLE_SDIST_BUILD: "yes"
246+ DISABLE_DIST_CHECKS: "yes"
247+ command: |
248+ apt-get install -y ghc-8.0.2
249+ apt-get install -y cabal-install-3.2
250+ bash -c "$PACKCHECK $BUILD"
251+ - *save
252+ cabal-ghc-7_10_3:
253+ <<: *env
254+ executor: amd64-executor
255+ steps:
194 - *preinstall
256 - *preinstall
257+ - checkout
258+ - *project-preinstall
259+ - *restore
260+ - run: |
261+ apt-get install -y ghc-7.10.3
262+ apt-get install -y cabal-install-2.4
263+ bash -c "$PACKCHECK cabal-v2"
264+ - *save
265+ stack-ghc-8_4:
266+ <<: *env
267+ executor: amd64-executor
268+ steps:
269+ - *preinstall
270+ - checkout
271+ - *project-preinstall
272+ - *restore
273+ - run: |
274+ bash -c "$PACKCHECK stack RESOLVER=lts-12"
275+ - *save
276+ stack-ghc-8_2:
277+ <<: *env
278+ executor: amd64-executor
279+ steps:
280+ - *preinstall
281+ - checkout
282+ - *project-preinstall
283+ - *restore
284+ - run: |
285+ bash -c "$PACKCHECK stack RESOLVER=lts-11"
286+ - *save
287+ cabal-ghcjs-8_4:
288+ <<: *env
289+ executor: amd64-executor
290+ steps:
291+ - *preinstall
292+ - checkout
293+ - *project-preinstall
294+ - *restore
195 - run:
295 - run:
196− name: hlint and trailing spaces
296+ name: GHCJS 8.4+no-test+no-docs
197 environment:
297 environment:
298+ BUILD: cabal-v2
299+ ENABLE_GHCJS: "yes"
300+ DISABLE_TEST: "yes"
301+ ENABLE_INSTALL: ""
302+ DISABLE_DOCS: "yes"
198 DISABLE_SDIST_BUILD: "yes"
303 DISABLE_SDIST_BUILD: "yes"
199− HLINT_VERSION: 3.6.1
304+ command: |
305+ add-apt-repository -y ppa:hvr/ghcjs
306+ add-apt-repository -y 'deb https://deb.nodesource.com/node_11.x xenial main'
307+ curl -sSL https://deb.nodesource.com/gpgkey/nodesource.gpg.key | apt-key add -
308+ apt-get update
309+ apt-get install -y cabal-install-3.2
310+ apt-get install -y nodejs
311+ apt-get install -y ghcjs-8.4
312+ cabal user-config update -a "jobs: 1"
313+ bash -c "$PACKCHECK $BUILD"
314+ - *save
315+ coveralls-ghc-8_2_2:
316+ <<: *env
317+ executor: amd64-executor
318+ steps:
319+ - *preinstall
320+ - checkout
321+ - *project-preinstall
322+ - *restore
323+ - run:
324+ environment:
325+ BUILD: cabal
326+ COVERALLS_OPTIONS: "--repo-token=\"$REPO_TOKEN\" --coverage-mode=StrictlyFullLines --exclude-dir=test test"
327+ GHC_OPTIONS: "-DCOVERAGE_BUILD"
328+ command: |
329+ apt-get install -y ghc-8.2.2
330+ apt-get install -y cabal-install-2.4
331+ bash -c "$PACKCHECK cabal-v1"
332+ - *save
333+ coveralls-ghc-8_8_3:
334+ <<: *env
335+ executor: amd64-executor
336+ steps:
337+ - *preinstall
338+ - checkout
339+ - *project-preinstall
340+ - *restore
341+ - run:
342+ environment:
343+ BUILD: cabal-v2
344+ COVERALLS_OPTIONS: "--repo-token=\"$REPO_TOKEN\" --coverage-mode=StrictlyFullLines --exclude-dir=test"
345+ CABAL_PROJECT: "cabal.project.coverage"
346+ CABAL_BUILD_TARGETS: ""
347+ command: |
348+ apt-get install -y ghc-8.8.3
349+ apt-get install -y cabal-install-3.0
350+ bash -c "$PACKCHECK cabal-v2"
351+ no_output_timeout: 25m
352+ - *save
353+ coveralls-ghc-8_10_2:
354+ <<: *env
355+ executor: amd64-executor
356+ steps:
357+ - *preinstall
358+ - checkout
359+ - *project-preinstall
360+ - *restore
361+ - run:
362+ name: Build and test with inspection, coverage, Werror
363+ command: |
364+ apt-get install -y ghc-8.10.2
365+ apt-get install -y cabal-install-3.2
366+ # Run tests with coverage
367+ cabal update
368+ cabal user-config update -a "jobs: 1"
369+ bin/test.sh --coverage --raw
370+ # Upload results to coveralls.io
371+ PATH=$HOME/.cabal/bin:$PATH
372+ export PATH
373+ which hpc-coveralls 2>/dev/null || cabal install --project-file cabal.project.hpc-coveralls hpc-coveralls
374+ hpc-coveralls --repo-token="$REPO_TOKEN" --coverage-mode=StrictlyFullLines
375+ no_output_timeout: 25m
376+ - *save
377+ hlint-src:
378+ <<: *env
379+ executor: amd64-executor
380+ steps:
381+ - *preinstall
382+ - checkout
383+ - *project-preinstall
384+ - *restore
385+ - run:
386+ name: Hlint src
387+ environment:
388+ BUILD: cabal-v2
200 HLINT_OPTIONS: lint
389 HLINT_OPTIONS: lint
201 HLINT_TARGETS: core/src src test benchmark
390 HLINT_TARGETS: core/src src test benchmark
202 command: |
391 command: |
203− bash -c "$PACKCHECK hlint" || exit 1
392+ bash -c "$PACKCHECK $BUILD" || exit 1
204 echo "Checking trailing spaces..."
393 echo "Checking trailing spaces..."
205 count=$(find . -name "*.hs" -exec grep -H '\ $' {} \; | tee /dev/tty | wc -l)
394 count=$(find . -name "*.hs" -exec grep -H '\ $' {} \; | tee /dev/tty | wc -l)
206 exit $count
395 exit $count
@@ -210,9 +399,23 @@ workflows:
210 version: 2
399 version: 2
211 build:
400 build:
212 jobs:
401 jobs:
213− #- cabal-ghc-8_6_5:
402+ - cabal-ghc-8_10_4:
214− # name: 8.6.5-debug-unoptimized
403+ name: GHC 8.10.4 + sdist + no-test + no-bench
404+ #- cabal-ghc-8.6.5
405+ #- cabal-ghc-8_4_4:
406+ # name: GHC 8.4.4 + x86 + debug
407+ #- cabal-ghc-8_2_2:
408+ # name: GHC 8.2.2 + no-test + no-bench + no-docs
409+ #- cabal-ghc-8_0_2:
410+ # name: GHC 8.0.2 + no-test + no-bench + no-docs
215− - cabal-ghc-9_8_1-docspec:
411+ #- cabal-ghc-7.10.3
216− name: ghc-9.8.1-docspec
412+ - cabal-ghcjs-8_4:
217− - hlint-trailing-spaces:
413+ name: GHCJS 8.4 + no-test + no-docs
218− name: hlint and trailing spaces
414+ #- stack-ghc-8.4
415+ #- stack-ghc-8.2
416+ #- coveralls-ghc-8.2.2
417+ #- coveralls-ghc-8.8.3
418+ #- coveralls-ghc-8_10_2:
419+ # name: GHC 8.10.2 + inspection + coverage + Werror
420+ - hlint-src:
421+ name: Hlint src + Trailing Spaces
.github/workflows/haskell.yml+104−129
@@ -13,15 +13,8 @@ jobs:
13 # packcheck environment variables
13 # packcheck environment variables
14 LC_ALL: C.UTF-8
14 LC_ALL: C.UTF-8
15 BUILD: ${{ matrix.build }}
15 BUILD: ${{ matrix.build }}
16− # For updating see: https://downloads.haskell.org/~ghcup/
17− GHCUP_VERSION: 0.1.20.0
18− DOCSPEC_URL: https://github.com/phadej/cabal-extras/releases/download/cabal-docspec-0.0.0.20210111/cabal-docspec-0.0.0.20210111.xz
19− DOCSPEC_OPTIONS: "--timeout 60 --check-properties --property-variables xs"
20− GHCUP_GHC_OPTIONS: ${{ matrix.ghcup_ghc_options }}
21 GHCVER: ${{ matrix.ghc_version }}
16 GHCVER: ${{ matrix.ghc_version }}
22− CABALVER: ${{ matrix.cabal_version }}
23 DISABLE_DOCS: ${{ matrix.disable_docs }}
17 DISABLE_DOCS: ${{ matrix.disable_docs }}
24− ENABLE_DOCSPEC: ${{ matrix.enable_docspec }}
25 DISABLE_TEST: ${{ matrix.disable_test }}
18 DISABLE_TEST: ${{ matrix.disable_test }}
26 DISABLE_BENCH: ${{ matrix.disable_bench }}
19 DISABLE_BENCH: ${{ matrix.disable_bench }}
27 DISABLE_DIST_CHECKS: ${{ matrix.disable_dist_checks }}
20 DISABLE_DIST_CHECKS: ${{ matrix.disable_dist_checks }}
@@ -45,21 +38,14 @@ jobs:
45 STACK_BUILD_OPTIONS: ${{ matrix.stack_build_options }}
38 STACK_BUILD_OPTIONS: ${{ matrix.stack_build_options }}
46
39
47 # packcheck location and revision
40 # packcheck location and revision
48− PACKCHECK: "./packcheck.sh"
41+ PACKCHECK_LOCAL_PATH: "./packcheck.sh"
49 PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
42 PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
50− PACKCHECK_GITHUB_COMMIT: "v0.7.0"
43+ PACKCHECK_GITHUB_COMMIT: "075e13ab716c67d2110db4905ae42b0280af046d"
51
44
52 # Pull token from "secrets" setting of the github repo
45 # Pull token from "secrets" setting of the github repo
53 COVERALLS_TOKEN: ${{ secrets.COVERALLS_TOKEN }}
46 COVERALLS_TOKEN: ${{ secrets.COVERALLS_TOKEN }}
54 COVERAGE: ${{ matrix.coverage }}
47 COVERAGE: ${{ matrix.coverage }}
55−
48+ DOCTEST: ${{ matrix.doctest }}
56− # hlint
57− HLINT_VERSION: 3.6.1
58− HLINT_OPTIONS: "lint"
59− HLINT_TARGETS: "core/src src test benchmark"
60−
61− # Subdir
62− SUBDIR: ${{ matrix.subdir }}
63
49
64 runs-on: ${{ matrix.runner }}
50 runs-on: ${{ matrix.runner }}
65 continue-on-error: ${{ matrix.ignore_error }}
51 continue-on-error: ${{ matrix.ignore_error }}
@@ -68,8 +54,8 @@ jobs:
68 matrix:
54 matrix:
69 # The order is important to optimize fail-fast.
55 # The order is important to optimize fail-fast.
70 name:
56 name:
71− - 9.8.1-Werror
57+ - 8.10.7-sdist-fusion-inspection-Werror
72− # - 9.8.1-docspec
58+ - 9.2.2-docspec
73 # - 8.10.7-coverage
59 # - 8.10.7-coverage
74
60
75 # Note: if cabal.project is not specified benchmarks and tests won't
61 # Note: if cabal.project is not specified benchmarks and tests won't
@@ -78,159 +64,160 @@ jobs:
78 include:
64 include:
79 - name: head
65 - name: head
80 ghc_version: head
66 ghc_version: head
81− # The URL may change, to find a working URL go to https://gitlab.haskell.org/ghc/ghc/-/jobs/
82− # Find a debian10/11/12 job, click on a passed/failed status, at the
83− # end of the output you will find the tar.xz name, put that tar
84− # name after "raw/", and put the job name after "job=".
85− # Also see https://github.com/mpickering/ghc-artefact-nix/blob/master/gitlab-artifact.nix
86− #
87− # May also use ghcup for installing ghc head version, use the
88− # version "LatestNightly", and the following config:
89− # ghcup config add-release-channel https://ghc.gitlab.haskell.org/ghcup-metadata/ghcup-nightlies-0.0.7.yaml
90− ghcup_ghc_options: "-u https://gitlab.haskell.org/ghc/ghc/-/jobs/artifacts/master/raw/ghc-x86_64-linux-deb10-int_native-validate.tar.xz?job=x86_64-linux-deb10-int_native-validate"
91 runner: ubuntu-latest
67 runner: ubuntu-latest
92 build: cabal
68 build: cabal
93− cabal_version: 3.10.2.0
69+ cabal_version: latest
94 cabal_project: cabal.project.ghc-head
70 cabal_project: cabal.project.ghc-head
95 disable_sdist_build: "y"
71 disable_sdist_build: "y"
96 ignore_error: true
72 ignore_error: true
97− # Note: use linux for warning build for convenient dev testing
98− - name: 9.8.1-Werror
99− ghc_version: 9.8.1
100− runner: ubuntu-latest
101− build: cabal
102− cabal_version: 3.10.1.0
103− disable_sdist_build: "y"
104− cabal_project: cabal.project.Werror
105− ignore_error: false
106− #- name: 9.8.1-docspec
73+ - name: 9.2.2
107− # ghc_version: 9.8.1
108− # runner: ubuntu-latest
109− # build: cabal
110− # cabal_version: 3.10.1.0
111− # cabal_project: cabal.project.doctest
112− # disable_test: "y"
113− # disable_bench: "y"
114− # disable_docs: "y"
115− # enable_docspec: "y"
116− # disable_sdist_build: "y"
117− # ignore_error: false
118− - name: 9.8.1-fusion-inspection
119− ghc_version: 9.8.1
74+ ghc_version: 9.2.2
120 runner: ubuntu-latest
75 runner: ubuntu-latest
121 build: cabal
76 build: cabal
122− cabal_version: 3.10.1.0
123− disable_sdist_build: "y"
124 cabal_project: cabal.project
77 cabal_project: cabal.project
125− cabal_build_options: "--flag fusion-plugin --flag inspection"
126− ignore_error: false
127− - name: 9.6.3-macos
128− ghc_version: 9.6.3
129− runner: macos-latest
130− build: cabal
131− cabal_version: 3.10.1.0
78+ cabal_version: 3.6
132− disable_sdist_build: "y"
133− cabal_project: cabal.project
134− ignore_error: false
135− - name: 9.4.7
136− ghc_version: 9.4.7
137− runner: ubuntu-latest
138− build: cabal
139− cabal_version: 3.8.1.0
140 disable_sdist_build: "y"
79 disable_sdist_build: "y"
141− cabal_project: cabal.project
142 ignore_error: false
80 ignore_error: false
143− - name: 9.2.8
81+ - name: 9.2.2-docspec
144− ghc_version: 9.2.8
82+ ghc_version: 9.2.2
145 runner: ubuntu-latest
83 runner: ubuntu-latest
146− build: cabal
84+ doctest: "y"
85+ cabal_version: 3.6
147 cabal_project: cabal.project
86 cabal_project: cabal.project
148− cabal_version: 3.6.2.0
149− disable_sdist_build: "y"
150 ignore_error: false
87 ignore_error: false
151− - name: 9.0.2-streamly-sdist
88+ - name: 9.0.2
152 ghc_version: 9.0.2
89 ghc_version: 9.0.2
153 runner: ubuntu-latest
90 runner: ubuntu-latest
154 build: cabal
91 build: cabal
155− cabal_version: 3.6.2.0
92+ cabal_version: 3.6
156− cabal_project: cabal.project.streamly
93+ cabal_project: cabal.project.902
94+ disable_sdist_build: "y"
157 ignore_error: true
95 ignore_error: true
158− - name: 9.0.2-streamly-core-sdist
159− ghc_version: 9.0.2
160− runner: ubuntu-latest
161− build: cabal
162− cabal_version: 3.6.2.0
163− subdir: core
164− ignore_error: false
165− - name: 8.10.7-streamly-sdist-stack
96+ - name: 8.10.7-sdist-stack
166 runner: ubuntu-latest
97 runner: ubuntu-latest
167 build: stack
98 build: stack
168− resolver: lts-20.13
99+ resolver: lts-18.23
169 stack_yaml: stack.yaml
100 stack_yaml: stack.yaml
170 sdist_options: "--ignore-check"
101 sdist_options: "--ignore-check"
171 stack_build_options: "--flag streamly-benchmarks:-opt"
102 stack_build_options: "--flag streamly-benchmarks:-opt"
172− cabal_version: 3.6.2.0
103+ cabal_version: 3.6
104+ ignore_error: false
105+ - name: 8.10.7-macos
106+ ghc_version: 8.10.7
107+ runner: macos-latest
108+ build: cabal
109+ cabal_version: 3.6
110+ cabal_project: cabal.project
111+ disable_sdist_build: "y"
173 ignore_error: false
112 ignore_error: false
174 # - name: 8.10.7-coverage
113 # - name: 8.10.7-coverage
175 # ghc_version: 8.10.7
114 # ghc_version: 8.10.7
176 # runner: ubuntu-latest
115 # runner: ubuntu-latest
177 # coverage: "y"
116 # coverage: "y"
178− # cabal_version: 3.6.2.0
117+ # cabal_version: 3.6
179 # ignore_error: false
118 # ignore_error: false
180− - name: 8.8.4
119+ - name: 8.10.7-sdist-fusion-inspection-Werror
120+ ghc_version: 8.10.7
121+ runner: ubuntu-latest
122+ build: cabal
123+ cabal_version: 3.6
124+ cabal_project: cabal.project.Werror
125+ cabal_build_options: "--flag fusion-plugin --flag inspection"
126+ ignore_error: false
127+ - name: 8.8.4-sdist-fusion
181 ghc_version: 8.8.4
128 ghc_version: 8.8.4
182 runner: ubuntu-latest
129 runner: ubuntu-latest
183 build: cabal
130 build: cabal
184− cabal_version: 3.6.2.0
131+ cabal_version: 3.6
185 cabal_project: cabal.project
132 cabal_project: cabal.project
186− disable_sdist_build: "y"
133+ cabal_build_options: "--flag fusion-plugin"
187 ignore_error: false
134 ignore_error: false
188− - name: 8.6.5-debug-unoptimized
135+ - name: 8.6.5-sdist-streamk-unoptimized
189 ghc_version: 8.6.5
136 ghc_version: 8.6.5
190 runner: ubuntu-latest
137 runner: ubuntu-latest
191 build: cabal
138 build: cabal
192− cabal_version: 3.6.2.0
139+ cabal_version: 3.6
140+ cabal_project: cabal.project
141+ cabal_build_options: "--flag streamk --flag -opt"
142+ ignore_error: false
143+ - name: 8.6.5-sdist-debug-unoptimized
144+ ghc_version: 8.6.5
145+ runner: ubuntu-latest
146+ build: cabal
147+ cabal_version: 3.6
193 cabal_project: cabal.project
148 cabal_project: cabal.project
194 cabal_build_options: "--flag debug --flag -opt"
149 cabal_build_options: "--flag debug --flag -opt"
195− disable_sdist_build: "y"
196 ignore_error: false
150 ignore_error: false
197− - name: hlint
151+ - name: 8.4.4-sdist
198− build: hlint
152+ ghc_version: 8.4.4
199 runner: ubuntu-latest
153 runner: ubuntu-latest
154+ build: cabal
155+ cabal_version: 3.6
156+ cabal_project: cabal.project
200− ignore_error: true
157+ ignore_error: false
201
158
202 steps:
159 steps:
203 - uses: actions/checkout@v2
160 - uses: actions/checkout@v2
204
161
205 - uses: actions/cache@v1
162 - uses: actions/cache@v1
206− name: Cache common directories
163+ name: Cache ~/.cabal
207 with:
164 with:
208− path: |
209− ~/.local
210− ~/.cabal
165+ path: ~/.cabal
211− ~/.stack
212− ~/.ghcup
213 # Bump the key version to clear the cache
166 # Bump the key version to clear the cache
214− key: ${{ runner.os }}-${{ matrix.ghc_version }}-cabal-v2
167+ key: ${{ runner.os }}-${{ matrix.ghc_version }}-cabal-v1
215
168
216 - name: Download packcheck
169 - name: Download packcheck
217 run: |
170 run: |
218− if test ! -e "$PACKCHECK"
171+ # Get packcheck if needed
219− then
172+ CURL=$(which curl)
220− if test -z "$PACKCHECK_GITHUB_COMMIT"
173+ PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
221− then
174+ if test ! -e "$PACKCHECK_LOCAL_PATH"; then $CURL -sL -o "$PACKCHECK_LOCAL_PATH" $PACKCHECK_URL; fi;
222− die "PACKCHECK_GITHUB_COMMIT is not specified."
175+ chmod +x $PACKCHECK_LOCAL_PATH
223− fi
176+
224− PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
177+ os=$(uname -s -m)
225− curl --fail -sL -o "$PACKCHECK" $PACKCHECK_URL || exit 1
178+ case "$os" in
179+ "Linux x86_64") GHCUP_ARCH="x86_64-linux" ;;
180+ "Darwin x86_64") GHCUP_ARCH="x86_64-apple-darwin" ;;
181+ *) echo "Unknown OS/Arch: $os"; exit 1;;
182+ esac
183+
184+ $CURL -sL -o ./ghcup https://downloads.haskell.org/~ghcup/0.1.17.4/${GHCUP_ARCH}-ghcup-0.1.17.4
226− chmod +x $PACKCHECK
185+ chmod +x ./ghcup
227− elif test ! -x "$PACKCHECK"
186+ if test "$GHCVER" = "head"
228 then
187 then
229− chmod +x $PACKCHECK
188+ # The URL may change, to find a working URL go to https://gitlab.haskell.org/ghc/ghc/-/jobs/
189+ # Find a debian10 job, click on a passed/failed job, at the
190+ # end of the output you will find the tar.xz name, put that after
191+ # "raw/", and put the job name after "job=".
192+ # Also see https://github.com/mpickering/ghc-artefact-nix/blob/master/gitlab-artifact.nix
193+ ./ghcup install ghc -u https://gitlab.haskell.org/ghc/ghc/-/jobs/artifacts/master/raw/ghc-x86_64-linux-deb10-int_native-validate.tar.xz?job=x86_64-linux-deb10-int_native-validate head
194+ else
195+ ./ghcup install ghc $GHCVER
230 fi
196 fi
197+ ./ghcup set ghc $GHCVER
231
198
232 - name: Run tests
199 - name: Run tests
233 run: |
200 run: |
201+ if test -n "$DOCTEST"
202+ then
203+ mkdir -p $HOME/.cabal/bin
204+ curl -sL https://github.com/phadej/cabal-extras/releases/download/cabal-docspec-0.0.0.20210111/cabal-docspec-0.0.0.20210111.xz > cabal-docspec.xz
205+ echo '0829bd034fba901cbcfe491d98ed8b28fd54f9cb5c91fa8e1ac62dc4413c9562 cabal-docspec.xz' | sha256sum -c -
206+ xz -d < cabal-docspec.xz > $HOME/.cabal/bin/cabal-docspec
207+ rm -f cabal-docspec.xz
208+ chmod a+x $HOME/.cabal/bin/cabal-docspec
209+ cabal update
210+ cabal build all
211+ $HOME/.cabal/bin/cabal-docspec --version
212+ $HOME/.cabal/bin/cabal-docspec --timeout 60 --check-properties --property-variables xs
213+ elif test -z "$COVERAGE"
214+ then
215+ export TOOLS_DIR=/opt
216+ # /usr/local/opt/curl/bin for macOS
217+ export PATH=$HOME/.local/bin:$HOME/.ghcup/bin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/local/opt/curl/bin
218+ bash -c "$PACKCHECK_LOCAL_PATH $BUILD"
219+ fi
220+
234 if test -n "$COVERAGE"
221 if test -n "$COVERAGE"
235 then
222 then
236 # Run tests with coverage
223 # Run tests with coverage
@@ -243,16 +230,4 @@ jobs:
243 bin/test.sh --coverage --raw
230 bin/test.sh --coverage --raw
244 # XXX Uncomment this and fix it properly later
231 # XXX Uncomment this and fix it properly later
245 # hpc-coveralls --repo-token="$COVERALLS_TOKEN" --coverage-mode=StrictlyFullLines
232 # hpc-coveralls --repo-token="$COVERALLS_TOKEN" --coverage-mode=StrictlyFullLines
246− else
247− # /usr/local/opt/curl/bin for macOS
248− export PATH=$HOME/.local/bin:$HOME/.ghcup/bin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/local/opt/curl/bin
249− if test -n "$SUBDIR"
250− then
251− mv "$PACKCHECK" "$SUBDIR/packcheck.sh"
252− # This is required as dist-newstyle will be created on the top level
253− # directory as it is considered the working dir.
254− rm cabal.project
255− cd "$SUBDIR"
256− fi
257− bash -c "$PACKCHECK $BUILD"
258 fi
233 fi
.github/workflows/packdiff.yml+2−3
@@ -11,8 +11,7 @@ jobs:
11
11
12 - name: Download ghc
12 - name: Download ghc
13 run: |
13 run: |
14− GHCUP_VER=0.1.18.0
15− curl -sL -o ./ghcup https://downloads.haskell.org/~ghcup/$GHCUP_VER/x86_64-linux-ghcup-$GHCUP_VER
14+ curl -sL -o ./ghcup https://downloads.haskell.org/~ghcup/0.1.17.4/x86_64-linux-ghcup-0.1.17.4
16 chmod +x ./ghcup
15 chmod +x ./ghcup
17 GHCVER=8.10.7
16 GHCVER=8.10.7
18 ./ghcup install ghc $GHCVER
17 ./ghcup install ghc $GHCVER
@@ -25,7 +24,7 @@ jobs:
25 path: |
24 path: |
26 ~/.cabal
25 ~/.cabal
27 # Bump the key version to clear the cache
26 # Bump the key version to clear the cache
28− key: cache-v2
27+ key: cache-v1
29
28
30 - name: Checkout the current branch
29 - name: Checkout the current branch
31 uses: actions/checkout@v2
30 uses: actions/checkout@v2
.github/workflows/regression-check.yml+32−43
@@ -19,22 +19,25 @@ jobs:
19 env:
19 env:
20 CI_BENCHMARKS_WITH_CUTOFF: >-
20 CI_BENCHMARKS_WITH_CUTOFF: >-
21 Data.Array
21 Data.Array
22− Data.MutArray
22+ Data.Array.Foreign
23− Data.Array.Generic
24− Data.Ring.Unboxed
25 Data.Fold
23 Data.Fold
26− Data.Fold.Window
27 Data.Parser
24 Data.Parser
25+ Data.Parser.ParserD
28− Data.ParserK
26+ Data.Parser.ParserK
27+ Data.SmallArray
29− Data.StreamD
28+ Data.Stream.StreamD
29+ Data.Stream.StreamDK
30− Data.StreamK:6
30+ Data.Stream.StreamK:6
31 Data.Unfold
31 Data.Unfold
32 Data.Stream
32 Data.Stream
33− Data.Stream.Concurrent
34− Data.Stream.ConcurrentEager
35− Data.Stream.ConcurrentInterleaved
36− Data.Stream.ConcurrentOrdered
37 FileSystem.Handle
33 FileSystem.Handle
34+ Prelude.Ahead
35+ Prelude.Async:12
36+ Prelude.Parallel
37+ Prelude.WAsync:6
38+ Prelude.WSerial
39+ Prelude.ZipAsync
40+ Prelude.ZipSerial
38 Unicode.Char
41 Unicode.Char
39 Unicode.Stream
42 Unicode.Stream
40 Unicode.Utf8
43 Unicode.Utf8
@@ -57,10 +60,9 @@ jobs:
57
60
58 - name: Download ghc
61 - name: Download ghc
59 run: |
62 run: |
60− GHCUP_VER=0.1.18.0
61− curl -sL -o ./ghcup https://downloads.haskell.org/~ghcup/$GHCUP_VER/x86_64-linux-ghcup-$GHCUP_VER
63+ curl -sL -o ./ghcup https://downloads.haskell.org/~ghcup/0.1.17.4/x86_64-linux-ghcup-0.1.17.4
62 chmod +x ./ghcup
64 chmod +x ./ghcup
63− GHCVER=9.2.7
65+ GHCVER=8.10.7
64 ./ghcup install ghc $GHCVER
66 ./ghcup install ghc $GHCVER
65 ./ghcup set ghc $GHCVER
67 ./ghcup set ghc $GHCVER
66 cabal update
68 cabal update
@@ -71,44 +73,33 @@ jobs:
71 path: |
73 path: |
72 ~/.cabal
74 ~/.cabal
73 # Bump the key version to clear the cache
75 # Bump the key version to clear the cache
74− key: cache-v2
76+ key: cache-v1
75
77
76− - name: Cache bench-runner from pr
78+ - name: Cache charts from master
77− id: cache-bench-runner-pr
79+ id: cache-charts-master
78 uses: actions/cache@v2
80 uses: actions/cache@v2
79 with:
81 with:
80− path: bench-runner
82+ path: charts-master
81 # Bump the key version to clear the cache
83 # Bump the key version to clear the cache
82− key: bench-runner-v1
84+ key: charts-master-v1
83−
84− # -----------------------------------------------------------------
85− # -- Install bench-report in the current directory
86− # -----------------------------------------------------------------
87−
88− - name: Checkout the current branch
89− uses: actions/checkout@v2
90− with:
91− clean: false
92−
93− - name: Install bench-runner
94− run: |
95− cabal install bench-runner --project-file=cabal.project.report --installdir=./
96
85
97 # -----------------------------------------------------------------
86 # -----------------------------------------------------------------
98 # -- Generate reports for the base branch and upload
87 # -- Generate reports for the base branch and upload
99 # -----------------------------------------------------------------
88 # -----------------------------------------------------------------
100
89
101 - name: Checkout the base branch
90 - name: Checkout the base branch
91+ if: steps.cache-charts-master.outputs.cache-hit != 'true'
102 uses: actions/checkout@v2
92 uses: actions/checkout@v2
103 with:
93 with:
104 ref: master
94 ref: master
105− clean: false
106
95
107 - name: Run benchmarks
96 - name: Run benchmarks
97+ if: steps.cache-charts-master.outputs.cache-hit != 'true'
108 run: |
98 run: |
109− ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --raw
99+ cabal run bench-runner --project-file=cabal.project.report -- --targets "$CI_BENCHMARKS" --raw
110
100
111 - name: Move charts to charts-master
101 - name: Move charts to charts-master
102+ if: steps.cache-charts-master.outputs.cache-hit != 'true'
112 run: mv charts charts-master
103 run: mv charts charts-master
113
104
114 # -----------------------------------------------------------------
105 # -----------------------------------------------------------------
@@ -125,7 +116,7 @@ jobs:
125
116
126 - name: Run benchmarks and append
117 - name: Run benchmarks and append
127 run: |
118 run: |
128− ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --raw --append
119+ cabal run bench-runner --project-file=cabal.project.report -- --targets "$CI_BENCHMARKS" --raw --append
129
120
130 # -----------------------------------------------------------------
121 # -----------------------------------------------------------------
131 # -- Compare
122 # -- Compare
@@ -133,7 +124,7 @@ jobs:
133
124
134 - name: List all benchmarks
125 - name: List all benchmarks
135 run: |
126 run: |
136− ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --no-measure
127+ cabal run bench-runner --project-file=cabal.project.report -- --targets "$CI_BENCHMARKS" --no-measure
137
128
138 - name: Compare benchmarks
129 - name: Compare benchmarks
139 run: |
130 run: |
@@ -151,13 +142,11 @@ jobs:
151
142
152 echo
143 echo
153 echo "Checking $bname for regressions greater than $cutoff percent"
144 echo "Checking $bname for regressions greater than $cutoff percent"
154− ! ./bench-runner \
145+ ! cabal run bench-runner --project-file=cabal.project.report -- \
155− --package-name streamly-benchmarks \
156− --package-version 0.0.0 \
157− --targets "$bname" \
146+ --targets "$bname" \
158− --fields "$CI_FIELDS" \
147+ --fields "$CI_FIELDS" \
159− --no-measure --silent \
148+ --no-measure --silent \
160− --diff-cutoff-percent $cutoff \
149+ --diff-cutoff-percent $cutoff \
161 | grep -v "^$"
150 | grep -v "^$"
162 test $? -eq 1 && EXIT_STATUS=1
151 test $? -eq 1 && EXIT_STATUS=1
163 done
152 done
.hlint.ignore+4−10
@@ -1,37 +1,31 @@
1core/src/Streamly/Internal/Data/Stream/StreamK/Type.hs
1core/src/Streamly/Internal/Data/Stream/StreamK/Type.hs
2core/src/Streamly/Internal/Data/Pipe/Type.hs
2core/src/Streamly/Internal/Data/Pipe/Type.hs
3−core/src/Streamly/Internal/Unicode/Stream.hs
4src/Streamly/Internal/Data/SmallArray/Type.hs
3src/Streamly/Internal/Data/SmallArray/Type.hs
5−src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs
4+src/Streamly/Internal/Unicode/Stream.hs
6−src/Streamly/Internal/Data/Stream/Serial.hs
7−src/Streamly/Internal/Data/Stream/Zip.hs
8test/Streamly/Test/Data/Array.hs
5test/Streamly/Test/Data/Array.hs
6+test/Streamly/Test/Data/Array/Foreign.hs
9test/Streamly/Test/Data/Parser.hs
7test/Streamly/Test/Data/Parser.hs
10−test/Streamly/Test/Data/ParserK.hs
8+test/Streamly/Test/Data/Parser/ParserD.hs
11test/Streamly/Test/Data/SmallArray.hs
9test/Streamly/Test/Data/SmallArray.hs
12test/Streamly/Test/Data/Unfold.hs
10test/Streamly/Test/Data/Unfold.hs
13test/Streamly/Test/FileSystem/Event.hs
11test/Streamly/Test/FileSystem/Event.hs
14test/Streamly/Test/Prelude/Concurrent.hs
12test/Streamly/Test/Prelude/Concurrent.hs
15−test/Streamly/Test/Data/Stream/Concurrent.hs
16−test/lib/Streamly/Test/Prelude/Common.hs
17test/Streamly/Test/Prelude/Fold.hs
13test/Streamly/Test/Prelude/Fold.hs
18test/Streamly/Test/Prelude/Rate.hs
14test/Streamly/Test/Prelude/Rate.hs
19test/Streamly/Test/Prelude/Serial.hs
15test/Streamly/Test/Prelude/Serial.hs
20test/Streamly/Test/Unicode/Stream.hs
16test/Streamly/Test/Unicode/Stream.hs
21−test/Streamly/Test/Data/Unbox.hs
22benchmark/lib/Streamly/Benchmark/Common.hs
17benchmark/lib/Streamly/Benchmark/Common.hs
23benchmark/lib/Streamly/Benchmark/Common/Handle.hs
18benchmark/lib/Streamly/Benchmark/Common/Handle.hs
24benchmark/lib/Streamly/Benchmark/Prelude.hs
19benchmark/lib/Streamly/Benchmark/Prelude.hs
25benchmark/NanoBenchmarks.hs
20benchmark/NanoBenchmarks.hs
26benchmark/Streamly/Benchmark/Data/Array.hs
21benchmark/Streamly/Benchmark/Data/Array.hs
27benchmark/Streamly/Benchmark/Data/Parser.hs
22benchmark/Streamly/Benchmark/Data/Parser.hs
28−benchmark/Streamly/Benchmark/Data/ParserK.hs
23+benchmark/Streamly/Benchmark/Data/Parser/ParserD.hs
29benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs
24benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs
30benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs
25benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs
31benchmark/Streamly/Benchmark/Data/Unfold.hs
26benchmark/Streamly/Benchmark/Data/Unfold.hs
32benchmark/Streamly/Benchmark/FileSystem/Handle.hs
27benchmark/Streamly/Benchmark/FileSystem/Handle.hs
33benchmark/Streamly/Benchmark/Prelude/Async.hs
28benchmark/Streamly/Benchmark/Prelude/Async.hs
34−benchmark/Streamly/Benchmark/Prelude/Concurrent.hs
35benchmark/Streamly/Benchmark/Prelude/Merge.hs
29benchmark/Streamly/Benchmark/Prelude/Merge.hs
36benchmark/Streamly/Benchmark/Prelude/Parallel.hs
30benchmark/Streamly/Benchmark/Prelude/Parallel.hs
37benchmark/Streamly/Benchmark/Prelude/Rate.hs
31benchmark/Streamly/Benchmark/Prelude/Rate.hs
.hlint.yaml+4−2
@@ -24,14 +24,16 @@
24- ignore: {name: "Use uncurry"}
24- ignore: {name: "Use uncurry"}
25- ignore: {name: "Redundant $!"}
25- ignore: {name: "Redundant $!"}
26- ignore: {name: "Use fmap"}
26- ignore: {name: "Use fmap"}
27−- ignore: {name: "Use ++"}
28
27
29# Warnings ignored in specific places
28# Warnings ignored in specific places
29+- ignore: {name: "Use ++", within: Stream.Transform}
30- ignore: {name: "Use mapM", within: Stream.Transform}
30- ignore: {name: "Use mapM", within: Stream.Transform}
31- ignore: {name: "Use traverse", within: Stream.Transform}
31- ignore: {name: "Use traverse", within: Stream.Transform}
32- ignore: {name: "Redundant <*", within: Stream.Expand}
32- ignore: {name: "Redundant <*", within: Stream.Expand}
33+- ignore: {name: "Use ++", within: Stream.Reduce}
34+- ignore: {name: "Use ++", within: Stream.Split}
33- ignore: {name: "Redundant bracket", within: Stream.Split}
35- ignore: {name: "Redundant bracket", within: Stream.Split}
34−- ignore: {name: "Use isDigit", within: Streamly.Internal.Unicode.Parser}
36+- ignore: {name: "Use isDigit", within: Streamly.Internal.Unicode.Char.Parser}
35
37
36# Specify additional command line arguments
38# Specify additional command line arguments
37#
39#
.packcheck.ignore+1−3
@@ -11,7 +11,6 @@ appveyor.yml
11benchmark/bench-runner/default.nix
11benchmark/bench-runner/default.nix
12benchmark/bench-runner/cabal.project
12benchmark/bench-runner/cabal.project
13bin/ghc.sh
13bin/ghc.sh
14−bin/repl
15bin/run-ci.sh
14bin/run-ci.sh
16bin/run-repl-quick.sh
15bin/run-repl-quick.sh
17cabal.project
16cabal.project
@@ -22,10 +21,9 @@ cabal.project.hpc-coveralls
22cabal.project.O0
21cabal.project.O0
23cabal.project.report
22cabal.project.report
24cabal.project.packdiff
23cabal.project.packdiff
25−cabal.project.streamly
26cabal.project.Werror
24cabal.project.Werror
27cabal.project.Werror-nocode
25cabal.project.Werror-nocode
28−core/
26+cabal.project.902
29default.nix
27default.nix
30examples/README.md
28examples/README.md
31hie.yaml
29hie.yaml
CHANGELOG.md+1−1
@@ -1 +1 @@
1−docs/User/Project/Changelog.md
1+docs/User/ProjectRelated/Changelog.md
LICENSE+254
@@ -26,6 +26,172 @@ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
26OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28
28
29+-------------------------------------------------------------------------------
30+base-4.12.0.0 (http://hackage.haskell.org/package/base-4.12.0.0)
31+-------------------------------------------------------------------------------
32+This library (libraries/base) is derived from code from several
33+sources:
34+
35+ * Code from the GHC project which is largely (c) The University of
36+ Glasgow, and distributable under a BSD-style license (see below),
37+
38+ * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
39+ and freely redistributable (but see the full license for
40+ restrictions).
41+
42+ * Code from the Haskell Foreign Function Interface specification,
43+ which is (c) Manuel M. T. Chakravarty and freely redistributable
44+ (but see the full license for restrictions).
45+
46+The full text of these licenses is reproduced below. All of the
47+licenses are BSD-style or compatible.
48+
49+The Glasgow Haskell Compiler License
50+
51+Copyright 2004, The University Court of the University of Glasgow.
52+All rights reserved.
53+
54+Redistribution and use in source and binary forms, with or without
55+modification, are permitted provided that the following conditions are met:
56+
57+- Redistributions of source code must retain the above copyright notice,
58+this list of conditions and the following disclaimer.
59+
60+- Redistributions in binary form must reproduce the above copyright notice,
61+this list of conditions and the following disclaimer in the documentation
62+and/or other materials provided with the distribution.
63+
64+- Neither name of the University nor the names of its contributors may be
65+used to endorse or promote products derived from this software without
66+specific prior written permission.
67+
68+THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
69+GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
70+INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
71+FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
72+UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
73+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
74+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
75+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
76+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
77+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
78+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
79+DAMAGE.
80+
81+Code derived from the document "Report on the Programming Language
82+Haskell 98", is distributed under the following license:
83+
84+ Copyright (c) 2002 Simon Peyton Jones
85+
86+ The authors intend this Report to belong to the entire Haskell
87+ community, and so we grant permission to copy and distribute it for
88+ any purpose, provided that it is reproduced in its entirety,
89+ including this Notice. Modified versions of this Report may also be
90+ copied and distributed for any purpose, provided that the modified
91+ version is clearly presented as such, and that it does not claim to
92+ be a definition of the Haskell 98 Language.
93+
94+Code derived from the document "The Haskell 98 Foreign Function
95+Interface, An Addendum to the Haskell 98 Report" is distributed under
96+the following license:
97+
98+ Copyright (c) 2002 Manuel M. T. Chakravarty
99+
100+ The authors intend this Report to belong to the entire Haskell
101+ community, and so we grant permission to copy and distribute it for
102+ any purpose, provided that it is reproduced in its entirety,
103+ including this Notice. Modified versions of this Report may also be
104+ copied and distributed for any purpose, provided that the modified
105+ version is clearly presented as such, and that it does not claim to
106+ be a definition of the Haskell 98 Foreign Function Interface.
107+
108+-------------------------------------------------------------------------------
109+bjoern-2008-2009 (http://bjoern.hoehrmann.de/utf-8/decoder/dfa/)
110+-------------------------------------------------------------------------------
111+Copyright (c) 2008-2009 Bjoern Hoehrmann <bjoern@hoehrmann.de>
112+
113+Permission is hereby granted, free of charge, to any person obtaining a copy of
114+this software and associated documentation files (the "Software"), to deal in
115+the Software without restriction, including without limitation the rights to
116+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
117+of the Software, and to permit persons to whom the Software is furnished to do
118+so, subject to the following conditions:
119+
120+The above copyright notice and this permission notice shall be included in all
121+copies or substantial portions of the Software.
122+
123+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
124+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
125+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
126+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
127+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
128+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
129+SOFTWARE.
130+
131+-------------------------------------------------------------------------------
132+clock-0.7.2 (http://hackage.haskell.org/package/clock-0.7.2)
133+-------------------------------------------------------------------------------
134+Copyright (c) 2009-2012, Cetin Sert
135+Copyright (c) 2010, Eugene Kirpichov
136+
137+All rights reserved.
138+
139+Redistribution and use in source and binary forms, with or without
140+modification, are permitted provided that the following conditions are
141+met:
142+
143+ * Redistributions of source code must retain the above copyright
144+ notice, this list of conditions and the following disclaimer.
145+
146+ * Redistributions in binary form must reproduce the above
147+ copyright notice, this list of conditions and the following
148+ disclaimer in the documentation and/or other materials provided
149+ with the distribution.
150+
151+ * The names of contributors may not be used to endorse or promote
152+ products derived from this software without specific prior
153+ written permission.
154+
155+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
156+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
157+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
158+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
159+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
160+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
161+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
162+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
163+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
164+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
165+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
166+
167+-------------------------------------------------------------------------------
168+foldl-1.4.5 (http://hackage.haskell.org/package/foldl-1.4.5)
169+-------------------------------------------------------------------------------
170+Copyright (c) 2013 Gabriel Gonzalez
171+All rights reserved.
172+
173+Redistribution and use in source and binary forms, with or without modification,
174+are permitted provided that the following conditions are met:
175+ * Redistributions of source code must retain the above copyright notice,
176+ this list of conditions and the following disclaimer.
177+ * Redistributions in binary form must reproduce the above copyright notice,
178+ this list of conditions and the following disclaimer in the documentation
179+ and/or other materials provided with the distribution.
180+ * Neither the name of Gabriel Gonzalez nor the names of other contributors
181+ may be used to endorse or promote products derived from this software
182+ without specific prior written permission.
183+
184+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
185+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
186+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
187+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
188+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
189+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
190+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
191+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
192+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
193+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
194+
29-------------------------------------------------------------------------------
195-------------------------------------------------------------------------------
30fsnotify-0.3.0.1 (http://hackage.haskell.org/package/fsnotify-0.3.0.1/)
196fsnotify-0.3.0.1 (http://hackage.haskell.org/package/fsnotify-0.3.0.1/)
31-------------------------------------------------------------------------------
197-------------------------------------------------------------------------------
@@ -93,3 +259,91 @@ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
93THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
259THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
94(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
260(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
95OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
261OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
262+
263+-------------------------------------------------------------------------------
264+primitive-0.7.0.0 (https://hackage.haskell.org/package/primitive-0.7.0.0)
265+-------------------------------------------------------------------------------
266+Copyright (c) 2008-2009, Roman Leshchinskiy
267+All rights reserved.
268+
269+Redistribution and use in source and binary forms, with or without
270+modification, are permitted provided that the following conditions are met:
271+
272+- Redistributions of source code must retain the above copyright notice,
273+this list of conditions and the following disclaimer.
274+
275+- Redistributions in binary form must reproduce the above copyright notice,
276+this list of conditions and the following disclaimer in the documentation
277+and/or other materials provided with the distribution.
278+
279+- Neither name of the University nor the names of its contributors may be
280+used to endorse or promote products derived from this software without
281+specific prior written permission.
282+
283+THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
284+GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
285+INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
286+FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
287+UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
288+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
289+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
290+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
291+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
292+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
293+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
294+DAMAGE.
295+
296+-------------------------------------------------------------------------------
297+transient-0.5.5 (http://hackage.haskell.org/package/transient-0.5.5)
298+-------------------------------------------------------------------------------
299+Copyright © 2014-2016 Alberto G. Corona <https://github.com/agocorona>
300+
301+Permission is hereby granted, free of charge, to any person obtaining a copy of
302+this software and associated documentation files (the "Software"), to deal in
303+the Software without restriction, including without limitation the rights to
304+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
305+the Software, and to permit persons to whom the Software is furnished to do so,
306+subject to the following conditions:
307+
308+The above copyright notice and this permission notice shall be included in all
309+copies or substantial portions of the Software.
310+
311+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
312+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
313+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
314+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
315+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
316+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
317+
318+-------------------------------------------------------------------------------
319+vector-0.12.0.2 (http://hackage.haskell.org/package/vector-0.12.0.2)
320+-------------------------------------------------------------------------------
321+Copyright (c) 2008-2012, Roman Leshchinskiy
322+All rights reserved.
323+
324+Redistribution and use in source and binary forms, with or without
325+modification, are permitted provided that the following conditions are met:
326+
327+- Redistributions of source code must retain the above copyright notice,
328+this list of conditions and the following disclaimer.
329+
330+- Redistributions in binary form must reproduce the above copyright notice,
331+this list of conditions and the following disclaimer in the documentation
332+and/or other materials provided with the distribution.
333+
334+- Neither name of the University nor the names of its contributors may be
335+used to endorse or promote products derived from this software without
336+specific prior written permission.
337+
338+THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
339+GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
340+INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
341+FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
342+UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
343+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
344+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
345+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
346+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
347+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
348+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
349+DAMAGE.
README.md+1−1
@@ -1 +1 @@
1−docs/User/Project/README.md
1+docs/User/Tutorials/Introduction.md
appveyor.yml−2
@@ -14,8 +14,6 @@ environment:
14 # ------------------------------------------------------------------------
14 # ------------------------------------------------------------------------
15 # Common options
15 # Common options
16 # ------------------------------------------------------------------------
16 # ------------------------------------------------------------------------
17− # GHC 9.2.7 onwards redundant constraint warnings are incompatible with
18− # older versions
19 GHC_OPTIONS: "-Werror"
17 GHC_OPTIONS: "-Werror"
20 CABAL_REINIT_CONFIG: "y"
18 CABAL_REINIT_CONFIG: "y"
21 LC_ALL: "C.UTF-8"
19 LC_ALL: "C.UTF-8"
benchmark/NanoBenchmarks.hs+22−27
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-------------------------------------------------------------------------------
1-------------------------------------------------------------------------------
4-- Investigate specific benchmarks more closely in isolation, possibly looking
2-- Investigate specific benchmarks more closely in isolation, possibly looking
5-- at GHC generated code for optimizing specific problematic cases.
3-- at GHC generated code for optimizing specific problematic cases.
@@ -8,27 +6,30 @@
8{-# LANGUAGE FlexibleContexts #-}
6{-# LANGUAGE FlexibleContexts #-}
9{-# LANGUAGE ScopedTypeVariables #-}
7{-# LANGUAGE ScopedTypeVariables #-}
10
8
11−import Data.Char (ord)
9+import Streamly.Prelude (SerialT)
12−import Streamly.Internal.Data.Stream (Stream)
10+import Streamly.Internal.Data.SVar (MonadAsync)
13−import System.IO (hSeek, SeekMode(..), openFile, IOMode(..))
14
11
15−import qualified Streamly.Data.Array as A
12+import qualified Streamly.Data.Array.Unboxed as A
13+import qualified Streamly.FileSystem.Handle as FH
16import qualified Streamly.Internal.FileSystem.Handle as IFH
14import qualified Streamly.Internal.FileSystem.Handle as IFH
17import qualified Streamly.Data.Fold as FL
15import qualified Streamly.Data.Fold as FL
18−import qualified Streamly.Internal.Data.Stream as S
19import qualified Streamly.Internal.Data.Stream.IsStream as Internal
16import qualified Streamly.Internal.Data.Stream.IsStream as Internal
17+import qualified Streamly.Prelude as S
18+import qualified Streamly.Internal.Data.Stream.StreamK as K
20
19
21−import Test.Tasty.Bench
20+import Data.Char (ord)
21+import Gauge
22+import System.IO (hSeek, SeekMode(..), openFile, IOMode(..))
22import System.Random
23import System.Random
23
24
24maxValue :: Int
25maxValue :: Int
25maxValue = 100000
26maxValue = 100000
26
27
27−drain :: Monad m => S.Stream m a -> m ()
28+-- type Stream = K.Stream
28−drain = S.fold FL.drain
29+type Stream = SerialT
29
30
30{-# INLINE sourceUnfoldrM #-}
31{-# INLINE sourceUnfoldrM #-}
31−sourceUnfoldrM :: Monad m => Stream m Int
32+sourceUnfoldrM :: MonadAsync m => Stream m Int
32sourceUnfoldrM = S.unfoldrM step 0
33sourceUnfoldrM = S.unfoldrM step 0
33 where
34 where
34 step cnt =
35 step cnt =
@@ -37,7 +38,7 @@ sourceUnfoldrM = S.unfoldrM step 0
37 else return (Just (cnt, cnt + 1))
38 else return (Just (cnt, cnt + 1))
38
39
39{-# INLINE sourceUnfoldrMN #-}
40{-# INLINE sourceUnfoldrMN #-}
40−sourceUnfoldrMN :: Monad m => Int -> Stream m Int
41+sourceUnfoldrMN :: MonadAsync m => Int -> Stream m Int
41sourceUnfoldrMN n = S.unfoldrM step n
42sourceUnfoldrMN n = S.unfoldrM step n
42 where
43 where
43 step cnt =
44 step cnt =
@@ -66,7 +67,7 @@ takeAllDropOne = S.drop 1 . S.take maxValue
66
67
67{-# INLINE takeDrop #-}
68{-# INLINE takeDrop #-}
68takeDrop :: Monad m => Stream m Int -> m ()
69takeDrop :: Monad m => Stream m Int -> m ()
69−takeDrop = drain .
70+takeDrop = S.drain .
70 takeAllDropOne . takeAllDropOne . takeAllDropOne . takeAllDropOne
71 takeAllDropOne . takeAllDropOne . takeAllDropOne . takeAllDropOne
71
72
72-------------------------------------------------------------------------------
73-------------------------------------------------------------------------------
@@ -81,7 +82,7 @@ dropWhileFalse = S.dropWhile (> maxValue)
81
82
82{-# INLINE dropWhileFalseX4 #-}
83{-# INLINE dropWhileFalseX4 #-}
83dropWhileFalseX4 :: Monad m => Stream m Int -> m ()
84dropWhileFalseX4 :: Monad m => Stream m Int -> m ()
84−dropWhileFalseX4 = drain
85+dropWhileFalseX4 = S.drain
85 . dropWhileFalse . dropWhileFalse . dropWhileFalse . dropWhileFalse
86 . dropWhileFalse . dropWhileFalse . dropWhileFalse . dropWhileFalse
86
87
87-------------------------------------------------------------------------------
88-------------------------------------------------------------------------------
@@ -90,7 +91,7 @@ dropWhileFalseX4 = drain
90
91
91{-# INLINE iterateSource #-}
92{-# INLINE iterateSource #-}
92iterateSource
93iterateSource
93− :: Monad m
94+ :: MonadAsync m
94 => (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
95 => (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
95iterateSource g i n = f i (sourceUnfoldrMN n)
96iterateSource g i n = f i (sourceUnfoldrMN n)
96 where
97 where
@@ -102,26 +103,20 @@ iterateSource g i n = f i (sourceUnfoldrMN n)
102main :: IO ()
103main :: IO ()
103main = do
104main = do
104 defaultMain [bench "unfoldr" $ nfIO $
105 defaultMain [bench "unfoldr" $ nfIO $
105− randomRIO (1,1) >>= \n -> drain (sourceUnfoldr n)]
106+ randomRIO (1,1) >>= \n -> S.drain (sourceUnfoldr n)]
106 defaultMain [bench "take-drop" $ nfIO $ takeDrop sourceUnfoldrM]
107 defaultMain [bench "take-drop" $ nfIO $ takeDrop sourceUnfoldrM]
107 defaultMain [bench "dropWhileFalseX4" $
108 defaultMain [bench "dropWhileFalseX4" $
108 nfIO $ dropWhileFalseX4 sourceUnfoldrM]
109 nfIO $ dropWhileFalseX4 sourceUnfoldrM]
109 defaultMain [bench "iterate-mapM" $
110 defaultMain [bench "iterate-mapM" $
110− nfIO $ drain $ iterateSource (S.mapM return) 100000 10]
111+ nfIO $ S.drain $ iterateSource (S.mapM return) 100000 10]
111
112
112 inText <- openFile "benchmark/text-processing/gutenberg-500.txt" ReadMode
113 inText <- openFile "benchmark/text-processing/gutenberg-500.txt" ReadMode
113 defaultMain [mkBenchText "splitOn abc...xyz" inText $ do
114 defaultMain [mkBenchText "splitOn abc...xyz" inText $ do
114− S.fold FL.length
115− (Internal.splitOnSeq
115+ (S.length $ Internal.splitOnSeq (A.fromList $ map (fromIntegral . ord)
116− (A.fromList
117− $ map (fromIntegral . ord) "abcdefghijklmnopqrstuvwxyz"
116+ "abcdefghijklmnopqrstuvwxyz") FL.drain
118− )
119− FL.drain
120− $ IFH.read inText
117+ $ IFH.getBytes inText) >>= print
121− )
122− >>= print
123 ]
118 ]
124 where
119 where
125
120
126 mkBenchText name h action =
121 mkBenchText name h action =
127− env (hSeek h AbsoluteSeek 0) (\_ -> bench name $ nfIO action)
122+ bench name $ perRunEnv (hSeek h AbsoluteSeek 0) (\_ -> action)
benchmark/Streamly/Benchmark/Data/Array.hs+4−33
@@ -1,6 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−{-# OPTIONS_GHC -Wno-orphans #-}
3−
4{-# LANGUAGE CPP #-}
1{-# LANGUAGE CPP #-}
5
2
6#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
3#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
@@ -8,31 +5,18 @@
8import Control.DeepSeq (deepseq)
5import Control.DeepSeq (deepseq)
9
6
10import qualified Streamly.Internal.Data.Array as IA
7import qualified Streamly.Internal.Data.Array as IA
11−import qualified GHC.Exts as GHC
12−
13−-- import qualified Streamly.Data.Array as A
14import qualified Streamly.Internal.Data.Array as A
8import qualified Streamly.Internal.Data.Array as A
15−
16type Stream = A.Array
9type Stream = A.Array
17
10
18#include "Streamly/Benchmark/Data/Array/Common.hs"
11#include "Streamly/Benchmark/Data/Array/Common.hs"
19
12
20−instance NFData (A.Array a) where
21− {-# INLINE rnf #-}
22− rnf _ = ()
23−
24-------------------------------------------------------------------------------
13-------------------------------------------------------------------------------
25-- Benchmark helpers
14-- Benchmark helpers
26-------------------------------------------------------------------------------
15-------------------------------------------------------------------------------
27
16
28−-- Drain a source that generates a pure array
29−{-# INLINE benchPureSrc #-}
30−benchPureSrc :: String -> (Int -> Stream a) -> Benchmark
31−benchPureSrc name src = benchPure name src id
32−
33-- Drain a source that generates an array in the IO monad
17-- Drain a source that generates an array in the IO monad
34{-# INLINE benchIOSrc #-}
18{-# INLINE benchIOSrc #-}
35−benchIOSrc :: String -> (Int -> IO (Stream a)) -> Benchmark
19+benchIOSrc :: NFData a => String -> (Int -> IO (Stream a)) -> Benchmark
36benchIOSrc name src = benchIO name src id
20benchIOSrc name src = benchIO name src id
37
21
38-------------------------------------------------------------------------------
22-------------------------------------------------------------------------------
@@ -43,6 +27,7 @@ benchIOSrc name src = benchIO name src id
43sourceIntFromToFromList :: MonadIO m => Int -> Int -> m (Stream Int)
27sourceIntFromToFromList :: MonadIO m => Int -> Int -> m (Stream Int)
44sourceIntFromToFromList value n = P.return $ A.fromListN value [n..n + value]
28sourceIntFromToFromList value n = P.return $ A.fromListN value [n..n + value]
45
29
30+
46{-# INLINE readInstance #-}
31{-# INLINE readInstance #-}
47readInstance :: P.String -> Stream Int
32readInstance :: P.String -> Stream Int
48readInstance str =
33readInstance str =
@@ -63,14 +48,6 @@ foldableSum = P.sum
63-}
48-}
64#endif
49#endif
65
50
66−{-# INLINE sourceIsList #-}
67−sourceIsList :: Int -> Int -> Stream Int
68−sourceIsList value n = GHC.fromList [n..n+value]
69−
70−{-# INLINE sourceIsString #-}
71−sourceIsString :: Int -> Int -> Stream P.Char
72−sourceIsString value n = GHC.fromString (P.replicate (n + value) 'a')
73−
74{-# INLINE sourceIntFromToFromStream #-}
51{-# INLINE sourceIntFromToFromStream #-}
75sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
52sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
76sourceIntFromToFromStream value n = S.fold A.write $ S.enumerateFromTo n (n + value)
53sourceIntFromToFromStream value n = S.fold A.write $ S.enumerateFromTo n (n + value)
@@ -84,21 +61,15 @@ o_1_space_generation value =
84 [ bgroup
61 [ bgroup
85 "generation"
62 "generation"
86 [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
63 [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
87− , let testStr = "fromList " ++ mkListString value
64+ , let testStr = mkListString value
88 in testStr `deepseq` bench "read" (nf readInstance testStr)
65 in testStr `deepseq` bench "read" (nf readInstance testStr)
89− , benchPureSrc "writeN . IsList.fromList" (sourceIsList value)
90− , benchPureSrc
91− "writeN . IsString.fromString"
92− (sourceIsString value)
93−
94 ]
66 ]
95 ]
67 ]
96
68
97o_1_space_elimination :: Int -> [Benchmark]
69o_1_space_elimination :: Int -> [Benchmark]
98o_1_space_elimination value =
70o_1_space_elimination value =
99 [ bgroup "elimination"
71 [ bgroup "elimination"
100− [ benchPureSink value "length . IsList.toList" (length . GHC.toList)
101− , benchFold "writeLastN.1"
72+ [ benchFold "writeLastN.1"
102 (S.fold (IA.writeLastN 1)) (P.sourceUnfoldrM value)
73 (S.fold (IA.writeLastN 1)) (P.sourceUnfoldrM value)
103 , benchFold "writeLastN.10"
74 , benchFold "writeLastN.10"
104 (S.fold (IA.writeLastN 10)) (P.sourceUnfoldrM value)
75 (S.fold (IA.writeLastN 10)) (P.sourceUnfoldrM value)
benchmark/Streamly/Benchmark/Data/Array/Common.hs+11−8
@@ -1,3 +1,5 @@
1+
2+
1-------------------------------------------------------------------------------
3-------------------------------------------------------------------------------
2-- Benchmark helpers
4-- Benchmark helpers
3-------------------------------------------------------------------------------
5-------------------------------------------------------------------------------
@@ -66,14 +68,14 @@ scanl' , scanl1', map
66
68
67{-# INLINE onArray #-}
69{-# INLINE onArray #-}
68onArray
70onArray
69− :: MonadIO m => Int -> (Stream.Stream m Int -> Stream.Stream m Int)
71+ :: MonadIO m => Int -> (S.SerialT m Int -> S.SerialT m Int)
70 -> Stream Int
72 -> Stream Int
71 -> m (Stream Int)
73 -> m (Stream Int)
72−onArray value f arr = S.fold (A.writeN value) $ f $ S.unfold A.reader arr
74+onArray value f arr = S.fold (A.writeN value) $ f $ S.unfold A.read arr
73
75
74−scanl' value n = composeN n $ onArray value $ S.scan (Fold.foldl' (+) 0)
76+scanl' value n = composeN n $ onArray value $ S.scanl' (+) 0
75−scanl1' value n = composeN n $ onArray value $ Stream.scanl1' (+)
77+scanl1' value n = composeN n $ onArray value $ S.scanl1' (+)
76−map value n = composeN n $ onArray value $ fmap (+1)
78+map value n = composeN n $ onArray value $ S.map (+1)
77-- map n = composeN n $ A.map (+1)
79-- map n = composeN n $ A.map (+1)
78
80
79{-# INLINE eqInstance #-}
81{-# INLINE eqInstance #-}
@@ -98,7 +100,8 @@ showInstance = P.show
98
100
99{-# INLINE pureFoldl' #-}
101{-# INLINE pureFoldl' #-}
100pureFoldl' :: MonadIO m => Stream Int -> m Int
102pureFoldl' :: MonadIO m => Stream Int -> m Int
101−pureFoldl' = S.fold (Fold.foldl' (+) 0) . S.unfold A.reader
103+pureFoldl' = S.foldl' (+) 0 . S.unfold A.read
104+
102
105
103-------------------------------------------------------------------------------
106-------------------------------------------------------------------------------
104-- Elimination
107-- Elimination
@@ -106,11 +109,11 @@ pureFoldl' = S.fold (Fold.foldl' (+) 0) . S.unfold A.reader
106
109
107{-# INLINE unfoldReadDrain #-}
110{-# INLINE unfoldReadDrain #-}
108unfoldReadDrain :: MonadIO m => Stream Int -> m ()
111unfoldReadDrain :: MonadIO m => Stream Int -> m ()
109−unfoldReadDrain = S.fold Fold.drain . S.unfold A.reader
112+unfoldReadDrain = S.drain . S.unfold A.read
110
113
111{-# INLINE toStreamRevDrain #-}
114{-# INLINE toStreamRevDrain #-}
112toStreamRevDrain :: MonadIO m => Stream Int -> m ()
115toStreamRevDrain :: MonadIO m => Stream Int -> m ()
113−toStreamRevDrain = S.fold Fold.drain . A.readRev
116+toStreamRevDrain = S.drain . A.toStreamRev
114
117
115-------------------------------------------------------------------------------
118-------------------------------------------------------------------------------
116-- Bench groups
119-- Bench groups
benchmark/Streamly/Benchmark/Data/Array/CommonImports.hs+8−7
@@ -1,16 +1,17 @@
1{-# LANGUAGE FlexibleContexts #-}
1{-# LANGUAGE FlexibleContexts #-}
2
2
3import Control.DeepSeq (NFData(..))
3import Control.DeepSeq (NFData(..))
4−import Control.Monad.IO.Class (MonadIO)
5−import Data.Functor ((<&>))
6import System.Random (randomRIO)
4import System.Random (randomRIO)
7
5
8−import qualified Streamly.Data.Fold as Fold
6+import qualified Streamly.Prelude as S
9−import qualified Streamly.Data.Stream as S
10−import qualified Streamly.Internal.Data.Stream as Stream
11
7
12−import Test.Tasty.Bench
8+import Gauge
13import Streamly.Benchmark.Common hiding (benchPureSrc)
9import Streamly.Benchmark.Common hiding (benchPureSrc)
14−import qualified Stream.Common as P
10+import qualified Streamly.Benchmark.Prelude as P
11+
12+
13+import Control.Monad.IO.Class (MonadIO)
15
14
16import Prelude as P hiding (map)
15import Prelude as P hiding (map)
16+
17+import Data.Functor ((<&>))
benchmark/Streamly/Benchmark/Data/Array/Generic.hs → benchmark/Streamly/Benchmark/Data/Array/Foreign.hsrenamed+28−15
@@ -1,30 +1,30 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−{-# OPTIONS_GHC -Wno-orphans #-}
3−
4{-# LANGUAGE CPP #-}
1{-# LANGUAGE CPP #-}
5
2
6#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
3#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
7
4
8import Control.DeepSeq (deepseq)
5import Control.DeepSeq (deepseq)
9
6
10−import qualified Streamly.Internal.Data.Array.Generic as IA
7+import qualified Streamly.Internal.Data.Array.Unboxed as IA
11−import qualified Streamly.Internal.Data.Array.Generic as A
8+import qualified GHC.Exts as GHC
12
9
10+import qualified Streamly.Data.Array.Unboxed as A
11+import qualified Streamly.Internal.Data.Array.Unboxed as A
13type Stream = A.Array
12type Stream = A.Array
14
13
15#include "Streamly/Benchmark/Data/Array/Common.hs"
14#include "Streamly/Benchmark/Data/Array/Common.hs"
16
15
17−instance NFData a => NFData (A.Array a) where
18− {-# INLINE rnf #-}
19− rnf = A.foldl' (\_ x -> rnf x) ()
20−
21-------------------------------------------------------------------------------
16-------------------------------------------------------------------------------
22-- Benchmark helpers
17-- Benchmark helpers
23-------------------------------------------------------------------------------
18-------------------------------------------------------------------------------
24
19
20+-- Drain a source that generates a pure array
21+{-# INLINE benchPureSrc #-}
22+benchPureSrc :: String -> (Int -> Stream a) -> Benchmark
23+benchPureSrc name src = benchPure name src id
24+
25-- Drain a source that generates an array in the IO monad
25-- Drain a source that generates an array in the IO monad
26{-# INLINE benchIOSrc #-}
26{-# INLINE benchIOSrc #-}
27−benchIOSrc :: NFData a => String -> (Int -> IO (Stream a)) -> Benchmark
27+benchIOSrc :: String -> (Int -> IO (Stream a)) -> Benchmark
28benchIOSrc name src = benchIO name src id
28benchIOSrc name src = benchIO name src id
29
29
30-------------------------------------------------------------------------------
30-------------------------------------------------------------------------------
@@ -55,10 +55,17 @@ foldableSum = P.sum
55-}
55-}
56#endif
56#endif
57
57
58+{-# INLINE sourceIsList #-}
59+sourceIsList :: Int -> Int -> Stream Int
60+sourceIsList value n = GHC.fromList [n..n+value]
61+
62+{-# INLINE sourceIsString #-}
63+sourceIsString :: Int -> Int -> Stream P.Char
64+sourceIsString value n = GHC.fromString (P.replicate (n + value) 'a')
65+
58{-# INLINE sourceIntFromToFromStream #-}
66{-# INLINE sourceIntFromToFromStream #-}
59sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
67sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
60−sourceIntFromToFromStream value n =
61− S.fold A.write $ S.enumerateFromTo n (n + value)
68+sourceIntFromToFromStream value n = S.fold A.write $ S.enumerateFromTo n (n + value)
62
69
63-------------------------------------------------------------------------------
70-------------------------------------------------------------------------------
64-- Bench groups
71-- Bench groups
@@ -69,15 +76,21 @@ o_1_space_generation value =
69 [ bgroup
76 [ bgroup
70 "generation"
77 "generation"
71 [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
78 [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
72− , let testStr = "fromList " ++ mkListString value
79+ , let testStr = mkListString value
73 in testStr `deepseq` bench "read" (nf readInstance testStr)
80 in testStr `deepseq` bench "read" (nf readInstance testStr)
81+ , benchPureSrc "writeN . IsList.fromList" (sourceIsList value)
82+ , benchPureSrc
83+ "writeN . IsString.fromString"
84+ (sourceIsString value)
85+
74 ]
86 ]
75 ]
87 ]
76
88
77o_1_space_elimination :: Int -> [Benchmark]
89o_1_space_elimination :: Int -> [Benchmark]
78o_1_space_elimination value =
90o_1_space_elimination value =
79 [ bgroup "elimination"
91 [ bgroup "elimination"
92+ [ benchPureSink value "length . IsList.toList" (length . GHC.toList)
80− [ benchFold "writeLastN.1"
93+ , benchFold "writeLastN.1"
81 (S.fold (IA.writeLastN 1)) (P.sourceUnfoldrM value)
94 (S.fold (IA.writeLastN 1)) (P.sourceUnfoldrM value)
82 , benchFold "writeLastN.10"
95 , benchFold "writeLastN.10"
83 (S.fold (IA.writeLastN 10)) (P.sourceUnfoldrM value)
96 (S.fold (IA.writeLastN 10)) (P.sourceUnfoldrM value)
@@ -101,7 +114,7 @@ o_n_heap_serial value =
101 ]
114 ]
102
115
103moduleName :: String
116moduleName :: String
104−moduleName = "Data.Array.Generic"
117+moduleName = "Data.Array.Foreign"
105
118
106defStreamSize :: Int
119defStreamSize :: Int
107defStreamSize = defaultStreamSize
120defStreamSize = defaultStreamSize
benchmark/Streamly/Benchmark/Data/MutArray.hs → benchmark/Streamly/Benchmark/Data/Array/Foreign/Mut.hsrenamed+25−35
@@ -1,8 +1,5 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−{-# OPTIONS_GHC -Wno-orphans #-}
3−
4-- |
1-- |
5−-- Module : Streamly.Benchmark.Data.Array.Unboxed.Mut
2+-- Module : Streamly.Benchmark.Data.Array.Foreign.Mut
6-- Copyright : (c) 2021 Composewell Technologies
3-- Copyright : (c) 2021 Composewell Technologies
7-- License : BSD-3-Clause
4-- License : BSD-3-Clause
8-- Maintainer : streamly@composewell.com
5-- Maintainer : streamly@composewell.com
@@ -23,6 +20,7 @@
23import Control.DeepSeq (NFData(..))
20import Control.DeepSeq (NFData(..))
24import Control.Monad.IO.Class (MonadIO)
21import Control.Monad.IO.Class (MonadIO)
25import Data.Functor ((<&>))
22import Data.Functor ((<&>))
23+import Streamly.Prelude (MonadAsync, SerialT, IsStream)
26import System.Random (randomRIO)
24import System.Random (randomRIO)
27import Prelude
25import Prelude
28 ( IO
26 ( IO
@@ -38,25 +36,19 @@ import Prelude
38 , (||)
36 , (||)
39 , concat
37 , concat
40 , const
38 , const
41− , fmap
42 , id
39 , id
43 , undefined
40 , undefined
44 )
41 )
45−import Streamly.Internal.Data.MutArray (MutArray)
46
42
47−import qualified Streamly.Internal.Data.Array as Array
43+import qualified Streamly.Internal.Data.Array.Unboxed as Array
48−import qualified Streamly.Internal.Data.MutArray as MArray
44+import qualified Streamly.Internal.Data.Array.Unboxed.Mut as MArray
49−import qualified Streamly.Internal.Data.Fold as Fold
45+import qualified Streamly.Internal.Data.Stream.Type as Stream
50−import qualified Streamly.Internal.Data.Stream as Stream
46+import qualified Streamly.Prelude as Stream
51
47
52−import Test.Tasty.Bench
48+import Gauge
53import Streamly.Benchmark.Common hiding (benchPureSrc)
49import Streamly.Benchmark.Common hiding (benchPureSrc)
54
50
55−type Stream = MutArray
51+type Stream = MArray.Array
56−
57−instance NFData (MutArray a) where
58− {-# INLINE rnf #-}
59− rnf _ = ()
60
52
61-------------------------------------------------------------------------------
53-------------------------------------------------------------------------------
62-- Benchmark helpers
54-- Benchmark helpers
@@ -85,9 +77,6 @@ benchIOSink value name = benchIO' name (sourceIntFromTo value)
85benchIOSrc :: String -> (Int -> IO (Stream a)) -> Benchmark
77benchIOSrc :: String -> (Int -> IO (Stream a)) -> Benchmark
86benchIOSrc name src = benchIO name src id
78benchIOSrc name src = benchIO name src id
87
79
88−drain :: Monad m => Stream.Stream m a -> m ()
89−drain = Stream.fold Fold.drain
90−
91-------------------------------------------------------------------------------
80-------------------------------------------------------------------------------
92-- Bench Ops
81-- Bench Ops
93-------------------------------------------------------------------------------
82-------------------------------------------------------------------------------
@@ -124,7 +113,7 @@ sourceIntFromToFromStream value n =
124 Stream.fold MArray.write $ Stream.enumerateFromTo n (n + value)
113 Stream.fold MArray.write $ Stream.enumerateFromTo n (n + value)
125
114
126{-# INLINE sourceUnfoldrM #-}
115{-# INLINE sourceUnfoldrM #-}
127−sourceUnfoldrM :: Monad m => Int -> Int -> Stream.Stream m Int
116+sourceUnfoldrM :: (IsStream t, MonadAsync m) => Int -> Int -> t m Int
128sourceUnfoldrM value n = Stream.unfoldrM step n
117sourceUnfoldrM value n = Stream.unfoldrM step n
129 where
118 where
130 step cnt =
119 step cnt =
@@ -149,7 +138,7 @@ composeN n f x =
149
138
150{-# INLINE scanl' #-}
139{-# INLINE scanl' #-}
151scanl' :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
140scanl' :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
152−scanl' value n = composeN n $ onArray value $ Stream.scan (Fold.foldl' (+) 0)
141+scanl' value n = composeN n $ onArray value $ Stream.scanl' (+) 0
153
142
154{-# INLINE scanl1' #-}
143{-# INLINE scanl1' #-}
155scanl1' :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
144scanl1' :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
@@ -157,15 +146,15 @@ scanl1' value n = composeN n $ onArray value $ Stream.scanl1' (+)
157
146
158{-# INLINE map #-}
147{-# INLINE map #-}
159map :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
148map :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
160−map value n = composeN n $ onArray value $ fmap (+ 1)
149+map value n = composeN n $ onArray value $ Stream.map (+ 1)
161
150
162{-# INLINE onArray #-}
151{-# INLINE onArray #-}
163onArray
152onArray
164− :: MonadIO m => Int -> (Stream.Stream m Int -> Stream.Stream m Int)
153+ :: MonadIO m => Int -> (Stream.SerialT m Int -> Stream.SerialT m Int)
165 -> Stream Int
154 -> Stream Int
166 -> m (Stream Int)
155 -> m (Stream Int)
167onArray value f arr =
156onArray value f arr =
168− Stream.fold (MArray.writeN value) $ f $ Stream.unfold MArray.reader arr
157+ Stream.fold (MArray.writeN value) $ f $ Stream.unfold MArray.read arr
169
158
170-------------------------------------------------------------------------------
159-------------------------------------------------------------------------------
171-- Elimination
160-- Elimination
@@ -173,23 +162,24 @@ onArray value f arr =
173
162
174{-# INLINE unfoldReadDrain #-}
163{-# INLINE unfoldReadDrain #-}
175unfoldReadDrain :: MonadIO m => Stream Int -> m ()
164unfoldReadDrain :: MonadIO m => Stream Int -> m ()
176−unfoldReadDrain = drain . Stream.unfold MArray.reader
165+unfoldReadDrain = Stream.drain . Stream.unfold MArray.read
177
166
178{-# INLINE unfoldReadRevDrain #-}
167{-# INLINE unfoldReadRevDrain #-}
179unfoldReadRevDrain :: MonadIO m => Stream Int -> m ()
168unfoldReadRevDrain :: MonadIO m => Stream Int -> m ()
180−unfoldReadRevDrain = drain . Stream.unfold MArray.readerRev
169+unfoldReadRevDrain = Stream.drain . Stream.unfold MArray.readRev
181
170
182{-# INLINE toStreamDRevDrain #-}
171{-# INLINE toStreamDRevDrain #-}
183toStreamDRevDrain :: MonadIO m => Stream Int -> m ()
172toStreamDRevDrain :: MonadIO m => Stream Int -> m ()
184−toStreamDRevDrain = drain . MArray.readRev
173+toStreamDRevDrain =
174+ Stream.drain . Stream.fromStreamD . MArray.toStreamDRev
185
175
186{-# INLINE toStreamDDrain #-}
176{-# INLINE toStreamDDrain #-}
187toStreamDDrain :: MonadIO m => Stream Int -> m ()
177toStreamDDrain :: MonadIO m => Stream Int -> m ()
188−toStreamDDrain = drain . MArray.read
178+toStreamDDrain = Stream.drain . Stream.fromStreamD . MArray.toStreamD
189
179
190{-# INLINE unfoldFold #-}
180{-# INLINE unfoldFold #-}
191unfoldFold :: MonadIO m => Stream Int -> m Int
181unfoldFold :: MonadIO m => Stream Int -> m Int
192−unfoldFold = Stream.fold (Fold.foldl' (+) 0) . Stream.unfold MArray.reader
182+unfoldFold = Stream.foldl' (+) 0 . Stream.unfold MArray.read
193
183
194-------------------------------------------------------------------------------
184-------------------------------------------------------------------------------
195-- Bench groups
185-- Bench groups
@@ -250,7 +240,7 @@ o_1_space_transformationX4 value =
250 ]
240 ]
251
241
252o_1_space_serial_marray ::
242o_1_space_serial_marray ::
253− Int -> (MutArray Int, Array.Array Int) -> [Benchmark]
243+ Int -> (MArray.Array Int, Array.Array Int) -> [Benchmark]
254o_1_space_serial_marray value ~(array, indices) =
244o_1_space_serial_marray value ~(array, indices) =
255 [ benchIO' "partitionBy (< 0)" (const (return array))
245 [ benchIO' "partitionBy (< 0)" (const (return array))
256 $ MArray.partitionBy (< 0)
246 $ MArray.partitionBy (< 0)
@@ -265,8 +255,8 @@ o_1_space_serial_marray value ~(array, indices) =
265 , benchIO' "strip (> 0)" (const (return array))
255 , benchIO' "strip (> 0)" (const (return array))
266 $ MArray.strip (> 0)
256 $ MArray.strip (> 0)
267 , benchIO' "modifyIndices (+ 1)" (const (return indices))
257 , benchIO' "modifyIndices (+ 1)" (const (return indices))
268− $ Stream.fold (MArray.modifyIndices array (\_idx val -> val + 1))
258+ $ Stream.fold (MArray.modifyIndices (\_idx val -> val + 1) array)
269− . Stream.unfold Array.reader
259+ . Stream.unfold Array.read
270 ]
260 ]
271
261
272-------------------------------------------------------------------------------
262-------------------------------------------------------------------------------
@@ -274,7 +264,7 @@ o_1_space_serial_marray value ~(array, indices) =
274-------------------------------------------------------------------------------
264-------------------------------------------------------------------------------
275
265
276moduleName :: String
266moduleName :: String
277−moduleName = "Data.MutArray"
267+moduleName = "Data.Array.Foreign.Mut"
278
268
279main :: IO ()
269main :: IO ()
280main = do
270main = do
@@ -283,8 +273,8 @@ main = do
283 where
273 where
284
274
285 alloc value = do
275 alloc value = do
286− marr <- MArray.fromStream (sourceUnfoldrM value 0 :: Stream.Stream IO Int)
276+ marr <- MArray.fromStream (sourceUnfoldrM value 0 :: SerialT IO Int)
287− indices <- Array.fromStream (sourceUnfoldrM value 0 :: Stream.Stream IO Int)
277+ indices <- Array.fromStream (sourceUnfoldrM value 0 :: SerialT IO Int)
288 return (marr, indices)
278 return (marr, indices)
289
279
290 allBenchmarks array value =
280 allBenchmarks array value =
benchmark/Streamly/Benchmark/Data/Array/SmallArray.hs−2
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3{-# LANGUAGE CPP #-}
1{-# LANGUAGE CPP #-}
4
2
5#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
3#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
benchmark/Streamly/Benchmark/Data/Array/Stream.hs → benchmark/Streamly/Benchmark/Data/Array/Stream/Foreign.hsrenamed+44−57
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Streamly.Benchmark.Data.ParserD
2-- Module : Streamly.Benchmark.Data.ParserD
5-- Copyright : (c) 2020 Composewell Technologies
3-- Copyright : (c) 2020 Composewell Technologies
@@ -27,34 +25,31 @@ module Main
27
25
28import Control.DeepSeq (NFData(..))
26import Control.DeepSeq (NFData(..))
29import Control.Monad (void, when)
27import Control.Monad (void, when)
30−import Control.Monad.Catch (MonadCatch)
28+import Control.Monad.Catch (MonadCatch, try, SomeException)
31import Data.Functor.Identity (runIdentity)
29import Data.Functor.Identity (runIdentity)
32import Data.Maybe (isJust)
30import Data.Maybe (isJust)
33import Data.Word (Word8)
31import Data.Word (Word8)
34−import Streamly.Internal.Data.Stream (Stream)
35−import Streamly.Internal.Data.StreamK (StreamK)
36import System.IO (Handle)
32import System.IO (Handle)
37import System.Random (randomRIO)
33import System.Random (randomRIO)
38import Prelude hiding ()
34import Prelude hiding ()
39
35
40−import qualified Streamly.Data.Stream as Stream
36+import qualified Streamly.Prelude as Stream
41−import qualified Streamly.Internal.Data.Array as Array
37+import qualified Streamly.Internal.Data.Array.Unboxed as Array
42−import qualified Streamly.Internal.Data.Array.Stream as ArrayStream
38+import qualified Streamly.Internal.Data.Array.Stream.Foreign as ArrayStream
43import qualified Streamly.Internal.Data.Fold as Fold
39import qualified Streamly.Internal.Data.Fold as Fold
44import qualified Streamly.Internal.Data.Parser as Parser
40import qualified Streamly.Internal.Data.Parser as Parser
45−import qualified Streamly.Internal.Data.Stream as Stream
41+import qualified Streamly.Internal.Data.Stream.IsStream as Stream (arraysOf)
46−import qualified Streamly.Internal.Data.StreamK as StreamK
47import qualified Streamly.Internal.FileSystem.Handle as Handle
42import qualified Streamly.Internal.FileSystem.Handle as Handle
48import qualified Streamly.Internal.Unicode.Stream as Unicode
43import qualified Streamly.Internal.Unicode.Stream as Unicode
49
44
50−import Test.Tasty.Bench hiding (env)
45+import Gauge hiding (env)
46+import Streamly.Prelude (SerialT, MonadAsync, IsStream)
51import Streamly.Benchmark.Common
47import Streamly.Benchmark.Common
52import Streamly.Benchmark.Common.Handle
48import Streamly.Benchmark.Common.Handle
53−import Control.Monad.IO.Class (MonadIO)
54
49
55#ifdef INSPECTION
50#ifdef INSPECTION
56−import Streamly.Internal.Data.MutByteArray (Unbox)
51+import Streamly.Internal.Data.Unboxed (Unboxed)
57−import Streamly.Internal.Data.Stream (Step(..))
52+import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
58import Test.Inspection
53import Test.Inspection
59#endif
54#endif
60
55
@@ -65,7 +60,7 @@ import Test.Inspection
65-- XXX these can be moved to the common module
60-- XXX these can be moved to the common module
66
61
67{-# INLINE sourceUnfoldrM #-}
62{-# INLINE sourceUnfoldrM #-}
68−sourceUnfoldrM :: MonadIO m => Int -> Int -> Stream.Stream m Int
63+sourceUnfoldrM :: (IsStream t, MonadAsync m) => Int -> Int -> t m Int
69sourceUnfoldrM value n = Stream.unfoldrM step n
64sourceUnfoldrM value n = Stream.unfoldrM step n
70 where
65 where
71 step cnt =
66 step cnt =
@@ -76,7 +71,7 @@ sourceUnfoldrM value n = Stream.unfoldrM step n
76{-# INLINE benchIO #-}
71{-# INLINE benchIO #-}
77benchIO
72benchIO
78 :: NFData b
73 :: NFData b
79− => String -> (Int -> Stream IO a) -> (Stream IO a -> IO b) -> Benchmark
74+ => String -> (Int -> t IO a) -> (t IO a -> IO b) -> Benchmark
80benchIO name src sink =
75benchIO name src sink =
81 bench name $ nfIO $ randomRIO (1,1) >>= sink . src
76 bench name $ nfIO $ randomRIO (1,1) >>= sink . src
82
77
@@ -87,7 +82,7 @@ benchIO name src sink =
87-- | Get the last byte from a file bytestream.
82-- | Get the last byte from a file bytestream.
88toChunksLast :: Handle -> IO (Maybe Word8)
83toChunksLast :: Handle -> IO (Maybe Word8)
89toChunksLast inh = do
84toChunksLast inh = do
90− let s = Handle.readChunks inh
85+ let s = Handle.getChunks inh
91 larr <- Stream.last s
86 larr <- Stream.last s
92 return $ case larr of
87 return $ case larr of
93 Nothing -> Nothing
88 Nothing -> Nothing
@@ -101,8 +96,8 @@ inspect $ 'toChunksLast `hasNoType` ''Step
101-- | Count the number of bytes in a file.
96-- | Count the number of bytes in a file.
102toChunksSumLengths :: Handle -> IO Int
97toChunksSumLengths :: Handle -> IO Int
103toChunksSumLengths inh =
98toChunksSumLengths inh =
104− let s = Handle.readChunks inh
99+ let s = Handle.getChunks inh
105− in Stream.fold Fold.sum (Stream.map Array.length s)
100+ in Stream.sum (Stream.map Array.length s)
106
101
107#ifdef INSPECTION
102#ifdef INSPECTION
108inspect $ hasNoTypeClasses 'toChunksSumLengths
103inspect $ hasNoTypeClasses 'toChunksSumLengths
@@ -112,8 +107,8 @@ inspect $ 'toChunksSumLengths `hasNoType` ''Step
112-- | Sum the bytes in a file.
107-- | Sum the bytes in a file.
113toChunksCountBytes :: Handle -> IO Word8
108toChunksCountBytes :: Handle -> IO Word8
114toChunksCountBytes inh = do
109toChunksCountBytes inh = do
115− let foldlArr' f z = runIdentity . Stream.foldl' f z . Array.read
110+ let foldlArr' f z = runIdentity . Stream.foldl' f z . Array.toStream
116− let s = Handle.readChunks inh
111+ let s = Handle.getChunks inh
117 Stream.foldl' (\acc arr -> acc + foldlArr' (+) 0 arr) 0 s
112 Stream.foldl' (\acc arr -> acc + foldlArr' (+) 0 arr) 0 s
118
113
119#ifdef INSPECTION
114#ifdef INSPECTION
@@ -123,7 +118,7 @@ inspect $ 'toChunksCountBytes `hasNoType` ''Step
123
118
124toChunksDecodeUtf8Arrays :: Handle -> IO ()
119toChunksDecodeUtf8Arrays :: Handle -> IO ()
125toChunksDecodeUtf8Arrays =
120toChunksDecodeUtf8Arrays =
126− Stream.drain . Unicode.decodeUtf8Chunks . Handle.readChunks
121+ Stream.drain . Unicode.decodeUtf8Arrays . Handle.getChunks
127
122
128#ifdef INSPECTION
123#ifdef INSPECTION
129inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
124inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
@@ -137,9 +132,7 @@ inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
137-- | Count the number of lines in a file.
132-- | Count the number of lines in a file.
138toChunksSplitOnSuffix :: Handle -> IO Int
133toChunksSplitOnSuffix :: Handle -> IO Int
139toChunksSplitOnSuffix =
134toChunksSplitOnSuffix =
140− Stream.fold Fold.length
141− . ArrayStream.splitOnSuffix 10
135+ Stream.length . ArrayStream.splitOnSuffix 10 . Handle.getChunks
142− . Handle.readChunks
143
136
144#ifdef INSPECTION
137#ifdef INSPECTION
145inspect $ hasNoTypeClasses 'toChunksSplitOnSuffix
138inspect $ hasNoTypeClasses 'toChunksSplitOnSuffix
@@ -149,10 +142,7 @@ inspect $ 'toChunksSplitOnSuffix `hasNoType` ''Step
149-- XXX use a word splitting combinator instead of splitOn and test it.
142-- XXX use a word splitting combinator instead of splitOn and test it.
150-- | Count the number of words in a file.
143-- | Count the number of words in a file.
151toChunksSplitOn :: Handle -> IO Int
144toChunksSplitOn :: Handle -> IO Int
152−toChunksSplitOn =
153− Stream.fold Fold.length
154− . ArrayStream.splitOn 32
145+toChunksSplitOn = Stream.length . ArrayStream.splitOn 32 . Handle.getChunks
155− . Handle.readChunks
156
146
157#ifdef INSPECTION
147#ifdef INSPECTION
158inspect $ hasNoTypeClasses 'toChunksSplitOn
148inspect $ hasNoTypeClasses 'toChunksSplitOn
@@ -190,11 +180,12 @@ o_1_space_read_chunked env =
190copyChunksSplitInterposeSuffix :: Handle -> Handle -> IO ()
180copyChunksSplitInterposeSuffix :: Handle -> Handle -> IO ()
191copyChunksSplitInterposeSuffix inh outh =
181copyChunksSplitInterposeSuffix inh outh =
192 Stream.fold (Handle.write outh)
182 Stream.fold (Handle.write outh)
193− $ ArrayStream.interposeSuffix 10 . ArrayStream.splitOnSuffix 10
183+ $ ArrayStream.interposeSuffix 10
184+ $ ArrayStream.splitOnSuffix 10
194− $ Handle.readChunks inh
185+ $ Handle.getChunks inh
195
186
196#ifdef INSPECTION
187#ifdef INSPECTION
197−inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterposeSuffix [''Unbox]
188+inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterposeSuffix [''Unboxed]
198inspect $ 'copyChunksSplitInterposeSuffix `hasNoType` ''Step
189inspect $ 'copyChunksSplitInterposeSuffix `hasNoType` ''Step
199#endif
190#endif
200
191
@@ -203,12 +194,13 @@ inspect $ 'copyChunksSplitInterposeSuffix `hasNoType` ''Step
203copyChunksSplitInterpose :: Handle -> Handle -> IO ()
194copyChunksSplitInterpose :: Handle -> Handle -> IO ()
204copyChunksSplitInterpose inh outh =
195copyChunksSplitInterpose inh outh =
205 Stream.fold (Handle.write outh)
196 Stream.fold (Handle.write outh)
197+ $ ArrayStream.interpose 32
206 -- XXX this is not correct word splitting combinator
198 -- XXX this is not correct word splitting combinator
207− $ ArrayStream.interpose 32 . ArrayStream.splitOn 32
199+ $ ArrayStream.splitOn 32
208− $ Handle.readChunks inh
200+ $ Handle.getChunks inh
209
201
210#ifdef INSPECTION
202#ifdef INSPECTION
211−inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterpose [''Unbox]
203+inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterpose [''Unboxed]
212inspect $ 'copyChunksSplitInterpose `hasNoType` ''Step
204inspect $ 'copyChunksSplitInterpose `hasNoType` ''Step
213#endif
205#endif
214
206
@@ -227,7 +219,7 @@ o_1_space_copy_toChunks_group_ungroup env =
227-------------------------------------------------------------------------------
219-------------------------------------------------------------------------------
228
220
229{-# INLINE drainWhile #-}
221{-# INLINE drainWhile #-}
230−drainWhile :: MonadCatch m => (a -> Bool) -> Parser.Parser a m ()
222+drainWhile :: MonadCatch m => (a -> Bool) -> Parser.Parser m a ()
231drainWhile p = Parser.takeWhile p Fold.drain
223drainWhile p = Parser.takeWhile p Fold.drain
232
224
233-------------------------------------------------------------------------------
225-------------------------------------------------------------------------------
@@ -235,27 +227,26 @@ drainWhile p = Parser.takeWhile p Fold.drain
235-------------------------------------------------------------------------------
227-------------------------------------------------------------------------------
236
228
237{-# INLINE fold #-}
229{-# INLINE fold #-}
238−fold :: Stream IO (Array.Array Int) -> IO ()
230+fold :: SerialT IO (Array.Array Int) -> IO ()
239−fold s = void $ ArrayStream.foldBreak Fold.drain $ StreamK.fromStream s
231+fold s = void $ ArrayStream.foldBreak Fold.drain s
240
232
241{-# INLINE parse #-}
233{-# INLINE parse #-}
242−parse :: Int -> Stream IO (Array.Array Int) -> IO ()
234+parse :: Int -> SerialT IO (Array.Array Int) -> IO ()
243−parse value s =
244− void $ ArrayStream.parseBreak (drainWhile (< value)) $ StreamK.fromStream s
235+parse value s = void $ ArrayStream.parseBreak (drainWhile (< value)) s
245
236
246{-# INLINE foldBreak #-}
237{-# INLINE foldBreak #-}
247−foldBreak :: StreamK IO (Array.Array Int) -> IO ()
238+foldBreak :: SerialT IO (Array.Array Int) -> IO ()
248foldBreak s = do
239foldBreak s = do
249 (r, s1) <- ArrayStream.foldBreak Fold.one s
240 (r, s1) <- ArrayStream.foldBreak Fold.one s
250 when (isJust r) $ foldBreak s1
241 when (isJust r) $ foldBreak s1
251
242
252{-# INLINE parseBreak #-}
243{-# INLINE parseBreak #-}
253−parseBreak :: StreamK IO (Array.Array Int) -> IO ()
244+parseBreak :: SerialT IO (Array.Array Int) -> IO ()
254parseBreak s = do
245parseBreak s = do
255− r <- ArrayStream.parseBreak Parser.one s
246+ r <- try $ ArrayStream.parseBreak Parser.one s
256 case r of
247 case r of
257− (Left _, _) -> return ()
248+ Left (_ :: SomeException) -> return ()
258− (Right _, s1) -> parseBreak s1
249+ Right (_, s1) -> parseBreak s1
259
250
260o_1_space_serial_array ::
251o_1_space_serial_array ::
261 Int -> [Array.Array Int] -> [Array.Array Int] -> [Benchmark]
252 Int -> [Array.Array Int] -> [Array.Array Int] -> [Benchmark]
@@ -265,7 +256,7 @@ o_1_space_serial_array bound arraysSmall arraysBig =
265 , benchIO
256 , benchIO
266 "foldBreak (recursive, small arrays)"
257 "foldBreak (recursive, small arrays)"
267 (\_ -> Stream.fromList arraysSmall)
258 (\_ -> Stream.fromList arraysSmall)
268− (foldBreak . StreamK.fromStream)
259+ foldBreak
269 , benchIO "parse (of 100)" (\_ -> Stream.fromList arraysSmall)
260 , benchIO "parse (of 100)" (\_ -> Stream.fromList arraysSmall)
270 $ parse bound
261 $ parse bound
271 , benchIO "parse (single)" (\_ -> Stream.fromList arraysBig)
262 , benchIO "parse (single)" (\_ -> Stream.fromList arraysBig)
@@ -273,7 +264,7 @@ o_1_space_serial_array bound arraysSmall arraysBig =
273 , benchIO
264 , benchIO
274 "parseBreak (recursive, small arrays)"
265 "parseBreak (recursive, small arrays)"
275 (\_ -> Stream.fromList arraysSmall)
266 (\_ -> Stream.fromList arraysSmall)
276− (parseBreak . StreamK.fromStream)
267+ parseBreak
277 ]
268 ]
278
269
279-------------------------------------------------------------------------------
270-------------------------------------------------------------------------------
@@ -281,7 +272,7 @@ o_1_space_serial_array bound arraysSmall arraysBig =
281-------------------------------------------------------------------------------
272-------------------------------------------------------------------------------
282
273
283moduleName :: String
274moduleName :: String
284−moduleName = "Data.Array.Stream"
275+moduleName = "Data.Array.Stream.Foreign"
285
276
286main :: IO ()
277main :: IO ()
287main = do
278main = do
@@ -290,14 +281,10 @@ main = do
290
281
291 where
282 where
292
283
293− alloc value =
284+ alloc value = do
294− if value <= 0
295− then return (undefined, undefined)
296− else
297− do
298− small <- Stream.toList $ Stream.chunksOf 100 $ sourceUnfoldrM value 0
285+ small <- Stream.toList $ Stream.arraysOf 100 $ sourceUnfoldrM value 0
299− big <- Stream.toList $ Stream.chunksOf value $ sourceUnfoldrM value 0
286+ big <- Stream.toList $ Stream.arraysOf value $ sourceUnfoldrM value 0
300− return (small, big)
287+ return (small, big)
301
288
302 allBenchmarks env arrays value =
289 allBenchmarks env arrays value =
303 let (arraysSmall, arraysBig) = arrays
290 let (arraysSmall, arraysBig) = arrays
benchmark/Streamly/Benchmark/Data/Fold.hs+201−236
@@ -6,23 +6,16 @@
6-- Maintainer : streamly@composewell.com
6-- Maintainer : streamly@composewell.com
7
7
8{-# LANGUAGE FlexibleContexts #-}
8{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE FlexibleInstances #-}
10{-# LANGUAGE RankNTypes #-}
9{-# LANGUAGE RankNTypes #-}
11{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE ScopedTypeVariables #-}
12{-# OPTIONS_GHC -fno-warn-warnings-deprecations #-}
11{-# OPTIONS_GHC -fno-warn-warnings-deprecations #-}
13−{-# OPTIONS_GHC -Wno-orphans #-}
14−
15−#undef FUSION_CHECK
16−#ifdef FUSION_CHECK
17−{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
18−#endif
19
12
20module Main (main) where
13module Main (main) where
21
14
22import Control.DeepSeq (NFData(..))
15import Control.DeepSeq (NFData(..))
23import Control.Monad (when)
16import Control.Monad (when)
24import Control.Monad.IO.Class (MonadIO(..))
17import Control.Monad.IO.Class (MonadIO(..))
25−import Data.Functor.Identity (Identity(..))
18+import Data.Functor.Identity (Identity)
26import Data.Map.Strict (Map)
19import Data.Map.Strict (Map)
27import Data.Hashable (Hashable)
20import Data.Hashable (Hashable)
28import Data.HashMap.Strict (HashMap)
21import Data.HashMap.Strict (HashMap)
@@ -30,18 +23,17 @@ import Data.IntMap.Strict (IntMap)
30import Data.Monoid (Last(..), Sum(..))
23import Data.Monoid (Last(..), Sum(..))
31import System.Random (randomRIO)
24import System.Random (randomRIO)
32
25
33−import Streamly.Internal.Data.Stream (Stream)
26+import Streamly.Prelude (SerialT)
34import Streamly.Internal.Data.Fold (Fold(..))
27import Streamly.Internal.Data.Fold (Fold(..))
35import Streamly.Internal.Data.IsMap.HashMap ()
28import Streamly.Internal.Data.IsMap.HashMap ()
36−import Streamly.Internal.Data.MutArray (MutArray)
37
29
38import qualified Streamly.Internal.Data.Fold as FL
30import qualified Streamly.Internal.Data.Fold as FL
39−import qualified Streamly.Data.Fold.Prelude as Fold
40import qualified Streamly.Internal.Data.Unfold as Unfold
31import qualified Streamly.Internal.Data.Unfold as Unfold
41import qualified Streamly.Internal.Data.Pipe as Pipe
32import qualified Streamly.Internal.Data.Pipe as Pipe
42−import qualified Streamly.Internal.Data.Stream as Stream
33+import qualified Streamly.Internal.Data.Stream.IsStream as IP
34+import qualified Streamly.Prelude as S
43
35
44−import Test.Tasty.Bench
36+import Gauge
45import Streamly.Benchmark.Common
37import Streamly.Benchmark.Common
46import Prelude hiding (all, any, take, unzip, sequence_, filter)
38import Prelude hiding (all, any, take, unzip, sequence_, filter)
47
39
@@ -49,8 +41,8 @@ import Prelude hiding (all, any, take, unzip, sequence_, filter)
49-- completely optimized out by the compiler in some cases.
41-- completely optimized out by the compiler in some cases.
50
42
51{-# INLINE sourceUnfoldrM #-}
43{-# INLINE sourceUnfoldrM #-}
52−sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
44+sourceUnfoldrM :: (S.IsStream t, S.MonadAsync m) => Int -> Int -> t m Int
53−sourceUnfoldrM value n = Stream.unfoldrM step n
45+sourceUnfoldrM value n = S.unfoldrM step n
54 where
46 where
55 step cnt =
47 step cnt =
56 if cnt > n + value
48 if cnt > n + value
@@ -58,14 +50,14 @@ sourceUnfoldrM value n = Stream.unfoldrM step n
58 else return (Just (cnt, cnt + 1))
50 else return (Just (cnt, cnt + 1))
59
51
60{-# INLINE source #-}
52{-# INLINE source #-}
61−source :: Monad m => Int -> Int -> Stream m Int
53+source :: (S.MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
62source = sourceUnfoldrM
54source = sourceUnfoldrM
63
55
64-- | Takes a fold method, and uses it with a default source.
56-- | Takes a fold method, and uses it with a default source.
65{-# INLINE benchIOSink #-}
57{-# INLINE benchIOSink #-}
66benchIOSink
58benchIOSink
67− :: NFData b
59+ :: (S.IsStream t, NFData b)
68− => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
60+ => Int -> String -> (t IO Int -> IO b) -> Benchmark
69benchIOSink value name f = bench name $ nfIO $ randomRIO (1,1) >>= f . source value
61benchIOSink value name f = bench name $ nfIO $ randomRIO (1,1) >>= f . source value
70
62
71-------------------------------------------------------------------------------
63-------------------------------------------------------------------------------
@@ -73,16 +65,16 @@ benchIOSink value name f = bench name $ nfIO $ randomRIO (1,1) >>= f . source va
73-------------------------------------------------------------------------------
65-------------------------------------------------------------------------------
74
66
75{-# INLINE any #-}
67{-# INLINE any #-}
76−any :: (Monad m, Ord a) => a -> Stream m a -> m Bool
68+any :: (Monad m, Ord a) => a -> SerialT m a -> m Bool
77−any value = Stream.fold (FL.any (> value))
69+any value = IP.fold (FL.any (> value))
78
70
79{-# INLINE all #-}
71{-# INLINE all #-}
80−all :: (Monad m, Ord a) => a -> Stream m a -> m Bool
72+all :: (Monad m, Ord a) => a -> SerialT m a -> m Bool
81−all value = Stream.fold (FL.all (<= value))
73+all value = IP.fold (FL.all (<= value))
82
74
83{-# INLINE take #-}
75{-# INLINE take #-}
84−take :: Monad m => Int -> Stream m a -> m ()
76+take :: Monad m => Int -> SerialT m a -> m ()
85−take value = Stream.fold (FL.take value FL.drain)
77+take value = IP.fold (FL.take value FL.drain)
86
78
87{-# INLINE sequence_ #-}
79{-# INLINE sequence_ #-}
88sequence_ :: Monad m => Int -> Fold m a ()
80sequence_ :: Monad m => Int -> Fold m a ()
@@ -99,62 +91,62 @@ sequence_ value =
99-------------------------------------------------------------------------------
91-------------------------------------------------------------------------------
100
92
101{-# INLINE filter #-}
93{-# INLINE filter #-}
102−filter :: Monad m => Int -> Stream m Int -> m ()
94+filter :: Monad m => Int -> SerialT m Int -> m ()
103−filter _ = Stream.fold (FL.filter even FL.drain)
95+filter _ = IP.fold (FL.filter even FL.drain)
104
96
105−{-# INLINE scanMaybe #-}
97+{-# INLINE foldFilter #-}
106−scanMaybe :: Monad m => Int -> Stream m Int -> m ()
98+foldFilter :: Monad m => Int -> SerialT m Int -> m ()
107−scanMaybe _ = Stream.fold (FL.scanMaybe (FL.filtering even) FL.drain)
99+foldFilter _ = IP.fold (FL.foldFilter (FL.satisfy even) FL.drain)
108
100
109−{-# INLINE scanMaybe2 #-}
101+{-# INLINE foldFilter2 #-}
110−scanMaybe2 :: Monad m => Int -> Stream m Int -> m ()
102+foldFilter2 :: Monad m => Int -> SerialT m Int -> m ()
111−scanMaybe2 _ =
103+foldFilter2 _ =
112− Stream.fold
104+ IP.fold
113− $ FL.scanMaybe (FL.filtering even)
105+ $ FL.foldFilter (FL.satisfy even)
114− $ FL.scanMaybe (FL.filtering odd) FL.drain
106+ $ FL.foldFilter (FL.satisfy odd) FL.drain
115
107
116-------------------------------------------------------------------------------
108-------------------------------------------------------------------------------
117-- Splitting by serial application
109-- Splitting by serial application
118-------------------------------------------------------------------------------
110-------------------------------------------------------------------------------
119
111
120{-# INLINE takeEndBy_ #-}
112{-# INLINE takeEndBy_ #-}
121−takeEndBy_ :: Monad m => Int -> Stream m Int -> m ()
113+takeEndBy_ :: Monad m => Int -> SerialT m Int -> m ()
122−takeEndBy_ value = Stream.fold (FL.takeEndBy_ (>= value) FL.drain)
114+takeEndBy_ value = IP.fold (FL.takeEndBy_ (>= value) FL.drain)
123
115
124{-# INLINE many #-}
116{-# INLINE many #-}
125−many :: Monad m => Stream m Int -> m ()
117+many :: Monad m => SerialT m Int -> m ()
126−many = Stream.fold (FL.many (FL.take 1 FL.drain) FL.drain)
118+many = IP.fold (FL.many (FL.take 1 FL.drain) FL.drain)
127
119
128{-# INLINE splitAllAny #-}
120{-# INLINE splitAllAny #-}
129−splitAllAny :: Monad m => Int -> Stream m Int -> m (Bool, Bool)
121+splitAllAny :: Monad m => Int -> SerialT m Int -> m (Bool, Bool)
130splitAllAny value =
122splitAllAny value =
131− Stream.fold
123+ IP.fold
132− (FL.splitWith (,)
124+ (FL.serialWith (,)
133 (FL.all (<= (value `div` 2)))
125 (FL.all (<= (value `div` 2)))
134 (FL.any (> value))
126 (FL.any (> value))
135 )
127 )
136
128
137−{-# INLINE split_ #-}
129+{-# INLINE serial_ #-}
138−split_ :: Monad m => Int -> Stream m Int -> m Bool
130+serial_ :: Monad m => Int -> SerialT m Int -> m Bool
139−split_ value =
131+serial_ value =
140− Stream.fold
132+ IP.fold
141− (FL.split_
133+ (FL.serial_
142 (FL.all (<= (value `div` 2)))
134 (FL.all (<= (value `div` 2)))
143 (FL.any (> value))
135 (FL.any (> value))
144 )
136 )
145
137
146{-# INLINE shortest #-}
138{-# INLINE shortest #-}
147−shortest :: Monad m => Stream m Int -> m (Either Int Int)
139+shortest :: Monad m => SerialT m Int -> m (Either Int Int)
148−shortest = Stream.fold (FL.shortest FL.sum FL.length)
140+shortest = IP.fold (FL.shortest FL.sum FL.length)
149
141
150{-# INLINE longest #-}
142{-# INLINE longest #-}
151−longest :: Monad m => Stream m Int -> m (Either Int Int)
143+longest :: Monad m => SerialT m Int -> m (Either Int Int)
152−longest = Stream.fold (FL.longest FL.sum FL.length)
144+longest = IP.fold (FL.longest FL.sum FL.length)
153
145
154{-# INLINE foldBreak #-}
146{-# INLINE foldBreak #-}
155−foldBreak :: Monad m => Stream m Int -> m ()
147+foldBreak :: Monad m => SerialT m Int -> m ()
156foldBreak s = do
148foldBreak s = do
157− (r, s1) <- Stream.foldBreak (FL.take 1 FL.length) s
149+ (r, s1) <- IP.foldBreak (FL.take 1 FL.length) s
158 when (r /= 0) $ foldBreak s1
150 when (r /= 0) $ foldBreak s1
159
151
160-------------------------------------------------------------------------------
152-------------------------------------------------------------------------------
@@ -162,12 +154,12 @@ foldBreak s = do
162-------------------------------------------------------------------------------
154-------------------------------------------------------------------------------
163
155
164{-# INLINE teeSumLength #-}
156{-# INLINE teeSumLength #-}
165−teeSumLength :: Monad m => Stream m Int -> m (Int, Int)
157+teeSumLength :: Monad m => SerialT m Int -> m (Int, Int)
166−teeSumLength = Stream.fold (FL.teeWith (,) FL.sum FL.length)
158+teeSumLength = IP.fold (FL.teeWith (,) FL.sum FL.length)
167
159
168{-# INLINE teeAllAny #-}
160{-# INLINE teeAllAny #-}
169−teeAllAny :: (Monad m, Ord a) => a -> Stream m a -> m (Bool, Bool)
161+teeAllAny :: (Monad m, Ord a) => a -> SerialT m a -> m (Bool, Bool)
170−teeAllAny value = Stream.fold (FL.teeWith (,) all_ any_)
162+teeAllAny value = IP.fold (FL.teeWith (,) all_ any_)
171
163
172 where
164 where
173
165
@@ -175,16 +167,16 @@ teeAllAny value = Stream.fold (FL.teeWith (,) all_ any_)
175 any_ = FL.any (> value)
167 any_ = FL.any (> value)
176
168
177{-# INLINE teeWithFst #-}
169{-# INLINE teeWithFst #-}
178−teeWithFst :: Monad m => Stream m Int -> m (Int, Int)
170+teeWithFst :: Monad m => SerialT m Int -> m (Int, Int)
179−teeWithFst = Stream.fold (FL.teeWithFst (,) FL.sum FL.length)
171+teeWithFst = IP.fold (FL.teeWithFst (,) FL.sum FL.length)
180
172
181{-# INLINE teeWithMin #-}
173{-# INLINE teeWithMin #-}
182−teeWithMin :: Monad m => Stream m Int -> m (Int, Int)
174+teeWithMin :: Monad m => SerialT m Int -> m (Int, Int)
183−teeWithMin = Stream.fold (FL.teeWithMin (,) FL.sum FL.length)
175+teeWithMin = IP.fold (FL.teeWithMin (,) FL.sum FL.length)
184
176
185{-# INLINE distribute #-}
177{-# INLINE distribute #-}
186−distribute :: Monad m => Stream m Int -> m [Int]
178+distribute :: Monad m => SerialT m Int -> m [Int]
187−distribute = Stream.fold (FL.distribute [FL.sum, FL.length])
179+distribute = IP.fold (FL.distribute [FL.sum, FL.length])
188
180
189-------------------------------------------------------------------------------
181-------------------------------------------------------------------------------
190-- Partitioning
182-- Partitioning
@@ -195,88 +187,88 @@ oddEven :: Int -> Either Int Int
195oddEven x = if odd x then Left x else Right x
187oddEven x = if odd x then Left x else Right x
196
188
197{-# INLINE partition #-}
189{-# INLINE partition #-}
198−partition :: Monad m => Stream m Int -> m (Int, Int)
190+partition :: Monad m => SerialT m Int -> m (Int, Int)
199−partition = Stream.fold $ FL.lmap oddEven (FL.partition FL.sum FL.length)
191+partition = IP.fold $ FL.lmap oddEven (FL.partition FL.sum FL.length)
200
192
201{-# INLINE partitionByFstM #-}
193{-# INLINE partitionByFstM #-}
202−partitionByFstM :: Monad m => Stream m Int -> m (Int, Int)
194+partitionByFstM :: Monad m => SerialT m Int -> m (Int, Int)
203partitionByFstM =
195partitionByFstM =
204− Stream.fold (FL.partitionByFstM (return . oddEven) FL.sum FL.length)
196+ IP.fold (FL.partitionByFstM (return . oddEven) FL.sum FL.length)
205
197
206{-# INLINE partitionByMinM #-}
198{-# INLINE partitionByMinM #-}
207−partitionByMinM :: Monad m => Stream m Int -> m (Int, Int)
199+partitionByMinM :: Monad m => SerialT m Int -> m (Int, Int)
208partitionByMinM =
200partitionByMinM =
209− Stream.fold (FL.partitionByMinM (return . oddEven) FL.sum FL.length)
201+ IP.fold (FL.partitionByMinM (return . oddEven) FL.sum FL.length)
210−
202+
211−{-# INLINE demuxToMap #-}
203+{-# INLINE demuxWith #-}
212−demuxToMap :: (Monad m, Ord k) =>
204+demuxWith :: (Monad m, Ord k) =>
213− (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (Map k b)
205+ (a -> k) -> (a -> m (Fold m a b)) -> SerialT m a -> m (Map k b)
214−demuxToMap f g = Stream.fold (FL.demuxToContainer f g)
206+demuxWith f g = S.fold (FL.demuxWith f g)
215−
207+
216−{-# INLINE demuxToIntMap #-}
208+{-# INLINE demuxWithInt #-}
217−demuxToIntMap :: Monad m =>
209+demuxWithInt :: Monad m =>
218− (a -> Int) -> (a -> m (Fold m a b)) -> Stream m a -> m (IntMap b)
210+ (a -> Int) -> (a -> m (Fold m a b)) -> SerialT m a -> m (IntMap b)
219−demuxToIntMap f g = Stream.fold (FL.demuxToContainer f g)
211+demuxWithInt f g = S.fold (FL.demuxWith f g)
220−
212+
221−{-# INLINE demuxToHashMap #-}
213+{-# INLINE demuxWithHash #-}
222−demuxToHashMap :: (Monad m, Hashable k) =>
214+demuxWithHash :: (Monad m, Ord k, Hashable k) =>
223− (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (HashMap k b)
215+ (a -> k) -> (a -> m (Fold m a b)) -> SerialT m a -> m (HashMap k b)
224−demuxToHashMap f g = Stream.fold (FL.demuxToContainer f g)
216+demuxWithHash f g = S.fold (FL.demuxWith f g)
225−
217+
226−{-# INLINE demuxToMapIO #-}
218+{-# INLINE demuxMutWith #-}
227−demuxToMapIO :: (MonadIO m, Ord k) =>
219+demuxMutWith :: (MonadIO m, Ord k) =>
228− (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (Map k b)
220+ (a -> k) -> (a -> m (Fold m a b)) -> SerialT m a -> m (Map k b)
229−demuxToMapIO f g = Stream.fold (FL.demuxToContainerIO f g)
221+demuxMutWith f g = S.fold (FL.demuxMutWith f g)
230−
222+
231−{-# INLINE demuxToHashMapIO #-}
223+{-# INLINE demuxMutWithHash #-}
232−demuxToHashMapIO :: (MonadIO m, Hashable k) =>
224+demuxMutWithHash :: (MonadIO m, Ord k, Hashable k) =>
233− (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (HashMap k b)
225+ (a -> k) -> (a -> m (Fold m a b)) -> SerialT m a -> m (HashMap k b)
234−demuxToHashMapIO f g = Stream.fold (FL.demuxToContainerIO f g)
226+demuxMutWithHash f g = S.fold (FL.demuxMutWith f g)
235−
227+
236−{-# INLINE toMap #-}
228+{-# INLINE classifyWith #-}
237−toMap ::
229+classifyWith ::
238− (Monad m, Ord k, Num a) => (a -> k) -> Stream m a -> m (Map k a)
230+ (Monad m, Ord k, Num a) => (a -> k) -> SerialT m a -> m (Map k a)
239−toMap f = Stream.fold (FL.toContainer f FL.sum)
231+classifyWith f = S.fold (FL.classifyWith f FL.sum)
240−
232+
241−{-# INLINE toIntMap #-}
233+{-# INLINE classifyWithInt #-}
242−toIntMap ::
234+classifyWithInt ::
243− (Monad m, Num a) => (a -> Int) -> Stream m a -> m (IntMap a)
235+ (MonadIO m, Num a) => (a -> Int) -> SerialT m a -> m (IntMap a)
244−toIntMap f = Stream.fold (FL.toContainer f FL.sum)
236+classifyWithInt f = S.fold (FL.classifyWith f FL.sum)
245−
237+
246−{-# INLINE toMapIO #-}
238+{-# INLINE classifyMutWith #-}
247−toMapIO ::
239+classifyMutWith ::
248− (MonadIO m, Ord k, Num a) => (a -> k) -> Stream m a -> m (Map k a)
240+ (MonadIO m, Ord k, Num a) => (a -> k) -> SerialT m a -> m (Map k a)
249−toMapIO f = Stream.fold (FL.toContainerIO f FL.sum)
241+classifyMutWith f = S.fold (FL.classifyMutWith f FL.sum)
250−
242+
251−{-# INLINE toIntMapIO #-}
243+{-# INLINE classifyMutWithInt #-}
252−toIntMapIO ::
244+classifyMutWithInt ::
253− (MonadIO m, Num a) => (a -> Int) -> Stream m a -> m (IntMap a)
245+ (MonadIO m, Num a) => (a -> Int) -> SerialT m a -> m (IntMap a)
254−toIntMapIO f = Stream.fold (FL.toContainerIO f FL.sum)
246+classifyMutWithInt f = S.fold (FL.classifyMutWith f FL.sum)
255−
247+
256−{-# INLINE toHashMapIO #-}
248+{-# INLINE classifyMutWithHash #-}
257−toHashMapIO :: (MonadIO m, Ord k, Num a, Hashable k) =>
249+classifyMutWithHash :: (MonadIO m, Ord k, Num a, Hashable k) =>
258− (a -> k) -> Stream m a -> m (HashMap k a)
250+ (a -> k) -> SerialT m a -> m (HashMap k a)
259−toHashMapIO f = Stream.fold (Fold.toHashMapIO f FL.sum)
251+classifyMutWithHash f = S.fold (FL.classifyMutWith f FL.sum)
260
252
261-------------------------------------------------------------------------------
253-------------------------------------------------------------------------------
262-- unzip
254-- unzip
263-------------------------------------------------------------------------------
255-------------------------------------------------------------------------------
264
256
265{-# INLINE unzip #-}
257{-# INLINE unzip #-}
266−unzip :: Monad m => Stream m Int -> m (Int, Int)
258+unzip :: Monad m => SerialT m Int -> m (Int, Int)
267−unzip = Stream.fold $ FL.lmap (\a -> (a, a)) (FL.unzip FL.sum FL.length)
259+unzip = IP.fold $ FL.lmap (\a -> (a, a)) (FL.unzip FL.sum FL.length)
268
260
269{-# INLINE unzipWithFstM #-}
261{-# INLINE unzipWithFstM #-}
270−unzipWithFstM :: Monad m => Stream m Int -> m (Int, Int)
262+unzipWithFstM :: Monad m => SerialT m Int -> m (Int, Int)
271unzipWithFstM = do
263unzipWithFstM = do
272− let f a = return (a + 1, a)
264+ let f = \a -> return (a + 1, a)
273− Stream.fold (FL.unzipWithFstM f FL.sum FL.length)
265+ IP.fold (FL.unzipWithFstM f FL.sum FL.length)
274
266
275{-# INLINE unzipWithMinM #-}
267{-# INLINE unzipWithMinM #-}
276−unzipWithMinM :: Monad m => Stream m Int -> m (Int, Int)
268+unzipWithMinM :: Monad m => SerialT m Int -> m (Int, Int)
277unzipWithMinM = do
269unzipWithMinM = do
278− let f a = return (a + 1, a)
270+ let f = \a -> return (a + 1, a)
279− Stream.fold (FL.unzipWithMinM f FL.sum FL.length)
271+ IP.fold (FL.unzipWithMinM f FL.sum FL.length)
280
272
281-------------------------------------------------------------------------------
273-------------------------------------------------------------------------------
282-- Nested
274-- Nested
@@ -286,8 +278,8 @@ unzipWithMinM = do
286unfoldMany :: Int -> Benchmarkable
278unfoldMany :: Int -> Benchmarkable
287unfoldMany val =
279unfoldMany val =
288 nfIO
280 nfIO
289− $ Stream.fold (FL.unfoldMany Unfold.replicateM FL.drain)
281+ $ IP.fold (FL.unfoldMany (Unfold.replicateM val) FL.drain)
290− $ Stream.fromPure (val, randomRIO (1, 1 :: Int))
282+ $ IP.fromPure (randomRIO (1, 1 :: Int))
291
283
292-------------------------------------------------------------------------------
284-------------------------------------------------------------------------------
293-- Benchmarks
285-- Benchmarks
@@ -296,113 +288,106 @@ unfoldMany val =
296moduleName :: String
288moduleName :: String
297moduleName = "Data.Fold"
289moduleName = "Data.Fold"
298
290
299−instance NFData (MutArray a) where
300− {-# INLINE rnf #-}
301− rnf _ = ()
302−
303−instance NFData a => NFData (Stream Identity a) where
304− {-# INLINE rnf #-}
305− rnf xs = runIdentity $ Stream.fold (FL.foldl' (\_ x -> rnf x) ()) xs
306−
307o_1_space_serial_elimination :: Int -> [Benchmark]
291o_1_space_serial_elimination :: Int -> [Benchmark]
308o_1_space_serial_elimination value =
292o_1_space_serial_elimination value =
309 [ bgroup "elimination"
293 [ bgroup "elimination"
310− [ benchIOSink value "drain" (Stream.fold FL.drain)
294+ [ benchIOSink value "drain" (S.fold FL.drain)
311− , benchIOSink value "drainBy" (Stream.fold (FL.drainBy return))
295+ , benchIOSink value "drainBy" (S.fold (FL.drainBy return))
312− , benchIOSink value "drainN" (Stream.fold (FL.drainN value))
296+ , benchIOSink value "drainN" (S.fold (FL.drainN value))
313− , benchIOSink value "last" (Stream.fold FL.last)
297+ , benchIOSink value "last" (S.fold FL.last)
298+ , benchIOSink value "nub" (S.fold FL.nub)
314− , benchIOSink value "length" (Stream.fold FL.length)
299+ , benchIOSink value "length" (S.fold FL.length)
315− , benchIOSink value "top" (Stream.fold $ FL.top 10)
300+ , benchIOSink value "top" (S.fold $ FL.top 10)
316− , benchIOSink value "bottom" (Stream.fold $ FL.bottom 10)
301+ , benchIOSink value "bottom" (S.fold $ FL.bottom 10)
317− , benchIOSink value "sum" (Stream.fold FL.sum)
302+ , benchIOSink value "sum" (S.fold FL.sum)
318− , benchIOSink value "sum (foldMap)" (Stream.fold (FL.foldMap Sum))
303+ , benchIOSink value "sum (foldMap)" (S.fold (FL.foldMap Sum))
319− , benchIOSink value "product" (Stream.fold FL.product)
304+ , benchIOSink value "product" (S.fold FL.product)
320− , benchIOSink value "maximumBy" (Stream.fold (FL.maximumBy compare))
305+ , benchIOSink value "maximumBy" (S.fold (FL.maximumBy compare))
321− , benchIOSink value "maximum" (Stream.fold FL.maximum)
306+ , benchIOSink value "maximum" (S.fold FL.maximum)
322− , benchIOSink value "minimumBy" (Stream.fold (FL.minimumBy compare))
307+ , benchIOSink value "minimumBy" (S.fold (FL.minimumBy compare))
323− , benchIOSink value "minimum" (Stream.fold FL.minimum)
308+ , benchIOSink value "minimum" (S.fold FL.minimum)
324 , benchIOSink
309 , benchIOSink
325 value
310 value
326 "mean"
311 "mean"
327− (Stream.fold FL.mean . fmap (fromIntegral :: Int -> Double))
312+ (S.fold FL.mean . S.map (fromIntegral :: Int -> Double))
328 , benchIOSink
313 , benchIOSink
329 value
314 value
330 "variance"
315 "variance"
331− (Stream.fold FL.variance . fmap (fromIntegral :: Int -> Double))
316+ (S.fold FL.variance . S.map (fromIntegral :: Int -> Double))
332 , benchIOSink
317 , benchIOSink
333 value
318 value
334 "stdDev"
319 "stdDev"
335− (Stream.fold FL.stdDev . fmap (fromIntegral :: Int -> Double))
320+ (S.fold FL.stdDev . S.map (fromIntegral :: Int -> Double))
336 , benchIOSink
321 , benchIOSink
337 value
322 value
338 "mconcat"
323 "mconcat"
339− (Stream.fold FL.mconcat . fmap (Last . Just))
324+ (S.fold FL.mconcat . S.map (Last . Just))
340 , benchIOSink
325 , benchIOSink
341 value
326 value
342 "foldMap"
327 "foldMap"
343− (Stream.fold (FL.foldMap (Last . Just)))
328+ (S.fold (FL.foldMap (Last . Just)))
344 , benchIOSink
329 , benchIOSink
345 value
330 value
346 "foldMapM"
331 "foldMapM"
347− (Stream.fold (FL.foldMapM (return . Last . Just)))
332+ (S.fold (FL.foldMapM (return . Last . Just)))
348− , benchIOSink value "index" (Stream.fold (FL.index (value + 1)))
333+ , benchIOSink value "index" (S.fold (FL.index (value + 1)))
349− , benchIOSink value "head" (Stream.fold FL.head)
334+ , benchIOSink value "head" (S.fold FL.head)
350− , benchIOSink value "find" (Stream.fold (FL.find (== (value + 1))))
335+ , benchIOSink value "find" (S.fold (FL.find (== (value + 1))))
351 , benchIOSink
336 , benchIOSink
352 value
337 value
353 "lookup"
338 "lookup"
354− (Stream.fold (FL.lmap (\a -> (a, a)) (FL.lookup (value + 1))))
339+ (S.fold (FL.lmap (\a -> (a, a)) (FL.lookup (value + 1))))
355 , benchIOSink
340 , benchIOSink
356 value
341 value
357 "findIndex"
342 "findIndex"
358− (Stream.fold (FL.findIndex (== (value + 1))))
343+ (S.fold (FL.findIndex (== (value + 1))))
359 , benchIOSink
344 , benchIOSink
360 value
345 value
361 "elemIndex"
346 "elemIndex"
362− (Stream.fold (FL.elemIndex (value + 1)))
347+ (S.fold (FL.elemIndex (value + 1)))
363− , benchIOSink value "null" (Stream.fold FL.null)
348+ , benchIOSink value "null" (S.fold FL.null)
364− , benchIOSink value "elem" (Stream.fold (FL.elem (value + 1)))
349+ , benchIOSink value "elem" (S.fold (FL.elem (value + 1)))
365− , benchIOSink value "notElem" (Stream.fold (FL.notElem (value + 1)))
350+ , benchIOSink value "notElem" (S.fold (FL.notElem (value + 1)))
366 , benchIOSink value "all" $ all value
351 , benchIOSink value "all" $ all value
367 , benchIOSink value "any" $ any value
352 , benchIOSink value "any" $ any value
368 , benchIOSink value "take" $ take value
353 , benchIOSink value "take" $ take value
369 , benchIOSink value "takeEndBy_" $ takeEndBy_ value
354 , benchIOSink value "takeEndBy_" $ takeEndBy_ value
370− , benchIOSink value "and" (Stream.fold FL.and . fmap (<= (value + 1)))
355+ , benchIOSink value "and" (S.fold FL.and . S.map (<= (value + 1)))
371− , benchIOSink value "or" (Stream.fold FL.or . fmap (> (value + 1)))
356+ , benchIOSink value "or" (S.fold FL.or . S.map (> (value + 1)))
372 ]
357 ]
373 ]
358 ]
374
359
375o_1_space_serial_transformation :: Int -> [Benchmark]
360o_1_space_serial_transformation :: Int -> [Benchmark]
376o_1_space_serial_transformation value =
361o_1_space_serial_transformation value =
377 [ bgroup "transformation"
362 [ bgroup "transformation"
378− [ benchIOSink value "map" (Stream.fold (FL.lmap (+ 1) FL.drain))
363+ [ benchIOSink value "map" (S.fold (FL.lmap (+ 1) FL.drain))
379 , let f x = if even x then Just x else Nothing
364 , let f x = if even x then Just x else Nothing
380 fld = FL.mapMaybe f FL.drain
365 fld = FL.mapMaybe f FL.drain
381− in benchIOSink value "mapMaybe" (Stream.fold fld)
366+ in benchIOSink value "mapMaybe" (S.fold fld)
382 , benchIOSink
367 , benchIOSink
383 value
368 value
384 "rsequence"
369 "rsequence"
385− (Stream.fold (FL.rmapM id (return <$> FL.drain)))
370+ (S.fold (FL.rmapM id (return <$> FL.drain)))
386− , benchIOSink value "rmapM" (Stream.fold (FL.rmapM return FL.drain))
371+ , benchIOSink value "rmapM" (S.fold (FL.rmapM return FL.drain))
387 , benchIOSink
372 , benchIOSink
388 value
373 value
389 "pipe-mapM"
374 "pipe-mapM"
390− (Stream.fold
375+ (S.fold
391 (FL.transform
376 (FL.transform
392 (Pipe.mapM (\x -> return $ x + 1))
377 (Pipe.mapM (\x -> return $ x + 1))
393 FL.drain))
378 FL.drain))
394 , benchIOSink
379 , benchIOSink
395 value
380 value
396 "fold-scan"
381 "fold-scan"
397− (Stream.fold $ FL.scan FL.sum FL.drain)
382+ (S.fold $ FL.scan FL.sum FL.drain)
398 , benchIOSink
383 , benchIOSink
399 value
384 value
400 "fold-scanMany"
385 "fold-scanMany"
401− (Stream.fold $ FL.scanMany (FL.take 2 FL.drain) FL.drain)
386+ (S.fold $ FL.scanMany (FL.take 2 FL.drain) FL.drain)
402 , benchIOSink
387 , benchIOSink
403 value
388 value
404 "fold-postscan"
389 "fold-postscan"
405− (Stream.fold $ FL.postscan FL.sum FL.drain)
390+ (S.fold $ FL.postscan FL.sum FL.drain)
406 ]
391 ]
407 ]
392 ]
408
393
@@ -411,11 +396,11 @@ o_1_space_serial_composition value =
411 [ bgroup
396 [ bgroup
412 "composition"
397 "composition"
413 [ benchIOSink value "filter even" $ filter value
398 [ benchIOSink value "filter even" $ filter value
414− , benchIOSink value "scanMaybe even" $ scanMaybe value
399+ , benchIOSink value "foldFilter even" $ foldFilter value
415− , benchIOSink value "scanMaybe even, odd" $ scanMaybe2 value
400+ , benchIOSink value "foldFilter even, odd" $ foldFilter2 value
416 , benchIOSink value "foldBreak (recursive)" foldBreak
401 , benchIOSink value "foldBreak (recursive)" foldBreak
417− , benchIOSink value "splitWith (all, any)" $ splitAllAny value
402+ , benchIOSink value "serialWith (all, any)" $ splitAllAny value
418− , benchIOSink value "split_ (all, any)" $ split_ value
403+ , benchIOSink value "serial_ (all, any)" $ serial_ value
419 , benchIOSink value "tee (all, any)" $ teeAllAny value
404 , benchIOSink value "tee (all, any)" $ teeAllAny value
420 , benchIOSink value "many drain (take 1)" many
405 , benchIOSink value "many drain (take 1)" many
421 , bench "unfoldMany" $ unfoldMany value
406 , bench "unfoldMany" $ unfoldMany value
@@ -436,7 +421,7 @@ o_1_space_serial_composition value =
436
421
437o_n_space_serial :: Int -> [Benchmark]
422o_n_space_serial :: Int -> [Benchmark]
438o_n_space_serial value =
423o_n_space_serial value =
439− [ benchIOSink value "sequence_/100" $ Stream.fold (sequence_ (value `div` 100))
424+ [ benchIOSink value "sequence_/100" $ S.fold (sequence_ (value `div` 100))
440 ]
425 ]
441
426
442o_n_heap_serial :: Int -> [Benchmark]
427o_n_heap_serial :: Int -> [Benchmark]
@@ -445,50 +430,49 @@ o_n_heap_serial value =
445 -- Left folds for building a structure are inherently non-streaming
430 -- Left folds for building a structure are inherently non-streaming
446 -- as the structure cannot be lazily consumed until fully built.
431 -- as the structure cannot be lazily consumed until fully built.
447 [
432 [
448− benchIOSink value "toList" (Stream.fold FL.toList)
433+ benchIOSink value "toList" (S.fold FL.toList)
449− , benchIOSink value "toListRev" (Stream.fold FL.toListRev)
434+ , benchIOSink value "toListRev" (S.fold FL.toListRev)
450 , benchIOSink value "toStream"
435 , benchIOSink value "toStream"
451− (Stream.fold FL.toStream
436+ (S.fold FL.toStream
452− :: Stream IO a -> IO (Stream Identity a))
437+ :: SerialT IO a -> IO (SerialT Identity a))
453 , benchIOSink value "toStreamRev"
438 , benchIOSink value "toStreamRev"
454− (Stream.fold FL.toStreamRev
439+ (S.fold FL.toStreamRev
455− :: Stream IO a -> IO (Stream Identity a))
440+ :: SerialT IO a -> IO (SerialT Identity a))
456− , benchIOSink value "nub" (Stream.fold FL.nub)
457 ]
441 ]
458 , bgroup "key-value"
442 , bgroup "key-value"
459 [
443 [
460− benchIOSink value "demuxToMap (64 buckets) [sum, length]"
444+ benchIOSink value "demuxWith (64 buckets) [sum, length]"
461− $ demuxToMap (getKey 64) (getFold . getKey 64)
445+ $ demuxWith (getKey 64) (getFold . getKey 64)
462− , benchIOSink value "demuxToIntMap (64 buckets) [sum, length]"
446+ , benchIOSink value "demuxWithInt (64 buckets) [sum, length]"
463− $ demuxToIntMap (getKey 64) (getFold . getKey 64)
447+ $ demuxWithInt (getKey 64) (getFold . getKey 64)
464− , benchIOSink value "demuxToHashMap (64 buckets) [sum, length]"
448+ , benchIOSink value "demuxWithHash (64 buckets) [sum, length]"
465− $ demuxToHashMap (getKey 64) (getFold . getKey 64)
449+ $ demuxWithHash (getKey 64) (getFold . getKey 64)
466− , benchIOSink value "demuxToMapIO (64 buckets) [sum, length]"
450+ , benchIOSink value "demuxMutWith (64 buckets) [sum, length]"
467− $ demuxToMapIO (getKey 64) (getFold . getKey 64)
451+ $ demuxMutWith (getKey 64) (getFold . getKey 64)
468− , benchIOSink value "demuxToHashMapIO (64 buckets) [sum, length]"
452+ , benchIOSink value "demuxMutWithHash (64 buckets) [sum, length]"
469− $ demuxToHashMapIO (getKey 64) (getFold . getKey 64)
453+ $ demuxMutWithHash (getKey 64) (getFold . getKey 64)
470
454
471 -- classify: immutable
455 -- classify: immutable
472− , benchIOSink value "toMap (64 buckets) sum"
456+ , benchIOSink value "classifyWith (64 buckets) sum"
473− $ toMap (getKey 64)
457+ $ classifyWith (getKey 64)
474− , benchIOSink value "toIntMap (64 buckets) sum"
458+ , benchIOSink value "classifyWithInt (64 buckets) sum"
475− $ toIntMap (getKey 64)
459+ $ classifyWithInt (getKey 64)
476
460
477 -- classify: mutable cells
461 -- classify: mutable cells
478− , benchIOSink value "toMapIO (single bucket) sum"
462+ , benchIOSink value "classifyMutWith (single bucket) sum"
479− $ toMapIO (getKey 1)
463+ $ classifyMutWith (getKey 1)
480− , benchIOSink value "toMapIO (64 buckets) sum"
464+ , benchIOSink value "classifyMutWith (64 buckets) sum"
481− $ toMapIO (getKey 64)
465+ $ classifyMutWith (getKey 64)
482− , benchIOSink value "toMapIO (max buckets) sum"
466+ , benchIOSink value "classifyMutWith (max buckets) sum"
483− $ toMapIO (getKey value)
467+ $ classifyMutWith (getKey value)
484− , benchIOSink value "toIntMapIO (64 buckets) sum"
468+ , benchIOSink value "classifyMutWithInt (64 buckets) sum"
485− $ toIntMapIO (getKey 64)
469+ $ classifyMutWithInt (getKey 64)
486− , benchIOSink value "toHashMapIO (single bucket) sum"
470+ , benchIOSink value "classifyMutWithHash (single bucket) sum"
487− $ toHashMapIO (getKey 1)
471+ $ classifyMutWithHash (getKey 1)
488− , benchIOSink value "toHashMapIO (64 buckets) sum"
472+ , benchIOSink value "classifyMutWithHash (64 buckets) sum"
489− $ toHashMapIO (getKey 64)
473+ $ classifyMutWithHash (getKey 64)
490− , benchIOSink value "toHashMapIO (max buckets) sum"
474+ , benchIOSink value "classifyMutWithHash (max buckets) sum"
491− $ toHashMapIO (getKey value)
475+ $ classifyMutWithHash (getKey value)
492 ]
476 ]
493 ]
477 ]
494
478
@@ -507,9 +491,7 @@ o_n_heap_serial value =
507-------------------------------------------------------------------------------
491-------------------------------------------------------------------------------
508
492
509main :: IO ()
493main :: IO ()
510−main = do
511−#ifndef FUSION_CHECK
512− runWithCLIOpts defaultStreamSize allBenchmarks
494+main = runWithCLIOpts defaultStreamSize allBenchmarks
513
495
514 where
496 where
515
497
@@ -522,20 +504,3 @@ main = do
522 , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
504 , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
523 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
505 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
524 ]
506 ]
525−#else
526− -- Enable FUSION_CHECK macro at the beginning of the file
527− -- Enable one benchmark below, and run the benchmark
528− -- Check the .dump-simpl output
529− let value = 100000
530− let input = source value 1
531− let getKey buckets = (`mod` buckets)
532− let getFold k =
533− return $ case k of
534− 0 -> FL.sum
535− 1 -> FL.length
536− _ -> FL.length
537−
538− -- demuxToMap (getKey 64) (getFold . getKey 64) input
539− toIntMapIO (getKey 64) input
540− return ()
541−#endif
benchmark/Streamly/Benchmark/Data/Fold/Window.hs+61−79
@@ -1,29 +1,26 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3module Main (main) where
1module Main (main) where
4
2
5import Control.DeepSeq (NFData)
3import Control.DeepSeq (NFData)
6import Streamly.Data.Fold (Fold)
4import Streamly.Data.Fold (Fold)
7−import Streamly.Internal.Data.Stream (Stream)
5+import Streamly.Prelude (SerialT)
8import System.Random (randomRIO)
6import System.Random (randomRIO)
9
7
10import qualified Streamly.Data.Fold as Fold
8import qualified Streamly.Data.Fold as Fold
11−import qualified Streamly.Internal.Data.Fold as Window
9+import qualified Streamly.Internal.Data.Ring.Foreign as Ring
12−import qualified Streamly.Internal.Data.Ring as Ring
10+import qualified Streamly.Prelude as Stream
13−import qualified Streamly.Internal.Data.Stream as Stream
11+import qualified Streamly.Internal.Data.Fold.Window as Window
14
12
15−import Streamly.Benchmark.Common
13+import Gauge
16−import Test.Tasty.Bench
17
14
18{-# INLINE source #-}
15{-# INLINE source #-}
19−source :: (Monad m, Num a, Stream.Enumerable a) =>
16+source :: (Monad m, Stream.IsStream t, Num a, Stream.Enumerable a) =>
20− Int -> a -> Stream m a
17+ Int -> a -> t m a
21source len from =
18source len from =
22 Stream.enumerateFromThenTo from (from + 1) (from + fromIntegral len)
19 Stream.enumerateFromThenTo from (from + 1) (from + fromIntegral len)
23
20
24{-# INLINE sourceDescending #-}
21{-# INLINE sourceDescending #-}
25−sourceDescending :: (Monad m, Num a, Stream.Enumerable a) =>
22+sourceDescending :: (Monad m, Stream.IsStream t, Num a, Stream.Enumerable a) =>
26− Int -> a -> Stream m a
23+ Int -> a -> t m a
27sourceDescending len from =
24sourceDescending len from =
28 Stream.enumerateFromThenTo
25 Stream.enumerateFromThenTo
29 (from + fromIntegral len)
26 (from + fromIntegral len)
@@ -31,12 +28,12 @@ sourceDescending len from =
31 from
28 from
32
29
33{-# INLINE sourceDescendingInt #-}
30{-# INLINE sourceDescendingInt #-}
34−sourceDescendingInt :: Monad m => Int -> Int -> Stream m Int
31+sourceDescendingInt :: (Monad m, Stream.IsStream t) => Int -> Int -> t m Int
35sourceDescendingInt = sourceDescending
32sourceDescendingInt = sourceDescending
36
33
37{-# INLINE benchWith #-}
34{-# INLINE benchWith #-}
38benchWith :: (Num a, NFData b) =>
35benchWith :: (Num a, NFData b) =>
39− (Int -> a -> Stream IO a) -> Int -> String -> Fold IO a b -> Benchmark
36+ (Int -> a -> SerialT IO a) -> Int -> String -> Fold IO a b -> Benchmark
40benchWith src len name f =
37benchWith src len name f =
41 bench name
38 bench name
42 $ nfIO
39 $ nfIO
@@ -52,140 +49,125 @@ benchWithFoldInt = benchWith source
52
49
53{-# INLINE benchScanWith #-}
50{-# INLINE benchScanWith #-}
54benchScanWith :: Num a =>
51benchScanWith :: Num a =>
55− (Int -> a -> Stream IO a) -> Int -> String -> Fold IO a b -> Benchmark
52+ (Int -> a -> SerialT IO a) -> Int -> String -> Fold IO a b -> Benchmark
56benchScanWith src len name f =
53benchScanWith src len name f =
57 bench name
54 bench name
58 $ nfIO
55 $ nfIO
59 $ randomRIO (1, 1 :: Int)
56 $ randomRIO (1, 1 :: Int)
60− >>= Stream.fold Fold.drain
61− . Stream.postscan f
57+ >>= Stream.drain . Stream.postscan f . src len . fromIntegral
62− . src len
63− . fromIntegral
64
58
65{-# INLINE benchWithPostscan #-}
59{-# INLINE benchWithPostscan #-}
66benchWithPostscan :: Int -> String -> Fold IO Double a -> Benchmark
60benchWithPostscan :: Int -> String -> Fold IO Double a -> Benchmark
67benchWithPostscan = benchScanWith source
61benchWithPostscan = benchScanWith source
68
62
69−o_1_space_folds :: Int -> [Benchmark]
63+{-# INLINE numElements #-}
70−o_1_space_folds numElements =
64+numElements :: Int
65+numElements = 100000
66+
67+main :: IO ()
68+main =
69+ defaultMain
71− [ bgroup "fold"
70+ [ bgroup
71+ "fold"
72 [ benchWithFold numElements "minimum (window size 100)"
72 [ benchWithFold numElements "minimum (window size 100)"
73− (Window.windowMinimum 100)
73+ (Window.minimum 100)
74 , benchWithFold numElements "minimum (window size 1000)"
74 , benchWithFold numElements "minimum (window size 1000)"
75− (Window.windowMinimum 1000)
75+ (Window.minimum 1000)
76 , benchWith sourceDescendingInt numElements
76 , benchWith sourceDescendingInt numElements
77 "minimum descending (window size 1000)"
77 "minimum descending (window size 1000)"
78− (Window.windowMinimum 1000)
78+ (Window.minimum 1000)
79
79
80 , benchWithFold numElements "maximum (window size 100)"
80 , benchWithFold numElements "maximum (window size 100)"
81− (Window.windowMaximum 100)
81+ (Window.maximum 100)
82 , benchWithFold numElements "maximum (window size 1000)"
82 , benchWithFold numElements "maximum (window size 1000)"
83− (Window.windowMaximum 1000)
83+ (Window.maximum 1000)
84 , benchWith sourceDescendingInt numElements
84 , benchWith sourceDescendingInt numElements
85 "maximum descending (window size 1000)"
85 "maximum descending (window size 1000)"
86− (Window.windowMaximum 1000)
86+ (Window.maximum 1000)
87
87
88 , benchWithFold numElements "range (window size 100)"
88 , benchWithFold numElements "range (window size 100)"
89− (Window.windowRange 100)
89+ (Window.range 100)
90 , benchWithFold numElements "range (window size 1000)"
90 , benchWithFold numElements "range (window size 1000)"
91− (Window.windowRange 1000)
91+ (Window.range 1000)
92 , benchWith sourceDescendingInt numElements
92 , benchWith sourceDescendingInt numElements
93 "range descending (window size 1000)"
93 "range descending (window size 1000)"
94− (Window.windowRange 1000)
94+ (Window.range 1000)
95
95
96 , benchWithFoldInt numElements "sumInt (window size 100)"
96 , benchWithFoldInt numElements "sumInt (window size 100)"
97− (Ring.slidingWindow 100 Window.windowSumInt)
97+ (Ring.slidingWindow 100 Window.sumInt)
98 , benchWithFoldInt numElements "sum for Int (window size 100)"
98 , benchWithFoldInt numElements "sum for Int (window size 100)"
99− (Ring.slidingWindow 100 Window.windowSum)
99+ (Ring.slidingWindow 100 Window.sum)
100 , benchWithFold numElements "sum (window size 100)"
100 , benchWithFold numElements "sum (window size 100)"
101− (Ring.slidingWindow 100 Window.windowSum)
101+ (Ring.slidingWindow 100 Window.sum)
102 , benchWithFold numElements "sum (window size 1000)"
102 , benchWithFold numElements "sum (window size 1000)"
103− (Ring.slidingWindow 1000 Window.windowSum)
103+ (Ring.slidingWindow 1000 Window.sum)
104 , benchWithFold numElements "sum (entire stream)"
104 , benchWithFold numElements "sum (entire stream)"
105− (Window.cumulative Window.windowSum)
105+ (Window.cumulative Window.sum)
106 , benchWithFold numElements "sum (Data.Fold)"
106 , benchWithFold numElements "sum (Data.Fold)"
107 Fold.sum
107 Fold.sum
108
108
109 , benchWithFold numElements "mean (window size 100)"
109 , benchWithFold numElements "mean (window size 100)"
110− (Ring.slidingWindow 100 Window.windowMean)
110+ (Ring.slidingWindow 100 Window.mean)
111 , benchWithFold numElements "mean (window size 1000)"
111 , benchWithFold numElements "mean (window size 1000)"
112− (Ring.slidingWindow 1000 Window.windowMean)
112+ (Ring.slidingWindow 1000 Window.mean)
113 , benchWithFold numElements "mean (entire stream)"
113 , benchWithFold numElements "mean (entire stream)"
114− (Window.cumulative Window.windowMean)
114+ (Window.cumulative Window.mean)
115 , benchWithFold numElements "mean (Data.Fold)"
115 , benchWithFold numElements "mean (Data.Fold)"
116 Fold.mean
116 Fold.mean
117
117
118 , benchWithFold numElements "powerSum 2 (window size 100)"
118 , benchWithFold numElements "powerSum 2 (window size 100)"
119− (Ring.slidingWindow 100 (Window.windowPowerSum 2))
119+ (Ring.slidingWindow 100 (Window.powerSum 2))
120 , benchWithFold numElements "powerSum 2 (entire stream)"
120 , benchWithFold numElements "powerSum 2 (entire stream)"
121− (Window.cumulative (Window.windowPowerSum 2))
121+ (Window.cumulative (Window.powerSum 2))
122
122
123 ]
123 ]
124− ]
125−
126−o_1_space_scans :: Int -> [Benchmark]
127−o_1_space_scans numElements =
128− [ bgroup "scan"
124+ , bgroup
125+ "scan"
129 [ benchWithPostscan numElements "minimum (window size 10)"
126 [ benchWithPostscan numElements "minimum (window size 10)"
130− (Window.windowMinimum 10)
127+ (Window.minimum 10)
131 -- Below window size 30 the linear search based impl performs better
128 -- Below window size 30 the linear search based impl performs better
132 -- than the dequeue based implementation.
129 -- than the dequeue based implementation.
133 , benchWithPostscan numElements "minimum (window size 30)"
130 , benchWithPostscan numElements "minimum (window size 30)"
134− (Window.windowMinimum 30)
131+ (Window.minimum 30)
135 , benchWithPostscan numElements "minimum (window size 1000)"
132 , benchWithPostscan numElements "minimum (window size 1000)"
136− (Window.windowMinimum 1000)
133+ (Window.minimum 1000)
137 , benchScanWith sourceDescendingInt numElements
134 , benchScanWith sourceDescendingInt numElements
138 "minimum descending (window size 1000)"
135 "minimum descending (window size 1000)"
139− (Window.windowMinimum 1000)
136+ (Window.minimum 1000)
140
137
141 , benchWithPostscan numElements "maximum (window size 10)"
138 , benchWithPostscan numElements "maximum (window size 10)"
142− (Window.windowMaximum 10)
139+ (Window.maximum 10)
143 , benchWithPostscan numElements "maximum (window size 30)"
140 , benchWithPostscan numElements "maximum (window size 30)"
144− (Window.windowMaximum 30)
141+ (Window.maximum 30)
145 , benchWithPostscan numElements "maximum (window size 1000)"
142 , benchWithPostscan numElements "maximum (window size 1000)"
146− (Window.windowMaximum 1000)
143+ (Window.maximum 1000)
147 , benchScanWith sourceDescendingInt numElements
144 , benchScanWith sourceDescendingInt numElements
148 "maximum descending (window size 1000)"
145 "maximum descending (window size 1000)"
149− (Window.windowMaximum 1000)
146+ (Window.maximum 1000)
150
147
151 , benchWithPostscan numElements "range (window size 10)"
148 , benchWithPostscan numElements "range (window size 10)"
152− (Window.windowRange 10)
149+ (Window.range 10)
153 , benchWithPostscan numElements "range (window size 30)"
150 , benchWithPostscan numElements "range (window size 30)"
154− (Window.windowRange 30)
151+ (Window.range 30)
155 , benchWithPostscan numElements "range (window size 1000)"
152 , benchWithPostscan numElements "range (window size 1000)"
156− (Window.windowRange 1000)
153+ (Window.range 1000)
157 , benchScanWith sourceDescendingInt numElements
154 , benchScanWith sourceDescendingInt numElements
158 "range descending (window size 1000)"
155 "range descending (window size 1000)"
159− (Window.windowRange 1000)
156+ (Window.range 1000)
160
157
161 , benchWithPostscan numElements "sum (window size 100)"
158 , benchWithPostscan numElements "sum (window size 100)"
162− (Ring.slidingWindow 100 Window.windowSum)
159+ (Ring.slidingWindow 100 Window.sum)
163 , benchWithPostscan numElements "sum (window size 1000)"
160 , benchWithPostscan numElements "sum (window size 1000)"
164− (Ring.slidingWindow 1000 Window.windowSum)
161+ (Ring.slidingWindow 1000 Window.sum)
165
162
166 , benchWithPostscan numElements "mean (window size 100)"
163 , benchWithPostscan numElements "mean (window size 100)"
167− (Ring.slidingWindow 100 Window.windowMean)
164+ (Ring.slidingWindow 100 Window.mean)
168 , benchWithPostscan numElements "mean (window size 1000)"
165 , benchWithPostscan numElements "mean (window size 1000)"
169− (Ring.slidingWindow 1000 Window.windowMean)
166+ (Ring.slidingWindow 1000 Window.mean)
170
167
171 , benchWithPostscan numElements "powerSum 2 (window size 100)"
168 , benchWithPostscan numElements "powerSum 2 (window size 100)"
172− (Ring.slidingWindow 100 (Window.windowPowerSum 2))
169+ (Ring.slidingWindow 100 (Window.powerSum 2))
173 , benchWithPostscan numElements "powerSum 2 (window size 1000)"
170 , benchWithPostscan numElements "powerSum 2 (window size 1000)"
174− (Ring.slidingWindow 1000 (Window.windowPowerSum 2))
171+ (Ring.slidingWindow 1000 (Window.powerSum 2))
175 ]
172 ]
176 ]
173 ]
177−
178−moduleName :: String
179−moduleName = "Data.Fold.Window"
180−
181−main :: IO ()
182−main = runWithCLIOpts defaultStreamSize allBenchmarks
183−
184− where
185−
186− allBenchmarks value =
187− [ bgroup (o_1_space_prefix moduleName) $ concat
188− [ o_1_space_folds value
189− , o_1_space_scans value
190− ]
191− ]
benchmark/Streamly/Benchmark/Data/Parser.hs+196−556
@@ -1,10 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3−#undef FUSION_CHECK
4−#ifdef FUSION_CHECK
5−{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
6−#endif
7−
8-- |
1-- |
9-- Module : Streamly.Benchmark.Data.Parser
2-- Module : Streamly.Benchmark.Data.Parser
10-- Copyright : (c) 2020 Composewell Technologies
3-- Copyright : (c) 2020 Composewell Technologies
@@ -15,41 +8,39 @@
15{-# LANGUAGE CPP #-}
8{-# LANGUAGE CPP #-}
16{-# LANGUAGE FlexibleContexts #-}
9{-# LANGUAGE FlexibleContexts #-}
17{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE ScopedTypeVariables #-}
18−{-# OPTIONS_GHC -Wno-orphans #-}
19
11
20module Main
12module Main
21 (
13 (
22 main
14 main
23 ) where
15 ) where
24
16
25−import Control.Applicative ((<|>))
26import Control.DeepSeq (NFData(..))
17import Control.DeepSeq (NFData(..))
27−import Data.Function ((&))
18+import Control.Monad.Catch (MonadCatch, try, SomeException)
19+import Data.Foldable (asum)
28import Data.Functor (($>))
20import Data.Functor (($>))
21+import Data.Maybe (fromMaybe)
29import Data.Monoid (Sum(..))
22import Data.Monoid (Sum(..))
30import GHC.Magic (inline)
23import GHC.Magic (inline)
31import GHC.Magic (noinline)
24import GHC.Magic (noinline)
32import System.IO (Handle)
25import System.IO (Handle)
33import System.Random (randomRIO)
26import System.Random (randomRIO)
34−import Streamly.Internal.Data.Fold (Fold(..))
35−import Streamly.Internal.Data.Parser
36− (ParseError(..), Parser(..), Initial(..), Step(..))
37−import Streamly.Internal.Data.Stream (Stream)
38import Prelude hiding
27import Prelude hiding
39− (any, all, take, sequence, sequence_, sequenceA, takeWhile, dropWhile, span)
28+ (any, all, take, sequence, sequence_, sequenceA, takeWhile, dropWhile)
40
29
41−import qualified Control.Applicative as AP
42−import qualified Data.Foldable as F
43import qualified Data.Traversable as TR
30import qualified Data.Traversable as TR
31+import qualified Data.Foldable as F
32+import qualified Control.Applicative as AP
44import qualified Streamly.FileSystem.Handle as Handle
33import qualified Streamly.FileSystem.Handle as Handle
45−import qualified Streamly.Internal.Data.Array as Array
34+import qualified Streamly.Prelude as S
35+import qualified Streamly.Internal.Data.Array.Unboxed as Array
46−import qualified Streamly.Internal.Data.Fold as Fold
36+import qualified Streamly.Internal.Data.Fold as FL
47import qualified Streamly.Internal.Data.Parser as PR
37import qualified Streamly.Internal.Data.Parser as PR
48−import qualified Streamly.Data.Stream as Stream
38+import qualified Streamly.Internal.Data.Stream.IsStream as IP
49import qualified Streamly.Internal.Data.Producer as Producer
39import qualified Streamly.Internal.Data.Producer as Producer
50−import qualified Streamly.Internal.Data.Stream as Stream
40+import qualified Streamly.Internal.Data.Producer.Source as Source
51
41
52−import Test.Tasty.Bench hiding (env)
42+import Gauge hiding (env)
43+import Streamly.Prelude (SerialT)
53import Streamly.Benchmark.Common
44import Streamly.Benchmark.Common
54import Streamly.Benchmark.Common.Handle
45import Streamly.Benchmark.Common.Handle
55
46
@@ -60,8 +51,8 @@ import Streamly.Benchmark.Common.Handle
60-- XXX these can be moved to the common module
51-- XXX these can be moved to the common module
61
52
62{-# INLINE sourceUnfoldrM #-}
53{-# INLINE sourceUnfoldrM #-}
63−sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
54+sourceUnfoldrM :: (S.IsStream t, S.MonadAsync m) => Int -> Int -> t m Int
64−sourceUnfoldrM value n = Stream.unfoldrM step n
55+sourceUnfoldrM value n = S.unfoldrM step n
65 where
56 where
66 step cnt =
57 step cnt =
67 if cnt > n + value
58 if cnt > n + value
@@ -74,11 +65,11 @@ sourceUnfoldrM value n = Stream.unfoldrM step n
74-- sequence of `}`.
65-- sequence of `}`.
75{-# INLINE sourceEscapedFrames #-}
66{-# INLINE sourceEscapedFrames #-}
76sourceEscapedFrames ::
67sourceEscapedFrames ::
77− Monad m
68+ (S.IsStream t, S.MonadAsync m)
78 => Int
69 => Int
79 -> Int
70 -> Int
80− -> Stream m Char
71+ -> t m Char
81−sourceEscapedFrames value n = Stream.unfoldrM step n
72+sourceEscapedFrames value n = S.unfoldrM step n
82 where
73 where
83
74
84 bs = '\\'
75 bs = '\\'
@@ -100,10 +91,10 @@ sourceEscapedFrames value n = Stream.unfoldrM step n
100{-# INLINE benchIOSrc #-}
91{-# INLINE benchIOSrc #-}
101benchIOSrc
92benchIOSrc
102 :: NFData b
93 :: NFData b
103− => (Int -> Int -> Stream IO a)
94+ => (Int -> Int -> t IO a)
104 -> Int
95 -> Int
105 -> String
96 -> String
106− -> (Stream IO a -> IO b)
97+ -> (t IO a -> IO b)
107 -> Benchmark
98 -> Benchmark
108benchIOSrc src value name f =
99benchIOSrc src value name f =
109 bench name $ nfIO $ randomRIO (1,1) >>= f . src value
100 bench name $ nfIO $ randomRIO (1,1) >>= f . src value
@@ -111,8 +102,8 @@ benchIOSrc src value name f =
111-- | Takes a fold method, and uses it with a default source.
102-- | Takes a fold method, and uses it with a default source.
112{-# INLINE benchIOSink #-}
103{-# INLINE benchIOSink #-}
113benchIOSink
104benchIOSink
114− :: NFData b
105+ :: (S.IsStream t, NFData b)
115− => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
106+ => Int -> String -> (t IO Int -> IO b) -> Benchmark
116benchIOSink value name f =
107benchIOSink value name f =
117 bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
108 bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
118
109
@@ -120,30 +111,39 @@ benchIOSink value name f =
120-- Parsers
111-- Parsers
121-------------------------------------------------------------------------------
112-------------------------------------------------------------------------------
122
113
114+{-# INLINE one #-}
115+one :: MonadCatch m => Int -> SerialT m Int -> m (Maybe Int)
116+one value = IP.parse p
117+
118+ where
119+
120+ p = do
121+ m <- PR.fromFold FL.one
122+ case m of
123+ Just i -> if i >= value then pure m else p
124+ Nothing -> pure Nothing
125+
123{-# INLINE takeBetween #-}
126{-# INLINE takeBetween #-}
124−takeBetween :: Monad m => Int -> Stream m a -> m (Either ParseError ())
127+takeBetween :: MonadCatch m => Int -> SerialT m a -> m ()
125−takeBetween value = Stream.parse (PR.takeBetween 0 value Fold.drain)
128+takeBetween value = IP.parse (PR.takeBetween 0 value FL.drain)
126
129
127{-# INLINE takeEQ #-}
130{-# INLINE takeEQ #-}
128−takeEQ :: Monad m => Int -> Stream m a -> m (Either ParseError ())
131+takeEQ :: MonadCatch m => Int -> SerialT m a -> m ()
129−takeEQ value = Stream.parse (PR.takeEQ value Fold.drain)
132+takeEQ value = IP.parse (PR.takeEQ value FL.drain)
130−
131−{-# INLINE takeGE #-}
132−takeGE :: Monad m => Int -> Stream m a -> m (Either ParseError ())
133−takeGE value = Stream.parse (PR.takeGE value Fold.drain)
134
133
135{-# INLINE dropWhile #-}
134{-# INLINE dropWhile #-}
136−dropWhile :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
135+dropWhile :: MonadCatch m => Int -> SerialT m Int -> m ()
137−dropWhile value = Stream.parse (PR.dropWhile (<= value))
136+dropWhile value = IP.parse (PR.dropWhile (<= value))
138
137
139{-# INLINE takeStartBy #-}
138{-# INLINE takeStartBy #-}
140−takeStartBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
139+takeStartBy :: MonadCatch m => Int -> SerialT m Int -> m ()
141takeStartBy value stream = do
140takeStartBy value stream = do
141+ stream1 <- return . fromMaybe (S.fromPure (value + 1)) =<< S.tail stream
142− let stream2 = value `Stream.cons` stream
142+ let stream2 = value `S.cons` stream1
143− Stream.parse (PR.takeStartBy (== value) Fold.drain) stream2
143+ IP.parse (PR.takeStartBy (== value) FL.drain) stream2
144
144
145−takeFramedByEsc_ :: Monad m => Int -> Stream m Char -> m (Either ParseError ())
145+takeFramedByEsc_ :: MonadCatch m => Int -> SerialT m Char -> m ()
146−takeFramedByEsc_ _ = Stream.parse parser
146+takeFramedByEsc_ _ = IP.parse parser
147
147
148 where
148 where
149
149
@@ -151,421 +151,192 @@ takeFramedByEsc_ _ = Stream.parse parser
151 isBegin = (== '{')
151 isBegin = (== '{')
152 isEnd = (== '}')
152 isEnd = (== '}')
153
153
154− parser = PR.takeFramedByEsc_ isEsc isBegin isEnd Fold.drain
154+ parser = PR.takeFramedByEsc_ isEsc isBegin isEnd FL.drain
155−
156−{-# INLINE listEqBy #-}
157−listEqBy :: Int -> Stream IO Int -> IO (Either ParseError [Int])
158−listEqBy len = Stream.parse (PR.listEqBy (==) [1 .. len])
159−
160−{-# INLINE streamEqBy #-}
161−streamEqBy :: Int -> Stream IO Int -> IO (Either ParseError ())
162−streamEqBy len = Stream.parse (PR.streamEqBy (==) (Stream.enumerateFromTo 1 len))
163
155
164{-# INLINE takeWhile #-}
156{-# INLINE takeWhile #-}
165−takeWhile :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
157+takeWhile :: MonadCatch m => Int -> SerialT m Int -> m ()
166−takeWhile value = Stream.parse (PR.takeWhile (<= value) Fold.drain)
158+takeWhile value = IP.parse (PR.takeWhile (<= value) FL.drain)
167
159
168−takeWhileP :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
160+takeWhileP :: MonadCatch m => Int -> SerialT m Int -> m ()
169takeWhileP value =
161takeWhileP value =
170− Stream.parse (PR.takeWhileP (<= value) (PR.takeWhile (<= value - 1) Fold.drain))
162+ IP.parse (PR.takeWhileP (<= value) (PR.takeWhile (<= value - 1) FL.drain))
171
163
172{-# INLINE takeP #-}
164{-# INLINE takeP #-}
173−takeP :: Monad m => Int -> Stream m a -> m (Either ParseError ())
165+takeP :: MonadCatch m => Int -> SerialT m a -> m ()
174−takeP value = Stream.parse (PR.takeP value (PR.fromFold Fold.drain))
166+takeP value = IP.parse (PR.takeP value (PR.fromFold FL.drain))
175
167
176{-# INLINE groupBy #-}
168{-# INLINE groupBy #-}
177−groupBy :: Monad m => Stream m Int -> m (Either ParseError ())
169+groupBy :: MonadCatch m => SerialT m Int -> m ()
178−groupBy = Stream.parse (PR.groupBy (<=) Fold.drain)
170+groupBy = IP.parse (PR.groupBy (<=) FL.drain)
179
171
180{-# INLINE groupByRolling #-}
172{-# INLINE groupByRolling #-}
181−groupByRolling :: Monad m => Stream m Int -> m (Either ParseError ())
173+groupByRolling :: MonadCatch m => SerialT m Int -> m ()
182−groupByRolling = Stream.parse (PR.groupByRolling (<=) Fold.drain)
174+groupByRolling = IP.parse (PR.groupByRolling (<=) FL.drain)
183
175
184{-# INLINE wordBy #-}
176{-# INLINE wordBy #-}
185−wordBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
177+wordBy :: MonadCatch m => Int -> SerialT m Int -> m ()
186−wordBy value = Stream.parse (PR.wordBy (>= value) Fold.drain)
178+wordBy value = IP.parse (PR.wordBy (>= value) FL.drain)
187
179
188{-# INLINE sepByWords #-}
180{-# INLINE sepByWords #-}
189−sepByWords :: Monad m => Stream m Int -> m (Either ParseError ())
181+sepByWords :: MonadCatch m => Int -> SerialT m Int -> m ()
190−sepByWords = Stream.parse (wrds even Fold.drain)
182+sepByWords _ = IP.parse (wrds even FL.drain)
191 where
183 where
192− wrds p = PR.sepBy (PR.takeWhile (not . p) Fold.drain) (PR.dropWhile p)
184+ wrds p f = PR.sepBy f (PR.takeWhile (not . p) FL.drain) (PR.dropWhile p)
193−
194−{-# INLINE sepByAllWords #-}
195−sepByAllWords :: Monad m => Stream m Int -> m (Either ParseError ())
196−sepByAllWords = Stream.parse (wrds even Fold.drain)
197− where
198− wrds p = PR.sepByAll (PR.takeWhile (not . p) Fold.drain) (PR.dropWhile p)
199−
200−-- Returning a list to compare with the sepBy1 in ParserK
201−{-# INLINE sepBy1 #-}
202−sepBy1 :: Monad m => Stream m Int -> m (Either ParseError [Int])
203−sepBy1 xs = do
204− Stream.parse (PR.sepBy1 (PR.satisfy odd) (PR.satisfy even) Fold.toList) xs
205−
206−{-# INLINE sepByWords1 #-}
207−sepByWords1 :: Monad m => Stream m Int -> m (Either ParseError ())
208−sepByWords1 = Stream.parse (wrds even Fold.drain)
209− where
210− wrds p = PR.sepBy1 (PR.takeWhile (not . p) Fold.drain) (PR.dropWhile p)
211
185
212{-# INLINE deintercalate #-}
186{-# INLINE deintercalate #-}
213−deintercalate :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
187+deintercalate :: MonadCatch m => Int -> SerialT m Int -> m ()
214−deintercalate _ = Stream.parse (partition even)
188+deintercalate _ = IP.parse (partition even)
215
189
216 where
190 where
217
191
218 partition p =
192 partition p =
219 PR.deintercalate
193 PR.deintercalate
220− (PR.takeWhile (not . p) Fold.sum) (PR.takeWhile p Fold.sum) Fold.drain
221−
222−{-# INLINE deintercalate1 #-}
223−deintercalate1 :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
224−deintercalate1 _ = Stream.parse (partition even)
225−
226− where
227−
228− partition p =
229− PR.deintercalate1
230− (PR.takeWhile (not . p) Fold.sum) (PR.takeWhile p Fold.sum) Fold.drain
194+ FL.drain (PR.takeWhile (not . p) FL.sum) (PR.takeWhile p FL.sum)
231−
232−{-# INLINE deintercalateAll #-}
233−deintercalateAll :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
234−deintercalateAll _ = Stream.parse (partition even)
235−
236− where
237−
238− partition p =
239− PR.deintercalateAll
240− (PR.takeWhile (not . p) Fold.sum) (PR.takeWhile p Fold.sum) Fold.drain
241
195
242{-# INLINE manyWordByEven #-}
196{-# INLINE manyWordByEven #-}
243−manyWordByEven :: Monad m => Stream m Int -> m (Either ParseError ())
197+manyWordByEven :: MonadCatch m => SerialT m Int -> m ()
244−manyWordByEven = Stream.parse (PR.many (PR.wordBy even Fold.drain) Fold.drain)
198+manyWordByEven = IP.parse (PR.many (PR.wordBy even FL.drain) FL.drain)
245
199
246{-# INLINE many #-}
200{-# INLINE many #-}
247−many :: Monad m => Stream m Int -> m (Either ParseError Int)
201+many :: MonadCatch m => SerialT m Int -> m Int
248−many = Stream.parse (PR.many (PR.satisfy (> 0)) Fold.length)
202+many = IP.parse (PR.many (PR.satisfy (> 0)) FL.length)
249
203
250{-# INLINE manyAlt #-}
204{-# INLINE manyAlt #-}
251−manyAlt :: Monad m => Stream m Int -> m Int
205+manyAlt :: MonadCatch m => SerialT m Int -> m Int
252manyAlt xs = do
206manyAlt xs = do
253− x <- Stream.parse (AP.many (PR.satisfy (> 0))) xs
207+ x <- IP.parse (AP.many (PR.satisfy (> 0))) xs
254 return $ Prelude.length x
208 return $ Prelude.length x
255
209
256{-# INLINE some #-}
210{-# INLINE some #-}
257−some :: Monad m => Stream m Int -> m (Either ParseError Int)
211+some :: MonadCatch m => SerialT m Int -> m Int
258−some = Stream.parse (PR.some (PR.satisfy (> 0)) Fold.length)
212+some = IP.parse (PR.some (PR.satisfy (> 0)) FL.length)
259
213
260{-# INLINE someAlt #-}
214{-# INLINE someAlt #-}
261−someAlt :: Monad m => Stream m Int -> m Int
215+someAlt :: MonadCatch m => SerialT m Int -> m Int
262someAlt xs = do
216someAlt xs = do
263− x <- Stream.parse (AP.some (PR.satisfy (> 0))) xs
217+ x <- IP.parse (AP.some (PR.satisfy (> 0))) xs
264 return $ Prelude.length x
218 return $ Prelude.length x
265
219
266{-# INLINE manyTill #-}
220{-# INLINE manyTill #-}
267−manyTill :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
221+manyTill :: MonadCatch m => Int -> SerialT m Int -> m Int
268manyTill value =
222manyTill value =
269− Stream.parse (PR.manyTill (PR.satisfy (> 0)) (PR.satisfy (== value)) Fold.length)
223+ IP.parse (PR.manyTill (PR.satisfy (> 0)) (PR.satisfy (== value)) FL.length)
270
224
271−{-# INLINE splitAp2 #-}
225+{-# INLINE splitAp #-}
272−splitAp2 :: Monad m
226+splitAp :: MonadCatch m
273− => Int -> Stream m Int -> m (Either ParseError ((), ()))
227+ => Int -> SerialT m Int -> m ((), ())
274−splitAp2 value =
228+splitAp value =
275− Stream.parse
229+ IP.parse
276 ((,)
230 ((,)
277 <$> PR.dropWhile (<= (value `div` 2))
231 <$> PR.dropWhile (<= (value `div` 2))
278 <*> PR.dropWhile (<= value)
232 <*> PR.dropWhile (<= value)
279 )
233 )
280
234
281−{-# INLINE splitAp4 #-}
282−splitAp4 :: Monad m
283− => Int -> Stream m Int -> m (Either ParseError ())
284−splitAp4 value =
285− Stream.parse
286− ( (\() () () () -> ())
287− <$> PR.dropWhile (<= (value * 1 `div` 4))
288− <*> PR.dropWhile (<= (value * 2 `div` 4))
289− <*> PR.dropWhile (<= (value * 3 `div` 4))
290− <*> PR.dropWhile (<= value)
291− )
292−
293−{-# INLINE splitAp8 #-}
294−splitAp8 :: Monad m
295− => Int -> Stream m Int -> m (Either ParseError ())
296−splitAp8 value =
297− Stream.parse
298− ( (\() () () () () () () () -> ())
299− <$> PR.dropWhile (<= (value * 1 `div` 8))
300− <*> PR.dropWhile (<= (value * 2 `div` 8))
301− <*> PR.dropWhile (<= (value * 3 `div` 8))
302− <*> PR.dropWhile (<= (value * 4 `div` 8))
303− <*> PR.dropWhile (<= (value * 5 `div` 8))
304− <*> PR.dropWhile (<= (value * 6 `div` 8))
305− <*> PR.dropWhile (<= (value * 7 `div` 8))
306− <*> PR.dropWhile (<= value)
307− )
308−
309{-# INLINE splitApBefore #-}
235{-# INLINE splitApBefore #-}
310−splitApBefore :: Monad m
236+splitApBefore :: MonadCatch m
311− => Int -> Stream m Int -> m (Either ParseError ())
237+ => Int -> SerialT m Int -> m ()
312splitApBefore value =
238splitApBefore value =
313− Stream.parse
239+ IP.parse
314 ( PR.dropWhile (<= (value `div` 2))
240 ( PR.dropWhile (<= (value `div` 2))
315 *> PR.dropWhile (<= value)
241 *> PR.dropWhile (<= value)
316 )
242 )
317
243
318{-# INLINE splitApAfter #-}
244{-# INLINE splitApAfter #-}
319−splitApAfter :: Monad m
245+splitApAfter :: MonadCatch m
320− => Int -> Stream m Int -> m (Either ParseError ())
246+ => Int -> SerialT m Int -> m ()
321splitApAfter value =
247splitApAfter value =
322− Stream.parse
248+ IP.parse
323 ( PR.dropWhile (<= (value `div` 2))
249 ( PR.dropWhile (<= (value `div` 2))
324 <* PR.dropWhile (<= value)
250 <* PR.dropWhile (<= value)
325 )
251 )
326
252
327−{-# INLINE splitWith2 #-}
253+{-# INLINE serialWith #-}
328−splitWith2 :: Monad m
254+serialWith :: MonadCatch m
329− => Int -> Stream m Int -> m (Either ParseError ((), ()))
255+ => Int -> SerialT m Int -> m ((), ())
330−splitWith2 value =
256+serialWith value =
331− Stream.parse
257+ IP.parse
332− (PR.splitWith (,)
258+ (PR.serialWith (,)
333 (PR.dropWhile (<= (value `div` 2)))
259 (PR.dropWhile (<= (value `div` 2)))
334 (PR.dropWhile (<= value))
260 (PR.dropWhile (<= value))
335 )
261 )
336
262
337{-# INLINE split_ #-}
263{-# INLINE split_ #-}
338−split_ :: Monad m
264+split_ :: MonadCatch m
339− => Int -> Stream m Int -> m (Either ParseError ())
265+ => Int -> SerialT m Int -> m ()
340split_ value =
266split_ value =
341− Stream.parse
267+ IP.parse
342 (PR.split_
268 (PR.split_
343 (PR.dropWhile (<= (value `div` 2)))
269 (PR.dropWhile (<= (value `div` 2)))
344 (PR.dropWhile (<= value))
270 (PR.dropWhile (<= value))
345 )
271 )
346
272
347−-- XXX dropWhile with applicative does not fuse
348−-- PR.dropWhile (<= (value * 1 `div` 4)) *> PR.die "alt"
349−{-# INLINE takeWhileFail #-}
350−takeWhileFail :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
351−takeWhileFail predicate (Fold fstep finitial _ ffinal) =
352− Parser step initial extract
353−
354− where
355−
356− initial = do
357− res <- finitial
358− return $ case res of
359− Fold.Partial s -> IPartial s
360− Fold.Done b -> IDone b
361−
362− step s a =
363− if predicate a
364− then do
365− fres <- fstep s a
366− return
367− $ case fres of
368− Fold.Partial s1 -> Partial 0 s1
369− Fold.Done b -> Done 0 b
370− else return $ Error "fail"
371−
372− extract s = fmap (Done 0) (ffinal s)
373−
374−{-# INLINE alt2 #-}
375−alt2 :: Monad m
376− => Int -> Stream m Int -> m (Either ParseError ())
377−alt2 value =
378− Stream.parse
379− (PR.alt
380− (takeWhileFail (<= (value `div` 2)) Fold.drain)
381− (PR.dropWhile (<= value))
382− )
383−
384−{-# INLINE alt4 #-}
385−alt4 :: Monad m
386− => Int -> Stream m Int -> m (Either ParseError ())
387−alt4 value =
388− Stream.parse
389− ( takeWhileFail (<= (value * 1 `div` 4)) Fold.drain
390− <|> takeWhileFail (<= (value * 2 `div` 4)) Fold.drain
391− <|> takeWhileFail (<= (value * 3 `div` 4)) Fold.drain
392− <|> PR.dropWhile (<= value)
393− )
394−
395−{-# INLINE alt8 #-}
396−alt8 :: Monad m
397− => Int -> Stream m Int -> m (Either ParseError ())
398−alt8 value =
399− Stream.parse
400− ( takeWhileFail (<= (value * 1 `div` 8)) Fold.drain
401− <|> takeWhileFail (<= (value * 2 `div` 8)) Fold.drain
402− <|> takeWhileFail (<= (value * 3 `div` 8)) Fold.drain
403− <|> takeWhileFail (<= (value * 4 `div` 8)) Fold.drain
404− <|> takeWhileFail (<= (value * 5 `div` 8)) Fold.drain
405− <|> takeWhileFail (<= (value * 6 `div` 8)) Fold.drain
406− <|> takeWhileFail (<= (value * 7 `div` 8)) Fold.drain
407− <|> PR.dropWhile (<= value)
408− )
409−
410−{-# INLINE alt16 #-}
411−alt16 :: Monad m
412− => Int -> Stream m Int -> m (Either ParseError ())
413−alt16 value =
414− Stream.parse
415− ( takeWhileFail (<= (value * 1 `div` 16)) Fold.drain
416− <|> takeWhileFail (<= (value * 2 `div` 16)) Fold.drain
417− <|> takeWhileFail (<= (value * 3 `div` 16)) Fold.drain
418− <|> takeWhileFail (<= (value * 4 `div` 16)) Fold.drain
419− <|> takeWhileFail (<= (value * 5 `div` 16)) Fold.drain
420− <|> takeWhileFail (<= (value * 6 `div` 16)) Fold.drain
421− <|> takeWhileFail (<= (value * 8 `div` 16)) Fold.drain
422− <|> takeWhileFail (<= (value * 9 `div` 16)) Fold.drain
423− <|> takeWhileFail (<= (value * 10 `div` 16)) Fold.drain
424− <|> takeWhileFail (<= (value * 11 `div` 16)) Fold.drain
425− <|> takeWhileFail (<= (value * 12 `div` 16)) Fold.drain
426− <|> takeWhileFail (<= (value * 13 `div` 16)) Fold.drain
427− <|> takeWhileFail (<= (value * 14 `div` 16)) Fold.drain
428− <|> takeWhileFail (<= (value * 15 `div` 16)) Fold.drain
429− <|> PR.dropWhile (<= value)
430− )
431−
432−{-# INLINE altSmall #-}
433−altSmall :: Monad m
434− => Int -> Stream m Int -> m ()
435−altSmall value =
436− Stream.fold Fold.drain .
437− Stream.parseMany
438− (PR.alt
439− (PR.satisfy (>= value) *> PR.die "alt")
440− (PR.satisfy (<= value))
441− )
442−
443−{-# INLINE monad #-}
444−monad :: Monad m
445− => Int -> Stream m Int -> m (Either ParseError ())
446−monad value =
447− Stream.parse
448− $ do
449− PR.dropWhile (<= (value `div` 2))
450− PR.dropWhile (<= value)
451−
452−{-# INLINE monad4 #-}
453−monad4 :: Monad m
454− => Int -> Stream m Int -> m (Either ParseError ())
455−monad4 value =
456− Stream.parse $ do
457− PR.dropWhile (<= (value `div` 4))
458− PR.dropWhile (<= (value `div` 2))
459− PR.dropWhile (<= (value * 3 `div` 4))
460− PR.dropWhile (<= value)
461−
462−{-# INLINE monad8 #-}
463−monad8 :: Monad m
464− => Int -> Stream m Int -> m (Either ParseError ())
465−monad8 value =
466− Stream.parse $ do
467− PR.dropWhile (<= (value * 1 `div` 8))
468− PR.dropWhile (<= (value * 2 `div` 8))
469− PR.dropWhile (<= (value * 3 `div` 8))
470− PR.dropWhile (<= (value * 4 `div` 8))
471− PR.dropWhile (<= (value * 5 `div` 8))
472− PR.dropWhile (<= (value * 6 `div` 8))
473− PR.dropWhile (<= (value * 7 `div` 8))
474− PR.dropWhile (<= value)
475−
476−{-# INLINE monad16 #-}
477−monad16 :: Monad m
478− => Int -> Stream m Int -> m (Either ParseError ())
479−monad16 value =
480− Stream.parse $ do
481− PR.dropWhile (<= (value * 1 `div` 16))
482− PR.dropWhile (<= (value * 2 `div` 16))
483− PR.dropWhile (<= (value * 3 `div` 16))
484− PR.dropWhile (<= (value * 4 `div` 16))
485− PR.dropWhile (<= (value * 5 `div` 16))
486− PR.dropWhile (<= (value * 6 `div` 16))
487− PR.dropWhile (<= (value * 7 `div` 16))
488− PR.dropWhile (<= (value * 8 `div` 16))
489− PR.dropWhile (<= (value * 9 `div` 16))
490− PR.dropWhile (<= (value * 10 `div` 16))
491− PR.dropWhile (<= (value * 11 `div` 16))
492− PR.dropWhile (<= (value * 12 `div` 16))
493− PR.dropWhile (<= (value * 13 `div` 16))
494− PR.dropWhile (<= (value * 14 `div` 16))
495− PR.dropWhile (<= (value * 15 `div` 16))
496− PR.dropWhile (<= value)
497−
498{-# INLINE takeEndBy_ #-}
273{-# INLINE takeEndBy_ #-}
499−takeEndBy_ :: Monad m
274+takeEndBy_ :: MonadCatch m
500− => Int -> Stream m Int -> m (Either ParseError ())
275+ => Int -> SerialT m Int -> m()
501−takeEndBy_ value = Stream.parse (PR.takeEndBy_ (>= value) (PR.fromFold Fold.drain))
276+takeEndBy_ value = IP.parse (PR.takeEndBy_ (>= value) (PR.fromFold FL.drain))
502
277
503−{-
504{-# INLINE teeAllAny #-}
278{-# INLINE teeAllAny #-}
505−teeAllAny :: Monad m
279+teeAllAny :: MonadCatch m
506− => Int -> Stream m Int -> m ((), ())
280+ => Int -> SerialT m Int -> m ((), ())
507teeAllAny value =
281teeAllAny value =
508− Stream.parse
282+ IP.parse
509 (PR.teeWith (,)
283 (PR.teeWith (,)
510 (PR.dropWhile (<= value))
284 (PR.dropWhile (<= value))
511 (PR.dropWhile (<= value))
285 (PR.dropWhile (<= value))
512 )
286 )
513
287
514{-# INLINE teeFstAllAny #-}
288{-# INLINE teeFstAllAny #-}
515−teeFstAllAny :: Monad m
289+teeFstAllAny :: MonadCatch m
516− => Int -> Stream m Int -> m ((), ())
290+ => Int -> SerialT m Int -> m ((), ())
517teeFstAllAny value =
291teeFstAllAny value =
518− Stream.parse
292+ IP.parse
519 (PR.teeWithFst (,)
293 (PR.teeWithFst (,)
520 (PR.dropWhile (<= value))
294 (PR.dropWhile (<= value))
521 (PR.dropWhile (<= value))
295 (PR.dropWhile (<= value))
522 )
296 )
523
297
524{-# INLINE shortestAllAny #-}
298{-# INLINE shortestAllAny #-}
525−shortestAllAny :: Monad m
299+shortestAllAny :: MonadCatch m
526− => Int -> Stream m Int -> m (Either ParseError ())
300+ => Int -> SerialT m Int -> m ()
527shortestAllAny value =
301shortestAllAny value =
528− Stream.parse
302+ IP.parse
529 (PR.shortest
303 (PR.shortest
530 (PR.dropWhile (<= value))
304 (PR.dropWhile (<= value))
531 (PR.dropWhile (<= value))
305 (PR.dropWhile (<= value))
532 )
306 )
533
307
534{-# INLINE longestAllAny #-}
308{-# INLINE longestAllAny #-}
535−longestAllAny :: Monad m
309+longestAllAny :: MonadCatch m
536− => Int -> Stream m Int -> m (Either ParseError ())
310+ => Int -> SerialT m Int -> m ()
537longestAllAny value =
311longestAllAny value =
538− Stream.parse
312+ IP.parse
539 (PR.longest
313 (PR.longest
540 (PR.dropWhile (<= value))
314 (PR.dropWhile (<= value))
541 (PR.dropWhile (<= value))
315 (PR.dropWhile (<= value))
542 )
316 )
543−-}
317+
318+parseManyChunksOfSum :: Int -> Handle -> IO Int
319+parseManyChunksOfSum n inh =
320+ S.length
321+ $ IP.parseMany
322+ (PR.fromFold $ FL.take n FL.sum)
323+ (S.unfold Handle.read inh)
544
324
545-------------------------------------------------------------------------------
325-------------------------------------------------------------------------------
546−-- Spanning
326+-- Parsing with unfolds
547-------------------------------------------------------------------------------
327-------------------------------------------------------------------------------
548
328
549−{-# INLINE span #-}
329+{-# INLINE parseManyUnfoldArrays #-}
550−span :: Monad m => Int -> Stream m Int -> m (Either ParseError ((), ()))
330+parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
551−span value = Stream.parse (PR.span (<= (value `div` 2)) Fold.drain Fold.drain)
331+parseManyUnfoldArrays count arrays = do
552−
332+ let src = Source.source (Just (Producer.OuterLoop arrays))
553−{-# INLINE spanBy #-}
554−spanBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ((), ()))
555−spanBy value =
556− Stream.parse (PR.spanBy (\_ i -> i <= (value `div` 2)) Fold.drain Fold.drain)
557−
558−{-# INLINE spanByRolling #-}
559−spanByRolling :: Monad m => Int -> Stream m Int -> m (Either ParseError ((), ()))
560−spanByRolling value =
561− Stream.parse (PR.spanByRolling (\_ i -> i <= value `div` 2) Fold.drain Fold.drain)
562−
563−parseManyChunksOfSum :: Int -> Handle -> IO Int
564−parseManyChunksOfSum n inh =
565− Stream.fold Fold.length
566− $ Stream.parseMany
567− (PR.fromFold $ Fold.take n Fold.sum)
333+ let parser = PR.fromFold (FL.take count FL.drain)
568− (Stream.unfold Handle.reader inh)
334+ let readSrc =
335+ Source.producer
336+ $ Producer.concat Producer.fromList Array.producer
337+ let streamParser =
338+ Producer.simplify (Source.parseMany parser readSrc)
339+ S.drain $ S.unfold streamParser src
569
340
570-------------------------------------------------------------------------------
341-------------------------------------------------------------------------------
571-- Parsers in which -fspec-constr-recursive=16 is problematic
342-- Parsers in which -fspec-constr-recursive=16 is problematic
@@ -576,129 +347,75 @@ parseManyChunksOfSum n inh =
576-- not have to rely on it.
347-- not have to rely on it.
577--
348--
578{-# INLINE lookAhead #-}
349{-# INLINE lookAhead #-}
579−lookAhead :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
350+lookAhead :: MonadCatch m => Int -> SerialT m Int -> m ()
580lookAhead value =
351lookAhead value =
581− Stream.parse (PR.lookAhead (PR.takeWhile (<= value) Fold.drain) $> ())
352+ IP.parse (PR.lookAhead (PR.takeWhile (<= value) FL.drain) $> ())
582
353
583−-- XXX The timing of this increased 3x after the stepify extract changes.
584−{-# INLINE sequenceA_ #-}
585−sequenceA_ :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
586−sequenceA_ value =
587− Stream.parse (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
588−
589−-- quadratic complexity
590{-# INLINE sequenceA #-}
354{-# INLINE sequenceA #-}
591−sequenceA :: Monad m => Int -> Stream m Int -> m Int
355+sequenceA :: MonadCatch m => Int -> SerialT m Int -> m Int
592sequenceA value xs = do
356sequenceA value xs = do
593− x <- Stream.parse (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
357+ x <- IP.parse (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
594 return $ length x
358 return $ length x
595
359
596−-- quadratic complexity
360+{-# INLINE sequenceA_ #-}
361+sequenceA_ :: MonadCatch m => Int -> SerialT m Int -> m ()
362+sequenceA_ value =
363+ IP.parse (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
364+
597{-# INLINE sequence #-}
365{-# INLINE sequence #-}
598−sequence :: Monad m => Int -> Stream m Int -> m Int
366+sequence :: MonadCatch m => Int -> SerialT m Int -> m Int
599sequence value xs = do
367sequence value xs = do
600− x <- Stream.parse (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
368+ x <- IP.parse (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
601 return $ length x
369 return $ length x
602
370
603{-# INLINE sequence_ #-}
371{-# INLINE sequence_ #-}
604−sequence_ :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
372+sequence_ :: MonadCatch m => Int -> SerialT m Int -> m ()
605−sequence_ value xs =
373+sequence_ value =
606− Stream.parse (foldr f (return ()) (replicate value (PR.takeBetween 0 1 Fold.drain))) xs
374+ IP.parse (F.sequence_ $ replicate value (PR.satisfy (> 0)))
607−
608− where
609
375
610− {-# INLINE f #-}
611− f m k = m >>= (\_ -> k)
612−
613−-- choice using the "Alternative" instance with direct style parser type has
614−-- quadratic performance complexity.
615−--
616{-# INLINE choiceAsum #-}
376{-# INLINE choiceAsum #-}
617−choiceAsum :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
377+choiceAsum :: MonadCatch m => Int -> SerialT m Int -> m Int
618choiceAsum value =
378choiceAsum value =
619− Stream.parse (F.asum (replicate value (PR.satisfy (< 0)))
379+ IP.parse (asum (replicate value (PR.satisfy (< 0)))
620 AP.<|> PR.satisfy (> 0))
380 AP.<|> PR.satisfy (> 0))
621
381
622−{-
623{-# INLINE choice #-}
382{-# INLINE choice #-}
624−choice :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
383+choice :: MonadCatch m => Int -> SerialT m Int -> m Int
625choice value =
384choice value =
626− Stream.parse
385+ IP.parse
627 (PR.choice (replicate value (PR.satisfy (< 0))) AP.<|> PR.satisfy (> 0))
386 (PR.choice (replicate value (PR.satisfy (< 0))) AP.<|> PR.satisfy (> 0))
628−-}
629−
630−-------------------------------------------------------------------------------
631−-- Parsing with unfolds
632−-------------------------------------------------------------------------------
633−
634−{-# INLINE parseManyUnfoldArrays #-}
635−parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
636−parseManyUnfoldArrays count arrays = do
637− let src = Producer.source (Just (Producer.OuterLoop arrays))
638− let parser = PR.fromFold (Fold.take count Fold.drain)
639− let readSrc =
640− Producer.producer
641− $ Producer.concat Producer.fromList Array.producer
642− let streamParser =
643− Producer.simplify (Producer.parseMany parser readSrc)
644− Stream.fold Fold.drain $ Stream.unfold streamParser src
645
387
646-------------------------------------------------------------------------------
388-------------------------------------------------------------------------------
647-- Stream transformation
389-- Stream transformation
648-------------------------------------------------------------------------------
390-------------------------------------------------------------------------------
649
391
650{-# INLINE parseMany #-}
392{-# INLINE parseMany #-}
651−parseMany :: Monad m => Int -> Stream m Int -> m ()
393+parseMany :: MonadCatch m => Int -> SerialT m Int -> m ()
652parseMany n =
394parseMany n =
653− Stream.fold Fold.drain
395+ S.drain
654− . fmap getSum
396+ . S.map getSum
655− . Stream.catRights . Stream.parseMany (PR.fromFold $ Fold.take n Fold.mconcat)
397+ . IP.parseMany (PR.fromFold $ FL.take n FL.mconcat)
656− . fmap Sum
398+ . S.map Sum
657−
658−{-# INLINE parseManyGroupBy #-}
659−parseManyGroupBy :: Monad m => (Int -> Int -> Bool) -> Stream m Int -> m ()
660−parseManyGroupBy cmp =
661− Stream.fold Fold.drain . Stream.parseMany (PR.groupBy cmp Fold.drain)
662−
663−{-# INLINE parseManyGroupsRolling #-}
664−parseManyGroupsRolling :: Monad m => Bool -> Stream m Int -> m ()
665−parseManyGroupsRolling b =
666− Stream.fold Fold.drain
667− . Stream.parseMany (PR.groupByRolling (\_ _ -> b) Fold.drain)
668−
669−{-# INLINE parseManyGroupsRollingEither #-}
670−parseManyGroupsRollingEither :: Monad m =>
671− (Int -> Int -> Bool) -> Int -> m ()
672−parseManyGroupsRollingEither cmp value = do
673− sourceUnfoldrM value 1
674− & Stream.parseMany (PR.groupByRollingEither cmp Fold.drain Fold.drain)
675− & Stream.fold Fold.drain
676−
677−{-# INLINE parseManyGroupsRollingEitherAlt #-}
678−parseManyGroupsRollingEitherAlt :: Monad m =>
679− (Int -> Int -> Bool) -> Int -> m ()
680−parseManyGroupsRollingEitherAlt cmp value = do
681− sourceUnfoldrM value 1
682− -- Make the input unsorted.
683− & fmap (\x -> if even x then x + 2 else x)
684− & Stream.parseMany (PR.groupByRollingEither cmp Fold.drain Fold.drain)
685− & Stream.fold Fold.drain
686
399
687{-# INLINE parseIterate #-}
400{-# INLINE parseIterate #-}
688−parseIterate :: Monad m => Int -> Stream m Int -> m ()
401+parseIterate :: MonadCatch m => Int -> SerialT m Int -> m ()
689parseIterate n =
402parseIterate n =
690− Stream.fold Fold.drain
403+ S.drain
691− . fmap getSum
404+ . S.map getSum
692− . Stream.catRights
693− . Stream.parseIterate
694− (PR.fromFold . Fold.take n . Fold.sconcat)
405+ . IP.parseIterate (PR.fromFold . FL.take n . FL.sconcat) (Sum 0)
695− (Sum 0)
696− . fmap Sum
406+ . S.map Sum
407+
408+{-# INLINE parseBreak #-}
409+parseBreak :: MonadCatch m => SerialT m Int -> m ()
410+parseBreak s = do
411+ r <- try $ IP.parseBreak PR.one s
412+ case r of
413+ Left (_ :: SomeException) -> return ()
414+ Right (_, s1) -> parseBreak s1
697
415
698{-# INLINE concatSequence #-}
416{-# INLINE concatSequence #-}
699−concatSequence :: Monad m => Stream m Int -> m (Either ParseError ())
417+concatSequence :: MonadCatch m => SerialT m Int -> m ()
700−concatSequence =
418+concatSequence = IP.parse $ PR.concatSequence FL.drain $ S.repeat PR.one
701− Stream.parse $ PR.sequence (Stream.repeat PR.one) Fold.drain
702
419
703-------------------------------------------------------------------------------
420-------------------------------------------------------------------------------
704-- Benchmarks
421-- Benchmarks
@@ -707,95 +424,49 @@ concatSequence =
707moduleName :: String
424moduleName :: String
708moduleName = "Data.Parser"
425moduleName = "Data.Parser"
709
426
710−instance NFData ParseError where
711− {-# INLINE rnf #-}
712− rnf (ParseError x) = rnf x
713−
714o_1_space_serial :: Int -> [Benchmark]
427o_1_space_serial :: Int -> [Benchmark]
715o_1_space_serial value =
428o_1_space_serial value =
429+ [ benchIOSink value "one (fold)" $ one value
716− [ benchIOSink value "takeBetween" $ takeBetween value
430+ , benchIOSink value "takeBetween" $ takeBetween value
431+ , benchIOSink value "takeEQ" $ takeEQ value
717 , benchIOSink value "takeWhile" $ takeWhile value
432 , benchIOSink value "takeWhile" $ takeWhile value
718 , benchIOSink value "takeWhileP" $ takeWhileP value
433 , benchIOSink value "takeWhileP" $ takeWhileP value
719 , benchIOSink value "takeP" $ takeP value
434 , benchIOSink value "takeP" $ takeP value
720 , benchIOSink value "dropWhile" $ dropWhile value
435 , benchIOSink value "dropWhile" $ dropWhile value
721 , benchIOSink value "takeStartBy" $ takeStartBy value
436 , benchIOSink value "takeStartBy" $ takeStartBy value
722− , benchIOSink value "takeEndBy_" $ takeEndBy_ value
437+ , benchIOSrc sourceEscapedFrames value "takeFramedByEsc_"
438+ $ takeFramedByEsc_ value
723 , benchIOSink value "groupBy" $ groupBy
439 , benchIOSink value "groupBy" $ groupBy
724 , benchIOSink value "groupByRolling" $ groupByRolling
440 , benchIOSink value "groupByRolling" $ groupByRolling
725 , benchIOSink value "wordBy" $ wordBy value
441 , benchIOSink value "wordBy" $ wordBy value
726− , benchIOSink value "sepBy (words)" sepByWords
442+ , benchIOSink value "sepBy (words)" $ sepByWords value
727− , benchIOSink value "sepByAll (words)" sepByAllWords
728− , benchIOSink value "sepBy1 (words)" sepByWords1
729 , benchIOSink value "deintercalate" $ deintercalate value
443 , benchIOSink value "deintercalate" $ deintercalate value
730− , benchIOSink value "deintercalate1" $ deintercalate1 value
444+ , benchIOSink value "splitAp" $ splitAp value
731− , benchIOSink value "deintercalateAll" $ deintercalateAll value
732− -- Applicative and Monad
733− , benchIOSink value "splitAp2" $ splitAp2 value
734− , benchIOSink value "splitAp4" $ splitAp4 value
735− , benchIOSink value "splitAp8" $ splitAp8 value
736 , benchIOSink value "splitApBefore" $ splitApBefore value
445 , benchIOSink value "splitApBefore" $ splitApBefore value
737 , benchIOSink value "splitApAfter" $ splitApAfter value
446 , benchIOSink value "splitApAfter" $ splitApAfter value
738− , benchIOSink value "splitWith2" $ splitWith2 value
447+ , benchIOSink value "serialWith" $ serialWith value
739− , benchIOSink value "span" $ span value
740− , benchIOSink value "spanBy" $ spanBy value
741− , benchIOSink value "spanByRolling" $ spanByRolling value
742− , benchIOSink value "monad2" $ monad value
743− , benchIOSink value "monad4" $ monad4 value
744− , benchIOSink value "monad8" $ monad8 value
745− -- Alternative
746− , benchIOSink value "alt2parseMany" $ altSmall value
747− , benchIOSink value "alt2" $ alt2 value
748− , benchIOSink value "alt4" $ alt4 value
749− , benchIOSink value "alt8" $ alt8 value
750− , benchIOSink value "alt16" $ alt16 value
448+ , benchIOSink value "takeEndBy_" $ takeEndBy_ value
751 , benchIOSink value "many" many
449 , benchIOSink value "many" many
752 , benchIOSink value "many (wordBy even)" $ manyWordByEven
450 , benchIOSink value "many (wordBy even)" $ manyWordByEven
753 , benchIOSink value "some" some
451 , benchIOSink value "some" some
754 , benchIOSink value "manyTill" $ manyTill value
452 , benchIOSink value "manyTill" $ manyTill value
755− , benchIOSink value "parseMany" $ parseMany value
453+ , benchIOSink value "tee" $ teeAllAny value
454+ , benchIOSink value "teeFst" $ teeFstAllAny value
455+ , benchIOSink value "shortest" $ shortestAllAny value
456+ , benchIOSink value "longest" $ longestAllAny value
457+ , benchIOSink value "parseBreak (recursive)" parseBreak
756 , benchIOSink value "parseMany (take 1)" (parseMany 1)
458 , benchIOSink value "parseMany (take 1)" (parseMany 1)
757 , benchIOSink value "parseMany (take all)" (parseMany value)
459 , benchIOSink value "parseMany (take all)" (parseMany value)
758− , benchIOSink value "parseMany (groupBy (<))" (parseManyGroupBy (<))
759− , benchIOSink value "parseMany (groupBy (==))" (parseManyGroupBy (==))
760− , benchIOSink value "parseMany groupRollingBy (bound groups)"
761− $ parseManyGroupsRolling False
762− , benchIOSink value "parseMany groupRollingBy (1 group)"
763− $ parseManyGroupsRolling True
764− , bench "parseMany groupRollingByEither (Left)"
765− $ nfIO $ parseManyGroupsRollingEitherLeft
766− , bench "parseMany groupRollingByEither (Right)"
767− $ nfIO $ parseManyGroupsRollingEitherRight
768− , bench "parseMany groupRollingByEither (Alternating)"
769− $ nfIO $ parseManyGroupsRollingEitherAlt1
770 , benchIOSink value "parseIterate (take 1)" (parseIterate 1)
460 , benchIOSink value "parseIterate (take 1)" (parseIterate 1)
771 , benchIOSink value "parseIterate (take all)" (parseIterate value)
461 , benchIOSink value "parseIterate (take all)" (parseIterate value)
772 , benchIOSink value "concatSequence" concatSequence
462 , benchIOSink value "concatSequence" concatSequence
773− {-
774− , benchIOSink value "tee" $ teeAllAny value
775− , benchIOSink value "teeFst" $ teeFstAllAny value
776− , benchIOSink value "shortest" $ shortestAllAny value
777− , benchIOSink value "longest" $ longestAllAny value
778− -}
779− , benchIOSink value "streamEqBy" (streamEqBy value)
780 ]
463 ]
781
464
782− where
783−
784− {-# NOINLINE parseManyGroupsRollingEitherLeft #-}
785− parseManyGroupsRollingEitherLeft = parseManyGroupsRollingEither (<) value
786−
787− {-# NOINLINE parseManyGroupsRollingEitherRight #-}
788− parseManyGroupsRollingEitherRight = parseManyGroupsRollingEither (>) value
789−
790− {-# NOINLINE parseManyGroupsRollingEitherAlt1 #-}
791− parseManyGroupsRollingEitherAlt1 =
792− parseManyGroupsRollingEitherAlt (>) value
793−
794o_1_space_filesystem :: BenchEnv -> [Benchmark]
465o_1_space_filesystem :: BenchEnv -> [Benchmark]
795o_1_space_filesystem env =
466o_1_space_filesystem env =
796− [ mkBench ("S.parseMany (Fold.take " ++ show (bigSize env) ++ " Fold.sum)") env
467+ [ mkBench ("S.parseMany (FL.take " ++ show (bigSize env) ++ " FL.sum)") env
797 $ \inh _ -> noinline parseManyChunksOfSum (bigSize env) inh
468 $ \inh _ -> noinline parseManyChunksOfSum (bigSize env) inh
798− , mkBench "S.parseMany (Fold.take 1 Fold.sum)" env
469+ , mkBench "S.parseMany (FL.take 1 FL.sum)" env
799 $ \inh _ -> inline parseManyChunksOfSum 1 inh
470 $ \inh _ -> inline parseManyChunksOfSum 1 inh
800 ]
471 ]
801
472
@@ -810,38 +481,26 @@ o_1_space_serial_unfold bound arrays =
810o_n_heap_serial :: Int -> [Benchmark]
481o_n_heap_serial :: Int -> [Benchmark]
811o_n_heap_serial value =
482o_n_heap_serial value =
812 [
483 [
813− benchIOSink value "takeEQ" $ takeEQ value
814− , benchIOSink value "takeGE" $ takeGE value
815−
816 -- lookahead benchmark holds the entire input till end
484 -- lookahead benchmark holds the entire input till end
817− , benchIOSink value "lookAhead" $ lookAhead value
485+ benchIOSink value "lookAhead" $ lookAhead value
818
486
819− -- o-n-heap because of backtracking
487+ -- accumulates the results in a list
820− , benchIOSrc sourceEscapedFrames value "takeFramedByEsc_"
488+ , benchIOSink value "sequence" $ sequence value
821− $ takeFramedByEsc_ value
489+ , benchIOSink value "sequenceA" $ sequenceA value
822
490
491+ -- XXX why should this take O(n) heap, it discards the results?
492+ , benchIOSink value "sequence_" $ sequence_ value
493+ , benchIOSink value "sequenceA_" $ sequenceA_ value
823 -- non-linear time complexity (parserD)
494 -- non-linear time complexity (parserD)
824 , benchIOSink value "split_" $ split_ value
495 , benchIOSink value "split_" $ split_ value
825− -- XXX Takes lot of space when run on a long stream, why?
496+ -- XXX why O(n) heap?
826− , benchIOSink value "monad16" $ monad16 value
497+ , benchIOSink value "choice (asum)" $ choiceAsum value
498+ , benchIOSink value "choice" $ choice value
827
499
828 -- These show non-linear time complexity.
500 -- These show non-linear time complexity.
829 -- They accumulate the results in a list.
501 -- They accumulate the results in a list.
830− , benchIOSink value "sepBy1" sepBy1
831 , benchIOSink value "manyAlt" manyAlt
502 , benchIOSink value "manyAlt" manyAlt
832 , benchIOSink value "someAlt" someAlt
503 , benchIOSink value "someAlt" someAlt
833− , benchIOSink value "listEqBy" (listEqBy value)
834− ]
835−
836−-- accumulate results in a list in IO
837−o_n_space_serial :: Int -> [Benchmark]
838−o_n_space_serial value =
839− [ benchIOSink value "sequenceA/100" $ sequenceA (value `div` 100)
840− , benchIOSink value "sequenceA_/100" $ sequenceA_ (value `div` 100)
841− , benchIOSink value "sequence/100" $ sequence (value `div` 100)
842− , benchIOSink value "sequence_/100" $ sequence_ (value `div` 100)
843− , benchIOSink value "choice (asum)/100" $ choiceAsum (value `div` 100)
844− -- , benchIOSink value "choice/100" $ choice (value `div` 100)
845 ]
504 ]
846
505
847-------------------------------------------------------------------------------
506-------------------------------------------------------------------------------
@@ -850,13 +509,12 @@ o_n_space_serial value =
850
509
851main :: IO ()
510main :: IO ()
852main = do
511main = do
853−#ifndef FUSION_CHECK
854 env <- mkHandleBenchEnv
512 env <- mkHandleBenchEnv
855 runWithCLIOptsEnv defaultStreamSize alloc (allBenchmarks env)
513 runWithCLIOptsEnv defaultStreamSize alloc (allBenchmarks env)
856
514
857 where
515 where
858
516
859− alloc value = Stream.fold Fold.toList $ Stream.chunksOf 100 $ sourceUnfoldrM value 0
517+ alloc value = IP.toList $ IP.arraysOf 100 $ sourceUnfoldrM value 0
860
518
861 allBenchmarks env arrays value =
519 allBenchmarks env arrays value =
862 [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
520 [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
@@ -866,22 +524,4 @@ main = do
866 , bgroup (o_1_space_prefix moduleName)
524 , bgroup (o_1_space_prefix moduleName)
867 (o_1_space_serial_unfold value arrays)
525 (o_1_space_serial_unfold value arrays)
868 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
526 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
869− , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
870 ]
527 ]
871−#else
872− -- Enable FUSION_CHECK macro at the beginning of the file
873− -- Enable one benchmark below, and run the benchmark
874− -- Check the .dump-simpl output
875− let value = 100000
876− -- let input = sourceUnfoldrM value 1
877− -- manyTill value input
878− -- deintercalate value input
879− -- deintercalate1 value input
880− -- deintercalateAll value input
881− -- sepByWords input
882− -- sepByAllWords input
883− -- sepBy1 input
884− -- sepByWords1 input
885− takeFramedByEsc_ value (sourceEscapedFrames value 1)
886− return ()
887−#endif
benchmark/Streamly/Benchmark/Data/Parser/ParserD.hsnew file+423
@@ -0,0 +1,423 @@
1+-- |
2+-- Module : Streamly.Benchmark.Data.ParserD
3+-- Copyright : (c) 2020 Composewell Technologies
4+--
5+-- License : BSD-3-Clause
6+-- Maintainer : streamly@composewell.com
7+
8+{-# LANGUAGE FlexibleContexts #-}
9+{-# LANGUAGE ScopedTypeVariables #-}
10+{-# OPTIONS_GHC -fspec-constr-recursive=4 #-}
11+
12+module Main
13+ (
14+ main
15+ ) where
16+
17+import Control.DeepSeq (NFData(..))
18+import Control.Monad.Catch (MonadCatch, MonadThrow)
19+import Data.Foldable (asum)
20+import Data.Functor (($>))
21+import Data.Maybe (fromMaybe)
22+import System.Random (randomRIO)
23+import Prelude hiding (any, all, take, sequence, sequenceA, sequence_, takeWhile, span)
24+
25+import qualified Data.Traversable as TR
26+import qualified Data.Foldable as F
27+import qualified Control.Applicative as AP
28+import qualified Streamly.Prelude as S
29+import qualified Streamly.Internal.Data.Array.Unboxed as Array
30+import qualified Streamly.Internal.Data.Fold as FL
31+import qualified Streamly.Internal.Data.Parser.ParserD as PR
32+import qualified Streamly.Internal.Data.Producer as Producer
33+import qualified Streamly.Internal.Data.Producer.Source as Source
34+import qualified Streamly.Internal.Data.Stream.IsStream as IP
35+import qualified Streamly.Internal.Data.Stream.StreamD as D
36+
37+import Gauge
38+import Streamly.Prelude (SerialT, MonadAsync, IsStream)
39+import Streamly.Benchmark.Common
40+
41+-------------------------------------------------------------------------------
42+-- Utilities
43+-------------------------------------------------------------------------------
44+
45+-- XXX these can be moved to the common module
46+
47+{-# INLINE sourceUnfoldrM #-}
48+sourceUnfoldrM :: (IsStream t, MonadAsync m) => Int -> Int -> t m Int
49+sourceUnfoldrM value n = S.unfoldrM step n
50+ where
51+ step cnt =
52+ if cnt > n + value
53+ then return Nothing
54+ else return (Just (cnt, cnt + 1))
55+
56+-- | Takes a fold method, and uses it with a default source.
57+{-# INLINE benchIOSink #-}
58+benchIOSink
59+ :: (IsStream t, NFData b)
60+ => Int -> String -> (t IO Int -> IO b) -> Benchmark
61+benchIOSink value name f =
62+ bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
63+
64+-- Make the input unsorted.
65+{-# INLINE benchIOSinkRandom #-}
66+benchIOSinkRandom
67+ :: (IsStream t, NFData b)
68+ => Int -> String -> (t IO Int -> IO b) -> Benchmark
69+benchIOSinkRandom value name f =
70+ bench name $ nfIO $ randomRIO (1,1)
71+ >>= f
72+ . S.map (\x -> if even x then x + 2 else x)
73+ . sourceUnfoldrM value
74+
75+-------------------------------------------------------------------------------
76+-- Parsers
77+-------------------------------------------------------------------------------
78+
79+{-# INLINE drainWhile #-}
80+drainWhile :: MonadThrow m => (a -> Bool) -> PR.Parser m a ()
81+drainWhile p = PR.takeWhile p FL.drain
82+
83+{-# INLINE takeStartBy #-}
84+takeStartBy :: MonadCatch m => Int -> SerialT m Int -> m ()
85+takeStartBy value stream = do
86+ stream1 <- return . fromMaybe (S.fromPure (value + 1)) =<< S.tail stream
87+ let stream2 = value `S.cons` stream1
88+ IP.parseD (PR.takeStartBy (== value) FL.drain) stream2
89+
90+{-# INLINE takeWhile #-}
91+takeWhile :: MonadThrow m => Int -> SerialT m Int -> m ()
92+takeWhile value = IP.parseD (drainWhile (<= value))
93+
94+{-# INLINE takeP #-}
95+takeP :: MonadThrow m => Int -> SerialT m a -> m ()
96+takeP value = IP.parseD (PR.takeP value (PR.fromFold FL.drain))
97+
98+{-# INLINE takeBetween #-}
99+takeBetween :: MonadCatch m => Int -> SerialT m a -> m ()
100+takeBetween value = IP.parseD (PR.takeBetween 0 value FL.drain)
101+
102+{-# INLINE groupBy #-}
103+groupBy :: MonadThrow m => SerialT m Int -> m ()
104+groupBy = IP.parseD (PR.groupBy (<=) FL.drain)
105+
106+{-# INLINE groupByRolling #-}
107+groupByRolling :: MonadThrow m => SerialT m Int -> m ()
108+groupByRolling = IP.parseD (PR.groupByRolling (<=) FL.drain)
109+
110+{-# INLINE wordBy #-}
111+wordBy :: MonadThrow m => Int -> SerialT m Int -> m ()
112+wordBy value = IP.parseD (PR.wordBy (>= value) FL.drain)
113+
114+{-# INLINE manyWordByEven #-}
115+manyWordByEven :: MonadCatch m => SerialT m Int -> m ()
116+manyWordByEven =
117+ IP.parseD (PR.many (PR.wordBy (Prelude.even) FL.drain) FL.drain)
118+
119+{-# INLINE many #-}
120+many :: MonadCatch m => SerialT m Int -> m Int
121+many = IP.parseD (PR.many (PR.satisfy (> 0)) FL.length)
122+
123+{-# INLINE manyAlt #-}
124+manyAlt :: MonadCatch m => SerialT m Int -> m Int
125+manyAlt xs = do
126+ x <- IP.parseD (AP.many (PR.satisfy (> 0))) xs
127+ return $ Prelude.length x
128+
129+{-# INLINE some #-}
130+some :: MonadCatch m => SerialT m Int -> m Int
131+some = IP.parseD (PR.some (PR.satisfy (> 0)) FL.length)
132+
133+{-# INLINE someAlt #-}
134+someAlt :: MonadCatch m => SerialT m Int -> m Int
135+someAlt xs = do
136+ x <- IP.parseD (AP.some (PR.satisfy (> 0))) xs
137+ return $ Prelude.length x
138+
139+{-#INLINE takeEndBy_ #-}
140+takeEndBy_ :: MonadCatch m => Int -> SerialT m Int -> m ()
141+takeEndBy_ value = IP.parseD (PR.takeEndBy_ (>= value) (PR.fromFold FL.drain))
142+
143+{-# INLINE manyTill #-}
144+manyTill :: MonadCatch m => Int -> SerialT m Int -> m Int
145+manyTill value =
146+ let p = PR.satisfy (> 0)
147+ pcond = PR.satisfy (== value)
148+ in IP.parseD (PR.manyTill FL.length p pcond)
149+
150+{-# INLINE serialWith #-}
151+serialWith :: MonadThrow m
152+ => Int -> SerialT m Int -> m ((), ())
153+serialWith value =
154+ IP.parseD
155+ ((,)
156+ <$> drainWhile (<= (value `div` 2))
157+ <*> drainWhile (<= value)
158+ )
159+
160+{-# INLINE teeAllAny #-}
161+teeAllAny :: MonadThrow m
162+ => Int -> SerialT m Int -> m ((), ())
163+teeAllAny value =
164+ IP.parseD
165+ (PR.teeWith (,)
166+ (drainWhile (<= value))
167+ (drainWhile (<= value))
168+ )
169+
170+{-# INLINE teeFstAllAny #-}
171+teeFstAllAny :: MonadThrow m
172+ => Int -> SerialT m Int -> m ((), ())
173+teeFstAllAny value =
174+ IP.parseD
175+ (PR.teeWithFst (,)
176+ (drainWhile (<= value))
177+ (drainWhile (<= value))
178+ )
179+
180+{-# INLINE shortestAllAny #-}
181+shortestAllAny :: MonadThrow m
182+ => Int -> SerialT m Int -> m ()
183+shortestAllAny value =
184+ IP.parseD
185+ (PR.shortest
186+ (drainWhile (<= value))
187+ (drainWhile (<= value))
188+ )
189+
190+{-# INLINE longestAllAny #-}
191+longestAllAny :: MonadCatch m
192+ => Int -> SerialT m Int -> m ()
193+longestAllAny value =
194+ IP.parseD
195+ (PR.longest
196+ (drainWhile (<= value))
197+ (drainWhile (<= value))
198+ )
199+
200+{-# INLINE sequenceParser #-}
201+sequenceParser :: MonadCatch m => SerialT m Int -> m ()
202+sequenceParser = IP.parseD (PR.sequence FL.drain (D.repeat (PR.satisfy $ const True)))
203+
204+-------------------------------------------------------------------------------
205+-- Spanning
206+-------------------------------------------------------------------------------
207+
208+{-# INLINE span #-}
209+span :: MonadThrow m => Int -> SerialT m Int -> m ((), ())
210+span value = IP.parseD (PR.span (<= (value `div` 2)) FL.drain FL.drain)
211+
212+{-# INLINE spanBy #-}
213+spanBy :: MonadThrow m => Int -> SerialT m Int -> m ((), ())
214+spanBy value =
215+ IP.parseD (PR.spanBy (\_ i -> i <= (value `div` 2)) FL.drain FL.drain)
216+
217+{-# INLINE spanByRolling #-}
218+spanByRolling :: MonadThrow m => Int -> SerialT m Int -> m ((), ())
219+spanByRolling value =
220+ IP.parseD (PR.spanByRolling (\_ i -> i <= value `div` 2) FL.drain FL.drain)
221+
222+-------------------------------------------------------------------------------
223+-- Nested
224+-------------------------------------------------------------------------------
225+
226+{-# INLINE parseMany #-}
227+parseMany :: MonadThrow m => Int -> SerialT m Int -> m ()
228+parseMany value = IP.drain . IP.parseManyD (drainWhile (<= value + 1))
229+
230+{-# INLINE parseManyGroups #-}
231+parseManyGroups :: MonadThrow m => Bool -> SerialT m Int -> m ()
232+parseManyGroups b = IP.drain . IP.parseManyD (PR.groupBy (\_ _ -> b) FL.drain)
233+
234+{-# INLINE parseManyGroupsRolling #-}
235+parseManyGroupsRolling :: MonadThrow m => Bool -> SerialT m Int -> m ()
236+parseManyGroupsRolling b =
237+ IP.drain . IP.parseManyD (PR.groupByRolling (\_ _ -> b) FL.drain)
238+
239+{-# INLINE parseManyGroupsRollingEither #-}
240+parseManyGroupsRollingEither :: (MonadThrow m, MonadCatch m) =>
241+ (Int -> Int -> Bool) -> SerialT m Int -> m ()
242+parseManyGroupsRollingEither cmp =
243+ IP.drain
244+ . IP.parseManyD (PR.groupByRollingEither cmp FL.drain FL.drain)
245+
246+-------------------------------------------------------------------------------
247+-- Parsing with unfolds
248+-------------------------------------------------------------------------------
249+
250+{-# INLINE parseManyUnfoldArrays #-}
251+parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
252+parseManyUnfoldArrays count arrays = do
253+ let src = Source.source (Just (Producer.OuterLoop arrays))
254+ let parser = PR.fromFold (FL.take count FL.drain)
255+ let readSrc =
256+ Source.producer
257+ $ Producer.concat Producer.fromList Array.producer
258+ let streamParser =
259+ Producer.simplify (Source.parseManyD parser readSrc)
260+ S.drain $ S.unfold streamParser src
261+
262+-------------------------------------------------------------------------------
263+-- Parsers in which -fspec-constr-recursive=16 is problematic
264+-------------------------------------------------------------------------------
265+
266+-- XXX -fspec-constr-recursive=16 makes GHC go beserk when compiling these.
267+-- We need to fix GHC so that we can have better control over that option or do
268+-- not have to rely on it.
269+--
270+{-# INLINE lookAhead #-}
271+lookAhead :: MonadThrow m => Int -> SerialT m Int -> m ()
272+lookAhead value =
273+ IP.parseD (PR.lookAhead (PR.takeWhile (<= value) FL.drain) $> ())
274+
275+{-# INLINE sequenceA_ #-}
276+sequenceA_ :: MonadThrow m => Int -> SerialT m Int -> m ()
277+sequenceA_ value =
278+ IP.parseD (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
279+
280+-- quadratic complexity
281+{-# INLINE sequenceA #-}
282+sequenceA :: MonadThrow m => Int -> SerialT m Int -> m Int
283+sequenceA value xs = do
284+ x <- IP.parseD (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
285+ return $ length x
286+
287+-- quadratic complexity
288+{-# INLINE sequence #-}
289+sequence :: MonadThrow m => Int -> SerialT m Int -> m Int
290+sequence value xs = do
291+ x <- IP.parseD (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
292+ return $ length x
293+
294+{-# INLINE sequence_ #-}
295+sequence_ :: MonadCatch m => Int -> SerialT m Int -> m ()
296+sequence_ value xs =
297+ IP.parseD (foldr f (return ()) (replicate value (PR.takeBetween 0 1 FL.drain))) xs
298+
299+ where
300+
301+ {-# INLINE f #-}
302+ f m k = m >>= (\_ -> k)
303+
304+-- choice using the "Alternative" instance with direct style parser type has
305+-- quadratic performance complexity.
306+--
307+{-# INLINE choiceAsum #-}
308+choiceAsum :: MonadCatch m => Int -> SerialT m Int -> m Int
309+choiceAsum value =
310+ IP.parseD (asum (replicate value (PR.satisfy (< 0)))
311+ AP.<|> PR.satisfy (> 0))
312+
313+{-# INLINE choice #-}
314+choice :: MonadCatch m => Int -> SerialT m Int -> m Int
315+choice value =
316+ IP.parseD
317+ (PR.choice (replicate value (PR.satisfy (< 0))) AP.<|> PR.satisfy (> 0))
318+
319+-------------------------------------------------------------------------------
320+-- Benchmarks
321+-------------------------------------------------------------------------------
322+
323+moduleName :: String
324+moduleName = "Data.Parser.ParserD"
325+
326+o_1_space_serial :: Int -> [Benchmark]
327+o_1_space_serial value =
328+ [ benchIOSink value "takeWhile" $ takeWhile value
329+ , benchIOSink value "takeP" $ takeP value
330+ , benchIOSink value "takeBetween" $ takeBetween value
331+ , benchIOSink value "takeStartBy" $ takeStartBy value
332+ , benchIOSink value "groupBy" $ groupBy
333+ , benchIOSink value "groupByRolling" $ groupByRolling
334+ , benchIOSink value "wordBy" $ wordBy value
335+ , benchIOSink value "serialWith" $ serialWith value
336+ , benchIOSink value "many" many
337+ , benchIOSink value "many (wordBy even)" $ manyWordByEven
338+ , benchIOSink value "some" some
339+ , benchIOSink value "takeEndBy_" $ takeEndBy_ value
340+ , benchIOSink value "manyTill" $ manyTill value
341+ , benchIOSink value "tee (all,any)" $ teeAllAny value
342+ , benchIOSink value "teeFst (all,any)" $ teeFstAllAny value
343+ , benchIOSink value "shortest (all,any)" $ shortestAllAny value
344+ , benchIOSink value "longest (all,any)" $ longestAllAny value
345+ , benchIOSink value "sequenceParser" sequenceParser
346+ ]
347+
348+o_1_space_serial_spanning :: Int -> [Benchmark]
349+o_1_space_serial_spanning value =
350+ [ benchIOSink value "span" $ span value
351+ , benchIOSink value "spanBy" $ spanBy value
352+ , benchIOSink value "spanByRolling" $ spanByRolling value
353+ ]
354+
355+o_1_space_serial_nested :: Int -> [Benchmark]
356+o_1_space_serial_nested value =
357+ [ benchIOSink value "parseMany" $ parseMany value
358+ , benchIOSink value "parseMany groupBy (bound groups)"
359+ $ parseManyGroups False
360+ , benchIOSink value "parseMany groupRollingBy (bound groups)"
361+ $ parseManyGroupsRolling False
362+ , benchIOSink value "parseMany groupBy (1 group)" $ parseManyGroups True
363+ , benchIOSink value "parseMany groupRollingBy (1 group)"
364+ $ parseManyGroupsRolling True
365+ , benchIOSink value "parseMany groupRollingByEither (Left)"
366+ $ parseManyGroupsRollingEither (<)
367+ , benchIOSink value "parseMany groupRollingByEither (Right)"
368+ $ parseManyGroupsRollingEither (>)
369+ , benchIOSinkRandom value "parseMany groupRollingByEither (Alternating)"
370+ $ parseManyGroupsRollingEither (>)
371+ ]
372+
373+o_1_space_serial_unfold :: Int -> [Array.Array Int] -> [Benchmark]
374+o_1_space_serial_unfold bound arrays =
375+ [ bench "parseMany/Unfold/1000 arrays/1 parse"
376+ $ nfIO $ parseManyUnfoldArrays bound arrays
377+ , bench "parseMany/Unfold/1000 arrays/100000 parses"
378+ $ nfIO $ parseManyUnfoldArrays 1 arrays
379+ ]
380+
381+o_n_heap_serial :: Int -> [Benchmark]
382+o_n_heap_serial value =
383+ [
384+ -- lookahead benchmark holds the entire input till end
385+ benchIOSink value "lookAhead" $ lookAhead value
386+
387+ -- These show non-linear time complexity
388+ -- They accumulate the results in a list.
389+ , benchIOSink value "manyAlt" manyAlt
390+ , benchIOSink value "someAlt" someAlt
391+ ]
392+
393+-- accumulate results in a list in IO
394+o_n_space_serial :: Int -> [Benchmark]
395+o_n_space_serial value =
396+ [ benchIOSink value "sequenceA/100" $ sequenceA (value `div` 100)
397+ , benchIOSink value "sequenceA_/100" $ sequenceA_ (value `div` 100)
398+ , benchIOSink value "sequence/100" $ sequence (value `div` 100)
399+ , benchIOSink value "sequence_/100" $ sequence_ (value `div` 100)
400+ , benchIOSink value "choice (asum)/100" $ choiceAsum (value `div` 100)
401+ , benchIOSink value "choice/100" $ choice (value `div` 100)
402+ ]
403+
404+-------------------------------------------------------------------------------
405+-- Driver
406+-------------------------------------------------------------------------------
407+
408+main :: IO ()
409+main = runWithCLIOptsEnv defaultStreamSize alloc allBenchmarks
410+
411+ where
412+
413+ alloc value = IP.toList $ IP.arraysOf 100 $ sourceUnfoldrM value 0
414+
415+ allBenchmarks arraysSmall value =
416+ [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
417+ , bgroup (o_1_space_prefix moduleName) (o_1_space_serial_spanning value)
418+ , bgroup (o_1_space_prefix moduleName) (o_1_space_serial_nested value)
419+ , bgroup (o_1_space_prefix moduleName)
420+ (o_1_space_serial_unfold value arraysSmall)
421+ , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
422+ , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
423+ ]
benchmark/Streamly/Benchmark/Data/Parser/ParserK.hsnew file+163
@@ -0,0 +1,163 @@
1+-- |
2+-- Module : Streamly.Benchmark.Data.ParserK
3+-- Copyright : (c) 2020 Composewell Technologies
4+--
5+-- License : BSD-3-Clause
6+-- Maintainer : streamly@composewell.com
7+
8+{-# LANGUAGE CPP #-}
9+{-# LANGUAGE FlexibleContexts #-}
10+
11+module Main
12+ (
13+ main
14+ ) where
15+
16+import Control.DeepSeq (NFData(..))
17+import Control.Monad.Catch (MonadCatch)
18+import Data.Foldable (asum)
19+import System.Random (randomRIO)
20+import Prelude hiding (any, all, take, sequence, sequenceA, takeWhile)
21+
22+import qualified Control.Applicative as AP
23+import qualified Data.Foldable as F
24+import qualified Data.Traversable as TR
25+import qualified Streamly.Prelude as S
26+import qualified Streamly.Internal.Data.Fold as FL
27+import qualified Streamly.Internal.Data.Parser.ParserK.Type as PR
28+import qualified Streamly.Internal.Data.Parser.ParserD as PRD
29+import qualified Streamly.Internal.Data.Stream.IsStream as IP
30+
31+import Gauge
32+import Streamly.Prelude (SerialT, MonadAsync, IsStream)
33+import Streamly.Benchmark.Common
34+
35+-------------------------------------------------------------------------------
36+-- Utilities
37+-------------------------------------------------------------------------------
38+
39+-- XXX these can be moved to the common module
40+
41+{-# INLINE sourceUnfoldrM #-}
42+sourceUnfoldrM :: (IsStream t, MonadAsync m) => Int -> Int -> t m Int
43+sourceUnfoldrM value n = S.unfoldrM step n
44+ where
45+ step cnt =
46+ if cnt > n + value
47+ then return Nothing
48+ else return (Just (cnt, cnt + 1))
49+
50+-- | Takes a fold method, and uses it with a default source.
51+{-# INLINE benchIOSink #-}
52+benchIOSink
53+ :: (IsStream t, NFData b)
54+ => Int -> String -> (t IO Int -> IO b) -> Benchmark
55+benchIOSink value name f =
56+ bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
57+
58+-------------------------------------------------------------------------------
59+-- Parsers
60+-------------------------------------------------------------------------------
61+
62+#ifdef FROM_PARSERK
63+#define PARSE_OP (IP.parseD . PRD.fromParserK)
64+#else
65+#define PARSE_OP IP.parseK
66+#endif
67+
68+{-# INLINE satisfy #-}
69+satisfy :: MonadCatch m => (a -> Bool) -> PR.Parser m a a
70+satisfy = PRD.toParserK . PRD.satisfy
71+
72+{-# INLINE takeWhile #-}
73+takeWhile :: MonadCatch m => (a -> Bool) -> PR.Parser m a ()
74+takeWhile p = PRD.toParserK $ PRD.takeWhile p FL.drain
75+
76+{-# INLINE takeWhileK #-}
77+takeWhileK :: MonadCatch m => Int -> SerialT m Int -> m ()
78+takeWhileK value = PARSE_OP (takeWhile (<= value))
79+
80+{-# INLINE splitApp #-}
81+splitApp :: MonadCatch m
82+ => Int -> SerialT m Int -> m ((), ())
83+splitApp value =
84+ PARSE_OP ((,) <$> takeWhile (<= (value `div` 2)) <*> takeWhile (<= value))
85+
86+{-# INLINE sequenceA #-}
87+sequenceA :: MonadCatch m => Int -> SerialT m Int -> m Int
88+sequenceA value xs = do
89+ let parser = satisfy (> 0)
90+ list = Prelude.replicate value parser
91+ x <- PARSE_OP (TR.sequenceA list) xs
92+ return $ Prelude.length x
93+
94+{-# INLINE sequenceA_ #-}
95+sequenceA_ :: MonadCatch m => Int -> SerialT m Int -> m ()
96+sequenceA_ value xs = do
97+ let parser = satisfy (> 0)
98+ list = Prelude.replicate value parser
99+ PARSE_OP (F.sequenceA_ list) xs
100+
101+{-# INLINE sequence #-}
102+sequence :: MonadCatch m => Int -> SerialT m Int -> m Int
103+sequence value xs = do
104+ let parser = satisfy (> 0)
105+ list = Prelude.replicate value parser
106+ x <- PARSE_OP (TR.sequence list) xs
107+ return $ Prelude.length x
108+
109+{-# INLINE manyAlt #-}
110+manyAlt :: MonadCatch m => SerialT m Int -> m Int
111+manyAlt xs = do
112+ x <- PARSE_OP (AP.many (satisfy (> 0))) xs
113+ return $ Prelude.length x
114+
115+{-# INLINE someAlt #-}
116+someAlt :: MonadCatch m => SerialT m Int -> m Int
117+someAlt xs = do
118+ x <- PARSE_OP (AP.some (satisfy (> 0))) xs
119+ return $ Prelude.length x
120+
121+{-# INLINE choice #-}
122+choice :: MonadCatch m => Int -> SerialT m Int -> m Int
123+choice value =
124+ PARSE_OP (asum (replicate value (satisfy (< 0)))
125+ AP.<|> satisfy (> 0))
126+
127+-------------------------------------------------------------------------------
128+-- Benchmarks
129+-------------------------------------------------------------------------------
130+
131+moduleName :: String
132+moduleName = "Data.Parser.ParserK"
133+
134+o_1_space_serial :: Int -> [Benchmark]
135+o_1_space_serial value =
136+ [ benchIOSink value "takeWhile" $ takeWhileK value
137+ , benchIOSink value "splitApp" $ splitApp value
138+ ]
139+
140+-- O(n) heap beacuse of accumulation of the list in strict IO monad?
141+o_n_heap_serial :: Int -> [Benchmark]
142+o_n_heap_serial value =
143+ [ benchIOSink value "sequenceA" $ sequenceA value
144+ , benchIOSink value "sequenceA_" $ sequenceA_ value
145+ , benchIOSink value "sequence" $ sequence value
146+ , benchIOSink value "manyAlt" manyAlt
147+ , benchIOSink value "someAlt" someAlt
148+ , benchIOSink value "choice" $ choice value
149+ ]
150+
151+-------------------------------------------------------------------------------
152+-- Driver
153+-------------------------------------------------------------------------------
154+
155+main :: IO ()
156+main = runWithCLIOpts defaultStreamSize allBenchmarks
157+
158+ where
159+
160+ allBenchmarks value =
161+ [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
162+ , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
163+ ]
benchmark/Streamly/Benchmark/Data/ParserK.hsdeleted−437
@@ -1,437 +0,0 @@
1−-- |
2−-- Module : Streamly.Benchmark.Data.ParserK
3−-- Copyright : (c) 2020 Composewell Technologies
4−--
5−-- License : BSD-3-Clause
6−-- Maintainer : streamly@composewell.com
7−
8−-- BENCH_CHUNKED -> adaptC
9−-- BENCH_CHUNKED_GENERIC -> adaptCG
10−-- BENCH_SINGULAR -> adapt
11−
12−{-# LANGUAGE CPP #-}
13−{-# LANGUAGE FlexibleContexts #-}
14−{-# OPTIONS_GHC -Wno-orphans #-}
15−
16−module Main
17− (
18− main
19− ) where
20−
21−import Control.Applicative ((<|>))
22−import Control.DeepSeq (NFData(..))
23−import Control.Monad.IO.Class (MonadIO)
24−import Data.Foldable (asum)
25−#ifdef BENCH_CHUNKED
26−import Streamly.Data.Array (Array, Unbox)
27−#endif
28−#ifdef BENCH_CHUNKED_GENERIC
29−import Streamly.Data.Array.Generic (Array)
30−import qualified Streamly.Internal.Data.Array.Generic as GenArr (chunksOf)
31−#endif
32−import Streamly.Internal.Data.Fold (Fold(..))
33−import Streamly.Data.StreamK (StreamK)
34−import Streamly.Internal.Data.Parser
35− (ParseError(..), Parser(..), Initial(..), Step(..))
36−import Streamly.Internal.Data.Stream (Stream)
37−import System.Random (randomRIO)
38−import Prelude hiding
39− (any, all, take, sequence, sequence_, sequenceA, takeWhile)
40−
41−import qualified Control.Applicative as AP
42−import qualified Data.Foldable as F
43−import qualified Data.Traversable as TR
44−import qualified Streamly.Data.Stream as Stream
45−import qualified Streamly.Data.Fold as FL
46−import qualified Streamly.Internal.Data.Fold as Fold
47−import qualified Streamly.Data.Parser as PRD
48−import qualified Streamly.Internal.Data.ParserK as PR
49−import qualified Streamly.Internal.Data.StreamK as StreamK
50−
51−import Test.Tasty.Bench
52−import Streamly.Benchmark.Common
53−
54−-------------------------------------------------------------------------------
55−-- CPP Helpers
56−-------------------------------------------------------------------------------
57−
58−#ifdef BENCH_CHUNKED
59−
60−#define PARSE_OP StreamK.parseChunks
61−#define FROM_PARSER adaptC
62−#define INPUT (Array a)
63−#define PARSE_ELEM (Array Int)
64−#define CONSTRAINT_IO (MonadIO m, Unbox a)
65−#define CONSTRAINT (Monad m, Unbox a)
66−#define MODULE_NAME "Data.ParserK.Chunked"
67−
68−#endif
69−
70−#ifdef BENCH_CHUNKED_GENERIC
71−
72−#define PARSE_OP StreamK.parseChunksGeneric
73−#define FROM_PARSER adaptCG
74−#define INPUT (Array a)
75−#define PARSE_ELEM (Array Int)
76−#define CONSTRAINT_IO (MonadIO m)
77−#define CONSTRAINT (Monad m)
78−#define MODULE_NAME "Data.ParserK.Chunked.Generic"
79−
80−#endif
81−
82−#ifdef BENCH_SINGULAR
83−
84−#define PARSE_OP StreamK.parse
85−#define FROM_PARSER adapt
86−#define INPUT a
87−#define PARSE_ELEM Int
88−#define CONSTRAINT_IO (MonadIO m)
89−#define CONSTRAINT (Monad m)
90−#define MODULE_NAME "Data.ParserK"
91−
92−#endif
93−
94−-------------------------------------------------------------------------------
95−-- Utilities
96−-------------------------------------------------------------------------------
97−
98−-- XXX these can be moved to the common module
99−
100−{-# INLINE sourceUnfoldrM #-}
101−sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
102−sourceUnfoldrM value n = Stream.unfoldrM step n
103− where
104− step cnt =
105− if cnt > n + value
106− then return Nothing
107− else return (Just (cnt, cnt + 1))
108−
109−-- | Takes a fold method, and uses it with a default source.
110−{-# INLINE benchIOSink #-}
111−benchIOSink
112− :: NFData b
113− => Int -> String -> (StreamK IO PARSE_ELEM -> IO b) -> Benchmark
114−benchIOSink value name f =
115− bench name $ nfIO $ randomRIO (1,1)
116− >>= f
117− . StreamK.fromStream
118−#ifdef BENCH_CHUNKED
119− . Stream.chunksOf 4000
120−#endif
121−#ifdef BENCH_CHUNKED_GENERIC
122− . GenArr.chunksOf 4000
123−#endif
124− . sourceUnfoldrM value
125−
126−-------------------------------------------------------------------------------
127−-- Parsers
128−-------------------------------------------------------------------------------
129−
130−{-# INLINE one #-}
131−one :: MonadIO m =>
132− Int -> StreamK m PARSE_ELEM -> m (Either ParseError (Maybe Int))
133−one value = PARSE_OP p
134−
135− where
136−
137− p = do
138− m <- PR.FROM_PARSER (PRD.fromFold FL.one)
139− case m of
140− Just i -> if i >= value then pure m else p
141− Nothing -> pure Nothing
142−
143−{-# INLINE satisfy #-}
144−satisfy :: CONSTRAINT_IO => (a -> Bool) -> PR.ParserK INPUT m a
145−satisfy = PR.FROM_PARSER . PRD.satisfy
146−
147−{-# INLINE takeWhile #-}
148−takeWhile :: CONSTRAINT_IO => (a -> Bool) -> PR.ParserK INPUT m ()
149−takeWhile p = PR.FROM_PARSER $ PRD.takeWhile p FL.drain
150−
151−{-# INLINE takeWhileK #-}
152−takeWhileK :: MonadIO m =>
153− Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
154−takeWhileK value = PARSE_OP (takeWhile (<= value))
155−
156−{-# INLINE splitAp2 #-}
157−splitAp2 :: MonadIO m
158− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ((), ()))
159−splitAp2 value =
160− PARSE_OP
161− ((,)
162− <$> takeWhile (<= (value `div` 2))
163− <*> takeWhile (<= value)
164− )
165−
166−{-# INLINE splitAp8 #-}
167−splitAp8 :: MonadIO m
168− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
169−splitAp8 value =
170− PARSE_OP
171− ( (\() () () () () () () () -> ())
172− <$> takeWhile (<= ( value `div` 8))
173− <*> takeWhile (<= ((value * 2) `div` 8))
174− <*> takeWhile (<= ((value * 3) `div` 8))
175− <*> takeWhile (<= ((value * 4) `div` 8))
176− <*> takeWhile (<= ((value * 5) `div` 8))
177− <*> takeWhile (<= ((value * 6) `div` 8))
178− <*> takeWhile (<= ((value * 7) `div` 8))
179− <*> takeWhile (<= value)
180− )
181−
182−{-# INLINE sequenceA #-}
183−sequenceA :: MonadIO m => Int -> StreamK m PARSE_ELEM -> m Int
184−sequenceA value xs = do
185− let parser = satisfy (> 0)
186− list = Prelude.replicate value parser
187− x <- PARSE_OP (TR.sequenceA list) xs
188− return $ Prelude.length x
189−
190−{-# INLINE sequenceA_ #-}
191−sequenceA_ :: MonadIO m =>
192− Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
193−sequenceA_ value xs = do
194− let parser = satisfy (> 0)
195− list = Prelude.replicate value parser
196− PARSE_OP (F.sequenceA_ list) xs
197−
198−{-# INLINE sequence #-}
199−sequence :: MonadIO m => Int -> StreamK m PARSE_ELEM -> m Int
200−sequence value xs = do
201− let parser = satisfy (> 0)
202− list = Prelude.replicate value parser
203− x <- PARSE_OP (TR.sequence list) xs
204− return $ Prelude.length x
205−
206−{-# INLINE sequence_ #-}
207−sequence_ :: MonadIO m =>
208− Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
209−sequence_ value =
210− let parser = satisfy (> 0)
211− list = Prelude.replicate value parser
212− in PARSE_OP (F.sequence_ list)
213−
214−{-# INLINE takeWhileFailD #-}
215−takeWhileFailD :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
216−takeWhileFailD predicate (Fold fstep finitial _ ffinal) =
217− Parser step initial extract
218−
219− where
220−
221− initial = do
222− res <- finitial
223− return $ case res of
224− Fold.Partial s -> IPartial s
225− Fold.Done b -> IDone b
226−
227− step s a =
228− if predicate a
229− then do
230− fres <- fstep s a
231− return
232− $ case fres of
233− Fold.Partial s1 -> Partial 0 s1
234− Fold.Done b -> Done 0 b
235− else return $ Error "fail"
236−
237− extract s = fmap (Done 0) (ffinal s)
238−
239−{-# INLINE takeWhileFail #-}
240−takeWhileFail :: CONSTRAINT =>
241− (a -> Bool) -> Fold m a b -> PR.ParserK INPUT m b
242−takeWhileFail p f = PR.FROM_PARSER (takeWhileFailD p f)
243−
244−{-# INLINE alt2 #-}
245−alt2 :: MonadIO m
246− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
247−alt2 value =
248− PARSE_OP
249− ( takeWhileFail (<= (value `div` 2)) Fold.drain
250− <|> takeWhile (<= value)
251− )
252−
253−{-# INLINE alt8 #-}
254−alt8 :: MonadIO m
255− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
256−alt8 value =
257− PARSE_OP
258− ( takeWhileFail (<= ( value `div` 8)) Fold.drain
259− <|> takeWhileFail (<= ((value * 2) `div` 8)) Fold.drain
260− <|> takeWhileFail (<= ((value * 3) `div` 8)) Fold.drain
261− <|> takeWhileFail (<= ((value * 4) `div` 8)) Fold.drain
262− <|> takeWhileFail (<= ((value * 5) `div` 8)) Fold.drain
263− <|> takeWhileFail (<= ((value * 6) `div` 8)) Fold.drain
264− <|> takeWhileFail (<= ((value * 7) `div` 8)) Fold.drain
265− <|> takeWhile (<= value)
266− )
267−
268−{-# INLINE alt16 #-}
269−alt16 :: MonadIO m
270− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
271−alt16 value =
272− PARSE_OP
273− ( takeWhileFail (<= ( value `div` 16)) Fold.drain
274− <|> takeWhileFail (<= ((value * 2) `div` 16)) Fold.drain
275− <|> takeWhileFail (<= ((value * 3) `div` 16)) Fold.drain
276− <|> takeWhileFail (<= ((value * 4) `div` 16)) Fold.drain
277− <|> takeWhileFail (<= ((value * 5) `div` 16)) Fold.drain
278− <|> takeWhileFail (<= ((value * 6) `div` 16)) Fold.drain
279− <|> takeWhileFail (<= ((value * 7) `div` 16)) Fold.drain
280− <|> takeWhileFail (<= ((value * 8) `div` 16)) Fold.drain
281− <|> takeWhileFail (<= ((value * 9) `div` 16)) Fold.drain
282− <|> takeWhileFail (<= ((value * 10) `div` 16)) Fold.drain
283− <|> takeWhileFail (<= ((value * 11) `div` 16)) Fold.drain
284− <|> takeWhileFail (<= ((value * 12) `div` 16)) Fold.drain
285− <|> takeWhileFail (<= ((value * 13) `div` 16)) Fold.drain
286− <|> takeWhileFail (<= ((value * 14) `div` 16)) Fold.drain
287− <|> takeWhileFail (<= ((value * 15) `div` 16)) Fold.drain
288− <|> takeWhile (<= value)
289− )
290−
291−{-# INLINE manyAlt #-}
292−manyAlt :: MonadIO m => StreamK m PARSE_ELEM -> m Int
293−manyAlt xs = do
294− x <- PARSE_OP (AP.many (satisfy (> 0))) xs
295− return $ Prelude.length x
296−
297−{-# INLINE someAlt #-}
298−someAlt :: MonadIO m => StreamK m PARSE_ELEM -> m Int
299−someAlt xs = do
300− x <- PARSE_OP (AP.some (satisfy (> 0))) xs
301− return $ Prelude.length x
302−
303−{-# INLINE choice #-}
304−choice :: MonadIO m =>
305− Int -> StreamK m PARSE_ELEM -> m (Either ParseError Int)
306−choice value =
307− PARSE_OP (asum (replicate value (satisfy (< 0)))
308− AP.<|> satisfy (> 0))
309−
310−{-# INLINE monad2 #-}
311−monad2 :: MonadIO m
312− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
313−monad2 value =
314− PARSE_OP $ do
315− takeWhile (<= (value `div` 2))
316− takeWhile (<= value)
317−
318−{-# INLINE monad4 #-}
319−monad4 :: MonadIO m
320− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
321−monad4 value =
322− PARSE_OP $ do
323− takeWhile (<= ( value `div` 4))
324− takeWhile (<= ((value * 2) `div` 4))
325− takeWhile (<= ((value * 3) `div` 4))
326− takeWhile (<= value)
327−
328−{-# INLINE monad8 #-}
329−monad8 :: MonadIO m
330− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
331−monad8 value =
332− PARSE_OP $ do
333− takeWhile (<= ( value `div` 8))
334− takeWhile (<= ((value * 2) `div` 8))
335− takeWhile (<= ((value * 3) `div` 8))
336− takeWhile (<= ((value * 4) `div` 8))
337− takeWhile (<= ((value * 5) `div` 8))
338− takeWhile (<= ((value * 6) `div` 8))
339− takeWhile (<= ((value * 7) `div` 8))
340− takeWhile (<= value)
341−
342−{-# INLINE monad16 #-}
343−monad16 :: MonadIO m
344− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
345−monad16 value =
346− PARSE_OP $ do
347− takeWhile (<= ( value `div` 16))
348− takeWhile (<= ((value * 2) `div` 16))
349− takeWhile (<= ((value * 3) `div` 16))
350− takeWhile (<= ((value * 4) `div` 16))
351− takeWhile (<= ((value * 5) `div` 16))
352− takeWhile (<= ((value * 6) `div` 16))
353− takeWhile (<= ((value * 7) `div` 16))
354− takeWhile (<= ((value * 8) `div` 16))
355− takeWhile (<= ((value * 9) `div` 16))
356− takeWhile (<= ((value * 10) `div` 16))
357− takeWhile (<= ((value * 11) `div` 16))
358− takeWhile (<= ((value * 12) `div` 16))
359− takeWhile (<= ((value * 13) `div` 16))
360− takeWhile (<= ((value * 14) `div` 16))
361− takeWhile (<= ((value * 15) `div` 16))
362− takeWhile (<= value)
363−
364−-------------------------------------------------------------------------------
365−-- Benchmarks
366−-------------------------------------------------------------------------------
367−
368−moduleName :: String
369−moduleName = MODULE_NAME
370−
371−instance NFData ParseError where
372− {-# INLINE rnf #-}
373− rnf (ParseError x) = rnf x
374−
375−o_1_space_serial :: Int -> [Benchmark]
376−o_1_space_serial value =
377− [ benchIOSink value "drain" (Stream.fold Fold.drain . StreamK.toStream)
378− , benchIOSink value "takeWhile" $ takeWhileK value
379− , benchIOSink value "splitAp2" $ splitAp2 value
380− , benchIOSink value "splitAp8" $ splitAp8 value
381− , benchIOSink value "alt2" $ alt2 value
382− , benchIOSink value "alt8" $ alt8 value
383− , benchIOSink value "alt16" $ alt16 value
384− , benchIOSink value "monad2" $ monad2 value
385− , benchIOSink value "monad4" $ monad4 value
386− , benchIOSink value "monad8" $ monad8 value
387− , benchIOSink value "monad16" $ monad16 value
388− ]
389−
390−{-# INLINE sepBy1 #-}
391−sepBy1 :: MonadIO m => StreamK m PARSE_ELEM -> m Int
392−sepBy1 xs = do
393− x <- PARSE_OP (parser (satisfy odd) (satisfy even)) xs
394− return $ Prelude.length x
395−
396− where
397−
398− parser p sep = do
399− x <- p
400− fmap (x :) $ AP.many (sep >> p)
401−
402−-- O(n) heap beacuse of accumulation of the list in strict IO monad?
403−o_n_heap_serial :: Int -> [Benchmark]
404−o_n_heap_serial value =
405− [
406− -- accumulates the results in a list
407− -- XXX why should this take O(n) heap, it discards the results?
408− benchIOSink value "sequence_" $ sequence_ value
409− , benchIOSink value "sequenceA_" $ sequenceA_ value
410− , benchIOSink value "sequence" $ sequence value
411− , benchIOSink value "sequenceA" $ sequenceA value
412− , benchIOSink value "manyAlt" manyAlt
413− , benchIOSink value "sepBy1" sepBy1
414− , benchIOSink value "someAlt" someAlt
415− , benchIOSink value "choice" $ choice value
416− ]
417−
418−-- O(n) heap beacuse of accumulation of the list in strict IO monad?
419−o_1_space_recursive :: Int -> [Benchmark]
420−o_1_space_recursive value =
421− [ benchIOSink value "one (recursive)" $ one value
422− ]
423−
424−-------------------------------------------------------------------------------
425−-- Driver
426−-------------------------------------------------------------------------------
427−
428−main :: IO ()
429−main = runWithCLIOpts defaultStreamSize allBenchmarks
430−
431− where
432−
433− allBenchmarks value =
434− [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
435− , bgroup (o_1_space_prefix moduleName) (o_1_space_recursive value)
436− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
437− ]
benchmark/Streamly/Benchmark/Data/Ring/Unboxed.hs+4−3
@@ -12,11 +12,12 @@ module Main (main) where
12
12
13import Control.Monad (void)
13import Control.Monad (void)
14import GHC.Ptr (Ptr(..))
14import GHC.Ptr (Ptr(..))
15+
15−import qualified Streamly.Internal.Data.Array as Array
16+import qualified Streamly.Internal.Data.Array.Unboxed.Type as Array
16−import qualified Streamly.Internal.Data.Ring as Ring
17+import qualified Streamly.Internal.Data.Ring.Foreign as Ring
17import qualified Data.Foldable as P
18import qualified Data.Foldable as P
18
19
19−import Test.Tasty.Bench
20+import Gauge
20import Streamly.Benchmark.Common
21import Streamly.Benchmark.Common
21
22
22import Prelude as P
23import Prelude as P
benchmark/Streamly/Benchmark/Data/Serialize.hsdeleted−591
@@ -1,591 +0,0 @@
1−{-# LANGUAGE TemplateHaskell #-}
2−{- HLINT ignore -}
3−
4−#undef FUSION_CHECK
5−#ifdef FUSION_CHECK
6−{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
7−#endif
8−
9−-- |
10−-- Module : Streamly.Benchmark.Data.Serialize
11−-- Copyright : (c) 2023 Composewell
12−-- License : BSD-3-Clause
13−-- Maintainer : streamly@composewell.com
14−
15−module Main (main) where
16−
17−-------------------------------------------------------------------------------
18−-- Imports
19−-------------------------------------------------------------------------------
20−
21−import Control.DeepSeq (NFData(..), deepseq)
22−import Control.Monad (when, void)
23−import GHC.Generics (Generic)
24−import System.Random (randomRIO)
25−#ifndef USE_UNBOX
26−import Test.QuickCheck (Arbitrary, arbitrary)
27−#endif
28−
29−import Streamly.Internal.Data.MutByteArray
30−import qualified Streamly.Internal.Data.MutByteArray as MBA
31−#ifdef USE_UNBOX
32−import Data.Proxy (Proxy(..))
33−#else
34−import Control.DeepSeq (force)
35−import Test.QuickCheck (oneof, generate)
36−#endif
37−
38−import Test.Tasty.Bench
39−import Streamly.Benchmark.Common
40−
41−#ifndef USE_UNBOX
42−import Streamly.Benchmark.Data.Serialize.RecCompatible
43−import Streamly.Benchmark.Data.Serialize.RecNonCompatible
44−#endif
45−
46−#ifdef USE_UNBOX
47−#define SERIALIZE_CLASS Unbox
48−#define DERIVE_CLASS(typ) $(deriveUnbox [d|instance Unbox typ|])
49−#define SERIALIZE_OP pokeAt
50−#define DESERIALIZE_OP peekAt
51−#else
52−#define SERIALIZE_CLASS Serialize
53−#define DERIVE_CLASS(typ) $(deriveSerialize [d|instance Serialize typ|])
54−#define SERIALIZE_OP serializeAt
55−#define DESERIALIZE_OP deserializeAt
56−#endif
57−
58−-------------------------------------------------------------------------------
59−-- Types
60−-------------------------------------------------------------------------------
61−
62−data Unit = Unit
63− deriving (Generic, Show, Eq)
64−
65−#ifndef USE_TH
66−instance SERIALIZE_CLASS Unit
67−#else
68−DERIVE_CLASS(Unit)
69−#endif
70−
71−instance NFData Unit where
72− {-# INLINE rnf #-}
73− rnf _ = ()
74−
75−data Sum2
76− = Sum21
77− | Sum22
78− deriving (Generic, Show, Eq)
79−
80−#ifndef USE_TH
81−instance SERIALIZE_CLASS Sum2
82−#else
83−DERIVE_CLASS(Sum2)
84−#endif
85−
86−instance NFData Sum2 where
87− {-# INLINE rnf #-}
88− rnf _ = ()
89−
90−data Sum25
91− = Sum251
92− | Sum252
93− | Sum253
94− | Sum254
95− | Sum255
96− | Sum256
97− | Sum257
98− | Sum258
99− | Sum259
100− | Sum2510
101− | Sum2511
102− | Sum2512
103− | Sum2513
104− | Sum2514
105− | Sum2515
106− | Sum2516
107− | Sum2517
108− | Sum2518
109− | Sum2519
110− | Sum2520
111− | Sum2521
112− | Sum2522
113− | Sum2523
114− | Sum2524
115− | Sum2525
116− deriving (Generic, Show, Eq)
117−
118−#ifndef USE_TH
119−instance SERIALIZE_CLASS Sum25
120−#else
121−DERIVE_CLASS(Sum25)
122−#endif
123−
124−instance NFData Sum25 where
125− {-# INLINE rnf #-}
126− rnf _ = ()
127−
128−data Product25
129− = Product25
130− Int
131− Int
132− Int
133− Int
134− Int
135− Int
136− Int
137− Int
138− Int
139− Int
140− Int
141− Int
142− Int
143− Int
144− Int
145− Int
146− Int
147− Int
148− Int
149− Int
150− Int
151− Int
152− Int
153− Int
154− Int
155− deriving (Generic, Show)
156−
157−#ifndef USE_TH
158−instance SERIALIZE_CLASS Product25
159−#else
160−DERIVE_CLASS(Product25)
161−#endif
162−
163−instance NFData Product25 where
164− {-# INLINE rnf #-}
165− rnf
166− (Product25 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 a16 a17 a18 a19 a20 a21 a22 a23 a24 a25)
167− = a1
168− `seq` a2
169− `seq` a3
170− `seq` a4
171− `seq` a5
172− `seq` a6
173− `seq` a7
174− `seq` a8
175− `seq` a9
176− `seq` a10
177− `seq` a11
178− `seq` a12
179− `seq` a13
180− `seq` a14
181− `seq` a15
182− `seq` a16
183− `seq` a17
184− `seq` a18
185− `seq` a19
186− `seq` a20
187− `seq` a21
188− `seq` a22
189− `seq` a23
190− `seq` a24
191− `seq` a25
192− `seq` ()
193−
194−-- XXX derived Eq instance is not inlined
195−instance Eq Product25 where
196− {-# INLINE (==) #-}
197− (==)
198− (Product25 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 a16 a17 a18 a19 a20 a21 a22 a23 a24 a25)
199− (Product25 b1 b2 b3 b4 b5 b6 b7 b8 b9 b10 b11 b12 b13 b14 b15 b16 b17 b18 b19 b20 b21 b22 b23 b24 b25)
200− = a1 == b1
201− && a2 == b2
202− && a3 == b3
203− && a4 == b4
204− && a5 == b5
205− && a6 == b6
206− && a7 == b7
207− && a8 == b8
208− && a9 == b9
209− && a10 == b10
210− && a11 == b11
211− && a12 == b12
212− && a13 == b13
213− && a14 == b14
214− && a15 == b15
215− && a16 == b16
216− && a17 == b17
217− && a18 == b18
218− && a19 == b19
219− && a20 == b20
220− && a21 == b21
221− && a22 == b22
222− && a23 == b23
223− && a24 == b24
224− && a25 == b25
225−
226−-------------------------------------------------------------------------------
227−-- Simple non-recursive ADT
228−-------------------------------------------------------------------------------
229−
230−{-
231−data CustomDT1
232− = CDT1C1
233− | CDT1C2 Int
234− | CDT1C3 Int Int
235− deriving (Generic, Show, Eq)
236−
237−#ifndef USE_TH
238−instance SERIALIZE_CLASS CustomDT1
239−#else
240−DERIVE_CLASS(CustomDT1)
241−#endif
242−
243−instance NFData CustomDT1 where
244− {-# INLINE rnf #-}
245− rnf CDT1C1 = ()
246− rnf (CDT1C2 i) = i `seq` ()
247− rnf (CDT1C3 i1 i2) = i1 `seq` i2 `seq` ()
248−-}
249−
250−-------------------------------------------------------------------------------
251−-- Recursive ADT
252−-------------------------------------------------------------------------------
253−
254−#ifndef USE_UNBOX
255−data BinTree a
256− = Tree (BinTree a) (BinTree a)
257− | Leaf a
258− deriving (Show, Read, Eq, Generic)
259−
260−#ifndef USE_TH
261−instance Serialize (BinTree a)
262−#else
263−$(deriveSerialize [d|instance Serialize a => Serialize (BinTree a)|])
264−#endif
265−
266−instance NFData a => NFData (BinTree a) where
267− {-# INLINE rnf #-}
268− rnf (Leaf a) = rnf a `seq` ()
269− rnf (Tree l r) = rnf l `seq` rnf r
270−
271−-- XXX This may not terminate, or could become really large.
272−instance Arbitrary a => Arbitrary (BinTree a) where
273− arbitrary = oneof [Leaf <$> arbitrary, Tree <$> arbitrary <*> arbitrary]
274−
275−mkBinTree :: (Arbitrary a) => Int -> IO (BinTree a)
276−mkBinTree = go (generate arbitrary)
277−
278− where
279−
280− go r 0 = Leaf <$> r
281− go r n = Tree <$> go r (n - 1) <*> go r (n - 1)
282−
283−#endif
284−
285−-------------------------------------------------------------------------------
286−-- Size helpers
287−-------------------------------------------------------------------------------
288−
289−{-# INLINE getSize #-}
290−getSize :: forall a. SERIALIZE_CLASS a => a -> Int
291−#ifdef USE_UNBOX
292−getSize _ = sizeOf (Proxy :: Proxy a)
293−#else
294−getSize = addSizeTo 0
295−#endif
296−
297−-------------------------------------------------------------------------------
298−-- Common helpers
299−-------------------------------------------------------------------------------
300−
301−{- HLINT ignore "Eta reduce" -}
302−-- Parts of "f" that are dependent on val will not be optimized out.
303−{-# INLINE loop #-}
304−loop :: Int -> (a -> IO b) -> a -> IO ()
305−loop count f val = go count val
306− where
307−
308− go n x = when (n > 0) $ f x >> go (n-1) x
309−
310−-- The first arg of "f" is the environment which is not threaded around in the
311−-- loop.
312−{-# INLINE loopWith #-}
313−loopWith :: Int -> (e -> a -> IO b) -> e -> a -> IO ()
314−loopWith count f e val = go count val
315− where
316−
317− go n x = when (n > 0) $ f e x >> go (n-1) x
318−
319−benchSink :: NFData b => String -> Int -> (Int -> IO b) -> Benchmark
320−benchSink name times f = bench name (nfIO (randomRIO (times, times) >>= f))
321−
322−-------------------------------------------------------------------------------
323−-- Serialization Helpers
324−-------------------------------------------------------------------------------
325−
326−{-
327−{-# INLINE pokeWithSize #-}
328−pokeWithSize :: SERIALIZE_CLASS a => MutByteArray -> a -> IO ()
329−pokeWithSize arr val = do
330− let n = getSize val
331− n `seq` SERIALIZE_OP 0 arr val >> return ()
332−
333−{-# INLINE pokeTimesWithSize #-}
334−pokeTimesWithSize :: SERIALIZE_CLASS a => a -> Int -> IO ()
335−pokeTimesWithSize val times = do
336− let n = getSize val
337− arr <- MBA.new n
338− loopWith times pokeWithSize arr val
339−-}
340−
341−{-# INLINE poke #-}
342−poke :: SERIALIZE_CLASS a => MutByteArray -> a -> IO ()
343−poke arr val = void (SERIALIZE_OP 0 arr val)
344−
345−{-# INLINE pokeTimes #-}
346−pokeTimes :: SERIALIZE_CLASS a => a -> Int -> IO ()
347−pokeTimes val times = do
348− let n = getSize val
349− arr <- MBA.new n
350− loopWith times poke arr val
351−
352−{-# INLINE encode #-}
353−encode :: SERIALIZE_CLASS a => a -> IO ()
354−encode val = do
355− let n = getSize val
356− arr <- MBA.new n
357− void (SERIALIZE_OP 0 arr val)
358−
359−{-# INLINE encodeTimes #-}
360−encodeTimes :: SERIALIZE_CLASS a => a -> Int -> IO ()
361−encodeTimes val times = loop times encode val
362−
363−{-# INLINE peek #-}
364−peek :: forall a. (NFData a, SERIALIZE_CLASS a) =>
365− (a, Int) -> MutByteArray -> IO ()
366−#ifdef USE_UNBOX
367−peek (_val, _) arr = do
368− (val1 :: a) <- DESERIALIZE_OP 0 arr
369−#else
370−peek (_val, n) arr = do
371− (_, val1 :: a) <- DESERIALIZE_OP 0 arr n
372−#endif
373− -- If the datatype is not deeply strict or deepseq is not used then use
374− -- Equality.
375− -- Ensure that we are actually constructing the type and using it. This
376− -- is important, otherwise the structure is created and discarded, the
377− -- cost of creation of the structure is not accounted. Otherwise we may
378− -- just read the values and discard them. The comparison adds to the
379− -- cost though. We could use deepseq but then we need to write
380− -- instances of NFData and ensure that they are correct and perform
381− -- well. Equality check also ensures correctness.
382− {-
383− if (val1 /= val)
384− then error "peek: no match"
385− else return ()
386− -}
387− val1 `deepseq` return ()
388−
389−{-# INLINE peekTimes #-}
390−peekTimes :: (NFData a, SERIALIZE_CLASS a) => Int -> a -> Int -> IO ()
391−peekTimes n val times = do
392− arr <- MBA.new n
393− _ <- SERIALIZE_OP 0 arr val
394− loopWith times peek (val, n) arr
395−
396−{-# INLINE trip #-}
397−trip :: forall a. (NFData a, SERIALIZE_CLASS a) => a -> IO ()
398−trip val = do
399− let n = getSize val
400− arr <- MBA.new n
401− _ <- SERIALIZE_OP 0 arr val
402−#ifdef USE_UNBOX
403− (val1 :: a) <- DESERIALIZE_OP 0 arr
404−#else
405− (_, val1 :: a) <- DESERIALIZE_OP 0 arr n
406−#endif
407− -- Do not remove this or use deepseq, see the comments in peek.
408− {-
409− if (val1 /= val)
410− then error "roundtrip: no match"
411− else return ()
412− -}
413− -- Note: deepseq is not needed if the datatype is strict
414− val1 `deepseq` return ()
415−
416−{-# INLINE roundtrip #-}
417−roundtrip :: (NFData a, SERIALIZE_CLASS a) => a -> Int -> IO ()
418−roundtrip val times = loop times trip val
419−
420−-------------------------------------------------------------------------------
421−-- Benchmarks
422−-------------------------------------------------------------------------------
423−
424−{-# INLINE benchConst #-}
425−benchConst ::
426− String
427− -> (forall a. (NFData a, SERIALIZE_CLASS a) =>
428− Int -> a -> Int -> IO ())
429− -> Int
430− -> Benchmark
431−benchConst gname f times =
432− bgroup gname
433− [ let !n = getSize Unit
434− in benchSink "Unit" times (f n Unit)
435− {-
436− , let !n = getSize CDT1C1
437− in benchSink "C1" times (f n CDT1C1)
438− , let val = CDT1C2 5
439− !n = getSize val
440− in benchSink "C2" (times `div` 2) (f n val)
441− , let val = CDT1C3 5 2
442− !n = getSize val
443− in benchSink "C3" (times `div` 3) (f n val)
444− -}
445− , let !n = getSize Sum21
446− in benchSink "Sum2" times (f n Sum21)
447− , let !n = getSize Sum2525
448− in benchSink "Sum25" times (f n Sum2525)
449− , let val = Product25 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
450− !n = getSize val
451− in benchSink "Product25" (times `div` 26) (f n val)
452− ]
453−
454−#ifndef USE_UNBOX
455−{-# INLINE benchVar #-}
456−benchVar ::
457− String
458− -> (forall a. (NFData a, SERIALIZE_CLASS a) =>
459− Int -> a -> Int -> IO ())
460− -> BinTree Int
461− -> [Int]
462− -> Int
463− -> Benchmark
464−benchVar gname f tInt lInt times =
465− bgroup gname
466− [ let !n = getSize tInt
467− in benchSink "bintree-int" times (f n tInt)
468− , let !n = getSize lInt
469− in benchSink "list-int" times (f n lInt)
470− ]
471−
472−{-
473−{-# INLINE benchGeneric #-}
474−benchGeneric
475− :: (NFData b, Serialize b)
476− => String
477− -> String
478− -> (forall a. (NFData a, Serialize a) =>
479− Int -> a -> Int -> IO ())
480− -> b
481− -> Int
482− -> Benchmark
483−benchGeneric gname valId f val times =
484− bgroup gname
485− [ let !n = getSize val
486− in benchSink valId times (f n val)
487− ]
488−-}
489−
490−{-# INLINE benchLargeRec #-}
491−benchLargeRec ::
492− String
493− -> (forall a. (NFData a, Serialize a) =>
494− Int -> a -> Int -> IO ())
495− -> RecNonCompatible
496− -> RecCompatible
497− -> Int
498− -> Benchmark
499−benchLargeRec gname f recL recR times =
500− bgroup gname
501− [ let !n = getSize recL
502− in benchSink "RecNonCompatible" times (f n recL)
503− , let !n = getSize recR
504− in benchSink "RecCompatible" times (f n recR)
505− ]
506−#endif
507−
508−-- Times is scaled by the number of constructors to normalize
509−#ifdef USE_UNBOX
510−allBenchmarks :: Int -> [Benchmark]
511−allBenchmarks times =
512−#else
513−allBenchmarks ::
514− BinTree Int -> [Int] -> RecNonCompatible -> RecCompatible -> Int -> [Benchmark]
515−allBenchmarks tInt lInt recL recR times =
516−#endif
517− [ bgroup "sizeOf"
518− [
519−#ifndef USE_UNBOX
520− bench "bintree-int" $ nf getSize tInt
521− , bench "list-int" $ nf getSize lInt
522−#endif
523− ]
524− , benchConst "poke" (const pokeTimes) times
525− -- , benchConst "pokeWithSize" (const pokeTimesWithSize) times
526− , benchConst "encode" (const encodeTimes) times
527− , benchConst "peek" peekTimes times
528− , benchConst "roundtrip" (const roundtrip) times
529−#ifndef USE_UNBOX
530− , benchVar "poke" (const pokeTimes) tInt lInt 1
531− -- , benchVar "pokeWithSize" (const pokeTimesWithSize) tInt lInt 1
532− , benchVar "encode" (const encodeTimes) tInt lInt 1
533− , benchVar "peek" peekTimes tInt lInt 1
534− , benchVar "roundtrip" (const roundtrip) tInt lInt 1
535− , benchLargeRec "poke" (const pokeTimes) recL recR times
536− , benchLargeRec "encode" (const encodeTimes) recL recR times
537− , benchLargeRec "peek" peekTimes recL recR times
538− , benchLargeRec "roundtrip" (const roundtrip) recL recR times
539−#endif
540− ]
541−
542−-------------------------------------------------------------------------------
543−-- Driver
544−-------------------------------------------------------------------------------
545−
546−main :: IO ()
547−main = do
548−#ifndef USE_UNBOX
549− -- Approximately 100000 constructors
550− -- Assuming Leaf nodes constitute two constructors (Leaf, Int) and internal
551− -- nodes 1 level = log_2 (100001/3) + 1 = 16
552− !(tInt :: BinTree Int) <- force <$> mkBinTree 16
553−
554− let !recL = valRecNonCompatible
555− let !recR = valRecCompatible
556−
557− -- Approximately 100000 constructors, assuming two constructors (Cons, Int)
558− -- per element.
559− let lInt = [1..50000 :: Int]
560− let !len = length lInt -- evaluate the list
561−#endif
562−#ifndef FUSION_CHECK
563−#ifdef USE_UNBOX
564− runWithCLIOpts defaultStreamSize allBenchmarks
565−#else
566− len
567− `seq` runWithCLIOpts
568− defaultStreamSize
569− (allBenchmarks tInt lInt recL recR)
570−#endif
571−#else
572− -- Enable FUSION_CHECK macro at the beginning of the file
573− -- Enable one benchmark below, and run the benchmark
574− -- Check the .dump-simpl output
575− let value = 100000
576− -- print $ getSize (CDT1C3 4 2)
577− -- print $ getSize tInt
578− -- print $ getSize lInt
579−
580− -- pokeTimes tInt 1
581−
582− -- peekTimes ((CDT1C2 (5 :: Int)) :: CustomDT1) value
583− -- peekTimes (Sum2525) value
584− -- peekTimes (Product25 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25) value
585− -- peekTimes tInt 1
586− let !n = getSize lInt
587− peekTimes n lInt 1
588−
589− -- roundtrip ((CDT1C2 (5 :: Int)) :: CustomDT1) value
590− return ()
591−#endif
benchmark/Streamly/Benchmark/Data/Serialize/RecCompatible.hsdeleted−24
@@ -1,24 +0,0 @@
1−{-# LANGUAGE TemplateHaskell #-}
2−
3−module Streamly.Benchmark.Data.Serialize.RecCompatible
4− ( RecCompatible(..)
5− , valRecCompatible
6− ) where
7−
8−--------------------------------------------------------------------------------
9−-- Imports
10−--------------------------------------------------------------------------------
11−
12−import Streamly.Internal.Data.MutByteArray (Serialize)
13−import Streamly.Benchmark.Data.Serialize.TH (genLargeRecord)
14−
15−import qualified Streamly.Internal.Data.MutByteArray as Serialize
16−
17−--------------------------------------------------------------------------------
18−-- Code
19−--------------------------------------------------------------------------------
20−
21−$(genLargeRecord "RecCompatible" 50)
22−$(Serialize.deriveSerializeWith
23− (Serialize.encodeRecordFields True)
24− [d|instance Serialize RecCompatible|])
benchmark/Streamly/Benchmark/Data/Serialize/RecNonCompatible.hsdeleted−21
@@ -1,21 +0,0 @@
1−{-# LANGUAGE TemplateHaskell #-}
2−
3−module Streamly.Benchmark.Data.Serialize.RecNonCompatible
4− ( RecNonCompatible(..)
5− , valRecNonCompatible
6− ) where
7−
8−--------------------------------------------------------------------------------
9−-- Imports
10−--------------------------------------------------------------------------------
11−
12−import Streamly.Benchmark.Data.Serialize.TH (genLargeRecord)
13−
14−import qualified Streamly.Internal.Data.MutByteArray as Serialize
15−
16−--------------------------------------------------------------------------------
17−-- Code
18−--------------------------------------------------------------------------------
19−
20−$(genLargeRecord "RecNonCompatible" 50)
21−$(Serialize.deriveSerialize [d|instance Serialize.Serialize RecNonCompatible|])
benchmark/Streamly/Benchmark/Data/Serialize/TH.hsdeleted−76
@@ -1,76 +0,0 @@
1−{-# LANGUAGE TemplateHaskell #-}
2−
3−module Streamly.Benchmark.Data.Serialize.TH (genLargeRecord) where
4−
5−--------------------------------------------------------------------------------
6−-- Imports
7−--------------------------------------------------------------------------------
8−
9−import Language.Haskell.TH
10−
11−import Streamly.Internal.Data.MutByteArray (makeI)
12−import Control.DeepSeq (NFData(..))
13−
14−--------------------------------------------------------------------------------
15−-- Large Record
16−--------------------------------------------------------------------------------
17−
18−genLargeRecord :: String -> Int -> Q [Dec]
19−genLargeRecord tyName numFields =
20− sequence
21− [ dataD
22− (pure [])
23− (mkName tyName)
24− []
25− Nothing
26− [mkCon tyName]
27− [derivClause Nothing [conT ''Eq, conT ''Show]]
28− , mkValueSigDec
29− , mkValueDec
30− , nfDataInstance tyName
31− ]
32−
33− where
34−
35− fieldTypeChoices = [conT ''()]
36− chooseCycle i xs = xs !! (i `mod` length xs)
37− nfDataInstance nm =
38− instanceD
39− (pure [])
40− (appT (conT ''NFData) (conT (mkName nm)))
41− [ funD
42− 'rnf
43− [ clause
44− [ conP
45− (mkName nm)
46− (varP . makeI <$> [0 .. (numFields - 1)])
47− ]
48− (normalB
49− (foldl
50− (\b a -> [|rnf $(b) `seq` rnf $(a)|])
51− [|()|]
52− (varE . makeI <$> [0 .. (numFields - 1)])))
53− []
54− ]
55− ]
56− valueName = mkName $ "val" ++ tyName
57− mkValueSigDec = sigD valueName [t|$(conT (mkName tyName))|]
58− mkValueDec =
59− funD
60− valueName
61− [ clause
62− []
63− (normalB
64− (foldl
65− (\b a -> [|$(b) $(a)|])
66− (conE (mkName tyName))
67− (conE '() <$ [0 .. (numFields - 1)])))
68− []
69− ]
70− mkCon nm = recC (mkName nm) (mkField <$> [0 .. (numFields - 1)])
71− mkField i =
72− varBangType
73− (mkName ("field" ++ show i))
74− (bangType
75− (bang noSourceUnpackedness noSourceStrictness)
76− (chooseCycle i fieldTypeChoices))
benchmark/Streamly/Benchmark/Data/Stream.hs−57
@@ -9,19 +9,12 @@
9{-# LANGUAGE ScopedTypeVariables #-}
9{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE RankNTypes #-}
10{-# LANGUAGE RankNTypes #-}
11
11
12−#undef FUSION_CHECK
13−#ifdef FUSION_CHECK
14−{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
15−#endif
16−
17module Main (main) where
12module Main (main) where
18
13
19import Streamly.Benchmark.Common.Handle (mkHandleBenchEnv)
14import Streamly.Benchmark.Common.Handle (mkHandleBenchEnv)
20
15
21import qualified Stream.Eliminate as Elimination
16import qualified Stream.Eliminate as Elimination
22−#ifndef USE_STREAMLY_CORE
23import qualified Stream.Exceptions as Exceptions
17import qualified Stream.Exceptions as Exceptions
24−#endif
25import qualified Stream.Expand as NestedStream
18import qualified Stream.Expand as NestedStream
26import qualified Stream.Generate as Generation
19import qualified Stream.Generate as Generation
27import qualified Stream.Lift as Lift
20import qualified Stream.Lift as Lift
@@ -33,21 +26,8 @@ import qualified Stream.Transform as Transformation
33
26
34import Streamly.Benchmark.Common
27import Streamly.Benchmark.Common
35
28
36−#ifdef FUSION_CHECK
37−import Data.Function ((&))
38−import Streamly.Data.Stream (Stream)
39−import qualified Streamly.Internal.Data.Stream as Stream
40−import qualified Streamly.Internal.Data.Fold as Fold
41−import qualified Data.Foldable as Foldable
42−import Stream.Common
43−#endif
44−
45moduleName :: String
29moduleName :: String
46−#ifdef USE_STREAMK
47−moduleName = "Data.Stream.StreamDK"
48−#else
49moduleName = "Data.Stream"
30moduleName = "Data.Stream"
50−#endif
51
31
52-------------------------------------------------------------------------------
32-------------------------------------------------------------------------------
53-- Main
33-- Main
@@ -58,7 +38,6 @@ moduleName = "Data.Stream"
58--
38--
59main :: IO ()
39main :: IO ()
60main = do
40main = do
61−#ifndef FUSION_CHECK
62 env <- mkHandleBenchEnv
41 env <- mkHandleBenchEnv
63 runWithCLIOpts defaultStreamSize (allBenchmarks env)
42 runWithCLIOpts defaultStreamSize (allBenchmarks env)
64
43
@@ -67,9 +46,7 @@ main = do
67 allBenchmarks env size = Prelude.concat
46 allBenchmarks env size = Prelude.concat
68 [ Generation.benchmarks moduleName size
47 [ Generation.benchmarks moduleName size
69 , Elimination.benchmarks moduleName size
48 , Elimination.benchmarks moduleName size
70−#ifndef USE_STREAMLY_CORE
71 , Exceptions.benchmarks moduleName env size
49 , Exceptions.benchmarks moduleName env size
72−#endif
73#ifdef USE_PRELUDE
50#ifdef USE_PRELUDE
74 , Split.benchmarks moduleName env
51 , Split.benchmarks moduleName env
75#endif
52#endif
@@ -78,37 +55,3 @@ main = do
78 , Lift.benchmarks moduleName size
55 , Lift.benchmarks moduleName size
79 , NestedStream.benchmarks moduleName size
56 , NestedStream.benchmarks moduleName size
80 ]
57 ]
81−#else
82− -- Enable FUSION_CHECK macro at the beginning of the file
83− -- Enable one benchmark below, and run the benchmark
84− -- Check the .dump-simpl output
85− let value = 100000
86− let input = sourceUnfoldrM value 1
87−
88− -- Stream.foldr (:) [] input >>= print . Prelude.length
89− -- Stream.fold (Fold.foldr' (:) []) input >>= print . Prelude.length
90−
91− -- Stream.toList input >>= print . Prelude.length
92− -- Stream.fold Fold.toList input >>= print . Prelude.length
93−
94− -- We can automatically assert that these generate identical core
95−
96− -- Stream.drain input >>= print
97− -- Stream.fold Fold.drain input >>= print
98−
99− -- Stream.last input >>= print
100− -- Stream.fold Fold.latest input >>= print
101−
102− -- Stream.length input >>= print
103− -- Stream.fold Fold.length input >>= print
104−
105− -- Stream.maximum input >>= print
106− -- Stream.fold Fold.maximum input >>= print
107−
108− -- Stream.head input >>= print
109− -- Stream.fold Fold.one input >>= print
110−
111− -- composeN 4 (Stream.scanl' (+) 0) input
112− composeN 4 (Stream.scan (Fold.foldl' (+) 0)) input
113− return ()
114−#endif
benchmark/Streamly/Benchmark/Data/Stream/Common.hs+67−139
@@ -9,16 +9,9 @@
9-- License : BSD-3-Clause
9-- License : BSD-3-Clause
10-- Maintainer : streamly@composewell.com
10-- Maintainer : streamly@composewell.com
11
11
12−#ifdef USE_PRELUDE
13−{-# OPTIONS_GHC -Wno-deprecations #-}
14−#endif
15−
16module Stream.Common
12module Stream.Common
17 ( MonadAsync
13 ( MonadAsync
18
14
19− , fromStream
20− , toStream
21−
22 -- Generation
15 -- Generation
23 , fromListM
16 , fromListM
24 , fromFoldableM
17 , fromFoldableM
@@ -41,13 +34,10 @@ module Stream.Common
41 -- Benchmark stream elimination
34 -- Benchmark stream elimination
42 , benchIOSink
35 , benchIOSink
43 , benchIOSrc
36 , benchIOSrc
44− , benchIO
45
37
46 -- Benchmarking functions
38 -- Benchmarking functions
47−#ifdef USE_STREAMK
48 , concatStreamsWith
39 , concatStreamsWith
49− , mergeMapWith
40+ , concatPairsWith
50−#endif
51 , apDiscardFst
41 , apDiscardFst
52 , apDiscardSnd
42 , apDiscardSnd
53 , apLiftA2
43 , apLiftA2
@@ -71,12 +61,10 @@ module Stream.Common
71 )
61 )
72where
62where
73
63
74−#if !MIN_VERSION_base(4,18,0)
75import Control.Applicative (liftA2)
64import Control.Applicative (liftA2)
76−#endif
77−import Control.DeepSeq (NFData)
78import Control.Exception (try)
65import Control.Exception (try)
79import GHC.Exception (ErrorCall)
66import GHC.Exception (ErrorCall)
67+import Streamly.Internal.Data.Stream (Stream)
80import System.Random (randomRIO)
68import System.Random (randomRIO)
81
69
82import qualified Streamly.Internal.Data.Fold as Fold
70import qualified Streamly.Internal.Data.Fold as Fold
@@ -86,97 +74,43 @@ import qualified Streamly.Internal.Data.Pipe as Pipe
86import Streamly.Prelude (foldl', scanl')
74import Streamly.Prelude (foldl', scanl')
87import qualified Streamly.Internal.Data.Stream.IsStream as Stream
75import qualified Streamly.Internal.Data.Stream.IsStream as Stream
88import qualified Streamly.Prelude as Stream
76import qualified Streamly.Prelude as Stream
89−import qualified Streamly.Prelude as StreamK
90import Streamly.Benchmark.Prelude
77import Streamly.Benchmark.Prelude
91 ( composeN, sourceConcatMapId, benchIOSink
78 ( composeN, sourceConcatMapId, benchIOSink
92− , concatStreamsWith
79+ , concatStreamsWith, concatPairsWith
93 )
80 )
94#else
81#else
95−import Streamly.Internal.Data.Stream (Stream)
82+import Control.DeepSeq (NFData)
96−import qualified Streamly.Internal.Data.Stream as D
97−#ifdef USE_STREAMK
98−import Streamly.Internal.Data.StreamK (StreamK)
99−import qualified Streamly.Internal.Data.Stream as Stream
100−import qualified Streamly.Internal.Data.StreamK as StreamK
101−#else
102import qualified Streamly.Internal.Data.Stream as Stream
83import qualified Streamly.Internal.Data.Stream as Stream
103−import qualified Streamly.Internal.Data.Stream as StreamK
104#endif
84#endif
105−#endif
106−
107−import Test.Tasty.Bench
108−import Prelude hiding (Foldable(..), mapM, replicate)
109
85
110−#ifdef USE_STREAMK
86+import Gauge
111−toStream :: Applicative m => StreamK m a -> Stream m a
87+import Prelude hiding (mapM, replicate)
112−toStream = StreamK.toStream
113−
114−fromStream :: Monad m => Stream m a -> StreamK m a
115−fromStream = StreamK.fromStream
116−#else
117−fromStream :: a -> a
118−fromStream = id
119−
120−toStream :: a -> a
121−toStream = id
122−#endif
123
88
124#ifdef USE_PRELUDE
89#ifdef USE_PRELUDE
125−type Stream = Stream.SerialT
126type MonadAsync m = Stream.MonadAsync m
90type MonadAsync m = Stream.MonadAsync m
127−mkCross = id
128−unCross = id
129#else
91#else
130type MonadAsync = Monad
92type MonadAsync = Monad
131−
132−#ifdef USE_STREAMK
133−mkCross :: StreamK m a -> StreamK.CrossStreamK m a
134−mkCross = StreamK.mkCross
135−
136−unCross :: StreamK.CrossStreamK m a -> StreamK m a
137−unCross = StreamK.unCross
138−#else
139−mkCross :: Stream m a -> Stream.CrossStream m a
140−mkCross = Stream.mkCross
141−
142−unCross :: Stream.CrossStream m a -> Stream m a
143−unCross = Stream.unCross
144−#endif
145#endif
93#endif
146
94
147−#ifdef USE_PRELUDE
148{-# INLINE append #-}
95{-# INLINE append #-}
149−append :: Monad m => Stream m a -> Stream m a -> Stream m a
96+append :: Stream m a -> Stream m a -> Stream m a
97+#ifdef USE_PRELUDE
150append = Stream.serial
98append = Stream.serial
151#else
99#else
152−#ifdef USE_STREAMK
153−append :: StreamK m a -> StreamK m a -> StreamK m a
154−append = StreamK.append
155−#else
156−append :: Monad m => Stream m a -> Stream m a -> Stream m a
157append = Stream.append
100append = Stream.append
158#endif
101#endif
159−#endif
160
102
161{-# INLINE append2 #-}
103{-# INLINE append2 #-}
162append2 :: Monad m => Stream m a -> Stream m a -> Stream m a
104append2 :: Monad m => Stream m a -> Stream m a -> Stream m a
163#ifdef USE_PRELUDE
105#ifdef USE_PRELUDE
164append2 = Stream.append
106append2 = Stream.append
165#else
107#else
166−append2 = D.append
108+append2 = Stream.append2
167#endif
109#endif
168
110
169{-# INLINE drain #-}
111{-# INLINE drain #-}
170drain :: Monad m => Stream m a -> m ()
112drain :: Monad m => Stream m a -> m ()
171−{-# INLINE toList #-}
172−toList :: Monad m => Stream m a -> m [a]
173−#ifdef USE_PRELUDE
174−drain = Stream.drain
175−toList = Stream.toList
176−#else
177drain = Stream.fold Fold.drain
113drain = Stream.fold Fold.drain
178−toList = Stream.fold Fold.toList
179−#endif
180
114
181{-# INLINE fromListM #-}
115{-# INLINE fromListM #-}
182fromListM :: MonadAsync m => [m a] -> Stream m a
116fromListM :: MonadAsync m => [m a] -> Stream m a
@@ -191,7 +125,7 @@ fromFoldableM :: MonadAsync m => [m a] -> Stream m a
191#ifdef USE_PRELUDE
125#ifdef USE_PRELUDE
192fromFoldableM = Stream.fromFoldableM
126fromFoldableM = Stream.fromFoldableM
193#else
127#else
194−fromFoldableM = Stream.sequence . toStream . StreamK.fromFoldable
128+fromFoldableM = Stream.sequence . Stream.fromFoldable
195#endif
129#endif
196
130
197{-# INLINE sourceUnfoldrM #-}
131{-# INLINE sourceUnfoldrM #-}
@@ -228,8 +162,8 @@ sourceUnfoldrAction value n = Stream.unfoldr step n
228 else Just (return cnt, cnt + 1)
162 else Just (return cnt, cnt + 1)
229
163
230{-# INLINE sourceFromFoldable #-}
164{-# INLINE sourceFromFoldable #-}
231−sourceFromFoldable :: Monad m => Int -> Int -> Stream m Int
165+sourceFromFoldable :: Int -> Int -> Stream m Int
232−sourceFromFoldable value n = toStream $ StreamK.fromFoldable [n..n+value]
166+sourceFromFoldable value n = Stream.fromFoldable [n..n+value]
233
167
234#ifndef USE_PRELUDE
168#ifndef USE_PRELUDE
235{-# INLINE benchIOSink #-}
169{-# INLINE benchIOSink #-}
@@ -249,50 +183,44 @@ benchIOSrc
249benchIOSrc name f =
183benchIOSrc name f =
250 bench name $ nfIO $ randomRIO (1,1) >>= drain . f
184 bench name $ nfIO $ randomRIO (1,1) >>= drain . f
251
185
252−{-# NOINLINE benchIO #-}
253−benchIO :: (NFData b) => String -> (Int -> IO b) -> Benchmark
254−benchIO name f = bench name $ nfIO $ randomRIO (1,1) >>= f
255−
256#ifndef USE_PRELUDE
186#ifndef USE_PRELUDE
257−#ifdef USE_STREAMK
258{-# INLINE concatStreamsWith #-}
187{-# INLINE concatStreamsWith #-}
259concatStreamsWith
188concatStreamsWith
260− :: (StreamK IO Int -> StreamK IO Int -> StreamK IO Int)
189+ :: (Stream IO Int -> Stream IO Int -> Stream IO Int)
261 -> Int
190 -> Int
262 -> Int
191 -> Int
263 -> Int
192 -> Int
264 -> IO ()
193 -> IO ()
265concatStreamsWith op outer inner n =
194concatStreamsWith op outer inner n =
266− drain $ toStream $ StreamK.concatMapWith op
195+ drain $ Stream.concatMapWith op
267− (fromStream . sourceUnfoldrM inner)
196+ (sourceUnfoldrM inner)
268− (fromStream $ sourceUnfoldrM outer n)
197+ (sourceUnfoldrM outer n)
269
198
270−{-# INLINE mergeMapWith #-}
199+{-# INLINE concatPairsWith #-}
271−mergeMapWith
200+concatPairsWith
272− :: (StreamK IO Int -> StreamK IO Int -> StreamK IO Int)
201+ :: (Stream IO Int -> Stream IO Int -> Stream IO Int)
273 -> Int
202 -> Int
274 -> Int
203 -> Int
275 -> Int
204 -> Int
276 -> IO ()
205 -> IO ()
277−mergeMapWith op outer inner n =
206+concatPairsWith op outer inner n =
278− drain $ toStream $ StreamK.mergeMapWith op
207+ drain $ Stream.concatPairsWith op
279− (fromStream . sourceUnfoldrM inner)
208+ (sourceUnfoldrM inner)
280− (fromStream $ sourceUnfoldrM outer n)
209+ (sourceUnfoldrM outer n)
281−#endif
282
210
283{-# INLINE sourceConcatMapId #-}
211{-# INLINE sourceConcatMapId #-}
284sourceConcatMapId :: (Monad m)
212sourceConcatMapId :: (Monad m)
285 => Int -> Int -> Stream m (Stream m Int)
213 => Int -> Int -> Stream m (Stream m Int)
286sourceConcatMapId value n =
214sourceConcatMapId value n =
287− Stream.fromList $ fmap (D.fromEffect . return) [n..n+value]
215+ Stream.fromFoldable $ fmap (Stream.fromEffect . return) [n..n+value]
288#endif
216#endif
289
217
290{-# INLINE apDiscardFst #-}
218{-# INLINE apDiscardFst #-}
291apDiscardFst :: MonadAsync m =>
219apDiscardFst :: MonadAsync m =>
292 Int -> Int -> m ()
220 Int -> Int -> m ()
293−apDiscardFst linearCount start = drain $ toStream $ unCross $
221+apDiscardFst linearCount start = drain $
294− mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
222+ sourceUnfoldrM nestedCount2 start
295− *> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
223+ *> sourceUnfoldrM nestedCount2 start
296
224
297 where
225 where
298
226
@@ -300,9 +228,9 @@ apDiscardFst linearCount start = drain $ toStream $ unCross $
300
228
301{-# INLINE apDiscardSnd #-}
229{-# INLINE apDiscardSnd #-}
302apDiscardSnd :: MonadAsync m => Int -> Int -> m ()
230apDiscardSnd :: MonadAsync m => Int -> Int -> m ()
303−apDiscardSnd linearCount start = drain $ toStream $ unCross $
231+apDiscardSnd linearCount start = drain $
304− mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
232+ sourceUnfoldrM nestedCount2 start
305− <* mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
233+ <* sourceUnfoldrM nestedCount2 start
306
234
307 where
235 where
308
236
@@ -310,9 +238,9 @@ apDiscardSnd linearCount start = drain $ toStream $ unCross $
310
238
311{-# INLINE apLiftA2 #-}
239{-# INLINE apLiftA2 #-}
312apLiftA2 :: MonadAsync m => Int -> Int -> m ()
240apLiftA2 :: MonadAsync m => Int -> Int -> m ()
313−apLiftA2 linearCount start = drain $ toStream $ unCross $
241+apLiftA2 linearCount start = drain $
314− liftA2 (+) (mkCross (fromStream $ sourceUnfoldrM nestedCount2 start))
242+ liftA2 (+) (sourceUnfoldrM nestedCount2 start)
315− (mkCross (fromStream $ sourceUnfoldrM nestedCount2 start))
243+ (sourceUnfoldrM nestedCount2 start)
316
244
317 where
245 where
318
246
@@ -320,9 +248,9 @@ apLiftA2 linearCount start = drain $ toStream $ unCross $
320
248
321{-# INLINE toNullAp #-}
249{-# INLINE toNullAp #-}
322toNullAp :: MonadAsync m => Int -> Int -> m ()
250toNullAp :: MonadAsync m => Int -> Int -> m ()
323−toNullAp linearCount start = drain $ toStream $ unCross $
251+toNullAp linearCount start = drain $
324− (+) <$> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
252+ (+) <$> sourceUnfoldrM nestedCount2 start
325− <*> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
253+ <*> sourceUnfoldrM nestedCount2 start
326
254
327 where
255 where
328
256
@@ -330,9 +258,9 @@ toNullAp linearCount start = drain $ toStream $ unCross $
330
258
331{-# INLINE monadThen #-}
259{-# INLINE monadThen #-}
332monadThen :: MonadAsync m => Int -> Int -> m ()
260monadThen :: MonadAsync m => Int -> Int -> m ()
333−monadThen linearCount start = drain $ toStream $ unCross $ do
261+monadThen linearCount start = drain $ do
334− mkCross (fromStream $ sourceUnfoldrM nestedCount2 start) >>
262+ sourceUnfoldrM nestedCount2 start >>
335− mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
263+ sourceUnfoldrM nestedCount2 start
336
264
337 where
265 where
338
266
@@ -340,9 +268,9 @@ monadThen linearCount start = drain $ toStream $ unCross $ do
340
268
341{-# INLINE toNullM #-}
269{-# INLINE toNullM #-}
342toNullM :: MonadAsync m => Int -> Int -> m ()
270toNullM :: MonadAsync m => Int -> Int -> m ()
343−toNullM linearCount start = drain $ toStream $ unCross $ do
271+toNullM linearCount start = drain $ do
344− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
272+ x <- sourceUnfoldrM nestedCount2 start
345− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
273+ y <- sourceUnfoldrM nestedCount2 start
346 return $ x + y
274 return $ x + y
347
275
348 where
276 where
@@ -351,56 +279,56 @@ toNullM linearCount start = drain $ toStream $ unCross $ do
351
279
352{-# INLINE toNullM3 #-}
280{-# INLINE toNullM3 #-}
353toNullM3 :: MonadAsync m => Int -> Int -> m ()
281toNullM3 :: MonadAsync m => Int -> Int -> m ()
354−toNullM3 linearCount start = drain $ toStream $ unCross $ do
282+toNullM3 linearCount start = drain $ do
355− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount3 start)
283+ x <- sourceUnfoldrM nestedCount3 start
356− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount3 start)
284+ y <- sourceUnfoldrM nestedCount3 start
357− z <- mkCross (fromStream $ sourceUnfoldrM nestedCount3 start)
285+ z <- sourceUnfoldrM nestedCount3 start
358 return $ x + y + z
286 return $ x + y + z
359 where
287 where
360 nestedCount3 = round (fromIntegral linearCount**(1/3::Double))
288 nestedCount3 = round (fromIntegral linearCount**(1/3::Double))
361
289
362{-# INLINE filterAllOutM #-}
290{-# INLINE filterAllOutM #-}
363filterAllOutM :: MonadAsync m => Int -> Int -> m ()
291filterAllOutM :: MonadAsync m => Int -> Int -> m ()
364−filterAllOutM linearCount start = drain $ toStream $ unCross $ do
292+filterAllOutM linearCount start = drain $ do
365− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
293+ x <- sourceUnfoldrM nestedCount2 start
366− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
294+ y <- sourceUnfoldrM nestedCount2 start
367 let s = x + y
295 let s = x + y
368 if s < 0
296 if s < 0
369 then return s
297 then return s
370− else mkCross StreamK.nil
298+ else Stream.nil
371 where
299 where
372 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
300 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
373
301
374{-# INLINE filterAllInM #-}
302{-# INLINE filterAllInM #-}
375filterAllInM :: MonadAsync m => Int -> Int -> m ()
303filterAllInM :: MonadAsync m => Int -> Int -> m ()
376−filterAllInM linearCount start = drain $ toStream $ unCross $ do
304+filterAllInM linearCount start = drain $ do
377− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
305+ x <- sourceUnfoldrM nestedCount2 start
378− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
306+ y <- sourceUnfoldrM nestedCount2 start
379 let s = x + y
307 let s = x + y
380 if s > 0
308 if s > 0
381 then return s
309 then return s
382− else mkCross StreamK.nil
310+ else Stream.nil
383 where
311 where
384 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
312 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
385
313
386{-# INLINE filterSome #-}
314{-# INLINE filterSome #-}
387filterSome :: MonadAsync m => Int -> Int -> m ()
315filterSome :: MonadAsync m => Int -> Int -> m ()
388−filterSome linearCount start = drain $ toStream $ unCross $ do
316+filterSome linearCount start = drain $ do
389− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
317+ x <- sourceUnfoldrM nestedCount2 start
390− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
318+ y <- sourceUnfoldrM nestedCount2 start
391 let s = x + y
319 let s = x + y
392 if s > 1100000
320 if s > 1100000
393 then return s
321 then return s
394− else mkCross StreamK.nil
322+ else Stream.nil
395 where
323 where
396 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
324 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
397
325
398{-# INLINE breakAfterSome #-}
326{-# INLINE breakAfterSome #-}
399breakAfterSome :: Int -> Int -> IO ()
327breakAfterSome :: Int -> Int -> IO ()
400breakAfterSome linearCount start = do
328breakAfterSome linearCount start = do
401− (_ :: Either ErrorCall ()) <- try $ drain $ toStream $ unCross $ do
329+ (_ :: Either ErrorCall ()) <- try $ drain $ do
402− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
330+ x <- sourceUnfoldrM nestedCount2 start
403− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
331+ y <- sourceUnfoldrM nestedCount2 start
404 let s = x + y
332 let s = x + y
405 if s > 1100000
333 if s > 1100000
406 then error "break"
334 then error "break"
@@ -411,9 +339,9 @@ breakAfterSome linearCount start = do
411
339
412{-# INLINE toListM #-}
340{-# INLINE toListM #-}
413toListM :: MonadAsync m => Int -> Int -> m [Int]
341toListM :: MonadAsync m => Int -> Int -> m [Int]
414−toListM linearCount start = toList $ toStream $ unCross $ do
342+toListM linearCount start = Stream.fold Fold.toList $ do
415− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
343+ x <- sourceUnfoldrM nestedCount2 start
416− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
344+ y <- sourceUnfoldrM nestedCount2 start
417 return $ x + y
345 return $ x + y
418 where
346 where
419 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
347 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
@@ -423,9 +351,9 @@ toListM linearCount start = toList $ toStream $ unCross $ do
423{-# INLINE toListSome #-}
351{-# INLINE toListSome #-}
424toListSome :: MonadAsync m => Int -> Int -> m [Int]
352toListSome :: MonadAsync m => Int -> Int -> m [Int]
425toListSome linearCount start =
353toListSome linearCount start =
426− toList $ Stream.take 10000 $ toStream $ unCross $ do
354+ Stream.fold Fold.toList $ Stream.take 10000 $ do
427− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
355+ x <- sourceUnfoldrM nestedCount2 start
428− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
356+ y <- sourceUnfoldrM nestedCount2 start
429 return $ x + y
357 return $ x + y
430 where
358 where
431 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
359 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
benchmark/Streamly/Benchmark/Data/Stream/Concurrent.hsdeleted−20
@@ -1,20 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−-- |
3−-- Module : Main
4−-- Copyright : (c) 2018 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−
9−import Stream.ConcurrentCommon (allBenchmarks)
10−import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
11−
12−moduleName :: String
13−moduleName = "Data.Stream.Concurrent"
14−
15−-------------------------------------------------------------------------------
16−-- Main
17−-------------------------------------------------------------------------------
18−
19−main :: IO ()
20−main = runWithCLIOpts defaultStreamSize (allBenchmarks moduleName False id)
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentCommon.hsdeleted−208
@@ -1,208 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−-- |
3−-- Module : Main
4−-- Copyright : (c) 2018 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−
9−module Stream.ConcurrentCommon
10− ( allBenchmarks
11− )
12−where
13−
14−import Stream.Common
15− (composeN, benchIO, benchIOSink, benchIOSrc, sourceUnfoldrM)
16−import Streamly.Data.Stream (Stream)
17−import Streamly.Internal.Data.Stream.Prelude (MonadAsync, Config)
18−
19−import qualified Data.List as List
20−import qualified Streamly.Data.Fold as Fold
21−import qualified Streamly.Data.Stream as Stream
22−import qualified Streamly.Internal.Data.Stream.Prelude as Async
23−
24−import Test.Tasty.Bench
25−import Prelude hiding (mapM)
26−import Streamly.Benchmark.Common
27−
28−-- XXX Write inspection tests to make sure no dictionaries are being passed
29−-- around to find specialization issues. Could be really bad for perf.
30−
31−-------------------------------------------------------------------------------
32−-- Mapping
33−-------------------------------------------------------------------------------
34−
35−{-# INLINE mapM #-}
36−mapM ::
37− MonadAsync m
38− => (Config -> Config)
39− -> Int
40− -> Stream m Int
41− -> m ()
42−mapM f n = composeN n $ Async.parMapM f return
43−
44−o_1_space_mapping :: Int -> (Config -> Config) -> [Benchmark]
45−o_1_space_mapping value f =
46− [ bgroup "mapping"
47− [ benchIOSink value "mapM" $ mapM f 1
48− ]
49− ]
50−
51−-------------------------------------------------------------------------------
52−-- Size conserving transformations (reordering, buffering, etc.)
53−-------------------------------------------------------------------------------
54−
55−o_n_heap_buffering :: Int -> (Config -> Config) -> [Benchmark]
56−o_n_heap_buffering value f =
57− [ bgroup "buffered"
58− [ benchIOSink value "mkAsync"
59− (Stream.fold Fold.drain . Async.parEval f)
60− ]
61− ]
62−
63−-------------------------------------------------------------------------------
64−-- Joining
65−-------------------------------------------------------------------------------
66−
67−{-# INLINE async2 #-}
68−async2 :: (Config -> Config) -> Int -> Int -> IO ()
69−async2 f count n =
70− Stream.fold Fold.drain
71− $ Async.parTwo f
72− (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
73−
74−{-# INLINE concatAsync2 #-}
75−concatAsync2 :: (Config -> Config) -> Int -> Int -> IO ()
76−concatAsync2 f count n =
77− Stream.fold Fold.drain
78− $ Async.parConcat f
79− $ Stream.fromList
80− [sourceUnfoldrM count n, sourceUnfoldrM count (n + 1)]
81−
82−o_1_space_joining :: Int -> (Config -> Config) -> [Benchmark]
83−o_1_space_joining value f =
84− [ bgroup "joining"
85− [ benchIOSrc1 "async (2 of n/2)" (async2 f (value `div` 2))
86− , benchIOSrc1 "concat async (2 of n/2)" (concatAsync2 f (value `div` 2))
87− ]
88− ]
89−
90−-------------------------------------------------------------------------------
91−-- Concat
92−-------------------------------------------------------------------------------
93−
94−{-# INLINE sourceFoldMapWith #-}
95−sourceFoldMapWith :: (Config -> Config) -> Int -> Int -> Stream IO Int
96−sourceFoldMapWith f value n =
97− Async.parConcatMap f Stream.fromPure $ Stream.fromList [n..n+value]
98−
99−{-# INLINE sourceFoldMapWithStream #-}
100−sourceFoldMapWithStream :: (Config -> Config) -> Int -> Int -> Stream IO Int
101−sourceFoldMapWithStream f value n =
102− Async.parConcatMap f Stream.fromPure
103− $ Stream.enumerateFromTo n (n + value)
104−
105−{-# INLINE concatFoldableWith #-}
106−concatFoldableWith :: (Config -> Config) -> Int -> Int -> Stream IO Int
107−concatFoldableWith f value n =
108− let step x =
109− if x <= n + value
110− then Just (Stream.fromPure x, x + 1)
111− else Nothing
112− list = List.unfoldr step n
113− in Async.parConcat f (Stream.fromList list)
114−
115−o_1_space_concatFoldable :: Int -> (Config -> Config) -> [Benchmark]
116−o_1_space_concatFoldable value f =
117− [ bgroup "concat-foldable"
118− [ benchIOSrc "foldMapWith (<>) (List)"
119− (sourceFoldMapWith f value)
120− , benchIOSrc "foldMapWith (<>) (Stream)"
121− (sourceFoldMapWithStream f value)
122− , benchIOSrc "S.concatFoldableWith (<>) (List)"
123− (concatFoldableWith f value)
124− ]
125− ]
126−
127−{-# INLINE concatMapStreamsWith #-}
128−concatMapStreamsWith
129− :: (Config -> Config)
130− -> Int
131− -> Int
132− -> Int
133− -> IO ()
134−concatMapStreamsWith f outer inner n =
135− Stream.fold Fold.drain
136− $ Async.parConcatMap f (sourceUnfoldrM inner) (sourceUnfoldrM outer n)
137−
138−{-# INLINE concatFmapStreamsWith #-}
139−concatFmapStreamsWith
140− :: (Config -> Config)
141− -> Int
142− -> Int
143− -> Int
144− -> IO ()
145−concatFmapStreamsWith f outer inner n =
146− Stream.fold Fold.drain
147− $ Async.parConcat f
148− $ fmap (sourceUnfoldrM inner) (sourceUnfoldrM outer n)
149−
150−o_1_space_concatMap :: Int -> (Config -> Config) -> [Benchmark]
151−o_1_space_concatMap value f =
152− value2 `seq`
153− [ bgroup "concat"
154− [ benchIO "parConcatMap (n of 1)"
155− (concatMapStreamsWith f value 1)
156− , benchIO "parConcatMap (sqrt x of sqrt x)"
157− (concatMapStreamsWith f value2 value2)
158− , benchIO "parConcatMap (1 of n)"
159− (concatMapStreamsWith f 1 value)
160− , benchIO "concat . fmap (n of 1)"
161− (concatFmapStreamsWith f value 1)
162− ]
163− ]
164−
165− where
166−
167− value2 = round $ sqrt (fromIntegral value :: Double)
168−
169−-------------------------------------------------------------------------------
170−-- Monadic outer product
171−-------------------------------------------------------------------------------
172−
173−{-# INLINE toNullAp #-}
174−toNullAp :: (Config -> Config) -> Int -> Int -> IO ()
175−toNullAp f linearCount start =
176− Stream.fold Fold.drain
177− $ Async.parApply f
178− (fmap (+) (sourceUnfoldrM nestedCount2 start))
179− (sourceUnfoldrM nestedCount2 start)
180−
181− where
182−
183− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
184−
185−o_1_space_outerProduct :: Int -> (Config -> Config) -> [Benchmark]
186−o_1_space_outerProduct value f =
187− [ bgroup "monad-outer-product"
188− [ benchIO "toNullAp" $ toNullAp f value
189− ]
190− ]
191−
192−-------------------------------------------------------------------------------
193−-- Benchmark sets
194−-------------------------------------------------------------------------------
195−
196−allBenchmarks :: String -> Bool -> (Config -> Config) -> Int -> [Benchmark]
197−allBenchmarks moduleName wide modifier value =
198− [ bgroup (o_1_space_prefix moduleName) $ concat
199− [ o_1_space_mapping value modifier
200− , o_1_space_concatFoldable value modifier
201− , o_1_space_concatMap value modifier
202− , o_1_space_joining value modifier
203− ] ++ if wide then [] else o_1_space_outerProduct value modifier
204− , bgroup (o_n_heap_prefix moduleName) $ concat
205− [ if wide then o_1_space_outerProduct value modifier else []
206− , o_n_heap_buffering value modifier
207− ]
208− ]
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentEager.hsdeleted−25
@@ -1,25 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−-- |
3−-- Module : Main
4−-- Copyright : (c) 2018 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−
9−import Stream.ConcurrentCommon (allBenchmarks)
10−import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
11−
12−import qualified Streamly.Internal.Data.Stream.Prelude as Async
13−
14−moduleName :: String
15−moduleName = "Data.Stream.ConcurrentEager"
16−
17−-------------------------------------------------------------------------------
18−-- Main
19−-------------------------------------------------------------------------------
20−
21−main :: IO ()
22−main =
23− runWithCLIOpts
24− defaultStreamSize
25− (allBenchmarks moduleName True (Async.eager True))
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentInterleaved.hsdeleted−25
@@ -1,25 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−-- |
3−-- Module : Main
4−-- Copyright : (c) 2022 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−
9−import Stream.ConcurrentCommon (allBenchmarks)
10−import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
11−
12−import qualified Streamly.Internal.Data.Stream.Prelude as Async
13−
14−moduleName :: String
15−moduleName = "Data.Stream.ConcurrentInterleaved"
16−
17−-------------------------------------------------------------------------------
18−-- Main
19−-------------------------------------------------------------------------------
20−
21−main :: IO ()
22−main =
23− runWithCLIOpts
24− defaultStreamSize
25− (allBenchmarks moduleName True (Async.interleaved True))
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentOrdered.hsdeleted−25
@@ -1,25 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−-- |
3−-- Module : Main
4−-- Copyright : (c) 2018 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−
9−import Stream.ConcurrentCommon (allBenchmarks)
10−import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
11−
12−import qualified Streamly.Internal.Data.Stream.Prelude as Async
13−
14−moduleName :: String
15−moduleName = "Data.Stream.ConcurrentOrdered"
16−
17−-------------------------------------------------------------------------------
18−-- Main
19−-------------------------------------------------------------------------------
20−
21−main :: IO ()
22−main =
23− runWithCLIOpts
24− defaultStreamSize
25− (allBenchmarks moduleName False (Async.ordered True))
benchmark/Streamly/Benchmark/Data/Stream/Eliminate.hs+113−142
@@ -6,15 +6,9 @@
6
6
7{-# LANGUAGE CPP #-}
7{-# LANGUAGE CPP #-}
8{-# LANGUAGE FlexibleContexts #-}
8{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE FlexibleInstances #-}
10{-# LANGUAGE ScopedTypeVariables #-}
9{-# LANGUAGE ScopedTypeVariables #-}
11{-# LANGUAGE RankNTypes #-}
10{-# LANGUAGE RankNTypes #-}
12
11
13−{-# OPTIONS_GHC -Wno-orphans #-}
14−#ifdef USE_PRELUDE
15−{-# OPTIONS_GHC -Wno-deprecations #-}
16−#endif
17−
18#ifdef __HADDOCK_VERSION__
12#ifdef __HADDOCK_VERSION__
19#undef INSPECTION
13#undef INSPECTION
20#endif
14#endif
@@ -32,41 +26,40 @@ import System.Random (randomRIO)
32
26
33import qualified Data.Foldable as F
27import qualified Data.Foldable as F
34import qualified GHC.Exts as GHC
28import qualified GHC.Exts as GHC
35−import qualified Streamly.Internal.Data.Fold as Fold
36
29
37#ifdef INSPECTION
30#ifdef INSPECTION
38import GHC.Types (SPEC(..))
31import GHC.Types (SPEC(..))
39import Test.Inspection
32import Test.Inspection
33+
40−import qualified Streamly.Internal.Data.Stream as D
34+import qualified Streamly.Internal.Data.Stream.StreamD as D
35+#endif
36+import qualified Streamly.Internal.Data.Fold as Fold
37+#ifdef USE_PRELUDE
38+import qualified Streamly.Internal.Data.Stream.IsStream as S
39+#else
40+import qualified Streamly.Internal.Data.Stream as S
41#endif
41#endif
42
42
43+import Gauge
44+-- XXX Replace SerialT with Stream
45+import Streamly.Internal.Data.Stream.Serial (SerialT)
43#ifdef USE_PRELUDE
46#ifdef USE_PRELUDE
44import Streamly.Prelude (fromSerial)
47import Streamly.Prelude (fromSerial)
45import Streamly.Benchmark.Prelude
48import Streamly.Benchmark.Prelude
46−import qualified Streamly.Internal.Data.Stream.IsStream as S
47−import qualified Streamly.Internal.Data.Stream.IsStream as StreamK
48#else
49#else
49import Stream.Common
50import Stream.Common
50−import Streamly.Internal.Data.Stream (Stream)
51+ ( sourceUnfoldr
51−import qualified Streamly.Internal.Data.Stream as S
52+ , sourceUnfoldrM
52−#ifdef USE_STREAMK
53+ , sourceUnfoldrAction
53−import Streamly.Internal.Data.StreamK (StreamK)
54+ , benchIOSink
54−import qualified Streamly.Data.StreamK as StreamK
55+ )
55−#else
56−import qualified Streamly.Internal.Data.Stream as StreamK
57#endif
56#endif
58−#endif
59−
60−import Test.Tasty.Bench
61import Streamly.Benchmark.Common
57import Streamly.Benchmark.Common
62import Prelude hiding (length, sum, or, and, any, all, notElem, elem, (!!),
58import Prelude hiding (length, sum, or, and, any, all, notElem, elem, (!!),
63 lookup, repeat, minimum, maximum, product, last, mapM_, init)
59 lookup, repeat, minimum, maximum, product, last, mapM_, init)
64import qualified Prelude
60import qualified Prelude
65
61
66#ifdef USE_PRELUDE
62#ifdef USE_PRELUDE
67−type Stream = S.SerialT
68−fromStream = id
69−
70{-# INLINE repeat #-}
63{-# INLINE repeat #-}
71repeat :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
64repeat :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
72repeat count = S.take count . S.repeat
65repeat count = S.take count . S.repeat
@@ -83,92 +76,90 @@ repeat count = S.take count . S.repeat
83{-# INLINE foldableFoldl' #-}
76{-# INLINE foldableFoldl' #-}
84foldableFoldl' :: Int -> Int -> Int
77foldableFoldl' :: Int -> Int -> Int
85foldableFoldl' value n =
78foldableFoldl' value n =
86− F.foldl' (+) 0 (sourceUnfoldr value n :: Stream Identity Int)
79+ F.foldl' (+) 0 (sourceUnfoldr value n :: SerialT Identity Int)
87
80
88{-# INLINE foldableFoldrElem #-}
81{-# INLINE foldableFoldrElem #-}
89foldableFoldrElem :: Int -> Int -> Bool
82foldableFoldrElem :: Int -> Int -> Bool
90foldableFoldrElem value n =
83foldableFoldrElem value n =
91 F.foldr (\x xs -> x == value || xs)
84 F.foldr (\x xs -> x == value || xs)
92 False
85 False
93− (sourceUnfoldr value n :: Stream Identity Int)
86+ (sourceUnfoldr value n :: SerialT Identity Int)
94
87
95{-# INLINE foldableSum #-}
88{-# INLINE foldableSum #-}
96foldableSum :: Int -> Int -> Int
89foldableSum :: Int -> Int -> Int
97foldableSum value n =
90foldableSum value n =
98− Prelude.sum (sourceUnfoldr value n :: Stream Identity Int)
91+ Prelude.sum (sourceUnfoldr value n :: SerialT Identity Int)
99
92
100{-# INLINE foldableProduct #-}
93{-# INLINE foldableProduct #-}
101foldableProduct :: Int -> Int -> Int
94foldableProduct :: Int -> Int -> Int
102foldableProduct value n =
95foldableProduct value n =
103− Prelude.product (sourceUnfoldr value n :: Stream Identity Int)
96+ Prelude.product (sourceUnfoldr value n :: SerialT Identity Int)
104
97
105{-# INLINE _foldableNull #-}
98{-# INLINE _foldableNull #-}
106_foldableNull :: Int -> Int -> Bool
99_foldableNull :: Int -> Int -> Bool
107_foldableNull value n =
100_foldableNull value n =
108− Prelude.null (sourceUnfoldr value n :: Stream Identity Int)
101+ Prelude.null (sourceUnfoldr value n :: SerialT Identity Int)
109
102
110{-# INLINE foldableElem #-}
103{-# INLINE foldableElem #-}
111foldableElem :: Int -> Int -> Bool
104foldableElem :: Int -> Int -> Bool
112foldableElem value n =
105foldableElem value n =
113− value `Prelude.elem` (sourceUnfoldr value n :: Stream Identity Int)
106+ value `Prelude.elem` (sourceUnfoldr value n :: SerialT Identity Int)
114
107
115{-# INLINE foldableNotElem #-}
108{-# INLINE foldableNotElem #-}
116foldableNotElem :: Int -> Int -> Bool
109foldableNotElem :: Int -> Int -> Bool
117foldableNotElem value n =
110foldableNotElem value n =
118− value `Prelude.notElem` (sourceUnfoldr value n :: Stream Identity Int)
111+ value `Prelude.notElem` (sourceUnfoldr value n :: SerialT Identity Int)
119
112
120{-# INLINE foldableFind #-}
113{-# INLINE foldableFind #-}
121foldableFind :: Int -> Int -> Maybe Int
114foldableFind :: Int -> Int -> Maybe Int
122foldableFind value n =
115foldableFind value n =
123− F.find (== (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
116+ F.find (== (value + 1)) (sourceUnfoldr value n :: SerialT Identity Int)
124
117
125{-# INLINE foldableAll #-}
118{-# INLINE foldableAll #-}
126foldableAll :: Int -> Int -> Bool
119foldableAll :: Int -> Int -> Bool
127foldableAll value n =
120foldableAll value n =
128− Prelude.all (<= (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
121+ Prelude.all (<= (value + 1)) (sourceUnfoldr value n :: SerialT Identity Int)
129
122
130{-# INLINE foldableAny #-}
123{-# INLINE foldableAny #-}
131foldableAny :: Int -> Int -> Bool
124foldableAny :: Int -> Int -> Bool
132foldableAny value n =
125foldableAny value n =
133− Prelude.any (> (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
126+ Prelude.any (> (value + 1)) (sourceUnfoldr value n :: SerialT Identity Int)
134
127
135−{- HLINT ignore "Use all"-}
136{-# INLINE foldableAnd #-}
128{-# INLINE foldableAnd #-}
137foldableAnd :: Int -> Int -> Bool
129foldableAnd :: Int -> Int -> Bool
138foldableAnd value n =
130foldableAnd value n =
139 Prelude.and $ fmap
131 Prelude.and $ fmap
140− (<= (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
132+ (<= (value + 1)) (sourceUnfoldr value n :: SerialT Identity Int)
141
133
142−{- HLINT ignore "Use any"-}
143{-# INLINE foldableOr #-}
134{-# INLINE foldableOr #-}
144foldableOr :: Int -> Int -> Bool
135foldableOr :: Int -> Int -> Bool
145foldableOr value n =
136foldableOr value n =
146 Prelude.or $ fmap
137 Prelude.or $ fmap
147− (> (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
138+ (> (value + 1)) (sourceUnfoldr value n :: SerialT Identity Int)
148
139
149{-# INLINE foldableLength #-}
140{-# INLINE foldableLength #-}
150foldableLength :: Int -> Int -> Int
141foldableLength :: Int -> Int -> Int
151foldableLength value n =
142foldableLength value n =
152− Prelude.length (sourceUnfoldr value n :: Stream Identity Int)
143+ Prelude.length (sourceUnfoldr value n :: SerialT Identity Int)
153
144
154{-# INLINE foldableMin #-}
145{-# INLINE foldableMin #-}
155foldableMin :: Int -> Int -> Int
146foldableMin :: Int -> Int -> Int
156foldableMin value n =
147foldableMin value n =
157− Prelude.minimum (sourceUnfoldr value n :: Stream Identity Int)
148+ Prelude.minimum (sourceUnfoldr value n :: SerialT Identity Int)
158
149
159{-# INLINE ordInstanceMin #-}
150{-# INLINE ordInstanceMin #-}
160−ordInstanceMin :: Stream Identity Int -> Stream Identity Int
151+ordInstanceMin :: SerialT Identity Int -> SerialT Identity Int
161ordInstanceMin src = min src src
152ordInstanceMin src = min src src
162
153
163{-# INLINE foldableMax #-}
154{-# INLINE foldableMax #-}
164foldableMax :: Int -> Int -> Int
155foldableMax :: Int -> Int -> Int
165foldableMax value n =
156foldableMax value n =
166− Prelude.maximum (sourceUnfoldr value n :: Stream Identity Int)
157+ Prelude.maximum (sourceUnfoldr value n :: SerialT Identity Int)
167
158
168{-# INLINE foldableMinBy #-}
159{-# INLINE foldableMinBy #-}
169foldableMinBy :: Int -> Int -> Int
160foldableMinBy :: Int -> Int -> Int
170foldableMinBy value n =
161foldableMinBy value n =
171− F.minimumBy compare (sourceUnfoldr value n :: Stream Identity Int)
162+ F.minimumBy compare (sourceUnfoldr value n :: SerialT Identity Int)
172
163
173{-# INLINE foldableListMinBy #-}
164{-# INLINE foldableListMinBy #-}
174foldableListMinBy :: Int -> Int -> Int
165foldableListMinBy :: Int -> Int -> Int
@@ -177,30 +168,30 @@ foldableListMinBy value n = F.minimumBy compare [1..value+n]
177{-# INLINE foldableMaxBy #-}
168{-# INLINE foldableMaxBy #-}
178foldableMaxBy :: Int -> Int -> Int
169foldableMaxBy :: Int -> Int -> Int
179foldableMaxBy value n =
170foldableMaxBy value n =
180− F.maximumBy compare (sourceUnfoldr value n :: Stream Identity Int)
171+ F.maximumBy compare (sourceUnfoldr value n :: SerialT Identity Int)
181
172
182{-# INLINE foldableToList #-}
173{-# INLINE foldableToList #-}
183foldableToList :: Int -> Int -> [Int]
174foldableToList :: Int -> Int -> [Int]
184foldableToList value n =
175foldableToList value n =
185− F.toList (sourceUnfoldr value n :: Stream Identity Int)
176+ F.toList (sourceUnfoldr value n :: SerialT Identity Int)
186
177
187{-# INLINE foldableMapM_ #-}
178{-# INLINE foldableMapM_ #-}
188foldableMapM_ :: Monad m => Int -> Int -> m ()
179foldableMapM_ :: Monad m => Int -> Int -> m ()
189foldableMapM_ value n =
180foldableMapM_ value n =
190− F.mapM_ (\_ -> return ()) (sourceUnfoldr value n :: Stream Identity Int)
181+ F.mapM_ (\_ -> return ()) (sourceUnfoldr value n :: SerialT Identity Int)
191
182
192{-# INLINE foldableSequence_ #-}
183{-# INLINE foldableSequence_ #-}
193foldableSequence_ :: Int -> Int -> IO ()
184foldableSequence_ :: Int -> Int -> IO ()
194foldableSequence_ value n =
185foldableSequence_ value n =
195− F.sequence_ (sourceUnfoldrAction value n :: Stream Identity (IO Int))
186+ F.sequence_ (sourceUnfoldrAction value n :: SerialT Identity (IO Int))
196
187
197{-# INLINE _foldableMsum #-}
188{-# INLINE _foldableMsum #-}
198_foldableMsum :: Int -> Int -> IO Int
189_foldableMsum :: Int -> Int -> IO Int
199_foldableMsum value n =
190_foldableMsum value n =
200− F.msum (sourceUnfoldrAction value n :: Stream Identity (IO Int))
191+ F.msum (sourceUnfoldrAction value n :: SerialT Identity (IO Int))
201
192
202{-# INLINE showInstance #-}
193{-# INLINE showInstance #-}
203−showInstance :: Stream Identity Int -> String
194+showInstance :: SerialT Identity Int -> String
204showInstance = show
195showInstance = show
205
196
206o_1_space_elimination_foldable :: Int -> [Benchmark]
197o_1_space_elimination_foldable :: Int -> [Benchmark]
@@ -217,9 +208,6 @@ o_1_space_elimination_foldable value =
217 , bench "minimum" $ nf (foldableMin value) 1
208 , bench "minimum" $ nf (foldableMin value) 1
218 , benchPureSink value "min (ord)" ordInstanceMin
209 , benchPureSink value "min (ord)" ordInstanceMin
219 , bench "maximum" $ nf (foldableMax value) 1
210 , bench "maximum" $ nf (foldableMax value) 1
220− , bench "minimumBy" $ nf (`foldableMinBy` 1) value
221− , bench "maximumBy" $ nf (`foldableMaxBy` 1) value
222− , bench "minimumByList" $ nf (`foldableListMinBy` 1) value
223 , bench "length . toList"
211 , bench "length . toList"
224 $ nf (Prelude.length . foldableToList value) 1
212 $ nf (Prelude.length . foldableToList value) 1
225 , bench "notElem" $ nf (foldableNotElem value) 1
213 , bench "notElem" $ nf (foldableNotElem value) 1
@@ -242,25 +230,34 @@ o_1_space_elimination_foldable value =
242 ]
230 ]
243 ]
231 ]
244
232
233+o_n_space_elimination_foldable :: Int -> [Benchmark]
234+o_n_space_elimination_foldable value =
235+ -- Head recursive strict right folds.
236+ [ bgroup "foldl"
237+ -- XXX the definitions of minimumBy and maximumBy in Data.Foldable use
238+ -- foldl1 which does not work in constant memory for our
239+ -- implementation. It works in constant memory for lists but even for
240+ -- lists it takes 15x more time compared to our foldl' based
241+ -- implementation.
242+ [ bench "minimumBy" $ nf (`foldableMinBy` 1) value
243+ , bench "maximumBy" $ nf (`foldableMaxBy` 1) value
244+ , bench "minimumByList" $ nf (`foldableListMinBy` 1) value
245+ ]
246+ ]
247+
245-------------------------------------------------------------------------------
248-------------------------------------------------------------------------------
246-- Stream folds
249-- Stream folds
247-------------------------------------------------------------------------------
250-------------------------------------------------------------------------------
248
251
249−#ifndef USE_PRELUDE
250−instance NFData a => NFData (Stream Identity a) where
251− {-# INLINE rnf #-}
252− rnf xs = runIdentity $ S.fold (Fold.foldl' (\_ x -> rnf x) ()) xs
253−#endif
254−
255{-# INLINE benchPureSink #-}
252{-# INLINE benchPureSink #-}
256benchPureSink :: NFData b
253benchPureSink :: NFData b
257− => Int -> String -> (Stream Identity Int -> b) -> Benchmark
254+ => Int -> String -> (SerialT Identity Int -> b) -> Benchmark
258benchPureSink value name = benchPure name (sourceUnfoldr value)
255benchPureSink value name = benchPure name (sourceUnfoldr value)
259
256
260{-# INLINE benchHoistSink #-}
257{-# INLINE benchHoistSink #-}
261benchHoistSink
258benchHoistSink
262 :: (NFData b)
259 :: (NFData b)
263− => Int -> String -> (Stream Identity Int -> IO b) -> Benchmark
260+ => Int -> String -> (SerialT Identity Int -> IO b) -> Benchmark
264benchHoistSink value name f =
261benchHoistSink value name f =
265 bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldr value
262 bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldr value
266
263
@@ -269,7 +266,7 @@ benchHoistSink value name f =
269{-# INLINE benchIdentitySink #-}
266{-# INLINE benchIdentitySink #-}
270benchIdentitySink
267benchIdentitySink
271 :: (NFData b)
268 :: (NFData b)
272− => Int -> String -> (Stream Identity Int -> Identity b) -> Benchmark
269+ => Int -> String -> (SerialT Identity Int -> Identity b) -> Benchmark
273benchIdentitySink value name f = bench name $ nf (f . sourceUnfoldr value) 1
270benchIdentitySink value name f = bench name $ nf (f . sourceUnfoldr value) 1
274
271
275-------------------------------------------------------------------------------
272-------------------------------------------------------------------------------
@@ -277,29 +274,25 @@ benchIdentitySink value name f = bench name $ nf (f . sourceUnfoldr value) 1
277-------------------------------------------------------------------------------
274-------------------------------------------------------------------------------
278
275
279{-# INLINE uncons #-}
276{-# INLINE uncons #-}
280−#ifdef USE_STREAMK
281−uncons :: Monad m => StreamK m Int -> m ()
277+uncons :: Monad m => SerialT m Int -> m ()
282−#else
283−uncons :: Monad m => Stream m Int -> m ()
284−#endif
285uncons s = do
278uncons s = do
286− r <- StreamK.uncons s
279+ r <- S.uncons s
287 case r of
280 case r of
288 Nothing -> return ()
281 Nothing -> return ()
289 Just (_, t) -> uncons t
282 Just (_, t) -> uncons t
290
283
291#ifdef USE_PRELUDE
284#ifdef USE_PRELUDE
292{-# INLINE init #-}
285{-# INLINE init #-}
293−init :: Monad m => Stream m a -> m ()
286+init :: Monad m => SerialT m a -> m ()
294init s = S.init s >>= Prelude.mapM_ S.drain
287init s = S.init s >>= Prelude.mapM_ S.drain
295
288
296{-# INLINE mapM_ #-}
289{-# INLINE mapM_ #-}
297−mapM_ :: Monad m => Stream m Int -> m ()
290+mapM_ :: Monad m => SerialT m Int -> m ()
298mapM_ = S.mapM_ (\_ -> return ())
291mapM_ = S.mapM_ (\_ -> return ())
299#endif
292#endif
300
293
301{-# INLINE foldrMElem #-}
294{-# INLINE foldrMElem #-}
302−foldrMElem :: Monad m => Int -> Stream m Int -> m Bool
295+foldrMElem :: Monad m => Int -> SerialT m Int -> m Bool
303foldrMElem e =
296foldrMElem e =
304 S.foldrM
297 S.foldrM
305 (\x xs ->
298 (\x xs ->
@@ -308,127 +301,121 @@ foldrMElem e =
308 else xs)
301 else xs)
309 (return False)
302 (return False)
310
303
311−#ifdef USE_STREAMK
312{-# INLINE foldrToStream #-}
304{-# INLINE foldrToStream #-}
313−foldrToStream :: Monad m => Stream m Int -> m (StreamK Identity Int)
305+foldrToStream :: Monad m => SerialT m Int -> m (SerialT Identity Int)
314−foldrToStream = S.foldr StreamK.cons StreamK.nil
315−#else
316−-- {-# INLINE foldrToStream #-}
317−-- foldrToStream :: Monad m => Stream m Int -> m (Stream Identity Int)
318−-- foldrToStream = S.foldr S.cons S.nil
306+foldrToStream = S.foldr S.cons S.nil
319−#endif
320
307
321{-# INLINE foldrMBuild #-}
308{-# INLINE foldrMBuild #-}
322−foldrMBuild :: Monad m => Stream m Int -> m [Int]
309+foldrMBuild :: Monad m => SerialT m Int -> m [Int]
323foldrMBuild = S.foldrM (\x xs -> (x :) <$> xs) (return [])
310foldrMBuild = S.foldrM (\x xs -> (x :) <$> xs) (return [])
324
311
325#ifdef USE_PRELUDE
312#ifdef USE_PRELUDE
326{-# INLINE foldl'Reduce #-}
313{-# INLINE foldl'Reduce #-}
327−foldl'Reduce :: Monad m => Stream m Int -> m Int
314+foldl'Reduce :: Monad m => SerialT m Int -> m Int
328foldl'Reduce = S.foldl' (+) 0
315foldl'Reduce = S.foldl' (+) 0
329
316
330{-# INLINE foldl1'Reduce #-}
317{-# INLINE foldl1'Reduce #-}
331−foldl1'Reduce :: Monad m => Stream m Int -> m (Maybe Int)
318+foldl1'Reduce :: Monad m => SerialT m Int -> m (Maybe Int)
332foldl1'Reduce = S.foldl1' (+)
319foldl1'Reduce = S.foldl1' (+)
333
320
334{-# INLINE foldlM'Reduce #-}
321{-# INLINE foldlM'Reduce #-}
335−foldlM'Reduce :: Monad m => Stream m Int -> m Int
322+foldlM'Reduce :: Monad m => SerialT m Int -> m Int
336foldlM'Reduce = S.foldlM' (\xs a -> return $ a + xs) (return 0)
323foldlM'Reduce = S.foldlM' (\xs a -> return $ a + xs) (return 0)
337
324
338{-# INLINE last #-}
325{-# INLINE last #-}
339−last :: Monad m => Stream m Int -> m (Maybe Int)
326+last :: Monad m => SerialT m Int -> m (Maybe Int)
340last = S.last
327last = S.last
341
328
342{-# INLINE _head #-}
329{-# INLINE _head #-}
343−_head :: Monad m => Stream m Int -> m (Maybe Int)
330+_head :: Monad m => SerialT m Int -> m (Maybe Int)
344_head = S.head
331_head = S.head
345
332
346{-# INLINE elem #-}
333{-# INLINE elem #-}
347−elem :: Monad m => Int -> Stream m Int -> m Bool
334+elem :: Monad m => Int -> SerialT m Int -> m Bool
348elem value = S.elem (value + 1)
335elem value = S.elem (value + 1)
349
336
350{-# INLINE notElem #-}
337{-# INLINE notElem #-}
351−notElem :: Monad m => Int -> Stream m Int -> m Bool
338+notElem :: Monad m => Int -> SerialT m Int -> m Bool
352notElem value = S.notElem (value + 1)
339notElem value = S.notElem (value + 1)
353
340
354{-# INLINE length #-}
341{-# INLINE length #-}
355−length :: Monad m => Stream m Int -> m Int
342+length :: Monad m => SerialT m Int -> m Int
356length = S.length
343length = S.length
357
344
358{-# INLINE all #-}
345{-# INLINE all #-}
359−all :: Monad m => Int -> Stream m Int -> m Bool
346+all :: Monad m => Int -> SerialT m Int -> m Bool
360all value = S.all (<= (value + 1))
347all value = S.all (<= (value + 1))
361
348
362{-# INLINE any #-}
349{-# INLINE any #-}
363−any :: Monad m => Int -> Stream m Int -> m Bool
350+any :: Monad m => Int -> SerialT m Int -> m Bool
364any value = S.any (> (value + 1))
351any value = S.any (> (value + 1))
365
352
366{-# INLINE and #-}
353{-# INLINE and #-}
367−and :: Monad m => Int -> Stream m Int -> m Bool
354+and :: Monad m => Int -> SerialT m Int -> m Bool
368and value = S.and . S.map (<= (value + 1))
355and value = S.and . S.map (<= (value + 1))
369
356
370{-# INLINE or #-}
357{-# INLINE or #-}
371−or :: Monad m => Int -> Stream m Int -> m Bool
358+or :: Monad m => Int -> SerialT m Int -> m Bool
372or value = S.or . S.map (> (value + 1))
359or value = S.or . S.map (> (value + 1))
373
360
374{-# INLINE find #-}
361{-# INLINE find #-}
375−find :: Monad m => Int -> Stream m Int -> m (Maybe Int)
362+find :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
376find value = S.find (== (value + 1))
363find value = S.find (== (value + 1))
377
364
378{-# INLINE findM #-}
365{-# INLINE findM #-}
379−findM :: Monad m => Int -> Stream m Int -> m (Maybe Int)
366+findM :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
380findM value = S.findM (\z -> return $ z == (value + 1))
367findM value = S.findM (\z -> return $ z == (value + 1))
381
368
382{-# INLINE findIndex #-}
369{-# INLINE findIndex #-}
383−findIndex :: Monad m => Int -> Stream m Int -> m (Maybe Int)
370+findIndex :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
384findIndex value = S.findIndex (== (value + 1))
371findIndex value = S.findIndex (== (value + 1))
385
372
386{-# INLINE elemIndex #-}
373{-# INLINE elemIndex #-}
387−elemIndex :: Monad m => Int -> Stream m Int -> m (Maybe Int)
374+elemIndex :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
388elemIndex value = S.elemIndex (value + 1)
375elemIndex value = S.elemIndex (value + 1)
389
376
390{-# INLINE maximum #-}
377{-# INLINE maximum #-}
391−maximum :: Monad m => Stream m Int -> m (Maybe Int)
378+maximum :: Monad m => SerialT m Int -> m (Maybe Int)
392maximum = S.maximum
379maximum = S.maximum
393
380
394{-# INLINE minimum #-}
381{-# INLINE minimum #-}
395−minimum :: Monad m => Stream m Int -> m (Maybe Int)
382+minimum :: Monad m => SerialT m Int -> m (Maybe Int)
396minimum = S.minimum
383minimum = S.minimum
397
384
398{-# INLINE sum #-}
385{-# INLINE sum #-}
399−sum :: Monad m => Stream m Int -> m Int
386+sum :: Monad m => SerialT m Int -> m Int
400sum = S.sum
387sum = S.sum
401
388
402{-# INLINE product #-}
389{-# INLINE product #-}
403−product :: Monad m => Stream m Int -> m Int
390+product :: Monad m => SerialT m Int -> m Int
404product = S.product
391product = S.product
405
392
406{-# INLINE minimumBy #-}
393{-# INLINE minimumBy #-}
407−minimumBy :: Monad m => Stream m Int -> m (Maybe Int)
394+minimumBy :: Monad m => SerialT m Int -> m (Maybe Int)
408minimumBy = S.minimumBy compare
395minimumBy = S.minimumBy compare
409
396
410{-# INLINE maximumBy #-}
397{-# INLINE maximumBy #-}
411−maximumBy :: Monad m => Stream m Int -> m (Maybe Int)
398+maximumBy :: Monad m => SerialT m Int -> m (Maybe Int)
412maximumBy = S.maximumBy compare
399maximumBy = S.maximumBy compare
413
400
414{-# INLINE the #-}
401{-# INLINE the #-}
415−the :: Monad m => Stream m Int -> m (Maybe Int)
402+the :: Monad m => SerialT m Int -> m (Maybe Int)
416the = S.the
403the = S.the
417
404
418{-# INLINE drainN #-}
405{-# INLINE drainN #-}
419−drainN :: Monad m => Int -> Stream m Int -> m ()
406+drainN :: Monad m => Int -> SerialT m Int -> m ()
420drainN = S.drainN
407drainN = S.drainN
421
408
422{-# INLINE drainWhile #-}
409{-# INLINE drainWhile #-}
423−drainWhile :: Monad m => Stream m Int -> m ()
410+drainWhile :: Monad m => SerialT m Int -> m ()
424drainWhile = S.drainWhile (const True)
411drainWhile = S.drainWhile (const True)
425
412
426{-# INLINE (!!) #-}
413{-# INLINE (!!) #-}
427−(!!) :: Monad m => Int -> Stream m Int -> m (Maybe Int)
414+(!!) :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
428(!!) = flip (S.!!)
415(!!) = flip (S.!!)
429
416
430{-# INLINE lookup #-}
417{-# INLINE lookup #-}
431−lookup :: Monad m => Int -> Stream m Int -> m (Maybe Int)
418+lookup :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
432lookup val = S.lookup val . S.map (\x -> (x, x))
419lookup val = S.lookup val . S.map (\x -> (x, x))
433#endif
420#endif
434
421
@@ -460,34 +447,17 @@ o_1_space_elimination_folds value =
460 ]
447 ]
461 , bgroup "Identity"
448 , bgroup "Identity"
462 [ benchIdentitySink value "foldrMElem" (foldrMElem value)
449 [ benchIdentitySink value "foldrMElem" (foldrMElem value)
463−#ifdef USE_STREAMK
464 , benchIdentitySink value "foldrToStreamLength"
450 , benchIdentitySink value "foldrToStreamLength"
465− (S.fold Fold.length . toStream . runIdentity . foldrToStream)
466− {-
467− , benchIdentitySink 16 "foldrToStreamLength (16)"
468− (S.fold Fold.length . toStream . runIdentity . foldrToStream)
469− -}
470−#else
471− {-
472− , benchIdentitySink 16 "foldrToStreamLength (16)"
473 (S.fold Fold.length . runIdentity . foldrToStream)
451 (S.fold Fold.length . runIdentity . foldrToStream)
474− -}
475−#endif
476− {-
477− , benchPureSink 16 "foldrMToListLength (16)"
478− (Prelude.length . runIdentity . foldrMBuild)
479− -}
480 , benchPureSink value "foldrMToListLength"
452 , benchPureSink value "foldrMToListLength"
481 (Prelude.length . runIdentity . foldrMBuild)
453 (Prelude.length . runIdentity . foldrMBuild)
482 ]
454 ]
483 ]
455 ]
484
456
485 -- deconstruction
457 -- deconstruction
486− , benchIOSink value "uncons" (uncons . fromStream)
458+ , benchIOSink value "uncons" uncons
487−#ifndef USE_PRELUDE
488− , benchHoistSink value "length . generalizeInner"
459+ , benchHoistSink value "length . generally"
489− (S.fold Fold.length . S.generalizeInner)
460+ (S.fold Fold.length . S.generally)
490−#endif
491#ifdef USE_PRELUDE
461#ifdef USE_PRELUDE
492 , benchIOSink value "init" init
462 , benchIOSink value "init" init
493
463
@@ -538,11 +508,11 @@ o_1_space_elimination_folds value =
538
508
539#ifdef USE_PRELUDE
509#ifdef USE_PRELUDE
540{-# INLINE foldl'Build #-}
510{-# INLINE foldl'Build #-}
541−foldl'Build :: Monad m => Stream m Int -> m [Int]
511+foldl'Build :: Monad m => SerialT m Int -> m [Int]
542foldl'Build = S.foldl' (flip (:)) []
512foldl'Build = S.foldl' (flip (:)) []
543
513
544{-# INLINE foldlM'Build #-}
514{-# INLINE foldlM'Build #-}
545−foldlM'Build :: Monad m => Stream m Int -> m [Int]
515+foldlM'Build :: Monad m => SerialT m Int -> m [Int]
546foldlM'Build = S.foldlM' (\xs x -> return $ x : xs) (return [])
516foldlM'Build = S.foldlM' (\xs x -> return $ x : xs) (return [])
547
517
548o_n_heap_elimination_foldl :: Int -> [Benchmark]
518o_n_heap_elimination_foldl :: Int -> [Benchmark]
@@ -576,7 +546,7 @@ o_n_heap_elimination_buffered value =
576 ]
546 ]
577
547
578{-# INLINE foldrMReduce #-}
548{-# INLINE foldrMReduce #-}
579−foldrMReduce :: Monad m => Stream m Int -> m Int
549+foldrMReduce :: Monad m => SerialT m Int -> m Int
580foldrMReduce = S.foldrM (\x xs -> (x +) <$> xs) (return 0)
550foldrMReduce = S.foldrM (\x xs -> (x +) <$> xs) (return 0)
581
551
582o_n_space_elimination_foldr :: Int -> [Benchmark]
552o_n_space_elimination_foldr :: Int -> [Benchmark]
@@ -599,7 +569,7 @@ o_n_heap_elimination_toList value =
599 -- Converting the stream to a list or pure stream in a strict monad
569 -- Converting the stream to a list or pure stream in a strict monad
600 [ benchIOSink value "toListRev" S.toListRev
570 [ benchIOSink value "toListRev" S.toListRev
601 , benchIOSink value "toStreamRev"
571 , benchIOSink value "toStreamRev"
602− (S.toStreamRev :: (Stream IO Int -> IO (Stream Identity Int)))
572+ (S.toStreamRev :: (SerialT IO Int -> IO (SerialT Identity Int)))
603 ]
573 ]
604 ]
574 ]
605
575
@@ -608,10 +578,8 @@ o_n_space_elimination_toList value =
608 [ bgroup "toList"
578 [ bgroup "toList"
609 -- Converting the stream to a list or pure stream in a strict monad
579 -- Converting the stream to a list or pure stream in a strict monad
610 [ benchIOSink value "toList" S.toList
580 [ benchIOSink value "toList" S.toList
611−#ifndef USE_PRELUDE
612 , benchIOSink value "toStream"
581 , benchIOSink value "toStream"
613− (S.toStream :: (Stream IO Int -> IO (Stream Identity Int)))
582+ (S.toStream :: (SerialT IO Int -> IO (SerialT Identity Int)))
614−#endif
615 ]
583 ]
616 ]
584 ]
617#endif
585#endif
@@ -625,7 +593,7 @@ o_n_space_elimination_toList value =
625-------------------------------------------------------------------------------
593-------------------------------------------------------------------------------
626
594
627{-# INLINE eqBy' #-}
595{-# INLINE eqBy' #-}
628−eqBy' :: (Monad m, Eq a) => Stream m a -> m Bool
596+eqBy' :: (Monad m, Eq a) => SerialT m a -> m Bool
629eqBy' src = S.eqBy (==) src src
597eqBy' src = S.eqBy (==) src src
630
598
631{-# INLINE eqByPure #-}
599{-# INLINE eqByPure #-}
@@ -639,15 +607,15 @@ inspect $ 'eqByPure `hasNoType` ''D.Step
639#endif
607#endif
640
608
641{-# INLINE eqInstance #-}
609{-# INLINE eqInstance #-}
642−eqInstance :: Stream Identity Int -> Bool
610+eqInstance :: SerialT Identity Int -> Bool
643eqInstance src = src == src
611eqInstance src = src == src
644
612
645{-# INLINE eqInstanceNotEq #-}
613{-# INLINE eqInstanceNotEq #-}
646−eqInstanceNotEq :: Stream Identity Int -> Bool
614+eqInstanceNotEq :: SerialT Identity Int -> Bool
647eqInstanceNotEq src = src /= src
615eqInstanceNotEq src = src /= src
648
616
649{-# INLINE cmpBy' #-}
617{-# INLINE cmpBy' #-}
650−cmpBy' :: (Monad m, Ord a) => Stream m a -> m Ordering
618+cmpBy' :: (Monad m, Ord a) => SerialT m a -> m Ordering
651cmpBy' src = S.cmpBy compare src src
619cmpBy' src = S.cmpBy compare src src
652
620
653{-# INLINE cmpByPure #-}
621{-# INLINE cmpByPure #-}
@@ -661,7 +629,7 @@ inspect $ 'cmpByPure `hasNoType` ''D.Step
661#endif
629#endif
662
630
663{-# INLINE ordInstance #-}
631{-# INLINE ordInstance #-}
664−ordInstance :: Stream Identity Int -> Bool
632+ordInstance :: SerialT Identity Int -> Bool
665ordInstance src = src < src
633ordInstance src = src < src
666
634
667o_1_space_elimination_multi_stream_pure :: Int -> [Benchmark]
635o_1_space_elimination_multi_stream_pure :: Int -> [Benchmark]
@@ -676,15 +644,15 @@ o_1_space_elimination_multi_stream_pure value =
676 ]
644 ]
677
645
678{-# INLINE isPrefixOf #-}
646{-# INLINE isPrefixOf #-}
679−isPrefixOf :: Monad m => Stream m Int -> m Bool
647+isPrefixOf :: Monad m => SerialT m Int -> m Bool
680isPrefixOf src = S.isPrefixOf src src
648isPrefixOf src = S.isPrefixOf src src
681
649
682{-# INLINE isSubsequenceOf #-}
650{-# INLINE isSubsequenceOf #-}
683−isSubsequenceOf :: Monad m => Stream m Int -> m Bool
651+isSubsequenceOf :: Monad m => SerialT m Int -> m Bool
684isSubsequenceOf src = S.isSubsequenceOf src src
652isSubsequenceOf src = S.isSubsequenceOf src src
685
653
686{-# INLINE stripPrefix #-}
654{-# INLINE stripPrefix #-}
687−stripPrefix :: Monad m => Stream m Int -> m ()
655+stripPrefix :: Monad m => SerialT m Int -> m ()
688stripPrefix src = do
656stripPrefix src = do
689 _ <- S.stripPrefix src src
657 _ <- S.stripPrefix src src
690 return ()
658 return ()
@@ -741,8 +709,11 @@ benchmarks moduleName size =
741#ifdef USE_PRELUDE
709#ifdef USE_PRELUDE
742 ++ o_n_heap_elimination_foldl size
710 ++ o_n_heap_elimination_foldl size
743 ++ o_n_heap_elimination_toList size
711 ++ o_n_heap_elimination_toList size
744− ++ o_n_space_elimination_toList size
745#endif
712#endif
746 , bgroup (o_n_space_prefix moduleName) $
713 , bgroup (o_n_space_prefix moduleName) $
714+ o_n_space_elimination_foldable size
715+#ifdef USE_PRELUDE
716+ ++ o_n_space_elimination_toList size
717+#endif
747− o_n_space_elimination_foldr size
718+ ++ o_n_space_elimination_foldr size
748 ]
719 ]
benchmark/Streamly/Benchmark/Data/Stream/Exceptions.hs+39−76
@@ -10,10 +10,6 @@
10{-# LANGUAGE FlexibleContexts #-}
10{-# LANGUAGE FlexibleContexts #-}
11{-# LANGUAGE ScopedTypeVariables #-}
11{-# LANGUAGE ScopedTypeVariables #-}
12
12
13−#ifdef USE_PRELUDE
14−{-# OPTIONS_GHC -Wno-deprecations #-}
15−#endif
16−
17#ifdef __HADDOCK_VERSION__
13#ifdef __HADDOCK_VERSION__
18#undef INSPECTION
14#undef INSPECTION
19#endif
15#endif
@@ -25,67 +21,46 @@
25
21
26module Stream.Exceptions (benchmarks) where
22module Stream.Exceptions (benchmarks) where
27
23
28−import Control.Exception (Exception, throwIO)
24+import Control.Exception (SomeException, Exception, throwIO)
29import Stream.Common (drain)
25import Stream.Common (drain)
26+import Streamly.Internal.Data.Stream.Serial (SerialT)
27+import System.IO (Handle, hClose, hPutChar)
30
28
31import qualified Data.IORef as Ref
29import qualified Data.IORef as Ref
32import qualified Data.Map.Strict as Map
30import qualified Data.Map.Strict as Map
33−
31+import qualified Stream.Common as Common
34−import Control.Exception (SomeException)
35−import System.IO (Handle, hClose, hPutChar)
36import qualified Streamly.FileSystem.Handle as FH
32import qualified Streamly.FileSystem.Handle as FH
37−import qualified Streamly.Internal.FileSystem.Handle as IFH
38import qualified Streamly.Internal.Data.Unfold as IUF
33import qualified Streamly.Internal.Data.Unfold as IUF
39−import qualified Streamly.Internal.Data.Unfold.Prelude as IUF
34+import qualified Streamly.Internal.FileSystem.Handle as IFH
40−
41#ifdef USE_PRELUDE
35#ifdef USE_PRELUDE
42import qualified Streamly.Internal.Data.Stream.IsStream as Stream
36import qualified Streamly.Internal.Data.Stream.IsStream as Stream
43#else
37#else
44import qualified Streamly.Internal.Data.Stream as Stream
38import qualified Streamly.Internal.Data.Stream as Stream
45−import qualified Streamly.Internal.Data.Stream.Prelude as Stream
46#endif
39#endif
47
40
48−import Test.Tasty.Bench hiding (env)
41+import Gauge hiding (env)
49import Prelude hiding (last, length)
42import Prelude hiding (last, length)
50import Streamly.Benchmark.Common
43import Streamly.Benchmark.Common
51import Streamly.Benchmark.Common.Handle
44import Streamly.Benchmark.Common.Handle
52
45
53#ifdef INSPECTION
46#ifdef INSPECTION
54−import Control.Monad.Catch (MonadCatch)
55import Test.Inspection
47import Test.Inspection
56
48
57−import qualified Streamly.Internal.Data.Stream as D
49+import qualified Streamly.Internal.Data.Stream.StreamD as D
58#endif
50#endif
59
51
60−#ifdef USE_PRELUDE
52+-------------------------------------------------------------------------------
61−type Stream = Stream.SerialT
53+-- stream exceptions
62−toStreamD = Stream.toStream
54+-------------------------------------------------------------------------------
63−fromStreamD = Stream.fromStream
64−#else
65−type Stream = Stream.Stream
66−toStreamD :: a -> a
67−toStreamD = id
68−fromStreamD :: a -> a
69−fromStreamD = id
70−#endif
71
55
72−afterUnsafe :: IO b -> Stream IO a -> Stream IO a
56+{-# INLINE replicateM #-}
73−finallyUnsafe :: IO b -> Stream IO a -> Stream IO a
57+replicateM :: Common.MonadAsync m => Int -> m a -> SerialT m a
74−bracketUnsafe :: IO b -> (b -> IO c) -> (b -> Stream IO a) -> Stream IO a
75#ifdef USE_PRELUDE
58#ifdef USE_PRELUDE
76−afterUnsafe = Stream.after_
59+replicateM = Stream.replicateM
77−finallyUnsafe = Stream.finally_
78−bracketUnsafe = Stream.bracket_
79#else
60#else
80−afterUnsafe = Stream.afterUnsafe
61+replicateM n = Stream.sequence . Stream.replicate n
81−finallyUnsafe = Stream.finallyUnsafe
82−bracketUnsafe = Stream.bracketUnsafe
83#endif
62#endif
84
63
85−-------------------------------------------------------------------------------
86−-- stream exceptions
87−-------------------------------------------------------------------------------
88−
89data BenchException
64data BenchException
90 = BenchException1
65 = BenchException1
91 | BenchException2
66 | BenchException2
@@ -115,7 +90,7 @@ retryNone length from = do
115 where
90 where
116
91
117 source ref =
92 source ref =
118− Stream.replicateM (from + length)
93+ replicateM (from + length)
119 $ Ref.modifyIORef' ref (+ 1) >> Ref.readIORef ref
94 $ Ref.modifyIORef' ref (+ 1) >> Ref.readIORef ref
120
95
121retryAll :: Int -> Int -> IO ()
96retryAll :: Int -> Int -> IO ()
@@ -159,8 +134,6 @@ o_1_space_serial_exceptions length =
159 ]
134 ]
160 ]
135 ]
161
136
162−-- XXX Move these to FileSystem.Handle benchmarks
163−
164-------------------------------------------------------------------------------
137-------------------------------------------------------------------------------
165-- copy stream exceptions
138-- copy stream exceptions
166-------------------------------------------------------------------------------
139-------------------------------------------------------------------------------
@@ -168,7 +141,7 @@ o_1_space_serial_exceptions length =
168-- | Send the file contents to /dev/null with exception handling
141-- | Send the file contents to /dev/null with exception handling
169readWriteOnExceptionStream :: Handle -> Handle -> IO ()
142readWriteOnExceptionStream :: Handle -> Handle -> IO ()
170readWriteOnExceptionStream inh devNull =
143readWriteOnExceptionStream inh devNull =
171− let readEx = Stream.onException (hClose inh) (Stream.unfold FH.reader inh)
144+ let readEx = Stream.onException (hClose inh) (Stream.unfold FH.read inh)
172 in Stream.fold (FH.write devNull) readEx
145 in Stream.fold (FH.write devNull) readEx
173
146
174#ifdef INSPECTION
147#ifdef INSPECTION
@@ -178,9 +151,8 @@ inspect $ hasNoTypeClasses 'readWriteOnExceptionStream
178-- | Send the file contents to /dev/null with exception handling
151-- | Send the file contents to /dev/null with exception handling
179readWriteHandleExceptionStream :: Handle -> Handle -> IO ()
152readWriteHandleExceptionStream :: Handle -> Handle -> IO ()
180readWriteHandleExceptionStream inh devNull =
153readWriteHandleExceptionStream inh devNull =
181− let handler (_e :: SomeException) =
182− return $ Stream.fromEffect (hClose inh >> return 10)
154+ let handler (_e :: SomeException) = Stream.fromEffect (hClose inh >> return 10)
183− readEx = Stream.handle handler (Stream.unfold FH.reader inh)
155+ readEx = Stream.handle handler (Stream.unfold FH.read inh)
184 in Stream.fold (FH.write devNull) readEx
156 in Stream.fold (FH.write devNull) readEx
185
157
186#ifdef INSPECTION
158#ifdef INSPECTION
@@ -190,8 +162,7 @@ inspect $ hasNoTypeClasses 'readWriteHandleExceptionStream
190-- | Send the file contents to /dev/null with exception handling
162-- | Send the file contents to /dev/null with exception handling
191readWriteFinally_Stream :: Handle -> Handle -> IO ()
163readWriteFinally_Stream :: Handle -> Handle -> IO ()
192readWriteFinally_Stream inh devNull =
164readWriteFinally_Stream inh devNull =
193− let readEx =
194− finallyUnsafe (hClose inh) (Stream.unfold FH.reader inh)
165+ let readEx = Stream.finally_ (hClose inh) (Stream.unfold FH.read inh)
195 in Stream.fold (FH.write devNull) readEx
166 in Stream.fold (FH.write devNull) readEx
196
167
197#ifdef INSPECTION
168#ifdef INSPECTION
@@ -200,15 +171,15 @@ inspect $ hasNoTypeClasses 'readWriteFinally_Stream
200
171
201readWriteFinallyStream :: Handle -> Handle -> IO ()
172readWriteFinallyStream :: Handle -> Handle -> IO ()
202readWriteFinallyStream inh devNull =
173readWriteFinallyStream inh devNull =
203− let readEx = Stream.finally (hClose inh) (Stream.unfold FH.reader inh)
174+ let readEx = Stream.finally (hClose inh) (Stream.unfold FH.read inh)
204 in Stream.fold (FH.write devNull) readEx
175 in Stream.fold (FH.write devNull) readEx
205
176
206-- | Send the file contents to /dev/null with exception handling
177-- | Send the file contents to /dev/null with exception handling
207fromToBytesBracket_Stream :: Handle -> Handle -> IO ()
178fromToBytesBracket_Stream :: Handle -> Handle -> IO ()
208fromToBytesBracket_Stream inh devNull =
179fromToBytesBracket_Stream inh devNull =
209− let readEx = bracketUnsafe (return ()) (\_ -> hClose inh)
180+ let readEx = Stream.bracket_ (return ()) (\_ -> hClose inh)
210− (\_ -> fromStreamD $ IFH.read inh)
181+ (\_ -> IFH.getBytes inh)
211− in IFH.putBytes devNull (toStreamD readEx)
182+ in IFH.putBytes devNull readEx
212
183
213#ifdef INSPECTION
184#ifdef INSPECTION
214inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
185inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
@@ -217,14 +188,14 @@ inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
217fromToBytesBracketStream :: Handle -> Handle -> IO ()
188fromToBytesBracketStream :: Handle -> Handle -> IO ()
218fromToBytesBracketStream inh devNull =
189fromToBytesBracketStream inh devNull =
219 let readEx = Stream.bracket (return ()) (\_ -> hClose inh)
190 let readEx = Stream.bracket (return ()) (\_ -> hClose inh)
220− (\_ -> fromStreamD $ IFH.read inh)
191+ (\_ -> IFH.getBytes inh)
221− in IFH.putBytes devNull (toStreamD readEx)
192+ in IFH.putBytes devNull readEx
222
193
223readWriteBeforeAfterStream :: Handle -> Handle -> IO ()
194readWriteBeforeAfterStream :: Handle -> Handle -> IO ()
224readWriteBeforeAfterStream inh devNull =
195readWriteBeforeAfterStream inh devNull =
225 let readEx =
196 let readEx =
226 Stream.after (hClose inh)
197 Stream.after (hClose inh)
227− $ Stream.before (hPutChar devNull 'A') (Stream.unfold FH.reader inh)
198+ $ Stream.before (hPutChar devNull 'A') (Stream.unfold FH.read inh)
228 in Stream.fold (FH.write devNull) readEx
199 in Stream.fold (FH.write devNull) readEx
229
200
230#ifdef INSPECTION
201#ifdef INSPECTION
@@ -233,7 +204,7 @@ inspect $ 'readWriteBeforeAfterStream `hasNoType` ''D.Step
233
204
234readWriteAfterStream :: Handle -> Handle -> IO ()
205readWriteAfterStream :: Handle -> Handle -> IO ()
235readWriteAfterStream inh devNull =
206readWriteAfterStream inh devNull =
236− let readEx = Stream.after (hClose inh) (Stream.unfold FH.reader inh)
207+ let readEx = Stream.after (hClose inh) (Stream.unfold FH.read inh)
237 in Stream.fold (FH.write devNull) readEx
208 in Stream.fold (FH.write devNull) readEx
238
209
239#ifdef INSPECTION
210#ifdef INSPECTION
@@ -242,7 +213,7 @@ inspect $ 'readWriteAfterStream `hasNoType` ''D.Step
242
213
243readWriteAfter_Stream :: Handle -> Handle -> IO ()
214readWriteAfter_Stream :: Handle -> Handle -> IO ()
244readWriteAfter_Stream inh devNull =
215readWriteAfter_Stream inh devNull =
245− let readEx = afterUnsafe (hClose inh) (Stream.unfold FH.reader inh)
216+ let readEx = Stream.after_ (hClose inh) (Stream.unfold FH.read inh)
246 in Stream.fold (FH.write devNull) readEx
217 in Stream.fold (FH.write devNull) readEx
247
218
248#ifdef INSPECTION
219#ifdef INSPECTION
@@ -283,34 +254,26 @@ o_1_space_copy_stream_exceptions env =
283-- | Send the file contents to /dev/null with exception handling
254-- | Send the file contents to /dev/null with exception handling
284readChunksOnException :: Handle -> Handle -> IO ()
255readChunksOnException :: Handle -> Handle -> IO ()
285readChunksOnException inh devNull =
256readChunksOnException inh devNull =
286− let readEx = IUF.onException (\_ -> hClose inh) FH.chunkReader
257+ let readEx = IUF.onException (\_ -> hClose inh) FH.readChunks
287 in IUF.fold (IFH.writeChunks devNull) readEx inh
258 in IUF.fold (IFH.writeChunks devNull) readEx inh
288
259
289#ifdef INSPECTION
260#ifdef INSPECTION
290−#if __GLASGOW_HASKELL__ >= 906
291−inspect $ hasNoTypeClassesExcept 'readChunksOnException [''MonadCatch]
292−#else
293inspect $ hasNoTypeClasses 'readChunksOnException
261inspect $ hasNoTypeClasses 'readChunksOnException
294#endif
262#endif
295−#endif
296
263
297-- | Send the file contents to /dev/null with exception handling
264-- | Send the file contents to /dev/null with exception handling
298readChunksBracket_ :: Handle -> Handle -> IO ()
265readChunksBracket_ :: Handle -> Handle -> IO ()
299readChunksBracket_ inh devNull =
266readChunksBracket_ inh devNull =
300− let readEx = IUF.bracket_ return (\_ -> hClose inh) FH.chunkReader
267+ let readEx = IUF.bracket_ return (\_ -> hClose inh) FH.readChunks
301 in IUF.fold (IFH.writeChunks devNull) readEx inh
268 in IUF.fold (IFH.writeChunks devNull) readEx inh
302
269
303#ifdef INSPECTION
270#ifdef INSPECTION
304−#if __GLASGOW_HASKELL__ >= 906
305−inspect $ hasNoTypeClassesExcept 'readChunksBracket_ [''MonadCatch]
306−#else
307inspect $ hasNoTypeClasses 'readChunksBracket_
271inspect $ hasNoTypeClasses 'readChunksBracket_
308#endif
272#endif
309−#endif
310
273
311readChunksBracket :: Handle -> Handle -> IO ()
274readChunksBracket :: Handle -> Handle -> IO ()
312readChunksBracket inh devNull =
275readChunksBracket inh devNull =
313− let readEx = IUF.bracket return (\_ -> hClose inh) FH.chunkReader
276+ let readEx = IUF.bracket return (\_ -> hClose inh) FH.readChunks
314 in IUF.fold (IFH.writeChunks devNull) readEx inh
277 in IUF.fold (IFH.writeChunks devNull) readEx inh
315
278
316o_1_space_copy_exceptions_readChunks :: BenchEnv -> [Benchmark]
279o_1_space_copy_exceptions_readChunks :: BenchEnv -> [Benchmark]
@@ -332,10 +295,10 @@ o_1_space_copy_exceptions_readChunks env =
332-- | Send the file contents to /dev/null with exception handling
295-- | Send the file contents to /dev/null with exception handling
333toChunksBracket_ :: Handle -> Handle -> IO ()
296toChunksBracket_ :: Handle -> Handle -> IO ()
334toChunksBracket_ inh devNull =
297toChunksBracket_ inh devNull =
335− let readEx = bracketUnsafe
298+ let readEx = Stream.bracket_
336 (return ())
299 (return ())
337 (\_ -> hClose inh)
300 (\_ -> hClose inh)
338− (\_ -> fromStreamD $ IFH.readChunks inh)
301+ (\_ -> IFH.getChunks inh)
339 in Stream.fold (IFH.writeChunks devNull) readEx
302 in Stream.fold (IFH.writeChunks devNull) readEx
340
303
341#ifdef INSPECTION
304#ifdef INSPECTION
@@ -347,7 +310,7 @@ toChunksBracket inh devNull =
347 let readEx = Stream.bracket
310 let readEx = Stream.bracket
348 (return ())
311 (return ())
349 (\_ -> hClose inh)
312 (\_ -> hClose inh)
350− (\_ -> fromStreamD $ IFH.readChunks inh)
313+ (\_ -> IFH.getChunks inh)
351 in Stream.fold (IFH.writeChunks devNull) readEx
314 in Stream.fold (IFH.writeChunks devNull) readEx
352
315
353o_1_space_copy_exceptions_toChunks :: BenchEnv -> [Benchmark]
316o_1_space_copy_exceptions_toChunks :: BenchEnv -> [Benchmark]
@@ -361,11 +324,11 @@ o_1_space_copy_exceptions_toChunks env =
361 ]
324 ]
362
325
363benchmarks :: String -> BenchEnv -> Int -> [Benchmark]
326benchmarks :: String -> BenchEnv -> Int -> [Benchmark]
364−benchmarks moduleName _env size =
327+benchmarks moduleName env size =
365 [ bgroup (o_1_space_prefix moduleName) $ concat
328 [ bgroup (o_1_space_prefix moduleName) $ concat
366− [ o_1_space_serial_exceptions size
367− , o_1_space_copy_exceptions_readChunks _env
329+ [ o_1_space_copy_exceptions_readChunks env
368− , o_1_space_copy_exceptions_toChunks _env
330+ , o_1_space_copy_exceptions_toChunks env
369− , o_1_space_copy_stream_exceptions _env
331+ , o_1_space_copy_stream_exceptions env
332+ , o_1_space_serial_exceptions size
370 ]
333 ]
371 ]
334 ]
benchmark/Streamly/Benchmark/Data/Stream/Expand.hs+120−166
@@ -8,11 +8,6 @@
8{-# LANGUAGE FlexibleContexts #-}
8{-# LANGUAGE FlexibleContexts #-}
9{-# LANGUAGE ScopedTypeVariables #-}
9{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE RankNTypes #-}
10{-# LANGUAGE RankNTypes #-}
11−{-# LANGUAGE TupleSections #-}
12−
13−#ifdef USE_PRELUDE
14−{-# OPTIONS_GHC -Wno-deprecations #-}
15−#endif
16
11
17#ifdef __HADDOCK_VERSION__
12#ifdef __HADDOCK_VERSION__
18#undef INSPECTION
13#undef INSPECTION
@@ -25,37 +20,33 @@
25
20
26module Stream.Expand (benchmarks) where
21module Stream.Expand (benchmarks) where
27
22
23+import Control.Monad.Trans.Class (lift)
24+import Streamly.Internal.Data.Stream.Serial (SerialT)
25+
26+import qualified Control.Applicative as AP
27+
28#ifdef INSPECTION
28#ifdef INSPECTION
29import GHC.Types (SPEC(..))
29import GHC.Types (SPEC(..))
30import Test.Inspection
30import Test.Inspection
31
31
32−import qualified Streamly.Internal.Data.Stream as D
32+import qualified Streamly.Internal.Data.Stream.StreamD as D
33#endif
33#endif
34
34
35+import Streamly.Benchmark.Prelude (benchIO)
35import qualified Stream.Common as Common
36import qualified Stream.Common as Common
36−import qualified Streamly.Internal.Data.Unfold as UF
37−
38#ifdef USE_PRELUDE
37#ifdef USE_PRELUDE
39import qualified Streamly.Internal.Data.Stream.IsStream as S
38import qualified Streamly.Internal.Data.Stream.IsStream as S
40−import qualified Streamly.Internal.Data.Stream.IsStream as StreamK
41import Streamly.Benchmark.Prelude
39import Streamly.Benchmark.Prelude
42 ( sourceFoldMapM, sourceFoldMapWith, sourceFoldMapWithM
40 ( sourceFoldMapM, sourceFoldMapWith, sourceFoldMapWithM
43 , sourceFoldMapWithStream, concatFoldableWith, concatForFoldableWith)
41 , sourceFoldMapWithStream, concatFoldableWith, concatForFoldableWith)
44#else
42#else
45import qualified Streamly.Internal.Data.Stream as S
43import qualified Streamly.Internal.Data.Stream as S
46−#ifdef USE_STREAMK
47−import Streamly.Internal.Data.Stream (Stream)
48−import Streamly.Internal.Data.StreamK (StreamK, CrossStreamK)
49−import qualified Control.Applicative as AP
50−import qualified Streamly.Internal.Data.Fold as Fold
51−import qualified Streamly.Internal.Data.StreamK as StreamK
52−#else
53−import qualified Streamly.Internal.Data.Stream as StreamK
54−#endif
55#endif
44#endif
45+import qualified Streamly.Internal.Data.Unfold as UF
46+import qualified Streamly.Internal.Data.Fold as Fold
56
47
57−import Test.Tasty.Bench
48+import Gauge
58−import Stream.Common
49+import Stream.Common hiding (append2)
59import Streamly.Benchmark.Common
50import Streamly.Benchmark.Common
60import Prelude hiding (concatMap)
51import Prelude hiding (concatMap)
61
52
@@ -63,7 +54,6 @@ import Prelude hiding (concatMap)
63-- Iteration/looping utilities
54-- Iteration/looping utilities
64-------------------------------------------------------------------------------
55-------------------------------------------------------------------------------
65
56
66−#ifdef USE_STREAMK
67{-# INLINE iterateN #-}
57{-# INLINE iterateN #-}
68iterateN :: (Int -> a -> a) -> a -> Int -> a
58iterateN :: (Int -> a -> a) -> a -> Int -> a
69iterateN g initial count = f count initial
59iterateN g initial count = f count initial
@@ -75,16 +65,12 @@ iterateN g initial count = f count initial
75
65
76-- Iterate a transformation over a singleton stream
66-- Iterate a transformation over a singleton stream
77{-# INLINE iterateSingleton #-}
67{-# INLINE iterateSingleton #-}
78−iterateSingleton :: Applicative m =>
68+iterateSingleton :: Monad m
79− (Int -> CrossStreamK m Int -> CrossStreamK m Int)
69+ => (Int -> SerialT m Int -> SerialT m Int)
80 -> Int
70 -> Int
81 -> Int
71 -> Int
82− -> Stream m Int
72+ -> SerialT m Int
83−iterateSingleton g count n =
73+iterateSingleton g count n = iterateN g (return n) count
84− toStream
85− $ StreamK.unCross
86− $ iterateN g (StreamK.mkCross (StreamK.fromPure n)) count
87−#endif
88
74
89{-
75{-
90-- XXX need to check why this is slower than the explicit recursion above, even
76-- XXX need to check why this is slower than the explicit recursion above, even
@@ -95,10 +81,10 @@ iterateSingleton g count n =
95{-# INLINE _iterateSingleton #-}
81{-# INLINE _iterateSingleton #-}
96_iterateSingleton ::
82_iterateSingleton ::
97 Monad m
83 Monad m
98− => (Int -> Stream m Int -> Stream m Int)
84+ => (Int -> SerialT m Int -> SerialT m Int)
99 -> Int
85 -> Int
100 -> Int
86 -> Int
101− -> Stream m Int
87+ -> SerialT m Int
102_iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
88_iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
103-}
89-}
104
90
@@ -113,28 +99,50 @@ _iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
113{-# INLINE serial2 #-}
99{-# INLINE serial2 #-}
114serial2 :: Int -> Int -> IO ()
100serial2 :: Int -> Int -> IO ()
115serial2 count n =
101serial2 count n =
116− drain $ toStream $
102+ drain $
117− Common.append
118− (fromStream $ sourceUnfoldrM count n)
119− (fromStream $ sourceUnfoldrM count (n + 1))
103+ Common.append (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
120
104
121{-# INLINE serial4 #-}
105{-# INLINE serial4 #-}
122serial4 :: Int -> Int -> IO ()
106serial4 :: Int -> Int -> IO ()
123serial4 count n =
107serial4 count n =
124− drain $ toStream $
108+ drain $
125 Common.append
109 Common.append
110+ (Common.append (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1)))
126 (Common.append
111 (Common.append
112+ (sourceUnfoldrM count (n + 2))
127− (fromStream $ sourceUnfoldrM count n)
113+ (sourceUnfoldrM count (n + 3)))
114+
115+{-# INLINE append2 #-}
116+append2 :: Int -> Int -> IO ()
117+append2 count n =
118+ drain $
128− (fromStream $ sourceUnfoldrM count (n + 1)))
119+ Common.append2 (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
120+
121+{-# INLINE append4 #-}
122+append4 :: Int -> Int -> IO ()
123+append4 count n =
124+ drain $
125+ Common.append2
129− (Common.append
126+ (Common.append2
127+ (sourceUnfoldrM count n)
130− (fromStream $ sourceUnfoldrM count (n + 2))
128+ (sourceUnfoldrM count (n + 1)))
129+ (Common.append2
130+ (sourceUnfoldrM count (n + 2))
131− (fromStream $ sourceUnfoldrM count (n + 3)))
131+ (sourceUnfoldrM count (n + 3)))
132+
133+#ifdef INSPECTION
134+inspect $ hasNoTypeClasses 'append2
135+inspect $ 'append2 `hasNoType` ''SPEC
136+inspect $ 'append2 `hasNoType` ''D.AppendState
137+#endif
132
138
133o_1_space_joining :: Int -> [Benchmark]
139o_1_space_joining :: Int -> [Benchmark]
134o_1_space_joining value =
140o_1_space_joining value =
135 [ bgroup "joining"
141 [ bgroup "joining"
136 [ benchIOSrc1 "serial (2,x/2)" (serial2 (value `div` 2))
142 [ benchIOSrc1 "serial (2,x/2)" (serial2 (value `div` 2))
143+ , benchIOSrc1 "append (2,x/2)" (append2 (value `div` 2))
137 , benchIOSrc1 "serial (2,2,x/4)" (serial4 (value `div` 4))
144 , benchIOSrc1 "serial (2,2,x/4)" (serial4 (value `div` 4))
145+ , benchIOSrc1 "append (2,2,x/4)" (append4 (value `div` 4))
138 ]
146 ]
139 ]
147 ]
140
148
@@ -170,11 +178,10 @@ o_1_space_concatFoldable value =
170{-# INLINE concatMap #-}
178{-# INLINE concatMap #-}
171concatMap :: Int -> Int -> Int -> IO ()
179concatMap :: Int -> Int -> Int -> IO ()
172concatMap outer inner n =
180concatMap outer inner n =
173− drain $ toStream $ StreamK.concatMap
181+ drain $ S.concatMap
174− (\_ -> fromStream $ sourceUnfoldrM inner n)
182+ (\_ -> sourceUnfoldrM inner n)
175− (fromStream $ sourceUnfoldrM outer n)
183+ (sourceUnfoldrM outer n)
176
184
177−#ifndef USE_STREAMK
178{-# INLINE concatMapM #-}
185{-# INLINE concatMapM #-}
179concatMapM :: Int -> Int -> Int -> IO ()
186concatMapM :: Int -> Int -> Int -> IO ()
180concatMapM outer inner n =
187concatMapM outer inner n =
@@ -186,23 +193,18 @@ concatMapM outer inner n =
186inspect $ hasNoTypeClasses 'concatMap
193inspect $ hasNoTypeClasses 'concatMap
187inspect $ 'concatMap `hasNoType` ''SPEC
194inspect $ 'concatMap `hasNoType` ''SPEC
188#endif
195#endif
189−#endif
190
196
191-- concatMap unfoldr/unfoldr
197-- concatMap unfoldr/unfoldr
192
198
193{-# INLINE concatMapPure #-}
199{-# INLINE concatMapPure #-}
194concatMapPure :: Int -> Int -> Int -> IO ()
200concatMapPure :: Int -> Int -> Int -> IO ()
195concatMapPure outer inner n =
201concatMapPure outer inner n =
196− drain $ toStream $ StreamK.concatMap
202+ drain $ S.concatMap
197− (\_ -> fromStream $ sourceUnfoldr inner n)
203+ (\_ -> sourceUnfoldr inner n)
198− (fromStream $ sourceUnfoldr outer n)
204+ (sourceUnfoldr outer n)
199
205
200#ifdef INSPECTION
206#ifdef INSPECTION
201−#if __GLASGOW_HASKELL__ >= 906
202−inspect $ hasNoTypeClassesExcept 'concatMapPure [''Applicative]
203−#else
204inspect $ hasNoTypeClasses 'concatMapPure
207inspect $ hasNoTypeClasses 'concatMapPure
205−#endif
206inspect $ 'concatMapPure `hasNoType` ''SPEC
208inspect $ 'concatMapPure `hasNoType` ''SPEC
207#endif
209#endif
208
210
@@ -211,21 +213,15 @@ inspect $ 'concatMapPure `hasNoType` ''SPEC
211{-# INLINE concatMapRepl #-}
213{-# INLINE concatMapRepl #-}
212concatMapRepl :: Int -> Int -> Int -> IO ()
214concatMapRepl :: Int -> Int -> Int -> IO ()
213concatMapRepl outer inner n =
215concatMapRepl outer inner n =
214− drain $ toStream $ StreamK.concatMap
215− (fromStream . S.replicate inner) (fromStream $ sourceUnfoldrM outer n)
216+ drain $ S.concatMap (S.replicate inner) (sourceUnfoldrM outer n)
216
217
217#ifdef INSPECTION
218#ifdef INSPECTION
218−#if __GLASGOW_HASKELL__ >= 906
219−inspect $ hasNoTypeClassesExcept 'concatMapRepl [''Applicative]
220−#else
221inspect $ hasNoTypeClasses 'concatMapRepl
219inspect $ hasNoTypeClasses 'concatMapRepl
222−#endif
223inspect $ 'concatMapRepl `hasNoType` ''SPEC
220inspect $ 'concatMapRepl `hasNoType` ''SPEC
224#endif
221#endif
225
222
226-- concatMapWith
223-- concatMapWith
227
224
228−#ifdef USE_STREAMK
229{-# INLINE concatMapWithSerial #-}
225{-# INLINE concatMapWithSerial #-}
230concatMapWithSerial :: Int -> Int -> Int -> IO ()
226concatMapWithSerial :: Int -> Int -> Int -> IO ()
231concatMapWithSerial = concatStreamsWith Common.append
227concatMapWithSerial = concatStreamsWith Common.append
@@ -235,7 +231,6 @@ inspect $ hasNoTypeClasses 'concatMapWithSerial
235inspect $ 'concatMapWithSerial `hasNoType` ''SPEC
231inspect $ 'concatMapWithSerial `hasNoType` ''SPEC
236#endif
232#endif
237
233
238−{-
239{-# INLINE concatMapWithAppend #-}
234{-# INLINE concatMapWithAppend #-}
240concatMapWithAppend :: Int -> Int -> Int -> IO ()
235concatMapWithAppend :: Int -> Int -> Int -> IO ()
241concatMapWithAppend = concatStreamsWith Common.append2
236concatMapWithAppend = concatStreamsWith Common.append2
@@ -244,20 +239,16 @@ concatMapWithAppend = concatStreamsWith Common.append2
244inspect $ hasNoTypeClasses 'concatMapWithAppend
239inspect $ hasNoTypeClasses 'concatMapWithAppend
245inspect $ 'concatMapWithAppend `hasNoType` ''SPEC
240inspect $ 'concatMapWithAppend `hasNoType` ''SPEC
246#endif
241#endif
247−-}
248
242
249−-- mergeMapWith
243+-- concatPairWith
250
244
251−{-# INLINE mergeMapWithSerial #-}
245+{-# INLINE concatPairWithSerial #-}
252−mergeMapWithSerial :: Int -> Int -> Int -> IO ()
246+concatPairWithSerial :: Int -> Int -> Int -> IO ()
253−mergeMapWithSerial = mergeMapWith Common.append
247+concatPairWithSerial = concatPairsWith Common.append
254
248
255−{-
249+{-# INLINE concatPairWithAppend #-}
256−{-# INLINE mergeMapWithAppend #-}
250+concatPairWithAppend :: Int -> Int -> Int -> IO ()
257−mergeMapWithAppend :: Int -> Int -> Int -> IO ()
251+concatPairWithAppend = concatPairsWith Common.append2
258−mergeMapWithAppend = mergeMapWith Common.append2
259−-}
260−#endif
261
252
262-- unfoldMany
253-- unfoldMany
263
254
@@ -268,9 +259,8 @@ unfoldManyRepl :: Int -> Int -> Int -> IO ()
268unfoldManyRepl outer inner n =
259unfoldManyRepl outer inner n =
269 drain
260 drain
270 $ S.unfoldMany
261 $ S.unfoldMany
271− UF.replicateM
262+ (UF.lmap return (UF.replicateM inner))
272− (fmap ((inner,) . return) (sourceUnfoldrM outer n))
263+ (sourceUnfoldrM outer n)
273−
274
264
275#ifdef INSPECTION
265#ifdef INSPECTION
276inspect $ hasNoTypeClasses 'unfoldManyRepl
266inspect $ hasNoTypeClasses 'unfoldManyRepl
@@ -288,6 +278,10 @@ o_1_space_concat value = sqrtVal `seq`
288 , benchIOSrc1 "concatMapPure (1 of n)"
278 , benchIOSrc1 "concatMapPure (1 of n)"
289 (concatMapPure 1 value)
279 (concatMapPure 1 value)
290
280
281+ -- This is for comparison with foldMapWith
282+ , benchIOSrc "concatMapId (n of 1) (fromFoldable)"
283+ (S.concatMap id . sourceConcatMapId value)
284+
291 , benchIOSrc1 "concatMap (n of 1)"
285 , benchIOSrc1 "concatMap (n of 1)"
292 (concatMap value 1)
286 (concatMap value 1)
293 , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
287 , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
@@ -295,25 +289,16 @@ o_1_space_concat value = sqrtVal `seq`
295 , benchIOSrc1 "concatMap (1 of n)"
289 , benchIOSrc1 "concatMap (1 of n)"
296 (concatMap 1 value)
290 (concatMap 1 value)
297
291
298−#ifndef USE_STREAMK
299− -- This is for comparison with foldMapWith
300− , benchIOSrc "concatMapId (n of 1) (fromFoldable)"
301− (S.concatMap id . sourceConcatMapId value)
302−
303 , benchIOSrc1 "concatMapM (n of 1)"
292 , benchIOSrc1 "concatMapM (n of 1)"
304 (concatMapM value 1)
293 (concatMapM value 1)
305 , benchIOSrc1 "concatMapM (sqrt n of sqrt n)"
294 , benchIOSrc1 "concatMapM (sqrt n of sqrt n)"
306 (concatMapM sqrtVal sqrtVal)
295 (concatMapM sqrtVal sqrtVal)
307 , benchIOSrc1 "concatMapM (1 of n)"
296 , benchIOSrc1 "concatMapM (1 of n)"
308 (concatMapM 1 value)
297 (concatMapM 1 value)
309−#endif
310
298
311−#ifdef USE_STREAMK
312− {-
313 -- This is for comparison with foldMapWith
299 -- This is for comparison with foldMapWith
314 , benchIOSrc "concatMapWithId (n of 1) (fromFoldable)"
300 , benchIOSrc "concatMapWithId (n of 1) (fromFoldable)"
315− (toStream . S.concatMapWith Common.append id . sourceConcatMapId value)
301+ (S.concatMapWith Common.append id . sourceConcatMapId value)
316− -}
317
302
318 , benchIOSrc1 "concatMapWith (n of 1)"
303 , benchIOSrc1 "concatMapWith (n of 1)"
319 (concatMapWithSerial value 1)
304 (concatMapWithSerial value 1)
@@ -322,12 +307,9 @@ o_1_space_concat value = sqrtVal `seq`
322 , benchIOSrc1 "concatMapWith (1 of n)"
307 , benchIOSrc1 "concatMapWith (1 of n)"
323 (concatMapWithSerial 1 value)
308 (concatMapWithSerial 1 value)
324
309
325− {-
326 -- quadratic with number of outer streams
310 -- quadratic with number of outer streams
327 , benchIOSrc1 "concatMapWithAppend (2 of n/2)"
311 , benchIOSrc1 "concatMapWithAppend (2 of n/2)"
328 (concatMapWithAppend 2 (value `div` 2))
312 (concatMapWithAppend 2 (value `div` 2))
329− -}
330−#endif
331
313
332 -- concatMap vs unfoldMany
314 -- concatMap vs unfoldMany
333 , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
315 , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
@@ -341,35 +323,31 @@ o_1_space_concat value = sqrtVal `seq`
341
323
342 sqrtVal = round $ sqrt (fromIntegral value :: Double)
324 sqrtVal = round $ sqrt (fromIntegral value :: Double)
343
325
344−#ifdef USE_STREAMK
345−o_n_space_merge :: Int -> [Benchmark]
326+o_n_space_concat :: Int -> [Benchmark]
346−o_n_space_merge value = sqrtVal `seq`
327+o_n_space_concat value = sqrtVal `seq`
347 [ bgroup "concat"
328 [ bgroup "concat"
348 [
329 [
349− -------------------mergeMapWith-----------------
330+ -------------------concatPairsWith-----------------
350
331
351 -- Use large number of streams to check scalability
332 -- Use large number of streams to check scalability
352
333
353− benchIOSrc1 "mergeMapWithSerial (n of 1)"
334+ benchIOSrc1 "concatPairWithSerial (n of 1)"
354− (mergeMapWithSerial value 1)
335+ (concatPairWithSerial value 1)
355− , benchIOSrc1 "mergeMapWithSerial (sqrtVal of sqrtVal)"
336+ , benchIOSrc1 "concatPairWithSerial (sqrtVal of sqrtVal)"
356− (mergeMapWithSerial sqrtVal sqrtVal)
337+ (concatPairWithSerial sqrtVal sqrtVal)
357− , benchIOSrc1 "mergeMapWithSerial (2 of n/2)"
338+ , benchIOSrc1 "concatPairWithSerial (2 of n/2)"
358− (mergeMapWithSerial 2 (value `div` 2))
339+ (concatPairWithSerial 2 (value `div` 2))
359−
340+
360− {-
361− , benchIOSrc1 "mergeMapWithAppend (n of 1)"
341+ , benchIOSrc1 "concatPairWithAppend (n of 1)"
362− (mergeMapWithAppend value 1)
342+ (concatPairWithAppend value 1)
363− , benchIOSrc1 "mergeMapWithAppend (sqrtVal of sqrtVal)"
343+ , benchIOSrc1 "concatPairWithAppend (sqrtVal of sqrtVal)"
364− (mergeMapWithAppend sqrtVal sqrtVal)
344+ (concatPairWithAppend sqrtVal sqrtVal)
365− -}
366 ]
345 ]
367 ]
346 ]
368
347
369 where
348 where
370
349
371 sqrtVal = round $ sqrt (fromIntegral value :: Double)
350 sqrtVal = round $ sqrt (fromIntegral value :: Double)
372−#endif
373
351
374-------------------------------------------------------------------------------
352-------------------------------------------------------------------------------
375-- Applicative
353-- Applicative
@@ -385,10 +363,9 @@ o_1_space_applicative value =
385 ]
363 ]
386 ]
364 ]
387
365
388−#ifdef USE_STREAMK
389o_n_space_applicative :: Int -> [Benchmark]
366o_n_space_applicative :: Int -> [Benchmark]
390o_n_space_applicative value =
367o_n_space_applicative value =
391− [ bgroup "iterated"
368+ [ bgroup "Applicative"
392 [ benchIOSrc "(*>) (n times)" $
369 [ benchIOSrc "(*>) (n times)" $
393 iterateSingleton ((*>) . pure) value
370 iterateSingleton ((*>) . pure) value
394 , benchIOSrc "(<*) (n times)" $
371 , benchIOSrc "(<*) (n times)" $
@@ -399,7 +376,6 @@ o_n_space_applicative value =
399 iterateSingleton (AP.liftA2 (+) . pure) value
376 iterateSingleton (AP.liftA2 (+) . pure) value
400 ]
377 ]
401 ]
378 ]
402−#endif
403
379
404-------------------------------------------------------------------------------
380-------------------------------------------------------------------------------
405-- Monad
381-- Monad
@@ -423,46 +399,30 @@ o_1_space_monad value =
423 ]
399 ]
424 ]
400 ]
425
401
426−#ifdef USE_STREAMK
427-- This is a good benchmark but inefficient way to compute primes. As we see a
402-- This is a good benchmark but inefficient way to compute primes. As we see a
428-- new prime we keep appending a division filter for all the future numbers.
403-- new prime we keep appending a division filter for all the future numbers.
429{-# INLINE sieve #-}
404{-# INLINE sieve #-}
430−sieve :: Monad m => StreamK m Int -> StreamK m Int
405+sieve :: Monad m => SerialT m Int -> SerialT m Int
431−sieve s = StreamK.concatEffect $ do
406+sieve s = do
432− r <- StreamK.uncons s
407+ r <- lift $ S.uncons s
433 case r of
408 case r of
434 Just (prime, rest) ->
409 Just (prime, rest) ->
435− -- XXX Use K.filter or rewrite to K.filter
436− let f = S.filter (\n -> n `mod` prime /= 0)
410+ prime `S.cons` sieve (S.filter (\n -> n `mod` prime /= 0) rest)
437− in pure $ prime `StreamK.cons` sieve (fromStream $ f $ toStream rest)
438− Nothing -> pure StreamK.nil
411+ Nothing -> S.nil
439−
440−o_n_space_iterated :: Int -> [Benchmark]
441−o_n_space_iterated value =
442− [ bgroup "iterated"
443− [
444− benchIO "concatEffect prime sieve (n/4)"
445− (\n ->
446− S.fold Fold.sum
447− $ toStream
448− $ sieve
449− $ fromStream
450− $ S.enumerateFromTo 2 (value `div` 4 + n))
451− , benchIOSrc "(>>) (n times)" $
452− iterateSingleton ((>>) . pure) value
453− , benchIOSrc "(>>=) (n times)" $
454− iterateSingleton (\x xs -> xs >>= \y -> return (x + y)) value
455− ]
456− ]
457−#endif
458
412
459o_n_space_monad :: Int -> [Benchmark]
413o_n_space_monad :: Int -> [Benchmark]
460o_n_space_monad value =
414o_n_space_monad value =
461 [ bgroup "Monad"
415 [ bgroup "Monad"
416+ [ benchIOSrc "(>>) (n times)" $
417+ iterateSingleton ((>>) . pure) value
418+ , benchIOSrc "(>>=) (n times)" $
419+ iterateSingleton (\x xs -> xs >>= \y -> return (x + y)) value
462− [ benchIO "(>>=) (sqrt n x sqrt n) (toList)" $
420+ , benchIO "(>>=) (sqrt n x sqrt n) (toList)" $
463 toListM value
421 toListM value
464 , benchIO "(>>=) (sqrt n x sqrt n) (toListSome)" $
422 , benchIO "(>>=) (sqrt n x sqrt n) (toListSome)" $
465 toListSome value
423 toListSome value
424+ , benchIO "naive prime sieve (n/4)"
425+ (\n -> S.fold Fold.sum $ sieve $ S.enumerateFromTo 2 (value `div` 4 + n))
466 ]
426 ]
467 ]
427 ]
468
428
@@ -470,13 +430,12 @@ o_n_space_monad value =
470-- Joining
430-- Joining
471-------------------------------------------------------------------------------
431-------------------------------------------------------------------------------
472
432
473−{-
474toKv :: Int -> (Int, Int)
433toKv :: Int -> (Int, Int)
475toKv p = (p, p)
434toKv p = (p, p)
476
435
477{-# INLINE joinWith #-}
436{-# INLINE joinWith #-}
478joinWith :: Common.MonadAsync m =>
437joinWith :: Common.MonadAsync m =>
479− ((Int -> Int -> Bool) -> Stream m Int -> Stream m Int -> Stream m b)
438+ ((Int -> Int -> Bool) -> SerialT m Int -> SerialT m Int -> SerialT m b)
480 -> Int
439 -> Int
481 -> Int
440 -> Int
482 -> m ()
441 -> m ()
@@ -485,7 +444,7 @@ joinWith j val i =
485
444
486{-# INLINE joinMapWith #-}
445{-# INLINE joinMapWith #-}
487joinMapWith :: Common.MonadAsync m =>
446joinMapWith :: Common.MonadAsync m =>
488− (Stream m (Int, Int) -> Stream m (Int, Int) -> Stream m b)
447+ (SerialT m (Int, Int) -> SerialT m (Int, Int) -> SerialT m b)
489 -> Int
448 -> Int
490 -> Int
449 -> Int
491 -> m ()
450 -> m ()
@@ -499,22 +458,22 @@ o_n_heap_buffering :: Int -> [Benchmark]
499o_n_heap_buffering value =
458o_n_heap_buffering value =
500 [ bgroup "buffered"
459 [ bgroup "buffered"
501 [
460 [
502− benchIOSrc1 "joinInnerGeneric (sqrtVal)"
461+ benchIOSrc1 "joinInner (sqrtVal)"
503− $ joinWith S.joinInnerGeneric sqrtVal
462+ $ joinWith S.joinInner sqrtVal
504− , benchIOSrc1 "joinInner"
463+ , benchIOSrc1 "joinInnerMap"
505− $ joinMapWith S.joinInner halfVal
464+ $ joinMapWith S.joinInnerMap halfVal
506− , benchIOSrc1 "joinLeftGeneric (sqrtVal)"
465+ , benchIOSrc1 "joinLeft (sqrtVal)"
507− $ joinWith S.joinLeftGeneric sqrtVal
466+ $ joinWith S.joinLeft sqrtVal
508− , benchIOSrc1 "joinLeft "
467+ , benchIOSrc1 "joinLeftMap "
509− $ joinMapWith S.joinLeft halfVal
468+ $ joinMapWith S.joinLeftMap halfVal
510− , benchIOSrc1 "joinOuterGeneric (sqrtVal)"
469+ , benchIOSrc1 "joinOuter (sqrtVal)"
511− $ joinWith S.joinOuterGeneric sqrtVal
470+ $ joinWith S.joinOuter sqrtVal
512− , benchIOSrc1 "joinOuter"
471+ , benchIOSrc1 "joinOuterMap"
513− $ joinMapWith S.joinOuter halfVal
472+ $ joinMapWith S.joinOuterMap halfVal
514− , benchIOSrc1 "filterInStreamGenericBy (sqrtVal)"
473+ , benchIOSrc1 "intersectBy (sqrtVal)"
515− $ joinWith S.filterInStreamGenericBy sqrtVal
474+ $ joinWith S.intersectBy sqrtVal
516− , benchIOSrc1 "filterInStreamAscBy"
475+ , benchIOSrc1 "intersectBySorted"
517− $ joinMapWith (S.filterInStreamAscBy compare) halfVal
476+ $ joinMapWith (S.intersectBySorted compare) halfVal
518 ]
477 ]
519 ]
478 ]
520
479
@@ -522,7 +481,6 @@ o_n_heap_buffering value =
522
481
523 halfVal = value `div` 2
482 halfVal = value `div` 2
524 sqrtVal = round $ sqrt (fromIntegral value :: Double)
483 sqrtVal = round $ sqrt (fromIntegral value :: Double)
525−-}
526
484
527-------------------------------------------------------------------------------
485-------------------------------------------------------------------------------
528-- Main
486-- Main
@@ -531,7 +489,6 @@ o_n_heap_buffering value =
531-- In addition to gauge options, the number of elements in the stream can be
489-- In addition to gauge options, the number of elements in the stream can be
532-- passed using the --stream-size option.
490-- passed using the --stream-size option.
533--
491--
534−{-# ANN benchmarks "HLint: ignore" #-}
535benchmarks :: String -> Int -> [Benchmark]
492benchmarks :: String -> Int -> [Benchmark]
536benchmarks moduleName size =
493benchmarks moduleName size =
537 [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
494 [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
@@ -542,22 +499,19 @@ benchmarks moduleName size =
542 , o_1_space_concatFoldable size
499 , o_1_space_concatFoldable size
543#endif
500#endif
544 , o_1_space_concat size
501 , o_1_space_concat size
502+
545 , o_1_space_applicative size
503 , o_1_space_applicative size
546 , o_1_space_monad size
504 , o_1_space_monad size
505+
547 ]
506 ]
548 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
507 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
549 [
508 [
550 -- multi-stream
509 -- multi-stream
510+ o_n_space_applicative size
551− o_n_space_monad size
511+ , o_n_space_monad size
552−#ifdef USE_STREAMK
512+ , o_n_space_concat size
553− , o_n_space_merge size
554− , o_n_space_iterated size
555− , o_n_space_applicative size
556−#endif
557 ]
513 ]
558− {-
559 , bgroup (o_n_heap_prefix moduleName) $
514 , bgroup (o_n_heap_prefix moduleName) $
560 -- multi-stream
515 -- multi-stream
561 o_n_heap_buffering size
516 o_n_heap_buffering size
562− -}
563 ]
517 ]
benchmark/Streamly/Benchmark/Data/Stream/Generate.hs+46−77
@@ -6,43 +6,35 @@
6
6
7{-# LANGUAGE CPP #-}
7{-# LANGUAGE CPP #-}
8{-# LANGUAGE FlexibleContexts #-}
8{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE FlexibleInstances #-}
10{-# LANGUAGE ScopedTypeVariables #-}
9{-# LANGUAGE ScopedTypeVariables #-}
11{-# LANGUAGE RankNTypes #-}
10{-# LANGUAGE RankNTypes #-}
12
11
13−{-# OPTIONS_GHC -Wno-orphans #-}
14−#ifdef USE_PRELUDE
15−{-# OPTIONS_GHC -Wno-deprecations #-}
16−#endif
17−
18module Stream.Generate (benchmarks) where
12module Stream.Generate (benchmarks) where
19
13
20−import Control.DeepSeq (NFData(..))
21−import Data.Functor.Identity (Identity(..))
14+import Data.Functor.Identity (Identity)
22
15
23import qualified GHC.Exts as GHC
16import qualified GHC.Exts as GHC
24−import qualified Streamly.Internal.Data.Fold as Fold
17+import qualified Stream.Common as Common
25−
26#ifdef USE_PRELUDE
18#ifdef USE_PRELUDE
27−import Streamly.Prelude (MonadAsync)
28−import Stream.Common hiding (MonadAsync)
29import Streamly.Benchmark.Prelude (sourceFromFoldableM, absTimes)
19import Streamly.Benchmark.Prelude (sourceFromFoldableM, absTimes)
30import qualified Streamly.Prelude as S
20import qualified Streamly.Prelude as S
31import qualified Streamly.Internal.Data.Stream.IsStream as Stream
21import qualified Streamly.Internal.Data.Stream.IsStream as Stream
32#else
22#else
33−import Stream.Common
34−import Streamly.Internal.Data.Stream (Stream)
35import qualified Streamly.Internal.Data.Stream as Stream
23import qualified Streamly.Internal.Data.Stream as Stream
36−#ifdef USE_STREAMK
37−import System.IO.Unsafe (unsafeInterleaveIO)
38−import qualified Streamly.Internal.Data.StreamK as StreamK
39−import qualified Stream.Common as Common
40−#endif
41#endif
24#endif
25+import qualified Prelude
42
26
43−import Test.Tasty.Bench
27+import Gauge
44import Streamly.Benchmark.Common
28import Streamly.Benchmark.Common
45−import qualified Prelude
29+import Streamly.Internal.Data.Stream.Serial (SerialT)
30+#ifdef USE_PRELUDE
31+import Streamly.Prelude (MonadAsync)
32+import Stream.Common hiding (MonadAsync)
33+#else
34+import Stream.Common
35+#endif
36+
37+import System.IO.Unsafe (unsafeInterleaveIO)
46
38
47import Prelude hiding (repeat, replicate, iterate)
39import Prelude hiding (repeat, replicate, iterate)
48
40
@@ -50,36 +42,28 @@ import Prelude hiding (repeat, replicate, iterate)
50-- Generation
42-- Generation
51-------------------------------------------------------------------------------
43-------------------------------------------------------------------------------
52
44
53−#ifdef USE_PRELUDE
54−type Stream = Stream.SerialT
55−toStreamD = Stream.toStream
56−#else
57−toStreamD :: a -> a
58−toStreamD = id
59−#endif
60−
61-------------------------------------------------------------------------------
45-------------------------------------------------------------------------------
62-- fromList
46-- fromList
63-------------------------------------------------------------------------------
47-------------------------------------------------------------------------------
64
48
65{-# INLINE sourceFromList #-}
49{-# INLINE sourceFromList #-}
66−sourceFromList :: Monad m => Int -> Int -> Stream m Int
50+sourceFromList :: Monad m => Int -> Int -> SerialT m Int
67sourceFromList value n = Stream.fromList [n..n+value]
51sourceFromList value n = Stream.fromList [n..n+value]
68
52
69{-# INLINE sourceFromListM #-}
53{-# INLINE sourceFromListM #-}
70−sourceFromListM :: MonadAsync m => Int -> Int -> Stream m Int
54+sourceFromListM :: MonadAsync m => Int -> Int -> SerialT m Int
71sourceFromListM value n = fromListM (fmap return [n..n+value])
55sourceFromListM value n = fromListM (fmap return [n..n+value])
72
56
73{-# INLINE sourceIsList #-}
57{-# INLINE sourceIsList #-}
74−sourceIsList :: Int -> Int -> Stream Identity Int
58+sourceIsList :: Int -> Int -> SerialT Identity Int
75sourceIsList value n = GHC.fromList [n..n+value]
59sourceIsList value n = GHC.fromList [n..n+value]
76
60
77{-# INLINE sourceIsString #-}
61{-# INLINE sourceIsString #-}
78−sourceIsString :: Int -> Int -> Stream Identity Char
62+sourceIsString :: Int -> Int -> SerialT Identity Char
79sourceIsString value n = GHC.fromString (Prelude.replicate (n + value) 'a')
63sourceIsString value n = GHC.fromString (Prelude.replicate (n + value) 'a')
80
64
81{-# INLINE readInstance #-}
65{-# INLINE readInstance #-}
82−readInstance :: String -> Stream Identity Int
66+readInstance :: String -> SerialT Identity Int
83readInstance str =
67readInstance str =
84 let r = reads str
68 let r = reads str
85 in case r of
69 in case r of
@@ -96,11 +80,11 @@ readInstanceList str =
96 _ -> error "readInstance: no parse"
80 _ -> error "readInstance: no parse"
97
81
98{-# INLINE repeat #-}
82{-# INLINE repeat #-}
99−repeat :: Monad m => Int -> Int -> Stream m Int
83+repeat :: Monad m => Int -> Int -> SerialT m Int
100repeat count = Stream.take count . Stream.repeat
84repeat count = Stream.take count . Stream.repeat
101
85
102{-# INLINE replicate #-}
86{-# INLINE replicate #-}
103−replicate :: Monad m => Int -> Int -> Stream m Int
87+replicate :: Monad m => Int -> Int -> SerialT m Int
104replicate = Stream.replicate
88replicate = Stream.replicate
105
89
106-------------------------------------------------------------------------------
90-------------------------------------------------------------------------------
@@ -108,71 +92,71 @@ replicate = Stream.replicate
108-------------------------------------------------------------------------------
92-------------------------------------------------------------------------------
109
93
110{-# INLINE sourceIntFromTo #-}
94{-# INLINE sourceIntFromTo #-}
111−sourceIntFromTo :: Monad m => Int -> Int -> Stream m Int
95+sourceIntFromTo :: Monad m => Int -> Int -> SerialT m Int
112sourceIntFromTo value n = Stream.enumerateFromTo n (n + value)
96sourceIntFromTo value n = Stream.enumerateFromTo n (n + value)
113
97
114{-# INLINE sourceIntFromThenTo #-}
98{-# INLINE sourceIntFromThenTo #-}
115−sourceIntFromThenTo :: Monad m => Int -> Int -> Stream m Int
99+sourceIntFromThenTo :: Monad m => Int -> Int -> SerialT m Int
116sourceIntFromThenTo value n = Stream.enumerateFromThenTo n (n + 1) (n + value)
100sourceIntFromThenTo value n = Stream.enumerateFromThenTo n (n + 1) (n + value)
117
101
118{-# INLINE sourceFracFromTo #-}
102{-# INLINE sourceFracFromTo #-}
119−sourceFracFromTo :: Monad m => Int -> Int -> Stream m Double
103+sourceFracFromTo :: Monad m => Int -> Int -> SerialT m Double
120sourceFracFromTo value n =
104sourceFracFromTo value n =
121 Stream.enumerateFromTo (fromIntegral n) (fromIntegral (n + value))
105 Stream.enumerateFromTo (fromIntegral n) (fromIntegral (n + value))
122
106
123{-# INLINE sourceFracFromThenTo #-}
107{-# INLINE sourceFracFromThenTo #-}
124−sourceFracFromThenTo :: Monad m => Int -> Int -> Stream m Double
108+sourceFracFromThenTo :: Monad m => Int -> Int -> SerialT m Double
125sourceFracFromThenTo value n = Stream.enumerateFromThenTo (fromIntegral n)
109sourceFracFromThenTo value n = Stream.enumerateFromThenTo (fromIntegral n)
126 (fromIntegral n + 1.0001) (fromIntegral (n + value))
110 (fromIntegral n + 1.0001) (fromIntegral (n + value))
127
111
128{-# INLINE sourceIntegerFromStep #-}
112{-# INLINE sourceIntegerFromStep #-}
129−sourceIntegerFromStep :: Monad m => Int -> Int -> Stream m Integer
113+sourceIntegerFromStep :: Monad m => Int -> Int -> SerialT m Integer
130sourceIntegerFromStep value n =
114sourceIntegerFromStep value n =
131 Stream.take value $ Stream.enumerateFromThen (fromIntegral n) (fromIntegral n + 1)
115 Stream.take value $ Stream.enumerateFromThen (fromIntegral n) (fromIntegral n + 1)
132
116
133{-# INLINE enumerateFrom #-}
117{-# INLINE enumerateFrom #-}
134−enumerateFrom :: Monad m => Int -> Int -> Stream m Int
118+enumerateFrom :: Monad m => Int -> Int -> SerialT m Int
135enumerateFrom count = Stream.take count . Stream.enumerateFrom
119enumerateFrom count = Stream.take count . Stream.enumerateFrom
136
120
137{-# INLINE enumerateFromTo #-}
121{-# INLINE enumerateFromTo #-}
138−enumerateFromTo :: Monad m => Int -> Int -> Stream m Int
122+enumerateFromTo :: Monad m => Int -> Int -> SerialT m Int
139enumerateFromTo = sourceIntFromTo
123enumerateFromTo = sourceIntFromTo
140
124
141{-# INLINE enumerateFromThen #-}
125{-# INLINE enumerateFromThen #-}
142−enumerateFromThen :: Monad m => Int -> Int -> Stream m Int
126+enumerateFromThen :: Monad m => Int -> Int -> SerialT m Int
143enumerateFromThen count inp = Stream.take count $ Stream.enumerateFromThen inp (inp + 1)
127enumerateFromThen count inp = Stream.take count $ Stream.enumerateFromThen inp (inp + 1)
144
128
145{-# INLINE enumerateFromThenTo #-}
129{-# INLINE enumerateFromThenTo #-}
146−enumerateFromThenTo :: Monad m => Int -> Int -> Stream m Int
130+enumerateFromThenTo :: Monad m => Int -> Int -> SerialT m Int
147enumerateFromThenTo = sourceIntFromThenTo
131enumerateFromThenTo = sourceIntFromThenTo
148
132
149-- n ~ 1
133-- n ~ 1
150{-# INLINE enumerate #-}
134{-# INLINE enumerate #-}
151−enumerate :: Monad m => Int -> Int -> Stream m Int
135+enumerate :: Monad m => Int -> Int -> SerialT m Int
152enumerate count n = Stream.take (count + n) Stream.enumerate
136enumerate count n = Stream.take (count + n) Stream.enumerate
153
137
154-- n ~ 1
138-- n ~ 1
155{-# INLINE enumerateTo #-}
139{-# INLINE enumerateTo #-}
156−enumerateTo :: Monad m => Int -> Int -> Stream m Int
140+enumerateTo :: Monad m => Int -> Int -> SerialT m Int
157enumerateTo count n = Stream.enumerateTo (minBound + count + n)
141enumerateTo count n = Stream.enumerateTo (minBound + count + n)
158
142
159{-# INLINE iterate #-}
143{-# INLINE iterate #-}
160−iterate :: Monad m => Int -> Int -> Stream m Int
144+iterate :: Monad m => Int -> Int -> SerialT m Int
161iterate count = Stream.take count . Stream.iterate (+1)
145iterate count = Stream.take count . Stream.iterate (+1)
162
146
163{-# INLINE iterateM #-}
147{-# INLINE iterateM #-}
164−iterateM :: MonadAsync m => Int -> Int -> Stream m Int
148+iterateM :: MonadAsync m => Int -> Int -> SerialT m Int
165iterateM count = Stream.take count . Stream.iterateM (return . (+1)) . return
149iterateM count = Stream.take count . Stream.iterateM (return . (+1)) . return
166
150
151+#ifdef USE_PRELUDE
167{-# INLINE repeatM #-}
152{-# INLINE repeatM #-}
168−repeatM :: MonadAsync m => Int -> Int -> Stream m Int
153+repeatM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
169−repeatM count = Stream.take count . Stream.repeatM . return
154+repeatM count = S.take count . S.repeatM . return
170
155
171{-# INLINE replicateM #-}
156{-# INLINE replicateM #-}
172−replicateM :: MonadAsync m => Int -> Int -> Stream m Int
157+replicateM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
173−replicateM count = Stream.replicateM count . return
158+replicateM count = S.replicateM count . return
174
159
175−#ifdef USE_PRELUDE
176{-# INLINE fromIndices #-}
160{-# INLINE fromIndices #-}
177fromIndices :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
161fromIndices :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
178fromIndices value n = S.take value $ S.fromIndices (+ n)
162fromIndices value n = S.take value $ S.fromIndices (+ n)
@@ -182,17 +166,15 @@ fromIndicesM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
182fromIndicesM value n = S.take value $ S.fromIndicesM (return <$> (+ n))
166fromIndicesM value n = S.take value $ S.fromIndicesM (return <$> (+ n))
183#endif
167#endif
184
168
185−#ifdef USE_STREAMK
186{-# INLINE mfixUnfold #-}
169{-# INLINE mfixUnfold #-}
187−mfixUnfold :: Int -> Int -> Stream IO (Int, Int)
170+mfixUnfold :: Int -> Int -> SerialT IO (Int, Int)
188−mfixUnfold count start = toStream $ StreamK.mfix f
171+mfixUnfold count start = Stream.mfix f
189 where
172 where
190− f action = StreamK.unCross $ do
173+ f action = do
191 let incr n act = fmap ((+n) . snd) $ unsafeInterleaveIO act
174 let incr n act = fmap ((+n) . snd) $ unsafeInterleaveIO act
192− x <- StreamK.mkCross (fromStream $ Common.fromListM [incr 1 action, incr 2 action])
175+ x <- Common.fromListM [incr 1 action, incr 2 action]
193− y <- StreamK.mkCross (fromStream $ Common.sourceUnfoldr count start)
176+ y <- Common.sourceUnfoldr count start
194 return (x, y)
177 return (x, y)
195−#endif
196
178
197o_1_space_generation :: Int -> [Benchmark]
179o_1_space_generation :: Int -> [Benchmark]
198o_1_space_generation value =
180o_1_space_generation value =
@@ -210,47 +192,34 @@ o_1_space_generation value =
210 , benchIOSrc "fracFromTo" (sourceFracFromTo value)
192 , benchIOSrc "fracFromTo" (sourceFracFromTo value)
211 , benchIOSrc "fromList" (sourceFromList value)
193 , benchIOSrc "fromList" (sourceFromList value)
212 , benchIOSrc "fromListM" (sourceFromListM value)
194 , benchIOSrc "fromListM" (sourceFromListM value)
213− , benchPureSrc "IsList.fromList" (toStreamD . sourceIsList value)
195+ , benchPureSrc "IsList.fromList" (sourceIsList value)
214− , benchPureSrc "IsString.fromString" (toStreamD . sourceIsString value)
196+ , benchPureSrc "IsString.fromString" (sourceIsString value)
215 , benchIOSrc "enumerateFrom" (enumerateFrom value)
197 , benchIOSrc "enumerateFrom" (enumerateFrom value)
216 , benchIOSrc "enumerateFromTo" (enumerateFromTo value)
198 , benchIOSrc "enumerateFromTo" (enumerateFromTo value)
217 , benchIOSrc "enumerateFromThen" (enumerateFromThen value)
199 , benchIOSrc "enumerateFromThen" (enumerateFromThen value)
218 , benchIOSrc "enumerateFromThenTo" (enumerateFromThenTo value)
200 , benchIOSrc "enumerateFromThenTo" (enumerateFromThenTo value)
219 , benchIOSrc "enumerate" (enumerate value)
201 , benchIOSrc "enumerate" (enumerate value)
220 , benchIOSrc "enumerateTo" (enumerateTo value)
202 , benchIOSrc "enumerateTo" (enumerateTo value)
203+#ifdef USE_PRELUDE
221 , benchIOSrc "repeatM" (repeatM value)
204 , benchIOSrc "repeatM" (repeatM value)
222 , benchIOSrc "replicateM" (replicateM value)
205 , benchIOSrc "replicateM" (replicateM value)
223−#ifdef USE_PRELUDE
224 , benchIOSrc "fromIndices" (fromIndices value)
206 , benchIOSrc "fromIndices" (fromIndices value)
225 , benchIOSrc "fromIndicesM" (fromIndicesM value)
207 , benchIOSrc "fromIndicesM" (fromIndicesM value)
226#endif
208#endif
227
209
228 -- These essentially test cons and consM
210 -- These essentially test cons and consM
229−#ifdef USE_STREAMK
230 , benchIOSrc "fromFoldable" (sourceFromFoldable value)
211 , benchIOSrc "fromFoldable" (sourceFromFoldable value)
231− -- , benchIOSrc "fromFoldable 16" (sourceFromFoldable 16)
232−#else
233− -- , benchIOSrc "fromFoldable 16" (sourceFromFoldable 16)
234−#endif
235
212
236#ifdef USE_PRELUDE
213#ifdef USE_PRELUDE
237 , benchIOSrc "fromFoldableM" (sourceFromFoldableM value)
214 , benchIOSrc "fromFoldableM" (sourceFromFoldableM value)
238 , benchIOSrc "absTimes" $ absTimes value
215 , benchIOSrc "absTimes" $ absTimes value
239#endif
216#endif
240−#ifdef USE_STREAMK
241 , Common.benchIOSrc "mfix_10" (mfixUnfold 10)
217 , Common.benchIOSrc "mfix_10" (mfixUnfold 10)
242 , Common.benchIOSrc "mfix_100" (mfixUnfold 100)
218 , Common.benchIOSrc "mfix_100" (mfixUnfold 100)
243 , Common.benchIOSrc "mfix_1000" (mfixUnfold 1000)
219 , Common.benchIOSrc "mfix_1000" (mfixUnfold 1000)
244−#endif
245 ]
220 ]
246 ]
221 ]
247
222
248−#ifndef USE_PRELUDE
249−instance NFData a => NFData (Stream Identity a) where
250− {-# INLINE rnf #-}
251− rnf xs = runIdentity $ Stream.fold (Fold.foldl' (\_ x -> rnf x) ()) xs
252−#endif
253−
254o_n_heap_generation :: Int -> [Benchmark]
223o_n_heap_generation :: Int -> [Benchmark]
255o_n_heap_generation value =
224o_n_heap_generation value =
256 [ bgroup "buffered"
225 [ bgroup "buffered"
benchmark/Streamly/Benchmark/Data/Stream/Lift.hs+40−43
@@ -9,41 +9,31 @@
9{-# LANGUAGE ScopedTypeVariables #-}
9{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE RankNTypes #-}
10{-# LANGUAGE RankNTypes #-}
11
11
12−#ifdef USE_PRELUDE
13−{-# OPTIONS_GHC -Wno-deprecations #-}
14−#endif
15−
16module Stream.Lift (benchmarks) where
12module Stream.Lift (benchmarks) where
17
13
18import Control.DeepSeq (NFData(..))
14import Control.DeepSeq (NFData(..))
15+import Control.Monad.Trans.Class (lift)
19−import Control.Monad.State.Strict (StateT, get, put)
16+import Control.Monad.State.Strict (StateT, get, put, MonadState)
20import Data.Functor.Identity (Identity)
17import Data.Functor.Identity (Identity)
21−import Stream.Common (sourceUnfoldr, sourceUnfoldrM, benchIOSrc)
18+import Stream.Common (sourceUnfoldr, sourceUnfoldrM, benchIOSrc, drain)
22import System.Random (randomRIO)
19import System.Random (randomRIO)
23−
24−import qualified Stream.Common as Common
25−import qualified Streamly.Internal.Data.Fold as Fold
26−
27#ifdef USE_PRELUDE
20#ifdef USE_PRELUDE
21+import Streamly.Benchmark.Prelude hiding
22+ (sourceUnfoldr, sourceUnfoldrM, benchIOSrc)
28import qualified Streamly.Internal.Data.Stream.IsStream as Stream
23import qualified Streamly.Internal.Data.Stream.IsStream as Stream
29#else
24#else
30−import Streamly.Internal.Data.Stream (Stream)
25+import Streamly.Benchmark.Prelude (benchIO)
31import qualified Streamly.Internal.Data.Stream as Stream
26import qualified Streamly.Internal.Data.Stream as Stream
32−#ifdef USE_STREAMK
33−import Stream.Common (benchIO, drain)
34−import Streamly.Internal.Data.StreamK (StreamK)
35−import qualified Streamly.Internal.Data.StreamK as StreamK
36−import qualified Control.Monad.State.Strict as State
37−#endif
38#endif
27#endif
28+import qualified Streamly.Internal.Data.Fold as Fold
29+import qualified Stream.Common as Common
30+import qualified Control.Monad.State.Strict as State
39
31
40−import Test.Tasty.Bench
32+import Gauge
33+import Streamly.Internal.Data.Stream.Serial (SerialT)
41import Streamly.Benchmark.Common
34import Streamly.Benchmark.Common
42−import Prelude hiding (reverse, tail)
43
35
44−#ifdef USE_PRELUDE
36+import Prelude hiding (reverse, tail)
45−type Stream = Stream.SerialT
46−#endif
47
37
48-------------------------------------------------------------------------------
38-------------------------------------------------------------------------------
49-- Monad transformation (hoisting etc.)
39-- Monad transformation (hoisting etc.)
@@ -51,7 +41,7 @@ type Stream = Stream.SerialT
51
41
52{-# INLINE sourceUnfoldrState #-}
42{-# INLINE sourceUnfoldrState #-}
53sourceUnfoldrState :: Common.MonadAsync m =>
43sourceUnfoldrState :: Common.MonadAsync m =>
54− Int -> Int -> Stream (StateT Int m) Int
44+ Int -> Int -> SerialT (StateT Int m) Int
55sourceUnfoldrState value n = Stream.unfoldrM step n
45sourceUnfoldrState value n = Stream.unfoldrM step n
56 where
46 where
57 step cnt =
47 step cnt =
@@ -63,12 +53,12 @@ sourceUnfoldrState value n = Stream.unfoldrM step n
63 return (Just (s, cnt + 1))
53 return (Just (s, cnt + 1))
64
54
65{-# INLINE evalStateT #-}
55{-# INLINE evalStateT #-}
66−evalStateT :: Common.MonadAsync m => Int -> Int -> Stream m Int
56+evalStateT :: Common.MonadAsync m => Int -> Int -> SerialT m Int
67evalStateT value n =
57evalStateT value n =
68 Stream.evalStateT (return 0) (sourceUnfoldrState value n)
58 Stream.evalStateT (return 0) (sourceUnfoldrState value n)
69
59
70{-# INLINE withState #-}
60{-# INLINE withState #-}
71−withState :: Common.MonadAsync m => Int -> Int -> Stream m Int
61+withState :: Common.MonadAsync m => Int -> Int -> SerialT m Int
72withState value n =
62withState value n =
73 Stream.evalStateT
63 Stream.evalStateT
74 (return (0 :: Int)) (Stream.liftInner (sourceUnfoldrM value n))
64 (return (0 :: Int)) (Stream.liftInner (sourceUnfoldrM value n))
@@ -76,7 +66,7 @@ withState value n =
76{-# INLINE benchHoistSink #-}
66{-# INLINE benchHoistSink #-}
77benchHoistSink
67benchHoistSink
78 :: (NFData b)
68 :: (NFData b)
79− => Int -> String -> (Stream Identity Int -> IO b) -> Benchmark
69+ => Int -> String -> (SerialT Identity Int -> IO b) -> Benchmark
80benchHoistSink value name f =
70benchHoistSink value name f =
81 bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldr value
71 bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldr value
82
72
@@ -85,15 +75,11 @@ o_1_space_hoisting value =
85 [ bgroup "hoisting"
75 [ bgroup "hoisting"
86 [ benchIOSrc "evalState" (evalStateT value)
76 [ benchIOSrc "evalState" (evalStateT value)
87 , benchIOSrc "withState" (withState value)
77 , benchIOSrc "withState" (withState value)
88−#ifndef USE_PRELUDE
89− , benchHoistSink value "generalizeInner"
78+ , benchHoistSink value "generally"
90− ((\xs -> Stream.fold Fold.length xs :: IO Int)
79+ ((\xs -> Stream.fold Fold.length xs :: IO Int) . Stream.generally)
91− . Stream.generalizeInner)
92−#endif
93 ]
80 ]
94 ]
81 ]
95
82
96−#ifdef USE_STREAMK
97{-# INLINE iterateStateIO #-}
83{-# INLINE iterateStateIO #-}
98iterateStateIO ::
84iterateStateIO ::
99 Monad m
85 Monad m
@@ -107,28 +93,41 @@ iterateStateIO n = do
107 iterateStateIO n
93 iterateStateIO n
108 else return x
94 else return x
109
95
110−-- XXX This is basically testing the perf of concatEffect, change it to just
111−-- use concatEffect and move it along with other concatMap benchmarks.
112{-# INLINE iterateStateT #-}
96{-# INLINE iterateStateT #-}
113−iterateStateT :: Int -> StreamK (StateT Int IO) Int
97+iterateStateT :: Int -> SerialT (StateT Int IO) Int
114−iterateStateT n = StreamK.concatEffect $ do
98+iterateStateT n = do
99+ x <- lift get
100+ if x > n
101+ then do
102+ lift $ put (x - 1)
103+ iterateStateT n
104+ else return x
105+
106+{-# INLINE iterateState #-}
107+{-# SPECIALIZE iterateState :: Int -> SerialT (StateT Int IO) Int #-}
108+iterateState ::
109+ MonadState Int m
110+ => Int
111+ -> SerialT m Int
112+iterateState n = do
115 x <- get
113 x <- get
116 if x > n
114 if x > n
117 then do
115 then do
118 put (x - 1)
116 put (x - 1)
119− return $ iterateStateT n
117+ iterateState n
120− else return $ StreamK.fromPure x
118+ else return x
121
119
122o_n_heap_transformer :: Int -> [Benchmark]
120o_n_heap_transformer :: Int -> [Benchmark]
123o_n_heap_transformer value =
121o_n_heap_transformer value =
124 [ bgroup "transformer"
122 [ bgroup "transformer"
125 [ benchIO "StateT Int IO (n times) (baseline)" $ \n ->
123 [ benchIO "StateT Int IO (n times) (baseline)" $ \n ->
126 State.evalStateT (iterateStateIO n) value
124 State.evalStateT (iterateStateIO n) value
127− , benchIO "Stream (StateT Int IO) (n times)" $ \n ->
125+ , benchIO "SerialT (StateT Int IO) (n times)" $ \n ->
128− State.evalStateT (drain $ Common.toStream (iterateStateT n)) value
126+ State.evalStateT (drain (iterateStateT n)) value
127+ , benchIO "MonadState Int m => SerialT m Int" $ \n ->
128+ State.evalStateT (drain (iterateState n)) value
129 ]
129 ]
130 ]
130 ]
131−#endif
132
131
133-------------------------------------------------------------------------------
132-------------------------------------------------------------------------------
134-- Main
133-- Main
@@ -140,7 +139,5 @@ o_n_heap_transformer value =
140benchmarks :: String -> Int -> [Benchmark]
139benchmarks :: String -> Int -> [Benchmark]
141benchmarks moduleName size =
140benchmarks moduleName size =
142 [ bgroup (o_1_space_prefix moduleName) (o_1_space_hoisting size)
141 [ bgroup (o_1_space_prefix moduleName) (o_1_space_hoisting size)
143−#ifdef USE_STREAMK
144 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_transformer size)
142 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_transformer size)
145−#endif
146 ]
143 ]
benchmark/Streamly/Benchmark/Data/Stream/Reduce.hs+156−205
@@ -11,150 +11,147 @@
11{-# LANGUAGE DeriveGeneric #-}
11{-# LANGUAGE DeriveGeneric #-}
12{-# LANGUAGE RankNTypes #-}
12{-# LANGUAGE RankNTypes #-}
13
13
14−#ifdef USE_PRELUDE
15−{-# OPTIONS_GHC -Wno-deprecations #-}
16−#endif
17−
18module Stream.Reduce (benchmarks) where
14module Stream.Reduce (benchmarks) where
19
15
20import Control.DeepSeq (NFData(..))
16import Control.DeepSeq (NFData(..))
21import Control.Monad.IO.Class (MonadIO(..))
17import Control.Monad.IO.Class (MonadIO(..))
22import Data.Monoid (Sum(..))
18import Data.Monoid (Sum(..))
23import GHC.Generics (Generic)
19import GHC.Generics (Generic)
20+import Streamly.Internal.Data.IsMap.HashMap ()
21+import Streamly.Internal.Data.Stream.Serial (SerialT)
24
22
25import qualified Streamly.Internal.Data.Refold.Type as Refold
23import qualified Streamly.Internal.Data.Refold.Type as Refold
26import qualified Streamly.Internal.Data.Fold as FL
24import qualified Streamly.Internal.Data.Fold as FL
27import qualified Stream.Common as Common
25import qualified Stream.Common as Common
28−
29−#ifndef USE_STREAMLY_CORE
30−import Data.HashMap.Strict (HashMap)
31−import Data.Proxy (Proxy(..))
32−import Streamly.Internal.Data.IsMap.HashMap ()
33−#endif
34−
35#ifdef USE_PRELUDE
26#ifdef USE_PRELUDE
36import Control.Monad (when)
27import Control.Monad (when)
28+import Data.Proxy (Proxy(..))
29+import Data.HashMap.Strict (HashMap)
37import qualified Streamly.Internal.Data.Stream.IsStream as S
30import qualified Streamly.Internal.Data.Stream.IsStream as S
38−import qualified Streamly.Prelude as S
39import Streamly.Prelude (fromSerial)
31import Streamly.Prelude (fromSerial)
40import Streamly.Benchmark.Prelude hiding
32import Streamly.Benchmark.Prelude hiding
41− ( benchIO, benchIOSrc, sourceUnfoldrM, apDiscardFst, apDiscardSnd, apLiftA2
33+ ( benchIOSrc, sourceUnfoldrM, apDiscardFst, apDiscardSnd, apLiftA2
42 , toNullAp, monadThen, toNullM, toNullM3, filterAllInM, filterAllOutM
34 , toNullAp, monadThen, toNullM, toNullM3, filterAllInM, filterAllOutM
43 , filterSome, breakAfterSome, toListM, toListSome, transformMapM
35 , filterSome, breakAfterSome, toListM, toListSome, transformMapM
44 , transformComposeMapM, transformTeeMapM, transformZipMapM)
36 , transformComposeMapM, transformTeeMapM, transformZipMapM)
45#else
37#else
46−
38+import Streamly.Benchmark.Prelude (benchIO)
47−import Streamly.Internal.Data.Stream (Stream)
48import qualified Streamly.Internal.Data.Stream as S
39import qualified Streamly.Internal.Data.Stream as S
49−#ifndef USE_STREAMLY_CORE
50−import qualified Streamly.Data.Stream.Prelude as S
51−import qualified Streamly.Internal.Data.Stream.Prelude as S
52−#endif
53−
54−#ifdef USE_STREAMK
55−import Streamly.Internal.Data.StreamK (StreamK)
56−import qualified Streamly.Internal.Data.Parser as PR
57−import qualified Streamly.Internal.Data.StreamK as K
58−#else
59−import qualified Streamly.Internal.Data.Stream as K
60−#endif
61−
62#endif
40#endif
63
41
64−import Test.Tasty.Bench
42+import Gauge
65import Streamly.Benchmark.Common
43import Streamly.Benchmark.Common
66import Stream.Common
44import Stream.Common
67import Prelude hiding (reverse, tail)
45import Prelude hiding (reverse, tail)
68
46
69−#ifdef USE_PRELUDE
47+-------------------------------------------------------------------------------
70−type Stream = S.SerialT
48+-- Iteration/looping utilities
71−#endif
49+-------------------------------------------------------------------------------
72
50
51+{-# INLINE iterateN #-}
52+iterateN :: (Int -> a -> a) -> a -> Int -> a
53+iterateN g initial count = f count initial
54+
55+ where
56+
57+ f (0 :: Int) x = x
58+ f i x = f (i - 1) (g i x)
59+
73−-- Apply transformation g count times on a stream of length len
60+-- Iterate a transformation over a singleton stream
74−#ifdef USE_STREAMK
61+{-# INLINE iterateSingleton #-}
75−{-# INLINE iterateSource #-}
62+iterateSingleton :: Monad m
76−iterateSource ::
63+ => (Int -> SerialT m Int -> SerialT m Int)
77− MonadAsync m
78− => (StreamK m Int -> StreamK m Int)
79− -> Int
80 -> Int
64 -> Int
81 -> Int
65 -> Int
82− -> StreamK m Int
66+ -> SerialT m Int
83−iterateSource g count len n = f count (fromStream $ sourceUnfoldrM len n)
67+iterateSingleton g count n = iterateN g (return n) count
84
68
85− where
69+{-
70+-- XXX need to check why this is slower than the explicit recursion above, even
71+-- if the above code is written in a foldr like head recursive way. We also
72+-- need to try this with foldlM' once #150 is fixed.
73+-- However, it is perhaps best to keep the iteration benchmarks independent of
74+-- foldrM and any related fusion issues.
75+{-# INLINE _iterateSingleton #-}
76+_iterateSingleton ::
77+ Monad m
78+ => (Int -> SerialT m Int -> SerialT m Int)
79+ -> Int
80+ -> Int
81+ -> SerialT m Int
82+_iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
83+-}
86
84
87− f (0 :: Int) stream = stream
85+-- Apply transformation g count times on a stream of length len
88− f i stream = f (i - 1) (g stream)
89−#else
90{-# INLINE iterateSource #-}
86{-# INLINE iterateSource #-}
91iterateSource ::
87iterateSource ::
92 MonadAsync m
88 MonadAsync m
93− => (Stream m Int -> Stream m Int)
89+ => (SerialT m Int -> SerialT m Int)
94 -> Int
90 -> Int
95 -> Int
91 -> Int
96 -> Int
92 -> Int
97− -> Stream m Int
93+ -> SerialT m Int
98iterateSource g count len n = f count (sourceUnfoldrM len n)
94iterateSource g count len n = f count (sourceUnfoldrM len n)
99
95
100 where
96 where
101
97
102 f (0 :: Int) stream = stream
98 f (0 :: Int) stream = stream
103 f i stream = f (i - 1) (g stream)
99 f i stream = f (i - 1) (g stream)
104−#endif
105
100
106-------------------------------------------------------------------------------
101-------------------------------------------------------------------------------
107−-- Grouping transformations
102+-- Functor
108-------------------------------------------------------------------------------
103-------------------------------------------------------------------------------
109
104
110−{-# INLINE groups #-}
105+o_n_space_functor :: Int -> [Benchmark]
111−groups :: MonadIO m => Stream m Int -> m ()
106+o_n_space_functor value =
112−groups =
107+ [ bgroup "Functor"
113−#ifdef USE_PRELUDE
108+ [ benchIO "(+) (n times) (baseline)" $ \i0 ->
114− Common.drain . S.groups FL.drain
109+ iterateN (\i acc -> acc >>= \n -> return $ i + n) (return i0) value
115−#else
110+ , benchIOSrc "(<$) (n times)" $
116− Common.drain . S.groupsWhile (==) FL.drain
111+ iterateSingleton (<$) value
117−#endif
112+ , benchIOSrc "fmap (n times)" $
113+ iterateSingleton (fmap . (+)) value
114+ {-
115+ , benchIOSrc fromSerial "_(<$) (n times)" $
116+ _iterateSingleton (<$) value
117+ , benchIOSrc fromSerial "_fmap (n times)" $
118+ _iterateSingleton (fmap . (+)) value
119+ -}
120+ ]
121+ ]
118
122
119−{-# INLINE groupsWhileLT #-}
123+-------------------------------------------------------------------------------
120−groupsWhileLT :: MonadIO m => Stream m Int -> m ()
124+-- Grouping transformations
121−groupsWhileLT =
125+-------------------------------------------------------------------------------
122−#ifdef USE_PRELUDE
123− Common.drain . S.groupsBy (>) FL.drain
124−#else
125− Common.drain . S.groupsWhile (<) FL.drain
126−#endif
127
126
128−{-# INLINE groupsWhileEq #-}
129−groupsWhileEq :: MonadIO m => Stream m Int -> m ()
130−groupsWhileEq =
131#ifdef USE_PRELUDE
127#ifdef USE_PRELUDE
132− Common.drain . S.groupsBy (==) FL.drain
128+{-# INLINE groups #-}
133−#else
129+groups :: MonadIO m => SerialT m Int -> m ()
134− Common.drain . S.groupsWhile (==) FL.drain
130+groups = Common.drain . S.groups FL.drain
135−#endif
136
131
132+-- XXX Change this test when the order of comparison is later changed
133+{-# INLINE groupsByGT #-}
134+groupsByGT :: MonadIO m => SerialT m Int -> m ()
135+groupsByGT = Common.drain . S.groupsBy (>) FL.drain
137
136
137+{-# INLINE groupsByEq #-}
138+groupsByEq :: MonadIO m => SerialT m Int -> m ()
139+groupsByEq = Common.drain . S.groupsBy (==) FL.drain
140+
141+-- XXX Change this test when the order of comparison is later changed
138{-# INLINE groupsByRollingLT #-}
142{-# INLINE groupsByRollingLT #-}
139−groupsByRollingLT :: MonadIO m => Stream m Int -> m ()
143+groupsByRollingLT :: MonadIO m => SerialT m Int -> m ()
140groupsByRollingLT =
144groupsByRollingLT =
141−#ifdef USE_PRELUDE
142 Common.drain . S.groupsByRolling (<) FL.drain
145 Common.drain . S.groupsByRolling (<) FL.drain
143−#else
144− Common.drain . S.groupsRollingBy (<) FL.drain
145−#endif
146
146
147{-# INLINE groupsByRollingEq #-}
147{-# INLINE groupsByRollingEq #-}
148−groupsByRollingEq :: MonadIO m => Stream m Int -> m ()
148+groupsByRollingEq :: MonadIO m => SerialT m Int -> m ()
149groupsByRollingEq =
149groupsByRollingEq =
150−#ifdef USE_PRELUDE
151 Common.drain . S.groupsByRolling (==) FL.drain
150 Common.drain . S.groupsByRolling (==) FL.drain
152−#else
153− Common.drain . S.groupsRollingBy (==) FL.drain
154#endif
151#endif
155
152
156{-# INLINE foldMany #-}
153{-# INLINE foldMany #-}
157−foldMany :: Monad m => Stream m Int -> m ()
154+foldMany :: Monad m => SerialT m Int -> m ()
158foldMany =
155foldMany =
159 Common.drain
156 Common.drain
160 . fmap getSum
157 . fmap getSum
@@ -162,7 +159,7 @@ foldMany =
162 . fmap Sum
159 . fmap Sum
163
160
164{-# INLINE foldManyPost #-}
161{-# INLINE foldManyPost #-}
165−foldManyPost :: Monad m => Stream m Int -> m ()
162+foldManyPost :: Monad m => SerialT m Int -> m ()
166foldManyPost =
163foldManyPost =
167 Common.drain
164 Common.drain
168 . fmap getSum
165 . fmap getSum
@@ -170,7 +167,7 @@ foldManyPost =
170 . fmap Sum
167 . fmap Sum
171
168
172{-# INLINE refoldMany #-}
169{-# INLINE refoldMany #-}
173−refoldMany :: Monad m => Stream m Int -> m ()
170+refoldMany :: Monad m => SerialT m Int -> m ()
174refoldMany =
171refoldMany =
175 Common.drain
172 Common.drain
176 . fmap getSum
173 . fmap getSum
@@ -178,7 +175,7 @@ refoldMany =
178 . fmap Sum
175 . fmap Sum
179
176
180{-# INLINE foldIterateM #-}
177{-# INLINE foldIterateM #-}
181−foldIterateM :: Monad m => Stream m Int -> m ()
178+foldIterateM :: Monad m => SerialT m Int -> m ()
182foldIterateM =
179foldIterateM =
183 Common.drain
180 Common.drain
184 . fmap getSum
181 . fmap getSum
@@ -187,7 +184,7 @@ foldIterateM =
187 . fmap Sum
184 . fmap Sum
188
185
189{-# INLINE refoldIterateM #-}
186{-# INLINE refoldIterateM #-}
190−refoldIterateM :: Monad m => Stream m Int -> m ()
187+refoldIterateM :: Monad m => SerialT m Int -> m ()
191refoldIterateM =
188refoldIterateM =
192 Common.drain
189 Common.drain
193 . fmap getSum
190 . fmap getSum
@@ -195,84 +192,52 @@ refoldIterateM =
195 (Refold.take 2 Refold.sconcat) (return (Sum 0))
192 (Refold.take 2 Refold.sconcat) (return (Sum 0))
196 . fmap Sum
193 . fmap Sum
197
194
198−#ifdef USE_STREAMK
199−{-# INLINE parseBreak #-}
200−parseBreak :: Monad m => StreamK m Int -> m ()
201−parseBreak s = do
202− r <- K.parseDBreak PR.one s
203− case r of
204− (Left _, _) -> return ()
205− (Right _, s1) -> parseBreak s1
206−#endif
207−
208o_1_space_grouping :: Int -> [Benchmark]
195o_1_space_grouping :: Int -> [Benchmark]
209o_1_space_grouping value =
196o_1_space_grouping value =
210 -- Buffering operations using heap proportional to group/window sizes.
197 -- Buffering operations using heap proportional to group/window sizes.
211 [ bgroup "grouping"
198 [ bgroup "grouping"
212 [
199 [
200+#ifdef USE_PRELUDE
213 benchIOSink value "groups" groups
201 benchIOSink value "groups" groups
214− , benchIOSink value "groupsWhileLT" groupsWhileLT
202+ , benchIOSink value "groupsByGT" groupsByGT
215− , benchIOSink value "groupsWhileEq" groupsWhileEq
203+ , benchIOSink value "groupsByEq" groupsByEq
216 , benchIOSink value "groupsByRollingLT" groupsByRollingLT
204 , benchIOSink value "groupsByRollingLT" groupsByRollingLT
217 , benchIOSink value "groupsByRollingEq" groupsByRollingEq
205 , benchIOSink value "groupsByRollingEq" groupsByRollingEq
218 ,
206 ,
219−
207+#endif
220 -- XXX parseMany/parseIterate benchmarks are in the Parser/ParserD
208 -- XXX parseMany/parseIterate benchmarks are in the Parser/ParserD
221− -- modules we can bring those here. chunksOf benchmarks are in
209+ -- modules we can bring those here. arraysOf benchmarks are in
222 -- Parser/ParserD/Array.Stream/FileSystem.Handle.
210 -- Parser/ParserD/Array.Stream/FileSystem.Handle.
223 benchIOSink value "foldMany" foldMany
211 benchIOSink value "foldMany" foldMany
224 , benchIOSink value "foldManyPost" foldManyPost
212 , benchIOSink value "foldManyPost" foldManyPost
225 , benchIOSink value "refoldMany" refoldMany
213 , benchIOSink value "refoldMany" refoldMany
226 , benchIOSink value "foldIterateM" foldIterateM
214 , benchIOSink value "foldIterateM" foldIterateM
227 , benchIOSink value "refoldIterateM" refoldIterateM
215 , benchIOSink value "refoldIterateM" refoldIterateM
228−#ifdef USE_STREAMK
229− , benchIOSink value "parseBreak (recursive)" (parseBreak . fromStream)
230−#endif
231−
232−#ifndef USE_STREAMLY_CORE
233− , benchIOSink value "classifySessionsOf (10000 buckets)"
234− (classifySessionsOf (getKey 10000))
235− , benchIOSink value "classifySessionsOf (64 buckets)"
236− (classifySessionsOf (getKey 64))
237− , benchIOSink value "classifySessionsOfHash (10000 buckets)"
238− (classifySessionsOfHash (getKey 10000))
239− , benchIOSink value "classifySessionsOfHash (64 buckets)"
240− (classifySessionsOfHash (getKey 64))
241−#endif
242 ]
216 ]
243 ]
217 ]
244
218
245−#ifndef USE_STREAMLY_CORE
246− where
247−
248− getKey :: Int -> Int -> Int
249− getKey n = (`mod` n)
250−#endif
251−
252-------------------------------------------------------------------------------
219-------------------------------------------------------------------------------
253-- Size conserving transformations (reordering, buffering, etc.)
220-- Size conserving transformations (reordering, buffering, etc.)
254-------------------------------------------------------------------------------
221-------------------------------------------------------------------------------
255
222
256−#ifndef USE_PRELUDE
257{-# INLINE reverse #-}
223{-# INLINE reverse #-}
258−reverse :: MonadIO m => Int -> Stream m Int -> m ()
224+reverse :: MonadIO m => Int -> SerialT m Int -> m ()
259−reverse n = composeN n (toStream . K.reverse . fromStream)
225+reverse n = composeN n S.reverse
260
226
261{-# INLINE reverse' #-}
227{-# INLINE reverse' #-}
262−reverse' :: MonadIO m => Int -> Stream m Int -> m ()
228+reverse' :: MonadIO m => Int -> SerialT m Int -> m ()
263−reverse' n = composeN n S.reverseUnbox
229+reverse' n = composeN n S.reverse'
264−#endif
265
230
266o_n_heap_buffering :: Int -> [Benchmark]
231o_n_heap_buffering :: Int -> [Benchmark]
267o_n_heap_buffering value =
232o_n_heap_buffering value =
268 [ bgroup "buffered"
233 [ bgroup "buffered"
269 [
234 [
270−#ifndef USE_PRELUDE
271 -- Reversing a stream
235 -- Reversing a stream
272 benchIOSink value "reverse" (reverse 1)
236 benchIOSink value "reverse" (reverse 1)
273 , benchIOSink value "reverse'" (reverse' 1)
237 , benchIOSink value "reverse'" (reverse' 1)
274−#else
238+
239+#ifdef USE_PRELUDE
275− benchIOSink value "mkAsync" (mkAsync fromSerial)
240+ , benchIOSink value "mkAsync" (mkAsync fromSerial)
276#endif
241#endif
277 ]
242 ]
278 ]
243 ]
@@ -281,9 +246,9 @@ o_n_heap_buffering value =
281-- Grouping/Splitting
246-- Grouping/Splitting
282-------------------------------------------------------------------------------
247-------------------------------------------------------------------------------
283
248
284−#ifndef USE_STREAMLY_CORE
249+#ifdef USE_PRELUDE
285{-# INLINE classifySessionsOf #-}
250{-# INLINE classifySessionsOf #-}
286−classifySessionsOf :: S.MonadAsync m => (Int -> Int) -> Stream m Int -> m ()
251+classifySessionsOf :: MonadAsync m => (Int -> Int) -> SerialT m Int -> m ()
287classifySessionsOf getKey =
252classifySessionsOf getKey =
288 Common.drain
253 Common.drain
289 . S.classifySessionsOf
254 . S.classifySessionsOf
@@ -292,8 +257,8 @@ classifySessionsOf getKey =
292 . fmap (\x -> (getKey x, x))
257 . fmap (\x -> (getKey x, x))
293
258
294{-# INLINE classifySessionsOfHash #-}
259{-# INLINE classifySessionsOfHash #-}
295−classifySessionsOfHash :: S.MonadAsync m =>
260+classifySessionsOfHash :: MonadAsync m =>
296− (Int -> Int) -> Stream m Int -> m ()
261+ (Int -> Int) -> SerialT m Int -> m ()
297classifySessionsOfHash getKey =
262classifySessionsOfHash getKey =
298 Common.drain
263 Common.drain
299 . S.classifySessionsByGeneric
264 . S.classifySessionsByGeneric
@@ -301,6 +266,25 @@ classifySessionsOfHash getKey =
301 1 False (const (return False)) 3 (FL.take 10 FL.sum)
266 1 False (const (return False)) 3 (FL.take 10 FL.sum)
302 . S.timestamped
267 . S.timestamped
303 . fmap (\x -> (getKey x, x))
268 . fmap (\x -> (getKey x, x))
269+
270+o_n_space_grouping :: Int -> [Benchmark]
271+o_n_space_grouping value =
272+ -- Buffering operations using heap proportional to group/window sizes.
273+ [ bgroup "grouping"
274+ [ benchIOSink value "classifySessionsOf (10000 buckets)"
275+ (classifySessionsOf (getKey 10000))
276+ , benchIOSink value "classifySessionsOf (64 buckets)"
277+ (classifySessionsOf (getKey 64))
278+ , benchIOSink value "classifySessionsOfHash (10000 buckets)"
279+ (classifySessionsOfHash (getKey 10000))
280+ , benchIOSink value "classifySessionsOfHash (64 buckets)"
281+ (classifySessionsOfHash (getKey 64))
282+ ]
283+ ]
284+
285+ where
286+
287+ getKey n = (`mod` n)
304#endif
288#endif
305
289
306-------------------------------------------------------------------------------
290-------------------------------------------------------------------------------
@@ -308,49 +292,49 @@ classifySessionsOfHash getKey =
308-------------------------------------------------------------------------------
292-------------------------------------------------------------------------------
309
293
310{-# INLINE scanMap #-}
294{-# INLINE scanMap #-}
311−scanMap :: MonadIO m => Int -> Stream m Int -> m ()
295+scanMap :: MonadIO m => Int -> SerialT m Int -> m ()
312scanMap n = composeN n $ fmap (subtract 1) . Common.scanl' (+) 0
296scanMap n = composeN n $ fmap (subtract 1) . Common.scanl' (+) 0
313
297
314{-# INLINE dropMap #-}
298{-# INLINE dropMap #-}
315−dropMap :: MonadIO m => Int -> Stream m Int -> m ()
299+dropMap :: MonadIO m => Int -> SerialT m Int -> m ()
316dropMap n = composeN n $ fmap (subtract 1) . S.drop 1
300dropMap n = composeN n $ fmap (subtract 1) . S.drop 1
317
301
318{-# INLINE dropScan #-}
302{-# INLINE dropScan #-}
319−dropScan :: MonadIO m => Int -> Stream m Int -> m ()
303+dropScan :: MonadIO m => Int -> SerialT m Int -> m ()
320dropScan n = composeN n $ Common.scanl' (+) 0 . S.drop 1
304dropScan n = composeN n $ Common.scanl' (+) 0 . S.drop 1
321
305
322{-# INLINE takeDrop #-}
306{-# INLINE takeDrop #-}
323−takeDrop :: MonadIO m => Int -> Int -> Stream m Int -> m ()
307+takeDrop :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
324takeDrop value n = composeN n $ S.drop 1 . S.take (value + 1)
308takeDrop value n = composeN n $ S.drop 1 . S.take (value + 1)
325
309
326{-# INLINE takeScan #-}
310{-# INLINE takeScan #-}
327−takeScan :: MonadIO m => Int -> Int -> Stream m Int -> m ()
311+takeScan :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
328takeScan value n = composeN n $ Common.scanl' (+) 0 . S.take (value + 1)
312takeScan value n = composeN n $ Common.scanl' (+) 0 . S.take (value + 1)
329
313
330{-# INLINE takeMap #-}
314{-# INLINE takeMap #-}
331−takeMap :: MonadIO m => Int -> Int -> Stream m Int -> m ()
315+takeMap :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
332takeMap value n = composeN n $ fmap (subtract 1) . S.take (value + 1)
316takeMap value n = composeN n $ fmap (subtract 1) . S.take (value + 1)
333
317
334{-# INLINE filterDrop #-}
318{-# INLINE filterDrop #-}
335−filterDrop :: MonadIO m => Int -> Int -> Stream m Int -> m ()
319+filterDrop :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
336filterDrop value n = composeN n $ S.drop 1 . S.filter (<= (value + 1))
320filterDrop value n = composeN n $ S.drop 1 . S.filter (<= (value + 1))
337
321
338{-# INLINE filterTake #-}
322{-# INLINE filterTake #-}
339−filterTake :: MonadIO m => Int -> Int -> Stream m Int -> m ()
323+filterTake :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
340filterTake value n = composeN n $ S.take (value + 1) . S.filter (<= (value + 1))
324filterTake value n = composeN n $ S.take (value + 1) . S.filter (<= (value + 1))
341
325
342{-# INLINE filterScan #-}
326{-# INLINE filterScan #-}
343−filterScan :: MonadIO m => Int -> Stream m Int -> m ()
327+filterScan :: MonadIO m => Int -> SerialT m Int -> m ()
344filterScan n = composeN n $ Common.scanl' (+) 0 . S.filter (<= maxBound)
328filterScan n = composeN n $ Common.scanl' (+) 0 . S.filter (<= maxBound)
345
329
346#ifdef USE_PRELUDE
330#ifdef USE_PRELUDE
347{-# INLINE filterScanl1 #-}
331{-# INLINE filterScanl1 #-}
348−filterScanl1 :: MonadIO m => Int -> Stream m Int -> m ()
332+filterScanl1 :: MonadIO m => Int -> SerialT m Int -> m ()
349filterScanl1 n = composeN n $ S.scanl1' (+) . S.filter (<= maxBound)
333filterScanl1 n = composeN n $ S.scanl1' (+) . S.filter (<= maxBound)
350#endif
334#endif
351
335
352{-# INLINE filterMap #-}
336{-# INLINE filterMap #-}
353−filterMap :: MonadIO m => Int -> Int -> Stream m Int -> m ()
337+filterMap :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
354filterMap value n = composeN n $ fmap (subtract 1) . S.filter (<= (value + 1))
338filterMap value n = composeN n $ fmap (subtract 1) . S.filter (<= (value + 1))
355
339
356-------------------------------------------------------------------------------
340-------------------------------------------------------------------------------
@@ -362,18 +346,17 @@ data Pair a b =
362 deriving (Generic, NFData)
346 deriving (Generic, NFData)
363
347
364{-# INLINE sumProductFold #-}
348{-# INLINE sumProductFold #-}
365−sumProductFold :: Monad m => Stream m Int -> m (Pair Int Int)
349+sumProductFold :: Monad m => SerialT m Int -> m (Int, Int)
366−sumProductFold =
367− Common.foldl' (\(Pair s p) x -> Pair (s + x) (p * x)) (Pair 0 1)
350+sumProductFold = Common.foldl' (\(s, p) x -> (s + x, p * x)) (0, 1)
368
351
369{-# INLINE sumProductScan #-}
352{-# INLINE sumProductScan #-}
370−sumProductScan :: Monad m => Stream m Int -> m (Pair Int Int)
353+sumProductScan :: Monad m => SerialT m Int -> m (Pair Int Int)
371sumProductScan =
354sumProductScan =
372 Common.foldl' (\(Pair _ p) (s0, x) -> Pair s0 (p * x)) (Pair 0 1) .
355 Common.foldl' (\(Pair _ p) (s0, x) -> Pair s0 (p * x)) (Pair 0 1) .
373 Common.scanl' (\(s, _) x -> (s + x, x)) (0, 0)
356 Common.scanl' (\(s, _) x -> (s + x, x)) (0, 0)
374
357
375{-# INLINE foldl'ReduceMap #-}
358{-# INLINE foldl'ReduceMap #-}
376−foldl'ReduceMap :: Monad m => Stream m Int -> m Int
359+foldl'ReduceMap :: Monad m => SerialT m Int -> m Int
377foldl'ReduceMap = fmap (+ 1) . Common.foldl' (+) 0
360foldl'ReduceMap = fmap (+ 1) . Common.foldl' (+) 0
378
361
379o_1_space_transformations_mixed :: Int -> [Benchmark]
362o_1_space_transformations_mixed :: Int -> [Benchmark]
@@ -412,87 +395,51 @@ o_1_space_transformations_mixedX4 value =
412-- Iterating a transformation over and over again
395-- Iterating a transformation over and over again
413-------------------------------------------------------------------------------
396-------------------------------------------------------------------------------
414
397
415−#ifdef USE_STREAMK
416−{-
417-- this is quadratic
398-- this is quadratic
418{-# INLINE iterateScan #-}
399{-# INLINE iterateScan #-}
419−iterateScan :: MonadAsync m => Int -> Int -> Int -> Stream m Int
400+iterateScan :: MonadAsync m => Int -> Int -> Int -> SerialT m Int
420−iterateScan count len = toStream . iterateSource (K.scanl' (+) 0) count len
421−-}
422−
423−{-# INLINE iterateMapM #-}
424−iterateMapM :: MonadAsync m => Int -> Int -> Int -> Stream m Int
425−iterateMapM count len = toStream . iterateSource (K.mapM return) count len
426−
427−{-# INLINE iterateFilterEven #-}
428−iterateFilterEven :: MonadAsync m => Int -> Int -> Int -> Stream m Int
429−iterateFilterEven count len =
430− toStream . iterateSource (K.filter even) count len
431−
432−{-# INLINE iterateTakeAll #-}
433−iterateTakeAll :: MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
434−iterateTakeAll value count len =
435− toStream . iterateSource (K.take (value + 1)) count len
436−
437−{-# INLINE iterateDropOne #-}
438−iterateDropOne :: MonadAsync m => Int -> Int -> Int -> Stream m Int
439−iterateDropOne count len = toStream . iterateSource (K.drop 1) count len
440−
441−{-# INLINE iterateDropWhileTrue #-}
442−iterateDropWhileTrue :: MonadAsync m
443− => Int -> Int -> Int -> Int -> Stream m Int
444−iterateDropWhileTrue value count len =
445− toStream . iterateSource (K.dropWhile (<= (value + 1))) count len
446−
447−{-# INLINE iterateDropWhileFalse #-}
448−iterateDropWhileFalse :: MonadAsync m
449− => Int -> Int -> Int -> Int -> Stream m Int
450−iterateDropWhileFalse value count len =
451− toStream . iterateSource (K.dropWhile (> (value + 1))) count len
452−
453−#else
454−
455−-- this is quadratic
456−{-# INLINE iterateScan #-}
457−iterateScan :: MonadAsync m => Int -> Int -> Int -> Stream m Int
458iterateScan = iterateSource (Common.scanl' (+) 0)
401iterateScan = iterateSource (Common.scanl' (+) 0)
459
402
460#ifdef USE_PRELUDE
403#ifdef USE_PRELUDE
461-- this is quadratic
404-- this is quadratic
462{-# INLINE iterateScanl1 #-}
405{-# INLINE iterateScanl1 #-}
463−iterateScanl1 :: MonadAsync m => Int -> Int -> Int -> Stream m Int
406+iterateScanl1 :: MonadAsync m => Int -> Int -> Int -> SerialT m Int
464iterateScanl1 = iterateSource (S.scanl1' (+))
407iterateScanl1 = iterateSource (S.scanl1' (+))
465#endif
408#endif
466
409
467{-# INLINE iterateMapM #-}
410{-# INLINE iterateMapM #-}
468−iterateMapM :: MonadAsync m => Int -> Int -> Int -> Stream m Int
411+iterateMapM :: MonadAsync m => Int -> Int -> Int -> SerialT m Int
469iterateMapM = iterateSource (S.mapM return)
412iterateMapM = iterateSource (S.mapM return)
470
413
471{-# INLINE iterateFilterEven #-}
414{-# INLINE iterateFilterEven #-}
472−iterateFilterEven :: MonadAsync m => Int -> Int -> Int -> Stream m Int
415+iterateFilterEven :: MonadAsync m => Int -> Int -> Int -> SerialT m Int
473iterateFilterEven = iterateSource (S.filter even)
416iterateFilterEven = iterateSource (S.filter even)
474
417
475{-# INLINE iterateTakeAll #-}
418{-# INLINE iterateTakeAll #-}
476−iterateTakeAll :: MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
419+iterateTakeAll :: MonadAsync m => Int -> Int -> Int -> Int -> SerialT m Int
477iterateTakeAll value = iterateSource (S.take (value + 1))
420iterateTakeAll value = iterateSource (S.take (value + 1))
478
421
479{-# INLINE iterateDropOne #-}
422{-# INLINE iterateDropOne #-}
480−iterateDropOne :: MonadAsync m => Int -> Int -> Int -> Stream m Int
423+iterateDropOne :: MonadAsync m => Int -> Int -> Int -> SerialT m Int
481iterateDropOne = iterateSource (S.drop 1)
424iterateDropOne = iterateSource (S.drop 1)
482
425
426+{-# INLINE iterateDropWhileFalse #-}
427+iterateDropWhileFalse :: MonadAsync m
428+ => Int -> Int -> Int -> Int -> SerialT m Int
429+iterateDropWhileFalse value = iterateSource (S.dropWhile (> (value + 1)))
430+
483{-# INLINE iterateDropWhileTrue #-}
431{-# INLINE iterateDropWhileTrue #-}
484iterateDropWhileTrue :: MonadAsync m
432iterateDropWhileTrue :: MonadAsync m
485− => Int -> Int -> Int -> Int -> Stream m Int
433+ => Int -> Int -> Int -> Int -> SerialT m Int
486iterateDropWhileTrue value = iterateSource (S.dropWhile (<= (value + 1)))
434iterateDropWhileTrue value = iterateSource (S.dropWhile (<= (value + 1)))
487−#endif
488
435
489#ifdef USE_PRELUDE
436#ifdef USE_PRELUDE
490{-# INLINE tail #-}
437{-# INLINE tail #-}
491−tail :: Monad m => Stream m a -> m ()
438+tail :: Monad m => SerialT m a -> m ()
492tail s = S.tail s >>= mapM_ tail
439tail s = S.tail s >>= mapM_ tail
493
440
494{-# INLINE nullHeadTail #-}
441{-# INLINE nullHeadTail #-}
495−nullHeadTail :: Monad m => Stream m Int -> m ()
442+nullHeadTail :: Monad m => SerialT m Int -> m ()
496nullHeadTail s = do
443nullHeadTail s = do
497 r <- S.null s
444 r <- S.null s
498 when (not r) $ do
445 when (not r) $ do
@@ -505,10 +452,8 @@ o_n_stack_iterated :: Int -> [Benchmark]
505o_n_stack_iterated value = by10 `seq` by100 `seq`
452o_n_stack_iterated value = by10 `seq` by100 `seq`
506 [ bgroup "iterated"
453 [ bgroup "iterated"
507 [ benchIOSrc "mapM (n/10 x 10)" $ iterateMapM by10 10
454 [ benchIOSrc "mapM (n/10 x 10)" $ iterateMapM by10 10
508−#ifndef USE_STREAMK
509 , benchIOSrc "scanl' (quadratic) (n/100 x 100)" $
455 , benchIOSrc "scanl' (quadratic) (n/100 x 100)" $
510 iterateScan by100 100
456 iterateScan by100 100
511−#endif
512#ifdef USE_PRELUDE
457#ifdef USE_PRELUDE
513 , benchIOSrc "scanl1' (n/10 x 10)" $ iterateScanl1 by10 10
458 , benchIOSrc "scanl1' (n/10 x 10)" $ iterateScanl1 by10 10
514#endif
459#endif
@@ -517,10 +462,8 @@ o_n_stack_iterated value = by10 `seq` by100 `seq`
517 , benchIOSrc "takeAll (n/10 x 10)" $
462 , benchIOSrc "takeAll (n/10 x 10)" $
518 iterateTakeAll value by10 10
463 iterateTakeAll value by10 10
519 , benchIOSrc "dropOne (n/10 x 10)" $ iterateDropOne by10 10
464 , benchIOSrc "dropOne (n/10 x 10)" $ iterateDropOne by10 10
520−#ifdef USE_STREAMK
521 , benchIOSrc "dropWhileFalse (n/10 x 10)" $
465 , benchIOSrc "dropWhileFalse (n/10 x 10)" $
522 iterateDropWhileFalse value by10 10
466 iterateDropWhileFalse value by10 10
523−#endif
524 , benchIOSrc "dropWhileTrue (n/10 x 10)" $
467 , benchIOSrc "dropWhileTrue (n/10 x 10)" $
525 iterateDropWhileTrue value by10 10
468 iterateDropWhileTrue value by10 10
526#ifdef USE_PRELUDE
469#ifdef USE_PRELUDE
@@ -584,5 +527,13 @@ benchmarks moduleName size =
584 , o_1_space_pipesX4 size
527 , o_1_space_pipesX4 size
585 ]
528 ]
586 , bgroup (o_n_stack_prefix moduleName) (o_n_stack_iterated size)
529 , bgroup (o_n_stack_prefix moduleName) (o_n_stack_iterated size)
587− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_buffering size)
530+ , bgroup (o_n_heap_prefix moduleName) $ Prelude.concat
531+ [
532+#ifdef USE_PRELUDE
533+ o_n_space_grouping size
534+ ,
535+#endif
536+ o_n_space_functor size
537+ , o_n_heap_buffering size
538+ ]
588 ]
539 ]
benchmark/Streamly/Benchmark/Data/Stream/Split.hs+6−9
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Stream.Split
2-- Module : Stream.Split
5-- Copyright : (c) 2019 Composewell Technologies
3-- Copyright : (c) 2019 Composewell Technologies
@@ -27,7 +25,7 @@ import Data.Word (Word8)
27import System.IO (Handle)
25import System.IO (Handle)
28
26
29import qualified Streamly.FileSystem.Handle as FH
27import qualified Streamly.FileSystem.Handle as FH
30−import qualified Streamly.Internal.Data.Array as A
28+import qualified Streamly.Internal.Data.Array.Unboxed as A
31import qualified Streamly.Internal.Data.Fold as FL
29import qualified Streamly.Internal.Data.Fold as FL
32import qualified Streamly.Internal.Data.Parser as PR
30import qualified Streamly.Internal.Data.Parser as PR
33import qualified Streamly.Internal.Data.Stream.IsStream as IP
31import qualified Streamly.Internal.Data.Stream.IsStream as IP
@@ -35,15 +33,15 @@ import qualified Streamly.Internal.FileSystem.Handle as IFH
35import qualified Streamly.Internal.Unicode.Stream as IUS
33import qualified Streamly.Internal.Unicode.Stream as IUS
36import qualified Streamly.Prelude as S
34import qualified Streamly.Prelude as S
37
35
38−import Test.Tasty.Bench hiding (env)
36+import Gauge hiding (env)
39import Prelude hiding (last, length)
37import Prelude hiding (last, length)
40import Streamly.Benchmark.Common
38import Streamly.Benchmark.Common
41import Streamly.Benchmark.Common.Handle
39import Streamly.Benchmark.Common.Handle
42
40
43#ifdef INSPECTION
41#ifdef INSPECTION
44−import Streamly.Internal.Data.Stream (Step(..))
42+import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
45
43
46−import qualified Streamly.Internal.Data.MutArray as MA
44+import qualified Streamly.Internal.Data.Array.Unboxed.Mut.Type as MA
47import qualified Streamly.Internal.Data.Unfold as IUF
45import qualified Streamly.Internal.Data.Unfold as IUF
48
46
49import Test.Inspection
47import Test.Inspection
@@ -143,7 +141,7 @@ splitOnSeq str inh =
143-- | Split on a word8 sequence.
141-- | Split on a word8 sequence.
144splitOnSeq100k :: Handle -> IO Int
142splitOnSeq100k :: Handle -> IO Int
145splitOnSeq100k inh = do
143splitOnSeq100k inh = do
146− arr <- A.fromStream $ IP.toStream $ S.fromSerial $ S.replicate 100000 123
144+ arr <- A.fromStream $ S.replicate 100000 123
147 (S.length $ IP.splitOnSeq arr FL.drain
145 (S.length $ IP.splitOnSeq arr FL.drain
148 $ S.unfold FH.read inh) -- >>= print
146 $ S.unfold FH.read inh) -- >>= print
149
147
@@ -220,9 +218,8 @@ o_1_space_reduce_read_split env =
220splitOnSeqUtf8 :: String -> Handle -> IO Int
218splitOnSeqUtf8 :: String -> Handle -> IO Int
221splitOnSeqUtf8 str inh =
219splitOnSeqUtf8 str inh =
222 (S.length $ IP.splitOnSeq (A.fromList str) FL.drain
220 (S.length $ IP.splitOnSeq (A.fromList str) FL.drain
223− $ IP.fromStream
224 $ IUS.decodeUtf8Arrays
221 $ IUS.decodeUtf8Arrays
225− $ IFH.readChunks inh) -- >>= print
222+ $ IFH.getChunks inh) -- >>= print
226
223
227o_1_space_reduce_toChunks_split :: BenchEnv -> [Benchmark]
224o_1_space_reduce_toChunks_split :: BenchEnv -> [Benchmark]
228o_1_space_reduce_toChunks_split env =
225o_1_space_reduce_toChunks_split env =
benchmark/Streamly/Benchmark/Data/Stream/StreamD.hs+5−38
@@ -8,8 +8,6 @@
8{-# LANGUAGE CPP #-}
8{-# LANGUAGE CPP #-}
9{-# LANGUAGE FlexibleContexts #-}
9{-# LANGUAGE FlexibleContexts #-}
10{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE ScopedTypeVariables #-}
11−{-# LANGUAGE TupleSections #-}
12−{-# OPTIONS_GHC -Wno-orphans #-}
13
11
14#ifdef __HADDOCK_VERSION__
12#ifdef __HADDOCK_VERSION__
15#undef INSPECTION
13#undef INSPECTION
@@ -22,17 +20,14 @@
22
20
23module Main (main) where
21module Main (main) where
24
22
25−#if !MIN_VERSION_base(4,18,0)
26−import Control.Applicative (liftA2)
27−#endif
28import Control.Monad (when)
23import Control.Monad (when)
29import Data.Maybe (isJust)
24import Data.Maybe (isJust)
30−import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
25+import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
31import System.Random (randomRIO)
26import System.Random (randomRIO)
32import Prelude hiding (tail, mapM_, foldl, last, map, mapM, concatMap, zip)
27import Prelude hiding (tail, mapM_, foldl, last, map, mapM, concatMap, zip)
33
28
34import qualified Prelude as P
29import qualified Prelude as P
35−import qualified Streamly.Internal.Data.Stream as S
30+import qualified Streamly.Internal.Data.Stream.StreamD as S
36import qualified Streamly.Internal.Data.Unfold as UF
31import qualified Streamly.Internal.Data.Unfold as UF
37import qualified Streamly.Internal.Data.Fold as FL
32import qualified Streamly.Internal.Data.Fold as FL
38
33
@@ -326,34 +321,6 @@ filterMap n = composeN n $ S.map (subtract 1) . S.filter (<= maxValue)
326-- Nested Composition
321-- Nested Composition
327-------------------------------------------------------------------------------
322-------------------------------------------------------------------------------
328
323
329−instance Monad f => Applicative (S.Stream f) where
330− {-# INLINE pure #-}
331− pure = S.fromPure
332−
333− {-# INLINE (<*>) #-}
334− (<*>) = S.crossApply
335−
336− {-# INLINE liftA2 #-}
337− liftA2 f x = (<*>) (fmap f x)
338−
339− {-# INLINE (*>) #-}
340− (*>) = S.crossApplySnd
341−
342− {-# INLINE (<*) #-}
343− (<*) = S.crossApplyFst
344−
345−-- NOTE: even though concatMap for StreamD is 4x faster compared to StreamK,
346−-- the monad instance does not seem to be significantly faster.
347−instance Monad m => Monad (S.Stream m) where
348− {-# INLINE return #-}
349− return = pure
350−
351− {-# INLINE (>>=) #-}
352− (>>=) = flip S.concatMap
353−
354− {-# INLINE (>>) #-}
355− (>>) = (*>)
356−
357{-# INLINE toNullApNested #-}
324{-# INLINE toNullApNested #-}
358toNullApNested :: Monad m => Stream m Int -> m ()
325toNullApNested :: Monad m => Stream m Int -> m ()
359toNullApNested s = runStream $ do
326toNullApNested s = runStream $ do
@@ -449,8 +416,8 @@ unfoldManyRepl :: Int -> Int -> Int -> IO ()
449unfoldManyRepl outer inner n =
416unfoldManyRepl outer inner n =
450 S.drain
417 S.drain
451 $ S.unfoldMany
418 $ S.unfoldMany
452− UF.replicateM
419+ (UF.lmap return (UF.replicateM inner))
453− (S.map ((inner,) . return) (sourceUnfoldrMN outer n))
420+ (sourceUnfoldrMN outer n)
454
421
455#ifdef INSPECTION
422#ifdef INSPECTION
456inspect $ hasNoTypeClasses 'unfoldManyRepl
423inspect $ hasNoTypeClasses 'unfoldManyRepl
@@ -463,7 +430,7 @@ inspect $ 'unfoldManyRepl `hasNoType` ''SPEC
463-------------------------------------------------------------------------------
430-------------------------------------------------------------------------------
464
431
465moduleName :: String
432moduleName :: String
466−moduleName = "Data.StreamD"
433+moduleName = "Data.Stream.StreamD"
467
434
468o_1_space :: [Benchmark]
435o_1_space :: [Benchmark]
469o_1_space =
436o_1_space =
benchmark/Streamly/Benchmark/Data/Stream/StreamKAlt.hs → benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hsrenamed+3−5
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Streamly.Benchmark.Data.Stream.StreamDK
2-- Module : Streamly.Benchmark.Data.Stream.StreamDK
5-- Copyright : (c) 2018 Composewell Technologies
3-- Copyright : (c) 2018 Composewell Technologies
@@ -18,12 +16,12 @@ import Prelude hiding ()
18-- import qualified Prelude as P
16-- import qualified Prelude as P
19-- import qualified Data.List as List
17-- import qualified Data.List as List
20
18
21−import qualified Streamly.Internal.Data.StreamK.Alt as S
19+import qualified Streamly.Internal.Data.Stream.StreamDK as S
22-- import qualified Streamly.Internal.Data.Stream.Common as SP
20-- import qualified Streamly.Internal.Data.Stream.Common as SP
23-- import qualified Streamly.Internal.Data.SVar as S
21-- import qualified Streamly.Internal.Data.SVar as S
24
22
25import Streamly.Benchmark.Common
23import Streamly.Benchmark.Common
26−import Test.Tasty.Bench (bgroup, Benchmark, defaultMain)
24+import Gauge (bgroup, Benchmark, defaultMain)
27
25
28value :: Int
26value :: Int
29value = 100000
27value = 100000
@@ -452,4 +450,4 @@ o_1_space =
452 ]
450 ]
453
451
454main :: IO ()
452main :: IO ()
455−main = defaultMain [o_1_space]
453+main = defaultMain $ concat [o_1_space]
benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs+33−61
@@ -8,7 +8,6 @@
8{-# LANGUAGE CPP #-}
8{-# LANGUAGE CPP #-}
9{-# LANGUAGE FlexibleContexts #-}
9{-# LANGUAGE FlexibleContexts #-}
10{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE ScopedTypeVariables #-}
11−{-# OPTIONS_GHC -Wno-orphans #-}
12
11
13#ifdef __HADDOCK_VERSION__
12#ifdef __HADDOCK_VERSION__
14#undef INSPECTION
13#undef INSPECTION
@@ -21,23 +20,22 @@
21
20
22module Main (main) where
21module Main (main) where
23
22
24−#if !MIN_VERSION_base(4,18,0)
25−import Control.Applicative (liftA2)
26−#endif
27import Control.Monad (when)
23import Control.Monad (when)
28import Data.Maybe (isJust)
24import Data.Maybe (isJust)
29import System.Random (randomRIO)
25import System.Random (randomRIO)
30import Prelude hiding
26import Prelude hiding
31− ( Foldable(..), tail, mapM_, last, map, mapM, concatMap, zipWith, init, iterate
27+ ( tail, mapM_, foldl, last, map, mapM, concatMap, zipWith, init, iterate
32 , repeat, replicate
28 , repeat, replicate
33 )
29 )
34
30
35import qualified Prelude as P
31import qualified Prelude as P
36import qualified Data.List as List
32import qualified Data.List as List
37
33
38−import qualified Streamly.Internal.Data.StreamK as S
34+import qualified Streamly.Internal.Control.Concurrent as S
35+import qualified Streamly.Internal.Data.Stream.StreamK.Type as S
36+import qualified Streamly.Internal.Data.Stream.StreamK as S
39
37
40−import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
38+import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
41
39
42import Streamly.Benchmark.Common
40import Streamly.Benchmark.Common
43
41
@@ -117,7 +115,7 @@ Benchmarks that need to be added
117-- Stream generation and elimination
115-- Stream generation and elimination
118-------------------------------------------------------------------------------
116-------------------------------------------------------------------------------
119
117
120−type Stream m a = S.StreamK m a
118+type Stream m a = S.Stream m a
121
119
122{-# INLINE unfoldr #-}
120{-# INLINE unfoldr #-}
123unfoldr :: Int -> Int -> Stream m Int
121unfoldr :: Int -> Int -> Stream m Int
@@ -129,7 +127,7 @@ unfoldr streamLen n = S.unfoldr step n
129 else Just (cnt, cnt + 1)
127 else Just (cnt, cnt + 1)
130
128
131{-# INLINE unfoldrM #-}
129{-# INLINE unfoldrM #-}
132−unfoldrM :: Monad m => Int -> Int -> Stream m Int
130+unfoldrM :: S.MonadAsync m => Int -> Int -> Stream m Int
133unfoldrM streamLen n = S.unfoldrMWith S.consM step n
131unfoldrM streamLen n = S.unfoldrMWith S.consM step n
134 where
132 where
135 step cnt =
133 step cnt =
@@ -142,7 +140,7 @@ repeat :: Int -> Int -> Stream m Int
142repeat streamLen = S.take streamLen . S.repeat
140repeat streamLen = S.take streamLen . S.repeat
143
141
144{-# INLINE repeatM #-}
142{-# INLINE repeatM #-}
145−repeatM :: Monad m => Int -> Int -> Stream m Int
143+repeatM :: S.MonadAsync m => Int -> Int -> Stream m Int
146repeatM streamLen = S.take streamLen . S.repeatM . return
144repeatM streamLen = S.take streamLen . S.repeatM . return
147
145
148{-# INLINE replicate #-}
146{-# INLINE replicate #-}
@@ -150,7 +148,7 @@ replicate :: Int -> Int -> Stream m Int
150replicate = S.replicate
148replicate = S.replicate
151
149
152{-# INLINE replicateM #-}
150{-# INLINE replicateM #-}
153−replicateM :: Monad m => Int -> Int -> Stream m Int
151+replicateM :: S.MonadAsync m => Int -> Int -> Stream m Int
154replicateM streamLen = S.replicateMWith S.consM streamLen . return
152replicateM streamLen = S.replicateMWith S.consM streamLen . return
155
153
156{-# INLINE iterate #-}
154{-# INLINE iterate #-}
@@ -158,7 +156,7 @@ iterate :: Int -> Int -> Stream m Int
158iterate streamLen = S.take streamLen . S.iterate (+1)
156iterate streamLen = S.take streamLen . S.iterate (+1)
159
157
160{-# INLINE iterateM #-}
158{-# INLINE iterateM #-}
161−iterateM :: Monad m => Int -> Int -> Stream m Int
159+iterateM :: S.MonadAsync m => Int -> Int -> Stream m Int
162iterateM streamLen = S.take streamLen . S.iterateM (return . (+1)) . return
160iterateM streamLen = S.take streamLen . S.iterateM (return . (+1)) . return
163
161
164{-# INLINE fromFoldable #-}
162{-# INLINE fromFoldable #-}
@@ -166,27 +164,26 @@ fromFoldable :: Int -> Int -> Stream m Int
166fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
164fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
167
165
168{-# INLINE fromFoldableM #-}
166{-# INLINE fromFoldableM #-}
169−fromFoldableM :: Monad m => Int -> Int -> Stream m Int
167+fromFoldableM :: S.MonadAsync m => Int -> Int -> Stream m Int
170fromFoldableM streamLen n =
168fromFoldableM streamLen n =
171− List.foldr S.consM S.nil (Prelude.fmap return [n..n+streamLen])
169+ Prelude.foldr S.consM S.nil (Prelude.fmap return [n..n+streamLen])
172
170
173{-# INLINABLE concatMapFoldableWith #-}
171{-# INLINABLE concatMapFoldableWith #-}
174−concatMapFoldableWith :: P.Foldable f
172+concatMapFoldableWith :: Foldable f
175 => (Stream m b -> Stream m b -> Stream m b)
173 => (Stream m b -> Stream m b -> Stream m b)
176 -> (a -> Stream m b)
174 -> (a -> Stream m b)
177 -> f a
175 -> f a
178 -> Stream m b
176 -> Stream m b
179−concatMapFoldableWith f g = P.foldr (f . g) S.nil
177+concatMapFoldableWith f g = Prelude.foldr (f . g) S.nil
180
178
181{-# INLINE concatMapFoldableSerial #-}
179{-# INLINE concatMapFoldableSerial #-}
182concatMapFoldableSerial :: Int -> Int -> Stream m Int
180concatMapFoldableSerial :: Int -> Int -> Stream m Int
183−concatMapFoldableSerial streamLen n =
184− concatMapFoldableWith S.append S.fromPure [n..n+streamLen]
181+concatMapFoldableSerial streamLen n = concatMapFoldableWith S.serial S.fromPure [n..n+streamLen]
185
182
186{-# INLINE concatMapFoldableSerialM #-}
183{-# INLINE concatMapFoldableSerialM #-}
187concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
184concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
188concatMapFoldableSerialM streamLen n =
185concatMapFoldableSerialM streamLen n =
189− concatMapFoldableWith S.append (S.fromEffect . return) [n..n+streamLen]
186+ concatMapFoldableWith S.serial (S.fromEffect . return) [n..n+streamLen]
190
187
191-------------------------------------------------------------------------------
188-------------------------------------------------------------------------------
192-- Elimination
189-- Elimination
@@ -271,11 +268,11 @@ fmapK :: Monad m => Int -> Stream m Int -> m ()
271fmapK n = composeN n $ P.fmap (+ 1)
268fmapK n = composeN n $ P.fmap (+ 1)
272
269
273{-# INLINE mapM #-}
270{-# INLINE mapM #-}
274−mapM :: Monad m => Int -> Stream m Int -> m ()
271+mapM :: S.MonadAsync m => Int -> Stream m Int -> m ()
275mapM n = composeN n $ S.mapMWith S.consM return
272mapM n = composeN n $ S.mapMWith S.consM return
276
273
277{-# INLINE mapMSerial #-}
274{-# INLINE mapMSerial #-}
278−mapMSerial :: Monad m => Int -> Stream m Int -> m ()
275+mapMSerial :: S.MonadAsync m => Int -> Stream m Int -> m ()
279mapMSerial n = composeN n $ S.mapMSerial return
276mapMSerial n = composeN n $ S.mapMSerial return
280
277
281{-# INLINE filterEven #-}
278{-# INLINE filterEven #-}
@@ -327,7 +324,7 @@ foldlS :: Monad m => Int -> Stream m Int -> m ()
327foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
324foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
328
325
329{-# INLINE intersperse #-}
326{-# INLINE intersperse #-}
330−intersperse :: Monad m => Int -> Int -> Stream m Int -> m ()
327+intersperse :: S.MonadAsync m => Int -> Int -> Stream m Int -> m ()
331intersperse streamLen n = composeN n $ S.intersperse streamLen
328intersperse streamLen n = composeN n $ S.intersperse streamLen
332
329
333-------------------------------------------------------------------------------
330-------------------------------------------------------------------------------
@@ -336,7 +333,8 @@ intersperse streamLen n = composeN n $ S.intersperse streamLen
336
333
337{-# INLINE iterateSource #-}
334{-# INLINE iterateSource #-}
338iterateSource
335iterateSource
336+ :: S.MonadAsync m
339− :: Monad m => Int -> (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
337+ => Int -> (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
340iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
338iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
341 where
339 where
342 f (0 :: Int) m = g m
340 f (0 :: Int) m = g m
@@ -344,37 +342,37 @@ iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
344
342
345-- this is quadratic
343-- this is quadratic
346{-# INLINE iterateScan #-}
344{-# INLINE iterateScan #-}
347−iterateScan :: Monad m => Int -> Int -> Int -> Stream m Int
345+iterateScan :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
348iterateScan iterStreamLen maxIters =
346iterateScan iterStreamLen maxIters =
349 iterateSource iterStreamLen (S.scanl' (+) 0) (maxIters `div` 10)
347 iterateSource iterStreamLen (S.scanl' (+) 0) (maxIters `div` 10)
350
348
351-- this is quadratic
349-- this is quadratic
352{-# INLINE iterateDropWhileFalse #-}
350{-# INLINE iterateDropWhileFalse #-}
353−iterateDropWhileFalse :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
351+iterateDropWhileFalse :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
354iterateDropWhileFalse streamLen iterStreamLen maxIters =
352iterateDropWhileFalse streamLen iterStreamLen maxIters =
355 iterateSource iterStreamLen (S.dropWhile (> streamLen)) (maxIters `div` 10)
353 iterateSource iterStreamLen (S.dropWhile (> streamLen)) (maxIters `div` 10)
356
354
357{-# INLINE iterateMapM #-}
355{-# INLINE iterateMapM #-}
358−iterateMapM :: Monad m => Int -> Int -> Int -> Stream m Int
356+iterateMapM :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
359iterateMapM iterStreamLen =
357iterateMapM iterStreamLen =
360 iterateSource iterStreamLen (S.mapMWith S.consM return)
358 iterateSource iterStreamLen (S.mapMWith S.consM return)
361
359
362{-# INLINE iterateFilterEven #-}
360{-# INLINE iterateFilterEven #-}
363−iterateFilterEven :: Monad m => Int -> Int -> Int -> Stream m Int
361+iterateFilterEven :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
364iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
362iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
365
363
366{-# INLINE iterateTakeAll #-}
364{-# INLINE iterateTakeAll #-}
367−iterateTakeAll :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
365+iterateTakeAll :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
368iterateTakeAll streamLen iterStreamLen =
366iterateTakeAll streamLen iterStreamLen =
369 iterateSource iterStreamLen (S.take streamLen)
367 iterateSource iterStreamLen (S.take streamLen)
370
368
371{-# INLINE iterateDropOne #-}
369{-# INLINE iterateDropOne #-}
372−iterateDropOne :: Monad m => Int -> Int -> Int -> Stream m Int
370+iterateDropOne :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
373iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
371iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
374
372
375{-# INLINE iterateDropWhileTrue #-}
373{-# INLINE iterateDropWhileTrue #-}
376−iterateDropWhileTrue ::
374+iterateDropWhileTrue :: S.MonadAsync m =>
377− Monad m => Int -> Int -> Int -> Int -> Stream m Int
375+ Int -> Int -> Int -> Int -> Stream m Int
378iterateDropWhileTrue streamLen iterStreamLen =
376iterateDropWhileTrue streamLen iterStreamLen =
379 iterateSource iterStreamLen (S.dropWhile (<= streamLen))
377 iterateSource iterStreamLen (S.dropWhile (<= streamLen))
380
378
@@ -392,7 +390,7 @@ zipWithM src = drain $ S.zipWithM (curry return) src src
392
390
393{-# INLINE sortByK #-}
391{-# INLINE sortByK #-}
394sortByK :: (a -> a -> Ordering) -> Stream m a -> Stream m a
392sortByK :: (a -> a -> Ordering) -> Stream m a -> Stream m a
395−sortByK f = S.mergeMapWith (S.mergeBy f) S.fromPure
393+sortByK f = S.concatPairsWith (S.mergeBy f) S.fromPure
396
394
397{-# INLINE sortBy #-}
395{-# INLINE sortBy #-}
398sortBy :: Monad m => Stream m Int -> m ()
396sortBy :: Monad m => Stream m Int -> m ()
@@ -494,7 +492,7 @@ sourceConcatMapId val n =
494{-# INLINE concatMapBySerial #-}
492{-# INLINE concatMapBySerial #-}
495concatMapBySerial :: Int -> Int -> Int -> IO ()
493concatMapBySerial :: Int -> Int -> Int -> IO ()
496concatMapBySerial outer inner n =
494concatMapBySerial outer inner n =
497− S.drain $ S.concatMapWith S.append
495+ S.drain $ S.concatMapWith S.serial
498 (unfoldrM inner)
496 (unfoldrM inner)
499 (unfoldrM outer n)
497 (unfoldrM outer n)
500
498
@@ -502,32 +500,6 @@ concatMapBySerial outer inner n =
502-- Nested Composition
500-- Nested Composition
503-------------------------------------------------------------------------------
501-------------------------------------------------------------------------------
504
502
505−instance Monad m => Applicative (S.StreamK m) where
506− {-# INLINE pure #-}
507− pure = S.fromPure
508−
509− {-# INLINE (<*>) #-}
510− (<*>) = S.crossApply
511−
512− {-# INLINE liftA2 #-}
513− liftA2 f x = (<*>) (fmap f x)
514−
515− {-# INLINE (*>) #-}
516− (*>) = S.crossApplySnd
517−
518− {-# INLINE (<*) #-}
519− (<*) = S.crossApplyFst
520−
521−-- NOTE: even though concatMap for StreamD is 3x faster compared to StreamK,
522−-- the monad instance of StreamD is slower than StreamK after foldr/build
523−-- fusion.
524−instance Monad m => Monad (S.StreamK m) where
525− {-# INLINE return #-}
526− return = pure
527−
528− {-# INLINE (>>=) #-}
529− (>>=) = flip S.concatMap
530−
531{-# INLINE drainApplicative #-}
503{-# INLINE drainApplicative #-}
532drainApplicative :: Monad m => Stream m Int -> m ()
504drainApplicative :: Monad m => Stream m Int -> m ()
533drainApplicative s = drain $ do
505drainApplicative s = drain $ do
@@ -634,7 +606,7 @@ filterAllInNestedList str = do
634-------------------------------------------------------------------------------
606-------------------------------------------------------------------------------
635
607
636moduleName :: String
608moduleName :: String
637−moduleName = "Data.StreamK"
609+moduleName = "Data.Stream.StreamK"
638
610
639o_1_space_generation :: Int -> Benchmark
611o_1_space_generation :: Int -> Benchmark
640o_1_space_generation streamLen =
612o_1_space_generation streamLen =
@@ -731,7 +703,7 @@ o_1_space_concat streamLen =
731 -- This is for comparison with concatMapFoldableWith
703 -- This is for comparison with concatMapFoldableWith
732 , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
704 , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
733 (S.drain
705 (S.drain
734− . S.concatMapWith S.append id
706+ . S.concatMapWith S.serial id
735 . sourceConcatMapId streamLen)
707 . sourceConcatMapId streamLen)
736
708
737 , benchIOSrc1 "concatMapBy serial (n of 1)"
709 , benchIOSrc1 "concatMapBy serial (n of 1)"
benchmark/Streamly/Benchmark/Data/Stream/ToStreamK.hsdeleted−938
@@ -1,938 +0,0 @@
1−-- |
2−-- Module : Streamly.Benchmark.Data.StreamK
3−-- Copyright : (c) 2018 Composewell Technologies
4−--
5−-- License : BSD3
6−-- Maintainer : streamly@composewell.com
7−
8−{-# LANGUAGE CPP #-}
9−{-# LANGUAGE FlexibleContexts #-}
10−{-# LANGUAGE ScopedTypeVariables #-}
11−{-# OPTIONS_GHC -Wno-orphans #-}
12−
13−#ifdef __HADDOCK_VERSION__
14−#undef INSPECTION
15−#endif
16−
17−#ifdef INSPECTION
18−{-# LANGUAGE TemplateHaskell #-}
19−{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
20−#endif
21−
22−module Main (main) where
23−
24−-- import Control.Applicative (liftA2)
25−-- import Control.Monad (when)
26−-- import Data.Maybe (isJust)
27−-- import System.Random (randomRIO)
28−import Prelude hiding
29− ( tail, mapM_, foldl, last, map, mapM, concatMap, zipWith, init, iterate
30− , repeat, replicate
31− )
32−
33−import qualified Prelude as P
34−-- import qualified Data.List as List
35−
36−import qualified Streamly.Internal.Data.StreamK as S
37−import qualified Streamly.Internal.Data.Stream as D
38−import qualified Streamly.Internal.Data.Fold as Fold
39−
40−import Test.Tasty.Bench (bgroup, Benchmark, defaultMain)
41−
42−import Streamly.Benchmark.Common
43−
44−#ifdef INSPECTION
45−import Test.Inspection
46−#endif
47−
48−-------------------------------------------------------------------------------
49−-- Stream generation and elimination
50−-------------------------------------------------------------------------------
51−
52−type Stream m a = S.Stream m a
53−
54−{-# INLINE unfoldrD #-}
55−unfoldrD :: Monad m => Int -> Int -> Stream m Int
56−unfoldrD streamLen n = D.toStreamK (D.unfoldr step n)
57− where
58− step cnt =
59− if cnt > n + streamLen
60− then Nothing
61− else Just (cnt, cnt + 1)
62−
63−{-# INLINE unfoldrMD #-}
64−unfoldrMD :: Monad m => Int -> Int -> Stream m Int
65−unfoldrMD streamLen n = D.toStreamK (D.unfoldrM step n)
66− where
67− step cnt =
68− if cnt > n + streamLen
69− then return Nothing
70− else return (Just (cnt, cnt + 1))
71−
72−{-
73−{-# INLINE unfoldrK #-}
74−unfoldrK :: Int -> Int -> Stream m Int
75−unfoldrK streamLen n = S.unfoldr step n
76− where
77− step cnt =
78− if cnt > n + streamLen
79− then Nothing
80− else Just (cnt, cnt + 1)
81−-}
82−
83−{-# INLINE unfoldrMK #-}
84−unfoldrMK :: Monad m => Int -> Int -> Stream m Int
85−unfoldrMK streamLen n = S.unfoldrMWith S.consM step n
86− where
87− step cnt =
88− if cnt > n + streamLen
89− then return Nothing
90− else return (Just (cnt, cnt + 1))
91−
92−{-# INLINE repeat #-}
93−repeat :: Monad m => Int -> Int -> Stream m Int
94−repeat streamLen = S.take streamLen . D.toStreamK . D.repeat
95−
96−{-# INLINE repeatM #-}
97−repeatM :: Monad m => Int -> Int -> Stream m Int
98−repeatM streamLen = S.take streamLen . D.toStreamK . D.repeatM . return
99−
100−{-# INLINE replicate #-}
101−replicate :: Monad m => Int -> Int -> Stream m Int
102−replicate x y = D.toStreamK $ D.replicate x y
103−
104−{-# INLINE replicateM #-}
105−replicateM :: Monad m => Int -> Int -> Stream m Int
106−replicateM streamLen = D.toStreamK . D.replicateM streamLen . return
107−
108−{-# INLINE iterate #-}
109−iterate :: Monad m => Int -> Int -> Stream m Int
110−iterate streamLen = S.take streamLen . D.toStreamK . D.iterate (+1)
111−
112−{-# INLINE iterateM #-}
113−iterateM :: Monad m => Int -> Int -> Stream m Int
114−iterateM streamLen = S.take streamLen . D.toStreamK . D.iterateM (return . (+1)) . return
115−
116−{-# INLINE fromFoldable #-}
117−fromFoldable :: Int -> Int -> Stream m Int
118−fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
119−
120−{-# INLINE fromFoldableM #-}
121−fromFoldableM :: Monad m => Int -> Int -> Stream m Int
122−fromFoldableM streamLen n =
123− Prelude.foldr (S.consM . return) S.nil [n .. n + streamLen]
124−
125−{-
126−{-# INLINABLE concatMapFoldableWith #-}
127−concatMapFoldableWith :: Foldable f
128− => (Stream m b -> Stream m b -> Stream m b)
129− -> (a -> Stream m b)
130− -> f a
131− -> Stream m b
132−concatMapFoldableWith f g = Prelude.foldr (f . g) S.nil
133−-}
134−
135−{-# INLINE concatMapFoldableSerial #-}
136−concatMapFoldableSerial :: Monad m => Int -> Int -> Stream m Int
137−concatMapFoldableSerial streamLen n =
138− D.toStreamK $ D.concatMap D.fromPure $ D.fromStreamK $ S.fromList [n..n+streamLen]
139−
140−{-# INLINE concatMapFoldableSerialM #-}
141−concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
142−concatMapFoldableSerialM streamLen n =
143− -- concatMapFoldableWith S.serial (S.fromEffect . return) [n..n+streamLen]
144− D.toStreamK $ D.concatMap (D.fromEffect . return) $ D.fromStreamK $ S.fromList [n..n+streamLen]
145−
146−-------------------------------------------------------------------------------
147−-- Elimination
148−-------------------------------------------------------------------------------
149−
150−{-# INLINE drainD #-}
151−drainD :: Monad m => Stream m a -> m ()
152−drainD = D.drain . D.fromStreamK
153−
154−{-# INLINE drain #-}
155−drain :: Monad m => Stream m a -> m ()
156−drain = S.drain
157−
158−{-# INLINE mapM_ #-}
159−mapM_ :: Monad m => Stream m a -> m ()
160−mapM_ s = D.mapM_ (\_ -> return ()) $ D.fromStreamK s
161−
162−{-
163−{-# INLINE uncons #-}
164−uncons :: Monad m => Stream m Int -> m ()
165−uncons s = do
166− r <- D.uncons $ D.fromStreamK s
167− case r of
168− Nothing -> return ()
169− Just (_, t) -> uncons (D.toStreamK t)
170−
171−{-# INLINE init #-}
172−init :: Monad m => Stream m a -> m ()
173−init s = do
174− t <- S.init s
175− P.mapM_ S.drain t
176−
177−{-# INLINE tail #-}
178−tail :: Monad m => Stream m a -> m ()
179−tail s = S.tail s >>= P.mapM_ tail
180−
181−{-# INLINE nullTail #-}
182−nullTail :: Monad m => Stream m Int -> m ()
183−nullTail s = do
184− r <- S.null s
185− when (not r) $ S.tail s >>= P.mapM_ nullTail
186−
187−{-# INLINE headTail #-}
188−headTail :: Monad m => Stream m Int -> m ()
189−headTail s = do
190− h <- S.head s
191− when (isJust h) $ S.tail s >>= P.mapM_ headTail
192−-}
193−
194−{-# INLINE toList #-}
195−toList :: Monad m => Stream m Int -> m [Int]
196−toList = D.fold Fold.toList . D.fromStreamK
197−
198−{-# INLINE foldl' #-}
199−foldl' :: Monad m => Stream m Int -> m Int
200−foldl' = D.fold (Fold.foldl' (+) 0) . D.fromStreamK
201−
202−{-# INLINE last #-}
203−last :: Monad m => Stream m Int -> m (Maybe Int)
204−last = D.fold Fold.latest . D.fromStreamK
205−
206−-------------------------------------------------------------------------------
207−-- Transformation
208−-------------------------------------------------------------------------------
209−
210−{-# INLINE composeN #-}
211−composeN
212− :: Monad m
213− => Int -> (Stream m Int -> Stream m Int) -> Stream m Int -> m ()
214−composeN n f =
215− case n of
216− 1 -> drain . f
217− 2 -> drain . f . f
218− 3 -> drain . f . f . f
219− 4 -> drain . f . f . f . f
220− _ -> undefined
221−
222−{-# INLINE scanl' #-}
223−scanl' :: Monad m => Int -> Stream m Int -> m ()
224−scanl' n =
225− composeN n (D.toStreamK . D.scan (Fold.foldl' (+) 0) . D.fromStreamK)
226−
227−{-# INLINE map #-}
228−map :: Monad m => Int -> Stream m Int -> m ()
229−map n = composeN n (D.toStreamK . D.map (+ 1) . D.fromStreamK)
230−
231−{-
232−{-# INLINE fmapK #-}
233−fmapK :: Monad m => Int -> Stream m Int -> m ()
234−fmapK n = composeN n $ P.fmap (+ 1)
235−-}
236−
237−{-# INLINE mapM #-}
238−mapM :: Monad m => Int -> Stream m Int -> m ()
239−mapM n = composeN n (D.toStreamK . D.mapM return . D.fromStreamK)
240−
241−{-
242−{-# INLINE mapMSerial #-}
243−mapMSerial :: S.MonadAsync m => Int -> Stream m Int -> m ()
244−mapMSerial n = composeN n $ S.mapMSerial return
245−-}
246−
247−{-# INLINE filterEven #-}
248−filterEven :: Monad m => Int -> Stream m Int -> m ()
249−filterEven n = composeN n (D.toStreamK . D.filter even . D.fromStreamK)
250−
251−{-
252−{-# INLINE filterAllOut #-}
253−filterAllOut :: Monad m => Int -> Int -> Stream m Int -> m ()
254−filterAllOut streamLen n = composeN n $ S.filter (> streamLen)
255−
256−{-# INLINE filterAllIn #-}
257−filterAllIn :: Monad m => Int -> Int -> Stream m Int -> m ()
258−filterAllIn streamLen n = composeN n $ S.filter (<= streamLen)
259−
260−{-# INLINE _takeOne #-}
261−_takeOne :: Monad m => Int -> Stream m Int -> m ()
262−_takeOne n = composeN n $ S.take 1
263−
264−{-# INLINE takeAll #-}
265−takeAll :: Monad m => Int -> Int -> Stream m Int -> m ()
266−takeAll streamLen n = composeN n $ S.take streamLen
267−
268−{-# INLINE takeWhileTrue #-}
269−takeWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
270−takeWhileTrue streamLen n = composeN n $ S.takeWhile (<= streamLen)
271−
272−{-# INLINE dropOne #-}
273−dropOne :: Monad m => Int -> Stream m Int -> m ()
274−dropOne n = composeN n $ S.drop 1
275−
276−{-# INLINE dropAll #-}
277−dropAll :: Monad m => Int -> Int -> Stream m Int -> m ()
278−dropAll streamLen n = composeN n $ S.drop streamLen
279−
280−{-# INLINE dropWhileTrue #-}
281−dropWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
282−dropWhileTrue streamLen n = composeN n $ S.dropWhile (<= streamLen)
283−
284−{-# INLINE dropWhileFalse #-}
285−dropWhileFalse :: Monad m => Int -> Stream m Int -> m ()
286−dropWhileFalse n = composeN n $ S.dropWhile (<= 1)
287−-}
288−
289−{-
290−{-# INLINE foldrS #-}
291−foldrS :: Monad m => Int -> Stream m Int -> m ()
292−foldrS n = composeN n $ S.foldrS S.cons S.nil
293−
294−{-# INLINE foldlS #-}
295−foldlS :: Monad m => Int -> Stream m Int -> m ()
296−foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
297−-}
298−
299−{-
300−{-# INLINE intersperse #-}
301−intersperse :: S.MonadAsync m => Int -> Int -> Stream m Int -> m ()
302−intersperse streamLen n = composeN n $ S.intersperse streamLen
303−-}
304−
305−-------------------------------------------------------------------------------
306−-- Iteration
307−-------------------------------------------------------------------------------
308−
309−{-
310−{-# INLINE iterateSource #-}
311−iterateSource
312− :: S.MonadAsync m
313− => Int -> (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
314−iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
315− where
316− f (0 :: Int) m = g m
317− f x m = g (f (x P.- 1) m)
318−
319−-- this is quadratic
320−{-# INLINE iterateScan #-}
321−iterateScan :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
322−iterateScan iterStreamLen maxIters =
323− iterateSource iterStreamLen (S.scanl' (+) 0) (maxIters `div` 10)
324−
325−-- this is quadratic
326−{-# INLINE iterateDropWhileFalse #-}
327−iterateDropWhileFalse :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
328−iterateDropWhileFalse streamLen iterStreamLen maxIters =
329− iterateSource iterStreamLen (S.dropWhile (> streamLen)) (maxIters `div` 10)
330−
331−{-# INLINE iterateMapM #-}
332−iterateMapM :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
333−iterateMapM iterStreamLen =
334− iterateSource iterStreamLen (S.mapMWith S.consM return)
335−
336−{-# INLINE iterateFilterEven #-}
337−iterateFilterEven :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
338−iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
339−
340−{-# INLINE iterateTakeAll #-}
341−iterateTakeAll :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
342−iterateTakeAll streamLen iterStreamLen =
343− iterateSource iterStreamLen (S.take streamLen)
344−
345−{-# INLINE iterateDropOne #-}
346−iterateDropOne :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
347−iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
348−
349−{-# INLINE iterateDropWhileTrue #-}
350−iterateDropWhileTrue :: S.MonadAsync m =>
351− Int -> Int -> Int -> Int -> Stream m Int
352−iterateDropWhileTrue streamLen iterStreamLen =
353− iterateSource iterStreamLen (S.dropWhile (<= streamLen))
354−-}
355−
356−-------------------------------------------------------------------------------
357−-- Zipping
358−-------------------------------------------------------------------------------
359−
360−{-
361−{-# INLINE zipWith #-}
362−zipWith :: Monad m => Stream m Int -> m ()
363−zipWith src = drain $ S.zipWith (,) src src
364−
365−{-# INLINE zipWithM #-}
366−zipWithM :: Monad m => Stream m Int -> m ()
367−zipWithM src = drain $ S.zipWithM (curry return) src src
368−
369−{-# INLINE sortByK #-}
370−sortByK :: (a -> a -> Ordering) -> Stream m a -> Stream m a
371−sortByK f = S.concatPairsWith (S.mergeBy f) S.fromPure
372−
373−{-# INLINE sortBy #-}
374−sortBy :: Monad m => Stream m Int -> m ()
375−sortBy = drain . sortByK compare
376−
377−-------------------------------------------------------------------------------
378−-- Mixed Composition
379−-------------------------------------------------------------------------------
380−
381−{-# INLINE scanMap #-}
382−scanMap :: Monad m => Int -> Stream m Int -> m ()
383−scanMap n = composeN n $ S.map (subtract 1) . S.scanl' (+) 0
384−
385−{-# INLINE dropMap #-}
386−dropMap :: Monad m => Int -> Stream m Int -> m ()
387−dropMap n = composeN n $ S.map (subtract 1) . S.drop 1
388−
389−{-# INLINE dropScan #-}
390−dropScan :: Monad m => Int -> Stream m Int -> m ()
391−dropScan n = composeN n $ S.scanl' (+) 0 . S.drop 1
392−
393−{-# INLINE takeDrop #-}
394−takeDrop :: Monad m => Int -> Int -> Stream m Int -> m ()
395−takeDrop streamLen n = composeN n $ S.drop 1 . S.take streamLen
396−
397−{-# INLINE takeScan #-}
398−takeScan :: Monad m => Int -> Int -> Stream m Int -> m ()
399−takeScan streamLen n = composeN n $ S.scanl' (+) 0 . S.take streamLen
400−
401−{-# INLINE takeMap #-}
402−takeMap :: Monad m => Int -> Int -> Stream m Int -> m ()
403−takeMap streamLen n = composeN n $ S.map (subtract 1) . S.take streamLen
404−
405−{-# INLINE filterDrop #-}
406−filterDrop :: Monad m => Int -> Int -> Stream m Int -> m ()
407−filterDrop streamLen n = composeN n $ S.drop 1 . S.filter (<= streamLen)
408−
409−{-# INLINE filterTake #-}
410−filterTake :: Monad m => Int -> Int -> Stream m Int -> m ()
411−filterTake streamLen n = composeN n $ S.take streamLen . S.filter (<= streamLen)
412−
413−{-# INLINE filterScan #-}
414−filterScan :: Monad m => Int -> Stream m Int -> m ()
415−filterScan n = composeN n $ S.scanl' (+) 0 . S.filter (<= maxBound)
416−
417−{-# INLINE filterMap #-}
418−filterMap :: Monad m => Int -> Int -> Stream m Int -> m ()
419−filterMap streamLen n = composeN n $ S.map (subtract 1) . S.filter (<= streamLen)
420−-}
421−
422−-------------------------------------------------------------------------------
423−-- ConcatMap
424−-------------------------------------------------------------------------------
425−
426−-- concatMap unfoldrM/unfoldrM
427−
428−{-# INLINE concatMap #-}
429−concatMap :: Int -> Int -> Int -> IO ()
430−concatMap outer inner n =
431− S.drain $ D.toStreamK $ D.concatMap
432− (\_ -> D.fromStreamK $ unfoldrMK inner n)
433− (D.fromStreamK $ unfoldrMK outer n)
434−
435−#ifdef INSPECTION
436−inspect $ hasNoTypeClasses 'concatMap
437−#endif
438−
439−-- concatMap unfoldr/unfoldr
440−
441−{-
442−{-# INLINE concatMapPure #-}
443−concatMapPure :: Int -> Int -> Int -> IO ()
444−concatMapPure outer inner n =
445− S.drain $ S.concatMap
446− (\_ -> unfoldr inner n)
447− (unfoldr outer n)
448−
449−#ifdef INSPECTION
450−inspect $ hasNoTypeClasses 'concatMapPure
451−#endif
452−
453−-- concatMap replicate/unfoldrM
454−
455−{-# INLINE concatMapRepl #-}
456−concatMapRepl :: Int -> Int -> Int -> IO ()
457−concatMapRepl outer inner n =
458− S.drain $ S.concatMap (S.replicate inner) (unfoldrM outer n)
459−
460−#ifdef INSPECTION
461−inspect $ hasNoTypeClasses 'concatMapRepl
462−#endif
463−
464−-- concatMapWith
465−
466−{-# INLINE sourceConcatMapId #-}
467−sourceConcatMapId :: Monad m
468− => Int -> Int -> Stream m (Stream m Int)
469−sourceConcatMapId val n =
470− S.fromFoldable $ fmap (S.fromEffect . return) [n..n+val]
471−
472−{-# INLINE concatMapBySerial #-}
473−concatMapBySerial :: Int -> Int -> Int -> IO ()
474−concatMapBySerial outer inner n =
475− S.drain $ S.concatMapWith S.serial
476− (unfoldrM inner)
477− (unfoldrM outer n)
478−-}
479−
480−{-
481−-------------------------------------------------------------------------------
482−-- Nested Composition
483−-------------------------------------------------------------------------------
484−
485−instance Monad m => Applicative (S.Stream m) where
486− {-# INLINE pure #-}
487− pure = S.fromPure
488−
489− {-# INLINE (<*>) #-}
490− (<*>) = S.crossApply
491−
492− {-# INLINE liftA2 #-}
493− liftA2 f x = (<*>) (fmap f x)
494−
495− {-# INLINE (*>) #-}
496− (*>) = S.crossApplySnd
497−
498− {-# INLINE (<*) #-}
499− (<*) = S.crossApplyFst
500−
501−-- NOTE: even though concatMap for StreamD is 3x faster compared to StreamK,
502−-- the monad instance of StreamD is slower than StreamK after foldr/build
503−-- fusion.
504−instance Monad m => Monad (S.Stream m) where
505− {-# INLINE return #-}
506− return = pure
507−
508− {-# INLINE (>>=) #-}
509− (>>=) = flip S.concatMap
510−
511−{-# INLINE drainApplicative #-}
512−drainApplicative :: Monad m => Stream m Int -> m ()
513−drainApplicative s = drain $ do
514− (+) <$> s <*> s
515−
516−{-# INLINE drainMonad #-}
517−drainMonad :: Monad m => Stream m Int -> m ()
518−drainMonad s = drain $ do
519− x <- s
520− y <- s
521− return $ x + y
522−
523−{-# INLINE drainMonad3 #-}
524−drainMonad3 :: Monad m => Stream m Int -> m ()
525−drainMonad3 s = drain $ do
526− x <- s
527− y <- s
528− z <- s
529− return $ x + y + z
530−
531−{-# INLINE filterAllOutMonad #-}
532−filterAllOutMonad
533− :: Monad m
534− => Stream m Int -> m ()
535−filterAllOutMonad str = drain $ do
536− x <- str
537− y <- str
538− let s = x + y
539− if s < 0
540− then return s
541− else S.nil
542−
543−{-# INLINE filterAllInMonad #-}
544−filterAllInMonad
545− :: Monad m
546− => Stream m Int -> m ()
547−filterAllInMonad str = drain $ do
548− x <- str
549− y <- str
550− let s = x + y
551− if s > 0
552− then return s
553− else S.nil
554−
555−-------------------------------------------------------------------------------
556−-- Nested Composition Pure lists
557−-------------------------------------------------------------------------------
558−
559−-- There are several list benchmarks here for comparison with lists. It is easy
560−-- and convenient to see the comparisons when they are here, otherwise we'll
561−-- have to add a separate module for list benchmarks with the same names and
562−-- then add a comparison in bench.sh.
563−
564−{-# INLINE unfoldrList #-}
565−unfoldrList :: Int -> Int -> [Int]
566−unfoldrList maxval n = List.unfoldr step n
567− where
568− step cnt =
569− if cnt > n + maxval
570− then Nothing
571− else Just (cnt, cnt + 1)
572−
573−{-# INLINE toNullApNestedList #-}
574−toNullApNestedList :: [Int] -> [Int]
575−toNullApNestedList s = (+) <$> s <*> s
576−
577−{-# INLINE toNullNestedList #-}
578−toNullNestedList :: [Int] -> [Int]
579−toNullNestedList s = do
580− x <- s
581− y <- s
582− return $ x + y
583−
584−{-# INLINE toNullNestedList3 #-}
585−toNullNestedList3 :: [Int] -> [Int]
586−toNullNestedList3 s = do
587− x <- s
588− y <- s
589− z <- s
590− return $ x + y + z
591−
592−{-# INLINE filterAllOutNestedList #-}
593−filterAllOutNestedList :: [Int] -> [Int]
594−filterAllOutNestedList str = do
595− x <- str
596− y <- str
597− let s = x + y
598− if s < 0
599− then return s
600− else []
601−
602−{-# INLINE filterAllInNestedList #-}
603−filterAllInNestedList :: [Int] -> [Int]
604−filterAllInNestedList str = do
605− x <- str
606− y <- str
607− let s = x + y
608− if s > 0
609− then return s
610− else []
611− -}
612−
613−-------------------------------------------------------------------------------
614−-- Benchmarks
615−-------------------------------------------------------------------------------
616−
617−moduleName :: String
618−moduleName = "Data.Stream.ToStreamK"
619−
620−-- Generation of StreamK using StreamD generation functions and eleminating
621−-- using StreamK drain.
622−o_1_space_generation :: Int -> Benchmark
623−o_1_space_generation streamLen =
624− bgroup "generation"
625− [ benchFold "unfoldr" drain (unfoldrD streamLen)
626− , benchFold "unfoldrM" drain (unfoldrMD streamLen)
627− , benchFold "repeat" drain (repeat streamLen)
628− , benchFold "repeatM" drain (repeatM streamLen)
629− , benchFold "replicate" drain (replicate streamLen)
630− , benchFold "replicateM" drain (replicateM streamLen)
631− , benchFold "iterate" drain (iterate streamLen)
632− , benchFold "iterateM" drain (iterateM streamLen)
633−
634− , benchFold "fromFoldable" drain (fromFoldable streamLen)
635− , benchFold "fromFoldableM" drain (fromFoldableM streamLen)
636−
637− -- appends
638− , benchFold "concatMapFoldableWith" drain (concatMapFoldableSerial streamLen)
639− , benchFold "concatMapFoldableWithM" drain (concatMapFoldableSerialM streamLen)
640− ]
641−
642−-- Generating using StreamK and eliminating using StreamD folds.
643−o_1_space_elimination :: Int -> Benchmark
644−o_1_space_elimination streamLen =
645− bgroup "elimination"
646− [ benchFold "toNull" drainD (unfoldrMK streamLen)
647− , benchFold "mapM_" mapM_ (unfoldrMK streamLen)
648− -- , benchFold "uncons" uncons (unfoldrMK streamLen)
649− -- , benchFold "init" init (unfoldrM streamLen)
650− , benchFold "foldl'" foldl' (unfoldrMK streamLen)
651− , benchFold "last" last (unfoldrMK streamLen)
652− ]
653−
654−{-
655−o_1_space_nested :: Int -> Benchmark
656−o_1_space_nested streamLen =
657− bgroup "nested"
658− [ benchFold "drainApplicative" drainApplicative (unfoldrM streamLen2)
659− , benchFold "drainMonad" drainMonad (unfoldrM streamLen2)
660− , benchFold "drainMonad3" drainMonad3 (unfoldrM streamLen3)
661− , benchFold "filterAllInMonad" filterAllInMonad (unfoldrM streamLen2)
662− , benchFold "filterAllOutMonad" filterAllOutMonad (unfoldrM streamLen2)
663− , benchFold "drainApplicative (pure)" drainApplicative (unfoldr streamLen2)
664− , benchFold "drainMonad (pure)" drainMonad (unfoldr streamLen2)
665− , benchFold "drainMonad3 (pure)" drainMonad3 (unfoldr streamLen3)
666− , benchFold "filterAllInMonad (pure)" filterAllInMonad (unfoldr streamLen2)
667− , benchFold "filterAllOutMonad (pure)" filterAllOutMonad (unfoldr streamLen2)
668− ]
669− where
670− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
671− streamLen3 = round (P.fromIntegral streamLen**(1/3::P.Double)) -- triple nested loop
672−-}
673−
674−-- Generate using StreamK and transform using StreamD transformation functions
675−-- and then drain using StreamK.
676−o_1_space_transformation :: Int -> Benchmark
677−o_1_space_transformation streamLen =
678− bgroup "transformation"
679− [ -- benchFold "foldrS" (foldrS 1) (unfoldrM streamLen)
680− benchFold "scanl'" (scanl' 1) (unfoldrMK streamLen)
681− , benchFold "map" (map 1) (unfoldrMK streamLen)
682− -- , benchFold "fmap" (fmapK 1) (unfoldrM streamLen)
683− , benchFold "mapM" (mapM 1) (unfoldrMK streamLen)
684− -- , benchFold "mapMSerial" (mapMSerial 1) (unfoldrM streamLen)
685− ]
686−
687−o_1_space_transformationX4 :: Int -> Benchmark
688−o_1_space_transformationX4 streamLen =
689− bgroup "transformationX4"
690− [ benchFold "scanl'" (scanl' 4) (unfoldrMK streamLen)
691− , benchFold "map" (map 4) (unfoldrMK streamLen)
692− -- , benchFold "fmap" (fmapK 4) (unfoldrMK streamLen)
693− , benchFold "mapM" (mapM 4) (unfoldrMK streamLen)
694− -- , benchFold "mapMSerial" (mapMSerial 4) (unfoldrM streamLen)
695− -- XXX this is horribly slow
696− -- , benchFold "concatMap" (concatMap 4) (unfoldrM streamLen16)
697− ]
698−
699−-- Generate using K, fold using K, concat using D.concatMap
700−o_1_space_concat :: Int -> Benchmark
701−o_1_space_concat streamLen =
702− bgroup "concat"
703− [ {- benchIOSrc1 "concatMapPure (n of 1)"
704− (concatMapPure streamLen 1)
705− , benchIOSrc1 "concatMapPure (sqrt n of sqrt n)"
706− (concatMapPure streamLen2 streamLen2)
707− , benchIOSrc1 "concatMapPure (1 of n)"
708− (concatMapPure 1 streamLen)
709− -}
710−
711− benchIOSrc1 "concatMap (n of 1)"
712− (concatMap streamLen 1)
713− , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
714− (concatMap streamLen2 streamLen2)
715− , benchIOSrc1 "concatMap (1 of n)"
716− (concatMap 1 streamLen)
717−
718−{-
719− , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
720− (concatMapRepl streamLen2 streamLen2)
721−
722− -- This is for comparison with concatMapFoldableWith
723− , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
724− (S.drain
725− . S.concatMapWith S.serial id
726− . sourceConcatMapId streamLen)
727−
728− , benchIOSrc1 "concatMapBy serial (n of 1)"
729− (concatMapBySerial streamLen 1)
730− , benchIOSrc1 "concatMapBy serial (sqrt n of sqrt n)"
731− (concatMapBySerial streamLen2 streamLen2)
732− , benchIOSrc1 "concatMapBy serial (1 of n)"
733− (concatMapBySerial 1 streamLen)
734− , benchFold "sortBy" sortBy (unfoldrM streamLen)
735− -}
736− ]
737− where
738− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
739−
740−o_1_space_filtering :: Int -> Benchmark
741−o_1_space_filtering streamLen =
742− bgroup "filtering"
743− [ benchFold "filter-even" (filterEven 1) (unfoldrMK streamLen)
744− {-
745− , benchFold "filter-all-out" (filterAllOut streamLen 1) (unfoldrM streamLen)
746− , benchFold "filter-all-in" (filterAllIn streamLen 1) (unfoldrM streamLen)
747− , benchFold "take-all" (takeAll streamLen 1) (unfoldrM streamLen)
748− , benchFold "takeWhile-true" (takeWhileTrue streamLen 1) (unfoldrM streamLen)
749− , benchFold "drop-one" (dropOne 1) (unfoldrM streamLen)
750− , benchFold "drop-all" (dropAll streamLen 1) (unfoldrM streamLen)
751− , benchFold "dropWhile-true" (dropWhileTrue streamLen 1) (unfoldrM streamLen)
752− , benchFold "dropWhile-false" (dropWhileFalse 1) (unfoldrM streamLen)
753− -}
754− ]
755−
756−o_1_space_filteringX4 :: Int -> Benchmark
757−o_1_space_filteringX4 streamLen =
758− bgroup "filteringX4"
759− [ benchFold "filter-even" (filterEven 4) (unfoldrMK streamLen)
760− {-
761− , benchFold "filter-all-out" (filterAllOut streamLen 4) (unfoldrM streamLen)
762− , benchFold "filter-all-in" (filterAllIn streamLen 4) (unfoldrM streamLen)
763− , benchFold "take-all" (takeAll streamLen 4) (unfoldrM streamLen)
764− , benchFold "takeWhile-true" (takeWhileTrue streamLen 4) (unfoldrM streamLen)
765− , benchFold "drop-one" (dropOne 4) (unfoldrM streamLen)
766− , benchFold "drop-all" (dropAll streamLen 4) (unfoldrM streamLen)
767− , benchFold "dropWhile-true" (dropWhileTrue streamLen 4) (unfoldrM streamLen)
768− , benchFold "dropWhile-false" (dropWhileFalse 4) (unfoldrM streamLen)
769− -}
770− ]
771−
772−{-
773−o_1_space_zipping :: Int -> Benchmark
774−o_1_space_zipping streamLen =
775− bgroup "zipping"
776− [ benchFold "zipWith" zipWith (unfoldrM streamLen)
777− , benchFold "zipWithM" zipWithM (unfoldrM streamLen)
778− ]
779−
780−o_1_space_mixed :: Int -> Benchmark
781−o_1_space_mixed streamLen =
782− bgroup "mixed"
783− [ benchFold "scan-map" (scanMap 1) (unfoldrM streamLen)
784− , benchFold "drop-map" (dropMap 1) (unfoldrM streamLen)
785− , benchFold "drop-scan" (dropScan 1) (unfoldrM streamLen)
786− , benchFold "take-drop" (takeDrop streamLen 1) (unfoldrM streamLen)
787− , benchFold "take-scan" (takeScan streamLen 1) (unfoldrM streamLen)
788− , benchFold "take-map" (takeMap streamLen 1) (unfoldrM streamLen)
789− , benchFold "filter-drop" (filterDrop streamLen 1) (unfoldrM streamLen)
790− , benchFold "filter-take" (filterTake streamLen 1) (unfoldrM streamLen)
791− , benchFold "filter-scan" (filterScan 1) (unfoldrM streamLen)
792− , benchFold "filter-map" (filterMap streamLen 1) (unfoldrM streamLen)
793− ]
794−
795−o_1_space_mixedX2 :: Int -> Benchmark
796−o_1_space_mixedX2 streamLen =
797− bgroup "mixedX2"
798− [ benchFold "scan-map" (scanMap 2) (unfoldrM streamLen)
799− , benchFold "drop-map" (dropMap 2) (unfoldrM streamLen)
800− , benchFold "drop-scan" (dropScan 2) (unfoldrM streamLen)
801− , benchFold "take-drop" (takeDrop streamLen 2) (unfoldrM streamLen)
802− , benchFold "take-scan" (takeScan streamLen 2) (unfoldrM streamLen)
803− , benchFold "take-map" (takeMap streamLen 2) (unfoldrM streamLen)
804− , benchFold "filter-drop" (filterDrop streamLen 2) (unfoldrM streamLen)
805− , benchFold "filter-take" (filterTake streamLen 2) (unfoldrM streamLen)
806− , benchFold "filter-scan" (filterScan 2) (unfoldrM streamLen)
807− , benchFold "filter-map" (filterMap streamLen 2) (unfoldrM streamLen)
808− ]
809−
810−o_1_space_mixedX4 :: Int -> Benchmark
811−o_1_space_mixedX4 streamLen =
812− bgroup "mixedX4"
813− [ benchFold "scan-map" (scanMap 4) (unfoldrM streamLen)
814− , benchFold "drop-map" (dropMap 4) (unfoldrM streamLen)
815− , benchFold "drop-scan" (dropScan 4) (unfoldrM streamLen)
816− , benchFold "take-drop" (takeDrop streamLen 4) (unfoldrM streamLen)
817− , benchFold "take-scan" (takeScan streamLen 4) (unfoldrM streamLen)
818− , benchFold "take-map" (takeMap streamLen 4) (unfoldrM streamLen)
819− , benchFold "filter-drop" (filterDrop streamLen 4) (unfoldrM streamLen)
820− , benchFold "filter-take" (filterTake streamLen 4) (unfoldrM streamLen)
821− , benchFold "filter-scan" (filterScan 4) (unfoldrM streamLen)
822− , benchFold "filter-map" (filterMap streamLen 4) (unfoldrM streamLen)
823− ]
824− -}
825−
826−{-
827−o_1_space_list :: Int -> Benchmark
828−o_1_space_list streamLen =
829− bgroup "list"
830− [ bgroup "elimination"
831− [ benchList "last" (\xs -> [List.last xs]) (unfoldrList streamLen)
832− ]
833− , bgroup "nested"
834− [ benchList "toNullAp" toNullApNestedList (unfoldrList streamLen2)
835− , benchList "toNull" toNullNestedList (unfoldrList streamLen2)
836− , benchList "toNull3" toNullNestedList3 (unfoldrList streamLen3)
837− , benchList "filterAllIn" filterAllInNestedList (unfoldrList streamLen2)
838− , benchList "filterAllOut" filterAllOutNestedList (unfoldrList streamLen2)
839− ]
840− ]
841− where
842−
843− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
844− streamLen3 = round (P.fromIntegral streamLen**(1/3::P.Double)) -- triple nested loop
845−-}
846−
847−o_1_space :: Int -> Benchmark
848−o_1_space streamLen =
849− bgroup (o_1_space_prefix moduleName)
850− [ o_1_space_generation streamLen
851− , o_1_space_elimination streamLen
852− -- , o_1_space_nested streamLen
853− , o_1_space_transformation streamLen
854− , o_1_space_transformationX4 streamLen
855− , o_1_space_concat streamLen
856− , o_1_space_filtering streamLen
857− , o_1_space_filteringX4 streamLen
858− -- , o_1_space_zipping streamLen
859− -- , o_1_space_mixed streamLen
860− -- , o_1_space_mixedX2 streamLen
861− -- , o_1_space_mixedX4 streamLen
862− -- , o_1_space_list streamLen
863− ]
864−
865−{-
866−o_n_heap :: Int -> Benchmark
867−o_n_heap streamLen =
868− bgroup (o_n_heap_prefix moduleName)
869− [ bgroup "transformation"
870− [ benchFold "foldlS" (foldlS 1) (unfoldrM streamLen)
871− ]
872− ]
873−
874−{-# INLINE benchK #-}
875−benchK :: P.String -> (Int -> Stream P.IO Int) -> Benchmark
876−benchK name f = bench name $ nfIO $ randomRIO (1,1) >>= drain . f
877−
878−o_n_stack :: Int -> Int -> Int -> Benchmark
879−o_n_stack streamLen iterStreamLen maxIters =
880− bgroup (o_n_stack_prefix moduleName)
881− [ bgroup "elimination"
882− [ benchFold "tail" tail (unfoldrM streamLen)
883− , benchFold "nullTail" nullTail (unfoldrM streamLen)
884− , benchFold "headTail" headTail (unfoldrM streamLen)
885− ]
886− , bgroup "transformation"
887− [
888− -- XXX why do these need so much stack
889− benchFold "intersperse" (intersperse streamLen 1) (unfoldrM streamLen2)
890− , benchFold "interspersePure" (intersperse streamLen 1) (unfoldr streamLen2)
891− ]
892− , bgroup "transformationX4"
893− [
894− benchFold "intersperse" (intersperse streamLen 4) (unfoldrM streamLen16)
895− ]
896− , bgroup "iterated"
897− [ benchK "mapM" (iterateMapM iterStreamLen maxIters)
898− , benchK "scan(1/10)" (iterateScan iterStreamLen maxIters)
899− , benchK "filterEven" (iterateFilterEven iterStreamLen maxIters)
900− , benchK "takeAll" (iterateTakeAll streamLen iterStreamLen maxIters)
901− , benchK "dropOne" (iterateDropOne iterStreamLen maxIters)
902− , benchK "dropWhileFalse(1/10)" (iterateDropWhileFalse streamLen iterStreamLen maxIters)
903− , benchK "dropWhileTrue" (iterateDropWhileTrue streamLen iterStreamLen maxIters)
904− ]
905− ]
906− where
907− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
908− streamLen16 = round (P.fromIntegral streamLen**(1/16::P.Double)) -- triple nested loop
909−-}
910−
911−o_n_space :: Int -> Benchmark
912−o_n_space streamLen =
913− bgroup (o_n_space_prefix moduleName)
914− [ bgroup "elimination"
915− [ benchFold "toList" toList (unfoldrMK streamLen)
916− ]
917− ]
918−
919−{-
920−{-# INLINE benchList #-}
921−benchList :: P.String -> ([Int] -> [Int]) -> (Int -> [Int]) -> Benchmark
922−benchList name run f = bench name $ nfIO $ randomRIO (1,1) >>= return . run . f
923−-}
924−
925−main :: IO ()
926−main =
927− defaultMain
928− [ o_1_space streamLen
929− -- , o_n_stack streamLen iterStreamLen maxIters
930− -- , o_n_heap streamLen
931− , o_n_space streamLen
932− ]
933−
934− where
935−
936− streamLen = 100000
937− -- maxIters = 10000
938− -- iterStreamLen = 10
benchmark/Streamly/Benchmark/Data/Stream/Transform.hs+89−204
@@ -6,15 +6,9 @@
6
6
7{-# LANGUAGE CPP #-}
7{-# LANGUAGE CPP #-}
8{-# LANGUAGE FlexibleContexts #-}
8{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE FlexibleInstances #-}
10{-# LANGUAGE ScopedTypeVariables #-}
9{-# LANGUAGE ScopedTypeVariables #-}
11{-# LANGUAGE RankNTypes #-}
10{-# LANGUAGE RankNTypes #-}
12
11
13−{-# OPTIONS_GHC -Wno-orphans #-}
14−#ifdef USE_PRELUDE
15−{-# OPTIONS_GHC -Wno-deprecations #-}
16−#endif
17−
18#ifdef __HADDOCK_VERSION__
12#ifdef __HADDOCK_VERSION__
19#undef INSPECTION
13#undef INSPECTION
20#endif
14#endif
@@ -26,47 +20,32 @@
26
20
27module Stream.Transform (benchmarks) where
21module Stream.Transform (benchmarks) where
28
22
23+import Control.DeepSeq (NFData(..))
29import Control.Monad.IO.Class (MonadIO(..))
24import Control.Monad.IO.Class (MonadIO(..))
25+import Data.Functor.Identity (Identity)
30
26
31import System.Random (randomRIO)
27import System.Random (randomRIO)
32
28
33import qualified Streamly.Internal.Data.Fold as FL
29import qualified Streamly.Internal.Data.Fold as FL
34
30
31+import qualified Prelude
35import qualified Stream.Common as Common
32import qualified Stream.Common as Common
36import qualified Streamly.Internal.Data.Unfold as Unfold
33import qualified Streamly.Internal.Data.Unfold as Unfold
37−
38#ifdef USE_PRELUDE
34#ifdef USE_PRELUDE
39−import Control.DeepSeq (NFData(..))
35+import Streamly.Benchmark.Prelude (benchIO)
40−import Data.Functor.Identity (Identity(..))
41−import qualified Prelude
42−import qualified Streamly.Internal.Data.Fold as Fold
43import qualified Streamly.Internal.Data.Stream.IsStream as Stream
36import qualified Streamly.Internal.Data.Stream.IsStream as Stream
44import Streamly.Internal.Data.Time.Units
37import Streamly.Internal.Data.Time.Units
45#else
38#else
46−import Streamly.Internal.Data.Stream (Stream)
39+import Streamly.Benchmark.Prelude (benchIO)
47import qualified Streamly.Internal.Data.Stream as Stream
40import qualified Streamly.Internal.Data.Stream as Stream
48−#ifndef USE_STREAMLY_CORE
49−import qualified Streamly.Internal.Data.Stream.Prelude as Stream
50−#endif
51−#ifdef USE_STREAMK
52−import Control.DeepSeq (NFData(..))
53−import Data.Functor.Identity (Identity(..))
54−import qualified Prelude
55−import qualified Streamly.Internal.Data.Fold as Fold
56−import Streamly.Internal.Data.StreamK (StreamK)
57−import qualified Streamly.Internal.Data.StreamK as StreamK
58−#endif
59#endif
41#endif
60
42
61−import Test.Tasty.Bench
43+import Gauge
44+import Streamly.Internal.Data.Stream.Serial (SerialT)
62import Stream.Common hiding (scanl')
45import Stream.Common hiding (scanl')
63import Streamly.Benchmark.Common
46import Streamly.Benchmark.Common
64import Prelude hiding (sequence, mapM)
47import Prelude hiding (sequence, mapM)
65
48
66−#ifdef USE_PRELUDE
67−type Stream = Stream.SerialT
68−#endif
69−
70-------------------------------------------------------------------------------
49-------------------------------------------------------------------------------
71-- Pipelines (stream-to-stream transformations)
50-- Pipelines (stream-to-stream transformations)
72-------------------------------------------------------------------------------
51-------------------------------------------------------------------------------
@@ -79,36 +58,28 @@ type Stream = Stream.SerialT
79-- Traversable Instance
58-- Traversable Instance
80-------------------------------------------------------------------------------
59-------------------------------------------------------------------------------
81
60
82−#ifdef USE_STREAMK
83{-# INLINE traversableTraverse #-}
61{-# INLINE traversableTraverse #-}
84−traversableTraverse :: StreamK Identity Int -> IO (StreamK Identity Int)
62+traversableTraverse :: SerialT Identity Int -> IO (SerialT Identity Int)
85traversableTraverse = traverse return
63traversableTraverse = traverse return
86
64
87{-# INLINE traversableSequenceA #-}
65{-# INLINE traversableSequenceA #-}
88−traversableSequenceA :: StreamK Identity Int -> IO (StreamK Identity Int)
66+traversableSequenceA :: SerialT Identity Int -> IO (SerialT Identity Int)
89traversableSequenceA = sequenceA . Prelude.fmap return
67traversableSequenceA = sequenceA . Prelude.fmap return
90
68
91{-# INLINE traversableMapM #-}
69{-# INLINE traversableMapM #-}
92−traversableMapM :: StreamK Identity Int -> IO (StreamK Identity Int)
70+traversableMapM :: SerialT Identity Int -> IO (SerialT Identity Int)
93traversableMapM = Prelude.mapM return
71traversableMapM = Prelude.mapM return
94
72
95{-# INLINE traversableSequence #-}
73{-# INLINE traversableSequence #-}
96−traversableSequence :: StreamK Identity Int -> IO (StreamK Identity Int)
74+traversableSequence :: SerialT Identity Int -> IO (SerialT Identity Int)
97traversableSequence = Prelude.sequence . Prelude.fmap return
75traversableSequence = Prelude.sequence . Prelude.fmap return
98
76
99{-# INLINE benchPureSinkIO #-}
77{-# INLINE benchPureSinkIO #-}
100benchPureSinkIO
78benchPureSinkIO
101 :: NFData b
79 :: NFData b
102− => Int -> String -> (StreamK Identity Int -> IO b) -> Benchmark
80+ => Int -> String -> (SerialT Identity Int -> IO b) -> Benchmark
103benchPureSinkIO value name f =
81benchPureSinkIO value name f =
104− bench name
105− $ nfIO $ randomRIO (1, 1) >>= f . fromStream . sourceUnfoldr value
82+ bench name $ nfIO $ randomRIO (1, 1) >>= f . sourceUnfoldr value
106−
107−instance NFData a => NFData (StreamK Identity a) where
108− {-# INLINE rnf #-}
109− rnf xs =
110− runIdentity
111− $ Stream.fold (Fold.foldl' (\_ x -> rnf x) ()) (toStream xs)
112
83
113o_n_space_traversable :: Int -> [Benchmark]
84o_n_space_traversable :: Int -> [Benchmark]
114o_n_space_traversable value =
85o_n_space_traversable value =
@@ -121,7 +92,6 @@ o_n_space_traversable value =
121 , benchPureSinkIO value "sequence" traversableSequence
92 , benchPureSinkIO value "sequence" traversableSequence
122 ]
93 ]
123 ]
94 ]
124−#endif
125
95
126-------------------------------------------------------------------------------
96-------------------------------------------------------------------------------
127-- maps and scans
97-- maps and scans
@@ -129,51 +99,51 @@ o_n_space_traversable value =
129
99
130#ifdef USE_PRELUDE
100#ifdef USE_PRELUDE
131{-# INLINE scanl' #-}
101{-# INLINE scanl' #-}
132−scanl' :: MonadIO m => Int -> Stream m Int -> m ()
102+scanl' :: MonadIO m => Int -> SerialT m Int -> m ()
133scanl' n = composeN n $ Stream.scanl' (+) 0
103scanl' n = composeN n $ Stream.scanl' (+) 0
134
104
135{-# INLINE scanlM' #-}
105{-# INLINE scanlM' #-}
136−scanlM' :: MonadIO m => Int -> Stream m Int -> m ()
106+scanlM' :: MonadIO m => Int -> SerialT m Int -> m ()
137scanlM' n = composeN n $ Stream.scanlM' (\b a -> return $ b + a) (return 0)
107scanlM' n = composeN n $ Stream.scanlM' (\b a -> return $ b + a) (return 0)
138
108
139{-# INLINE scanl1' #-}
109{-# INLINE scanl1' #-}
140−scanl1' :: MonadIO m => Int -> Stream m Int -> m ()
110+scanl1' :: MonadIO m => Int -> SerialT m Int -> m ()
141scanl1' n = composeN n $ Stream.scanl1' (+)
111scanl1' n = composeN n $ Stream.scanl1' (+)
142
112
143{-# INLINE scanl1M' #-}
113{-# INLINE scanl1M' #-}
144−scanl1M' :: MonadIO m => Int -> Stream m Int -> m ()
114+scanl1M' :: MonadIO m => Int -> SerialT m Int -> m ()
145scanl1M' n = composeN n $ Stream.scanl1M' (\b a -> return $ b + a)
115scanl1M' n = composeN n $ Stream.scanl1M' (\b a -> return $ b + a)
146#endif
116#endif
147
117
148{-# INLINE scan #-}
118{-# INLINE scan #-}
149−scan :: MonadIO m => Int -> Stream m Int -> m ()
119+scan :: MonadIO m => Int -> SerialT m Int -> m ()
150scan n = composeN n $ Stream.scan FL.sum
120scan n = composeN n $ Stream.scan FL.sum
151
121
152#ifdef USE_PRELUDE
122#ifdef USE_PRELUDE
153{-# INLINE postscanl' #-}
123{-# INLINE postscanl' #-}
154−postscanl' :: MonadIO m => Int -> Stream m Int -> m ()
124+postscanl' :: MonadIO m => Int -> SerialT m Int -> m ()
155postscanl' n = composeN n $ Stream.postscanl' (+) 0
125postscanl' n = composeN n $ Stream.postscanl' (+) 0
156
126
157{-# INLINE postscanlM' #-}
127{-# INLINE postscanlM' #-}
158−postscanlM' :: MonadIO m => Int -> Stream m Int -> m ()
128+postscanlM' :: MonadIO m => Int -> SerialT m Int -> m ()
159postscanlM' n = composeN n $ Stream.postscanlM' (\b a -> return $ b + a) (return 0)
129postscanlM' n = composeN n $ Stream.postscanlM' (\b a -> return $ b + a) (return 0)
160#endif
130#endif
161
131
162{-# INLINE postscan #-}
132{-# INLINE postscan #-}
163−postscan :: MonadIO m => Int -> Stream m Int -> m ()
133+postscan :: MonadIO m => Int -> SerialT m Int -> m ()
164postscan n = composeN n $ Stream.postscan FL.sum
134postscan n = composeN n $ Stream.postscan FL.sum
165
135
166{-# INLINE sequence #-}
136{-# INLINE sequence #-}
167−sequence :: MonadAsync m => Stream m (m Int) -> m ()
137+sequence :: MonadAsync m => SerialT m (m Int) -> m ()
168sequence = Common.drain . Stream.sequence
138sequence = Common.drain . Stream.sequence
169
139
170{-# INLINE tap #-}
140{-# INLINE tap #-}
171−tap :: MonadIO m => Int -> Stream m Int -> m ()
141+tap :: MonadIO m => Int -> SerialT m Int -> m ()
172tap n = composeN n $ Stream.tap FL.sum
142tap n = composeN n $ Stream.tap FL.sum
173
143
174#ifdef USE_PRELUDE
144#ifdef USE_PRELUDE
175{-# INLINE pollCounts #-}
145{-# INLINE pollCounts #-}
176−pollCounts :: Int -> Stream IO Int -> IO ()
146+pollCounts :: Int -> SerialT IO Int -> IO ()
177pollCounts n =
147pollCounts n =
178 composeN n (Stream.pollCounts (const True) f)
148 composeN n (Stream.pollCounts (const True) f)
179
149
@@ -182,40 +152,28 @@ pollCounts n =
182 f = Stream.drain . Stream.rollingMap2 (-) . Stream.delayPost 1
152 f = Stream.drain . Stream.rollingMap2 (-) . Stream.delayPost 1
183
153
184{-# INLINE timestamped #-}
154{-# INLINE timestamped #-}
185−timestamped :: (MonadAsync m) => Stream m Int -> m ()
155+timestamped :: (MonadAsync m) => SerialT m Int -> m ()
186timestamped = Stream.drain . Stream.timestamped
156timestamped = Stream.drain . Stream.timestamped
187#endif
157#endif
188
158
189−#ifdef USE_STREAMK
190{-# INLINE foldrS #-}
159{-# INLINE foldrS #-}
191−foldrS :: MonadIO m => Int -> Stream m Int -> m ()
160+foldrS :: MonadIO m => Int -> SerialT m Int -> m ()
192−foldrS n =
193− composeN n (toStream . StreamK.foldrS StreamK.cons StreamK.nil . fromStream)
161+foldrS n = composeN n $ Stream.foldrS Stream.cons Stream.nil
194
162
195{-# INLINE foldrSMap #-}
163{-# INLINE foldrSMap #-}
196−foldrSMap :: MonadIO m => Int -> Stream m Int -> m ()
164+foldrSMap :: MonadIO m => Int -> SerialT m Int -> m ()
197−foldrSMap n =
198− composeN n
199− ( toStream
200− . StreamK.foldrS (\x xs -> x + 1 `StreamK.cons` xs) StreamK.nil
165+foldrSMap n = composeN n $ Stream.foldrS (\x xs -> x + 1 `Stream.cons` xs) Stream.nil
201− . fromStream
202− )
203−#endif
204
166
205−{-
206{-# INLINE foldrT #-}
167{-# INLINE foldrT #-}
207−foldrT :: MonadIO m => Int -> Stream m Int -> m ()
168+foldrT :: MonadIO m => Int -> SerialT m Int -> m ()
208−foldrT n = composeN n (unCrossStream . Stream.foldrT cns (CrossStream Stream.nil))
169+foldrT n = composeN n $ Stream.foldrT Stream.cons Stream.nil
209−
210− where cns x (CrossStream xs) = CrossStream (Stream.cons x xs)
211
170
212{-# INLINE foldrTMap #-}
171{-# INLINE foldrTMap #-}
213−foldrTMap :: MonadIO m => Int -> Stream m Int -> m ()
172+foldrTMap :: MonadIO m => Int -> SerialT m Int -> m ()
214foldrTMap n = composeN n $ Stream.foldrT (\x xs -> x + 1 `Stream.cons` xs) Stream.nil
173foldrTMap n = composeN n $ Stream.foldrT (\x xs -> x + 1 `Stream.cons` xs) Stream.nil
215−-}
216
174
217{-# INLINE trace #-}
175{-# INLINE trace #-}
218−trace :: MonadAsync m => Int -> Stream m Int -> m ()
176+trace :: MonadAsync m => Int -> SerialT m Int -> m ()
219trace n = composeN n $ Stream.trace return
177trace n = composeN n $ Stream.trace return
220
178
221o_1_space_mapping :: Int -> [Benchmark]
179o_1_space_mapping :: Int -> [Benchmark]
@@ -223,17 +181,14 @@ o_1_space_mapping value =
223 [ bgroup
181 [ bgroup
224 "mapping"
182 "mapping"
225 [
183 [
226−#ifdef USE_STREAMK
227 -- Right folds
184 -- Right folds
228 benchIOSink value "foldrS" (foldrS 1)
185 benchIOSink value "foldrS" (foldrS 1)
229 , benchIOSink value "foldrSMap" (foldrSMap 1)
186 , benchIOSink value "foldrSMap" (foldrSMap 1)
230− ,
231−#endif
232− -- , benchIOSink value "foldrT" (foldrT 1)
187+ , benchIOSink value "foldrT" (foldrT 1)
233− -- , benchIOSink value "foldrTMap" (foldrTMap 1)
188+ , benchIOSink value "foldrTMap" (foldrTMap 1)
234
189
235 -- Mapping
190 -- Mapping
236− benchIOSink value "map" (mapN 1)
191+ , benchIOSink value "map" (mapN 1)
237 , bench "sequence" $ nfIO $ randomRIO (1, 1000) >>= \n ->
192 , bench "sequence" $ nfIO $ randomRIO (1, 1000) >>= \n ->
238 sequence (sourceUnfoldrAction value n)
193 sequence (sourceUnfoldrAction value n)
239 , benchIOSink value "mapM" (mapM 1)
194 , benchIOSink value "mapM" (mapM 1)
@@ -274,7 +229,7 @@ o_1_space_mappingX4 value =
274 ]
229 ]
275
230
276{-# INLINE sieveScan #-}
231{-# INLINE sieveScan #-}
277−sieveScan :: Monad m => Stream m Int -> Stream m Int
232+sieveScan :: Monad m => SerialT m Int -> SerialT m Int
278sieveScan =
233sieveScan =
279 Stream.mapMaybe snd
234 Stream.mapMaybe snd
280 . Stream.scan (FL.foldlM' (\(primes, _) n -> do
235 . Stream.scan (FL.foldlM' (\(primes, _) n -> do
@@ -304,188 +259,117 @@ o_1_space_functor value =
304 ]
259 ]
305 ]
260 ]
306
261
307−-------------------------------------------------------------------------------
308−-- Iteration/looping utilities
309−-------------------------------------------------------------------------------
310−
311−{-# INLINE iterateN #-}
312−iterateN :: (Int -> a -> a) -> a -> Int -> a
313−iterateN g initial count = f count initial
314−
315− where
316−
317− f (0 :: Int) x = x
318− f i x = f (i - 1) (g i x)
319−
320−#ifdef USE_STREAMK
321−-- Iterate a transformation over a singleton stream
322−{-# INLINE iterateSingleton #-}
323−iterateSingleton :: Applicative m =>
324− (Int -> StreamK m Int -> StreamK m Int)
325− -> Int
326− -> Int
327− -> Stream m Int
328−iterateSingleton g count n = toStream $ iterateN g (StreamK.fromPure n) count
329−#else
330−-- Iterate a transformation over a singleton stream
331−{-# INLINE iterateSingleton #-}
332−iterateSingleton :: Applicative m =>
333− (Int -> Stream m Int -> Stream m Int)
334− -> Int
335− -> Int
336− -> Stream m Int
337−iterateSingleton g count n = iterateN g (Stream.fromPure n) count
338−#endif
339−
340−{-
341−-- XXX need to check why this is slower than the explicit recursion above, even
342−-- if the above code is written in a foldr like head recursive way. We also
343−-- need to try this with foldlM' once #150 is fixed.
344−-- However, it is perhaps best to keep the iteration benchmarks independent of
345−-- foldrM and any related fusion issues.
346−{-# INLINE _iterateSingleton #-}
347−_iterateSingleton ::
348− Monad m
349− => (Int -> Stream m Int -> Stream m Int)
350− -> Int
351− -> Int
352− -> Stream m Int
353−_iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
354−-}
355−
356−o_n_space_iterated :: Int -> [Benchmark]
357−o_n_space_iterated value =
358− [ bgroup "iterated"
359− [ benchIO "(+) (n times) (baseline)" $ \i0 ->
360− iterateN (\i acc -> acc >>= \n -> return $ i + n) (return i0) value
361− , benchIOSrc "(<$) (n times)" $
362− iterateSingleton (<$) value
363− , benchIOSrc "fmap (n times)" $
364− iterateSingleton (fmap . (+)) value
365− {-
366− , benchIOSrc fromSerial "_(<$) (n times)" $
367− _iterateSingleton (<$) value
368− , benchIOSrc fromSerial "_fmap (n times)" $
369− _iterateSingleton (fmap . (+)) value
370− -}
371− ]
372− ]
373−
374-------------------------------------------------------------------------------
262-------------------------------------------------------------------------------
375-- Size reducing transformations (filtering)
263-- Size reducing transformations (filtering)
376-------------------------------------------------------------------------------
264-------------------------------------------------------------------------------
377
265
378{-# INLINE filterEven #-}
266{-# INLINE filterEven #-}
379−filterEven :: MonadIO m => Int -> Stream m Int -> m ()
267+filterEven :: MonadIO m => Int -> SerialT m Int -> m ()
380filterEven n = composeN n $ Stream.filter even
268filterEven n = composeN n $ Stream.filter even
381
269
382{-# INLINE filterAllOut #-}
270{-# INLINE filterAllOut #-}
383−filterAllOut :: MonadIO m => Int -> Int -> Stream m Int -> m ()
271+filterAllOut :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
384filterAllOut value n = composeN n $ Stream.filter (> (value + 1))
272filterAllOut value n = composeN n $ Stream.filter (> (value + 1))
385
273
386{-# INLINE filterAllIn #-}
274{-# INLINE filterAllIn #-}
387−filterAllIn :: MonadIO m => Int -> Int -> Stream m Int -> m ()
275+filterAllIn :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
388filterAllIn value n = composeN n $ Stream.filter (<= (value + 1))
276filterAllIn value n = composeN n $ Stream.filter (<= (value + 1))
389
277
390{-# INLINE filterMEven #-}
278{-# INLINE filterMEven #-}
391−filterMEven :: MonadIO m => Int -> Stream m Int -> m ()
279+filterMEven :: MonadIO m => Int -> SerialT m Int -> m ()
392filterMEven n = composeN n $ Stream.filterM (return . even)
280filterMEven n = composeN n $ Stream.filterM (return . even)
393
281
394{-# INLINE filterMAllOut #-}
282{-# INLINE filterMAllOut #-}
395−filterMAllOut :: MonadIO m => Int -> Int -> Stream m Int -> m ()
283+filterMAllOut :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
396filterMAllOut value n = composeN n $ Stream.filterM (\x -> return $ x > (value + 1))
284filterMAllOut value n = composeN n $ Stream.filterM (\x -> return $ x > (value + 1))
397
285
398{-# INLINE filterMAllIn #-}
286{-# INLINE filterMAllIn #-}
399−filterMAllIn :: MonadIO m => Int -> Int -> Stream m Int -> m ()
287+filterMAllIn :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
400filterMAllIn value n = composeN n $ Stream.filterM (\x -> return $ x <= (value + 1))
288filterMAllIn value n = composeN n $ Stream.filterM (\x -> return $ x <= (value + 1))
401
289
402{-# INLINE _takeOne #-}
290{-# INLINE _takeOne #-}
403−_takeOne :: MonadIO m => Int -> Stream m Int -> m ()
291+_takeOne :: MonadIO m => Int -> SerialT m Int -> m ()
404_takeOne n = composeN n $ Stream.take 1
292_takeOne n = composeN n $ Stream.take 1
405
293
406{-# INLINE takeAll #-}
294{-# INLINE takeAll #-}
407−takeAll :: MonadIO m => Int -> Int -> Stream m Int -> m ()
295+takeAll :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
408takeAll value n = composeN n $ Stream.take (value + 1)
296takeAll value n = composeN n $ Stream.take (value + 1)
409
297
410{-# INLINE takeWhileTrue #-}
298{-# INLINE takeWhileTrue #-}
411−takeWhileTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
299+takeWhileTrue :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
412takeWhileTrue value n = composeN n $ Stream.takeWhile (<= (value + 1))
300takeWhileTrue value n = composeN n $ Stream.takeWhile (<= (value + 1))
413
301
414{-# INLINE takeWhileMTrue #-}
302{-# INLINE takeWhileMTrue #-}
415−takeWhileMTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
303+takeWhileMTrue :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
416takeWhileMTrue value n = composeN n $ Stream.takeWhileM (return . (<= (value + 1)))
304takeWhileMTrue value n = composeN n $ Stream.takeWhileM (return . (<= (value + 1)))
417
305
418−#if !defined(USE_STREAMLY_CORE) && !defined(USE_PRELUDE)
306+#ifdef USE_PRELUDE
419{-# INLINE takeInterval #-}
307{-# INLINE takeInterval #-}
420−takeInterval :: Double -> Int -> Stream IO Int -> IO ()
308+takeInterval :: NanoSecond64 -> Int -> SerialT IO Int -> IO ()
421takeInterval i n = composeN n (Stream.takeInterval i)
309takeInterval i n = composeN n (Stream.takeInterval i)
422
310
423−-- Inspection testing is disabled for takeInterval
424−-- Enable it when looking at it throughly
425#ifdef INSPECTION
311#ifdef INSPECTION
426-- inspect $ hasNoType 'takeInterval ''SPEC
312-- inspect $ hasNoType 'takeInterval ''SPEC
427−-- inspect $ hasNoTypeClasses 'takeInterval
313+inspect $ hasNoTypeClasses 'takeInterval
428-- inspect $ 'takeInterval `hasNoType` ''D.Step
314-- inspect $ 'takeInterval `hasNoType` ''D.Step
429#endif
315#endif
430−
431−{-# INLINE dropInterval #-}
432−dropInterval :: Double -> Int -> Stream IO Int -> IO ()
433−dropInterval i n = composeN n (Stream.dropInterval i)
434−
435−-- Inspection testing is disabled for dropInterval
436−-- Enable it when looking at it throughly
437−#ifdef INSPECTION
438−-- inspect $ hasNoTypeClasses 'dropInterval
439−-- inspect $ 'dropInterval `hasNoType` ''D.Step
440−#endif
441#endif
316#endif
442
317
443{-# INLINE dropOne #-}
318{-# INLINE dropOne #-}
444−dropOne :: MonadIO m => Int -> Stream m Int -> m ()
319+dropOne :: MonadIO m => Int -> SerialT m Int -> m ()
445dropOne n = composeN n $ Stream.drop 1
320dropOne n = composeN n $ Stream.drop 1
446
321
447{-# INLINE dropAll #-}
322{-# INLINE dropAll #-}
448−dropAll :: MonadIO m => Int -> Int -> Stream m Int -> m ()
323+dropAll :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
449dropAll value n = composeN n $ Stream.drop (value + 1)
324dropAll value n = composeN n $ Stream.drop (value + 1)
450
325
451{-# INLINE dropWhileTrue #-}
326{-# INLINE dropWhileTrue #-}
452−dropWhileTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
327+dropWhileTrue :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
453dropWhileTrue value n = composeN n $ Stream.dropWhile (<= (value + 1))
328dropWhileTrue value n = composeN n $ Stream.dropWhile (<= (value + 1))
454
329
455{-# INLINE dropWhileMTrue #-}
330{-# INLINE dropWhileMTrue #-}
456−dropWhileMTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
331+dropWhileMTrue :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
457dropWhileMTrue value n = composeN n $ Stream.dropWhileM (return . (<= (value + 1)))
332dropWhileMTrue value n = composeN n $ Stream.dropWhileM (return . (<= (value + 1)))
458
333
459{-# INLINE dropWhileFalse #-}
334{-# INLINE dropWhileFalse #-}
460−dropWhileFalse :: MonadIO m => Int -> Int -> Stream m Int -> m ()
335+dropWhileFalse :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
461dropWhileFalse value n = composeN n $ Stream.dropWhile (> (value + 1))
336dropWhileFalse value n = composeN n $ Stream.dropWhile (> (value + 1))
462
337
463#ifdef USE_PRELUDE
338#ifdef USE_PRELUDE
464-- XXX Decide on the time interval
339-- XXX Decide on the time interval
465{-# INLINE _intervalsOfSum #-}
340{-# INLINE _intervalsOfSum #-}
466−_intervalsOfSum :: MonadAsync m => Double -> Int -> Stream m Int -> m ()
341+_intervalsOfSum :: MonadAsync m => Double -> Int -> SerialT m Int -> m ()
467_intervalsOfSum i n = composeN n (Stream.intervalsOf i FL.sum)
342_intervalsOfSum i n = composeN n (Stream.intervalsOf i FL.sum)
343+
344+{-# INLINE dropInterval #-}
345+dropInterval :: NanoSecond64 -> Int -> SerialT IO Int -> IO ()
346+dropInterval i n = composeN n (Stream.dropInterval i)
347+
348+#ifdef INSPECTION
349+inspect $ hasNoTypeClasses 'dropInterval
350+-- inspect $ 'dropInterval `hasNoType` ''D.Step
351+#endif
468#endif
352#endif
469
353
470{-# INLINE findIndices #-}
354{-# INLINE findIndices #-}
471−findIndices :: MonadIO m => Int -> Int -> Stream m Int -> m ()
355+findIndices :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
472findIndices value n = composeN n $ Stream.findIndices (== (value + 1))
356findIndices value n = composeN n $ Stream.findIndices (== (value + 1))
473
357
474{-# INLINE elemIndices #-}
358{-# INLINE elemIndices #-}
475−elemIndices :: MonadIO m => Int -> Int -> Stream m Int -> m ()
359+elemIndices :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
476elemIndices value n = composeN n $ Stream.elemIndices (value + 1)
360elemIndices value n = composeN n $ Stream.elemIndices (value + 1)
477
361
478{-# INLINE deleteBy #-}
362{-# INLINE deleteBy #-}
479−deleteBy :: MonadIO m => Int -> Int -> Stream m Int -> m ()
363+deleteBy :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
480deleteBy value n = composeN n $ Stream.deleteBy (>=) (value + 1)
364deleteBy value n = composeN n $ Stream.deleteBy (>=) (value + 1)
481
365
482-- uniq . uniq == uniq, composeN 2 ~ composeN 1
366-- uniq . uniq == uniq, composeN 2 ~ composeN 1
483{-# INLINE uniq #-}
367{-# INLINE uniq #-}
484−uniq :: MonadIO m => Int -> Stream m Int -> m ()
368+uniq :: MonadIO m => Int -> SerialT m Int -> m ()
485uniq n = composeN n Stream.uniq
369uniq n = composeN n Stream.uniq
486
370
487{-# INLINE mapMaybe #-}
371{-# INLINE mapMaybe #-}
488−mapMaybe :: MonadIO m => Int -> Stream m Int -> m ()
372+mapMaybe :: MonadIO m => Int -> SerialT m Int -> m ()
489mapMaybe n =
373mapMaybe n =
490 composeN n $
374 composeN n $
491 Stream.mapMaybe
375 Stream.mapMaybe
@@ -495,7 +379,7 @@ mapMaybe n =
495 else Just x)
379 else Just x)
496
380
497{-# INLINE mapMaybeM #-}
381{-# INLINE mapMaybeM #-}
498−mapMaybeM :: MonadAsync m => Int -> Stream m Int -> m ()
382+mapMaybeM :: MonadAsync m => Int -> SerialT m Int -> m ()
499mapMaybeM n =
383mapMaybeM n =
500 composeN n $
384 composeN n $
501 Stream.mapMaybeM
385 Stream.mapMaybeM
@@ -521,9 +405,15 @@ o_1_space_filtering value =
521 -- , benchIOSink value "takeWhileM-true" (_takeWhileMTrue value 1)
405 -- , benchIOSink value "takeWhileM-true" (_takeWhileMTrue value 1)
522 , benchIOSink value "drop-one" (dropOne 1)
406 , benchIOSink value "drop-one" (dropOne 1)
523 , benchIOSink value "drop-all" (dropAll value 1)
407 , benchIOSink value "drop-all" (dropAll value 1)
524−#if !defined(USE_STREAMLY_CORE) && !defined(USE_PRELUDE)
408+#ifdef USE_PRELUDE
409+ , benchIOSink
410+ value
525− , benchIOSink value "takeInterval-all" (takeInterval 10000 1)
411+ "takeInterval-all"
412+ (takeInterval (NanoSecond64 maxBound) 1)
413+ , benchIOSink
414+ value
526− , benchIOSink value "dropInterval-all" (dropInterval 10000 1)
415+ "dropInterval-all"
416+ (dropInterval (NanoSecond64 maxBound) 1)
527#endif
417#endif
528 , benchIOSink value "dropWhile-true" (dropWhileTrue value 1)
418 , benchIOSink value "dropWhile-true" (dropWhileTrue value 1)
529 -- , benchIOSink value "dropWhileM-true" (_dropWhileMTrue value 1)
419 -- , benchIOSink value "dropWhileM-true" (_dropWhileMTrue value 1)
@@ -587,24 +477,24 @@ o_1_space_filteringX4 value =
587-------------------------------------------------------------------------------
477-------------------------------------------------------------------------------
588
478
589{-# INLINE intersperse #-}
479{-# INLINE intersperse #-}
590−intersperse :: MonadAsync m => Int -> Int -> Stream m Int -> m ()
480+intersperse :: MonadAsync m => Int -> Int -> SerialT m Int -> m ()
591intersperse value n = composeN n $ Stream.intersperse (value + 1)
481intersperse value n = composeN n $ Stream.intersperse (value + 1)
592
482
593{-# INLINE intersperseM #-}
483{-# INLINE intersperseM #-}
594−intersperseM :: MonadAsync m => Int -> Int -> Stream m Int -> m ()
484+intersperseM :: MonadAsync m => Int -> Int -> SerialT m Int -> m ()
595intersperseM value n = composeN n $ Stream.intersperseM (return $ value + 1)
485intersperseM value n = composeN n $ Stream.intersperseM (return $ value + 1)
596
486
597{-# INLINE insertBy #-}
487{-# INLINE insertBy #-}
598−insertBy :: MonadIO m => Int -> Int -> Stream m Int -> m ()
488+insertBy :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
599insertBy value n = composeN n $ Stream.insertBy compare (value + 1)
489insertBy value n = composeN n $ Stream.insertBy compare (value + 1)
600
490
601{-# INLINE interposeSuffix #-}
491{-# INLINE interposeSuffix #-}
602−interposeSuffix :: Monad m => Int -> Int -> Stream m Int -> m ()
492+interposeSuffix :: Monad m => Int -> Int -> SerialT m Int -> m ()
603interposeSuffix value n =
493interposeSuffix value n =
604 composeN n $ Stream.interposeSuffix (value + 1) Unfold.identity
494 composeN n $ Stream.interposeSuffix (value + 1) Unfold.identity
605
495
606{-# INLINE intercalateSuffix #-}
496{-# INLINE intercalateSuffix #-}
607−intercalateSuffix :: Monad m => Int -> Int -> Stream m Int -> m ()
497+intercalateSuffix :: Monad m => Int -> Int -> SerialT m Int -> m ()
608intercalateSuffix value n =
498intercalateSuffix value n =
609 composeN n $ Stream.intercalateSuffix Unfold.identity (value + 1)
499 composeN n $ Stream.intercalateSuffix Unfold.identity (value + 1)
610
500
@@ -632,11 +522,11 @@ o_1_space_insertingX4 value =
632-------------------------------------------------------------------------------
522-------------------------------------------------------------------------------
633
523
634{-# INLINE indexed #-}
524{-# INLINE indexed #-}
635−indexed :: MonadIO m => Int -> Stream m Int -> m ()
525+indexed :: MonadIO m => Int -> SerialT m Int -> m ()
636indexed n = composeN n (fmap snd . Stream.indexed)
526indexed n = composeN n (fmap snd . Stream.indexed)
637
527
638{-# INLINE indexedR #-}
528{-# INLINE indexedR #-}
639−indexedR :: MonadIO m => Int -> Int -> Stream m Int -> m ()
529+indexedR :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
640indexedR value n = composeN n (fmap snd . Stream.indexedR value)
530indexedR value n = composeN n (fmap snd . Stream.indexedR value)
641
531
642o_1_space_indexing :: Int -> [Benchmark]
532o_1_space_indexing :: Int -> [Benchmark]
@@ -676,12 +566,7 @@ benchmarks moduleName size =
676 , o_1_space_indexingX4 size
566 , o_1_space_indexingX4 size
677 ]
567 ]
678 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
568 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
679− [
680−#ifdef USE_STREAMK
681− o_n_space_traversable size
569+ [ o_n_space_traversable size
682− ,
683−#endif
684− o_n_space_mapping size
570+ , o_n_space_mapping size
685− , o_n_space_iterated size
686 ]
571 ]
687 ]
572 ]
benchmark/Streamly/Benchmark/Data/Unfold.hs+24−33
@@ -28,21 +28,21 @@ import System.IO (Handle, hClose)
28import System.Random (randomRIO)
28import System.Random (randomRIO)
29
29
30import qualified Prelude
30import qualified Prelude
31+import qualified Streamly.Data.Unfold as UF
31import qualified Streamly.FileSystem.Handle as FH
32import qualified Streamly.FileSystem.Handle as FH
32import qualified Streamly.Internal.Data.Fold as FL
33import qualified Streamly.Internal.Data.Fold as FL
33import qualified Streamly.Internal.Data.Unfold as UF
34import qualified Streamly.Internal.Data.Unfold as UF
34−import qualified Streamly.Internal.Data.Unfold.Prelude as UF
35+import qualified Streamly.Internal.Data.Stream.IsStream as S
35−import qualified Streamly.Internal.Data.Stream as S
36−import qualified Streamly.Internal.Data.Stream as D
36+import qualified Streamly.Internal.Data.Stream.StreamD as D
37−import qualified Streamly.Internal.Data.StreamK as K
37+import qualified Streamly.Internal.Data.Stream.StreamK as K
38+import qualified Streamly.Prelude as SP
38
39
39−import Test.Tasty.Bench hiding (env)
40+import Gauge hiding (env)
40import Prelude hiding (take, filter, zipWith, map, mapM, takeWhile)
41import Prelude hiding (take, filter, zipWith, map, mapM, takeWhile)
41import Streamly.Benchmark.Common
42import Streamly.Benchmark.Common
42import Streamly.Benchmark.Common.Handle
43import Streamly.Benchmark.Common.Handle
43
44
44#ifdef INSPECTION
45#ifdef INSPECTION
45−import Control.Monad.Catch (MonadCatch)
46import Test.Inspection
46import Test.Inspection
47#endif
47#endif
48
48
@@ -162,7 +162,7 @@ swap size start =
162{-# INLINE fromStream #-}
162{-# INLINE fromStream #-}
163fromStream :: Int -> Int -> IO ()
163fromStream :: Int -> Int -> IO ()
164fromStream size start =
164fromStream size start =
165− drainGeneration UF.fromStream (S.replicate size start :: S.Stream IO Int)
165+ drainGeneration UF.fromStream (S.replicate size start :: S.SerialT IO Int)
166
166
167-- XXX INVESTIGATE: Although the performance of this should be equivalant to
167-- XXX INVESTIGATE: Although the performance of this should be equivalant to
168-- fromStream, this is considerably worse. More than 4x worse.
168-- fromStream, this is considerably worse. More than 4x worse.
@@ -232,7 +232,7 @@ _fromProducer = undefined
232
232
233{-# INLINE replicateM #-}
233{-# INLINE replicateM #-}
234replicateM :: Monad m => Int -> Int -> m ()
234replicateM :: Monad m => Int -> Int -> m ()
235−replicateM size start = drainGeneration UF.replicateM (size, return start)
235+replicateM size start = drainGeneration (UF.replicateM size) (return start)
236
236
237{-# INLINE repeatM #-}
237{-# INLINE repeatM #-}
238repeatM :: Monad m => Int -> Int -> m ()
238repeatM :: Monad m => Int -> Int -> m ()
@@ -427,7 +427,7 @@ toNullAp value start =
427 let end = start + nthRoot 2 value
427 let end = start + nthRoot 2 value
428 s = source end
428 s = source end
429 -- in UF.fold ((+) <$> s <*> s) FL.drain start
429 -- in UF.fold ((+) <$> s <*> s) FL.drain start
430− in UF.fold FL.drain ((+) `fmap` s `UF.crossApply` s) start
430+ in UF.fold FL.drain ((+) `fmap` s `UF.apply` s) start
431
431
432{-# INLINE _apDiscardFst #-}
432{-# INLINE _apDiscardFst #-}
433_apDiscardFst :: Int -> Int -> m ()
433_apDiscardFst :: Int -> Int -> m ()
@@ -708,7 +708,7 @@ lf = fromIntegral (ord '\n')
708-- | Split on line feed.
708-- | Split on line feed.
709foldManySepBy :: Handle -> IO Int
709foldManySepBy :: Handle -> IO Int
710foldManySepBy =
710foldManySepBy =
711− let u = UF.foldMany (FL.takeEndBy_ (== lf) FL.drain) FH.reader
711+ let u = UF.foldMany (FL.takeEndBy_ (== lf) FL.drain) FH.read
712 in UF.fold FL.length u
712 in UF.fold FL.length u
713
713
714o_1_space_nested :: BenchEnv -> Int -> [Benchmark]
714o_1_space_nested :: BenchEnv -> Int -> [Benchmark]
@@ -749,11 +749,11 @@ o_n_space_nested size =
749-- | Send the file contents to /dev/null with exception handling
749-- | Send the file contents to /dev/null with exception handling
750readWriteOnExceptionUnfold :: Handle -> Handle -> IO ()
750readWriteOnExceptionUnfold :: Handle -> Handle -> IO ()
751readWriteOnExceptionUnfold inh devNull =
751readWriteOnExceptionUnfold inh devNull =
752− let readEx = UF.onException (\_ -> hClose inh) FH.reader
752+ let readEx = UF.onException (\_ -> hClose inh) FH.read
753− in S.fold (FH.write devNull) $ S.unfold readEx inh
753+ in SP.fold (FH.write devNull) $ SP.unfold readEx inh
754
754
755#ifdef INSPECTION
755#ifdef INSPECTION
756−-- inspect $ hasNoTypeClasses 'readWriteOnExceptionUnfold
756+inspect $ hasNoTypeClasses 'readWriteOnExceptionUnfold
757-- inspect $ 'readWriteOnExceptionUnfold `hasNoType` ''Step
757-- inspect $ 'readWriteOnExceptionUnfold `hasNoType` ''Step
758#endif
758#endif
759
759
@@ -761,54 +761,45 @@ readWriteOnExceptionUnfold inh devNull =
761readWriteHandleExceptionUnfold :: Handle -> Handle -> IO ()
761readWriteHandleExceptionUnfold :: Handle -> Handle -> IO ()
762readWriteHandleExceptionUnfold inh devNull =
762readWriteHandleExceptionUnfold inh devNull =
763 let handler (_e :: SomeException) = hClose inh >> return 10
763 let handler (_e :: SomeException) = hClose inh >> return 10
764− readEx = UF.handle (UF.functionM handler) FH.reader
764+ readEx = UF.handle (UF.functionM handler) FH.read
765− in S.fold (FH.write devNull) $ S.unfold readEx inh
765+ in SP.fold (FH.write devNull) $ SP.unfold readEx inh
766
766
767#ifdef INSPECTION
767#ifdef INSPECTION
768−-- hasNoTypeClasses started failing in GHC 9.4.4
769−-- inspect $ hasNoTypeClasses 'readWriteHandleExceptionUnfold
768+inspect $ hasNoTypeClasses 'readWriteHandleExceptionUnfold
770-- inspect $ 'readWriteHandleExceptionUnfold `hasNoType` ''Step
769-- inspect $ 'readWriteHandleExceptionUnfold `hasNoType` ''Step
771#endif
770#endif
772
771
773-- | Send the file contents to /dev/null with exception handling
772-- | Send the file contents to /dev/null with exception handling
774readWriteFinally_Unfold :: Handle -> Handle -> IO ()
773readWriteFinally_Unfold :: Handle -> Handle -> IO ()
775readWriteFinally_Unfold inh devNull =
774readWriteFinally_Unfold inh devNull =
776− let readEx = UF.finally_ (\_ -> hClose inh) FH.reader
775+ let readEx = UF.finally_ (\_ -> hClose inh) FH.read
777− in S.fold (FH.write devNull) $ S.unfold readEx inh
776+ in SP.fold (FH.write devNull) $ SP.unfold readEx inh
778
777
779#ifdef INSPECTION
778#ifdef INSPECTION
780−#if __GLASGOW_HASKELL__ >= 906
781−inspect $ hasNoTypeClassesExcept 'readWriteFinally_Unfold [''MonadCatch]
782−#else
783inspect $ hasNoTypeClasses 'readWriteFinally_Unfold
779inspect $ hasNoTypeClasses 'readWriteFinally_Unfold
784−#endif
785-- inspect $ 'readWriteFinallyUnfold `hasNoType` ''Step
780-- inspect $ 'readWriteFinallyUnfold `hasNoType` ''Step
786#endif
781#endif
787
782
788readWriteFinallyUnfold :: Handle -> Handle -> IO ()
783readWriteFinallyUnfold :: Handle -> Handle -> IO ()
789readWriteFinallyUnfold inh devNull =
784readWriteFinallyUnfold inh devNull =
790− let readEx = UF.finally (\_ -> hClose inh) FH.reader
785+ let readEx = UF.finally (\_ -> hClose inh) FH.read
791− in S.fold (FH.write devNull) $ S.unfold readEx inh
786+ in SP.fold (FH.write devNull) $ SP.unfold readEx inh
792
787
793-- | Send the file contents to /dev/null with exception handling
788-- | Send the file contents to /dev/null with exception handling
794readWriteBracket_Unfold :: Handle -> Handle -> IO ()
789readWriteBracket_Unfold :: Handle -> Handle -> IO ()
795readWriteBracket_Unfold inh devNull =
790readWriteBracket_Unfold inh devNull =
796− let readEx = UF.bracket_ return (\_ -> hClose inh) FH.reader
791+ let readEx = UF.bracket_ return (\_ -> hClose inh) FH.read
797− in S.fold (FH.write devNull) $ S.unfold readEx inh
792+ in SP.fold (FH.write devNull) $ SP.unfold readEx inh
798
793
799#ifdef INSPECTION
794#ifdef INSPECTION
800−#if __GLASGOW_HASKELL__ >= 906
801−inspect $ hasNoTypeClassesExcept 'readWriteBracket_Unfold [''MonadCatch]
802−#else
803inspect $ hasNoTypeClasses 'readWriteBracket_Unfold
795inspect $ hasNoTypeClasses 'readWriteBracket_Unfold
804−#endif
805-- inspect $ 'readWriteBracketUnfold `hasNoType` ''Step
796-- inspect $ 'readWriteBracketUnfold `hasNoType` ''Step
806#endif
797#endif
807
798
808readWriteBracketUnfold :: Handle -> Handle -> IO ()
799readWriteBracketUnfold :: Handle -> Handle -> IO ()
809readWriteBracketUnfold inh devNull =
800readWriteBracketUnfold inh devNull =
810− let readEx = UF.bracket return (\_ -> hClose inh) FH.reader
801+ let readEx = UF.bracket return (\_ -> hClose inh) FH.read
811− in S.fold (FH.write devNull) $ S.unfold readEx inh
802+ in SP.fold (FH.write devNull) $ S.unfold readEx inh
812
803
813o_1_space_copy_read_exceptions :: BenchEnv -> [Benchmark]
804o_1_space_copy_read_exceptions :: BenchEnv -> [Benchmark]
814o_1_space_copy_read_exceptions env =
805o_1_space_copy_read_exceptions env =
benchmark/Streamly/Benchmark/FileSystem/Handle.hs+1−1
@@ -22,7 +22,7 @@ import Streamly.Benchmark.Common.Handle (mkHandleBenchEnv)
22import qualified Handle.ReadWrite as RW
22import qualified Handle.ReadWrite as RW
23import qualified Handle.Read as RO
23import qualified Handle.Read as RO
24
24
25−import Test.Tasty.Bench hiding (env)
25+import Gauge hiding (env)
26import Prelude hiding (last, length)
26import Prelude hiding (last, length)
27import Streamly.Benchmark.Common
27import Streamly.Benchmark.Common
28
28
benchmark/Streamly/Benchmark/FileSystem/Handle/Read.hs+51−59
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Streamly.Benchmark.FileSystem.Handle
2-- Module : Streamly.Benchmark.FileSystem.Handle
5-- Copyright : (c) 2019 Composewell Technologies
3-- Copyright : (c) 2019 Composewell Technologies
@@ -29,26 +27,25 @@ import GHC.Magic (inline)
29import GHC.Magic (noinline)
27import GHC.Magic (noinline)
30import System.IO (Handle)
28import System.IO (Handle)
31
29
32−import qualified Streamly.Data.Stream as Stream
33−import qualified Streamly.Data.Fold as Fold
34import qualified Streamly.FileSystem.Handle as FH
30import qualified Streamly.FileSystem.Handle as FH
35−import qualified Streamly.Internal.Data.Array as A
31+import qualified Streamly.Internal.Data.Array.Unboxed as A
32+import qualified Streamly.Internal.Data.Array.Unboxed.Type as AT
36import qualified Streamly.Internal.Data.Fold as FL
33import qualified Streamly.Internal.Data.Fold as FL
37−import qualified Streamly.Internal.Data.Stream as IP
34+import qualified Streamly.Internal.Data.Stream.IsStream as IP
38import qualified Streamly.Internal.FileSystem.Handle as IFH
35import qualified Streamly.Internal.FileSystem.Handle as IFH
39import qualified Streamly.Internal.Unicode.Stream as IUS
36import qualified Streamly.Internal.Unicode.Stream as IUS
40−import qualified Streamly.Data.Stream.Prelude as S
37+import qualified Streamly.Prelude as S
41import qualified Streamly.Unicode.Stream as SS
38import qualified Streamly.Unicode.Stream as SS
42
39
43−import Test.Tasty.Bench hiding (env)
40+import Gauge hiding (env)
44import Prelude hiding (last, length)
41import Prelude hiding (last, length)
45import Streamly.Benchmark.Common.Handle
42import Streamly.Benchmark.Common.Handle
46
43
47#ifdef INSPECTION
44#ifdef INSPECTION
48−import Streamly.Internal.Data.Stream (Step(..), FoldMany)
45+import Streamly.Internal.Data.Stream.StreamD.Type (Step(..), FoldMany)
49
46
50−import qualified Streamly.Internal.Data.MutArray as MutArray
47+import qualified Streamly.Internal.Data.Array.Unboxed.Mut.Type as MA
51−import qualified Streamly.Internal.Data.Stream as D
48+import qualified Streamly.Internal.Data.Stream.StreamD as D
52import qualified Streamly.Internal.Data.Unfold as IUF
49import qualified Streamly.Internal.Data.Unfold as IUF
53
50
54import Test.Inspection
51import Test.Inspection
@@ -62,49 +59,49 @@ import Test.Inspection
62
59
63-- | Get the last byte from a file bytestream.
60-- | Get the last byte from a file bytestream.
64readLast :: Handle -> IO (Maybe Word8)
61readLast :: Handle -> IO (Maybe Word8)
65−readLast = S.fold Fold.last . S.unfold FH.reader
62+readLast = S.last . S.unfold FH.read
66
63
67#ifdef INSPECTION
64#ifdef INSPECTION
68inspect $ hasNoTypeClasses 'readLast
65inspect $ hasNoTypeClasses 'readLast
69inspect $ 'readLast `hasNoType` ''Step -- S.unfold
66inspect $ 'readLast `hasNoType` ''Step -- S.unfold
70inspect $ 'readLast `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
67inspect $ 'readLast `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
71−inspect $ 'readLast `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
68+inspect $ 'readLast `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
72#endif
69#endif
73
70
74-- assert that flattenArrays constructors are not present
71-- assert that flattenArrays constructors are not present
75-- | Count the number of bytes in a file.
72-- | Count the number of bytes in a file.
76readCountBytes :: Handle -> IO Int
73readCountBytes :: Handle -> IO Int
77−readCountBytes = S.fold Fold.length . S.unfold FH.reader
74+readCountBytes = S.length . S.unfold FH.read
78
75
79#ifdef INSPECTION
76#ifdef INSPECTION
80inspect $ hasNoTypeClasses 'readCountBytes
77inspect $ hasNoTypeClasses 'readCountBytes
81inspect $ 'readCountBytes `hasNoType` ''Step -- S.unfold
78inspect $ 'readCountBytes `hasNoType` ''Step -- S.unfold
82inspect $ 'readCountBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
79inspect $ 'readCountBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
83−inspect $ 'readCountBytes `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
80+inspect $ 'readCountBytes `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
84#endif
81#endif
85
82
86-- | Count the number of lines in a file.
83-- | Count the number of lines in a file.
87readCountLines :: Handle -> IO Int
84readCountLines :: Handle -> IO Int
88readCountLines =
85readCountLines =
89− S.fold Fold.length
86+ S.length
90 . IUS.lines FL.drain
87 . IUS.lines FL.drain
91 . SS.decodeLatin1
88 . SS.decodeLatin1
92− . S.unfold FH.reader
89+ . S.unfold FH.read
93
90
94#ifdef INSPECTION
91#ifdef INSPECTION
95inspect $ hasNoTypeClasses 'readCountLines
92inspect $ hasNoTypeClasses 'readCountLines
96inspect $ 'readCountLines `hasNoType` ''Step
93inspect $ 'readCountLines `hasNoType` ''Step
97inspect $ 'readCountLines `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
94inspect $ 'readCountLines `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
98−inspect $ 'readCountLines `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
95+inspect $ 'readCountLines `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
99#endif
96#endif
100
97
101-- | Count the number of words in a file.
98-- | Count the number of words in a file.
102readCountWords :: Handle -> IO Int
99readCountWords :: Handle -> IO Int
103readCountWords =
100readCountWords =
104− S.fold Fold.length
101+ S.length
105 . IUS.words FL.drain
102 . IUS.words FL.drain
106 . SS.decodeLatin1
103 . SS.decodeLatin1
107− . S.unfold FH.reader
104+ . S.unfold FH.read
108
105
109#ifdef INSPECTION
106#ifdef INSPECTION
110inspect $ hasNoTypeClasses 'readCountWords
107inspect $ hasNoTypeClasses 'readCountWords
@@ -113,13 +110,13 @@ inspect $ hasNoTypeClasses 'readCountWords
113
110
114-- | Sum the bytes in a file.
111-- | Sum the bytes in a file.
115readSumBytes :: Handle -> IO Word8
112readSumBytes :: Handle -> IO Word8
116−readSumBytes = S.fold Fold.sum . S.unfold FH.reader
113+readSumBytes = S.sum . S.unfold FH.read
117
114
118#ifdef INSPECTION
115#ifdef INSPECTION
119inspect $ hasNoTypeClasses 'readSumBytes
116inspect $ hasNoTypeClasses 'readSumBytes
120inspect $ 'readSumBytes `hasNoType` ''Step
117inspect $ 'readSumBytes `hasNoType` ''Step
121inspect $ 'readSumBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
118inspect $ 'readSumBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
122−inspect $ 'readSumBytes `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
119+inspect $ 'readSumBytes `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
123#endif
120#endif
124
121
125-- XXX When we mark this with INLINE and we have two benchmarks using S.drain
122-- XXX When we mark this with INLINE and we have two benchmarks using S.drain
@@ -133,21 +130,21 @@ inspect $ 'readSumBytes `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
133-- fusion-plugin to propagate INLINE phase information such that this problem
130-- fusion-plugin to propagate INLINE phase information such that this problem
134-- does not occur.
131-- does not occur.
135readDrain :: Handle -> IO ()
132readDrain :: Handle -> IO ()
136−readDrain inh = S.fold Fold.drain $ S.unfold FH.reader inh
133+readDrain inh = S.drain $ S.unfold FH.read inh
137
134
138-- XXX investigate why we need an INLINE in this case (GHC)
135-- XXX investigate why we need an INLINE in this case (GHC)
139{-# INLINE readDecodeLatin1 #-}
136{-# INLINE readDecodeLatin1 #-}
140readDecodeLatin1 :: Handle -> IO ()
137readDecodeLatin1 :: Handle -> IO ()
141readDecodeLatin1 inh =
138readDecodeLatin1 inh =
142− S.fold Fold.drain
139+ S.drain
143 $ SS.decodeLatin1
140 $ SS.decodeLatin1
144− $ S.unfold FH.reader inh
141+ $ S.unfold FH.read inh
145
142
146readDecodeUtf8 :: Handle -> IO ()
143readDecodeUtf8 :: Handle -> IO ()
147readDecodeUtf8 inh =
144readDecodeUtf8 inh =
148− S.fold Fold.drain
145+ S.drain
149 $ SS.decodeUtf8
146 $ SS.decodeUtf8
150− $ S.unfold FH.reader inh
147+ $ S.unfold FH.read inh
151
148
152#ifdef INSPECTION
149#ifdef INSPECTION
153inspect $ hasNoTypeClasses 'readDecodeUtf8
150inspect $ hasNoTypeClasses 'readDecodeUtf8
@@ -188,11 +185,11 @@ o_1_space_reduce_read env =
188-- | Count the number of lines in a file.
185-- | Count the number of lines in a file.
189getChunksConcatUnfoldCountLines :: Handle -> IO Int
186getChunksConcatUnfoldCountLines :: Handle -> IO Int
190getChunksConcatUnfoldCountLines inh =
187getChunksConcatUnfoldCountLines inh =
191− S.fold Fold.length
188+ S.length
192 $ IUS.lines FL.drain
189 $ IUS.lines FL.drain
193 $ SS.decodeLatin1
190 $ SS.decodeLatin1
194 -- XXX replace with toBytes
191 -- XXX replace with toBytes
195− $ S.unfoldMany A.reader (IFH.readChunks inh)
192+ $ S.unfoldMany A.read (IFH.getChunks inh)
196
193
197#ifdef INSPECTION
194#ifdef INSPECTION
198inspect $ hasNoTypeClasses 'getChunksConcatUnfoldCountLines
195inspect $ hasNoTypeClasses 'getChunksConcatUnfoldCountLines
@@ -213,51 +210,46 @@ o_1_space_reduce_toBytes env =
213-------------------------------------------------------------------------------
210-------------------------------------------------------------------------------
214
211
215chunksOfSum :: Int -> Handle -> IO Int
212chunksOfSum :: Int -> Handle -> IO Int
216−chunksOfSum n inh =
217− S.fold Fold.length $ IP.groupsOf n FL.sum (S.unfold FH.reader inh)
213+chunksOfSum n inh = S.length $ S.chunksOf n FL.sum (S.unfold FH.read inh)
218
214
219foldManyPostChunksOfSum :: Int -> Handle -> IO Int
215foldManyPostChunksOfSum :: Int -> Handle -> IO Int
220foldManyPostChunksOfSum n inh =
216foldManyPostChunksOfSum n inh =
221− S.fold Fold.length
222− $ IP.foldManyPost (FL.take n FL.sum) (S.unfold FH.reader inh)
217+ S.length $ IP.foldManyPost (FL.take n FL.sum) (S.unfold FH.read inh)
223
218
224foldManyChunksOfSum :: Int -> Handle -> IO Int
219foldManyChunksOfSum :: Int -> Handle -> IO Int
225foldManyChunksOfSum n inh =
220foldManyChunksOfSum n inh =
226− S.fold Fold.length
227− $ IP.foldMany (FL.take n FL.sum) (S.unfold FH.reader inh)
221+ S.length $ IP.foldMany (FL.take n FL.sum) (S.unfold FH.read inh)
228
222
229-- XXX investigate why we need an INLINE in this case (GHC)
223-- XXX investigate why we need an INLINE in this case (GHC)
230-- Even though allocations remain the same in both cases inlining improves time
224-- Even though allocations remain the same in both cases inlining improves time
231-- by 4x.
225-- by 4x.
232-- | Slice in chunks of size n and get the count of chunks.
226-- | Slice in chunks of size n and get the count of chunks.
233−{-# INLINE groupsOf #-}
227+{-# INLINE chunksOf #-}
234−groupsOf :: Int -> Handle -> IO Int
228+chunksOf :: Int -> Handle -> IO Int
235−groupsOf n inh =
229+chunksOf n inh =
236 -- writeNUnsafe gives 2.5x boost here over writeN.
230 -- writeNUnsafe gives 2.5x boost here over writeN.
237− S.fold Fold.length
238− $ IP.groupsOf n (A.writeNUnsafe n) (S.unfold FH.reader inh)
231+ S.length $ S.chunksOf n (AT.writeNUnsafe n) (S.unfold FH.read inh)
239
232
240#ifdef INSPECTION
233#ifdef INSPECTION
241−inspect $ hasNoTypeClasses 'groupsOf
234+inspect $ hasNoTypeClasses 'chunksOf
242−inspect $ 'groupsOf `hasNoType` ''Step
235+inspect $ 'chunksOf `hasNoType` ''Step
243−inspect $ 'groupsOf `hasNoType` ''FoldMany
236+inspect $ 'chunksOf `hasNoType` ''FoldMany
244−inspect $ 'groupsOf `hasNoType` ''MutArray.ArrayUnsafe -- AT.writeNUnsafe
237+inspect $ 'chunksOf `hasNoType` ''AT.ArrayUnsafe -- AT.writeNUnsafe
245 -- FH.read/A.read
238 -- FH.read/A.read
246−inspect $ 'groupsOf `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
239+inspect $ 'chunksOf `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
247#endif
240#endif
248
241
249−{-# INLINE chunksOf #-}
242+{-# INLINE arraysOf #-}
250−chunksOf :: Int -> Handle -> IO Int
243+arraysOf :: Int -> Handle -> IO Int
251−chunksOf n inh =
252− S.fold Fold.length $ Stream.chunksOf n (S.unfold FH.reader inh)
244+arraysOf n inh = S.length $ IP.arraysOf n (S.unfold FH.read inh)
253
245
254o_1_space_reduce_read_grouped :: BenchEnv -> [Benchmark]
246o_1_space_reduce_read_grouped :: BenchEnv -> [Benchmark]
255o_1_space_reduce_read_grouped env =
247o_1_space_reduce_read_grouped env =
256 [ bgroup "reduce/read/chunks"
248 [ bgroup "reduce/read/chunks"
257− [ mkBench ("S.groupsOf " ++ show (bigSize env) ++ " FL.sum") env $
249+ [ mkBench ("S.chunksOf " ++ show (bigSize env) ++ " FL.sum") env $
258 \inh _ ->
250 \inh _ ->
259 chunksOfSum (bigSize env) inh
251 chunksOfSum (bigSize env) inh
260− , mkBench "S.groupsOf 1 FL.sum" env $ \inh _ ->
252+ , mkBench "S.chunksOf 1 FL.sum" env $ \inh _ ->
261 chunksOfSum 1 inh
253 chunksOfSum 1 inh
262
254
263 -- XXX investigate why we need inline/noinline in these cases (GHC)
255 -- XXX investigate why we need inline/noinline in these cases (GHC)
@@ -280,20 +272,20 @@ o_1_space_reduce_read_grouped env =
280 $ \inh _ -> inline foldManyChunksOfSum 1 inh
272 $ \inh _ -> inline foldManyChunksOfSum 1 inh
281
273
282 -- folding chunks to arrays
274 -- folding chunks to arrays
283− , mkBenchSmall "S.groupsOf 1" env $ \inh _ ->
284− groupsOf 1 inh
285− , mkBench "S.groupsOf 10" env $ \inh _ ->
286− groupsOf 10 inh
287− , mkBench "S.groupsOf 1000" env $ \inh _ ->
288− groupsOf 1000 inh
289−
290− -- chunksOf may use a different impl than groupsOf
291 , mkBenchSmall "S.chunksOf 1" env $ \inh _ ->
275 , mkBenchSmall "S.chunksOf 1" env $ \inh _ ->
292 chunksOf 1 inh
276 chunksOf 1 inh
293 , mkBench "S.chunksOf 10" env $ \inh _ ->
277 , mkBench "S.chunksOf 10" env $ \inh _ ->
294 chunksOf 10 inh
278 chunksOf 10 inh
295 , mkBench "S.chunksOf 1000" env $ \inh _ ->
279 , mkBench "S.chunksOf 1000" env $ \inh _ ->
296 chunksOf 1000 inh
280 chunksOf 1000 inh
281+
282+ -- arraysOf may use a different impl than chunksOf
283+ , mkBenchSmall "S.arraysOf 1" env $ \inh _ ->
284+ arraysOf 1 inh
285+ , mkBench "S.arraysOf 10" env $ \inh _ ->
286+ arraysOf 10 inh
287+ , mkBench "S.arraysOf 1000" env $ \inh _ ->
288+ arraysOf 1000 inh
297 ]
289 ]
298 ]
290 ]
299
291
benchmark/Streamly/Benchmark/FileSystem/Handle/ReadWrite.hs+22−23
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Streamly.Benchmark.FileSystem.Handle
2-- Module : Streamly.Benchmark.FileSystem.Handle
5-- Copyright : (c) 2019 Composewell Technologies
3-- Copyright : (c) 2019 Composewell Technologies
@@ -31,18 +29,19 @@ import Streamly.Internal.System.IO (defaultChunkSize)
31import qualified Streamly.FileSystem.Handle as FH
29import qualified Streamly.FileSystem.Handle as FH
32import qualified Streamly.Internal.Data.Unfold as IUF
30import qualified Streamly.Internal.Data.Unfold as IUF
33import qualified Streamly.Internal.FileSystem.Handle as IFH
31import qualified Streamly.Internal.FileSystem.Handle as IFH
34−import qualified Streamly.Data.Array as A
32+import qualified Streamly.Data.Array.Unboxed as A
35−import qualified Streamly.Data.Stream.Prelude as S
33+import qualified Streamly.Prelude as S
36
34
37−import Test.Tasty.Bench hiding (env)
35+import Gauge hiding (env)
38import Streamly.Benchmark.Common.Handle
36import Streamly.Benchmark.Common.Handle
39
37
40#ifdef INSPECTION
38#ifdef INSPECTION
41−import Streamly.Internal.Data.Stream (Step(..))
39+import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
42
40
43−import qualified Streamly.Internal.Data.Stream as D
41+import qualified Streamly.Internal.Data.Stream.StreamD.Type as D
44import qualified Streamly.Internal.Data.Tuple.Strict as Strict
42import qualified Streamly.Internal.Data.Tuple.Strict as Strict
45−import qualified Streamly.Internal.Data.MutArray as MutArray
43+import qualified Streamly.Internal.Data.Array.Stream.Mut.Foreign as MAS
44+import qualified Streamly.Internal.Data.Array.Unboxed.Type as AT
46
45
47import Test.Inspection
46import Test.Inspection
48#endif
47#endif
@@ -53,7 +52,7 @@ import Test.Inspection
53
52
54-- | Copy file
53-- | Copy file
55copyChunks :: Handle -> Handle -> IO ()
54copyChunks :: Handle -> Handle -> IO ()
56−copyChunks inh outh = S.fold (IFH.writeChunks outh) $ IFH.readChunks inh
55+copyChunks inh outh = S.fold (IFH.writeChunks outh) $ IFH.getChunks inh
57
56
58#ifdef INSPECTION
57#ifdef INSPECTION
59inspect $ hasNoTypeClasses 'copyChunks
58inspect $ hasNoTypeClasses 'copyChunks
@@ -76,13 +75,13 @@ o_1_space_copy_chunked env =
76
75
77-- | Copy file
76-- | Copy file
78copyStream :: Handle -> Handle -> IO ()
77copyStream :: Handle -> Handle -> IO ()
79−copyStream inh outh = S.fold (FH.write outh) (S.unfold FH.reader inh)
78+copyStream inh outh = S.fold (FH.write outh) (S.unfold FH.read inh)
80
79
81#ifdef INSPECTION
80#ifdef INSPECTION
82inspect $ hasNoTypeClasses 'copyStream
81inspect $ hasNoTypeClasses 'copyStream
83inspect $ 'copyStream `hasNoType` ''Step -- S.unfold
82inspect $ 'copyStream `hasNoType` ''Step -- S.unfold
84inspect $ 'copyStream `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
83inspect $ 'copyStream `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
85−inspect $ 'copyStream `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
84+inspect $ 'copyStream `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
86 -- FH.read/A.read
85 -- FH.read/A.read
87inspect $ 'copyStream `hasNoType` ''Strict.Tuple3' -- FH.write/chunksOf
86inspect $ 'copyStream `hasNoType` ''Strict.Tuple3' -- FH.write/chunksOf
88#endif
87#endif
@@ -103,13 +102,13 @@ o_1_space_copy_read env =
103
102
104-- | Send the file contents to /dev/null
103-- | Send the file contents to /dev/null
105readFromBytesNull :: Handle -> Handle -> IO ()
104readFromBytesNull :: Handle -> Handle -> IO ()
106−readFromBytesNull inh devNull = IFH.putBytes devNull $ S.unfold FH.reader inh
105+readFromBytesNull inh devNull = IFH.putBytes devNull $ S.unfold FH.read inh
107
106
108#ifdef INSPECTION
107#ifdef INSPECTION
109inspect $ hasNoTypeClasses 'readFromBytesNull
108inspect $ hasNoTypeClasses 'readFromBytesNull
110inspect $ 'readFromBytesNull `hasNoType` ''Step
109inspect $ 'readFromBytesNull `hasNoType` ''Step
111−inspect $ 'readFromBytesNull `hasNoType` ''MutArray.SpliceState
110+inspect $ 'readFromBytesNull `hasNoType` ''MAS.SpliceState
112−inspect $ 'readFromBytesNull `hasNoType` ''MutArray.ArrayUnsafe -- FH.fromBytes/S.chunksOf
111+inspect $ 'readFromBytesNull `hasNoType` ''AT.ArrayUnsafe -- FH.fromBytes/S.arraysOf
113inspect $ 'readFromBytesNull `hasNoType` ''D.FoldMany
112inspect $ 'readFromBytesNull `hasNoType` ''D.FoldMany
114#endif
113#endif
115
114
@@ -117,13 +116,13 @@ inspect $ 'readFromBytesNull `hasNoType` ''D.FoldMany
117readWithFromBytesNull :: Handle -> Handle -> IO ()
116readWithFromBytesNull :: Handle -> Handle -> IO ()
118readWithFromBytesNull inh devNull =
117readWithFromBytesNull inh devNull =
119 IFH.putBytes devNull
118 IFH.putBytes devNull
120− $ S.unfold FH.readerWith (defaultChunkSize, inh)
119+ $ S.unfold FH.readWith (defaultChunkSize, inh)
121
120
122#ifdef INSPECTION
121#ifdef INSPECTION
123inspect $ hasNoTypeClasses 'readWithFromBytesNull
122inspect $ hasNoTypeClasses 'readWithFromBytesNull
124inspect $ 'readWithFromBytesNull `hasNoType` ''Step
123inspect $ 'readWithFromBytesNull `hasNoType` ''Step
125−inspect $ 'readWithFromBytesNull `hasNoType` ''MutArray.SpliceState
124+inspect $ 'readWithFromBytesNull `hasNoType` ''MAS.SpliceState
126−inspect $ 'readWithFromBytesNull `hasNoType` ''MutArray.ArrayUnsafe -- FH.fromBytes/S.chunksOf
125+inspect $ 'readWithFromBytesNull `hasNoType` ''AT.ArrayUnsafe -- FH.fromBytes/S.arraysOf
127inspect $ 'readWithFromBytesNull `hasNoType` ''D.FoldMany
126inspect $ 'readWithFromBytesNull `hasNoType` ''D.FoldMany
128#endif
127#endif
129
128
@@ -135,7 +134,7 @@ _readChunks inh devNull = IUF.fold fld unf inh
135 where
134 where
136
135
137 fld = FH.write devNull
136 fld = FH.write devNull
138− unf = IUF.many A.reader FH.chunkReader
137+ unf = IUF.many A.read FH.readChunks
139
138
140-- | Send the chunk content to /dev/null
139-- | Send the chunk content to /dev/null
141-- Implicitly benchmarked via 'readWithFromBytesNull'
140-- Implicitly benchmarked via 'readWithFromBytesNull'
@@ -145,7 +144,7 @@ _readChunksWith inh devNull = IUF.fold fld unf (defaultChunkSize, inh)
145 where
144 where
146
145
147 fld = FH.write devNull
146 fld = FH.write devNull
148− unf = IUF.many A.reader FH.chunkReaderWith
147+ unf = IUF.many A.read FH.readChunksWith
149
148
150o_1_space_copy_fromBytes :: BenchEnv -> [Benchmark]
149o_1_space_copy_fromBytes :: BenchEnv -> [Benchmark]
151o_1_space_copy_fromBytes env =
150o_1_space_copy_fromBytes env =
@@ -164,13 +163,13 @@ writeReadWith inh devNull = IUF.fold fld unf (defaultChunkSize, inh)
164 where
163 where
165
164
166 fld = FH.writeWith defaultChunkSize devNull
165 fld = FH.writeWith defaultChunkSize devNull
167− unf = FH.readerWith
166+ unf = FH.readWith
168
167
169#ifdef INSPECTION
168#ifdef INSPECTION
170inspect $ hasNoTypeClasses 'writeReadWith
169inspect $ hasNoTypeClasses 'writeReadWith
171inspect $ 'writeReadWith `hasNoType` ''Step
170inspect $ 'writeReadWith `hasNoType` ''Step
172inspect $ 'writeReadWith `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
171inspect $ 'writeReadWith `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
173−inspect $ 'writeReadWith `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
172+inspect $ 'writeReadWith `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
174 -- FH.read/A.read
173 -- FH.read/A.read
175#endif
174#endif
176
175
@@ -181,13 +180,13 @@ writeRead inh devNull = IUF.fold fld unf inh
181 where
180 where
182
181
183 fld = FH.write devNull
182 fld = FH.write devNull
184− unf = FH.reader
183+ unf = FH.read
185
184
186#ifdef INSPECTION
185#ifdef INSPECTION
187inspect $ hasNoTypeClasses 'writeRead
186inspect $ hasNoTypeClasses 'writeRead
188inspect $ 'writeRead `hasNoType` ''Step
187inspect $ 'writeRead `hasNoType` ''Step
189inspect $ 'writeRead `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
188inspect $ 'writeRead `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
190−inspect $ 'writeRead `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
189+inspect $ 'writeRead `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
191 -- FH.read/A.read
190 -- FH.read/A.read
192#endif
191#endif
193
192
benchmark/Streamly/Benchmark/Prelude/Adaptive.hs+6−11
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Main
2-- Module : Main
5-- Copyright : (c) 2018 Composewell Technologies
3-- Copyright : (c) 2018 Composewell Technologies
@@ -10,7 +8,7 @@
10import Control.Concurrent (threadDelay)
8import Control.Concurrent (threadDelay)
11import Control.Monad (when)
9import Control.Monad (when)
12import Control.Monad.IO.Class (liftIO)
10import Control.Monad.IO.Class (liftIO)
13−import Test.Tasty.Bench
11+import Gauge
14import Streamly.Prelude as S
12import Streamly.Prelude as S
15import System.Random (randomRIO)
13import System.Random (randomRIO)
16
14
@@ -36,14 +34,11 @@ source range = S.replicateM value $ do
36
34
37{-# INLINE run #-}
35{-# INLINE run #-}
38run :: IsStream t => (Int, Int) -> (Int, Int) -> (t IO Int -> SerialT IO Int) -> IO ()
36run :: IsStream t => (Int, Int) -> (Int, Int) -> (t IO Int -> SerialT IO Int) -> IO ()
39−run srange crange t = S.drain $ S.mapM action (t $ source srange)
37+run srange crange t = S.drain $ do
40−
38+ n <- t $ source srange
41− where
42−
43− action x = liftIO $ do
44− d <- randomRIO crange
39+ d <- liftIO (randomRIO crange)
45− when (d /= 0) $ threadDelay d
40+ when (d /= 0) $ liftIO $ threadDelay d
46− return x
41+ return n
47
42
48low, medium, high :: Int
43low, medium, high :: Int
49low = 10
44low = 10
benchmark/Streamly/Benchmark/Prelude/Ahead.hs+1−3
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Main
2-- Module : Main
5-- Copyright : (c) 2018 Composewell Technologies
3-- Copyright : (c) 2018 Composewell Technologies
@@ -15,7 +13,7 @@ import qualified Streamly.Prelude as S
15import Streamly.Benchmark.Common
13import Streamly.Benchmark.Common
16import Streamly.Benchmark.Prelude
14import Streamly.Benchmark.Prelude
17
15
18−import Test.Tasty.Bench
16+import Gauge
19
17
20moduleName :: String
18moduleName :: String
21moduleName = "Prelude.Ahead"
19moduleName = "Prelude.Ahead"
benchmark/Streamly/Benchmark/Prelude/Async.hs+3−5
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Main
2-- Module : Main
5-- Copyright : (c) 2018 Composewell Technologies
3-- Copyright : (c) 2018 Composewell Technologies
@@ -16,7 +14,7 @@ import qualified Streamly.Internal.Data.Stream.IsStream.Transform as Transform
16import Streamly.Benchmark.Common
14import Streamly.Benchmark.Common
17import Streamly.Benchmark.Prelude
15import Streamly.Benchmark.Prelude
18
16
19−import Test.Tasty.Bench
17+import Gauge
20
18
21moduleName :: String
19moduleName :: String
22moduleName = "Prelude.Async"
20moduleName = "Prelude.Async"
@@ -124,9 +122,9 @@ o_1_space_concatFoldable value =
124 (sourceFoldMapWithStream value)
122 (sourceFoldMapWithStream value)
125 , benchIOSrc fromAsync "foldMapWithM (<>) (List)"
123 , benchIOSrc fromAsync "foldMapWithM (<>) (List)"
126 (sourceFoldMapWithM value)
124 (sourceFoldMapWithM value)
127− , benchIOSrc fromAsync "S.concatFoldableWith (<>) (List)"
125+ , benchIOSrc fromSerial "S.concatFoldableWith (<>) (List)"
128 (concatFoldableWith value)
126 (concatFoldableWith value)
129− , benchIOSrc fromAsync "S.concatForFoldableWith (<>) (List)"
127+ , benchIOSrc fromSerial "S.concatForFoldableWith (<>) (List)"
130 (concatForFoldableWith value)
128 (concatForFoldableWith value)
131 , benchIOSrc fromAsync "foldMapM (List)" (sourceFoldMapM value)
129 , benchIOSrc fromAsync "foldMapM (List)" (sourceFoldMapM value)
132 ]
130 ]
benchmark/Streamly/Benchmark/Prelude/Concurrent.hs+1−2
@@ -1,4 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2{-# LANGUAGE CPP #-}
1{-# LANGUAGE CPP #-}
3{-# LANGUAGE RankNTypes #-}
2{-# LANGUAGE RankNTypes #-}
4-- |
3-- |
@@ -15,7 +14,7 @@ import Streamly.Prelude
15 , fromWAsync, parallel, fromParallel
14 , fromWAsync, parallel, fromParallel
16 )
15 )
17
16
18−import Test.Tasty.Bench
17+import Gauge
19import qualified Streamly.Prelude as S
18import qualified Streamly.Prelude as S
20
19
21-------------------------------------------------------------------------------
20-------------------------------------------------------------------------------
benchmark/Streamly/Benchmark/Prelude/Merge.hs+2−4
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Main
2-- Module : Main
5-- Copyright : (c) 2018 Composewell Technologies
3-- Copyright : (c) 2018 Composewell Technologies
@@ -30,13 +28,13 @@ import qualified Streamly.Internal.Data.Stream.IsStream as Stream
30import Streamly.Benchmark.Common
28import Streamly.Benchmark.Common
31import Streamly.Benchmark.Prelude
29import Streamly.Benchmark.Prelude
32
30
33−import Test.Tasty.Bench
31+import Gauge
34
32
35#ifdef INSPECTION
33#ifdef INSPECTION
36import GHC.Types (SPEC(..))
34import GHC.Types (SPEC(..))
37import Test.Inspection
35import Test.Inspection
38
36
39−import qualified Streamly.Internal.Data.Stream as D
37+import qualified Streamly.Internal.Data.Stream.StreamD as D
40#endif
38#endif
41
39
42moduleName :: String
40moduleName :: String
benchmark/Streamly/Benchmark/Prelude/Parallel.hs+1−3
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Main
2-- Module : Main
5-- Copyright : (c) 2018 Composewell Technologies
3-- Copyright : (c) 2018 Composewell Technologies
@@ -22,7 +20,7 @@ import qualified Streamly.Internal.Data.Stream.IsStream as Internal
22import Streamly.Benchmark.Common
20import Streamly.Benchmark.Common
23import Streamly.Benchmark.Prelude
21import Streamly.Benchmark.Prelude
24
22
25−import Test.Tasty.Bench
23+import Gauge
26
24
27moduleName :: String
25moduleName :: String
28moduleName = "Prelude.Parallel"
26moduleName = "Prelude.Parallel"
benchmark/Streamly/Benchmark/Prelude/Rate.hs+1−2
@@ -1,4 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2{-# LANGUAGE FlexibleContexts #-}
1{-# LANGUAGE FlexibleContexts #-}
3
2
4-- |
3-- |
@@ -14,7 +13,7 @@ import qualified Streamly.Prelude as S
14import Streamly.Benchmark.Common
13import Streamly.Benchmark.Common
15import Streamly.Benchmark.Prelude
14import Streamly.Benchmark.Prelude
16
15
17−import Test.Tasty.Bench
16+import Gauge
18
17
19moduleName :: String
18moduleName :: String
20moduleName = "Prelude.Rate"
19moduleName = "Prelude.Rate"
benchmark/Streamly/Benchmark/Prelude/WAsync.hs+1−3
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Main
2-- Module : Main
5-- Copyright : (c) 2018 Composewell Technologies
3-- Copyright : (c) 2018 Composewell Technologies
@@ -15,7 +13,7 @@ import qualified Streamly.Prelude as S
15import Streamly.Benchmark.Common
13import Streamly.Benchmark.Common
16import Streamly.Benchmark.Prelude
14import Streamly.Benchmark.Prelude
17
15
18−import Test.Tasty.Bench
16+import Gauge
19
17
20moduleName :: String
18moduleName :: String
21moduleName = "Prelude.WAsync"
19moduleName = "Prelude.WAsync"
benchmark/Streamly/Benchmark/Prelude/WSerial.hs+2−4
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Main
2-- Module : Main
5-- Copyright : (c) 2018 Composewell Technologies
3-- Copyright : (c) 2018 Composewell Technologies
@@ -29,13 +27,13 @@ import qualified Streamly.Internal.Data.Unfold as UF
29import Streamly.Benchmark.Common
27import Streamly.Benchmark.Common
30import Streamly.Benchmark.Prelude
28import Streamly.Benchmark.Prelude
31
29
32−import Test.Tasty.Bench
30+import Gauge
33
31
34#ifdef INSPECTION
32#ifdef INSPECTION
35import GHC.Types (SPEC(..))
33import GHC.Types (SPEC(..))
36import Test.Inspection
34import Test.Inspection
37
35
38−import qualified Streamly.Internal.Data.Stream as D
36+import qualified Streamly.Internal.Data.Stream.StreamD as D
39#endif
37#endif
40
38
41moduleName :: String
39moduleName :: String
benchmark/Streamly/Benchmark/Prelude/ZipAsync.hs+1−3
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Main
2-- Module : Main
5-- Copyright : (c) 2018 Composewell Technologies
3-- Copyright : (c) 2018 Composewell Technologies
@@ -15,7 +13,7 @@ import qualified Streamly.Prelude as S
15import Streamly.Benchmark.Common
13import Streamly.Benchmark.Common
16import Streamly.Benchmark.Prelude
14import Streamly.Benchmark.Prelude
17
15
18−import Test.Tasty.Bench
16+import Gauge
19
17
20moduleName :: String
18moduleName :: String
21moduleName = "Prelude.ZipAsync"
19moduleName = "Prelude.ZipAsync"
benchmark/Streamly/Benchmark/Prelude/ZipSerial.hs+2−4
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Main
2-- Module : Main
5-- Copyright : (c) 2018 Composewell Technologies
3-- Copyright : (c) 2018 Composewell Technologies
@@ -29,13 +27,13 @@ import qualified Streamly.Prelude as S
29import Streamly.Benchmark.Common
27import Streamly.Benchmark.Common
30import Streamly.Benchmark.Prelude hiding (sourceUnfoldrM)
28import Streamly.Benchmark.Prelude hiding (sourceUnfoldrM)
31
29
32−import Test.Tasty.Bench
30+import Gauge
33
31
34#ifdef INSPECTION
32#ifdef INSPECTION
35import GHC.Types (SPEC(..))
33import GHC.Types (SPEC(..))
36import Test.Inspection
34import Test.Inspection
37
35
38−import qualified Streamly.Internal.Data.Stream as D
36+import qualified Streamly.Internal.Data.Stream.StreamD as D
39#endif
37#endif
40
38
41moduleName :: String
39moduleName :: String
benchmark/Streamly/Benchmark/Unicode/Char.hs+10−18
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations -Wno-orphans #-}
2−
3--
1--
4-- Module : Streamly.Unicode.Char
2-- Module : Streamly.Unicode.Char
5-- Copyright : (c) 2021 Composewell Technologies
3-- Copyright : (c) 2021 Composewell Technologies
@@ -12,19 +10,19 @@
12-- Imports
10-- Imports
13--------------------------------------------------------------------------------
11--------------------------------------------------------------------------------
14
12
15−import Control.DeepSeq (NFData(..))
13+import Control.DeepSeq (NFData)
16−import Streamly.Internal.Data.Array (Array)
14+import Streamly.Internal.Data.Array.Unboxed (Array)
17import System.FilePath (dropExtensions, takeFileName)
15import System.FilePath (dropExtensions, takeFileName)
18import System.FilePath.Posix ((</>))
16import System.FilePath.Posix ((</>))
19−import Test.Tasty.Bench (Benchmark, bench, bgroup, defaultMain, env, nfIO)
17+import Gauge.Main (Benchmark, bench, bgroup, defaultMain, env, nfIO)
20import Streamly.Internal.Unicode.Char
18import Streamly.Internal.Unicode.Char
21 ( NormalizationMode(NFC, NFD, NFKC, NFKD)
19 ( NormalizationMode(NFC, NFD, NFKC, NFKD)
22 , normalize
20 , normalize
23 )
21 )
24import Streamly.Benchmark.Common (o_1_space_prefix)
22import Streamly.Benchmark.Common (o_1_space_prefix)
25
23
26−import qualified Streamly.Internal.Data.Array as Array
24+import qualified Streamly.Internal.Data.Array.Unboxed as Array
27−import qualified Streamly.Internal.Data.Stream as IsStream
25+import qualified Streamly.Internal.Data.Stream.IsStream as IsStream
28import qualified System.Directory as Dir
26import qualified System.Directory as Dir
29
27
30--------------------------------------------------------------------------------
28--------------------------------------------------------------------------------
@@ -43,13 +41,7 @@ dataDir = "benchmark/Streamly/Benchmark/Unicode/data"
43dataSetSize :: Int
41dataSetSize :: Int
44dataSetSize = 1000000
42dataSetSize = 1000000
45
43
46−-- Unboxed arrays are fully evaluated.
47−instance NFData (Array a) where
48− {-# INLINE rnf #-}
49− rnf _ = ()
50−
51−makeBench ::
52− (String, Array Char -> IO ()) -> (String, IO (Array Char)) -> Benchmark
44+makeBench :: (NFData a) => (String, a -> IO ()) -> (String, IO a) -> Benchmark
53makeBench (implName, func) (dataName, setup) =
45makeBench (implName, func) (dataName, setup) =
54 env setup (bench (implName ++ "/" ++ dataName) . nfIO . func)
46 env setup (bench (implName ++ "/" ++ dataName) . nfIO . func)
55
47
@@ -73,10 +65,10 @@ arrInput file = second (fmap Array.fromList) (strInput file)
73
65
74benchFunctions :: [(String, Array Char -> IO ())]
66benchFunctions :: [(String, Array Char -> IO ())]
75benchFunctions =
67benchFunctions =
76− [ ("NFD", IsStream.drain . normalize NFD . Array.read)
68+ [ ("NFD", IsStream.drain . normalize NFD . Array.toStream)
77− , ("NFKD", IsStream.drain . normalize NFKD . Array.read)
69+ , ("NFKD", IsStream.drain . normalize NFKD . Array.toStream)
78− , ("NFC", IsStream.drain . normalize NFC . Array.read)
70+ , ("NFC", IsStream.drain . normalize NFC . Array.toStream)
79− , ("NFKC", IsStream.drain . normalize NFKC . Array.read)
71+ , ("NFKC", IsStream.drain . normalize NFKC . Array.toStream)
80 ]
72 ]
81
73
82main :: IO ()
74main :: IO ()
benchmark/Streamly/Benchmark/Unicode/Parser.hsdeleted−107
@@ -1,107 +0,0 @@
1−-- |
2−-- Module : Streamly.Benchmark.Data.Parser
3−-- Copyright : (c) 2020 Composewell Technologies
4−--
5−-- License : BSD-3-Clause
6−-- Maintainer : streamly@composewell.com
7−
8−{-# LANGUAGE CPP #-}
9−{-# LANGUAGE FlexibleContexts #-}
10−{-# LANGUAGE ScopedTypeVariables #-}
11−{-# OPTIONS_GHC -Wno-orphans #-}
12−
13−#undef FUSION_CHECK
14−#ifdef FUSION_CHECK
15−{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
16−#endif
17−
18−module Main
19− (
20− main
21− ) where
22−
23−import Control.DeepSeq (NFData(..))
24−import Control.Monad (replicateM_)
25−import Streamly.Internal.Data.Parser (ParseError(..))
26−import Streamly.Internal.Data.Stream (Stream)
27−import Prelude hiding
28− (any, all, take, sequence, sequence_, sequenceA, takeWhile, dropWhile)
29−
30−import qualified Streamly.Data.Array as Array
31−import qualified Streamly.Data.Stream as Stream
32−import qualified Streamly.Internal.Unicode.Parser as PRU
33−
34−import Test.Tasty.Bench hiding (env)
35−import Streamly.Benchmark.Common
36−
37−runParser :: Int -> (Stream IO Char -> IO a) -> IO ()
38−runParser count p = do
39− let v = "+123456789.123456789e-123"
40− let !(arr :: Array.Array Char) = Array.fromListN (length v) v
41− let s = Stream.unfold Array.reader arr
42− replicateM_ count (p s)
43−
44−-- | Takes a fold method, and uses it with a default source.
45−{-# INLINE benchIOSink #-}
46−benchIOSink :: Int -> String -> (Stream IO Char -> IO b) -> Benchmark
47−benchIOSink value name f = bench name $ nfIO $ runParser value f
48−
49−{-# INLINE doubleParser #-}
50−doubleParser :: Monad m => Stream m Char -> m (Either ParseError (Int, Int))
51−doubleParser = Stream.parse PRU.doubleParser
52−
53−{-# INLINE number #-}
54−number :: Monad m => Stream m Char -> m (Either ParseError (Integer, Int))
55−number = Stream.parse PRU.number
56−
57−{-# INLINE double #-}
58−double :: Monad m => Stream m Char -> m (Either ParseError Double)
59−double = Stream.parse PRU.double
60−
61−{-# INLINE numberDouble #-}
62−numberDouble :: Monad m => Stream m Char -> m (Either ParseError Double)
63−numberDouble = Stream.parse p
64− where p = uncurry PRU.mkDouble <$> PRU.number
65−
66−-------------------------------------------------------------------------------
67−-- Benchmarks
68−-------------------------------------------------------------------------------
69−
70−moduleName :: String
71−moduleName = "Unicode.Parser"
72−
73−instance NFData ParseError where
74− {-# INLINE rnf #-}
75− rnf (ParseError x) = rnf x
76−
77−o_n_heap_serial :: Int -> [Benchmark]
78−o_n_heap_serial value =
79− [
80− benchIOSink value "doubleParser" doubleParser
81− , benchIOSink value "number" number
82− , benchIOSink value "double (doubleParser)" double
83− , benchIOSink value "double (number)" numberDouble
84− ]
85−
86−-------------------------------------------------------------------------------
87−-- Driver
88−-------------------------------------------------------------------------------
89−
90−main :: IO ()
91−main = do
92−#ifndef FUSION_CHECK
93− runWithCLIOpts defaultStreamSize allBenchmarks
94−
95− where
96−
97− allBenchmarks value =
98− [ bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
99− ]
100−#else
101− -- Enable FUSION_CHECK macro at the beginning of the file
102− -- Enable one benchmark below, and run the benchmark
103− -- Check the .dump-simpl output
104− let value = 100000
105− runParser value double
106− return ()
107−#endif
benchmark/Streamly/Benchmark/Unicode/Stream.hs+31−58
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3--
1--
4-- Module : Streamly.Unicode.Stream
2-- Module : Streamly.Unicode.Stream
5-- Copyright : (c) 2019 Composewell Technologies
3-- Copyright : (c) 2019 Composewell Technologies
@@ -11,11 +9,6 @@
11{-# LANGUAGE CPP #-}
9{-# LANGUAGE CPP #-}
12{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE ScopedTypeVariables #-}
13
11
14−#undef FUSION_CHECK
15−#ifdef FUSION_CHECK
16−{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
17−#endif
18−
19#ifdef __HADDOCK_VERSION__
12#ifdef __HADDOCK_VERSION__
20#undef INSPECTION
13#undef INSPECTION
21#endif
14#endif
@@ -25,30 +18,28 @@
25{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
18{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
26#endif
19#endif
27
20
28−import Streamly.Data.Stream (Stream)
29−import Streamly.Data.Fold (Fold)
30import Prelude hiding (last, length)
21import Prelude hiding (last, length)
31import System.IO (Handle)
22import System.IO (Handle)
32
23
33−import qualified Streamly.Data.Array as Array
24+import qualified Streamly.Data.Array.Unboxed as Array
34import qualified Streamly.Data.Fold as Fold
25import qualified Streamly.Data.Fold as Fold
26+import qualified Streamly.FileSystem.Handle as Handle
35−import qualified Streamly.Internal.Data.Stream as Stream
27+import qualified Streamly.Internal.Data.Stream.IsStream as Stream
36import qualified Streamly.Internal.Data.Unfold as Unfold
28import qualified Streamly.Internal.Data.Unfold as Unfold
37import qualified Streamly.Internal.FileSystem.Handle as Handle
29import qualified Streamly.Internal.FileSystem.Handle as Handle
38−import qualified Streamly.Internal.Unicode.Array as UnicodeArr
30+import qualified Streamly.Internal.Unicode.Array.Char as UnicodeArr
39import qualified Streamly.Internal.Unicode.Stream as Unicode
31import qualified Streamly.Internal.Unicode.Stream as Unicode
40
32
41−import Test.Tasty.Bench hiding (env)
33+import Gauge hiding (env)
42import Streamly.Benchmark.Common
34import Streamly.Benchmark.Common
43import Streamly.Benchmark.Common.Handle
35import Streamly.Benchmark.Common.Handle
44
36
45#ifdef INSPECTION
37#ifdef INSPECTION
46−import Streamly.Internal.Data.MutByteArray (Unbox)
38+import Streamly.Internal.Data.Unboxed (Unboxed)
47−import Streamly.Internal.Data.Stream (Step(..))
39+import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
48−import qualified Streamly.Internal.Data.Array as Array
40+import qualified Streamly.Internal.Data.Fold.Type as Fold
49−import qualified Streamly.Internal.Data.MutArray as MutArray
50−import qualified Streamly.Internal.Data.Fold as Fold
51import qualified Streamly.Internal.Data.Tuple.Strict as Strict
41import qualified Streamly.Internal.Data.Tuple.Strict as Strict
42+import qualified Streamly.Internal.Data.Array.Unboxed.Type as Array
52
43
53import Test.Inspection
44import Test.Inspection
54#endif
45#endif
@@ -62,8 +53,8 @@ copyCodecUtf8ArraysLenient :: Handle -> Handle -> IO ()
62copyCodecUtf8ArraysLenient inh outh =
53copyCodecUtf8ArraysLenient inh outh =
63 Stream.fold (Handle.write outh)
54 Stream.fold (Handle.write outh)
64 $ Unicode.encodeUtf8'
55 $ Unicode.encodeUtf8'
65− $ Unicode.decodeUtf8Chunks
56+ $ Unicode.decodeUtf8Arrays
66− $ Handle.readChunks inh
57+ $ Handle.getChunks inh
67
58
68#ifdef INSPECTION
59#ifdef INSPECTION
69inspect $ hasNoTypeClasses 'copyCodecUtf8ArraysLenient
60inspect $ hasNoTypeClasses 'copyCodecUtf8ArraysLenient
@@ -83,29 +74,23 @@ o_1_space_decode_encode_chunked env =
83-- copy with group/ungroup transformations
74-- copy with group/ungroup transformations
84-------------------------------------------------------------------------------
75-------------------------------------------------------------------------------
85
76
86−{-# INLINE splitOnSuffix #-}
87−splitOnSuffix
88− :: (Monad m)
89− => (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
90−splitOnSuffix predicate f = Stream.foldMany (Fold.takeEndBy_ predicate f)
91−
92{-# NOINLINE linesUnlinesCopy #-}
77{-# NOINLINE linesUnlinesCopy #-}
93linesUnlinesCopy :: Handle -> Handle -> IO ()
78linesUnlinesCopy :: Handle -> Handle -> IO ()
94linesUnlinesCopy inh outh =
79linesUnlinesCopy inh outh =
95 Stream.fold (Handle.write outh)
80 Stream.fold (Handle.write outh)
96 $ Unicode.encodeLatin1'
81 $ Unicode.encodeLatin1'
97 $ Unicode.unlines Unfold.fromList
82 $ Unicode.unlines Unfold.fromList
98− $ splitOnSuffix (== '\n') Fold.toList
83+ $ Stream.splitOnSuffix (== '\n') Fold.toList
99 $ Unicode.decodeLatin1
84 $ Unicode.decodeLatin1
100− $ Stream.unfold Handle.reader inh
85+ $ Stream.unfold Handle.read inh
101
86
102{-# NOINLINE linesUnlinesArrayWord8Copy #-}
87{-# NOINLINE linesUnlinesArrayWord8Copy #-}
103linesUnlinesArrayWord8Copy :: Handle -> Handle -> IO ()
88linesUnlinesArrayWord8Copy :: Handle -> Handle -> IO ()
104linesUnlinesArrayWord8Copy inh outh =
89linesUnlinesArrayWord8Copy inh outh =
105 Stream.fold (Handle.write outh)
90 Stream.fold (Handle.write outh)
106− $ Stream.interposeSuffix 10 Array.reader
91+ $ Stream.interposeSuffix 10 Array.read
107− $ splitOnSuffix (== 10) Array.write
92+ $ Stream.splitOnSuffix (== 10) Array.write
108− $ Stream.unfold Handle.reader inh
93+ $ Stream.unfold Handle.read inh
109
94
110-- XXX splitSuffixOn requires -funfolding-use-threshold=150 for better fusion
95-- XXX splitSuffixOn requires -funfolding-use-threshold=150 for better fusion
111-- | Lines and unlines
96-- | Lines and unlines
@@ -117,10 +102,10 @@ linesUnlinesArrayCharCopy inh outh =
117 $ UnicodeArr.unlines
102 $ UnicodeArr.unlines
118 $ UnicodeArr.lines
103 $ UnicodeArr.lines
119 $ Unicode.decodeLatin1
104 $ Unicode.decodeLatin1
120− $ Stream.unfold Handle.reader inh
105+ $ Stream.unfold Handle.read inh
121
106
122#ifdef INSPECTION
107#ifdef INSPECTION
123−inspect $ hasNoTypeClassesExcept 'linesUnlinesArrayCharCopy [''Unbox]
108+inspect $ hasNoTypeClassesExcept 'linesUnlinesArrayCharCopy [''Unboxed]
124-- inspect $ 'linesUnlinesArrayCharCopy `hasNoType` ''Step
109-- inspect $ 'linesUnlinesArrayCharCopy `hasNoType` ''Step
125#endif
110#endif
126
111
@@ -145,7 +130,7 @@ wordsUnwordsCopyWord8 inh outh =
145 Stream.fold (Handle.write outh)
130 Stream.fold (Handle.write outh)
146 $ Stream.interposeSuffix 32 Unfold.fromList
131 $ Stream.interposeSuffix 32 Unfold.fromList
147 $ Stream.wordsBy isSp Fold.toList
132 $ Stream.wordsBy isSp Fold.toList
148− $ Stream.unfold Handle.reader inh
133+ $ Stream.unfold Handle.read inh
149
134
150#ifdef INSPECTION
135#ifdef INSPECTION
151inspect $ hasNoTypeClasses 'wordsUnwordsCopyWord8
136inspect $ hasNoTypeClasses 'wordsUnwordsCopyWord8
@@ -169,7 +154,7 @@ wordsUnwordsCopy inh outh =
169 $ Stream.wordsBy isSpace Fold.toList
154 $ Stream.wordsBy isSpace Fold.toList
170 -- -- $ Stream.splitOn isSpace Fold.toList
155 -- -- $ Stream.splitOn isSpace Fold.toList
171 $ Unicode.decodeLatin1
156 $ Unicode.decodeLatin1
172− $ Stream.unfold Handle.reader inh
157+ $ Stream.unfold Handle.read inh
173
158
174#ifdef INSPECTION
159#ifdef INSPECTION
175-- inspect $ hasNoTypeClasses 'wordsUnwordsCopy
160-- inspect $ hasNoTypeClasses 'wordsUnwordsCopy
@@ -184,7 +169,7 @@ wordsUnwordsCharArrayCopy inh outh =
184 $ UnicodeArr.unwords
169 $ UnicodeArr.unwords
185 $ UnicodeArr.words
170 $ UnicodeArr.words
186 $ Unicode.decodeLatin1
171 $ Unicode.decodeLatin1
187− $ Stream.unfold Handle.reader inh
172+ $ Stream.unfold Handle.read inh
188
173
189o_1_space_copy_read_group_ungroup :: BenchEnv -> [Benchmark]
174o_1_space_copy_read_group_ungroup :: BenchEnv -> [Benchmark]
190o_1_space_copy_read_group_ungroup env =
175o_1_space_copy_read_group_ungroup env =
@@ -216,7 +201,7 @@ copyStreamLatin1' inh outh =
216 Stream.fold (Handle.write outh)
201 Stream.fold (Handle.write outh)
217 $ Unicode.encodeLatin1'
202 $ Unicode.encodeLatin1'
218 $ Unicode.decodeLatin1
203 $ Unicode.decodeLatin1
219− $ Stream.unfold Handle.reader inh
204+ $ Stream.unfold Handle.read inh
220
205
221#ifdef INSPECTION
206#ifdef INSPECTION
222inspect $ hasNoTypeClasses 'copyStreamLatin1'
207inspect $ hasNoTypeClasses 'copyStreamLatin1'
@@ -224,7 +209,7 @@ inspect $ 'copyStreamLatin1' `hasNoType` ''Step
224inspect $ 'copyStreamLatin1' `hasNoType` ''Unfold.ConcatState -- Handle.read/UF.many
209inspect $ 'copyStreamLatin1' `hasNoType` ''Unfold.ConcatState -- Handle.read/UF.many
225
210
226inspect $ 'copyStreamLatin1' `hasNoType` ''Fold.Step
211inspect $ 'copyStreamLatin1' `hasNoType` ''Fold.Step
227−inspect $ 'copyStreamLatin1' `hasNoType` ''MutArray.ArrayUnsafe -- Handle.write/writeNUnsafe
212+inspect $ 'copyStreamLatin1' `hasNoType` ''Array.ArrayUnsafe -- Handle.write/writeNUnsafe
228 -- Handle.read/Array.read
213 -- Handle.read/Array.read
229inspect $ 'copyStreamLatin1' `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
214inspect $ 'copyStreamLatin1' `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
230#endif
215#endif
@@ -236,7 +221,7 @@ copyStreamLatin1 inh outh =
236 Stream.fold (Handle.write outh)
221 Stream.fold (Handle.write outh)
237 $ Unicode.encodeLatin1
222 $ Unicode.encodeLatin1
238 $ Unicode.decodeLatin1
223 $ Unicode.decodeLatin1
239− $ Stream.unfold Handle.reader inh
224+ $ Stream.unfold Handle.read inh
240
225
241#ifdef INSPECTION
226#ifdef INSPECTION
242inspect $ hasNoTypeClasses 'copyStreamLatin1
227inspect $ hasNoTypeClasses 'copyStreamLatin1
@@ -245,7 +230,7 @@ inspect $ 'copyStreamLatin1 `hasNoType` ''Unfold.ConcatState -- Handle.read/UF.m
245
230
246inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.ManyState
231inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.ManyState
247inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.Step
232inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.Step
248−inspect $ 'copyStreamLatin1 `hasNoType` ''MutArray.ArrayUnsafe -- Handle.write/writeNUnsafe
233+inspect $ 'copyStreamLatin1 `hasNoType` ''Array.ArrayUnsafe -- Handle.write/writeNUnsafe
249 -- Handle.read/Array.read
234 -- Handle.read/Array.read
250inspect $ 'copyStreamLatin1 `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
235inspect $ 'copyStreamLatin1 `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
251#endif
236#endif
@@ -256,7 +241,7 @@ _copyStreamUtf8' inh outh =
256 Stream.fold (Handle.write outh)
241 Stream.fold (Handle.write outh)
257 $ Unicode.encodeUtf8'
242 $ Unicode.encodeUtf8'
258 $ Unicode.decodeUtf8'
243 $ Unicode.decodeUtf8'
259− $ Stream.unfold Handle.reader inh
244+ $ Stream.unfold Handle.read inh
260
245
261#ifdef INSPECTION
246#ifdef INSPECTION
262inspect $ hasNoTypeClasses '_copyStreamUtf8'
247inspect $ hasNoTypeClasses '_copyStreamUtf8'
@@ -272,7 +257,7 @@ copyStreamUtf8 inh outh =
272 Stream.fold (Handle.write outh)
257 Stream.fold (Handle.write outh)
273 $ Unicode.encodeUtf8
258 $ Unicode.encodeUtf8
274 $ Unicode.decodeUtf8
259 $ Unicode.decodeUtf8
275− $ Stream.unfold Handle.reader inh
260+ $ Stream.unfold Handle.read inh
276
261
277#ifdef INSPECTION
262#ifdef INSPECTION
278inspect $ hasNoTypeClasses 'copyStreamUtf8
263inspect $ hasNoTypeClasses 'copyStreamUtf8
@@ -286,18 +271,17 @@ _copyStreamUtf8'Fold :: Handle -> Handle -> IO ()
286_copyStreamUtf8'Fold inh outh =
271_copyStreamUtf8'Fold inh outh =
287 Stream.fold (Handle.write outh)
272 Stream.fold (Handle.write outh)
288 $ Unicode.encodeUtf8
273 $ Unicode.encodeUtf8
289− $ Stream.catRights
290− $ Stream.parseMany Unicode.writeCharUtf8'
274+ $ Stream.foldMany Unicode.writeCharUtf8'
291− $ Stream.unfold Handle.reader inh
275+ $ Stream.unfold Handle.read inh
292
276
293{-# NOINLINE _copyStreamUtf8Parser #-}
277{-# NOINLINE _copyStreamUtf8Parser #-}
294_copyStreamUtf8Parser :: Handle -> Handle -> IO ()
278_copyStreamUtf8Parser :: Handle -> Handle -> IO ()
295_copyStreamUtf8Parser inh outh =
279_copyStreamUtf8Parser inh outh =
296 Stream.fold (Handle.write outh)
280 Stream.fold (Handle.write outh)
297 $ Unicode.encodeUtf8
281 $ Unicode.encodeUtf8
298− $ Stream.catRights $ Stream.parseMany
282+ $ Stream.parseMany
299 (Unicode.parseCharUtf8With Unicode.TransliterateCodingFailure)
283 (Unicode.parseCharUtf8With Unicode.TransliterateCodingFailure)
300− $ Stream.unfold Handle.reader inh
284+ $ Stream.unfold Handle.read inh
301
285
302o_1_space_decode_encode_read :: BenchEnv -> [Benchmark]
286o_1_space_decode_encode_read :: BenchEnv -> [Benchmark]
303o_1_space_decode_encode_read env =
287o_1_space_decode_encode_read env =
@@ -324,7 +308,6 @@ o_1_space_decode_encode_read env =
324
308
325main :: IO ()
309main :: IO ()
326main = do
310main = do
327−#ifndef FUSION_CHECK
328 env <- mkHandleBenchEnv
311 env <- mkHandleBenchEnv
329 defaultMain (allBenchmarks env)
312 defaultMain (allBenchmarks env)
330
313
@@ -337,13 +320,3 @@ main = do
337 , o_1_space_decode_encode_read env
320 , o_1_space_decode_encode_read env
338 ]
321 ]
339 ]
322 ]
340−#else
341− -- Enable FUSION_CHECK macro at the beginning of the file
342− -- Enable one benchmark below, and run the benchmark
343− -- Check the .dump-simpl output
344− env <- mkHandleBenchEnv
345− let mkHandles (RefHandles {bigInH = inh, outputH = outh}) = Handles inh outh
346− (Handles inh outh) <- getHandles env mkHandles
347− copyStreamLatin1' inh outh
348− return ()
349−#endif
benchmark/Streamly/Benchmark/Unicode/Utf8.hs+3−3
@@ -13,7 +13,7 @@
13import Data.Char (chr)
13import Data.Char (chr)
14import Streamly.Internal.Unicode.Utf8 (Utf8)
14import Streamly.Internal.Unicode.Utf8 (Utf8)
15
15
16−import Test.Tasty.Bench hiding (env)
16+import Gauge hiding (env)
17import Streamly.Benchmark.Common
17import Streamly.Benchmark.Common
18
18
19import qualified Streamly.Internal.Unicode.Utf8 as Utf8
19import qualified Streamly.Internal.Unicode.Utf8 as Utf8
@@ -49,7 +49,7 @@ main = runWithCLIOpts defaultStreamSize allBenchmarks
49 allBenchmarks value =
49 allBenchmarks value =
50 [ bgroup
50 [ bgroup
51 moduleName
51 moduleName
52− [ bench "pack" $ whnf pack value
52+ [ bench "pack" $ nf pack value
53− , bench "pack + unpack" $ whnf packUnpack value
53+ , bench "pack + unpack" $ nf packUnpack value
54 ]
54 ]
55 ]
55 ]
benchmark/bench-runner/Main.hs+41−93
@@ -14,32 +14,20 @@ rtsOpts exeName benchName0 = unwords [general, exeSpecific, benchSpecific]
14
14
15 -- Drop All.
15 -- Drop All.
16 benchName = drop 4 benchName0
16 benchName = drop 4 benchName0
17−
18 general
17 general
19− -- GHC-9.6 requires 32M heap vs 16M for GHC-9.4
20− | "o-1-sp" `isInfixOf` benchName = "-K36K -M32M"
18+ | "o-1-sp" `isInfixOf` benchName = "-K36K -M16M"
21 | "o-n-h" `isInfixOf` benchName = "-K36K -M32M"
19 | "o-n-h" `isInfixOf` benchName = "-K36K -M32M"
22− -- GHC-9.6 requires 32M heap vs 16M for GHC-9.4
23− | "o-n-st" `isInfixOf` benchName = "-K1M -M32M"
20+ | "o-n-st" `isInfixOf` benchName = "-K1M -M16M"
24 | "o-n-sp" `isInfixOf` benchName = "-K1M -M32M"
21 | "o-n-sp" `isInfixOf` benchName = "-K1M -M32M"
25 | otherwise = ""
22 | otherwise = ""
26−
27 exeSpecific
23 exeSpecific
28 | "Prelude.Concurrent" `isSuffixOf` exeName = "-K512K -M384M"
24 | "Prelude.Concurrent" `isSuffixOf` exeName = "-K512K -M384M"
29 | otherwise = ""
25 | otherwise = ""
30−
31 benchSpecific
26 benchSpecific
32− -- GHC-9.6 requires 64M, earlier it was 16M
27+ | "Data.Stream.StreamD/o-n-space.elimination.toList" == benchName =
33− | "Data.Fold/o-n-heap.key-value.toHashMapIO (max buckets) sum" == benchName =
28+ "-K2M"
34− "-M64M"
35−
36− -- This is required only for the --long case because we allocate all
37− -- the arrays upfront. depends on the size of the stream.
38− | "Data.Parser/o-1-space" `isPrefixOf` benchName =
29+ | "Data.Stream.StreamK/o-n-space.elimination.toList" == benchName =
39− "-M128M"
30+ "-K2M"
40−
41− -----------------------------------------------------------------------
42−
43 | "Prelude.Parallel/o-n-heap.mapping.mapM" == benchName = "-M256M"
31 | "Prelude.Parallel/o-n-heap.mapping.mapM" == benchName = "-M256M"
44 | "Prelude.Parallel/o-n-heap.monad-outer-product."
32 | "Prelude.Parallel/o-n-heap.monad-outer-product."
45 `isPrefixOf` benchName = "-M256M"
33 `isPrefixOf` benchName = "-M256M"
@@ -47,92 +35,52 @@ rtsOpts exeName benchName0 = unwords [general, exeSpecific, benchSpecific]
47 `isPrefixOf` benchName = "-K2M -M256M"
35 `isPrefixOf` benchName = "-K2M -M256M"
48 | "Prelude.Rate/o-1-space." `isPrefixOf` benchName = "-K128K"
36 | "Prelude.Rate/o-1-space." `isPrefixOf` benchName = "-K128K"
49 | "Prelude.Rate/o-1-space.asyncly." `isPrefixOf` benchName = "-K128K"
37 | "Prelude.Rate/o-1-space.asyncly." `isPrefixOf` benchName = "-K128K"
38+ | "Data.Stream/o-1-space.mixed.sum-product-fold" == benchName =
39+ "-K64M"
40+ | "Data.Stream/o-n-heap.grouping.classifySessionsOf"
41+ `isPrefixOf` benchName = "-K1M -M32M"
42+ | "Data.Stream/o-n-heap.Functor." `isPrefixOf` benchName =
43+ "-K4M -M32M"
44+ | "Data.Stream/o-n-heap.transformer." `isPrefixOf` benchName =
45+ "-K8M -M64M"
46+ | "Data.Stream/o-n-space.Functor." `isPrefixOf` benchName =
47+ "-K4M -M64M"
48+ | "Data.Stream/o-n-space.Applicative." `isPrefixOf` benchName =
49+ "-K8M -M128M"
50+ | "Data.Stream/o-n-space.Monad." `isPrefixOf` benchName =
51+ "-K8M -M64M"
52+ | "Data.Stream/o-n-space.grouping." `isPrefixOf` benchName = ""
53+ | "Data.Stream/o-n-space." `isPrefixOf` benchName = "-K4M"
50 | "Prelude.WSerial/o-n-space." `isPrefixOf` benchName = "-K4M"
54 | "Prelude.WSerial/o-n-space." `isPrefixOf` benchName = "-K4M"
51 | "Prelude.Async/o-n-space.monad-outer-product." `isPrefixOf` benchName =
55 | "Prelude.Async/o-n-space.monad-outer-product." `isPrefixOf` benchName =
52 "-K4M"
56 "-K4M"
53− | "Prelude.Ahead/o-1-space.monad-outer-product." `isPrefixOf` benchName =
54− "-K128K -M32M"
55− | "Prelude.Ahead/o-1-space." `isPrefixOf` benchName = "-K128K"
56 | "Prelude.Ahead/o-n-space.monad-outer-product." `isPrefixOf` benchName =
57 | "Prelude.Ahead/o-n-space.monad-outer-product." `isPrefixOf` benchName =
57 "-K4M"
58 "-K4M"
59+ | "Prelude.Ahead/o-1-space." `isPrefixOf` benchName = "-K128K"
58 | "Prelude.WAsync/o-n-heap.monad-outer-product.toNull3" == benchName =
60 | "Prelude.WAsync/o-n-heap.monad-outer-product.toNull3" == benchName =
59 "-M64M"
61 "-M64M"
60 | "Prelude.WAsync/o-n-space.monad-outer-product." `isPrefixOf` benchName =
62 | "Prelude.WAsync/o-n-space.monad-outer-product." `isPrefixOf` benchName =
61 "-K4M"
63 "-K4M"
62−
64+ | "Data.Parser.ParserD/o-1-space.some" == benchName = "-K8M"
63− -- This module is dev only now, and can be removed at some point
65+ | "Data.Parser/o-1-space.some" == benchName = "-K8M"
64− | "Data.Stream.StreamDK/o-1-space.grouping.classifySessionsOf"
66+ | "Data.Parser.ParserD/o-1-space.manyTill" == benchName = "-K4M"
65− `isPrefixOf` benchName = "-K512K"
66− | "Data.Stream.StreamDK/o-n-space.foldr.foldrM/"
67− `isPrefixOf` benchName = "-K4M"
68− | "Data.Stream.StreamDK/o-n-space.iterated."
69− `isPrefixOf` benchName = "-K4M -M64M"
70− -- GHC 9.4.4 requires 4M
71− | "Data.Stream.StreamDK/o-n-space.traversable."
72− `isPrefixOf` benchName = "-K4M"
67+ | "Data.Parser/o-1-space.manyTill" == benchName = "-K4M"
73− -- GHC-9.6 requires 64M, earlier it was 32M
68+ | "Data.Parser/o-n-heap.manyAlt" == benchName = "-K4M -M128M"
74− | "Data.Stream.StreamDK/o-n-heap.buffered.readsPrec pure streams" == benchName =
69+ | "Data.Parser/o-n-heap.someAlt" == benchName = "-K4M -M128M"
75− "-M64M"
70+ | "Data.Parser/o-n-heap.choice" == benchName = "-K16M -M32M"
76− -- GHC-9.6 requires 64M, earlier it was 32M
71+ | "Data.Parser.ParserK/o-n-heap.manyAlt" == benchName = "-K4M -M128M"
77− | "Data.Stream.StreamDK/o-n-heap.buffered.showPrec Haskell lists" == benchName =
72+ | "Data.Parser.ParserK/o-n-heap.someAlt" == benchName = "-K4M -M128M"
78− "-M64M"
73+ | "Data.Parser.ParserK/o-n-heap.sequence" == benchName = "-M64M"
79−
74+ | "Data.Parser.ParserK/o-n-heap.sequenceA" == benchName = "-M64M"
80− -----------------------------------------------------------------------
81−
82− | "Data.StreamD/o-n-space.elimination.toList" == benchName =
83− "-K2M"
84− | "Data.StreamK/o-n-space.elimination.toList" == benchName =
85− "-K2M"
86−
87− -----------------------------------------------------------------------
88−
89− | "Data.Stream/o-1-space.grouping.classifySessionsOf"
90− `isPrefixOf` benchName = "-K512K"
91− | "Data.Stream/o-n-space.foldr.foldrM/"
92− `isPrefixOf` benchName = "-K4M"
93− | "Data.Stream/o-n-space.iterated."
94− `isPrefixOf` benchName = "-K4M"
95−
96− -- GHC-9.6 requires 64M, earlier it was 32M
97− | "Data.Stream/o-n-heap.buffered.showPrec Haskell lists" == benchName =
98− "-M64M"
99− -- GHC-9.6 requires 64M, earlier it was 32M
100− | "Data.Stream/o-n-heap.buffered.readsPrec pure streams" == benchName =
101− "-M64M"
102−
103− | "Data.Stream.ConcurrentEager/o-n-heap.monad-outer-product.toNullAp"
104− `isPrefixOf` benchName = "-M1024M"
105− | "Data.Stream.ConcurrentEager/o-1-space."
106− `isPrefixOf` benchName = "-M128M"
107−
108− | "Data.Stream.ConcurrentOrdered/o-1-space.concat-foldable.foldMapWith"
109− `isPrefixOf` benchName = "-K128K"
75+ | "Data.SmallArray.o-1-sp" `isPrefixOf` benchName = "-K128K"
110−
111− ----------------------------------------------------------------------
112−
113− | "Data.Array" `isPrefixOf` benchName
114− && "/o-1-space.generation.read" `isSuffixOf` benchName = "-M32M"
115− -- XXX GHC 9.6 onwards needs 64M, earlier it was 32M
116 | "Data.Array" `isPrefixOf` benchName
76 | "Data.Array" `isPrefixOf` benchName
117− && "/o-1-space.generation.show" `isSuffixOf` benchName = "-M64M"
77+ && "/o-1-space.generation.show" `isSuffixOf` benchName = "-M32M"
118− -- XXX GHC 9.6 onwards needs 64M, earlier it was 32M
119− | "Data.Array.Generic/o-1-space.transformationX4.map"
78+ | "Data.Array/o-1-space.transformationX4.map" == benchName = "-M32M"
120− `isPrefixOf` benchName = "-M64M"
121−
122− -- XXX For --long option, need to check why so much heap is required.
123− -- Note, if we remove the chunked stream module we need to keep the
124− -- chunked stream benchmarks in the stream module.
125− | "Data.Array.Stream/o-1-space"
79+ | "Data.Array.Foreign/o-1-space.elimination.foldable.foldl"
126− `isPrefixOf` benchName = "-K4M -M512M"
80+ `isPrefixOf` benchName = "-K8M"
127− -- XXX Takes up to 160MB heap for --long, we use chunked stream for
81+ | "Data.Array.Foreign/o-1-space.elimination.foldable.sum" == benchName =
128− -- this, so the reason may be related to chunked streams.
82+ "-K8M"
129− | "Data.ParserK/o-1-space"
130− `isPrefixOf` benchName = "-K4M -M256M"
131−
132− -----------------------------------------------------------------------
133−
134 | "Unicode.Char/o-1-space." `isPrefixOf` benchName = "-M32M"
83 | "Unicode.Char/o-1-space." `isPrefixOf` benchName = "-M32M"
135−
136 | otherwise = ""
84 | otherwise = ""
137
85
138speedOpts :: String -> String -> Maybe Quickness
86speedOpts :: String -> String -> Maybe Quickness
benchmark/bench-runner/cabal.project+1−4
@@ -1,4 +1 @@
1−packages: . ../../targets
1+packages: .
2−
3−package bench-report
4− flags: +no-charts
benchmark/bench-runner/default.nix+1−1
@@ -49,7 +49,7 @@ let haskellPackages =
49 nixpkgs.haskell.lib.overrideCabal
49 nixpkgs.haskell.lib.overrideCabal
50 (let src = fetchGit {
50 (let src = fetchGit {
51 url = "git@github.com:composewell/bench-report.git";
51 url = "git@github.com:composewell/bench-report.git";
52− rev = "3b50bf0ad06f746bca42f30c8d40a0426e159af3";
52+ rev = "3e016780cd125f6c074b70f4ffed2329e2c4ab68";
53 }; in super.callCabal2nix "bench-report" src {})
53 }; in super.callCabal2nix "bench-report" src {})
54 (old:
54 (old:
55 { enableLibraryProfiling = false;
55 { enableLibraryProfiling = false;
benchmark/lib/Streamly/Benchmark/Common.hs+1−1
@@ -56,7 +56,7 @@ import System.Random (randomRIO)
56import qualified Streamly.Internal.Data.Fold as Fold
56import qualified Streamly.Internal.Data.Fold as Fold
57import qualified Streamly.Internal.Data.Stream as S
57import qualified Streamly.Internal.Data.Stream as S
58
58
59−import Test.Tasty.Bench
59+import Gauge
60
60
61-------------------------------------------------------------------------------
61-------------------------------------------------------------------------------
62-- Benchmark Prefixes
62-- Benchmark Prefixes
benchmark/lib/Streamly/Benchmark/Common/Handle.hs+1−3
@@ -30,8 +30,6 @@ module Streamly.Benchmark.Common.Handle
30 , isSpace
30 , isSpace
31 , isSp
31 , isSp
32 , mkHandleBenchEnv
32 , mkHandleBenchEnv
33− , Handles(..)
34− , getHandles
35 )
33 )
36where
34where
37
35
@@ -48,7 +46,7 @@ import System.Process (callCommand)
48
46
49import Data.IORef
47import Data.IORef
50import Prelude hiding (last, length)
48import Prelude hiding (last, length)
51−import Test.Tasty.Bench hiding (env)
49+import Gauge hiding (env)
52
50
53
51
54scratchDir :: String
52scratchDir :: String
benchmark/lib/Streamly/Benchmark/Prelude.hs+1−3
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3-- |
1-- |
4-- Module : Streamly.Benchmark.Prelude
2-- Module : Streamly.Benchmark.Prelude
5-- Copyright : (c) 2018 Composewell Technologies
3-- Copyright : (c) 2018 Composewell Technologies
@@ -82,7 +80,7 @@ import qualified Streamly.Internal.Data.Stream.IsStream.Type as IsStream
82import qualified Streamly.Internal.Data.Pipe as Pipe
80import qualified Streamly.Internal.Data.Pipe as Pipe
83import qualified Streamly.Internal.Data.Stream.Serial as Serial
81import qualified Streamly.Internal.Data.Stream.Serial as Serial
84
82
85−import Test.Tasty.Bench
83+import Gauge
86import Streamly.Internal.Data.Time.Units
84import Streamly.Internal.Data.Time.Units
87
85
88-- Common polymorphic stream APIs used across multiple stream modules
86-- Common polymorphic stream APIs used across multiple stream modules
benchmark/streamly-benchmarks.cabal+176−339
@@ -54,7 +54,12 @@ flag opt
54 manual: True
54 manual: True
55 default: True
55 default: True
56
56
57−flag use-streamly-core
57+flag use-gauge
58+ description: Use gauge instead of tasty-bench for benchmarking
59+ manual: True
60+ default: False
61+
62+flag bench-core
58 description: Benchmark only core package
63 description: Benchmark only core package
59 manual: True
64 manual: True
60 default: False
65 default: False
@@ -68,48 +73,11 @@ flag use-prelude
68-- Common stanzas
73-- Common stanzas
69-------------------------------------------------------------------------------
74-------------------------------------------------------------------------------
70
75
71−common default-extensions
72− default-extensions:
73− BangPatterns
74− CApiFFI
75− CPP
76− ConstraintKinds
77− DeriveDataTypeable
78− DeriveGeneric
79− DeriveTraversable
80− ExistentialQuantification
81− FlexibleContexts
82− FlexibleInstances
83− GeneralizedNewtypeDeriving
84− InstanceSigs
85− KindSignatures
86− LambdaCase
87− MagicHash
88− MultiParamTypeClasses
89− PatternSynonyms
90− RankNTypes
91− RecordWildCards
92− ScopedTypeVariables
93− TupleSections
94− TypeApplications
95− TypeFamilies
96− TypeOperators
97− ViewPatterns
98−
99− -- MonoLocalBinds, enabled by TypeFamilies, causes performance
100− -- regressions. Disable it. This must come after TypeFamilies,
101− -- otherwise TypeFamilies will enable it again.
102− NoMonoLocalBinds
103−
104− -- UndecidableInstances -- Does not show any perf impact
105− -- UnboxedTuples -- interferes with (#.)
106−
107common compile-options
76common compile-options
108− import: default-extensions
109 default-language: Haskell2010
77 default-language: Haskell2010
110
78
111− if flag(use-streamly-core)
79+ if flag(use-prelude)
112− cpp-options: -DUSE_STREAMLY_CORE
80+ cpp-options: -DUSE_PRELUDE
113
81
114 if flag(dev)
82 if flag(dev)
115 cpp-options: -DDEVBUILD
83 cpp-options: -DDEVBUILD
@@ -120,29 +88,16 @@ common compile-options
120 if flag(inspection)
88 if flag(inspection)
121 cpp-options: -DINSPECTION
89 cpp-options: -DINSPECTION
122
90
123− ghc-options: -Weverything
91+ ghc-options: -Wall
124− -Wno-implicit-prelude
92+ -Wcompat
125− -Wno-missing-deriving-strategies
93+ -Wunrecognised-warning-flags
126− -Wno-missing-exported-signatures
94+ -Widentities
127− -Wno-missing-import-lists
95+ -Wincomplete-record-updates
128− -Wno-missing-local-signatures
96+ -Wincomplete-uni-patterns
129− -Wno-missing-safe-haskell-mode
97+ -Wredundant-constraints
130− -Wno-missed-specialisations
98+ -Wnoncanonical-monad-instances
131− -Wno-all-missed-specialisations
132− -Wno-monomorphism-restriction
133− -Wno-prepositive-qualified-module
134− -Wno-unsafe
135− -Wno-unused-packages
136− -Rghc-timing
99+ -Rghc-timing
137−
100+ -Wmissing-export-lists
138− if impl(ghc >= 9.2)
139− ghc-options:
140− -Wno-missing-kind-signatures
141− -Wno-operator-whitespace
142−
143− if impl(ghc >= 9.8)
144− ghc-options:
145− -Wno-missing-role-annotations
146
101
147 if flag(has-llvm)
102 if flag(has-llvm)
148 ghc-options: -fllvm
103 ghc-options: -fllvm
@@ -151,17 +106,15 @@ common compile-options
151 ghc-options: -Wmissed-specialisations
106 ghc-options: -Wmissed-specialisations
152 -Wall-missed-specialisations
107 -Wall-missed-specialisations
153
108
109+ if flag(dev) || flag(debug)
110+ ghc-options: -fno-ignore-asserts
111+
154common optimization-options
112common optimization-options
155 if flag(opt)
113 if flag(opt)
156 ghc-options: -O2
114 ghc-options: -O2
157 -fdicts-strict
115 -fdicts-strict
158 -fspec-constr-recursive=16
116 -fspec-constr-recursive=16
159 -fmax-worker-args=16
117 -fmax-worker-args=16
160−
161− -- For this to be effective it must come after the -O2 option
162− if flag(dev) || flag(debug)
163− ghc-options: -fno-ignore-asserts
164−
165 if flag(fusion-plugin) && !impl(ghcjs) && !impl(ghc < 8.6)
118 if flag(fusion-plugin) && !impl(ghcjs) && !impl(ghc < 8.6)
166 ghc-options: -fplugin Fusion.Plugin
119 ghc-options: -fplugin Fusion.Plugin
167 else
120 else
@@ -175,34 +128,43 @@ common bench-depends
175 -- Core libraries shipped with ghc, the min and max
128 -- Core libraries shipped with ghc, the min and max
176 -- constraints of these libraries should match with
129 -- constraints of these libraries should match with
177 -- the GHC versions we support
130 -- the GHC versions we support
178− base >= 4.9 && < 4.20
131+ base >= 4.9 && < 4.18
179− , deepseq >= 1.4.1 && < 1.6
132+ , deepseq >= 1.4.1 && < 1.5
180− , mtl >= 2.2 && < 2.3.2
133+ , mtl >= 2.2 && < 2.3
181
134
182 -- other libraries
135 -- other libraries
183− , exceptions >= 0.8 && < 0.11
184 , random >= 1.0 && < 2.0
136 , random >= 1.0 && < 2.0
185 , transformers >= 0.4 && < 0.7
137 , transformers >= 0.4 && < 0.7
186− , containers >= 0.5 && < 0.8
138+ , containers >= 0.5 && < 0.7
187 , hashable >= 1.3 && < 1.5
139 , hashable >= 1.3 && < 1.5
188 , unordered-containers >= 0.2 && < 0.3
140 , unordered-containers >= 0.2 && < 0.3
189 , process >= 1.4 && < 1.7
141 , process >= 1.4 && < 1.7
190 , directory >= 1.2.2 && < 1.4
142 , directory >= 1.2.2 && < 1.4
191− , filepath >= 1.4.1 && < 1.6
143+ , filepath >= 1.4.1 && < 1.5
192− , ghc-prim >= 0.4 && < 0.12
144+ , ghc-prim >= 0.4 && < 0.10
193− , tasty-bench >= 0.3 && < 0.4
194− , tasty >= 1.4.1 && < 1.6
195− , streamly-core
196
145
197− if !flag(use-streamly-core)
146+ if flag(bench-core)
147+ build-depends: streamly-core
148+ else
198 build-depends: streamly
149 build-depends: streamly
150+ , streamly-core
151+
152+ if flag(use-gauge)
153+ build-depends: gauge >= 0.2.4 && < 0.3
154+ else
155+ build-depends: tasty-bench >= 0.3 && < 0.4
156+ , tasty >= 1.4.1 && < 1.5
157+ mixins: tasty-bench
158+ (Test.Tasty.Bench as Gauge
159+ , Test.Tasty.Bench as Gauge.Main
160+ )
199
161
200 if flag(fusion-plugin) && !impl(ghcjs) && !impl(ghc < 8.6)
162 if flag(fusion-plugin) && !impl(ghcjs) && !impl(ghc < 8.6)
201 build-depends:
163 build-depends:
202 fusion-plugin >= 0.2 && < 0.3
164 fusion-plugin >= 0.2 && < 0.3
203 if flag(inspection)
165 if flag(inspection)
204− build-depends: template-haskell >= 2.14 && < 2.22
166+ build-depends: template-haskell >= 2.14 && < 2.20
205− , inspection-testing >= 0.4 && < 0.6
167+ , inspection-testing >= 0.4 && < 0.5
206 -- Array uses a Storable constraint in dev build making several inspection
168 -- Array uses a Storable constraint in dev build making several inspection
207 -- tests fail
169 -- tests fail
208 if flag(dev) && flag(inspection)
170 if flag(dev) && flag(inspection)
@@ -217,7 +179,7 @@ library
217 hs-source-dirs: lib
179 hs-source-dirs: lib
218 exposed-modules: Streamly.Benchmark.Common
180 exposed-modules: Streamly.Benchmark.Common
219 , Streamly.Benchmark.Common.Handle
181 , Streamly.Benchmark.Common.Handle
220− if flag(use-prelude)
182+ if !flag(bench-core)
221 exposed-modules: Streamly.Benchmark.Prelude
183 exposed-modules: Streamly.Benchmark.Prelude
222
184
223
185
@@ -258,131 +220,115 @@ benchmark Data.Stream
258 Stream.Transform
220 Stream.Transform
259 Stream.Reduce
221 Stream.Reduce
260 Stream.Expand
222 Stream.Expand
223+ Stream.Exceptions
261 Stream.Lift
224 Stream.Lift
262 Stream.Common
225 Stream.Common
263− if !flag(use-streamly-core)
226+ if flag(use-prelude)
264 other-modules:
227 other-modules:
265− Stream.Exceptions
228+ Stream.Split
229+ if flag(bench-core) || impl(ghcjs)
230+ buildable: False
231+ else
232+ buildable: True
266 if flag(limit-build-mem)
233 if flag(limit-build-mem)
267 if flag(dev)
234 if flag(dev)
268 ghc-options: +RTS -M3500M -RTS
235 ghc-options: +RTS -M3500M -RTS
269 else
236 else
270 ghc-options: +RTS -M2500M -RTS
237 ghc-options: +RTS -M2500M -RTS
271
238
272−-- Use StreamK functions where possible, converting to StreaK to StreamD
239+benchmark Prelude.WSerial
273−benchmark Data.Stream.StreamDK
274 import: bench-options
240 import: bench-options
275 type: exitcode-stdio-1.0
241 type: exitcode-stdio-1.0
276− hs-source-dirs: Streamly/Benchmark/Data
242+ hs-source-dirs: Streamly/Benchmark/Prelude
277− main-is: Stream.hs
243+ main-is: WSerial.hs
278− other-modules:
279− Stream.Generate
280− Stream.Eliminate
281− Stream.Transform
282− Stream.Reduce
283− Stream.Expand
284− Stream.Lift
285− Stream.Common
286− if !flag(use-streamly-core)
244+ if flag(bench-core) || impl(ghcjs)
287− other-modules:
288− Stream.Exceptions
289− -- Cannot use USE_STREAMK and USE_PRELUDE together
290− if flag(use-prelude)
291 buildable: False
245 buildable: False
292− cpp-options: -DUSE_STREAMK
246+ else
247+ buildable: True
293 if flag(limit-build-mem)
248 if flag(limit-build-mem)
294− if flag(dev)
295− ghc-options: +RTS -M3500M -RTS
249+ ghc-options: +RTS -M750M -RTS
296− else
297− ghc-options: +RTS -M2500M -RTS
298
250
299−benchmark Data.Stream.Concurrent
251+benchmark Prelude.Merge
300− import: bench-options-threaded
252+ import: bench-options
301 type: exitcode-stdio-1.0
253 type: exitcode-stdio-1.0
302− hs-source-dirs: Streamly/Benchmark/Data/Stream/, Streamly/Benchmark/Data/
254+ hs-source-dirs: Streamly/Benchmark/Prelude
303− main-is: Concurrent.hs
255+ main-is: Merge.hs
304− other-modules:
305− Stream.ConcurrentCommon
306− Stream.Common
307− if flag(use-streamly-core) || impl(ghcjs)
256+ if flag(bench-core) || impl(ghcjs)
308 buildable: False
257 buildable: False
309 else
258 else
310 buildable: True
259 buildable: True
311
260
312−benchmark Data.Stream.ConcurrentInterleaved
261+benchmark Prelude.ZipSerial
313− import: bench-options-threaded
262+ import: bench-options
314 type: exitcode-stdio-1.0
263 type: exitcode-stdio-1.0
315− hs-source-dirs: Streamly/Benchmark/Data/Stream/, Streamly/Benchmark/Data/
264+ hs-source-dirs: Streamly/Benchmark/Prelude
316− main-is: ConcurrentInterleaved.hs
265+ main-is: ZipSerial.hs
317− other-modules:
318− Stream.ConcurrentCommon
319− Stream.Common
320− if flag(use-streamly-core) || impl(ghcjs)
266+ if flag(bench-core) || impl(ghcjs)
321 buildable: False
267 buildable: False
322 else
268 else
323 buildable: True
269 buildable: True
324
270
325−benchmark Data.Stream.ConcurrentEager
271+benchmark Prelude.ZipAsync
326− import: bench-options-threaded
272+ import: bench-options
327 type: exitcode-stdio-1.0
273 type: exitcode-stdio-1.0
328− hs-source-dirs: Streamly/Benchmark/Data/Stream/, Streamly/Benchmark/Data/
274+ hs-source-dirs: Streamly/Benchmark/Prelude
329− main-is: ConcurrentEager.hs
275+ main-is: ZipAsync.hs
330− other-modules:
331− Stream.ConcurrentCommon
332− Stream.Common
333− if flag(use-streamly-core) || impl(ghcjs)
276+ if flag(bench-core) || impl(ghcjs)
334 buildable: False
277 buildable: False
335 else
278 else
336 buildable: True
279 buildable: True
280+ if flag(limit-build-mem)
281+ ghc-options: +RTS -M1000M -RTS
337
282
338−benchmark Data.Stream.ConcurrentOrdered
283+benchmark Prelude.Ahead
339 import: bench-options-threaded
284 import: bench-options-threaded
340 type: exitcode-stdio-1.0
285 type: exitcode-stdio-1.0
341− hs-source-dirs: Streamly/Benchmark/Data/Stream/, Streamly/Benchmark/Data/
286+ hs-source-dirs: Streamly/Benchmark/Prelude
342− main-is: ConcurrentOrdered.hs
287+ main-is: Ahead.hs
343− other-modules:
344− Stream.ConcurrentCommon
345− Stream.Common
346− if flag(use-streamly-core) || impl(ghcjs)
288+ if flag(bench-core) || impl(ghcjs)
347 buildable: False
289 buildable: False
348 else
290 else
349 buildable: True
291 buildable: True
350
292
351−benchmark Data.Unbox
293+benchmark Prelude.Async
352− import: bench-options
294+ import: bench-options-threaded
353 type: exitcode-stdio-1.0
295 type: exitcode-stdio-1.0
354− hs-source-dirs: .
296+ hs-source-dirs: Streamly/Benchmark/Prelude
355− cpp-options: -DUSE_UNBOX
297+ main-is: Async.hs
356− main-is: Streamly/Benchmark/Data/Serialize.hs
298+ if flag(bench-core) || impl(ghcjs)
299+ buildable: False
300+ else
301+ buildable: True
357
302
358−benchmark Data.Unbox.Derive.TH
303+benchmark Prelude.WAsync
359− import: bench-options
304+ import: bench-options-threaded
360 type: exitcode-stdio-1.0
305 type: exitcode-stdio-1.0
361− hs-source-dirs: .
306+ hs-source-dirs: Streamly/Benchmark/Prelude
362− cpp-options: -DUSE_UNBOX
307+ main-is: WAsync.hs
363− cpp-options: -DUSE_TH
308+ if flag(bench-core) || impl(ghcjs)
364− main-is: Streamly/Benchmark/Data/Serialize.hs
309+ buildable: False
310+ else
311+ buildable: True
365
312
366−benchmark Data.Serialize
313+benchmark Prelude.Parallel
367− import: bench-options
314+ import: bench-options-threaded
368 type: exitcode-stdio-1.0
315 type: exitcode-stdio-1.0
369− hs-source-dirs: .
316+ hs-source-dirs: Streamly/Benchmark/Prelude
370− cpp-options: -DUSE_TH
317+ main-is: Parallel.hs
371− main-is: Streamly/Benchmark/Data/Serialize.hs
318+ if flag(bench-core) || impl(ghcjs)
372− build-depends: QuickCheck, template-haskell
319+ buildable: False
373− other-modules:
320+ else
374− Streamly.Benchmark.Data.Serialize.TH
321+ buildable: True
375− Streamly.Benchmark.Data.Serialize.RecCompatible
376− Streamly.Benchmark.Data.Serialize.RecNonCompatible
377 if flag(limit-build-mem)
322 if flag(limit-build-mem)
378− ghc-options: +RTS -M1000M -RTS
323+ ghc-options: +RTS -M2000M -RTS
324+
379
325
380benchmark Data.Unfold
326benchmark Data.Unfold
381 import: bench-options
327 import: bench-options
382 type: exitcode-stdio-1.0
328 type: exitcode-stdio-1.0
383 hs-source-dirs: .
329 hs-source-dirs: .
384 main-is: Streamly/Benchmark/Data/Unfold.hs
330 main-is: Streamly/Benchmark/Data/Unfold.hs
385− if flag(use-streamly-core) || impl(ghcjs)
331+ if flag(bench-core) || impl(ghcjs)
386 buildable: False
332 buildable: False
387 else
333 else
388 buildable: True
334 buildable: True
@@ -392,7 +338,7 @@ benchmark Data.Fold
392 type: exitcode-stdio-1.0
338 type: exitcode-stdio-1.0
393 hs-source-dirs: Streamly/Benchmark/Data
339 hs-source-dirs: Streamly/Benchmark/Data
394 main-is: Fold.hs
340 main-is: Fold.hs
395− if flag(use-streamly-core) || impl(ghcjs)
341+ if flag(bench-core) || impl(ghcjs)
396 buildable: False
342 buildable: False
397 else
343 else
398 buildable: True
344 buildable: True
@@ -402,17 +348,17 @@ benchmark Data.Fold.Window
402 type: exitcode-stdio-1.0
348 type: exitcode-stdio-1.0
403 hs-source-dirs: Streamly/Benchmark/Data/Fold
349 hs-source-dirs: Streamly/Benchmark/Data/Fold
404 main-is: Window.hs
350 main-is: Window.hs
405− if flag(use-streamly-core)
351+ if flag(bench-core)
406 buildable: False
352 buildable: False
407 else
353 else
408 buildable: True
354 buildable: True
409
355
410−benchmark Data.Parser
356+benchmark Data.Parser.ParserD
411 import: bench-options
357 import: bench-options
412 type: exitcode-stdio-1.0
358 type: exitcode-stdio-1.0
413− hs-source-dirs: Streamly/Benchmark/Data
359+ hs-source-dirs: Streamly/Benchmark/Data/Parser
414− main-is: Parser.hs
360+ main-is: ParserD.hs
415− if impl(ghcjs)
361+ if flag(bench-core) || impl(ghcjs)
416 buildable: False
362 buildable: False
417 else
363 else
418 buildable: True
364 buildable: True
@@ -421,192 +367,93 @@ benchmark Data.Parser
421 if flag(dev)
367 if flag(dev)
422 ghc-options: +RTS -M3000M -RTS
368 ghc-options: +RTS -M3000M -RTS
423 else
369 else
424− ghc-options: +RTS -M2000M -RTS
370+ ghc-options: +RTS -M750M -RTS
425
371
426−benchmark Data.ParserK
372+benchmark Data.Parser.ParserK
427 import: bench-options
373 import: bench-options
428 type: exitcode-stdio-1.0
374 type: exitcode-stdio-1.0
429− hs-source-dirs: Streamly/Benchmark/Data
375+ hs-source-dirs: Streamly/Benchmark/Data/Parser
430− cpp-options: -DBENCH_SINGULAR
431 main-is: ParserK.hs
376 main-is: ParserK.hs
432− if impl(ghcjs)
377+ if flag(bench-core) || impl(ghcjs)
433 buildable: False
378 buildable: False
434 else
379 else
435 buildable: True
380 buildable: True
436 build-depends: exceptions >= 0.8 && < 0.11
381 build-depends: exceptions >= 0.8 && < 0.11
437
382
383+-- Note: to use this we have to set DISABLE_FUSION in ParserD.hs so that
384+-- the rewrite rules are disabled. We can also use the "no-fusion" build
385+-- flag but we need to keep in mind that it disables fusion for streams
386+-- as well.
438−benchmark Data.ParserK.Chunked
387+benchmark Data.Parser.FromParserK
439 import: bench-options
388 import: bench-options
440 type: exitcode-stdio-1.0
389 type: exitcode-stdio-1.0
441− hs-source-dirs: Streamly/Benchmark/Data
390+ hs-source-dirs: Streamly/Benchmark/Data/Parser
442− cpp-options: -DBENCH_CHUNKED
391+ cpp-options: -DFROM_PARSERK
443 main-is: ParserK.hs
392 main-is: ParserK.hs
444− if impl(ghcjs)
393+ if flag(bench-core) || impl(ghcjs)
445 buildable: False
394 buildable: False
446 else
395 else
447 buildable: True
396 buildable: True
448 build-depends: exceptions >= 0.8 && < 0.11
397 build-depends: exceptions >= 0.8 && < 0.11
449
398
450−benchmark Data.ParserK.Chunked.Generic
399+benchmark Data.Parser
451 import: bench-options
400 import: bench-options
452 type: exitcode-stdio-1.0
401 type: exitcode-stdio-1.0
453 hs-source-dirs: Streamly/Benchmark/Data
402 hs-source-dirs: Streamly/Benchmark/Data
454− cpp-options: -DBENCH_CHUNKED_GENERIC
455− main-is: ParserK.hs
403+ main-is: Parser.hs
456− if impl(ghcjs)
404+ if flag(bench-core) || impl(ghcjs)
457 buildable: False
405 buildable: False
458 else
406 else
459 buildable: True
407 buildable: True
460 build-depends: exceptions >= 0.8 && < 0.11
408 build-depends: exceptions >= 0.8 && < 0.11
409+ if flag(limit-build-mem)
410+ if flag(dev)
411+ ghc-options: +RTS -M3000M -RTS
412+ else
413+ ghc-options: +RTS -M1000M -RTS
461
414
462-------------------------------------------------------------------------------
415-------------------------------------------------------------------------------
463-- Raw Streams
416-- Raw Streams
464-------------------------------------------------------------------------------
417-------------------------------------------------------------------------------
465
418
466−benchmark Data.StreamD
419+benchmark Data.Stream.StreamD
467 import: bench-options
420 import: bench-options
468 type: exitcode-stdio-1.0
421 type: exitcode-stdio-1.0
469 hs-source-dirs: Streamly/Benchmark/Data/Stream
422 hs-source-dirs: Streamly/Benchmark/Data/Stream
470 main-is: StreamD.hs
423 main-is: StreamD.hs
471 if impl(ghcjs)
424 if impl(ghcjs)
472 buildable: False
425 buildable: False
426+ else
427+ buildable: True
473
428
474−benchmark Data.StreamK
429+benchmark Data.Stream.StreamK
475 import: bench-options
430 import: bench-options
476 type: exitcode-stdio-1.0
431 type: exitcode-stdio-1.0
477 hs-source-dirs: Streamly/Benchmark/Data/Stream
432 hs-source-dirs: Streamly/Benchmark/Data/Stream
478 main-is: StreamK.hs
433 main-is: StreamK.hs
479 if impl(ghcjs)
434 if impl(ghcjs)
480 buildable: False
435 buildable: False
436+ else
437+ buildable: True
481
438
482−benchmark Data.Stream.ToStreamK
439+benchmark Data.Stream.StreamDK
483− import: bench-options
484− type: exitcode-stdio-1.0
485− hs-source-dirs: Streamly/Benchmark/Data/Stream
486− main-is: ToStreamK.hs
487− if !flag(dev) || impl(ghcjs)
488− buildable: False
489−
490−benchmark Data.StreamK.Alt
491 import: bench-options
440 import: bench-options
492 type: exitcode-stdio-1.0
441 type: exitcode-stdio-1.0
493 hs-source-dirs: Streamly/Benchmark/Data/Stream
442 hs-source-dirs: Streamly/Benchmark/Data/Stream
494− main-is: StreamKAlt.hs
443+ main-is: StreamDK.hs
495− if !flag(dev) || impl(ghcjs)
444+ if impl(ghcjs)
496 buildable: False
445 buildable: False
446+ else
447+ buildable: True
497
448
498executable nano-bench
449executable nano-bench
499 import: bench-options
450 import: bench-options
500 hs-source-dirs: .
451 hs-source-dirs: .
501 main-is: NanoBenchmarks.hs
452 main-is: NanoBenchmarks.hs
502− if !flag(dev)
453+ if flag(dev)
503− buildable: False
454+ buildable: True
504−
505−-------------------------------------------------------------------------------
506−-- Streamly.Prelude
507−-------------------------------------------------------------------------------
508−
509−benchmark Prelude
510− import: bench-options
511− type: exitcode-stdio-1.0
512− hs-source-dirs: Streamly/Benchmark/Data
513− main-is: Stream.hs
514− other-modules:
515− Stream.Generate
516− Stream.Eliminate
517− Stream.Transform
518− Stream.Reduce
519− Stream.Expand
520− Stream.Lift
521− Stream.Common
522− Stream.Split
523− Stream.Exceptions
524− cpp-options: -DUSE_PRELUDE
525− if !flag(use-prelude)
526− buildable: False
527− if flag(limit-build-mem)
528− if flag(dev)
529− ghc-options: +RTS -M3500M -RTS
530− else
455+ else
531− ghc-options: +RTS -M2500M -RTS
532−
533−benchmark Prelude.WSerial
534− import: bench-options
535− type: exitcode-stdio-1.0
536− hs-source-dirs: Streamly/Benchmark/Prelude
537− main-is: WSerial.hs
538− cpp-options: -DUSE_PRELUDE
539− if !flag(use-prelude)
540− buildable: False
541− if flag(limit-build-mem)
542− ghc-options: +RTS -M750M -RTS
543−
544−benchmark Prelude.Merge
545− import: bench-options
546− type: exitcode-stdio-1.0
547− hs-source-dirs: Streamly/Benchmark/Prelude
548− main-is: Merge.hs
549− cpp-options: -DUSE_PRELUDE
550− if !flag(use-prelude)
551− buildable: False
552−
553−benchmark Prelude.ZipSerial
554− import: bench-options
555− type: exitcode-stdio-1.0
556− hs-source-dirs: Streamly/Benchmark/Prelude
557− main-is: ZipSerial.hs
558− cpp-options: -DUSE_PRELUDE
559− if !flag(use-prelude)
560− buildable: False
561−
562−benchmark Prelude.ZipAsync
563− import: bench-options
564− type: exitcode-stdio-1.0
565− hs-source-dirs: Streamly/Benchmark/Prelude
566− main-is: ZipAsync.hs
567− cpp-options: -DUSE_PRELUDE
568− if !flag(use-prelude)
569− buildable: False
570− if flag(limit-build-mem)
571− ghc-options: +RTS -M1000M -RTS
572−
573−benchmark Prelude.Ahead
574− import: bench-options-threaded
575− type: exitcode-stdio-1.0
576− hs-source-dirs: Streamly/Benchmark/Prelude
577− main-is: Ahead.hs
578− cpp-options: -DUSE_PRELUDE
579− if !flag(use-prelude)
580− buildable: False
581−
582−benchmark Prelude.Async
583− import: bench-options-threaded
584− type: exitcode-stdio-1.0
585− hs-source-dirs: Streamly/Benchmark/Prelude
586− main-is: Async.hs
587− cpp-options: -DUSE_PRELUDE
588− if !flag(use-prelude)
589− buildable: False
590−
591−benchmark Prelude.WAsync
592− import: bench-options-threaded
593− type: exitcode-stdio-1.0
594− hs-source-dirs: Streamly/Benchmark/Prelude
595− main-is: WAsync.hs
596− cpp-options: -DUSE_PRELUDE
597− if !flag(use-prelude)
598− buildable: False
599−
600−benchmark Prelude.Parallel
601− import: bench-options-threaded
602− type: exitcode-stdio-1.0
603− hs-source-dirs: Streamly/Benchmark/Prelude
604− main-is: Parallel.hs
605− cpp-options: -DUSE_PRELUDE
606− if !flag(use-prelude)
607 buildable: False
456 buildable: False
608− if flag(limit-build-mem)
609− ghc-options: +RTS -M2000M -RTS
610
457
611-------------------------------------------------------------------------------
458-------------------------------------------------------------------------------
612-- Concurrent Streams
459-- Concurrent Streams
@@ -617,76 +464,72 @@ benchmark Prelude.Concurrent
617 type: exitcode-stdio-1.0
464 type: exitcode-stdio-1.0
618 hs-source-dirs: Streamly/Benchmark/Prelude
465 hs-source-dirs: Streamly/Benchmark/Prelude
619 main-is: Concurrent.hs
466 main-is: Concurrent.hs
620− cpp-options: -DUSE_PRELUDE
467+ if flag(bench-core)
621− if !flag(use-prelude)
622 buildable: False
468 buildable: False
469+ else
470+ buildable: True
623
471
624benchmark Prelude.Adaptive
472benchmark Prelude.Adaptive
625 import: bench-options-threaded
473 import: bench-options-threaded
626 type: exitcode-stdio-1.0
474 type: exitcode-stdio-1.0
627 hs-source-dirs: Streamly/Benchmark/Prelude
475 hs-source-dirs: Streamly/Benchmark/Prelude
628 main-is: Adaptive.hs
476 main-is: Adaptive.hs
629− cpp-options: -DUSE_PRELUDE
477+ if flag(bench-core) || impl(ghcjs)
630− if !flag(use-prelude)
631 buildable: False
478 buildable: False
479+ else
480+ buildable: True
632
481
633benchmark Prelude.Rate
482benchmark Prelude.Rate
634 import: bench-options-threaded
483 import: bench-options-threaded
635 type: exitcode-stdio-1.0
484 type: exitcode-stdio-1.0
636 hs-source-dirs: Streamly/Benchmark/Prelude
485 hs-source-dirs: Streamly/Benchmark/Prelude
637 main-is: Rate.hs
486 main-is: Rate.hs
638− cpp-options: -DUSE_PRELUDE
487+ if flag(bench-core) || impl(ghcjs)
639− if !flag(use-prelude)
640 buildable: False
488 buildable: False
489+ else
490+ buildable: True
641
491
642-------------------------------------------------------------------------------
492-------------------------------------------------------------------------------
643-- Array Benchmarks
493-- Array Benchmarks
644-------------------------------------------------------------------------------
494-------------------------------------------------------------------------------
645
495
646−benchmark Data.Array.Generic
496+benchmark Data.Array
647 import: bench-options
497 import: bench-options
648 type: exitcode-stdio-1.0
498 type: exitcode-stdio-1.0
649− hs-source-dirs: ., Streamly/Benchmark/Data
499+ hs-source-dirs: .
650− main-is: Streamly/Benchmark/Data/Array/Generic.hs
500+ main-is: Streamly/Benchmark/Data/Array.hs
651− other-modules:
652− Stream.Common
653− if flag(use-streamly-core)
501+ if flag(bench-core)
654 buildable: False
502 buildable: False
655 else
503 else
656 buildable: True
504 buildable: True
657− if flag(limit-build-mem)
658− ghc-options: +RTS -M1000M -RTS
659
505
660benchmark Data.SmallArray
506benchmark Data.SmallArray
661 import: bench-options
507 import: bench-options
662 type: exitcode-stdio-1.0
508 type: exitcode-stdio-1.0
663 main-is: Streamly/Benchmark/Data/Array/SmallArray.hs
509 main-is: Streamly/Benchmark/Data/Array/SmallArray.hs
664− if flag(dev) && !flag(use-streamly-core)
510+ if flag(bench-core)
665− buildable: True
666− else
667 buildable: False
511 buildable: False
512+ else
513+ buildable: True
668
514
669−benchmark Data.Array
515+benchmark Data.Array.Foreign
670 import: bench-options
516 import: bench-options
671 type: exitcode-stdio-1.0
517 type: exitcode-stdio-1.0
672− hs-source-dirs: ., Streamly/Benchmark/Data
673− main-is: Streamly/Benchmark/Data/Array.hs
518+ main-is: Streamly/Benchmark/Data/Array/Foreign.hs
674− other-modules:
675− Stream.Common
676− if flag(use-streamly-core)
519+ if flag(bench-core)
677 buildable: False
520 buildable: False
678 else
521 else
679 buildable: True
522 buildable: True
680 if flag(limit-build-mem)
523 if flag(limit-build-mem)
681 ghc-options: +RTS -M1500M -RTS
524 ghc-options: +RTS -M1500M -RTS
682
525
683−benchmark Data.MutArray
526+benchmark Data.Array.Foreign.Mut
684 import: bench-options
527 import: bench-options
685 type: exitcode-stdio-1.0
528 type: exitcode-stdio-1.0
686− main-is: Streamly/Benchmark/Data/MutArray.hs
529+ main-is: Streamly/Benchmark/Data/Array/Foreign/Mut.hs
687 if flag(limit-build-mem)
530 if flag(limit-build-mem)
688 ghc-options: +RTS -M1500M -RTS
531 ghc-options: +RTS -M1500M -RTS
689− if flag(use-streamly-core)
532+ if flag(bench-core)
690 buildable: False
533 buildable: False
691 else
534 else
692 buildable: True
535 buildable: True
@@ -706,12 +549,12 @@ benchmark Data.Ring.Unboxed
706-- Array Stream Benchmarks
549-- Array Stream Benchmarks
707-------------------------------------------------------------------------------
550-------------------------------------------------------------------------------
708
551
709−benchmark Data.Array.Stream
552+benchmark Data.Array.Stream.Foreign
710 import: bench-options
553 import: bench-options
711 type: exitcode-stdio-1.0
554 type: exitcode-stdio-1.0
712− hs-source-dirs: Streamly/Benchmark/Data/Array
555+ hs-source-dirs: Streamly/Benchmark/Data/Array/Stream
713− main-is: Stream.hs
556+ main-is: Foreign.hs
714− if flag(use-streamly-core) || impl(ghcjs)
557+ if flag(bench-core) || impl(ghcjs)
715 buildable: False
558 buildable: False
716 else
559 else
717 buildable: True
560 buildable: True
@@ -731,7 +574,7 @@ benchmark FileSystem.Handle
731 , Handle.ReadWrite
574 , Handle.ReadWrite
732 if flag(limit-build-mem)
575 if flag(limit-build-mem)
733 ghc-options: +RTS -M1000M -RTS
576 ghc-options: +RTS -M1000M -RTS
734− if flag(use-streamly-core)
577+ if flag(bench-core)
735 buildable: False
578 buildable: False
736 else
579 else
737 buildable: True
580 buildable: True
@@ -747,7 +590,7 @@ benchmark Unicode.Stream
747 main-is: Stream.hs
590 main-is: Stream.hs
748 if flag(limit-build-mem)
591 if flag(limit-build-mem)
749 ghc-options: +RTS -M1000M -RTS
592 ghc-options: +RTS -M1000M -RTS
750− if flag(use-streamly-core)
593+ if flag(bench-core)
751 buildable: False
594 buildable: False
752 else
595 else
753 buildable: True
596 buildable: True
@@ -758,7 +601,7 @@ benchmark Unicode.Char
758 hs-source-dirs: Streamly/Benchmark/Unicode
601 hs-source-dirs: Streamly/Benchmark/Unicode
759 main-is: Char.hs
602 main-is: Char.hs
760 -- Takes too much memory for ghcjs
603 -- Takes too much memory for ghcjs
761− if flag(use-streamly-core) || impl(ghcjs)
604+ if flag(bench-core) || impl(ghcjs)
762 buildable: False
605 buildable: False
763
606
764benchmark Unicode.Utf8
607benchmark Unicode.Utf8
@@ -766,13 +609,7 @@ benchmark Unicode.Utf8
766 type: exitcode-stdio-1.0
609 type: exitcode-stdio-1.0
767 hs-source-dirs: Streamly/Benchmark/Unicode
610 hs-source-dirs: Streamly/Benchmark/Unicode
768 main-is: Utf8.hs
611 main-is: Utf8.hs
769− if flag(use-streamly-core)
612+ if flag(bench-core)
770 buildable: False
613 buildable: False
771 else
614 else
772 buildable: True
615 buildable: True
773−
774−benchmark Unicode.Parser
775− import: bench-options
776− type: exitcode-stdio-1.0
777− hs-source-dirs: Streamly/Benchmark/Unicode
778− main-is: Parser.hs
bin/mk-hscope.sh+1−1
@@ -1,7 +1,7 @@
1#!/usr/bin/env bash
1#!/usr/bin/env bash
2
2
3GHC_VERSION=8.10.4
3GHC_VERSION=8.10.4
4−STREAMLY_VERSION=0.9.0
4+STREAMLY_VERSION=0.8.2
5
5
6case `uname` in
6case `uname` in
7 Darwin) SYSTEM=x86_64-osx;;
7 Darwin) SYSTEM=x86_64-osx;;
bin/repldeleted−3
@@ -1,3 +0,0 @@
1−#!/bin/bash
2−
3−cabal repl --project-file cabal.project.O0
bin/run-ci.sh+20−10
@@ -18,8 +18,8 @@ CABAL_BUILD_OPTIONS="--flag limit-build-mem"
18#------------------------------------------------------------------------------
18#------------------------------------------------------------------------------
19
19
20# XXX take these from command line
20# XXX take these from command line
21−GHC_PRIME_NIX="ghc922"
21+GHC_PRIME_NIX="ghc8107"
22−GHC_PRIME_VER="9.2.2"
22+GHC_PRIME_VER="8.10"
23JOBS=1
23JOBS=1
24
24
25# Without cabal project file, it will not run any tests
25# Without cabal project file, it will not run any tests
@@ -108,7 +108,7 @@ werror () {
108ghc_prime_Werror () {
108ghc_prime_Werror () {
109 nix-shell \
109 nix-shell \
110 --argstr compiler "$GHC_PRIME_NIX" \
110 --argstr compiler "$GHC_PRIME_NIX" \
111− --run "cabal build $CABAL_BUILD_OPTIONS --jobs=$JOBS --project-file cabal.project.Werror --enable-tests --enable-benchmarks all"
111+ --run "cabal build $CABAL_BUILD_OPTIONS --jobs=$JOBS --project-file cabal.project.Werror all"
112}
112}
113
113
114ghc_prime_doctests () {
114ghc_prime_doctests () {
@@ -150,12 +150,24 @@ ghc_prime_dev_perf () {
150 \"--jobs=$JOBS --flag dev $PERF_FLAGS\" --quick --raw"
150 \"--jobs=$JOBS --flag dev $PERF_FLAGS\" --quick --raw"
151}
151}
152
152
153+ghc_prime_c_malloc () {
154+ nix-shell \
155+ --argstr compiler "$GHC_PRIME_NIX" \
156+ --run "bin/test-runner --cabal-build-options \"--jobs=$JOBS --flag use-c-malloc\""
157+}
158+
153ghc_prime_debug () {
159ghc_prime_debug () {
154 nix-shell \
160 nix-shell \
155 --argstr compiler "$GHC_PRIME_NIX" \
161 --argstr compiler "$GHC_PRIME_NIX" \
156 --run "bin/test-runner --cabal-build-options \"--jobs=$JOBS --flag debug\""
162 --run "bin/test-runner --cabal-build-options \"--jobs=$JOBS --flag debug\""
157}
163}
158
164
165+ghc_prime_streamk () {
166+ nix-shell \
167+ --argstr compiler "$GHC_PRIME_NIX" \
168+ --run "bin/test-runner --cabal-build-options \"--jobs=$JOBS --flag streamk\""
169+}
170+
159#------------------------------------------------------------------------------
171#------------------------------------------------------------------------------
160# Other GHC versions
172# Other GHC versions
161#------------------------------------------------------------------------------
173#------------------------------------------------------------------------------
@@ -200,15 +212,11 @@ ghcHEAD () {
200# ghcjs
212# ghcjs
201#------------------------------------------------------------------------------
213#------------------------------------------------------------------------------
202
214
203−# Use the following nix expression for ghcjs
204−# nix-env -f https://github.com/composewell/nixpkgs/archive/refs/tags/22.05-composewell.tar.gz -iA pkgs.haskell.compiler.ghcjs
205ghcjs () {
215ghcjs () {
206− # We don't pass 'CABAL_BUILD_OPTIONS="--flag limit-build-mem"' here as
216+ export PATH=~/.local/bin:/opt/ghc/bin:/opt/ghcjs/bin:/usr/local/bin:/usr/bin:/bin:/usr/sbin:/sbin:$PATH
207− # ghcjs requires more memory to build. Adding a conditional for ghcjs in
208− # the cabal file is a maintainence overhead.
209 packcheck.sh cabal-v2 \
217 packcheck.sh cabal-v2 \
210− GHCVER=8.10.7 \
218+ GHCVER=8.4.0 \
211− CABAL_BUILD_OPTIONS="--jobs=$JOBS" \
219+ CABAL_BUILD_OPTIONS="$CABAL_BUILD_OPTIONS --jobs=$JOBS" \
212 CABAL_CHECK_RELAX=y \
220 CABAL_CHECK_RELAX=y \
213 DISABLE_SDIST_BUILD=y \
221 DISABLE_SDIST_BUILD=y \
214 DISABLE_TEST=y \
222 DISABLE_TEST=y \
@@ -229,7 +237,9 @@ ghc_prime_O0 \
229ghc_prime_Werror \
237ghc_prime_Werror \
230ghc_prime_doctests \
238ghc_prime_doctests \
231ghc_prime_coverage \
239ghc_prime_coverage \
240+ghc_prime_c_malloc \
232ghc_prime_debug \
241ghc_prime_debug \
242+ghc_prime_streamk \
233ghc901 \
243ghc901 \
234ghc884 \
244ghc884 \
235ghcjs \
245ghcjs \
bin/run-repl-quick.sh+1−1
@@ -13,7 +13,7 @@ set -e
13
13
14SCRIPT_DIR=$(dirname $0)
14SCRIPT_DIR=$(dirname $0)
15
15
16−STREAMLY_VERSION=0.9.0
16+STREAMLY_VERSION=0.8.2
17BENCH_REPORT_DIR=benchmark/bench-report
17BENCH_REPORT_DIR=benchmark/bench-report
18source $SCRIPT_DIR/targets.sh
18source $SCRIPT_DIR/targets.sh
19
19
cabal.project.902new file+23
@@ -0,0 +1,23 @@
1+packages: streamly.cabal
2+ , core/streamly-core.cabal
3+ , test/streamly-tests.cabal
4+ , benchmark/streamly-benchmarks.cabal
5+ , docs/streamly-docs.cabal
6+
7+package base-orphans
8+ ghc-options: -optlm "--unresolved-symbols=ignore-all"
9+
10+package heaps
11+ ghc-options: -optlm "--unresolved-symbols=ignore-all"
12+
13+package network
14+ ghc-options: -optlm "--unresolved-symbols=ignore-all"
15+
16+package HUnit
17+ ghc-options: -optlm "--unresolved-symbols=ignore-all"
18+
19+package colour
20+ ghc-options: -optlm "--unresolved-symbols=ignore-all"
21+
22+package clock
23+ ghc-options: -optlm "--unresolved-symbols=ignore-all"
cabal.project.O0+4−4
@@ -9,16 +9,16 @@ packages:
9
9
10package streamly
10package streamly
11 flags: -opt
11 flags: -opt
12− ghc-options: -O0
12+ ghc-options: -O0 -Werror
13
13
14package streamly-core
14package streamly-core
15 flags: -opt
15 flags: -opt
16− ghc-options: -O0
16+ ghc-options: -O0 -Werror
17
17
18package streamly-tests
18package streamly-tests
19 flags: -opt
19 flags: -opt
20− ghc-options: -O0
20+ ghc-options: -O0 -Werror
21
21
22package streamly-benchmarks
22package streamly-benchmarks
23 flags: -opt
23 flags: -opt
24− ghc-options: -O0
24+ ghc-options: -O0 -Werror
cabal.project.Werror-nocode+3−7
@@ -4,18 +4,14 @@ packages:
4 test
4 test
5 core
5 core
6
6
7−package streamly-core
8− flags: -opt
9− ghc-options: -Werror -O0
10−
11package streamly
7package streamly
12− flags: -opt
8+ ghc-options: -Werror -fno-code
9+
10+package streamly-core
13 ghc-options: -Werror -fno-code
11 ghc-options: -Werror -fno-code
14
12
15package streamly-benchmarks
13package streamly-benchmarks
16− flags: -opt
17 ghc-options: -Werror -fno-code
14 ghc-options: -Werror -fno-code
18
15
19package streamly-tests
16package streamly-tests
20− flags: -opt
21 ghc-options: -Werror -fno-code
17 ghc-options: -Werror -fno-code
cabal.project.doctest+4−10
@@ -1,24 +1,18 @@
1packages: streamly.cabal
1packages: streamly.cabal
2 , core/streamly-core.cabal
2 , core/streamly-core.cabal
3− -- , docs/streamly-docs.cabal
3+ , docs/streamly-docs.cabal
4− -- for QuickCheck in property doctests
5− , test/streamly-tests.cabal
6
4
7-- Keep the flags same as cabal.project.O0 because we utilize the same build
5-- Keep the flags same as cabal.project.O0 because we utilize the same build
8-- for doctest in CI.
6-- for doctest in CI.
9
7
10package streamly
8package streamly
11 flags: -opt
9 flags: -opt
12− ghc-options: -O0
10+ ghc-options: -O0 -Werror
13
11
14package streamly-core
12package streamly-core
15 flags: -opt
13 flags: -opt
16− ghc-options: -O0
14+ ghc-options: -O0 -Werror
17
15
18package streamly-docs
16package streamly-docs
19 flags: -opt
17 flags: -opt
20− ghc-options: -O0
18+ ghc-options: -O0 -Werror
21−
22−package streamly-tests
23− flags: -opt
24− ghc-options: -O0
cabal.project.ghc-head+1−7
@@ -24,12 +24,6 @@ active-repositories: hackage.haskell.org, head.hackage.ghc.haskell.org:override
24source-repository-package
24source-repository-package
25 type: git
25 type: git
26 location: https://github.com/composewell/fusion-plugin
26 location: https://github.com/composewell/fusion-plugin
27− tag: 3c6535a7027d60d88c37b9a601cb180b805e7431
27+ tag: 25aa89c97aaaf83209d4282638ef774780061366
28−
29−source-repository-package
30− type: git
31− location: https://github.com/rrnewton/haskell-lockfree
32− tag: 00a70cfe74994b41eb3627c752170d1e82118a8e
33− subdir: lockfree-queue
34
28
35allow-newer: all
29allow-newer: all
cabal.project.packdiff+16−2
@@ -1,9 +1,23 @@
1+packages:
2+ streamly.cabal
3+ core/streamly-core.cabal
4+
1source-repository-package
5source-repository-package
2 type: git
6 type: git
3 location: https://github.com/composewell/packdiff.git
7 location: https://github.com/composewell/packdiff.git
4− tag: b11a50c9c0523382a19eebc0b12efdae194406a9
8+ tag: 8ce91f9750cba77a59399c9c3e81a8196bb67e0c
9+
10+source-repository-package
11+ type: git
12+ location: https://github.com/composewell/streamly-shell.git
13+ tag: 1b3fea3239ebe47963955d81565b9d5e34567ab7
14+
15+source-repository-package
16+ type: git
17+ location: https://github.com/composewell/streamly-coreutils.git
18+ tag: 74cfc8e5a12e4acfd65f943e3787221d6cf356dc
5
19
6source-repository-package
20source-repository-package
7 type: git
21 type: git
8 location: https://github.com/composewell/streamly-process.git
22 location: https://github.com/composewell/streamly-process.git
9− tag: d80b860d9d8ea98e4f7f63390442b3155c34dd08
23+ tag: e310c8a9c6e61515373a2f5f1fb82f6e15fe452b
cabal.project.report+6−4
@@ -2,6 +2,8 @@ packages:
2 targets/streamly-targets.cabal
2 targets/streamly-targets.cabal
3 benchmark/bench-runner/bench-runner.cabal
3 benchmark/bench-runner/bench-runner.cabal
4 test/test-runner/test-runner.cabal
4 test/test-runner/test-runner.cabal
5+ streamly.cabal
6+ core/streamly-core.cabal
5
7
6package bench-report
8package bench-report
7 flags: +no-charts
9 flags: +no-charts
@@ -12,19 +14,19 @@ package bench-show
12source-repository-package
14source-repository-package
13 type: git
15 type: git
14 location: https://github.com/composewell/bench-report.git
16 location: https://github.com/composewell/bench-report.git
15− tag: 3b50bf0ad06f746bca42f30c8d40a0426e159af3
17+ tag: ca3872acd4b817731b951c6ed91bfa6c58f26c5a
16
18
17source-repository-package
19source-repository-package
18 type: git
20 type: git
19 location: https://github.com/composewell/streamly-coreutils.git
21 location: https://github.com/composewell/streamly-coreutils.git
20− tag: 5dbb8bcefac3aefd5eb298dc410b11e36e79f35a
22+ tag: 74cfc8e5a12e4acfd65f943e3787221d6cf356dc
21
23
22source-repository-package
24source-repository-package
23 type: git
25 type: git
24 location: https://github.com/composewell/streamly-shell.git
26 location: https://github.com/composewell/streamly-shell.git
25− tag: b0c6318119d1cc5e2106343f17b5cff2ad94417f
27+ tag: 1b3fea3239ebe47963955d81565b9d5e34567ab7
26
28
27source-repository-package
29source-repository-package
28 type: git
30 type: git
29 location: https://github.com/composewell/streamly-process.git
31 location: https://github.com/composewell/streamly-process.git
30− tag: d80b860d9d8ea98e4f7f63390442b3155c34dd08
32+ tag: e310c8a9c6e61515373a2f5f1fb82f6e15fe452b
cabal.project.streamlydeleted−10
@@ -1,10 +0,0 @@
1−packages: streamly.cabal
2− , test/streamly-tests.cabal
3− , benchmark/streamly-benchmarks.cabal
4− , docs/streamly-docs.cabal
5−
6−source-repository-package
7− type: git
8− location: https://github.com/composewell/streamly
9− tag: master
10− subdir: core
configure+9−9
@@ -1,6 +1,6 @@
1#! /bin/sh
1#! /bin/sh
2# Guess values for system-dependent variables and create Makefiles.
2# Guess values for system-dependent variables and create Makefiles.
3−# Generated by GNU Autoconf 2.71 for streamly 0.10.1.
3+# Generated by GNU Autoconf 2.71 for streamly 0.9.0.
4#
4#
5# Report bugs to <streamly@composewell.com>.
5# Report bugs to <streamly@composewell.com>.
6#
6#
@@ -610,8 +610,8 @@ MAKEFLAGS=
610# Identity of this package.
610# Identity of this package.
611PACKAGE_NAME='streamly'
611PACKAGE_NAME='streamly'
612PACKAGE_TARNAME='streamly'
612PACKAGE_TARNAME='streamly'
613−PACKAGE_VERSION='0.10.1'
613+PACKAGE_VERSION='0.9.0'
614−PACKAGE_STRING='streamly 0.10.1'
614+PACKAGE_STRING='streamly 0.9.0'
615PACKAGE_BUGREPORT='streamly@composewell.com'
615PACKAGE_BUGREPORT='streamly@composewell.com'
616PACKAGE_URL='https://streamly.composewell.com'
616PACKAGE_URL='https://streamly.composewell.com'
617
617
@@ -1224,7 +1224,7 @@ if test "$ac_init_help" = "long"; then
1224 # Omit some internal or obsolete options to make the list less imposing.
1224 # Omit some internal or obsolete options to make the list less imposing.
1225 # This message is too long to be a string in the A/UX 3.1 sh.
1225 # This message is too long to be a string in the A/UX 3.1 sh.
1226 cat <<_ACEOF
1226 cat <<_ACEOF
1227−\`configure' configures streamly 0.10.1 to adapt to many kinds of systems.
1227+\`configure' configures streamly 0.9.0 to adapt to many kinds of systems.
1228
1228
1229Usage: $0 [OPTION]... [VAR=VALUE]...
1229Usage: $0 [OPTION]... [VAR=VALUE]...
1230
1230
@@ -1286,7 +1286,7 @@ fi
1286
1286
1287if test -n "$ac_init_help"; then
1287if test -n "$ac_init_help"; then
1288 case $ac_init_help in
1288 case $ac_init_help in
1289− short | recursive ) echo "Configuration of streamly 0.10.1:";;
1289+ short | recursive ) echo "Configuration of streamly 0.9.0:";;
1290 esac
1290 esac
1291 cat <<\_ACEOF
1291 cat <<\_ACEOF
1292
1292
@@ -1372,7 +1372,7 @@ fi
1372test -n "$ac_init_help" && exit $ac_status
1372test -n "$ac_init_help" && exit $ac_status
1373if $ac_init_version; then
1373if $ac_init_version; then
1374 cat <<\_ACEOF
1374 cat <<\_ACEOF
1375−streamly configure 0.10.1
1375+streamly configure 0.9.0
1376generated by GNU Autoconf 2.71
1376generated by GNU Autoconf 2.71
1377
1377
1378Copyright (C) 2021 Free Software Foundation, Inc.
1378Copyright (C) 2021 Free Software Foundation, Inc.
@@ -1500,7 +1500,7 @@ cat >config.log <<_ACEOF
1500This file contains any messages produced by compilers while
1500This file contains any messages produced by compilers while
1501running configure, to aid debugging if configure makes a mistake.
1501running configure, to aid debugging if configure makes a mistake.
1502
1502
1503−It was created by streamly $as_me 0.10.1, which was
1503+It was created by streamly $as_me 0.9.0, which was
1504generated by GNU Autoconf 2.71. Invocation command line was
1504generated by GNU Autoconf 2.71. Invocation command line was
1505
1505
1506 $ $0$ac_configure_args_raw
1506 $ $0$ac_configure_args_raw
@@ -3800,7 +3800,7 @@ cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
3800# report actual input values of CONFIG_FILES etc. instead of their
3800# report actual input values of CONFIG_FILES etc. instead of their
3801# values after options handling.
3801# values after options handling.
3802ac_log="
3802ac_log="
3803−This file was extended by streamly $as_me 0.10.1, which was
3803+This file was extended by streamly $as_me 0.9.0, which was
3804generated by GNU Autoconf 2.71. Invocation command line was
3804generated by GNU Autoconf 2.71. Invocation command line was
3805
3805
3806 CONFIG_FILES = $CONFIG_FILES
3806 CONFIG_FILES = $CONFIG_FILES
@@ -3856,7 +3856,7 @@ ac_cs_config_escaped=`printf "%s\n" "$ac_cs_config" | sed "s/^ //; s/'/'\\\\\\\\
3856cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
3856cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
3857ac_cs_config='$ac_cs_config_escaped'
3857ac_cs_config='$ac_cs_config_escaped'
3858ac_cs_version="\\
3858ac_cs_version="\\
3859−streamly config.status 0.10.1
3859+streamly config.status 0.9.0
3860configured by $0, generated by GNU Autoconf 2.71,
3860configured by $0, generated by GNU Autoconf 2.71,
3861 with options \\"\$ac_cs_config\\"
3861 with options \\"\$ac_cs_config\\"
3862
3862
configure.ac+1−1
@@ -3,7 +3,7 @@
3# See https://www.gnu.org/software/autoconf/manual/autoconf.html for help on
3# See https://www.gnu.org/software/autoconf/manual/autoconf.html for help on
4# the macros used in this file.
4# the macros used in this file.
5
5
6−AC_INIT([streamly], [0.10.1], [streamly@composewell.com], [streamly], [https://streamly.composewell.com])
6+AC_INIT([streamly], [0.9.0], [streamly@composewell.com], [streamly], [https://streamly.composewell.com])
7
7
8# To suppress "WARNING: unrecognized options: --with-compiler"
8# To suppress "WARNING: unrecognized options: --with-compiler"
9AC_ARG_WITH([compiler], [GHC])
9AC_ARG_WITH([compiler], [GHC])
core/Changelog.mddeleted−1
@@ -1 +0,0 @@
1−docs/Changelog.md
core/LICENSEdeleted−322
@@ -1,322 +0,0 @@
1−Copyright (c) 2017, Composewell Technologies
2−All rights reserved.
3−
4−Redistribution and use in source and binary forms, with or without
5−modification, are permitted provided that the following conditions are met:
6−
7−1. Redistributions of source code must retain the above copyright notice, this
8−list of conditions and the following disclaimer.
9−
10−2. Redistributions in binary form must reproduce the above copyright notice,
11−this list of conditions and the following disclaimer in the documentation
12−and/or other materials provided with the distribution.
13−
14−3. Neither the name of the copyright holder nor the names of its contributors
15−may be used to endorse or promote products derived from this software without
16−specific prior written permission.
17−
18−THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
19−ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
20−WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
21−DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
22−FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23−DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
24−SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
25−CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
26−OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27−OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28−
29−-------------------------------------------------------------------------------
30−base-4.12.0.0 (http://hackage.haskell.org/package/base-4.12.0.0)
31−-------------------------------------------------------------------------------
32−This library (libraries/base) is derived from code from several
33−sources:
34−
35− * Code from the GHC project which is largely (c) The University of
36− Glasgow, and distributable under a BSD-style license (see below),
37−
38− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
39− and freely redistributable (but see the full license for
40− restrictions).
41−
42− * Code from the Haskell Foreign Function Interface specification,
43− which is (c) Manuel M. T. Chakravarty and freely redistributable
44− (but see the full license for restrictions).
45−
46−The full text of these licenses is reproduced below. All of the
47−licenses are BSD-style or compatible.
48−
49−The Glasgow Haskell Compiler License
50−
51−Copyright 2004, The University Court of the University of Glasgow.
52−All rights reserved.
53−
54−Redistribution and use in source and binary forms, with or without
55−modification, are permitted provided that the following conditions are met:
56−
57−- Redistributions of source code must retain the above copyright notice,
58−this list of conditions and the following disclaimer.
59−
60−- Redistributions in binary form must reproduce the above copyright notice,
61−this list of conditions and the following disclaimer in the documentation
62−and/or other materials provided with the distribution.
63−
64−- Neither name of the University nor the names of its contributors may be
65−used to endorse or promote products derived from this software without
66−specific prior written permission.
67−
68−THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
69−GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
70−INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
71−FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
72−UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
73−FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
74−DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
75−SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
76−CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
77−LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
78−OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
79−DAMAGE.
80−
81−Code derived from the document "Report on the Programming Language
82−Haskell 98", is distributed under the following license:
83−
84− Copyright (c) 2002 Simon Peyton Jones
85−
86− The authors intend this Report to belong to the entire Haskell
87− community, and so we grant permission to copy and distribute it for
88− any purpose, provided that it is reproduced in its entirety,
89− including this Notice. Modified versions of this Report may also be
90− copied and distributed for any purpose, provided that the modified
91− version is clearly presented as such, and that it does not claim to
92− be a definition of the Haskell 98 Language.
93−
94−Code derived from the document "The Haskell 98 Foreign Function
95−Interface, An Addendum to the Haskell 98 Report" is distributed under
96−the following license:
97−
98− Copyright (c) 2002 Manuel M. T. Chakravarty
99−
100− The authors intend this Report to belong to the entire Haskell
101− community, and so we grant permission to copy and distribute it for
102− any purpose, provided that it is reproduced in its entirety,
103− including this Notice. Modified versions of this Report may also be
104− copied and distributed for any purpose, provided that the modified
105− version is clearly presented as such, and that it does not claim to
106− be a definition of the Haskell 98 Foreign Function Interface.
107−
108−-------------------------------------------------------------------------------
109−bjoern-2008-2009 (http://bjoern.hoehrmann.de/utf-8/decoder/dfa/)
110−-------------------------------------------------------------------------------
111−Copyright (c) 2008-2009 Bjoern Hoehrmann <bjoern@hoehrmann.de>
112−
113−Permission is hereby granted, free of charge, to any person obtaining a copy of
114−this software and associated documentation files (the "Software"), to deal in
115−the Software without restriction, including without limitation the rights to
116−use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
117−of the Software, and to permit persons to whom the Software is furnished to do
118−so, subject to the following conditions:
119−
120−The above copyright notice and this permission notice shall be included in all
121−copies or substantial portions of the Software.
122−
123−THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
124−IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
125−FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
126−AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
127−LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
128−OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
129−SOFTWARE.
130−
131−-------------------------------------------------------------------------------
132−clock-0.7.2 (http://hackage.haskell.org/package/clock-0.7.2)
133−-------------------------------------------------------------------------------
134−Copyright (c) 2009-2012, Cetin Sert
135−Copyright (c) 2010, Eugene Kirpichov
136−
137−All rights reserved.
138−
139−Redistribution and use in source and binary forms, with or without
140−modification, are permitted provided that the following conditions are
141−met:
142−
143− * Redistributions of source code must retain the above copyright
144− notice, this list of conditions and the following disclaimer.
145−
146− * Redistributions in binary form must reproduce the above
147− copyright notice, this list of conditions and the following
148− disclaimer in the documentation and/or other materials provided
149− with the distribution.
150−
151− * The names of contributors may not be used to endorse or promote
152− products derived from this software without specific prior
153− written permission.
154−
155−THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
156−"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
157−LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
158−A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
159−OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
160−SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
161−LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
162−DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
163−THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
164−(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
165−OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
166−
167−-------------------------------------------------------------------------------
168−foldl-1.4.5 (http://hackage.haskell.org/package/foldl-1.4.5)
169−-------------------------------------------------------------------------------
170−Copyright (c) 2013 Gabriel Gonzalez
171−All rights reserved.
172−
173−Redistribution and use in source and binary forms, with or without modification,
174−are permitted provided that the following conditions are met:
175− * Redistributions of source code must retain the above copyright notice,
176− this list of conditions and the following disclaimer.
177− * Redistributions in binary form must reproduce the above copyright notice,
178− this list of conditions and the following disclaimer in the documentation
179− and/or other materials provided with the distribution.
180− * Neither the name of Gabriel Gonzalez nor the names of other contributors
181− may be used to endorse or promote products derived from this software
182− without specific prior written permission.
183−
184−THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
185−ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
186−WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
187−DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
188−ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
189−(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
190−LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
191−ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
192−(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
193−SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
194−
195−-------------------------------------------------------------------------------
196−primitive-0.7.0.0 (https://hackage.haskell.org/package/primitive-0.7.0.0)
197−-------------------------------------------------------------------------------
198−Copyright (c) 2008-2009, Roman Leshchinskiy
199−All rights reserved.
200−
201−Redistribution and use in source and binary forms, with or without
202−modification, are permitted provided that the following conditions are met:
203−
204−- Redistributions of source code must retain the above copyright notice,
205−this list of conditions and the following disclaimer.
206−
207−- Redistributions in binary form must reproduce the above copyright notice,
208−this list of conditions and the following disclaimer in the documentation
209−and/or other materials provided with the distribution.
210−
211−- Neither name of the University nor the names of its contributors may be
212−used to endorse or promote products derived from this software without
213−specific prior written permission.
214−
215−THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
216−GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
217−INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
218−FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
219−UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
220−FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
221−DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
222−SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
223−CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
224−LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
225−OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
226−DAMAGE.
227−
228−-------------------------------------------------------------------------------
229−transient-0.5.5 (http://hackage.haskell.org/package/transient-0.5.5)
230−-------------------------------------------------------------------------------
231−Copyright © 2014-2016 Alberto G. Corona <https://github.com/agocorona>
232−
233−Permission is hereby granted, free of charge, to any person obtaining a copy of
234−this software and associated documentation files (the "Software"), to deal in
235−the Software without restriction, including without limitation the rights to
236−use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
237−the Software, and to permit persons to whom the Software is furnished to do so,
238−subject to the following conditions:
239−
240−The above copyright notice and this permission notice shall be included in all
241−copies or substantial portions of the Software.
242−
243−THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
244−IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
245−FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
246−COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
247−IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
248−CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
249−
250−-------------------------------------------------------------------------------
251−vector-0.12.0.2 (http://hackage.haskell.org/package/vector-0.12.0.2)
252−-------------------------------------------------------------------------------
253−Copyright (c) 2008-2012, Roman Leshchinskiy
254−All rights reserved.
255−
256−Redistribution and use in source and binary forms, with or without
257−modification, are permitted provided that the following conditions are met:
258−
259−- Redistributions of source code must retain the above copyright notice,
260−this list of conditions and the following disclaimer.
261−
262−- Redistributions in binary form must reproduce the above copyright notice,
263−this list of conditions and the following disclaimer in the documentation
264−and/or other materials provided with the distribution.
265−
266−- Neither name of the University nor the names of its contributors may be
267−used to endorse or promote products derived from this software without
268−specific prior written permission.
269−
270−THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
271−GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
272−INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
273−FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
274−UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
275−FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
276−DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
277−SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
278−CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
279−LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
280−OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
281−DAMAGE.
282−
283−-------------------------------------------------------------------------------
284−th-utilities-0.2.5.0 (https://hackage.haskell.org/package/th-utilities)
285−-------------------------------------------------------------------------------
286−Copyright (c) 2016 FP Complete Corporation.
287−
288−Permission is hereby granted, free of charge, to any person obtaining
289−a copy of this software and associated documentation files (the
290−"Software"), to deal in the Software without restriction, including
291−without limitation the rights to use, copy, modify, merge, publish,
292−distribute, sublicense, and/or sell copies of the Software, and to
293−permit persons to whom the Software is furnished to do so, subject to
294−the following conditions:
295−
296−The above copyright notice and this permission notice shall be
297−included in all copies or substantial portions of the Software.
298−
299−THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
300−EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
301−MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
302−NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
303−LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
304−OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
305−WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
306−
307−-------------------------------------------------------------------------------
308−th-abstraction-0.5.0.0 (https://hackage.haskell.org/package/th-abstraction)
309−-------------------------------------------------------------------------------
310−Copyright (c) 2017-2020 Eric Mertens
311−
312−Permission to use, copy, modify, and/or distribute this software for any purpose
313−with or without fee is hereby granted, provided that the above copyright notice
314−and this permission notice appear in all copies.
315−
316−THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
317−REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
318−FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
319−INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
320−OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
321−TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
322−THIS SOFTWARE.
core/configure+9−9
@@ -1,6 +1,6 @@
1#! /bin/sh
1#! /bin/sh
2# Guess values for system-dependent variables and create Makefiles.
2# Guess values for system-dependent variables and create Makefiles.
3−# Generated by GNU Autoconf 2.71 for streamly-core 0.2.2.
3+# Generated by GNU Autoconf 2.71 for streamly-core 0.8.2.
4#
4#
5# Report bugs to <streamly@composewell.com>.
5# Report bugs to <streamly@composewell.com>.
6#
6#
@@ -610,8 +610,8 @@ MAKEFLAGS=
610# Identity of this package.
610# Identity of this package.
611PACKAGE_NAME='streamly-core'
611PACKAGE_NAME='streamly-core'
612PACKAGE_TARNAME='streamly-core'
612PACKAGE_TARNAME='streamly-core'
613−PACKAGE_VERSION='0.2.2'
613+PACKAGE_VERSION='0.8.2'
614−PACKAGE_STRING='streamly-core 0.2.2'
614+PACKAGE_STRING='streamly-core 0.8.2'
615PACKAGE_BUGREPORT='streamly@composewell.com'
615PACKAGE_BUGREPORT='streamly@composewell.com'
616PACKAGE_URL='https://streamly.composewell.com'
616PACKAGE_URL='https://streamly.composewell.com'
617
617
@@ -1256,7 +1256,7 @@ if test "$ac_init_help" = "long"; then
1256 # Omit some internal or obsolete options to make the list less imposing.
1256 # Omit some internal or obsolete options to make the list less imposing.
1257 # This message is too long to be a string in the A/UX 3.1 sh.
1257 # This message is too long to be a string in the A/UX 3.1 sh.
1258 cat <<_ACEOF
1258 cat <<_ACEOF
1259−\`configure' configures streamly-core 0.2.2 to adapt to many kinds of systems.
1259+\`configure' configures streamly-core 0.8.2 to adapt to many kinds of systems.
1260
1260
1261Usage: $0 [OPTION]... [VAR=VALUE]...
1261Usage: $0 [OPTION]... [VAR=VALUE]...
1262
1262
@@ -1318,7 +1318,7 @@ fi
1318
1318
1319if test -n "$ac_init_help"; then
1319if test -n "$ac_init_help"; then
1320 case $ac_init_help in
1320 case $ac_init_help in
1321− short | recursive ) echo "Configuration of streamly-core 0.2.2:";;
1321+ short | recursive ) echo "Configuration of streamly-core 0.8.2:";;
1322 esac
1322 esac
1323 cat <<\_ACEOF
1323 cat <<\_ACEOF
1324
1324
@@ -1404,7 +1404,7 @@ fi
1404test -n "$ac_init_help" && exit $ac_status
1404test -n "$ac_init_help" && exit $ac_status
1405if $ac_init_version; then
1405if $ac_init_version; then
1406 cat <<\_ACEOF
1406 cat <<\_ACEOF
1407−streamly-core configure 0.2.2
1407+streamly-core configure 0.8.2
1408generated by GNU Autoconf 2.71
1408generated by GNU Autoconf 2.71
1409
1409
1410Copyright (C) 2021 Free Software Foundation, Inc.
1410Copyright (C) 2021 Free Software Foundation, Inc.
@@ -1622,7 +1622,7 @@ cat >config.log <<_ACEOF
1622This file contains any messages produced by compilers while
1622This file contains any messages produced by compilers while
1623running configure, to aid debugging if configure makes a mistake.
1623running configure, to aid debugging if configure makes a mistake.
1624
1624
1625−It was created by streamly-core $as_me 0.2.2, which was
1625+It was created by streamly-core $as_me 0.8.2, which was
1626generated by GNU Autoconf 2.71. Invocation command line was
1626generated by GNU Autoconf 2.71. Invocation command line was
1627
1627
1628 $ $0$ac_configure_args_raw
1628 $ $0$ac_configure_args_raw
@@ -3832,7 +3832,7 @@ cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
3832# report actual input values of CONFIG_FILES etc. instead of their
3832# report actual input values of CONFIG_FILES etc. instead of their
3833# values after options handling.
3833# values after options handling.
3834ac_log="
3834ac_log="
3835−This file was extended by streamly-core $as_me 0.2.2, which was
3835+This file was extended by streamly-core $as_me 0.8.2, which was
3836generated by GNU Autoconf 2.71. Invocation command line was
3836generated by GNU Autoconf 2.71. Invocation command line was
3837
3837
3838 CONFIG_FILES = $CONFIG_FILES
3838 CONFIG_FILES = $CONFIG_FILES
@@ -3888,7 +3888,7 @@ ac_cs_config_escaped=`printf "%s\n" "$ac_cs_config" | sed "s/^ //; s/'/'\\\\\\\\
3888cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
3888cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
3889ac_cs_config='$ac_cs_config_escaped'
3889ac_cs_config='$ac_cs_config_escaped'
3890ac_cs_version="\\
3890ac_cs_version="\\
3891−streamly-core config.status 0.2.2
3891+streamly-core config.status 0.8.2
3892configured by $0, generated by GNU Autoconf 2.71,
3892configured by $0, generated by GNU Autoconf 2.71,
3893 with options \\"\$ac_cs_config\\"
3893 with options \\"\$ac_cs_config\\"
3894
3894
core/configure.ac+1−1
@@ -3,7 +3,7 @@
3# See https://www.gnu.org/software/autoconf/manual/autoconf.html for help on
3# See https://www.gnu.org/software/autoconf/manual/autoconf.html for help on
4# the macros used in this file.
4# the macros used in this file.
5
5
6−AC_INIT([streamly-core], [0.2.2], [streamly@composewell.com], [streamly-core], [https://streamly.composewell.com])
6+AC_INIT([streamly-core], [0.8.2], [streamly@composewell.com], [streamly-core], [https://streamly.composewell.com])
7
7
8# To suppress "WARNING: unrecognized options: --with-compiler"
8# To suppress "WARNING: unrecognized options: --with-compiler"
9AC_ARG_WITH([compiler], [GHC])
9AC_ARG_WITH([compiler], [GHC])
core/docs/ApiChangelogs/0.1.0-0.2.0.txtdeleted−1471
@@ -1,1471 +0,0 @@
1−---------------------------------
2−API Annotations
3−---------------------------------
4−
5−[A] : Added
6−[R] : Removed
7−[C] : Changed
8−[O] : Old definition
9−[N] : New definition
10−[D] : Deprecated
11−
12−---------------------------------
13−API diff
14−---------------------------------
15−
16−[C] Streamly.Unicode.Parser
17− [A] double :: Monad m => Parser Char m Double
18−[C] Streamly.FileSystem.Handle
19− [A] readWith :: MonadIO m => Int -> Handle -> Stream m Word8
20− [A] readChunksWith :: MonadIO m => Int -> Handle -> Stream m (Array Word8)
21−[C] Streamly.FileSystem.Dir
22− [C] readEither
23− [O] readEither :: MonadIO m => FilePath -> Stream m (Either FilePath FilePath)
24− [N] readEither :: (MonadIO m, MonadCatch m) => FilePath -> Stream m (Either FilePath FilePath)
25− [C] read
26− [O] read :: MonadIO m => FilePath -> Stream m FilePath
27− [N] read :: (MonadIO m, MonadCatch m) => FilePath -> Stream m FilePath
28−[C] Streamly.Data.Unfold
29− [A] class Enum a => Enumerable a
30− [A] second :: b -> Unfold m (a, b) c -> Unfold m a c
31− [A] first :: a -> Unfold m (a, b) c -> Unfold m b c
32− [A] enumerateFromTo :: (Enumerable a, Monad m) => Unfold m (a, a) a
33− [A] enumerateFromThenTo :: (Enumerable a, Monad m) => Unfold m (a, a, a) a
34− [A] enumerateFromThen :: (Enumerable a, Monad m) => Unfold m (a, a) a
35− [A] enumerateFrom :: (Enumerable a, Monad m) => Unfold m a a
36−[C] Streamly.Data.StreamK
37− [C] parseChunks
38− [O] parseChunks :: (Monad m, Unbox a) => ParserK a m b -> StreamK m (Array a) -> m (Either ParseError b)
39− [N] parseChunks :: (Monad m, Unbox a) => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b)
40− [C] parseBreakChunks
41− [O] parseBreakChunks :: (Monad m, Unbox a) => ParserK a m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
42− [N] parseBreakChunks :: (Monad m, Unbox a) => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
43− [A] parseBreak :: forall m a b. Monad m => ParserK a m b -> StreamK m a -> m (Either ParseError b, StreamK m a)
44− [A] parse :: Monad m => ParserK a m b -> StreamK m a -> m (Either ParseError b)
45− [A] handle :: (MonadCatch m, Exception e) => (e -> m (StreamK m a)) -> StreamK m a -> StreamK m a
46− [A] bracketIO :: (MonadIO m, MonadCatch m) => IO b -> (b -> IO c) -> (b -> StreamK m a) -> StreamK m a
47−[C] Streamly.Data.Stream
48− [A] wordsBy :: Monad m => (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
49− [A] splitOn :: Monad m => (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
50− [C] handle
51− [O] handle :: (MonadCatch m, Exception e) => (e -> Stream m a) -> Stream m a -> Stream m a
52− [N] handle :: (MonadCatch m, Exception e) => (e -> m (Stream m a)) -> Stream m a -> Stream m a
53− [A] groupsOf :: Monad m => Int -> Fold m a b -> Stream m a -> Stream m b
54−[C] Streamly.Data.ParserK
55− [D] fromParser :: (MonadIO m, Unbox a) => Parser a m b -> ParserK (Array a) m b
56− [D] fromFold :: (MonadIO m, Unbox a) => Fold m a b -> ParserK (Array a) m b
57− [A] adaptCG :: Monad m => Parser a m b -> ParserK (Array a) m b
58− [A] adaptC :: (Monad m, Unbox a) => Parser a m b -> ParserK (Array a) m b
59− [A] adapt :: Monad m => Parser a m b -> ParserK a m b
60−[C] Streamly.Data.Parser
61− [A] groupByRollingEither :: Monad m => (a -> a -> Bool) -> Fold m a b -> Fold m a c -> Parser a m (Either b c)
62− [A] groupByRolling :: Monad m => (a -> a -> Bool) -> Fold m a b -> Parser a m b
63−[A] Streamly.Data.MutByteArray
64− [A] class Unbox a
65− [A] class Serialize a
66− [A] SerializeConfig
67− [A] MutByteArray
68− [A] unpin :: MutByteArray -> IO MutByteArray
69− [A] sizeOf :: (Unbox a, SizeOfRep (Rep a)) => Proxy a -> Int
70− [A] serializeAt :: Serialize a => Int -> MutByteArray -> a -> IO Int
71− [A] pokeAt :: (Unbox a, Generic a, PokeRep (Rep a)) => Int -> MutByteArray -> a -> IO ()
72− [A] pinnedNew :: Int -> IO MutByteArray
73− [A] pin :: MutByteArray -> IO MutByteArray
74− [A] peekAt :: (Unbox a, Generic a, PeekRep (Rep a)) => Int -> MutByteArray -> IO a
75− [A] new :: Int -> IO MutByteArray
76− [A] isPinned :: MutByteArray -> Bool
77− [A] inlineSerializeAt :: Maybe Inline -> SerializeConfig -> SerializeConfig
78− [A] inlineDeserializeAt :: Maybe Inline -> SerializeConfig -> SerializeConfig
79− [A] inlineAddSizeTo :: Maybe Inline -> SerializeConfig -> SerializeConfig
80− [A] deserializeAt :: Serialize a => Int -> MutByteArray -> Int -> IO (Int, a)
81− [A] deriveUnbox :: Q [Dec] -> Q [Dec]
82− [A] deriveSerializeWith :: (SerializeConfig -> SerializeConfig) -> Q [Dec] -> Q [Dec]
83− [A] deriveSerialize :: Q [Dec] -> Q [Dec]
84− [A] addSizeTo :: Serialize a => Int -> a -> Int
85−[C] Streamly.Data.MutArray.Generic
86− [A] write :: MonadIO m => Fold m a (MutArray a)
87− [A] readRev :: MonadIO m => MutArray a -> Stream m a
88− [A] read :: MonadIO m => MutArray a -> Stream m a
89− [A] putIndexUnsafe :: forall m a. MonadIO m => Int -> MutArray a -> a -> m ()
90− [A] modifyIndexUnsafe :: MonadIO m => Int -> MutArray a -> (a -> (a, b)) -> m b
91− [A] length :: MutArray a -> Int
92− [A] getIndexUnsafe :: MonadIO m => Int -> MutArray a -> m a
93− [C] getIndex
94− [O] getIndex :: MonadIO m => Int -> MutArray a -> m a
95− [N] getIndex :: MonadIO m => Int -> MutArray a -> m (Maybe a)
96− [A] fromListN :: MonadIO m => Int -> [a] -> m (MutArray a)
97− [A] fromList :: MonadIO m => [a] -> m (MutArray a)
98−[C] Streamly.Data.MutArray
99− [A] unpin :: MutArray a -> IO (MutArray a)
100− [A] readRev :: forall m a. (MonadIO m, Unbox a) => MutArray a -> Stream m a
101− [A] read :: forall m a. (MonadIO m, Unbox a) => MutArray a -> Stream m a
102− [A] putIndexUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> a -> m ()
103− [D] pokeByteIndex :: Unbox a => Int -> MutByteArray -> a -> IO ()
104− [A] pokeAt :: (Unbox a, Generic a, PokeRep (Rep a)) => Int -> MutByteArray -> a -> IO ()
105− [A] pinnedNew :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
106− [A] pin :: MutArray a -> IO (MutArray a)
107− [D] peekByteIndex :: Unbox a => Int -> MutByteArray -> IO a
108− [A] peekAt :: (Unbox a, Generic a, PeekRep (Rep a)) => Int -> MutByteArray -> IO a
109− [D] newPinned :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
110− [A] modifyIndexUnsafe :: forall m a b. (MonadIO m, Unbox a) => Int -> MutArray a -> (a -> (a, b)) -> m b
111− [A] modifyIndex :: forall m a b. (MonadIO m, Unbox a) => Int -> MutArray a -> (a -> (a, b)) -> m b
112− [A] modify :: forall m a. (MonadIO m, Unbox a) => MutArray a -> (a -> a) -> m ()
113− [A] isPinned :: MutArray a -> Bool
114− [A] getIndexUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m a
115− [C] getIndex
116− [O] getIndex :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m a
117− [N] getIndex :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (Maybe a)
118−[C] Streamly.Data.Array.Generic
119− [A] toList :: Array a -> [a]
120− [A] getIndex :: Int -> Array a -> Maybe a
121−[C] Streamly.Data.Array
122− [A] unpin :: Array a -> IO (Array a)
123− [D] pokeByteIndex :: Unbox a => Int -> MutByteArray -> a -> IO ()
124− [A] pokeAt :: (Unbox a, Generic a, PokeRep (Rep a)) => Int -> MutByteArray -> a -> IO ()
125− [A] pin :: Array a -> IO (Array a)
126− [D] peekByteIndex :: Unbox a => Int -> MutByteArray -> IO a
127− [A] peekAt :: (Unbox a, Generic a, PeekRep (Rep a)) => Int -> MutByteArray -> IO a
128− [A] isPinned :: Array a -> Bool
129−[C] Streamly.Console.Stdio
130−
131−---------------------------------
132−Internal API diff
133−---------------------------------
134−
135−[C] Streamly.Internal.Unicode.Stream
136− [C] writeCharUtf8'
137− [O] writeCharUtf8' :: Monad m => Fold m Word8 Char
138− [N] writeCharUtf8' :: Monad m => Parser Word8 m Char
139−[C] Streamly.Internal.Unicode.Parser
140− [A] number :: Monad m => Parser Char m (Integer, Int)
141− [A] mkDouble :: Integer -> Int -> Double
142− [A] doubleParser :: Monad m => Parser Char m (Int, Int)
143− [C] double
144− [O] double :: Parser Char m Double
145− [N] double :: Monad m => Parser Char m Double
146−[R] Streamly.Internal.Serialize.ToBytes
147−[R] Streamly.Internal.Serialize.FromBytes
148−[C] Streamly.Internal.FileSystem.File
149− [A] writeAppendWith :: (MonadIO m, MonadCatch m) => Int -> FilePath -> Stream m Word8 -> m ()
150− [A] writeAppendChunks :: (MonadIO m, MonadCatch m) => FilePath -> Stream m (Array a) -> m ()
151− [A] writeAppendArray :: FilePath -> Array a -> IO ()
152− [A] writeAppend :: (MonadIO m, MonadCatch m) => FilePath -> Stream m Word8 -> m ()
153− [R] appendWith :: (MonadIO m, MonadCatch m) => Int -> FilePath -> Stream m Word8 -> m ()
154− [R] appendChunks :: (MonadIO m, MonadCatch m) => FilePath -> Stream m (Array a) -> m ()
155− [R] appendArray :: FilePath -> Array a -> IO ()
156− [R] append :: (MonadIO m, MonadCatch m) => FilePath -> Stream m Word8 -> m ()
157−[C] Streamly.Internal.FileSystem.Dir
158− [C] reader
159− [O] reader :: MonadIO m => Unfold m FilePath FilePath
160− [N] reader :: (MonadIO m, MonadCatch m) => Unfold m FilePath FilePath
161− [C] readFiles
162− [O] readFiles :: MonadIO m => FilePath -> Stream m FilePath
163− [N] readFiles :: (MonadIO m, MonadCatch m) => FilePath -> Stream m FilePath
164− [C] readEitherPaths
165− [O] readEitherPaths :: MonadIO m => FilePath -> Stream m (Either FilePath FilePath)
166− [N] readEitherPaths :: (MonadIO m, MonadCatch m) => FilePath -> Stream m (Either FilePath FilePath)
167− [C] readEither
168− [O] readEither :: MonadIO m => FilePath -> Stream m (Either FilePath FilePath)
169− [N] readEither :: (MonadIO m, MonadCatch m) => FilePath -> Stream m (Either FilePath FilePath)
170− [C] readDirs
171− [O] readDirs :: MonadIO m => FilePath -> Stream m FilePath
172− [N] readDirs :: (MonadIO m, MonadCatch m) => FilePath -> Stream m FilePath
173− [C] read
174− [O] read :: MonadIO m => FilePath -> Stream m FilePath
175− [N] read :: (MonadIO m, MonadCatch m) => FilePath -> Stream m FilePath
176− [C] fileReader
177− [O] fileReader :: MonadIO m => Unfold m FilePath FilePath
178− [N] fileReader :: (MonadIO m, MonadCatch m) => Unfold m FilePath FilePath
179− [C] eitherReaderPaths
180− [O] eitherReaderPaths :: MonadIO m => Unfold m FilePath (Either FilePath FilePath)
181− [N] eitherReaderPaths :: (MonadIO m, MonadCatch m) => Unfold m FilePath (Either FilePath FilePath)
182− [C] eitherReader
183− [O] eitherReader :: MonadIO m => Unfold m FilePath (Either FilePath FilePath)
184− [N] eitherReader :: (MonadIO m, MonadCatch m) => Unfold m FilePath (Either FilePath FilePath)
185− [C] dirReader
186− [O] dirReader :: MonadIO m => Unfold m FilePath FilePath
187− [N] dirReader :: (MonadIO m, MonadCatch m) => Unfold m FilePath FilePath
188−[R] Streamly.Internal.Data.Unfold.Type
189−[R] Streamly.Internal.Data.Unfold.Enumeration
190−[C] Streamly.Internal.Data.Unfold
191− [C] Unfold
192− [A] Unfold :: (s -> m (Step s b)) -> (a -> m s) -> Unfold m a b
193− [A] takeWhileMWithInput :: Monad m => (a -> b -> m Bool) -> Unfold m a b -> Unfold m a b
194− [A] manyInterleave :: Monad m => Unfold m a b -> Unfold m c a -> Unfold m c b
195− [A] enumerateFromStepIntegral :: (Monad m, Integral a) => Unfold m (a, a) a
196− [A] crossApplySnd :: Unfold m a b -> Unfold m a c -> Unfold m a c
197− [A] crossApplyFst :: Unfold m a b -> Unfold m a c -> Unfold m a b
198− [A] concatMap :: Monad m => (b -> Unfold m a c) -> Unfold m a b -> Unfold m a c
199−[R] Streamly.Internal.Data.Unboxed
200−[C] Streamly.Internal.Data.Time.Units
201− [R] Streamly.Internal.Data.Unboxed.Unbox
202− [A] Streamly.Internal.Data.Unbox.Unbox
203− [A] instance Streamly.Internal.Data.Unbox.Unbox Streamly.Internal.Data.Time.Units.NanoSecond64
204− [A] instance Streamly.Internal.Data.Unbox.Unbox Streamly.Internal.Data.Time.Units.MilliSecond64
205− [A] instance Streamly.Internal.Data.Unbox.Unbox Streamly.Internal.Data.Time.Units.MicroSecond64
206−[R] Streamly.Internal.Data.Time.Clock.Type
207−[A] Streamly.Internal.Data.StreamK
208− [A] CrossStreamK
209− [A] (FixityR,6)
210− [A] (FixityR,6)
211− [A] (FixityR,6)
212− [A] (FixityR,5)
213− [A] (FixityR,5)
214− [A] (FixityR,6)
215− [A] (FixityR,5)
216− [A] StreamK
217− [A] MkStream :: (forall r. State StreamK m a -> (a -> StreamK m a -> m r) -> (a -> m r) -> m r -> m r) -> StreamK m a
218− [A] zipWithM :: Monad m => (a -> b -> m c) -> StreamK m a -> StreamK m b -> StreamK m c
219− [A] zipWith :: Monad m => (a -> b -> c) -> StreamK m a -> StreamK m b -> StreamK m c
220− [A] unfoldrMWith :: Monad m => (m a -> StreamK m a -> StreamK m a) -> (b -> m (Maybe (a, b))) -> b -> StreamK m a
221− [A] unfoldrM :: Monad m => (b -> m (Maybe (a, b))) -> b -> StreamK m a
222− [A] unfoldr :: (b -> Maybe (a, b)) -> b -> StreamK m a
223− [A] uncons :: Applicative m => StreamK m a -> m (Maybe (a, StreamK m a))
224− [A] unShare :: StreamK m a -> StreamK m a
225− [A] unCross :: CrossStreamK m a -> StreamK m a
226− [A] toStream :: Applicative m => StreamK m a -> Stream m a
227− [A] toList :: Monad m => StreamK m a -> m [a]
228− [A] the :: (Eq a, Monad m) => StreamK m a -> m (Maybe a)
229− [A] takeWhile :: (a -> Bool) -> StreamK m a -> StreamK m a
230− [A] take :: Int -> StreamK m a -> StreamK m a
231− [A] tail :: Applicative m => StreamK m a -> m (Maybe (StreamK m a))
232− [A] sortBy :: Monad m => (a -> a -> Ordering) -> StreamK m a -> StreamK m a
233− [A] sequence :: Monad m => StreamK m (m a) -> StreamK m a
234− [A] scanlx' :: (x -> a -> x) -> x -> (x -> b) -> StreamK m a -> StreamK m b
235− [A] scanl' :: (b -> a -> b) -> b -> StreamK m a -> StreamK m b
236− [A] reverse :: StreamK m a -> StreamK m a
237− [A] replicateMWith :: (m a -> StreamK m a -> StreamK m a) -> Int -> m a -> StreamK m a
238− [A] replicateM :: Monad m => Int -> m a -> StreamK m a
239− [A] replicate :: Int -> a -> StreamK m a
240− [A] repeatMWith :: (m a -> t m a -> t m a) -> m a -> t m a
241− [A] repeatM :: Monad m => m a -> StreamK m a
242− [A] repeat :: a -> StreamK m a
243− [A] parseDBreak :: Monad m => Parser a m b -> StreamK m a -> m (Either ParseError b, StreamK m a)
244− [A] parseD :: Monad m => Parser a m b -> StreamK m a -> m (Either ParseError b)
245− [A] parseChunksGeneric :: Monad m => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b)
246− [A] parseChunks :: (Monad m, Unbox a) => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b)
247− [A] parseBreakChunksGeneric :: forall m a b. Monad m => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
248− [A] parseBreakChunks :: (Monad m, Unbox a) => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
249− [A] parseBreak :: forall m a b. Monad m => ParserK a m b -> StreamK m a -> m (Either ParseError b, StreamK m a)
250− [A] parse :: Monad m => ParserK a m b -> StreamK m a -> m (Either ParseError b)
251− [A] null :: Monad m => StreamK m a -> m Bool
252− [A] notElem :: (Monad m, Eq a) => a -> StreamK m a -> m Bool
253− [A] nilM :: Applicative m => m b -> StreamK m a
254− [A] nil :: StreamK m a
255− [A] mkStream :: (forall r. State StreamK m a -> (a -> StreamK m a -> m r) -> (a -> m r) -> m r -> m r) -> StreamK m a
256− [A] mkCross :: StreamK m a -> CrossStreamK m a
257− [A] minimumBy :: Monad m => (a -> a -> Ordering) -> StreamK m a -> m (Maybe a)
258− [A] minimum :: (Monad m, Ord a) => StreamK m a -> m (Maybe a)
259− [A] mfix :: Monad m => (m a -> StreamK m a) -> StreamK m a
260− [A] mergeMapWith :: (StreamK m b -> StreamK m b -> StreamK m b) -> (a -> StreamK m b) -> StreamK m a -> StreamK m b
261− [A] mergeIterateWith :: (StreamK m a -> StreamK m a -> StreamK m a) -> (a -> StreamK m a) -> StreamK m a -> StreamK m a
262− [A] mergeByM :: Monad m => (a -> a -> m Ordering) -> StreamK m a -> StreamK m a -> StreamK m a
263− [A] mergeBy :: (a -> a -> Ordering) -> StreamK m a -> StreamK m a -> StreamK m a
264− [A] maximumBy :: Monad m => (a -> a -> Ordering) -> StreamK m a -> m (Maybe a)
265− [A] maximum :: (Monad m, Ord a) => StreamK m a -> m (Maybe a)
266− [A] mapMaybe :: (a -> Maybe b) -> StreamK m a -> StreamK m b
267− [A] mapM_ :: Monad m => (a -> m b) -> StreamK m a -> m ()
268− [A] mapMWith :: (m b -> StreamK m b -> StreamK m b) -> (a -> m b) -> StreamK m a -> StreamK m b
269− [A] mapMSerial :: Monad m => (a -> m b) -> StreamK m a -> StreamK m b
270− [A] mapM :: Monad m => (a -> m b) -> StreamK m a -> StreamK m b
271− [A] map :: (a -> b) -> StreamK m a -> StreamK m b
272− [A] lookup :: (Monad m, Eq a) => a -> StreamK m (a, b) -> m (Maybe b)
273− [A] liftInner :: (Monad m, MonadTrans t, Monad (t m)) => StreamK m a -> StreamK (t m) a
274− [A] last :: Monad m => StreamK m a -> m (Maybe a)
275− [A] iterateMWith :: Monad m => (m a -> StreamK m a -> StreamK m a) -> (a -> m a) -> m a -> StreamK m a
276− [A] iterateM :: Monad m => (a -> m a) -> m a -> StreamK m a
277− [A] iterate :: (a -> a) -> a -> StreamK m a
278− [A] intersperseM :: Monad m => m a -> StreamK m a -> StreamK m a
279− [A] intersperse :: Monad m => a -> StreamK m a -> StreamK m a
280− [A] interleaveMin :: StreamK m a -> StreamK m a -> StreamK m a
281− [A] interleaveFst :: StreamK m a -> StreamK m a -> StreamK m a
282− [A] interleave :: StreamK m a -> StreamK m a -> StreamK m a
283− [A] insertBy :: (a -> a -> Ordering) -> a -> StreamK m a -> StreamK m a
284− [A] init :: Applicative m => StreamK m a -> m (Maybe (StreamK m a))
285− [A] hoist :: (Monad m, Monad n) => (forall x. m x -> n x) -> StreamK m a -> StreamK n a
286− [A] head :: Monad m => StreamK m a -> m (Maybe a)
287− [A] handle :: (MonadCatch m, Exception e) => (e -> m (StreamK m a)) -> StreamK m a -> StreamK m a
288− [A] fromYieldK :: YieldK m a -> StreamK m a
289− [A] fromStream :: Monad m => Stream m a -> StreamK m a
290− [A] fromStopK :: StopK m -> StreamK m a
291− [A] fromPure :: a -> StreamK m a
292− [A] fromList :: [a] -> StreamK m a
293− [A] fromIndicesMWith :: (m a -> StreamK m a -> StreamK m a) -> (Int -> m a) -> StreamK m a
294− [A] fromIndicesM :: Monad m => (Int -> m a) -> StreamK m a
295− [A] fromIndices :: (Int -> a) -> StreamK m a
296− [A] fromFoldableM :: (Foldable f, Monad m) => f (m a) -> StreamK m a
297− [A] fromFoldable :: Foldable f => f a -> StreamK m a
298− [A] fromEffect :: Monad m => m a -> StreamK m a
299− [A] foldrT :: (Monad m, Monad (s m), MonadTrans s) => (a -> s m b -> s m b) -> s m b -> StreamK m a -> s m b
300− [A] foldrSShared :: (a -> StreamK m b -> StreamK m b) -> StreamK m b -> StreamK m a -> StreamK m b
301− [A] foldrSM :: Monad m => (m a -> StreamK m b -> StreamK m b) -> StreamK m b -> StreamK m a -> StreamK m b
302− [A] foldrS :: (a -> StreamK m b -> StreamK m b) -> StreamK m b -> StreamK m a -> StreamK m b
303− [A] foldrM :: (a -> m b -> m b) -> m b -> StreamK m a -> m b
304− [A] foldr1 :: Monad m => (a -> a -> a) -> StreamK m a -> m (Maybe a)
305− [A] foldr :: Monad m => (a -> b -> b) -> b -> StreamK m a -> m b
306− [A] foldlx' :: forall m a b x. Monad m => (x -> a -> x) -> x -> (x -> b) -> StreamK m a -> m b
307− [A] foldlT :: (Monad m, Monad (s m), MonadTrans s) => (s m b -> a -> s m b) -> s m b -> StreamK m a -> s m b
308− [A] foldlS :: (StreamK m b -> a -> StreamK m b) -> StreamK m b -> StreamK m a -> StreamK m b
309− [A] foldlMx' :: Monad m => (x -> a -> m x) -> m x -> (x -> m b) -> StreamK m a -> m b
310− [A] foldlM' :: Monad m => (b -> a -> m b) -> m b -> StreamK m a -> m b
311− [A] foldl' :: Monad m => (b -> a -> b) -> b -> StreamK m a -> m b
312− [A] foldStreamShared :: State StreamK m a -> (a -> StreamK m a -> m r) -> (a -> m r) -> m r -> StreamK m a -> m r
313− [A] foldStream :: State StreamK m a -> (a -> StreamK m a -> m r) -> (a -> m r) -> m r -> StreamK m a -> m r
314− [A] foldEither :: Monad m => Fold m a b -> StreamK m a -> m (Either (Fold m a b) (b, StreamK m a))
315− [A] foldConcat :: Monad m => Producer m a b -> Fold m b c -> StreamK m a -> m (c, StreamK m a)
316− [A] foldBreak :: Monad m => Fold m a b -> StreamK m a -> m (b, StreamK m a)
317− [A] fold :: Monad m => Fold m a b -> StreamK m a -> m b
318− [A] findM :: Monad m => (a -> m Bool) -> StreamK m a -> m (Maybe a)
319− [A] findIndices :: (a -> Bool) -> StreamK m a -> StreamK m Int
320− [A] find :: Monad m => (a -> Bool) -> StreamK m a -> m (Maybe a)
321− [A] filter :: (a -> Bool) -> StreamK m a -> StreamK m a
322− [A] evalStateT :: Monad m => m s -> StreamK (StateT s m) a -> StreamK m a
323− [A] elem :: (Monad m, Eq a) => a -> StreamK m a -> m Bool
324− [A] dropWhile :: (a -> Bool) -> StreamK m a -> StreamK m a
325− [A] drop :: Int -> StreamK m a -> StreamK m a
326− [A] drain :: Monad m => StreamK m a -> m ()
327− [A] deleteBy :: (a -> a -> Bool) -> a -> StreamK m a -> StreamK m a
328− [A] crossWith :: Monad m => (a -> b -> c) -> StreamK m a -> StreamK m b -> StreamK m c
329− [A] crossApplyWith :: (StreamK m b -> StreamK m b -> StreamK m b) -> StreamK m (a -> b) -> StreamK m a -> StreamK m b
330− [A] crossApplySnd :: StreamK m a -> StreamK m b -> StreamK m b
331− [A] crossApplyFst :: StreamK m a -> StreamK m b -> StreamK m a
332− [A] crossApply :: StreamK m (a -> b) -> StreamK m a -> StreamK m b
333− [A] cross :: Monad m => StreamK m a -> StreamK m b -> StreamK m (a, b)
334− [A] consMBy :: Monad m => (StreamK m a -> StreamK m a -> StreamK m a) -> m a -> StreamK m a -> StreamK m a
335− [A] consM :: Monad m => m a -> StreamK m a -> StreamK m a
336− [A] consK :: YieldK m a -> StreamK m a -> StreamK m a
337− [A] cons :: a -> StreamK m a -> StreamK m a
338− [A] conjoin :: Monad m => StreamK m a -> StreamK m a -> StreamK m a
339− [A] concatMapWith :: (StreamK m b -> StreamK m b -> StreamK m b) -> (a -> StreamK m b) -> StreamK m a -> StreamK m b
340− [A] concatMapEffect :: Monad m => (b -> StreamK m a) -> m b -> StreamK m a
341− [A] concatMap :: (a -> StreamK m b) -> StreamK m a -> StreamK m b
342− [A] concatIterateWith :: (StreamK m a -> StreamK m a -> StreamK m a) -> (a -> StreamK m a) -> StreamK m a -> StreamK m a
343− [A] concatIterateScanWith :: Monad m => (StreamK m a -> StreamK m a -> StreamK m a) -> (b -> a -> m (b, StreamK m a)) -> m b -> StreamK m a -> StreamK m a
344− [A] concatIterateLeftsWith :: b ~ Either a c => (StreamK m b -> StreamK m b -> StreamK m b) -> (a -> StreamK m b) -> StreamK m b -> StreamK m b
345− [A] concatEffect :: Monad m => m (StreamK m a) -> StreamK m a
346− [A] buildSM :: Monad m => ((m a -> StreamK m a -> StreamK m a) -> StreamK m a -> StreamK m a) -> StreamK m a
347− [A] buildS :: ((a -> StreamK m a -> StreamK m a) -> StreamK m a -> StreamK m a) -> StreamK m a
348− [A] buildM :: Monad m => (forall r. (a -> StreamK m a -> m r) -> (a -> m r) -> m r -> m r) -> StreamK m a
349− [A] build :: forall m a. (forall b. (a -> b -> b) -> b -> b) -> StreamK m a
350− [A] bracketIO :: (MonadIO m, MonadCatch m) => IO b -> (b -> IO c) -> (b -> StreamK m a) -> StreamK m a
351− [A] bindWith :: (StreamK m b -> StreamK m b -> StreamK m b) -> StreamK m a -> (a -> StreamK m b) -> StreamK m b
352− [A] before :: Monad m => m b -> StreamK m a -> StreamK m a
353− [A] augmentSM :: Monad m => ((m a -> StreamK m a -> StreamK m a) -> StreamK m a -> StreamK m a) -> StreamK m a -> StreamK m a
354− [A] augmentS :: ((a -> StreamK m a -> StreamK m a) -> StreamK m a -> StreamK m a) -> StreamK m a -> StreamK m a
355− [A] append :: StreamK m a -> StreamK m a -> StreamK m a
356− [A] any :: Monad m => (a -> Bool) -> StreamK m a -> m Bool
357− [A] all :: Monad m => (a -> Bool) -> StreamK m a -> m Bool
358− [A] (.:) :: a -> StreamK m a -> StreamK m a
359− [A] (!!) :: Monad m => StreamK m a -> Int -> m (Maybe a)
360−[R] Streamly.Internal.Data.Stream.StreamK.Type
361−[R] Streamly.Internal.Data.Stream.StreamK.Transformer
362−[R] Streamly.Internal.Data.Stream.StreamK
363−[R] Streamly.Internal.Data.Stream.StreamD.Type
364−[R] Streamly.Internal.Data.Stream.StreamD.Transformer
365−[R] Streamly.Internal.Data.Stream.StreamD.Transform
366−[R] Streamly.Internal.Data.Stream.StreamD.Top
367−[R] Streamly.Internal.Data.Stream.StreamD.Step
368−[R] Streamly.Internal.Data.Stream.StreamD.Nesting
369−[R] Streamly.Internal.Data.Stream.StreamD.Lift
370−[R] Streamly.Internal.Data.Stream.StreamD.Generate
371−[R] Streamly.Internal.Data.Stream.StreamD.Exception
372−[R] Streamly.Internal.Data.Stream.StreamD.Eliminate
373−[R] Streamly.Internal.Data.Stream.StreamD.Container
374−[D] Streamly.Internal.Data.Stream.StreamD
375−[R] Streamly.Internal.Data.Stream.Common
376−[R] Streamly.Internal.Data.Stream.Chunked
377−[C] Streamly.Internal.Data.Stream
378− [A] class Enum a => Enumerable a
379− [A] Stream
380− [A] UnStream :: (State StreamK m a -> s -> m (Step s a)) -> s -> Stream m a
381− [A] Step
382− [A] Yield :: a -> s -> Step s a
383− [A] Stop :: Step s a
384− [A] Skip :: s -> Step s a
385− [A] InterleaveState
386− [A] InterleaveSecondOnly :: s2 -> InterleaveState s1 s2
387− [A] InterleaveSecond :: s1 -> s2 -> InterleaveState s1 s2
388− [A] InterleaveFirstOnly :: s1 -> InterleaveState s1 s2
389− [A] InterleaveFirst :: s1 -> s2 -> InterleaveState s1 s2
390− [A] FoldManyPost
391− [A] FoldManyPostYield :: b -> FoldManyPost s fs b a -> FoldManyPost s fs b a
392− [A] FoldManyPostStart :: s -> FoldManyPost s fs b a
393− [A] FoldManyPostLoop :: s -> fs -> FoldManyPost s fs b a
394− [A] FoldManyPostDone :: FoldManyPost s fs b a
395− [A] FoldMany
396− [A] FoldManyYield :: b -> FoldMany s fs b a -> FoldMany s fs b a
397− [A] FoldManyStart :: s -> FoldMany s fs b a
398− [A] FoldManyLoop :: s -> fs -> FoldMany s fs b a
399− [A] FoldManyFirst :: fs -> s -> FoldMany s fs b a
400− [A] FoldManyDone :: FoldMany s fs b a
401− [A] CrossStream
402− [A] ConcatUnfoldInterleaveState
403− [A] ConcatUnfoldInterleaveOuter :: o -> [i] -> ConcatUnfoldInterleaveState o i
404− [A] ConcatUnfoldInterleaveInnerR :: [i] -> [i] -> ConcatUnfoldInterleaveState o i
405− [A] ConcatUnfoldInterleaveInnerL :: [i] -> [i] -> ConcatUnfoldInterleaveState o i
406− [A] ConcatUnfoldInterleaveInner :: o -> [i] -> ConcatUnfoldInterleaveState o i
407− [A] ConcatMapUState
408− [A] ConcatMapUOuter :: o -> ConcatMapUState o i
409− [A] ConcatMapUInner :: o -> i -> ConcatMapUState o i
410− [A] AppendState
411− [A] AppendSecond :: s2 -> AppendState s1 s2
412− [A] AppendFirst :: s1 -> AppendState s1 s2
413− [A] pattern Stream :: (State StreamK m a -> s -> m (Step s a)) -> s -> Stream m a
414− [A] zipWithM :: Monad m => (a -> b -> m c) -> Stream m a -> Stream m b -> Stream m c
415− [A] zipWith :: Monad m => (a -> b -> c) -> Stream m a -> Stream m b -> Stream m c
416− [A] wordsBy :: Monad m => (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
417− [A] with :: Monad m => (Stream m a -> Stream m (s, a)) -> (((s, a) -> b) -> Stream m (s, a) -> Stream m (s, a)) -> ((s, a) -> b) -> Stream m a -> Stream m a
418− [A] usingStateT :: Monad m => m s -> (Stream (StateT s m) a -> Stream (StateT s m) a) -> Stream m a -> Stream m a
419− [A] usingReaderT :: Monad m => m r -> (Stream (ReaderT r m) a -> Stream (ReaderT r m) a) -> Stream m a -> Stream m a
420− [A] uniqBy :: Monad m => (a -> a -> Bool) -> Stream m a -> Stream m a
421− [A] uniq :: (Eq a, Monad m) => Stream m a -> Stream m a
422− [A] unionWithStreamGenericBy :: MonadIO m => (a -> a -> Bool) -> Stream m a -> Stream m a -> Stream m a
423− [A] unionWithStreamAscBy :: (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a
424− [A] unfoldrM :: Monad m => (s -> m (Maybe (a, s))) -> s -> Stream m a
425− [A] unfoldr :: Monad m => (s -> Maybe (a, s)) -> s -> Stream m a
426− [A] unfoldRoundRobin :: Monad m => Unfold m a b -> Stream m a -> Stream m b
427− [A] unfoldMany :: Monad m => Unfold m a b -> Stream m a -> Stream m b
428− [A] unfoldIterateDfs :: Monad m => Unfold m a a -> Stream m a -> Stream m a
429− [A] unfoldIterateBfsRev :: Monad m => Unfold m a a -> Stream m a -> Stream m a
430− [A] unfoldIterateBfs :: Monad m => Unfold m a a -> Stream m a -> Stream m a
431− [A] unfoldInterleave :: Monad m => Unfold m a b -> Stream m a -> Stream m b
432− [A] unfold :: Applicative m => Unfold m a b -> a -> Stream m b
433− [A] uncons :: Monad m => Stream m a -> m (Maybe (a, Stream m a))
434− [A] unCross :: CrossStream m a -> Stream m a
435− [A] transform :: Monad m => Pipe m a b -> Stream m a -> Stream m b
436− [A] trace_ :: Monad m => m b -> Stream m a -> Stream m a
437− [A] trace :: Monad m => (a -> m b) -> Stream m a -> Stream m a
438− [A] toStreamK :: Monad m => Stream m a -> StreamK m a
439− [A] toListRev :: Monad m => Stream m a -> m [a]
440− [A] toList :: Monad m => Stream m a -> m [a]
441− [A] timestamped :: MonadIO m => Stream m a -> Stream m (AbsTime, a)
442− [A] timestampWith :: MonadIO m => Double -> Stream m a -> Stream m (AbsTime, a)
443− [A] timesWith :: MonadIO m => Double -> Stream m (AbsTime, RelTime64)
444− [A] times :: MonadIO m => Stream m (AbsTime, RelTime64)
445− [A] timeout :: AbsTime -> t m ()
446− [A] timeIndexed :: MonadIO m => Stream m a -> Stream m (RelTime64, a)
447− [A] timeIndexWith :: MonadIO m => Double -> Stream m a -> Stream m (RelTime64, a)
448− [A] the :: (Eq a, Monad m) => Stream m a -> m (Maybe a)
449− [A] tapOffsetEvery :: Monad m => Int -> Int -> Fold m a b -> Stream m a -> Stream m a
450− [A] tap :: Monad m => Fold m a b -> Stream m a -> Stream m a
451− [A] takeWhileM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
452− [A] takeWhileLast :: (a -> Bool) -> Stream m a -> Stream m a
453− [A] takeWhileAround :: (a -> Bool) -> Stream m a -> Stream m a
454− [A] takeWhile :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
455− [A] takeEndByM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
456− [A] takeEndBy :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
457− [A] take :: Applicative m => Int -> Stream m a -> Stream m a
458− [A] tail :: Monad m => Stream m a -> m (Maybe (Stream m a))
459− [A] stripSuffixUnbox :: (MonadIO m, Eq a, Unbox a) => Stream m a -> Stream m a -> m (Maybe (Stream m a))
460− [A] stripSuffix :: (Monad m, Eq a) => Stream m a -> Stream m a -> m (Maybe (Stream m a))
461− [A] stripPrefix :: (Monad m, Eq a) => Stream m a -> Stream m a -> m (Maybe (Stream m a))
462− [A] strideFromThen :: Monad m => Int -> Int -> Stream m a -> Stream m a
463− [A] splitOnSuffixSeqAny :: [Array a] -> Fold m a b -> Stream m a -> Stream m b
464− [A] splitOnSuffixSeq :: forall m a b. (MonadIO m, Storable a, Unbox a, Enum a, Eq a) => Bool -> Array a -> Fold m a b -> Stream m a -> Stream m b
465− [A] splitOnSeq :: forall m a b. (MonadIO m, Storable a, Unbox a, Enum a, Eq a) => Array a -> Fold m a b -> Stream m a -> Stream m b
466− [A] splitOnPrefix :: (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
467− [A] splitOnAny :: [Array a] -> Fold m a b -> Stream m a -> Stream m b
468− [A] splitOn :: Monad m => (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
469− [A] splitInnerBySuffix :: (Monad m, Eq (f a), Monoid (f a)) => (f a -> m (f a, Maybe (f a))) -> (f a -> f a -> m (f a)) -> Stream m (f a) -> Stream m (f a)
470− [A] splitInnerBy :: Monad m => (f a -> m (f a, Maybe (f a))) -> (f a -> f a -> m (f a)) -> Stream m (f a) -> Stream m (f a)
471− [A] slicesBy :: Monad m => (a -> Bool) -> Stream m a -> Stream m (Int, Int)
472− [A] sliceOnSuffix :: Monad m => (a -> Bool) -> Stream m a -> Stream m (Int, Int)
473− [A] sequence :: Monad m => Stream m (m a) -> Stream m a
474− [A] scanlx' :: Monad m => (x -> a -> x) -> x -> (x -> b) -> Stream m a -> Stream m b
475− [A] scanlMx' :: Monad m => (x -> a -> m x) -> m x -> (x -> m b) -> Stream m a -> Stream m b
476− [A] scanlMAfter' :: Monad m => (b -> a -> m b) -> m b -> (b -> m b) -> Stream m a -> Stream m b
477− [A] scanlM' :: Monad m => (b -> a -> m b) -> m b -> Stream m a -> Stream m b
478− [A] scanlM :: Monad m => (b -> a -> m b) -> m b -> Stream m a -> Stream m b
479− [A] scanl1M' :: Monad m => (a -> a -> m a) -> Stream m a -> Stream m a
480− [A] scanl1M :: Monad m => (a -> a -> m a) -> Stream m a -> Stream m a
481− [A] scanl1' :: Monad m => (a -> a -> a) -> Stream m a -> Stream m a
482− [A] scanl1 :: Monad m => (a -> a -> a) -> Stream m a -> Stream m a
483− [A] scanl' :: Monad m => (b -> a -> b) -> b -> Stream m a -> Stream m b
484− [A] scanl :: Monad m => (b -> a -> b) -> b -> Stream m a -> Stream m b
485− [A] scanMaybe :: Monad m => Fold m a (Maybe b) -> Stream m a -> Stream m b
486− [A] scanMany :: Monad m => Fold m a b -> Stream m a -> Stream m b
487− [A] scan :: Monad m => Fold m a b -> Stream m a -> Stream m b
488− [A] runStateT :: Monad m => m s -> Stream (StateT s m) a -> Stream m (s, a)
489− [A] runReaderT :: Monad m => m s -> Stream (ReaderT s m) a -> Stream m a
490− [A] runInnerWithState :: Monad m => (forall b. s -> t m b -> m (b, s)) -> m s -> Stream (t m) a -> Stream m (s, a)
491− [A] runInnerWith :: Monad m => (forall b. t m b -> m b) -> Stream (t m) a -> Stream m a
492− [A] roundRobin :: Monad m => Stream m a -> Stream m a -> Stream m a
493− [A] rollingMapM :: Monad m => (Maybe a -> a -> m b) -> Stream m a -> Stream m b
494− [A] rollingMap2 :: Monad m => (a -> a -> b) -> Stream m a -> Stream m b
495− [A] rollingMap :: Monad m => (Maybe a -> a -> b) -> Stream m a -> Stream m b
496− [A] reverseUnbox :: (MonadIO m, Unbox a) => Stream m a -> Stream m a
497− [A] reverse :: Monad m => Stream m a -> Stream m a
498− [A] replicateM :: Monad m => Int -> m a -> Stream m a
499− [A] replicate :: Monad m => Int -> a -> Stream m a
500− [A] repeated :: Stream m a -> Stream m a
501− [A] repeatM :: Monad m => m a -> Stream m a
502− [A] repeat :: Monad m => a -> Stream m a
503− [A] relTimesWith :: MonadIO m => Double -> Stream m RelTime64
504− [A] relTimes :: MonadIO m => Stream m RelTime64
505− [A] refoldMany :: Monad m => Refold m x a b -> m x -> Stream m a -> Stream m b
506− [A] refoldIterateM :: Monad m => Refold m b a b -> m b -> Stream m a -> Stream m b
507− [A] reduceIterateBfs :: Monad m => (a -> a -> m a) -> Stream m a -> m (Maybe a)
508− [A] reassembleBy :: Fold m a b -> (a -> a -> Int) -> Stream m a -> Stream m b
509− [A] prune :: (a -> Bool) -> Stream m a -> Stream m a
510− [A] prescanlM' :: Monad m => (b -> a -> m b) -> m b -> Stream m a -> Stream m b
511− [A] prescanl' :: Monad m => (b -> a -> b) -> b -> Stream m a -> Stream m b
512− [A] postscanlx' :: Monad m => (x -> a -> x) -> x -> (x -> b) -> Stream m a -> Stream m b
513− [A] postscanlMx' :: Monad m => (x -> a -> m x) -> m x -> (x -> m b) -> Stream m a -> Stream m b
514− [A] postscanlMAfter' :: Monad m => (b -> a -> m b) -> m b -> (b -> m b) -> Stream m a -> Stream m b
515− [A] postscanlM' :: Monad m => (b -> a -> m b) -> m b -> Stream m a -> Stream m b
516− [A] postscanlM :: Monad m => (b -> a -> m b) -> m b -> Stream m a -> Stream m b
517− [A] postscanl' :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a
518− [A] postscanl :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a
519− [A] postscan :: Monad m => Fold m a b -> Stream m a -> Stream m b
520− [A] parseSequence :: Stream m (Parser a m b) -> Stream m a -> Stream m b
521− [A] parseManyTill :: Parser a m b -> Parser a m x -> Stream m a -> Stream m b
522− [A] parseManyD :: Monad m => Parser a m b -> Stream m a -> Stream m (Either ParseError b)
523− [A] parseMany :: Monad m => Parser a m b -> Stream m a -> Stream m (Either ParseError b)
524− [A] parseIterateD :: Monad m => (b -> Parser a m b) -> b -> Stream m a -> Stream m (Either ParseError b)
525− [A] parseIterate :: Monad m => (b -> Parser a m b) -> b -> Stream m a -> Stream m (Either ParseError b)
526− [A] parseD :: Monad m => Parser a m b -> Stream m a -> m (Either ParseError b)
527− [A] parseBreakD :: Monad m => Parser a m b -> Stream m a -> m (Either ParseError b, Stream m a)
528− [A] parseBreak :: Monad m => Parser a m b -> Stream m a -> m (Either ParseError b, Stream m a)
529− [A] parse :: Monad m => Parser a m b -> Stream m a -> m (Either ParseError b)
530− [A] onException :: MonadCatch m => m b -> Stream m a -> Stream m a
531− [A] null :: Monad m => Stream m a -> m Bool
532− [A] nub :: (Monad m, Ord a) => Stream m a -> Stream m a
533− [A] notElem :: (Monad m, Eq a) => a -> Stream m a -> m Bool
534− [A] nilM :: Applicative m => m b -> Stream m a
535− [A] nil :: Applicative m => Stream m a
536− [A] morphInner :: Monad n => (forall x. m x -> n x) -> Stream m a -> Stream n a
537− [A] mkCross :: Stream m a -> CrossStream m a
538− [A] minimumBy :: Monad m => (a -> a -> Ordering) -> Stream m a -> m (Maybe a)
539− [A] minimum :: (Monad m, Ord a) => Stream m a -> m (Maybe a)
540− [A] mergeMinBy :: (a -> a -> m Ordering) -> Stream m a -> Stream m a -> Stream m a
541− [A] mergeFstBy :: (a -> a -> m Ordering) -> Stream m a -> Stream m a -> Stream m a
542− [A] mergeByM :: Monad m => (a -> a -> m Ordering) -> Stream m a -> Stream m a -> Stream m a
543− [A] mergeBy :: Monad m => (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a
544− [A] maximumBy :: Monad m => (a -> a -> Ordering) -> Stream m a -> m (Maybe a)
545− [A] maximum :: (Monad m, Ord a) => Stream m a -> m (Maybe a)
546− [A] mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Stream m a -> Stream m b
547− [A] mapMaybe :: Monad m => (a -> Maybe b) -> Stream m a -> Stream m b
548− [A] mapM_ :: Monad m => (a -> m b) -> Stream m a -> m ()
549− [A] mapM :: Monad m => (a -> m b) -> Stream m a -> Stream m b
550− [A] map :: Monad m => (a -> b) -> Stream m a -> Stream m b
551− [A] lookup :: (Monad m, Eq a) => a -> Stream m (a, b) -> m (Maybe b)
552− [A] liftInnerWith :: Monad (t m) => (forall b. m b -> t m b) -> Stream m a -> Stream (t m) a
553− [A] liftInner :: (Monad m, MonadTrans t, Monad (t m)) => Stream m a -> Stream (t m) a
554− [A] last :: Monad m => Stream m a -> m (Maybe a)
555− [A] joinOuterGeneric :: MonadIO m => (a -> b -> Bool) -> Stream m a -> Stream m b -> Stream m (Maybe a, Maybe b)
556− [A] joinOuterAscBy :: (a -> b -> Ordering) -> Stream m a -> Stream m b -> Stream m (Maybe a, Maybe b)
557− [A] joinOuter :: (Ord k, MonadIO m) => Stream m (k, a) -> Stream m (k, b) -> Stream m (k, Maybe a, Maybe b)
558− [A] joinLeftGeneric :: Monad m => (a -> b -> Bool) -> Stream m a -> Stream m b -> Stream m (a, Maybe b)
559− [A] joinLeftAscBy :: (a -> b -> Ordering) -> Stream m a -> Stream m b -> Stream m (a, Maybe b)
560− [A] joinLeft :: (Ord k, Monad m) => Stream m (k, a) -> Stream m (k, b) -> Stream m (k, a, Maybe b)
561− [A] joinInnerGeneric :: Monad m => (a -> b -> Bool) -> Stream m a -> Stream m b -> Stream m (a, b)
562− [A] joinInnerAscBy :: (a -> b -> Ordering) -> Stream m a -> Stream m b -> Stream m (a, b)
563− [A] joinInner :: (Monad m, Ord k) => Stream m (k, a) -> Stream m (k, b) -> Stream m (k, a, b)
564− [A] iterateM :: Monad m => (a -> m a) -> m a -> Stream m a
565− [A] iterate :: Monad m => (a -> a) -> a -> Stream m a
566− [A] isSuffixOfUnbox :: (MonadIO m, Eq a, Unbox a) => Stream m a -> Stream m a -> m Bool
567− [A] isSuffixOf :: (Monad m, Eq a) => Stream m a -> Stream m a -> m Bool
568− [A] isSubsequenceOf :: (Monad m, Eq a) => Stream m a -> Stream m a -> m Bool
569− [A] isPrefixOf :: (Monad m, Eq a) => Stream m a -> Stream m a -> m Bool
570− [A] isInfixOf :: (MonadIO m, Eq a, Enum a, Storable a, Unbox a) => Stream m a -> Stream m a -> m Bool
571− [A] intersperseM_ :: Monad m => m b -> Stream m a -> Stream m a
572− [A] intersperseMWith :: Int -> m a -> Stream m a -> Stream m a
573− [A] intersperseMSuffix_ :: Monad m => m b -> Stream m a -> Stream m a
574− [A] intersperseMSuffixWith :: forall m a. Monad m => Int -> m a -> Stream m a -> Stream m a
575− [A] intersperseMSuffix :: forall m a. Monad m => m a -> Stream m a -> Stream m a
576− [A] intersperseMPrefix_ :: Monad m => m b -> Stream m a -> Stream m a
577− [A] intersperseM :: Monad m => m a -> Stream m a -> Stream m a
578− [A] intersperse :: Monad m => a -> Stream m a -> Stream m a
579− [A] intersectBySorted :: Monad m => (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a
580− [A] interposeSuffixM :: Monad m => m c -> Unfold m b c -> Stream m b -> Stream m c
581− [A] interposeSuffix :: Monad m => c -> Unfold m b c -> Stream m b -> Stream m c
582− [A] interposeM :: Monad m => m c -> Unfold m b c -> Stream m b -> Stream m c
583− [A] interpose :: Monad m => c -> Unfold m b c -> Stream m b -> Stream m c
584− [A] interleaveMin :: Monad m => Stream m a -> Stream m a -> Stream m a
585− [A] interleaveFstSuffix :: Monad m => Stream m a -> Stream m a -> Stream m a
586− [A] interleaveFst :: Monad m => Stream m a -> Stream m a -> Stream m a
587− [A] interleave :: Monad m => Stream m a -> Stream m a -> Stream m a
588− [A] intercalateSuffix :: Monad m => Unfold m b c -> b -> Stream m b -> Stream m c
589− [A] intercalate :: Monad m => Unfold m b c -> b -> Stream m b -> Stream m c
590− [A] insertBy :: Monad m => (a -> a -> Ordering) -> a -> Stream m a -> Stream m a
591− [A] indexedR :: Monad m => Int -> Stream m a -> Stream m (Int, a)
592− [A] indexed :: Monad m => Stream m a -> Stream m (Int, a)
593− [A] headElse :: Monad m => a -> Stream m a -> m a
594− [A] head :: Monad m => Stream m a -> m (Maybe a)
595− [A] handle :: (MonadCatch m, Exception e) => (e -> m (Stream m a)) -> Stream m a -> Stream m a
596− [A] groupsWhile :: Monad m => (a -> a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
597− [A] groupsRollingBy :: Monad m => (a -> a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
598− [A] groupsOf :: Monad m => Int -> Fold m a b -> Stream m a -> Stream m b
599− [A] gintercalateSuffix :: Monad m => Unfold m a c -> Stream m a -> Unfold m b c -> Stream m b -> Stream m c
600− [A] gintercalate :: Monad m => Unfold m a c -> Stream m a -> Unfold m b c -> Stream m b -> Stream m c
601− [A] ghandle :: (MonadCatch m, Exception e) => (e -> Stream m a -> m (Stream m a)) -> Stream m a -> Stream m a
602− [A] generateM :: Monad m => Int -> (Int -> m a) -> Stream m a
603− [A] generate :: Monad m => Int -> (Int -> a) -> Stream m a
604− [A] generalizeInner :: Monad m => Stream Identity a -> Stream m a
605− [A] gbracket_ :: Monad m => m c -> (c -> m d) -> (c -> e -> Stream m b -> m (Stream m b)) -> (forall s. m s -> m (Either e s)) -> (c -> Stream m b) -> Stream m b
606− [A] gbracket :: MonadIO m => IO c -> (c -> IO d1) -> (c -> e -> Stream m b -> IO (Stream m b)) -> (c -> IO d2) -> (forall s. m s -> m (Either e s)) -> (c -> Stream m b) -> Stream m b
607− [A] fromStreamK :: Applicative m => StreamK m a -> Stream m a
608− [A] fromPure :: Applicative m => a -> Stream m a
609− [A] fromPtrN :: (Monad m, Storable a) => Int -> Ptr a -> Stream m a
610− [A] fromPtr :: forall m a. (Monad m, Storable a) => Ptr a -> Stream m a
611− [A] fromListM :: Monad m => [m a] -> Stream m a
612− [A] fromList :: Applicative m => [a] -> Stream m a
613− [A] fromIndicesM :: Monad m => (Int -> m a) -> Stream m a
614− [A] fromIndices :: Monad m => (Int -> a) -> Stream m a
615− [A] fromFoldableM :: (Monad m, Foldable f) => f (m a) -> Stream m a
616− [A] fromFoldable :: (Monad m, Foldable f) => f a -> Stream m a
617− [A] fromEffect :: Applicative m => m a -> Stream m a
618− [A] fromByteStr# :: Monad m => Addr# -> Stream m Word8
619− [A] foldrT :: (Monad m, Monad (t m), MonadTrans t) => (a -> t m b -> t m b) -> t m b -> Stream m a -> t m b
620− [A] foldrS :: Monad m => (a -> Stream m b -> Stream m b) -> Stream m b -> Stream m a -> Stream m b
621− [A] foldrMx :: Monad m => (a -> m x -> m x) -> m x -> (m x -> m b) -> Stream m a -> m b
622− [A] foldrM :: Monad m => (a -> m b -> m b) -> m b -> Stream m a -> m b
623− [A] foldr1 :: Monad m => (a -> a -> a) -> Stream m a -> m (Maybe a)
624− [A] foldr :: Monad m => (a -> b -> b) -> b -> Stream m a -> m b
625− [A] foldlx' :: Monad m => (x -> a -> x) -> x -> (x -> b) -> Stream m a -> m b
626− [A] foldlT :: (Monad m, Monad (s m), MonadTrans s) => (s m b -> a -> s m b) -> s m b -> Stream m a -> s m b
627− [A] foldlS :: Monad m => (Stream m b -> a -> Stream m b) -> Stream m b -> Stream m a -> Stream m b
628− [A] foldlMx' :: Monad m => (x -> a -> m x) -> m x -> (x -> m b) -> Stream m a -> m b
629− [A] foldlM' :: Monad m => (b -> a -> m b) -> m b -> Stream m a -> m b
630− [A] foldl' :: Monad m => (b -> a -> b) -> b -> Stream m a -> m b
631− [A] foldSequence :: Stream m (Fold m a b) -> Stream m a -> Stream m b
632− [A] foldManyPost :: Monad m => Fold m a b -> Stream m a -> Stream m b
633− [A] foldMany :: Monad m => Fold m a b -> Stream m a -> Stream m b
634− [A] foldIterateM :: Monad m => (b -> m (Fold m a b)) -> m b -> Stream m a -> Stream m b
635− [A] foldIterateBfs :: Fold m a (Either a a) -> Stream m a -> m (Maybe a)
636− [A] foldEither :: Monad m => Fold m a b -> Stream m a -> m (Either (Fold m a b) (b, Stream m a))
637− [A] foldBreak :: Monad m => Fold m a b -> Stream m a -> m (b, Stream m a)
638− [A] foldAddLazy :: Monad m => Fold m a b -> Stream m a -> Fold m a b
639− [A] foldAdd :: Monad m => Fold m a b -> Stream m a -> m (Fold m a b)
640− [A] fold :: Monad m => Fold m a b -> Stream m a -> m b
641− [A] findM :: Monad m => (a -> m Bool) -> Stream m a -> m (Maybe a)
642− [A] findIndices :: Monad m => (a -> Bool) -> Stream m a -> Stream m Int
643− [A] find :: Monad m => (a -> Bool) -> Stream m a -> m (Maybe a)
644− [A] finallyUnsafe :: MonadCatch m => m b -> Stream m a -> Stream m a
645− [A] finallyIO :: (MonadIO m, MonadCatch m) => IO b -> Stream m a -> Stream m a
646− [A] filterM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
647− [A] filterInStreamGenericBy :: Monad m => (a -> a -> Bool) -> Stream m a -> Stream m a -> Stream m a
648− [A] filterInStreamAscBy :: Monad m => (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a
649− [A] filter :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
650− [A] evalStateT :: Monad m => m s -> Stream (StateT s m) a -> Stream m a
651− [A] eqBy :: Monad m => (a -> b -> Bool) -> Stream m a -> Stream m b -> m Bool
652− [A] enumerateTo :: (Monad m, Bounded a, Enumerable a) => a -> Stream m a
653− [A] enumerateFromToSmall :: (Monad m, Enum a) => a -> a -> Stream m a
654− [A] enumerateFromToIntegral :: (Monad m, Integral a) => a -> a -> Stream m a
655− [A] enumerateFromToFractional :: (Monad m, Fractional a, Ord a) => a -> a -> Stream m a
656− [A] enumerateFromTo :: (Enumerable a, Monad m) => a -> a -> Stream m a
657− [A] enumerateFromThenToSmall :: (Monad m, Enum a) => a -> a -> a -> Stream m a
658− [A] enumerateFromThenToIntegral :: (Monad m, Integral a) => a -> a -> a -> Stream m a
659− [A] enumerateFromThenToFractional :: (Monad m, Fractional a, Ord a) => a -> a -> a -> Stream m a
660− [A] enumerateFromThenTo :: (Enumerable a, Monad m) => a -> a -> a -> Stream m a
661− [A] enumerateFromThenSmallBounded :: (Monad m, Enumerable a, Bounded a) => a -> a -> Stream m a
662− [A] enumerateFromThenNum :: (Monad m, Num a) => a -> a -> Stream m a
663− [A] enumerateFromThenIntegral :: (Monad m, Integral a, Bounded a) => a -> a -> Stream m a
664− [A] enumerateFromThenFractional :: (Monad m, Fractional a) => a -> a -> Stream m a
665− [A] enumerateFromThen :: (Enumerable a, Monad m) => a -> a -> Stream m a
666− [A] enumerateFromStepNum :: (Monad m, Num a) => a -> a -> Stream m a
667− [A] enumerateFromStepIntegral :: (Integral a, Monad m) => a -> a -> Stream m a
668− [A] enumerateFromNum :: (Monad m, Num a) => a -> Stream m a
669− [A] enumerateFromIntegral :: (Monad m, Integral a, Bounded a) => a -> Stream m a
670− [A] enumerateFromFractional :: (Monad m, Fractional a) => a -> Stream m a
671− [A] enumerateFromBounded :: (Monad m, Enumerable a, Bounded a) => a -> Stream m a
672− [A] enumerateFrom :: (Enumerable a, Monad m) => a -> Stream m a
673− [A] enumerate :: (Monad m, Bounded a, Enumerable a) => Stream m a
674− [A] elemIndices :: (Monad m, Eq a) => a -> Stream m a -> Stream m Int
675− [A] elem :: (Monad m, Eq a) => a -> Stream m a -> m Bool
676− [A] durations :: Double -> t m RelTime64
677− [A] dropWhileM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
678− [A] dropWhileLast :: (a -> Bool) -> Stream m a -> Stream m a
679− [A] dropWhileAround :: (a -> Bool) -> Stream m a -> Stream m a
680− [A] dropWhile :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
681− [A] dropSuffix :: Stream m a -> Stream m a -> Stream m a
682− [A] dropPrefix :: Stream m a -> Stream m a -> Stream m a
683− [A] dropLast :: Int -> Stream m a -> Stream m a
684− [A] dropInfix :: Stream m a -> Stream m a -> Stream m a
685− [A] drop :: Monad m => Int -> Stream m a -> Stream m a
686− [A] drain :: Monad m => Stream m a -> m ()
687− [A] deleteInStreamGenericBy :: Monad m => (a -> a -> Bool) -> Stream m a -> Stream m a -> Stream m a
688− [A] deleteInStreamAscBy :: (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a
689− [A] deleteBy :: Monad m => (a -> a -> Bool) -> a -> Stream m a -> Stream m a
690− [A] delayPre :: MonadIO m => Double -> Stream m a -> Stream m a
691− [A] delayPost :: MonadIO m => Double -> Stream m a -> Stream m a
692− [A] delay :: MonadIO m => Double -> Stream m a -> Stream m a
693− [A] crossWith :: Monad m => (a -> b -> c) -> Stream m a -> Stream m b -> Stream m c
694− [A] crossApplySnd :: Functor f => Stream f a -> Stream f b -> Stream f b
695− [A] crossApplyFst :: Functor f => Stream f a -> Stream f b -> Stream f a
696− [A] crossApply :: Functor f => Stream f (a -> b) -> Stream f a -> Stream f b
697− [A] cross :: Monad m => Stream m a -> Stream m b -> Stream m (a, b)
698− [A] consM :: Applicative m => m a -> Stream m a -> Stream m a
699− [A] cons :: Applicative m => a -> Stream m a -> Stream m a
700− [A] concatMapM :: Monad m => (a -> m (Stream m b)) -> Stream m a -> Stream m b
701− [A] concatMap :: Monad m => (a -> Stream m b) -> Stream m a -> Stream m b
702− [A] concatIterateScan :: Monad m => (b -> a -> m b) -> (b -> m (Maybe (b, Stream m a))) -> b -> Stream m a
703− [A] concatIterateDfs :: Monad m => (a -> Maybe (Stream m a)) -> Stream m a -> Stream m a
704− [A] concatIterateBfsRev :: Monad m => (a -> Maybe (Stream m a)) -> Stream m a -> Stream m a
705− [A] concatIterateBfs :: Monad m => (a -> Maybe (Stream m a)) -> Stream m a -> Stream m a
706− [A] concatEffect :: Monad m => m (Stream m a) -> Stream m a
707− [A] concat :: Monad m => Stream m (Stream m a) -> Stream m a
708− [A] cmpBy :: Monad m => (a -> b -> Ordering) -> Stream m a -> Stream m b -> m Ordering
709− [A] catRights :: Monad m => Stream m (Either a b) -> Stream m b
710− [A] catMaybes :: Monad m => Stream m (Maybe a) -> Stream m a
711− [A] catLefts :: Monad m => Stream m (Either a b) -> Stream m a
712− [A] catEithers :: Monad m => Stream m (Either a a) -> Stream m a
713− [A] bracketUnsafe :: MonadCatch m => m b -> (b -> m c) -> (b -> Stream m a) -> Stream m a
714− [A] bracketIO3 :: (MonadIO m, MonadCatch m) => IO b -> (b -> IO c) -> (b -> IO d) -> (b -> IO e) -> (b -> Stream m a) -> Stream m a
715− [A] bracketIO :: (MonadIO m, MonadCatch m) => IO b -> (b -> IO c) -> (b -> Stream m a) -> Stream m a
716− [A] before :: Monad m => m b -> Stream m a -> Stream m a
717− [A] append :: Monad m => Stream m a -> Stream m a -> Stream m a
718− [A] any :: Monad m => (a -> Bool) -> Stream m a -> m Bool
719− [A] all :: Monad m => (a -> Bool) -> Stream m a -> m Bool
720− [A] afterUnsafe :: Monad m => m b -> Stream m a -> Stream m a
721− [A] afterIO :: MonadIO m => IO b -> Stream m a -> Stream m a
722− [A] absTimesWith :: MonadIO m => Double -> Stream m AbsTime
723− [A] absTimes :: MonadIO m => Stream m AbsTime
724− [A] (!!) :: Monad m => Stream m a -> Int -> m (Maybe a)
725−[R] Streamly.Internal.Data.Ring.Unboxed
726−[A] Streamly.Internal.Data.Ring.Generic
727− [A] Ring
728− [A] [ringMax] :: Ring a -> !Int
729− [A] [ringHead] :: Ring a -> !Int
730− [A] [ringArr] :: Ring a -> MutArray a
731− [A] Ring :: MutArray a -> !Int -> !Int -> Ring a
732− [A] writeLastN :: MonadIO m => Int -> Fold m a (Ring a)
733− [A] unsafeInsertRingWith :: Ring a -> a -> IO Int
734− [A] toStreamWith :: Int -> Ring a -> Stream m a
735− [A] toMutArray :: MonadIO m => Int -> Int -> Ring a -> m (MutArray a)
736− [A] seek :: MonadIO m => Int -> Ring a -> m (Ring a)
737− [A] createRing :: MonadIO m => Int -> m (Ring a)
738− [A] copyToMutArray :: MonadIO m => Int -> Int -> Ring a -> m (MutArray a)
739−[C] Streamly.Internal.Data.Ring
740− [C] Ring
741− [A] [ringStart] :: Ring a -> {-# UNPACK #-} !ForeignPtr a
742− [R] [ringMax] :: Ring a -> !Int
743− [R] [ringHead] :: Ring a -> !Int
744− [A] [ringBound] :: Ring a -> {-# UNPACK #-} !Ptr a
745− [R] [ringArr] :: Ring a -> MutArray a
746− [C] Ring
747− [O] Ring :: MutArray a -> !Int -> !Int -> Ring a
748− [N] Ring :: {-# UNPACK #-} !ForeignPtr a -> {-# UNPACK #-} !Ptr a -> Ring a
749− [A] GHC.Show.Show
750− [A] instance (GHC.Show.Show a, GHC.Show.Show b, GHC.Show.Show c, GHC.Show.Show d) => GHC.Show.Show (Streamly.Internal.Data.Ring.Tuple4' a b c d)
751− [A] writeN :: Int -> Fold m a (Ring a)
752− [R] writeLastN :: MonadIO m => Int -> Fold m a (Ring a)
753− [R] unsafeInsertRingWith :: Ring a -> a -> IO Int
754− [A] unsafeInsert :: Storable a => Ring a -> Ptr a -> a -> IO (Ptr a)
755− [A] unsafeFoldRingNM :: forall m a b. (MonadIO m, Storable a) => Int -> Ptr a -> (b -> a -> m b) -> b -> Ring a -> m b
756− [A] unsafeFoldRingM :: forall m a b. (MonadIO m, Storable a) => Ptr a -> (b -> a -> m b) -> b -> Ring a -> m b
757− [A] unsafeFoldRingFullM :: forall m a b. (MonadIO m, Storable a) => Ptr a -> (b -> a -> m b) -> b -> Ring a -> m b
758− [A] unsafeFoldRing :: forall a b. Storable a => Ptr a -> (b -> a -> b) -> b -> Ring a -> b
759− [A] unsafeEqArrayN :: Ring a -> Ptr a -> Array a -> Int -> Bool
760− [A] unsafeEqArray :: Ring a -> Ptr a -> Array a -> Bool
761− [R] toStreamWith :: Int -> Ring a -> Stream m a
762− [R] toMutArray :: MonadIO m => Int -> Int -> Ring a -> m (MutArray a)
763− [A] startOf :: Ring a -> Ptr a
764− [A] slidingWindowWith :: forall m a b. (MonadIO m, Storable a, Unbox a) => Int -> Fold m ((a, Maybe a), m (MutArray a)) b -> Fold m a b
765− [A] slidingWindow :: forall m a b. (MonadIO m, Storable a, Unbox a) => Int -> Fold m (a, Maybe a) b -> Fold m a b
766− [A] slide :: Ring a -> a -> m (Ring a)
767− [R] seek :: MonadIO m => Int -> Ring a -> m (Ring a)
768− [A] ringsOf :: Int -> Stream m a -> Stream m (MutArray a)
769− [A] readRev :: Unfold m (MutArray a) a
770− [A] read :: forall m a. (MonadIO m, Storable a) => Unfold m (Ring a, Ptr a, Int) a
771− [A] putIndex :: Ring a -> Int -> a -> m ()
772− [A] newRing :: Int -> m (Ring a)
773− [A] new :: forall a. Storable a => Int -> IO (Ring a, Ptr a)
774− [A] moveBy :: forall a. Storable a => Int -> Ring a -> Ptr a -> Ptr a
775− [A] modifyIndex :: Ring a -> Int -> (a -> (a, b)) -> m b
776− [A] length :: Ring a -> Int
777− [A] getIndexUnsafe :: Ring a -> Int -> m a
778− [A] getIndexRev :: Ring a -> Int -> m a
779− [A] getIndex :: Ring a -> Int -> m a
780− [A] fromArray :: MutArray a -> Ring a
781− [R] createRing :: MonadIO m => Int -> m (Ring a)
782− [A] castUnsafe :: Ring a -> Ring b
783− [A] cast :: forall a b. Storable b => Ring a -> Maybe (Ring b)
784− [A] bytesFree :: Ring a -> Int
785− [A] byteLength :: Ring a -> Int
786− [A] byteCapacity :: Ring a -> Int
787− [A] asBytes :: Ring a -> Ring Word8
788− [A] advance :: forall a. Storable a => Ring a -> Ptr a -> Ptr a
789−[R] Streamly.Internal.Data.Producer.Type
790−[R] Streamly.Internal.Data.Producer.Source
791−[C] Streamly.Internal.Data.Producer
792− [A] Source
793− [A] unread :: [b] -> Source a b -> Source a b
794− [A] translate :: Functor m => (a -> c) -> (c -> a) -> Producer m c b -> Producer m a b
795− [A] source :: Maybe a -> Source a b
796− [A] producer :: Monad m => Producer m a b -> Producer m (Source a b) b
797− [A] parseManyD :: Monad m => Parser a m b -> Producer m (Source x a) a -> Producer m (Source x a) (Either ParseError b)
798− [A] parseMany :: Monad m => Parser a m b -> Producer m (Source x a) a -> Producer m (Source x a) (Either ParseError b)
799− [A] parse :: Monad m => Parser a m b -> Producer m (Source s a) a -> Source s a -> m (Either ParseError b, Source s a)
800− [A] lmap :: (a -> a) -> Producer m a b -> Producer m a b
801− [A] isEmpty :: Source a b -> Bool
802−[R] Streamly.Internal.Data.Pipe.Type
803−[C] Streamly.Internal.Data.Pipe
804− [A] Step
805− [A] Yield :: a -> s -> Step s a
806− [A] Continue :: s -> Step s a
807− [A] PipeState
808− [A] Produce :: s2 -> PipeState s1 s2
809− [A] Consume :: s1 -> PipeState s1 s2
810− [C] Pipe
811− [A] Pipe :: (s1 -> a -> m (Step (PipeState s1 s2) b)) -> (s2 -> m (Step (PipeState s1 s2) b)) -> s1 -> Pipe m a b
812−[A] Streamly.Internal.Data.ParserK
813− [A] Step
814− [A] Partial :: !Int -> (Input a -> m (Step a m r)) -> Step a m r
815− [A] Error :: !Int -> String -> Step a m r
816− [A] Done :: !Int -> r -> Step a m r
817− [A] Continue :: !Int -> (Input a -> m (Step a m r)) -> Step a m r
818− [A] ParseResult
819− [A] Success :: !Int -> !b -> ParseResult b
820− [A] Failure :: !Int -> !String -> ParseResult b
821− [A] Input
822− [A] None :: Input a
823− [A] Chunk :: a -> Input a
824− [A] ParserK
825− [A] [runParser] :: ParserK a m b -> forall r. (ParseResult b -> Int -> Input a -> m (Step a m r)) -> Int -> Int -> Input a -> m (Step a m r)
826− [A] MkParser :: (forall r. (ParseResult b -> Int -> Input a -> m (Step a m r)) -> Int -> Int -> Input a -> m (Step a m r)) -> ParserK a m b
827− [A] fromPure :: b -> ParserK a m b
828− [A] fromEffect :: Monad m => m b -> ParserK a m b
829− [A] die :: String -> ParserK a m b
830− [A] adaptCG :: Monad m => Parser a m b -> ParserK (Array a) m b
831− [A] adaptC :: (Monad m, Unbox a) => Parser a m b -> ParserK (Array a) m b
832− [A] adapt :: Monad m => Parser a m b -> ParserK a m b
833−[R] Streamly.Internal.Data.Parser.ParserK.Type
834−[R] Streamly.Internal.Data.Parser.ParserD.Type
835−[R] Streamly.Internal.Data.Parser.ParserD.Tee
836−[R] Streamly.Internal.Data.Parser.ParserD
837−[C] Streamly.Internal.Data.Parser
838− [A] Step
839− [A] Partial :: !Int -> !s -> Step s b
840− [A] Error :: !String -> Step s b
841− [A] Done :: !Int -> !b -> Step s b
842− [A] Continue :: !Int -> !s -> Step s b
843− [A] Parser
844− [A] Parser :: (s -> a -> m (Step s b)) -> m (Initial s b) -> (s -> m (Step s b)) -> Parser a m b
845− [A] Initial
846− [A] IPartial :: !s -> Initial s b
847− [A] IError :: !String -> Initial s b
848− [A] IDone :: !b -> Initial s b
849− [A] GHC.Show.Show
850− [A] instance (GHC.Show.Show a, GHC.Show.Show b) => GHC.Show.Show (Streamly.Internal.Data.Parser.Tuple'Fused a b)
851− [A] ParseError
852− [A] ParseError :: String -> ParseError
853− [A] zipWithM :: Monad m => (a -> b -> m c) -> Stream m a -> Fold m c x -> Parser b m x
854− [A] zip :: Monad m => Stream m a -> Fold m (a, b) x -> Parser b m x
855− [A] wordWithQuotes :: (Monad m, Eq a) => Bool -> (a -> a -> Maybe a) -> a -> (a -> Maybe a) -> (a -> Bool) -> Fold m a b -> Parser a m b
856− [A] wordProcessQuotes :: (Monad m, Eq a) => a -> (a -> Maybe a) -> (a -> Bool) -> Fold m a b -> Parser a m b
857− [A] wordKeepQuotes :: (Monad m, Eq a) => a -> (a -> Maybe a) -> (a -> Bool) -> Fold m a b -> Parser a m b
858− [A] wordFramedBy :: Monad m => (a -> Bool) -> (a -> Bool) -> (a -> Bool) -> (a -> Bool) -> Fold m a b -> Parser a m b
859− [A] wordBy :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
860− [A] toFold :: Monad m => Parser a m b -> Fold m a b
861− [A] takeWhileP :: Monad m => (a -> Bool) -> Parser a m b -> Parser a m b
862− [A] takeWhile1 :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
863− [A] takeWhile :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
864− [A] takeStartBy_ :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
865− [A] takeStartBy :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
866− [A] takeP :: Monad m => Int -> Parser a m b -> Parser a m b
867− [A] takeGE :: Monad m => Int -> Fold m a b -> Parser a m b
868− [A] takeFramedBy_ :: Monad m => (a -> Bool) -> (a -> Bool) -> Fold m a b -> Parser a m b
869− [A] takeFramedByGeneric :: Monad m => Maybe (a -> Bool) -> Maybe (a -> Bool) -> Maybe (a -> Bool) -> Fold m a b -> Parser a m b
870− [A] takeFramedByEsc_ :: Monad m => (a -> Bool) -> (a -> Bool) -> (a -> Bool) -> Fold m a b -> Parser a m b
871− [A] takeEndBy_ :: (a -> Bool) -> Parser a m b -> Parser a m b
872− [A] takeEndByEsc :: Monad m => (a -> Bool) -> (a -> Bool) -> Parser a m b -> Parser a m b
873− [A] takeEndBy :: Monad m => (a -> Bool) -> Parser a m b -> Parser a m b
874− [A] takeEitherSepBy :: (a -> Bool) -> Fold m (Either a b) c -> Parser a m c
875− [A] takeEQ :: Monad m => Int -> Fold m a b -> Parser a m b
876− [A] takeBetween :: Monad m => Int -> Int -> Fold m a b -> Parser a m b
877− [A] subsequenceBy :: (a -> a -> Bool) -> Stream m a -> Parser a m ()
878− [A] streamEqBy :: Monad m => (a -> a -> Bool) -> Stream m a -> Parser a m ()
879− [A] split_ :: Monad m => Parser x m a -> Parser x m b -> Parser x m b
880− [A] splitWith :: Monad m => (a -> b -> c) -> Parser x m a -> Parser x m b -> Parser x m c
881− [A] splitSome :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
882− [A] splitManyPost :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
883− [A] splitMany :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
884− [A] spanByRolling :: Monad m => (a -> a -> Bool) -> Fold m a b -> Fold m a c -> Parser a m (b, c)
885− [A] spanBy :: Monad m => (a -> a -> Bool) -> Fold m a b -> Fold m a c -> Parser a m (b, c)
886− [A] span :: Monad m => (a -> Bool) -> Fold m a b -> Fold m a c -> Parser a m (b, c)
887− [A] some :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
888− [A] sequence :: Monad m => Stream m (Parser a m b) -> Fold m b c -> Parser a m c
889− [A] sepByAll :: Monad m => Parser a m b -> Parser a m x -> Fold m b c -> Parser a m c
890− [A] sepBy1 :: Monad m => Parser a m b -> Parser a m x -> Fold m b c -> Parser a m c
891− [A] sepBy :: Monad m => Parser a m b -> Parser a m x -> Fold m b c -> Parser a m c
892− [A] satisfy :: Monad m => (a -> Bool) -> Parser a m a
893− [A] sampleFromthen :: Monad m => Int -> Int -> Fold m a b -> Parser a m b
894− [A] roundRobin :: t (Parser a m b) -> Fold m b c -> Parser a m c
895− [A] rmapM :: Monad m => (b -> m c) -> Parser a m b -> Parser a m c
896− [A] retryMaxTotal :: Int -> Parser a m b -> Fold m b c -> Parser a m c
897− [A] retryMaxSuccessive :: Int -> Parser a m b -> Fold m b c -> Parser a m c
898− [A] retry :: Parser a m b -> Parser a m b
899− [A] postscan :: Fold m a b -> Parser b m c -> Parser a m c
900− [A] peek :: Monad m => Parser a m a
901− [A] oneOf :: (Monad m, Eq a, Foldable f) => f a -> Parser a m a
902− [A] oneNotEq :: (Monad m, Eq a) => a -> Parser a m a
903− [A] oneEq :: (Monad m, Eq a) => a -> Parser a m a
904− [A] one :: Monad m => Parser a m a
905− [A] noneOf :: (Monad m, Eq a, Foldable f) => f a -> Parser a m a
906− [A] noErrorUnsafeSplit_ :: Monad m => Parser x m a -> Parser x m b -> Parser x m b
907− [A] noErrorUnsafeSplitWith :: Monad m => (a -> b -> c) -> Parser x m a -> Parser x m b -> Parser x m c
908− [A] noErrorUnsafeConcatMap :: Monad m => (b -> Parser a m c) -> Parser a m b -> Parser a m c
909− [A] maybe :: Monad m => (a -> Maybe b) -> Parser a m b
910− [A] manyTillP :: Parser a m b -> Parser a m x -> Parser b m c -> Parser a m c
911− [A] manyTill :: Monad m => Parser a m b -> Parser a m x -> Fold m b c -> Parser a m c
912− [A] manyThen :: Parser a m b -> Parser a m x -> Fold m b c -> Parser a m c
913− [A] manyP :: Parser a m b -> Parser b m c -> Parser a m c
914− [A] many :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
915− [A] makeIndexFilter :: (Fold m (s, a) b -> Parser a m b) -> (((s, a) -> Bool) -> Fold m (s, a) b -> Fold m (s, a) b) -> ((s, a) -> Bool) -> Fold m a b -> Parser a m b
916− [A] lookAhead :: Monad m => Parser a m b -> Parser a m b
917− [A] lmapM :: Monad m => (a -> m b) -> Parser b m r -> Parser a m r
918− [A] lmap :: (a -> b) -> Parser b m r -> Parser a m r
919− [A] listEqBy :: Monad m => (a -> a -> Bool) -> [a] -> Parser a m [a]
920− [A] listEq :: (Monad m, Eq a) => [a] -> Parser a m [a]
921− [A] indexed :: forall m a b. Monad m => Fold m (Int, a) b -> Parser a m b
922− [A] groupByRollingEither :: Monad m => (a -> a -> Bool) -> Fold m a b -> Fold m a c -> Parser a m (Either b c)
923− [A] groupByRolling :: Monad m => (a -> a -> Bool) -> Fold m a b -> Parser a m b
924− [A] groupBy :: Monad m => (a -> a -> Bool) -> Fold m a b -> Parser a m b
925− [A] fromPure :: Monad m => b -> Parser a m b
926− [A] fromFoldMaybe :: Monad m => String -> Fold m a (Maybe b) -> Parser a m b
927− [A] fromFold :: Monad m => Fold m a b -> Parser a m b
928− [A] fromEffect :: Monad m => m b -> Parser a m b
929− [A] filter :: Monad m => (a -> Bool) -> Parser a m b -> Parser a m b
930− [A] extractStep :: Monad m => (s -> m (Step s1 b)) -> Step s b -> m (Step s1 b)
931− [A] eof :: Monad m => Parser a m ()
932− [A] either :: Monad m => (a -> Either String b) -> Parser a m b
933− [A] dropWhile :: Monad m => (a -> Bool) -> Parser a m ()
934− [A] dieM :: Monad m => m String -> Parser a m b
935− [A] die :: Monad m => String -> Parser a m b
936− [A] deintercalateAll :: Monad m => Parser a m x -> Parser a m y -> Fold m (Either x y) z -> Parser a m z
937− [A] deintercalate1 :: Monad m => Parser a m x -> Parser a m y -> Fold m (Either x y) z -> Parser a m z
938− [A] deintercalate :: Monad m => Parser a m x -> Parser a m y -> Fold m (Either x y) z -> Parser a m z
939− [A] countBetween :: Int -> Int -> Parser a m b -> Fold m b c -> Parser a m c
940− [A] count :: Int -> Parser a m b -> Fold m b c -> Parser a m c
941− [A] concatMap :: Monad m => (b -> Parser a m c) -> Parser a m b -> Parser a m c
942− [A] blockWithQuotes :: (Monad m, Eq a) => (a -> Bool) -> (a -> Bool) -> a -> a -> Fold m a b -> Parser a m b
943− [A] bimapOverrideCount :: Int -> (s -> s1) -> (b -> b1) -> Step s b -> Step s1 b1
944− [A] alt :: Monad m => Parser x m a -> Parser x m a -> Parser x m a
945−[A] Streamly.Internal.Data.MutByteArray
946− [A] class Unbox a
947− [A] class SizeOfRep (f :: Type -> Type)
948− [A] class Serialize a
949− [A] TypeOfType
950− [A] UnitType :: Name -> TypeOfType
951− [A] TheType :: SimpleDataCon -> TypeOfType
952− [A] MultiType :: [SimpleDataCon] -> TypeOfType
953− [A] SimpleDataCon
954− [A] SimpleDataCon :: Name -> [Field] -> SimpleDataCon
955− [A] SerializeConfig
956− [A] [cfgRecordSyntaxWithHeader] :: SerializeConfig -> Bool
957− [A] [cfgInlineSize] :: SerializeConfig -> Maybe Inline
958− [A] [cfgInlineSerialize] :: SerializeConfig -> Maybe Inline
959− [A] [cfgInlineDeserialize] :: SerializeConfig -> Maybe Inline
960− [A] [cfgConstructorTagAsString] :: SerializeConfig -> Bool
961− [A] SerializeConfig :: Maybe Inline -> Maybe Inline -> Maybe Inline -> Bool -> Bool -> SerializeConfig
962− [A] PinnedState
963− [A] Unpinned :: PinnedState
964− [A] Pinned :: PinnedState
965− [A] MutByteArray
966− [A] MutByteArray :: MutableByteArray# RealWorld -> MutByteArray
967− [A] DataType
968− [A] [dtTvs] :: DataType -> [Name]
969− [A] [dtName] :: DataType -> Name
970− [A] [dtCxt] :: DataType -> Cxt
971− [A] [dtCons] :: DataType -> [DataCon]
972− [A] DataType :: Name -> [Name] -> Cxt -> [DataCon] -> DataType
973− [A] DataCon
974− [A] [dcTvs] :: DataCon -> [Name]
975− [A] [dcName] :: DataCon -> Name
976− [A] [dcFields] :: DataCon -> [(Maybe Name, Type)]
977− [A] [dcCxt] :: DataCon -> Cxt
978− [A] DataCon :: Name -> [Name] -> Cxt -> [(Maybe Name, Type)] -> DataCon
979− [A] BoundedPtr
980− [A] BoundedPtr :: MutByteArray -> Int -> Int -> BoundedPtr
981− [A] Streamly.Internal.Data.Serialize.Type.Serialize
982− [A] instance Streamly.Internal.Data.Serialize.Type.Serialize Streamly.Internal.Data.MutByteArray.LiftedInteger
983− [A] instance Streamly.Internal.Data.Serialize.Type.Serialize GHC.Num.Integer.Integer
984− [A] instance Streamly.Internal.Data.Serialize.Type.Serialize a => Streamly.Internal.Data.Serialize.Type.Serialize (GHC.Maybe.Maybe a)
985− [A] instance Streamly.Internal.Data.Serialize.Type.Serialize (Data.Proxy.Proxy a)
986− [A] instance (Streamly.Internal.Data.Serialize.Type.Serialize a, Streamly.Internal.Data.Serialize.Type.Serialize b) => Streamly.Internal.Data.Serialize.Type.Serialize (Data.Either.Either a b)
987− [A] Peeker
988− [A] Peeker :: Builder BoundedPtr IO a -> Peeker a
989− [A] type Field = (Maybe Name, Type)
990− [A] xorCmp :: [Word8] -> Name -> Name -> Q Exp
991− [A] wListToString :: [Word8] -> String
992− [A] w8_int :: Word8 -> Int
993− [A] w32_int :: Word32 -> Int
994− [A] unpin :: MutByteArray -> IO MutByteArray
995− [A] typeOfType :: Type -> [DataCon] -> TypeOfType
996− [A] skipByte :: Peeker ()
997− [A] sizeOfRep :: SizeOfRep f => f x -> Int
998− [A] sizeOfMutableByteArray :: MutByteArray -> IO Int
999− [A] sizeOf :: (Unbox a, SizeOfRep (Rep a)) => Proxy a -> Int
1000− [A] simplifyDataCon :: DataCon -> SimpleDataCon
1001− [A] serializeW8List :: Name -> Name -> [Word8] -> Q Exp
1002− [A] serializeConfig :: SerializeConfig
1003− [A] serializeAt :: Serialize a => Int -> MutByteArray -> a -> IO Int
1004− [A] runPeeker :: Peeker a -> BoundedPtr -> IO a
1005− [A] reifyDataType :: Name -> Q DataType
1006− [A] readUnsafe :: Unbox a => Peeker a
1007− [A] read :: Unbox a => Peeker a
1008− [A] putSliceUnsafe :: MonadIO m => MutByteArray -> Int -> MutByteArray -> Int -> Int -> m ()
1009− [A] pokeRep :: PokeRep f => f a -> BoundedPtr -> IO BoundedPtr
1010− [A] pokeBoundedPtrUnsafe :: forall a. Unbox a => a -> BoundedPtr -> IO BoundedPtr
1011− [A] pokeBoundedPtr :: forall a. Unbox a => a -> BoundedPtr -> IO BoundedPtr
1012− [A] pokeAt :: (Unbox a, Generic a, PokeRep (Rep a)) => Int -> MutByteArray -> a -> IO ()
1013− [A] pinnedNewAlignedBytes :: Int -> Int -> IO MutByteArray
1014− [A] pinnedNew :: Int -> IO MutByteArray
1015− [A] pinnedCloneSliceUnsafe :: MonadIO m => Int -> Int -> MutByteArray -> m MutByteArray
1016− [A] pin :: MutByteArray -> IO MutByteArray
1017− [A] peekRep :: PeekRep f => Peeker (f x)
1018− [A] peekAt :: (Unbox a, Generic a, PeekRep (Rep a)) => Int -> MutByteArray -> IO a
1019− [A] openConstructor :: Name -> Int -> Q Pat
1020− [A] nil :: MutByteArray
1021− [A] newBytesAs :: PinnedState -> Int -> IO MutByteArray
1022− [A] new :: Int -> IO MutByteArray
1023− [A] mkSerializeExprFields :: Name -> [Field] -> Q Exp
1024− [A] mkRecSizeOfExpr :: SimpleDataCon -> Q Exp
1025− [A] mkRecSerializeExpr :: Name -> SimpleDataCon -> Q Exp
1026− [A] mkRecDeserializeExpr :: Name -> Name -> Name -> SimpleDataCon -> Q Exp
1027− [A] mkFieldName :: Int -> Name
1028− [A] mkDeserializeKeysDec :: Name -> Name -> SimpleDataCon -> Q [Dec]
1029− [A] mkDeserializeExprOne :: Name -> SimpleDataCon -> Q Exp
1030− [A] matchConstructor :: Name -> Int -> Q Exp -> Q Match
1031− [A] makeN :: Int -> Name
1032− [A] makeI :: Int -> Name
1033− [A] makeA :: Int -> Name
1034− [A] litProxy :: Unbox a => Proxy a -> Q Exp
1035− [A] litIntegral :: Integral a => a -> Q Exp
1036− [A] isUnitType :: [DataCon] -> Bool
1037− [A] isRecordSyntax :: SimpleDataCon -> Bool
1038− [A] isPinned :: MutByteArray -> Bool
1039− [A] int_w8 :: Int -> Word8
1040− [A] int_w32 :: Int -> Word32
1041− [A] inlineSerializeAt :: Maybe Inline -> SerializeConfig -> SerializeConfig
1042− [A] inlineDeserializeAt :: Maybe Inline -> SerializeConfig -> SerializeConfig
1043− [A] inlineAddSizeTo :: Maybe Inline -> SerializeConfig -> SerializeConfig
1044− [A] getMutableByteArray# :: MutByteArray -> MutableByteArray# RealWorld
1045− [A] genericSizeOf :: forall a. SizeOfRep (Rep a) => Proxy a -> Int
1046− [A] genericPokeByteIndex :: (Generic a, PokeRep (Rep a)) => MutByteArray -> Int -> a -> IO ()
1047− [A] genericPeekByteIndex :: (Generic a, PeekRep (Rep a)) => MutByteArray -> Int -> IO a
1048− [A] errorUnsupported :: String -> a
1049− [A] errorUnimplemented :: a
1050− [A] encodeRecordFields :: Bool -> SerializeConfig -> SerializeConfig
1051− [A] encodeConstrNames :: Bool -> SerializeConfig -> SerializeConfig
1052− [A] deserializeAt :: Serialize a => Int -> MutByteArray -> Int -> IO (Int, a)
1053− [A] deriveUnbox :: Q [Dec] -> Q [Dec]
1054− [A] deriveSerializeWith :: (SerializeConfig -> SerializeConfig) -> Q [Dec] -> Q [Dec]
1055− [A] deriveSerialize :: Q [Dec] -> Q [Dec]
1056− [A] conUpdateFuncDec :: Name -> [Field] -> Q [Dec]
1057− [A] cloneSliceUnsafeAs :: MonadIO m => PinnedState -> Int -> Int -> MutByteArray -> m MutByteArray
1058− [A] cloneSliceUnsafe :: MonadIO m => Int -> Int -> MutByteArray -> m MutByteArray
1059− [A] c2w :: Char -> Word8
1060− [A] asPtrUnsafe :: MonadIO m => MutByteArray -> (Ptr a -> m b) -> m b
1061− [A] addSizeTo :: Serialize a => Int -> a -> Int
1062− [A] _x :: Name
1063− [A] _val :: Name
1064− [A] _tag :: Name
1065− [A] _initialOffset :: Name
1066− [A] _endOffset :: Name
1067− [A] _arr :: Name
1068− [A] _acc :: Name
1069−[A] Streamly.Internal.Data.MutArray.Stream
1070− [A] SpliceState
1071− [A] SpliceYielding :: arr -> SpliceState s arr -> SpliceState s arr
1072− [A] SpliceInitial :: s -> SpliceState s arr
1073− [A] SpliceFinish :: SpliceState s arr
1074− [A] SpliceBuffering :: s -> arr -> SpliceState s arr
1075− [A] writeChunks :: (MonadIO m, Unbox a) => Int -> Fold m a (StreamK n (MutArray a))
1076− [A] splitOn :: (MonadIO m, Unbox a) => (a -> Bool) -> MutArray a -> Stream m (MutArray a)
1077− [A] pinnedChunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (MutArray a)
1078− [A] packArraysChunksOf :: (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (MutArray a)
1079− [A] lpackArraysChunksOf :: (MonadIO m, Unbox a) => Int -> Fold m (MutArray a) () -> Fold m (MutArray a) ()
1080− [A] fromArrayStreamK :: (Unbox a, MonadIO m) => StreamK m (MutArray a) -> m (MutArray a)
1081− [A] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
1082− [A] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
1083− [A] compactLE :: (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (Either ParseError (MutArray a))
1084− [A] compactGE :: (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (MutArray a)
1085− [A] compactEQ :: Int -> Stream m (MutArray a) -> Stream m (MutArray a)
1086− [A] compact :: (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (MutArray a)
1087− [A] chunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (MutArray a)
1088−[A] Streamly.Internal.Data.MutArray.Generic
1089− [A] MutArray
1090− [A] [arrTrueLen] :: MutArray a -> {-# UNPACK #-} !Int
1091− [A] [arrStart] :: MutArray a -> {-# UNPACK #-} !Int
1092− [A] [arrLen] :: MutArray a -> {-# UNPACK #-} !Int
1093− [A] [arrContents#] :: MutArray a -> MutableArray# RealWorld a
1094− [A] MutArray :: MutableArray# RealWorld a -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> MutArray a
1095− [A] writeWith :: MonadIO m => Int -> Fold m a (MutArray a)
1096− [A] writeNUnsafe :: MonadIO m => Int -> Fold m a (MutArray a)
1097− [A] writeN :: MonadIO m => Int -> Fold m a (MutArray a)
1098− [A] write :: MonadIO m => Fold m a (MutArray a)
1099− [A] uninit :: MonadIO m => MutArray a -> Int -> m (MutArray a)
1100− [A] toStreamK :: MonadIO m => MutArray a -> StreamK m a
1101− [A] toList :: MonadIO m => MutArray a -> m [a]
1102− [A] strip :: MonadIO m => (a -> Bool) -> MutArray a -> m (MutArray a)
1103− [A] snocWith :: MonadIO m => (Int -> Int) -> MutArray a -> a -> m (MutArray a)
1104− [A] snocUnsafe :: MonadIO m => MutArray a -> a -> m (MutArray a)
1105− [A] snoc :: MonadIO m => MutArray a -> a -> m (MutArray a)
1106− [A] realloc :: MonadIO m => Int -> MutArray a -> m (MutArray a)
1107− [A] reader :: MonadIO m => Unfold m (MutArray a) a
1108− [A] readRev :: MonadIO m => MutArray a -> Stream m a
1109− [A] read :: MonadIO m => MutArray a -> Stream m a
1110− [A] putSliceUnsafe :: MonadIO m => MutArray a -> Int -> MutArray a -> Int -> Int -> m ()
1111− [A] putIndices :: MonadIO m => MutArray a -> Fold m (Int, a) ()
1112− [A] putIndexUnsafe :: forall m a. MonadIO m => Int -> MutArray a -> a -> m ()
1113− [A] putIndex :: MonadIO m => Int -> MutArray a -> a -> m ()
1114− [A] producerWith :: Monad m => (forall b. IO b -> m b) -> Producer m (MutArray a) a
1115− [A] producer :: MonadIO m => Producer m (MutArray a) a
1116− [A] nil :: MonadIO m => m (MutArray a)
1117− [A] new :: MonadIO m => Int -> m (MutArray a)
1118− [A] modifyIndexUnsafe :: MonadIO m => Int -> MutArray a -> (a -> (a, b)) -> m b
1119− [A] modifyIndex :: MonadIO m => Int -> MutArray a -> (a -> (a, b)) -> m b
1120− [A] length :: MutArray a -> Int
1121− [A] getSliceUnsafe :: Int -> Int -> MutArray a -> MutArray a
1122− [A] getSlice :: Int -> Int -> MutArray a -> MutArray a
1123− [A] getIndexUnsafeWith :: MonadIO m => MutableArray# RealWorld a -> Int -> m a
1124− [A] getIndexUnsafe :: MonadIO m => Int -> MutArray a -> m a
1125− [A] getIndex :: MonadIO m => Int -> MutArray a -> m (Maybe a)
1126− [A] fromStreamN :: MonadIO m => Int -> Stream m a -> m (MutArray a)
1127− [A] fromStream :: MonadIO m => Stream m a -> m (MutArray a)
1128− [A] fromPureStream :: MonadIO m => Stream Identity a -> m (MutArray a)
1129− [A] fromListN :: MonadIO m => Int -> [a] -> m (MutArray a)
1130− [A] fromList :: MonadIO m => [a] -> m (MutArray a)
1131− [A] eq :: (MonadIO m, Eq a) => MutArray a -> MutArray a -> m Bool
1132− [A] cmp :: (MonadIO m, Ord a) => MutArray a -> MutArray a -> m Ordering
1133− [A] clone :: MonadIO m => MutArray a -> m (MutArray a)
1134− [A] chunksOf :: forall m a. MonadIO m => Int -> Stream m a -> Stream m (MutArray a)
1135−[A] Streamly.Internal.Data.MutArray
1136− [A] MutByteArray
1137− [A] MutArray
1138− [A] [arrStart] :: MutArray a -> {-# UNPACK #-} !Int
1139− [A] [arrEnd] :: MutArray a -> {-# UNPACK #-} !Int
1140− [A] [arrContents] :: MutArray a -> {-# UNPACK #-} !MutByteArray
1141− [A] [arrBound] :: MutArray a -> {-# UNPACK #-} !Int
1142− [A] MutArray :: {-# UNPACK #-} !MutByteArray -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> MutArray a
1143− [A] IORef
1144− [A] ArrayUnsafe
1145− [A] ArrayUnsafe :: {-# UNPACK #-} !MutByteArray -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> ArrayUnsafe a
1146− [A] writeWith :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
1147− [A] writeRevN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
1148− [A] writeNWithUnsafe :: forall m a. (MonadIO m, Unbox a) => (Int -> m (MutArray a)) -> Int -> Fold m a (MutArray a)
1149− [A] writeNWith :: forall m a. (MonadIO m, Unbox a) => (Int -> m (MutArray a)) -> Int -> Fold m a (MutArray a)
1150− [A] writeNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
1151− [A] writeN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
1152− [A] writeIORef :: Unbox a => IORef a -> a -> IO ()
1153− [A] writeChunks :: (MonadIO m, Unbox a) => Int -> Fold m a (StreamK n (MutArray a))
1154− [A] writeAppendWith :: forall m a. (MonadIO m, Unbox a) => (Int -> Int) -> m (MutArray a) -> Fold m a (MutArray a)
1155− [A] writeAppendNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
1156− [A] writeAppendN :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
1157− [A] writeAppend :: forall m a. (MonadIO m, Unbox a) => m (MutArray a) -> Fold m a (MutArray a)
1158− [A] write :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
1159− [A] unsafeSwapIndices :: forall m a. (MonadIO m, Unbox a) => Int -> Int -> MutArray a -> m ()
1160− [A] unpin :: MutArray a -> IO (MutArray a)
1161− [A] toStreamKWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> StreamK m a
1162− [A] toStreamKRevWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> StreamK m a
1163− [A] toStreamKRev :: forall m a. (MonadIO m, Unbox a) => MutArray a -> StreamK m a
1164− [A] toStreamK :: forall m a. (MonadIO m, Unbox a) => MutArray a -> StreamK m a
1165− [A] toStreamDWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> Stream m a
1166− [A] toStreamDRevWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> Stream m a
1167− [A] toList :: forall m a. (MonadIO m, Unbox a) => MutArray a -> m [a]
1168− [A] swapIndices :: forall m a. (MonadIO m, Unbox a) => Int -> Int -> MutArray a -> m ()
1169− [A] strip :: forall a m. (Unbox a, MonadIO m) => (a -> Bool) -> MutArray a -> m (MutArray a)
1170− [A] splitOn :: (MonadIO m, Unbox a) => (a -> Bool) -> MutArray a -> Stream m (MutArray a)
1171− [A] splitAt :: forall a. Unbox a => Int -> MutArray a -> (MutArray a, MutArray a)
1172− [A] spliceWith :: forall m a. (MonadIO m, Unbox a) => (Int -> Int -> Int) -> MutArray a -> MutArray a -> m (MutArray a)
1173− [A] spliceUnsafe :: MonadIO m => MutArray a -> MutArray a -> m (MutArray a)
1174− [A] spliceExp :: (MonadIO m, Unbox a) => MutArray a -> MutArray a -> m (MutArray a)
1175− [A] spliceCopy :: forall m a. MonadIO m => MutArray a -> MutArray a -> m (MutArray a)
1176− [A] splice :: (MonadIO m, Unbox a) => MutArray a -> MutArray a -> m (MutArray a)
1177− [A] snocWith :: forall m a. (MonadIO m, Unbox a) => (Int -> Int) -> MutArray a -> a -> m (MutArray a)
1178− [A] snocUnsafe :: forall m a. (MonadIO m, Unbox a) => MutArray a -> a -> m (MutArray a)
1179− [A] snocMay :: forall m a. (MonadIO m, Unbox a) => MutArray a -> a -> m (Maybe (MutArray a))
1180− [A] snocLinear :: forall m a. (MonadIO m, Unbox a) => MutArray a -> a -> m (MutArray a)
1181− [A] snoc :: forall m a. (MonadIO m, Unbox a) => MutArray a -> a -> m (MutArray a)
1182− [A] shuffleBy :: (a -> a -> m Bool) -> MutArray a -> MutArray a -> m ()
1183− [A] roundUpToPower2 :: Int -> Int
1184− [A] rightSize :: forall m a. (MonadIO m, Unbox a) => MutArray a -> m (MutArray a)
1185− [A] reverse :: forall m a. (MonadIO m, Unbox a) => MutArray a -> m ()
1186− [A] resizeExp :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
1187− [A] resize :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
1188− [A] realloc :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
1189− [A] readerRevWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> Unfold m (MutArray a) a
1190− [A] readerRev :: forall m a. (MonadIO m, Unbox a) => Unfold m (MutArray a) a
1191− [A] reader :: forall m a. (MonadIO m, Unbox a) => Unfold m (MutArray a) a
1192− [A] readRev :: forall m a. (MonadIO m, Unbox a) => MutArray a -> Stream m a
1193− [A] readIORef :: Unbox a => IORef a -> IO a
1194− [A] read :: forall m a. (MonadIO m, Unbox a) => MutArray a -> Stream m a
1195− [A] putIndices :: forall m a. (MonadIO m, Unbox a) => MutArray a -> Fold m (Int, a) ()
1196− [A] putIndexUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> a -> m ()
1197− [A] putIndex :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> a -> m ()
1198− [A] producerWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> Producer m (MutArray a) a
1199− [A] producer :: forall m a. (MonadIO m, Unbox a) => Producer m (MutArray a) a
1200− [A] pollIntIORef :: (MonadIO m, Unbox a) => IORef a -> Stream m a
1201− [A] pinnedWriteNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
1202− [A] pinnedWriteNAligned :: forall m a. (MonadIO m, Unbox a) => Int -> Int -> Fold m a (MutArray a)
1203− [A] pinnedWriteN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
1204− [A] pinnedWrite :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
1205− [A] pinnedNewBytes :: MonadIO m => Int -> m (MutArray a)
1206− [A] pinnedNewAligned :: (MonadIO m, Unbox a) => Int -> Int -> m (MutArray a)
1207− [A] pinnedNew :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
1208− [A] pinnedFromListN :: (MonadIO m, Unbox a) => Int -> [a] -> m (MutArray a)
1209− [A] pinnedFromList :: (MonadIO m, Unbox a) => [a] -> m (MutArray a)
1210− [A] pinnedClone :: MonadIO m => MutArray a -> m (MutArray a)
1211− [A] pinnedChunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (MutArray a)
1212− [A] pin :: MutArray a -> IO (MutArray a)
1213− [A] permute :: MutArray a -> m Bool
1214− [A] partitionBy :: forall m a. (MonadIO m, Unbox a) => (a -> Bool) -> MutArray a -> m (MutArray a, MutArray a)
1215− [A] nil :: MutArray a
1216− [A] newIORef :: forall a. Unbox a => a -> IO (IORef a)
1217− [A] newArrayWith :: forall m a. (MonadIO m, Unbox a) => (Int -> Int -> m MutByteArray) -> Int -> Int -> m (MutArray a)
1218− [A] new :: (MonadIO m, Unbox a) => Int -> m (MutArray a)
1219− [A] modifyIndices :: forall m a. (MonadIO m, Unbox a) => MutArray a -> (Int -> a -> a) -> Fold m Int ()
1220− [A] modifyIndexUnsafe :: forall m a b. (MonadIO m, Unbox a) => Int -> MutArray a -> (a -> (a, b)) -> m b
1221− [A] modifyIndex :: forall m a b. (MonadIO m, Unbox a) => Int -> MutArray a -> (a -> (a, b)) -> m b
1222− [A] modifyIORef' :: Unbox a => IORef a -> (a -> a) -> IO ()
1223− [A] modify :: forall m a. (MonadIO m, Unbox a) => MutArray a -> (a -> a) -> m ()
1224− [A] mergeBy :: Int -> (MutArray a -> MutArray a -> m ()) -> MutArray a -> m ()
1225− [A] memcpy :: Ptr Word8 -> Ptr Word8 -> Int -> IO ()
1226− [A] memcmp :: Ptr Word8 -> Ptr Word8 -> Int -> IO Bool
1227− [A] length :: forall a. Unbox a => MutArray a -> Int
1228− [A] isPinned :: MutArray a -> Bool
1229− [A] getSlicesFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (MutArray a) (MutArray a)
1230− [A] getSliceUnsafe :: forall a. Unbox a => Int -> Int -> MutArray a -> MutArray a
1231− [A] getSlice :: forall a. Unbox a => Int -> Int -> MutArray a -> MutArray a
1232− [A] getIndicesD :: (Monad m, Unbox a) => (forall b. IO b -> m b) -> Stream m Int -> Unfold m (MutArray a) a
1233− [A] getIndices :: (MonadIO m, Unbox a) => Stream m Int -> Unfold m (MutArray a) a
1234− [A] getIndexUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m a
1235− [A] getIndexRev :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m a
1236− [A] getIndex :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (Maybe a)
1237− [A] genSlicesFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (MutArray a) (Int, Int)
1238− [A] fromStreamDN :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> m (MutArray a)
1239− [A] fromStreamD :: (MonadIO m, Unbox a) => Stream m a -> m (MutArray a)
1240− [A] fromStream :: (MonadIO m, Unbox a) => Stream m a -> m (MutArray a)
1241− [A] fromPureStream :: (MonadIO m, Unbox a) => Stream Identity a -> m (MutArray a)
1242− [A] fromListRevN :: (MonadIO m, Unbox a) => Int -> [a] -> m (MutArray a)
1243− [A] fromListRev :: (MonadIO m, Unbox a) => [a] -> m (MutArray a)
1244− [A] fromListN :: (MonadIO m, Unbox a) => Int -> [a] -> m (MutArray a)
1245− [A] fromList :: (MonadIO m, Unbox a) => [a] -> m (MutArray a)
1246− [A] fromArrayStreamK :: (Unbox a, MonadIO m) => StreamK m (MutArray a) -> m (MutArray a)
1247− [A] foldr :: (MonadIO m, Unbox a) => (a -> b -> b) -> b -> MutArray a -> m b
1248− [A] foldl' :: (MonadIO m, Unbox a) => (b -> a -> b) -> b -> MutArray a -> m b
1249− [A] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
1250− [A] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
1251− [A] divideBy :: Int -> (MutArray a -> m (MutArray a, MutArray a)) -> MutArray a -> m ()
1252− [A] cmp :: MonadIO m => MutArray a -> MutArray a -> m Ordering
1253− [A] clone :: MonadIO m => MutArray a -> m (MutArray a)
1254− [A] chunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (MutArray a)
1255− [A] castUnsafe :: MutArray a -> MutArray b
1256− [A] cast :: forall a b. Unbox b => MutArray a -> Maybe (MutArray b)
1257− [A] c_memchr :: Ptr Word8 -> Word8 -> CSize -> IO (Ptr Word8)
1258− [A] bytesFree :: MutArray a -> Int
1259− [A] byteLength :: MutArray a -> Int
1260− [A] byteCapacity :: MutArray a -> Int
1261− [A] bubble :: (MonadIO m, Unbox a) => (a -> a -> Ordering) -> MutArray a -> m ()
1262− [A] breakOn :: MonadIO m => Word8 -> MutArray Word8 -> m (MutArray Word8, Maybe (MutArray Word8))
1263− [A] blockSize :: Int
1264− [A] asPtrUnsafe :: MonadIO m => MutArray a -> (Ptr a -> m b) -> m b
1265− [A] asBytes :: MutArray a -> MutArray Word8
1266− [A] arrayChunkBytes :: Int
1267− [A] allocBytesToElemCount :: Unbox a => a -> Int -> Int
1268−[C] Streamly.Internal.Data.IsMap
1269− [A] mapTraverseWithKey :: (IsMap f, Applicative t) => (Key f -> a -> t b) -> f a -> t (f b)
1270−[R] Streamly.Internal.Data.IORef.Unboxed
1271−[R] Streamly.Internal.Data.Fold.Window
1272−[R] Streamly.Internal.Data.Fold.Type
1273−[R] Streamly.Internal.Data.Fold.Tee
1274−[R] Streamly.Internal.Data.Fold.Step
1275−[R] Streamly.Internal.Data.Fold.Container
1276−[D] Streamly.Internal.Data.Fold.Chunked
1277−[C] Streamly.Internal.Data.Fold
1278− [A] ManyState
1279− [C] Fold
1280− [C] Fold
1281− [O] Fold :: (s -> a -> m (Step s b)) -> m (Step s b) -> (s -> m b) -> Fold m a b
1282− [N] Fold :: (s -> a -> m (Step s b)) -> m (Step s b) -> (s -> m b) -> (s -> m b) -> Fold m a b
1283− [A] windowSumInt :: forall m a. (Monad m, Integral a) => Fold m (a, Maybe a) a
1284− [A] windowSum :: forall m a. (Monad m, Num a) => Fold m (a, Maybe a) a
1285− [A] windowRollingMapM :: Monad m => (Maybe a -> a -> m (Maybe b)) -> Fold m (a, Maybe a) (Maybe b)
1286− [A] windowRollingMap :: Monad m => (Maybe a -> a -> Maybe b) -> Fold m (a, Maybe a) (Maybe b)
1287− [A] windowRange :: (MonadIO m, Storable a, Ord a) => Int -> Fold m a (Maybe (a, a))
1288− [A] windowPowerSumFrac :: (Monad m, Floating a) => a -> Fold m (a, Maybe a) a
1289− [A] windowPowerSum :: (Monad m, Num a) => Int -> Fold m (a, Maybe a) a
1290− [A] windowMinimum :: (MonadIO m, Storable a, Ord a) => Int -> Fold m a (Maybe a)
1291− [A] windowMean :: forall m a. (Monad m, Fractional a) => Fold m (a, Maybe a) a
1292− [A] windowMaximum :: (MonadIO m, Storable a, Ord a) => Int -> Fold m a (Maybe a)
1293− [A] windowLmap :: (c -> a) -> Fold m (a, Maybe a) b -> Fold m (c, Maybe c) b
1294− [A] windowLength :: (Monad m, Num b) => Fold m (a, Maybe a) b
1295− [A] toSet :: (Monad m, Ord a) => Fold m a (Set a)
1296− [A] toMapIO :: (MonadIO m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (Map k b)
1297− [A] toMap :: (Monad m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (Map k b)
1298− [A] toIntSet :: Monad m => Fold m Int IntSet
1299− [A] toContainerIO :: (MonadIO m, IsMap f, Traversable f, Ord (Key f)) => (a -> Key f) -> Fold m a b -> Fold m a (f b)
1300− [A] toContainer :: (Monad m, IsMap f, Traversable f, Ord (Key f)) => (a -> Key f) -> Fold m a b -> Fold m a (f b)
1301− [A] nubInt :: Monad m => Fold m Int (Maybe Int)
1302− [A] nub :: (Monad m, Ord a) => Fold m a (Maybe a)
1303− [A] mapMStep :: Applicative m => (a -> m b) -> Step s a -> m (Step s b)
1304− [A] kvToMap :: (Monad m, Ord k) => Fold m a b -> Fold m (k, a) (Map k b)
1305− [A] frequency :: (Monad m, Ord a) => Fold m a (Map a Int)
1306− [A] demuxToMapIO :: (MonadIO m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (Map k b)
1307− [A] demuxToMap :: (Monad m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (Map k b)
1308− [A] demuxToContainerIO :: (MonadIO m, IsMap f, Traversable f) => (a -> Key f) -> (a -> m (Fold m a b)) -> Fold m a (f b)
1309− [A] demuxToContainer :: (Monad m, IsMap f, Traversable f) => (a -> Key f) -> (a -> m (Fold m a b)) -> Fold m a (f b)
1310− [A] demuxKvToMap :: (Monad m, Ord k) => (k -> m (Fold m a b)) -> Fold m (k, a) (Map k b)
1311− [A] demuxKvToContainer :: (Monad m, IsMap f, Traversable f) => (Key f -> m (Fold m a b)) -> Fold m (Key f, a) (f b)
1312− [A] demuxIO :: (MonadIO m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (m (Map k b), Maybe (k, b))
1313− [A] demuxGenericIO :: (MonadIO m, IsMap f, Traversable f) => (a -> Key f) -> (a -> m (Fold m a b)) -> Fold m a (m (f b), Maybe (Key f, b))
1314− [A] demuxGeneric :: (Monad m, IsMap f, Traversable f) => (a -> Key f) -> (a -> m (Fold m a b)) -> Fold m a (m (f b), Maybe (Key f, b))
1315− [A] demux :: (Monad m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (m (Map k b), Maybe (k, b))
1316− [A] cumulative :: Fold m (a, Maybe a) b -> Fold m a b
1317− [A] countDistinctInt :: Monad m => Fold m Int Int
1318− [A] countDistinct :: (Monad m, Ord a) => Fold m a Int
1319− [A] classifyIO :: (MonadIO m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (m (Map k b), Maybe (k, b))
1320− [A] classifyGenericIO :: (MonadIO m, IsMap f, Traversable f, Ord (Key f)) => (a -> Key f) -> Fold m a b -> Fold m a (m (f b), Maybe (Key f, b))
1321− [A] classifyGeneric :: (Monad m, IsMap f, Traversable f, Ord (Key f)) => (a -> Key f) -> Fold m a b -> Fold m a (m (f b), Maybe (Key f, b))
1322− [A] classify :: (Monad m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (m (Map k b), Maybe (k, b))
1323− [A] chainStepM :: Applicative m => (s1 -> m s2) -> (a -> m (Step s2 b)) -> Step s1 a -> m (Step s2 b)
1324−[C] Streamly.Internal.Data.Builder
1325− [C] Builder
1326− [C] Builder
1327− [O] Builder :: (s -> m (s, a)) -> Builder s m a
1328− [N] Builder :: (s -> m (a, s)) -> Builder s m a
1329−[A] Streamly.Internal.Data.Binary.Stream
1330− [A] class ToBytes a
1331− [A] word8 :: Applicative m => Word8 -> Stream m Word8
1332− [A] word64le :: Monad m => Word64 -> Stream m Word8
1333− [A] word64host :: Monad m => Word64 -> Stream m Word8
1334− [A] word64be :: Monad m => Word64 -> Stream m Word8
1335− [A] word32le :: Monad m => Word32 -> Stream m Word8
1336− [A] word32be :: Monad m => Word32 -> Stream m Word8
1337− [A] word16le :: Monad m => Word16 -> Stream m Word8
1338− [A] word16be :: Monad m => Word16 -> Stream m Word8
1339− [A] unit :: Applicative m => Stream m Word8
1340− [A] toBytes :: ToBytes a => a -> Stream m Word8
1341− [A] ordering :: Applicative m => Ordering -> Stream m Word8
1342− [A] int8 :: Applicative m => Int8 -> Stream m Word8
1343− [A] int64le :: Monad m => Int64 -> Stream m Word8
1344− [A] int64be :: Monad m => Int64 -> Stream m Word8
1345− [A] int32le :: Monad m => Int32 -> Stream m Word8
1346− [A] int32be :: Monad m => Int32 -> Stream m Word8
1347− [A] int16le :: Monad m => Int16 -> Stream m Word8
1348− [A] int16be :: Monad m => Int16 -> Stream m Word8
1349− [A] float32le :: Monad m => Float -> Stream m Word8
1350− [A] float32be :: Monad m => Float -> Stream m Word8
1351− [A] double64le :: Monad m => Double -> Stream m Word8
1352− [A] double64be :: Monad m => Double -> Stream m Word8
1353− [A] charUtf8 :: Monad m => Char -> Stream m Word8
1354− [A] charLatin1 :: Applicative m => Char -> Stream m Word8
1355− [A] bool :: Applicative m => Bool -> Stream m Word8
1356−[A] Streamly.Internal.Data.Binary.Parser
1357− [A] class FromBytes a
1358− [A] word8 :: Monad m => Parser Word8 m Word8
1359− [A] word64le :: Monad m => Parser Word8 m Word64
1360− [A] word64host :: MonadIO m => Parser Word8 m Word64
1361− [A] word64be :: Monad m => Parser Word8 m Word64
1362− [A] word32le :: Monad m => Parser Word8 m Word32
1363− [A] word32be :: Monad m => Parser Word8 m Word32
1364− [A] word16le :: Monad m => Parser Word8 m Word16
1365− [A] word16be :: Monad m => Parser Word8 m Word16
1366− [A] unit :: Monad m => Parser Word8 m ()
1367− [A] ordering :: Monad m => Parser Word8 m Ordering
1368− [A] int8 :: Monad m => Parser Word8 m Int8
1369− [A] int64le :: Monad m => Parser Word8 m Int64
1370− [A] int64be :: Monad m => Parser Word8 m Int64
1371− [A] int32le :: Monad m => Parser Word8 m Int32
1372− [A] int32be :: Monad m => Parser Word8 m Int32
1373− [A] int16le :: Monad m => Parser Word8 m Int16
1374− [A] int16be :: Monad m => Parser Word8 m Int16
1375− [A] fromBytes :: FromBytes a => Parser Word8 m a
1376− [A] float32le :: MonadIO m => Parser Word8 m Float
1377− [A] float32be :: MonadIO m => Parser Word8 m Float
1378− [A] eqWord8 :: Monad m => Word8 -> Parser Word8 m Word8
1379− [A] double64le :: MonadIO m => Parser Word8 m Double
1380− [A] double64be :: MonadIO m => Parser Word8 m Double
1381− [A] charLatin1 :: Monad m => Parser Word8 m Char
1382− [A] bool :: Monad m => Parser Word8 m Bool
1383−[R] Streamly.Internal.Data.Array.Type
1384−[A] Streamly.Internal.Data.Array.Stream
1385− [A] unlines :: forall m a. (MonadIO m, Unbox a) => a -> Stream m (Array a) -> Stream m a
1386− [A] toArray :: (MonadIO m, Unbox a) => Stream m (Array a) -> m (Array a)
1387− [A] splitOnSuffix :: MonadIO m => Word8 -> Stream m (Array Word8) -> Stream m (Array Word8)
1388− [A] splitOn :: MonadIO m => Word8 -> Stream m (Array Word8) -> Stream m (Array Word8)
1389− [A] runArrayParserDBreak :: forall m a b. (MonadIO m, Unbox a) => Parser (Array a) m b -> Stream m (Array a) -> m (Either ParseError b, Stream m (Array a))
1390− [A] runArrayFoldMany :: (Monad m, Unbox a) => ChunkFold m a b -> StreamK m (Array a) -> StreamK m (Either ParseError b)
1391− [A] runArrayFoldBreak :: (MonadIO m, Unbox a) => ChunkFold m a b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
1392− [A] runArrayFold :: (MonadIO m, Unbox a) => ChunkFold m a b -> StreamK m (Array a) -> m (Either ParseError b)
1393− [A] pinnedChunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (Array a)
1394− [A] parseChunks :: (Monad m, Unbox a) => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b)
1395− [A] parseBreakChunks :: (Monad m, Unbox a) => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
1396− [A] parseBreak :: (MonadIO m, Unbox a) => Parser a m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
1397− [A] lpackArraysChunksOf :: (MonadIO m, Unbox a) => Int -> Fold m (Array a) () -> Fold m (Array a) ()
1398− [A] interposeSuffix :: (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
1399− [A] interpose :: (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
1400− [A] intercalateSuffix :: (Monad m, Unbox a) => Array a -> Stream m (Array a) -> Stream m a
1401− [A] foldBreakD :: forall m a b. (MonadIO m, Unbox a) => Fold m a b -> Stream m (Array a) -> m (b, Stream m (Array a))
1402− [A] foldBreak :: (MonadIO m, Unbox a) => Fold m a b -> StreamK m (Array a) -> m (b, StreamK m (Array a))
1403− [A] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
1404− [A] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
1405− [A] concatRev :: (Monad m, Unbox a) => Stream m (Array a) -> Stream m a
1406− [A] concat :: (Monad m, Unbox a) => Stream m (Array a) -> Stream m a
1407− [A] compact :: (MonadIO m, Unbox a) => Int -> Stream m (Array a) -> Stream m (Array a)
1408− [A] chunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (Array a)
1409− [A] bufferChunks :: (MonadIO m, Unbox a) => Stream m a -> m (StreamK m (Array a))
1410−[R] Streamly.Internal.Data.Array.Mut.Type
1411−[R] Streamly.Internal.Data.Array.Mut.Stream
1412−[R] Streamly.Internal.Data.Array.Mut
1413−[R] Streamly.Internal.Data.Array.Generic.Mut.Type
1414−[C] Streamly.Internal.Data.Array.Generic
1415− [A] getIndex :: Int -> Array a -> Maybe a
1416− [A] fromPureStream :: Stream Identity a -> Array a
1417− [A] fromByteStr# :: Addr# -> Array Word8
1418− [A] chunksOf :: forall m a. MonadIO m => Int -> Stream m a -> Stream m (Array a)
1419−[C] Streamly.Internal.Data.Array
1420− [A] ArrayUnsafe
1421− [A] ArrayUnsafe :: {-# UNPACK #-} !MutByteArray -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> ArrayUnsafe a
1422− [C] Array
1423− [A] [arrStart] :: Array a -> {-# UNPACK #-} !Int
1424− [A] [arrEnd] :: Array a -> {-# UNPACK #-} !Int
1425− [A] [arrContents] :: Array a -> {-# UNPACK #-} !MutByteArray
1426− [A] Array :: {-# UNPACK #-} !MutByteArray -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> Array a
1427− [A] writeWith :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
1428− [A] writeNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
1429− [R] writeNAligned :: forall m a. (MonadIO m, Unbox a) => Int -> Int -> Fold m a (Array a)
1430− [A] unsafeMakePure :: Monad m => Fold IO a b -> Fold m a b
1431− [A] unsafeIndexIO :: forall a. Unbox a => Int -> Array a -> IO a
1432− [D] unsafeIndex :: forall a. Unbox a => Int -> Array a -> a
1433− [A] unsafeFreezeWithShrink :: Unbox a => MutArray a -> Array a
1434− [A] unpin :: Array a -> IO (Array a)
1435− [A] toStreamKRev :: forall m a. (Monad m, Unbox a) => Array a -> StreamK m a
1436− [A] toStreamK :: forall m a. (Monad m, Unbox a) => Array a -> StreamK m a
1437− [A] toStreamDRev :: forall m a. (Monad m, Unbox a) => Array a -> Stream m a
1438− [A] toStreamD :: forall m a. (Monad m, Unbox a) => Array a -> Stream m a
1439− [A] splitAt :: Unbox a => Int -> Array a -> (Array a, Array a)
1440− [A] splice :: (MonadIO m, Unbox a) => Array a -> Array a -> m (Array a)
1441− [A] serialize :: Serialize a => a -> Array Word8
1442− [A] pinnedWriteNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
1443− [A] pinnedWriteNAligned :: forall m a. (MonadIO m, Unbox a) => Int -> Int -> Fold m a (Array a)
1444− [A] pinnedWriteN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
1445− [A] pinnedWrite :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
1446− [A] pinnedSerialize :: Serialize a => a -> Array Word8
1447− [A] pinnedFromListN :: Unbox a => Int -> [a] -> Array a
1448− [A] pinnedFromList :: Unbox a => [a] -> Array a
1449− [A] pinnedClone :: MonadIO m => Array a -> m (Array a)
1450− [A] pinnedChunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (Array a)
1451− [A] pin :: Array a -> IO (Array a)
1452− [A] nil :: Array a
1453− [A] isPinned :: Array a -> Bool
1454− [A] getIndexUnsafe :: forall a. Unbox a => Int -> Array a -> a
1455− [A] fromStreamDN :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> m (Array a)
1456− [A] fromStreamD :: forall m a. (MonadIO m, Unbox a) => Stream m a -> m (Array a)
1457− [A] fromPureStream :: Unbox a => Stream Identity a -> Array a
1458− [A] fromListRevN :: Unbox a => Int -> [a] -> Array a
1459− [A] fromListRev :: Unbox a => [a] -> Array a
1460− [A] fromByteStr# :: Addr# -> Array Word8
1461− [A] foldr :: Unbox a => (a -> b -> b) -> b -> Array a -> b
1462− [A] foldl' :: forall a b. Unbox a => (b -> a -> b) -> b -> Array a -> b
1463− [A] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
1464− [A] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
1465− [A] encodeAs :: forall a. Serialize a => PinnedState -> a -> Array Word8
1466− [A] deserialize :: Serialize a => Array Word8 -> a
1467− [A] clone :: MonadIO m => Array a -> m (Array a)
1468− [A] chunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (Array a)
1469− [A] byteLength :: Array a -> Int
1470− [A] bufferChunks :: (MonadIO m, Unbox a) => Stream m a -> m (StreamK m (Array a))
1471− [A] breakOn :: MonadIO m => Word8 -> Array Word8 -> m (Array Word8, Maybe (Array Word8))
core/docs/ApiChangelogs/0.1.0.txtdeleted−405
@@ -1,405 +0,0 @@
1−---------------------------------
2−Terminology
3−---------------------------------
4−
5−[A]: Added
6−[R]: Removed
7−[C]: Changed
8−[D]: Deprecated
9−[O]: Old
10−[N]: New
11−
12−---------------------------------
13−Difference
14−---------------------------------
15−
16−The moved modules have been compared with their version in streamly v0.8.3
17−
18−[A] Streamly.Unicode.String
19− [A] str :: QuasiQuoter
20−[C] Streamly.Unicode.Stream
21− [C] encodeUtf8'
22− [O] encodeUtf8' :: (Monad m, IsStream t) => t m Char -> t m Word8
23− [N] encodeUtf8' :: Monad m => Stream m Char -> Stream m Word8
24− [C] encodeUtf8
25− [O] encodeUtf8 :: (Monad m, IsStream t) => t m Char -> t m Word8
26− [N] encodeUtf8 :: Monad m => Stream m Char -> Stream m Word8
27− [C] encodeStrings
28− [O] encodeStrings :: (MonadIO m, IsStream t) => (SerialT m Char -> SerialT m Word8) -> t m String -> t m (Array Word8)
29− [N] encodeStrings :: MonadIO m => (Stream m Char -> Stream m Word8) -> Stream m String -> Stream m (Array Word8)
30− [C] encodeLatin1'
31− [O] encodeLatin1' :: (IsStream t, Monad m) => t m Char -> t m Word8
32− [N] encodeLatin1' :: Monad m => Stream m Char -> Stream m Word8
33− [C] encodeLatin1
34− [O] encodeLatin1 :: (IsStream t, Monad m) => t m Char -> t m Word8
35− [N] encodeLatin1 :: Monad m => Stream m Char -> Stream m Word8
36− [A] decodeUtf8Chunks :: MonadIO m => Stream m (Array Word8) -> Stream m Char
37− [C] decodeUtf8'
38− [O] decodeUtf8' :: (Monad m, IsStream t) => t m Word8 -> t m Char
39− [N] decodeUtf8' :: Monad m => Stream m Word8 -> Stream m Char
40− [C] decodeUtf8
41− [O] decodeUtf8 :: (Monad m, IsStream t) => t m Word8 -> t m Char
42− [N] decodeUtf8 :: Monad m => Stream m Word8 -> Stream m Char
43− [C] decodeLatin1
44− [O] decodeLatin1 :: (IsStream t, Monad m) => t m Word8 -> t m Char
45− [N] decodeLatin1 :: Monad m => Stream m Word8 -> Stream m Char
46−[A] Streamly.Unicode.Parser
47− [A] upper :: Monad m => Parser Char m Char
48− [A] symbol :: Monad m => Parser Char m Char
49− [A] stringIgnoreCase :: Monad m => String -> Parser Char m String
50− [A] string :: Monad m => String -> Parser Char m String
51− [A] space :: Monad m => Parser Char m Char
52− [A] signed :: (Num a, Monad m) => Parser Char m a -> Parser Char m a
53− [A] separator :: Monad m => Parser Char m Char
54− [A] punctuation :: Monad m => Parser Char m Char
55− [A] printable :: Monad m => Parser Char m Char
56− [A] octDigit :: Monad m => Parser Char m Char
57− [A] numeric :: Monad m => Parser Char m Char
58− [A] mark :: Monad m => Parser Char m Char
59− [A] lower :: Monad m => Parser Char m Char
60− [A] letter :: Monad m => Parser Char m Char
61− [A] latin1 :: Monad m => Parser Char m Char
62− [A] hexadecimal :: (Monad m, Integral a, Bits a) => Parser Char m a
63− [A] hexDigit :: Monad m => Parser Char m Char
64− [A] dropSpace1 :: Monad m => Parser Char m ()
65− [A] dropSpace :: Monad m => Parser Char m ()
66− [A] digit :: Monad m => Parser Char m Char
67− [A] decimal :: (Monad m, Integral a) => Parser Char m a
68− [A] charIgnoreCase :: Monad m => Char -> Parser Char m Char
69− [A] char :: Monad m => Char -> Parser Char m Char
70− [A] asciiUpper :: Monad m => Parser Char m Char
71− [A] asciiLower :: Monad m => Parser Char m Char
72− [A] ascii :: Monad m => Parser Char m Char
73− [A] alphaNum :: Monad m => Parser Char m Char
74− [A] alpha :: Monad m => Parser Char m Char
75−[C] Streamly.FileSystem.Handle
76− [D] writeWithBufferOf :: MonadIO m => Int -> Handle -> Fold m Word8 ()
77− [A] writeWith :: MonadIO m => Int -> Handle -> Fold m Word8 ()
78− [C] writeChunks
79− [O] writeChunks :: (MonadIO m, Storable a) => Handle -> Fold m (Array a) ()
80− [N] writeChunks :: MonadIO m => Handle -> Fold m (Array a) ()
81− [A] readerWith :: MonadIO m => Unfold m (Int, Handle) Word8
82− [A] reader :: MonadIO m => Unfold m Handle Word8
83− [D] readWithBufferOf :: MonadIO m => Unfold m (Int, Handle) Word8
84− [D] readChunksWithBufferOf :: MonadIO m => Unfold m (Int, Handle) (Array Word8)
85− [D] readChunks :: MonadIO m => Unfold m Handle (Array Word8)
86− [D] read :: MonadIO m => Unfold m Handle Word8
87− [C] putChunk
88− [O] putChunk :: (MonadIO m, Storable a) => Handle -> Array a -> m ()
89− [N] putChunk :: MonadIO m => Handle -> Array a -> m ()
90− [A] chunkReaderWith :: MonadIO m => Unfold m (Int, Handle) (Array Word8)
91− [A] chunkReader :: MonadIO m => Unfold m Handle (Array Word8)
92−[A] Streamly.FileSystem.File
93− [A] writeWith :: (MonadIO m, MonadCatch m) => Int -> FilePath -> Fold m Word8 ()
94− [A] writeChunks :: (MonadIO m, MonadCatch m) => FilePath -> Fold m (Array a) ()
95− [A] write :: (MonadIO m, MonadCatch m) => FilePath -> Fold m Word8 ()
96− [A] withFile :: (MonadIO m, MonadCatch m) => FilePath -> IOMode -> (Handle -> Stream m a) -> Stream m a
97− [A] readChunksWith :: (MonadIO m, MonadCatch m) => Int -> FilePath -> Stream m (Array Word8)
98− [A] readChunks :: (MonadIO m, MonadCatch m) => FilePath -> Stream m (Array Word8)
99− [A] read :: (MonadIO m, MonadCatch m) => FilePath -> Stream m Word8
100−[A] Streamly.FileSystem.Dir
101− [A] readEither :: MonadIO m => FilePath -> Stream m (Either FilePath FilePath)
102− [A] read :: MonadIO m => FilePath -> Stream m FilePath
103−[C] Streamly.Data.Unfold
104− [C] take
105− [O] take :: Monad m => Int -> Unfold m a b -> Unfold m a b
106− [N] take :: Applicative m => Int -> Unfold m a b -> Unfold m a b
107− [C] replicateM
108− [O] replicateM :: Monad m => Int -> Unfold m (m a) a
109− [N] replicateM :: Applicative m => Unfold m (Int, m a) a
110− [C] repeatM
111− [O] repeatM :: Monad m => Unfold m (m a) a
112− [N] repeatM :: Applicative m => Unfold m (m a) a
113− [C] many
114− [O] many :: Monad m => Unfold m a b -> Unfold m b c -> Unfold m a c
115− [N] many :: Monad m => Unfold m b c -> Unfold m a b -> Unfold m a c
116− [C] iterateM
117− [O] iterateM :: Monad m => (a -> m a) -> Unfold m (m a) a
118− [N] iterateM :: Applicative m => (a -> m a) -> Unfold m (m a) a
119− [C] fromStream
120− [O] fromStream :: (IsStream t, Monad m) => Unfold m (t m a) a
121− [N] fromStream :: Applicative m => Unfold m (Stream m a) a
122− [C] fromListM
123− [O] fromListM :: Monad m => Unfold m [m a] a
124− [N] fromListM :: Applicative m => Unfold m [m a] a
125− [C] fromList
126− [O] fromList :: Monad m => Unfold m [a] a
127− [N] fromList :: Applicative m => Unfold m [a] a
128− [C] drop
129− [O] drop :: Monad m => Int -> Unfold m a b -> Unfold m a b
130− [N] drop :: Applicative m => Int -> Unfold m a b -> Unfold m a b
131−[A] Streamly.Data.StreamK
132− [A] StreamK
133− [A] zipWithM :: Monad m => (a -> b -> m c) -> StreamK m a -> StreamK m b -> StreamK m c
134− [A] zipWith :: Monad m => (a -> b -> c) -> StreamK m a -> StreamK m b -> StreamK m c
135− [A] uncons :: Applicative m => StreamK m a -> m (Maybe (a, StreamK m a))
136− [A] toStream :: Applicative m => StreamK m a -> Stream m a
137− [A] sortBy :: Monad m => (a -> a -> Ordering) -> StreamK m a -> StreamK m a
138− [A] reverse :: StreamK m a -> StreamK m a
139− [A] parseChunks :: (Monad m, Unbox a) => ParserK a m b -> StreamK m (Array a) -> m (Either ParseError b)
140− [A] parseBreakChunks :: (Monad m, Unbox a) => ParserK a m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
141− [A] nilM :: Applicative m => m b -> StreamK m a
142− [A] nil :: StreamK m a
143− [A] mergeMapWith :: (StreamK m b -> StreamK m b -> StreamK m b) -> (a -> StreamK m b) -> StreamK m a -> StreamK m b
144− [A] mergeByM :: Monad m => (a -> a -> m Ordering) -> StreamK m a -> StreamK m a -> StreamK m a
145− [A] mergeBy :: (a -> a -> Ordering) -> StreamK m a -> StreamK m a -> StreamK m a
146− [A] interleave :: StreamK m a -> StreamK m a -> StreamK m a
147− [A] fromStream :: Monad m => Stream m a -> StreamK m a
148− [A] fromPure :: a -> StreamK m a
149− [A] fromFoldable :: Foldable f => f a -> StreamK m a
150− [A] fromEffect :: Monad m => m a -> StreamK m a
151− [A] crossWith :: Monad m => (a -> b -> c) -> StreamK m a -> StreamK m b -> StreamK m c
152− [A] consM :: Monad m => m a -> StreamK m a -> StreamK m a
153− [A] cons :: a -> StreamK m a -> StreamK m a
154− [A] concatMapWith :: (StreamK m b -> StreamK m b -> StreamK m b) -> (a -> StreamK m b) -> StreamK m a -> StreamK m b
155− [A] concatEffect :: Monad m => m (StreamK m a) -> StreamK m a
156− [A] append :: StreamK m a -> StreamK m a -> StreamK m a
157−[A] Streamly.Data.Stream
158− [A] class Enum a => Enumerable a
159− [A] Stream
160− [A] zipWithM :: Monad m => (a -> b -> m c) -> Stream m a -> Stream m b -> Stream m c
161− [A] zipWith :: Monad m => (a -> b -> c) -> Stream m a -> Stream m b -> Stream m c
162− [A] unfoldrM :: Monad m => (s -> m (Maybe (a, s))) -> s -> Stream m a
163− [A] unfoldr :: Monad m => (s -> Maybe (a, s)) -> s -> Stream m a
164− [A] unfoldMany :: Monad m => Unfold m a b -> Stream m a -> Stream m b
165− [A] unfold :: Applicative m => Unfold m a b -> a -> Stream m b
166− [A] uncons :: Monad m => Stream m a -> m (Maybe (a, Stream m a))
167− [A] trace :: Monad m => (a -> m b) -> Stream m a -> Stream m a
168− [A] toList :: Monad m => Stream m a -> m [a]
169− [A] tap :: Monad m => Fold m a b -> Stream m a -> Stream m a
170− [A] takeWhileM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
171− [A] takeWhile :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
172− [A] take :: Applicative m => Int -> Stream m a -> Stream m a
173− [A] stripPrefix :: (Monad m, Eq a) => Stream m a -> Stream m a -> m (Maybe (Stream m a))
174− [A] sequence :: Monad m => Stream m (m a) -> Stream m a
175− [A] scanMaybe :: Monad m => Fold m a (Maybe b) -> Stream m a -> Stream m b
176− [A] scan :: Monad m => Fold m a b -> Stream m a -> Stream m b
177− [A] runStateT :: Monad m => m s -> Stream (StateT s m) a -> Stream m (s, a)
178− [A] runReaderT :: Monad m => m s -> Stream (ReaderT s m) a -> Stream m a
179− [A] reverse :: Monad m => Stream m a -> Stream m a
180− [A] replicateM :: Monad m => Int -> m a -> Stream m a
181− [A] replicate :: Monad m => Int -> a -> Stream m a
182− [A] repeatM :: Monad m => m a -> Stream m a
183− [A] repeat :: Monad m => a -> Stream m a
184− [A] postscan :: Monad m => Fold m a b -> Stream m a -> Stream m b
185− [A] parseMany :: Monad m => Parser a m b -> Stream m a -> Stream m (Either ParseError b)
186− [A] parse :: Monad m => Parser a m b -> Stream m a -> m (Either ParseError b)
187− [A] onException :: MonadCatch m => m b -> Stream m a -> Stream m a
188− [A] nilM :: Applicative m => m b -> Stream m a
189− [A] nil :: Applicative m => Stream m a
190− [A] morphInner :: Monad n => (forall x. m x -> n x) -> Stream m a -> Stream n a
191− [A] mergeByM :: Monad m => (a -> a -> m Ordering) -> Stream m a -> Stream m a -> Stream m a
192− [A] mergeBy :: Monad m => (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a
193− [A] mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Stream m a -> Stream m b
194− [A] mapMaybe :: Monad m => (a -> Maybe b) -> Stream m a -> Stream m b
195− [A] mapM :: Monad m => (a -> m b) -> Stream m a -> Stream m b
196− [A] liftInner :: (Monad m, MonadTrans t, Monad (t m)) => Stream m a -> Stream (t m) a
197− [A] iterateM :: Monad m => (a -> m a) -> m a -> Stream m a
198− [A] iterate :: Monad m => (a -> a) -> a -> Stream m a
199− [A] isSubsequenceOf :: (Monad m, Eq a) => Stream m a -> Stream m a -> m Bool
200− [A] isPrefixOf :: (Monad m, Eq a) => Stream m a -> Stream m a -> m Bool
201− [A] intersperseM_ :: Monad m => m b -> Stream m a -> Stream m a
202− [A] intersperseM :: Monad m => m a -> Stream m a -> Stream m a
203− [A] intersperse :: Monad m => a -> Stream m a -> Stream m a
204− [A] interleave :: Monad m => Stream m a -> Stream m a -> Stream m a
205− [A] intercalateSuffix :: Monad m => Unfold m b c -> b -> Stream m b -> Stream m c
206− [A] intercalate :: Monad m => Unfold m b c -> b -> Stream m b -> Stream m c
207− [A] insertBy :: Monad m => (a -> a -> Ordering) -> a -> Stream m a -> Stream m a
208− [A] indexed :: Monad m => Stream m a -> Stream m (Int, a)
209− [A] handle :: (MonadCatch m, Exception e) => (e -> Stream m a) -> Stream m a -> Stream m a
210− [A] fromPure :: Applicative m => a -> Stream m a
211− [A] fromList :: Applicative m => [a] -> Stream m a
212− [A] fromEffect :: Applicative m => m a -> Stream m a
213− [A] foldrM :: Monad m => (a -> m b -> m b) -> m b -> Stream m a -> m b
214− [A] foldr :: Monad m => (a -> b -> b) -> b -> Stream m a -> m b
215− [A] foldMany :: Monad m => Fold m a b -> Stream m a -> Stream m b
216− [A] foldBreak :: Monad m => Fold m a b -> Stream m a -> m (b, Stream m a)
217− [A] fold :: Monad m => Fold m a b -> Stream m a -> m b
218− [A] finallyIO :: (MonadIO m, MonadCatch m) => IO b -> Stream m a -> Stream m a
219− [A] filterM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
220− [A] filter :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
221− [A] eqBy :: Monad m => (a -> b -> Bool) -> Stream m a -> Stream m b -> m Bool
222− [A] enumerateTo :: (Monad m, Bounded a, Enumerable a) => a -> Stream m a
223− [A] enumerateFromTo :: (Enumerable a, Monad m) => a -> a -> Stream m a
224− [A] enumerateFromThenTo :: (Enumerable a, Monad m) => a -> a -> a -> Stream m a
225− [A] enumerateFromThen :: (Enumerable a, Monad m) => a -> a -> Stream m a
226− [A] enumerateFrom :: (Enumerable a, Monad m) => a -> Stream m a
227− [A] enumerate :: (Monad m, Bounded a, Enumerable a) => Stream m a
228− [A] dropWhileM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
229− [A] dropWhile :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
230− [A] drop :: Monad m => Int -> Stream m a -> Stream m a
231− [A] delay :: MonadIO m => Double -> Stream m a -> Stream m a
232− [A] crossWith :: Monad m => (a -> b -> c) -> Stream m a -> Stream m b -> Stream m c
233− [A] consM :: Applicative m => m a -> Stream m a -> Stream m a
234− [A] cons :: Applicative m => a -> Stream m a -> Stream m a
235− [A] concatMapM :: Monad m => (a -> m (Stream m b)) -> Stream m a -> Stream m b
236− [A] concatMap :: Monad m => (a -> Stream m b) -> Stream m a -> Stream m b
237− [A] concatEffect :: Monad m => m (Stream m a) -> Stream m a
238− [A] cmpBy :: Monad m => (a -> b -> Ordering) -> Stream m a -> Stream m b -> m Ordering
239− [A] chunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (Array a)
240− [A] catRights :: Monad m => Stream m (Either a b) -> Stream m b
241− [A] catMaybes :: Monad m => Stream m (Maybe a) -> Stream m a
242− [A] catLefts :: Monad m => Stream m (Either a b) -> Stream m a
243− [A] catEithers :: Monad m => Stream m (Either a a) -> Stream m a
244− [A] bracketIO3 :: (MonadIO m, MonadCatch m) => IO b -> (b -> IO c) -> (b -> IO d) -> (b -> IO e) -> (b -> Stream m a) -> Stream m a
245− [A] bracketIO :: (MonadIO m, MonadCatch m) => IO b -> (b -> IO c) -> (b -> Stream m a) -> Stream m a
246− [A] before :: Monad m => m b -> Stream m a -> Stream m a
247− [A] append :: Monad m => Stream m a -> Stream m a -> Stream m a
248− [A] afterIO :: MonadIO m => IO b -> Stream m a -> Stream m a
249−[A] Streamly.Data.ParserK
250− [A] ParserK
251− [A] fromPure :: b -> ParserK a m b
252− [A] fromParser :: (Monad m, Unbox a) => Parser a m b -> ParserK a m b
253− [A] fromFold :: (MonadIO m, Unbox a) => Fold m a b -> ParserK a m b
254− [A] fromEffect :: Monad m => m b -> ParserK a m b
255− [A] die :: String -> ParserK a m b
256−[A] Streamly.Data.Parser
257− [A] Parser
258− [A] wordWithQuotes :: (Monad m, Eq a) => Bool -> (a -> a -> Maybe a) -> a -> (a -> Maybe a) -> (a -> Bool) -> Fold m a b -> Parser a m b
259− [A] wordBy :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
260− [A] takeWhile1 :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
261− [A] takeWhile :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
262− [A] takeEQ :: Monad m => Int -> Fold m a b -> Parser a m b
263− [A] streamEqBy :: Monad m => (a -> a -> Bool) -> Stream m a -> Parser a m ()
264− [A] some :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
265− [A] satisfy :: Monad m => (a -> Bool) -> Parser a m a
266− [A] rmapM :: Monad m => (b -> m c) -> Parser a m b -> Parser a m c
267− [A] peek :: Monad m => Parser a m a
268− [A] oneOf :: (Monad m, Eq a, Foldable f) => f a -> Parser a m a
269− [A] one :: Monad m => Parser a m a
270− [A] noneOf :: (Monad m, Eq a, Foldable f) => f a -> Parser a m a
271− [A] manyTill :: Monad m => Parser a m b -> Parser a m x -> Fold m b c -> Parser a m c
272− [A] many :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
273− [A] lookAhead :: Monad m => Parser a m b -> Parser a m b
274− [A] lmapM :: Monad m => (a -> m b) -> Parser b m r -> Parser a m r
275− [A] lmap :: (a -> b) -> Parser b m r -> Parser a m r
276− [A] listEqBy :: Monad m => (a -> a -> Bool) -> [a] -> Parser a m [a]
277− [A] listEq :: (Monad m, Eq a) => [a] -> Parser a m [a]
278− [A] groupBy :: Monad m => (a -> a -> Bool) -> Fold m a b -> Parser a m b
279− [A] fromPure :: Monad m => b -> Parser a m b
280− [A] fromFold :: Monad m => Fold m a b -> Parser a m b
281− [A] fromEffect :: Monad m => m b -> Parser a m b
282− [A] filter :: Monad m => (a -> Bool) -> Parser a m b -> Parser a m b
283− [A] eof :: Monad m => Parser a m ()
284− [A] dropWhile :: Monad m => (a -> Bool) -> Parser a m ()
285− [A] die :: Monad m => String -> Parser a m b
286− [A] deintercalate :: Monad m => Parser a m x -> Parser a m y -> Fold m (Either x y) z -> Parser a m z
287−[A] Streamly.Data.MutArray.Generic
288− [A] MutArray
289− [A] writeN :: MonadIO m => Int -> Fold m a (MutArray a)
290− [A] toList :: MonadIO m => MutArray a -> m [a]
291− [A] snoc :: MonadIO m => MutArray a -> a -> m (MutArray a)
292− [A] reader :: MonadIO m => Unfold m (MutArray a) a
293− [A] putIndex :: MonadIO m => Int -> MutArray a -> a -> m ()
294− [A] new :: forall m a. MonadIO m => Int -> m (MutArray a)
295− [A] modifyIndex :: MonadIO m => Int -> MutArray a -> (a -> (a, b)) -> m b
296− [A] getIndex :: MonadIO m => Int -> MutArray a -> m a
297−[A] Streamly.Data.MutArray
298− [A] class Unbox a
299− [A] MutArray
300− [A] writeN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
301− [A] writeAppendN :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
302− [A] writeAppend :: forall m a. (MonadIO m, Unbox a) => m (MutArray a) -> Fold m a (MutArray a)
303− [A] write :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
304− [A] toList :: forall m a. (MonadIO m, Unbox a) => MutArray a -> m [a]
305− [A] snoc :: forall m a. (MonadIO m, Unbox a) => MutArray a -> a -> m (MutArray a)
306− [A] sizeOf :: (Unbox a, SizeOfRep (Rep a)) => Proxy a -> Int
307− [A] readerRev :: forall m a. (MonadIO m, Unbox a) => Unfold m (MutArray a) a
308− [A] reader :: forall m a. (MonadIO m, Unbox a) => Unfold m (MutArray a) a
309− [A] putIndex :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> a -> m ()
310− [A] pokeByteIndex :: (Unbox a, Generic a, PokeRep (Rep a)) => Int -> MutableByteArray -> a -> IO ()
311− [A] peekByteIndex :: (Unbox a, Generic a, PeekRep (Rep a)) => Int -> MutableByteArray -> IO a
312− [A] newPinned :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
313− [A] new :: (MonadIO m, Unbox a) => Int -> m (MutArray a)
314− [A] length :: forall a. Unbox a => MutArray a -> Int
315− [A] getIndex :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m a
316− [A] fromListN :: (MonadIO m, Unbox a) => Int -> [a] -> m (MutArray a)
317− [A] fromList :: (MonadIO m, Unbox a) => [a] -> m (MutArray a)
318− [A] cast :: forall a b. Unbox b => MutArray a -> Maybe (MutArray b)
319− [A] asBytes :: MutArray a -> MutArray Word8
320−[C] Streamly.Data.Fold
321− [A] Tee
322− [A] [unTee] :: Tee m a b -> Fold m a b
323− [A] Tee :: Fold m a b -> Tee m a b
324− [D] variance :: (Monad m, Fractional a) => Fold m a a
325− [A] uniqBy :: Monad m => (a -> a -> Bool) -> Fold m a (Maybe a)
326− [A] topBy :: (MonadIO m, Unbox a) => (a -> a -> Ordering) -> Int -> Fold m a (MutArray a)
327− [A] toSet :: (Monad m, Ord a) => Fold m a (Set a)
328− [A] toMapIO :: (MonadIO m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (Map k b)
329− [A] toMap :: (Monad m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (Map k b)
330− [A] toIntSet :: Monad m => Fold m Int IntSet
331− [A] the :: (Monad m, Eq a) => Fold m a (Maybe a)
332− [D] stdDev :: (Monad m, Floating a) => Fold m a a
333− [A] splitWith :: Monad m => (a -> b -> c) -> Fold m x a -> Fold m x b -> Fold m x c
334− [D] serialWith :: Monad m => (a -> b -> c) -> Fold m x a -> Fold m x b -> Fold m x c
335− [A] scanMaybe :: Monad m => Fold m a (Maybe b) -> Fold m b c -> Fold m a c
336− [A] scan :: Monad m => Fold m a b -> Fold m b c -> Fold m a c
337− [A] postscan :: Monad m => Fold m a b -> Fold m b c -> Fold m a c
338− [A] one :: Monad m => Fold m a (Maybe a)
339− [A] nubInt :: Monad m => Fold m Int (Maybe Int)
340− [A] nub :: (Monad m, Ord a) => Fold m a (Maybe a)
341− [A] morphInner :: (forall x. m x -> n x) -> Fold m a b -> Fold n a b
342− [A] latest :: Monad m => Fold m a (Maybe a)
343− [D] last :: Monad m => Fold m a (Maybe a)
344− [D] head :: Monad m => Fold m a (Maybe a)
345− [A] groupsOf :: Monad m => Int -> Fold m a b -> Fold m b c -> Fold m a c
346− [A] frequency :: (Monad m, Ord a) => Fold m a (Map a Int)
347− [A] foldr' :: Monad m => (a -> b -> b) -> b -> Fold m a b
348− [D] foldr :: Monad m => (a -> b -> b) -> b -> Fold m a b
349− [A] foldlM1' :: Monad m => (a -> a -> m a) -> Fold m a (Maybe a)
350− [A] foldl1' :: Monad m => (a -> a -> a) -> Fold m a (Maybe a)
351− [A] findM :: Monad m => (a -> m Bool) -> Fold m a (Maybe a)
352− [A] findIndices :: Monad m => (a -> Bool) -> Fold m a (Maybe Int)
353− [A] elemIndices :: (Monad m, Eq a) => a -> Fold m a (Maybe Int)
354− [A] duplicate :: Monad m => Fold m a b -> Fold m a (Fold m a b)
355− [A] drive :: Monad m => Stream m a -> Fold m a b -> m b
356− [A] drainMapM :: Monad m => (a -> m b) -> Fold m a ()
357− [D] drainBy :: Monad m => (a -> m b) -> Fold m a ()
358− [A] demuxToMapIO :: (MonadIO m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (Map k b)
359− [A] demuxToMap :: (Monad m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (Map k b)
360− [A] demuxIO :: (MonadIO m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (m (Map k b), Maybe (k, b))
361− [A] demux :: (Monad m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (m (Map k b), Maybe (k, b))
362− [A] deleteBy :: Monad m => (a -> a -> Bool) -> a -> Fold m a (Maybe a)
363− [A] countDistinctInt :: Monad m => Fold m Int Int
364− [A] countDistinct :: (Monad m, Ord a) => Fold m a Int
365− [A] classifyIO :: (MonadIO m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (m (Map k b), Maybe (k, b))
366− [A] classify :: (Monad m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (m (Map k b), Maybe (k, b))
367− [D] chunksOf :: Monad m => Int -> Fold m a b -> Fold m b c -> Fold m a c
368− [A] catRights :: Monad m => Fold m b c -> Fold m (Either a b) c
369− [A] catLefts :: Monad m => Fold m a c -> Fold m (Either a b) c
370− [A] catEithers :: Fold m a b -> Fold m (Either a a) b
371− [A] addStream :: Monad m => Stream m a -> Fold m a b -> m (Fold m a b)
372− [A] addOne :: Monad m => a -> Fold m a b -> m (Fold m a b)
373−[A] Streamly.Data.Array.Generic
374− [A] Array
375− [A] writeN :: MonadIO m => Int -> Fold m a (Array a)
376− [A] write :: MonadIO m => Fold m a (Array a)
377− [A] reader :: Monad m => Unfold m (Array a) a
378− [A] readRev :: Monad m => Array a -> Stream m a
379− [A] read :: MonadIO m => Array a -> Stream m a
380− [A] length :: Array a -> Int
381− [A] fromListN :: Int -> [a] -> Array a
382− [A] fromList :: [a] -> Array a
383−[A] Streamly.Data.Array
384− [A] class Unbox a
385− [A] Array
386− [A] writeN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
387− [A] writeLastN :: (Storable a, Unbox a, MonadIO m) => Int -> Fold m a (Array a)
388− [A] write :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
389− [A] toList :: Unbox a => Array a -> [a]
390− [A] sizeOf :: (Unbox a, SizeOfRep (Rep a)) => Proxy a -> Int
391− [A] readerRev :: forall m a. (Monad m, Unbox a) => Unfold m (Array a) a
392− [A] reader :: forall m a. (Monad m, Unbox a) => Unfold m (Array a) a
393− [A] pokeByteIndex :: (Unbox a, Generic a, PokeRep (Rep a)) => Int -> MutableByteArray -> a -> IO ()
394− [A] peekByteIndex :: (Unbox a, Generic a, PeekRep (Rep a)) => Int -> MutableByteArray -> IO a
395− [A] length :: Unbox a => Array a -> Int
396− [A] getIndex :: forall a. Unbox a => Int -> Array a -> Maybe a
397− [A] fromListN :: Unbox a => Int -> [a] -> Array a
398− [A] fromList :: Unbox a => [a] -> Array a
399− [A] cast :: forall a b. Unbox b => Array a -> Maybe (Array b)
400− [A] asBytes :: Array a -> Array Word8
401−[C] Streamly.Console.Stdio
402− [A] reader :: MonadIO m => Unfold m () Word8
403− [D] readChunks :: MonadIO m => Unfold m () (Array Word8)
404− [D] read :: MonadIO m => Unfold m () Word8
405− [A] chunkReader :: MonadIO m => Unfold m () (Array Word8)
core/docs/ApiChangelogs/0.2.0-0.2.2.txtdeleted−306
@@ -1,306 +0,0 @@
1−---------------------------------
2−API Annotations
3−---------------------------------
4−
5−[A] : Added
6−[R] : Removed
7−[C] : Changed
8−[O] : Old definition
9−[N] : New definition
10−[D] : Deprecated
11−
12−---------------------------------
13−API diff
14−---------------------------------
15−
16−[C] Streamly.Data.Stream
17− [A] (FixityR,5)
18− [A] (FixityR,5)
19−[C] Streamly.Data.MutArray.Generic
20− [A] emptyOf :: MonadIO m => Int -> m (MutArray a)
21− [A] createOf :: MonadIO m => Int -> Fold m a (MutArray a)
22− [A] create :: MonadIO m => Fold m a (MutArray a)
23−[C] Streamly.Data.MutArray
24− [A] pinnedEmptyOf :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
25− [A] emptyOf :: (MonadIO m, Unbox a) => Int -> m (MutArray a)
26− [A] createOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
27− [A] create :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
28− [A] appendN :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
29− [A] append :: forall m a. (MonadIO m, Unbox a) => m (MutArray a) -> Fold m a (MutArray a)
30−[C] Streamly.Data.Array.Generic
31− [A] createOf :: MonadIO m => Int -> Fold m a (Array a)
32− [A] create :: MonadIO m => Fold m a (Array a)
33−[C] Streamly.Data.Array
34− [A] class Serialize a
35− [A] serializeAt :: Serialize a => Int -> MutByteArray -> a -> IO Int
36− [A] pinnedSerialize :: Serialize a => a -> Array Word8
37− [A] deserializeAt :: Serialize a => Int -> MutByteArray -> Int -> IO (Int, a)
38− [A] deserialize :: Serialize a => Array Word8 -> a
39− [A] createOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
40− [A] create :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
41− [A] addSizeTo :: Serialize a => Int -> a -> Int
42−
43−---------------------------------
44−Internal API diff
45−---------------------------------
46−
47−[C] Streamly.Internal.Unicode.Stream
48− [A] encodeUtf16le' :: Stream m Char -> Stream m Word16
49− [A] decodeUtf16le' :: Stream m Word16 -> Stream m Char
50−[A] Streamly.Internal.FileSystem.Path
51− [A] class IsPath a
52− [A] Rel
53− [A] File
54− [A] Dir
55− [A] Abs
56− [A] Streamly.Internal.FileSystem.Path.IsPath
57− [A] instance Streamly.Internal.FileSystem.Path.IsPath Streamly.Internal.FileSystem.Path.Path
58− [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Rel Streamly.Internal.FileSystem.Path.Path)
59− [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Rel (Streamly.Internal.FileSystem.Path.File Streamly.Internal.FileSystem.Path.Path))
60− [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Rel (Streamly.Internal.FileSystem.Path.Dir Streamly.Internal.FileSystem.Path.Path))
61− [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.File Streamly.Internal.FileSystem.Path.Path)
62− [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Dir Streamly.Internal.FileSystem.Path.Path)
63− [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Abs Streamly.Internal.FileSystem.Path.Path)
64− [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Abs (Streamly.Internal.FileSystem.Path.File Streamly.Internal.FileSystem.Path.Path))
65− [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Abs (Streamly.Internal.FileSystem.Path.Dir Streamly.Internal.FileSystem.Path.Path))
66− [A] GHC.Show.Show
67− [A] instance GHC.Show.Show Streamly.Internal.FileSystem.Path.PathException
68− [A] GHC.Exception.Type.Exception
69− [A] instance GHC.Exception.Type.Exception Streamly.Internal.FileSystem.Path.PathException
70− [A] GHC.Classes.Eq
71− [A] instance GHC.Classes.Eq Streamly.Internal.FileSystem.Path.PathException
72− [A] Path
73− [A] Path :: Array Word8 -> Path
74− [A] toString :: Path -> [Char]
75− [A] toPath :: IsPath a => a -> Path
76− [A] toChunk :: Path -> Array Word8
77− [A] toChars :: Monad m => Path -> Stream m Char
78− [A] relfile :: QuasiQuoter
79− [A] reldir :: QuasiQuoter
80− [A] rel :: QuasiQuoter
81− [A] primarySeparator :: Char
82− [A] path :: QuasiQuoter
83− [A] mkRelFile :: String -> Q Exp
84− [A] mkRelDir :: String -> Q Exp
85− [A] mkRel :: String -> Q Exp
86− [A] mkPath :: String -> Q Exp
87− [A] mkFile :: String -> Q Exp
88− [A] mkDir :: String -> Q Exp
89− [A] mkAbsFile :: String -> Q Exp
90− [A] mkAbsDir :: String -> Q Exp
91− [A] mkAbs :: String -> Q Exp
92− [A] isSeparator :: Char -> Bool
93− [A] fromString :: MonadThrow m => [Char] -> m Path
94− [A] fromPathUnsafe :: IsPath a => Path -> a
95− [A] fromPath :: (IsPath a, MonadThrow m) => Path -> m a
96− [A] fromChunkUnsafe :: Array Word8 -> Path
97− [A] fromChunk :: MonadThrow m => Array Word8 -> m Path
98− [A] fromChars :: MonadThrow m => Stream Identity Char -> m Path
99− [A] file :: QuasiQuoter
100− [A] extendPath :: Path -> Path -> Path
101− [A] extendDir :: (IsPath (a (Dir Path)), IsPath b, IsPath (a b)) => a (Dir Path) -> Rel b -> a b
102− [A] dir :: QuasiQuoter
103− [A] adaptPath :: (MonadThrow m, IsPath a, IsPath b) => a -> m b
104− [A] absfile :: QuasiQuoter
105− [A] absdir :: QuasiQuoter
106− [A] abs :: QuasiQuoter
107−[C] Streamly.Internal.Data.Stream
108− [A] (FixityR,5)
109− [A] (FixityR,5)
110− [C] splitInnerBySuffix
111− [O] splitInnerBySuffix :: (Monad m, Eq (f a), Monoid (f a)) => (f a -> m (f a, Maybe (f a))) -> (f a -> f a -> m (f a)) -> Stream m (f a) -> Stream m (f a)
112− [N] splitInnerBySuffix :: Monad m => (f a -> Bool) -> (f a -> m (f a, Maybe (f a))) -> (f a -> f a -> m (f a)) -> Stream m (f a) -> Stream m (f a)
113− [D] sliceOnSuffix :: Monad m => (a -> Bool) -> Stream m a -> Stream m (Int, Int)
114− [A] indexOnSuffix :: Monad m => (a -> Bool) -> Stream m a -> Stream m (Int, Int)
115−[C] Streamly.Internal.Data.MutByteArray
116− [A] unsafePinnedAsPtr :: MonadIO m => MutByteArray -> (Ptr a -> m b) -> m b
117− [A] unsafeAsPtr :: MonadIO m => MutByteArray -> (Ptr a -> m b) -> m b
118− [D] nil :: MutByteArray
119− [A] empty :: MutByteArray
120− [D] asPtrUnsafe :: MonadIO m => MutByteArray -> (Ptr a -> m b) -> m b
121−[D] Streamly.Internal.Data.MutArray.Stream
122− [D] writeChunks :: (MonadIO m, Unbox a) => Int -> Fold m a (StreamK n (MutArray a))
123− [D] fromArrayStreamK :: (Unbox a, MonadIO m) => StreamK m (MutArray a) -> m (MutArray a)
124− [D] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
125− [D] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
126−[C] Streamly.Internal.Data.MutArray.Generic
127− [D] writeWith :: MonadIO m => Int -> Fold m a (MutArray a)
128− [D] writeNUnsafe :: MonadIO m => Int -> Fold m a (MutArray a)
129− [A] unsafeCreateOf :: MonadIO m => Int -> Fold m a (MutArray a)
130− [A] emptyOf :: MonadIO m => Int -> m (MutArray a)
131− [A] createWith :: MonadIO m => Int -> Fold m a (MutArray a)
132− [A] createOf :: MonadIO m => Int -> Fold m a (MutArray a)
133− [A] create :: MonadIO m => Fold m a (MutArray a)
134−[C] Streamly.Internal.Data.MutArray
135− [A] SpliceState
136− [A] SpliceYielding :: arr -> SpliceState s arr -> SpliceState s arr
137− [A] SpliceInitial :: s -> SpliceState s arr
138− [A] SpliceFinish :: SpliceState s arr
139− [A] SpliceBuffering :: s -> arr -> SpliceState s arr
140− [R] MutByteArray
141− [D] writeWith :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
142− [D] writeRevN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
143− [D] writeNWithUnsafe :: forall m a. (MonadIO m, Unbox a) => (Int -> m (MutArray a)) -> Int -> Fold m a (MutArray a)
144− [D] writeNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
145− [D] writeChunks :: (MonadIO m, Unbox a) => Int -> Fold m a (StreamK n (MutArray a))
146− [D] writeAppendWith :: forall m a. (MonadIO m, Unbox a) => (Int -> Int) -> m (MutArray a) -> Fold m a (MutArray a)
147− [D] writeAppendNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
148− [A] unsafePinnedCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
149− [A] unsafePinnedAsPtr :: MonadIO m => MutArray a -> (Ptr a -> m b) -> m b
150− [A] unsafeCreateOfWith :: forall m a. (MonadIO m, Unbox a) => (Int -> m (MutArray a)) -> Int -> Fold m a (MutArray a)
151− [A] unsafeCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
152− [A] unsafeAsPtr :: MonadIO m => MutArray a -> (Ptr a -> m b) -> m b
153− [A] unsafeAppendN :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
154− [A] toStreamWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> Stream m a
155− [A] toStreamRevWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> Stream m a
156− [R] toStreamDWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> Stream m a
157− [R] toStreamDRevWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> Stream m a
158− [A] slicerFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (MutArray a) (MutArray a)
159− [A] sliceIndexerFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (MutArray a) (Int, Int)
160− [A] revCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
161− [D] resizeExp :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
162− [D] resize :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
163− [A] pokeSkipUnsafe :: Int -> MutArray Word8 -> MutArray Word8
164− [A] pokeAppendMay :: forall m a. (MonadIO m, Unbox a) => MutArray Word8 -> a -> m (Maybe (MutArray Word8))
165− [A] pokeAppend :: forall m a. (MonadIO m, Unbox a) => MutArray Word8 -> a -> m (MutArray Word8)
166− [D] pinnedWriteNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
167− [D] pinnedWriteN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
168− [D] pinnedWrite :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
169− [D] pinnedNewBytes :: MonadIO m => Int -> m (MutArray a)
170− [A] pinnedEmptyOf :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
171− [A] pinnedCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
172− [A] pinnedCreate :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
173− [A] pinnedCompactLE :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (MutArray a)
174− [A] peekUnconsUnsafe :: forall m a. (MonadIO m, Unbox a) => MutArray Word8 -> m (a, MutArray Word8)
175− [A] peekUncons :: forall m a. (MonadIO m, Unbox a) => MutArray Word8 -> m (Maybe a, MutArray Word8)
176− [A] peekSkipUnsafe :: Int -> MutArray Word8 -> MutArray Word8
177− [A] pPinnedCompactLE :: forall m a. (MonadIO m, Unbox a) => Int -> Parser (MutArray a) m (MutArray a)
178− [A] pCompactLE :: forall m a. (MonadIO m, Unbox a) => Int -> Parser (MutArray a) m (MutArray a)
179− [D] nil :: MutArray a
180− [A] lPinnedCompactGE :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m (MutArray a) () -> Fold m (MutArray a) ()
181− [A] lCompactGE :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m (MutArray a) () -> Fold m (MutArray a) ()
182− [A] indexReaderWith :: (Monad m, Unbox a) => (forall b. IO b -> m b) -> Stream m Int -> Unfold m (MutArray a) a
183− [A] indexReader :: (MonadIO m, Unbox a) => Stream m Int -> Unfold m (MutArray a) a
184− [A] growExp :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
185− [A] grow :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
186− [D] getSlicesFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (MutArray a) (MutArray a)
187− [R] getIndicesD :: (Monad m, Unbox a) => (forall b. IO b -> m b) -> Stream m Int -> Unfold m (MutArray a) a
188− [D] getIndices :: (MonadIO m, Unbox a) => Stream m Int -> Unfold m (MutArray a) a
189− [D] genSlicesFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (MutArray a) (Int, Int)
190− [A] fromStreamN :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> m (MutArray a)
191− [D] fromStreamDN :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> m (MutArray a)
192− [D] fromStreamD :: (MonadIO m, Unbox a) => Stream m a -> m (MutArray a)
193− [A] fromPureStreamN :: (MonadIO m, Unbox a) => Int -> Stream Identity a -> m (MutArray a)
194− [A] fromPtrN :: MonadIO m => Int -> Ptr Word8 -> m (MutArray Word8)
195− [A] fromChunksRealloced :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> m (MutArray a)
196− [A] fromChunksK :: (Unbox a, MonadIO m) => StreamK m (MutArray a) -> m (MutArray a)
197− [A] fromByteStr# :: MonadIO m => Addr# -> m (MutArray Word8)
198− [D] fromArrayStreamK :: (Unbox a, MonadIO m) => StreamK m (MutArray a) -> m (MutArray a)
199− [D] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
200− [D] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
201− [A] fPinnedCompactGE :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m (MutArray a) (MutArray a)
202− [A] fCompactGE :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m (MutArray a) (MutArray a)
203− [A] emptyOf :: (MonadIO m, Unbox a) => Int -> m (MutArray a)
204− [A] empty :: MutArray a
205− [A] createWith :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
206− [A] createOfWith :: forall m a. (MonadIO m, Unbox a) => (Int -> m (MutArray a)) -> Int -> Fold m a (MutArray a)
207− [A] createOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
208− [A] create :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
209− [A] concatWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> Stream m (MutArray a) -> Stream m a
210− [A] concatRevWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> Stream m (MutArray a) -> Stream m a
211− [A] concatRev :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
212− [A] concat :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
213− [A] compactOnByteSuffix :: MonadIO m => Word8 -> Stream m (MutArray Word8) -> Stream m (MutArray Word8)
214− [A] compactOnByte :: MonadIO m => Word8 -> Stream m (MutArray Word8) -> Stream m (MutArray Word8)
215− [A] compactLeAs :: forall m a. (MonadIO m, Unbox a) => PinnedState -> Int -> Stream m (MutArray a) -> Stream m (MutArray a)
216− [A] compactLE :: (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (MutArray a)
217− [A] compactGE :: (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (MutArray a)
218− [A] compactEQ :: Int -> Stream m (MutArray a) -> Stream m (MutArray a)
219− [D] cmp :: MonadIO m => MutArray a -> MutArray a -> m Ordering
220− [A] byteEq :: MonadIO m => MutArray a -> MutArray a -> m Bool
221− [A] byteCmp :: MonadIO m => MutArray a -> MutArray a -> m Ordering
222− [A] buildChunks :: (MonadIO m, Unbox a) => Int -> Fold m a (StreamK n (MutArray a))
223− [D] asPtrUnsafe :: MonadIO m => MutArray a -> (Ptr a -> m b) -> m b
224− [A] appendWith :: forall m a. (MonadIO m, Unbox a) => (Int -> Int) -> m (MutArray a) -> Fold m a (MutArray a)
225− [A] appendN :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
226− [A] append :: forall m a. (MonadIO m, Unbox a) => m (MutArray a) -> Fold m a (MutArray a)
227−[D] Streamly.Internal.Data.Array.Stream
228− [C] interposeSuffix
229− [O] interposeSuffix :: (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
230− [N] interposeSuffix :: forall m a. (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
231− [D] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
232− [D] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
233− [C] concatRev
234− [O] concatRev :: (Monad m, Unbox a) => Stream m (Array a) -> Stream m a
235− [N] concatRev :: forall m a. (Monad m, Unbox a) => Stream m (Array a) -> Stream m a
236− [D] bufferChunks :: (MonadIO m, Unbox a) => Stream m a -> m (StreamK m (Array a))
237−[C] Streamly.Internal.Data.Array.Generic
238− [A] createOf :: MonadIO m => Int -> Fold m a (Array a)
239− [A] create :: MonadIO m => Fold m a (Array a)
240−[C] Streamly.Internal.Data.Array
241− [R] ArrayUnsafe
242− [D] writeWith :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
243− [D] writeNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
244− [A] unsafePinnedCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
245− [A] unsafePinnedAsPtr :: MonadIO m => Array a -> (Ptr a -> m b) -> m b
246− [A] unsafeCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
247− [D] toStreamDRev :: forall m a. (Monad m, Unbox a) => Array a -> Stream m a
248− [D] toStreamD :: forall m a. (Monad m, Unbox a) => Array a -> Stream m a
249− [C] splice
250− [O] splice :: (MonadIO m, Unbox a) => Array a -> Array a -> m (Array a)
251− [N] splice :: MonadIO m => Array a -> Array a -> m (Array a)
252− [A] slicerFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (Array a) (Array a)
253− [A] sliceIndexerFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (Array a) (Int, Int)
254− [D] pinnedWriteNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
255− [D] pinnedWriteNAligned :: forall m a. (MonadIO m, Unbox a) => Int -> Int -> Fold m a (Array a)
256− [D] pinnedWriteN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
257− [D] pinnedWrite :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
258− [A] pinnedCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
259− [A] pinnedCreate :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
260− [A] pinnedCompactLE :: (MonadIO m, Unbox a) => Int -> Stream m (Array a) -> Stream m (Array a)
261− [A] parseBreakChunksK :: forall m a b. (MonadIO m, Unbox a) => Parser a m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
262− [D] nil :: Array a
263− [A] lPinnedCompactGE :: (MonadIO m, Unbox a) => Int -> Fold m (Array a) () -> Fold m (Array a) ()
264− [A] lCompactGE :: (MonadIO m, Unbox a) => Int -> Fold m (Array a) () -> Fold m (Array a) ()
265− [A] interposeSuffix :: forall m a. (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
266− [A] interpose :: (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
267− [A] intercalateSuffix :: (Monad m, Unbox a) => Array a -> Stream m (Array a) -> Stream m a
268− [A] indexReaderFromThenTo :: Unfold m (Int, Int, Int, Array a) a
269− [A] indexReader :: (Monad m, Unbox a) => Stream m Int -> Unfold m (Array a) a
270− [A] indexFinder :: (a -> Bool) -> Unfold Identity (Array a) Int
271− [D] getSlicesFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (Array a) (Array a)
272− [R] getIndicesFromThenTo :: Unfold m (Int, Int, Int, Array a) a
273− [D] getIndices :: (Monad m, Unbox a) => Stream m Int -> Unfold m (Array a) a
274− [D] genSlicesFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (Array a) (Int, Int)
275− [D] fromStreamDN :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> m (Array a)
276− [D] fromStreamD :: forall m a. (MonadIO m, Unbox a) => Stream m a -> m (Array a)
277− [A] fromPureStreamN :: Unbox a => Int -> Stream Identity a -> Array a
278− [A] fromPtrN :: Int -> Ptr Word8 -> Array Word8
279− [A] fromChunksK :: (MonadIO m, Unbox a) => StreamK m (Array a) -> m (Array a)
280− [A] fromChunks :: (MonadIO m, Unbox a) => Stream m (Array a) -> m (Array a)
281− [A] fromByteStr :: Ptr Word8 -> Array Word8
282− [A] foldChunks :: (MonadIO m, Unbox a) => Fold m a b -> Stream m (Array a) -> m b
283− [A] foldBreakChunksK :: forall m a b. (MonadIO m, Unbox a) => Fold m a b -> StreamK m (Array a) -> m (b, StreamK m (Array a))
284− [A] foldBreakChunks :: forall m a b. (MonadIO m, Unbox a) => Fold m a b -> Stream m (Array a) -> m (b, Stream m (Array a))
285− [D] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
286− [D] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
287− [C] findIndicesOf
288− [O] findIndicesOf :: (a -> Bool) -> Unfold Identity (Array a) Int
289− [N] findIndicesOf :: (a -> Bool) -> Array a -> Stream Identity Int
290− [A] fPinnedCompactGE :: (MonadIO m, Unbox a) => Int -> Fold m (Array a) (Array a)
291− [A] fCompactGE :: (MonadIO m, Unbox a) => Int -> Fold m (Array a) (Array a)
292− [A] empty :: Array a
293− [A] createWith :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
294− [A] createOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
295− [A] create :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
296− [A] concatRev :: forall m a. (Monad m, Unbox a) => Stream m (Array a) -> Stream m a
297− [A] concat :: (Monad m, Unbox a) => Stream m (Array a) -> Stream m a
298− [A] compactOnByteSuffix :: MonadIO m => Word8 -> Stream m (Array Word8) -> Stream m (Array Word8)
299− [A] compactOnByte :: MonadIO m => Word8 -> Stream m (Array Word8) -> Stream m (Array Word8)
300− [A] compactLE :: (MonadIO m, Unbox a) => Int -> Stream m (Array a) -> Stream m (Array a)
301− [A] compactGE :: (MonadIO m, Unbox a) => Int -> Stream m (Array a) -> Stream m (Array a)
302− [A] byteEq :: Array a -> Array a -> Bool
303− [A] byteCmp :: Array a -> Array a -> Ordering
304− [A] buildChunks :: (MonadIO m, Unbox a) => Stream m a -> m (StreamK m (Array a))
305− [D] bufferChunks :: (MonadIO m, Unbox a) => Stream m a -> m (StreamK m (Array a))
306− [D] asPtrUnsafe :: MonadIO m => Array a -> (Ptr a -> m b) -> m b
core/docs/Changelog.mddeleted−97
@@ -1,97 +0,0 @@
1−# Changelog
2−
3−## 0.2.2 (Jan 2024)
4−
5−* Add fixities `infixr 5` for `cons` and `consM` functions.
6−* Fix a bug in Array `Eq` instance when the type is a sum type with
7− differently sized constructors.
8−* lpackArraysChunksOf, compact, writeChunksWith, putChunksWith now take the
9− buffer size in number of array elements instead of bytes.
10−
11−## 0.2.1 (Dec 2023)
12−
13−* Make the serialization of the unit constructor deterministic.
14−* Expose `pinnedSerialize` & `deserialize` via `Streamly.Data.Array`.
15−
16−## 0.2.0 (Nov 2023)
17−
18−See [0.1.0-0.2.0 API Changelog](https://github.com/composewell/streamly/blob/streamly-0.10.0/core/docs/ApiChangelogs/0.1.0-0.2.0.txt)
19−for a full list of API changes in this release. Only a few significant
20−changes are mentioned here.
21−
22−### Breaking Changes
23−
24−* `ParserK` in `Streamly.Data.ParserK` is not implicitly specialized
25− to arrays anymore. To adapt to the new code, change `ParserK a m
26− b` to `ParserK (Array a) m b` where the `Array` type comes from
27− `Streamly.Data.Array`. This change also affected the signatures of
28− `parseChunks` and `parseBreakChunks`.
29−* Changed the signature of 'Streamly.Data.Stream.handle' to make the
30− exception handler monadic.
31−* Behavior change: Exceptions are now rethrown promptly in `bracketIO`.
32−
33−### Enhancements
34−
35−* __Serialization__: Added a `Streamly.Data.MutByteArray` module with a
36− `Serialize` type class for fast binary serialization. The Data.Array
37− module supplies the `serialize` and `deserialize` operations for arrays.
38−* __Unpinned Arrays__: Unboxed arrays are now created unpinned by default,
39− they were created pinned earlier. During IO operations, unpinned arrays
40− are automatically copied to pinned memory. When arrays are directly
41− passed to IO operations programmers can choose to create them pinned to
42− avoid a copy. To create pinned arrays, use the internal APIs with the
43− `pinned*` prefix.
44−* StreamK now supports native exception handling routines (handle, bracketIO).
45− Earlier we had to convert it to the `Stream` type for exception handling.
46−
47−### Deprecations
48−
49−See [0.1.0-0.2.0 API Changelog](https://github.com/composewell/streamly/blob/streamly-0.10.0/core/docs/ApiChangelogs/0.1.0-0.2.0.txt)
50−for a full list of deprecations.
51−
52−### Internal API Changes
53−
54−* Fold constructor has changed, added a `final` field to support
55− finalization and cleanup of a chain of folds. The `extract` field is
56− now used only for mapping the fold internal state to fold result for
57− scanning purposes. If your fold does not require cleanup you can just use
58− your existing `extract` function as `final` as well to adapt to this change.
59−* Many low level internal modules have been removed, they are entirely
60− exported from higher level internal modules. If you were importing any
61− of the missing low level modules then import the higher level modules instead.
62−* Internal module changes:
63− * Streamly.Internal.Serialize.FromBytes -> Streamly.Internal.Data.Binary.Parser
64− * Streamly.Internal.Serialize.ToBytes -> Streamly.Internal.Data.Binary.Stream
65− * Streamly.Internal.Data.Unbox is now exported via Streamly.Internal.Data.Serialize
66− * Streamly.Internal.Data.IORef.Unboxed is now exported via Streamly.Internal.Data.Serialize
67−
68−## 0.1.0 (March 2023)
69−
70−Also see [streamly-core-0.1.0 API Changelog](https://github.com/composewell/streamly/blob/streamly-0.10.0/core/docs/ApiChangelogs/0.1.0.txt) or
71−https://hackage.haskell.org/package/streamly-core-0.1.0/docs/docs/ApiChangelogs/0.1.0.txt
72−
73−`streamly` package is split into two packages, (1) `streamly-core` that
74−has only GHC boot library depdendecies, and (2) `streamly` that contains
75−higher level operations (including concurrent ones) with additional
76−dependencies.
77−
78−* Moved the following modules from `streamly` package to the
79− `streamly-core` package:
80− * Streamly.Console.Stdio
81− * Streamly.Data.Fold
82− * Streamly.Data.Unfold
83− * Streamly.FileSystem.Handle
84− * Streamly.Unicode.Stream
85−* Added the following new modules:
86− * Streamly.Data.Array
87− * Streamly.Data.Array.Generic
88− * Streamly.Data.MutArray
89− * Streamly.Data.MutArray.Generic
90− * Streamly.Data.Parser
91− * Streamly.Data.ParserK
92− * Streamly.Data.Stream
93− * Streamly.Data.StreamK
94− * Streamly.FileSystem.Dir
95− * Streamly.FileSystem.File
96− * Streamly.Unicode.Parser
97− * Streamly.Unicode.String
core/docs/Readme.mddeleted−1
@@ -1 +0,0 @@
1−Please refer to the "streamly" package for tutorials and other documentation.
core/src/DocTestDataArray.hsdeleted−22
@@ -1,22 +0,0 @@
1−{- $setup
2−>>> :m
3−>>> :set -XFlexibleContexts
4−>>> :set -XMagicHash
5−>>> import Data.Function ((&))
6−>>> import Data.Functor.Identity (Identity(..))
7−>>> import System.IO.Unsafe (unsafePerformIO)
8−
9−>>> import Streamly.Data.Array (Array)
10−>>> import Streamly.Data.Stream (Stream)
11−
12−>>> import qualified Streamly.Data.Array as Array
13−>>> import qualified Streamly.Data.Fold as Fold
14−>>> import qualified Streamly.Data.ParserK as ParserK
15−>>> import qualified Streamly.Data.Stream as Stream
16−>>> import qualified Streamly.Data.StreamK as StreamK
17−
18−For APIs that have not been released yet.
19−
20−>>> import qualified Streamly.Internal.Data.Array as Array
21−>>> import qualified Streamly.Internal.Data.Stream as Stream
22−-}
core/src/DocTestDataFold.hsdeleted−27
@@ -1,27 +0,0 @@
1−{- $setup
2−>>> :m
3−>>> :set -XFlexibleContexts
4−>>> import Control.Monad (void)
5−>>> import qualified Data.Foldable as Foldable
6−>>> import Data.Function ((&))
7−>>> import Data.Functor.Identity (Identity, runIdentity)
8−>>> import Data.IORef (newIORef, readIORef, writeIORef)
9−>>> import Data.Maybe (fromJust, isJust)
10−>>> import Data.Monoid (Endo(..), Last(..), Sum(..))
11−
12−>>> import Streamly.Data.Array (Array)
13−>>> import Streamly.Data.Fold (Fold, Tee(..))
14−>>> import Streamly.Data.Stream (Stream)
15−
16−>>> import qualified Streamly.Data.Array as Array
17−>>> import qualified Streamly.Data.Fold as Fold
18−>>> import qualified Streamly.Data.MutArray as MutArray
19−>>> import qualified Streamly.Data.Parser as Parser
20−>>> import qualified Streamly.Data.Stream as Stream
21−>>> import qualified Streamly.Data.StreamK as StreamK
22−>>> import qualified Streamly.Data.Unfold as Unfold
23−
24−For APIs that have not been released yet.
25−
26−>>> import qualified Streamly.Internal.Data.Fold as Fold
27−-}
core/src/DocTestDataMutArray.hsdeleted−10
@@ -1,10 +0,0 @@
1−{- $setup
2−>>> :m
3−>>> import qualified Streamly.Data.Fold as Fold
4−>>> import qualified Streamly.Data.MutArray as MutArray
5−>>> import qualified Streamly.Data.Stream as Stream
6−
7−For APIs that have not been released yet.
8−
9−>>> import Streamly.Internal.Data.MutArray as MutArray
10−-}
core/src/DocTestDataMutArrayGeneric.hsdeleted−10
@@ -1,10 +0,0 @@
1−{- $setup
2−>>> :m
3−>>> import qualified Streamly.Data.Fold as Fold
4−>>> import qualified Streamly.Data.MutArray.Generic as MutArray
5−>>> import qualified Streamly.Data.Stream as Stream
6−
7−For APIs that have not been released yet.
8−
9−>>> import Streamly.Internal.Data.MutArray.Generic as MutArray
10−-}
core/src/DocTestDataParser.hsdeleted−20
@@ -1,20 +0,0 @@
1−{- $setup
2−>>> :m
3−>>> import Control.Applicative ((<|>))
4−>>> import Data.Bifunctor (second)
5−>>> import Data.Char (isSpace)
6−>>> import qualified Data.Foldable as Foldable
7−>>> import qualified Data.Maybe as Maybe
8−
9−>>> import Streamly.Data.Fold (Fold)
10−>>> import Streamly.Data.Parser (Parser)
11−
12−>>> import qualified Streamly.Data.Fold as Fold
13−>>> import qualified Streamly.Data.Parser as Parser
14−>>> import qualified Streamly.Data.Stream as Stream
15−
16−For APIs that have not been released yet.
17−
18−>>> import qualified Streamly.Internal.Data.Fold as Fold
19−>>> import qualified Streamly.Internal.Data.Parser as Parser
20−-}
core/src/DocTestDataParserK.hsdeleted−15
@@ -1,15 +0,0 @@
1−{- $setup
2−>>> :m
3−>>> import Control.Applicative ((<|>))
4−>>> import Data.Char (isDigit, isAlpha)
5−
6−>>> import Streamly.Data.Parser (Parser)
7−>>> import Streamly.Data.ParserK (ParserK)
8−
9−>>> import qualified Streamly.Data.Parser as Parser
10−>>> import qualified Streamly.Data.ParserK as ParserK
11−
12−For APIs that have not been released yet.
13−
14−>>> import qualified Streamly.Internal.Data.ParserK as ParserK
15−-}
core/src/DocTestDataStream.hsdeleted−39
@@ -1,39 +0,0 @@
1−{- $setup
2−
3−>>> :m
4−>>> import Control.Concurrent (threadDelay)
5−>>> import Control.Monad (void)
6−>>> import Control.Monad.IO.Class (MonadIO (liftIO))
7−>>> import Control.Monad.Trans.Class (lift)
8−>>> import Control.Monad.Trans.Identity (runIdentityT)
9−>>> import Data.Char (isSpace)
10−>>> import Data.Either (fromLeft, fromRight, isLeft, isRight, either)
11−>>> import Data.Maybe (fromJust, isJust)
12−>>> import Data.Function (fix, (&))
13−>>> import Data.Functor.Identity (runIdentity)
14−>>> import Data.IORef
15−>>> import Data.Semigroup (cycle1)
16−>>> import GHC.Exts (Ptr (Ptr))
17−>>> import System.IO (stdout, hSetBuffering, BufferMode(LineBuffering))
18−
19−>>> hSetBuffering stdout LineBuffering
20−>>> effect n = print n >> return n
21−
22−>>> import Streamly.Data.Stream (Stream)
23−>>> import qualified Streamly.Data.Array as Array
24−>>> import qualified Streamly.Data.Fold as Fold
25−>>> import qualified Streamly.Data.Stream as Stream
26−>>> import qualified Streamly.Data.StreamK as StreamK
27−>>> import qualified Streamly.Data.Unfold as Unfold
28−>>> import qualified Streamly.Data.Parser as Parser
29−>>> import qualified Streamly.FileSystem.Dir as Dir
30−
31−For APIs that have not been released yet.
32−
33−>>> import qualified Streamly.Internal.Data.Fold as Fold
34−>>> import qualified Streamly.Internal.Data.Parser as Parser
35−>>> import qualified Streamly.Internal.Data.Stream as Stream
36−>>> import qualified Streamly.Internal.Data.StreamK as StreamK
37−>>> import qualified Streamly.Internal.Data.Unfold as Unfold
38−>>> import qualified Streamly.Internal.FileSystem.Dir as Dir
39−-}
core/src/DocTestDataStreamK.hsdeleted−21
@@ -1,21 +0,0 @@
1−{- $setup
2−
3−>>> :m
4−>>> import Control.Concurrent (threadDelay)
5−>>> import Data.Function (fix, (&))
6−>>> import Data.Semigroup (cycle1)
7−
8−>>> effect n = print n >> return n
9−
10−>>> import Streamly.Data.StreamK (StreamK)
11−>>> import qualified Streamly.Data.Fold as Fold
12−>>> import qualified Streamly.Data.Parser as Parser
13−>>> import qualified Streamly.Data.Stream as Stream
14−>>> import qualified Streamly.Data.StreamK as StreamK
15−>>> import qualified Streamly.FileSystem.Dir as Dir
16−
17−For APIs that have not been released yet.
18−
19−>>> import qualified Streamly.Internal.Data.StreamK as StreamK
20−>>> import qualified Streamly.Internal.FileSystem.Dir as Dir
21−-}
core/src/DocTestDataUnfold.hsdeleted−12
@@ -1,12 +0,0 @@
1−{- $setup
2−
3−>>> :m
4−>>> import Streamly.Data.Unfold (Unfold)
5−>>> import qualified Streamly.Data.Fold as Fold
6−>>> import qualified Streamly.Data.Stream as Stream
7−>>> import qualified Streamly.Data.Unfold as Unfold
8−
9−For APIs that have not been released yet.
10−
11−>>> import qualified Streamly.Internal.Data.Unfold as Unfold
12−-}
core/src/DocTestFileSystemHandle.hsdeleted−15
@@ -1,15 +0,0 @@
1−{- $setup
2−>>> :m
3−>>> import qualified Streamly.Data.Array as Array
4−>>> import qualified Streamly.FileSystem.Handle as Handle hiding (readChunks)
5−>>> import qualified Streamly.Data.Fold as Fold
6−>>> import qualified Streamly.Data.Stream as Stream
7−>>> import qualified Streamly.Data.Unfold as Unfold
8−
9−For APIs that have not been released yet.
10−
11−>>> import qualified Streamly.Internal.Data.Array as Array (unsafeCreateOf)
12−>>> import qualified Streamly.Internal.Data.Unfold as Unfold (first)
13−>>> import qualified Streamly.Internal.FileSystem.Handle as Handle
14−>>> import qualified Streamly.Internal.System.IO as IO (defaultChunkSize)
15−-}
core/src/DocTestUnicodeParser.hsdeleted−9
@@ -1,9 +0,0 @@
1−{- $setup
2−>>> :m
3−>>> import qualified Streamly.Data.Stream as Stream
4−>>> import qualified Streamly.Unicode.Parser as Unicode
5−
6−For APIs that have not been released yet.
7−
8−>>> import qualified Streamly.Internal.Unicode.Parser as Unicode (number, mkDouble)
9−-}
core/src/DocTestUnicodeStream.hsdeleted−12
@@ -1,12 +0,0 @@
1−{- $setup
2−>>> :m
3−
4−>>> import qualified Streamly.Data.Fold as Fold
5−>>> import qualified Streamly.Data.Stream as Stream
6−>>> import qualified Streamly.Unicode.Stream as Unicode
7−
8−For APIs that have not been released yet.
9−
10−>>> :set -XMagicHash
11−>>> import qualified Streamly.Internal.Unicode.Stream as Unicode
12−-}
core/src/DocTestUnicodeString.hsdeleted−5
@@ -1,5 +0,0 @@
1−{- $setup
2−>>> :m
3−>>> :set -XQuasiQuotes
4−>>> import Streamly.Internal.Unicode.String
5−-}
core/src/Streamly/Data/Array.hsdeleted−167
@@ -1,167 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−-- |
3−-- Module : Streamly.Data.Array
4−-- Copyright : (c) 2019 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−-- Stability : released
9−-- Portability : GHC
10−--
11−-- Unboxed immutable arrays with streaming interfaces.
12−--
13−-- Please refer to "Streamly.Internal.Data.Array" for functions that have not
14−-- yet been released.
15−--
16−-- For arrays that work on boxed types, not requiring the 'Unbox' constraint,
17−-- please refer to "Streamly.Data.Array.Generic". For arrays that can be
18−-- mutated in-place, please see "Streamly.Data.MutArray".
19−
20−module Streamly.Data.Array
21− (
22− -- * Setup
23− -- | To execute the code examples provided in this module in ghci, please
24− -- run the following commands first.
25− --
26− -- $setup
27−
28− -- * Overview
29− -- $overview
30−
31− -- * The Array Type
32− Array
33−
34− -- * Pinning & Unpinning
35− -- | Arrays are created unpinned by default unless pinned versions of
36− -- creation APIs are used. Look for APIs with @pinned@ prefix in
37− -- "Streamly.Internal.Data.Array" for some unreleased pinned creation APIs.
38− -- If an array is to be sent to the OS without any further modification
39− -- then it should be created pinned in the first place instead of pinning
40− -- it later. Pinning an unpinned array has a copy overhead. OS interfacing
41− -- APIs create a pinned array directly or convert an unpinned array to
42− -- pinned array before sending it to the OS.
43− , pin
44− , unpin
45− , isPinned
46−
47− -- * Construction
48− -- | When performance matters, the fastest way to generate an array is
49− -- 'createOf'. 'IsList' and 'IsString' instances can be
50− -- used to conveniently construct arrays from literal values.
51− -- 'OverloadedLists' extension or 'fromList' can be used to construct an
52− -- array from a list literal. Similarly, 'OverloadedStrings' extension or
53− -- 'fromList' can be used to construct an array from a string literal.
54−
55− -- ** From Stream
56− , createOf
57− , create
58− , writeLastN -- drop old (ring buffer)
59−
60− -- ** From List
61− , fromListN
62− , fromList
63−
64− -- * To List
65− -- 'GHC.Exts.toList' from "GHC.Exts" can be used to convert an array to a
66− -- list.
67− , toList
68−
69− -- * To Stream
70− , read
71− , readRev
72−
73− -- * Unfolds
74− , reader
75− , readerRev
76−
77− -- * Casting
78− , cast
79− , asBytes
80−
81− -- * Random Access
82− , length
83− -- , (!!)
84− , getIndex
85−
86− -- * Serialization
87− , pinnedSerialize
88− , deserialize
89−
90− -- * Re-exports
91− , Unbox (..)
92− , Serialize(..)
93−
94− -- * Deprecated
95− , writeN -- drop new
96− , write -- full buffer
97− )
98−where
99−
100−#include "inline.hs"
101−
102−import Streamly.Internal.Data.Array
103−import Streamly.Internal.Data.MutByteArray (Unbox(..), Serialize(..))
104−
105−import Prelude hiding (read, length)
106−
107−#include "DocTestDataArray.hs"
108−
109−-- $overview
110−--
111−-- This module provides APIs to create and use unboxed immutable arrays. Once
112−-- created, their contents cannot be modified. Only types that are unboxable
113−-- via the 'Unbox' type class can be stored in these arrays. Note that the
114−-- array memory grows automatically when creating a new array, therefore, an
115−-- array can be created from a variable length stream.
116−--
117−-- == Folding Arrays
118−--
119−-- Convert array to stream, and fold the stream:
120−--
121−-- >>> fold f arr = Array.read arr & Stream.fold f
122−-- >>> fold Fold.sum (Array.fromList [1,2,3::Int])
123−-- 6
124−--
125−-- == Transforming Arrays
126−--
127−-- Convert array to stream, transform, and fold back to array:
128−--
129−-- >>> amap f arr = Array.read arr & fmap f & Stream.fold (Array.createOf (Array.length arr))
130−-- >>> amap (+1) (Array.fromList [1,2,3::Int])
131−-- fromList [2,3,4]
132−--
133−-- == Pinned and Unpinned Arrays
134−--
135−-- The array type can use both pinned and unpinned memory under the hood. The
136−-- default array creation operations create unpinned arrays. IO operations
137−-- automatically copy an array to pinned memory if the array passed to it is
138−-- unpinned. Programmers can use appropriate pinned array generation APIs to
139−-- reduce the copying if it happens.
140−--
141−-- Unpinned arrays have the advantage of allowing automatic defragmentation of
142−-- the memory by GC. Whereas pinned arrays have the advantage of not requiring
143−-- a copy by GC. Normally you would want to use unpinned arrays. However, in
144−-- some cases, for example, for long lived large data storage, and for
145−-- interfacing with the operating system or foreign (non-Haskell) consumers you
146−-- may want to use pinned arrays.
147−--
148−-- == Creating Arrays from Non-IO Streams
149−--
150−-- Array creation folds require 'MonadIO' otherwise the compiler may
151−-- incorrectly share the array memory thinking it is pure.
152−--
153−-- See the 'fromPureStream' unreleased API to generate an array from an
154−-- Identity stream safely without using MonadIO constraint.
155−--
156−-- Note that 'Identity' streams can be generalized to IO streams:
157−--
158−-- >>> stream = Stream.fromList [1,2,3] :: Stream Identity Int
159−-- >>> pure2IO s = Stream.morphInner (return . runIdentity) s :: Stream IO Int
160−-- >>> Stream.fold Array.create (pure2IO stream)
161−-- fromList [1,2,3]
162−--
163−-- == Programming Tips
164−--
165−-- This module is designed to be imported qualified:
166−--
167−-- >>> import qualified Streamly.Data.Array as Array
core/src/Streamly/Data/Array/Generic.hsdeleted−51
@@ -1,51 +0,0 @@
1−-- |
2−-- Module : Streamly.Data.Array.Generic
3−-- Copyright : (c) 2019 Composewell Technologies
4−--
5−-- License : BSD-3-Clause
6−-- Maintainer : streamly@composewell.com
7−-- Stability : experimental
8−-- Portability : GHC
9−--
10−-- Unconstrained version of "Streamly.Data.Array" module.
11−--
12−-- See the "Streamly.Data.Array" module for documentation.
13−--
14−module Streamly.Data.Array.Generic
15− ( Array
16−
17− -- * Construction
18− , fromListN
19− , fromList
20−
21− -- MonadicAPIs
22− , createOf
23− , create
24−
25− -- * Conversion
26− , toList
27−
28− -- * Streams
29− , read
30− , readRev
31−
32− -- * Unfolds
33− , reader
34− -- , A.readerRev
35−
36− -- * Random Access
37− , length
38− , getIndex
39−
40− -- -- * Folding Arrays
41− -- , A.streamFold
42− -- , A.fold
43−
44− -- * Deprecated
45− , writeN
46− , write
47− )
48−where
49−
50−import Streamly.Internal.Data.Array.Generic
51−import Prelude hiding (length, read)
core/src/Streamly/Data/Array/Unboxed.hsnew file+104
@@ -0,0 +1,104 @@
1+#include "inline.hs"
2+
3+-- |
4+-- Module : Streamly.Data.Array.Unboxed
5+-- Copyright : (c) 2019 Composewell Technologies
6+--
7+-- License : BSD3
8+-- Maintainer : streamly@composewell.com
9+-- Stability : released
10+-- Portability : GHC
11+--
12+-- This module provides immutable arrays in pinned memory (non GC memory)
13+-- suitable for long lived data storage, random access and for interfacing with
14+-- the operating system.
15+--
16+-- Arrays in this module are chunks of pinned memory that hold a sequence of
17+-- 'Storable' values of a given type, they cannot store non-serializable data
18+-- like functions. Once created an array cannot be modified. Pinned memory
19+-- allows efficient buffering of long lived data without adding any impact to
20+-- GC. One array is just one pointer visible to GC and it does not have to be
21+-- copied across generations. Moreover, pinned memory allows communication
22+-- with foreign consumers and producers (e.g. file or network IO) without
23+-- copying the data.
24+--
25+-- = Programmer Notes
26+--
27+-- Array creation APIs require a 'MonadIO' Monad, except 'fromList' which is a
28+-- pure API. To operate on streams in pure Monads like 'Identity' you can hoist
29+-- it to IO monad as follows:
30+--
31+-- >>> import Data.Functor.Identity (Identity, runIdentity)
32+-- >>> s = Stream.fromList [1..10] :: SerialT Identity Int
33+-- >>> s1 = Stream.hoist (return . runIdentity) s :: SerialT IO Int
34+-- >>> Stream.fold Array.write s1 :: IO (Array Int)
35+-- [1,2,3,4,5,6,7,8,9,10]
36+--
37+-- 'unsafePerformIO' can be used to get a pure API from IO, as long as you know
38+-- it is safe to do so:
39+--
40+-- >>> import System.IO.Unsafe (unsafePerformIO)
41+-- >>> unsafePerformIO $ Stream.fold Array.write s1 :: Array Int
42+-- [1,2,3,4,5,6,7,8,9,10]
43+--
44+-- To apply a transformation to an array use 'read' to unfold the array into a
45+-- stream, apply a transformation on the stream and then use 'write' to fold it
46+-- back to an array.
47+--
48+-- This module is designed to be imported qualified:
49+--
50+-- > import qualified Streamly.Data.Array.Unboxed as Array
51+--
52+-- For experimental APIs see "Streamly.Internal.Data.Array.Unboxed".
53+
54+module Streamly.Data.Array.Unboxed
55+ (
56+ A.Array
57+
58+ -- * Arrays
59+ -- ** Construction
60+ -- | When performance matters, the fastest way to generate an array is
61+ -- 'writeN'. 'IsList' and 'IsString' instances can be
62+ -- used to conveniently construct arrays from literal values.
63+ -- 'OverloadedLists' extension or 'fromList' can be used to construct an
64+ -- array from a list literal. Similarly, 'OverloadedStrings' extension or
65+ -- 'fromList' can be used to construct an array from a string literal.
66+
67+ -- Pure List APIs
68+ , A.fromListN
69+ , A.fromList
70+
71+ -- Monadic APIs
72+ , A.writeN -- drop new
73+ , A.write -- full buffer
74+ , writeLastN -- drop old (ring buffer)
75+
76+ -- ** Elimination
77+ -- 'GHC.Exts.toList' from "GHC.Exts" can be used to convert an array to a
78+ -- list.
79+
80+ , A.toList
81+ , A.read
82+ , A.readRev
83+
84+ -- ** Casting
85+ , cast
86+ , asBytes
87+
88+ -- ** Random Access
89+ , A.length
90+ -- , (!!)
91+ , A.getIndex
92+ )
93+where
94+
95+import Streamly.Internal.Data.Array.Unboxed as A
96+
97+-- $setup
98+-- >>> :m
99+-- >>> :set -XFlexibleContexts
100+-- >>> :set -package streamly
101+-- >>> import Streamly.Prelude (SerialT)
102+-- >>> import Streamly.Data.Array.Unboxed (Array)
103+-- >>> import qualified Streamly.Internal.Data.Stream.IsStream as Stream
104+-- >>> import qualified Streamly.Data.Array.Unboxed as Array
core/src/Streamly/Data/Fold.hs+67−193
@@ -1,4 +1,3 @@
1−{-# LANGUAGE CPP #-}
2-- |
1-- |
3-- Module : Streamly.Data.Fold
2-- Module : Streamly.Data.Fold
4-- Copyright : (c) 2019 Composewell Technologies
3-- Copyright : (c) 2019 Composewell Technologies
@@ -7,47 +6,33 @@
7-- Stability : released
6-- Stability : released
8-- Portability : GHC
7-- Portability : GHC
9--
8--
10−-- Fast, composable stream consumers with ability to terminate, supporting
9+-- A 'Fold' is a sink or a consumer of a stream of values. The 'Fold' type
11−-- stream fusion.
10+-- consists of an accumulator and an effectful action that absorbs a value into
11+-- the accumulator.
12--
12--
13−-- == Using Folds
13+-- >>> import Data.Function ((&))
14+-- >>> import qualified Streamly.Data.Fold as Fold
15+-- >>> import qualified Streamly.Prelude as Stream
14--
16--
15−-- This module provides elementary folds and fold combinators that can be used
16−-- to consume a stream of data and reduce it to a final value, or transform it
17−-- in a stateful manner using scans. A data stream can be reduced into a stream
18−-- of folded data elements by folding segments of the stream. Fold combinators
19−-- can be used to compose multiple folds in parallel or to create a pipeline of
20−-- folds such that the next fold consumes the result of the previous fold. To
21−-- run these folds on a stream see 'Streamly.Data.Stream.fold',
22−-- 'Streamly.Data.Stream.scan', 'Streamly.Data.Stream.postscan',
23−-- 'Streamly.Data.Stream.scanMaybe', 'Streamly.Data.Stream.foldMany' and other
24−-- operations accepting 'Fold' type as argument "Streamly.Data.Stream".
25−--
26−-- == Reducing a Stream
27−--
28−-- A 'Fold' is a consumer of a stream of values. A fold driver (such as
29−-- 'Streamly.Data.Stream.fold') initializes the fold @accumulator@, runs the
30−-- fold @step@ function in a loop, processing the input stream one element at a
31−-- time and accumulating the result. The loop continues until the fold
32−-- terminates, at which point the accumulated result is returned.
33−--
34−-- For example, a 'sum' Fold represents a stream consumer that adds the values
17+-- For example, a 'sum' Fold represents adding the input to the accumulated
35−-- in the input stream:
18+-- sum. A fold driver e.g. 'Streamly.Prelude.fold' pushes values from a stream
19+-- to the 'Fold' one at a time, reducing the stream to a single value.
36--
20--
37-- >>> Stream.fold Fold.sum $ Stream.fromList [1..100]
21-- >>> Stream.fold Fold.sum $ Stream.fromList [1..100]
38-- 5050
22-- 5050
39--
23--
40−-- Conceptually, a 'Fold' is a data type that mimics a strict left fold
24+-- Conceptually, a 'Fold' is a data type that can mimic a strict left fold
25+-- ('Data.List.foldl') as well as lazy right fold ('Prelude.foldr'). The above
41−-- ('Data.List.foldl'). The above example is similar to a left fold using
26+-- example is similar to a left fold using @(+)@ as the step and @0@ as the
42−-- @(+)@ as the step and @0@ as the initial value of the accumulator:
27+-- initial value of the accumulator:
43--
28--
44-- >>> Data.List.foldl' (+) 0 [1..100]
29-- >>> Data.List.foldl' (+) 0 [1..100]
45-- 5050
30-- 5050
46--
31--
47−-- 'Fold's have an early termination capability e.g. the 'one' fold terminates
32+-- 'Fold's have an early termination capability e.g. the 'head' fold would
48−-- after consuming one element:
33+-- terminate on an infinite stream:
49--
34--
50−-- >>> Stream.fold Fold.one $ Stream.fromList [1..]
35+-- >>> Stream.fold Fold.head $ Stream.fromList [1..]
51-- Just 1
36-- Just 1
52--
37--
53-- The above example is similar to the following right fold:
38-- The above example is similar to the following right fold:
@@ -62,8 +47,6 @@
62-- >>> Stream.fold sumTwo $ Stream.fromList [1..100]
47-- >>> Stream.fold sumTwo $ Stream.fromList [1..100]
63-- 3
48-- 3
64--
49--
65−-- == Parallel Composition
66−--
67-- Folds can be combined to run in parallel on the same input. For example, to
50-- Folds can be combined to run in parallel on the same input. For example, to
68-- compute the average of numbers in a stream without going through the stream
51-- compute the average of numbers in a stream without going through the stream
69-- twice:
52-- twice:
@@ -76,30 +59,26 @@
76-- folds. For example, to count even and odd numbers in a stream:
59-- folds. For example, to count even and odd numbers in a stream:
77--
60--
78-- >>> split n = if even n then Left n else Right n
61-- >>> split n = if even n then Left n else Right n
79−-- >>> stream = fmap split $ Stream.fromList [1..100]
62+-- >>> stream = Stream.map split $ Stream.fromList [1..100]
80-- >>> countEven = fmap (("Even " ++) . show) Fold.length
63-- >>> countEven = fmap (("Even " ++) . show) Fold.length
81-- >>> countOdd = fmap (("Odd " ++) . show) Fold.length
64-- >>> countOdd = fmap (("Odd " ++) . show) Fold.length
82-- >>> f = Fold.partition countEven countOdd
65-- >>> f = Fold.partition countEven countOdd
83-- >>> Stream.fold f stream
66-- >>> Stream.fold f stream
84-- ("Even 50","Odd 50")
67-- ("Even 50","Odd 50")
85--
68--
86−-- == Sequential Composition
87−--
88-- Terminating folds can be combined to parse the stream serially such that the
69-- Terminating folds can be combined to parse the stream serially such that the
89-- first fold consumes the input until it terminates and the second fold
70-- first fold consumes the input until it terminates and the second fold
90-- consumes the rest of the input until it terminates:
71-- consumes the rest of the input until it terminates:
91--
72--
92−-- >>> f = Fold.splitWith (,) (Fold.take 8 Fold.toList) (Fold.takeEndBy (== '\n') Fold.toList)
73+-- >>> f = Fold.serialWith (,) (Fold.take 8 Fold.toList) (Fold.takeEndBy (== '\n') Fold.toList)
93-- >>> Stream.fold f $ Stream.fromList "header: hello\n"
74-- >>> Stream.fold f $ Stream.fromList "header: hello\n"
94-- ("header: ","hello\n")
75-- ("header: ","hello\n")
95--
76--
96−-- == Splitting a Stream
97−--
98-- A 'Fold' can be applied repeatedly on a stream to transform it to a stream
77-- A 'Fold' can be applied repeatedly on a stream to transform it to a stream
99-- of fold results. To split a stream on newlines:
78-- of fold results. To split a stream on newlines:
100--
79--
101-- >>> f = Fold.takeEndBy (== '\n') Fold.toList
80-- >>> f = Fold.takeEndBy (== '\n') Fold.toList
102−-- >>> Stream.fold Fold.toList $ Stream.foldMany f $ Stream.fromList "Hello there!\nHow are you\n"
81+-- >>> Stream.toList $ Stream.foldMany f $ Stream.fromList "Hello there!\nHow are you\n"
103-- ["Hello there!\n","How are you\n"]
82-- ["Hello there!\n","How are you\n"]
104--
83--
105-- Similarly, we can split the input of a fold too:
84-- Similarly, we can split the input of a fold too:
@@ -107,12 +86,15 @@
107-- >>> Stream.fold (Fold.many f Fold.toList) $ Stream.fromList "Hello there!\nHow are you\n"
86-- >>> Stream.fold (Fold.many f Fold.toList) $ Stream.fromList "Hello there!\nHow are you\n"
108-- ["Hello there!\n","How are you\n"]
87-- ["Hello there!\n","How are you\n"]
109--
88--
89+-- Please see "Streamly.Internal.Data.Fold" for additional @Pre-release@
90+-- functions.
91+--
110−-- == Folds vs. Streams
92+-- = Folds vs. Streams
111--
93--
112-- We can often use streams or folds to achieve the same goal. However, streams
94-- We can often use streams or folds to achieve the same goal. However, streams
113-- are more efficient in composition of producers (e.g.
95-- are more efficient in composition of producers (e.g.
114−-- 'Data.Stream.append' or 'Data.Stream.mergeBy') whereas folds are
96+-- 'Streamly.Prelude.serial' or 'Streamly.Prelude.mergeBy') whereas folds are
115−-- more efficient in composition of consumers (e.g. 'splitWith', 'partition'
97+-- more efficient in composition of consumers (e.g. 'serialWith', 'partition'
116-- or 'teeWith').
98-- or 'teeWith').
117--
99--
118-- Streams are producers, transformations on streams happen on the output side:
100-- Streams are producers, transformations on streams happen on the output side:
@@ -120,8 +102,8 @@
120-- >>> :{
102-- >>> :{
121-- f stream =
103-- f stream =
122-- Stream.filter odd stream
104-- Stream.filter odd stream
123−-- & fmap (+1)
105+-- & Stream.map (+1)
124−-- & Stream.fold Fold.sum
106+-- & Stream.sum
125-- :}
107-- :}
126--
108--
127-- >>> f $ Stream.fromList [1..100 :: Int]
109-- >>> f $ Stream.fromList [1..100 :: Int]
@@ -143,50 +125,17 @@
143-- Notice the similiarity in the definition of @f@ in both cases, the only
125-- Notice the similiarity in the definition of @f@ in both cases, the only
144-- difference is the composition by @&@ vs @$@ and the use @lmap@ vs @map@, the
126-- difference is the composition by @&@ vs @$@ and the use @lmap@ vs @map@, the
145-- difference is due to output vs input side transformations.
127-- difference is due to output vs input side transformations.
146−--
147−-- == Fusion Limitations
148−--
149−-- Folds support stream fusion for generating loops comparable to the speed of
150−-- C. However, it has some limitations. For fusion to work, the folds must be
151−-- inlined, folds must be statically known and not generated dynamically, folds
152−-- should not be passed recursively.
153−--
154−-- Another limitation is due to the quadratic complexity causing slowdown when
155−-- too many nested compositions are used. Especially, the performance of the
156−-- Applicative instance and splitting operations (e.g. 'splitWith') degrades
157−-- quadratically (O(n^2)) when combined @n@ times, roughly 8 or less sequenced
158−-- operations are fine. For these cases folds can be converted to parsers and
159−-- then used as ParserK.
160−--
161−-- == Experimental APIs
162−--
163−-- Please refer to "Streamly.Internal.Data.Fold" for more functions that have
164−-- not yet been released.
165
128
166module Streamly.Data.Fold
129module Streamly.Data.Fold
167 (
130 (
168− -- * Setup
169− -- | To execute the code examples provided in this module in ghci, please
170− -- run the following commands first.
171− --
172− -- $setup
173−
174− -- * Running A Fold
175− drive
176− -- XXX Should we have a stream returning function in fold module?
177− -- , breakStream
178−
179 -- * Fold Type
131 -- * Fold Type
180
132
181− , Fold -- (..)
133+ Fold -- (..)
182− , Tee (..)
183
134
184 -- * Constructors
135 -- * Constructors
185 , foldl'
136 , foldl'
186 , foldlM'
137 , foldlM'
187− , foldl1'
188− , foldlM1'
189− , foldr'
138+ , foldr
190
139
191 -- * Folds
140 -- * Folds
192 -- ** Accumulators
141 -- ** Accumulators
@@ -203,13 +152,15 @@ module Streamly.Data.Fold
203
152
204 -- Reducers
153 -- Reducers
205 , drain
154 , drain
206− , drainMapM
155+ , drainBy
156+ , last
207 , length
157 , length
208− , countDistinct
209− , countDistinctInt
210− , frequency
211 , sum
158 , sum
212 , product
159 , product
160+ , maximumBy
161+ , maximum
162+ , minimumBy
163+ , minimum
213 , mean
164 , mean
214 , rollingHash
165 , rollingHash
215 , rollingHashWithSalt
166 , rollingHashWithSalt
@@ -217,43 +168,17 @@ module Streamly.Data.Fold
217 -- Collectors
168 -- Collectors
218 , toList
169 , toList
219 , toListRev
170 , toListRev
220− , toSet
221− , toIntSet
222− , topBy
223−
224− -- ** Non-Empty Accumulators
225− -- | Accumulators that do not have a default value, therefore, return
226− -- 'Nothing' on an empty stream.
227− , latest
228− , maximumBy
229− , maximum
230− , minimumBy
231− , minimum
232−
233− -- ** Filtering Scanners
234− -- | Accumulators that are usually run as a scan using the 'scanMaybe'
235− -- combinator.
236− , findIndices
237− , elemIndices
238− , deleteBy
239− -- , uniq
240− , uniqBy
241− , nub
242− , nubInt
243
171
244 -- ** Terminating Folds
172 -- ** Terminating Folds
245− , one
173+ -- | These are much like lazy right folds.
246− , null
247− -- , satisfy
248− -- , maybe
249
174
250 , index
175 , index
251− , the
176+ , head
252 , find
177 , find
253− , findM
254 , lookup
178 , lookup
255 , findIndex
179 , findIndex
256 , elemIndex
180 , elemIndex
181+ , null
257 , elem
182 , elem
258 , notElem
183 , notElem
259 , all
184 , all
@@ -261,44 +186,24 @@ module Streamly.Data.Fold
261 , and
186 , and
262 , or
187 , or
263
188
264− -- * Incremental builders
265− -- | Mutable arrays ("Streamly.Data.MutArray") are basic builders. You can
266− -- use the 'Streamly.Data.MutArray.snoc' or
267− -- 'Streamly.Data.MutArray.writeAppend' operations to incrementally build
268− -- mutable arrays. The 'addOne' and 'addStream' combinators can be used to
269− -- incrementally build any type of structure using a fold, including arrays
270− -- or a stream of arrays.
271− --
272− -- Use pinned arrays if you are going to use the data for IO.
273−
274− -- XXX should rename to "extract". can use "Fold.drive Stream.nil" instead,
275− -- for now.
276− -- , extractM
277− -- , reduce
278− , addOne
279− -- , snocl
280− -- XXX Can we use something like concatEffect to implement snocM?
281− -- , snocM
282− -- , snoclM
283− , addStream
284− , duplicate
285− -- , isClosed
286−
287 -- * Combinators
189 -- * Combinators
288 -- | Combinators are modifiers of folds. In the type @Fold m a b@, @a@ is
190 -- | Combinators are modifiers of folds. In the type @Fold m a b@, @a@ is
289 -- the input type and @b@ is the output type. Transformations can be
191 -- the input type and @b@ is the output type. Transformations can be
290− -- applied either on the input side (contravariant) or on the output side
192+ -- applied either on the input side or on the output side. Therefore,
291− -- (covariant). Therefore, combinators are of one of the following general
193+ -- combinators are of one of the following general shapes:
292− -- shapes:
293 --
194 --
294 -- * @... -> Fold m a b -> Fold m c b@ (input transformation)
195 -- * @... -> Fold m a b -> Fold m c b@ (input transformation)
295 -- * @... -> Fold m a b -> Fold m a c@ (output transformation)
196 -- * @... -> Fold m a b -> Fold m a c@ (output transformation)
296 --
197 --
198+ -- Output transformations are also known as covariant transformations, and
199+ -- input transformations are also known as contravariant transformations.
297 -- The input side transformations are more interesting for folds. Most of
200 -- The input side transformations are more interesting for folds. Most of
298 -- the following sections describe the input transformation operations on a
201 -- the following sections describe the input transformation operations on a
202+ -- fold. The names and signatures of the operations are consistent with
203+ -- corresponding operations in "Streamly.Prelude". When an operation makes
299− -- fold. When an operation makes sense on both input and output side we use
204+ -- sense on both input and output side we use the prefix @l@ (for left) for
300− -- the prefix @l@ (for left) for input side operations and the prefix @r@
205+ -- input side operations and the prefix @r@ (for right) for output side
301− -- (for right) for output side operations.
206+ -- operations.
302
207
303 -- ** Mapping on output
208 -- ** Mapping on output
304 -- | The 'Functor' instance of a fold maps on the output of the fold:
209 -- | The 'Functor' instance of a fold maps on the output of the fold:
@@ -312,31 +217,22 @@ module Streamly.Data.Fold
312 , lmap
217 , lmap
313 , lmapM
218 , lmapM
314
219
315− -- ** Scanning and Filtering
220+ -- ** Filtering
316− , scan
317− , postscan
318− , scanMaybe
319 , filter
221 , filter
320 , filterM
222 , filterM
321
223
322 -- -- ** Mapping Filters
224 -- -- ** Mapping Filters
323− , mapMaybe
324 , catMaybes
225 , catMaybes
325− , catLefts
226+ , mapMaybe
326− , catRights
327− , catEithers
328
227
329 -- ** Trimming
228 -- ** Trimming
330 , take
229 , take
331 -- , takeInterval
230 -- , takeInterval
332− , takeEndBy
333 , takeEndBy_
231 , takeEndBy_
232+ , takeEndBy
334
233
335− -- ** Splitting
234+ -- ** Serial Append
336− , splitWith
235+ , serialWith
337− , many
338− , groupsOf
339− -- , intervalsOf
340
236
341 -- ** Parallel Distribution
237 -- ** Parallel Distribution
342 -- | For applicative composition using distribution see
238 -- | For applicative composition using distribution see
@@ -358,58 +254,36 @@ module Streamly.Data.Fold
358 --, partitionByMinM
254 --, partitionByMinM
359 --, partitionBy
255 --, partitionBy
360
256
361− -- ** Key-value Collectors
362− , toMap
363− , toMapIO
364− , demuxToMap
365− , demuxToMapIO
366−
367− -- ** Key-value Scanners
368− , classify
369− , classifyIO
370− , demux
371− , demuxIO
372−
373 -- ** Unzipping
257 -- ** Unzipping
374 , unzip
258 , unzip
375
259
260+ -- ** Splitting
261+ , many
262+ , chunksOf
263+ -- , intervalsOf
264+
376 -- ** Nesting
265 -- ** Nesting
377 , concatMap
266 , concatMap
378
267
379− -- * Transforming the Monad
380− , morphInner
381−
382 -- * Deprecated
268 -- * Deprecated
383− , chunksOf
384− , foldr
385− , drainBy
386− , last
387− , head
388 , sequence
269 , sequence
389 , mapM
270 , mapM
390 , variance
271 , variance
391 , stdDev
272 , stdDev
392− , serialWith
393 )
273 )
394where
274where
395
275
396import Prelude
276import Prelude
397− hiding (Foldable(..), filter, drop, dropWhile, take, takeWhile, zipWith,
277+ hiding (filter, drop, dropWhile, take, takeWhile, zipWith, foldr,
398− map, mapM_, sequence, all, any,
278+ foldl, map, mapM_, sequence, all, any, sum, product, elem,
399− notElem, head, last, tail,
279+ notElem, maximum, minimum, head, last, tail, length, null,
400− reverse, iterate, init, and, or, lookup, (!!),
280+ reverse, iterate, init, and, or, lookup, foldr1, (!!),
401− scanl, scanl1, replicate, concatMap, mconcat, unzip,
281+ scanl, scanl1, replicate, concatMap, mconcat, foldMap, unzip,
402− span, splitAt, break, mapM, maybe)
282+ span, splitAt, break, mapM)
403
283
404import Streamly.Internal.Data.Fold
284import Streamly.Internal.Data.Fold
405
285
406−#include "DocTestDataFold.hs"
286+-- $setup
407−
287+-- >>> import Data.Function ((&))
408−--------------------------------------------------------------------------------
288+-- >>> import qualified Streamly.Data.Fold as Fold
409−-- Deprecated
289+-- >>> import qualified Streamly.Prelude as Stream
410−--------------------------------------------------------------------------------
411−
412−{-# DEPRECATED chunksOf "Please use 'groupsOf' instead" #-}
413−{-# INLINE chunksOf #-}
414−chunksOf :: Monad m => Int -> Fold m a b -> Fold m b c -> Fold m a c
415−chunksOf = groupsOf
core/src/Streamly/Data/Fold/Tee.hsnew file+41
@@ -0,0 +1,41 @@
1+-- |
2+-- Module : Streamly.Data.Fold.Tee
3+-- Copyright : (c) 2021 Composewell Technologies
4+-- License : BSD-3-Clause
5+-- Maintainer : streamly@composewell.com
6+-- Stability : released
7+-- Portability : GHC
8+--
9+-- The 'Tee' type is a newtype wrapper over the 'Streamly.Data.Fold.Fold' type providing
10+-- distributive 'Applicative', 'Semigroup', 'Monoid', 'Num', 'Floating' and
11+-- 'Fractional' instances. The input received by the composed 'Tee' is
12+-- replicated and distributed to both the constituent Tees.
13+--
14+-- For example, to compute the average of numbers in a stream without going
15+-- through the stream twice:
16+--
17+-- >>> import Streamly.Data.Fold.Tee (Tee(..))
18+-- >>> import qualified Streamly.Prelude as Stream
19+-- >>> import qualified Streamly.Data.Fold as Fold
20+--
21+-- >>> avg = (/) <$> (Tee Fold.sum) <*> (Tee $ fmap fromIntegral Fold.length)
22+-- >>> Stream.fold (toFold avg) $ Stream.fromList [1.0..100.0]
23+-- 50.5
24+--
25+-- Similarly, the 'Semigroup' and 'Monoid' instances of 'Tee' distribute the
26+-- input to both the folds and combine the outputs using Monoid or Semigroup
27+-- instances of the output types:
28+--
29+-- >>> import Data.Monoid (Sum(..))
30+-- >>> t = Tee Fold.head <> Tee Fold.last
31+-- >>> Stream.fold (toFold t) (fmap Sum $ Stream.enumerateFromTo 1.0 100.0)
32+-- Just (Sum {getSum = 101.0})
33+--
34+-- The 'Num', 'Floating', and 'Fractional' instances work in the same way.
35+--
36+module Streamly.Data.Fold.Tee
37+ ( Tee(..)
38+ )
39+where
40+
41+import Streamly.Internal.Data.Fold.Tee
core/src/Streamly/Data/MutArray.hsdeleted−110
@@ -1,110 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−-- |
3−-- Module : Streamly.Data.MutArray
4−-- Copyright : (c) 2022 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−-- Stability : released
9−-- Portability : GHC
10−--
11−-- This module provides a mutable version of "Streamly.Data.Array". The
12−-- contents of a mutable array can be modified in-place. For general
13−-- documentation, please refer to the original module.
14−--
15−-- Please refer to "Streamly.Internal.Data.MutArray" for functions that have
16−-- not yet been released.
17−--
18−-- For mutable arrays that work on boxed types, not requiring the 'Unbox'
19−-- constraint, please refer to "Streamly.Data.MutArray.Generic".
20−
21−module Streamly.Data.MutArray
22− (
23− -- * Setup
24− -- | To execute the code examples provided in this module in ghci, please
25− -- run the following commands first.
26− --
27− -- $setup
28−
29− -- * Mutable Array Type
30− MutArray
31−
32− -- * Construction
33−
34− -- Uninitialized Arrays
35− , emptyOf
36− , pinnedEmptyOf
37−
38− -- From containers
39− , fromListN
40− , fromList
41− , createOf
42− , create
43− -- writeLastN
44−
45− -- * Pinning & Unpinning
46− , pin
47− , unpin
48− , isPinned
49−
50− -- * Appending elements
51− , snoc
52−
53− -- * Appending streams
54− , appendN
55− , append
56−
57− -- * Inplace mutation
58− , putIndex
59− , putIndexUnsafe
60− , modifyIndex
61− , modifyIndexUnsafe
62− , modify
63−
64− -- * Random access
65− , getIndex
66− , getIndexUnsafe
67−
68− -- * Conversion
69− , toList
70−
71− -- * Streams
72− , read
73− , readRev
74−
75− -- * Unfolds
76− , reader
77− , readerRev
78−
79− -- * Casting
80− , cast
81− , asBytes
82−
83− -- * Size
84− , length
85−
86− -- * Re-exports
87− , Unbox (..)
88−
89− -- * Deprecated
90− , newPinned
91− , new
92− , pinnedNew
93− , writeN
94− , write
95− , writeAppendN
96− , writeAppend
97− )
98−where
99−
100−import Prelude hiding (length, read)
101−import Streamly.Internal.Data.MutArray
102−import Streamly.Internal.Data.Unbox (Unbox (..))
103−import Control.Monad.IO.Class (MonadIO)
104−
105−#include "DocTestDataMutArray.hs"
106−
107−{-# DEPRECATED newPinned "Please use pinnedNew instead." #-}
108−{-# INLINE newPinned #-}
109−newPinned :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
110−newPinned = pinnedNew
core/src/Streamly/Data/MutArray/Generic.hsdeleted−70
@@ -1,70 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−-- |
3−-- Module : Streamly.Data.MutArray.Generic
4−-- Copyright : (c) 2020 Composewell Technologies
5−-- License : BSD3-3-Clause
6−-- Maintainer : streamly@composewell.com
7−-- Stability : experimental
8−-- Portability : GHC
9−--
10−-- Unconstrained version of "Streamly.Data.MutArray" module.
11−--
12−-- See the "Streamly.Data.MutArray" module for documentation.
13−--
14−module Streamly.Data.MutArray.Generic
15−(
16− -- * Setup
17− -- | To execute the code examples provided in this module in ghci, please
18− -- run the following commands first.
19− --
20− -- $setup
21−
22− -- * Type
23− MutArray
24−
25− -- * Construction
26− , emptyOf
27− , fromListN
28− , fromList
29− , createOf
30− , create
31−
32− -- * Appending elements
33− , snoc
34−
35− -- * Inplace mutation
36− , putIndex
37− , putIndexUnsafe
38− , modifyIndex
39− , modifyIndexUnsafe
40− -- , modify
41−
42− -- * Random reads
43− , getIndex
44− , getIndexUnsafe
45−
46− -- * Conversion
47− , toList
48−
49− -- * Streams
50− , read
51− , readRev
52−
53− -- * Unfolds
54− , reader
55− -- , readerRev
56−
57− -- * Size
58− , length
59−
60− -- * Deprecated
61− , new
62− , writeN
63− , write
64− )
65−where
66−
67−import Streamly.Internal.Data.MutArray.Generic
68−import Prelude hiding (read, length)
69−
70−#include "DocTestDataMutArrayGeneric.hs"
core/src/Streamly/Data/MutByteArray.hsdeleted−106
@@ -1,106 +0,0 @@
1−-- |
2−-- Module : Streamly.Data.MutByteArray
3−-- Copyright : (c) 2023 Composewell Technologies
4−-- License : BSD3-3-Clause
5−-- Maintainer : streamly@composewell.com
6−-- Portability : GHC
7−--
8−-- A low level byte Array type 'MutByteArray', along with type classes 'Unbox'
9−-- and 'Serialize' for fast binary serialization and deserialization of Haskell
10−-- values. Serialization, deserialization performance is similar to, and in
11−-- some cases many times better than the store package. Conceptually, the
12−-- 'Serialize' type class works in the same way as store.
13−--
14−-- Serialize instances are configurable to use constructor names (see
15−-- 'Streamly.Internal.Data.MutByteArray.encodeConstrNames'), record field names (see
16−-- 'Streamly.Internal.Data.MutByteArray.encodeRecordFields') instead of binary
17−-- encoded values. This is an experimental feature which allows JSON like
18−-- properties with faster speed. For example, you can change the order of
19−-- constructors or record fields without affecting serialized value.
20−--
21−-- Higher level unboxed array modules "Streamly.Data.Array" and
22−-- "Streamly.Data.MutArray" are built on top of this module. Unboxed arrays are
23−-- essentially serialized Haskell values. Array modules provide higher level
24−-- serialization routines like 'Streamly.Internal.Data.Array.pinnedSerialize'
25−-- and 'Streamly.Internal.Data.Array.deserialize' from the
26−-- "Streamly.Internal.Data.Array" module.
27−--
28−-- == Mutable Byte Array
29−--
30−-- 'MutByteArray' is a primitive mutable array in the IO monad. 'Unbox' and
31−-- 'Serialize' type classes use this primitive array to serialize data to and
32−-- deserialize it from. This array is used to build higher level unboxed
33−-- array types 'Streamly.Data.MutArray.MutArray' and 'Streamly.Data.Array.Array'.
34−--
35−-- == Using Unbox
36−--
37−-- The 'Unbox' type class is simple and used to serialize non-recursive fixed
38−-- size data types. This type class is primarily used to implement unboxed
39−-- arrays. Unboxed arrays are just a sequence of serialized fixed length
40−-- Haskell data types. Instances of this type class can be derived using
41−-- 'Generic' or template haskell based deriving functions provided in this
42−-- module.
43−--
44−-- Writing a data type to an array using the array creation routines in
45−-- "Streamly.Data.Array" or "Streamly.Data.MutArray" (e.g. @writeN@ or
46−-- @fromListN@), serializes the type to the array. Similarly, reading the data
47−-- type from the array deserializes it. You can also serialize and deserialize
48−-- directly to and from a 'MutByteArray', using the type class methods.
49−--
50−-- == Using Serialize
51−--
52−-- The 'Serialize' type class is a superset of the 'Unbox' type class, it can
53−-- serialize variable length data types as well e.g. Haskell lists. Use
54−-- 'deriveSerialize' to derive the instances of the type class automatically
55−-- and then use the type class methods to serialize and deserialize to and from
56−-- a 'MutByteArray'.
57−--
58−-- See 'Streamly.Internal.Data.Array.pinnedSerialize' and
59−-- 'Streamly.Internal.Data.Array.deserialize' for 'Array' type based
60−-- serialization.
61−--
62−-- == Comparing serialized values
63−--
64−-- When using the `Unbox` type class the same value may result in differing
65−-- serialized bytes because of unused uninitialized data in case of sum types.
66−-- Therefore, byte comparison of serialized values is not reliable.
67−--
68−-- However, the 'Serialize' type class guarantees that the serialized values
69−-- are always exactly the same and byte comparison of serialized is reliable.
70−--
71−module Streamly.Data.MutByteArray
72− (
73−
74− -- * Mutable Byte Array
75− -- | The standard way to read from or write to a 'MutByteArray' is by using
76− -- the 'Unbox' or 'Serialize' type class methods.
77− MutByteArray
78− , isPinned
79− , pin
80− , unpin
81− , new
82− , pinnedNew
83−
84− -- * Unbox
85− , Unbox(..)
86− , deriveUnbox
87−
88− -- * Serialize
89− , Serialize(..)
90−
91− -- ** Instance Config
92− , SerializeConfig
93− , inlineAddSizeTo
94− , inlineSerializeAt
95− , inlineDeserializeAt
96−
97− -- ** Instance Deriving
98− , deriveSerialize
99− , deriveSerializeWith
100− ) where
101−
102−--------------------------------------------------------------------------------
103−-- Imports
104−--------------------------------------------------------------------------------
105−
106−import Streamly.Internal.Data.MutByteArray
core/src/Streamly/Data/Parser.hsdeleted−247
@@ -1,247 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−-- |
3−-- Module : Streamly.Data.Parser
4−-- Copyright : (c) 2020 Composewell Technologies
5−-- License : BSD-3-Clause
6−-- Maintainer : streamly@composewell.com
7−-- Stability : pre-release
8−-- Portability : GHC
9−--
10−-- Parsers are stream consumers like folds with the following differences:
11−--
12−-- * folds cannot fail but parsers can fail and backtrack.
13−-- * folds can be composed as a Tee but parsers cannot.
14−-- * folds can be used for scanning but parsers cannot.
15−-- * folds can be converted to parsers.
16−--
17−-- This module implements parsers with stream fusion which compile to efficient
18−-- loops comparable to the speed of C.
19−--
20−-- == Using Parsers
21−--
22−-- This module provides elementary parsers and parser combinators that can be
23−-- used to parse a stream of data. Additionally, all the folds from the
24−-- "Streamly.Data.Fold" module can be converted to parsers using 'fromFold'.
25−-- All the parsing functionality provided by popular parsing libraries, and
26−-- more is available. Also see "Streamly.Unicode.Parser" module for Char stream
27−-- parsers.
28−--
29−-- A data stream can be transformed to a stream of parsed data elements. Parser
30−-- combinators can be used to create a pipeline of folds or parsers such that
31−-- the next fold or parser consumes the result of the previous parser. See
32−-- 'Streamly.Data.Stream.parse' and 'Streamly.Data.Stream.parseMany' to run
33−-- these parsers on a stream.
34−--
35−-- == Parser vs ParserK
36−--
37−-- There are two functionally equivalent parsing modules,
38−-- "Streamly.Data.Parser" (this module) and "Streamly.Data.ParserK". The latter
39−-- is a CPS based wrapper over the former, and can be used for parsing in
40−-- general. "Streamly.Data.Parser" enables stream fusion and should be
41−-- preferred over "Streamly.Data.ParserK" for high performance stream parsing
42−-- use cases. However, there are a few cases where this module is not
43−-- suitable and ParserK should be used instead.
44−--
45−-- For static fusion, parser combinators have to use strict pattern matching on
46−-- arguments of type Parser. This leads to infinte loop when a parser is
47−-- defined recursively, due to strict evaluation of the recursive call. For
48−-- example, the following implementation loops infinitely because of the
49−-- recursive use of parser @p@ in the @*>@ combinator:
50−--
51−-- >>> import Streamly.Data.Parser (Parser)
52−-- >>> import qualified Streamly.Data.Fold as Fold
53−-- >>> import qualified Streamly.Data.Parser as Parser
54−-- >>> import qualified Streamly.Data.Stream as Stream
55−-- >>> import Control.Applicative ((<|>))
56−--
57−-- >>> :{
58−-- >>> p :: Monad m => Parser Char m String
59−-- >>> p = Parser.satisfy (== '(') *> p <|> Parser.fromFold Fold.toList
60−-- >>> :}
61−--
62−-- Use ParserK when recursive use is required:
63−--
64−-- >>> import Streamly.Data.ParserK (ParserK)
65−-- >>> import qualified Streamly.Data.StreamK as StreamK
66−-- >>> import qualified Streamly.Internal.Data.StreamK as StreamK (parse)
67−-- >>> import qualified Streamly.Internal.Data.ParserK as ParserK (adapt)
68−--
69−-- >>> :{
70−-- >>> p :: Monad m => ParserK Char m String
71−-- >>> p = ParserK.adapt (Parser.satisfy (== '(')) *> p <|> ParserK.adapt (Parser.fromFold Fold.toList)
72−-- >>> :}
73−--
74−-- >>> StreamK.parse p $ StreamK.fromStream $ Stream.fromList "hello"
75−-- Right "hello"
76−--
77−-- For this reason Applicative, Alternative or Monad compositions with
78−-- recursion cannot be used with the 'Parser' type. Alternative type class based
79−-- operations like 'asum' and Alternative based generic parser combinators use
80−-- recursion. Similarly, Applicative type class based operations like
81−-- 'Prelude.sequence' use recursion. Custom implementations of many such
82−-- operations are provided in this module (e.g. 'some', 'many'), and those
83−-- should be used instead.
84−--
85−-- Another limitation of Parser type is due to the quadratic complexity causing
86−-- slowdown when too many nested compositions are used. Especially Applicative,
87−-- Monad, Alternative instances, and sequenced parsing operations (e.g. nested
88−-- 'one', and 'splitWith') degrade the performance quadratically (O(n^2)) when
89−-- combined @n@ times, roughly 8 or less sequenced parsers are fine. READ THE
90−-- DOCS OF APPLICATIVE, MONAD AND ALTERNATIVE INSTANCES.
91−--
92−-- == Streaming Parsers
93−--
94−-- With 'Streamly.Data.ParserK.ParserK' you can use the generic Alternative
95−-- type class based parsers from the
96−-- <https://hackage.haskell.org/package/parser-combinators parser-combinators>
97−-- library or similar. However, we recommend that you use the equivalent
98−-- functionality from this module for better performance and for streaming
99−-- behavior.
100−--
101−-- Firstly, the combinators in this module are faster due to stream fusion.
102−-- Secondly, these are streaming in nature as the results can be passed
103−-- directly to other stream consumers (folds or parsers). The Alternative type
104−-- class based parsers would end up buffering all the results in lists before
105−-- they can be consumed.
106−--
107−-- When recursion or heavy nesting is needed use ParserK.
108−--
109−-- == Error Reporting
110−--
111−-- These parsers do not report the error context (e.g. line number or column).
112−-- This may be supported in future.
113−--
114−-- == Monad Transformer Stack
115−--
116−-- 'MonadTrans' instance is not provided. If the 'Parser' type is the top most
117−-- layer (which should be the case almost always) you can just use 'fromEffect'
118−-- to execute the lower layer monad effects.
119−--
120−-- == Parser vs ParserK Implementation
121−--
122−-- The 'Parser' type represents a stream consumer by composing state as data
123−-- which enables stream fusion. Stream fusion generates a tight loop without
124−-- any constructor allocations between the stages, providing C like performance
125−-- for the loop. Stream fusion works when multiple functions are combined in a
126−-- pipeline statically. Therefore, the operations in this module must be
127−-- inlined and must not be used recursively to allow for stream fusion.
128−--
129−-- The 'ParserK' type represents a stream consumer by composing function calls,
130−-- therefore, a function call overhead is incurred at each composition. It is
131−-- quite fast in general but may be a few times slower than a fused parser.
132−-- However, it allows for scalable dynamic composition especially parsers can
133−-- be used in recursive calls. Using the 'ParserK' type operations like
134−-- 'splitWith' provide linear (O(n)) performance with respect to the number of
135−-- compositions.
136−--
137−-- == Experimental APIs
138−--
139−-- Please refer to "Streamly.Internal.Data.Parser" for functions that have not
140−-- yet been released.
141−--
142−module Streamly.Data.Parser
143− (
144− -- * Setup
145− -- | To execute the code examples provided in this module in ghci, please
146− -- run the following commands first.
147− --
148− -- $setup
149−
150− -- * Parser Type
151− Parser
152−
153− -- -- * Downgrade to Fold
154− -- , toFold
155−
156− -- * Parsers
157− -- ** From Folds
158− , fromFold
159−
160− -- ** Without Input
161− -- , fromFoldMaybe
162− , fromPure
163− , fromEffect
164− , die
165− -- , dieM
166− , peek
167− , eof
168−
169− -- ** Element parsers
170−
171− -- All of these can be expressed in terms of either
172− , one
173− -- , oneEq
174− -- , oneNotEq
175− , oneOf
176− , noneOf
177− , satisfy
178− -- , maybe
179− -- , either
180−
181− -- ** Sequences
182− , streamEqBy
183− , listEqBy
184− , listEq
185−
186− -- * Combinators
187− -- Mapping on output
188− -- , rmapM
189−
190− -- ** Mapping on input
191− , lmap
192− , lmapM
193−
194− -- * Map on output
195− , rmapM
196−
197− -- ** Filtering
198− , filter
199−
200− -- ** Look Ahead
201− , lookAhead
202−
203− -- ** Tokenize by length
204− -- , takeBetween
205− , takeEQ
206− -- , takeGE
207− -- , takeP
208−
209− -- ** Tokenize by predicate
210− -- , takeWhileP
211− , takeWhile
212− , takeWhile1
213− , dropWhile
214− -- , takeEndBy
215− -- , takeEndByEsc
216− -- , takeStartBy
217− , wordBy
218−
219− -- ** Grouping
220− , groupBy
221− , groupByRolling
222− , groupByRollingEither
223−
224− -- ** Framing
225− -- , wordFramedBy
226− , wordWithQuotes
227− -- , wordProcessQuotes
228− -- , wordKeepQuotes
229−
230− -- -- * Alternative
231− -- , alt
232−
233− -- ** Splitting
234− , many
235− , some
236− , manyTill
237−
238− -- ** De-interleaving
239− , deintercalate
240− )
241−
242−where
243−
244−import Streamly.Internal.Data.Parser
245−import Prelude hiding (dropWhile, takeWhile, filter)
246−
247−#include "DocTestDataParser.hs"
core/src/Streamly/Data/ParserK.hsdeleted−139
@@ -1,139 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−-- |
3−-- Module : Streamly.Data.ParserK
4−-- Copyright : (c) 2023 Composewell Technologies
5−-- License : BSD-3-Clause
6−-- Maintainer : streamly@composewell.com
7−-- Stability : pre-release
8−-- Portability : GHC
9−--
10−-- See the general notes about parsing in the "Streamly.Data.Parser" module.
11−-- This module implements a using Continuation Passing Style (CPS) wrapper over
12−-- the "Streamly.Data.Parser" module. It is as fast or faster than attoparsec.
13−--
14−-- == Parser vs ParserK
15−--
16−-- 'ParserK' is preferred over 'Streamly.Data.Parser.Parser' when extensive
17−-- applicative, alternative and monadic composition is required, or when
18−-- recursive or dynamic composition of parsers is required. The
19−-- 'Streamly.Data.Parser.Parser' type fuses statically and creates efficient
20−-- loops whereas 'ParserK' uses function call based composition and has
21−-- comparatively larger runtime overhead but it is better suited to the
22−-- specific use cases mentioned above. 'ParserK' also allows to efficient parse
23−-- a stream of arrays, it can also break the input stream into a parse result
24−-- and remaining stream so that the stream can be parsed independently in
25−-- segments.
26−--
27−-- == Using ParserK
28−--
29−-- All the parsers from the "Streamly.Data.Parser" module can be adapted to
30−-- ParserK using the 'Streamly.Data.ParserK.adaptC',
31−-- 'Streamly.Internal.Data.ParserK.adapt', and
32−-- 'Streamly.Internal.Data.ParserK.adaptCG' combinators.
33−--
34−-- 'Streamly.Data.StreamK.parseChunks' runs a parser on a stream of unboxed
35−-- arrays, this is the preferred and most efficient way to parse chunked input.
36−-- The more general 'Streamly.Data.StreamK.parseBreakChunks' function returns
37−-- the remaining stream as well along with the parse result. There are
38−-- 'Streamly.Internal.Data.StreamK.parseChunksGeneric',
39−-- 'Streamly.Internal.Data.StreamK.parseBreakChunksGeneric' as well to run
40−-- parsers on boxed arrays. 'Streamly.Internal.Data.StreamK.parse',
41−-- 'Streamly.Internal.Data.StreamK.parseBreak' run parsers on a stream of
42−-- individual elements instead of stream of arrays.
43−--
44−-- == Monadic Composition
45−--
46−-- Monad composition can be used for lookbehind parsers, we can dynamically
47−-- compose new parsers based on the results of the previously parsed values.
48−--
49−-- If we have to parse "a9" or "9a" but not "99" or "aa" we can use the
50−-- following non-monadic, backtracking parser:
51−--
52−-- >>> digits p1 p2 = ((:) <$> p1 <*> ((:) <$> p2 <*> pure []))
53−-- >>> :{
54−-- backtracking :: Monad m => ParserK Char m String
55−-- backtracking = ParserK.adapt $
56−-- digits (Parser.satisfy isDigit) (Parser.satisfy isAlpha)
57−-- <|>
58−-- digits (Parser.satisfy isAlpha) (Parser.satisfy isDigit)
59−-- :}
60−--
61−-- We know that if the first parse resulted in a digit at the first place then
62−-- the second parse is going to fail. However, we waste that information and
63−-- parse the first character again in the second parse only to know that it is
64−-- not an alphabetic char. By using lookbehind in a 'Monad' composition we can
65−-- avoid redundant work:
66−--
67−-- >>> data DigitOrAlpha = Digit Char | Alpha Char
68−--
69−-- >>> :{
70−-- lookbehind :: Monad m => ParserK Char m String
71−-- lookbehind = do
72−-- x1 <- ParserK.adapt $
73−-- Digit <$> Parser.satisfy isDigit
74−-- <|> Alpha <$> Parser.satisfy isAlpha
75−-- -- Note: the parse depends on what we parsed already
76−-- x2 <- ParserK.adapt $
77−-- case x1 of
78−-- Digit _ -> Parser.satisfy isAlpha
79−-- Alpha _ -> Parser.satisfy isDigit
80−-- return $ case x1 of
81−-- Digit x -> [x,x2]
82−-- Alpha x -> [x,x2]
83−-- :}
84−--
85−-- == Experimental APIs
86−--
87−-- Please refer to "Streamly.Internal.Data.ParserK" for functions that have
88−-- not yet been released.
89−--
90−module Streamly.Data.ParserK
91− (
92− -- * Setup
93− -- | To execute the code examples provided in this module in ghci, please
94− -- run the following commands first.
95− --
96− -- $setup
97−
98− -- * Parser Type
99− ParserK
100−
101− -- * Parsers
102− -- ** Conversions
103− , adapt
104− , adaptC
105− , adaptCG
106− -- , toParser
107−
108− -- ** Without Input
109− , fromPure
110− , fromEffect
111− , die
112−
113− -- * Deprecated
114− , fromFold
115− , fromParser
116− )
117−
118−where
119−
120−import Control.Monad.IO.Class (MonadIO)
121−import Streamly.Internal.Data.Fold (Fold)
122−import Streamly.Internal.Data.Unbox (Unbox)
123−import Streamly.Internal.Data.Array (Array)
124−import qualified Streamly.Internal.Data.Parser as ParserD
125−
126−import Streamly.Internal.Data.ParserK.Type
127−
128−#include "DocTestDataParserK.hs"
129−
130−{-# DEPRECATED fromFold "Please use \"ParserK.adaptC . Parser.fromFold\" instead." #-}
131−{-# INLINE fromFold #-}
132−fromFold :: (MonadIO m, Unbox a) => Fold m a b -> ParserK (Array a) m b
133−fromFold = adaptC . ParserD.fromFold
134−
135−{-# DEPRECATED fromParser "Please use \"adaptC\" instead." #-}
136−{-# INLINE fromParser #-}
137−fromParser ::
138− (MonadIO m, Unbox a) => ParserD.Parser a m b -> ParserK (Array a) m b
139−fromParser = adaptC
core/src/Streamly/Data/Stream.hsdeleted−746
@@ -1,746 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−-- |
3−-- Module : Streamly.Data.Stream
4−-- Copyright : (c) 2017 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−-- Stability : released
9−-- Portability : GHC
10−--
11−-- Streams represented as state machines, that fuse together when composed
12−-- statically, eliminating function calls or intermediate constructor
13−-- allocations - generating tight, efficient loops. Suitable for high
14−-- performance looping operations.
15−--
16−-- If you need to call these operations recursively in a loop (i.e. composed
17−-- dynamically) then it is recommended to use the continuation passing style
18−-- (CPS) stream operations from the "Streamly.Data.StreamK" module. 'Stream'
19−-- and 'StreamK' types are interconvertible. See more details in the
20−-- documentation below regarding 'Stream' vs 'StreamK'.
21−--
22−-- Please refer to "Streamly.Internal.Data.Stream" for more functions that have
23−-- not yet been released.
24−--
25−-- Checkout the <https://github.com/composewell/streamly-examples>
26−-- repository for many more real world examples of stream programming.
27−
28−module Streamly.Data.Stream
29− (
30− -- * Setup
31− -- | To execute the code examples provided in this module in ghci, please
32− -- run the following commands first.
33− --
34− -- $setup
35−
36− -- * Overview
37− -- $overview
38−
39− -- * The Stream Type
40− Stream
41−
42− -- * Construction
43− -- | Functions ending in the general shape @b -> Stream m a@.
44− --
45− -- Useful Idioms:
46− --
47− -- >>> fromIndices f = fmap f $ Stream.enumerateFrom 0
48− -- >>> fromIndicesM f = Stream.mapM f $ Stream.enumerateFrom 0
49− -- >>> fromListM = Stream.sequence . Stream.fromList
50− -- >>> fromFoldable = StreamK.toStream . StreamK.fromFoldable
51− -- >>> fromFoldableM = Stream.sequence . fromFoldable
52−
53− -- ** Primitives
54− -- | A fused 'Stream' is never constructed using these primitives, they are
55− -- typically generated by converting containers like list into streams, or
56− -- generated using custom functions provided in this module. The 'cons'
57− -- primitive in this module has a rare use in fusing a small number of
58− -- elements. On the other hand, it is common to construct 'StreamK' stream
59− -- using the StreamK.'StreamK.cons' primitive.
60− , nil
61− , nilM
62− , cons
63− , consM
64−
65− -- ** Unfolding
66− -- | 'unfoldrM' is the most general way of generating a stream efficiently.
67− -- All other generation operations can be expressed using it.
68− , unfoldr
69− , unfoldrM
70−
71− -- ** From Values
72− -- | Generate a monadic stream from a seed value or values.
73− --
74− -- Non-empty pure streams can be cycled using repeat and unfold:
75− --
76− -- >>> cycle = Stream.unfoldMany Unfold.fromList . Stream.repeat
77− --
78− -- Non-empty StreamK can be cycled using append:
79− --
80− -- >>> cycle xs = let ys = xs `StreamK.append` ys in ys
81− --
82− , fromPure
83− , fromEffect
84− , repeat
85− , repeatM
86− , replicate
87− , replicateM
88−
89− -- Note: Using enumeration functions e.g. 'Prelude.enumFromThen' turns out
90− -- to be slightly faster than the idioms like @[from, then..]@.
91− --
92− -- ** Enumeration
93− -- | We can use the 'Enum' type class to enumerate a type producing a list
94− -- and then convert it to a stream:
95− --
96− -- @
97− -- 'fromList' $ 'Prelude.enumFromThen' from then
98− -- @
99− --
100− -- However, this is not particularly efficient.
101− -- The 'Enumerable' type class provides corresponding functions that
102− -- generate a stream instead of a list, efficiently.
103−
104− , Enumerable (..)
105− , enumerate
106− , enumerateTo
107−
108− -- ** Iteration
109− , iterate
110− , iterateM
111−
112− -- ** From Containers
113− -- | Convert an input structure, container or source into a stream. All of
114− -- these can be expressed in terms of primitives.
115− , fromList
116−
117− -- ** From Unfolds
118− -- | Most of the above stream generation operations can also be expressed
119− -- using the corresponding unfolds in the "Streamly.Data.Unfold" module.
120− , unfold -- XXX rename to fromUnfold?
121−
122− -- * Elimination
123− -- | Functions ending in the general shape @Stream m a -> m b@ or @Stream m
124− -- a -> m (b, Stream m a)@
125− --
126−
127−-- EXPLANATION: In imperative terms a fold can be considered as a loop over the stream
128−-- that reduces the stream to a single value.
129−-- Left and right folds both use a fold function @f@ and an identity element
130−-- @z@ (@zero@) to deconstruct a recursive data structure and reconstruct a
131−-- new data structure. The new structure may be a recursive construction (a
132−-- container) or a non-recursive single value reduction of the original
133−-- structure.
134−--
135−-- Both right and left folds are mathematical duals of each other, they are
136−-- functionally equivalent. Operationally, a left fold on a left associated
137−-- structure behaves exactly in the same way as a right fold on a right
138−-- associated structure. Similarly, a left fold on a right associated structure
139−-- behaves in the same way as a right fold on a left associated structure.
140−-- However, the behavior of a right fold on a right associated structure is
141−-- operationally different (even though functionally equivalent) than a left
142−-- fold on the same structure.
143−--
144−-- On right associated structures like Haskell @cons@ lists or Streamly
145−-- streams, a lazy right fold is naturally suitable for lazy recursive
146−-- reconstruction of a new structure, while a strict left fold is naturally
147−-- suitable for efficient reduction. In right folds control is in the hand of
148−-- the @puller@ whereas in left folds the control is in the hand of the
149−-- @pusher@.
150−--
151−-- The behavior of right and left folds are described in detail in the
152−-- individual fold's documentation. To illustrate the two folds for right
153−-- associated @cons@ lists:
154−--
155−-- > foldr :: (a -> b -> b) -> b -> [a] -> b
156−-- > foldr f z [] = z
157−-- > foldr f z (x:xs) = x `f` foldr f z xs
158−-- >
159−-- > foldl :: (b -> a -> b) -> b -> [a] -> b
160−-- > foldl f z [] = z
161−-- > foldl f z (x:xs) = foldl f (z `f` x) xs
162−--
163−-- @foldr@ is conceptually equivalent to:
164−--
165−-- > foldr f z [] = z
166−-- > foldr f z [x] = f x z
167−-- > foldr f z xs = foldr f (foldr f z (tail xs)) [head xs]
168−--
169−-- @foldl@ is conceptually equivalent to:
170−--
171−-- > foldl f z [] = z
172−-- > foldl f z [x] = f z x
173−-- > foldl f z xs = foldl f (foldl f z (init xs)) [last xs]
174−--
175−-- Left and right folds are duals of each other.
176−--
177−-- @
178−-- foldr f z xs = foldl (flip f) z (reverse xs)
179−-- foldl f z xs = foldr (flip f) z (reverse xs)
180−-- @
181−--
182−-- More generally:
183−--
184−-- @
185−-- foldr f z xs = foldl g id xs z where g k x = k . f x
186−-- foldl f z xs = foldr g id xs z where g x k = k . flip f x
187−-- @
188−--
189−
190−-- NOTE: Folds are inherently serial as each step needs to use the result of
191−-- the previous step. However, it is possible to fold parts of the stream in
192−-- parallel and then combine the results using a monoid.
193−
194− -- ** Primitives
195− -- Consuming a part of the stream and returning the rest. Functions
196− -- ending in the general shape @Stream m a -> m (b, Stream m a)@
197− , uncons
198−
199− -- ** Strict Left Folds
200− -- XXX Need to have a general parse operation here which can be used to
201− -- express all others.
202− , fold -- XXX rename to run? We can have a Stream.run and Fold.run.
203− -- XXX fold1 can be achieved using Monoids or Refolds.
204− -- XXX We can call this just "break" and parseBreak as "munch"
205− , foldBreak
206−
207− -- XXX should we have a Fold returning function in stream module?
208− -- , foldAdd
209− -- , buildl
210−
211− -- ** Parsing
212− , parse
213− -- , parseBreak
214−
215− -- ** Lazy Right Folds
216− -- | Consuming a stream to build a right associated expression, suitable
217− -- for lazy evaluation. Evaluation of the input happens when the output of
218− -- the fold is evaluated, the fold output is a lazy thunk.
219− --
220− -- This is suitable for stream transformation operations, for example,
221− -- operations like mapping a function over the stream.
222− , foldrM
223− , foldr
224− -- foldr1
225−
226− -- ** Specific Folds
227− -- | Streams are folded using folds in "Streamly.Data.Fold". Here are some
228− -- idioms and equivalents of Data.List APIs using folds:
229− --
230− -- >>> foldlM' f a = Stream.fold (Fold.foldlM' f a)
231− -- >>> foldl1' f = Stream.fold (Fold.foldl1' f)
232− -- >>> foldl' f a = Stream.fold (Fold.foldl' f a)
233− -- >>> drain = Stream.fold Fold.drain
234− -- >>> mapM_ f = Stream.fold (Fold.drainMapM f)
235− -- >>> length = Stream.fold Fold.length
236− -- >>> genericLength = Stream.fold Fold.lengthGeneric
237− -- >>> head = Stream.fold Fold.one
238− -- >>> last = Stream.fold Fold.latest
239− -- >>> null = Stream.fold Fold.null
240− -- >>> and = Stream.fold Fold.and
241− -- >>> or = Stream.fold Fold.or
242− -- >>> any p = Stream.fold (Fold.any p)
243− -- >>> all p = Stream.fold (Fold.all p)
244− -- >>> sum = Stream.fold Fold.sum
245− -- >>> product = Stream.fold Fold.product
246− -- >>> maximum = Stream.fold Fold.maximum
247− -- >>> maximumBy cmp = Stream.fold (Fold.maximumBy cmp)
248− -- >>> minimum = Stream.fold Fold.minimum
249− -- >>> minimumBy cmp = Stream.fold (Fold.minimumBy cmp)
250− -- >>> elem x = Stream.fold (Fold.elem x)
251− -- >>> notElem x = Stream.fold (Fold.notElem x)
252− -- >>> lookup x = Stream.fold (Fold.lookup x)
253− -- >>> find p = Stream.fold (Fold.find p)
254− -- >>> (!?) i = Stream.fold (Fold.index i)
255− -- >>> genericIndex i = Stream.fold (Fold.indexGeneric i)
256− -- >>> elemIndex x = Stream.fold (Fold.elemIndex x)
257− -- >>> findIndex p = Stream.fold (Fold.findIndex p)
258− --
259− -- Some equivalents of Data.List APIs from the Stream module:
260− --
261− -- >>> head = fmap (fmap fst) . Stream.uncons
262− -- >>> tail = fmap (fmap snd) . Stream.uncons
263− -- >>> tail = Stream.tail -- unreleased API
264− -- >>> init = Stream.init -- unreleased API
265− --
266− -- A Stream based toList fold implementation is provided below because it
267− -- has a better performance compared to the fold.
268−
269− -- Functions in Data.List, missing here:
270− -- unsnoc = Stream.parseBreak (Parser.init Fold.toList)
271− -- genericTake
272− -- genericDrop
273− -- genericSplitAt
274− -- genericReplicate
275− , toList
276−
277− -- * Mapping
278− -- | Stateless one-to-one transformations. Use 'fmap' for mapping a pure
279− -- function on a stream.
280−
281− -- EXPLANATION:
282− -- In imperative terms a map operation can be considered as a loop over
283− -- the stream that transforms the stream into another stream by performing
284− -- an operation on each element of the stream.
285− --
286− -- 'map' is the least powerful transformation operation with strictest
287− -- guarantees. A map, (1) is a stateless loop which means that no state is
288− -- allowed to be carried from one iteration to another, therefore,
289− -- operations on different elements are guaranteed to not affect each
290− -- other, (2) is a strictly one-to-one transformation of stream elements
291− -- which means it guarantees that no elements can be added or removed from
292− -- the stream, it can merely transform them.
293− , sequence
294− , mapM
295− , trace
296− , tap
297− , delay
298−
299− -- * Scanning
300− -- | Stateful one-to-one transformations.
301− --
302−
303− {-
304− -- ** Left scans
305− -- | We can perform scans using folds with the 'scan' combinator in the
306− -- next section. However, the combinators supplied in this section are
307− -- better amenable to stream fusion when combined with other operations.
308− -- Note that 'postscan' using folds fuses well and does not require custom
309− -- combinators like these.
310− , scanl'
311− , scanlM'
312− , scanl1'
313− , scanl1M'
314− -}
315−
316− -- ** Scanning By 'Fold'
317− -- | Useful idioms:
318− --
319− -- >>> scanl' f z = Stream.scan (Fold.foldl' f z)
320− -- >>> scanlM' f z = Stream.scan (Fold.foldlM' f z)
321− -- >>> postscanl' f z = Stream.postscan (Fold.foldl' f z)
322− -- >>> postscanlM' f z = Stream.postscan (Fold.foldlM' f z)
323− -- >>> scanl1' f = Stream.catMaybes . Stream.scan (Fold.foldl1' f)
324− -- >>> scanl1M' f = Stream.catMaybes . Stream.scan (Fold.foldlM1' f)
325− , scan
326− , postscan
327− -- XXX postscan1 can be implemented using Monoids or Refolds.
328− -- The following scans from Data.List are not provided.
329− -- XXX scanl
330− -- XXX scanl1
331− -- XXX scanr
332− -- XXX scanr1
333− -- XXX mapAccumL
334− -- XXX mapAccumR
335− -- XXX inits
336− -- XXX tails
337−
338− -- ** Specific scans
339− -- Indexing can be considered as a special type of zipping where we zip a
340− -- stream with an index stream.
341− , indexed
342−
343− -- * Insertion
344− -- | Add elements to the stream.
345− --
346− -- >>> insert = Stream.insertBy compare
347−
348− -- Inserting elements is a special case of interleaving/merging streams.
349− , insertBy
350− , intersperseM
351− , intersperseM_
352− , intersperse
353−
354− -- * Filtering
355− -- | Remove elements from the stream.
356−
357− -- ** Stateless Filters
358− -- | 'mapMaybeM' is the most general stateless filtering operation. All
359− -- other filtering operations can be expressed using it.
360−
361− -- EXPLANATION:
362− -- In imperative terms a filter over a stream corresponds to a loop with a
363− -- @continue@ clause for the cases when the predicate fails.
364−
365− , mapMaybe
366− , mapMaybeM
367− , filter
368− , filterM
369−
370− -- Filter and concat
371− , catMaybes
372− , catLefts
373− , catRights
374− , catEithers
375−
376− -- ** Stateful Filters
377− -- | 'scanMaybe' is the most general stateful filtering operation. The
378− -- filtering folds (folds returning a 'Maybe' type) in
379− -- "Streamly.Internal.Data.Fold" can be used along with 'scanMaybe' to
380− -- perform stateful filtering operations in general.
381− --
382− -- Idioms and equivalents of Data.List APIs:
383− --
384− -- >>> deleteBy cmp x = Stream.scanMaybe (Fold.deleteBy cmp x)
385− -- >>> deleteBy = Stream.deleteBy -- unreleased API
386− -- >>> delete = deleteBy (==)
387− -- >>> findIndices p = Stream.scanMaybe (Fold.findIndices p)
388− -- >>> elemIndices a = findIndices (== a)
389− -- >>> uniq = Stream.scanMaybe (Fold.uniqBy (==))
390− -- >>> partition p = Stream.fold (Fold.partition Fold.toList Fold.toList) . fmap (if p then Left else Right)
391− , scanMaybe
392− , take
393− , takeWhile
394− , takeWhileM
395− , drop
396− , dropWhile
397− , dropWhileM
398− -- XXX write to an array in reverse and then read in reverse
399− -- > dropWhileEnd = reverse . dropWhile p . reverse
400−
401− -- XXX These are available as scans in folds. We need to check the
402− -- performance though. If these are common and we need convenient stream
403− -- ops then we can expose these.
404−
405− -- , deleteBy
406− -- , uniq
407− -- , uniqBy
408−
409− -- -- ** Sampling
410− -- , strideFromThen
411−
412− -- -- ** Searching
413− -- Finding the presence or location of an element, a sequence of elements
414− -- or another stream within a stream.
415−
416− -- -- ** Searching Elements
417− -- , findIndices
418− -- , elemIndices
419−
420− -- * Combining Two Streams
421− -- | Note that these operations are suitable for statically fusing a few
422− -- streams, they have a quadratic O(n^2) time complexity wrt to the number
423− -- of streams. If you want to compose many streams dynamically using binary
424− -- combining operations see the corresponding operations in
425− -- "Streamly.Data.StreamK".
426− --
427− -- When fusing more than two streams it is more efficient if the binary
428− -- operations are composed as a balanced tree rather than a right
429− -- associative or left associative one e.g.:
430− --
431− -- >>> s1 = Stream.fromList [1,2] `Stream.append` Stream.fromList [3,4]
432− -- >>> s2 = Stream.fromList [4,5] `Stream.append` Stream.fromList [6,7]
433− -- >>> s = s1 `Stream.append` s2
434−
435− -- ** Appending
436− -- | Equivalent of Data.List append:
437− --
438− -- >>> (++) = Stream.append
439− , append
440−
441− -- ** Interleaving
442− , interleave
443−
444− -- ** Merging
445− , mergeBy
446− , mergeByM
447−
448− -- ** Zipping
449− -- | Idioms and equivalents of Data.List APIs:
450− --
451− -- >>> zip = Stream.zipWith (,)
452− -- >>> unzip = Stream.fold (Fold.unzip Fold.toList Fold.toList)
453− , zipWith
454− , zipWithM
455− -- XXX zipWith3,4,5,6,7
456− -- XXX unzip3,4,5,6,7
457− -- , ZipStream (..)
458−
459− -- ** Cross Product
460− -- XXX The argument order in this operation is such that it seems we are
461− -- transforming the first stream using the second stream because the second
462− -- stream is evaluated many times or buffered and better be finite, first
463− -- stream could potentially be infinite. In the tradition of using the
464− -- transformed stream at the end we can have a flipped version called
465− -- "crossMap" or "nestWith".
466− , crossWith
467− -- , cross
468− -- , joinInner
469− -- , CrossStream (..)
470−
471− -- * Unfold Each
472− , unfoldMany
473− , intercalate
474− , intercalateSuffix
475−
476− -- * Stream of streams
477− -- | Stream operations like map and filter represent loop processing in
478− -- imperative programming terms. Similarly, the imperative concept of
479− -- nested loops are represented by streams of streams. The 'concatMap'
480− -- operation represents nested looping.
481− -- A 'concatMap' operation loops over the input stream and then for each
482− -- element of the input stream generates another stream and then loops over
483− -- that inner stream as well producing effects and generating a single
484− -- output stream.
485− --
486− -- One dimension loops are just a special case of nested loops. For
487− -- example, 'concatMap' can degenerate to a simple map operation:
488− --
489− -- >>> map f m = Stream.concatMap (\x -> Stream.fromPure (f x)) m
490− --
491− -- Similarly, 'concatMap' can perform filtering by mapping an element to a
492− -- 'nil' stream:
493− --
494− -- >>> filter p m = Stream.concatMap (\x -> if p x then Stream.fromPure x else Stream.nil) m
495− --
496− -- Idioms and equivalents of Data.List APIs:
497− --
498− -- >>> concat = Stream.concatMap id
499− -- >>> unlines = Stream.interposeSuffix '\n'
500− -- >>> unlines = Stream.intercalateSuffix Unfold.fromList "\n"
501− -- >>> unwords = Stream.interpose ' '
502− -- >>> unwords = Stream.intercalate Unfold.fromList " "
503−
504− , concatEffect
505− , concatMap
506− , concatMapM
507−
508− -- * Repeated Fold
509− -- | Idioms and equivalents of Data.List APIs:
510− --
511− -- >>> groupsOf n = Stream.foldMany (Fold.take n Fold.toList)
512− -- >>> groupBy eq = Stream.groupsWhile eq Fold.toList
513− -- >>> groupBy eq = Stream.parseMany (Parser.groupBy eq Fold.toList)
514− -- >>> groupsByRolling eq = Stream.parseMany (Parser.groupByRolling eq Fold.toList)
515− -- >>> groups = groupBy (==)
516− , foldMany -- XXX Rename to foldRepeat
517− , groupsOf
518− , parseMany
519−
520− -- * Splitting
521− -- | Idioms and equivalents of Data.List APIs:
522− --
523− -- >>> splitWithSuffix p f = Stream.foldMany (Fold.takeEndBy p f)
524− -- >>> splitOnSuffix p f = Stream.foldMany (Fold.takeEndBy_ p f)
525− -- >>> lines = splitOnSuffix (== '\n')
526− -- >>> words = Stream.wordsBy isSpace
527− -- >>> splitAt n = Stream.fold (Fold.splitAt n Fold.toList Fold.toList)
528− -- >>> span p = Parser.splitWith (,) (Parser.takeWhile p Fold.toList) (Parser.fromFold Fold.toList)
529− -- >>> break p = span (not . p)
530− , splitOn
531− , wordsBy
532−
533− -- * Buffered Operations
534− -- | Operations that require buffering of the stream.
535− -- Reverse is essentially a left fold followed by an unfold.
536− --
537− -- Idioms and equivalents of Data.List APIs:
538− --
539− -- >>> nub = Stream.fold Fold.toList . Stream.scanMaybe Fold.nub
540− -- >>> nub = Stream.ordNub -- unreleased API
541− -- >>> sortBy = StreamK.sortBy
542− -- >>> sortOn f = StreamK.sortOn -- unreleased API
543− -- >>> deleteFirstsBy = Stream.deleteFirstsBy -- unreleased
544− -- >>> (\\) = Stream.deleteFirstsBy (==) -- unreleased
545− -- >>> intersectBy = Stream.intersectBy -- unreleased
546− -- >>> intersect = Stream.intersectBy (==) -- unreleased
547− -- >>> unionBy = Stream.unionBy -- unreleased
548− -- >>> union = Stream.unionBy (==) -- unreleased
549− --
550− , reverse
551− -- XXX transpose: write the streams to arrays and then stream transposed.
552− -- XXX subsequences
553− -- XXX permutations
554− -- , nub
555− -- , ordNub
556− -- , nubBy
557−
558− -- * Multi-Stream folds
559− -- | Operations that consume multiple streams at the same time.
560− , eqBy
561− , cmpBy
562− , isPrefixOf
563− , isInfixOf
564− -- , isSuffixOf
565− -- , isSuffixOfUnbox
566− , isSubsequenceOf
567−
568− -- trimming sequences
569− -- , stripPrefix
570− -- , stripSuffix
571− -- , stripSuffixUnbox
572−
573− -- Exceptions and resource management depend on the "exceptions" package
574− -- XXX We can have IO Stream operations not depending on "exceptions"
575− -- in Exception.Base
576−
577− -- * Exceptions
578− -- | Note that the stream exception handling routines catch and handle
579− -- exceptions only in the stream generation steps and not in the consumer
580− -- of the stream. For example, if we are folding or parsing a stream - any
581− -- exceptions in the fold or parse steps won't be observed by the stream
582− -- exception handlers. Exceptions in the fold or parse steps can be handled
583− -- using the fold or parse exception handling routines. You can wrap the
584− -- stream elimination function in the monad exception handler to observe
585− -- exceptions in the stream as well as the consumer.
586− --
587− -- Most of these combinators inhibit stream fusion, therefore, when
588− -- possible, they should be called in an outer loop to mitigate the cost.
589− -- For example, instead of calling them on a stream of chars call them on a
590− -- stream of arrays before flattening it to a stream of chars.
591− --
592− , onException
593− , handle
594−
595− -- * Resource Management
596− -- | 'bracket' is the most general resource management operation, all other
597− -- operations can be expressed using it. These functions have IO suffix
598− -- because the allocation and cleanup functions are IO actions. For
599− -- generalized allocation and cleanup functions, see the functions without
600− -- the IO suffix in the "streamly" package.
601− --
602− -- Note that these operations bracket the stream generation only, they do
603− -- not cover the stream consumer. This means if an exception occurs in
604− -- the consumer of the stream (e.g. in a fold or parse step) then the
605− -- exception won't be observed by the stream resource handlers, in that
606− -- case the resource cleanup handler runs when the stream is garbage
607− -- collected.
608− --
609− -- Monad level resource management can always be used around the stream
610− -- elimination functions, such a function can observe exceptions in both
611− -- the stream and its consumer.
612− , before
613− , afterIO
614− , finallyIO
615− , bracketIO
616− , bracketIO3
617−
618− -- * Transforming Inner Monad
619−
620− , morphInner
621− , liftInner
622− , runReaderT
623− , runStateT
624−
625− -- XXX Arrays could be different types, therefore, this should be in
626− -- specific array module. Or maybe we should abstract over array types.
627− -- * Stream of Arrays
628− , Array.chunksOf
629− )
630−where
631−
632−import Streamly.Internal.Data.Stream
633−import Prelude
634− hiding (filter, drop, dropWhile, take, takeWhile, zipWith, foldr,
635− mapM, sequence, reverse, iterate, foldr1, repeat, replicate,
636− concatMap)
637−
638−import qualified Streamly.Internal.Data.Array.Type as Array
639−
640−#include "DocTestDataStream.hs"
641−
642−-- $overview
643−--
644−-- Streamly is a framework for modular data flow based programming and
645−-- declarative concurrency. Powerful stream fusion framework in streamly
646−-- allows high performance combinatorial programming even when using byte level
647−-- streams. Streamly API is similar to Haskell lists.
648−--
649−-- == Console Echo Example
650−--
651−-- In the following example, 'repeatM' generates an infinite stream of 'String'
652−-- by repeatedly performing the 'getLine' IO action. 'mapM' then applies
653−-- 'putStrLn' on each element in the stream converting it to stream of '()'.
654−-- Finally, 'drain' folds the stream to IO discarding the () values, thus
655−-- producing only effects.
656−--
657−-- >>> import Data.Function ((&))
658−--
659−-- >>> :{
660−-- echo =
661−-- Stream.repeatM getLine -- Stream IO String
662−-- & Stream.mapM putStrLn -- Stream IO ()
663−-- & Stream.fold Fold.drain -- IO ()
664−-- :}
665−--
666−-- This is a console echo program. It is an example of a declarative loop
667−-- written using streaming combinators. Compare it with an imperative @while@
668−-- loop.
669−--
670−-- Hopefully, this gives you an idea how we can program declaratively by
671−-- representing loops using streams. In this module, you can find all
672−-- "Data.List" like functions and many more powerful combinators to perform
673−-- common programming tasks.
674−--
675−-- == Stream Fusion
676−--
677−-- The fused 'Stream' type in this module employs stream fusion for C-like
678−-- performance when looping over data. It represents the stream as a state
679−-- machine using an explicit state, and a step function working on the state. A
680−-- typical stream operation consumes elements from the previous state machine
681−-- in a stream pipeline, transforms the elements and yields new values for the
682−-- next stage to consume. The stream operations are modular and represent a
683−-- single task, they have no knowledge of previous or next operation on the
684−-- elements.
685−--
686−-- A typical stream pipeline consists of a stream producer, several stream
687−-- transformation operations and a stream consumer. All these operations taken
688−-- together form a closed loop processing the stream elements. Elements are
689−-- transferred between stages using a boxed data constructor. However, all the
690−-- stages of the pipeline are fused together by GHC, eliminating the boxing of
691−-- intermediate constructors, and thus forming a tight C like loop without any
692−-- boxed data being used in the loop.
693−--
694−-- Stream fusion works effectively when:
695−--
696−-- * the stream pipeline is composed statically (known at compile time)
697−-- * all the operations forming the loop are inlined
698−-- * the loop is not recursively defined, recursion breaks inlining
699−--
700−-- If these conditions cannot be met, the CPS style stream type 'StreamK' may
701−-- turn out to be a better choice than the fused stream type 'Stream'.
702−--
703−-- == Stream vs StreamK
704−--
705−-- The fused stream model avoids constructor allocations and function call
706−-- overheads. However, the stream is represented as a state machine, and to
707−-- generate stream elements it has to navigate the decision tree of the state
708−-- machine. Moreover, the state machine is cranked for each element in the
709−-- stream. This performs extremely well when the number of states are limited.
710−-- The state machine starts getting expensive as the number of states increase.
711−-- For example, generating a stream from a list requires a single state and is
712−-- very efficient, even if it has millions of elements. However, using 'cons'
713−-- to construct a million element stream would be a disaster.
714−--
715−-- A typical worst case scenario for fused stream model is a large number of
716−-- `cons` or `append` operations. A few static `cons` or `append` operations
717−-- are very fast and much faster than a CPS style stream because CPS involves a
718−-- function call for each element whereas fused stream involves a few
719−-- conditional branches in the state machine. However, constructing a large
720−-- stream using `cons` introduces as many states in the state machine as the
721−-- number of elements. If we compose `cons` as a balanced binary tree it will
722−-- take @n * log n@ time to navigate the tree, and @n * n@ if it is a right
723−-- associative composition.
724−--
725−-- Operations like 'cons' or 'append'; are typically recursively called to
726−-- construct a lazy infinite stream. For such use cases the CPS style 'StreamK'
727−-- should be used. CPS streams do not have a state machine that needs to be
728−-- cranked for each element, past state has no effect on the future element
729−-- processing. However, CPS incurs a function call overhead for each element
730−-- processed, the overhead could be large compared to a fused state machine
731−-- even if it has many states. However, because of its linear performance
732−-- characterstics, after a certain threshold of stream compositions the CPS
733−-- stream would perform much better than the quadratic fused stream operations.
734−--
735−-- As a general guideline, you need to use 'StreamK' when you have to use
736−-- 'cons', 'append' or other operations having quadratic complexity at a large
737−-- scale. Typically, in such cases you need to compose the stream recursively,
738−-- by calling an operation in a loop. The decision to compose the stream is
739−-- taken at run time rather than statically at compile time.
740−--
741−-- Typically you would compose a 'StreamK' of chunks of data so that the
742−-- StreamK overhead is not high, and then process the chunks using 'Stream' by
743−-- using statically fused stream pipeline operations on the chunks.
744−--
745−-- 'Stream' and 'StreamK' types can be interconverted. See
746−-- "Streamly.Data.StreamK" module for conversion operations.
core/src/Streamly/Data/StreamK.hsdeleted−194
@@ -1,194 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−-- |
3−-- Module : Streamly.Data.StreamK
4−-- Copyright : (c) 2017 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−-- Stability : released
9−-- Portability : GHC
10−--
11−-- Streams represented as chains of functions calls using Continuation Passing
12−-- Style (CPS), suitable for dynamically composing potentially large number of
13−-- streams.
14−--
15−-- Unlike the statically fused operations in "Streamly.Data.Stream", StreamK
16−-- operations are less efficient, involving a function call overhead for each
17−-- element, but they exhibit linear O(n) time complexity wrt to the number of
18−-- stream compositions. Therefore, they are suitable for dynamically composing
19−-- streams e.g. appending potentially infinite streams in recursive loops.
20−-- While fused streams can be used to efficiently process elements as small as
21−-- a single byte, CPS streams are typically used on bigger chunks of data to
22−-- avoid the larger overhead per element. For more details See the @Stream vs
23−-- StreamK@ section in the "Streamly.Data.Stream" module.
24−--
25−-- In addition to the combinators in this module, you can use operations from
26−-- "Streamly.Data.Stream" for StreamK as well by converting StreamK to Stream
27−-- ('toStream'), and vice-versa ('fromStream'). Please refer to
28−-- "Streamly.Internal.Data.StreamK" for more functions that have not yet been
29−-- released.
30−--
31−-- For documentation see the corresponding combinators in
32−-- "Streamly.Data.Stream". Documentation has been omitted in this module unless
33−-- there is a difference worth mentioning or if the combinator does not exist
34−-- in "Streamly.Data.Stream".
35−
36−-- Notes:
37−--
38−-- primitive/open loop operations that can be used recursively e.g. uncons,
39−-- foldBreak, parseBreak should not be converted from StreamD for use in
40−-- StreamK, instead native StreamK impl should be used.
41−--
42−-- Closed loop operations like repeat, replicate, iterate etc can be converted
43−-- from StreamD.
44−--
45−-- In the last phase any operation like (toStreamK . f . toStreamD) should be
46−-- rewritten to a K version of f.
47−-- XXX Need to add rewrite rules for all missing StreamD operations.
48−--
49−module Streamly.Data.StreamK
50− (
51− -- * Setup
52− -- | To execute the code examples provided in this module in ghci, please
53− -- run the following commands first.
54− --
55− -- $setup
56−
57− -- * Overview
58− -- $overview
59−
60− -- * Type
61− StreamK
62−
63− -- * Construction
64− -- ** Primitives
65− -- | Primitives to construct a stream from pure values or monadic actions.
66− -- All other stream construction and generation combinators described later
67− -- can be expressed in terms of these primitives. However, the special
68− -- versions provided in this module can be much more efficient in some
69− -- cases. Users can create custom combinators using these primitives.
70− , nil
71− , nilM
72− , cons
73− , consM
74−
75− -- ** From Values
76− , fromPure
77− , fromEffect
78−
79− -- ** From Stream
80− -- | Please note that 'Stream' type does not observe any exceptions from
81− -- the consumer of the stream whereas 'StreamK' does.
82− , fromStream
83− , toStream
84−
85− -- ** From Containers
86− , fromFoldable
87−
88− -- * Elimination
89−
90− -- ** Primitives
91− , uncons
92− , drain
93−
94− -- -- ** Folding
95− -- , foldBreak
96−
97− -- ** Parsing
98− , parse
99− , parseBreak
100− , parseBreakChunks
101− , parseChunks
102−
103− -- * Transformation
104− , mapM
105− , dropWhile
106− , take
107−
108− -- * Combining Two Streams
109− -- | Unlike the operations in "Streamly.Data.Stream", these operations can
110− -- be used to dynamically compose large number of streams e.g. using the
111− -- 'concatMapWith' and 'mergeMapWith' operations. They have a linear O(n)
112− -- time complexity wrt to the number of streams being composed.
113−
114− -- ** Appending
115− , append
116−
117− -- ** Interleaving
118− , interleave
119−
120− -- ** Merging
121− , mergeBy
122− , mergeByM
123−
124− -- ** Zipping
125− , zipWith
126− , zipWithM
127−
128− -- ** Cross Product
129− -- XXX is "bind/concatFor" better to have than crossWith?
130− -- crossWith f xs1 xs2 = concatFor xs1 (\x -> fmap (f x) xs2)
131− , crossWith
132− -- , cross
133− -- , joinInner
134− -- , CrossStreamK (..)
135−
136− -- * Stream of streams
137− -- | Some useful idioms:
138− --
139− -- >>> concatFoldableWith f = Prelude.foldr f StreamK.nil
140− -- >>> concatMapFoldableWith f g = Prelude.foldr (f . g) StreamK.nil
141− -- >>> concatForFoldableWith f xs g = Prelude.foldr (f . g) StreamK.nil xs
142− --
143− , concatEffect
144− -- , concatMap
145− , concatMapWith
146− , mergeMapWith
147−
148− -- * Buffered Operations
149− , reverse
150− , sortBy
151−
152− -- * Exceptions
153− -- | Please note that 'Stream' type does not observe any exceptions from
154− -- the consumer of the stream whereas 'StreamK' does.
155− , handle
156−
157− -- * Resource Management
158− -- | Please note that 'Stream' type does not observe any exceptions from
159− -- the consumer of the stream whereas 'StreamK' does.
160− , bracketIO
161− )
162−where
163−
164−import Streamly.Internal.Data.StreamK
165−import Prelude hiding (reverse, zipWith, mapM, dropWhile, take)
166−
167−#include "DocTestDataStreamK.hs"
168−
169−-- $overview
170−--
171−-- Continuation passing style (CPS) stream implementation. The 'K' in 'StreamK'
172−-- stands for Kontinuation.
173−--
174−-- StreamK can be constructed like lists, except that they use 'nil' instead of
175−-- '[]' and 'cons' instead of ':'.
176−--
177−-- `cons` adds a pure value at the head of the stream:
178−--
179−-- >>> import Streamly.Data.StreamK (StreamK, cons, consM, nil)
180−-- >>> stream = 1 `cons` 2 `cons` nil :: StreamK IO Int
181−--
182−-- You can use operations from "Streamly.Data.Stream" for StreamK as well by
183−-- converting StreamK to Stream ('toStream'), and vice-versa ('fromStream').
184−--
185−-- >>> Stream.fold Fold.toList $ StreamK.toStream stream -- IO [Int]
186−-- [1,2]
187−--
188−-- `consM` adds an effect at the head of the stream:
189−--
190−-- >>> stream = effect 1 `consM` effect 2 `consM` nil
191−-- >>> Stream.fold Fold.toList $ StreamK.toStream stream
192−-- 1
193−-- 2
194−-- [1,2]
core/src/Streamly/FileSystem/Dir.hsdeleted−23
@@ -1,23 +0,0 @@
1−-- |
2−-- Module : Streamly.FileSystem.Dir
3−-- Copyright : (c) 2018 Composewell Technologies
4−--
5−-- License : BSD3
6−-- Maintainer : streamly@composewell.com
7−-- Stability : pre-release
8−-- Portability : GHC
9−--
10−-- Warning\: The API of this module is subject to change in future releases.
11−-- Especially the type for representing paths may change from 'FilePath' to
12−-- something else.
13−
14−module Streamly.FileSystem.Dir
15− (
16− -- * Streams
17− read
18− , readEither
19− )
20−where
21−
22−import Streamly.Internal.FileSystem.Dir
23−import Prelude hiding (read)
core/src/Streamly/FileSystem/File.hsdeleted−60
@@ -1,60 +0,0 @@
1−-- |
2−-- Module : Streamly.FileSystem.File
3−-- Copyright : (c) 2019 Composewell Technologies
4−--
5−-- License : BSD3
6−-- Maintainer : streamly@composewell.com
7−-- Stability : pre-release
8−-- Portability : GHC
9−--
10−-- Warning\: The API of this module is subject to change in future releases.
11−-- Especially the type for representing paths may change from 'FilePath' to
12−-- something else.
13−--
14−-- Read and write streams and arrays to and from files specified by their paths
15−-- in the file system. Unlike the handle based APIs which can have a read/write
16−-- session consisting of multiple reads and writes to the handle, these APIs
17−-- are one shot read or write APIs. These APIs open the file handle, perform
18−-- the requested operation and close the handle. These are safer compared to
19−-- the handle based APIs as there is no possibility of a file descriptor
20−-- leakage.
21−--
22−-- >>> import qualified Streamly.FileSystem.File as File
23−--
24−module Streamly.FileSystem.File
25− (
26− -- * Streaming IO
27− -- | Stream data to or from a file or device sequentially. When reading,
28− -- the stream is lazy and generated on-demand as the consumer consumes it.
29− -- Read IO requests to the IO device are performed in chunks limited to a
30− -- maximum size of 32KiB, this is referred to as @defaultChunkSize@ in the
31− -- documentation. One IO request may or may not read the full
32− -- chunk. If the whole stream is not consumed, it is possible that we may
33− -- read slightly more from the IO device than what the consumer needed.
34− -- Unless specified otherwise in the API, writes are collected into chunks
35− -- of @defaultChunkSize@ before they are written to the IO device.
36−
37− -- Streaming APIs work for all kind of devices, seekable or non-seekable;
38− -- including disks, files, memory devices, terminals, pipes, sockets and
39− -- fifos. While random access APIs work only for files or devices that have
40− -- random access or seek capability for example disks, memory devices.
41− -- Devices like terminals, pipes, sockets and fifos do not have random
42− -- access capability.
43−
44− -- ** File IO Using Handle
45− withFile
46−
47− -- ** Streams
48− , read
49− , readChunksWith
50− , readChunks
51−
52− -- ** Folds
53− , write
54− , writeWith
55− , writeChunks
56− )
57−where
58−
59−import Streamly.Internal.FileSystem.File
60−import Prelude hiding (read)
src/Streamly/Internal/Control/Concurrent.hs → core/src/Streamly/Internal/Control/Concurrent.hsrenamed+12−1
@@ -23,7 +23,6 @@ module Streamly.Internal.Control.Concurrent
23where
23where
24
24
25import Control.Monad.Catch (MonadThrow)
25import Control.Monad.Catch (MonadThrow)
26−import Streamly.Internal.Data.SVar.Type (RunInIO(..))
27
26
28#ifdef USE_UNLIFTIO
27#ifdef USE_UNLIFTIO
29import Control.Monad.IO.Unlift (MonadUnliftIO(..), UnliftIO(..), askUnliftIO)
28import Control.Monad.IO.Unlift (MonadUnliftIO(..), UnliftIO(..), askUnliftIO)
@@ -38,16 +37,28 @@ type MonadRunInIO m = MonadUnliftIO m
38type MonadRunInIO m = (MonadIO m, MonadBaseControl IO m)
37type MonadRunInIO m = (MonadIO m, MonadBaseControl IO m)
39#endif
38#endif
40
39
40+-- /Since: 0.8.0 ("Streamly.Prelude")/
41+--
41-- | A monad that can perform concurrent or parallel IO operations. Streams
42-- | A monad that can perform concurrent or parallel IO operations. Streams
42-- that can be composed concurrently require the underlying monad to be
43-- that can be composed concurrently require the underlying monad to be
43-- 'MonadAsync'.
44-- 'MonadAsync'.
44--
45--
46+-- /Since: 0.1.0 ("Streamly")/
47+--
48+-- @since 0.8.0
45#ifdef USE_UNLIFTIO
49#ifdef USE_UNLIFTIO
46type MonadAsync m = (MonadUnliftIO m, MonadThrow m)
50type MonadAsync m = (MonadUnliftIO m, MonadThrow m)
47#else
51#else
48type MonadAsync m = (MonadIO m, MonadBaseControl IO m, MonadThrow m)
52type MonadAsync m = (MonadIO m, MonadBaseControl IO m, MonadThrow m)
49#endif
53#endif
50
54
55+
56+#ifdef USE_UNLIFTIO
57+newtype RunInIO m = RunInIO { runInIO :: forall b. m b -> IO b }
58+#else
59+newtype RunInIO m = RunInIO { runInIO :: forall b. m b -> IO (StM m b) }
60+#endif
61+
51-- | When we run computations concurrently, we completely isolate the state of
62-- | When we run computations concurrently, we completely isolate the state of
52-- the concurrent computations from the parent computation. The invariant is
63-- the concurrent computations from the parent computation. The invariant is
53-- that we should never be running two concurrent computations in the same
64-- that we should never be running two concurrent computations in the same
src/Streamly/Internal/Control/ForkLifted.hs → core/src/Streamly/Internal/Control/ForkLifted.hsrenamed+4−17
@@ -9,13 +9,12 @@
9module Streamly.Internal.Control.ForkLifted
9module Streamly.Internal.Control.ForkLifted
10 (
10 (
11 doFork
11 doFork
12− , doForkWith
13 , fork
12 , fork
14 , forkManaged
13 , forkManaged
15 )
14 )
16where
15where
17
16
18−import Control.Concurrent (ThreadId, forkIO, forkOS)
17+import Control.Concurrent (ThreadId, forkIO)
19import Control.Exception (SomeException(..), catch, mask)
18import Control.Exception (SomeException(..), catch, mask)
20import Data.Functor (void)
19import Data.Functor (void)
21import Streamly.Internal.Control.Concurrent (MonadRunInIO, RunInIO(..), withRunInIO, withRunInIONoRestore)
20import Streamly.Internal.Control.Concurrent (MonadRunInIO, RunInIO(..), withRunInIO, withRunInIONoRestore)
@@ -33,23 +32,11 @@ doFork :: MonadRunInIO m
33 -> RunInIO m
32 -> RunInIO m
34 -> (SomeException -> IO ())
33 -> (SomeException -> IO ())
35 -> m ThreadId
34 -> m ThreadId
36−doFork = doForkWith False
37−
38−-- | Similar to 'doFork', but has a \"bound\" boolean parameter for specifying
39−-- whether 'forkOS' should be used instead of 'rawForkIO'.
40−{-# INLINE doForkWith #-}
41−doForkWith :: MonadRunInIO m
42− => Bool
43− -> m ()
44− -> RunInIO m
45− -> (SomeException -> IO ())
46− -> m ThreadId
47−doForkWith bound action (RunInIO mrun) exHandler =
35+doFork action (RunInIO mrun) exHandler =
48 withRunInIO $ \run ->
36 withRunInIO $ \run ->
49 mask $ \restore -> do
37 mask $ \restore -> do
50− tid <- (if bound then forkOS else rawForkIO) $
51− catch (restore $ void $ mrun action)
38+ tid <- rawForkIO $ catch (restore $ void $ mrun action)
52− exHandler
39+ exHandler
53 run (return tid)
40 run (return tid)
54
41
55-- | 'fork' lifted to any monad with 'MonadBaseControl IO m' capability.
42-- | 'fork' lifted to any monad with 'MonadBaseControl IO m' capability.
core/src/Streamly/Internal/Data/Array.hs+262−945

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/ArrayMacros.h+9−13

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Generic.hsdeleted−342

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Mut/Type.hsnew file+570

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Stream.hsdeleted−725

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Chunked.hs → core/src/Streamly/Internal/Data/Array/Stream/Fold/Foreign.hsrenamed+78−104

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Stream/Mut/Foreign.hsnew file+325

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Type.hsdeleted−1148

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Unboxed.hsnew file+560

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Unboxed/Mut.hsnew file+103

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Unboxed/Mut/Type.hsnew file+2389

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Unboxed/Type.hsnew file+613

This diff is too big to show here.

core/src/Streamly/Internal/Data/Binary/Stream.hsdeleted−383

This diff is too big to show here.

core/src/Streamly/Internal/Data/Builder.hsdeleted−82

This diff is too big to show here.

src/Streamly/Internal/Data/Cont.hs → core/src/Streamly/Internal/Data/Cont.hsrenamed

The content is the same.

core/src/Streamly/Internal/Data/Either/Strict.hs−2

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold.hs+2635−15

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Combinators.hsdeleted−2452

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Container.hsdeleted−783

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Step.hs+2−2

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Tee.hs+6−33

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Type.hs+278−824

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Window.hs+82−88

This diff is too big to show here.

core/src/Streamly/Internal/Data/IOFinalizer.hs+21−20

This diff is too big to show here.

core/src/Streamly/Internal/Data/IORef/Unboxed.hs+25−28

This diff is too big to show here.

core/src/Streamly/Internal/Data/IsMap.hs−8

This diff is too big to show here.

core/src/Streamly/Internal/Data/List.hs+56−105

This diff is too big to show here.

core/src/Streamly/Internal/Data/Maybe/Strict.hs−9

This diff is too big to show here.

core/src/Streamly/Internal/Data/MutArray.hsdeleted−207

This diff is too big to show here.

core/src/Streamly/Internal/Data/MutArray/Generic.hsdeleted−947

This diff is too big to show here.

core/src/Streamly/Internal/Data/MutArray/Stream.hsdeleted−145

This diff is too big to show here.

core/src/Streamly/Internal/Data/MutArray/Type.hsdeleted−3318

This diff is too big to show here.

core/src/Streamly/Internal/Data/MutByteArray.hsdeleted−251

This diff is too big to show here.

core/src/Streamly/Internal/Data/MutByteArray/Type.hsdeleted−321

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser.hs+716−2825

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser/ParserD.hsnew file+2176

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser/Tee.hs → core/src/Streamly/Internal/Data/Parser/ParserD/Tee.hsrenamed+6−10

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser/Type.hs → core/src/Streamly/Internal/Data/Parser/ParserD/Type.hsrenamed+495−490

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser/ParserK/Type.hsnew file+328

This diff is too big to show here.

core/src/Streamly/Internal/Data/ParserK.hsdeleted−16

This diff is too big to show here.

core/src/Streamly/Internal/Data/ParserK/Type.hsdeleted−752

This diff is too big to show here.

core/src/Streamly/Internal/Data/Pipe.hs+1707−12

This diff is too big to show here.

core/src/Streamly/Internal/Data/Pipe/Type.hs+3

This diff is too big to show here.

core/src/Streamly/Internal/Data/Producer.hs+13−6

This diff is too big to show here.

core/src/Streamly/Internal/Data/Producer/Source.hs+35−101

This diff is too big to show here.

core/src/Streamly/Internal/Data/Producer/Type.hs+1−1

This diff is too big to show here.

core/src/Streamly/Internal/Data/Refold/Type.hs+6−5

This diff is too big to show here.

core/src/Streamly/Internal/Data/Ring.hs+28−603

This diff is too big to show here.

core/src/Streamly/Internal/Data/Ring/Foreign.hsnew file+620

This diff is too big to show here.

core/src/Streamly/Internal/Data/Ring/Generic.hsdeleted−185

This diff is too big to show here.

core/src/Streamly/Internal/Data/SVar/Type.hs+1−10

This diff is too big to show here.

core/src/Streamly/Internal/Data/Serialize/TH.hsdeleted−530

This diff is too big to show here.

core/src/Streamly/Internal/Data/Serialize/TH/Bottom.hsdeleted−475

This diff is too big to show here.

core/src/Streamly/Internal/Data/Serialize/TH/Common.hsdeleted−70

This diff is too big to show here.

core/src/Streamly/Internal/Data/Serialize/TH/RecHeader.hsdeleted−411

This diff is too big to show here.

core/src/Streamly/Internal/Data/Serialize/Type.hsdeleted−317

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream.hs+10−22

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Bottom.hsnew file+496

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Common.hs → core/src/Streamly/Internal/Data/Stream/Common.hsrenamed+26−18

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Container.hsdeleted−310

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Eliminate.hs+228−708

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Enumerate.hsnew file+580

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Exception.hs+151−390

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Expand.hsnew file+581

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Generate.hs+206−961

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Instances.hsnew file+171

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Lift.hs+108−101

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Reduce.hsnew file+318

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Serial.hsnew file+129

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD.hs+23−3

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Eliminate.hsnew file+592

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Exception.hsnew file+424

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Generate.hsnew file+482

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Lift.hsnew file+112

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Nesting.hs → core/src/Streamly/Internal/Data/Stream/StreamD/Nesting.hsrenamed+355−912

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Step.hs → core/src/Streamly/Internal/Data/Stream/StreamD/Step.hsrenamed+2−2

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Transform.hsnew file+1263

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Type.hsnew file+1044

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamDK.hsnew file+156

This diff is too big to show here.

core/src/Streamly/Internal/Data/StreamK/Alt.hs → core/src/Streamly/Internal/Data/Stream/StreamDK/Type.hsrenamed+3−143

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamK.hsnew file+1078

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamK/Type.hsnew file+1319

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Top.hs+442−292

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Transform.hs+332−1413

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Transformer.hsdeleted−183

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Type.hs+219−2103

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/WSerial.hsnew file+249

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Zip.hs → core/src/Streamly/Internal/Data/Stream/Zip.hsrenamed+8−65

This diff is too big to show here.

core/src/Streamly/Internal/Data/StreamK.hsdeleted−1730

This diff is too big to show here.

core/src/Streamly/Internal/Data/StreamK/Transformer.hsdeleted−79

This diff is too big to show here.

core/src/Streamly/Internal/Data/StreamK/Type.hsdeleted−2153

This diff is too big to show here.

core/src/Streamly/Internal/Data/Time/Clock.hs+3−3

This diff is too big to show here.

core/src/Streamly/Internal/Data/Time/TimeSpec.hsc+3

This diff is too big to show here.

core/src/Streamly/Internal/Data/Time/Units.hs+7−8

This diff is too big to show here.

core/src/Streamly/Internal/Data/Tuple/Strict.hs−2

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unbox.hsdeleted−908

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unbox/TH.hsdeleted−498

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unboxed.hsnew file+388

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unfold.hs+273−116

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unfold/Enumeration.hs+32−2

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unfold/Type.hs+68−157

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/Path.hsdeleted−515

This diff is too big to show here.

core/src/Streamly/Internal/Foreign/Malloc.hsnew file+49

This diff is too big to show here.

core/src/Streamly/Internal/System/IO.hs+2−4

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Array.hsdeleted−104

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Parser.hsdeleted−627

This diff is too big to show here.

core/src/Streamly/Unicode/Parser.hsdeleted−69

This diff is too big to show here.

core/src/Streamly/Unicode/String.hsdeleted−30

This diff is too big to show here.

core/src/inline.hs+2−2

This diff is too big to show here.

core/streamly-core.cabal+119−280

This diff is too big to show here.

default.nix+6−14

This diff is too big to show here.

docs/Developer/Benchmarks.md−8

This diff is too big to show here.

docs/Developer/Contributing.md+2−1

This diff is too big to show here.

docs/Developer/MAINTAINING.md+14−15

This diff is too big to show here.

docs/Developer/Tests.md+2−2

This diff is too big to show here.

docs/Developer/ci-tests.md+6−16

This diff is too big to show here.

docs/Developer/module-organization.md+3−3

This diff is too big to show here.

docs/Developer/optimization-guidelines.md+1−13

This diff is too big to show here.

docs/Developer/paths.rst+2−25

This diff is too big to show here.

docs/Documentation.mddeleted−5

This diff is too big to show here.

docs/User/Explanatory/design.mddeleted−42

This diff is too big to show here.

docs/User/Explanatory/unified-abstractions.md+1−1

This diff is too big to show here.

docs/User/HowTo/Compiling.md+46−54

This diff is too big to show here.

docs/User/HowTo/faq.md+33−57

This diff is too big to show here.

docs/User/HowTo/streamly-vs-async.md−2

This diff is too big to show here.

docs/User/HowTo/streamly-vs-lists.md−2

This diff is too big to show here.

docs/User/Project/ApiChangelogs/0.8.3-0.9.0.txtdeleted−175

This diff is too big to show here.

docs/User/Project/ApiChangelogs/0.9.0-0.10.0.txtdeleted−424

This diff is too big to show here.

docs/User/Project/README.mddeleted−141

This diff is too big to show here.

docs/User/Project/Upgrading-0.8-to-0.9.mddeleted−384

This diff is too big to show here.

docs/User/Project/ApiChangelogs/0.8.3.txt → docs/User/ProjectRelated/API-changelog.txtrenamed

The content is the same.

docs/User/Project/CONTRIBUTORS.md → docs/User/ProjectRelated/CONTRIBUTORS.mdrenamed−16

This diff is too big to show here.

docs/User/Project/Changelog.md → docs/User/ProjectRelated/Changelog.mdrenamed+16−121

This diff is too big to show here.

docs/User/Project/Credits.md → docs/User/ProjectRelated/Credits.mdrenamed

The content is the same.

docs/User/Project/Github.link → docs/User/ProjectRelated/Github.linkrenamed

The content is the same.

docs/User/Project/Roadmap.link → docs/User/ProjectRelated/Roadmap.linkrenamed

The content is the same.

docs/User/Tutorials/ConcurrentStreams.hs+28−18

This diff is too big to show here.

docs/User/Tutorials/Introduction.mdnew file+651

This diff is too big to show here.

docs/User/Tutorials/ReactiveProgramming.hs+1−3

This diff is too big to show here.

docs/User/Tutorials/Tutorial.hs+67−46

This diff is too big to show here.

docs/User/Tutorials/before-you-begin.mddeleted−77

This diff is too big to show here.

docs/User/Tutorials/getting-started.md+191−120

This diff is too big to show here.

docs/User/Tutorials/haskell-lazy-evaluation.mddeleted−215

This diff is too big to show here.

docs/User/Tutorials/quick-overview.mddeleted−517

This diff is too big to show here.

docs/User/Tutorials/why-haskell-streamly.mddeleted−91

This diff is too big to show here.

docs/streamly-docs.cabal+5−8

This diff is too big to show here.

hie.yaml+14−48

This diff is too big to show here.

src/Streamly.hsnew file+623

This diff is too big to show here.

core/src/Streamly/Console/Stdio.hs → src/Streamly/Console/Stdio.hsrenamed+4−3

This diff is too big to show here.

src/Streamly/Data/Array.hsnew file+43

This diff is too big to show here.

src/Streamly/Data/Array/Foreign.hs+8−22

This diff is too big to show here.

src/Streamly/Data/Fold/Prelude.hsdeleted−65

This diff is too big to show here.

src/Streamly/Data/Fold/Tee.hsdeleted−16

This diff is too big to show here.

src/Streamly/Data/SmallArray.hs+2−2

This diff is too big to show here.

src/Streamly/Data/Stream/MkType.hsdeleted−115

This diff is too big to show here.

src/Streamly/Data/Stream/Prelude.hsdeleted−232

This diff is too big to show here.

core/src/Streamly/Data/Unfold.hs → src/Streamly/Data/Unfold.hsrenamed+98−98

This diff is too big to show here.

src/Streamly/Data/Unicode/Stream.hsnew file+99

This diff is too big to show here.

core/src/Streamly/FileSystem/Handle.hs → src/Streamly/FileSystem/Handle.hsrenamed+11−26

This diff is too big to show here.

core/src/Streamly/Internal/Console/Stdio.hs → src/Streamly/Internal/Console/Stdio.hsrenamed+45−44

This diff is too big to show here.

src/Streamly/Internal/Data/Array/ArrayMacros.hnew file+39

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Stream/Foreign.hsnew file+977

This diff is too big to show here.

core/src/Streamly/Internal/Data/Binary/Parser.hs → src/Streamly/Internal/Data/Binary/Decode.hsrenamed+42−164

This diff is too big to show here.

src/Streamly/Internal/Data/Channel.hsdeleted−19

This diff is too big to show here.

src/Streamly/Internal/Data/Channel/Dispatcher.hsdeleted−294

This diff is too big to show here.

src/Streamly/Internal/Data/Channel/Types.hsdeleted−817

This diff is too big to show here.

src/Streamly/Internal/Data/Channel/Worker.hsdeleted−375

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Async.hs+7−20

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Concurrent.hsdeleted−57

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Concurrent/Channel.hsdeleted−112

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Concurrent/Channel/Type.hsdeleted−331

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Prelude.hsdeleted−19

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/SVar.hs+7−8

This diff is too big to show here.

src/Streamly/Internal/Data/IOFinalizer/Lifted.hsdeleted−74

This diff is too big to show here.

src/Streamly/Internal/Data/IsMap/HashMap.hs−10

This diff is too big to show here.

src/Streamly/Internal/Data/SVar.hs+2−2

This diff is too big to show here.

src/Streamly/Internal/Data/SVar/Dispatch.hs+3

This diff is too big to show here.

src/Streamly/Internal/Data/SmallArray.hs+23−23

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Ahead.hs+11−36

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Async.hs+14−48

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent.hsdeleted−903

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel.hsdeleted−109

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Append.hsdeleted−1046

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Consumer.hsdeleted−127

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Dispatcher.hsdeleted−417

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Interleave.hsdeleted−252

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Operations.hsdeleted−294

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Type.hsdeleted−172

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Instances.hs+12−9

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream.hs+4−24

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Combinators.hs+2−4

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Common.hs+41−66

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs+63−158

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Enumeration.hs+2−15

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Exception.hs+15−29

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Expand.hs+23−35

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Generate.hs+54−30

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Lift.hs+10−8

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Reduce.hs+51−67

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Top.hs+22−31

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Transform.hs+95−62

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Type.hs+62−66

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Lifted.hsdeleted−335

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/MkType.hsdeleted−641

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Parallel.hs+28−56

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Prelude.hsdeleted−19

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/SVar.hsdeleted−18

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/SVar/Eliminate.hs+7−11

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/SVar/Generate.hs+12−14

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Serial.hsdeleted−456

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Time.hsdeleted−950

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/ZipAsync.hs+8−9

This diff is too big to show here.

src/Streamly/Internal/Data/Unfold/Exception.hsdeleted−214

This diff is too big to show here.

src/Streamly/Internal/Data/Unfold/Prelude.hsdeleted−17

This diff is too big to show here.

src/Streamly/Internal/Data/Unfold/SVar.hs+6−3

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/Dir.hs → src/Streamly/Internal/FileSystem/Dir.hsrenamed+80−188

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event.hs+4−7

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Darwin.hs+74−67

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Linux.hs+102−99

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Windows.hs+58−59

This diff is too big to show here.

src/Streamly/Internal/FileSystem/FD.hs+50−54

This diff is too big to show here.

src/Streamly/Internal/FileSystem/FDIO.hs+5

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/File.hs → src/Streamly/Internal/FileSystem/File.hsrenamed+129−196

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/Handle.hs → src/Streamly/Internal/FileSystem/Handle.hsrenamed+202−148

This diff is too big to show here.

src/Streamly/Internal/Network/Inet/TCP.hs+124−161

This diff is too big to show here.

src/Streamly/Internal/Network/Socket.hs+237−137

This diff is too big to show here.

src/Streamly/Internal/System/IOVec.hs+7−7

This diff is too big to show here.

src/Streamly/Internal/Unicode/Array/Char.hsnew file+94

This diff is too big to show here.

src/Streamly/Internal/Unicode/Char.hs+9−20

This diff is too big to show here.

src/Streamly/Internal/Unicode/Char/Parser.hsnew file+255

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Stream.hs → src/Streamly/Internal/Unicode/Stream.hsrenamed+192−179

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/String.hs → src/Streamly/Internal/Unicode/String.hsrenamed+23−32

This diff is too big to show here.

src/Streamly/Internal/Unicode/Utf8.hs+9−15

This diff is too big to show here.

src/Streamly/Memory/Array.hsnew file+74

This diff is too big to show here.

src/Streamly/Network/Inet/TCP.hs+6−45

This diff is too big to show here.

src/Streamly/Network/Socket.hs+47−74

This diff is too big to show here.

src/Streamly/Prelude.hs+6−14

This diff is too big to show here.

core/src/Streamly/Unicode/Stream.hs → src/Streamly/Unicode/Stream.hsrenamed+17−20

This diff is too big to show here.

src/inline.hs+2−2

This diff is too big to show here.

stack.yaml+2−2

This diff is too big to show here.

streamly.cabal+355−203

This diff is too big to show here.

targets/Targets.hs+48−117

This diff is too big to show here.

test/Streamly/Test/Data/Array.hs+5−231

This diff is too big to show here.

test/Streamly/Test/Data/Array/Common.hs+23−15

This diff is too big to show here.

test/Streamly/Test/Data/Array/CommonImports.hs+4−4

This diff is too big to show here.

test/Streamly/Test/Data/Array/Foreign.hsnew file+304

This diff is too big to show here.

test/Streamly/Test/Data/Array/Generic.hsdeleted−65

This diff is too big to show here.

test/Streamly/Test/Data/Array/Stream.hs → test/Streamly/Test/Data/Array/Stream/Foreign.hsrenamed+11−33

This diff is too big to show here.

test/Streamly/Test/Data/Fold.hs+107−139

This diff is too big to show here.

test/Streamly/Test/Data/Fold/Window.hs+13−13

This diff is too big to show here.

test/Streamly/Test/Data/List.hs+20−20

This diff is too big to show here.

test/Streamly/Test/Data/MutArray.hsdeleted−152

This diff is too big to show here.

test/Streamly/Test/Data/Parser.hs+208−376

This diff is too big to show here.

test/Streamly/Test/Data/ParserK.hs → test/Streamly/Test/Data/Parser/ParserD.hsrenamed+100−150

This diff is too big to show here.

test/Streamly/Test/Data/Ring/Unboxed.hs+2−2

This diff is too big to show here.

test/Streamly/Test/Data/Serialize.hsdeleted−306

This diff is too big to show here.

test/Streamly/Test/Data/Serialize/CompatV0.hsdeleted−46

This diff is too big to show here.

test/Streamly/Test/Data/Serialize/CompatV1.hsdeleted−48

This diff is too big to show here.

test/Streamly/Test/Data/Serialize/TH.hsdeleted−82

This diff is too big to show here.

test/Streamly/Test/Data/SmallArray.hs−2

This diff is too big to show here.

test/Streamly/Test/Data/Stream.hsdeleted−33

This diff is too big to show here.

test/Streamly/Test/Data/Stream/Concurrent.hsdeleted−363

This diff is too big to show here.

test/Streamly/Test/Data/Unbox.hsdeleted−347

This diff is too big to show here.

test/Streamly/Test/Data/Unbox/TH.hsdeleted−146

This diff is too big to show here.

test/Streamly/Test/Data/Unfold.hs+19−11

This diff is too big to show here.

test/Streamly/Test/FileSystem/Event/Common.hs+6−10

This diff is too big to show here.

test/Streamly/Test/FileSystem/Event/Darwin.hs+1−1

This diff is too big to show here.

test/Streamly/Test/FileSystem/Event/Linux.hs+4−17

This diff is too big to show here.

test/Streamly/Test/FileSystem/Event/Windows.hs+2−2

This diff is too big to show here.

test/Streamly/Test/FileSystem/Handle.hs+31−27

This diff is too big to show here.

test/Streamly/Test/Network/Inet/TCP.hs+18−25

This diff is too big to show here.

test/Streamly/Test/Network/Socket.hs+20−29

This diff is too big to show here.

test/Streamly/Test/Prelude.hs−2

This diff is too big to show here.

test/Streamly/Test/Prelude/Ahead.hs+3−2

This diff is too big to show here.

test/Streamly/Test/Prelude/Async.hs+3−2

This diff is too big to show here.

test/Streamly/Test/Prelude/Concurrent.hs−2

This diff is too big to show here.

test/Streamly/Test/Prelude/Fold.hs−2

This diff is too big to show here.

test/Streamly/Test/Prelude/Parallel.hs−2

This diff is too big to show here.

test/Streamly/Test/Prelude/Rate.hs−2

This diff is too big to show here.

test/Streamly/Test/Prelude/Serial.hs+105−138

This diff is too big to show here.

test/Streamly/Test/Prelude/Top.hs+3−9

This diff is too big to show here.

test/Streamly/Test/Prelude/WAsync.hs−2

This diff is too big to show here.

test/Streamly/Test/Prelude/WSerial.hs+5−4

This diff is too big to show here.

test/Streamly/Test/Prelude/ZipAsync.hs−2

This diff is too big to show here.

test/Streamly/Test/Prelude/ZipSerial.hs+3−2

This diff is too big to show here.

test/Streamly/Test/Serialize/Serializable.hsdeleted−237

This diff is too big to show here.

test/Streamly/Test/Unicode/Char.hs+9−13

This diff is too big to show here.

test/Streamly/Test/Unicode/Parser.hsdeleted−231

This diff is too big to show here.

test/Streamly/Test/Unicode/Stream.hs+30−34

This diff is too big to show here.

test/lib/Streamly/Test/Common.hs+3−4

This diff is too big to show here.

test/lib/Streamly/Test/Prelude/Common.hs+41−18

This diff is too big to show here.

test/streamly-tests.cabal+35−190

This diff is too big to show here.

test/test-runner/Main.hs+1−2

This diff is too big to show here.

test/test-runner/cabal.project−3

This diff is too big to show here.