on master help sign in
.circleci/config.yml+73−277
since splitsnapshots
unifiedsplit
@@ -1,7 +1,7 @@
1version: 2.1
1version: 2.1
2
2
3#-----------------------------------------------------------------------------
3#-----------------------------------------------------------------------------
4−# packcheck-0.4.2
4+# packcheck-0.7.0
5# Packcheck global environment variables
5# Packcheck global environment variables
6#-----------------------------------------------------------------------------
6#-----------------------------------------------------------------------------
7
7
@@ -11,6 +11,8 @@ 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
14 CABAL_REINIT_CONFIG: "y"
16 CABAL_REINIT_CONFIG: "y"
15 LC_ALL: "C.UTF-8"
17 LC_ALL: "C.UTF-8"
16
18
@@ -22,7 +24,6 @@ env: &env
22 # DISABLE_DOCS: "y"
24 # DISABLE_DOCS: "y"
23 # DISABLE_SDIST_BUILD: "y"
25 # DISABLE_SDIST_BUILD: "y"
24 # DISABLE_DIST_CHECKS: "y"
26 # DISABLE_DIST_CHECKS: "y"
25− ENABLE_INSTALL: "y"
26
27
27 # ------------------------------------------------------------------------
28 # ------------------------------------------------------------------------
28 # stack options
29 # stack options
@@ -38,15 +39,12 @@ env: &env
38 # cabal options
39 # cabal options
39 # ------------------------------------------------------------------------
40 # ------------------------------------------------------------------------
40 CABAL_CHECK_RELAX: "y"
41 CABAL_CHECK_RELAX: "y"
41− CABAL_NO_SANDBOX: "y"
42− CABAL_HACKAGE_MIRROR: "hackage.haskell.org:http://hackage.fpcomplete.com"
43 CABAL_BUILD_OPTIONS: "-j1 --flag limit-build-mem"
42 CABAL_BUILD_OPTIONS: "-j1 --flag limit-build-mem"
44
43
45 # ------------------------------------------------------------------------
44 # ------------------------------------------------------------------------
46 # Where to find the required tools
45 # Where to find the required tools
47 # ------------------------------------------------------------------------
46 # ------------------------------------------------------------------------
48− PATH: /opt/ghc/bin:/opt/ghcjs/bin:/sbin:/usr/sbin:/bin:/usr/bin
47+ PATH: /sbin:/usr/sbin:/bin:/usr/bin
49− TOOLS_DIR: /opt
50
48
51 # ------------------------------------------------------------------------
49 # ------------------------------------------------------------------------
52 # Location of packcheck.sh (the shell script invoked to perform CI tests ).
50 # Location of packcheck.sh (the shell script invoked to perform CI tests ).
@@ -59,15 +57,15 @@ env: &env
59 # If you have not committed packcheck.sh in your repo at PACKCHECK
57 # If you have not committed packcheck.sh in your repo at PACKCHECK
60 # then it is automatically pulled from this URL.
58 # then it is automatically pulled from this URL.
61 PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
59 PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
62− PACKCHECK_GITHUB_COMMIT: "a302772c8f3791c477edd1764b82f8d1f5b22fdf"
60+ PACKCHECK_GITHUB_COMMIT: "f6cfd7b7a33b4bf6fd63cce6a3fb3d26f5031403"
63
61
64executors:
62executors:
65 amd64-executor:
63 amd64-executor:
66 docker:
64 docker:
67− - image: ubuntu:xenial
65+ - image: ubuntu:latest
68 x86-executor:
66 x86-executor:
69 docker:
67 docker:
70− - image: i386/ubuntu:eoan
68+ - image: i386/ubuntu:focal
71
69
72#-----------------------------------------------------------------------------
70#-----------------------------------------------------------------------------
73# Common utility stuff, not to be modified usually
71# Common utility stuff, not to be modified usually
@@ -79,38 +77,50 @@ preinstall: &preinstall
79 # required for https/cache save and restore
77 # required for https/cache save and restore
80 apt-get install -y ca-certificates
78 apt-get install -y ca-certificates
81
79
82− # required to (re)generate the configure script
80+ # Alternative way of installing ghc and cabal, directly from
83− apt-get install -y autoconf
81+ # haskell.org instead of using ghcup. NOTE: this is for Debian
84−
82+ # only and is debian release specific.
85− # For ghc and cabal-install packages from hvr's ppa
86 # gnupg is required for apt-key to work
83 # gnupg is required for apt-key to work
87− apt-get install -y gnupg
84+ #apt-get install -y gnupg
88− apt-get install -y apt-transport-https
89− apt-key adv --keyserver keyserver.ubuntu.com --recv-keys BA3CBA3FFE22B574
85+ #apt-key adv --keyserver keyserver.ubuntu.com --recv-keys BA3CBA3FFE22B574
90− apt-get install -y software-properties-common
91− add-apt-repository -y ppa:hvr/ghc
92− # echo "deb http://downloads.haskell.org/debian stretch main" >> /etc/apt/sources.list
86+ #echo "deb http://downloads.haskell.org/debian buster 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
87+ #apt-get update
95
88
96− # required for packcheck
89+ # required for outbound https for stack and for stack setup
90+ apt-get install -y netbase xz-utils make
97− apt-get install -y curl
91+ apt-get install -y zlib1g-dev
98
92
93+ # For ghcup to install ghc
94+ if test -n "$GHCUP_VERSION"
95+ then
96+ apt-get install -y gcc
97+ apt-get install -y g++
98+ fi
99+
99− # required for circleci.
100+ # libgmp required by ghc for linking
100− apt-get install -y libcurl4-gnutls-dev
101+ apt-get install -y libgmp-dev
101− apt-get install -y git
102 apt-get install -y libtinfo-dev
102 apt-get install -y libtinfo-dev
103
103
104− # required for outbound https for stack and for stack setup
104+ # Required by cabal when git URL is specified in project file
105+ apt-get install -y git
106+
107+ # Required for and by packcheck
105− apt-get install -y netbase xz-utils make
108+ apt-get install -y curl
106
109
107−project-preinstall: &project-preinstall
108− run: |
109 # Get packcheck if needed
110 # Get packcheck if needed
110− CURL=$(which curl)
111+ if test ! -e "$PACKCHECK"
112+ then
113+ if test -z "$PACKCHECK_GITHUB_COMMIT"
114+ then
115+ die "PACKCHECK_GITHUB_COMMIT is not specified."
116+ fi
111− PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
117+ PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
112− if test ! -e "$PACKCHECK"; then $CURL -sL -o "$PACKCHECK" $PACKCHECK_URL; fi;
118+ curl --fail -sL -o "$PACKCHECK" $PACKCHECK_URL || exit 1
119+ chmod +x $PACKCHECK
120+ elif test ! -x "$PACKCHECK"
121+ then
113− chmod +x $PACKCHECK
122+ chmod +x $PACKCHECK
123+ fi
114
124
115restore: &restore
125restore: &restore
116 # Needs to happen after installing ca-certificates
126 # Needs to happen after installing ca-certificates
@@ -126,271 +136,71 @@ save: &save
126 save_cache:
136 save_cache:
127 key: v1-{{ .Environment.CIRCLE_JOB }}-{{ .Branch }}
137 key: v1-{{ .Environment.CIRCLE_JOB }}-{{ .Branch }}
128 paths:
138 paths:
129− - ~/.cabal
130− - ~/.ghc
131 - ~/.local
139 - ~/.local
140+ - ~/.cabal
132 - ~/.stack
141 - ~/.stack
142+ - ~/.ghcup
133
143
134#-----------------------------------------------------------------------------
144#-----------------------------------------------------------------------------
135# Build matrix
145# Build matrix
136#-----------------------------------------------------------------------------
146#-----------------------------------------------------------------------------
137
147
138jobs:
148jobs:
139− cabal-ghc-8_10_4:
149+ cabal-ghc-8_6_5:
140 <<: *env
150 <<: *env
141 executor: amd64-executor
151 executor: amd64-executor
142 steps:
152 steps:
143− - *preinstall
144 - checkout
153 - checkout
145− - *project-preinstall
146 - *restore
154 - *restore
155+ - *preinstall
147 - run:
156 - run:
148 environment:
157 environment:
158+ GHCVER: "8.6.5"
159+ CABAL_VERSION: "3.6.2.0"
149 CABAL_PROJECT: "cabal.project"
160 CABAL_PROJECT: "cabal.project"
150− DISABLE_TEST: "yes"
151− DISABLE_BENCH: "yes"
152 DISABLE_SDIST_BUILD: "yes"
161 DISABLE_SDIST_BUILD: "yes"
162+ CABAL_BUILD_OPTIONS: "--flag debug --flag -opt"
153 command: |
163 command: |
154− apt-get install -y ghc-8.10.4
155− apt-get install -y cabal-install-3.4
156 bash -c "$PACKCHECK cabal"
164 bash -c "$PACKCHECK cabal"
157 - *save
165 - *save
158− stack-ghc-8_8:
166+ cabal-ghc-9_8_1-docspec:
159 <<: *env
167 <<: *env
160 executor: amd64-executor
168 executor: amd64-executor
161 steps:
169 steps:
162− - *preinstall
163 - checkout
170 - checkout
164− - *project-preinstall
165 - *restore
171 - *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:
182 - *preinstall
172 - *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
218 - run:
173 - run:
219 environment:
174 environment:
220− BUILD: "cabal-v2"
175+ GHCVER: "9.8.1"
176+ CABAL_VERSION: "3.10.1.0"
177+ CABAL_PROJECT: "cabal.project.doctest"
178+ DISABLE_SDIST_BUILD: "y"
221− DISABLE_TEST: "yes"
179+ DISABLE_TEST: "y"
222− DISABLE_BENCH: "yes"
180+ DISABLE_BENCH: "y"
223− DISABLE_DOCS: "yes"
181+ DISABLE_DOCS: "y"
224− DISABLE_SDIST_BUILD: "yes"
182+ ENABLE_DOCSPEC: "y"
225− DISABLE_DIST_CHECKS: "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
184+ DOCSPEC_OPTIONS: "--timeout 60 --check-properties --property-variables xs"
226 command: |
185 command: |
227− apt-get install -y ghc-8.2.2
228− apt-get install -y cabal-install-3.2
229− bash -c "$PACKCHECK $BUILD"
230− - *save
231− cabal-ghc-8_0_2:
232− <<: *env
233− executor: amd64-executor
234− steps:
235− - *preinstall
236− - checkout
237− - *project-preinstall
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"
186+ bash -c "$PACKCHECK cabal"
251− - *save
252− cabal-ghc-7_10_3:
253− <<: *env
254− executor: amd64-executor
255− steps:
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
187 - *save
265− stack-ghc-8_4:
188+ hlint-trailing-spaces:
266 <<: *env
189 <<: *env
267 executor: amd64-executor
190 executor: amd64-executor
268 steps:
191 steps:
269− - *preinstall
270 - checkout
192 - checkout
271− - *project-preinstall
272 - *restore
193 - *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
194 - *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
295 - run:
195 - run:
296− name: GHCJS 8.4+no-test+no-docs
196+ name: hlint and trailing spaces
297 environment:
197 environment:
298− BUILD: cabal-v2
299− ENABLE_GHCJS: "yes"
300− DISABLE_TEST: "yes"
301− ENABLE_INSTALL: ""
302− DISABLE_DOCS: "yes"
303 DISABLE_SDIST_BUILD: "yes"
198 DISABLE_SDIST_BUILD: "yes"
304− command: |
199+ HLINT_VERSION: 3.6.1
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: hlint
389 HLINT_OPTIONS: lint
200 HLINT_OPTIONS: lint
390− DISABLE_SDIST_BUILD: "yes"
391 HLINT_TARGETS: core/src src test benchmark
201 HLINT_TARGETS: core/src src test benchmark
392 command: |
202 command: |
393− bash -c "$PACKCHECK $BUILD" || exit 1
203+ bash -c "$PACKCHECK hlint" || exit 1
394 echo "Checking trailing spaces..."
204 echo "Checking trailing spaces..."
395 count=$(find . -name "*.hs" -exec grep -H '\ $' {} \; | tee /dev/tty | wc -l)
205 count=$(find . -name "*.hs" -exec grep -H '\ $' {} \; | tee /dev/tty | wc -l)
396 exit $count
206 exit $count
@@ -400,23 +210,9 @@ workflows:
400 version: 2
210 version: 2
401 build:
211 build:
402 jobs:
212 jobs:
403− - cabal-ghc-8_10_4:
213+ #- cabal-ghc-8_6_5:
404− name: GHC 8.10.4 + sdist + no-test + no-bench
214+ # name: 8.6.5-debug-unoptimized
405− #- cabal-ghc-8.6.5
406− #- cabal-ghc-8_4_4:
407− # name: GHC 8.4.4 + x86 + debug
408− #- cabal-ghc-8_2_2:
409− # name: GHC 8.2.2 + no-test + no-bench + no-docs
410− #- cabal-ghc-8_0_2:
411− # name: GHC 8.0.2 + no-test + no-bench + no-docs
412− #- cabal-ghc-7.10.3
215+ - cabal-ghc-9_8_1-docspec:
413− # - cabal-ghcjs-8_4:
216+ name: ghc-9.8.1-docspec
414− # name: GHCJS 8.4 + no-test + no-docs
217+ - hlint-trailing-spaces:
415− #- stack-ghc-8.4
218+ name: hlint and trailing spaces
416− #- stack-ghc-8.2
417− #- coveralls-ghc-8.2.2
418− #- coveralls-ghc-8.8.3
419− #- coveralls-ghc-8_10_2:
420− # name: GHC 8.10.2 + inspection + coverage + Werror
421− - hlint-src:
422− name: Hlint src + Trailing Spaces
.github/workflows/haskell.yml+108−89
@@ -13,9 +13,15 @@ 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 }}
16 GHCVER: ${{ matrix.ghc_version }}
21 GHCVER: ${{ matrix.ghc_version }}
17 CABALVER: ${{ matrix.cabal_version }}
22 CABALVER: ${{ matrix.cabal_version }}
18 DISABLE_DOCS: ${{ matrix.disable_docs }}
23 DISABLE_DOCS: ${{ matrix.disable_docs }}
24+ ENABLE_DOCSPEC: ${{ matrix.enable_docspec }}
19 DISABLE_TEST: ${{ matrix.disable_test }}
25 DISABLE_TEST: ${{ matrix.disable_test }}
20 DISABLE_BENCH: ${{ matrix.disable_bench }}
26 DISABLE_BENCH: ${{ matrix.disable_bench }}
21 DISABLE_DIST_CHECKS: ${{ matrix.disable_dist_checks }}
27 DISABLE_DIST_CHECKS: ${{ matrix.disable_dist_checks }}
@@ -39,14 +45,21 @@ jobs:
39 STACK_BUILD_OPTIONS: ${{ matrix.stack_build_options }}
45 STACK_BUILD_OPTIONS: ${{ matrix.stack_build_options }}
40
46
41 # packcheck location and revision
47 # packcheck location and revision
42− PACKCHECK_LOCAL_PATH: "./packcheck.sh"
48+ PACKCHECK: "./packcheck.sh"
43 PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
49 PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
44− PACKCHECK_GITHUB_COMMIT: "a302772c8f3791c477edd1764b82f8d1f5b22fdf"
50+ PACKCHECK_GITHUB_COMMIT: "v0.7.0"
45
51
46 # Pull token from "secrets" setting of the github repo
52 # Pull token from "secrets" setting of the github repo
47 COVERALLS_TOKEN: ${{ secrets.COVERALLS_TOKEN }}
53 COVERALLS_TOKEN: ${{ secrets.COVERALLS_TOKEN }}
48 COVERAGE: ${{ matrix.coverage }}
54 COVERAGE: ${{ matrix.coverage }}
49− DOCTEST: ${{ matrix.doctest }}
55+
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 }}
50
63
51 runs-on: ${{ matrix.runner }}
64 runs-on: ${{ matrix.runner }}
52 continue-on-error: ${{ matrix.ignore_error }}
65 continue-on-error: ${{ matrix.ignore_error }}
@@ -55,8 +68,8 @@ jobs:
55 matrix:
68 matrix:
56 # The order is important to optimize fail-fast.
69 # The order is important to optimize fail-fast.
57 name:
70 name:
58− - 8.10.7-Werror
71+ - 9.8.1-Werror
59− - 9.2.4-docspec
72+ # - 9.8.1-docspec
60 # - 8.10.7-coverage
73 # - 8.10.7-coverage
61
74
62 # Note: if cabal.project is not specified benchmarks and tests won't
75 # Note: if cabal.project is not specified benchmarks and tests won't
@@ -65,35 +78,74 @@ jobs:
65 include:
78 include:
66 - name: head
79 - name: head
67 ghc_version: head
80 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"
68 runner: ubuntu-latest
91 runner: ubuntu-latest
69 build: cabal
92 build: cabal
70− cabal_version: 3.8.1.0
93+ cabal_version: 3.10.2.0
71 cabal_project: cabal.project.ghc-head
94 cabal_project: cabal.project.ghc-head
72 disable_sdist_build: "y"
95 disable_sdist_build: "y"
73 ignore_error: true
96 ignore_error: true
74− - name: 9.4.2-fusion-inspection
97+ # Note: use linux for warning build for convenient dev testing
98+ - name: 9.8.1-Werror
75− ghc_version: 9.4.2
99+ ghc_version: 9.8.1
76 runner: ubuntu-latest
100 runner: ubuntu-latest
77 build: cabal
101 build: cabal
78− cabal_version: 3.8.1.0
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
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
120+ runner: ubuntu-latest
121+ build: cabal
122+ cabal_version: 3.10.1.0
79 disable_sdist_build: "y"
123 disable_sdist_build: "y"
80 cabal_project: cabal.project
124 cabal_project: cabal.project
81 cabal_build_options: "--flag fusion-plugin --flag inspection"
125 cabal_build_options: "--flag fusion-plugin --flag inspection"
82 ignore_error: false
126 ignore_error: false
83− - name: 9.2.4
127+ - name: 9.6.3-macos
84− ghc_version: 9.2.4
128+ ghc_version: 9.6.3
85− runner: ubuntu-latest
129+ runner: macos-latest
86 build: cabal
130 build: cabal
131+ cabal_version: 3.10.1.0
132+ disable_sdist_build: "y"
87 cabal_project: cabal.project
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
88− cabal_version: 3.6.2.0
139+ cabal_version: 3.8.1.0
89 disable_sdist_build: "y"
140 disable_sdist_build: "y"
141+ cabal_project: cabal.project
90 ignore_error: false
142 ignore_error: false
91− - name: 9.2.4-docspec
143+ - name: 9.2.8
92− ghc_version: 9.2.4
144+ ghc_version: 9.2.8
93 runner: ubuntu-latest
145 runner: ubuntu-latest
94− doctest: "y"
146+ build: cabal
95− cabal_version: 3.6.2.0
96 cabal_project: cabal.project
147 cabal_project: cabal.project
148+ cabal_version: 3.6.2.0
97 disable_sdist_build: "y"
149 disable_sdist_build: "y"
98 ignore_error: false
150 ignore_error: false
99 - name: 9.0.2-streamly-sdist
151 - name: 9.0.2-streamly-sdist
@@ -103,37 +155,28 @@ jobs:
103 cabal_version: 3.6.2.0
155 cabal_version: 3.6.2.0
104 cabal_project: cabal.project.streamly
156 cabal_project: cabal.project.streamly
105 ignore_error: true
157 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
106 - name: 8.10.7-streamly-sdist-stack
165 - name: 8.10.7-streamly-sdist-stack
107 runner: ubuntu-latest
166 runner: ubuntu-latest
108 build: stack
167 build: stack
109− resolver: lts-18.23
168+ resolver: lts-20.13
110 stack_yaml: stack.yaml
169 stack_yaml: stack.yaml
111 sdist_options: "--ignore-check"
170 sdist_options: "--ignore-check"
112 stack_build_options: "--flag streamly-benchmarks:-opt"
171 stack_build_options: "--flag streamly-benchmarks:-opt"
113 cabal_version: 3.6.2.0
172 cabal_version: 3.6.2.0
114 ignore_error: false
173 ignore_error: false
115− - name: 8.10.7-macos
116− ghc_version: 8.10.7
117− runner: macos-latest
118− build: cabal
119− cabal_version: 3.6.2.0
120− cabal_project: cabal.project
121− disable_sdist_build: "y"
122− ignore_error: false
123 # - name: 8.10.7-coverage
174 # - name: 8.10.7-coverage
124 # ghc_version: 8.10.7
175 # ghc_version: 8.10.7
125 # runner: ubuntu-latest
176 # runner: ubuntu-latest
126 # coverage: "y"
177 # coverage: "y"
127 # cabal_version: 3.6.2.0
178 # cabal_version: 3.6.2.0
128 # ignore_error: false
179 # ignore_error: false
129− - name: 8.10.7-Werror
130− ghc_version: 8.10.7
131− runner: ubuntu-latest
132− build: cabal
133− cabal_version: 3.6.2.0
134− cabal_project: cabal.project.Werror
135− disable_sdist_build: "y"
136− ignore_error: false
137 - name: 8.8.4
180 - name: 8.8.4
138 ghc_version: 8.8.4
181 ghc_version: 8.8.4
139 runner: ubuntu-latest
182 runner: ubuntu-latest
@@ -142,15 +185,6 @@ jobs:
142 cabal_project: cabal.project
185 cabal_project: cabal.project
143 disable_sdist_build: "y"
186 disable_sdist_build: "y"
144 ignore_error: false
187 ignore_error: false
145− - name: 8.6.5-no-fusion-unoptimized
146− ghc_version: 8.6.5
147− runner: ubuntu-latest
148− build: cabal
149− cabal_version: 3.6.2.0
150− cabal_project: cabal.project
151− cabal_build_options: "--flag no-fusion --flag -opt"
152− disable_sdist_build: "y"
153− ignore_error: false
154 - name: 8.6.5-debug-unoptimized
188 - name: 8.6.5-debug-unoptimized
155 ghc_version: 8.6.5
189 ghc_version: 8.6.5
156 runner: ubuntu-latest
190 runner: ubuntu-latest
@@ -160,66 +194,44 @@ jobs:
160 cabal_build_options: "--flag debug --flag -opt"
194 cabal_build_options: "--flag debug --flag -opt"
161 disable_sdist_build: "y"
195 disable_sdist_build: "y"
162 ignore_error: false
196 ignore_error: false
197+ - name: hlint
198+ build: hlint
199+ runner: ubuntu-latest
200+ ignore_error: true
163
201
164 steps:
202 steps:
165 - uses: actions/checkout@v2
203 - uses: actions/checkout@v2
166
204
167 - uses: actions/cache@v1
205 - uses: actions/cache@v1
168− name: Cache ~/.cabal
206+ name: Cache common directories
169 with:
207 with:
208+ path: |
209+ ~/.local
170− path: ~/.cabal
210+ ~/.cabal
211+ ~/.stack
212+ ~/.ghcup
171 # Bump the key version to clear the cache
213 # Bump the key version to clear the cache
172 key: ${{ runner.os }}-${{ matrix.ghc_version }}-cabal-v2
214 key: ${{ runner.os }}-${{ matrix.ghc_version }}-cabal-v2
173
215
174 - name: Download packcheck
216 - name: Download packcheck
175 run: |
217 run: |
176− # Get packcheck if needed
218+ if test ! -e "$PACKCHECK"
177− CURL=$(which curl)
178− PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
179− if test ! -e "$PACKCHECK_LOCAL_PATH"; then $CURL -sL -o "$PACKCHECK_LOCAL_PATH" $PACKCHECK_URL; fi;
180− chmod +x $PACKCHECK_LOCAL_PATH
181−
182− os=$(uname -s -m)
183− case "$os" in
184− "Linux x86_64") GHCUP_ARCH="x86_64-linux" ;;
185− "Darwin x86_64") GHCUP_ARCH="x86_64-apple-darwin" ;;
186− *) echo "Unknown OS/Arch: $os"; exit 1;;
187− esac
188−
189− # Check available versions here: https://downloads.haskell.org/~ghcup/
190− GHCUP_VER=0.1.18.0
191− $CURL -sL -o ./ghcup https://downloads.haskell.org/~ghcup/$GHCUP_VER/${GHCUP_ARCH}-ghcup-$GHCUP_VER
192− chmod +x ./ghcup
193− if test "$GHCVER" = "head"
194 then
219 then
195− # The URL may change, to find a working URL go to https://gitlab.haskell.org/ghc/ghc/-/jobs/
220+ if test -z "$PACKCHECK_GITHUB_COMMIT"
196− # Find a debian10 job, click on a passed/failed job, at the
221+ then
197− # end of the output you will find the tar.xz name, put that after
222+ die "PACKCHECK_GITHUB_COMMIT is not specified."
198− # "raw/", and put the job name after "job=".
223+ fi
199− # Also see https://github.com/mpickering/ghc-artefact-nix/blob/master/gitlab-artifact.nix
224+ PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
200− ./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
225+ curl --fail -sL -o "$PACKCHECK" $PACKCHECK_URL || exit 1
201− else
226+ chmod +x $PACKCHECK
202− ./ghcup install ghc $GHCVER
227+ elif test ! -x "$PACKCHECK"
228+ then
229+ chmod +x $PACKCHECK
203 fi
230 fi
204− ./ghcup install cabal $CABALVER
205− ./ghcup set ghc $GHCVER
206− ./ghcup set cabal $CABALVER
207
231
208 - name: Run tests
232 - name: Run tests
209 run: |
233 run: |
210− if test -n "$DOCTEST"
211− then
212− mkdir -p $HOME/.cabal/bin
213− 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
214− echo '0829bd034fba901cbcfe491d98ed8b28fd54f9cb5c91fa8e1ac62dc4413c9562 cabal-docspec.xz' | sha256sum -c -
215− xz -d < cabal-docspec.xz > $HOME/.cabal/bin/cabal-docspec
216− rm -f cabal-docspec.xz
217− chmod a+x $HOME/.cabal/bin/cabal-docspec
218− cabal update
219− cabal build --project-file cabal.project.doctest all
220− $HOME/.cabal/bin/cabal-docspec --version
221− $HOME/.cabal/bin/cabal-docspec --timeout 60 --check-properties --property-variables xs
222− elif test -n "$COVERAGE"
234+ if test -n "$COVERAGE"
223 then
235 then
224 # Run tests with coverage
236 # Run tests with coverage
225 cabal update
237 cabal update
@@ -232,8 +244,15 @@ jobs:
232 # XXX Uncomment this and fix it properly later
244 # XXX Uncomment this and fix it properly later
233 # hpc-coveralls --repo-token="$COVERALLS_TOKEN" --coverage-mode=StrictlyFullLines
245 # hpc-coveralls --repo-token="$COVERALLS_TOKEN" --coverage-mode=StrictlyFullLines
234 else
246 else
235− export TOOLS_DIR=/opt
236 # /usr/local/opt/curl/bin for macOS
247 # /usr/local/opt/curl/bin for macOS
237 export PATH=$HOME/.local/bin:$HOME/.ghcup/bin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/local/opt/curl/bin
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
238− bash -c "$PACKCHECK_LOCAL_PATH $BUILD"
257+ bash -c "$PACKCHECK $BUILD"
239 fi
258 fi
.github/workflows/regression-check.yml+21−33
@@ -19,24 +19,22 @@ jobs:
19 env:
19 env:
20 CI_BENCHMARKS_WITH_CUTOFF: >-
20 CI_BENCHMARKS_WITH_CUTOFF: >-
21 Data.Array
21 Data.Array
22+ Data.MutArray
23+ Data.Array.Generic
22− Data.Array.Unboxed
24+ Data.Ring.Unboxed
23 Data.Fold
25 Data.Fold
26+ Data.Fold.Window
24 Data.Parser
27 Data.Parser
25− Data.Parser.ParserD
26− Data.Parser.ParserK
28+ Data.ParserK
27− Data.Stream.StreamD
29+ Data.StreamD
28− Data.Stream.StreamK:6
30+ Data.StreamK:6
29 Data.Unfold
31 Data.Unfold
30 Data.Stream
32 Data.Stream
31 Data.Stream.Concurrent
33 Data.Stream.Concurrent
34+ Data.Stream.ConcurrentEager
35+ Data.Stream.ConcurrentInterleaved
36+ Data.Stream.ConcurrentOrdered
32 FileSystem.Handle
37 FileSystem.Handle
33− Prelude.Ahead
34− Prelude.Async:12
35− Prelude.Parallel
36− Prelude.WAsync:6
37− Prelude.WSerial
38− Prelude.ZipAsync
39− Prelude.ZipSerial
40 Unicode.Char
38 Unicode.Char
41 Unicode.Stream
39 Unicode.Stream
42 Unicode.Utf8
40 Unicode.Utf8
@@ -62,7 +60,7 @@ jobs:
62 GHCUP_VER=0.1.18.0
60 GHCUP_VER=0.1.18.0
63 curl -sL -o ./ghcup https://downloads.haskell.org/~ghcup/$GHCUP_VER/x86_64-linux-ghcup-$GHCUP_VER
61 curl -sL -o ./ghcup https://downloads.haskell.org/~ghcup/$GHCUP_VER/x86_64-linux-ghcup-$GHCUP_VER
64 chmod +x ./ghcup
62 chmod +x ./ghcup
65− GHCVER=8.10.7
63+ GHCVER=9.2.7
66 ./ghcup install ghc $GHCVER
64 ./ghcup install ghc $GHCVER
67 ./ghcup set ghc $GHCVER
65 ./ghcup set ghc $GHCVER
68 cabal update
66 cabal update
@@ -75,14 +73,6 @@ jobs:
75 # Bump the key version to clear the cache
73 # Bump the key version to clear the cache
76 key: cache-v2
74 key: cache-v2
77
75
78− - name: Cache charts from master
79− id: cache-charts-master
80− uses: actions/cache@v2
81− with:
82− path: charts-master
83− # Bump the key version to clear the cache
84− key: charts-master-v1
85−
86 - name: Cache bench-runner from pr
76 - name: Cache bench-runner from pr
87 id: cache-bench-runner-pr
77 id: cache-bench-runner-pr
88 uses: actions/cache@v2
78 uses: actions/cache@v2
@@ -101,7 +91,6 @@ jobs:
101 clean: false
91 clean: false
102
92
103 - name: Install bench-runner
93 - name: Install bench-runner
104− if: steps.cache-bench-runner-pr.outputs.cache-hit != 'true'
105 run: |
94 run: |
106 cabal install bench-runner --project-file=cabal.project.report --installdir=./
95 cabal install bench-runner --project-file=cabal.project.report --installdir=./
107
96
@@ -110,19 +99,16 @@ jobs:
110 # -----------------------------------------------------------------
99 # -----------------------------------------------------------------
111
100
112 - name: Checkout the base branch
101 - name: Checkout the base branch
113− if: steps.cache-charts-master.outputs.cache-hit != 'true'
114 uses: actions/checkout@v2
102 uses: actions/checkout@v2
115 with:
103 with:
116 ref: master
104 ref: master
117 clean: false
105 clean: false
118
106
119 - name: Run benchmarks
107 - name: Run benchmarks
120− if: steps.cache-charts-master.outputs.cache-hit != 'true'
121 run: |
108 run: |
122− ./bench-runner --targets "$CI_BENCHMARKS" --raw
109+ ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --raw
123
110
124 - name: Move charts to charts-master
111 - name: Move charts to charts-master
125− if: steps.cache-charts-master.outputs.cache-hit != 'true'
126 run: mv charts charts-master
112 run: mv charts charts-master
127
113
128 # -----------------------------------------------------------------
114 # -----------------------------------------------------------------
@@ -139,7 +125,7 @@ jobs:
139
125
140 - name: Run benchmarks and append
126 - name: Run benchmarks and append
141 run: |
127 run: |
142− ./bench-runner --targets "$CI_BENCHMARKS" --raw --append
128+ ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --raw --append
143
129
144 # -----------------------------------------------------------------
130 # -----------------------------------------------------------------
145 # -- Compare
131 # -- Compare
@@ -147,7 +133,7 @@ jobs:
147
133
148 - name: List all benchmarks
134 - name: List all benchmarks
149 run: |
135 run: |
150− ./bench-runner --targets "$CI_BENCHMARKS" --no-measure
136+ ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --no-measure
151
137
152 - name: Compare benchmarks
138 - name: Compare benchmarks
153 run: |
139 run: |
@@ -165,11 +151,13 @@ jobs:
165
151
166 echo
152 echo
167 echo "Checking $bname for regressions greater than $cutoff percent"
153 echo "Checking $bname for regressions greater than $cutoff percent"
168− ! ./bench-runner \
154+ ! ./bench-runner \
155+ --package-name streamly-benchmarks \
156+ --package-version 0.0.0 \
169− --targets "$bname" \
157+ --targets "$bname" \
170− --fields "$CI_FIELDS" \
158+ --fields "$CI_FIELDS" \
171− --no-measure --silent \
159+ --no-measure --silent \
172− --diff-cutoff-percent $cutoff \
160+ --diff-cutoff-percent $cutoff \
173 | grep -v "^$"
161 | grep -v "^$"
174 test $? -eq 1 && EXIT_STATUS=1
162 test $? -eq 1 && EXIT_STATUS=1
175 done
163 done
.hlint.ignore+9−2
@@ -2,29 +2,36 @@ core/src/Streamly/Internal/Data/Stream/StreamK/Type.hs
2core/src/Streamly/Internal/Data/Pipe/Type.hs
2core/src/Streamly/Internal/Data/Pipe/Type.hs
3core/src/Streamly/Internal/Unicode/Stream.hs
3core/src/Streamly/Internal/Unicode/Stream.hs
4src/Streamly/Internal/Data/SmallArray/Type.hs
4src/Streamly/Internal/Data/SmallArray/Type.hs
5+src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs
6+src/Streamly/Internal/Data/Stream/Serial.hs
7+src/Streamly/Internal/Data/Stream/Zip.hs
5test/Streamly/Test/Data/Array.hs
8test/Streamly/Test/Data/Array.hs
6test/Streamly/Test/Data/Parser.hs
9test/Streamly/Test/Data/Parser.hs
7−test/Streamly/Test/Data/Parser/ParserD.hs
10+test/Streamly/Test/Data/ParserK.hs
8test/Streamly/Test/Data/SmallArray.hs
11test/Streamly/Test/Data/SmallArray.hs
9test/Streamly/Test/Data/Unfold.hs
12test/Streamly/Test/Data/Unfold.hs
10test/Streamly/Test/FileSystem/Event.hs
13test/Streamly/Test/FileSystem/Event.hs
11test/Streamly/Test/Prelude/Concurrent.hs
14test/Streamly/Test/Prelude/Concurrent.hs
15+test/Streamly/Test/Data/Stream/Concurrent.hs
16+test/lib/Streamly/Test/Prelude/Common.hs
12test/Streamly/Test/Prelude/Fold.hs
17test/Streamly/Test/Prelude/Fold.hs
13test/Streamly/Test/Prelude/Rate.hs
18test/Streamly/Test/Prelude/Rate.hs
14test/Streamly/Test/Prelude/Serial.hs
19test/Streamly/Test/Prelude/Serial.hs
15test/Streamly/Test/Unicode/Stream.hs
20test/Streamly/Test/Unicode/Stream.hs
21+test/Streamly/Test/Data/Unbox.hs
16benchmark/lib/Streamly/Benchmark/Common.hs
22benchmark/lib/Streamly/Benchmark/Common.hs
17benchmark/lib/Streamly/Benchmark/Common/Handle.hs
23benchmark/lib/Streamly/Benchmark/Common/Handle.hs
18benchmark/lib/Streamly/Benchmark/Prelude.hs
24benchmark/lib/Streamly/Benchmark/Prelude.hs
19benchmark/NanoBenchmarks.hs
25benchmark/NanoBenchmarks.hs
20benchmark/Streamly/Benchmark/Data/Array.hs
26benchmark/Streamly/Benchmark/Data/Array.hs
21benchmark/Streamly/Benchmark/Data/Parser.hs
27benchmark/Streamly/Benchmark/Data/Parser.hs
22−benchmark/Streamly/Benchmark/Data/Parser/ParserD.hs
28+benchmark/Streamly/Benchmark/Data/ParserK.hs
23benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs
29benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs
24benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs
30benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs
25benchmark/Streamly/Benchmark/Data/Unfold.hs
31benchmark/Streamly/Benchmark/Data/Unfold.hs
26benchmark/Streamly/Benchmark/FileSystem/Handle.hs
32benchmark/Streamly/Benchmark/FileSystem/Handle.hs
27benchmark/Streamly/Benchmark/Prelude/Async.hs
33benchmark/Streamly/Benchmark/Prelude/Async.hs
34+benchmark/Streamly/Benchmark/Prelude/Concurrent.hs
28benchmark/Streamly/Benchmark/Prelude/Merge.hs
35benchmark/Streamly/Benchmark/Prelude/Merge.hs
29benchmark/Streamly/Benchmark/Prelude/Parallel.hs
36benchmark/Streamly/Benchmark/Prelude/Parallel.hs
30benchmark/Streamly/Benchmark/Prelude/Rate.hs
37benchmark/Streamly/Benchmark/Prelude/Rate.hs
.hlint.yaml+2−4
@@ -24,16 +24,14 @@
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 ++"}
27
28
28# Warnings ignored in specific places
29# 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}
35- ignore: {name: "Redundant bracket", within: Stream.Split}
33- ignore: {name: "Redundant bracket", within: Stream.Split}
36−- ignore: {name: "Use isDigit", within: Streamly.Internal.Unicode.Char.Parser}
34+- ignore: {name: "Use isDigit", within: Streamly.Internal.Unicode.Parser}
37
35
38# Specify additional command line arguments
36# Specify additional command line arguments
39#
37#
CHANGELOG.md+1−1
@@ -1 +1 @@
1−docs/User/ProjectRelated/Changelog.md
1+docs/User/Project/Changelog.md
LICENSE−254
@@ -26,172 +26,6 @@ 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−
195-------------------------------------------------------------------------------
29-------------------------------------------------------------------------------
196fsnotify-0.3.0.1 (http://hackage.haskell.org/package/fsnotify-0.3.0.1/)
30fsnotify-0.3.0.1 (http://hackage.haskell.org/package/fsnotify-0.3.0.1/)
197-------------------------------------------------------------------------------
31-------------------------------------------------------------------------------
@@ -259,91 +93,3 @@ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
259THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
93THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
260(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
94(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
261OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
95OF 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/Tutorials/Introduction.md
1+docs/User/Project/README.md
appveyor.yml+2
@@ -14,6 +14,8 @@ 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
17 GHC_OPTIONS: "-Werror"
19 GHC_OPTIONS: "-Werror"
18 CABAL_REINIT_CONFIG: "y"
20 CABAL_REINIT_CONFIG: "y"
19 LC_ALL: "C.UTF-8"
21 LC_ALL: "C.UTF-8"
benchmark/NanoBenchmarks.hs+2−2
@@ -18,7 +18,7 @@ import qualified Streamly.Data.Fold as FL
18import qualified Streamly.Internal.Data.Stream as S
18import qualified Streamly.Internal.Data.Stream as S
19import qualified Streamly.Internal.Data.Stream.IsStream as Internal
19import qualified Streamly.Internal.Data.Stream.IsStream as Internal
20
20
21−import Gauge
21+import Test.Tasty.Bench
22import System.Random
22import System.Random
23
23
24maxValue :: Int
24maxValue :: Int
@@ -117,7 +117,7 @@ main = do
117 $ map (fromIntegral . ord) "abcdefghijklmnopqrstuvwxyz"
117 $ map (fromIntegral . ord) "abcdefghijklmnopqrstuvwxyz"
118 )
118 )
119 FL.drain
119 FL.drain
120− $ IFH.getBytes inText
120+ $ IFH.read inText
121 )
121 )
122 >>= print
122 >>= print
123 ]
123 ]
benchmark/Streamly/Benchmark/Data/Array.hs+7−1
@@ -1,4 +1,5 @@
1{-# OPTIONS_GHC -Wno-deprecations #-}
1{-# OPTIONS_GHC -Wno-deprecations #-}
2+{-# OPTIONS_GHC -Wno-orphans #-}
2
3
3{-# LANGUAGE CPP #-}
4{-# LANGUAGE CPP #-}
4
5
@@ -11,10 +12,15 @@ import qualified GHC.Exts as GHC
11
12
12-- import qualified Streamly.Data.Array as A
13-- import qualified Streamly.Data.Array as A
13import qualified Streamly.Internal.Data.Array as A
14import qualified Streamly.Internal.Data.Array as A
15+
14type Stream = A.Array
16type Stream = A.Array
15
17
16#include "Streamly/Benchmark/Data/Array/Common.hs"
18#include "Streamly/Benchmark/Data/Array/Common.hs"
17
19
20+instance NFData (A.Array a) where
21+ {-# INLINE rnf #-}
22+ rnf _ = ()
23+
18-------------------------------------------------------------------------------
24-------------------------------------------------------------------------------
19-- Benchmark helpers
25-- Benchmark helpers
20-------------------------------------------------------------------------------
26-------------------------------------------------------------------------------
@@ -78,7 +84,7 @@ o_1_space_generation value =
78 [ bgroup
84 [ bgroup
79 "generation"
85 "generation"
80 [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
86 [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
81− , let testStr = mkListString value
87+ , let testStr = "fromList " ++ mkListString value
82 in testStr `deepseq` bench "read" (nf readInstance testStr)
88 in testStr `deepseq` bench "read" (nf readInstance testStr)
83 , benchPureSrc "writeN . IsList.fromList" (sourceIsList value)
89 , benchPureSrc "writeN . IsList.fromList" (sourceIsList value)
84 , benchPureSrc
90 , benchPureSrc
benchmark/Streamly/Benchmark/Data/Array/Common.hs+6−6
@@ -71,9 +71,9 @@ onArray
71 -> m (Stream Int)
71 -> m (Stream Int)
72onArray value f arr = S.fold (A.writeN value) $ f $ S.unfold A.reader arr
72onArray value f arr = S.fold (A.writeN value) $ f $ S.unfold A.reader arr
73
73
74−scanl' value n = composeN n $ onArray value $ S.scanl' (+) 0
74+scanl' value n = composeN n $ onArray value $ S.scan (Fold.foldl' (+) 0)
75−scanl1' value n = composeN n $ onArray value $ S.scanl1' (+)
75+scanl1' value n = composeN n $ onArray value $ Stream.scanl1' (+)
76−map value n = composeN n $ onArray value $ S.map (+1)
76+map value n = composeN n $ onArray value $ fmap (+1)
77-- map n = composeN n $ A.map (+1)
77-- map n = composeN n $ A.map (+1)
78
78
79{-# INLINE eqInstance #-}
79{-# INLINE eqInstance #-}
@@ -98,7 +98,7 @@ showInstance = P.show
98
98
99{-# INLINE pureFoldl' #-}
99{-# INLINE pureFoldl' #-}
100pureFoldl' :: MonadIO m => Stream Int -> m Int
100pureFoldl' :: MonadIO m => Stream Int -> m Int
101−pureFoldl' = S.foldl' (+) 0 . S.unfold A.reader
101+pureFoldl' = S.fold (Fold.foldl' (+) 0) . S.unfold A.reader
102
102
103-------------------------------------------------------------------------------
103-------------------------------------------------------------------------------
104-- Elimination
104-- Elimination
@@ -106,11 +106,11 @@ pureFoldl' = S.foldl' (+) 0 . S.unfold A.reader
106
106
107{-# INLINE unfoldReadDrain #-}
107{-# INLINE unfoldReadDrain #-}
108unfoldReadDrain :: MonadIO m => Stream Int -> m ()
108unfoldReadDrain :: MonadIO m => Stream Int -> m ()
109−unfoldReadDrain = S.drain . S.unfold A.reader
109+unfoldReadDrain = S.fold Fold.drain . S.unfold A.reader
110
110
111{-# INLINE toStreamRevDrain #-}
111{-# INLINE toStreamRevDrain #-}
112toStreamRevDrain :: MonadIO m => Stream Int -> m ()
112toStreamRevDrain :: MonadIO m => Stream Int -> m ()
113−toStreamRevDrain = S.drain . A.readRev
113+toStreamRevDrain = S.fold Fold.drain . A.readRev
114
114
115-------------------------------------------------------------------------------
115-------------------------------------------------------------------------------
116-- Bench groups
116-- Bench groups
benchmark/Streamly/Benchmark/Data/Array/CommonImports.hs+5−4
@@ -5,11 +5,12 @@ import Control.Monad.IO.Class (MonadIO)
5import Data.Functor ((<&>))
5import Data.Functor ((<&>))
6import System.Random (randomRIO)
6import System.Random (randomRIO)
7
7
8−import qualified Streamly.Prelude as S
8+import qualified Streamly.Data.Fold as Fold
9+import qualified Streamly.Data.Stream as S
9−import qualified Streamly.Internal.Data.Stream as Stream
10+import qualified Streamly.Internal.Data.Stream as Stream
10
11
11−import Gauge
12+import Test.Tasty.Bench
12import Streamly.Benchmark.Common hiding (benchPureSrc)
13import Streamly.Benchmark.Common hiding (benchPureSrc)
13−import qualified Streamly.Benchmark.Prelude as P
14+import qualified Stream.Common as P
14
15
15import Prelude as P hiding (map)
16import Prelude as P hiding (map)
benchmark/Streamly/Benchmark/Data/Array/Generic.hs+6
@@ -1,4 +1,5 @@
1{-# OPTIONS_GHC -Wno-deprecations #-}
1{-# OPTIONS_GHC -Wno-deprecations #-}
2+{-# OPTIONS_GHC -Wno-orphans #-}
2
3
3{-# LANGUAGE CPP #-}
4{-# LANGUAGE CPP #-}
4
5
@@ -8,10 +9,15 @@ import Control.DeepSeq (deepseq)
8
9
9import qualified Streamly.Internal.Data.Array.Generic as IA
10import qualified Streamly.Internal.Data.Array.Generic as IA
10import qualified Streamly.Internal.Data.Array.Generic as A
11import qualified Streamly.Internal.Data.Array.Generic as A
12+
11type Stream = A.Array
13type Stream = A.Array
12
14
13#include "Streamly/Benchmark/Data/Array/Common.hs"
15#include "Streamly/Benchmark/Data/Array/Common.hs"
14
16
17+instance NFData a => NFData (A.Array a) where
18+ {-# INLINE rnf #-}
19+ rnf = A.foldl' (\_ x -> rnf x) ()
20+
15-------------------------------------------------------------------------------
21-------------------------------------------------------------------------------
16-- Benchmark helpers
22-- Benchmark helpers
17-------------------------------------------------------------------------------
23-------------------------------------------------------------------------------
benchmark/Streamly/Benchmark/Data/Array/Stream.hs+39−29
@@ -27,32 +27,34 @@ module Main
27
27
28import Control.DeepSeq (NFData(..))
28import Control.DeepSeq (NFData(..))
29import Control.Monad (void, when)
29import Control.Monad (void, when)
30−import Control.Monad.Catch (MonadCatch, try, SomeException)
30+import Control.Monad.Catch (MonadCatch)
31import Data.Functor.Identity (runIdentity)
31import Data.Functor.Identity (runIdentity)
32import Data.Maybe (isJust)
32import Data.Maybe (isJust)
33import Data.Word (Word8)
33import Data.Word (Word8)
34import Streamly.Internal.Data.Stream (Stream)
34import Streamly.Internal.Data.Stream (Stream)
35+import Streamly.Internal.Data.StreamK (StreamK)
35import System.IO (Handle)
36import System.IO (Handle)
36import System.Random (randomRIO)
37import System.Random (randomRIO)
37import Prelude hiding ()
38import Prelude hiding ()
38
39
40+import qualified Streamly.Data.Stream as Stream
39import qualified Streamly.Internal.Data.Array as Array
41import qualified Streamly.Internal.Data.Array as Array
40import qualified Streamly.Internal.Data.Array.Stream as ArrayStream
42import qualified Streamly.Internal.Data.Array.Stream as ArrayStream
41import qualified Streamly.Internal.Data.Fold as Fold
43import qualified Streamly.Internal.Data.Fold as Fold
42import qualified Streamly.Internal.Data.Parser as Parser
44import qualified Streamly.Internal.Data.Parser as Parser
43−import qualified Streamly.Internal.Data.Stream as S
45+import qualified Streamly.Internal.Data.Stream as Stream
44−import qualified Streamly.Internal.Data.Stream.IsStream as Stream
46+import qualified Streamly.Internal.Data.StreamK as StreamK
45import qualified Streamly.Internal.FileSystem.Handle as Handle
47import qualified Streamly.Internal.FileSystem.Handle as Handle
46import qualified Streamly.Internal.Unicode.Stream as Unicode
48import qualified Streamly.Internal.Unicode.Stream as Unicode
47
49
48−import Gauge hiding (env)
50+import Test.Tasty.Bench hiding (env)
49import Streamly.Benchmark.Common
51import Streamly.Benchmark.Common
50import Streamly.Benchmark.Common.Handle
52import Streamly.Benchmark.Common.Handle
51import Control.Monad.IO.Class (MonadIO)
53import Control.Monad.IO.Class (MonadIO)
52
54
53#ifdef INSPECTION
55#ifdef INSPECTION
54−import Streamly.Internal.Data.Unboxed (Unbox)
56+import Streamly.Internal.Data.MutByteArray (Unbox)
55−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
57+import Streamly.Internal.Data.Stream (Step(..))
56import Test.Inspection
58import Test.Inspection
57#endif
59#endif
58
60
@@ -63,8 +65,8 @@ import Test.Inspection
63-- XXX these can be moved to the common module
65-- XXX these can be moved to the common module
64
66
65{-# INLINE sourceUnfoldrM #-}
67{-# INLINE sourceUnfoldrM #-}
66−sourceUnfoldrM :: MonadIO m => Int -> Int -> Stream m Int
68+sourceUnfoldrM :: MonadIO m => Int -> Int -> Stream.Stream m Int
67−sourceUnfoldrM value n = S.unfoldrM step n
69+sourceUnfoldrM value n = Stream.unfoldrM step n
68 where
70 where
69 step cnt =
71 step cnt =
70 if cnt > n + value
72 if cnt > n + value
@@ -100,7 +102,7 @@ inspect $ 'toChunksLast `hasNoType` ''Step
100toChunksSumLengths :: Handle -> IO Int
102toChunksSumLengths :: Handle -> IO Int
101toChunksSumLengths inh =
103toChunksSumLengths inh =
102 let s = Handle.readChunks inh
104 let s = Handle.readChunks inh
103− in Stream.sum (Stream.map Array.length s)
105+ in Stream.fold Fold.sum (Stream.map Array.length s)
104
106
105#ifdef INSPECTION
107#ifdef INSPECTION
106inspect $ hasNoTypeClasses 'toChunksSumLengths
108inspect $ hasNoTypeClasses 'toChunksSumLengths
@@ -121,7 +123,7 @@ inspect $ 'toChunksCountBytes `hasNoType` ''Step
121
123
122toChunksDecodeUtf8Arrays :: Handle -> IO ()
124toChunksDecodeUtf8Arrays :: Handle -> IO ()
123toChunksDecodeUtf8Arrays =
125toChunksDecodeUtf8Arrays =
124− Stream.drain . Unicode.decodeUtf8Arrays . Handle.readChunks
126+ Stream.drain . Unicode.decodeUtf8Chunks . Handle.readChunks
125
127
126#ifdef INSPECTION
128#ifdef INSPECTION
127inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
129inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
@@ -135,7 +137,9 @@ inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
135-- | Count the number of lines in a file.
137-- | Count the number of lines in a file.
136toChunksSplitOnSuffix :: Handle -> IO Int
138toChunksSplitOnSuffix :: Handle -> IO Int
137toChunksSplitOnSuffix =
139toChunksSplitOnSuffix =
140+ Stream.fold Fold.length
138− Stream.length . ArrayStream.splitOnSuffix 10 . Handle.readChunks
141+ . ArrayStream.splitOnSuffix 10
142+ . Handle.readChunks
139
143
140#ifdef INSPECTION
144#ifdef INSPECTION
141inspect $ hasNoTypeClasses 'toChunksSplitOnSuffix
145inspect $ hasNoTypeClasses 'toChunksSplitOnSuffix
@@ -145,7 +149,10 @@ inspect $ 'toChunksSplitOnSuffix `hasNoType` ''Step
145-- XXX use a word splitting combinator instead of splitOn and test it.
149-- XXX use a word splitting combinator instead of splitOn and test it.
146-- | Count the number of words in a file.
150-- | Count the number of words in a file.
147toChunksSplitOn :: Handle -> IO Int
151toChunksSplitOn :: Handle -> IO Int
152+toChunksSplitOn =
153+ Stream.fold Fold.length
148−toChunksSplitOn = Stream.length . ArrayStream.splitOn 32 . Handle.readChunks
154+ . ArrayStream.splitOn 32
155+ . Handle.readChunks
149
156
150#ifdef INSPECTION
157#ifdef INSPECTION
151inspect $ hasNoTypeClasses 'toChunksSplitOn
158inspect $ hasNoTypeClasses 'toChunksSplitOn
@@ -183,8 +190,7 @@ o_1_space_read_chunked env =
183copyChunksSplitInterposeSuffix :: Handle -> Handle -> IO ()
190copyChunksSplitInterposeSuffix :: Handle -> Handle -> IO ()
184copyChunksSplitInterposeSuffix inh outh =
191copyChunksSplitInterposeSuffix inh outh =
185 Stream.fold (Handle.write outh)
192 Stream.fold (Handle.write outh)
186− $ ArrayStream.interposeSuffix 10
193+ $ ArrayStream.interposeSuffix 10 . ArrayStream.splitOnSuffix 10
187− $ ArrayStream.splitOnSuffix 10
188 $ Handle.readChunks inh
194 $ Handle.readChunks inh
189
195
190#ifdef INSPECTION
196#ifdef INSPECTION
@@ -197,9 +203,8 @@ inspect $ 'copyChunksSplitInterposeSuffix `hasNoType` ''Step
197copyChunksSplitInterpose :: Handle -> Handle -> IO ()
203copyChunksSplitInterpose :: Handle -> Handle -> IO ()
198copyChunksSplitInterpose inh outh =
204copyChunksSplitInterpose inh outh =
199 Stream.fold (Handle.write outh)
205 Stream.fold (Handle.write outh)
200− $ ArrayStream.interpose 32
201 -- XXX this is not correct word splitting combinator
206 -- XXX this is not correct word splitting combinator
202− $ ArrayStream.splitOn 32
207+ $ ArrayStream.interpose 32 . ArrayStream.splitOn 32
203 $ Handle.readChunks inh
208 $ Handle.readChunks inh
204
209
205#ifdef INSPECTION
210#ifdef INSPECTION
@@ -231,25 +236,26 @@ drainWhile p = Parser.takeWhile p Fold.drain
231
236
232{-# INLINE fold #-}
237{-# INLINE fold #-}
233fold :: Stream IO (Array.Array Int) -> IO ()
238fold :: Stream IO (Array.Array Int) -> IO ()
234−fold s = void $ ArrayStream.foldBreak Fold.drain s
239+fold s = void $ ArrayStream.foldBreak Fold.drain $ StreamK.fromStream s
235
240
236{-# INLINE parse #-}
241{-# INLINE parse #-}
237parse :: Int -> Stream IO (Array.Array Int) -> IO ()
242parse :: Int -> Stream IO (Array.Array Int) -> IO ()
243+parse value s =
238−parse value s = void $ ArrayStream.parseBreak (drainWhile (< value)) s
244+ void $ ArrayStream.parseBreak (drainWhile (< value)) $ StreamK.fromStream s
239
245
240{-# INLINE foldBreak #-}
246{-# INLINE foldBreak #-}
241−foldBreak :: Stream IO (Array.Array Int) -> IO ()
247+foldBreak :: StreamK IO (Array.Array Int) -> IO ()
242foldBreak s = do
248foldBreak s = do
243 (r, s1) <- ArrayStream.foldBreak Fold.one s
249 (r, s1) <- ArrayStream.foldBreak Fold.one s
244 when (isJust r) $ foldBreak s1
250 when (isJust r) $ foldBreak s1
245
251
246{-# INLINE parseBreak #-}
252{-# INLINE parseBreak #-}
247−parseBreak :: Stream IO (Array.Array Int) -> IO ()
253+parseBreak :: StreamK IO (Array.Array Int) -> IO ()
248parseBreak s = do
254parseBreak s = do
249− r <- try $ ArrayStream.parseBreak Parser.one s
255+ r <- ArrayStream.parseBreak Parser.one s
250 case r of
256 case r of
251− Left (_ :: SomeException) -> return ()
257+ (Left _, _) -> return ()
252− Right (_, s1) -> parseBreak s1
258+ (Right _, s1) -> parseBreak s1
253
259
254o_1_space_serial_array ::
260o_1_space_serial_array ::
255 Int -> [Array.Array Int] -> [Array.Array Int] -> [Benchmark]
261 Int -> [Array.Array Int] -> [Array.Array Int] -> [Benchmark]
@@ -259,7 +265,7 @@ o_1_space_serial_array bound arraysSmall arraysBig =
259 , benchIO
265 , benchIO
260 "foldBreak (recursive, small arrays)"
266 "foldBreak (recursive, small arrays)"
261 (\_ -> Stream.fromList arraysSmall)
267 (\_ -> Stream.fromList arraysSmall)
262− foldBreak
268+ (foldBreak . StreamK.fromStream)
263 , benchIO "parse (of 100)" (\_ -> Stream.fromList arraysSmall)
269 , benchIO "parse (of 100)" (\_ -> Stream.fromList arraysSmall)
264 $ parse bound
270 $ parse bound
265 , benchIO "parse (single)" (\_ -> Stream.fromList arraysBig)
271 , benchIO "parse (single)" (\_ -> Stream.fromList arraysBig)
@@ -267,7 +273,7 @@ o_1_space_serial_array bound arraysSmall arraysBig =
267 , benchIO
273 , benchIO
268 "parseBreak (recursive, small arrays)"
274 "parseBreak (recursive, small arrays)"
269 (\_ -> Stream.fromList arraysSmall)
275 (\_ -> Stream.fromList arraysSmall)
270− parseBreak
276+ (parseBreak . StreamK.fromStream)
271 ]
277 ]
272
278
273-------------------------------------------------------------------------------
279-------------------------------------------------------------------------------
@@ -284,10 +290,14 @@ main = do
284
290
285 where
291 where
286
292
287− alloc value = do
293+ alloc value =
294+ if value <= 0
295+ then return (undefined, undefined)
296+ else
297+ do
288− small <- Stream.toList $ Stream.arraysOf 100 $ sourceUnfoldrM value 0
298+ small <- Stream.toList $ Stream.chunksOf 100 $ sourceUnfoldrM value 0
289− big <- Stream.toList $ Stream.arraysOf value $ sourceUnfoldrM value 0
299+ big <- Stream.toList $ Stream.chunksOf value $ sourceUnfoldrM value 0
290− return (small, big)
300+ return (small, big)
291
301
292 allBenchmarks env arrays value =
302 allBenchmarks env arrays value =
293 let (arraysSmall, arraysBig) = arrays
303 let (arraysSmall, arraysBig) = arrays
benchmark/Streamly/Benchmark/Data/Fold.hs+100−65
@@ -6,16 +6,23 @@
6-- Maintainer : streamly@composewell.com
6-- Maintainer : streamly@composewell.com
7
7
8{-# LANGUAGE FlexibleContexts #-}
8{-# LANGUAGE FlexibleContexts #-}
9+{-# LANGUAGE FlexibleInstances #-}
9{-# LANGUAGE RankNTypes #-}
10{-# LANGUAGE RankNTypes #-}
10{-# LANGUAGE ScopedTypeVariables #-}
11{-# LANGUAGE ScopedTypeVariables #-}
11{-# OPTIONS_GHC -fno-warn-warnings-deprecations #-}
12{-# 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
12
19
13module Main (main) where
20module Main (main) where
14
21
15import Control.DeepSeq (NFData(..))
22import Control.DeepSeq (NFData(..))
16import Control.Monad (when)
23import Control.Monad (when)
17import Control.Monad.IO.Class (MonadIO(..))
24import Control.Monad.IO.Class (MonadIO(..))
18−import Data.Functor.Identity (Identity)
25+import Data.Functor.Identity (Identity(..))
19import Data.Map.Strict (Map)
26import Data.Map.Strict (Map)
20import Data.Hashable (Hashable)
27import Data.Hashable (Hashable)
21import Data.HashMap.Strict (HashMap)
28import Data.HashMap.Strict (HashMap)
@@ -26,14 +33,15 @@ import System.Random (randomRIO)
26import Streamly.Internal.Data.Stream (Stream)
33import Streamly.Internal.Data.Stream (Stream)
27import Streamly.Internal.Data.Fold (Fold(..))
34import Streamly.Internal.Data.Fold (Fold(..))
28import Streamly.Internal.Data.IsMap.HashMap ()
35import Streamly.Internal.Data.IsMap.HashMap ()
36+import Streamly.Internal.Data.MutArray (MutArray)
29
37
30import qualified Streamly.Internal.Data.Fold as FL
38import qualified Streamly.Internal.Data.Fold as FL
31−import qualified Streamly.Internal.Data.Fold.Extra as FL
39+import qualified Streamly.Data.Fold.Prelude as Fold
32import qualified Streamly.Internal.Data.Unfold as Unfold
40import qualified Streamly.Internal.Data.Unfold as Unfold
33import qualified Streamly.Internal.Data.Pipe as Pipe
41import qualified Streamly.Internal.Data.Pipe as Pipe
34import qualified Streamly.Internal.Data.Stream as Stream
42import qualified Streamly.Internal.Data.Stream as Stream
35
43
36−import Gauge
44+import Test.Tasty.Bench
37import Streamly.Benchmark.Common
45import Streamly.Benchmark.Common
38import Prelude hiding (all, any, take, unzip, sequence_, filter)
46import Prelude hiding (all, any, take, unzip, sequence_, filter)
39
47
@@ -200,55 +208,55 @@ partitionByMinM :: Monad m => Stream m Int -> m (Int, Int)
200partitionByMinM =
208partitionByMinM =
201 Stream.fold (FL.partitionByMinM (return . oddEven) FL.sum FL.length)
209 Stream.fold (FL.partitionByMinM (return . oddEven) FL.sum FL.length)
202
210
203−{-# INLINE demuxWith #-}
211+{-# INLINE demuxToMap #-}
204−demuxWith :: (Monad m, Ord k) =>
212+demuxToMap :: (Monad m, Ord k) =>
205 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (Map k b)
213 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (Map k b)
206−demuxWith f g = Stream.fold (FL.demuxWith f g)
214+demuxToMap f g = Stream.fold (FL.demuxToContainer f g)
207
215
208−{-# INLINE demuxWithInt #-}
216+{-# INLINE demuxToIntMap #-}
209−demuxWithInt :: Monad m =>
217+demuxToIntMap :: Monad m =>
210 (a -> Int) -> (a -> m (Fold m a b)) -> Stream m a -> m (IntMap b)
218 (a -> Int) -> (a -> m (Fold m a b)) -> Stream m a -> m (IntMap b)
211−demuxWithInt f g = Stream.fold (FL.demuxWith f g)
219+demuxToIntMap f g = Stream.fold (FL.demuxToContainer f g)
212
220
213−{-# INLINE demuxWithHash #-}
221+{-# INLINE demuxToHashMap #-}
214−demuxWithHash :: (Monad m, Ord k, Hashable k) =>
222+demuxToHashMap :: (Monad m, Hashable k) =>
215 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (HashMap k b)
223 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (HashMap k b)
216−demuxWithHash f g = Stream.fold (FL.demuxWith f g)
224+demuxToHashMap f g = Stream.fold (FL.demuxToContainer f g)
217
225
218−{-# INLINE demuxMutWith #-}
226+{-# INLINE demuxToMapIO #-}
219−demuxMutWith :: (MonadIO m, Ord k) =>
227+demuxToMapIO :: (MonadIO m, Ord k) =>
220 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (Map k b)
228 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (Map k b)
221−demuxMutWith f g = Stream.fold (FL.demuxMutWith f g)
229+demuxToMapIO f g = Stream.fold (FL.demuxToContainerIO f g)
222
230
223−{-# INLINE demuxMutWithHash #-}
231+{-# INLINE demuxToHashMapIO #-}
224−demuxMutWithHash :: (MonadIO m, Ord k, Hashable k) =>
232+demuxToHashMapIO :: (MonadIO m, Hashable k) =>
225 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (HashMap k b)
233 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (HashMap k b)
226−demuxMutWithHash f g = Stream.fold (FL.demuxMutWith f g)
234+demuxToHashMapIO f g = Stream.fold (FL.demuxToContainerIO f g)
227
235
228−{-# INLINE classifyWith #-}
236+{-# INLINE toMap #-}
229−classifyWith ::
237+toMap ::
230 (Monad m, Ord k, Num a) => (a -> k) -> Stream m a -> m (Map k a)
238 (Monad m, Ord k, Num a) => (a -> k) -> Stream m a -> m (Map k a)
231−classifyWith f = Stream.fold (FL.classifyWith f FL.sum)
239+toMap f = Stream.fold (FL.toContainer f FL.sum)
232
240
233−{-# INLINE classifyWithInt #-}
241+{-# INLINE toIntMap #-}
234−classifyWithInt ::
242+toIntMap ::
235 (Monad m, Num a) => (a -> Int) -> Stream m a -> m (IntMap a)
243 (Monad m, Num a) => (a -> Int) -> Stream m a -> m (IntMap a)
236−classifyWithInt f = Stream.fold (FL.classifyWith f FL.sum)
244+toIntMap f = Stream.fold (FL.toContainer f FL.sum)
237
245
238−{-# INLINE classifyMutWith #-}
246+{-# INLINE toMapIO #-}
239−classifyMutWith ::
247+toMapIO ::
240 (MonadIO m, Ord k, Num a) => (a -> k) -> Stream m a -> m (Map k a)
248 (MonadIO m, Ord k, Num a) => (a -> k) -> Stream m a -> m (Map k a)
241−classifyMutWith f = Stream.fold (FL.classifyMutWith f FL.sum)
249+toMapIO f = Stream.fold (FL.toContainerIO f FL.sum)
242
250
243−{-# INLINE classifyMutWithInt #-}
251+{-# INLINE toIntMapIO #-}
244−classifyMutWithInt ::
252+toIntMapIO ::
245 (MonadIO m, Num a) => (a -> Int) -> Stream m a -> m (IntMap a)
253 (MonadIO m, Num a) => (a -> Int) -> Stream m a -> m (IntMap a)
246−classifyMutWithInt f = Stream.fold (FL.classifyMutWith f FL.sum)
254+toIntMapIO f = Stream.fold (FL.toContainerIO f FL.sum)
247
255
248−{-# INLINE classifyMutWithHash #-}
256+{-# INLINE toHashMapIO #-}
249−classifyMutWithHash :: (MonadIO m, Ord k, Num a, Hashable k) =>
257+toHashMapIO :: (MonadIO m, Ord k, Num a, Hashable k) =>
250 (a -> k) -> Stream m a -> m (HashMap k a)
258 (a -> k) -> Stream m a -> m (HashMap k a)
251−classifyMutWithHash f = Stream.fold (FL.classifyMutWith f FL.sum)
259+toHashMapIO f = Stream.fold (Fold.toHashMapIO f FL.sum)
252
260
253-------------------------------------------------------------------------------
261-------------------------------------------------------------------------------
254-- unzip
262-- unzip
@@ -261,13 +269,13 @@ unzip = Stream.fold $ FL.lmap (\a -> (a, a)) (FL.unzip FL.sum FL.length)
261{-# INLINE unzipWithFstM #-}
269{-# INLINE unzipWithFstM #-}
262unzipWithFstM :: Monad m => Stream m Int -> m (Int, Int)
270unzipWithFstM :: Monad m => Stream m Int -> m (Int, Int)
263unzipWithFstM = do
271unzipWithFstM = do
264− let f = \a -> return (a + 1, a)
272+ let f a = return (a + 1, a)
265 Stream.fold (FL.unzipWithFstM f FL.sum FL.length)
273 Stream.fold (FL.unzipWithFstM f FL.sum FL.length)
266
274
267{-# INLINE unzipWithMinM #-}
275{-# INLINE unzipWithMinM #-}
268unzipWithMinM :: Monad m => Stream m Int -> m (Int, Int)
276unzipWithMinM :: Monad m => Stream m Int -> m (Int, Int)
269unzipWithMinM = do
277unzipWithMinM = do
270− let f = \a -> return (a + 1, a)
278+ let f a = return (a + 1, a)
271 Stream.fold (FL.unzipWithMinM f FL.sum FL.length)
279 Stream.fold (FL.unzipWithMinM f FL.sum FL.length)
272
280
273-------------------------------------------------------------------------------
281-------------------------------------------------------------------------------
@@ -288,6 +296,14 @@ unfoldMany val =
288moduleName :: String
296moduleName :: String
289moduleName = "Data.Fold"
297moduleName = "Data.Fold"
290
298
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+
291o_1_space_serial_elimination :: Int -> [Benchmark]
307o_1_space_serial_elimination :: Int -> [Benchmark]
292o_1_space_serial_elimination value =
308o_1_space_serial_elimination value =
293 [ bgroup "elimination"
309 [ bgroup "elimination"
@@ -295,7 +311,6 @@ o_1_space_serial_elimination value =
295 , benchIOSink value "drainBy" (Stream.fold (FL.drainBy return))
311 , benchIOSink value "drainBy" (Stream.fold (FL.drainBy return))
296 , benchIOSink value "drainN" (Stream.fold (FL.drainN value))
312 , benchIOSink value "drainN" (Stream.fold (FL.drainN value))
297 , benchIOSink value "last" (Stream.fold FL.last)
313 , benchIOSink value "last" (Stream.fold FL.last)
298− , benchIOSink value "nub" (Stream.fold FL.nub)
299 , benchIOSink value "length" (Stream.fold FL.length)
314 , benchIOSink value "length" (Stream.fold FL.length)
300 , benchIOSink value "top" (Stream.fold $ FL.top 10)
315 , benchIOSink value "top" (Stream.fold $ FL.top 10)
301 , benchIOSink value "bottom" (Stream.fold $ FL.bottom 10)
316 , benchIOSink value "bottom" (Stream.fold $ FL.bottom 10)
@@ -438,41 +453,42 @@ o_n_heap_serial value =
438 , benchIOSink value "toStreamRev"
453 , benchIOSink value "toStreamRev"
439 (Stream.fold FL.toStreamRev
454 (Stream.fold FL.toStreamRev
440 :: Stream IO a -> IO (Stream Identity a))
455 :: Stream IO a -> IO (Stream Identity a))
456+ , benchIOSink value "nub" (Stream.fold FL.nub)
441 ]
457 ]
442 , bgroup "key-value"
458 , bgroup "key-value"
443 [
459 [
444− benchIOSink value "demuxWith (64 buckets) [sum, length]"
460+ benchIOSink value "demuxToMap (64 buckets) [sum, length]"
445− $ demuxWith (getKey 64) (getFold . getKey 64)
461+ $ demuxToMap (getKey 64) (getFold . getKey 64)
446− , benchIOSink value "demuxWithInt (64 buckets) [sum, length]"
462+ , benchIOSink value "demuxToIntMap (64 buckets) [sum, length]"
447− $ demuxWithInt (getKey 64) (getFold . getKey 64)
463+ $ demuxToIntMap (getKey 64) (getFold . getKey 64)
448− , benchIOSink value "demuxWithHash (64 buckets) [sum, length]"
464+ , benchIOSink value "demuxToHashMap (64 buckets) [sum, length]"
449− $ demuxWithHash (getKey 64) (getFold . getKey 64)
465+ $ demuxToHashMap (getKey 64) (getFold . getKey 64)
450− , benchIOSink value "demuxMutWith (64 buckets) [sum, length]"
466+ , benchIOSink value "demuxToMapIO (64 buckets) [sum, length]"
451− $ demuxMutWith (getKey 64) (getFold . getKey 64)
467+ $ demuxToMapIO (getKey 64) (getFold . getKey 64)
452− , benchIOSink value "demuxMutWithHash (64 buckets) [sum, length]"
468+ , benchIOSink value "demuxToHashMapIO (64 buckets) [sum, length]"
453− $ demuxMutWithHash (getKey 64) (getFold . getKey 64)
469+ $ demuxToHashMapIO (getKey 64) (getFold . getKey 64)
454
470
455 -- classify: immutable
471 -- classify: immutable
456− , benchIOSink value "classifyWith (64 buckets) sum"
472+ , benchIOSink value "toMap (64 buckets) sum"
457− $ classifyWith (getKey 64)
473+ $ toMap (getKey 64)
458− , benchIOSink value "classifyWithInt (64 buckets) sum"
474+ , benchIOSink value "toIntMap (64 buckets) sum"
459− $ classifyWithInt (getKey 64)
475+ $ toIntMap (getKey 64)
460
476
461 -- classify: mutable cells
477 -- classify: mutable cells
462− , benchIOSink value "classifyMutWith (single bucket) sum"
478+ , benchIOSink value "toMapIO (single bucket) sum"
463− $ classifyMutWith (getKey 1)
479+ $ toMapIO (getKey 1)
464− , benchIOSink value "classifyMutWith (64 buckets) sum"
480+ , benchIOSink value "toMapIO (64 buckets) sum"
465− $ classifyMutWith (getKey 64)
481+ $ toMapIO (getKey 64)
466− , benchIOSink value "classifyMutWith (max buckets) sum"
482+ , benchIOSink value "toMapIO (max buckets) sum"
467− $ classifyMutWith (getKey value)
483+ $ toMapIO (getKey value)
468− , benchIOSink value "classifyMutWithInt (64 buckets) sum"
484+ , benchIOSink value "toIntMapIO (64 buckets) sum"
469− $ classifyMutWithInt (getKey 64)
485+ $ toIntMapIO (getKey 64)
470− , benchIOSink value "classifyMutWithHash (single bucket) sum"
486+ , benchIOSink value "toHashMapIO (single bucket) sum"
471− $ classifyMutWithHash (getKey 1)
487+ $ toHashMapIO (getKey 1)
472− , benchIOSink value "classifyMutWithHash (64 buckets) sum"
488+ , benchIOSink value "toHashMapIO (64 buckets) sum"
473− $ classifyMutWithHash (getKey 64)
489+ $ toHashMapIO (getKey 64)
474− , benchIOSink value "classifyMutWithHash (max buckets) sum"
490+ , benchIOSink value "toHashMapIO (max buckets) sum"
475− $ classifyMutWithHash (getKey value)
491+ $ toHashMapIO (getKey value)
476 ]
492 ]
477 ]
493 ]
478
494
@@ -491,7 +507,9 @@ o_n_heap_serial value =
491-------------------------------------------------------------------------------
507-------------------------------------------------------------------------------
492
508
493main :: IO ()
509main :: IO ()
510+main = do
511+#ifndef FUSION_CHECK
494−main = runWithCLIOpts defaultStreamSize allBenchmarks
512+ runWithCLIOpts defaultStreamSize allBenchmarks
495
513
496 where
514 where
497
515
@@ -504,3 +522,20 @@ main = runWithCLIOpts defaultStreamSize allBenchmarks
504 , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
522 , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
505 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
523 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
506 ]
524 ]
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+74−58
@@ -8,21 +8,22 @@ import Streamly.Internal.Data.Stream (Stream)
8import System.Random (randomRIO)
8import System.Random (randomRIO)
9
9
10import qualified Streamly.Data.Fold as Fold
10import qualified Streamly.Data.Fold as Fold
11−import qualified Streamly.Internal.Data.Ring.Unboxed as Ring
11+import qualified Streamly.Internal.Data.Fold as Window
12−import qualified Streamly.Prelude as Stream
12+import qualified Streamly.Internal.Data.Ring as Ring
13−import qualified Streamly.Internal.Data.Fold.Window as Window
13+import qualified Streamly.Internal.Data.Stream as Stream
14
14
15−import Gauge
15+import Streamly.Benchmark.Common
16+import Test.Tasty.Bench
16
17
17{-# INLINE source #-}
18{-# INLINE source #-}
18−source :: (Monad m, Stream.IsStream t, Num a, Stream.Enumerable a) =>
19+source :: (Monad m, Num a, Stream.Enumerable a) =>
19− Int -> a -> t m a
20+ Int -> a -> Stream m a
20source len from =
21source len from =
21 Stream.enumerateFromThenTo from (from + 1) (from + fromIntegral len)
22 Stream.enumerateFromThenTo from (from + 1) (from + fromIntegral len)
22
23
23{-# INLINE sourceDescending #-}
24{-# INLINE sourceDescending #-}
24−sourceDescending :: (Monad m, Stream.IsStream t, Num a, Stream.Enumerable a) =>
25+sourceDescending :: (Monad m, Num a, Stream.Enumerable a) =>
25− Int -> a -> t m a
26+ Int -> a -> Stream m a
26sourceDescending len from =
27sourceDescending len from =
27 Stream.enumerateFromThenTo
28 Stream.enumerateFromThenTo
28 (from + fromIntegral len)
29 (from + fromIntegral len)
@@ -30,7 +31,7 @@ sourceDescending len from =
30 from
31 from
31
32
32{-# INLINE sourceDescendingInt #-}
33{-# INLINE sourceDescendingInt #-}
33−sourceDescendingInt :: (Monad m, Stream.IsStream t) => Int -> Int -> t m Int
34+sourceDescendingInt :: Monad m => Int -> Int -> Stream m Int
34sourceDescendingInt = sourceDescending
35sourceDescendingInt = sourceDescending
35
36
36{-# INLINE benchWith #-}
37{-# INLINE benchWith #-}
@@ -56,120 +57,135 @@ benchScanWith src len name f =
56 bench name
57 bench name
57 $ nfIO
58 $ nfIO
58 $ randomRIO (1, 1 :: Int)
59 $ randomRIO (1, 1 :: Int)
60+ >>= Stream.fold Fold.drain
59− >>= Stream.drain . Stream.postscan f . src len . fromIntegral
61+ . Stream.postscan f
62+ . src len
63+ . fromIntegral
60
64
61{-# INLINE benchWithPostscan #-}
65{-# INLINE benchWithPostscan #-}
62benchWithPostscan :: Int -> String -> Fold IO Double a -> Benchmark
66benchWithPostscan :: Int -> String -> Fold IO Double a -> Benchmark
63benchWithPostscan = benchScanWith source
67benchWithPostscan = benchScanWith source
64
68
65−{-# INLINE numElements #-}
69+o_1_space_folds :: Int -> [Benchmark]
66−numElements :: Int
70+o_1_space_folds numElements =
67−numElements = 100000
68−
69−main :: IO ()
70−main =
71− defaultMain
72− [ bgroup
71+ [ bgroup "fold"
73− "fold"
74 [ benchWithFold numElements "minimum (window size 100)"
72 [ benchWithFold numElements "minimum (window size 100)"
75− (Window.minimum 100)
73+ (Window.windowMinimum 100)
76 , benchWithFold numElements "minimum (window size 1000)"
74 , benchWithFold numElements "minimum (window size 1000)"
77− (Window.minimum 1000)
75+ (Window.windowMinimum 1000)
78 , benchWith sourceDescendingInt numElements
76 , benchWith sourceDescendingInt numElements
79 "minimum descending (window size 1000)"
77 "minimum descending (window size 1000)"
80− (Window.minimum 1000)
78+ (Window.windowMinimum 1000)
81
79
82 , benchWithFold numElements "maximum (window size 100)"
80 , benchWithFold numElements "maximum (window size 100)"
83− (Window.maximum 100)
81+ (Window.windowMaximum 100)
84 , benchWithFold numElements "maximum (window size 1000)"
82 , benchWithFold numElements "maximum (window size 1000)"
85− (Window.maximum 1000)
83+ (Window.windowMaximum 1000)
86 , benchWith sourceDescendingInt numElements
84 , benchWith sourceDescendingInt numElements
87 "maximum descending (window size 1000)"
85 "maximum descending (window size 1000)"
88− (Window.maximum 1000)
86+ (Window.windowMaximum 1000)
89
87
90 , benchWithFold numElements "range (window size 100)"
88 , benchWithFold numElements "range (window size 100)"
91− (Window.range 100)
89+ (Window.windowRange 100)
92 , benchWithFold numElements "range (window size 1000)"
90 , benchWithFold numElements "range (window size 1000)"
93− (Window.range 1000)
91+ (Window.windowRange 1000)
94 , benchWith sourceDescendingInt numElements
92 , benchWith sourceDescendingInt numElements
95 "range descending (window size 1000)"
93 "range descending (window size 1000)"
96− (Window.range 1000)
94+ (Window.windowRange 1000)
97
95
98 , benchWithFoldInt numElements "sumInt (window size 100)"
96 , benchWithFoldInt numElements "sumInt (window size 100)"
99− (Ring.slidingWindow 100 Window.sumInt)
97+ (Ring.slidingWindow 100 Window.windowSumInt)
100 , benchWithFoldInt numElements "sum for Int (window size 100)"
98 , benchWithFoldInt numElements "sum for Int (window size 100)"
101− (Ring.slidingWindow 100 Window.sum)
99+ (Ring.slidingWindow 100 Window.windowSum)
102 , benchWithFold numElements "sum (window size 100)"
100 , benchWithFold numElements "sum (window size 100)"
103− (Ring.slidingWindow 100 Window.sum)
101+ (Ring.slidingWindow 100 Window.windowSum)
104 , benchWithFold numElements "sum (window size 1000)"
102 , benchWithFold numElements "sum (window size 1000)"
105− (Ring.slidingWindow 1000 Window.sum)
103+ (Ring.slidingWindow 1000 Window.windowSum)
106 , benchWithFold numElements "sum (entire stream)"
104 , benchWithFold numElements "sum (entire stream)"
107− (Window.cumulative Window.sum)
105+ (Window.cumulative Window.windowSum)
108 , benchWithFold numElements "sum (Data.Fold)"
106 , benchWithFold numElements "sum (Data.Fold)"
109 Fold.sum
107 Fold.sum
110
108
111 , benchWithFold numElements "mean (window size 100)"
109 , benchWithFold numElements "mean (window size 100)"
112− (Ring.slidingWindow 100 Window.mean)
110+ (Ring.slidingWindow 100 Window.windowMean)
113 , benchWithFold numElements "mean (window size 1000)"
111 , benchWithFold numElements "mean (window size 1000)"
114− (Ring.slidingWindow 1000 Window.mean)
112+ (Ring.slidingWindow 1000 Window.windowMean)
115 , benchWithFold numElements "mean (entire stream)"
113 , benchWithFold numElements "mean (entire stream)"
116− (Window.cumulative Window.mean)
114+ (Window.cumulative Window.windowMean)
117 , benchWithFold numElements "mean (Data.Fold)"
115 , benchWithFold numElements "mean (Data.Fold)"
118 Fold.mean
116 Fold.mean
119
117
120 , benchWithFold numElements "powerSum 2 (window size 100)"
118 , benchWithFold numElements "powerSum 2 (window size 100)"
121− (Ring.slidingWindow 100 (Window.powerSum 2))
119+ (Ring.slidingWindow 100 (Window.windowPowerSum 2))
122 , benchWithFold numElements "powerSum 2 (entire stream)"
120 , benchWithFold numElements "powerSum 2 (entire stream)"
123− (Window.cumulative (Window.powerSum 2))
121+ (Window.cumulative (Window.windowPowerSum 2))
124
122
125 ]
123 ]
124+ ]
125+
126+o_1_space_scans :: Int -> [Benchmark]
127+o_1_space_scans numElements =
126− , bgroup
128+ [ bgroup "scan"
127− "scan"
128 [ benchWithPostscan numElements "minimum (window size 10)"
129 [ benchWithPostscan numElements "minimum (window size 10)"
129− (Window.minimum 10)
130+ (Window.windowMinimum 10)
130 -- Below window size 30 the linear search based impl performs better
131 -- Below window size 30 the linear search based impl performs better
131 -- than the dequeue based implementation.
132 -- than the dequeue based implementation.
132 , benchWithPostscan numElements "minimum (window size 30)"
133 , benchWithPostscan numElements "minimum (window size 30)"
133− (Window.minimum 30)
134+ (Window.windowMinimum 30)
134 , benchWithPostscan numElements "minimum (window size 1000)"
135 , benchWithPostscan numElements "minimum (window size 1000)"
135− (Window.minimum 1000)
136+ (Window.windowMinimum 1000)
136 , benchScanWith sourceDescendingInt numElements
137 , benchScanWith sourceDescendingInt numElements
137 "minimum descending (window size 1000)"
138 "minimum descending (window size 1000)"
138− (Window.minimum 1000)
139+ (Window.windowMinimum 1000)
139
140
140 , benchWithPostscan numElements "maximum (window size 10)"
141 , benchWithPostscan numElements "maximum (window size 10)"
141− (Window.maximum 10)
142+ (Window.windowMaximum 10)
142 , benchWithPostscan numElements "maximum (window size 30)"
143 , benchWithPostscan numElements "maximum (window size 30)"
143− (Window.maximum 30)
144+ (Window.windowMaximum 30)
144 , benchWithPostscan numElements "maximum (window size 1000)"
145 , benchWithPostscan numElements "maximum (window size 1000)"
145− (Window.maximum 1000)
146+ (Window.windowMaximum 1000)
146 , benchScanWith sourceDescendingInt numElements
147 , benchScanWith sourceDescendingInt numElements
147 "maximum descending (window size 1000)"
148 "maximum descending (window size 1000)"
148− (Window.maximum 1000)
149+ (Window.windowMaximum 1000)
149
150
150 , benchWithPostscan numElements "range (window size 10)"
151 , benchWithPostscan numElements "range (window size 10)"
151− (Window.range 10)
152+ (Window.windowRange 10)
152 , benchWithPostscan numElements "range (window size 30)"
153 , benchWithPostscan numElements "range (window size 30)"
153− (Window.range 30)
154+ (Window.windowRange 30)
154 , benchWithPostscan numElements "range (window size 1000)"
155 , benchWithPostscan numElements "range (window size 1000)"
155− (Window.range 1000)
156+ (Window.windowRange 1000)
156 , benchScanWith sourceDescendingInt numElements
157 , benchScanWith sourceDescendingInt numElements
157 "range descending (window size 1000)"
158 "range descending (window size 1000)"
158− (Window.range 1000)
159+ (Window.windowRange 1000)
159
160
160 , benchWithPostscan numElements "sum (window size 100)"
161 , benchWithPostscan numElements "sum (window size 100)"
161− (Ring.slidingWindow 100 Window.sum)
162+ (Ring.slidingWindow 100 Window.windowSum)
162 , benchWithPostscan numElements "sum (window size 1000)"
163 , benchWithPostscan numElements "sum (window size 1000)"
163− (Ring.slidingWindow 1000 Window.sum)
164+ (Ring.slidingWindow 1000 Window.windowSum)
164
165
165 , benchWithPostscan numElements "mean (window size 100)"
166 , benchWithPostscan numElements "mean (window size 100)"
166− (Ring.slidingWindow 100 Window.mean)
167+ (Ring.slidingWindow 100 Window.windowMean)
167 , benchWithPostscan numElements "mean (window size 1000)"
168 , benchWithPostscan numElements "mean (window size 1000)"
168− (Ring.slidingWindow 1000 Window.mean)
169+ (Ring.slidingWindow 1000 Window.windowMean)
169
170
170 , benchWithPostscan numElements "powerSum 2 (window size 100)"
171 , benchWithPostscan numElements "powerSum 2 (window size 100)"
171− (Ring.slidingWindow 100 (Window.powerSum 2))
172+ (Ring.slidingWindow 100 (Window.windowPowerSum 2))
172 , benchWithPostscan numElements "powerSum 2 (window size 1000)"
173 , benchWithPostscan numElements "powerSum 2 (window size 1000)"
173− (Ring.slidingWindow 1000 (Window.powerSum 2))
174+ (Ring.slidingWindow 1000 (Window.windowPowerSum 2))
174 ]
175 ]
175 ]
176 ]
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/Array/Mut.hs → benchmark/Streamly/Benchmark/Data/MutArray.hsrenamed+15−11
@@ -1,4 +1,5 @@
1{-# OPTIONS_GHC -Wno-deprecations #-}
1{-# OPTIONS_GHC -Wno-deprecations #-}
2+{-# OPTIONS_GHC -Wno-orphans #-}
2
3
3-- |
4-- |
4-- Module : Streamly.Benchmark.Data.Array.Unboxed.Mut
5-- Module : Streamly.Benchmark.Data.Array.Unboxed.Mut
@@ -41,17 +42,21 @@ import Prelude
41 , id
42 , id
42 , undefined
43 , undefined
43 )
44 )
45+import Streamly.Internal.Data.MutArray (MutArray)
44
46
45import qualified Streamly.Internal.Data.Array as Array
47import qualified Streamly.Internal.Data.Array as Array
46−import qualified Streamly.Internal.Data.Array.Mut as MArray
48+import qualified Streamly.Internal.Data.MutArray as MArray
47import qualified Streamly.Internal.Data.Fold as Fold
49import qualified Streamly.Internal.Data.Fold as Fold
48import qualified Streamly.Internal.Data.Stream as Stream
50import qualified Streamly.Internal.Data.Stream as Stream
49−import qualified Streamly.Prelude as IsStream (scanl1')
50
51
51−import Gauge
52+import Test.Tasty.Bench
52import Streamly.Benchmark.Common hiding (benchPureSrc)
53import Streamly.Benchmark.Common hiding (benchPureSrc)
53
54
54−type Stream = MArray.Array
55+type Stream = MutArray
56+
57+instance NFData (MutArray a) where
58+ {-# INLINE rnf #-}
59+ rnf _ = ()
55
60
56-------------------------------------------------------------------------------
61-------------------------------------------------------------------------------
57-- Benchmark helpers
62-- Benchmark helpers
@@ -148,7 +153,7 @@ scanl' value n = composeN n $ onArray value $ Stream.scan (Fold.foldl' (+) 0)
148
153
149{-# INLINE scanl1' #-}
154{-# INLINE scanl1' #-}
150scanl1' :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
155scanl1' :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
151−scanl1' value n = composeN n $ onArray value $ IsStream.scanl1' (+)
156+scanl1' value n = composeN n $ onArray value $ Stream.scanl1' (+)
152
157
153{-# INLINE map #-}
158{-# INLINE map #-}
154map :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
159map :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
@@ -176,12 +181,11 @@ unfoldReadRevDrain = drain . Stream.unfold MArray.readerRev
176
181
177{-# INLINE toStreamDRevDrain #-}
182{-# INLINE toStreamDRevDrain #-}
178toStreamDRevDrain :: MonadIO m => Stream Int -> m ()
183toStreamDRevDrain :: MonadIO m => Stream Int -> m ()
179−toStreamDRevDrain =
184+toStreamDRevDrain = drain . MArray.readRev
180− drain . Stream.fromStreamD . MArray.toStreamDRev
181
185
182{-# INLINE toStreamDDrain #-}
186{-# INLINE toStreamDDrain #-}
183toStreamDDrain :: MonadIO m => Stream Int -> m ()
187toStreamDDrain :: MonadIO m => Stream Int -> m ()
184−toStreamDDrain = drain . Stream.fromStreamD . MArray.toStreamD
188+toStreamDDrain = drain . MArray.read
185
189
186{-# INLINE unfoldFold #-}
190{-# INLINE unfoldFold #-}
187unfoldFold :: MonadIO m => Stream Int -> m Int
191unfoldFold :: MonadIO m => Stream Int -> m Int
@@ -246,7 +250,7 @@ o_1_space_transformationX4 value =
246 ]
250 ]
247
251
248o_1_space_serial_marray ::
252o_1_space_serial_marray ::
249− Int -> (MArray.Array Int, Array.Array Int) -> [Benchmark]
253+ Int -> (MutArray Int, Array.Array Int) -> [Benchmark]
250o_1_space_serial_marray value ~(array, indices) =
254o_1_space_serial_marray value ~(array, indices) =
251 [ benchIO' "partitionBy (< 0)" (const (return array))
255 [ benchIO' "partitionBy (< 0)" (const (return array))
252 $ MArray.partitionBy (< 0)
256 $ MArray.partitionBy (< 0)
@@ -261,7 +265,7 @@ o_1_space_serial_marray value ~(array, indices) =
261 , benchIO' "strip (> 0)" (const (return array))
265 , benchIO' "strip (> 0)" (const (return array))
262 $ MArray.strip (> 0)
266 $ MArray.strip (> 0)
263 , benchIO' "modifyIndices (+ 1)" (const (return indices))
267 , benchIO' "modifyIndices (+ 1)" (const (return indices))
264− $ Stream.fold (MArray.modifyIndices (\_idx val -> val + 1) array)
268+ $ Stream.fold (MArray.modifyIndices array (\_idx val -> val + 1))
265 . Stream.unfold Array.reader
269 . Stream.unfold Array.reader
266 ]
270 ]
267
271
@@ -270,7 +274,7 @@ o_1_space_serial_marray value ~(array, indices) =
270-------------------------------------------------------------------------------
274-------------------------------------------------------------------------------
271
275
272moduleName :: String
276moduleName :: String
273−moduleName = "Data.Array.Mut"
277+moduleName = "Data.MutArray"
274
278
275main :: IO ()
279main :: IO ()
276main = do
280main = do
benchmark/Streamly/Benchmark/Data/Parser.hs+486−151
@@ -1,5 +1,10 @@
1{-# OPTIONS_GHC -Wno-deprecations #-}
1{-# OPTIONS_GHC -Wno-deprecations #-}
2
2
3+#undef FUSION_CHECK
4+#ifdef FUSION_CHECK
5+{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
6+#endif
7+
3-- |
8-- |
4-- Module : Streamly.Benchmark.Data.Parser
9-- Module : Streamly.Benchmark.Data.Parser
5-- Copyright : (c) 2020 Composewell Technologies
10-- Copyright : (c) 2020 Composewell Technologies
@@ -10,39 +15,41 @@
10{-# LANGUAGE CPP #-}
15{-# LANGUAGE CPP #-}
11{-# LANGUAGE FlexibleContexts #-}
16{-# LANGUAGE FlexibleContexts #-}
12{-# LANGUAGE ScopedTypeVariables #-}
17{-# LANGUAGE ScopedTypeVariables #-}
18+{-# OPTIONS_GHC -Wno-orphans #-}
13
19
14module Main
20module Main
15 (
21 (
16 main
22 main
17 ) where
23 ) where
18
24
25+import Control.Applicative ((<|>))
19import Control.DeepSeq (NFData(..))
26import Control.DeepSeq (NFData(..))
20−import Control.Monad.Catch (MonadCatch, MonadThrow, try, SomeException)
27+import Data.Function ((&))
21−import Data.Foldable (asum)
22import Data.Functor (($>))
28import Data.Functor (($>))
23−import Data.Maybe (fromMaybe)
24import Data.Monoid (Sum(..))
29import Data.Monoid (Sum(..))
25import GHC.Magic (inline)
30import GHC.Magic (inline)
26import GHC.Magic (noinline)
31import GHC.Magic (noinline)
27import System.IO (Handle)
32import System.IO (Handle)
28import System.Random (randomRIO)
33import 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)
29import Prelude hiding
38import Prelude hiding
30− (any, all, take, sequence, sequence_, sequenceA, takeWhile, dropWhile)
39+ (any, all, take, sequence, sequence_, sequenceA, takeWhile, dropWhile, span)
31
40
32−import qualified Data.Traversable as TR
33−import qualified Data.Foldable as F
34import qualified Control.Applicative as AP
41import qualified Control.Applicative as AP
42+import qualified Data.Foldable as F
43+import qualified Data.Traversable as TR
35import qualified Streamly.FileSystem.Handle as Handle
44import qualified Streamly.FileSystem.Handle as Handle
36import qualified Streamly.Internal.Data.Array as Array
45import qualified Streamly.Internal.Data.Array as Array
37import qualified Streamly.Internal.Data.Fold as Fold
46import qualified Streamly.Internal.Data.Fold as Fold
38import qualified Streamly.Internal.Data.Parser as PR
47import qualified Streamly.Internal.Data.Parser as PR
39−import qualified Streamly.Internal.Data.Stream as Stream
48+import qualified Streamly.Data.Stream as Stream
40−import qualified Streamly.Internal.Data.Stream.IsStream as IsStream (tail)
41import qualified Streamly.Internal.Data.Producer as Producer
49import qualified Streamly.Internal.Data.Producer as Producer
42−import qualified Streamly.Internal.Data.Producer.Source as Source
50+import qualified Streamly.Internal.Data.Stream as Stream
43
51
44−import Gauge hiding (env)
52+import Test.Tasty.Bench hiding (env)
45−import Streamly.Internal.Data.Stream (Stream)
46import Streamly.Benchmark.Common
53import Streamly.Benchmark.Common
47import Streamly.Benchmark.Common.Handle
54import Streamly.Benchmark.Common.Handle
48
55
@@ -113,38 +120,29 @@ benchIOSink value name f =
113-- Parsers
120-- Parsers
114-------------------------------------------------------------------------------
121-------------------------------------------------------------------------------
115
122
116−{-# INLINE one #-}
117−one :: MonadThrow m => Int -> Stream m Int -> m (Maybe Int)
118−one value = Stream.parse p
119−
120− where
121−
122− p = do
123− m <- PR.fromFold Fold.one
124− case m of
125− Just i -> if i >= value then pure m else p
126− Nothing -> pure Nothing
127−
128{-# INLINE takeBetween #-}
123{-# INLINE takeBetween #-}
129−takeBetween :: MonadThrow m => Int -> Stream m a -> m ()
124+takeBetween :: Monad m => Int -> Stream m a -> m (Either ParseError ())
130−takeBetween value = Stream.parse (PR.takeBetween 0 value Fold.drain)
125+takeBetween value = Stream.parse (PR.takeBetween 0 value Fold.drain)
131
126
132{-# INLINE takeEQ #-}
127{-# INLINE takeEQ #-}
133−takeEQ :: MonadThrow m => Int -> Stream m a -> m ()
128+takeEQ :: Monad m => Int -> Stream m a -> m (Either ParseError ())
134takeEQ value = Stream.parse (PR.takeEQ value Fold.drain)
129takeEQ value = Stream.parse (PR.takeEQ value Fold.drain)
135
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+
136{-# INLINE dropWhile #-}
135{-# INLINE dropWhile #-}
137−dropWhile :: MonadThrow m => Int -> Stream m Int -> m ()
136+dropWhile :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
138dropWhile value = Stream.parse (PR.dropWhile (<= value))
137dropWhile value = Stream.parse (PR.dropWhile (<= value))
139
138
140{-# INLINE takeStartBy #-}
139{-# INLINE takeStartBy #-}
141−takeStartBy :: MonadThrow m => Int -> Stream m Int -> m ()
140+takeStartBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
142takeStartBy value stream = do
141takeStartBy value stream = do
143− stream1 <- return . fromMaybe (Stream.fromPure (value + 1)) =<< IsStream.tail stream
144− let stream2 = value `Stream.cons` stream1
142+ let stream2 = value `Stream.cons` stream
145 Stream.parse (PR.takeStartBy (== value) Fold.drain) stream2
143 Stream.parse (PR.takeStartBy (== value) Fold.drain) stream2
146
144
147−takeFramedByEsc_ :: MonadThrow m => Int -> Stream m Char -> m ()
145+takeFramedByEsc_ :: Monad m => Int -> Stream m Char -> m (Either ParseError ())
148takeFramedByEsc_ _ = Stream.parse parser
146takeFramedByEsc_ _ = Stream.parse parser
149
147
150 where
148 where
@@ -156,45 +154,63 @@ takeFramedByEsc_ _ = Stream.parse parser
156 parser = PR.takeFramedByEsc_ isEsc isBegin isEnd Fold.drain
154 parser = PR.takeFramedByEsc_ isEsc isBegin isEnd Fold.drain
157
155
158{-# INLINE listEqBy #-}
156{-# INLINE listEqBy #-}
159−listEqBy :: Int -> Stream IO Int -> IO [Int]
157+listEqBy :: Int -> Stream IO Int -> IO (Either ParseError [Int])
160listEqBy len = Stream.parse (PR.listEqBy (==) [1 .. len])
158listEqBy len = Stream.parse (PR.listEqBy (==) [1 .. len])
161
159
162−{-# INLINE eqBy #-}
160+{-# INLINE streamEqBy #-}
163−eqBy :: Int -> Stream IO Int -> IO ()
161+streamEqBy :: Int -> Stream IO Int -> IO (Either ParseError ())
164−eqBy len = Stream.parse (PR.eqBy (==) (Stream.enumerateFromTo 1 len))
162+streamEqBy len = Stream.parse (PR.streamEqBy (==) (Stream.enumerateFromTo 1 len))
165
163
166{-# INLINE takeWhile #-}
164{-# INLINE takeWhile #-}
167−takeWhile :: MonadThrow m => Int -> Stream m Int -> m ()
165+takeWhile :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
168takeWhile value = Stream.parse (PR.takeWhile (<= value) Fold.drain)
166takeWhile value = Stream.parse (PR.takeWhile (<= value) Fold.drain)
169
167
170−takeWhileP :: MonadThrow m => Int -> Stream m Int -> m ()
168+takeWhileP :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
171takeWhileP value =
169takeWhileP value =
172 Stream.parse (PR.takeWhileP (<= value) (PR.takeWhile (<= value - 1) Fold.drain))
170 Stream.parse (PR.takeWhileP (<= value) (PR.takeWhile (<= value - 1) Fold.drain))
173
171
174{-# INLINE takeP #-}
172{-# INLINE takeP #-}
175−takeP :: MonadThrow m => Int -> Stream m a -> m ()
173+takeP :: Monad m => Int -> Stream m a -> m (Either ParseError ())
176takeP value = Stream.parse (PR.takeP value (PR.fromFold Fold.drain))
174takeP value = Stream.parse (PR.takeP value (PR.fromFold Fold.drain))
177
175
178{-# INLINE groupBy #-}
176{-# INLINE groupBy #-}
179−groupBy :: MonadThrow m => Stream m Int -> m ()
177+groupBy :: Monad m => Stream m Int -> m (Either ParseError ())
180groupBy = Stream.parse (PR.groupBy (<=) Fold.drain)
178groupBy = Stream.parse (PR.groupBy (<=) Fold.drain)
181
179
182{-# INLINE groupByRolling #-}
180{-# INLINE groupByRolling #-}
183−groupByRolling :: MonadThrow m => Stream m Int -> m ()
181+groupByRolling :: Monad m => Stream m Int -> m (Either ParseError ())
184groupByRolling = Stream.parse (PR.groupByRolling (<=) Fold.drain)
182groupByRolling = Stream.parse (PR.groupByRolling (<=) Fold.drain)
185
183
186{-# INLINE wordBy #-}
184{-# INLINE wordBy #-}
187−wordBy :: MonadThrow m => Int -> Stream m Int -> m ()
185+wordBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
188wordBy value = Stream.parse (PR.wordBy (>= value) Fold.drain)
186wordBy value = Stream.parse (PR.wordBy (>= value) Fold.drain)
189
187
190{-# INLINE sepByWords #-}
188{-# INLINE sepByWords #-}
191−sepByWords :: MonadThrow m => Int -> Stream m Int -> m ()
189+sepByWords :: Monad m => Stream m Int -> m (Either ParseError ())
192−sepByWords _ = Stream.parse (wrds even Fold.drain)
190+sepByWords = Stream.parse (wrds even Fold.drain)
193 where
191 where
194 wrds p = PR.sepBy (PR.takeWhile (not . p) Fold.drain) (PR.dropWhile p)
192 wrds p = PR.sepBy (PR.takeWhile (not . p) Fold.drain) (PR.dropWhile p)
195
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+
196{-# INLINE deintercalate #-}
212{-# INLINE deintercalate #-}
197−deintercalate :: MonadThrow m => Int -> Stream m Int -> m ()
213+deintercalate :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
198deintercalate _ = Stream.parse (partition even)
214deintercalate _ = Stream.parse (partition even)
199
215
200 where
216 where
@@ -203,48 +219,96 @@ deintercalate _ = Stream.parse (partition even)
203 PR.deintercalate
219 PR.deintercalate
204 (PR.takeWhile (not . p) Fold.sum) (PR.takeWhile p Fold.sum) Fold.drain
220 (PR.takeWhile (not . p) Fold.sum) (PR.takeWhile p Fold.sum) Fold.drain
205
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
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+
206{-# INLINE manyWordByEven #-}
242{-# INLINE manyWordByEven #-}
207−manyWordByEven :: MonadThrow m => Stream m Int -> m ()
243+manyWordByEven :: Monad m => Stream m Int -> m (Either ParseError ())
208manyWordByEven = Stream.parse (PR.many (PR.wordBy even Fold.drain) Fold.drain)
244manyWordByEven = Stream.parse (PR.many (PR.wordBy even Fold.drain) Fold.drain)
209
245
210{-# INLINE many #-}
246{-# INLINE many #-}
211−many :: MonadThrow m => Stream m Int -> m Int
247+many :: Monad m => Stream m Int -> m (Either ParseError Int)
212many = Stream.parse (PR.many (PR.satisfy (> 0)) Fold.length)
248many = Stream.parse (PR.many (PR.satisfy (> 0)) Fold.length)
213
249
214{-# INLINE manyAlt #-}
250{-# INLINE manyAlt #-}
215−manyAlt :: MonadThrow m => Stream m Int -> m Int
251+manyAlt :: Monad m => Stream m Int -> m Int
216manyAlt xs = do
252manyAlt xs = do
217 x <- Stream.parse (AP.many (PR.satisfy (> 0))) xs
253 x <- Stream.parse (AP.many (PR.satisfy (> 0))) xs
218 return $ Prelude.length x
254 return $ Prelude.length x
219
255
220{-# INLINE some #-}
256{-# INLINE some #-}
221−some :: MonadThrow m => Stream m Int -> m Int
257+some :: Monad m => Stream m Int -> m (Either ParseError Int)
222some = Stream.parse (PR.some (PR.satisfy (> 0)) Fold.length)
258some = Stream.parse (PR.some (PR.satisfy (> 0)) Fold.length)
223
259
224{-# INLINE someAlt #-}
260{-# INLINE someAlt #-}
225−someAlt :: MonadThrow m => Stream m Int -> m Int
261+someAlt :: Monad m => Stream m Int -> m Int
226someAlt xs = do
262someAlt xs = do
227 x <- Stream.parse (AP.some (PR.satisfy (> 0))) xs
263 x <- Stream.parse (AP.some (PR.satisfy (> 0))) xs
228 return $ Prelude.length x
264 return $ Prelude.length x
229
265
230{-# INLINE manyTill #-}
266{-# INLINE manyTill #-}
231−manyTill :: MonadThrow m => Int -> Stream m Int -> m Int
267+manyTill :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
232manyTill value =
268manyTill value =
233 Stream.parse (PR.manyTill (PR.satisfy (> 0)) (PR.satisfy (== value)) Fold.length)
269 Stream.parse (PR.manyTill (PR.satisfy (> 0)) (PR.satisfy (== value)) Fold.length)
234
270
235−{-# INLINE splitAp #-}
271+{-# INLINE splitAp2 #-}
236−splitAp :: MonadThrow m
272+splitAp2 :: Monad m
237− => Int -> Stream m Int -> m ((), ())
273+ => Int -> Stream m Int -> m (Either ParseError ((), ()))
238−splitAp value =
274+splitAp2 value =
239 Stream.parse
275 Stream.parse
240 ((,)
276 ((,)
241 <$> PR.dropWhile (<= (value `div` 2))
277 <$> PR.dropWhile (<= (value `div` 2))
242 <*> PR.dropWhile (<= value)
278 <*> PR.dropWhile (<= value)
243 )
279 )
244
280
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+
245{-# INLINE splitApBefore #-}
309{-# INLINE splitApBefore #-}
246−splitApBefore :: MonadThrow m
310+splitApBefore :: Monad m
247− => Int -> Stream m Int -> m ()
311+ => Int -> Stream m Int -> m (Either ParseError ())
248splitApBefore value =
312splitApBefore value =
249 Stream.parse
313 Stream.parse
250 ( PR.dropWhile (<= (value `div` 2))
314 ( PR.dropWhile (<= (value `div` 2))
@@ -252,18 +316,18 @@ splitApBefore value =
252 )
316 )
253
317
254{-# INLINE splitApAfter #-}
318{-# INLINE splitApAfter #-}
255−splitApAfter :: MonadThrow m
319+splitApAfter :: Monad m
256− => Int -> Stream m Int -> m ()
320+ => Int -> Stream m Int -> m (Either ParseError ())
257splitApAfter value =
321splitApAfter value =
258 Stream.parse
322 Stream.parse
259 ( PR.dropWhile (<= (value `div` 2))
323 ( PR.dropWhile (<= (value `div` 2))
260 <* PR.dropWhile (<= value)
324 <* PR.dropWhile (<= value)
261 )
325 )
262
326
263−{-# INLINE splitWith #-}
327+{-# INLINE splitWith2 #-}
264−splitWith :: MonadThrow m
328+splitWith2 :: Monad m
265− => Int -> Stream m Int -> m ((), ())
329+ => Int -> Stream m Int -> m (Either ParseError ((), ()))
266−splitWith value =
330+splitWith2 value =
267 Stream.parse
331 Stream.parse
268 (PR.splitWith (,)
332 (PR.splitWith (,)
269 (PR.dropWhile (<= (value `div` 2)))
333 (PR.dropWhile (<= (value `div` 2)))
@@ -271,8 +335,8 @@ splitWith value =
271 )
335 )
272
336
273{-# INLINE split_ #-}
337{-# INLINE split_ #-}
274−split_ :: MonadThrow m
338+split_ :: Monad m
275− => Int -> Stream m Int -> m ()
339+ => Int -> Stream m Int -> m (Either ParseError ())
276split_ value =
340split_ value =
277 Stream.parse
341 Stream.parse
278 (PR.split_
342 (PR.split_
@@ -280,14 +344,165 @@ split_ value =
280 (PR.dropWhile (<= value))
344 (PR.dropWhile (<= value))
281 )
345 )
282
346
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+
283{-# INLINE takeEndBy_ #-}
498{-# INLINE takeEndBy_ #-}
284−takeEndBy_ :: MonadThrow m
499+takeEndBy_ :: Monad m
285− => Int -> Stream m Int -> m()
500+ => Int -> Stream m Int -> m (Either ParseError ())
286takeEndBy_ value = Stream.parse (PR.takeEndBy_ (>= value) (PR.fromFold Fold.drain))
501takeEndBy_ value = Stream.parse (PR.takeEndBy_ (>= value) (PR.fromFold Fold.drain))
287
502
288{-
503{-
289{-# INLINE teeAllAny #-}
504{-# INLINE teeAllAny #-}
290−teeAllAny :: MonadThrow m
505+teeAllAny :: Monad m
291 => Int -> Stream m Int -> m ((), ())
506 => Int -> Stream m Int -> m ((), ())
292teeAllAny value =
507teeAllAny value =
293 Stream.parse
508 Stream.parse
@@ -297,7 +512,7 @@ teeAllAny value =
297 )
512 )
298
513
299{-# INLINE teeFstAllAny #-}
514{-# INLINE teeFstAllAny #-}
300−teeFstAllAny :: MonadThrow m
515+teeFstAllAny :: Monad m
301 => Int -> Stream m Int -> m ((), ())
516 => Int -> Stream m Int -> m ((), ())
302teeFstAllAny value =
517teeFstAllAny value =
303 Stream.parse
518 Stream.parse
@@ -307,8 +522,8 @@ teeFstAllAny value =
307 )
522 )
308
523
309{-# INLINE shortestAllAny #-}
524{-# INLINE shortestAllAny #-}
310−shortestAllAny :: MonadThrow m
525+shortestAllAny :: Monad m
311− => Int -> Stream m Int -> m ()
526+ => Int -> Stream m Int -> m (Either ParseError ())
312shortestAllAny value =
527shortestAllAny value =
313 Stream.parse
528 Stream.parse
314 (PR.shortest
529 (PR.shortest
@@ -317,8 +532,8 @@ shortestAllAny value =
317 )
532 )
318
533
319{-# INLINE longestAllAny #-}
534{-# INLINE longestAllAny #-}
320−longestAllAny :: MonadThrow m
535+longestAllAny :: Monad m
321− => Int -> Stream m Int -> m ()
536+ => Int -> Stream m Int -> m (Either ParseError ())
322longestAllAny value =
537longestAllAny value =
323 Stream.parse
538 Stream.parse
324 (PR.longest
539 (PR.longest
@@ -327,6 +542,24 @@ longestAllAny value =
327 )
542 )
328-}
543-}
329
544
545+-------------------------------------------------------------------------------
546+-- Spanning
547+-------------------------------------------------------------------------------
548+
549+{-# INLINE span #-}
550+span :: Monad m => Int -> Stream m Int -> m (Either ParseError ((), ()))
551+span value = Stream.parse (PR.span (<= (value `div` 2)) Fold.drain Fold.drain)
552+
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+
330parseManyChunksOfSum :: Int -> Handle -> IO Int
563parseManyChunksOfSum :: Int -> Handle -> IO Int
331parseManyChunksOfSum n inh =
564parseManyChunksOfSum n inh =
332 Stream.fold Fold.length
565 Stream.fold Fold.length
@@ -334,22 +567,6 @@ parseManyChunksOfSum n inh =
334 (PR.fromFold $ Fold.take n Fold.sum)
567 (PR.fromFold $ Fold.take n Fold.sum)
335 (Stream.unfold Handle.reader inh)
568 (Stream.unfold Handle.reader inh)
336
569
337−-------------------------------------------------------------------------------
338−-- Parsing with unfolds
339−-------------------------------------------------------------------------------
340−
341−{-# INLINE parseManyUnfoldArrays #-}
342−parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
343−parseManyUnfoldArrays count arrays = do
344− let src = Source.source (Just (Producer.OuterLoop arrays))
345− let parser = PR.fromFold (Fold.take count Fold.drain)
346− let readSrc =
347− Source.producer
348− $ Producer.concat Producer.fromList Array.producer
349− let streamParser =
350− Producer.simplify (Source.parseMany parser readSrc)
351− Stream.fold Fold.drain $ Stream.unfold streamParser src
352−
353-------------------------------------------------------------------------------
570-------------------------------------------------------------------------------
354-- Parsers in which -fspec-constr-recursive=16 is problematic
571-- Parsers in which -fspec-constr-recursive=16 is problematic
355-------------------------------------------------------------------------------
572-------------------------------------------------------------------------------
@@ -359,82 +576,129 @@ parseManyUnfoldArrays count arrays = do
359-- not have to rely on it.
576-- not have to rely on it.
360--
577--
361{-# INLINE lookAhead #-}
578{-# INLINE lookAhead #-}
362−lookAhead :: MonadThrow m => Int -> Stream m Int -> m ()
579+lookAhead :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
363lookAhead value =
580lookAhead value =
364 Stream.parse (PR.lookAhead (PR.takeWhile (<= value) Fold.drain) $> ())
581 Stream.parse (PR.lookAhead (PR.takeWhile (<= value) Fold.drain) $> ())
365
582
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
366{-# INLINE sequenceA #-}
590{-# INLINE sequenceA #-}
367−sequenceA :: MonadThrow m => Int -> Stream m Int -> m Int
591+sequenceA :: Monad m => Int -> Stream m Int -> m Int
368sequenceA value xs = do
592sequenceA value xs = do
369 x <- Stream.parse (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
593 x <- Stream.parse (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
370 return $ length x
594 return $ length x
371
595
372−{-# INLINE sequenceA_ #-}
596+-- quadratic complexity
373−sequenceA_ :: MonadThrow m => Int -> Stream m Int -> m ()
374−sequenceA_ value =
375− Stream.parse (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
376−
377{-# INLINE sequence #-}
597{-# INLINE sequence #-}
378−sequence :: MonadThrow m => Int -> Stream m Int -> m Int
598+sequence :: Monad m => Int -> Stream m Int -> m Int
379sequence value xs = do
599sequence value xs = do
380 x <- Stream.parse (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
600 x <- Stream.parse (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
381 return $ length x
601 return $ length x
382
602
383{-# INLINE sequence_ #-}
603{-# INLINE sequence_ #-}
384−sequence_ :: MonadThrow m => Int -> Stream m Int -> m ()
604+sequence_ :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
385−sequence_ value =
605+sequence_ value xs =
386− Stream.parse (F.sequence_ $ replicate value (PR.satisfy (> 0)))
606+ Stream.parse (foldr f (return ()) (replicate value (PR.takeBetween 0 1 Fold.drain))) xs
607+
608+ where
387
609
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+--
388{-# INLINE choiceAsum #-}
616{-# INLINE choiceAsum #-}
389−choiceAsum :: MonadThrow m => Int -> Stream m Int -> m Int
617+choiceAsum :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
390choiceAsum value =
618choiceAsum value =
391− Stream.parse (asum (replicate value (PR.satisfy (< 0)))
619+ Stream.parse (F.asum (replicate value (PR.satisfy (< 0)))
392 AP.<|> PR.satisfy (> 0))
620 AP.<|> PR.satisfy (> 0))
393
621
394{-
622{-
395{-# INLINE choice #-}
623{-# INLINE choice #-}
396−choice :: MonadThrow m => Int -> Stream m Int -> m Int
624+choice :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
397choice value =
625choice value =
398 Stream.parse
626 Stream.parse
399 (PR.choice (replicate value (PR.satisfy (< 0))) AP.<|> PR.satisfy (> 0))
627 (PR.choice (replicate value (PR.satisfy (< 0))) AP.<|> PR.satisfy (> 0))
400-}
628-}
401
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+
402-------------------------------------------------------------------------------
646-------------------------------------------------------------------------------
403-- Stream transformation
647-- Stream transformation
404-------------------------------------------------------------------------------
648-------------------------------------------------------------------------------
405
649
406{-# INLINE parseMany #-}
650{-# INLINE parseMany #-}
407−parseMany :: MonadThrow m => Int -> Stream m Int -> m ()
651+parseMany :: Monad m => Int -> Stream m Int -> m ()
408parseMany n =
652parseMany n =
409 Stream.fold Fold.drain
653 Stream.fold Fold.drain
410 . fmap getSum
654 . fmap getSum
411− . Stream.parseMany (PR.fromFold $ Fold.take n Fold.mconcat)
655+ . Stream.catRights . Stream.parseMany (PR.fromFold $ Fold.take n Fold.mconcat)
412 . fmap Sum
656 . fmap Sum
413
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+
414{-# INLINE parseIterate #-}
687{-# INLINE parseIterate #-}
415−parseIterate :: MonadThrow m => Int -> Stream m Int -> m ()
688+parseIterate :: Monad m => Int -> Stream m Int -> m ()
416parseIterate n =
689parseIterate n =
417 Stream.fold Fold.drain
690 Stream.fold Fold.drain
418 . fmap getSum
691 . fmap getSum
692+ . Stream.catRights
693+ . Stream.parseIterate
419− . Stream.parseIterate (PR.fromFold . Fold.take n . Fold.sconcat) (Sum 0)
694+ (PR.fromFold . Fold.take n . Fold.sconcat)
695+ (Sum 0)
420 . fmap Sum
696 . fmap Sum
421
697
422−{-# INLINE parseBreak #-}
423−parseBreak :: MonadCatch m => Stream m Int -> m ()
424−parseBreak s = do
425− r <- try $ Stream.parseBreak PR.one s
426− case r of
427− Left (_ :: SomeException) -> return ()
428− Right (_, s1) -> parseBreak s1
429−
430{-# INLINE concatSequence #-}
698{-# INLINE concatSequence #-}
431−concatSequence :: MonadThrow m => Stream m Int -> m ()
699+concatSequence :: Monad m => Stream m Int -> m (Either ParseError ())
700+concatSequence =
432−concatSequence = Stream.parse $ PR.concatSequence Fold.drain $ Stream.repeat PR.one
701+ Stream.parse $ PR.sequence (Stream.repeat PR.one) Fold.drain
433−
434−{-# INLINE parseManyGroupBy #-}
435−parseManyGroupBy :: MonadThrow m => (Int -> Int -> Bool) -> Stream m Int -> m ()
436−parseManyGroupBy cmp =
437− Stream.fold Fold.drain . Stream.parseMany (PR.groupBy cmp Fold.drain)
438
702
439-------------------------------------------------------------------------------
703-------------------------------------------------------------------------------
440-- Benchmarks
704-- Benchmarks
@@ -443,50 +707,90 @@ parseManyGroupBy cmp =
443moduleName :: String
707moduleName :: String
444moduleName = "Data.Parser"
708moduleName = "Data.Parser"
445
709
710+instance NFData ParseError where
711+ {-# INLINE rnf #-}
712+ rnf (ParseError x) = rnf x
713+
446o_1_space_serial :: Int -> [Benchmark]
714o_1_space_serial :: Int -> [Benchmark]
447o_1_space_serial value =
715o_1_space_serial value =
448− [ benchIOSink value "one (fold)" $ one value
449− , benchIOSink value "takeBetween" $ takeBetween value
716+ [ benchIOSink value "takeBetween" $ takeBetween value
450− , benchIOSink value "takeEQ" $ takeEQ value
451 , benchIOSink value "takeWhile" $ takeWhile value
717 , benchIOSink value "takeWhile" $ takeWhile value
452 , benchIOSink value "takeWhileP" $ takeWhileP value
718 , benchIOSink value "takeWhileP" $ takeWhileP value
453 , benchIOSink value "takeP" $ takeP value
719 , benchIOSink value "takeP" $ takeP value
454 , benchIOSink value "dropWhile" $ dropWhile value
720 , benchIOSink value "dropWhile" $ dropWhile value
455 , benchIOSink value "takeStartBy" $ takeStartBy value
721 , benchIOSink value "takeStartBy" $ takeStartBy value
456− , benchIOSrc sourceEscapedFrames value "takeFramedByEsc_"
722+ , benchIOSink value "takeEndBy_" $ takeEndBy_ value
457− $ takeFramedByEsc_ value
458 , benchIOSink value "groupBy" $ groupBy
723 , benchIOSink value "groupBy" $ groupBy
459 , benchIOSink value "groupByRolling" $ groupByRolling
724 , benchIOSink value "groupByRolling" $ groupByRolling
460 , benchIOSink value "wordBy" $ wordBy value
725 , benchIOSink value "wordBy" $ wordBy value
461− , benchIOSink value "sepBy (words)" $ sepByWords value
726+ , benchIOSink value "sepBy (words)" sepByWords
727+ , benchIOSink value "sepByAll (words)" sepByAllWords
728+ , benchIOSink value "sepBy1 (words)" sepByWords1
462 , benchIOSink value "deintercalate" $ deintercalate value
729 , benchIOSink value "deintercalate" $ deintercalate value
463− , benchIOSink value "splitAp" $ splitAp value
730+ , benchIOSink value "deintercalate1" $ deintercalate1 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
464 , benchIOSink value "splitApBefore" $ splitApBefore value
736 , benchIOSink value "splitApBefore" $ splitApBefore value
465 , benchIOSink value "splitApAfter" $ splitApAfter value
737 , benchIOSink value "splitApAfter" $ splitApAfter value
466− , benchIOSink value "splitWith" $ splitWith value
738+ , benchIOSink value "splitWith2" $ splitWith2 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
467− , benchIOSink value "takeEndBy_" $ takeEndBy_ 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
468 , benchIOSink value "many" many
751 , benchIOSink value "many" many
469 , benchIOSink value "many (wordBy even)" $ manyWordByEven
752 , benchIOSink value "many (wordBy even)" $ manyWordByEven
470 , benchIOSink value "some" some
753 , benchIOSink value "some" some
471 , benchIOSink value "manyTill" $ manyTill value
754 , benchIOSink value "manyTill" $ manyTill value
755+ , benchIOSink value "parseMany" $ parseMany value
756+ , benchIOSink value "parseMany (take 1)" (parseMany 1)
757+ , 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)
771+ , benchIOSink value "parseIterate (take all)" (parseIterate value)
772+ , benchIOSink value "concatSequence" concatSequence
472 {-
773 {-
473 , benchIOSink value "tee" $ teeAllAny value
774 , benchIOSink value "tee" $ teeAllAny value
474 , benchIOSink value "teeFst" $ teeFstAllAny value
775 , benchIOSink value "teeFst" $ teeFstAllAny value
475 , benchIOSink value "shortest" $ shortestAllAny value
776 , benchIOSink value "shortest" $ shortestAllAny value
476 , benchIOSink value "longest" $ longestAllAny value
777 , benchIOSink value "longest" $ longestAllAny value
477 -}
778 -}
478− , benchIOSink value "parseBreak (recursive)" parseBreak
779+ , benchIOSink value "streamEqBy" (streamEqBy value)
479− , benchIOSink value "parseMany (take 1)" (parseMany 1)
480− , benchIOSink value "parseMany (take all)" (parseMany value)
481− , benchIOSink value "parseIterate (take 1)" (parseIterate 1)
482− , benchIOSink value "parseIterate (take all)" (parseIterate value)
483− , benchIOSink value "concatSequence" concatSequence
484− , benchIOSink value "parseMany (groupBy (<))" (parseManyGroupBy (<))
485− , benchIOSink value "parseMany (groupBy (==))" (parseManyGroupBy (==))
486− , benchIOSink value "listEqBy" (listEqBy value)
487− , benchIOSink value "eqBy" (eqBy value)
488 ]
780 ]
489
781
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+
490o_1_space_filesystem :: BenchEnv -> [Benchmark]
794o_1_space_filesystem :: BenchEnv -> [Benchmark]
491o_1_space_filesystem env =
795o_1_space_filesystem env =
492 [ mkBench ("S.parseMany (Fold.take " ++ show (bigSize env) ++ " Fold.sum)") env
796 [ mkBench ("S.parseMany (Fold.take " ++ show (bigSize env) ++ " Fold.sum)") env
@@ -506,26 +810,38 @@ o_1_space_serial_unfold bound arrays =
506o_n_heap_serial :: Int -> [Benchmark]
810o_n_heap_serial :: Int -> [Benchmark]
507o_n_heap_serial value =
811o_n_heap_serial value =
508 [
812 [
813+ benchIOSink value "takeEQ" $ takeEQ value
814+ , benchIOSink value "takeGE" $ takeGE value
815+
509 -- lookahead benchmark holds the entire input till end
816 -- lookahead benchmark holds the entire input till end
510− benchIOSink value "lookAhead" $ lookAhead value
817+ , benchIOSink value "lookAhead" $ lookAhead value
511
818
512− -- accumulates the results in a list
819+ -- o-n-heap because of backtracking
513− , benchIOSink value "sequence" $ sequence value
820+ , benchIOSrc sourceEscapedFrames value "takeFramedByEsc_"
514− , benchIOSink value "sequenceA" $ sequenceA value
821+ $ takeFramedByEsc_ value
515
822
516− -- XXX why should this take O(n) heap, it discards the results?
517− , benchIOSink value "sequence_" $ sequence_ value
518− , benchIOSink value "sequenceA_" $ sequenceA_ value
519 -- non-linear time complexity (parserD)
823 -- non-linear time complexity (parserD)
520 , benchIOSink value "split_" $ split_ value
824 , benchIOSink value "split_" $ split_ value
521− -- XXX why O(n) heap?
825+ -- XXX Takes lot of space when run on a long stream, why?
522− , benchIOSink value "choice (asum)" $ choiceAsum value
826+ , benchIOSink value "monad16" $ monad16 value
523− -- , benchIOSink value "choice" $ choice value
524
827
525 -- These show non-linear time complexity.
828 -- These show non-linear time complexity.
526 -- They accumulate the results in a list.
829 -- They accumulate the results in a list.
830+ , benchIOSink value "sepBy1" sepBy1
527 , benchIOSink value "manyAlt" manyAlt
831 , benchIOSink value "manyAlt" manyAlt
528 , benchIOSink value "someAlt" someAlt
832 , 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)
529 ]
845 ]
530
846
531-------------------------------------------------------------------------------
847-------------------------------------------------------------------------------
@@ -534,12 +850,13 @@ o_n_heap_serial value =
534
850
535main :: IO ()
851main :: IO ()
536main = do
852main = do
853+#ifndef FUSION_CHECK
537 env <- mkHandleBenchEnv
854 env <- mkHandleBenchEnv
538 runWithCLIOptsEnv defaultStreamSize alloc (allBenchmarks env)
855 runWithCLIOptsEnv defaultStreamSize alloc (allBenchmarks env)
539
856
540 where
857 where
541
858
542− alloc value = Stream.fold Fold.toList $ Stream.arraysOf 100 $ sourceUnfoldrM value 0
859+ alloc value = Stream.fold Fold.toList $ Stream.chunksOf 100 $ sourceUnfoldrM value 0
543
860
544 allBenchmarks env arrays value =
861 allBenchmarks env arrays value =
545 [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
862 [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
@@ -549,4 +866,22 @@ main = do
549 , bgroup (o_1_space_prefix moduleName)
866 , bgroup (o_1_space_prefix moduleName)
550 (o_1_space_serial_unfold value arrays)
867 (o_1_space_serial_unfold value arrays)
551 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
868 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
869+ , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
552 ]
870 ]
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.hsdeleted−457
@@ -1,457 +0,0 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3−-- |
4−-- Module : Streamly.Benchmark.Data.ParserD
5−-- Copyright : (c) 2020 Composewell Technologies
6−--
7−-- License : BSD-3-Clause
8−-- Maintainer : streamly@composewell.com
9−
10−{-# LANGUAGE FlexibleContexts #-}
11−{-# LANGUAGE ScopedTypeVariables #-}
12−{-# OPTIONS_GHC -fspec-constr-recursive=4 #-}
13−
14−module Main
15− (
16− main
17− ) where
18−
19−import Control.DeepSeq (NFData(..))
20−import Control.Monad.Catch (MonadThrow)
21−import Data.Foldable (asum)
22−import Data.Function ((&))
23−import Data.Functor (($>))
24−import Data.Maybe (fromMaybe)
25−import Streamly.Internal.Data.Stream (Stream)
26−import System.Random (randomRIO)
27−import Prelude hiding (any, all, take, sequence, sequenceA, sequence_, takeWhile, span)
28−
29−import qualified Data.Traversable as TR
30−import qualified Data.Foldable as F
31−import qualified Control.Applicative as AP
32−import qualified Streamly.Internal.Data.Array as Array
33−import qualified Streamly.Internal.Data.Fold as Fold
34−import qualified Streamly.Internal.Data.Parser.ParserD as PR
35−import qualified Streamly.Internal.Data.Producer as Producer
36−import qualified Streamly.Internal.Data.Producer.Source as Source
37−import qualified Streamly.Internal.Data.Stream as Stream
38−import qualified Streamly.Internal.Data.Stream.IsStream as IsStream (tail)
39−import qualified Streamly.Internal.Data.Stream.StreamD as D
40−
41−import Gauge
42−import Streamly.Benchmark.Common
43−
44−-------------------------------------------------------------------------------
45−-- Utilities
46−-------------------------------------------------------------------------------
47−
48−-- XXX these can be moved to the common module
49−
50−{-# INLINE sourceUnfoldrM #-}
51−sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
52−sourceUnfoldrM value n = Stream.unfoldrM step n
53− where
54− step cnt =
55− if cnt > n + value
56− then return Nothing
57− else return (Just (cnt, cnt + 1))
58−
59−-- | Takes a fold method, and uses it with a default source.
60−{-# INLINE benchIOSink #-}
61−benchIOSink
62− :: (NFData b)
63− => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
64−benchIOSink value name f =
65− bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
66−
67−-------------------------------------------------------------------------------
68−-- Parsers
69−-------------------------------------------------------------------------------
70−
71−{-# INLINE listEqBy #-}
72−listEqBy :: Int -> Stream IO Int -> IO [Int]
73−listEqBy len = Stream.parseD (PR.listEqBy (==) [1 .. len])
74−
75−{-# INLINE eqBy #-}
76−eqBy :: Int -> Stream IO Int -> IO ()
77−eqBy len = Stream.parseD (PR.eqBy (==) (D.enumerateFromToIntegral 1 len))
78−
79−{-# INLINE drainWhile #-}
80−drainWhile :: MonadThrow m => (a -> Bool) -> PR.Parser a m ()
81−drainWhile p = PR.takeWhile p Fold.drain
82−
83−{-# INLINE takeStartBy #-}
84−takeStartBy :: MonadThrow m => Int -> Stream m Int -> m ()
85−takeStartBy value stream = do
86− stream1 <- return . fromMaybe (Stream.fromPure (value + 1)) =<< IsStream.tail stream
87− let stream2 = value `Stream.cons` stream1
88− Stream.parseD (PR.takeStartBy (== value) Fold.drain) stream2
89−
90−{-# INLINE takeWhile #-}
91−takeWhile :: MonadThrow m => Int -> Stream m Int -> m ()
92−takeWhile value = Stream.parseD (drainWhile (<= value))
93−
94−{-# INLINE takeP #-}
95−takeP :: MonadThrow m => Int -> Stream m a -> m ()
96−takeP value = Stream.parseD (PR.takeP value (PR.fromFold Fold.drain))
97−
98−{-# INLINE takeBetween #-}
99−takeBetween :: MonadThrow m => Int -> Stream m a -> m ()
100−takeBetween value = Stream.parseD (PR.takeBetween 0 value Fold.drain)
101−
102−{-# INLINE groupBy #-}
103−groupBy :: MonadThrow m => Stream m Int -> m ()
104−groupBy = Stream.parseD (PR.groupBy (<=) Fold.drain)
105−
106−{-# INLINE groupByRolling #-}
107−groupByRolling :: MonadThrow m => Stream m Int -> m ()
108−groupByRolling = Stream.parseD (PR.groupByRolling (<=) Fold.drain)
109−
110−{-# INLINE wordBy #-}
111−wordBy :: MonadThrow m => Int -> Stream m Int -> m ()
112−wordBy value = Stream.parseD (PR.wordBy (>= value) Fold.drain)
113−
114−{-# INLINE manyWordByEven #-}
115−manyWordByEven :: MonadThrow m => Stream m Int -> m ()
116−manyWordByEven =
117− Stream.parseD (PR.many (PR.wordBy (Prelude.even) Fold.drain) Fold.drain)
118−
119−{-# INLINE many #-}
120−many :: MonadThrow m => Stream m Int -> m Int
121−many = Stream.parseD (PR.many (PR.satisfy (> 0)) Fold.length)
122−
123−{-# INLINE manyAlt #-}
124−manyAlt :: MonadThrow m => Stream m Int -> m Int
125−manyAlt xs = do
126− x <- Stream.parseD (AP.many (PR.satisfy (> 0))) xs
127− return $ Prelude.length x
128−
129−{-# INLINE some #-}
130−some :: MonadThrow m => Stream m Int -> m Int
131−some = Stream.parseD (PR.some (PR.satisfy (> 0)) Fold.length)
132−
133−{-# INLINE someAlt #-}
134−someAlt :: MonadThrow m => Stream m Int -> m Int
135−someAlt xs = do
136− x <- Stream.parseD (AP.some (PR.satisfy (> 0))) xs
137− return $ Prelude.length x
138−
139−{-#INLINE takeEndBy_ #-}
140−takeEndBy_ :: MonadThrow m => Int -> Stream m Int -> m ()
141−takeEndBy_ value = Stream.parseD (PR.takeEndBy_ (>= value) (PR.fromFold Fold.drain))
142−
143−{-# INLINE manyTill #-}
144−manyTill :: MonadThrow m => Int -> Stream m Int -> m Int
145−manyTill value =
146− let p = PR.satisfy (> 0)
147− pcond = PR.satisfy (== value)
148− in Stream.parseD (PR.manyTill p pcond Fold.length)
149−
150−{-# INLINE splitWith #-}
151−splitWith :: MonadThrow m
152− => Int -> Stream m Int -> m ((), ())
153−splitWith value =
154− Stream.parseD
155− ((,)
156− <$> drainWhile (<= (value `div` 2))
157− <*> drainWhile (<= value)
158− )
159−
160−{-
161−{-# INLINE teeAllAny #-}
162−teeAllAny :: MonadThrow m
163− => Int -> Stream m Int -> m ((), ())
164−teeAllAny value =
165− Stream.parseD
166− (PR.teeWith (,)
167− (drainWhile (<= value))
168− (drainWhile (<= value))
169− )
170−
171−{-# INLINE teeFstAllAny #-}
172−teeFstAllAny :: MonadThrow m
173− => Int -> Stream m Int -> m ((), ())
174−teeFstAllAny value =
175− Stream.parseD
176− (PR.teeWithFst (,)
177− (drainWhile (<= value))
178− (drainWhile (<= value))
179− )
180−
181−{-# INLINE shortestAllAny #-}
182−shortestAllAny :: MonadThrow m
183− => Int -> Stream m Int -> m ()
184−shortestAllAny value =
185− Stream.parseD
186− (PR.shortest
187− (drainWhile (<= value))
188− (drainWhile (<= value))
189− )
190−
191−{-# INLINE longestAllAny #-}
192−longestAllAny :: MonadThrow m
193− => Int -> Stream m Int -> m ()
194−longestAllAny value =
195− Stream.parseD
196− (PR.longest
197− (drainWhile (<= value))
198− (drainWhile (<= value))
199− )
200−-}
201−
202−{-# INLINE sequenceParser #-}
203−sequenceParser :: MonadThrow m => Stream m Int -> m ()
204−sequenceParser = Stream.parseD (PR.sequence (D.repeat (PR.satisfy $ const True)) Fold.drain)
205−
206−-------------------------------------------------------------------------------
207−-- Spanning
208−-------------------------------------------------------------------------------
209−
210−{-# INLINE span #-}
211−span :: MonadThrow m => Int -> Stream m Int -> m ((), ())
212−span value = Stream.parseD (PR.span (<= (value `div` 2)) Fold.drain Fold.drain)
213−
214−{-# INLINE spanBy #-}
215−spanBy :: MonadThrow m => Int -> Stream m Int -> m ((), ())
216−spanBy value =
217− Stream.parseD (PR.spanBy (\_ i -> i <= (value `div` 2)) Fold.drain Fold.drain)
218−
219−{-# INLINE spanByRolling #-}
220−spanByRolling :: MonadThrow m => Int -> Stream m Int -> m ((), ())
221−spanByRolling value =
222− Stream.parseD (PR.spanByRolling (\_ i -> i <= value `div` 2) Fold.drain Fold.drain)
223−
224−-------------------------------------------------------------------------------
225−-- Nested
226−-------------------------------------------------------------------------------
227−
228−{-# INLINE parseMany #-}
229−parseMany :: MonadThrow m => Int -> Stream m Int -> m ()
230−parseMany value = Stream.fold Fold.drain . Stream.parseManyD (drainWhile (<= value + 1))
231−
232−{-# INLINE parseManyGroups #-}
233−parseManyGroups :: MonadThrow m => Bool -> Stream m Int -> m ()
234−parseManyGroups b = Stream.fold Fold.drain . Stream.parseManyD (PR.groupBy (\_ _ -> b) Fold.drain)
235−
236−{-# INLINE parseManyGroupsRolling #-}
237−parseManyGroupsRolling :: MonadThrow m => Bool -> Stream m Int -> m ()
238−parseManyGroupsRolling b =
239− Stream.fold Fold.drain . Stream.parseManyD (PR.groupByRolling (\_ _ -> b) Fold.drain)
240−
241−{-# INLINE parseManyGroupsRollingEither #-}
242−parseManyGroupsRollingEither :: MonadThrow m =>
243− (Int -> Int -> Bool) -> Int -> m ()
244−parseManyGroupsRollingEither cmp value = do
245− sourceUnfoldrM value 1
246− & Stream.parseManyD (PR.groupByRollingEither cmp Fold.drain Fold.drain)
247− & Stream.fold Fold.drain
248−
249−{-# INLINE parseManyGroupsRollingEitherAlt #-}
250−parseManyGroupsRollingEitherAlt :: MonadThrow m =>
251− (Int -> Int -> Bool) -> Int -> m ()
252−parseManyGroupsRollingEitherAlt cmp value = do
253− sourceUnfoldrM value 1
254− -- Make the input unsorted.
255− & fmap (\x -> if even x then x + 2 else x)
256− & Stream.parseManyD (PR.groupByRollingEither cmp Fold.drain Fold.drain)
257− & Stream.fold Fold.drain
258−
259−-------------------------------------------------------------------------------
260−-- Parsing with unfolds
261−-------------------------------------------------------------------------------
262−
263−{-# INLINE parseManyUnfoldArrays #-}
264−parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
265−parseManyUnfoldArrays count arrays = do
266− let src = Source.source (Just (Producer.OuterLoop arrays))
267− let parser = PR.fromFold (Fold.take count Fold.drain)
268− let readSrc =
269− Source.producer
270− $ Producer.concat Producer.fromList Array.producer
271− let streamParser =
272− Producer.simplify (Source.parseManyD parser readSrc)
273− Stream.fold Fold.drain $ Stream.unfold streamParser src
274−
275−-------------------------------------------------------------------------------
276−-- Parsers in which -fspec-constr-recursive=16 is problematic
277−-------------------------------------------------------------------------------
278−
279−-- XXX -fspec-constr-recursive=16 makes GHC go beserk when compiling these.
280−-- We need to fix GHC so that we can have better control over that option or do
281−-- not have to rely on it.
282−--
283−{-# INLINE lookAhead #-}
284−lookAhead :: MonadThrow m => Int -> Stream m Int -> m ()
285−lookAhead value =
286− Stream.parseD (PR.lookAhead (PR.takeWhile (<= value) Fold.drain) $> ())
287−
288−-- XXX The timing of this increased 3x after the stepify extract changes.
289−{-# INLINE sequenceA_ #-}
290−sequenceA_ :: MonadThrow m => Int -> Stream m Int -> m ()
291−sequenceA_ value =
292− Stream.parseD (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
293−
294−-- quadratic complexity
295−{-# INLINE sequenceA #-}
296−sequenceA :: MonadThrow m => Int -> Stream m Int -> m Int
297−sequenceA value xs = do
298− x <- Stream.parseD (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
299− return $ length x
300−
301−-- quadratic complexity
302−{-# INLINE sequence #-}
303−sequence :: MonadThrow m => Int -> Stream m Int -> m Int
304−sequence value xs = do
305− x <- Stream.parseD (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
306− return $ length x
307−
308−{-# INLINE sequence_ #-}
309−sequence_ :: MonadThrow m => Int -> Stream m Int -> m ()
310−sequence_ value xs =
311− Stream.parseD (foldr f (return ()) (replicate value (PR.takeBetween 0 1 Fold.drain))) xs
312−
313− where
314−
315− {-# INLINE f #-}
316− f m k = m >>= (\_ -> k)
317−
318−-- choice using the "Alternative" instance with direct style parser type has
319−-- quadratic performance complexity.
320−--
321−{-# INLINE choiceAsum #-}
322−choiceAsum :: MonadThrow m => Int -> Stream m Int -> m Int
323−choiceAsum value =
324− Stream.parseD (asum (replicate value (PR.satisfy (< 0)))
325− AP.<|> PR.satisfy (> 0))
326−
327−{-
328−{-# INLINE choice #-}
329−choice :: MonadThrow m => Int -> Stream m Int -> m Int
330−choice value =
331− Stream.parseD
332− (PR.choice (replicate value (PR.satisfy (< 0))) AP.<|> PR.satisfy (> 0))
333−-}
334−
335−-------------------------------------------------------------------------------
336−-- Benchmarks
337−-------------------------------------------------------------------------------
338−
339−moduleName :: String
340−moduleName = "Data.Parser.ParserD"
341−
342−o_1_space_serial :: Int -> [Benchmark]
343−o_1_space_serial value =
344− [ benchIOSink value "takeWhile" $ takeWhile value
345− , benchIOSink value "takeP" $ takeP value
346− , benchIOSink value "takeBetween" $ takeBetween value
347− , benchIOSink value "takeStartBy" $ takeStartBy value
348− , benchIOSink value "groupBy" $ groupBy
349− , benchIOSink value "groupByRolling" $ groupByRolling
350− , benchIOSink value "wordBy" $ wordBy value
351− , benchIOSink value "splitWith" $ splitWith value
352− , benchIOSink value "many" many
353− , benchIOSink value "many (wordBy even)" $ manyWordByEven
354− , benchIOSink value "some" some
355− , benchIOSink value "takeEndBy_" $ takeEndBy_ value
356− , benchIOSink value "manyTill" $ manyTill value
357− {-
358− , benchIOSink value "tee (all,any)" $ teeAllAny value
359− , benchIOSink value "teeFst (all,any)" $ teeFstAllAny value
360− , benchIOSink value "shortest (all,any)" $ shortestAllAny value
361− , benchIOSink value "longest (all,any)" $ longestAllAny value
362− -}
363− , benchIOSink value "sequenceParser" sequenceParser
364− , benchIOSink value "listEqBy" (listEqBy value)
365− , benchIOSink value "eqBy" (eqBy value)
366− ]
367−
368−o_1_space_serial_spanning :: Int -> [Benchmark]
369−o_1_space_serial_spanning value =
370− [ benchIOSink value "span" $ span value
371− , benchIOSink value "spanBy" $ spanBy value
372− , benchIOSink value "spanByRolling" $ spanByRolling value
373− ]
374−
375−o_1_space_serial_nested :: Int -> [Benchmark]
376−o_1_space_serial_nested value =
377− [ benchIOSink value "parseMany" $ parseMany value
378− , benchIOSink value "parseMany groupBy (bound groups)"
379− $ parseManyGroups False
380− , benchIOSink value "parseMany groupRollingBy (bound groups)"
381− $ parseManyGroupsRolling False
382− , benchIOSink value "parseMany groupBy (1 group)" $ parseManyGroups True
383− , benchIOSink value "parseMany groupRollingBy (1 group)"
384− $ parseManyGroupsRolling True
385− , bench "parseMany groupRollingByEither (Left)"
386− $ nfIO $ parseManyGroupsRollingEitherLeft
387− , bench "parseMany groupRollingByEither (Right)"
388− $ nfIO $ parseManyGroupsRollingEitherRight
389− , bench "parseMany groupRollingByEither (Alternating)"
390− $ nfIO $ parseManyGroupsRollingEitherAlt1
391− ]
392−
393− where
394−
395− {-# NOINLINE parseManyGroupsRollingEitherLeft #-}
396− parseManyGroupsRollingEitherLeft = parseManyGroupsRollingEither (<) value
397−
398− {-# NOINLINE parseManyGroupsRollingEitherRight #-}
399− parseManyGroupsRollingEitherRight = parseManyGroupsRollingEither (>) value
400−
401− {-# NOINLINE parseManyGroupsRollingEitherAlt1 #-}
402− parseManyGroupsRollingEitherAlt1 =
403− parseManyGroupsRollingEitherAlt (>) value
404−
405−o_1_space_serial_unfold :: Int -> [Array.Array Int] -> [Benchmark]
406−o_1_space_serial_unfold bound arrays =
407− [ bench "parseMany/Unfold/1000 arrays/1 parse"
408− $ nfIO $ parseManyUnfoldArrays bound arrays
409− , bench "parseMany/Unfold/1000 arrays/100000 parses"
410− $ nfIO $ parseManyUnfoldArrays 1 arrays
411− ]
412−
413−o_n_heap_serial :: Int -> [Benchmark]
414−o_n_heap_serial value =
415− [
416− -- lookahead benchmark holds the entire input till end
417− benchIOSink value "lookAhead" $ lookAhead value
418−
419− -- These show non-linear time complexity
420− -- They accumulate the results in a list.
421− , benchIOSink value "manyAlt" manyAlt
422− , benchIOSink value "someAlt" someAlt
423− ]
424−
425−-- accumulate results in a list in IO
426−o_n_space_serial :: Int -> [Benchmark]
427−o_n_space_serial value =
428− [ benchIOSink value "sequenceA/100" $ sequenceA (value `div` 100)
429− , benchIOSink value "sequenceA_/100" $ sequenceA_ (value `div` 100)
430− , benchIOSink value "sequence/100" $ sequence (value `div` 100)
431− , benchIOSink value "sequence_/100" $ sequence_ (value `div` 100)
432− , benchIOSink value "choice (asum)/100" $ choiceAsum (value `div` 100)
433− -- , benchIOSink value "choice/100" $ choice (value `div` 100)
434− ]
435−
436−-------------------------------------------------------------------------------
437−-- Driver
438−-------------------------------------------------------------------------------
439−
440−main :: IO ()
441−main = do
442− x <- randomRIO (1,1)
443− runWithCLIOptsEnv (defaultStreamSize + x) alloc allBenchmarks
444−
445− where
446−
447− alloc value = Stream.fold Fold.toList $ Stream.arraysOf 100 $ sourceUnfoldrM value 0
448−
449− allBenchmarks arraysSmall value =
450− [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
451− , bgroup (o_1_space_prefix moduleName) (o_1_space_serial_spanning value)
452− , bgroup (o_1_space_prefix moduleName) (o_1_space_serial_nested value)
453− , bgroup (o_1_space_prefix moduleName)
454− (o_1_space_serial_unfold value arraysSmall)
455− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
456− , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
457− ]
benchmark/Streamly/Benchmark/Data/Parser/ParserK.hsdeleted−162
@@ -1,162 +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−{-# 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 (MonadThrow)
18−import Data.Foldable (asum)
19−import Streamly.Internal.Data.Stream (Stream)
20−import System.Random (randomRIO)
21−import Prelude hiding (any, all, take, sequence, sequenceA, takeWhile)
22−
23−import qualified Control.Applicative as AP
24−import qualified Data.Foldable as F
25−import qualified Data.Traversable as TR
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 as Stream
30−
31−import Gauge
32−import Streamly.Benchmark.Common
33−
34−-------------------------------------------------------------------------------
35−-- Utilities
36−-------------------------------------------------------------------------------
37−
38−-- XXX these can be moved to the common module
39−
40−{-# INLINE sourceUnfoldrM #-}
41−sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
42−sourceUnfoldrM value n = Stream.unfoldrM step n
43− where
44− step cnt =
45− if cnt > n + value
46− then return Nothing
47− else return (Just (cnt, cnt + 1))
48−
49−-- | Takes a fold method, and uses it with a default source.
50−{-# INLINE benchIOSink #-}
51−benchIOSink
52− :: NFData b
53− => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
54−benchIOSink value name f =
55− bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
56−
57−-------------------------------------------------------------------------------
58−-- Parsers
59−-------------------------------------------------------------------------------
60−
61−#ifdef FROM_PARSERK
62−#define PARSE_OP (Stream.parseD . PRD.fromParserK)
63−#else
64−#define PARSE_OP Stream.parseK
65−#endif
66−
67−{-# INLINE satisfy #-}
68−satisfy :: Monad m => (a -> Bool) -> PR.Parser a m a
69−satisfy = PRD.toParserK . PRD.satisfy
70−
71−{-# INLINE takeWhile #-}
72−takeWhile :: Monad m => (a -> Bool) -> PR.Parser a m ()
73−takeWhile p = PRD.toParserK $ PRD.takeWhile p FL.drain
74−
75−{-# INLINE takeWhileK #-}
76−takeWhileK :: MonadThrow m => Int -> Stream m Int -> m ()
77−takeWhileK value = PARSE_OP (takeWhile (<= value))
78−
79−{-# INLINE splitApp #-}
80−splitApp :: MonadThrow m
81− => Int -> Stream m Int -> m ((), ())
82−splitApp value =
83− PARSE_OP ((,) <$> takeWhile (<= (value `div` 2)) <*> takeWhile (<= value))
84−
85−{-# INLINE sequenceA #-}
86−sequenceA :: MonadThrow m => Int -> Stream m Int -> m Int
87−sequenceA value xs = do
88− let parser = satisfy (> 0)
89− list = Prelude.replicate value parser
90− x <- PARSE_OP (TR.sequenceA list) xs
91− return $ Prelude.length x
92−
93−{-# INLINE sequenceA_ #-}
94−sequenceA_ :: MonadThrow m => Int -> Stream m Int -> m ()
95−sequenceA_ value xs = do
96− let parser = satisfy (> 0)
97− list = Prelude.replicate value parser
98− PARSE_OP (F.sequenceA_ list) xs
99−
100−{-# INLINE sequence #-}
101−sequence :: MonadThrow m => Int -> Stream m Int -> m Int
102−sequence value xs = do
103− let parser = satisfy (> 0)
104− list = Prelude.replicate value parser
105− x <- PARSE_OP (TR.sequence list) xs
106− return $ Prelude.length x
107−
108−{-# INLINE manyAlt #-}
109−manyAlt :: MonadThrow m => Stream m Int -> m Int
110−manyAlt xs = do
111− x <- PARSE_OP (AP.many (satisfy (> 0))) xs
112− return $ Prelude.length x
113−
114−{-# INLINE someAlt #-}
115−someAlt :: MonadThrow m => Stream m Int -> m Int
116−someAlt xs = do
117− x <- PARSE_OP (AP.some (satisfy (> 0))) xs
118− return $ Prelude.length x
119−
120−{-# INLINE choice #-}
121−choice :: MonadThrow m => Int -> Stream m Int -> m Int
122−choice value =
123− PARSE_OP (asum (replicate value (satisfy (< 0)))
124− AP.<|> satisfy (> 0))
125−
126−-------------------------------------------------------------------------------
127−-- Benchmarks
128−-------------------------------------------------------------------------------
129−
130−moduleName :: String
131−moduleName = "Data.Parser.ParserK"
132−
133−o_1_space_serial :: Int -> [Benchmark]
134−o_1_space_serial value =
135− [ benchIOSink value "takeWhile" $ takeWhileK value
136− , benchIOSink value "splitApp" $ splitApp value
137− ]
138−
139−-- O(n) heap beacuse of accumulation of the list in strict IO monad?
140−o_n_heap_serial :: Int -> [Benchmark]
141−o_n_heap_serial value =
142− [ benchIOSink value "sequenceA" $ sequenceA value
143− , benchIOSink value "sequenceA_" $ sequenceA_ value
144− , benchIOSink value "sequence" $ sequence value
145− , benchIOSink value "manyAlt" manyAlt
146− , benchIOSink value "someAlt" someAlt
147− , benchIOSink value "choice" $ choice value
148− ]
149−
150−-------------------------------------------------------------------------------
151−-- Driver
152−-------------------------------------------------------------------------------
153−
154−main :: IO ()
155−main = runWithCLIOpts defaultStreamSize allBenchmarks
156−
157− where
158−
159− allBenchmarks value =
160− [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
161− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
162− ]
benchmark/Streamly/Benchmark/Data/ParserK.hsnew file+437
@@ -0,0 +1,437 @@
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+3−4
@@ -12,12 +12,11 @@ module Main (main) where
12
12
13import Control.Monad (void)
13import Control.Monad (void)
14import GHC.Ptr (Ptr(..))
14import GHC.Ptr (Ptr(..))
15−
16−import qualified Streamly.Internal.Data.Array.Type as Array
15+import qualified Streamly.Internal.Data.Array as Array
17−import qualified Streamly.Internal.Data.Ring.Unboxed as Ring
16+import qualified Streamly.Internal.Data.Ring as Ring
18import qualified Data.Foldable as P
17import qualified Data.Foldable as P
19
18
20−import Gauge
19+import Test.Tasty.Bench
21import Streamly.Benchmark.Common
20import Streamly.Benchmark.Common
22
21
23import Prelude as P
22import Prelude as P
benchmark/Streamly/Benchmark/Data/Serialize.hsnew file+591
@@ -0,0 +1,591 @@
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.hsnew file+24
@@ -0,0 +1,24 @@
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.hsnew file+21
@@ -0,0 +1,21 @@
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.hsnew file+76
@@ -0,0 +1,76 @@
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,12 +9,19 @@
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+
12module Main (main) where
17module Main (main) where
13
18
14import Streamly.Benchmark.Common.Handle (mkHandleBenchEnv)
19import Streamly.Benchmark.Common.Handle (mkHandleBenchEnv)
15
20
16import qualified Stream.Eliminate as Elimination
21import qualified Stream.Eliminate as Elimination
22+#ifndef USE_STREAMLY_CORE
17import qualified Stream.Exceptions as Exceptions
23import qualified Stream.Exceptions as Exceptions
24+#endif
18import qualified Stream.Expand as NestedStream
25import qualified Stream.Expand as NestedStream
19import qualified Stream.Generate as Generation
26import qualified Stream.Generate as Generation
20import qualified Stream.Lift as Lift
27import qualified Stream.Lift as Lift
@@ -26,8 +33,21 @@ import qualified Stream.Transform as Transformation
26
33
27import Streamly.Benchmark.Common
34import Streamly.Benchmark.Common
28
35
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+
29moduleName :: String
45moduleName :: String
46+#ifdef USE_STREAMK
47+moduleName = "Data.Stream.StreamDK"
48+#else
30moduleName = "Data.Stream"
49moduleName = "Data.Stream"
50+#endif
31
51
32-------------------------------------------------------------------------------
52-------------------------------------------------------------------------------
33-- Main
53-- Main
@@ -38,6 +58,7 @@ moduleName = "Data.Stream"
38--
58--
39main :: IO ()
59main :: IO ()
40main = do
60main = do
61+#ifndef FUSION_CHECK
41 env <- mkHandleBenchEnv
62 env <- mkHandleBenchEnv
42 runWithCLIOpts defaultStreamSize (allBenchmarks env)
63 runWithCLIOpts defaultStreamSize (allBenchmarks env)
43
64
@@ -46,7 +67,9 @@ main = do
46 allBenchmarks env size = Prelude.concat
67 allBenchmarks env size = Prelude.concat
47 [ Generation.benchmarks moduleName size
68 [ Generation.benchmarks moduleName size
48 , Elimination.benchmarks moduleName size
69 , Elimination.benchmarks moduleName size
70+#ifndef USE_STREAMLY_CORE
49 , Exceptions.benchmarks moduleName env size
71 , Exceptions.benchmarks moduleName env size
72+#endif
50#ifdef USE_PRELUDE
73#ifdef USE_PRELUDE
51 , Split.benchmarks moduleName env
74 , Split.benchmarks moduleName env
52#endif
75#endif
@@ -55,3 +78,37 @@ main = do
55 , Lift.benchmarks moduleName size
78 , Lift.benchmarks moduleName size
56 , NestedStream.benchmarks moduleName size
79 , NestedStream.benchmarks moduleName size
57 ]
80 ]
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+129−66
@@ -16,6 +16,9 @@
16module Stream.Common
16module Stream.Common
17 ( MonadAsync
17 ( MonadAsync
18
18
19+ , fromStream
20+ , toStream
21+
19 -- Generation
22 -- Generation
20 , fromListM
23 , fromListM
21 , fromFoldableM
24 , fromFoldableM
@@ -41,8 +44,10 @@ module Stream.Common
41 , benchIO
44 , benchIO
42
45
43 -- Benchmarking functions
46 -- Benchmarking functions
47+#ifdef USE_STREAMK
44 , concatStreamsWith
48 , concatStreamsWith
45− , concatPairsWith
49+ , mergeMapWith
50+#endif
46 , apDiscardFst
51 , apDiscardFst
47 , apDiscardSnd
52 , apDiscardSnd
48 , apLiftA2
53 , apLiftA2
@@ -66,11 +71,12 @@ module Stream.Common
66 )
71 )
67where
72where
68
73
74+#if !MIN_VERSION_base(4,18,0)
69import Control.Applicative (liftA2)
75import Control.Applicative (liftA2)
76+#endif
70import Control.DeepSeq (NFData)
77import Control.DeepSeq (NFData)
71import Control.Exception (try)
78import Control.Exception (try)
72import GHC.Exception (ErrorCall)
79import GHC.Exception (ErrorCall)
73−import Streamly.Internal.Data.Stream (Stream)
74import System.Random (randomRIO)
80import System.Random (randomRIO)
75
81
76import qualified Streamly.Internal.Data.Fold as Fold
82import qualified Streamly.Internal.Data.Fold as Fold
@@ -80,42 +86,97 @@ import qualified Streamly.Internal.Data.Pipe as Pipe
80import Streamly.Prelude (foldl', scanl')
86import Streamly.Prelude (foldl', scanl')
81import qualified Streamly.Internal.Data.Stream.IsStream as Stream
87import qualified Streamly.Internal.Data.Stream.IsStream as Stream
82import qualified Streamly.Prelude as Stream
88import qualified Streamly.Prelude as Stream
89+import qualified Streamly.Prelude as StreamK
83import Streamly.Benchmark.Prelude
90import Streamly.Benchmark.Prelude
84 ( composeN, sourceConcatMapId, benchIOSink
91 ( composeN, sourceConcatMapId, benchIOSink
85− , concatStreamsWith, concatPairsWith
92+ , concatStreamsWith
86 )
93 )
87#else
94#else
95+import Streamly.Internal.Data.Stream (Stream)
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
88import qualified Streamly.Internal.Data.Stream as Stream
102import qualified Streamly.Internal.Data.Stream as Stream
103+import qualified Streamly.Internal.Data.Stream as StreamK
104+#endif
89#endif
105#endif
90
106
91−import Gauge
107+import Test.Tasty.Bench
92−import Prelude hiding (mapM, replicate)
108+import Prelude hiding (Foldable(..), mapM, replicate)
109+
110+#ifdef USE_STREAMK
111+toStream :: Applicative m => StreamK m a -> Stream m a
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
93
123
94#ifdef USE_PRELUDE
124#ifdef USE_PRELUDE
125+type Stream = Stream.SerialT
95type MonadAsync m = Stream.MonadAsync m
126type MonadAsync m = Stream.MonadAsync m
127+mkCross = id
128+unCross = id
96#else
129#else
97type MonadAsync = Monad
130type 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
98#endif
145#endif
99
146
100−{-# INLINE append #-}
101−append :: Stream m a -> Stream m a -> Stream m a
102#ifdef USE_PRELUDE
147#ifdef USE_PRELUDE
148+{-# INLINE append #-}
149+append :: Monad m => Stream m a -> Stream m a -> Stream m a
103append = Stream.serial
150append = Stream.serial
104#else
151#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
105append = Stream.append
157append = Stream.append
106#endif
158#endif
159+#endif
107
160
108{-# INLINE append2 #-}
161{-# INLINE append2 #-}
109append2 :: Monad m => Stream m a -> Stream m a -> Stream m a
162append2 :: Monad m => Stream m a -> Stream m a -> Stream m a
110#ifdef USE_PRELUDE
163#ifdef USE_PRELUDE
111append2 = Stream.append
164append2 = Stream.append
112#else
165#else
113−append2 = Stream.append2
166+append2 = D.append
114#endif
167#endif
115
168
116{-# INLINE drain #-}
169{-# INLINE drain #-}
117drain :: Monad m => Stream m a -> m ()
170drain :: 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
118drain = Stream.fold Fold.drain
177drain = Stream.fold Fold.drain
178+toList = Stream.fold Fold.toList
179+#endif
119
180
120{-# INLINE fromListM #-}
181{-# INLINE fromListM #-}
121fromListM :: MonadAsync m => [m a] -> Stream m a
182fromListM :: MonadAsync m => [m a] -> Stream m a
@@ -130,7 +191,7 @@ fromFoldableM :: MonadAsync m => [m a] -> Stream m a
130#ifdef USE_PRELUDE
191#ifdef USE_PRELUDE
131fromFoldableM = Stream.fromFoldableM
192fromFoldableM = Stream.fromFoldableM
132#else
193#else
133−fromFoldableM = Stream.sequence . Stream.fromFoldable
194+fromFoldableM = Stream.sequence . toStream . StreamK.fromFoldable
134#endif
195#endif
135
196
136{-# INLINE sourceUnfoldrM #-}
197{-# INLINE sourceUnfoldrM #-}
@@ -167,8 +228,8 @@ sourceUnfoldrAction value n = Stream.unfoldr step n
167 else Just (return cnt, cnt + 1)
228 else Just (return cnt, cnt + 1)
168
229
169{-# INLINE sourceFromFoldable #-}
230{-# INLINE sourceFromFoldable #-}
170−sourceFromFoldable :: Int -> Int -> Stream m Int
231+sourceFromFoldable :: Monad m => Int -> Int -> Stream m Int
171−sourceFromFoldable value n = Stream.fromFoldable [n..n+value]
232+sourceFromFoldable value n = toStream $ StreamK.fromFoldable [n..n+value]
172
233
173#ifndef USE_PRELUDE
234#ifndef USE_PRELUDE
174{-# INLINE benchIOSink #-}
235{-# INLINE benchIOSink #-}
@@ -193,43 +254,45 @@ benchIO :: (NFData b) => String -> (Int -> IO b) -> Benchmark
193benchIO name f = bench name $ nfIO $ randomRIO (1,1) >>= f
254benchIO name f = bench name $ nfIO $ randomRIO (1,1) >>= f
194
255
195#ifndef USE_PRELUDE
256#ifndef USE_PRELUDE
257+#ifdef USE_STREAMK
196{-# INLINE concatStreamsWith #-}
258{-# INLINE concatStreamsWith #-}
197concatStreamsWith
259concatStreamsWith
198− :: (Stream IO Int -> Stream IO Int -> Stream IO Int)
260+ :: (StreamK IO Int -> StreamK IO Int -> StreamK IO Int)
199 -> Int
261 -> Int
200 -> Int
262 -> Int
201 -> Int
263 -> Int
202 -> IO ()
264 -> IO ()
203concatStreamsWith op outer inner n =
265concatStreamsWith op outer inner n =
204− drain $ Stream.concatMapWith op
266+ drain $ toStream $ StreamK.concatMapWith op
205− (sourceUnfoldrM inner)
267+ (fromStream . sourceUnfoldrM inner)
206− (sourceUnfoldrM outer n)
268+ (fromStream $ sourceUnfoldrM outer n)
207
269
208−{-# INLINE concatPairsWith #-}
270+{-# INLINE mergeMapWith #-}
209−concatPairsWith
271+mergeMapWith
210− :: (Stream IO Int -> Stream IO Int -> Stream IO Int)
272+ :: (StreamK IO Int -> StreamK IO Int -> StreamK IO Int)
211 -> Int
273 -> Int
212 -> Int
274 -> Int
213 -> Int
275 -> Int
214 -> IO ()
276 -> IO ()
215−concatPairsWith op outer inner n =
277+mergeMapWith op outer inner n =
216− drain $ Stream.concatPairsWith op
278+ drain $ toStream $ StreamK.mergeMapWith op
217− (sourceUnfoldrM inner)
279+ (fromStream . sourceUnfoldrM inner)
218− (sourceUnfoldrM outer n)
280+ (fromStream $ sourceUnfoldrM outer n)
281+#endif
219
282
220{-# INLINE sourceConcatMapId #-}
283{-# INLINE sourceConcatMapId #-}
221sourceConcatMapId :: (Monad m)
284sourceConcatMapId :: (Monad m)
222 => Int -> Int -> Stream m (Stream m Int)
285 => Int -> Int -> Stream m (Stream m Int)
223sourceConcatMapId value n =
286sourceConcatMapId value n =
224− Stream.fromFoldable $ fmap (Stream.fromEffect . return) [n..n+value]
287+ Stream.fromList $ fmap (D.fromEffect . return) [n..n+value]
225#endif
288#endif
226
289
227{-# INLINE apDiscardFst #-}
290{-# INLINE apDiscardFst #-}
228apDiscardFst :: MonadAsync m =>
291apDiscardFst :: MonadAsync m =>
229 Int -> Int -> m ()
292 Int -> Int -> m ()
230−apDiscardFst linearCount start = drain $
293+apDiscardFst linearCount start = drain $ toStream $ unCross $
231− sourceUnfoldrM nestedCount2 start
294+ mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
232− *> sourceUnfoldrM nestedCount2 start
295+ *> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
233
296
234 where
297 where
235
298
@@ -237,9 +300,9 @@ apDiscardFst linearCount start = drain $
237
300
238{-# INLINE apDiscardSnd #-}
301{-# INLINE apDiscardSnd #-}
239apDiscardSnd :: MonadAsync m => Int -> Int -> m ()
302apDiscardSnd :: MonadAsync m => Int -> Int -> m ()
240−apDiscardSnd linearCount start = drain $
303+apDiscardSnd linearCount start = drain $ toStream $ unCross $
241− sourceUnfoldrM nestedCount2 start
304+ mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
242− <* sourceUnfoldrM nestedCount2 start
305+ <* mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
243
306
244 where
307 where
245
308
@@ -247,9 +310,9 @@ apDiscardSnd linearCount start = drain $
247
310
248{-# INLINE apLiftA2 #-}
311{-# INLINE apLiftA2 #-}
249apLiftA2 :: MonadAsync m => Int -> Int -> m ()
312apLiftA2 :: MonadAsync m => Int -> Int -> m ()
250−apLiftA2 linearCount start = drain $
313+apLiftA2 linearCount start = drain $ toStream $ unCross $
251− liftA2 (+) (sourceUnfoldrM nestedCount2 start)
314+ liftA2 (+) (mkCross (fromStream $ sourceUnfoldrM nestedCount2 start))
252− (sourceUnfoldrM nestedCount2 start)
315+ (mkCross (fromStream $ sourceUnfoldrM nestedCount2 start))
253
316
254 where
317 where
255
318
@@ -257,9 +320,9 @@ apLiftA2 linearCount start = drain $
257
320
258{-# INLINE toNullAp #-}
321{-# INLINE toNullAp #-}
259toNullAp :: MonadAsync m => Int -> Int -> m ()
322toNullAp :: MonadAsync m => Int -> Int -> m ()
260−toNullAp linearCount start = drain $
323+toNullAp linearCount start = drain $ toStream $ unCross $
261− (+) <$> sourceUnfoldrM nestedCount2 start
324+ (+) <$> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
262− <*> sourceUnfoldrM nestedCount2 start
325+ <*> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
263
326
264 where
327 where
265
328
@@ -267,9 +330,9 @@ toNullAp linearCount start = drain $
267
330
268{-# INLINE monadThen #-}
331{-# INLINE monadThen #-}
269monadThen :: MonadAsync m => Int -> Int -> m ()
332monadThen :: MonadAsync m => Int -> Int -> m ()
270−monadThen linearCount start = drain $ do
333+monadThen linearCount start = drain $ toStream $ unCross $ do
271− sourceUnfoldrM nestedCount2 start >>
334+ mkCross (fromStream $ sourceUnfoldrM nestedCount2 start) >>
272− sourceUnfoldrM nestedCount2 start
335+ mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
273
336
274 where
337 where
275
338
@@ -277,9 +340,9 @@ monadThen linearCount start = drain $ do
277
340
278{-# INLINE toNullM #-}
341{-# INLINE toNullM #-}
279toNullM :: MonadAsync m => Int -> Int -> m ()
342toNullM :: MonadAsync m => Int -> Int -> m ()
280−toNullM linearCount start = drain $ do
343+toNullM linearCount start = drain $ toStream $ unCross $ do
281− x <- sourceUnfoldrM nestedCount2 start
344+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
282− y <- sourceUnfoldrM nestedCount2 start
345+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
283 return $ x + y
346 return $ x + y
284
347
285 where
348 where
@@ -288,56 +351,56 @@ toNullM linearCount start = drain $ do
288
351
289{-# INLINE toNullM3 #-}
352{-# INLINE toNullM3 #-}
290toNullM3 :: MonadAsync m => Int -> Int -> m ()
353toNullM3 :: MonadAsync m => Int -> Int -> m ()
291−toNullM3 linearCount start = drain $ do
354+toNullM3 linearCount start = drain $ toStream $ unCross $ do
292− x <- sourceUnfoldrM nestedCount3 start
355+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount3 start)
293− y <- sourceUnfoldrM nestedCount3 start
356+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount3 start)
294− z <- sourceUnfoldrM nestedCount3 start
357+ z <- mkCross (fromStream $ sourceUnfoldrM nestedCount3 start)
295 return $ x + y + z
358 return $ x + y + z
296 where
359 where
297 nestedCount3 = round (fromIntegral linearCount**(1/3::Double))
360 nestedCount3 = round (fromIntegral linearCount**(1/3::Double))
298
361
299{-# INLINE filterAllOutM #-}
362{-# INLINE filterAllOutM #-}
300filterAllOutM :: MonadAsync m => Int -> Int -> m ()
363filterAllOutM :: MonadAsync m => Int -> Int -> m ()
301−filterAllOutM linearCount start = drain $ do
364+filterAllOutM linearCount start = drain $ toStream $ unCross $ do
302− x <- sourceUnfoldrM nestedCount2 start
365+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
303− y <- sourceUnfoldrM nestedCount2 start
366+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
304 let s = x + y
367 let s = x + y
305 if s < 0
368 if s < 0
306 then return s
369 then return s
307− else Stream.nil
370+ else mkCross StreamK.nil
308 where
371 where
309 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
372 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
310
373
311{-# INLINE filterAllInM #-}
374{-# INLINE filterAllInM #-}
312filterAllInM :: MonadAsync m => Int -> Int -> m ()
375filterAllInM :: MonadAsync m => Int -> Int -> m ()
313−filterAllInM linearCount start = drain $ do
376+filterAllInM linearCount start = drain $ toStream $ unCross $ do
314− x <- sourceUnfoldrM nestedCount2 start
377+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
315− y <- sourceUnfoldrM nestedCount2 start
378+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
316 let s = x + y
379 let s = x + y
317 if s > 0
380 if s > 0
318 then return s
381 then return s
319− else Stream.nil
382+ else mkCross StreamK.nil
320 where
383 where
321 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
384 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
322
385
323{-# INLINE filterSome #-}
386{-# INLINE filterSome #-}
324filterSome :: MonadAsync m => Int -> Int -> m ()
387filterSome :: MonadAsync m => Int -> Int -> m ()
325−filterSome linearCount start = drain $ do
388+filterSome linearCount start = drain $ toStream $ unCross $ do
326− x <- sourceUnfoldrM nestedCount2 start
389+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
327− y <- sourceUnfoldrM nestedCount2 start
390+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
328 let s = x + y
391 let s = x + y
329 if s > 1100000
392 if s > 1100000
330 then return s
393 then return s
331− else Stream.nil
394+ else mkCross StreamK.nil
332 where
395 where
333 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
396 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
334
397
335{-# INLINE breakAfterSome #-}
398{-# INLINE breakAfterSome #-}
336breakAfterSome :: Int -> Int -> IO ()
399breakAfterSome :: Int -> Int -> IO ()
337breakAfterSome linearCount start = do
400breakAfterSome linearCount start = do
338− (_ :: Either ErrorCall ()) <- try $ drain $ do
401+ (_ :: Either ErrorCall ()) <- try $ drain $ toStream $ unCross $ do
339− x <- sourceUnfoldrM nestedCount2 start
402+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
340− y <- sourceUnfoldrM nestedCount2 start
403+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
341 let s = x + y
404 let s = x + y
342 if s > 1100000
405 if s > 1100000
343 then error "break"
406 then error "break"
@@ -348,9 +411,9 @@ breakAfterSome linearCount start = do
348
411
349{-# INLINE toListM #-}
412{-# INLINE toListM #-}
350toListM :: MonadAsync m => Int -> Int -> m [Int]
413toListM :: MonadAsync m => Int -> Int -> m [Int]
351−toListM linearCount start = Stream.fold Fold.toList $ do
414+toListM linearCount start = toList $ toStream $ unCross $ do
352− x <- sourceUnfoldrM nestedCount2 start
415+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
353− y <- sourceUnfoldrM nestedCount2 start
416+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
354 return $ x + y
417 return $ x + y
355 where
418 where
356 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
419 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
@@ -360,9 +423,9 @@ toListM linearCount start = Stream.fold Fold.toList $ do
360{-# INLINE toListSome #-}
423{-# INLINE toListSome #-}
361toListSome :: MonadAsync m => Int -> Int -> m [Int]
424toListSome :: MonadAsync m => Int -> Int -> m [Int]
362toListSome linearCount start =
425toListSome linearCount start =
363− Stream.fold Fold.toList $ Stream.take 10000 $ do
426+ toList $ Stream.take 10000 $ toStream $ unCross $ do
364− x <- sourceUnfoldrM nestedCount2 start
427+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
365− y <- sourceUnfoldrM nestedCount2 start
428+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
366 return $ x + y
429 return $ x + y
367 where
430 where
368 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
431 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
benchmark/Streamly/Benchmark/Data/Stream/Concurrent.hs+1−1
@@ -17,4 +17,4 @@ moduleName = "Data.Stream.Concurrent"
17-------------------------------------------------------------------------------
17-------------------------------------------------------------------------------
18
18
19main :: IO ()
19main :: IO ()
20−main = runWithCLIOpts defaultStreamSize (allBenchmarks moduleName id)
20+main = runWithCLIOpts defaultStreamSize (allBenchmarks moduleName False id)
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentCommon.hs+22−21
@@ -14,14 +14,14 @@ where
14import Stream.Common
14import Stream.Common
15 (composeN, benchIO, benchIOSink, benchIOSrc, sourceUnfoldrM)
15 (composeN, benchIO, benchIOSink, benchIOSrc, sourceUnfoldrM)
16import Streamly.Data.Stream (Stream)
16import Streamly.Data.Stream (Stream)
17−import Streamly.Internal.Data.Stream.Concurrent (MonadAsync, Config)
17+import Streamly.Internal.Data.Stream.Prelude (MonadAsync, Config)
18
18
19import qualified Data.List as List
19import qualified Data.List as List
20import qualified Streamly.Data.Fold as Fold
20import qualified Streamly.Data.Fold as Fold
21import qualified Streamly.Data.Stream as Stream
21import qualified Streamly.Data.Stream as Stream
22−import qualified Streamly.Internal.Data.Stream.Concurrent as Async
22+import qualified Streamly.Internal.Data.Stream.Prelude as Async
23
23
24−import Gauge
24+import Test.Tasty.Bench
25import Prelude hiding (mapM)
25import Prelude hiding (mapM)
26import Streamly.Benchmark.Common
26import Streamly.Benchmark.Common
27
27
@@ -39,7 +39,7 @@ mapM ::
39 -> Int
39 -> Int
40 -> Stream m Int
40 -> Stream m Int
41 -> m ()
41 -> m ()
42−mapM f n = composeN n $ Async.mapMWith f return
42+mapM f n = composeN n $ Async.parMapM f return
43
43
44o_1_space_mapping :: Int -> (Config -> Config) -> [Benchmark]
44o_1_space_mapping :: Int -> (Config -> Config) -> [Benchmark]
45o_1_space_mapping value f =
45o_1_space_mapping value f =
@@ -56,7 +56,7 @@ o_n_heap_buffering :: Int -> (Config -> Config) -> [Benchmark]
56o_n_heap_buffering value f =
56o_n_heap_buffering value f =
57 [ bgroup "buffered"
57 [ bgroup "buffered"
58 [ benchIOSink value "mkAsync"
58 [ benchIOSink value "mkAsync"
59− (Stream.fold Fold.drain . Async.evalWith f)
59+ (Stream.fold Fold.drain . Async.parEval f)
60 ]
60 ]
61 ]
61 ]
62
62
@@ -68,14 +68,14 @@ o_n_heap_buffering value f =
68async2 :: (Config -> Config) -> Int -> Int -> IO ()
68async2 :: (Config -> Config) -> Int -> Int -> IO ()
69async2 f count n =
69async2 f count n =
70 Stream.fold Fold.drain
70 Stream.fold Fold.drain
71− $ Async.combineWith f
71+ $ Async.parTwo f
72 (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
72 (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
73
73
74{-# INLINE concatAsync2 #-}
74{-# INLINE concatAsync2 #-}
75concatAsync2 :: (Config -> Config) -> Int -> Int -> IO ()
75concatAsync2 :: (Config -> Config) -> Int -> Int -> IO ()
76concatAsync2 f count n =
76concatAsync2 f count n =
77 Stream.fold Fold.drain
77 Stream.fold Fold.drain
78− $ Async.concatWith f
78+ $ Async.parConcat f
79 $ Stream.fromList
79 $ Stream.fromList
80 [sourceUnfoldrM count n, sourceUnfoldrM count (n + 1)]
80 [sourceUnfoldrM count n, sourceUnfoldrM count (n + 1)]
81
81
@@ -94,12 +94,12 @@ o_1_space_joining value f =
94{-# INLINE sourceFoldMapWith #-}
94{-# INLINE sourceFoldMapWith #-}
95sourceFoldMapWith :: (Config -> Config) -> Int -> Int -> Stream IO Int
95sourceFoldMapWith :: (Config -> Config) -> Int -> Int -> Stream IO Int
96sourceFoldMapWith f value n =
96sourceFoldMapWith f value n =
97− Async.concatMapWith f Stream.fromPure $ Stream.fromList [n..n+value]
97+ Async.parConcatMap f Stream.fromPure $ Stream.fromList [n..n+value]
98
98
99{-# INLINE sourceFoldMapWithStream #-}
99{-# INLINE sourceFoldMapWithStream #-}
100sourceFoldMapWithStream :: (Config -> Config) -> Int -> Int -> Stream IO Int
100sourceFoldMapWithStream :: (Config -> Config) -> Int -> Int -> Stream IO Int
101sourceFoldMapWithStream f value n =
101sourceFoldMapWithStream f value n =
102− Async.concatMapWith f Stream.fromPure
102+ Async.parConcatMap f Stream.fromPure
103 $ Stream.enumerateFromTo n (n + value)
103 $ Stream.enumerateFromTo n (n + value)
104
104
105{-# INLINE concatFoldableWith #-}
105{-# INLINE concatFoldableWith #-}
@@ -110,7 +110,7 @@ concatFoldableWith f value n =
110 then Just (Stream.fromPure x, x + 1)
110 then Just (Stream.fromPure x, x + 1)
111 else Nothing
111 else Nothing
112 list = List.unfoldr step n
112 list = List.unfoldr step n
113− in Async.concatWith f (Stream.fromList list)
113+ in Async.parConcat f (Stream.fromList list)
114
114
115o_1_space_concatFoldable :: Int -> (Config -> Config) -> [Benchmark]
115o_1_space_concatFoldable :: Int -> (Config -> Config) -> [Benchmark]
116o_1_space_concatFoldable value f =
116o_1_space_concatFoldable value f =
@@ -133,7 +133,7 @@ concatMapStreamsWith
133 -> IO ()
133 -> IO ()
134concatMapStreamsWith f outer inner n =
134concatMapStreamsWith f outer inner n =
135 Stream.fold Fold.drain
135 Stream.fold Fold.drain
136− $ Async.concatMapWith f (sourceUnfoldrM inner) (sourceUnfoldrM outer n)
136+ $ Async.parConcatMap f (sourceUnfoldrM inner) (sourceUnfoldrM outer n)
137
137
138{-# INLINE concatFmapStreamsWith #-}
138{-# INLINE concatFmapStreamsWith #-}
139concatFmapStreamsWith
139concatFmapStreamsWith
@@ -144,18 +144,18 @@ concatFmapStreamsWith
144 -> IO ()
144 -> IO ()
145concatFmapStreamsWith f outer inner n =
145concatFmapStreamsWith f outer inner n =
146 Stream.fold Fold.drain
146 Stream.fold Fold.drain
147− $ Async.concatWith f
147+ $ Async.parConcat f
148 $ fmap (sourceUnfoldrM inner) (sourceUnfoldrM outer n)
148 $ fmap (sourceUnfoldrM inner) (sourceUnfoldrM outer n)
149
149
150o_1_space_concatMap :: Int -> (Config -> Config) -> [Benchmark]
150o_1_space_concatMap :: Int -> (Config -> Config) -> [Benchmark]
151o_1_space_concatMap value f =
151o_1_space_concatMap value f =
152 value2 `seq`
152 value2 `seq`
153 [ bgroup "concat"
153 [ bgroup "concat"
154− [ benchIO "concatMapWith (n of 1)"
154+ [ benchIO "parConcatMap (n of 1)"
155 (concatMapStreamsWith f value 1)
155 (concatMapStreamsWith f value 1)
156− , benchIO "concatMapWith (sqrt x of sqrt x)"
156+ , benchIO "parConcatMap (sqrt x of sqrt x)"
157 (concatMapStreamsWith f value2 value2)
157 (concatMapStreamsWith f value2 value2)
158− , benchIO "concatMapWith (1 of n)"
158+ , benchIO "parConcatMap (1 of n)"
159 (concatMapStreamsWith f 1 value)
159 (concatMapStreamsWith f 1 value)
160 , benchIO "concat . fmap (n of 1)"
160 , benchIO "concat . fmap (n of 1)"
161 (concatFmapStreamsWith f value 1)
161 (concatFmapStreamsWith f value 1)
@@ -174,7 +174,7 @@ o_1_space_concatMap value f =
174toNullAp :: (Config -> Config) -> Int -> Int -> IO ()
174toNullAp :: (Config -> Config) -> Int -> Int -> IO ()
175toNullAp f linearCount start =
175toNullAp f linearCount start =
176 Stream.fold Fold.drain
176 Stream.fold Fold.drain
177− $ Async.applyWith f
177+ $ Async.parApply f
178 (fmap (+) (sourceUnfoldrM nestedCount2 start))
178 (fmap (+) (sourceUnfoldrM nestedCount2 start))
179 (sourceUnfoldrM nestedCount2 start)
179 (sourceUnfoldrM nestedCount2 start)
180
180
@@ -193,15 +193,16 @@ o_1_space_outerProduct value f =
193-- Benchmark sets
193-- Benchmark sets
194-------------------------------------------------------------------------------
194-------------------------------------------------------------------------------
195
195
196−allBenchmarks :: String -> (Config -> Config) -> Int -> [Benchmark]
196+allBenchmarks :: String -> Bool -> (Config -> Config) -> Int -> [Benchmark]
197−allBenchmarks moduleName modifier value =
197+allBenchmarks moduleName wide modifier value =
198 [ bgroup (o_1_space_prefix moduleName) $ concat
198 [ bgroup (o_1_space_prefix moduleName) $ concat
199 [ o_1_space_mapping value modifier
199 [ o_1_space_mapping value modifier
200 , o_1_space_concatFoldable value modifier
200 , o_1_space_concatFoldable value modifier
201 , o_1_space_concatMap value modifier
201 , o_1_space_concatMap value modifier
202− , o_1_space_outerProduct value modifier
203 , o_1_space_joining 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
204 ]
207 ]
205− , bgroup (o_n_heap_prefix moduleName)
206− (o_n_heap_buffering value modifier)
207 ]
208 ]
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentEager.hs+2−2
@@ -9,7 +9,7 @@
9import Stream.ConcurrentCommon (allBenchmarks)
9import Stream.ConcurrentCommon (allBenchmarks)
10import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
10import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
11
11
12−import qualified Streamly.Internal.Data.Stream.Concurrent as Async
12+import qualified Streamly.Internal.Data.Stream.Prelude as Async
13
13
14moduleName :: String
14moduleName :: String
15moduleName = "Data.Stream.ConcurrentEager"
15moduleName = "Data.Stream.ConcurrentEager"
@@ -22,4 +22,4 @@ main :: IO ()
22main =
22main =
23 runWithCLIOpts
23 runWithCLIOpts
24 defaultStreamSize
24 defaultStreamSize
25− (allBenchmarks moduleName (Async.eager True))
25+ (allBenchmarks moduleName True (Async.eager True))
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentInterleaved.hs+2−2
@@ -9,7 +9,7 @@
9import Stream.ConcurrentCommon (allBenchmarks)
9import Stream.ConcurrentCommon (allBenchmarks)
10import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
10import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
11
11
12−import qualified Streamly.Internal.Data.Stream.Concurrent as Async
12+import qualified Streamly.Internal.Data.Stream.Prelude as Async
13
13
14moduleName :: String
14moduleName :: String
15moduleName = "Data.Stream.ConcurrentInterleaved"
15moduleName = "Data.Stream.ConcurrentInterleaved"
@@ -22,4 +22,4 @@ main :: IO ()
22main =
22main =
23 runWithCLIOpts
23 runWithCLIOpts
24 defaultStreamSize
24 defaultStreamSize
25− (allBenchmarks moduleName (Async.interleaved True))
25+ (allBenchmarks moduleName True (Async.interleaved True))
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentOrdered.hs+2−2
@@ -9,7 +9,7 @@
9import Stream.ConcurrentCommon (allBenchmarks)
9import Stream.ConcurrentCommon (allBenchmarks)
10import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
10import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
11
11
12−import qualified Streamly.Internal.Data.Stream.Concurrent as Async
12+import qualified Streamly.Internal.Data.Stream.Prelude as Async
13
13
14moduleName :: String
14moduleName :: String
15moduleName = "Data.Stream.ConcurrentOrdered"
15moduleName = "Data.Stream.ConcurrentOrdered"
@@ -22,4 +22,4 @@ main :: IO ()
22main =
22main =
23 runWithCLIOpts
23 runWithCLIOpts
24 defaultStreamSize
24 defaultStreamSize
25− (allBenchmarks moduleName (Async.ordered True))
25+ (allBenchmarks moduleName False (Async.ordered True))
benchmark/Streamly/Benchmark/Data/Stream/Eliminate.hs+67−41
@@ -6,9 +6,11 @@
6
6
7{-# LANGUAGE CPP #-}
7{-# LANGUAGE CPP #-}
8{-# LANGUAGE FlexibleContexts #-}
8{-# LANGUAGE FlexibleContexts #-}
9+{-# LANGUAGE FlexibleInstances #-}
9{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE RankNTypes #-}
11{-# LANGUAGE RankNTypes #-}
11
12
13+{-# OPTIONS_GHC -Wno-orphans #-}
12#ifdef USE_PRELUDE
14#ifdef USE_PRELUDE
13{-# OPTIONS_GHC -Wno-deprecations #-}
15{-# OPTIONS_GHC -Wno-deprecations #-}
14#endif
16#endif
@@ -30,39 +32,41 @@ import System.Random (randomRIO)
30
32
31import qualified Data.Foldable as F
33import qualified Data.Foldable as F
32import qualified GHC.Exts as GHC
34import qualified GHC.Exts as GHC
35+import qualified Streamly.Internal.Data.Fold as Fold
33
36
34#ifdef INSPECTION
37#ifdef INSPECTION
35import GHC.Types (SPEC(..))
38import GHC.Types (SPEC(..))
36import Test.Inspection
39import Test.Inspection
37−
38−import qualified Streamly.Internal.Data.Stream.StreamD as D
40+import qualified Streamly.Internal.Data.Stream as D
39−#endif
40−import qualified Streamly.Internal.Data.Fold as Fold
41−#ifdef USE_PRELUDE
42−import qualified Streamly.Internal.Data.Stream.IsStream as S
43−#else
44−import qualified Streamly.Internal.Data.Stream as S
45#endif
41#endif
46
42
47−import Gauge
48−import Streamly.Internal.Data.Stream (Stream)
49#ifdef USE_PRELUDE
43#ifdef USE_PRELUDE
50import Streamly.Prelude (fromSerial)
44import Streamly.Prelude (fromSerial)
51import Streamly.Benchmark.Prelude
45import Streamly.Benchmark.Prelude
46+import qualified Streamly.Internal.Data.Stream.IsStream as S
47+import qualified Streamly.Internal.Data.Stream.IsStream as StreamK
52#else
48#else
53import Stream.Common
49import Stream.Common
54− ( sourceUnfoldr
50+import Streamly.Internal.Data.Stream (Stream)
55− , sourceUnfoldrM
51+import qualified Streamly.Internal.Data.Stream as S
56− , sourceUnfoldrAction
52+#ifdef USE_STREAMK
57− , benchIOSink
53+import Streamly.Internal.Data.StreamK (StreamK)
58− )
54+import qualified Streamly.Data.StreamK as StreamK
55+#else
56+import qualified Streamly.Internal.Data.Stream as StreamK
59#endif
57#endif
58+#endif
59+
60+import Test.Tasty.Bench
60import Streamly.Benchmark.Common
61import Streamly.Benchmark.Common
61import Prelude hiding (length, sum, or, and, any, all, notElem, elem, (!!),
62import Prelude hiding (length, sum, or, and, any, all, notElem, elem, (!!),
62 lookup, repeat, minimum, maximum, product, last, mapM_, init)
63 lookup, repeat, minimum, maximum, product, last, mapM_, init)
63import qualified Prelude
64import qualified Prelude
64
65
65#ifdef USE_PRELUDE
66#ifdef USE_PRELUDE
67+type Stream = S.SerialT
68+fromStream = id
69+
66{-# INLINE repeat #-}
70{-# INLINE repeat #-}
67repeat :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
71repeat :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
68repeat count = S.take count . S.repeat
72repeat count = S.take count . S.repeat
@@ -128,12 +132,14 @@ foldableAny :: Int -> Int -> Bool
128foldableAny value n =
132foldableAny value n =
129 Prelude.any (> (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
133 Prelude.any (> (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
130
134
135+{- HLINT ignore "Use all"-}
131{-# INLINE foldableAnd #-}
136{-# INLINE foldableAnd #-}
132foldableAnd :: Int -> Int -> Bool
137foldableAnd :: Int -> Int -> Bool
133foldableAnd value n =
138foldableAnd value n =
134 Prelude.and $ fmap
139 Prelude.and $ fmap
135 (<= (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
140 (<= (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
136
141
142+{- HLINT ignore "Use any"-}
137{-# INLINE foldableOr #-}
143{-# INLINE foldableOr #-}
138foldableOr :: Int -> Int -> Bool
144foldableOr :: Int -> Int -> Bool
139foldableOr value n =
145foldableOr value n =
@@ -211,6 +217,9 @@ o_1_space_elimination_foldable value =
211 , bench "minimum" $ nf (foldableMin value) 1
217 , bench "minimum" $ nf (foldableMin value) 1
212 , benchPureSink value "min (ord)" ordInstanceMin
218 , benchPureSink value "min (ord)" ordInstanceMin
213 , bench "maximum" $ nf (foldableMax value) 1
219 , 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
214 , bench "length . toList"
223 , bench "length . toList"
215 $ nf (Prelude.length . foldableToList value) 1
224 $ nf (Prelude.length . foldableToList value) 1
216 , bench "notElem" $ nf (foldableNotElem value) 1
225 , bench "notElem" $ nf (foldableNotElem value) 1
@@ -233,25 +242,16 @@ o_1_space_elimination_foldable value =
233 ]
242 ]
234 ]
243 ]
235
244
236−o_n_space_elimination_foldable :: Int -> [Benchmark]
237−o_n_space_elimination_foldable value =
238− -- Head recursive strict right folds.
239− [ bgroup "foldl"
240− -- XXX the definitions of minimumBy and maximumBy in Data.Foldable use
241− -- foldl1 which does not work in constant memory for our
242− -- implementation. It works in constant memory for lists but even for
243− -- lists it takes 15x more time compared to our foldl' based
244− -- implementation.
245− [ bench "minimumBy" $ nf (`foldableMinBy` 1) value
246− , bench "maximumBy" $ nf (`foldableMaxBy` 1) value
247− , bench "minimumByList" $ nf (`foldableListMinBy` 1) value
248− ]
249− ]
250−
251-------------------------------------------------------------------------------
245-------------------------------------------------------------------------------
252-- Stream folds
246-- Stream folds
253-------------------------------------------------------------------------------
247-------------------------------------------------------------------------------
254
248
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 #-}
255{-# INLINE benchPureSink #-}
256benchPureSink :: NFData b
256benchPureSink :: NFData b
257 => Int -> String -> (Stream Identity Int -> b) -> Benchmark
257 => Int -> String -> (Stream Identity Int -> b) -> Benchmark
@@ -277,9 +277,13 @@ benchIdentitySink value name f = bench name $ nf (f . sourceUnfoldr value) 1
277-------------------------------------------------------------------------------
277-------------------------------------------------------------------------------
278
278
279{-# INLINE uncons #-}
279{-# INLINE uncons #-}
280+#ifdef USE_STREAMK
281+uncons :: Monad m => StreamK m Int -> m ()
282+#else
280uncons :: Monad m => Stream m Int -> m ()
283uncons :: Monad m => Stream m Int -> m ()
284+#endif
281uncons s = do
285uncons s = do
282− r <- S.uncons s
286+ r <- StreamK.uncons s
283 case r of
287 case r of
284 Nothing -> return ()
288 Nothing -> return ()
285 Just (_, t) -> uncons t
289 Just (_, t) -> uncons t
@@ -304,9 +308,15 @@ foldrMElem e =
304 else xs)
308 else xs)
305 (return False)
309 (return False)
306
310
311+#ifdef USE_STREAMK
307{-# INLINE foldrToStream #-}
312{-# INLINE foldrToStream #-}
308−foldrToStream :: Monad m => Stream m Int -> m (Stream Identity Int)
313+foldrToStream :: Monad m => Stream m Int -> m (StreamK 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)
309−foldrToStream = S.foldr S.cons S.nil
318+-- foldrToStream = S.foldr S.cons S.nil
319+#endif
310
320
311{-# INLINE foldrMBuild #-}
321{-# INLINE foldrMBuild #-}
312foldrMBuild :: Monad m => Stream m Int -> m [Int]
322foldrMBuild :: Monad m => Stream m Int -> m [Int]
@@ -450,17 +460,34 @@ o_1_space_elimination_folds value =
450 ]
460 ]
451 , bgroup "Identity"
461 , bgroup "Identity"
452 [ benchIdentitySink value "foldrMElem" (foldrMElem value)
462 [ benchIdentitySink value "foldrMElem" (foldrMElem value)
463+#ifdef USE_STREAMK
453 , benchIdentitySink value "foldrToStreamLength"
464 , 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)"
454 (S.fold Fold.length . runIdentity . foldrToStream)
473 (S.fold Fold.length . runIdentity . foldrToStream)
474+ -}
475+#endif
476+ {-
477+ , benchPureSink 16 "foldrMToListLength (16)"
478+ (Prelude.length . runIdentity . foldrMBuild)
479+ -}
455 , benchPureSink value "foldrMToListLength"
480 , benchPureSink value "foldrMToListLength"
456 (Prelude.length . runIdentity . foldrMBuild)
481 (Prelude.length . runIdentity . foldrMBuild)
457 ]
482 ]
458 ]
483 ]
459
484
460 -- deconstruction
485 -- deconstruction
461− , benchIOSink value "uncons" uncons
486+ , benchIOSink value "uncons" (uncons . fromStream)
487+#ifndef USE_PRELUDE
462− , benchHoistSink value "length . generally"
488+ , benchHoistSink value "length . generalizeInner"
463− (S.fold Fold.length . S.generally)
489+ (S.fold Fold.length . S.generalizeInner)
490+#endif
464#ifdef USE_PRELUDE
491#ifdef USE_PRELUDE
465 , benchIOSink value "init" init
492 , benchIOSink value "init" init
466
493
@@ -581,8 +608,10 @@ o_n_space_elimination_toList value =
581 [ bgroup "toList"
608 [ bgroup "toList"
582 -- Converting the stream to a list or pure stream in a strict monad
609 -- Converting the stream to a list or pure stream in a strict monad
583 [ benchIOSink value "toList" S.toList
610 [ benchIOSink value "toList" S.toList
611+#ifndef USE_PRELUDE
584 , benchIOSink value "toStream"
612 , benchIOSink value "toStream"
585 (S.toStream :: (Stream IO Int -> IO (Stream Identity Int)))
613 (S.toStream :: (Stream IO Int -> IO (Stream Identity Int)))
614+#endif
586 ]
615 ]
587 ]
616 ]
588#endif
617#endif
@@ -712,11 +741,8 @@ benchmarks moduleName size =
712#ifdef USE_PRELUDE
741#ifdef USE_PRELUDE
713 ++ o_n_heap_elimination_foldl size
742 ++ o_n_heap_elimination_foldl size
714 ++ o_n_heap_elimination_toList size
743 ++ o_n_heap_elimination_toList size
715−#endif
716− , bgroup (o_n_space_prefix moduleName) $
717− o_n_space_elimination_foldable size
718−#ifdef USE_PRELUDE
719 ++ o_n_space_elimination_toList size
744 ++ o_n_space_elimination_toList size
720#endif
745#endif
746+ , bgroup (o_n_space_prefix moduleName) $
721− ++ o_n_space_elimination_foldr size
747+ o_n_space_elimination_foldr size
722 ]
748 ]
benchmark/Streamly/Benchmark/Data/Stream/Exceptions.hs+50−32
@@ -27,51 +27,65 @@ module Stream.Exceptions (benchmarks) where
27
27
28import Control.Exception (Exception, throwIO)
28import Control.Exception (Exception, throwIO)
29import Stream.Common (drain)
29import Stream.Common (drain)
30−import Streamly.Internal.Data.Stream (Stream)
31
30
32import qualified Data.IORef as Ref
31import qualified Data.IORef as Ref
33import qualified Data.Map.Strict as Map
32import qualified Data.Map.Strict as Map
34−import qualified Stream.Common as Common
35
33
36−#ifndef USE_STREAMLY_CORE
37import Control.Exception (SomeException)
34import Control.Exception (SomeException)
38import System.IO (Handle, hClose, hPutChar)
35import System.IO (Handle, hClose, hPutChar)
39import qualified Streamly.FileSystem.Handle as FH
36import qualified Streamly.FileSystem.Handle as FH
40import qualified Streamly.Internal.FileSystem.Handle as IFH
37import qualified Streamly.Internal.FileSystem.Handle as IFH
41import qualified Streamly.Internal.Data.Unfold as IUF
38import qualified Streamly.Internal.Data.Unfold as IUF
42−import qualified Streamly.Internal.Data.Unfold.Exception as IUF
39+import qualified Streamly.Internal.Data.Unfold.Prelude as IUF
43−#endif
44
40
45#ifdef USE_PRELUDE
41#ifdef USE_PRELUDE
46import qualified Streamly.Internal.Data.Stream.IsStream as Stream
42import qualified Streamly.Internal.Data.Stream.IsStream as Stream
47#else
43#else
48import qualified Streamly.Internal.Data.Stream as Stream
44import qualified Streamly.Internal.Data.Stream as Stream
49−import qualified Streamly.Internal.Data.Stream.Exception.Lifted as Stream
45+import qualified Streamly.Internal.Data.Stream.Prelude as Stream
50#endif
46#endif
51
47
52−import Gauge hiding (env)
48+import Test.Tasty.Bench hiding (env)
53import Prelude hiding (last, length)
49import Prelude hiding (last, length)
54import Streamly.Benchmark.Common
50import Streamly.Benchmark.Common
55import Streamly.Benchmark.Common.Handle
51import Streamly.Benchmark.Common.Handle
56
52
57#ifdef INSPECTION
53#ifdef INSPECTION
54+import Control.Monad.Catch (MonadCatch)
58import Test.Inspection
55import Test.Inspection
59
56
60−import qualified Streamly.Internal.Data.Stream.StreamD as D
57+import qualified Streamly.Internal.Data.Stream as D
61#endif
58#endif
62
59
63−-------------------------------------------------------------------------------
60+#ifdef USE_PRELUDE
64−-- stream exceptions
61+type Stream = Stream.SerialT
65−-------------------------------------------------------------------------------
62+toStreamD = Stream.toStream
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
66
71
67−{-# INLINE replicateM #-}
72+afterUnsafe :: IO b -> Stream IO a -> Stream IO a
68−replicateM :: Common.MonadAsync m => Int -> m a -> Stream m a
73+finallyUnsafe :: IO b -> Stream IO a -> Stream IO a
74+bracketUnsafe :: IO b -> (b -> IO c) -> (b -> Stream IO a) -> Stream IO a
69#ifdef USE_PRELUDE
75#ifdef USE_PRELUDE
70−replicateM = Stream.replicateM
76+afterUnsafe = Stream.after_
77+finallyUnsafe = Stream.finally_
78+bracketUnsafe = Stream.bracket_
71#else
79#else
72−replicateM n = Stream.sequence . Stream.replicate n
80+afterUnsafe = Stream.afterUnsafe
81+finallyUnsafe = Stream.finallyUnsafe
82+bracketUnsafe = Stream.bracketUnsafe
73#endif
83#endif
74
84
85+-------------------------------------------------------------------------------
86+-- stream exceptions
87+-------------------------------------------------------------------------------
88+
75data BenchException
89data BenchException
76 = BenchException1
90 = BenchException1
77 | BenchException2
91 | BenchException2
@@ -101,7 +115,7 @@ retryNone length from = do
101 where
115 where
102
116
103 source ref =
117 source ref =
104− replicateM (from + length)
118+ Stream.replicateM (from + length)
105 $ Ref.modifyIORef' ref (+ 1) >> Ref.readIORef ref
119 $ Ref.modifyIORef' ref (+ 1) >> Ref.readIORef ref
106
120
107retryAll :: Int -> Int -> IO ()
121retryAll :: Int -> Int -> IO ()
@@ -146,7 +160,6 @@ o_1_space_serial_exceptions length =
146 ]
160 ]
147
161
148-- XXX Move these to FileSystem.Handle benchmarks
162-- XXX Move these to FileSystem.Handle benchmarks
149−#ifndef USE_STREAMLY_CORE
150
163
151-------------------------------------------------------------------------------
164-------------------------------------------------------------------------------
152-- copy stream exceptions
165-- copy stream exceptions
@@ -165,7 +178,8 @@ inspect $ hasNoTypeClasses 'readWriteOnExceptionStream
165-- | Send the file contents to /dev/null with exception handling
178-- | Send the file contents to /dev/null with exception handling
166readWriteHandleExceptionStream :: Handle -> Handle -> IO ()
179readWriteHandleExceptionStream :: Handle -> Handle -> IO ()
167readWriteHandleExceptionStream inh devNull =
180readWriteHandleExceptionStream inh devNull =
181+ let handler (_e :: SomeException) =
168− let handler (_e :: SomeException) = Stream.fromEffect (hClose inh >> return 10)
182+ return $ Stream.fromEffect (hClose inh >> return 10)
169 readEx = Stream.handle handler (Stream.unfold FH.reader inh)
183 readEx = Stream.handle handler (Stream.unfold FH.reader inh)
170 in Stream.fold (FH.write devNull) readEx
184 in Stream.fold (FH.write devNull) readEx
171
185
@@ -177,7 +191,7 @@ inspect $ hasNoTypeClasses 'readWriteHandleExceptionStream
177readWriteFinally_Stream :: Handle -> Handle -> IO ()
191readWriteFinally_Stream :: Handle -> Handle -> IO ()
178readWriteFinally_Stream inh devNull =
192readWriteFinally_Stream inh devNull =
179 let readEx =
193 let readEx =
180− Stream.finallyUnsafe (hClose inh) (Stream.unfold FH.reader inh)
194+ finallyUnsafe (hClose inh) (Stream.unfold FH.reader inh)
181 in Stream.fold (FH.write devNull) readEx
195 in Stream.fold (FH.write devNull) readEx
182
196
183#ifdef INSPECTION
197#ifdef INSPECTION
@@ -192,9 +206,9 @@ readWriteFinallyStream inh devNull =
192-- | Send the file contents to /dev/null with exception handling
206-- | Send the file contents to /dev/null with exception handling
193fromToBytesBracket_Stream :: Handle -> Handle -> IO ()
207fromToBytesBracket_Stream :: Handle -> Handle -> IO ()
194fromToBytesBracket_Stream inh devNull =
208fromToBytesBracket_Stream inh devNull =
195− let readEx = Stream.bracketUnsafe (return ()) (\_ -> hClose inh)
209+ let readEx = bracketUnsafe (return ()) (\_ -> hClose inh)
196− (\_ -> IFH.read inh)
210+ (\_ -> fromStreamD $ IFH.read inh)
197− in IFH.putBytes devNull readEx
211+ in IFH.putBytes devNull (toStreamD readEx)
198
212
199#ifdef INSPECTION
213#ifdef INSPECTION
200inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
214inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
@@ -203,8 +217,8 @@ inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
203fromToBytesBracketStream :: Handle -> Handle -> IO ()
217fromToBytesBracketStream :: Handle -> Handle -> IO ()
204fromToBytesBracketStream inh devNull =
218fromToBytesBracketStream inh devNull =
205 let readEx = Stream.bracket (return ()) (\_ -> hClose inh)
219 let readEx = Stream.bracket (return ()) (\_ -> hClose inh)
206− (\_ -> IFH.read inh)
220+ (\_ -> fromStreamD $ IFH.read inh)
207− in IFH.putBytes devNull readEx
221+ in IFH.putBytes devNull (toStreamD readEx)
208
222
209readWriteBeforeAfterStream :: Handle -> Handle -> IO ()
223readWriteBeforeAfterStream :: Handle -> Handle -> IO ()
210readWriteBeforeAfterStream inh devNull =
224readWriteBeforeAfterStream inh devNull =
@@ -228,7 +242,7 @@ inspect $ 'readWriteAfterStream `hasNoType` ''D.Step
228
242
229readWriteAfter_Stream :: Handle -> Handle -> IO ()
243readWriteAfter_Stream :: Handle -> Handle -> IO ()
230readWriteAfter_Stream inh devNull =
244readWriteAfter_Stream inh devNull =
231− let readEx = Stream.afterUnsafe (hClose inh) (Stream.unfold FH.reader inh)
245+ let readEx = afterUnsafe (hClose inh) (Stream.unfold FH.reader inh)
232 in Stream.fold (FH.write devNull) readEx
246 in Stream.fold (FH.write devNull) readEx
233
247
234#ifdef INSPECTION
248#ifdef INSPECTION
@@ -273,8 +287,12 @@ readChunksOnException inh devNull =
273 in IUF.fold (IFH.writeChunks devNull) readEx inh
287 in IUF.fold (IFH.writeChunks devNull) readEx inh
274
288
275#ifdef INSPECTION
289#ifdef INSPECTION
290+#if __GLASGOW_HASKELL__ >= 906
291+inspect $ hasNoTypeClassesExcept 'readChunksOnException [''MonadCatch]
292+#else
276inspect $ hasNoTypeClasses 'readChunksOnException
293inspect $ hasNoTypeClasses 'readChunksOnException
277#endif
294#endif
295+#endif
278
296
279-- | Send the file contents to /dev/null with exception handling
297-- | Send the file contents to /dev/null with exception handling
280readChunksBracket_ :: Handle -> Handle -> IO ()
298readChunksBracket_ :: Handle -> Handle -> IO ()
@@ -283,8 +301,12 @@ readChunksBracket_ inh devNull =
283 in IUF.fold (IFH.writeChunks devNull) readEx inh
301 in IUF.fold (IFH.writeChunks devNull) readEx inh
284
302
285#ifdef INSPECTION
303#ifdef INSPECTION
304+#if __GLASGOW_HASKELL__ >= 906
305+inspect $ hasNoTypeClassesExcept 'readChunksBracket_ [''MonadCatch]
306+#else
286inspect $ hasNoTypeClasses 'readChunksBracket_
307inspect $ hasNoTypeClasses 'readChunksBracket_
287#endif
308#endif
309+#endif
288
310
289readChunksBracket :: Handle -> Handle -> IO ()
311readChunksBracket :: Handle -> Handle -> IO ()
290readChunksBracket inh devNull =
312readChunksBracket inh devNull =
@@ -310,10 +332,10 @@ o_1_space_copy_exceptions_readChunks env =
310-- | Send the file contents to /dev/null with exception handling
332-- | Send the file contents to /dev/null with exception handling
311toChunksBracket_ :: Handle -> Handle -> IO ()
333toChunksBracket_ :: Handle -> Handle -> IO ()
312toChunksBracket_ inh devNull =
334toChunksBracket_ inh devNull =
313− let readEx = Stream.bracketUnsafe
335+ let readEx = bracketUnsafe
314 (return ())
336 (return ())
315 (\_ -> hClose inh)
337 (\_ -> hClose inh)
316− (\_ -> IFH.readChunks inh)
338+ (\_ -> fromStreamD $ IFH.readChunks inh)
317 in Stream.fold (IFH.writeChunks devNull) readEx
339 in Stream.fold (IFH.writeChunks devNull) readEx
318
340
319#ifdef INSPECTION
341#ifdef INSPECTION
@@ -325,7 +347,7 @@ toChunksBracket inh devNull =
325 let readEx = Stream.bracket
347 let readEx = Stream.bracket
326 (return ())
348 (return ())
327 (\_ -> hClose inh)
349 (\_ -> hClose inh)
328− (\_ -> IFH.readChunks inh)
350+ (\_ -> fromStreamD $ IFH.readChunks inh)
329 in Stream.fold (IFH.writeChunks devNull) readEx
351 in Stream.fold (IFH.writeChunks devNull) readEx
330
352
331o_1_space_copy_exceptions_toChunks :: BenchEnv -> [Benchmark]
353o_1_space_copy_exceptions_toChunks :: BenchEnv -> [Benchmark]
@@ -338,16 +360,12 @@ o_1_space_copy_exceptions_toChunks env =
338 ]
360 ]
339 ]
361 ]
340
362
341−#endif
342−
343benchmarks :: String -> BenchEnv -> Int -> [Benchmark]
363benchmarks :: String -> BenchEnv -> Int -> [Benchmark]
344benchmarks moduleName _env size =
364benchmarks moduleName _env size =
345 [ bgroup (o_1_space_prefix moduleName) $ concat
365 [ bgroup (o_1_space_prefix moduleName) $ concat
346 [ o_1_space_serial_exceptions size
366 [ o_1_space_serial_exceptions size
347−#ifndef USE_STREAMLY_CORE
348 , o_1_space_copy_exceptions_readChunks _env
367 , o_1_space_copy_exceptions_readChunks _env
349 , o_1_space_copy_exceptions_toChunks _env
368 , o_1_space_copy_exceptions_toChunks _env
350 , o_1_space_copy_stream_exceptions _env
369 , o_1_space_copy_stream_exceptions _env
351−#endif
352 ]
370 ]
353 ]
371 ]
benchmark/Streamly/Benchmark/Data/Stream/Expand.hs+153−113
@@ -25,33 +25,37 @@
25
25
26module Stream.Expand (benchmarks) where
26module Stream.Expand (benchmarks) where
27
27
28−import Control.Monad.Trans.Class (lift)
29−import Streamly.Internal.Data.Stream (Stream)
30−
31−import qualified Control.Applicative as AP
32−
33#ifdef INSPECTION
28#ifdef INSPECTION
34import GHC.Types (SPEC(..))
29import GHC.Types (SPEC(..))
35import Test.Inspection
30import Test.Inspection
36
31
37−import qualified Streamly.Internal.Data.Stream.StreamD as D
32+import qualified Streamly.Internal.Data.Stream as D
38#endif
33#endif
39
34
40import qualified Stream.Common as Common
35import qualified Stream.Common as Common
36+import qualified Streamly.Internal.Data.Unfold as UF
37+
41#ifdef USE_PRELUDE
38#ifdef USE_PRELUDE
42import qualified Streamly.Internal.Data.Stream.IsStream as S
39import qualified Streamly.Internal.Data.Stream.IsStream as S
40+import qualified Streamly.Internal.Data.Stream.IsStream as StreamK
43import Streamly.Benchmark.Prelude
41import Streamly.Benchmark.Prelude
44 ( sourceFoldMapM, sourceFoldMapWith, sourceFoldMapWithM
42 ( sourceFoldMapM, sourceFoldMapWith, sourceFoldMapWithM
45 , sourceFoldMapWithStream, concatFoldableWith, concatForFoldableWith)
43 , sourceFoldMapWithStream, concatFoldableWith, concatForFoldableWith)
46#else
44#else
47import qualified Streamly.Internal.Data.Stream as S
45import qualified Streamly.Internal.Data.Stream as S
48−import qualified Streamly.Internal.Data.Stream.Extra as S
46+#ifdef USE_STREAMK
49−#endif
47+import Streamly.Internal.Data.Stream (Stream)
50−import qualified Streamly.Internal.Data.Unfold as UF
48+import Streamly.Internal.Data.StreamK (StreamK, CrossStreamK)
49+import qualified Control.Applicative as AP
51import qualified Streamly.Internal.Data.Fold as Fold
50import 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
52
56
53−import Gauge
57+import Test.Tasty.Bench
54−import Stream.Common hiding (append2)
58+import Stream.Common
55import Streamly.Benchmark.Common
59import Streamly.Benchmark.Common
56import Prelude hiding (concatMap)
60import Prelude hiding (concatMap)
57
61
@@ -59,6 +63,7 @@ import Prelude hiding (concatMap)
59-- Iteration/looping utilities
63-- Iteration/looping utilities
60-------------------------------------------------------------------------------
64-------------------------------------------------------------------------------
61
65
66+#ifdef USE_STREAMK
62{-# INLINE iterateN #-}
67{-# INLINE iterateN #-}
63iterateN :: (Int -> a -> a) -> a -> Int -> a
68iterateN :: (Int -> a -> a) -> a -> Int -> a
64iterateN g initial count = f count initial
69iterateN g initial count = f count initial
@@ -70,12 +75,16 @@ iterateN g initial count = f count initial
70
75
71-- Iterate a transformation over a singleton stream
76-- Iterate a transformation over a singleton stream
72{-# INLINE iterateSingleton #-}
77{-# INLINE iterateSingleton #-}
73−iterateSingleton :: Monad m
78+iterateSingleton :: Applicative m =>
74− => (Int -> Stream m Int -> Stream m Int)
79+ (Int -> CrossStreamK m Int -> CrossStreamK m Int)
75 -> Int
80 -> Int
76 -> Int
81 -> Int
77 -> Stream m Int
82 -> Stream m Int
78−iterateSingleton g count n = iterateN g (return n) count
83+iterateSingleton g count n =
84+ toStream
85+ $ StreamK.unCross
86+ $ iterateN g (StreamK.mkCross (StreamK.fromPure n)) count
87+#endif
79
88
80{-
89{-
81-- XXX need to check why this is slower than the explicit recursion above, even
90-- XXX need to check why this is slower than the explicit recursion above, even
@@ -104,50 +113,28 @@ _iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
104{-# INLINE serial2 #-}
113{-# INLINE serial2 #-}
105serial2 :: Int -> Int -> IO ()
114serial2 :: Int -> Int -> IO ()
106serial2 count n =
115serial2 count n =
107− drain $
116+ drain $ toStream $
117+ Common.append
118+ (fromStream $ sourceUnfoldrM count n)
108− Common.append (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
119+ (fromStream $ sourceUnfoldrM count (n + 1))
109
120
110{-# INLINE serial4 #-}
121{-# INLINE serial4 #-}
111serial4 :: Int -> Int -> IO ()
122serial4 :: Int -> Int -> IO ()
112serial4 count n =
123serial4 count n =
113− drain $
124+ drain $ toStream $
114 Common.append
125 Common.append
115− (Common.append (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1)))
116 (Common.append
126 (Common.append
117− (sourceUnfoldrM count (n + 2))
118− (sourceUnfoldrM count (n + 3)))
127+ (fromStream $ sourceUnfoldrM count n)
119−
120−{-# INLINE append2 #-}
121−append2 :: Int -> Int -> IO ()
122−append2 count n =
123− drain $
124− Common.append2 (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
128+ (fromStream $ sourceUnfoldrM count (n + 1)))
125−
126−{-# INLINE append4 #-}
127−append4 :: Int -> Int -> IO ()
128−append4 count n =
129− drain $
130− Common.append2
131− (Common.append2
129+ (Common.append
132− (sourceUnfoldrM count n)
133− (sourceUnfoldrM count (n + 1)))
130+ (fromStream $ sourceUnfoldrM count (n + 2))
134− (Common.append2
135− (sourceUnfoldrM count (n + 2))
136− (sourceUnfoldrM count (n + 3)))
131+ (fromStream $ sourceUnfoldrM count (n + 3)))
137−
138−#ifdef INSPECTION
139−inspect $ hasNoTypeClasses 'append2
140−inspect $ 'append2 `hasNoType` ''SPEC
141−inspect $ 'append2 `hasNoType` ''D.AppendState
142−#endif
143
132
144o_1_space_joining :: Int -> [Benchmark]
133o_1_space_joining :: Int -> [Benchmark]
145o_1_space_joining value =
134o_1_space_joining value =
146 [ bgroup "joining"
135 [ bgroup "joining"
147 [ benchIOSrc1 "serial (2,x/2)" (serial2 (value `div` 2))
136 [ benchIOSrc1 "serial (2,x/2)" (serial2 (value `div` 2))
148− , benchIOSrc1 "append (2,x/2)" (append2 (value `div` 2))
149 , benchIOSrc1 "serial (2,2,x/4)" (serial4 (value `div` 4))
137 , benchIOSrc1 "serial (2,2,x/4)" (serial4 (value `div` 4))
150− , benchIOSrc1 "append (2,2,x/4)" (append4 (value `div` 4))
151 ]
138 ]
152 ]
139 ]
153
140
@@ -183,10 +170,11 @@ o_1_space_concatFoldable value =
183{-# INLINE concatMap #-}
170{-# INLINE concatMap #-}
184concatMap :: Int -> Int -> Int -> IO ()
171concatMap :: Int -> Int -> Int -> IO ()
185concatMap outer inner n =
172concatMap outer inner n =
186− drain $ S.concatMap
173+ drain $ toStream $ StreamK.concatMap
187− (\_ -> sourceUnfoldrM inner n)
174+ (\_ -> fromStream $ sourceUnfoldrM inner n)
188− (sourceUnfoldrM outer n)
175+ (fromStream $ sourceUnfoldrM outer n)
189
176
177+#ifndef USE_STREAMK
190{-# INLINE concatMapM #-}
178{-# INLINE concatMapM #-}
191concatMapM :: Int -> Int -> Int -> IO ()
179concatMapM :: Int -> Int -> Int -> IO ()
192concatMapM outer inner n =
180concatMapM outer inner n =
@@ -198,18 +186,23 @@ concatMapM outer inner n =
198inspect $ hasNoTypeClasses 'concatMap
186inspect $ hasNoTypeClasses 'concatMap
199inspect $ 'concatMap `hasNoType` ''SPEC
187inspect $ 'concatMap `hasNoType` ''SPEC
200#endif
188#endif
189+#endif
201
190
202-- concatMap unfoldr/unfoldr
191-- concatMap unfoldr/unfoldr
203
192
204{-# INLINE concatMapPure #-}
193{-# INLINE concatMapPure #-}
205concatMapPure :: Int -> Int -> Int -> IO ()
194concatMapPure :: Int -> Int -> Int -> IO ()
206concatMapPure outer inner n =
195concatMapPure outer inner n =
207− drain $ S.concatMap
196+ drain $ toStream $ StreamK.concatMap
208− (\_ -> sourceUnfoldr inner n)
197+ (\_ -> fromStream $ sourceUnfoldr inner n)
209− (sourceUnfoldr outer n)
198+ (fromStream $ sourceUnfoldr outer n)
210
199
211#ifdef INSPECTION
200#ifdef INSPECTION
201+#if __GLASGOW_HASKELL__ >= 906
202+inspect $ hasNoTypeClassesExcept 'concatMapPure [''Applicative]
203+#else
212inspect $ hasNoTypeClasses 'concatMapPure
204inspect $ hasNoTypeClasses 'concatMapPure
205+#endif
213inspect $ 'concatMapPure `hasNoType` ''SPEC
206inspect $ 'concatMapPure `hasNoType` ''SPEC
214#endif
207#endif
215
208
@@ -218,15 +211,21 @@ inspect $ 'concatMapPure `hasNoType` ''SPEC
218{-# INLINE concatMapRepl #-}
211{-# INLINE concatMapRepl #-}
219concatMapRepl :: Int -> Int -> Int -> IO ()
212concatMapRepl :: Int -> Int -> Int -> IO ()
220concatMapRepl outer inner n =
213concatMapRepl outer inner n =
214+ drain $ toStream $ StreamK.concatMap
221− drain $ S.concatMap (S.replicate inner) (sourceUnfoldrM outer n)
215+ (fromStream . S.replicate inner) (fromStream $ sourceUnfoldrM outer n)
222
216
223#ifdef INSPECTION
217#ifdef INSPECTION
218+#if __GLASGOW_HASKELL__ >= 906
219+inspect $ hasNoTypeClassesExcept 'concatMapRepl [''Applicative]
220+#else
224inspect $ hasNoTypeClasses 'concatMapRepl
221inspect $ hasNoTypeClasses 'concatMapRepl
222+#endif
225inspect $ 'concatMapRepl `hasNoType` ''SPEC
223inspect $ 'concatMapRepl `hasNoType` ''SPEC
226#endif
224#endif
227
225
228-- concatMapWith
226-- concatMapWith
229
227
228+#ifdef USE_STREAMK
230{-# INLINE concatMapWithSerial #-}
229{-# INLINE concatMapWithSerial #-}
231concatMapWithSerial :: Int -> Int -> Int -> IO ()
230concatMapWithSerial :: Int -> Int -> Int -> IO ()
232concatMapWithSerial = concatStreamsWith Common.append
231concatMapWithSerial = concatStreamsWith Common.append
@@ -236,6 +235,7 @@ inspect $ hasNoTypeClasses 'concatMapWithSerial
236inspect $ 'concatMapWithSerial `hasNoType` ''SPEC
235inspect $ 'concatMapWithSerial `hasNoType` ''SPEC
237#endif
236#endif
238
237
238+{-
239{-# INLINE concatMapWithAppend #-}
239{-# INLINE concatMapWithAppend #-}
240concatMapWithAppend :: Int -> Int -> Int -> IO ()
240concatMapWithAppend :: Int -> Int -> Int -> IO ()
241concatMapWithAppend = concatStreamsWith Common.append2
241concatMapWithAppend = concatStreamsWith Common.append2
@@ -244,16 +244,20 @@ concatMapWithAppend = concatStreamsWith Common.append2
244inspect $ hasNoTypeClasses 'concatMapWithAppend
244inspect $ hasNoTypeClasses 'concatMapWithAppend
245inspect $ 'concatMapWithAppend `hasNoType` ''SPEC
245inspect $ 'concatMapWithAppend `hasNoType` ''SPEC
246#endif
246#endif
247+-}
247
248
248−-- concatPairWith
249+-- mergeMapWith
249
250
250−{-# INLINE concatPairWithSerial #-}
251+{-# INLINE mergeMapWithSerial #-}
251−concatPairWithSerial :: Int -> Int -> Int -> IO ()
252+mergeMapWithSerial :: Int -> Int -> Int -> IO ()
252−concatPairWithSerial = concatPairsWith Common.append
253+mergeMapWithSerial = mergeMapWith Common.append
253
254
254−{-# INLINE concatPairWithAppend #-}
255+{-
255−concatPairWithAppend :: Int -> Int -> Int -> IO ()
256+{-# INLINE mergeMapWithAppend #-}
256−concatPairWithAppend = concatPairsWith Common.append2
257+mergeMapWithAppend :: Int -> Int -> Int -> IO ()
258+mergeMapWithAppend = mergeMapWith Common.append2
259+-}
260+#endif
257
261
258-- unfoldMany
262-- unfoldMany
259
263
@@ -284,10 +288,6 @@ o_1_space_concat value = sqrtVal `seq`
284 , benchIOSrc1 "concatMapPure (1 of n)"
288 , benchIOSrc1 "concatMapPure (1 of n)"
285 (concatMapPure 1 value)
289 (concatMapPure 1 value)
286
290
287− -- This is for comparison with foldMapWith
288− , benchIOSrc "concatMapId (n of 1) (fromFoldable)"
289− (S.concatMap id . sourceConcatMapId value)
290−
291 , benchIOSrc1 "concatMap (n of 1)"
291 , benchIOSrc1 "concatMap (n of 1)"
292 (concatMap value 1)
292 (concatMap value 1)
293 , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
293 , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
@@ -295,16 +295,25 @@ o_1_space_concat value = sqrtVal `seq`
295 , benchIOSrc1 "concatMap (1 of n)"
295 , benchIOSrc1 "concatMap (1 of n)"
296 (concatMap 1 value)
296 (concatMap 1 value)
297
297
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+
298 , benchIOSrc1 "concatMapM (n of 1)"
303 , benchIOSrc1 "concatMapM (n of 1)"
299 (concatMapM value 1)
304 (concatMapM value 1)
300 , benchIOSrc1 "concatMapM (sqrt n of sqrt n)"
305 , benchIOSrc1 "concatMapM (sqrt n of sqrt n)"
301 (concatMapM sqrtVal sqrtVal)
306 (concatMapM sqrtVal sqrtVal)
302 , benchIOSrc1 "concatMapM (1 of n)"
307 , benchIOSrc1 "concatMapM (1 of n)"
303 (concatMapM 1 value)
308 (concatMapM 1 value)
309+#endif
304
310
311+#ifdef USE_STREAMK
312+ {-
305 -- This is for comparison with foldMapWith
313 -- This is for comparison with foldMapWith
306 , benchIOSrc "concatMapWithId (n of 1) (fromFoldable)"
314 , benchIOSrc "concatMapWithId (n of 1) (fromFoldable)"
307− (S.concatMapWith Common.append id . sourceConcatMapId value)
315+ (toStream . S.concatMapWith Common.append id . sourceConcatMapId value)
316+ -}
308
317
309 , benchIOSrc1 "concatMapWith (n of 1)"
318 , benchIOSrc1 "concatMapWith (n of 1)"
310 (concatMapWithSerial value 1)
319 (concatMapWithSerial value 1)
@@ -313,9 +322,12 @@ o_1_space_concat value = sqrtVal `seq`
313 , benchIOSrc1 "concatMapWith (1 of n)"
322 , benchIOSrc1 "concatMapWith (1 of n)"
314 (concatMapWithSerial 1 value)
323 (concatMapWithSerial 1 value)
315
324
325+ {-
316 -- quadratic with number of outer streams
326 -- quadratic with number of outer streams
317 , benchIOSrc1 "concatMapWithAppend (2 of n/2)"
327 , benchIOSrc1 "concatMapWithAppend (2 of n/2)"
318 (concatMapWithAppend 2 (value `div` 2))
328 (concatMapWithAppend 2 (value `div` 2))
329+ -}
330+#endif
319
331
320 -- concatMap vs unfoldMany
332 -- concatMap vs unfoldMany
321 , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
333 , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
@@ -329,31 +341,35 @@ o_1_space_concat value = sqrtVal `seq`
329
341
330 sqrtVal = round $ sqrt (fromIntegral value :: Double)
342 sqrtVal = round $ sqrt (fromIntegral value :: Double)
331
343
344+#ifdef USE_STREAMK
332−o_n_space_concat :: Int -> [Benchmark]
345+o_n_space_merge :: Int -> [Benchmark]
333−o_n_space_concat value = sqrtVal `seq`
346+o_n_space_merge value = sqrtVal `seq`
334 [ bgroup "concat"
347 [ bgroup "concat"
335 [
348 [
336− -------------------concatPairsWith-----------------
349+ -------------------mergeMapWith-----------------
337
350
338 -- Use large number of streams to check scalability
351 -- Use large number of streams to check scalability
339
352
340− benchIOSrc1 "concatPairWithSerial (n of 1)"
353+ benchIOSrc1 "mergeMapWithSerial (n of 1)"
341− (concatPairWithSerial value 1)
354+ (mergeMapWithSerial value 1)
342− , benchIOSrc1 "concatPairWithSerial (sqrtVal of sqrtVal)"
355+ , benchIOSrc1 "mergeMapWithSerial (sqrtVal of sqrtVal)"
343− (concatPairWithSerial sqrtVal sqrtVal)
356+ (mergeMapWithSerial sqrtVal sqrtVal)
344− , benchIOSrc1 "concatPairWithSerial (2 of n/2)"
357+ , benchIOSrc1 "mergeMapWithSerial (2 of n/2)"
345− (concatPairWithSerial 2 (value `div` 2))
358+ (mergeMapWithSerial 2 (value `div` 2))
346−
359+
360+ {-
347− , benchIOSrc1 "concatPairWithAppend (n of 1)"
361+ , benchIOSrc1 "mergeMapWithAppend (n of 1)"
348− (concatPairWithAppend value 1)
362+ (mergeMapWithAppend value 1)
349− , benchIOSrc1 "concatPairWithAppend (sqrtVal of sqrtVal)"
363+ , benchIOSrc1 "mergeMapWithAppend (sqrtVal of sqrtVal)"
350− (concatPairWithAppend sqrtVal sqrtVal)
364+ (mergeMapWithAppend sqrtVal sqrtVal)
365+ -}
351 ]
366 ]
352 ]
367 ]
353
368
354 where
369 where
355
370
356 sqrtVal = round $ sqrt (fromIntegral value :: Double)
371 sqrtVal = round $ sqrt (fromIntegral value :: Double)
372+#endif
357
373
358-------------------------------------------------------------------------------
374-------------------------------------------------------------------------------
359-- Applicative
375-- Applicative
@@ -369,9 +385,10 @@ o_1_space_applicative value =
369 ]
385 ]
370 ]
386 ]
371
387
388+#ifdef USE_STREAMK
372o_n_space_applicative :: Int -> [Benchmark]
389o_n_space_applicative :: Int -> [Benchmark]
373o_n_space_applicative value =
390o_n_space_applicative value =
374− [ bgroup "Applicative"
391+ [ bgroup "iterated"
375 [ benchIOSrc "(*>) (n times)" $
392 [ benchIOSrc "(*>) (n times)" $
376 iterateSingleton ((*>) . pure) value
393 iterateSingleton ((*>) . pure) value
377 , benchIOSrc "(<*) (n times)" $
394 , benchIOSrc "(<*) (n times)" $
@@ -382,6 +399,7 @@ o_n_space_applicative value =
382 iterateSingleton (AP.liftA2 (+) . pure) value
399 iterateSingleton (AP.liftA2 (+) . pure) value
383 ]
400 ]
384 ]
401 ]
402+#endif
385
403
386-------------------------------------------------------------------------------
404-------------------------------------------------------------------------------
387-- Monad
405-- Monad
@@ -405,30 +423,46 @@ o_1_space_monad value =
405 ]
423 ]
406 ]
424 ]
407
425
426+#ifdef USE_STREAMK
408-- This is a good benchmark but inefficient way to compute primes. As we see a
427-- This is a good benchmark but inefficient way to compute primes. As we see a
409-- new prime we keep appending a division filter for all the future numbers.
428-- new prime we keep appending a division filter for all the future numbers.
410{-# INLINE sieve #-}
429{-# INLINE sieve #-}
411−sieve :: Monad m => Stream m Int -> Stream m Int
430+sieve :: Monad m => StreamK m Int -> StreamK m Int
412−sieve s = do
431+sieve s = StreamK.concatEffect $ do
413− r <- lift $ S.uncons s
432+ r <- StreamK.uncons s
414 case r of
433 case r of
415 Just (prime, rest) ->
434 Just (prime, rest) ->
435+ -- XXX Use K.filter or rewrite to K.filter
416− prime `S.cons` sieve (S.filter (\n -> n `mod` prime /= 0) rest)
436+ let f = S.filter (\n -> n `mod` prime /= 0)
437+ in pure $ prime `StreamK.cons` sieve (fromStream $ f $ toStream rest)
417− Nothing -> S.nil
438+ Nothing -> pure StreamK.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
418
458
419o_n_space_monad :: Int -> [Benchmark]
459o_n_space_monad :: Int -> [Benchmark]
420o_n_space_monad value =
460o_n_space_monad value =
421 [ bgroup "Monad"
461 [ bgroup "Monad"
422− [ benchIOSrc "(>>) (n times)" $
423− iterateSingleton ((>>) . pure) value
424− , benchIOSrc "(>>=) (n times)" $
425− iterateSingleton (\x xs -> xs >>= \y -> return (x + y)) value
426− , benchIO "(>>=) (sqrt n x sqrt n) (toList)" $
462+ [ benchIO "(>>=) (sqrt n x sqrt n) (toList)" $
427 toListM value
463 toListM value
428 , benchIO "(>>=) (sqrt n x sqrt n) (toListSome)" $
464 , benchIO "(>>=) (sqrt n x sqrt n) (toListSome)" $
429 toListSome value
465 toListSome value
430− , benchIO "naive prime sieve (n/4)"
431− (\n -> S.fold Fold.sum $ sieve $ S.enumerateFromTo 2 (value `div` 4 + n))
432 ]
466 ]
433 ]
467 ]
434
468
@@ -436,6 +470,7 @@ o_n_space_monad value =
436-- Joining
470-- Joining
437-------------------------------------------------------------------------------
471-------------------------------------------------------------------------------
438
472
473+{-
439toKv :: Int -> (Int, Int)
474toKv :: Int -> (Int, Int)
440toKv p = (p, p)
475toKv p = (p, p)
441
476
@@ -464,22 +499,22 @@ o_n_heap_buffering :: Int -> [Benchmark]
464o_n_heap_buffering value =
499o_n_heap_buffering value =
465 [ bgroup "buffered"
500 [ bgroup "buffered"
466 [
501 [
467− benchIOSrc1 "joinInner (sqrtVal)"
502+ benchIOSrc1 "joinInnerGeneric (sqrtVal)"
468− $ joinWith S.joinInner sqrtVal
503+ $ joinWith S.joinInnerGeneric sqrtVal
469− , benchIOSrc1 "joinInnerMap"
504+ , benchIOSrc1 "joinInner"
470− $ joinMapWith S.joinInnerMap halfVal
505+ $ joinMapWith S.joinInner halfVal
471− , benchIOSrc1 "joinLeft (sqrtVal)"
506+ , benchIOSrc1 "joinLeftGeneric (sqrtVal)"
472− $ joinWith S.joinLeft sqrtVal
507+ $ joinWith S.joinLeftGeneric sqrtVal
473− , benchIOSrc1 "joinLeftMap "
508+ , benchIOSrc1 "joinLeft "
474− $ joinMapWith S.joinLeftMap halfVal
509+ $ joinMapWith S.joinLeft halfVal
475− , benchIOSrc1 "joinOuter (sqrtVal)"
510+ , benchIOSrc1 "joinOuterGeneric (sqrtVal)"
476− $ joinWith S.joinOuter sqrtVal
511+ $ joinWith S.joinOuterGeneric sqrtVal
477− , benchIOSrc1 "joinOuterMap"
512+ , benchIOSrc1 "joinOuter"
478− $ joinMapWith S.joinOuterMap halfVal
513+ $ joinMapWith S.joinOuter halfVal
479− , benchIOSrc1 "intersectBy (sqrtVal)"
514+ , benchIOSrc1 "filterInStreamGenericBy (sqrtVal)"
480− $ joinWith S.intersectBy sqrtVal
515+ $ joinWith S.filterInStreamGenericBy sqrtVal
481− , benchIOSrc1 "intersectBySorted"
516+ , benchIOSrc1 "filterInStreamAscBy"
482− $ joinMapWith (S.intersectBySorted compare) halfVal
517+ $ joinMapWith (S.filterInStreamAscBy compare) halfVal
483 ]
518 ]
484 ]
519 ]
485
520
@@ -487,6 +522,7 @@ o_n_heap_buffering value =
487
522
488 halfVal = value `div` 2
523 halfVal = value `div` 2
489 sqrtVal = round $ sqrt (fromIntegral value :: Double)
524 sqrtVal = round $ sqrt (fromIntegral value :: Double)
525+-}
490
526
491-------------------------------------------------------------------------------
527-------------------------------------------------------------------------------
492-- Main
528-- Main
@@ -495,6 +531,7 @@ o_n_heap_buffering value =
495-- In addition to gauge options, the number of elements in the stream can be
531-- In addition to gauge options, the number of elements in the stream can be
496-- passed using the --stream-size option.
532-- passed using the --stream-size option.
497--
533--
534+{-# ANN benchmarks "HLint: ignore" #-}
498benchmarks :: String -> Int -> [Benchmark]
535benchmarks :: String -> Int -> [Benchmark]
499benchmarks moduleName size =
536benchmarks moduleName size =
500 [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
537 [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
@@ -505,19 +542,22 @@ benchmarks moduleName size =
505 , o_1_space_concatFoldable size
542 , o_1_space_concatFoldable size
506#endif
543#endif
507 , o_1_space_concat size
544 , o_1_space_concat size
508−
509 , o_1_space_applicative size
545 , o_1_space_applicative size
510 , o_1_space_monad size
546 , o_1_space_monad size
511−
512 ]
547 ]
513 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
548 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
514 [
549 [
515 -- multi-stream
550 -- multi-stream
551+ o_n_space_monad size
552+#ifdef USE_STREAMK
553+ , o_n_space_merge size
554+ , o_n_space_iterated size
516− o_n_space_applicative size
555+ , o_n_space_applicative size
517− , o_n_space_monad size
556+#endif
518− , o_n_space_concat size
519 ]
557 ]
558+ {-
520 , bgroup (o_n_heap_prefix moduleName) $
559 , bgroup (o_n_heap_prefix moduleName) $
521 -- multi-stream
560 -- multi-stream
522 o_n_heap_buffering size
561 o_n_heap_buffering size
562+ -}
523 ]
563 ]
benchmark/Streamly/Benchmark/Data/Stream/Generate.hs+52−25
@@ -6,39 +6,43 @@
6
6
7{-# LANGUAGE CPP #-}
7{-# LANGUAGE CPP #-}
8{-# LANGUAGE FlexibleContexts #-}
8{-# LANGUAGE FlexibleContexts #-}
9+{-# LANGUAGE FlexibleInstances #-}
9{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE RankNTypes #-}
11{-# LANGUAGE RankNTypes #-}
11
12
13+{-# OPTIONS_GHC -Wno-orphans #-}
12#ifdef USE_PRELUDE
14#ifdef USE_PRELUDE
13{-# OPTIONS_GHC -Wno-deprecations #-}
15{-# OPTIONS_GHC -Wno-deprecations #-}
14#endif
16#endif
15
17
16module Stream.Generate (benchmarks) where
18module Stream.Generate (benchmarks) where
17
19
20+import Control.DeepSeq (NFData(..))
18−import Data.Functor.Identity (Identity)
21+import Data.Functor.Identity (Identity(..))
19
22
20import qualified GHC.Exts as GHC
23import qualified GHC.Exts as GHC
21−import qualified Stream.Common as Common
24+import qualified Streamly.Internal.Data.Fold as Fold
25+
22#ifdef USE_PRELUDE
26#ifdef USE_PRELUDE
27+import Streamly.Prelude (MonadAsync)
28+import Stream.Common hiding (MonadAsync)
23import Streamly.Benchmark.Prelude (sourceFromFoldableM, absTimes)
29import Streamly.Benchmark.Prelude (sourceFromFoldableM, absTimes)
24import qualified Streamly.Prelude as S
30import qualified Streamly.Prelude as S
25import qualified Streamly.Internal.Data.Stream.IsStream as Stream
31import qualified Streamly.Internal.Data.Stream.IsStream as Stream
26#else
32#else
33+import Stream.Common
34+import Streamly.Internal.Data.Stream (Stream)
27import qualified Streamly.Internal.Data.Stream as Stream
35import 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
28#endif
40#endif
29−import qualified Prelude
30−
31−import Gauge
32−import Streamly.Benchmark.Common
33−import Streamly.Internal.Data.Stream (Stream)
34−#ifdef USE_PRELUDE
35−import Streamly.Prelude (MonadAsync)
36−import Stream.Common hiding (MonadAsync)
37−#else
38−import Stream.Common
39#endif
41#endif
40
42
41−import System.IO.Unsafe (unsafeInterleaveIO)
43+import Test.Tasty.Bench
44+import Streamly.Benchmark.Common
45+import qualified Prelude
42
46
43import Prelude hiding (repeat, replicate, iterate)
47import Prelude hiding (repeat, replicate, iterate)
44
48
@@ -46,6 +50,14 @@ import Prelude hiding (repeat, replicate, iterate)
46-- Generation
50-- Generation
47-------------------------------------------------------------------------------
51-------------------------------------------------------------------------------
48
52
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+
49-------------------------------------------------------------------------------
61-------------------------------------------------------------------------------
50-- fromList
62-- fromList
51-------------------------------------------------------------------------------
63-------------------------------------------------------------------------------
@@ -152,15 +164,15 @@ iterate count = Stream.take count . Stream.iterate (+1)
152iterateM :: MonadAsync m => Int -> Int -> Stream m Int
164iterateM :: MonadAsync m => Int -> Int -> Stream m Int
153iterateM count = Stream.take count . Stream.iterateM (return . (+1)) . return
165iterateM count = Stream.take count . Stream.iterateM (return . (+1)) . return
154
166
155−#ifdef USE_PRELUDE
156{-# INLINE repeatM #-}
167{-# INLINE repeatM #-}
157−repeatM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
168+repeatM :: MonadAsync m => Int -> Int -> Stream m Int
158−repeatM count = S.take count . S.repeatM . return
169+repeatM count = Stream.take count . Stream.repeatM . return
159
170
160{-# INLINE replicateM #-}
171{-# INLINE replicateM #-}
161−replicateM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
172+replicateM :: MonadAsync m => Int -> Int -> Stream m Int
162−replicateM count = S.replicateM count . return
173+replicateM count = Stream.replicateM count . return
163
174
175+#ifdef USE_PRELUDE
164{-# INLINE fromIndices #-}
176{-# INLINE fromIndices #-}
165fromIndices :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
177fromIndices :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
166fromIndices value n = S.take value $ S.fromIndices (+ n)
178fromIndices value n = S.take value $ S.fromIndices (+ n)
@@ -170,15 +182,17 @@ fromIndicesM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
170fromIndicesM value n = S.take value $ S.fromIndicesM (return <$> (+ n))
182fromIndicesM value n = S.take value $ S.fromIndicesM (return <$> (+ n))
171#endif
183#endif
172
184
185+#ifdef USE_STREAMK
173{-# INLINE mfixUnfold #-}
186{-# INLINE mfixUnfold #-}
174mfixUnfold :: Int -> Int -> Stream IO (Int, Int)
187mfixUnfold :: Int -> Int -> Stream IO (Int, Int)
175−mfixUnfold count start = Stream.mfix f
188+mfixUnfold count start = toStream $ StreamK.mfix f
176 where
189 where
177− f action = do
190+ f action = StreamK.unCross $ do
178 let incr n act = fmap ((+n) . snd) $ unsafeInterleaveIO act
191 let incr n act = fmap ((+n) . snd) $ unsafeInterleaveIO act
179− x <- Common.fromListM [incr 1 action, incr 2 action]
192+ x <- StreamK.mkCross (fromStream $ Common.fromListM [incr 1 action, incr 2 action])
180− y <- Common.sourceUnfoldr count start
193+ y <- StreamK.mkCross (fromStream $ Common.sourceUnfoldr count start)
181 return (x, y)
194 return (x, y)
195+#endif
182
196
183o_1_space_generation :: Int -> [Benchmark]
197o_1_space_generation :: Int -> [Benchmark]
184o_1_space_generation value =
198o_1_space_generation value =
@@ -196,34 +210,47 @@ o_1_space_generation value =
196 , benchIOSrc "fracFromTo" (sourceFracFromTo value)
210 , benchIOSrc "fracFromTo" (sourceFracFromTo value)
197 , benchIOSrc "fromList" (sourceFromList value)
211 , benchIOSrc "fromList" (sourceFromList value)
198 , benchIOSrc "fromListM" (sourceFromListM value)
212 , benchIOSrc "fromListM" (sourceFromListM value)
199− , benchPureSrc "IsList.fromList" (sourceIsList value)
213+ , benchPureSrc "IsList.fromList" (toStreamD . sourceIsList value)
200− , benchPureSrc "IsString.fromString" (sourceIsString value)
214+ , benchPureSrc "IsString.fromString" (toStreamD . sourceIsString value)
201 , benchIOSrc "enumerateFrom" (enumerateFrom value)
215 , benchIOSrc "enumerateFrom" (enumerateFrom value)
202 , benchIOSrc "enumerateFromTo" (enumerateFromTo value)
216 , benchIOSrc "enumerateFromTo" (enumerateFromTo value)
203 , benchIOSrc "enumerateFromThen" (enumerateFromThen value)
217 , benchIOSrc "enumerateFromThen" (enumerateFromThen value)
204 , benchIOSrc "enumerateFromThenTo" (enumerateFromThenTo value)
218 , benchIOSrc "enumerateFromThenTo" (enumerateFromThenTo value)
205 , benchIOSrc "enumerate" (enumerate value)
219 , benchIOSrc "enumerate" (enumerate value)
206 , benchIOSrc "enumerateTo" (enumerateTo value)
220 , benchIOSrc "enumerateTo" (enumerateTo value)
207−#ifdef USE_PRELUDE
208 , benchIOSrc "repeatM" (repeatM value)
221 , benchIOSrc "repeatM" (repeatM value)
209 , benchIOSrc "replicateM" (replicateM value)
222 , benchIOSrc "replicateM" (replicateM value)
223+#ifdef USE_PRELUDE
210 , benchIOSrc "fromIndices" (fromIndices value)
224 , benchIOSrc "fromIndices" (fromIndices value)
211 , benchIOSrc "fromIndicesM" (fromIndicesM value)
225 , benchIOSrc "fromIndicesM" (fromIndicesM value)
212#endif
226#endif
213
227
214 -- These essentially test cons and consM
228 -- These essentially test cons and consM
229+#ifdef USE_STREAMK
215 , benchIOSrc "fromFoldable" (sourceFromFoldable value)
230 , benchIOSrc "fromFoldable" (sourceFromFoldable value)
231+ -- , benchIOSrc "fromFoldable 16" (sourceFromFoldable 16)
232+#else
233+ -- , benchIOSrc "fromFoldable 16" (sourceFromFoldable 16)
234+#endif
216
235
217#ifdef USE_PRELUDE
236#ifdef USE_PRELUDE
218 , benchIOSrc "fromFoldableM" (sourceFromFoldableM value)
237 , benchIOSrc "fromFoldableM" (sourceFromFoldableM value)
219 , benchIOSrc "absTimes" $ absTimes value
238 , benchIOSrc "absTimes" $ absTimes value
220#endif
239#endif
240+#ifdef USE_STREAMK
221 , Common.benchIOSrc "mfix_10" (mfixUnfold 10)
241 , Common.benchIOSrc "mfix_10" (mfixUnfold 10)
222 , Common.benchIOSrc "mfix_100" (mfixUnfold 100)
242 , Common.benchIOSrc "mfix_100" (mfixUnfold 100)
223 , Common.benchIOSrc "mfix_1000" (mfixUnfold 1000)
243 , Common.benchIOSrc "mfix_1000" (mfixUnfold 1000)
244+#endif
224 ]
245 ]
225 ]
246 ]
226
247
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+
227o_n_heap_generation :: Int -> [Benchmark]
254o_n_heap_generation :: Int -> [Benchmark]
228o_n_heap_generation value =
255o_n_heap_generation value =
229 [ bgroup "buffered"
256 [ bgroup "buffered"
benchmark/Streamly/Benchmark/Data/Stream/Lift.hs+34−33
@@ -16,27 +16,35 @@
16module Stream.Lift (benchmarks) where
16module Stream.Lift (benchmarks) where
17
17
18import Control.DeepSeq (NFData(..))
18import Control.DeepSeq (NFData(..))
19−import Control.Monad.Trans.Class (lift)
20−import Control.Monad.State.Strict (StateT, get, put, MonadState)
19+import Control.Monad.State.Strict (StateT, get, put)
21import Data.Functor.Identity (Identity)
20import Data.Functor.Identity (Identity)
22−import Stream.Common
23− (benchIO, sourceUnfoldr, sourceUnfoldrM, benchIOSrc, drain)
21+import Stream.Common (sourceUnfoldr, sourceUnfoldrM, benchIOSrc)
24import System.Random (randomRIO)
22import System.Random (randomRIO)
23+
24+import qualified Stream.Common as Common
25+import qualified Streamly.Internal.Data.Fold as Fold
26+
25#ifdef USE_PRELUDE
27#ifdef USE_PRELUDE
26import qualified Streamly.Internal.Data.Stream.IsStream as Stream
28import qualified Streamly.Internal.Data.Stream.IsStream as Stream
27#else
29#else
30+import Streamly.Internal.Data.Stream (Stream)
28import qualified Streamly.Internal.Data.Stream as Stream
31import qualified Streamly.Internal.Data.Stream as Stream
29−#endif
32+#ifdef USE_STREAMK
30−import qualified Streamly.Internal.Data.Fold as Fold
31−import qualified Stream.Common as Common
33+import Stream.Common (benchIO, drain)
34+import Streamly.Internal.Data.StreamK (StreamK)
35+import qualified Streamly.Internal.Data.StreamK as StreamK
32import qualified Control.Monad.State.Strict as State
36import qualified Control.Monad.State.Strict as State
37+#endif
38+#endif
33
39
34−import Gauge
40+import Test.Tasty.Bench
35−import Streamly.Internal.Data.Stream (Stream)
36import Streamly.Benchmark.Common
41import Streamly.Benchmark.Common
37−
38import Prelude hiding (reverse, tail)
42import Prelude hiding (reverse, tail)
39
43
44+#ifdef USE_PRELUDE
45+type Stream = Stream.SerialT
46+#endif
47+
40-------------------------------------------------------------------------------
48-------------------------------------------------------------------------------
41-- Monad transformation (hoisting etc.)
49-- Monad transformation (hoisting etc.)
42-------------------------------------------------------------------------------
50-------------------------------------------------------------------------------
@@ -77,11 +85,15 @@ o_1_space_hoisting value =
77 [ bgroup "hoisting"
85 [ bgroup "hoisting"
78 [ benchIOSrc "evalState" (evalStateT value)
86 [ benchIOSrc "evalState" (evalStateT value)
79 , benchIOSrc "withState" (withState value)
87 , benchIOSrc "withState" (withState value)
88+#ifndef USE_PRELUDE
80− , benchHoistSink value "generally"
89+ , benchHoistSink value "generalizeInner"
81− ((\xs -> Stream.fold Fold.length xs :: IO Int) . Stream.generally)
90+ ((\xs -> Stream.fold Fold.length xs :: IO Int)
91+ . Stream.generalizeInner)
92+#endif
82 ]
93 ]
83 ]
94 ]
84
95
96+#ifdef USE_STREAMK
85{-# INLINE iterateStateIO #-}
97{-# INLINE iterateStateIO #-}
86iterateStateIO ::
98iterateStateIO ::
87 Monad m
99 Monad m
@@ -95,29 +107,17 @@ iterateStateIO n = do
95 iterateStateIO n
107 iterateStateIO n
96 else return x
108 else return x
97
109
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.
98{-# INLINE iterateStateT #-}
112{-# INLINE iterateStateT #-}
99−iterateStateT :: Int -> Stream (StateT Int IO) Int
113+iterateStateT :: Int -> StreamK (StateT Int IO) Int
100−iterateStateT n = do
114+iterateStateT n = StreamK.concatEffect $ do
101− x <- lift get
102− if x > n
103− then do
104− lift $ put (x - 1)
105− iterateStateT n
106− else return x
107−
108−{-# INLINE iterateState #-}
109−{-# SPECIALIZE iterateState :: Int -> Stream (StateT Int IO) Int #-}
110−iterateState ::
111− MonadState Int m
112− => Int
113− -> Stream m Int
114−iterateState n = do
115 x <- get
115 x <- get
116 if x > n
116 if x > n
117 then do
117 then do
118 put (x - 1)
118 put (x - 1)
119− iterateState n
119+ return $ iterateStateT n
120− else return x
120+ else return $ StreamK.fromPure x
121
121
122o_n_heap_transformer :: Int -> [Benchmark]
122o_n_heap_transformer :: Int -> [Benchmark]
123o_n_heap_transformer value =
123o_n_heap_transformer value =
@@ -125,11 +125,10 @@ o_n_heap_transformer value =
125 [ benchIO "StateT Int IO (n times) (baseline)" $ \n ->
125 [ benchIO "StateT Int IO (n times) (baseline)" $ \n ->
126 State.evalStateT (iterateStateIO n) value
126 State.evalStateT (iterateStateIO n) value
127 , benchIO "Stream (StateT Int IO) (n times)" $ \n ->
127 , benchIO "Stream (StateT Int IO) (n times)" $ \n ->
128− State.evalStateT (drain (iterateStateT n)) value
128+ State.evalStateT (drain $ Common.toStream (iterateStateT n)) value
129− , benchIO "MonadState Int m => Stream m Int" $ \n ->
130− State.evalStateT (drain (iterateState n)) value
131 ]
129 ]
132 ]
130 ]
131+#endif
133
132
134-------------------------------------------------------------------------------
133-------------------------------------------------------------------------------
135-- Main
134-- Main
@@ -141,5 +140,7 @@ o_n_heap_transformer value =
141benchmarks :: String -> Int -> [Benchmark]
140benchmarks :: String -> Int -> [Benchmark]
142benchmarks moduleName size =
141benchmarks moduleName size =
143 [ bgroup (o_1_space_prefix moduleName) (o_1_space_hoisting size)
142 [ 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)
144 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_transformer size)
145+#endif
145 ]
146 ]
benchmark/Streamly/Benchmark/Data/Stream/Reduce.hs+165−119
@@ -21,17 +21,21 @@ import Control.DeepSeq (NFData(..))
21import Control.Monad.IO.Class (MonadIO(..))
21import Control.Monad.IO.Class (MonadIO(..))
22import Data.Monoid (Sum(..))
22import Data.Monoid (Sum(..))
23import GHC.Generics (Generic)
23import GHC.Generics (Generic)
24−import Streamly.Internal.Data.Stream (Stream)
25
24
26import qualified Streamly.Internal.Data.Refold.Type as Refold
25import qualified Streamly.Internal.Data.Refold.Type as Refold
27import qualified Streamly.Internal.Data.Fold as FL
26import qualified Streamly.Internal.Data.Fold as FL
28import qualified Stream.Common as Common
27import qualified Stream.Common as Common
29−#ifdef USE_PRELUDE
28+
30−import Control.Monad (when)
29+#ifndef USE_STREAMLY_CORE
31−import Data.Proxy (Proxy(..))
32import Data.HashMap.Strict (HashMap)
30import Data.HashMap.Strict (HashMap)
31+import Data.Proxy (Proxy(..))
33import Streamly.Internal.Data.IsMap.HashMap ()
32import Streamly.Internal.Data.IsMap.HashMap ()
33+#endif
34+
35+#ifdef USE_PRELUDE
36+import Control.Monad (when)
34import qualified Streamly.Internal.Data.Stream.IsStream as S
37import qualified Streamly.Internal.Data.Stream.IsStream as S
38+import qualified Streamly.Prelude as S
35import Streamly.Prelude (fromSerial)
39import Streamly.Prelude (fromSerial)
36import Streamly.Benchmark.Prelude hiding
40import Streamly.Benchmark.Prelude hiding
37 ( benchIO, benchIOSrc, sourceUnfoldrM, apDiscardFst, apDiscardSnd, apLiftA2
41 ( benchIO, benchIOSrc, sourceUnfoldrM, apDiscardFst, apDiscardSnd, apLiftA2
@@ -39,53 +43,50 @@ import Streamly.Benchmark.Prelude hiding
39 , filterSome, breakAfterSome, toListM, toListSome, transformMapM
43 , filterSome, breakAfterSome, toListM, toListSome, transformMapM
40 , transformComposeMapM, transformTeeMapM, transformZipMapM)
44 , transformComposeMapM, transformTeeMapM, transformZipMapM)
41#else
45#else
46+
47+import Streamly.Internal.Data.Stream (Stream)
42import qualified Streamly.Internal.Data.Stream as S
48import 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
43#endif
52#endif
44
53
45−import Gauge
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
63+
64+import Test.Tasty.Bench
46import Streamly.Benchmark.Common
65import Streamly.Benchmark.Common
47import Stream.Common
66import Stream.Common
48import Prelude hiding (reverse, tail)
67import Prelude hiding (reverse, tail)
49
68
50−-------------------------------------------------------------------------------
69+#ifdef USE_PRELUDE
51−-- Iteration/looping utilities
70+type Stream = S.SerialT
52−-------------------------------------------------------------------------------
71+#endif
53−
54−{-# INLINE iterateN #-}
55−iterateN :: (Int -> a -> a) -> a -> Int -> a
56−iterateN g initial count = f count initial
57−
58− where
59−
60− f (0 :: Int) x = x
61− f i x = f (i - 1) (g i x)
62
72
63−-- Iterate a transformation over a singleton stream
73+-- Apply transformation g count times on a stream of length len
64−{-# INLINE iterateSingleton #-}
74+#ifdef USE_STREAMK
65−iterateSingleton :: Monad m
75+{-# INLINE iterateSource #-}
66− => (Int -> Stream m Int -> Stream m Int)
76+iterateSource ::
67− -> Int
77+ MonadAsync m
78+ => (StreamK m Int -> StreamK m Int)
68 -> Int
79 -> Int
69− -> Stream m Int
70−iterateSingleton g count n = iterateN g (return n) count
71−
72−{-
73−-- XXX need to check why this is slower than the explicit recursion above, even
74−-- if the above code is written in a foldr like head recursive way. We also
75−-- need to try this with foldlM' once #150 is fixed.
76−-- However, it is perhaps best to keep the iteration benchmarks independent of
77−-- foldrM and any related fusion issues.
78−{-# INLINE _iterateSingleton #-}
79−_iterateSingleton ::
80− Monad m
81− => (Int -> Stream m Int -> Stream m Int)
82 -> Int
80 -> Int
83 -> Int
81 -> Int
84− -> Stream m Int
82+ -> StreamK m Int
85−_iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
83+iterateSource g count len n = f count (fromStream $ sourceUnfoldrM len n)
86−-}
87
84
88−-- Apply transformation g count times on a stream of length len
85+ where
86+
87+ f (0 :: Int) stream = stream
88+ f i stream = f (i - 1) (g stream)
89+#else
89{-# INLINE iterateSource #-}
90{-# INLINE iterateSource #-}
90iterateSource ::
91iterateSource ::
91 MonadAsync m
92 MonadAsync m
@@ -100,57 +101,56 @@ iterateSource g count len n = f count (sourceUnfoldrM len n)
100
101
101 f (0 :: Int) stream = stream
102 f (0 :: Int) stream = stream
102 f i stream = f (i - 1) (g stream)
103 f i stream = f (i - 1) (g stream)
103−
104+#endif
104−-------------------------------------------------------------------------------
105−-- Functor
106−-------------------------------------------------------------------------------
107−
108−o_n_space_functor :: Int -> [Benchmark]
109−o_n_space_functor value =
110− [ bgroup "Functor"
111− [ benchIO "(+) (n times) (baseline)" $ \i0 ->
112− iterateN (\i acc -> acc >>= \n -> return $ i + n) (return i0) value
113− , benchIOSrc "(<$) (n times)" $
114− iterateSingleton (<$) value
115− , benchIOSrc "fmap (n times)" $
116− iterateSingleton (fmap . (+)) value
117− {-
118− , benchIOSrc fromSerial "_(<$) (n times)" $
119− _iterateSingleton (<$) value
120− , benchIOSrc fromSerial "_fmap (n times)" $
121− _iterateSingleton (fmap . (+)) value
122− -}
123− ]
124− ]
125
105
126-------------------------------------------------------------------------------
106-------------------------------------------------------------------------------
127-- Grouping transformations
107-- Grouping transformations
128-------------------------------------------------------------------------------
108-------------------------------------------------------------------------------
129
109
130−#ifdef USE_PRELUDE
131{-# INLINE groups #-}
110{-# INLINE groups #-}
132groups :: MonadIO m => Stream m Int -> m ()
111groups :: MonadIO m => Stream m Int -> m ()
112+groups =
113+#ifdef USE_PRELUDE
133−groups = Common.drain . S.groups FL.drain
114+ Common.drain . S.groups FL.drain
115+#else
116+ Common.drain . S.groupsWhile (==) FL.drain
117+#endif
118+
119+{-# INLINE groupsWhileLT #-}
120+groupsWhileLT :: MonadIO m => Stream m Int -> m ()
121+groupsWhileLT =
122+#ifdef USE_PRELUDE
123+ Common.drain . S.groupsBy (>) FL.drain
124+#else
125+ Common.drain . S.groupsWhile (<) FL.drain
126+#endif
134
127
135−-- XXX Change this test when the order of comparison is later changed
128+{-# INLINE groupsWhileEq #-}
136−{-# INLINE groupsByGT #-}
137−groupsByGT :: MonadIO m => Stream m Int -> m ()
129+groupsWhileEq :: MonadIO m => Stream m Int -> m ()
130+groupsWhileEq =
131+#ifdef USE_PRELUDE
138−groupsByGT = Common.drain . S.groupsBy (>) FL.drain
132+ Common.drain . S.groupsBy (==) FL.drain
133+#else
134+ Common.drain . S.groupsWhile (==) FL.drain
135+#endif
139
136
140−{-# INLINE groupsByEq #-}
141−groupsByEq :: MonadIO m => Stream m Int -> m ()
142−groupsByEq = Common.drain . S.groupsBy (==) FL.drain
143
137
144−-- XXX Change this test when the order of comparison is later changed
145{-# INLINE groupsByRollingLT #-}
138{-# INLINE groupsByRollingLT #-}
146groupsByRollingLT :: MonadIO m => Stream m Int -> m ()
139groupsByRollingLT :: MonadIO m => Stream m Int -> m ()
147groupsByRollingLT =
140groupsByRollingLT =
141+#ifdef USE_PRELUDE
148 Common.drain . S.groupsByRolling (<) FL.drain
142 Common.drain . S.groupsByRolling (<) FL.drain
143+#else
144+ Common.drain . S.groupsRollingBy (<) FL.drain
145+#endif
149
146
150{-# INLINE groupsByRollingEq #-}
147{-# INLINE groupsByRollingEq #-}
151groupsByRollingEq :: MonadIO m => Stream m Int -> m ()
148groupsByRollingEq :: MonadIO m => Stream m Int -> m ()
152groupsByRollingEq =
149groupsByRollingEq =
150+#ifdef USE_PRELUDE
153 Common.drain . S.groupsByRolling (==) FL.drain
151 Common.drain . S.groupsByRolling (==) FL.drain
152+#else
153+ Common.drain . S.groupsRollingBy (==) FL.drain
154#endif
154#endif
155
155
156{-# INLINE foldMany #-}
156{-# INLINE foldMany #-}
@@ -195,52 +195,84 @@ refoldIterateM =
195 (Refold.take 2 Refold.sconcat) (return (Sum 0))
195 (Refold.take 2 Refold.sconcat) (return (Sum 0))
196 . fmap Sum
196 . fmap Sum
197
197
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+
198o_1_space_grouping :: Int -> [Benchmark]
208o_1_space_grouping :: Int -> [Benchmark]
199o_1_space_grouping value =
209o_1_space_grouping value =
200 -- Buffering operations using heap proportional to group/window sizes.
210 -- Buffering operations using heap proportional to group/window sizes.
201 [ bgroup "grouping"
211 [ bgroup "grouping"
202 [
212 [
203−#ifdef USE_PRELUDE
204 benchIOSink value "groups" groups
213 benchIOSink value "groups" groups
205− , benchIOSink value "groupsByGT" groupsByGT
214+ , benchIOSink value "groupsWhileLT" groupsWhileLT
206− , benchIOSink value "groupsByEq" groupsByEq
215+ , benchIOSink value "groupsWhileEq" groupsWhileEq
207 , benchIOSink value "groupsByRollingLT" groupsByRollingLT
216 , benchIOSink value "groupsByRollingLT" groupsByRollingLT
208 , benchIOSink value "groupsByRollingEq" groupsByRollingEq
217 , benchIOSink value "groupsByRollingEq" groupsByRollingEq
209 ,
218 ,
210−#endif
219+
211 -- XXX parseMany/parseIterate benchmarks are in the Parser/ParserD
220 -- XXX parseMany/parseIterate benchmarks are in the Parser/ParserD
212− -- modules we can bring those here. arraysOf benchmarks are in
221+ -- modules we can bring those here. chunksOf benchmarks are in
213 -- Parser/ParserD/Array.Stream/FileSystem.Handle.
222 -- Parser/ParserD/Array.Stream/FileSystem.Handle.
214 benchIOSink value "foldMany" foldMany
223 benchIOSink value "foldMany" foldMany
215 , benchIOSink value "foldManyPost" foldManyPost
224 , benchIOSink value "foldManyPost" foldManyPost
216 , benchIOSink value "refoldMany" refoldMany
225 , benchIOSink value "refoldMany" refoldMany
217 , benchIOSink value "foldIterateM" foldIterateM
226 , benchIOSink value "foldIterateM" foldIterateM
218 , benchIOSink value "refoldIterateM" refoldIterateM
227 , 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
219 ]
242 ]
220 ]
243 ]
221
244
245+#ifndef USE_STREAMLY_CORE
246+ where
247+
248+ getKey :: Int -> Int -> Int
249+ getKey n = (`mod` n)
250+#endif
251+
222-------------------------------------------------------------------------------
252-------------------------------------------------------------------------------
223-- Size conserving transformations (reordering, buffering, etc.)
253-- Size conserving transformations (reordering, buffering, etc.)
224-------------------------------------------------------------------------------
254-------------------------------------------------------------------------------
225
255
256+#ifndef USE_PRELUDE
226{-# INLINE reverse #-}
257{-# INLINE reverse #-}
227reverse :: MonadIO m => Int -> Stream m Int -> m ()
258reverse :: MonadIO m => Int -> Stream m Int -> m ()
228−reverse n = composeN n S.reverse
259+reverse n = composeN n (toStream . K.reverse . fromStream)
229
260
230{-# INLINE reverse' #-}
261{-# INLINE reverse' #-}
231reverse' :: MonadIO m => Int -> Stream m Int -> m ()
262reverse' :: MonadIO m => Int -> Stream m Int -> m ()
232−reverse' n = composeN n S.reverse'
263+reverse' n = composeN n S.reverseUnbox
264+#endif
233
265
234o_n_heap_buffering :: Int -> [Benchmark]
266o_n_heap_buffering :: Int -> [Benchmark]
235o_n_heap_buffering value =
267o_n_heap_buffering value =
236 [ bgroup "buffered"
268 [ bgroup "buffered"
237 [
269 [
270+#ifndef USE_PRELUDE
238 -- Reversing a stream
271 -- Reversing a stream
239 benchIOSink value "reverse" (reverse 1)
272 benchIOSink value "reverse" (reverse 1)
240 , benchIOSink value "reverse'" (reverse' 1)
273 , benchIOSink value "reverse'" (reverse' 1)
241−
274+#else
242−#ifdef USE_PRELUDE
243− , benchIOSink value "mkAsync" (mkAsync fromSerial)
275+ benchIOSink value "mkAsync" (mkAsync fromSerial)
244#endif
276#endif
245 ]
277 ]
246 ]
278 ]
@@ -249,9 +281,9 @@ o_n_heap_buffering value =
249-- Grouping/Splitting
281-- Grouping/Splitting
250-------------------------------------------------------------------------------
282-------------------------------------------------------------------------------
251
283
252−#ifdef USE_PRELUDE
284+#ifndef USE_STREAMLY_CORE
253{-# INLINE classifySessionsOf #-}
285{-# INLINE classifySessionsOf #-}
254−classifySessionsOf :: MonadAsync m => (Int -> Int) -> Stream m Int -> m ()
286+classifySessionsOf :: S.MonadAsync m => (Int -> Int) -> Stream m Int -> m ()
255classifySessionsOf getKey =
287classifySessionsOf getKey =
256 Common.drain
288 Common.drain
257 . S.classifySessionsOf
289 . S.classifySessionsOf
@@ -260,7 +292,7 @@ classifySessionsOf getKey =
260 . fmap (\x -> (getKey x, x))
292 . fmap (\x -> (getKey x, x))
261
293
262{-# INLINE classifySessionsOfHash #-}
294{-# INLINE classifySessionsOfHash #-}
263−classifySessionsOfHash :: MonadAsync m =>
295+classifySessionsOfHash :: S.MonadAsync m =>
264 (Int -> Int) -> Stream m Int -> m ()
296 (Int -> Int) -> Stream m Int -> m ()
265classifySessionsOfHash getKey =
297classifySessionsOfHash getKey =
266 Common.drain
298 Common.drain
@@ -269,25 +301,6 @@ classifySessionsOfHash getKey =
269 1 False (const (return False)) 3 (FL.take 10 FL.sum)
301 1 False (const (return False)) 3 (FL.take 10 FL.sum)
270 . S.timestamped
302 . S.timestamped
271 . fmap (\x -> (getKey x, x))
303 . fmap (\x -> (getKey x, x))
272−
273−o_n_space_grouping :: Int -> [Benchmark]
274−o_n_space_grouping value =
275− -- Buffering operations using heap proportional to group/window sizes.
276− [ bgroup "grouping"
277− [ benchIOSink value "classifySessionsOf (10000 buckets)"
278− (classifySessionsOf (getKey 10000))
279− , benchIOSink value "classifySessionsOf (64 buckets)"
280− (classifySessionsOf (getKey 64))
281− , benchIOSink value "classifySessionsOfHash (10000 buckets)"
282− (classifySessionsOfHash (getKey 10000))
283− , benchIOSink value "classifySessionsOfHash (64 buckets)"
284− (classifySessionsOfHash (getKey 64))
285− ]
286− ]
287−
288− where
289−
290− getKey n = (`mod` n)
291#endif
304#endif
292
305
293-------------------------------------------------------------------------------
306-------------------------------------------------------------------------------
@@ -349,8 +362,9 @@ data Pair a b =
349 deriving (Generic, NFData)
362 deriving (Generic, NFData)
350
363
351{-# INLINE sumProductFold #-}
364{-# INLINE sumProductFold #-}
352−sumProductFold :: Monad m => Stream m Int -> m (Int, Int)
365+sumProductFold :: Monad m => Stream m Int -> m (Pair Int Int)
366+sumProductFold =
353−sumProductFold = Common.foldl' (\(s, p) x -> (s + x, p * x)) (0, 1)
367+ Common.foldl' (\(Pair s p) x -> Pair (s + x) (p * x)) (Pair 0 1)
354
368
355{-# INLINE sumProductScan #-}
369{-# INLINE sumProductScan #-}
356sumProductScan :: Monad m => Stream m Int -> m (Pair Int Int)
370sumProductScan :: Monad m => Stream m Int -> m (Pair Int Int)
@@ -398,6 +412,46 @@ o_1_space_transformations_mixedX4 value =
398-- Iterating a transformation over and over again
412-- Iterating a transformation over and over again
399-------------------------------------------------------------------------------
413-------------------------------------------------------------------------------
400
414
415+#ifdef USE_STREAMK
416+{-
417+-- this is quadratic
418+{-# INLINE iterateScan #-}
419+iterateScan :: MonadAsync m => Int -> Int -> Int -> Stream 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+
401-- this is quadratic
455-- this is quadratic
402{-# INLINE iterateScan #-}
456{-# INLINE iterateScan #-}
403iterateScan :: MonadAsync m => Int -> Int -> Int -> Stream m Int
457iterateScan :: MonadAsync m => Int -> Int -> Int -> Stream m Int
@@ -426,15 +480,11 @@ iterateTakeAll value = iterateSource (S.take (value + 1))
426iterateDropOne :: MonadAsync m => Int -> Int -> Int -> Stream m Int
480iterateDropOne :: MonadAsync m => Int -> Int -> Int -> Stream m Int
427iterateDropOne = iterateSource (S.drop 1)
481iterateDropOne = iterateSource (S.drop 1)
428
482
429−{-# INLINE iterateDropWhileFalse #-}
430−iterateDropWhileFalse :: MonadAsync m
431− => Int -> Int -> Int -> Int -> Stream m Int
432−iterateDropWhileFalse value = iterateSource (S.dropWhile (> (value + 1)))
433−
434{-# INLINE iterateDropWhileTrue #-}
483{-# INLINE iterateDropWhileTrue #-}
435iterateDropWhileTrue :: MonadAsync m
484iterateDropWhileTrue :: MonadAsync m
436 => Int -> Int -> Int -> Int -> Stream m Int
485 => Int -> Int -> Int -> Int -> Stream m Int
437iterateDropWhileTrue value = iterateSource (S.dropWhile (<= (value + 1)))
486iterateDropWhileTrue value = iterateSource (S.dropWhile (<= (value + 1)))
487+#endif
438
488
439#ifdef USE_PRELUDE
489#ifdef USE_PRELUDE
440{-# INLINE tail #-}
490{-# INLINE tail #-}
@@ -455,8 +505,10 @@ o_n_stack_iterated :: Int -> [Benchmark]
455o_n_stack_iterated value = by10 `seq` by100 `seq`
505o_n_stack_iterated value = by10 `seq` by100 `seq`
456 [ bgroup "iterated"
506 [ bgroup "iterated"
457 [ benchIOSrc "mapM (n/10 x 10)" $ iterateMapM by10 10
507 [ benchIOSrc "mapM (n/10 x 10)" $ iterateMapM by10 10
508+#ifndef USE_STREAMK
458 , benchIOSrc "scanl' (quadratic) (n/100 x 100)" $
509 , benchIOSrc "scanl' (quadratic) (n/100 x 100)" $
459 iterateScan by100 100
510 iterateScan by100 100
511+#endif
460#ifdef USE_PRELUDE
512#ifdef USE_PRELUDE
461 , benchIOSrc "scanl1' (n/10 x 10)" $ iterateScanl1 by10 10
513 , benchIOSrc "scanl1' (n/10 x 10)" $ iterateScanl1 by10 10
462#endif
514#endif
@@ -465,8 +517,10 @@ o_n_stack_iterated value = by10 `seq` by100 `seq`
465 , benchIOSrc "takeAll (n/10 x 10)" $
517 , benchIOSrc "takeAll (n/10 x 10)" $
466 iterateTakeAll value by10 10
518 iterateTakeAll value by10 10
467 , benchIOSrc "dropOne (n/10 x 10)" $ iterateDropOne by10 10
519 , benchIOSrc "dropOne (n/10 x 10)" $ iterateDropOne by10 10
520+#ifdef USE_STREAMK
468 , benchIOSrc "dropWhileFalse (n/10 x 10)" $
521 , benchIOSrc "dropWhileFalse (n/10 x 10)" $
469 iterateDropWhileFalse value by10 10
522 iterateDropWhileFalse value by10 10
523+#endif
470 , benchIOSrc "dropWhileTrue (n/10 x 10)" $
524 , benchIOSrc "dropWhileTrue (n/10 x 10)" $
471 iterateDropWhileTrue value by10 10
525 iterateDropWhileTrue value by10 10
472#ifdef USE_PRELUDE
526#ifdef USE_PRELUDE
@@ -530,13 +584,5 @@ benchmarks moduleName size =
530 , o_1_space_pipesX4 size
584 , o_1_space_pipesX4 size
531 ]
585 ]
532 , bgroup (o_n_stack_prefix moduleName) (o_n_stack_iterated size)
586 , bgroup (o_n_stack_prefix moduleName) (o_n_stack_iterated size)
533− , bgroup (o_n_heap_prefix moduleName) $ Prelude.concat
587+ , bgroup (o_n_heap_prefix moduleName) (o_n_heap_buffering size)
534− [
535−#ifdef USE_PRELUDE
536− o_n_space_grouping size
537− ,
538−#endif
539− o_n_space_functor size
540− , o_n_heap_buffering size
541− ]
542 ]
588 ]
benchmark/Streamly/Benchmark/Data/Stream/Split.hs+6−5
@@ -35,15 +35,15 @@ import qualified Streamly.Internal.FileSystem.Handle as IFH
35import qualified Streamly.Internal.Unicode.Stream as IUS
35import qualified Streamly.Internal.Unicode.Stream as IUS
36import qualified Streamly.Prelude as S
36import qualified Streamly.Prelude as S
37
37
38−import Gauge hiding (env)
38+import Test.Tasty.Bench hiding (env)
39import Prelude hiding (last, length)
39import Prelude hiding (last, length)
40import Streamly.Benchmark.Common
40import Streamly.Benchmark.Common
41import Streamly.Benchmark.Common.Handle
41import Streamly.Benchmark.Common.Handle
42
42
43#ifdef INSPECTION
43#ifdef INSPECTION
44−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
44+import Streamly.Internal.Data.Stream (Step(..))
45
45
46−import qualified Streamly.Internal.Data.Array.Mut.Type as MA
46+import qualified Streamly.Internal.Data.MutArray as MA
47import qualified Streamly.Internal.Data.Unfold as IUF
47import qualified Streamly.Internal.Data.Unfold as IUF
48
48
49import Test.Inspection
49import Test.Inspection
@@ -143,7 +143,7 @@ splitOnSeq str inh =
143-- | Split on a word8 sequence.
143-- | Split on a word8 sequence.
144splitOnSeq100k :: Handle -> IO Int
144splitOnSeq100k :: Handle -> IO Int
145splitOnSeq100k inh = do
145splitOnSeq100k inh = do
146− arr <- A.fromStream $ S.replicate 100000 123
146+ arr <- A.fromStream $ IP.toStream $ S.fromSerial $ S.replicate 100000 123
147 (S.length $ IP.splitOnSeq arr FL.drain
147 (S.length $ IP.splitOnSeq arr FL.drain
148 $ S.unfold FH.read inh) -- >>= print
148 $ S.unfold FH.read inh) -- >>= print
149
149
@@ -220,8 +220,9 @@ o_1_space_reduce_read_split env =
220splitOnSeqUtf8 :: String -> Handle -> IO Int
220splitOnSeqUtf8 :: String -> Handle -> IO Int
221splitOnSeqUtf8 str inh =
221splitOnSeqUtf8 str inh =
222 (S.length $ IP.splitOnSeq (A.fromList str) FL.drain
222 (S.length $ IP.splitOnSeq (A.fromList str) FL.drain
223+ $ IP.fromStream
223 $ IUS.decodeUtf8Arrays
224 $ IUS.decodeUtf8Arrays
224− $ IFH.getChunks inh) -- >>= print
225+ $ IFH.readChunks inh) -- >>= print
225
226
226o_1_space_reduce_toChunks_split :: BenchEnv -> [Benchmark]
227o_1_space_reduce_toChunks_split :: BenchEnv -> [Benchmark]
227o_1_space_reduce_toChunks_split env =
228o_1_space_reduce_toChunks_split env =
benchmark/Streamly/Benchmark/Data/Stream/StreamD.hs+35−3
@@ -9,6 +9,7 @@
9{-# LANGUAGE FlexibleContexts #-}
9{-# LANGUAGE FlexibleContexts #-}
10{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE ScopedTypeVariables #-}
11{-# LANGUAGE TupleSections #-}
11{-# LANGUAGE TupleSections #-}
12+{-# OPTIONS_GHC -Wno-orphans #-}
12
13
13#ifdef __HADDOCK_VERSION__
14#ifdef __HADDOCK_VERSION__
14#undef INSPECTION
15#undef INSPECTION
@@ -21,14 +22,17 @@
21
22
22module Main (main) where
23module Main (main) where
23
24
25+#if !MIN_VERSION_base(4,18,0)
26+import Control.Applicative (liftA2)
27+#endif
24import Control.Monad (when)
28import Control.Monad (when)
25import Data.Maybe (isJust)
29import Data.Maybe (isJust)
26−import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
30+import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
27import System.Random (randomRIO)
31import System.Random (randomRIO)
28import Prelude hiding (tail, mapM_, foldl, last, map, mapM, concatMap, zip)
32import Prelude hiding (tail, mapM_, foldl, last, map, mapM, concatMap, zip)
29
33
30import qualified Prelude as P
34import qualified Prelude as P
31−import qualified Streamly.Internal.Data.Stream.StreamD as S
35+import qualified Streamly.Internal.Data.Stream as S
32import qualified Streamly.Internal.Data.Unfold as UF
36import qualified Streamly.Internal.Data.Unfold as UF
33import qualified Streamly.Internal.Data.Fold as FL
37import qualified Streamly.Internal.Data.Fold as FL
34
38
@@ -322,6 +326,34 @@ filterMap n = composeN n $ S.map (subtract 1) . S.filter (<= maxValue)
322-- Nested Composition
326-- Nested Composition
323-------------------------------------------------------------------------------
327-------------------------------------------------------------------------------
324
328
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+
325{-# INLINE toNullApNested #-}
357{-# INLINE toNullApNested #-}
326toNullApNested :: Monad m => Stream m Int -> m ()
358toNullApNested :: Monad m => Stream m Int -> m ()
327toNullApNested s = runStream $ do
359toNullApNested s = runStream $ do
@@ -431,7 +463,7 @@ inspect $ 'unfoldManyRepl `hasNoType` ''SPEC
431-------------------------------------------------------------------------------
463-------------------------------------------------------------------------------
432
464
433moduleName :: String
465moduleName :: String
434−moduleName = "Data.Stream.StreamD"
466+moduleName = "Data.StreamD"
435
467
436o_1_space :: [Benchmark]
468o_1_space :: [Benchmark]
437o_1_space =
469o_1_space =
benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs+61−33
@@ -8,6 +8,7 @@
8{-# LANGUAGE CPP #-}
8{-# LANGUAGE CPP #-}
9{-# LANGUAGE FlexibleContexts #-}
9{-# LANGUAGE FlexibleContexts #-}
10{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE ScopedTypeVariables #-}
11+{-# OPTIONS_GHC -Wno-orphans #-}
11
12
12#ifdef __HADDOCK_VERSION__
13#ifdef __HADDOCK_VERSION__
13#undef INSPECTION
14#undef INSPECTION
@@ -20,22 +21,23 @@
20
21
21module Main (main) where
22module Main (main) where
22
23
24+#if !MIN_VERSION_base(4,18,0)
25+import Control.Applicative (liftA2)
26+#endif
23import Control.Monad (when)
27import Control.Monad (when)
24import Data.Maybe (isJust)
28import Data.Maybe (isJust)
25import System.Random (randomRIO)
29import System.Random (randomRIO)
26import Prelude hiding
30import Prelude hiding
27− ( tail, mapM_, foldl, last, map, mapM, concatMap, zipWith, init, iterate
31+ ( Foldable(..), tail, mapM_, last, map, mapM, concatMap, zipWith, init, iterate
28 , repeat, replicate
32 , repeat, replicate
29 )
33 )
30
34
31import qualified Prelude as P
35import qualified Prelude as P
32import qualified Data.List as List
36import qualified Data.List as List
33
37
34−import qualified Streamly.Internal.Control.Concurrent as S
38+import qualified Streamly.Internal.Data.StreamK as S
35−import qualified Streamly.Internal.Data.Stream.StreamK.Type as S
36−import qualified Streamly.Internal.Data.Stream.StreamK as S
37
39
38−import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
40+import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
39
41
40import Streamly.Benchmark.Common
42import Streamly.Benchmark.Common
41
43
@@ -115,7 +117,7 @@ Benchmarks that need to be added
115-- Stream generation and elimination
117-- Stream generation and elimination
116-------------------------------------------------------------------------------
118-------------------------------------------------------------------------------
117
119
118−type Stream m a = S.Stream m a
120+type Stream m a = S.StreamK m a
119
121
120{-# INLINE unfoldr #-}
122{-# INLINE unfoldr #-}
121unfoldr :: Int -> Int -> Stream m Int
123unfoldr :: Int -> Int -> Stream m Int
@@ -127,7 +129,7 @@ unfoldr streamLen n = S.unfoldr step n
127 else Just (cnt, cnt + 1)
129 else Just (cnt, cnt + 1)
128
130
129{-# INLINE unfoldrM #-}
131{-# INLINE unfoldrM #-}
130−unfoldrM :: S.MonadAsync m => Int -> Int -> Stream m Int
132+unfoldrM :: Monad m => Int -> Int -> Stream m Int
131unfoldrM streamLen n = S.unfoldrMWith S.consM step n
133unfoldrM streamLen n = S.unfoldrMWith S.consM step n
132 where
134 where
133 step cnt =
135 step cnt =
@@ -140,7 +142,7 @@ repeat :: Int -> Int -> Stream m Int
140repeat streamLen = S.take streamLen . S.repeat
142repeat streamLen = S.take streamLen . S.repeat
141
143
142{-# INLINE repeatM #-}
144{-# INLINE repeatM #-}
143−repeatM :: S.MonadAsync m => Int -> Int -> Stream m Int
145+repeatM :: Monad m => Int -> Int -> Stream m Int
144repeatM streamLen = S.take streamLen . S.repeatM . return
146repeatM streamLen = S.take streamLen . S.repeatM . return
145
147
146{-# INLINE replicate #-}
148{-# INLINE replicate #-}
@@ -148,7 +150,7 @@ replicate :: Int -> Int -> Stream m Int
148replicate = S.replicate
150replicate = S.replicate
149
151
150{-# INLINE replicateM #-}
152{-# INLINE replicateM #-}
151−replicateM :: S.MonadAsync m => Int -> Int -> Stream m Int
153+replicateM :: Monad m => Int -> Int -> Stream m Int
152replicateM streamLen = S.replicateMWith S.consM streamLen . return
154replicateM streamLen = S.replicateMWith S.consM streamLen . return
153
155
154{-# INLINE iterate #-}
156{-# INLINE iterate #-}
@@ -156,7 +158,7 @@ iterate :: Int -> Int -> Stream m Int
156iterate streamLen = S.take streamLen . S.iterate (+1)
158iterate streamLen = S.take streamLen . S.iterate (+1)
157
159
158{-# INLINE iterateM #-}
160{-# INLINE iterateM #-}
159−iterateM :: S.MonadAsync m => Int -> Int -> Stream m Int
161+iterateM :: Monad m => Int -> Int -> Stream m Int
160iterateM streamLen = S.take streamLen . S.iterateM (return . (+1)) . return
162iterateM streamLen = S.take streamLen . S.iterateM (return . (+1)) . return
161
163
162{-# INLINE fromFoldable #-}
164{-# INLINE fromFoldable #-}
@@ -164,26 +166,27 @@ fromFoldable :: Int -> Int -> Stream m Int
164fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
166fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
165
167
166{-# INLINE fromFoldableM #-}
168{-# INLINE fromFoldableM #-}
167−fromFoldableM :: S.MonadAsync m => Int -> Int -> Stream m Int
169+fromFoldableM :: Monad m => Int -> Int -> Stream m Int
168fromFoldableM streamLen n =
170fromFoldableM streamLen n =
169− Prelude.foldr S.consM S.nil (Prelude.fmap return [n..n+streamLen])
171+ List.foldr S.consM S.nil (Prelude.fmap return [n..n+streamLen])
170
172
171{-# INLINABLE concatMapFoldableWith #-}
173{-# INLINABLE concatMapFoldableWith #-}
172−concatMapFoldableWith :: Foldable f
174+concatMapFoldableWith :: P.Foldable f
173 => (Stream m b -> Stream m b -> Stream m b)
175 => (Stream m b -> Stream m b -> Stream m b)
174 -> (a -> Stream m b)
176 -> (a -> Stream m b)
175 -> f a
177 -> f a
176 -> Stream m b
178 -> Stream m b
177−concatMapFoldableWith f g = Prelude.foldr (f . g) S.nil
179+concatMapFoldableWith f g = P.foldr (f . g) S.nil
178
180
179{-# INLINE concatMapFoldableSerial #-}
181{-# INLINE concatMapFoldableSerial #-}
180concatMapFoldableSerial :: Int -> Int -> Stream m Int
182concatMapFoldableSerial :: Int -> Int -> Stream m Int
183+concatMapFoldableSerial streamLen n =
181−concatMapFoldableSerial streamLen n = concatMapFoldableWith S.serial S.fromPure [n..n+streamLen]
184+ concatMapFoldableWith S.append S.fromPure [n..n+streamLen]
182
185
183{-# INLINE concatMapFoldableSerialM #-}
186{-# INLINE concatMapFoldableSerialM #-}
184concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
187concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
185concatMapFoldableSerialM streamLen n =
188concatMapFoldableSerialM streamLen n =
186− concatMapFoldableWith S.serial (S.fromEffect . return) [n..n+streamLen]
189+ concatMapFoldableWith S.append (S.fromEffect . return) [n..n+streamLen]
187
190
188-------------------------------------------------------------------------------
191-------------------------------------------------------------------------------
189-- Elimination
192-- Elimination
@@ -268,11 +271,11 @@ fmapK :: Monad m => Int -> Stream m Int -> m ()
268fmapK n = composeN n $ P.fmap (+ 1)
271fmapK n = composeN n $ P.fmap (+ 1)
269
272
270{-# INLINE mapM #-}
273{-# INLINE mapM #-}
271−mapM :: S.MonadAsync m => Int -> Stream m Int -> m ()
274+mapM :: Monad m => Int -> Stream m Int -> m ()
272mapM n = composeN n $ S.mapMWith S.consM return
275mapM n = composeN n $ S.mapMWith S.consM return
273
276
274{-# INLINE mapMSerial #-}
277{-# INLINE mapMSerial #-}
275−mapMSerial :: S.MonadAsync m => Int -> Stream m Int -> m ()
278+mapMSerial :: Monad m => Int -> Stream m Int -> m ()
276mapMSerial n = composeN n $ S.mapMSerial return
279mapMSerial n = composeN n $ S.mapMSerial return
277
280
278{-# INLINE filterEven #-}
281{-# INLINE filterEven #-}
@@ -324,7 +327,7 @@ foldlS :: Monad m => Int -> Stream m Int -> m ()
324foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
327foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
325
328
326{-# INLINE intersperse #-}
329{-# INLINE intersperse #-}
327−intersperse :: S.MonadAsync m => Int -> Int -> Stream m Int -> m ()
330+intersperse :: Monad m => Int -> Int -> Stream m Int -> m ()
328intersperse streamLen n = composeN n $ S.intersperse streamLen
331intersperse streamLen n = composeN n $ S.intersperse streamLen
329
332
330-------------------------------------------------------------------------------
333-------------------------------------------------------------------------------
@@ -333,8 +336,7 @@ intersperse streamLen n = composeN n $ S.intersperse streamLen
333
336
334{-# INLINE iterateSource #-}
337{-# INLINE iterateSource #-}
335iterateSource
338iterateSource
336− :: S.MonadAsync m
337− => Int -> (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
339+ :: Monad m => Int -> (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
338iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
340iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
339 where
341 where
340 f (0 :: Int) m = g m
342 f (0 :: Int) m = g m
@@ -342,37 +344,37 @@ iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
342
344
343-- this is quadratic
345-- this is quadratic
344{-# INLINE iterateScan #-}
346{-# INLINE iterateScan #-}
345−iterateScan :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
347+iterateScan :: Monad m => Int -> Int -> Int -> Stream m Int
346iterateScan iterStreamLen maxIters =
348iterateScan iterStreamLen maxIters =
347 iterateSource iterStreamLen (S.scanl' (+) 0) (maxIters `div` 10)
349 iterateSource iterStreamLen (S.scanl' (+) 0) (maxIters `div` 10)
348
350
349-- this is quadratic
351-- this is quadratic
350{-# INLINE iterateDropWhileFalse #-}
352{-# INLINE iterateDropWhileFalse #-}
351−iterateDropWhileFalse :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
353+iterateDropWhileFalse :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
352iterateDropWhileFalse streamLen iterStreamLen maxIters =
354iterateDropWhileFalse streamLen iterStreamLen maxIters =
353 iterateSource iterStreamLen (S.dropWhile (> streamLen)) (maxIters `div` 10)
355 iterateSource iterStreamLen (S.dropWhile (> streamLen)) (maxIters `div` 10)
354
356
355{-# INLINE iterateMapM #-}
357{-# INLINE iterateMapM #-}
356−iterateMapM :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
358+iterateMapM :: Monad m => Int -> Int -> Int -> Stream m Int
357iterateMapM iterStreamLen =
359iterateMapM iterStreamLen =
358 iterateSource iterStreamLen (S.mapMWith S.consM return)
360 iterateSource iterStreamLen (S.mapMWith S.consM return)
359
361
360{-# INLINE iterateFilterEven #-}
362{-# INLINE iterateFilterEven #-}
361−iterateFilterEven :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
363+iterateFilterEven :: Monad m => Int -> Int -> Int -> Stream m Int
362iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
364iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
363
365
364{-# INLINE iterateTakeAll #-}
366{-# INLINE iterateTakeAll #-}
365−iterateTakeAll :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
367+iterateTakeAll :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
366iterateTakeAll streamLen iterStreamLen =
368iterateTakeAll streamLen iterStreamLen =
367 iterateSource iterStreamLen (S.take streamLen)
369 iterateSource iterStreamLen (S.take streamLen)
368
370
369{-# INLINE iterateDropOne #-}
371{-# INLINE iterateDropOne #-}
370−iterateDropOne :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
372+iterateDropOne :: Monad m => Int -> Int -> Int -> Stream m Int
371iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
373iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
372
374
373{-# INLINE iterateDropWhileTrue #-}
375{-# INLINE iterateDropWhileTrue #-}
374−iterateDropWhileTrue :: S.MonadAsync m =>
376+iterateDropWhileTrue ::
375− Int -> Int -> Int -> Int -> Stream m Int
377+ Monad m => Int -> Int -> Int -> Int -> Stream m Int
376iterateDropWhileTrue streamLen iterStreamLen =
378iterateDropWhileTrue streamLen iterStreamLen =
377 iterateSource iterStreamLen (S.dropWhile (<= streamLen))
379 iterateSource iterStreamLen (S.dropWhile (<= streamLen))
378
380
@@ -390,7 +392,7 @@ zipWithM src = drain $ S.zipWithM (curry return) src src
390
392
391{-# INLINE sortByK #-}
393{-# INLINE sortByK #-}
392sortByK :: (a -> a -> Ordering) -> Stream m a -> Stream m a
394sortByK :: (a -> a -> Ordering) -> Stream m a -> Stream m a
393−sortByK f = S.concatPairsWith (S.mergeBy f) S.fromPure
395+sortByK f = S.mergeMapWith (S.mergeBy f) S.fromPure
394
396
395{-# INLINE sortBy #-}
397{-# INLINE sortBy #-}
396sortBy :: Monad m => Stream m Int -> m ()
398sortBy :: Monad m => Stream m Int -> m ()
@@ -492,7 +494,7 @@ sourceConcatMapId val n =
492{-# INLINE concatMapBySerial #-}
494{-# INLINE concatMapBySerial #-}
493concatMapBySerial :: Int -> Int -> Int -> IO ()
495concatMapBySerial :: Int -> Int -> Int -> IO ()
494concatMapBySerial outer inner n =
496concatMapBySerial outer inner n =
495− S.drain $ S.concatMapWith S.serial
497+ S.drain $ S.concatMapWith S.append
496 (unfoldrM inner)
498 (unfoldrM inner)
497 (unfoldrM outer n)
499 (unfoldrM outer n)
498
500
@@ -500,6 +502,32 @@ concatMapBySerial outer inner n =
500-- Nested Composition
502-- Nested Composition
501-------------------------------------------------------------------------------
503-------------------------------------------------------------------------------
502
504
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+
503{-# INLINE drainApplicative #-}
531{-# INLINE drainApplicative #-}
504drainApplicative :: Monad m => Stream m Int -> m ()
532drainApplicative :: Monad m => Stream m Int -> m ()
505drainApplicative s = drain $ do
533drainApplicative s = drain $ do
@@ -606,7 +634,7 @@ filterAllInNestedList str = do
606-------------------------------------------------------------------------------
634-------------------------------------------------------------------------------
607
635
608moduleName :: String
636moduleName :: String
609−moduleName = "Data.Stream.StreamK"
637+moduleName = "Data.StreamK"
610
638
611o_1_space_generation :: Int -> Benchmark
639o_1_space_generation :: Int -> Benchmark
612o_1_space_generation streamLen =
640o_1_space_generation streamLen =
@@ -703,7 +731,7 @@ o_1_space_concat streamLen =
703 -- This is for comparison with concatMapFoldableWith
731 -- This is for comparison with concatMapFoldableWith
704 , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
732 , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
705 (S.drain
733 (S.drain
706− . S.concatMapWith S.serial id
734+ . S.concatMapWith S.append id
707 . sourceConcatMapId streamLen)
735 . sourceConcatMapId streamLen)
708
736
709 , benchIOSrc1 "concatMapBy serial (n of 1)"
737 , benchIOSrc1 "concatMapBy serial (n of 1)"
benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs → benchmark/Streamly/Benchmark/Data/Stream/StreamKAlt.hsrenamed+3−3
@@ -18,12 +18,12 @@ import Prelude hiding ()
18-- import qualified Prelude as P
18-- import qualified Prelude as P
19-- import qualified Data.List as List
19-- import qualified Data.List as List
20
20
21−import qualified Streamly.Internal.Data.Stream.StreamDK as S
21+import qualified Streamly.Internal.Data.StreamK.Alt as S
22-- import qualified Streamly.Internal.Data.Stream.Common as SP
22-- import qualified Streamly.Internal.Data.Stream.Common as SP
23-- import qualified Streamly.Internal.Data.SVar as S
23-- import qualified Streamly.Internal.Data.SVar as S
24
24
25import Streamly.Benchmark.Common
25import Streamly.Benchmark.Common
26−import Gauge (bgroup, Benchmark, defaultMain)
26+import Test.Tasty.Bench (bgroup, Benchmark, defaultMain)
27
27
28value :: Int
28value :: Int
29value = 100000
29value = 100000
@@ -452,4 +452,4 @@ o_1_space =
452 ]
452 ]
453
453
454main :: IO ()
454main :: IO ()
455−main = defaultMain $ concat [o_1_space]
455+main = defaultMain [o_1_space]
benchmark/Streamly/Benchmark/Data/Stream/ToStreamK.hsnew file+938
@@ -0,0 +1,938 @@
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+149−31
@@ -6,9 +6,11 @@
6
6
7{-# LANGUAGE CPP #-}
7{-# LANGUAGE CPP #-}
8{-# LANGUAGE FlexibleContexts #-}
8{-# LANGUAGE FlexibleContexts #-}
9+{-# LANGUAGE FlexibleInstances #-}
9{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE RankNTypes #-}
11{-# LANGUAGE RankNTypes #-}
11
12
13+{-# OPTIONS_GHC -Wno-orphans #-}
12#ifdef USE_PRELUDE
14#ifdef USE_PRELUDE
13{-# OPTIONS_GHC -Wno-deprecations #-}
15{-# OPTIONS_GHC -Wno-deprecations #-}
14#endif
16#endif
@@ -24,31 +26,47 @@
24
26
25module Stream.Transform (benchmarks) where
27module Stream.Transform (benchmarks) where
26
28
27−import Control.DeepSeq (NFData(..))
28import Control.Monad.IO.Class (MonadIO(..))
29import Control.Monad.IO.Class (MonadIO(..))
29−import Data.Functor.Identity (Identity)
30
30
31import System.Random (randomRIO)
31import System.Random (randomRIO)
32
32
33import qualified Streamly.Internal.Data.Fold as FL
33import qualified Streamly.Internal.Data.Fold as FL
34
34
35−import qualified Prelude
36import qualified Stream.Common as Common
35import qualified Stream.Common as Common
37import qualified Streamly.Internal.Data.Unfold as Unfold
36import qualified Streamly.Internal.Data.Unfold as Unfold
37+
38#ifdef USE_PRELUDE
38#ifdef USE_PRELUDE
39+import Control.DeepSeq (NFData(..))
40+import Data.Functor.Identity (Identity(..))
41+import qualified Prelude
42+import qualified Streamly.Internal.Data.Fold as Fold
39import qualified Streamly.Internal.Data.Stream.IsStream as Stream
43import qualified Streamly.Internal.Data.Stream.IsStream as Stream
40import Streamly.Internal.Data.Time.Units
44import Streamly.Internal.Data.Time.Units
41#else
45#else
42−import qualified Streamly.Internal.Data.Stream.Time as Stream
46+import Streamly.Internal.Data.Stream (Stream)
43import qualified Streamly.Internal.Data.Stream as Stream
47import 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
44#endif
59#endif
45
60
46−import Gauge
61+import Test.Tasty.Bench
47−import Streamly.Internal.Data.Stream (Stream)
48import Stream.Common hiding (scanl')
62import Stream.Common hiding (scanl')
49import Streamly.Benchmark.Common
63import Streamly.Benchmark.Common
50import Prelude hiding (sequence, mapM)
64import Prelude hiding (sequence, mapM)
51
65
66+#ifdef USE_PRELUDE
67+type Stream = Stream.SerialT
68+#endif
69+
52-------------------------------------------------------------------------------
70-------------------------------------------------------------------------------
53-- Pipelines (stream-to-stream transformations)
71-- Pipelines (stream-to-stream transformations)
54-------------------------------------------------------------------------------
72-------------------------------------------------------------------------------
@@ -61,28 +79,36 @@ import Prelude hiding (sequence, mapM)
61-- Traversable Instance
79-- Traversable Instance
62-------------------------------------------------------------------------------
80-------------------------------------------------------------------------------
63
81
82+#ifdef USE_STREAMK
64{-# INLINE traversableTraverse #-}
83{-# INLINE traversableTraverse #-}
65−traversableTraverse :: Stream Identity Int -> IO (Stream Identity Int)
84+traversableTraverse :: StreamK Identity Int -> IO (StreamK Identity Int)
66traversableTraverse = traverse return
85traversableTraverse = traverse return
67
86
68{-# INLINE traversableSequenceA #-}
87{-# INLINE traversableSequenceA #-}
69−traversableSequenceA :: Stream Identity Int -> IO (Stream Identity Int)
88+traversableSequenceA :: StreamK Identity Int -> IO (StreamK Identity Int)
70traversableSequenceA = sequenceA . Prelude.fmap return
89traversableSequenceA = sequenceA . Prelude.fmap return
71
90
72{-# INLINE traversableMapM #-}
91{-# INLINE traversableMapM #-}
73−traversableMapM :: Stream Identity Int -> IO (Stream Identity Int)
92+traversableMapM :: StreamK Identity Int -> IO (StreamK Identity Int)
74traversableMapM = Prelude.mapM return
93traversableMapM = Prelude.mapM return
75
94
76{-# INLINE traversableSequence #-}
95{-# INLINE traversableSequence #-}
77−traversableSequence :: Stream Identity Int -> IO (Stream Identity Int)
96+traversableSequence :: StreamK Identity Int -> IO (StreamK Identity Int)
78traversableSequence = Prelude.sequence . Prelude.fmap return
97traversableSequence = Prelude.sequence . Prelude.fmap return
79
98
80{-# INLINE benchPureSinkIO #-}
99{-# INLINE benchPureSinkIO #-}
81benchPureSinkIO
100benchPureSinkIO
82 :: NFData b
101 :: NFData b
83− => Int -> String -> (Stream Identity Int -> IO b) -> Benchmark
102+ => Int -> String -> (StreamK Identity Int -> IO b) -> Benchmark
84benchPureSinkIO value name f =
103benchPureSinkIO value name f =
104+ bench name
85− bench name $ nfIO $ randomRIO (1, 1) >>= f . sourceUnfoldr value
105+ $ nfIO $ randomRIO (1, 1) >>= f . fromStream . 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)
86
112
87o_n_space_traversable :: Int -> [Benchmark]
113o_n_space_traversable :: Int -> [Benchmark]
88o_n_space_traversable value =
114o_n_space_traversable value =
@@ -95,6 +121,7 @@ o_n_space_traversable value =
95 , benchPureSinkIO value "sequence" traversableSequence
121 , benchPureSinkIO value "sequence" traversableSequence
96 ]
122 ]
97 ]
123 ]
124+#endif
98
125
99-------------------------------------------------------------------------------
126-------------------------------------------------------------------------------
100-- maps and scans
127-- maps and scans
@@ -159,21 +186,33 @@ timestamped :: (MonadAsync m) => Stream m Int -> m ()
159timestamped = Stream.drain . Stream.timestamped
186timestamped = Stream.drain . Stream.timestamped
160#endif
187#endif
161
188
189+#ifdef USE_STREAMK
162{-# INLINE foldrS #-}
190{-# INLINE foldrS #-}
163foldrS :: MonadIO m => Int -> Stream m Int -> m ()
191foldrS :: MonadIO m => Int -> Stream m Int -> m ()
192+foldrS n =
164−foldrS n = composeN n $ Stream.foldrS Stream.cons Stream.nil
193+ composeN n (toStream . StreamK.foldrS StreamK.cons StreamK.nil . fromStream)
165
194
166{-# INLINE foldrSMap #-}
195{-# INLINE foldrSMap #-}
167foldrSMap :: MonadIO m => Int -> Stream m Int -> m ()
196foldrSMap :: MonadIO m => Int -> Stream m Int -> m ()
197+foldrSMap n =
198+ composeN n
199+ ( toStream
168−foldrSMap n = composeN n $ Stream.foldrS (\x xs -> x + 1 `Stream.cons` xs) Stream.nil
200+ . StreamK.foldrS (\x xs -> x + 1 `StreamK.cons` xs) StreamK.nil
201+ . fromStream
202+ )
203+#endif
169
204
205+{-
170{-# INLINE foldrT #-}
206{-# INLINE foldrT #-}
171foldrT :: MonadIO m => Int -> Stream m Int -> m ()
207foldrT :: MonadIO m => Int -> Stream m Int -> m ()
172−foldrT n = composeN n $ Stream.foldrT Stream.cons Stream.nil
208+foldrT n = composeN n (unCrossStream . Stream.foldrT cns (CrossStream Stream.nil))
209+
210+ where cns x (CrossStream xs) = CrossStream (Stream.cons x xs)
173
211
174{-# INLINE foldrTMap #-}
212{-# INLINE foldrTMap #-}
175foldrTMap :: MonadIO m => Int -> Stream m Int -> m ()
213foldrTMap :: MonadIO m => Int -> Stream m Int -> m ()
176foldrTMap n = composeN n $ Stream.foldrT (\x xs -> x + 1 `Stream.cons` xs) Stream.nil
214foldrTMap n = composeN n $ Stream.foldrT (\x xs -> x + 1 `Stream.cons` xs) Stream.nil
215+-}
177
216
178{-# INLINE trace #-}
217{-# INLINE trace #-}
179trace :: MonadAsync m => Int -> Stream m Int -> m ()
218trace :: MonadAsync m => Int -> Stream m Int -> m ()
@@ -184,14 +223,17 @@ o_1_space_mapping value =
184 [ bgroup
223 [ bgroup
185 "mapping"
224 "mapping"
186 [
225 [
226+#ifdef USE_STREAMK
187 -- Right folds
227 -- Right folds
188 benchIOSink value "foldrS" (foldrS 1)
228 benchIOSink value "foldrS" (foldrS 1)
189 , benchIOSink value "foldrSMap" (foldrSMap 1)
229 , benchIOSink value "foldrSMap" (foldrSMap 1)
230+ ,
231+#endif
190− , benchIOSink value "foldrT" (foldrT 1)
232+ -- , benchIOSink value "foldrT" (foldrT 1)
191− , benchIOSink value "foldrTMap" (foldrTMap 1)
233+ -- , benchIOSink value "foldrTMap" (foldrTMap 1)
192
234
193 -- Mapping
235 -- Mapping
194− , benchIOSink value "map" (mapN 1)
236+ benchIOSink value "map" (mapN 1)
195 , bench "sequence" $ nfIO $ randomRIO (1, 1000) >>= \n ->
237 , bench "sequence" $ nfIO $ randomRIO (1, 1000) >>= \n ->
196 sequence (sourceUnfoldrAction value n)
238 sequence (sourceUnfoldrAction value n)
197 , benchIOSink value "mapM" (mapM 1)
239 , benchIOSink value "mapM" (mapM 1)
@@ -262,6 +304,73 @@ o_1_space_functor value =
262 ]
304 ]
263 ]
305 ]
264
306
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+
265-------------------------------------------------------------------------------
374-------------------------------------------------------------------------------
266-- Size reducing transformations (filtering)
375-- Size reducing transformations (filtering)
267-------------------------------------------------------------------------------
376-------------------------------------------------------------------------------
@@ -306,6 +415,7 @@ takeWhileTrue value n = composeN n $ Stream.takeWhile (<= (value + 1))
306takeWhileMTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
415takeWhileMTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
307takeWhileMTrue value n = composeN n $ Stream.takeWhileM (return . (<= (value + 1)))
416takeWhileMTrue value n = composeN n $ Stream.takeWhileM (return . (<= (value + 1)))
308
417
418+#if !defined(USE_STREAMLY_CORE) && !defined(USE_PRELUDE)
309{-# INLINE takeInterval #-}
419{-# INLINE takeInterval #-}
310takeInterval :: Double -> Int -> Stream IO Int -> IO ()
420takeInterval :: Double -> Int -> Stream IO Int -> IO ()
311takeInterval i n = composeN n (Stream.takeInterval i)
421takeInterval i n = composeN n (Stream.takeInterval i)
@@ -318,6 +428,18 @@ takeInterval i n = composeN n (Stream.takeInterval i)
318-- inspect $ 'takeInterval `hasNoType` ''D.Step
428-- inspect $ 'takeInterval `hasNoType` ''D.Step
319#endif
429#endif
320
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
442+
321{-# INLINE dropOne #-}
443{-# INLINE dropOne #-}
322dropOne :: MonadIO m => Int -> Stream m Int -> m ()
444dropOne :: MonadIO m => Int -> Stream m Int -> m ()
323dropOne n = composeN n $ Stream.drop 1
445dropOne n = composeN n $ Stream.drop 1
@@ -345,17 +467,6 @@ _intervalsOfSum :: MonadAsync m => Double -> Int -> Stream m Int -> m ()
345_intervalsOfSum i n = composeN n (Stream.intervalsOf i FL.sum)
467_intervalsOfSum i n = composeN n (Stream.intervalsOf i FL.sum)
346#endif
468#endif
347
469
348−{-# INLINE dropInterval #-}
349−dropInterval :: Double -> Int -> Stream IO Int -> IO ()
350−dropInterval i n = composeN n (Stream.dropInterval i)
351−
352−-- Inspection testing is disabled for dropInterval
353−-- Enable it when looking at it throughly
354−#ifdef INSPECTION
355−-- inspect $ hasNoTypeClasses 'dropInterval
356−-- inspect $ 'dropInterval `hasNoType` ''D.Step
357−#endif
358−
359{-# INLINE findIndices #-}
470{-# INLINE findIndices #-}
360findIndices :: MonadIO m => Int -> Int -> Stream m Int -> m ()
471findIndices :: MonadIO m => Int -> Int -> Stream m Int -> m ()
361findIndices value n = composeN n $ Stream.findIndices (== (value + 1))
472findIndices value n = composeN n $ Stream.findIndices (== (value + 1))
@@ -410,8 +521,10 @@ o_1_space_filtering value =
410 -- , benchIOSink value "takeWhileM-true" (_takeWhileMTrue value 1)
521 -- , benchIOSink value "takeWhileM-true" (_takeWhileMTrue value 1)
411 , benchIOSink value "drop-one" (dropOne 1)
522 , benchIOSink value "drop-one" (dropOne 1)
412 , benchIOSink value "drop-all" (dropAll value 1)
523 , benchIOSink value "drop-all" (dropAll value 1)
524+#if !defined(USE_STREAMLY_CORE) && !defined(USE_PRELUDE)
413 , benchIOSink value "takeInterval-all" (takeInterval 10000 1)
525 , benchIOSink value "takeInterval-all" (takeInterval 10000 1)
414 , benchIOSink value "dropInterval-all" (dropInterval 10000 1)
526 , benchIOSink value "dropInterval-all" (dropInterval 10000 1)
527+#endif
415 , benchIOSink value "dropWhile-true" (dropWhileTrue value 1)
528 , benchIOSink value "dropWhile-true" (dropWhileTrue value 1)
416 -- , benchIOSink value "dropWhileM-true" (_dropWhileMTrue value 1)
529 -- , benchIOSink value "dropWhileM-true" (_dropWhileMTrue value 1)
417 , benchIOSink
530 , benchIOSink
@@ -563,7 +676,12 @@ benchmarks moduleName size =
563 , o_1_space_indexingX4 size
676 , o_1_space_indexingX4 size
564 ]
677 ]
565 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
678 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
679+ [
680+#ifdef USE_STREAMK
566− [ o_n_space_traversable size
681+ o_n_space_traversable size
682+ ,
683+#endif
567− , o_n_space_mapping size
684+ o_n_space_mapping size
685+ , o_n_space_iterated size
568 ]
686 ]
569 ]
687 ]
benchmark/Streamly/Benchmark/Data/Unfold.hs+17−8
@@ -31,18 +31,18 @@ import qualified Prelude
31import qualified Streamly.FileSystem.Handle as FH
31import qualified Streamly.FileSystem.Handle as FH
32import qualified Streamly.Internal.Data.Fold as FL
32import qualified Streamly.Internal.Data.Fold as FL
33import qualified Streamly.Internal.Data.Unfold as UF
33import qualified Streamly.Internal.Data.Unfold as UF
34−import qualified Streamly.Internal.Data.Unfold.Exception as UF
34+import qualified Streamly.Internal.Data.Unfold.Prelude as UF
35import qualified Streamly.Internal.Data.Stream as S
35import qualified Streamly.Internal.Data.Stream as S
36−import qualified Streamly.Internal.Data.Stream.StreamD as D
36+import qualified Streamly.Internal.Data.Stream as D
37−import qualified Streamly.Internal.Data.Stream.StreamK as K
37+import qualified Streamly.Internal.Data.StreamK as K
38
38
39−
40−import Gauge hiding (env)
39+import Test.Tasty.Bench hiding (env)
41import Prelude hiding (take, filter, zipWith, map, mapM, takeWhile)
40import Prelude hiding (take, filter, zipWith, map, mapM, takeWhile)
42import Streamly.Benchmark.Common
41import Streamly.Benchmark.Common
43import Streamly.Benchmark.Common.Handle
42import Streamly.Benchmark.Common.Handle
44
43
45#ifdef INSPECTION
44#ifdef INSPECTION
45+import Control.Monad.Catch (MonadCatch)
46import Test.Inspection
46import Test.Inspection
47#endif
47#endif
48
48
@@ -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.apply` s) start
430+ in UF.fold FL.drain ((+) `fmap` s `UF.crossApply` s) start
431
431
432{-# INLINE _apDiscardFst #-}
432{-# INLINE _apDiscardFst #-}
433_apDiscardFst :: Int -> Int -> m ()
433_apDiscardFst :: Int -> Int -> m ()
@@ -753,7 +753,7 @@ readWriteOnExceptionUnfold inh devNull =
753 in S.fold (FH.write devNull) $ S.unfold readEx inh
753 in S.fold (FH.write devNull) $ S.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
@@ -765,7 +765,8 @@ readWriteHandleExceptionUnfold inh devNull =
765 in S.fold (FH.write devNull) $ S.unfold readEx inh
765 in S.fold (FH.write devNull) $ S.unfold readEx inh
766
766
767#ifdef INSPECTION
767#ifdef INSPECTION
768+-- hasNoTypeClasses started failing in GHC 9.4.4
768−inspect $ hasNoTypeClasses 'readWriteHandleExceptionUnfold
769+-- inspect $ hasNoTypeClasses 'readWriteHandleExceptionUnfold
769-- inspect $ 'readWriteHandleExceptionUnfold `hasNoType` ''Step
770-- inspect $ 'readWriteHandleExceptionUnfold `hasNoType` ''Step
770#endif
771#endif
771
772
@@ -776,7 +777,11 @@ readWriteFinally_Unfold inh devNull =
776 in S.fold (FH.write devNull) $ S.unfold readEx inh
777 in S.fold (FH.write devNull) $ S.unfold readEx inh
777
778
778#ifdef INSPECTION
779#ifdef INSPECTION
780+#if __GLASGOW_HASKELL__ >= 906
781+inspect $ hasNoTypeClassesExcept 'readWriteFinally_Unfold [''MonadCatch]
782+#else
779inspect $ hasNoTypeClasses 'readWriteFinally_Unfold
783inspect $ hasNoTypeClasses 'readWriteFinally_Unfold
784+#endif
780-- inspect $ 'readWriteFinallyUnfold `hasNoType` ''Step
785-- inspect $ 'readWriteFinallyUnfold `hasNoType` ''Step
781#endif
786#endif
782
787
@@ -792,7 +797,11 @@ readWriteBracket_Unfold inh devNull =
792 in S.fold (FH.write devNull) $ S.unfold readEx inh
797 in S.fold (FH.write devNull) $ S.unfold readEx inh
793
798
794#ifdef INSPECTION
799#ifdef INSPECTION
800+#if __GLASGOW_HASKELL__ >= 906
801+inspect $ hasNoTypeClassesExcept 'readWriteBracket_Unfold [''MonadCatch]
802+#else
795inspect $ hasNoTypeClasses 'readWriteBracket_Unfold
803inspect $ hasNoTypeClasses 'readWriteBracket_Unfold
804+#endif
796-- inspect $ 'readWriteBracketUnfold `hasNoType` ''Step
805-- inspect $ 'readWriteBracketUnfold `hasNoType` ''Step
797#endif
806#endif
798
807
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 Gauge hiding (env)
25+import Test.Tasty.Bench 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−45
@@ -29,25 +29,26 @@ import GHC.Magic (inline)
29import GHC.Magic (noinline)
29import GHC.Magic (noinline)
30import System.IO (Handle)
30import System.IO (Handle)
31
31
32+import qualified Streamly.Data.Stream as Stream
33+import qualified Streamly.Data.Fold as Fold
32import qualified Streamly.FileSystem.Handle as FH
34import qualified Streamly.FileSystem.Handle as FH
33import qualified Streamly.Internal.Data.Array as A
35import qualified Streamly.Internal.Data.Array as A
34−import qualified Streamly.Internal.Data.Array.Type as AT
35import qualified Streamly.Internal.Data.Fold as FL
36import qualified Streamly.Internal.Data.Fold as FL
36−import qualified Streamly.Internal.Data.Stream.IsStream as IP
37+import qualified Streamly.Internal.Data.Stream as IP
37import qualified Streamly.Internal.FileSystem.Handle as IFH
38import qualified Streamly.Internal.FileSystem.Handle as IFH
38import qualified Streamly.Internal.Unicode.Stream as IUS
39import qualified Streamly.Internal.Unicode.Stream as IUS
39−import qualified Streamly.Prelude as S
40+import qualified Streamly.Data.Stream.Prelude as S
40import qualified Streamly.Unicode.Stream as SS
41import qualified Streamly.Unicode.Stream as SS
41
42
42−import Gauge hiding (env)
43+import Test.Tasty.Bench hiding (env)
43import Prelude hiding (last, length)
44import Prelude hiding (last, length)
44import Streamly.Benchmark.Common.Handle
45import Streamly.Benchmark.Common.Handle
45
46
46#ifdef INSPECTION
47#ifdef INSPECTION
47−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..), FoldMany)
48+import Streamly.Internal.Data.Stream (Step(..), FoldMany)
48
49
49−import qualified Streamly.Internal.Data.Array.Mut.Type as MA
50+import qualified Streamly.Internal.Data.MutArray as MutArray
50−import qualified Streamly.Internal.Data.Stream.StreamD as D
51+import qualified Streamly.Internal.Data.Stream as D
51import qualified Streamly.Internal.Data.Unfold as IUF
52import qualified Streamly.Internal.Data.Unfold as IUF
52
53
53import Test.Inspection
54import Test.Inspection
@@ -61,31 +62,31 @@ import Test.Inspection
61
62
62-- | Get the last byte from a file bytestream.
63-- | Get the last byte from a file bytestream.
63readLast :: Handle -> IO (Maybe Word8)
64readLast :: Handle -> IO (Maybe Word8)
64−readLast = S.last . S.unfold FH.reader
65+readLast = S.fold Fold.last . S.unfold FH.reader
65
66
66#ifdef INSPECTION
67#ifdef INSPECTION
67inspect $ hasNoTypeClasses 'readLast
68inspect $ hasNoTypeClasses 'readLast
68inspect $ 'readLast `hasNoType` ''Step -- S.unfold
69inspect $ 'readLast `hasNoType` ''Step -- S.unfold
69inspect $ 'readLast `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
70inspect $ 'readLast `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
70−inspect $ 'readLast `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
71+inspect $ 'readLast `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
71#endif
72#endif
72
73
73-- assert that flattenArrays constructors are not present
74-- assert that flattenArrays constructors are not present
74-- | Count the number of bytes in a file.
75-- | Count the number of bytes in a file.
75readCountBytes :: Handle -> IO Int
76readCountBytes :: Handle -> IO Int
76−readCountBytes = S.length . S.unfold FH.reader
77+readCountBytes = S.fold Fold.length . S.unfold FH.reader
77
78
78#ifdef INSPECTION
79#ifdef INSPECTION
79inspect $ hasNoTypeClasses 'readCountBytes
80inspect $ hasNoTypeClasses 'readCountBytes
80inspect $ 'readCountBytes `hasNoType` ''Step -- S.unfold
81inspect $ 'readCountBytes `hasNoType` ''Step -- S.unfold
81inspect $ 'readCountBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
82inspect $ 'readCountBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
82−inspect $ 'readCountBytes `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
83+inspect $ 'readCountBytes `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
83#endif
84#endif
84
85
85-- | Count the number of lines in a file.
86-- | Count the number of lines in a file.
86readCountLines :: Handle -> IO Int
87readCountLines :: Handle -> IO Int
87readCountLines =
88readCountLines =
88− S.length
89+ S.fold Fold.length
89 . IUS.lines FL.drain
90 . IUS.lines FL.drain
90 . SS.decodeLatin1
91 . SS.decodeLatin1
91 . S.unfold FH.reader
92 . S.unfold FH.reader
@@ -94,13 +95,13 @@ readCountLines =
94inspect $ hasNoTypeClasses 'readCountLines
95inspect $ hasNoTypeClasses 'readCountLines
95inspect $ 'readCountLines `hasNoType` ''Step
96inspect $ 'readCountLines `hasNoType` ''Step
96inspect $ 'readCountLines `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
97inspect $ 'readCountLines `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
97−inspect $ 'readCountLines `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
98+inspect $ 'readCountLines `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
98#endif
99#endif
99
100
100-- | Count the number of words in a file.
101-- | Count the number of words in a file.
101readCountWords :: Handle -> IO Int
102readCountWords :: Handle -> IO Int
102readCountWords =
103readCountWords =
103− S.length
104+ S.fold Fold.length
104 . IUS.words FL.drain
105 . IUS.words FL.drain
105 . SS.decodeLatin1
106 . SS.decodeLatin1
106 . S.unfold FH.reader
107 . S.unfold FH.reader
@@ -112,13 +113,13 @@ inspect $ hasNoTypeClasses 'readCountWords
112
113
113-- | Sum the bytes in a file.
114-- | Sum the bytes in a file.
114readSumBytes :: Handle -> IO Word8
115readSumBytes :: Handle -> IO Word8
115−readSumBytes = S.sum . S.unfold FH.reader
116+readSumBytes = S.fold Fold.sum . S.unfold FH.reader
116
117
117#ifdef INSPECTION
118#ifdef INSPECTION
118inspect $ hasNoTypeClasses 'readSumBytes
119inspect $ hasNoTypeClasses 'readSumBytes
119inspect $ 'readSumBytes `hasNoType` ''Step
120inspect $ 'readSumBytes `hasNoType` ''Step
120inspect $ 'readSumBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
121inspect $ 'readSumBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
121−inspect $ 'readSumBytes `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
122+inspect $ 'readSumBytes `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
122#endif
123#endif
123
124
124-- XXX When we mark this with INLINE and we have two benchmarks using S.drain
125-- XXX When we mark this with INLINE and we have two benchmarks using S.drain
@@ -132,19 +133,19 @@ inspect $ 'readSumBytes `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
132-- fusion-plugin to propagate INLINE phase information such that this problem
133-- fusion-plugin to propagate INLINE phase information such that this problem
133-- does not occur.
134-- does not occur.
134readDrain :: Handle -> IO ()
135readDrain :: Handle -> IO ()
135−readDrain inh = S.drain $ S.unfold FH.reader inh
136+readDrain inh = S.fold Fold.drain $ S.unfold FH.reader inh
136
137
137-- XXX investigate why we need an INLINE in this case (GHC)
138-- XXX investigate why we need an INLINE in this case (GHC)
138{-# INLINE readDecodeLatin1 #-}
139{-# INLINE readDecodeLatin1 #-}
139readDecodeLatin1 :: Handle -> IO ()
140readDecodeLatin1 :: Handle -> IO ()
140readDecodeLatin1 inh =
141readDecodeLatin1 inh =
141− S.drain
142+ S.fold Fold.drain
142 $ SS.decodeLatin1
143 $ SS.decodeLatin1
143 $ S.unfold FH.reader inh
144 $ S.unfold FH.reader inh
144
145
145readDecodeUtf8 :: Handle -> IO ()
146readDecodeUtf8 :: Handle -> IO ()
146readDecodeUtf8 inh =
147readDecodeUtf8 inh =
147− S.drain
148+ S.fold Fold.drain
148 $ SS.decodeUtf8
149 $ SS.decodeUtf8
149 $ S.unfold FH.reader inh
150 $ S.unfold FH.reader inh
150
151
@@ -187,7 +188,7 @@ o_1_space_reduce_read env =
187-- | Count the number of lines in a file.
188-- | Count the number of lines in a file.
188getChunksConcatUnfoldCountLines :: Handle -> IO Int
189getChunksConcatUnfoldCountLines :: Handle -> IO Int
189getChunksConcatUnfoldCountLines inh =
190getChunksConcatUnfoldCountLines inh =
190− S.length
191+ S.fold Fold.length
191 $ IUS.lines FL.drain
192 $ IUS.lines FL.drain
192 $ SS.decodeLatin1
193 $ SS.decodeLatin1
193 -- XXX replace with toBytes
194 -- XXX replace with toBytes
@@ -212,46 +213,51 @@ o_1_space_reduce_toBytes env =
212-------------------------------------------------------------------------------
213-------------------------------------------------------------------------------
213
214
214chunksOfSum :: Int -> Handle -> IO Int
215chunksOfSum :: Int -> Handle -> IO Int
216+chunksOfSum n inh =
215−chunksOfSum n inh = S.length $ S.chunksOf n FL.sum (S.unfold FH.reader inh)
217+ S.fold Fold.length $ IP.groupsOf n FL.sum (S.unfold FH.reader inh)
216
218
217foldManyPostChunksOfSum :: Int -> Handle -> IO Int
219foldManyPostChunksOfSum :: Int -> Handle -> IO Int
218foldManyPostChunksOfSum n inh =
220foldManyPostChunksOfSum n inh =
221+ S.fold Fold.length
219− S.length $ IP.foldManyPost (FL.take n FL.sum) (S.unfold FH.reader inh)
222+ $ IP.foldManyPost (FL.take n FL.sum) (S.unfold FH.reader inh)
220
223
221foldManyChunksOfSum :: Int -> Handle -> IO Int
224foldManyChunksOfSum :: Int -> Handle -> IO Int
222foldManyChunksOfSum n inh =
225foldManyChunksOfSum n inh =
226+ S.fold Fold.length
223− S.length $ IP.foldMany (FL.take n FL.sum) (S.unfold FH.reader inh)
227+ $ IP.foldMany (FL.take n FL.sum) (S.unfold FH.reader inh)
224
228
225-- XXX investigate why we need an INLINE in this case (GHC)
229-- XXX investigate why we need an INLINE in this case (GHC)
226-- Even though allocations remain the same in both cases inlining improves time
230-- Even though allocations remain the same in both cases inlining improves time
227-- by 4x.
231-- by 4x.
228-- | Slice in chunks of size n and get the count of chunks.
232-- | Slice in chunks of size n and get the count of chunks.
229−{-# INLINE chunksOf #-}
233+{-# INLINE groupsOf #-}
230−chunksOf :: Int -> Handle -> IO Int
234+groupsOf :: Int -> Handle -> IO Int
231−chunksOf n inh =
235+groupsOf n inh =
232 -- writeNUnsafe gives 2.5x boost here over writeN.
236 -- writeNUnsafe gives 2.5x boost here over writeN.
237+ S.fold Fold.length
233− S.length $ S.chunksOf n (AT.writeNUnsafe n) (S.unfold FH.reader inh)
238+ $ IP.groupsOf n (A.writeNUnsafe n) (S.unfold FH.reader inh)
234
239
235#ifdef INSPECTION
240#ifdef INSPECTION
236−inspect $ hasNoTypeClasses 'chunksOf
241+inspect $ hasNoTypeClasses 'groupsOf
237−inspect $ 'chunksOf `hasNoType` ''Step
242+inspect $ 'groupsOf `hasNoType` ''Step
238−inspect $ 'chunksOf `hasNoType` ''FoldMany
243+inspect $ 'groupsOf `hasNoType` ''FoldMany
239−inspect $ 'chunksOf `hasNoType` ''AT.ArrayUnsafe -- AT.writeNUnsafe
244+inspect $ 'groupsOf `hasNoType` ''MutArray.ArrayUnsafe -- AT.writeNUnsafe
240 -- FH.read/A.read
245 -- FH.read/A.read
241−inspect $ 'chunksOf `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
246+inspect $ 'groupsOf `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
242#endif
247#endif
243
248
244−{-# INLINE arraysOf #-}
249+{-# INLINE chunksOf #-}
245−arraysOf :: Int -> Handle -> IO Int
250+chunksOf :: Int -> Handle -> IO Int
251+chunksOf n inh =
246−arraysOf n inh = S.length $ IP.arraysOf n (S.unfold FH.reader inh)
252+ S.fold Fold.length $ Stream.chunksOf n (S.unfold FH.reader inh)
247
253
248o_1_space_reduce_read_grouped :: BenchEnv -> [Benchmark]
254o_1_space_reduce_read_grouped :: BenchEnv -> [Benchmark]
249o_1_space_reduce_read_grouped env =
255o_1_space_reduce_read_grouped env =
250 [ bgroup "reduce/read/chunks"
256 [ bgroup "reduce/read/chunks"
251− [ mkBench ("S.chunksOf " ++ show (bigSize env) ++ " FL.sum") env $
257+ [ mkBench ("S.groupsOf " ++ show (bigSize env) ++ " FL.sum") env $
252 \inh _ ->
258 \inh _ ->
253 chunksOfSum (bigSize env) inh
259 chunksOfSum (bigSize env) inh
254− , mkBench "S.chunksOf 1 FL.sum" env $ \inh _ ->
260+ , mkBench "S.groupsOf 1 FL.sum" env $ \inh _ ->
255 chunksOfSum 1 inh
261 chunksOfSum 1 inh
256
262
257 -- XXX investigate why we need inline/noinline in these cases (GHC)
263 -- XXX investigate why we need inline/noinline in these cases (GHC)
@@ -274,20 +280,20 @@ o_1_space_reduce_read_grouped env =
274 $ \inh _ -> inline foldManyChunksOfSum 1 inh
280 $ \inh _ -> inline foldManyChunksOfSum 1 inh
275
281
276 -- folding chunks to arrays
282 -- 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
277 , mkBenchSmall "S.chunksOf 1" env $ \inh _ ->
291 , mkBenchSmall "S.chunksOf 1" env $ \inh _ ->
278 chunksOf 1 inh
292 chunksOf 1 inh
279 , mkBench "S.chunksOf 10" env $ \inh _ ->
293 , mkBench "S.chunksOf 10" env $ \inh _ ->
280 chunksOf 10 inh
294 chunksOf 10 inh
281 , mkBench "S.chunksOf 1000" env $ \inh _ ->
295 , mkBench "S.chunksOf 1000" env $ \inh _ ->
282 chunksOf 1000 inh
296 chunksOf 1000 inh
283−
284− -- arraysOf may use a different impl than chunksOf
285− , mkBenchSmall "S.arraysOf 1" env $ \inh _ ->
286− arraysOf 1 inh
287− , mkBench "S.arraysOf 10" env $ \inh _ ->
288− arraysOf 10 inh
289− , mkBench "S.arraysOf 1000" env $ \inh _ ->
290− arraysOf 1000 inh
291 ]
297 ]
292 ]
298 ]
293
299
benchmark/Streamly/Benchmark/FileSystem/Handle/ReadWrite.hs+12−13
@@ -32,18 +32,17 @@ import qualified Streamly.FileSystem.Handle as FH
32import qualified Streamly.Internal.Data.Unfold as IUF
32import qualified Streamly.Internal.Data.Unfold as IUF
33import qualified Streamly.Internal.FileSystem.Handle as IFH
33import qualified Streamly.Internal.FileSystem.Handle as IFH
34import qualified Streamly.Data.Array as A
34import qualified Streamly.Data.Array as A
35−import qualified Streamly.Prelude as S
35+import qualified Streamly.Data.Stream.Prelude as S
36
36
37−import Gauge hiding (env)
37+import Test.Tasty.Bench hiding (env)
38import Streamly.Benchmark.Common.Handle
38import Streamly.Benchmark.Common.Handle
39
39
40#ifdef INSPECTION
40#ifdef INSPECTION
41−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
41+import Streamly.Internal.Data.Stream (Step(..))
42
42
43−import qualified Streamly.Internal.Data.Stream.StreamD.Type as D
43+import qualified Streamly.Internal.Data.Stream as D
44import qualified Streamly.Internal.Data.Tuple.Strict as Strict
44import qualified Streamly.Internal.Data.Tuple.Strict as Strict
45−import qualified Streamly.Internal.Data.Array.Mut.Stream as MAS
45+import qualified Streamly.Internal.Data.MutArray as MutArray
46−import qualified Streamly.Internal.Data.Array.Type as AT
47
46
48import Test.Inspection
47import Test.Inspection
49#endif
48#endif
@@ -83,7 +82,7 @@ copyStream inh outh = S.fold (FH.write outh) (S.unfold FH.reader inh)
83inspect $ hasNoTypeClasses 'copyStream
82inspect $ hasNoTypeClasses 'copyStream
84inspect $ 'copyStream `hasNoType` ''Step -- S.unfold
83inspect $ 'copyStream `hasNoType` ''Step -- S.unfold
85inspect $ 'copyStream `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
84inspect $ 'copyStream `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
86−inspect $ 'copyStream `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
85+inspect $ 'copyStream `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
87 -- FH.read/A.read
86 -- FH.read/A.read
88inspect $ 'copyStream `hasNoType` ''Strict.Tuple3' -- FH.write/chunksOf
87inspect $ 'copyStream `hasNoType` ''Strict.Tuple3' -- FH.write/chunksOf
89#endif
88#endif
@@ -109,8 +108,8 @@ readFromBytesNull inh devNull = IFH.putBytes devNull $ S.unfold FH.reader inh
109#ifdef INSPECTION
108#ifdef INSPECTION
110inspect $ hasNoTypeClasses 'readFromBytesNull
109inspect $ hasNoTypeClasses 'readFromBytesNull
111inspect $ 'readFromBytesNull `hasNoType` ''Step
110inspect $ 'readFromBytesNull `hasNoType` ''Step
112−inspect $ 'readFromBytesNull `hasNoType` ''MAS.SpliceState
111+inspect $ 'readFromBytesNull `hasNoType` ''MutArray.SpliceState
113−inspect $ 'readFromBytesNull `hasNoType` ''AT.ArrayUnsafe -- FH.fromBytes/S.arraysOf
112+inspect $ 'readFromBytesNull `hasNoType` ''MutArray.ArrayUnsafe -- FH.fromBytes/S.chunksOf
114inspect $ 'readFromBytesNull `hasNoType` ''D.FoldMany
113inspect $ 'readFromBytesNull `hasNoType` ''D.FoldMany
115#endif
114#endif
116
115
@@ -123,8 +122,8 @@ readWithFromBytesNull inh devNull =
123#ifdef INSPECTION
122#ifdef INSPECTION
124inspect $ hasNoTypeClasses 'readWithFromBytesNull
123inspect $ hasNoTypeClasses 'readWithFromBytesNull
125inspect $ 'readWithFromBytesNull `hasNoType` ''Step
124inspect $ 'readWithFromBytesNull `hasNoType` ''Step
126−inspect $ 'readWithFromBytesNull `hasNoType` ''MAS.SpliceState
125+inspect $ 'readWithFromBytesNull `hasNoType` ''MutArray.SpliceState
127−inspect $ 'readWithFromBytesNull `hasNoType` ''AT.ArrayUnsafe -- FH.fromBytes/S.arraysOf
126+inspect $ 'readWithFromBytesNull `hasNoType` ''MutArray.ArrayUnsafe -- FH.fromBytes/S.chunksOf
128inspect $ 'readWithFromBytesNull `hasNoType` ''D.FoldMany
127inspect $ 'readWithFromBytesNull `hasNoType` ''D.FoldMany
129#endif
128#endif
130
129
@@ -171,7 +170,7 @@ writeReadWith inh devNull = IUF.fold fld unf (defaultChunkSize, inh)
171inspect $ hasNoTypeClasses 'writeReadWith
170inspect $ hasNoTypeClasses 'writeReadWith
172inspect $ 'writeReadWith `hasNoType` ''Step
171inspect $ 'writeReadWith `hasNoType` ''Step
173inspect $ 'writeReadWith `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
172inspect $ 'writeReadWith `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
174−inspect $ 'writeReadWith `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
173+inspect $ 'writeReadWith `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
175 -- FH.read/A.read
174 -- FH.read/A.read
176#endif
175#endif
177
176
@@ -188,7 +187,7 @@ writeRead inh devNull = IUF.fold fld unf inh
188inspect $ hasNoTypeClasses 'writeRead
187inspect $ hasNoTypeClasses 'writeRead
189inspect $ 'writeRead `hasNoType` ''Step
188inspect $ 'writeRead `hasNoType` ''Step
190inspect $ 'writeRead `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
189inspect $ 'writeRead `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
191−inspect $ 'writeRead `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
190+inspect $ 'writeRead `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
192 -- FH.read/A.read
191 -- FH.read/A.read
193#endif
192#endif
194
193
benchmark/Streamly/Benchmark/Prelude/Adaptive.hs+9−6
@@ -10,7 +10,7 @@
10import Control.Concurrent (threadDelay)
10import Control.Concurrent (threadDelay)
11import Control.Monad (when)
11import Control.Monad (when)
12import Control.Monad.IO.Class (liftIO)
12import Control.Monad.IO.Class (liftIO)
13−import Gauge
13+import Test.Tasty.Bench
14import Streamly.Prelude as S
14import Streamly.Prelude as S
15import System.Random (randomRIO)
15import System.Random (randomRIO)
16
16
@@ -36,11 +36,14 @@ source range = S.replicateM value $ do
36
36
37{-# INLINE run #-}
37{-# INLINE run #-}
38run :: IsStream t => (Int, Int) -> (Int, Int) -> (t IO Int -> SerialT IO Int) -> IO ()
38run :: IsStream t => (Int, Int) -> (Int, Int) -> (t IO Int -> SerialT IO Int) -> IO ()
39−run srange crange t = S.drain $ do
39+run srange crange t = S.drain $ S.mapM action (t $ source srange)
40− n <- t $ source srange
40+
41+ where
42+
43+ action x = liftIO $ do
41− d <- liftIO (randomRIO crange)
44+ d <- randomRIO crange
42− when (d /= 0) $ liftIO $ threadDelay d
45+ when (d /= 0) $ threadDelay d
43− return n
46+ return x
44
47
45low, medium, high :: Int
48low, medium, high :: Int
46low = 10
49low = 10
benchmark/Streamly/Benchmark/Prelude/Ahead.hs+1−1
@@ -15,7 +15,7 @@ import qualified Streamly.Prelude as S
15import Streamly.Benchmark.Common
15import Streamly.Benchmark.Common
16import Streamly.Benchmark.Prelude
16import Streamly.Benchmark.Prelude
17
17
18−import Gauge
18+import Test.Tasty.Bench
19
19
20moduleName :: String
20moduleName :: String
21moduleName = "Prelude.Ahead"
21moduleName = "Prelude.Ahead"
benchmark/Streamly/Benchmark/Prelude/Async.hs+1−1
@@ -16,7 +16,7 @@ import qualified Streamly.Internal.Data.Stream.IsStream.Transform as Transform
16import Streamly.Benchmark.Common
16import Streamly.Benchmark.Common
17import Streamly.Benchmark.Prelude
17import Streamly.Benchmark.Prelude
18
18
19−import Gauge
19+import Test.Tasty.Bench
20
20
21moduleName :: String
21moduleName :: String
22moduleName = "Prelude.Async"
22moduleName = "Prelude.Async"
benchmark/Streamly/Benchmark/Prelude/Concurrent.hs+1−1
@@ -15,7 +15,7 @@ import Streamly.Prelude
15 , fromWAsync, parallel, fromParallel
15 , fromWAsync, parallel, fromParallel
16 )
16 )
17
17
18−import Gauge
18+import Test.Tasty.Bench
19import qualified Streamly.Prelude as S
19import qualified Streamly.Prelude as S
20
20
21-------------------------------------------------------------------------------
21-------------------------------------------------------------------------------
benchmark/Streamly/Benchmark/Prelude/Merge.hs+2−2
@@ -30,13 +30,13 @@ import qualified Streamly.Internal.Data.Stream.IsStream as Stream
30import Streamly.Benchmark.Common
30import Streamly.Benchmark.Common
31import Streamly.Benchmark.Prelude
31import Streamly.Benchmark.Prelude
32
32
33−import Gauge
33+import Test.Tasty.Bench
34
34
35#ifdef INSPECTION
35#ifdef INSPECTION
36import GHC.Types (SPEC(..))
36import GHC.Types (SPEC(..))
37import Test.Inspection
37import Test.Inspection
38
38
39−import qualified Streamly.Internal.Data.Stream.StreamD as D
39+import qualified Streamly.Internal.Data.Stream as D
40#endif
40#endif
41
41
42moduleName :: String
42moduleName :: String
benchmark/Streamly/Benchmark/Prelude/Parallel.hs+1−1
@@ -22,7 +22,7 @@ import qualified Streamly.Internal.Data.Stream.IsStream as Internal
22import Streamly.Benchmark.Common
22import Streamly.Benchmark.Common
23import Streamly.Benchmark.Prelude
23import Streamly.Benchmark.Prelude
24
24
25−import Gauge
25+import Test.Tasty.Bench
26
26
27moduleName :: String
27moduleName :: String
28moduleName = "Prelude.Parallel"
28moduleName = "Prelude.Parallel"
benchmark/Streamly/Benchmark/Prelude/Rate.hs+1−1
@@ -14,7 +14,7 @@ import qualified Streamly.Prelude as S
14import Streamly.Benchmark.Common
14import Streamly.Benchmark.Common
15import Streamly.Benchmark.Prelude
15import Streamly.Benchmark.Prelude
16
16
17−import Gauge
17+import Test.Tasty.Bench
18
18
19moduleName :: String
19moduleName :: String
20moduleName = "Prelude.Rate"
20moduleName = "Prelude.Rate"
benchmark/Streamly/Benchmark/Prelude/WAsync.hs+1−1
@@ -15,7 +15,7 @@ import qualified Streamly.Prelude as S
15import Streamly.Benchmark.Common
15import Streamly.Benchmark.Common
16import Streamly.Benchmark.Prelude
16import Streamly.Benchmark.Prelude
17
17
18−import Gauge
18+import Test.Tasty.Bench
19
19
20moduleName :: String
20moduleName :: String
21moduleName = "Prelude.WAsync"
21moduleName = "Prelude.WAsync"
benchmark/Streamly/Benchmark/Prelude/WSerial.hs+2−2
@@ -29,13 +29,13 @@ import qualified Streamly.Internal.Data.Unfold as UF
29import Streamly.Benchmark.Common
29import Streamly.Benchmark.Common
30import Streamly.Benchmark.Prelude
30import Streamly.Benchmark.Prelude
31
31
32−import Gauge
32+import Test.Tasty.Bench
33
33
34#ifdef INSPECTION
34#ifdef INSPECTION
35import GHC.Types (SPEC(..))
35import GHC.Types (SPEC(..))
36import Test.Inspection
36import Test.Inspection
37
37
38−import qualified Streamly.Internal.Data.Stream.StreamD as D
38+import qualified Streamly.Internal.Data.Stream as D
39#endif
39#endif
40
40
41moduleName :: String
41moduleName :: String
benchmark/Streamly/Benchmark/Prelude/ZipAsync.hs+1−1
@@ -15,7 +15,7 @@ import qualified Streamly.Prelude as S
15import Streamly.Benchmark.Common
15import Streamly.Benchmark.Common
16import Streamly.Benchmark.Prelude
16import Streamly.Benchmark.Prelude
17
17
18−import Gauge
18+import Test.Tasty.Bench
19
19
20moduleName :: String
20moduleName :: String
21moduleName = "Prelude.ZipAsync"
21moduleName = "Prelude.ZipAsync"
benchmark/Streamly/Benchmark/Prelude/ZipSerial.hs+2−2
@@ -29,13 +29,13 @@ import qualified Streamly.Prelude as S
29import Streamly.Benchmark.Common
29import Streamly.Benchmark.Common
30import Streamly.Benchmark.Prelude hiding (sourceUnfoldrM)
30import Streamly.Benchmark.Prelude hiding (sourceUnfoldrM)
31
31
32−import Gauge
32+import Test.Tasty.Bench
33
33
34#ifdef INSPECTION
34#ifdef INSPECTION
35import GHC.Types (SPEC(..))
35import GHC.Types (SPEC(..))
36import Test.Inspection
36import Test.Inspection
37
37
38−import qualified Streamly.Internal.Data.Stream.StreamD as D
38+import qualified Streamly.Internal.Data.Stream as D
39#endif
39#endif
40
40
41moduleName :: String
41moduleName :: String
benchmark/Streamly/Benchmark/Unicode/Char.hs+11−5
@@ -1,4 +1,4 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
1+{-# OPTIONS_GHC -Wno-deprecations -Wno-orphans #-}
2
2
3--
3--
4-- Module : Streamly.Unicode.Char
4-- Module : Streamly.Unicode.Char
@@ -12,11 +12,11 @@
12-- Imports
12-- Imports
13--------------------------------------------------------------------------------
13--------------------------------------------------------------------------------
14
14
15−import Control.DeepSeq (NFData)
15+import Control.DeepSeq (NFData(..))
16import Streamly.Internal.Data.Array (Array)
16import Streamly.Internal.Data.Array (Array)
17import System.FilePath (dropExtensions, takeFileName)
17import System.FilePath (dropExtensions, takeFileName)
18import System.FilePath.Posix ((</>))
18import System.FilePath.Posix ((</>))
19−import Gauge.Main (Benchmark, bench, bgroup, defaultMain, env, nfIO)
19+import Test.Tasty.Bench (Benchmark, bench, bgroup, defaultMain, env, nfIO)
20import Streamly.Internal.Unicode.Char
20import Streamly.Internal.Unicode.Char
21 ( NormalizationMode(NFC, NFD, NFKC, NFKD)
21 ( NormalizationMode(NFC, NFD, NFKC, NFKD)
22 , normalize
22 , normalize
@@ -24,7 +24,7 @@ import Streamly.Internal.Unicode.Char
24import Streamly.Benchmark.Common (o_1_space_prefix)
24import Streamly.Benchmark.Common (o_1_space_prefix)
25
25
26import qualified Streamly.Internal.Data.Array as Array
26import qualified Streamly.Internal.Data.Array as Array
27−import qualified Streamly.Internal.Data.Stream.IsStream as IsStream
27+import qualified Streamly.Internal.Data.Stream as IsStream
28import qualified System.Directory as Dir
28import qualified System.Directory as Dir
29
29
30--------------------------------------------------------------------------------
30--------------------------------------------------------------------------------
@@ -43,7 +43,13 @@ dataDir = "benchmark/Streamly/Benchmark/Unicode/data"
43dataSetSize :: Int
43dataSetSize :: Int
44dataSetSize = 1000000
44dataSetSize = 1000000
45
45
46+-- Unboxed arrays are fully evaluated.
47+instance NFData (Array a) where
48+ {-# INLINE rnf #-}
49+ rnf _ = ()
50+
51+makeBench ::
46−makeBench :: (NFData a) => (String, a -> IO ()) -> (String, IO a) -> Benchmark
52+ (String, Array Char -> IO ()) -> (String, IO (Array Char)) -> Benchmark
47makeBench (implName, func) (dataName, setup) =
53makeBench (implName, func) (dataName, setup) =
48 env setup (bench (implName ++ "/" ++ dataName) . nfIO . func)
54 env setup (bench (implName ++ "/" ++ dataName) . nfIO . func)
49
55
benchmark/Streamly/Benchmark/Unicode/Parser.hsnew file+107
@@ -0,0 +1,107 @@
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+40−14
@@ -11,6 +11,11 @@
11{-# LANGUAGE CPP #-}
11{-# LANGUAGE CPP #-}
12{-# LANGUAGE ScopedTypeVariables #-}
12{-# LANGUAGE ScopedTypeVariables #-}
13
13
14+#undef FUSION_CHECK
15+#ifdef FUSION_CHECK
16+{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
17+#endif
18+
14#ifdef __HADDOCK_VERSION__
19#ifdef __HADDOCK_VERSION__
15#undef INSPECTION
20#undef INSPECTION
16#endif
21#endif
@@ -20,27 +25,30 @@
20{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
25{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
21#endif
26#endif
22
27
28+import Streamly.Data.Stream (Stream)
29+import Streamly.Data.Fold (Fold)
23import Prelude hiding (last, length)
30import Prelude hiding (last, length)
24import System.IO (Handle)
31import System.IO (Handle)
25
32
26import qualified Streamly.Data.Array as Array
33import qualified Streamly.Data.Array as Array
27import qualified Streamly.Data.Fold as Fold
34import qualified Streamly.Data.Fold as Fold
28−import qualified Streamly.Internal.Data.Stream.IsStream as Stream
35+import qualified Streamly.Internal.Data.Stream as Stream
29import qualified Streamly.Internal.Data.Unfold as Unfold
36import qualified Streamly.Internal.Data.Unfold as Unfold
30import qualified Streamly.Internal.FileSystem.Handle as Handle
37import qualified Streamly.Internal.FileSystem.Handle as Handle
31−import qualified Streamly.Internal.Unicode.Array.Char as UnicodeArr
38+import qualified Streamly.Internal.Unicode.Array as UnicodeArr
32import qualified Streamly.Internal.Unicode.Stream as Unicode
39import qualified Streamly.Internal.Unicode.Stream as Unicode
33
40
34−import Gauge hiding (env)
41+import Test.Tasty.Bench hiding (env)
35import Streamly.Benchmark.Common
42import Streamly.Benchmark.Common
36import Streamly.Benchmark.Common.Handle
43import Streamly.Benchmark.Common.Handle
37
44
38#ifdef INSPECTION
45#ifdef INSPECTION
39−import Streamly.Internal.Data.Unboxed (Unbox)
46+import Streamly.Internal.Data.MutByteArray (Unbox)
40−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
47+import Streamly.Internal.Data.Stream (Step(..))
41−import qualified Streamly.Internal.Data.Fold.Type as Fold
48+import qualified Streamly.Internal.Data.Array as Array
49+import qualified Streamly.Internal.Data.MutArray as MutArray
50+import qualified Streamly.Internal.Data.Fold as Fold
42import qualified Streamly.Internal.Data.Tuple.Strict as Strict
51import qualified Streamly.Internal.Data.Tuple.Strict as Strict
43−import qualified Streamly.Internal.Data.Array.Type as Array
44
52
45import Test.Inspection
53import Test.Inspection
46#endif
54#endif
@@ -54,7 +62,7 @@ copyCodecUtf8ArraysLenient :: Handle -> Handle -> IO ()
54copyCodecUtf8ArraysLenient inh outh =
62copyCodecUtf8ArraysLenient inh outh =
55 Stream.fold (Handle.write outh)
63 Stream.fold (Handle.write outh)
56 $ Unicode.encodeUtf8'
64 $ Unicode.encodeUtf8'
57− $ Unicode.decodeUtf8Arrays
65+ $ Unicode.decodeUtf8Chunks
58 $ Handle.readChunks inh
66 $ Handle.readChunks inh
59
67
60#ifdef INSPECTION
68#ifdef INSPECTION
@@ -75,13 +83,19 @@ o_1_space_decode_encode_chunked env =
75-- copy with group/ungroup transformations
83-- copy with group/ungroup transformations
76-------------------------------------------------------------------------------
84-------------------------------------------------------------------------------
77
85
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+
78{-# NOINLINE linesUnlinesCopy #-}
92{-# NOINLINE linesUnlinesCopy #-}
79linesUnlinesCopy :: Handle -> Handle -> IO ()
93linesUnlinesCopy :: Handle -> Handle -> IO ()
80linesUnlinesCopy inh outh =
94linesUnlinesCopy inh outh =
81 Stream.fold (Handle.write outh)
95 Stream.fold (Handle.write outh)
82 $ Unicode.encodeLatin1'
96 $ Unicode.encodeLatin1'
83 $ Unicode.unlines Unfold.fromList
97 $ Unicode.unlines Unfold.fromList
84− $ Stream.splitOnSuffix (== '\n') Fold.toList
98+ $ splitOnSuffix (== '\n') Fold.toList
85 $ Unicode.decodeLatin1
99 $ Unicode.decodeLatin1
86 $ Stream.unfold Handle.reader inh
100 $ Stream.unfold Handle.reader inh
87
101
@@ -90,7 +104,7 @@ linesUnlinesArrayWord8Copy :: Handle -> Handle -> IO ()
90linesUnlinesArrayWord8Copy inh outh =
104linesUnlinesArrayWord8Copy inh outh =
91 Stream.fold (Handle.write outh)
105 Stream.fold (Handle.write outh)
92 $ Stream.interposeSuffix 10 Array.reader
106 $ Stream.interposeSuffix 10 Array.reader
93− $ Stream.splitOnSuffix (== 10) Array.write
107+ $ splitOnSuffix (== 10) Array.write
94 $ Stream.unfold Handle.reader inh
108 $ Stream.unfold Handle.reader inh
95
109
96-- XXX splitSuffixOn requires -funfolding-use-threshold=150 for better fusion
110-- XXX splitSuffixOn requires -funfolding-use-threshold=150 for better fusion
@@ -210,7 +224,7 @@ inspect $ 'copyStreamLatin1' `hasNoType` ''Step
210inspect $ 'copyStreamLatin1' `hasNoType` ''Unfold.ConcatState -- Handle.read/UF.many
224inspect $ 'copyStreamLatin1' `hasNoType` ''Unfold.ConcatState -- Handle.read/UF.many
211
225
212inspect $ 'copyStreamLatin1' `hasNoType` ''Fold.Step
226inspect $ 'copyStreamLatin1' `hasNoType` ''Fold.Step
213−inspect $ 'copyStreamLatin1' `hasNoType` ''Array.ArrayUnsafe -- Handle.write/writeNUnsafe
227+inspect $ 'copyStreamLatin1' `hasNoType` ''MutArray.ArrayUnsafe -- Handle.write/writeNUnsafe
214 -- Handle.read/Array.read
228 -- Handle.read/Array.read
215inspect $ 'copyStreamLatin1' `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
229inspect $ 'copyStreamLatin1' `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
216#endif
230#endif
@@ -231,7 +245,7 @@ inspect $ 'copyStreamLatin1 `hasNoType` ''Unfold.ConcatState -- Handle.read/UF.m
231
245
232inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.ManyState
246inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.ManyState
233inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.Step
247inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.Step
234−inspect $ 'copyStreamLatin1 `hasNoType` ''Array.ArrayUnsafe -- Handle.write/writeNUnsafe
248+inspect $ 'copyStreamLatin1 `hasNoType` ''MutArray.ArrayUnsafe -- Handle.write/writeNUnsafe
235 -- Handle.read/Array.read
249 -- Handle.read/Array.read
236inspect $ 'copyStreamLatin1 `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
250inspect $ 'copyStreamLatin1 `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
237#endif
251#endif
@@ -272,7 +286,8 @@ _copyStreamUtf8'Fold :: Handle -> Handle -> IO ()
272_copyStreamUtf8'Fold inh outh =
286_copyStreamUtf8'Fold inh outh =
273 Stream.fold (Handle.write outh)
287 Stream.fold (Handle.write outh)
274 $ Unicode.encodeUtf8
288 $ Unicode.encodeUtf8
289+ $ Stream.catRights
275− $ Stream.foldMany Unicode.writeCharUtf8'
290+ $ Stream.parseMany Unicode.writeCharUtf8'
276 $ Stream.unfold Handle.reader inh
291 $ Stream.unfold Handle.reader inh
277
292
278{-# NOINLINE _copyStreamUtf8Parser #-}
293{-# NOINLINE _copyStreamUtf8Parser #-}
@@ -280,7 +295,7 @@ _copyStreamUtf8Parser :: Handle -> Handle -> IO ()
280_copyStreamUtf8Parser inh outh =
295_copyStreamUtf8Parser inh outh =
281 Stream.fold (Handle.write outh)
296 Stream.fold (Handle.write outh)
282 $ Unicode.encodeUtf8
297 $ Unicode.encodeUtf8
283− $ Stream.parseMany
298+ $ Stream.catRights $ Stream.parseMany
284 (Unicode.parseCharUtf8With Unicode.TransliterateCodingFailure)
299 (Unicode.parseCharUtf8With Unicode.TransliterateCodingFailure)
285 $ Stream.unfold Handle.reader inh
300 $ Stream.unfold Handle.reader inh
286
301
@@ -309,6 +324,7 @@ o_1_space_decode_encode_read env =
309
324
310main :: IO ()
325main :: IO ()
311main = do
326main = do
327+#ifndef FUSION_CHECK
312 env <- mkHandleBenchEnv
328 env <- mkHandleBenchEnv
313 defaultMain (allBenchmarks env)
329 defaultMain (allBenchmarks env)
314
330
@@ -321,3 +337,13 @@ main = do
321 , o_1_space_decode_encode_read env
337 , o_1_space_decode_encode_read env
322 ]
338 ]
323 ]
339 ]
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 Gauge hiding (env)
16+import Test.Tasty.Bench 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" $ nf pack value
52+ [ bench "pack" $ whnf pack value
53− , bench "pack + unpack" $ nf packUnpack value
53+ , bench "pack + unpack" $ whnf packUnpack value
54 ]
54 ]
55 ]
55 ]
benchmark/bench-runner/Main.hs+88−42
@@ -14,20 +14,32 @@ 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+
17 general
18 general
19+ -- GHC-9.6 requires 32M heap vs 16M for GHC-9.4
18− | "o-1-sp" `isInfixOf` benchName = "-K36K -M16M"
20+ | "o-1-sp" `isInfixOf` benchName = "-K36K -M32M"
19 | "o-n-h" `isInfixOf` benchName = "-K36K -M32M"
21 | "o-n-h" `isInfixOf` benchName = "-K36K -M32M"
22+ -- GHC-9.6 requires 32M heap vs 16M for GHC-9.4
20− | "o-n-st" `isInfixOf` benchName = "-K1M -M16M"
23+ | "o-n-st" `isInfixOf` benchName = "-K1M -M32M"
21 | "o-n-sp" `isInfixOf` benchName = "-K1M -M32M"
24 | "o-n-sp" `isInfixOf` benchName = "-K1M -M32M"
22 | otherwise = ""
25 | otherwise = ""
26+
23 exeSpecific
27 exeSpecific
24 | "Prelude.Concurrent" `isSuffixOf` exeName = "-K512K -M384M"
28 | "Prelude.Concurrent" `isSuffixOf` exeName = "-K512K -M384M"
25 | otherwise = ""
29 | otherwise = ""
30+
26 benchSpecific
31 benchSpecific
27− | "Data.Stream.StreamD/o-n-space.elimination.toList" == benchName =
32+ -- GHC-9.6 requires 64M, earlier it was 16M
28− "-K2M"
33+ | "Data.Fold/o-n-heap.key-value.toHashMapIO (max buckets) sum" == benchName =
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.
29− | "Data.Stream.StreamK/o-n-space.elimination.toList" == benchName =
38+ | "Data.Parser/o-1-space" `isPrefixOf` benchName =
30− "-K2M"
39+ "-M128M"
40+
41+ -----------------------------------------------------------------------
42+
31 | "Prelude.Parallel/o-n-heap.mapping.mapM" == benchName = "-M256M"
43 | "Prelude.Parallel/o-n-heap.mapping.mapM" == benchName = "-M256M"
32 | "Prelude.Parallel/o-n-heap.monad-outer-product."
44 | "Prelude.Parallel/o-n-heap.monad-outer-product."
33 `isPrefixOf` benchName = "-M256M"
45 `isPrefixOf` benchName = "-M256M"
@@ -35,25 +47,6 @@ rtsOpts exeName benchName0 = unwords [general, exeSpecific, benchSpecific]
35 `isPrefixOf` benchName = "-K2M -M256M"
47 `isPrefixOf` benchName = "-K2M -M256M"
36 | "Prelude.Rate/o-1-space." `isPrefixOf` benchName = "-K128K"
48 | "Prelude.Rate/o-1-space." `isPrefixOf` benchName = "-K128K"
37 | "Prelude.Rate/o-1-space.asyncly." `isPrefixOf` benchName = "-K128K"
49 | "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"
54− | "Data.Stream.ConcurrentInterleaved/o-1-space.monad-outer-product.toNullAp" `isPrefixOf` benchName = "-M32M"
55− | "Data.Stream.ConcurrentEager/o-1-space.monad-outer-product.toNullAp" `isPrefixOf` benchName = "-M1024M -K4M"
56− | "Data.Stream.ConcurrentEager/o-1-space." `isPrefixOf` benchName = "-M512M -K4M"
57 | "Prelude.WSerial/o-n-space." `isPrefixOf` benchName = "-K4M"
50 | "Prelude.WSerial/o-n-space." `isPrefixOf` benchName = "-K4M"
58 | "Prelude.Async/o-n-space.monad-outer-product." `isPrefixOf` benchName =
51 | "Prelude.Async/o-n-space.monad-outer-product." `isPrefixOf` benchName =
59 "-K4M"
52 "-K4M"
@@ -66,27 +59,80 @@ rtsOpts exeName benchName0 = unwords [general, exeSpecific, benchSpecific]
66 "-M64M"
59 "-M64M"
67 | "Prelude.WAsync/o-n-space.monad-outer-product." `isPrefixOf` benchName =
60 | "Prelude.WAsync/o-n-space.monad-outer-product." `isPrefixOf` benchName =
68 "-K4M"
61 "-K4M"
69− | "Data.Parser.ParserD/o-1-space.some" == benchName = "-K8M"
62+
70− | "Data.Parser/o-1-space.some" == benchName = "-K8M"
63+ -- This module is dev only now, and can be removed at some point
71− | "Data.Parser.ParserD/o-1-space.manyTill" == benchName = "-K4M"
64+ | "Data.Stream.StreamDK/o-1-space.grouping.classifySessionsOf"
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− | "Data.Parser/o-1-space.manyTill" == benchName = "-K4M"
72+ `isPrefixOf` benchName = "-K4M"
73− | "Data.Parser/o-n-heap.manyAlt" == benchName = "-K4M -M128M"
73+ -- GHC-9.6 requires 64M, earlier it was 32M
74− | "Data.Parser/o-n-heap.someAlt" == benchName = "-K4M -M128M"
74+ | "Data.Stream.StreamDK/o-n-heap.buffered.readsPrec pure streams" == benchName =
75− | "Data.Parser/o-n-heap.choice" == benchName = "-K16M -M32M"
75+ "-M64M"
76− | "Data.Parser.ParserK/o-n-heap.manyAlt" == benchName = "-K4M -M128M"
76+ -- GHC-9.6 requires 64M, earlier it was 32M
77− | "Data.Parser.ParserK/o-n-heap.someAlt" == benchName = "-K4M -M128M"
77+ | "Data.Stream.StreamDK/o-n-heap.buffered.showPrec Haskell lists" == benchName =
78− | "Data.Parser.ParserK/o-n-heap.sequence" == benchName = "-M64M"
78+ "-M64M"
79− | "Data.Parser.ParserK/o-n-heap.sequenceA" == benchName = "-M64M"
79+
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"
110+
111+ ----------------------------------------------------------------------
112+
80 | "Data.Array" `isPrefixOf` benchName
113 | "Data.Array" `isPrefixOf` benchName
81 && "/o-1-space.generation.read" `isSuffixOf` benchName = "-M32M"
114 && "/o-1-space.generation.read" `isSuffixOf` benchName = "-M32M"
115+ -- XXX GHC 9.6 onwards needs 64M, earlier it was 32M
82 | "Data.Array" `isPrefixOf` benchName
116 | "Data.Array" `isPrefixOf` benchName
83− && "/o-1-space.generation.show" `isSuffixOf` benchName = "-M32M"
117+ && "/o-1-space.generation.show" `isSuffixOf` benchName = "-M64M"
118+ -- XXX GHC 9.6 onwards needs 64M, earlier it was 32M
84− | "Data.Array/o-1-space.transformationX4.map" == benchName = "-M32M"
119+ | "Data.Array.Generic/o-1-space.transformationX4.map"
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.
85− | "Data.Array.Unboxed/o-1-space.elimination.foldable.foldl"
125+ | "Data.Array.Stream/o-1-space"
86− `isPrefixOf` benchName = "-K8M"
126+ `isPrefixOf` benchName = "-K4M -M512M"
87− | "Data.Array.Unboxed/o-1-space.elimination.foldable.sum" == benchName =
127+ -- XXX Takes up to 160MB heap for --long, we use chunked stream for
88− "-K8M"
128+ -- this, so the reason may be related to chunked streams.
129+ | "Data.ParserK/o-1-space"
130+ `isPrefixOf` benchName = "-K4M -M256M"
131+
132+ -----------------------------------------------------------------------
133+
89 | "Unicode.Char/o-1-space." `isPrefixOf` benchName = "-M32M"
134 | "Unicode.Char/o-1-space." `isPrefixOf` benchName = "-M32M"
135+
90 | otherwise = ""
136 | otherwise = ""
91
137
92speedOpts :: String -> String -> Maybe Quickness
138speedOpts :: String -> String -> Maybe Quickness
benchmark/bench-runner/cabal.project+3
@@ -1 +1,4 @@
1packages: . ../../targets
1packages: . ../../targets
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 = "ca3872acd4b817731b951c6ed91bfa6c58f26c5a";
52+ rev = "3b50bf0ad06f746bca42f30c8d40a0426e159af3";
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 Gauge
59+import Test.Tasty.Bench
60
60
61-------------------------------------------------------------------------------
61-------------------------------------------------------------------------------
62-- Benchmark Prefixes
62-- Benchmark Prefixes
benchmark/lib/Streamly/Benchmark/Common/Handle.hs+3−1
@@ -30,6 +30,8 @@ module Streamly.Benchmark.Common.Handle
30 , isSpace
30 , isSpace
31 , isSp
31 , isSp
32 , mkHandleBenchEnv
32 , mkHandleBenchEnv
33+ , Handles(..)
34+ , getHandles
33 )
35 )
34where
36where
35
37
@@ -46,7 +48,7 @@ import System.Process (callCommand)
46
48
47import Data.IORef
49import Data.IORef
48import Prelude hiding (last, length)
50import Prelude hiding (last, length)
49−import Gauge hiding (env)
51+import Test.Tasty.Bench hiding (env)
50
52
51
53
52scratchDir :: String
54scratchDir :: String
benchmark/lib/Streamly/Benchmark/Prelude.hs+1−1
@@ -82,7 +82,7 @@ import qualified Streamly.Internal.Data.Stream.IsStream.Type as IsStream
82import qualified Streamly.Internal.Data.Pipe as Pipe
82import qualified Streamly.Internal.Data.Pipe as Pipe
83import qualified Streamly.Internal.Data.Stream.Serial as Serial
83import qualified Streamly.Internal.Data.Stream.Serial as Serial
84
84
85−import Gauge
85+import Test.Tasty.Bench
86import Streamly.Internal.Data.Time.Units
86import Streamly.Internal.Data.Time.Units
87
87
88-- Common polymorphic stream APIs used across multiple stream modules
88-- Common polymorphic stream APIs used across multiple stream modules
benchmark/streamly-benchmarks.cabal+262−159
@@ -54,11 +54,6 @@ flag opt
54 manual: True
54 manual: True
55 default: True
55 default: True
56
56
57−flag use-gauge
58− description: Use gauge instead of tasty-bench for benchmarking
59− manual: True
60− default: False
61−
62flag use-streamly-core
57flag use-streamly-core
63 description: Benchmark only core package
58 description: Benchmark only core package
64 manual: True
59 manual: True
@@ -73,15 +68,49 @@ flag use-prelude
73-- Common stanzas
68-- Common stanzas
74-------------------------------------------------------------------------------
69-------------------------------------------------------------------------------
75
70
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+
76common compile-options
107common compile-options
108+ import: default-extensions
77 default-language: Haskell2010
109 default-language: Haskell2010
78
110
79 if flag(use-streamly-core)
111 if flag(use-streamly-core)
80 cpp-options: -DUSE_STREAMLY_CORE
112 cpp-options: -DUSE_STREAMLY_CORE
81
113
82− if flag(use-prelude)
83− cpp-options: -DUSE_PRELUDE
84−
85 if flag(dev)
114 if flag(dev)
86 cpp-options: -DDEVBUILD
115 cpp-options: -DDEVBUILD
87
116
@@ -111,6 +140,10 @@ common compile-options
111 -Wno-missing-kind-signatures
140 -Wno-missing-kind-signatures
112 -Wno-operator-whitespace
141 -Wno-operator-whitespace
113
142
143+ if impl(ghc >= 9.8)
144+ ghc-options:
145+ -Wno-missing-role-annotations
146+
114 if flag(has-llvm)
147 if flag(has-llvm)
115 ghc-options: -fllvm
148 ghc-options: -fllvm
116
149
@@ -118,15 +151,17 @@ common compile-options
118 ghc-options: -Wmissed-specialisations
151 ghc-options: -Wmissed-specialisations
119 -Wall-missed-specialisations
152 -Wall-missed-specialisations
120
153
121− if flag(dev) || flag(debug)
122− ghc-options: -fno-ignore-asserts
123−
124common optimization-options
154common optimization-options
125 if flag(opt)
155 if flag(opt)
126 ghc-options: -O2
156 ghc-options: -O2
127 -fdicts-strict
157 -fdicts-strict
128 -fspec-constr-recursive=16
158 -fspec-constr-recursive=16
129 -fmax-worker-args=16
159 -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+
130 if flag(fusion-plugin) && !impl(ghcjs) && !impl(ghc < 8.6)
165 if flag(fusion-plugin) && !impl(ghcjs) && !impl(ghc < 8.6)
131 ghc-options: -fplugin Fusion.Plugin
166 ghc-options: -fplugin Fusion.Plugin
132 else
167 else
@@ -140,43 +175,34 @@ common bench-depends
140 -- Core libraries shipped with ghc, the min and max
175 -- Core libraries shipped with ghc, the min and max
141 -- constraints of these libraries should match with
176 -- constraints of these libraries should match with
142 -- the GHC versions we support
177 -- the GHC versions we support
143− base >= 4.9 && < 4.18
178+ base >= 4.9 && < 4.20
144− , deepseq >= 1.4.1 && < 1.5
179+ , deepseq >= 1.4.1 && < 1.6
145− , mtl >= 2.2 && < 2.3
180+ , mtl >= 2.2 && < 2.3.2
146
181
147 -- other libraries
182 -- other libraries
183+ , exceptions >= 0.8 && < 0.11
148 , random >= 1.0 && < 2.0
184 , random >= 1.0 && < 2.0
149 , transformers >= 0.4 && < 0.7
185 , transformers >= 0.4 && < 0.7
150− , containers >= 0.5 && < 0.7
186+ , containers >= 0.5 && < 0.8
151 , hashable >= 1.3 && < 1.5
187 , hashable >= 1.3 && < 1.5
152 , unordered-containers >= 0.2 && < 0.3
188 , unordered-containers >= 0.2 && < 0.3
153 , process >= 1.4 && < 1.7
189 , process >= 1.4 && < 1.7
154 , directory >= 1.2.2 && < 1.4
190 , directory >= 1.2.2 && < 1.4
155− , filepath >= 1.4.1 && < 1.5
191+ , filepath >= 1.4.1 && < 1.6
156− , ghc-prim >= 0.4 && < 0.10
192+ , ghc-prim >= 0.4 && < 0.12
193+ , tasty-bench >= 0.3 && < 0.4
194+ , tasty >= 1.4.1 && < 1.6
195+ , streamly-core
157
196
158− if flag(use-streamly-core)
197+ if !flag(use-streamly-core)
159− build-depends: streamly-core
160− else
161 build-depends: streamly
198 build-depends: streamly
162− , streamly-core
163−
164− if flag(use-gauge)
165− build-depends: gauge >= 0.2.4 && < 0.3
166− else
167− build-depends: tasty-bench >= 0.3 && < 0.4
168− , tasty >= 1.4.1 && < 1.5
169− mixins: tasty-bench
170− (Test.Tasty.Bench as Gauge
171− , Test.Tasty.Bench as Gauge.Main
172− )
173
199
174 if flag(fusion-plugin) && !impl(ghcjs) && !impl(ghc < 8.6)
200 if flag(fusion-plugin) && !impl(ghcjs) && !impl(ghc < 8.6)
175 build-depends:
201 build-depends:
176 fusion-plugin >= 0.2 && < 0.3
202 fusion-plugin >= 0.2 && < 0.3
177 if flag(inspection)
203 if flag(inspection)
178− build-depends: template-haskell >= 2.14 && < 2.20
204+ build-depends: template-haskell >= 2.14 && < 2.22
179− , inspection-testing >= 0.4 && < 0.5
205+ , inspection-testing >= 0.4 && < 0.6
180 -- Array uses a Storable constraint in dev build making several inspection
206 -- Array uses a Storable constraint in dev build making several inspection
181 -- tests fail
207 -- tests fail
182 if flag(dev) && flag(inspection)
208 if flag(dev) && flag(inspection)
@@ -191,7 +217,7 @@ library
191 hs-source-dirs: lib
217 hs-source-dirs: lib
192 exposed-modules: Streamly.Benchmark.Common
218 exposed-modules: Streamly.Benchmark.Common
193 , Streamly.Benchmark.Common.Handle
219 , Streamly.Benchmark.Common.Handle
194− if !flag(use-streamly-core)
220+ if flag(use-prelude)
195 exposed-modules: Streamly.Benchmark.Prelude
221 exposed-modules: Streamly.Benchmark.Prelude
196
222
197
223
@@ -232,12 +258,38 @@ benchmark Data.Stream
232 Stream.Transform
258 Stream.Transform
233 Stream.Reduce
259 Stream.Reduce
234 Stream.Expand
260 Stream.Expand
261+ Stream.Lift
262+ Stream.Common
263+ if !flag(use-streamly-core)
264+ other-modules:
235 Stream.Exceptions
265 Stream.Exceptions
266+ if flag(limit-build-mem)
267+ if flag(dev)
268+ ghc-options: +RTS -M3500M -RTS
269+ else
270+ ghc-options: +RTS -M2500M -RTS
271+
272+-- Use StreamK functions where possible, converting to StreaK to StreamD
273+benchmark Data.Stream.StreamDK
274+ import: bench-options
275+ type: exitcode-stdio-1.0
276+ hs-source-dirs: Streamly/Benchmark/Data
277+ main-is: Stream.hs
278+ other-modules:
279+ Stream.Generate
280+ Stream.Eliminate
281+ Stream.Transform
282+ Stream.Reduce
283+ Stream.Expand
236 Stream.Lift
284 Stream.Lift
237 Stream.Common
285 Stream.Common
238− if flag(use-prelude)
286+ if !flag(use-streamly-core)
239 other-modules:
287 other-modules:
240− Stream.Split
288+ Stream.Exceptions
289+ -- Cannot use USE_STREAMK and USE_PRELUDE together
290+ if flag(use-prelude)
291+ buildable: False
292+ cpp-options: -DUSE_STREAMK
241 if flag(limit-build-mem)
293 if flag(limit-build-mem)
242 if flag(dev)
294 if flag(dev)
243 ghc-options: +RTS -M3500M -RTS
295 ghc-options: +RTS -M3500M -RTS
@@ -296,93 +348,35 @@ benchmark Data.Stream.ConcurrentOrdered
296 else
348 else
297 buildable: True
349 buildable: True
298
350
299−benchmark Prelude.WSerial
351+benchmark Data.Unbox
300 import: bench-options
352 import: bench-options
301 type: exitcode-stdio-1.0
353 type: exitcode-stdio-1.0
302− hs-source-dirs: Streamly/Benchmark/Prelude
354+ hs-source-dirs: .
303− main-is: WSerial.hs
355+ cpp-options: -DUSE_UNBOX
304− if flag(use-streamly-core) || impl(ghcjs)
305− buildable: False
306− else
307− buildable: True
308− if flag(limit-build-mem)
309− ghc-options: +RTS -M750M -RTS
310−
311−benchmark Prelude.Merge
312− import: bench-options
313− type: exitcode-stdio-1.0
314− hs-source-dirs: Streamly/Benchmark/Prelude
356+ main-is: Streamly/Benchmark/Data/Serialize.hs
315− main-is: Merge.hs
316− if flag(use-streamly-core) || impl(ghcjs)
317− buildable: False
318− else
319− buildable: True
320
357
321−benchmark Prelude.ZipSerial
358+benchmark Data.Unbox.Derive.TH
322 import: bench-options
359 import: bench-options
323 type: exitcode-stdio-1.0
360 type: exitcode-stdio-1.0
324− hs-source-dirs: Streamly/Benchmark/Prelude
361+ hs-source-dirs: .
325− main-is: ZipSerial.hs
362+ cpp-options: -DUSE_UNBOX
326− if flag(use-streamly-core) || impl(ghcjs)
363+ cpp-options: -DUSE_TH
327− buildable: False
364+ main-is: Streamly/Benchmark/Data/Serialize.hs
328− else
329− buildable: True
330
365
331−benchmark Prelude.ZipAsync
366+benchmark Data.Serialize
332 import: bench-options
367 import: bench-options
333 type: exitcode-stdio-1.0
368 type: exitcode-stdio-1.0
334− hs-source-dirs: Streamly/Benchmark/Prelude
369+ hs-source-dirs: .
335− main-is: ZipAsync.hs
370+ cpp-options: -DUSE_TH
336− if flag(use-streamly-core) || impl(ghcjs)
371+ main-is: Streamly/Benchmark/Data/Serialize.hs
337− buildable: False
372+ build-depends: QuickCheck, template-haskell
338− else
373+ other-modules:
339− buildable: True
374+ Streamly.Benchmark.Data.Serialize.TH
375+ Streamly.Benchmark.Data.Serialize.RecCompatible
376+ Streamly.Benchmark.Data.Serialize.RecNonCompatible
340 if flag(limit-build-mem)
377 if flag(limit-build-mem)
341 ghc-options: +RTS -M1000M -RTS
378 ghc-options: +RTS -M1000M -RTS
342
379
343−benchmark Prelude.Ahead
344− import: bench-options-threaded
345− type: exitcode-stdio-1.0
346− hs-source-dirs: Streamly/Benchmark/Prelude
347− main-is: Ahead.hs
348− if flag(use-streamly-core) || impl(ghcjs)
349− buildable: False
350− else
351− buildable: True
352−
353−benchmark Prelude.Async
354− import: bench-options-threaded
355− type: exitcode-stdio-1.0
356− hs-source-dirs: Streamly/Benchmark/Prelude
357− main-is: Async.hs
358− if flag(use-streamly-core) || impl(ghcjs)
359− buildable: False
360− else
361− buildable: True
362−
363−benchmark Prelude.WAsync
364− import: bench-options-threaded
365− type: exitcode-stdio-1.0
366− hs-source-dirs: Streamly/Benchmark/Prelude
367− main-is: WAsync.hs
368− if flag(use-streamly-core) || impl(ghcjs)
369− buildable: False
370− else
371− buildable: True
372−
373−benchmark Prelude.Parallel
374− import: bench-options-threaded
375− type: exitcode-stdio-1.0
376− hs-source-dirs: Streamly/Benchmark/Prelude
377− main-is: Parallel.hs
378− if flag(use-streamly-core) || impl(ghcjs)
379− buildable: False
380− else
381− buildable: True
382− if flag(limit-build-mem)
383− ghc-options: +RTS -M2000M -RTS
384−
385−
386benchmark Data.Unfold
380benchmark Data.Unfold
387 import: bench-options
381 import: bench-options
388 type: exitcode-stdio-1.0
382 type: exitcode-stdio-1.0
@@ -413,12 +407,12 @@ benchmark Data.Fold.Window
413 else
407 else
414 buildable: True
408 buildable: True
415
409
416−benchmark Data.Parser.ParserD
410+benchmark Data.Parser
417 import: bench-options
411 import: bench-options
418 type: exitcode-stdio-1.0
412 type: exitcode-stdio-1.0
419− hs-source-dirs: Streamly/Benchmark/Data/Parser
413+ hs-source-dirs: Streamly/Benchmark/Data
420− main-is: ParserD.hs
414+ main-is: Parser.hs
421− if flag(use-streamly-core) || impl(ghcjs)
415+ if impl(ghcjs)
422 buildable: False
416 buildable: False
423 else
417 else
424 buildable: True
418 buildable: True
@@ -427,80 +421,77 @@ benchmark Data.Parser.ParserD
427 if flag(dev)
421 if flag(dev)
428 ghc-options: +RTS -M3000M -RTS
422 ghc-options: +RTS -M3000M -RTS
429 else
423 else
430− ghc-options: +RTS -M750M -RTS
424+ ghc-options: +RTS -M2000M -RTS
431
425
432−benchmark Data.Parser.ParserK
426+benchmark Data.ParserK
433 import: bench-options
427 import: bench-options
434 type: exitcode-stdio-1.0
428 type: exitcode-stdio-1.0
435− hs-source-dirs: Streamly/Benchmark/Data/Parser
429+ hs-source-dirs: Streamly/Benchmark/Data
430+ cpp-options: -DBENCH_SINGULAR
436 main-is: ParserK.hs
431 main-is: ParserK.hs
437− if flag(use-streamly-core) || impl(ghcjs)
432+ if impl(ghcjs)
438 buildable: False
433 buildable: False
439 else
434 else
440 buildable: True
435 buildable: True
441 build-depends: exceptions >= 0.8 && < 0.11
436 build-depends: exceptions >= 0.8 && < 0.11
442
437
443−-- Note: to use this we have to set DISABLE_FUSION in ParserD.hs so that
444−-- the rewrite rules are disabled. We can also use the "no-fusion" build
445−-- flag but we need to keep in mind that it disables fusion for streams
446−-- as well.
447−benchmark Data.Parser.FromParserK
438+benchmark Data.ParserK.Chunked
448 import: bench-options
439 import: bench-options
449 type: exitcode-stdio-1.0
440 type: exitcode-stdio-1.0
450− hs-source-dirs: Streamly/Benchmark/Data/Parser
441+ hs-source-dirs: Streamly/Benchmark/Data
451− cpp-options: -DFROM_PARSERK
442+ cpp-options: -DBENCH_CHUNKED
452 main-is: ParserK.hs
443 main-is: ParserK.hs
453− if flag(use-streamly-core) || impl(ghcjs)
444+ if impl(ghcjs)
454 buildable: False
445 buildable: False
455 else
446 else
456 buildable: True
447 buildable: True
457 build-depends: exceptions >= 0.8 && < 0.11
448 build-depends: exceptions >= 0.8 && < 0.11
458
449
459−benchmark Data.Parser
450+benchmark Data.ParserK.Chunked.Generic
460 import: bench-options
451 import: bench-options
461 type: exitcode-stdio-1.0
452 type: exitcode-stdio-1.0
462 hs-source-dirs: Streamly/Benchmark/Data
453 hs-source-dirs: Streamly/Benchmark/Data
454+ cpp-options: -DBENCH_CHUNKED_GENERIC
463− main-is: Parser.hs
455+ main-is: ParserK.hs
464− if flag(use-streamly-core) || impl(ghcjs)
456+ if impl(ghcjs)
465 buildable: False
457 buildable: False
466 else
458 else
467 buildable: True
459 buildable: True
468 build-depends: exceptions >= 0.8 && < 0.11
460 build-depends: exceptions >= 0.8 && < 0.11
469− if flag(limit-build-mem)
470− if flag(dev)
471− ghc-options: +RTS -M3000M -RTS
472− else
473− ghc-options: +RTS -M1000M -RTS
474
461
475-------------------------------------------------------------------------------
462-------------------------------------------------------------------------------
476-- Raw Streams
463-- Raw Streams
477-------------------------------------------------------------------------------
464-------------------------------------------------------------------------------
478
465
479−benchmark Data.Stream.StreamD
466+benchmark Data.StreamD
480 import: bench-options
467 import: bench-options
481 type: exitcode-stdio-1.0
468 type: exitcode-stdio-1.0
482 hs-source-dirs: Streamly/Benchmark/Data/Stream
469 hs-source-dirs: Streamly/Benchmark/Data/Stream
483 main-is: StreamD.hs
470 main-is: StreamD.hs
484 if impl(ghcjs)
471 if impl(ghcjs)
485 buildable: False
472 buildable: False
486− else
487− buildable: True
488
473
489−benchmark Data.Stream.StreamK
474+benchmark Data.StreamK
490 import: bench-options
475 import: bench-options
491 type: exitcode-stdio-1.0
476 type: exitcode-stdio-1.0
492 hs-source-dirs: Streamly/Benchmark/Data/Stream
477 hs-source-dirs: Streamly/Benchmark/Data/Stream
493 main-is: StreamK.hs
478 main-is: StreamK.hs
494 if impl(ghcjs)
479 if impl(ghcjs)
495 buildable: False
480 buildable: False
496− else
497− buildable: True
498
481
499−benchmark Data.Stream.StreamDK
482+benchmark Data.Stream.ToStreamK
500 import: bench-options
483 import: bench-options
501 type: exitcode-stdio-1.0
484 type: exitcode-stdio-1.0
502 hs-source-dirs: Streamly/Benchmark/Data/Stream
485 hs-source-dirs: Streamly/Benchmark/Data/Stream
503− main-is: StreamDK.hs
486+ main-is: ToStreamK.hs
487+ if !flag(dev) || impl(ghcjs)
488+ buildable: False
489+
490+benchmark Data.StreamK.Alt
491+ import: bench-options
492+ type: exitcode-stdio-1.0
493+ hs-source-dirs: Streamly/Benchmark/Data/Stream
494+ main-is: StreamKAlt.hs
504 if !flag(dev) || impl(ghcjs)
495 if !flag(dev) || impl(ghcjs)
505 buildable: False
496 buildable: False
506
497
@@ -508,11 +499,115 @@ executable nano-bench
508 import: bench-options
499 import: bench-options
509 hs-source-dirs: .
500 hs-source-dirs: .
510 main-is: NanoBenchmarks.hs
501 main-is: NanoBenchmarks.hs
511− if flag(dev)
502+ if !flag(dev)
512− buildable: True
503+ buildable: False
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
513− else
530+ 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)
514 buildable: False
551 buildable: False
515
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
608+ if flag(limit-build-mem)
609+ ghc-options: +RTS -M2000M -RTS
610+
516-------------------------------------------------------------------------------
611-------------------------------------------------------------------------------
517-- Concurrent Streams
612-- Concurrent Streams
518-------------------------------------------------------------------------------
613-------------------------------------------------------------------------------
@@ -522,30 +617,27 @@ benchmark Prelude.Concurrent
522 type: exitcode-stdio-1.0
617 type: exitcode-stdio-1.0
523 hs-source-dirs: Streamly/Benchmark/Prelude
618 hs-source-dirs: Streamly/Benchmark/Prelude
524 main-is: Concurrent.hs
619 main-is: Concurrent.hs
620+ cpp-options: -DUSE_PRELUDE
525− if flag(use-streamly-core)
621+ if !flag(use-prelude)
526 buildable: False
622 buildable: False
527− else
528− buildable: True
529
623
530benchmark Prelude.Adaptive
624benchmark Prelude.Adaptive
531 import: bench-options-threaded
625 import: bench-options-threaded
532 type: exitcode-stdio-1.0
626 type: exitcode-stdio-1.0
533 hs-source-dirs: Streamly/Benchmark/Prelude
627 hs-source-dirs: Streamly/Benchmark/Prelude
534 main-is: Adaptive.hs
628 main-is: Adaptive.hs
535− if flag(use-streamly-core) || impl(ghcjs)
629+ cpp-options: -DUSE_PRELUDE
630+ if !flag(use-prelude)
536 buildable: False
631 buildable: False
537− else
538− buildable: True
539
632
540benchmark Prelude.Rate
633benchmark Prelude.Rate
541 import: bench-options-threaded
634 import: bench-options-threaded
542 type: exitcode-stdio-1.0
635 type: exitcode-stdio-1.0
543 hs-source-dirs: Streamly/Benchmark/Prelude
636 hs-source-dirs: Streamly/Benchmark/Prelude
544 main-is: Rate.hs
637 main-is: Rate.hs
545− if flag(use-streamly-core) || impl(ghcjs)
638+ cpp-options: -DUSE_PRELUDE
639+ if !flag(use-prelude)
546 buildable: False
640 buildable: False
547− else
548− buildable: True
549
641
550-------------------------------------------------------------------------------
642-------------------------------------------------------------------------------
551-- Array Benchmarks
643-- Array Benchmarks
@@ -554,8 +646,10 @@ benchmark Prelude.Rate
554benchmark Data.Array.Generic
646benchmark Data.Array.Generic
555 import: bench-options
647 import: bench-options
556 type: exitcode-stdio-1.0
648 type: exitcode-stdio-1.0
557− hs-source-dirs: .
649+ hs-source-dirs: ., Streamly/Benchmark/Data
558 main-is: Streamly/Benchmark/Data/Array/Generic.hs
650 main-is: Streamly/Benchmark/Data/Array/Generic.hs
651+ other-modules:
652+ Stream.Common
559 if flag(use-streamly-core)
653 if flag(use-streamly-core)
560 buildable: False
654 buildable: False
561 else
655 else
@@ -575,7 +669,10 @@ benchmark Data.SmallArray
575benchmark Data.Array
669benchmark Data.Array
576 import: bench-options
670 import: bench-options
577 type: exitcode-stdio-1.0
671 type: exitcode-stdio-1.0
672+ hs-source-dirs: ., Streamly/Benchmark/Data
578 main-is: Streamly/Benchmark/Data/Array.hs
673 main-is: Streamly/Benchmark/Data/Array.hs
674+ other-modules:
675+ Stream.Common
579 if flag(use-streamly-core)
676 if flag(use-streamly-core)
580 buildable: False
677 buildable: False
581 else
678 else
@@ -583,10 +680,10 @@ benchmark Data.Array
583 if flag(limit-build-mem)
680 if flag(limit-build-mem)
584 ghc-options: +RTS -M1500M -RTS
681 ghc-options: +RTS -M1500M -RTS
585
682
586−benchmark Data.Array.Mut
683+benchmark Data.MutArray
587 import: bench-options
684 import: bench-options
588 type: exitcode-stdio-1.0
685 type: exitcode-stdio-1.0
589− main-is: Streamly/Benchmark/Data/Array/Mut.hs
686+ main-is: Streamly/Benchmark/Data/MutArray.hs
590 if flag(limit-build-mem)
687 if flag(limit-build-mem)
591 ghc-options: +RTS -M1500M -RTS
688 ghc-options: +RTS -M1500M -RTS
592 if flag(use-streamly-core)
689 if flag(use-streamly-core)
@@ -673,3 +770,9 @@ benchmark Unicode.Utf8
673 buildable: False
770 buildable: False
674 else
771 else
675 buildable: True
772 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.8.2
4+STREAMLY_VERSION=0.9.0
5
5
6case `uname` in
6case `uname` in
7 Darwin) SYSTEM=x86_64-osx;;
7 Darwin) SYSTEM=x86_64-osx;;
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.8.2
16+STREAMLY_VERSION=0.9.0
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.doctest+1−1
@@ -1,6 +1,6 @@
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
4 -- for QuickCheck in property doctests
5 , test/streamly-tests.cabal
5 , test/streamly-tests.cabal
6
6
cabal.project.packdiff+2−16
@@ -1,23 +1,9 @@
1−packages:
2− streamly.cabal
3− core/streamly-core.cabal
4−
5source-repository-package
1source-repository-package
6 type: git
2 type: git
7 location: https://github.com/composewell/packdiff.git
3 location: https://github.com/composewell/packdiff.git
8− tag: 98201422ea62974400a910331928d71a5fc90801
4+ tag: b11a50c9c0523382a19eebc0b12efdae194406a9
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: acf1ca79b964e7c92ddfc71ca77c1adcba7e2450
19
5
20source-repository-package
6source-repository-package
21 type: git
7 type: git
22 location: https://github.com/composewell/streamly-process.git
8 location: https://github.com/composewell/streamly-process.git
23− tag: fb45eedcd1320d552fb49048e1d733cbf5d46711
9+ tag: d80b860d9d8ea98e4f7f63390442b3155c34dd08
cabal.project.report+4−6
@@ -2,8 +2,6 @@ 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
7
5
8package bench-report
6package bench-report
9 flags: +no-charts
7 flags: +no-charts
@@ -14,19 +12,19 @@ package bench-show
14source-repository-package
12source-repository-package
15 type: git
13 type: git
16 location: https://github.com/composewell/bench-report.git
14 location: https://github.com/composewell/bench-report.git
17− tag: 0b7c260ce243d5504c45b229137cd59233308cae
15+ tag: 3b50bf0ad06f746bca42f30c8d40a0426e159af3
18
16
19source-repository-package
17source-repository-package
20 type: git
18 type: git
21 location: https://github.com/composewell/streamly-coreutils.git
19 location: https://github.com/composewell/streamly-coreutils.git
22− tag: acf1ca79b964e7c92ddfc71ca77c1adcba7e2450
20+ tag: 5dbb8bcefac3aefd5eb298dc410b11e36e79f35a
23
21
24source-repository-package
22source-repository-package
25 type: git
23 type: git
26 location: https://github.com/composewell/streamly-shell.git
24 location: https://github.com/composewell/streamly-shell.git
27− tag: 1b3fea3239ebe47963955d81565b9d5e34567ab7
25+ tag: b0c6318119d1cc5e2106343f17b5cff2ad94417f
28
26
29source-repository-package
27source-repository-package
30 type: git
28 type: git
31 location: https://github.com/composewell/streamly-process.git
29 location: https://github.com/composewell/streamly-process.git
32− tag: fb45eedcd1320d552fb49048e1d733cbf5d46711
30+ tag: d80b860d9d8ea98e4f7f63390442b3155c34dd08
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.9.0.
3+# Generated by GNU Autoconf 2.71 for streamly 0.10.1.
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.9.0'
613+PACKAGE_VERSION='0.10.1'
614−PACKAGE_STRING='streamly 0.9.0'
614+PACKAGE_STRING='streamly 0.10.1'
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.9.0 to adapt to many kinds of systems.
1227+\`configure' configures streamly 0.10.1 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.9.0:";;
1289+ short | recursive ) echo "Configuration of streamly 0.10.1:";;
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.9.0
1375+streamly configure 0.10.1
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.9.0, which was
1503+It was created by streamly $as_me 0.10.1, 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.9.0, which was
3803+This file was extended by streamly $as_me 0.10.1, 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.9.0
3859+streamly config.status 0.10.1
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.9.0], [streamly@composewell.com], [streamly], [https://streamly.composewell.com])
6+AC_INIT([streamly], [0.10.1], [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.mdnew file+1
@@ -0,0 +1 @@
1+docs/Changelog.md
core/LICENSEnew file+322
@@ -0,0 +1,322 @@
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.8.2.
3+# Generated by GNU Autoconf 2.71 for streamly-core 0.2.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.8.2'
613+PACKAGE_VERSION='0.2.2'
614−PACKAGE_STRING='streamly-core 0.8.2'
614+PACKAGE_STRING='streamly-core 0.2.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.8.2 to adapt to many kinds of systems.
1259+\`configure' configures streamly-core 0.2.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.8.2:";;
1321+ short | recursive ) echo "Configuration of streamly-core 0.2.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.8.2
1407+streamly-core configure 0.2.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.8.2, which was
1625+It was created by streamly-core $as_me 0.2.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.8.2, which was
3835+This file was extended by streamly-core $as_me 0.2.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.8.2
3891+streamly-core config.status 0.2.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.8.2], [streamly@composewell.com], [streamly-core], [https://streamly.composewell.com])
6+AC_INIT([streamly-core], [0.2.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.txtnew file+1471
@@ -0,0 +1,1471 @@
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.txtnew file+405
@@ -0,0 +1,405 @@
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.txtnew file+306
@@ -0,0 +1,306 @@
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.mdnew file+97
@@ -0,0 +1,97 @@
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.mdnew file+1
@@ -0,0 +1 @@
1+Please refer to the "streamly" package for tutorials and other documentation.
core/src/DocTestDataArray.hsnew file+22
@@ -0,0 +1,22 @@
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.hsnew file+27
@@ -0,0 +1,27 @@
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.hsnew file+10
@@ -0,0 +1,10 @@
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.hsnew file+10
@@ -0,0 +1,10 @@
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.hsnew file+20
@@ -0,0 +1,20 @@
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.hsnew file+15
@@ -0,0 +1,15 @@
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.hsnew file+39
@@ -0,0 +1,39 @@
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.hsnew file+21
@@ -0,0 +1,21 @@
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.hsnew file+12
@@ -0,0 +1,12 @@
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.hsnew file+15
@@ -0,0 +1,15 @@
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.hsnew file+9
@@ -0,0 +1,9 @@
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.hsnew file+12
@@ -0,0 +1,12 @@
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.hsnew file+5
@@ -0,0 +1,5 @@
1+{- $setup
2+>>> :m
3+>>> :set -XQuasiQuotes
4+>>> import Streamly.Internal.Unicode.String
5+-}
core/src/Streamly/Console/Stdio.hs+1−27
@@ -24,33 +24,7 @@ module Streamly.Console.Stdio
24 -- * Write (stderr)
24 -- * Write (stderr)
25 , writeErr
25 , writeErr
26 , writeErrChunks
26 , writeErrChunks
27−
28− -- * Deprecated
29− , read
30− , readChunks
31 )
27 )
32where
28where
33
29
34−import Control.Monad.IO.Class (MonadIO(..))
35−import Data.Word (Word8)
36−import Streamly.Internal.Data.Array.Type (Array)
37−import Streamly.Internal.Data.Unfold (Unfold)
38−
39−import Streamly.Internal.Console.Stdio hiding (read, readChunks)
30+import Streamly.Internal.Console.Stdio
40−import Prelude hiding (read)
41−
42−-- Same as 'reader'
43−--
44−-- @since 0.8.0
45−{-# DEPRECATED read "Please use 'reader' instead" #-}
46−{-# INLINE read #-}
47−read :: MonadIO m => Unfold m () Word8
48−read = reader
49−
50−-- Same as 'chunkReader'
51−--
52−-- @since 0.8.0
53−{-# DEPRECATED readChunks "Please use 'chunkReader' instead" #-}
54−{-# INLINE readChunks #-}
55−readChunks :: MonadIO m => Unfold m () (Array Word8)
56−readChunks = chunkReader
core/src/Streamly/Data/Array.hs+115−113
@@ -1,3 +1,4 @@
1+{-# LANGUAGE CPP #-}
1-- |
2-- |
2-- Module : Streamly.Data.Array
3-- Module : Streamly.Data.Array
3-- Copyright : (c) 2019 Composewell Technologies
4-- Copyright : (c) 2019 Composewell Technologies
@@ -7,159 +8,160 @@
7-- Stability : released
8-- Stability : released
8-- Portability : GHC
9-- Portability : GHC
9--
10--
10−-- This module provides APIs to create and use unboxed immutable arrays. Once
11+-- Unboxed immutable arrays with streaming interfaces.
11−-- created their contents cannot be modified. Only types that are unboxable via
12−-- the 'Unbox' type class can be stored in these arrays.
13−--
14−-- = Folding Arrays
15−--
16−-- Convert array to stream, and fold the stream:
17−--
18−-- >>> fold f arr = Stream.unfold Array.reader arr & Stream.fold f
19−-- >>> fold Fold.sum (Array.fromList [1,2,3::Int])
20−-- 6
21−--
22−-- = Transforming Arrays
23−--
24−-- Convert array to stream, transform, and fold back to array:
25--
12--
26−-- >>> amap f arr = Stream.unfold Array.reader arr & fmap f & Stream.fold Array.write
13+-- Please refer to "Streamly.Internal.Data.Array" for functions that have not
27−-- >>> amap (+1) (Array.fromList [1,2,3::Int])
14+-- yet been released.
28−-- fromList [2,3,4]
29−--
30−-- = Pinned and Unpinned Arrays
31--
15--
32−-- The array type can use both pinned and unpinned memory under the hood.
33−-- Currently the array creation APIs create arrays in pinned memory but it will
34−-- change to unpinned in future releases. The change should not affect users
35−-- functionally unless they are directly accessing the internal memory of the
36−-- array via internal APIs. As of now unpinned arrays can be created using
37−-- unreleased APIs.
38−--
39−-- Unpinned arrays have the advantage of allowing automatic defragmentation of
40−-- the memory by GC. Whereas pinned arrays have the advantage of not requiring
41−-- a copy by GC. Normally you would want to use unpinned arrays. However, in
42−-- some cases, for example, for long lived large data storage, and for
43−-- interfacing with the operating system or foreign (non-Haskell) consumers you
44−-- may want to use pinned arrays.
45−--
46−-- = Creating Arrays from Non-IO Streams
47−--
48−-- Array creation folds require 'MonadIO' because they need to sequence effects
49−-- in IO streams. To operate on streams in pure Monads like 'Identity' you can
50−-- hoist it to IO monad as follows:
51−--
52−-- The 'MonadIO' based folds can be hoisted to 'Identity' stream folds:
53−--
54−-- >>> purely = Fold.hoist (Identity . unsafePerformIO)
55−-- >>> Stream.fold (purely Array.write) $ Stream.fromList [1,2,3::Int]
56−-- Identity fromList [1,2,3]
57−--
58−-- Alternatively, 'Identity' streams can be generalized to IO streams:
59−--
60−-- >>> pure = Stream.fromList [1,2,3] :: Stream Identity Int
61−-- >>> generally = Stream.hoist (return . runIdentity)
62−-- >>> Stream.fold Array.write (generally pure :: Stream IO Int)
63−-- fromList [1,2,3]
64−--
65−-- Since it is a pure stream we can use 'unsafePerformIO' to extract the result
66−-- of fold from IO.
67−--
68−-- = Programming Tips
69−--
70−-- This module is designed to be imported qualified:
71−--
72−-- >>> import qualified Streamly.Data.Array as Array
73−--
74−-- Use @QuantifiedConstraints@ extension to avoid the 'Storable' constraint
75−-- when using the 'Unbox' constraint.
16+-- For arrays that work on boxed types, not requiring the 'Unbox' constraint,
76−--
17+-- please refer to "Streamly.Data.Array.Generic". For arrays that can be
77−-- For experimental APIs see "Streamly.Internal.Data.Array".
18+-- mutated in-place, please see "Streamly.Data.MutArray".
78
19
79module Streamly.Data.Array
20module Streamly.Data.Array
80 (
21 (
81− -- * Imports for Examples
22+ -- * Setup
23+ -- | To execute the code examples provided in this module in ghci, please
24+ -- run the following commands first.
25+ --
82 -- $setup
26 -- $setup
83
27
28+ -- * Overview
29+ -- $overview
30+
84 -- * The Array Type
31 -- * The Array Type
85− A.Array
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
86
46
87 -- * Construction
47 -- * Construction
88 -- | When performance matters, the fastest way to generate an array is
48 -- | When performance matters, the fastest way to generate an array is
89− -- 'writeN'. 'IsList' and 'IsString' instances can be
49+ -- 'createOf'. 'IsList' and 'IsString' instances can be
90 -- used to conveniently construct arrays from literal values.
50 -- used to conveniently construct arrays from literal values.
91 -- 'OverloadedLists' extension or 'fromList' can be used to construct an
51 -- 'OverloadedLists' extension or 'fromList' can be used to construct an
92 -- array from a list literal. Similarly, 'OverloadedStrings' extension or
52 -- array from a list literal. Similarly, 'OverloadedStrings' extension or
93 -- 'fromList' can be used to construct an array from a string literal.
53 -- 'fromList' can be used to construct an array from a string literal.
94
54
95− -- Pure List APIs
55+ -- ** From Stream
96− , A.fromListN
56+ , createOf
97− , A.fromList
57+ , create
98−
99− -- Monadic APIs
100− , A.writeN -- drop new
101− , A.write -- full buffer
102 , writeLastN -- drop old (ring buffer)
58 , writeLastN -- drop old (ring buffer)
103
59
104− -- * Conversion
60+ -- ** From List
61+ , fromListN
62+ , fromList
63+
64+ -- * To List
105 -- 'GHC.Exts.toList' from "GHC.Exts" can be used to convert an array to a
65 -- 'GHC.Exts.toList' from "GHC.Exts" can be used to convert an array to a
106 -- list.
66 -- list.
107− , A.toList
67+ , toList
68+
69+ -- * To Stream
70+ , read
71+ , readRev
108
72
109 -- * Unfolds
73 -- * Unfolds
110− , A.reader
74+ , reader
111− , A.readerRev
75+ , readerRev
112
76
113 -- * Casting
77 -- * Casting
114 , cast
78 , cast
115 , asBytes
79 , asBytes
116
80
117 -- * Random Access
81 -- * Random Access
118− , A.length
82+ , length
119 -- , (!!)
83 -- , (!!)
120− , A.getIndex
84+ , getIndex
85+
86+ -- * Serialization
87+ , pinnedSerialize
88+ , deserialize
121
89
122− -- * Unbox Type Class
90+ -- * Re-exports
123 , Unbox (..)
91 , Unbox (..)
92+ , Serialize(..)
124
93
125 -- * Deprecated
94 -- * Deprecated
126− , read
95+ , writeN -- drop new
127− , readRev
96+ , write -- full buffer
128 )
97 )
129where
98where
130
99
131#include "inline.hs"
100#include "inline.hs"
132
101
133−import Streamly.Internal.Data.Unfold (Unfold)
102+import Streamly.Internal.Data.Array
134−import Streamly.Internal.Data.Array as A hiding (read, readRev)
103+import Streamly.Internal.Data.MutByteArray (Unbox(..), Serialize(..))
135
104
136−import Streamly.Internal.Data.Unboxed (Unbox (..))
105+import Prelude hiding (read, length)
137−import Prelude hiding (read)
138
106
139−-- $setup
107+#include "DocTestDataArray.hs"
140−-- >>> :m
141−-- >>> :set -XFlexibleContexts
142−-- >>> import Data.Function ((&))
143−-- >>> import Data.Functor.Identity (Identity(..))
144−-- >>> import Streamly.Data.Array (Array)
145−-- >>> import Streamly.Data.Stream (Stream)
146−-- >>> import System.IO.Unsafe (unsafePerformIO)
147−-- >>> import qualified Streamly.Data.Array as Array
148−-- >>> import qualified Streamly.Data.Fold as Fold
149−-- >>> import qualified Streamly.Internal.Data.Fold as Fold (hoist)
150−-- >>> import qualified Streamly.Data.Stream as Stream
151−-- >>> import qualified Streamly.Internal.Data.Stream as Stream (hoist)
152
108
153−-- | Same as 'reader'
109+-- $overview
154--
110--
155−{-# DEPRECATED read "Please use 'reader' instead" #-}
111+-- This module provides APIs to create and use unboxed immutable arrays. Once
156−{-# INLINE_NORMAL read #-}
112+-- created, their contents cannot be modified. Only types that are unboxable
157−read :: (Monad m, Unbox a) => Unfold m (Array a) a
113+-- via the 'Unbox' type class can be stored in these arrays. Note that the
158−read = reader
114+-- array memory grows automatically when creating a new array, therefore, an
159−
115+-- array can be created from a variable length stream.
160−-- | Same as 'readerRev'
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]
161--
132--
162−{-# DEPRECATED readRev "Please use 'readerRev' instead" #-}
133+-- == Pinned and Unpinned Arrays
163−{-# INLINE_NORMAL readRev #-}
134+--
164−readRev :: (Monad m, Unbox a) => Unfold m (Array a) a
135+-- The array type can use both pinned and unpinned memory under the hood. The
165−readRev = readerRev
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.hs+24−12
@@ -7,33 +7,45 @@
7-- Stability : experimental
7-- Stability : experimental
8-- Portability : GHC
8-- Portability : GHC
9--
9--
10+-- Unconstrained version of "Streamly.Data.Array" module.
11+--
12+-- See the "Streamly.Data.Array" module for documentation.
13+--
10module Streamly.Data.Array.Generic
14module Streamly.Data.Array.Generic
11 ( Array
15 ( Array
12
16
13 -- * Construction
17 -- * Construction
14− , A.fromListN
18+ , fromListN
15− , A.fromList
19+ , fromList
16
20
17 -- MonadicAPIs
21 -- MonadicAPIs
18− , A.writeN
22+ , createOf
19− , A.write
23+ , create
24+
25+ -- * Conversion
26+ , toList
20
27
21 -- * Streams
28 -- * Streams
22− , A.read
29+ , read
23− , A.readRev
30+ , readRev
24
31
25 -- * Unfolds
32 -- * Unfolds
26− , A.reader
33+ , reader
34+ -- , A.readerRev
27
35
28 -- * Random Access
36 -- * Random Access
29− , A.length
37+ , length
38+ , getIndex
30
39
31− -- * Folding Arrays
40+ -- -- * Folding Arrays
32 -- , A.streamFold
41 -- , A.streamFold
33 -- , A.fold
42 -- , A.fold
43+
44+ -- * Deprecated
45+ , writeN
46+ , write
34 )
47 )
35where
48where
36
49
37−import Streamly.Internal.Data.Array.Generic (Array)
50+import Streamly.Internal.Data.Array.Generic
38−
51+import Prelude hiding (length, read)
39−import qualified Streamly.Internal.Data.Array.Generic as A
core/src/Streamly/Data/Array/Mut.hsdeleted−64
@@ -1,64 +0,0 @@
1−-- |
2−-- Module : Streamly.Data.Array.Mut
3−-- Copyright : (c) 2022 Composewell Technologies
4−--
5−-- License : BSD3
6−-- Maintainer : streamly@composewell.com
7−-- Stability : released
8−-- Portability : GHC
9−--
10−-- This module provides mutable arrays suitable for long lived data storage,
11−-- random access, and mutation.
12−--
13−
14−module Streamly.Data.Array.Mut
15− (
16− -- * Types
17− Unbox (..)
18− , Array
19−
20− -- * Construction
21−
22− -- Uninitialized Arrays
23− , new
24− , newPinned
25−
26− -- From containers
27− , fromListN
28− , fromList
29− , writeN -- drop new
30− , write -- full buffer
31− -- writeLastN
32−
33− -- * Appending elements
34− , snoc
35−
36− -- * Appending streams
37− , writeAppendN
38− , writeAppend
39−
40− -- * Inplace mutation
41− , putIndex
42−
43− -- * Random access
44− , getIndex
45−
46− -- * Conversion
47− , toList
48−
49− -- * Unfolds
50− , reader
51− , readerRev
52−
53− -- * Casting
54− , cast
55− , asBytes
56−
57− -- * Size
58− , length
59− )
60−where
61−
62−import Prelude hiding (length, read)
63−import Streamly.Internal.Data.Array.Mut
64−import Streamly.Internal.Data.Unboxed (Unbox (..))
core/src/Streamly/Data/Fold.hs+139−51
@@ -1,3 +1,4 @@
1+{-# LANGUAGE CPP #-}
1-- |
2-- |
2-- Module : Streamly.Data.Fold
3-- Module : Streamly.Data.Fold
3-- Copyright : (c) 2019 Composewell Technologies
4-- Copyright : (c) 2019 Composewell Technologies
@@ -6,31 +7,45 @@
6-- Stability : released
7-- Stability : released
7-- Portability : GHC
8-- Portability : GHC
8--
9--
9−-- A 'Fold' is a sink or a consumer of a stream of values. The 'Fold' type
10+-- Fast, composable stream consumers with ability to terminate, supporting
10−-- consists of an accumulator and an effectful action that absorbs a value into
11+-- stream fusion.
11−-- the accumulator.
12--
12--
13−-- >>> import Data.Function ((&))
13+-- == Using Folds
14−-- >>> import qualified Streamly.Data.Fold as Fold
15−-- >>> import qualified Streamly.Data.Stream as Stream
16--
14--
17−-- For example, a 'sum' Fold represents adding the input to the accumulated
15+-- This module provides elementary folds and fold combinators that can be used
18−-- sum. A fold driver pushes values from a stream to the 'Fold' one at a time,
16+-- to consume a stream of data and reduce it to a final value, or transform it
19−-- reducing the stream to a single value.
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
35+-- in the input stream:
20--
36--
21-- >>> Stream.fold Fold.sum $ Stream.fromList [1..100]
37-- >>> Stream.fold Fold.sum $ Stream.fromList [1..100]
22-- 5050
38-- 5050
23--
39--
24−-- Conceptually, a 'Fold' is a data type that can mimic a strict left fold
40+-- Conceptually, a 'Fold' is a data type that mimics 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:
28--
43--
29-- >>> Data.List.foldl' (+) 0 [1..100]
44-- >>> Data.List.foldl' (+) 0 [1..100]
30-- 5050
45-- 5050
31--
46--
32−-- 'Fold's have an early termination capability e.g. the 'one' fold would
47+-- 'Fold's have an early termination capability e.g. the 'one' fold terminates
33−-- terminate on an infinite stream:
48+-- after consuming one element:
34--
49--
35-- >>> Stream.fold Fold.one $ Stream.fromList [1..]
50-- >>> Stream.fold Fold.one $ Stream.fromList [1..]
36-- Just 1
51-- Just 1
@@ -47,6 +62,8 @@
47-- >>> Stream.fold sumTwo $ Stream.fromList [1..100]
62-- >>> Stream.fold sumTwo $ Stream.fromList [1..100]
48-- 3
63-- 3
49--
64--
65+-- == Parallel Composition
66+--
50-- Folds can be combined to run in parallel on the same input. For example, to
67-- Folds can be combined to run in parallel on the same input. For example, to
51-- compute the average of numbers in a stream without going through the stream
68-- compute the average of numbers in a stream without going through the stream
52-- twice:
69-- twice:
@@ -66,6 +83,8 @@
66-- >>> Stream.fold f stream
83-- >>> Stream.fold f stream
67-- ("Even 50","Odd 50")
84-- ("Even 50","Odd 50")
68--
85--
86+-- == Sequential Composition
87+--
69-- Terminating folds can be combined to parse the stream serially such that the
88-- Terminating folds can be combined to parse the stream serially such that the
70-- first fold consumes the input until it terminates and the second fold
89-- first fold consumes the input until it terminates and the second fold
71-- consumes the rest of the input until it terminates:
90-- consumes the rest of the input until it terminates:
@@ -74,6 +93,8 @@
74-- >>> Stream.fold f $ Stream.fromList "header: hello\n"
93-- >>> Stream.fold f $ Stream.fromList "header: hello\n"
75-- ("header: ","hello\n")
94-- ("header: ","hello\n")
76--
95--
96+-- == Splitting a Stream
97+--
77-- A 'Fold' can be applied repeatedly on a stream to transform it to a stream
98-- A 'Fold' can be applied repeatedly on a stream to transform it to a stream
78-- of fold results. To split a stream on newlines:
99-- of fold results. To split a stream on newlines:
79--
100--
@@ -86,10 +107,7 @@
86-- >>> Stream.fold (Fold.many f Fold.toList) $ Stream.fromList "Hello there!\nHow are you\n"
107-- >>> Stream.fold (Fold.many f Fold.toList) $ Stream.fromList "Hello there!\nHow are you\n"
87-- ["Hello there!\n","How are you\n"]
108-- ["Hello there!\n","How are you\n"]
88--
109--
89−-- Please see "Streamly.Internal.Data.Fold" for additional @Pre-release@
110+-- == Folds vs. Streams
90−-- functions.
91−--
92−-- = Folds vs. Streams
93--
111--
94-- We can often use streams or folds to achieve the same goal. However, streams
112-- We can often use streams or folds to achieve the same goal. However, streams
95-- are more efficient in composition of producers (e.g.
113-- are more efficient in composition of producers (e.g.
@@ -125,17 +143,49 @@
125-- Notice the similiarity in the definition of @f@ in both cases, the only
143-- Notice the similiarity in the definition of @f@ in both cases, the only
126-- difference is the composition by @&@ vs @$@ and the use @lmap@ vs @map@, the
144-- difference is the composition by @&@ vs @$@ and the use @lmap@ vs @map@, the
127-- difference is due to output vs input side transformations.
145-- 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.
128
165
129module Streamly.Data.Fold
166module Streamly.Data.Fold
130 (
167 (
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+
131 -- * Fold Type
179 -- * Fold Type
132
180
133− Fold -- (..)
181+ , Fold -- (..)
182+ , Tee (..)
134
183
135 -- * Constructors
184 -- * Constructors
136 , foldl'
185 , foldl'
137 , foldlM'
186 , foldlM'
138 , foldl1'
187 , foldl1'
188+ , foldlM1'
139 , foldr'
189 , foldr'
140
190
141 -- * Folds
191 -- * Folds
@@ -155,6 +205,9 @@ module Streamly.Data.Fold
155 , drain
205 , drain
156 , drainMapM
206 , drainMapM
157 , length
207 , length
208+ , countDistinct
209+ , countDistinctInt
210+ , frequency
158 , sum
211 , sum
159 , product
212 , product
160 , mean
213 , mean
@@ -164,6 +217,9 @@ module Streamly.Data.Fold
164 -- Collectors
217 -- Collectors
165 , toList
218 , toList
166 , toListRev
219 , toListRev
220+ , toSet
221+ , toIntSet
222+ , topBy
167
223
168 -- ** Non-Empty Accumulators
224 -- ** Non-Empty Accumulators
169 -- | Accumulators that do not have a default value, therefore, return
225 -- | Accumulators that do not have a default value, therefore, return
@@ -177,15 +233,15 @@ module Streamly.Data.Fold
177 -- ** Filtering Scanners
233 -- ** Filtering Scanners
178 -- | Accumulators that are usually run as a scan using the 'scanMaybe'
234 -- | Accumulators that are usually run as a scan using the 'scanMaybe'
179 -- combinator.
235 -- combinator.
180− , uniq
181− , uniqBy
182− , deleteBy
183 , findIndices
236 , findIndices
184 , elemIndices
237 , elemIndices
238+ , deleteBy
239+ -- , uniq
240+ , uniqBy
241+ , nub
242+ , nubInt
185
243
186 -- ** Terminating Folds
244 -- ** Terminating Folds
187− -- | These are much like lazy right folds.
188−
189 , one
245 , one
190 , null
246 , null
191 -- , satisfy
247 -- , satisfy
@@ -194,6 +250,7 @@ module Streamly.Data.Fold
194 , index
250 , index
195 , the
251 , the
196 , find
252 , find
253+ , findM
197 , lookup
254 , lookup
198 , findIndex
255 , findIndex
199 , elemIndex
256 , elemIndex
@@ -204,18 +261,26 @@ module Streamly.Data.Fold
204 , and
261 , and
205 , or
262 , or
206
263
207− -- * Running A Fold
264+ -- * Incremental builders
208− , drive
265+ -- | Mutable arrays ("Streamly.Data.MutArray") are basic builders. You can
209− , driveBreak
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.
210
273
211− -- * Building Incrmentally
274+ -- XXX should rename to "extract". can use "Fold.drive Stream.nil" instead,
212− , extractM
275+ -- for now.
213− , reduce
276+ -- , extractM
214− , snoc
277+ -- , reduce
278+ , addOne
215 -- , snocl
279 -- , snocl
216− , snocM
280+ -- XXX Can we use something like concatEffect to implement snocM?
281+ -- , snocM
217 -- , snoclM
282 -- , snoclM
218− , augment
283+ , addStream
219 , duplicate
284 , duplicate
220 -- , isClosed
285 -- , isClosed
221
286
@@ -255,17 +320,23 @@ module Streamly.Data.Fold
255 , filterM
320 , filterM
256
321
257 -- -- ** Mapping Filters
322 -- -- ** Mapping Filters
258− , catMaybes
259 , mapMaybe
323 , mapMaybe
324+ , catMaybes
325+ , catLefts
326+ , catRights
327+ , catEithers
260
328
261 -- ** Trimming
329 -- ** Trimming
262 , take
330 , take
263 -- , takeInterval
331 -- , takeInterval
264− , takeEndBy_
265 , takeEndBy
332 , takeEndBy
333+ , takeEndBy_
266
334
267− -- ** Serial Append
335+ -- ** Splitting
268 , splitWith
336 , splitWith
337+ , many
338+ , groupsOf
339+ -- , intervalsOf
269
340
270 -- ** Parallel Distribution
341 -- ** Parallel Distribution
271 -- | For applicative composition using distribution see
342 -- | For applicative composition using distribution see
@@ -287,18 +358,29 @@ module Streamly.Data.Fold
287 --, partitionByMinM
358 --, partitionByMinM
288 --, partitionBy
359 --, partitionBy
289
360
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+
290 -- ** Unzipping
373 -- ** Unzipping
291 , unzip
374 , unzip
292
375
293− -- ** Splitting
294− , many
295− , chunksOf
296− -- , intervalsOf
297−
298 -- ** Nesting
376 -- ** Nesting
299 , concatMap
377 , concatMap
300
378
379+ -- * Transforming the Monad
380+ , morphInner
381+
301 -- * Deprecated
382 -- * Deprecated
383+ , chunksOf
302 , foldr
384 , foldr
303 , drainBy
385 , drainBy
304 , last
386 , last
@@ -312,16 +394,22 @@ module Streamly.Data.Fold
312where
394where
313
395
314import Prelude
396import Prelude
315− hiding (filter, drop, dropWhile, take, takeWhile, zipWith, foldr,
397+ hiding (Foldable(..), filter, drop, dropWhile, take, takeWhile, zipWith,
316− foldl, map, mapM_, sequence, all, any, sum, product, elem,
398+ map, mapM_, sequence, all, any,
317− notElem, maximum, minimum, head, last, tail, length, null,
399+ notElem, head, last, tail,
318− reverse, iterate, init, and, or, lookup, foldr1, (!!),
400+ reverse, iterate, init, and, or, lookup, (!!),
319− scanl, scanl1, replicate, concatMap, mconcat, foldMap, unzip,
401+ scanl, scanl1, replicate, concatMap, mconcat, unzip,
320 span, splitAt, break, mapM, maybe)
402 span, splitAt, break, mapM, maybe)
321
403
322import Streamly.Internal.Data.Fold
404import Streamly.Internal.Data.Fold
323
405
324−-- $setup
406+#include "DocTestDataFold.hs"
325−-- >>> import Data.Function ((&))
407+
326−-- >>> import qualified Streamly.Data.Fold as Fold
408+--------------------------------------------------------------------------------
327−-- >>> import qualified Streamly.Data.Stream as Stream
409+-- Deprecated
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.hsdeleted−41
@@ -1,41 +0,0 @@
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.Data.Stream 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.one <> Tee Fold.latest
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.hsnew file+110
@@ -0,0 +1,110 @@
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.hsnew file+70
@@ -0,0 +1,70 @@
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.hsnew file+106
@@ -0,0 +1,106 @@
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.hs+149−10
@@ -1,3 +1,4 @@
1+{-# LANGUAGE CPP #-}
1-- |
2-- |
2-- Module : Streamly.Data.Parser
3-- Module : Streamly.Data.Parser
3-- Copyright : (c) 2020 Composewell Technologies
4-- Copyright : (c) 2020 Composewell Technologies
@@ -6,15 +7,146 @@
6-- Stability : pre-release
7-- Stability : pre-release
7-- Portability : GHC
8-- Portability : GHC
8--
9--
9−-- Fast backtracking parsers with stream fusion and native streaming
10+-- Parsers are stream consumers like folds with the following differences:
10−-- capability. Parsers are just more powerful folds, folds and parsers can be
11−-- interconverted.
12--
11--
13−-- Note that these parsers do not report the error context (e.g. line number or
12+-- * folds cannot fail but parsers can fail and backtrack.
14−-- column). Though this can be supported in future.
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.
15--
141--
16module Streamly.Data.Parser
142module Streamly.Data.Parser
17 (
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+
18 -- * Parser Type
150 -- * Parser Type
19 Parser
151 Parser
20
152
@@ -47,7 +179,7 @@ module Streamly.Data.Parser
47 -- , either
179 -- , either
48
180
49 -- ** Sequences
181 -- ** Sequences
50− , eqBy
182+ , streamEqBy
51 , listEqBy
183 , listEqBy
52 , listEq
184 , listEq
53
185
@@ -86,12 +218,17 @@ module Streamly.Data.Parser
86
218
87 -- ** Grouping
219 -- ** Grouping
88 , groupBy
220 , groupBy
89− -- , groupByRolling
221+ , groupByRolling
90− -- , groupByRollingEither
222+ , groupByRollingEither
91
223
92 -- ** Framing
224 -- ** Framing
93− , wordFramedBy
225+ -- , wordFramedBy
94− , wordQuotedBy
226+ , wordWithQuotes
227+ -- , wordProcessQuotes
228+ -- , wordKeepQuotes
229+
230+ -- -- * Alternative
231+ -- , alt
95
232
96 -- ** Splitting
233 -- ** Splitting
97 , many
234 , many
@@ -106,3 +243,5 @@ where
106
243
107import Streamly.Internal.Data.Parser
244import Streamly.Internal.Data.Parser
108import Prelude hiding (dropWhile, takeWhile, filter)
245import Prelude hiding (dropWhile, takeWhile, filter)
246+
247+#include "DocTestDataParser.hs"
core/src/Streamly/Data/ParserK.hsnew file+139
@@ -0,0 +1,139 @@
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.hs+418−141
@@ -1,7 +1,4 @@
1−{-# OPTIONS_GHC -Wno-orphans #-}
1+{-# LANGUAGE CPP #-}
2−
3−#include "inline.hs"
4−
5-- |
2-- |
6-- Module : Streamly.Data.Stream
3-- Module : Streamly.Data.Stream
7-- Copyright : (c) 2017 Composewell Technologies
4-- Copyright : (c) 2017 Composewell Technologies
@@ -11,102 +8,59 @@
11-- Stability : released
8-- Stability : released
12-- Portability : GHC
9-- Portability : GHC
13--
10--
14−-- To run examples in this module:
11+-- Streams represented as state machines, that fuse together when composed
15−--
12+-- statically, eliminating function calls or intermediate constructor
16−-- >>> import qualified Streamly.Data.Fold as Fold
13+-- allocations - generating tight, efficient loops. Suitable for high
17−-- >>> import qualified Streamly.Data.Stream as Stream
14+-- performance looping operations.
18−--
19−-- We will add some more imports in the examples as needed.
20−--
21−-- For effectful streams we will use the following IO action:
22−--
23−-- >>> effect n = print n >> return n
24−--
25−-- = Overview
26−--
27−-- Streamly is a framework for modular data flow based programming and
28−-- declarative concurrency. Powerful stream fusion framework in streamly
29−-- allows high performance combinatorial programming even when using byte level
30−-- streams. Streamly API is similar to Haskell lists.
31−--
32−-- Streams can be constructed
33−-- like lists, except that they use 'nil' instead of '[]' and 'cons' instead of
34−-- ':'.
35−--
36−-- `cons` constructs a pure stream which is more or less the same as a list:
37−--
38−-- >>> import Streamly.Data.Stream (Stream, cons, consM, nil)
39−-- >>> stream = 1 `cons` 2 `cons` nil :: Stream IO Int
40−-- >>> Stream.fold Fold.toList stream -- IO [Int]
41−-- [1,2]
42−--
43−-- 'consM' constructs a stream from effectful actions:
44--
15--
45−-- >>> stream = effect 1 `consM` effect 2 `consM` nil
16+-- If you need to call these operations recursively in a loop (i.e. composed
46−-- >>> Stream.fold Fold.toList stream
17+-- dynamically) then it is recommended to use the continuation passing style
47−-- 1
18+-- (CPS) stream operations from the "Streamly.Data.StreamK" module. 'Stream'
48−-- 2
19+-- and 'StreamK' types are interconvertible. See more details in the
49−-- [1,2]
20+-- documentation below regarding 'Stream' vs 'StreamK'.
50--
21--
51−-- == Console Echo Example
22+-- Please refer to "Streamly.Internal.Data.Stream" for more functions that have
52−--
23+-- not yet been released.
53−-- In the following example, 'repeatM' generates an infinite stream of 'String'
54−-- by repeatedly performing the 'getLine' IO action. 'mapM' then applies
55−-- 'putStrLn' on each element in the stream converting it to stream of '()'.
56−-- Finally, 'drain' folds the stream to IO discarding the () values, thus
57−-- producing only effects.
58−--
59−-- >>> import Data.Function ((&))
60−--
61−-- >>> :{
62−-- echo =
63−-- Stream.repeat getLine -- Stream IO (IO String)
64−-- & Stream.sequence -- Stream IO String
65−-- & Stream.mapM putStrLn -- Stream IO ()
66−-- & Stream.fold Fold.drain -- IO ()
67−-- :}
68--
24--
69−-- This is a console echo program. It is an example of a declarative loop
25+-- Checkout the <https://github.com/composewell/streamly-examples>
70−-- written using streaming combinators. Compare it with an imperative @while@
71−-- loop.
72−--
73−-- Hopefully, this gives you an idea how we can program declaratively by
74−-- representing loops using streams. In this module, you can find all
75−-- "Data.List" like functions and many more powerful combinators to perform
76−-- common programming tasks.
77−--
78−-- Some common idioms:
79−--
80−-- >>> repeatM = Stream.sequence . Stream.repeat
81−-- >>> replicateM n = Stream.sequence . Stream.replicate n
82−-- >>> fromListM = Stream.sequence . Stream.fromList
83−-- >>> fromFoldableM = Stream.sequence . Stream.fromFoldable
84−-- >>> fromIndices f = fmap f $ Stream.enumerateFrom 0
85−--
86−-- Also see "Streamly.Internal.Data.Stream" module for many more @Pre-release@
87−-- combinators. See the <https://github.com/composewell/streamly-examples>
88-- repository for many more real world examples of stream programming.
26-- repository for many more real world examples of stream programming.
89−--
27+
90module Streamly.Data.Stream
28module Streamly.Data.Stream
91 (
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
92 Stream
40 Stream
41+
93 -- * Construction
42 -- * Construction
94 -- | Functions ending in the general shape @b -> Stream m a@.
43 -- | Functions ending in the general shape @b -> Stream m a@.
95 --
44 --
96− -- See also: "Streamly.Internal.Data.Stream.Generate" for
45+ -- Useful Idioms:
97− -- @Pre-release@ functions.
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
98
52
99 -- ** Primitives
53 -- ** Primitives
100− -- | Primitives to construct a stream from pure values or monadic actions.
54+ -- | A fused 'Stream' is never constructed using these primitives, they are
101− -- All other stream construction and generation combinators described later
55+ -- typically generated by converting containers like list into streams, or
102− -- can be expressed in terms of these primitives. However, the special
56+ -- generated using custom functions provided in this module. The 'cons'
103− -- versions provided in this module can be much more efficient in most
57+ -- primitive in this module has a rare use in fusing a small number of
104− -- cases. Users can create custom combinators using these primitives.
58+ -- elements. On the other hand, it is common to construct 'StreamK' stream
59+ -- using the StreamK.'StreamK.cons' primitive.
105 , nil
60 , nil
61+ , nilM
106 , cons
62 , cons
107 , consM
63 , consM
108− -- , cons2 -- fused version
109− -- , consM2 -- fused version
110
64
111 -- ** Unfolding
65 -- ** Unfolding
112 -- | 'unfoldrM' is the most general way of generating a stream efficiently.
66 -- | 'unfoldrM' is the most general way of generating a stream efficiently.
@@ -116,6 +70,15 @@ module Streamly.Data.Stream
116
70
117 -- ** From Values
71 -- ** From Values
118 -- | Generate a monadic stream from a seed value or 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+ --
119 , fromPure
82 , fromPure
120 , fromEffect
83 , fromEffect
121 , repeat
84 , repeat
@@ -150,7 +113,6 @@ module Streamly.Data.Stream
150 -- | Convert an input structure, container or source into a stream. All of
113 -- | Convert an input structure, container or source into a stream. All of
151 -- these can be expressed in terms of primitives.
114 -- these can be expressed in terms of primitives.
152 , fromList
115 , fromList
153− , fromFoldable
154
116
155 -- ** From Unfolds
117 -- ** From Unfolds
156 -- | Most of the above stream generation operations can also be expressed
118 -- | Most of the above stream generation operations can also be expressed
@@ -161,8 +123,6 @@ module Streamly.Data.Stream
161 -- | Functions ending in the general shape @Stream m a -> m b@ or @Stream m
123 -- | Functions ending in the general shape @Stream m a -> m b@ or @Stream m
162 -- a -> m (b, Stream m a)@
124 -- a -> m (b, Stream m a)@
163 --
125 --
164− -- See also: "Streamly.Internal.Data.Stream.Eliminate" for @Pre-release@
165− -- functions.
166
126
167-- EXPLANATION: In imperative terms a fold can be considered as a loop over the stream
127-- EXPLANATION: In imperative terms a fold can be considered as a loop over the stream
168-- that reduces the stream to a single value.
128-- that reduces the stream to a single value.
@@ -236,30 +196,83 @@ module Streamly.Data.Stream
236 -- ending in the general shape @Stream m a -> m (b, Stream m a)@
196 -- ending in the general shape @Stream m a -> m (b, Stream m a)@
237 , uncons
197 , uncons
238
198
239− -- ** Folding
199+ -- ** Strict Left Folds
240 -- XXX Need to have a general parse operation here which can be used to
200 -- XXX Need to have a general parse operation here which can be used to
241 -- express all others.
201 -- express all others.
242 , fold -- XXX rename to run? We can have a Stream.run and Fold.run.
202 , fold -- XXX rename to run? We can have a Stream.run and Fold.run.
243 -- XXX fold1 can be achieved using Monoids or Refolds.
203 -- XXX fold1 can be achieved using Monoids or Refolds.
204+ -- XXX We can call this just "break" and parseBreak as "munch"
244 , foldBreak
205 , foldBreak
245
206
246− -- * Builders
207+ -- XXX should we have a Fold returning function in stream module?
247− , build
208+ -- , foldAdd
248 -- , buildl
209 -- , buildl
249
210
250 -- ** Parsing
211 -- ** Parsing
251 , parse
212 , parse
252− , parseBreak
213+ -- , parseBreak
253
214
254− -- -- ** Lazy Right Folds
215+ -- ** Lazy Right Folds
255− -- Consuming a stream to build a right associated expression, suitable
216+ -- | Consuming a stream to build a right associated expression, suitable
256 -- for lazy evaluation. Evaluation of the input happens when the output of
217 -- for lazy evaluation. Evaluation of the input happens when the output of
257 -- the fold is evaluated, the fold output is a lazy thunk.
218 -- the fold is evaluated, the fold output is a lazy thunk.
258 --
219 --
259 -- This is suitable for stream transformation operations, for example,
220 -- This is suitable for stream transformation operations, for example,
260 -- operations like mapping a function over the stream.
221 -- operations like mapping a function over the stream.
261− -- , foldrM
222+ , foldrM
262− -- , foldr
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
263
276
264 -- * Mapping
277 -- * Mapping
265 -- | Stateless one-to-one transformations. Use 'fmap' for mapping a pure
278 -- | Stateless one-to-one transformations. Use 'fmap' for mapping a pure
@@ -279,24 +292,58 @@ module Streamly.Data.Stream
279 -- the stream, it can merely transform them.
292 -- the stream, it can merely transform them.
280 , sequence
293 , sequence
281 , mapM
294 , mapM
282− -- , trace -- XXX Use "tracing" map instead?
295+ , trace
283 , tap
296 , tap
284 , delay
297 , delay
285
298
286 -- * Scanning
299 -- * Scanning
287 -- | Stateful one-to-one transformations.
300 -- | Stateful one-to-one transformations.
288 --
301 --
289− -- See also: "Streamly.Internal.Data.Stream.Transform" for
302+
290− -- @Pre-release@ functions.
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)
291 , scan
325 , scan
292 , postscan
326 , postscan
293 -- XXX postscan1 can be implemented using Monoids or Refolds.
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
294 -- Indexing can be considered as a special type of zipping where we zip a
339 -- Indexing can be considered as a special type of zipping where we zip a
295 -- stream with an index stream.
340 -- stream with an index stream.
296 , indexed
341 , indexed
297
342
298 -- * Insertion
343 -- * Insertion
299 -- | Add elements to the stream.
344 -- | Add elements to the stream.
345+ --
346+ -- >>> insert = Stream.insertBy compare
300
347
301 -- Inserting elements is a special case of interleaving/merging streams.
348 -- Inserting elements is a special case of interleaving/merging streams.
302 , insertBy
349 , insertBy
@@ -319,13 +366,28 @@ module Streamly.Data.Stream
319 , mapMaybeM
366 , mapMaybeM
320 , filter
367 , filter
321 , filterM
368 , filterM
369+
370+ -- Filter and concat
322 , catMaybes
371 , catMaybes
372+ , catLefts
373+ , catRights
374+ , catEithers
323
375
324 -- ** Stateful Filters
376 -- ** Stateful Filters
325 -- | 'scanMaybe' is the most general stateful filtering operation. The
377 -- | 'scanMaybe' is the most general stateful filtering operation. The
326 -- filtering folds (folds returning a 'Maybe' type) in
378 -- filtering folds (folds returning a 'Maybe' type) in
327 -- "Streamly.Internal.Data.Fold" can be used along with 'scanMaybe' to
379 -- "Streamly.Internal.Data.Fold" can be used along with 'scanMaybe' to
328 -- perform stateful filtering operations in general.
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)
329 , scanMaybe
391 , scanMaybe
330 , take
392 , take
331 , takeWhile
393 , takeWhile
@@ -333,47 +395,78 @@ module Streamly.Data.Stream
333 , drop
395 , drop
334 , dropWhile
396 , dropWhile
335 , dropWhileM
397 , dropWhileM
336− , deleteBy
398+ -- XXX write to an array in reverse and then read in reverse
337− , uniq
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
338
411
339− -- ** Searching
412+ -- -- ** Searching
340 -- Finding the presence or location of an element, a sequence of elements
413 -- Finding the presence or location of an element, a sequence of elements
341 -- or another stream within a stream.
414 -- or another stream within a stream.
342
415
343 -- -- ** Searching Elements
416 -- -- ** Searching Elements
344− , findIndices
417+ -- , findIndices
345− , elemIndices
418+ -- , elemIndices
346
419
347 -- * Combining Two Streams
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+
348 -- ** Appending
435 -- ** Appending
436+ -- | Equivalent of Data.List append:
437+ --
438+ -- >>> (++) = Stream.append
349 , append
439 , append
350
440
351 -- ** Interleaving
441 -- ** Interleaving
352 , interleave
442 , interleave
353− -- , interleave2
354
443
355 -- ** Merging
444 -- ** Merging
356− -- | Merging of @n@ streams can be performed by combining the streams pair
357− -- wise using
358− -- 'Streamly.Internal.Data.Stream.IsStream.Expand.concatPairsWith' to give
359− -- O(n * log n) time complexity.
360− -- If used with 'concatMapWith' it will have O(n^2) performance.
361−
362 , mergeBy
445 , mergeBy
363 , mergeByM
446 , mergeByM
364− -- , mergeBy2
365− -- , mergeByM2
366
447
367 -- ** Zipping
448 -- ** Zipping
368− -- | Zipping of @n@ streams can be performed by combining the streams pair
449+ -- | Idioms and equivalents of Data.List APIs:
369− -- wise using
450+ --
370− -- 'Streamly.Internal.Data.Stream.IsStream.Expand.concatPairsWith' with
451+ -- >>> zip = Stream.zipWith (,)
371− -- O(n * log n) time complexity.
452+ -- >>> unzip = Stream.fold (Fold.unzip Fold.toList Fold.toList)
372− -- If used with 'concatMapWith' it will have O(n^2) performance.
373 , zipWith
453 , zipWith
374 , zipWithM
454 , zipWithM
375− -- , zipWith2
455+ -- XXX zipWith3,4,5,6,7
376− -- , zipWithM2
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 (..)
377
470
378 -- * Unfold Each
471 -- * Unfold Each
379 , unfoldMany
472 , unfoldMany
@@ -393,77 +486,261 @@ module Streamly.Data.Stream
393 -- One dimension loops are just a special case of nested loops. For
486 -- One dimension loops are just a special case of nested loops. For
394 -- example, 'concatMap' can degenerate to a simple map operation:
487 -- example, 'concatMap' can degenerate to a simple map operation:
395 --
488 --
396− -- > map f m = S.concatMap (\x -> S.fromPure (f x)) m
489+ -- >>> map f m = Stream.concatMap (\x -> Stream.fromPure (f x)) m
397 --
490 --
398 -- Similarly, 'concatMap' can perform filtering by mapping an element to a
491 -- Similarly, 'concatMap' can perform filtering by mapping an element to a
399 -- 'nil' stream:
492 -- 'nil' stream:
400 --
493 --
401− -- > filter p m = S.concatMap (\x -> if p x then S.fromPure x else S.nil) m
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:
402 --
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 " "
403
503
404− , concatMapWith
504+ , concatEffect
405 , concatMap
505 , concatMap
406 , concatMapM
506 , concatMapM
407
507
408 -- * Repeated Fold
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 (==)
409 , foldMany -- XXX Rename to foldRepeat
516 , foldMany -- XXX Rename to foldRepeat
517+ , groupsOf
410 , parseMany
518 , parseMany
411
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+
412 -- * Buffered Operations
533 -- * Buffered Operations
413 -- | Operations that require buffering of the stream.
534 -- | Operations that require buffering of the stream.
414 -- Reverse is essentially a left fold followed by an unfold.
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+ --
415 , reverse
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
416
557
417 -- * Multi-Stream folds
558 -- * Multi-Stream folds
418 -- | Operations that consume multiple streams at the same time.
559 -- | Operations that consume multiple streams at the same time.
419 , eqBy
560 , eqBy
420 , cmpBy
561 , cmpBy
421 , isPrefixOf
562 , isPrefixOf
563+ , isInfixOf
564+ -- , isSuffixOf
565+ -- , isSuffixOfUnbox
422 , isSubsequenceOf
566 , isSubsequenceOf
423
567
424 -- trimming sequences
568 -- trimming sequences
425− , stripPrefix
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
426
576
427 -- * Exceptions
577 -- * Exceptions
428− -- | Most of these combinators inhibit stream fusion, therefore, when
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
429 -- possible, they should be called in an outer loop to mitigate the cost.
588 -- possible, they should be called in an outer loop to mitigate the cost.
430 -- For example, instead of calling them on a stream of chars call them on a
589 -- For example, instead of calling them on a stream of chars call them on a
431 -- stream of arrays before flattening it to a stream of chars.
590 -- stream of arrays before flattening it to a stream of chars.
432 --
591 --
433− -- See also: "Streamly.Internal.Data.Stream.Exception" for
434− -- @Pre-release@ functions.
435−
436 , onException
592 , onException
437 , handle
593 , handle
438
594
439 -- * Resource Management
595 -- * Resource Management
440 -- | 'bracket' is the most general resource management operation, all other
596 -- | 'bracket' is the most general resource management operation, all other
441− -- operations can be expressed using it.
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.
442 , before
612 , before
443 , afterIO
613 , afterIO
444 , finallyIO
614 , finallyIO
445 , bracketIO
615 , bracketIO
446− , bracket3IO
616+ , bracketIO3
447
617
448− -- * Lifting Inner Monad
618+ -- * Transforming Inner Monad
449− -- | See also: "Streamly.Internal.Data.Stream.Lift" for
450− -- @Pre-release@ functions.
451
619
620+ , morphInner
452 , liftInner
621 , liftInner
453 , runReaderT
622 , runReaderT
454 , runStateT
623 , runStateT
455
624
456− -- -- * Stream Types
625+ -- XXX Arrays could be different types, therefore, this should be in
457− -- $serial
626+ -- specific array module. Or maybe we should abstract over array types.
458− -- , Interleave
627+ -- * Stream of Arrays
459− -- , Zip
628+ , Array.chunksOf
460 )
629 )
461where
630where
462
631
463import Streamly.Internal.Data.Stream
632import Streamly.Internal.Data.Stream
464import Prelude
633import Prelude
465 hiding (filter, drop, dropWhile, take, takeWhile, zipWith, foldr,
634 hiding (filter, drop, dropWhile, take, takeWhile, zipWith, foldr,
466− foldl, map, mapM, mapM_, sequence, all, any, sum, product, elem,
635+ mapM, sequence, reverse, iterate, foldr1, repeat, replicate,
467− notElem, maximum, minimum, head, last, tail, length, null,
636+ concatMap)
468− reverse, iterate, init, and, or, lookup, foldr1, (!!),
637+
469− scanl, scanl1, repeat, replicate, concatMap, span)
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/Stream/Zip.hsdeleted−16
@@ -1,16 +0,0 @@
1−-- |
2−-- Module : Streamly.Data.Stream.Zip
3−-- Copyright : (c) 2017 Composewell Technologies
4−--
5−-- License : BSD3
6−-- Maintainer : streamly@composewell.com
7−-- Stability : released
8−-- Portability : GHC
9−--
10−module Streamly.Data.Stream.Zip
11− (
12− ZipStream (..)
13− )
14−where
15−
16−import Streamly.Internal.Data.Stream.Zip
core/src/Streamly/Data/StreamK.hsnew file+194
@@ -0,0 +1,194 @@
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/Data/Unfold.hs+98−80
@@ -1,4 +1,4 @@
1−#include "inline.hs"
1+{-# LANGUAGE CPP #-}
2
2
3-- |
3-- |
4-- Module : Streamly.Data.Unfold
4-- Module : Streamly.Data.Unfold
@@ -8,13 +8,104 @@
8-- Stability : released
8-- Stability : released
9-- Portability : GHC
9-- Portability : GHC
10--
10--
11+-- Fast, composable stream producers with ability to terminate, supporting
12+-- nested stream fusion. Nested stream operations like
13+-- 'Streamly.Data.Stream.concatMap' in the "Streamly.Data.Stream" module do not
14+-- fuse, however, the 'Streamly.Data.Stream.unfoldMany' operation, using the
15+-- 'Unfold' type, is a fully fusible alternative to
16+-- 'Streamly.Data.Stream.concatMap'.
17+--
18+-- Please refer to "Streamly.Internal.Data.Unfold" for more functions that have
19+-- not yet been released.
20+--
21+-- Exception combinators are not exposed, we would like to encourage the use of
22+-- 'Stream' type instead whenever exception handling is required. We can
23+-- consider exposing the unfold exception functions if there is a compelling
24+-- use case to use unfolds instead of stream.
25+
26+module Streamly.Data.Unfold
27+ (
28+ -- * Setup
29+ -- | To execute the code examples provided in this module in ghci, please
30+ -- run the following commands first.
31+ --
32+ -- $setup
33+
34+ -- * Overview
35+ -- $overview
36+
37+ -- * Unfold Type
38+ Unfold
39+
40+ -- * Unfolds
41+ -- One to one correspondence with
42+ -- "Streamly.Internal.Data.Stream.Generate"
43+
44+ -- ** Basic Constructors
45+ , unfoldrM
46+ , unfoldr
47+ , function
48+ , functionM
49+
50+ -- ** Generators
51+ -- | Generate a monadic stream from a seed.
52+ , repeatM
53+ , replicateM
54+ , iterateM
55+
56+ -- ** Enumeration
57+ , Enumerable (..)
58+
59+ -- ** From Containers
60+ , fromList
61+ , fromListM
62+ , fromStream
63+
64+ -- * Combinators
65+ -- ** Mapping on Input
66+ , lmap
67+ , lmapM
68+ , first
69+ , second
70+
71+ -- ** Mapping on Output
72+ , mapM
73+
74+ -- ** Filtering
75+ , takeWhileM
76+ , takeWhile
77+ , take
78+ , filter
79+ , filterM
80+ , drop
81+ , dropWhile
82+ , dropWhileM
83+
84+ -- ** Zipping
85+ , zipWith
86+
87+ -- ** Cross Product
88+ , crossWith
89+
90+ -- ** Nesting
91+ , many
92+
93+ )
94+where
95+
96+import Prelude hiding
97+ ( concat, map, mapM, takeWhile, take, filter, const, drop, dropWhile
98+ , zipWith
99+ )
100+import Streamly.Internal.Data.Unfold
101+
102+#include "DocTestDataUnfold.hs"
103+
104+-- $overview
105+--
11-- An 'Unfold' is a source or a producer of a stream of values. It takes a
106-- An 'Unfold' is a source or a producer of a stream of values. It takes a
12-- seed value as an input and unfolds it into a sequence of values.
107-- seed value as an input and unfolds it into a sequence of values.
13--
108--
14−-- >>> import qualified Streamly.Data.Fold as Fold
15−-- >>> import qualified Streamly.Data.Unfold as Unfold
16−-- >>> import qualified Streamly.Internal.Data.Stream as Stream
17−--
18-- For example, the 'fromList' Unfold generates a stream of values from a
109-- For example, the 'fromList' Unfold generates a stream of values from a
19-- supplied list. Unfolds can be converted to 'Streamly.Internal.Data.Stream'
110-- supplied list. Unfolds can be converted to 'Streamly.Internal.Data.Stream'
20-- using the 'Stream.unfold' operation.
111-- using the 'Stream.unfold' operation.
@@ -58,7 +149,7 @@
58-- Please see "Streamly.Internal.Data.Unfold" for additional @Pre-release@
149-- Please see "Streamly.Internal.Data.Unfold" for additional @Pre-release@
59-- functions.
150-- functions.
60--
151--
61−-- = Creating New Unfolds
152+-- == Creating New Unfolds
62--
153--
63-- There are many commonly used unfolds provided in this module. However, you
154-- There are many commonly used unfolds provided in this module. However, you
64-- can always create your own as well. An 'Unfold' is just a data
155-- can always create your own as well. An 'Unfold' is just a data
@@ -95,7 +186,7 @@
95-- >>> Data.List.unfoldr f [1,2,3]
186-- >>> Data.List.unfoldr f [1,2,3]
96-- [1,2,3]
187-- [1,2,3]
97--
188--
98−-- = Unfolds vs. Streams
189+-- == Unfolds vs. Streams
99--
190--
100-- The 'Unfold' abstraction for representing streams was introduced in Streamly
191-- The 'Unfold' abstraction for representing streams was introduced in Streamly
101-- to provide C like performance for nested looping of streams. 'Unfold' and
192-- to provide C like performance for nested looping of streams. 'Unfold' and
@@ -140,76 +231,3 @@
140-- streams are written, it is easy to adapt a stream to an unfold. If you are
231-- streams are written, it is easy to adapt a stream to an unfold. If you are
141-- writing an unfold you can convert it to stream for free using
232-- writing an unfold you can convert it to stream for free using
142-- 'Stream.unfold'.
233-- 'Stream.unfold'.
143−
144−-- What makes streams less efficient is also what makes them more conveient to
145−-- use and powerful. The stream data type (Stream m a) bundles the state along
146−-- with the stream generator function making it opaque, whereas an unfold
147−-- exposes the state (Unfold m s a) to the user. This allows the Unfold to be
148−-- unfolded (inlined) inside a nested loop without having to bundle the state
149−-- and the generator together, the stream state can be saved and passed
150−-- independent of the generator function. On the other hand in a stream type we
151−-- have to bundle the stream state and the generator function together to save
152−-- the stream. This makes it inefficient because it requires boxing and
153−-- constructor allocation. However, this makes streams more convenient as we do
154−-- not need to pass around the state/seed separately.
155−--
156−module Streamly.Data.Unfold
157− (
158− -- * Unfold Type
159− Unfold
160−
161− -- * Unfolds
162− -- One to one correspondence with
163− -- "Streamly.Internal.Data.Stream.Generate"
164−
165− -- ** Basic Constructors
166− , unfoldrM
167− , unfoldr
168− , function
169− , functionM
170−
171− -- ** Generators
172− -- | Generate a monadic stream from a seed.
173− , repeatM
174− , replicateM
175− , iterateM
176−
177− -- ** From Containers
178− , fromList
179− , fromListM
180− , fromStream
181−
182− -- * Combinators
183− -- ** Mapping on Input
184− , lmap
185− , lmapM
186−
187− -- ** Mapping on Output
188− , mapM
189−
190− -- ** Filtering
191− , takeWhileM
192− , takeWhile
193− , take
194− , filter
195− , filterM
196− , drop
197− , dropWhile
198− , dropWhileM
199−
200− -- ** Zipping
201− , zipWith
202−
203− -- ** Cross Product
204− , crossWith
205−
206− -- ** Nesting
207− , many
208− )
209−where
210−
211−import Prelude hiding
212− ( concat, map, mapM, takeWhile, take, filter, const, drop, dropWhile
213− , zipWith
214− )
215−import Streamly.Internal.Data.Unfold
core/src/Streamly/FileSystem/Dir.hsnew file+23
@@ -0,0 +1,23 @@
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.hsnew file+60
@@ -0,0 +1,60 @@
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)
core/src/Streamly/FileSystem/Handle.hs+17−31
@@ -1,4 +1,4 @@
1−#include "inline.hs"
1+{-# LANGUAGE CPP #-}
2
2
3-- |
3-- |
4-- Module : Streamly.FileSystem.Handle
4-- Module : Streamly.FileSystem.Handle
@@ -15,8 +15,8 @@
15-- ('Handle').
15-- ('Handle').
16--
16--
17-- The 'TextEncoding', 'NewLineMode', and 'Buffering' options of the underlying
17-- The 'TextEncoding', 'NewLineMode', and 'Buffering' options of the underlying
18−-- GHC 'Handle' are ignored by these APIs. Please use @Streamly.Unicode.*@
18+-- GHC 'Handle' are ignored by these APIs. Please use "Streamly.Unicode.Stream"
19−-- modules for encoding and decoding a byte stream, use stream splitting
19+-- module for encoding and decoding a byte stream, use stream splitting
20-- operations in "Streamly.Data.Stream" to create a stream of lines or to split
20-- operations in "Streamly.Data.Stream" to create a stream of lines or to split
21-- the input stream on any other type of boundaries.
21-- the input stream on any other type of boundaries.
22--
22--
@@ -40,6 +40,12 @@
40--
40--
41module Streamly.FileSystem.Handle
41module Streamly.FileSystem.Handle
42 (
42 (
43+ -- * Setup
44+ -- | To execute the code examples provided in this module in ghci, please
45+ -- run the following commands first.
46+ --
47+ -- $setup
48+
43 -- * Singleton IO
49 -- * Singleton IO
44 -- | Read or write a single buffer.
50 -- | Read or write a single buffer.
45 getChunk
51 getChunk
@@ -75,13 +81,13 @@ module Streamly.FileSystem.Handle
75 -- position of the file handle. The stream ends as soon as EOF is
81 -- position of the file handle. The stream ends as soon as EOF is
76 -- encountered.
82 -- encountered.
77
83
78− -- -- *** Streams
84+ -- *** Streams
79− -- , read
85+ , read
80− -- , readWith
86+ , readWith
81− -- , readChunks
87+ , readChunks
82− -- , readChunksWith
88+ , readChunksWith
83
89
84− -- -- *** Unfolds
90+ -- *** Unfolds
85 , reader
91 , reader
86 , readerWith
92 , readerWith
87 , chunkReader
93 , chunkReader
@@ -98,34 +104,14 @@ module Streamly.FileSystem.Handle
98 , writeChunks
104 , writeChunks
99
105
100 -- * Deprecated
106 -- * Deprecated
101− , read
102 , readWithBufferOf
107 , readWithBufferOf
103− , readChunks
104 , readChunksWithBufferOf
108 , readChunksWithBufferOf
105 , writeChunksWithBufferOf
109 , writeChunksWithBufferOf
106 , writeWithBufferOf
110 , writeWithBufferOf
107 )
111 )
108where
112where
109
113
110−import Control.Monad.IO.Class (MonadIO(..))
114+import Streamly.Internal.FileSystem.Handle
111−import Data.Word (Word8)
112−import Streamly.Internal.Data.Array.Type (Array)
113−import Streamly.Internal.Data.Unfold.Type (Unfold)
114−import System.IO (Handle)
115−
116−import Streamly.Internal.FileSystem.Handle hiding (read, readChunks)
117import Prelude hiding (read)
115import Prelude hiding (read)
118
116
119−-- | Same as 'reader'
117+#include "DocTestFileSystemHandle.hs"
120−--
121−{-# DEPRECATED read "Please use 'reader' instead" #-}
122−{-# INLINE read #-}
123−read :: MonadIO m => Unfold m Handle Word8
124−read = reader
125−
126−-- | Same as 'chunkReader'
127−--
128−{-# DEPRECATED readChunks "Please use 'chunkReader' instead" #-}
129−{-# INLINE readChunks #-}
130−readChunks :: MonadIO m => Unfold m Handle (Array Word8)
131−readChunks = chunkReader
core/src/Streamly/Internal/Console/Stdio.hs+3−2
@@ -52,7 +52,8 @@ import Streamly.Internal.Data.Unfold (Unfold)
52import Streamly.Internal.Data.Fold (Fold)
52import Streamly.Internal.Data.Fold (Fold)
53
53
54import qualified Streamly.Internal.Data.Array as Array
54import qualified Streamly.Internal.Data.Array as Array
55−import qualified Streamly.Internal.Data.Stream as Stream (intersperseSuffix)
55+import qualified Streamly.Internal.Data.Stream as Stream
56+ (intersperseMSuffix)
56import qualified Streamly.Internal.Data.Unfold as Unfold
57import qualified Streamly.Internal.Data.Unfold as Unfold
57import qualified Streamly.Internal.FileSystem.Handle as Handle
58import qualified Streamly.Internal.FileSystem.Handle as Handle
58import qualified Streamly.Internal.Unicode.Stream as Unicode
59import qualified Streamly.Internal.Unicode.Stream as Unicode
@@ -223,5 +224,5 @@ putStrings = putStringsWith Unicode.encodeUtf8
223putStringsLn :: MonadIO m => Stream m String -> m ()
224putStringsLn :: MonadIO m => Stream m String -> m ()
224putStringsLn =
225putStringsLn =
225 putChunks
226 putChunks
226− . Stream.intersperseSuffix (return $ Array.fromList [10])
227+ . Stream.intersperseMSuffix (return $ Array.fromList [10])
227 . Unicode.encodeStrings Unicode.encodeUtf8
228 . Unicode.encodeStrings Unicode.encodeUtf8
core/src/Streamly/Internal/Data/Array.hs+650−194
@@ -1,88 +1,48 @@
1+{-# LANGUAGE CPP #-}
1-- |
2-- |
2-- Module : Streamly.Internal.Data.Array
3-- Module : Streamly.Internal.Data.Array
3-- Copyright : (c) 2019 Composewell Technologies
4-- Copyright : (c) 2019 Composewell Technologies
4−--
5-- License : BSD3
5-- License : BSD3
6-- Maintainer : streamly@composewell.com
6-- Maintainer : streamly@composewell.com
7-- Stability : experimental
7-- Stability : experimental
8-- Portability : GHC
8-- Portability : GHC
9--
9--
10−-- To summarize:
11−--
12−-- * Arrays are finite and fixed in size
13−-- * provide /O(1)/ access to elements
14−-- * store only data and not functions
15−-- * provide efficient IO interfacing
16−--
17−-- 'Foldable' instance is not provided because the implementation would be much
18−-- less efficient compared to folding via streams. 'Semigroup' and 'Monoid'
19−-- instances should be used with care; concatenating arrays using binary
20−-- operations can be highly inefficient. Instead, use
21−-- 'Streamly.Internal.Data.Array.Stream.toArray' to concatenate N
22−-- arrays at once.
23−--
24−-- Each array is one pointer visible to the GC. Too many small arrays (e.g.
25−-- single byte) are only as good as holding those elements in a Haskell list.
26−-- However, small arrays can be compacted into large ones to reduce the
27−-- overhead. To hold 32GB memory in 32k sized buffers we need 1 million arrays
28−-- if we use one array for each chunk. This is still significant to add
29−-- pressure to GC.
30−
31module Streamly.Internal.Data.Array
10module Streamly.Internal.Data.Array
32 (
11 (
33− Array
12+ -- * Setup
13+ -- $setup
34
14
35− -- * Construction
15+ -- * Design Notes
16+ -- $design
36
17
37− -- Pure List APIs
18+ -- * The Array Type
38− , A.fromListN
19+ module Streamly.Internal.Data.Array.Type
39− , A.fromList
40−
41− -- Stream Folds
42− , fromStreamN
43− , fromStream
44
20
21+ -- * Construction
45 -- Monadic Folds
22 -- Monadic Folds
46− , A.writeN -- drop new
47− , A.writeNAligned
48− , A.write -- full buffer
49 , writeLastN
23 , writeLastN
50
24
51− -- * Elimination
52− -- ** Conversion
53− , A.toList
54−
55− -- ** Streams
56− , A.read
57− , A.readRev
58−
59− -- ** Unfolds
60− , reader
61− , readerUnsafe
62− , A.readerRev
63− , producer -- experimental
64−
65 -- * Random Access
25 -- * Random Access
66 -- , (!!)
26 -- , (!!)
67 , getIndex
27 , getIndex
68− , A.unsafeIndex -- XXX Rename to getIndexUnsafe??
69 , getIndexRev
28 , getIndexRev
70− , last -- XXX getIndexLast?
29+ , last -- XXX getLastIndex?
71− , getIndices
72− , getIndicesFromThenTo
73 -- , getIndicesFrom -- read from a given position to the end of file
30 -- , getIndicesFrom -- read from a given position to the end of file
74 -- , getIndicesUpto -- read from beginning up to the given position
31 -- , getIndicesUpto -- read from beginning up to the given position
75 -- , getIndicesFromTo
32 -- , getIndicesFromTo
76 -- , getIndicesFromRev -- read from a given position to the beginning of file
33 -- , getIndicesFromRev -- read from a given position to the beginning of file
77 -- , getIndicesUptoRev -- read from end to the given position in file
34 -- , getIndicesUptoRev -- read from end to the given position in file
35+ , indexReader
36+ , indexReaderFromThenTo
78
37
79 -- * Size
38 -- * Size
80− , length
81 , null
39 , null
82
40
83 -- * Search
41 -- * Search
84 , binarySearch
42 , binarySearch
85 , findIndicesOf
43 , findIndicesOf
44+ -- getIndicesOf
45+ , indexFinder -- see splitOn
86 -- , findIndexOf
46 -- , findIndexOf
87 -- , find
47 -- , find
88
48
@@ -90,156 +50,134 @@ module Streamly.Internal.Data.Array
90 , cast
50 , cast
91 , asBytes
51 , asBytes
92 , castUnsafe
52 , castUnsafe
93− , asPtrUnsafe
94 , asCStringUnsafe
53 , asCStringUnsafe
95− , A.unsafeFreeze -- asImmutableUnsafe?
96− , A.unsafeThaw -- asMutableUnsafe?
97
54
98 -- * Subarrays
55 -- * Subarrays
99 , getSliceUnsafe
56 , getSliceUnsafe
100 -- , getSlice
57 -- , getSlice
101− , genSlicesFromLen
58+ , sliceIndexerFromLen
102− , getSlicesFromLen
59+ , slicerFromLen
103 , splitOn
60 , splitOn
104
61
105 -- * Streaming Operations
62 -- * Streaming Operations
106 , streamTransform
63 , streamTransform
107
64
108− -- ** Folding
65+ -- * Folding
109 , streamFold
66 , streamFold
110 , fold
67 , fold
111
68
69+ -- * Stream of Arrays
70+
71+ -- XXX these are probably not very useful to have in this module as we can
72+ -- express these idiomatically using streams.
73+ , interpose
74+ , interposeSuffix
75+ , intercalateSuffix
76+
77+ , compactLE
78+ , pinnedCompactLE
79+ , compactOnByte
80+ , compactOnByteSuffix
81+
82+ , foldBreakChunks
83+ , foldChunks
84+ , foldBreakChunksK
85+ , parseBreakChunksK
86+
87+ -- * Serialization
88+ , encodeAs
89+ , serialize
90+ , pinnedSerialize
91+ , deserialize
92+
112 -- * Deprecated
93 -- * Deprecated
113− , A.toStream
94+ , genSlicesFromLen
114− , A.toStreamRev
95+ , getSlicesFromLen
96+ , getIndices
115 )
97 )
116where
98where
117
99
100+#include "assert.hs"
118#include "inline.hs"
101#include "inline.hs"
119#include "ArrayMacros.h"
102#include "ArrayMacros.h"
120
103
121−import Control.Exception (assert)
122−import Control.Monad (when)
123import Control.Monad.IO.Class (MonadIO(..))
104import Control.Monad.IO.Class (MonadIO(..))
105+-- import Data.Bifunctor (first)
106+-- import Data.Either (fromRight)
124import Data.Functor.Identity (Identity)
107import Data.Functor.Identity (Identity)
108+import Data.Proxy (Proxy(..))
125import Data.Word (Word8)
109import Data.Word (Word8)
126import Foreign.C.String (CString)
110import Foreign.C.String (CString)
127import Foreign.Ptr (castPtr)
111import Foreign.Ptr (castPtr)
128−import Streamly.Internal.Data.Unboxed
112+import Foreign.Storable (Storable)
129− ( Unbox
113+import GHC.Types (SPEC(..))
130− , castContents
114+import Streamly.Internal.Data.Unbox (Unbox(..))
131− , peekWith
132− , sizeOf
133− )
134import Prelude hiding (length, null, last, map, (!!), read, concat)
115import Prelude hiding (length, null, last, map, (!!), read, concat)
135
116
136−import Streamly.Internal.Data.Array.Mut.Type (ArrayUnsafe(..))
117+import Streamly.Internal.Data.MutByteArray.Type (PinnedState(..), MutByteArray)
137−import Streamly.Internal.Data.Array.Type
118+import Streamly.Internal.Data.Serialize.Type (Serialize)
138− (Array(..), length, asPtrUnsafe)
139import Streamly.Internal.Data.Fold.Type (Fold(..))
119import Streamly.Internal.Data.Fold.Type (Fold(..))
140−import Streamly.Internal.Data.Producer.Type (Producer(..))
120+import Streamly.Internal.Data.Parser (Parser(..), Initial(..), ParseError(..))
141−import Streamly.Internal.Data.Stream (Stream)
121+import Streamly.Internal.Data.Stream (Stream(..))
142−import Streamly.Internal.Data.Tuple.Strict (Tuple3Fused'(..))
122+import Streamly.Internal.Data.StreamK (StreamK)
123+import Streamly.Internal.Data.SVar.Type (adaptState, defState)
124+import Streamly.Internal.Data.Tuple.Strict (Tuple'(..), Tuple3Fused'(..))
143import Streamly.Internal.Data.Unfold.Type (Unfold(..))
125import Streamly.Internal.Data.Unfold.Type (Unfold(..))
144import Streamly.Internal.System.IO (unsafeInlineIO)
126import Streamly.Internal.System.IO (unsafeInlineIO)
145
127
146−import qualified Streamly.Internal.Data.Array.Mut.Type as MA
128+import qualified Streamly.Internal.Data.Fold.Type as Fold
147−import qualified Streamly.Internal.Data.Array.Mut as MA
129+import qualified Streamly.Internal.Data.Serialize.Type as Serialize
148−import qualified Streamly.Internal.Data.Array.Type as A
130+import qualified Streamly.Internal.Data.MutByteArray.Type as MBA
131+import qualified Streamly.Internal.Data.MutArray as MA
149import qualified Streamly.Internal.Data.Fold as FL
132import qualified Streamly.Internal.Data.Fold as FL
150−import qualified Streamly.Internal.Data.Producer.Type as Producer
133+import qualified Streamly.Internal.Data.Ring as RB
151−import qualified Streamly.Internal.Data.Producer as Producer
134+import qualified Streamly.Internal.Data.Parser as Parser
152−import qualified Streamly.Internal.Data.Ring.Unboxed as RB
135+-- import qualified Streamly.Internal.Data.ParserK as ParserK
153−import qualified Streamly.Internal.Data.Stream.Common as P
136+import qualified Streamly.Internal.Data.Stream as D
154−import qualified Streamly.Internal.Data.Stream.StreamD as D
137+import qualified Streamly.Internal.Data.Stream as Stream
155−import qualified Streamly.Internal.Data.Stream.Type as Stream
138+import qualified Streamly.Internal.Data.StreamK as StreamK
156import qualified Streamly.Internal.Data.Unfold as Unfold
139import qualified Streamly.Internal.Data.Unfold as Unfold
140+import qualified Prelude
157
141
158−-------------------------------------------------------------------------------
142+import Streamly.Internal.Data.Array.Type
159−-- Construction
160−-------------------------------------------------------------------------------
161
143
162−-- | Create an 'Array' from the first N elements of a stream. The array is
144+#include "DocTestDataArray.hs"
163−-- allocated to size N, if the stream terminates before N elements then the
164−-- array may hold less than N elements.
165−--
166−-- /Pre-release/
167−{-# INLINE fromStreamN #-}
168−fromStreamN :: (MonadIO m, Unbox a) => Int -> Stream m a -> m (Array a)
169−fromStreamN n m = do
170− when (n < 0) $ error "writeN: negative write count specified"
171− A.fromStreamDN n $ Stream.toStreamD m
172
145
173−-- | Create an 'Array' from a stream. This is useful when we want to create a
146+-- $design
174−-- single array from a stream of unknown size. 'writeN' is at least twice
175−-- as efficient when the size is already known.
176--
147--
177−-- Note that if the input stream is too large memory allocation for the array
148+-- To summarize:
178−-- may fail. When the stream size is not known, `arraysOf` followed by
179−-- processing of indvidual arrays in the resulting stream should be preferred.
180--
149--
181−-- /Pre-release/
150+-- * Arrays are finite and fixed in size
182−{-# INLINE fromStream #-}
151+-- * provide /O(1)/ access to elements
183−fromStream :: (MonadIO m, Unbox a) => Stream m a -> m (Array a)
152+-- * store only data and not functions
184−fromStream m = P.fold A.write $ Stream.toStreamK m
153+-- * provide efficient IO interfacing
185−-- write m = A.fromStreamD $ D.fromStreamK m
154+--
155+-- 'Foldable' instance is not provided because the implementation would be much
156+-- less efficient compared to folding via streams. 'Semigroup' and 'Monoid'
157+-- instances should be used with care; concatenating arrays using binary
158+-- operations can be highly inefficient. Instead, use
159+-- 'Streamly.Internal.Data.Stream.Chunked.toArray' to concatenate N
160+-- arrays at once.
161+--
162+-- Each array is one pointer visible to the GC. Too many small arrays (e.g.
163+-- single byte) are only as good as holding those elements in a Haskell list.
164+-- However, small arrays can be compacted into large ones to reduce the
165+-- overhead. To hold 32GB memory in 32k sized buffers we need 1 million arrays
166+-- if we use one array for each chunk. This is still significant to add
167+-- pressure to GC.
186
168
187-------------------------------------------------------------------------------
169-------------------------------------------------------------------------------
188-- Elimination
170-- Elimination
189-------------------------------------------------------------------------------
171-------------------------------------------------------------------------------
190
172
191−{-# INLINE_NORMAL producer #-}
192−producer :: forall m a. (Monad m, Unbox a) => Producer m (Array a) a
193−producer =
194− Producer.translate A.unsafeThaw A.unsafeFreeze
195− $ MA.producerWith (return . unsafeInlineIO)
196−
197−-- | Unfold an array into a stream.
198−--
199−{-# INLINE_NORMAL reader #-}
200−reader :: forall m a. (Monad m, Unbox a) => Unfold m (Array a) a
201−reader = Producer.simplify producer
202−
203−-- | Unfold an array into a stream, does not check the end of the array, the
204−-- user is responsible for terminating the stream within the array bounds. For
205−-- high performance application where the end condition can be determined by
206−-- a terminating fold.
207−--
208−-- Written in the hope that it may be faster than "read", however, in the case
209−-- for which this was written, "read" proves to be faster even though the core
210−-- generated with unsafeRead looks simpler.
211−--
212−-- /Pre-release/
213−--
214−{-# INLINE_NORMAL readerUnsafe #-}
215−readerUnsafe :: forall m a. (Monad m, Unbox a) => Unfold m (Array a) a
216−readerUnsafe = Unfold step inject
217− where
218−
219− inject (Array contents start end) =
220− return (ArrayUnsafe contents end start)
221−
222− {-# INLINE_LATE step #-}
223− step (ArrayUnsafe contents end p) = do
224− -- unsafeInlineIO allows us to run this in Identity monad for pure
225− -- toList/foldr case which makes them much faster due to not
226− -- accumulating the list and fusing better with the pure consumers.
227− --
228− -- This should be safe as the array contents are guaranteed to be
229− -- evaluated/written to before we peek at them.
230− let !x = unsafeInlineIO $ peekWith contents p
231− let !p1 = INDEX_NEXT(p,a)
232− return $ D.Yield x (ArrayUnsafe contents end p1)
233−
234-- |
173-- |
235--
174--
236−-- >>> import qualified Streamly.Internal.Data.Array.Type as Array
237-- >>> null arr = Array.byteLength arr == 0
175-- >>> null arr = Array.byteLength arr == 0
238--
176--
239-- /Pre-release/
177-- /Pre-release/
240{-# INLINE null #-}
178{-# INLINE null #-}
241null :: Array a -> Bool
179null :: Array a -> Bool
242−null arr = A.byteLength arr == 0
180+null arr = byteLength arr == 0
243
181
244-- | Like 'getIndex' but indexes the array in reverse from the end.
182-- | Like 'getIndex' but indexes the array in reverse from the end.
245--
183--
@@ -251,12 +189,11 @@ getIndexRev i arr =
251 $ do
189 $ do
252 let elemPtr = RINDEX_OF(arrEnd arr, i, a)
190 let elemPtr = RINDEX_OF(arrEnd arr, i, a)
253 if i >= 0 && elemPtr >= arrStart arr
191 if i >= 0 && elemPtr >= arrStart arr
254− then Just <$> peekWith (arrContents arr) elemPtr
192+ then Just <$> peekAt elemPtr (arrContents arr)
255 else return Nothing
193 else return Nothing
256
194
257-- |
195-- |
258--
196--
259−-- >>> import qualified Streamly.Internal.Data.Array as Array
260-- >>> last arr = Array.getIndexRev arr 0
197-- >>> last arr = Array.getIndexRev arr 0
261--
198--
262-- /Pre-release/
199-- /Pre-release/
@@ -268,15 +205,17 @@ last = getIndexRev 0
268-- Folds with Array as the container
205-- Folds with Array as the container
269-------------------------------------------------------------------------------
206-------------------------------------------------------------------------------
270
207
208+-- XXX We should generate this from Ring.
209+
271-- | @writeLastN n@ folds a maximum of @n@ elements from the end of the input
210-- | @writeLastN n@ folds a maximum of @n@ elements from the end of the input
272-- stream to an 'Array'.
211-- stream to an 'Array'.
273--
212--
274{-# INLINE writeLastN #-}
213{-# INLINE writeLastN #-}
275writeLastN ::
214writeLastN ::
276− (Unbox a, MonadIO m) => Int -> Fold m a (Array a)
215+ (Storable a, Unbox a, MonadIO m) => Int -> Fold m a (Array a)
277writeLastN n
216writeLastN n
278 | n <= 0 = fmap (const mempty) FL.drain
217 | n <= 0 = fmap (const mempty) FL.drain
279− | otherwise = A.unsafeFreeze <$> Fold step initial done
218+ | otherwise = unsafeFreeze <$> Fold step initial done done
280
219
281 where
220 where
282
221
@@ -289,11 +228,9 @@ writeLastN n
289 in fmap f $ liftIO $ RB.new n
228 in fmap f $ liftIO $ RB.new n
290
229
291 done (Tuple3Fused' rb rh i) = do
230 done (Tuple3Fused' rb rh i) = do
292− arr <- liftIO $ MA.newPinned n
231+ arr <- MA.new n
293− foldFunc i rh snoc' arr rb
232+ -- XXX We should write a read unfold for ring.
294−
233+ foldFunc i rh MA.snocUnsafe arr rb
295− -- XXX We should write a read unfold for ring.
296− snoc' b a = liftIO $ MA.snocUnsafe b a
297
234
298 foldFunc i
235 foldFunc i
299 | i < n = RB.unsafeFoldRingM
236 | i < n = RB.unsafeFoldRingM
@@ -319,19 +256,26 @@ binarySearch = undefined
319-- compared to streams by using SIMD instructions.
256-- compared to streams by using SIMD instructions.
320-- We can also return a bit array instead.
257-- We can also return a bit array instead.
321
258
259+-- Can use SIMD.
260+
322-- | Perform a linear search to find all the indices where a given element is
261-- | Perform a linear search to find all the indices where a given element is
323-- present in an array.
262-- present in an array.
324--
263--
325-- /Unimplemented/
264-- /Unimplemented/
326−findIndicesOf :: (a -> Bool) -> Unfold Identity (Array a) Int
265+indexFinder :: (a -> Bool) -> Unfold Identity (Array a) Int
327−findIndicesOf = undefined
266+indexFinder = undefined
267+
268+-- |
269+-- /Unimplemented/
270+findIndicesOf :: (a -> Bool) -> Array a -> Stream Identity Int
271+findIndicesOf p = Stream.unfold (indexFinder p)
328
272
329{-
273{-
330findIndexOf :: (a -> Bool) -> Array a -> Maybe Int
274findIndexOf :: (a -> Bool) -> Array a -> Maybe Int
331−findIndexOf p = Unfold.fold Fold.one . Stream.unfold (findIndicesOf p)
275+findIndexOf p = Unfold.fold Fold.one . Stream.unfold (indexFinder p)
332
276
333find :: (a -> Bool) -> Array a -> Bool
277find :: (a -> Bool) -> Array a -> Bool
334−find = Unfold.fold Fold.null . Stream.unfold (findIndicesOf p)
278+find = Unfold.fold Fold.null . Stream.unfold (indexFinder p)
335-}
279-}
336
280
337-------------------------------------------------------------------------------
281-------------------------------------------------------------------------------
@@ -372,31 +316,46 @@ getSliceUnsafe index len (Array contents start e) =
372splitOn :: (Monad m, Unbox a) =>
316splitOn :: (Monad m, Unbox a) =>
373 (a -> Bool) -> Array a -> Stream m (Array a)
317 (a -> Bool) -> Array a -> Stream m (Array a)
374splitOn predicate arr =
318splitOn predicate arr =
375− Stream.fromStreamD
319+ fmap (\(i, len) -> getSliceUnsafe i len arr)
376− $ fmap (\(i, len) -> getSliceUnsafe i len arr)
320+ $ D.indexOnSuffix predicate (read arr)
377− $ D.sliceOnSuffix predicate (A.toStreamD arr)
321+
322+{-# INLINE sliceIndexerFromLen #-}
323+sliceIndexerFromLen :: forall m a. (Monad m, Unbox a)
324+ => Int -- ^ from index
325+ -> Int -- ^ length of the slice
326+ -> Unfold m (Array a) (Int, Int)
327+sliceIndexerFromLen from len =
328+ Unfold.lmap unsafeThaw (MA.sliceIndexerFromLen from len)
378
329
330+{-# DEPRECATED genSlicesFromLen "Please use sliceIndexerFromLen instead." #-}
379{-# INLINE genSlicesFromLen #-}
331{-# INLINE genSlicesFromLen #-}
380genSlicesFromLen :: forall m a. (Monad m, Unbox a)
332genSlicesFromLen :: forall m a. (Monad m, Unbox a)
381 => Int -- ^ from index
333 => Int -- ^ from index
382 -> Int -- ^ length of the slice
334 -> Int -- ^ length of the slice
383 -> Unfold m (Array a) (Int, Int)
335 -> Unfold m (Array a) (Int, Int)
384−genSlicesFromLen from len =
336+genSlicesFromLen = sliceIndexerFromLen
385− Unfold.lmap A.unsafeThaw (MA.genSlicesFromLen from len)
386
337
387-- | Generate a stream of slices of specified length from an array, starting
338-- | Generate a stream of slices of specified length from an array, starting
388-- from the supplied array index. The last slice may be shorter than the
339-- from the supplied array index. The last slice may be shorter than the
389-- requested length.
340-- requested length.
390--
341--
391-- /Pre-release//
342-- /Pre-release//
343+{-# INLINE slicerFromLen #-}
344+slicerFromLen :: forall m a. (Monad m, Unbox a)
345+ => Int -- ^ from index
346+ -> Int -- ^ length of the slice
347+ -> Unfold m (Array a) (Array a)
348+slicerFromLen from len =
349+ fmap unsafeFreeze
350+ $ Unfold.lmap unsafeThaw (MA.slicerFromLen from len)
351+
352+{-# DEPRECATED getSlicesFromLen "Please use slicerFromLen instead." #-}
392{-# INLINE getSlicesFromLen #-}
353{-# INLINE getSlicesFromLen #-}
393getSlicesFromLen :: forall m a. (Monad m, Unbox a)
354getSlicesFromLen :: forall m a. (Monad m, Unbox a)
394 => Int -- ^ from index
355 => Int -- ^ from index
395 -> Int -- ^ length of the slice
356 -> Int -- ^ length of the slice
396 -> Unfold m (Array a) (Array a)
357 -> Unfold m (Array a) (Array a)
397−getSlicesFromLen from len =
358+getSlicesFromLen = slicerFromLen
398− fmap A.unsafeFreeze
399− $ Unfold.lmap A.unsafeThaw (MA.getSlicesFromLen from len)
400
359
401-------------------------------------------------------------------------------
360-------------------------------------------------------------------------------
402-- Random reads and writes
361-- Random reads and writes
@@ -414,7 +373,7 @@ getIndex i arr =
414 $ do
373 $ do
415 let elemPtr = INDEX_OF(arrStart arr, i, a)
374 let elemPtr = INDEX_OF(arrStart arr, i, a)
416 if i >= 0 && INDEX_VALID(elemPtr, arrEnd arr, a)
375 if i >= 0 && INDEX_VALID(elemPtr, arrEnd arr, a)
417− then Just <$> peekWith (arrContents arr) elemPtr
376+ then Just <$> peekAt elemPtr (arrContents arr)
418 else return Nothing
377 else return Nothing
419
378
420-- | Given a stream of array indices, read the elements on those indices from
379-- | Given a stream of array indices, read the elements on those indices from
@@ -426,19 +385,25 @@ getIndex i arr =
426-- @
385-- @
427-- read =
386-- read =
428-- let u = lmap (\arr -> (0, length arr - 1)) Unfold.enumerateFromTo
387-- let u = lmap (\arr -> (0, length arr - 1)) Unfold.enumerateFromTo
429−-- in Unfold.lmap f (getIndices arr)
388+-- in Unfold.lmap f (indexReader arr)
430--
389--
431-- readRev =
390-- readRev =
432-- let i = length arr - 1
391-- let i = length arr - 1
433−-- in Unfold.lmap f (getIndicesFromThenTo i (i - 1) 0)
392+-- in Unfold.lmap f (indexReaderFromThenTo i (i - 1) 0)
434-- @
393-- @
435--
394--
436-- /Pre-release/
395-- /Pre-release/
396+{-# INLINE indexReader #-}
397+indexReader :: (Monad m, Unbox a) => Stream m Int -> Unfold m (Array a) a
398+indexReader m =
399+ let unf = MA.indexReaderWith (return . unsafeInlineIO) m
400+ in Unfold.lmap unsafeThaw unf
401+
402+-- XXX DO NOT REMOVE, change the signature to use Stream instead of unfold
403+{-# DEPRECATED getIndices "Please use getIndices instead." #-}
437{-# INLINE getIndices #-}
404{-# INLINE getIndices #-}
438getIndices :: (Monad m, Unbox a) => Stream m Int -> Unfold m (Array a) a
405getIndices :: (Monad m, Unbox a) => Stream m Int -> Unfold m (Array a) a
439−getIndices m =
406+getIndices = indexReader
440− let unf = MA.getIndicesD (return . unsafeInlineIO) $ D.fromStreamK $ Stream.toStreamK m
441− in Unfold.lmap A.unsafeThaw unf
442
407
443-- | Unfolds @(from, then, to, array)@ generating a finite stream whose first
408-- | Unfolds @(from, then, to, array)@ generating a finite stream whose first
444-- element is the array value from the index @from@ and the successive elements
409-- element is the array value from the index @from@ and the successive elements
@@ -454,9 +419,9 @@ getIndices m =
454-- @
419-- @
455--
420--
456-- /Unimplemented/
421-- /Unimplemented/
457−{-# INLINE getIndicesFromThenTo #-}
422+{-# INLINE indexReaderFromThenTo #-}
458−getIndicesFromThenTo :: Unfold m (Int, Int, Int, Array a) a
423+indexReaderFromThenTo :: Unfold m (Int, Int, Int, Array a) a
459−getIndicesFromThenTo = undefined
424+indexReaderFromThenTo = undefined
460
425
461-------------------------------------------------------------------------------
426-------------------------------------------------------------------------------
462-- Transform via stream operations
427-- Transform via stream operations
@@ -473,7 +438,7 @@ getIndicesFromThenTo = undefined
473{-# INLINE runPipe #-}
438{-# INLINE runPipe #-}
474runPipe :: (MonadIO m, Unbox a, Unbox b)
439runPipe :: (MonadIO m, Unbox a, Unbox b)
475 => Pipe m a b -> Array a -> m (Array b)
440 => Pipe m a b -> Array a -> m (Array b)
476−runPipe f arr = P.runPipe (toArrayMinChunk (length arr)) $ f (A.read arr)
441+runPipe f arr = P.runPipe (toArrayMinChunk (length arr)) $ f (read arr)
477-}
442-}
478
443
479-- XXX For transformations that cannot change the number of elements e.g. "map"
444-- XXX For transformations that cannot change the number of elements e.g. "map"
@@ -487,7 +452,7 @@ runPipe f arr = P.runPipe (toArrayMinChunk (length arr)) $ f (A.read arr)
487streamTransform :: forall m a b. (MonadIO m, Unbox a, Unbox b)
452streamTransform :: forall m a b. (MonadIO m, Unbox a, Unbox b)
488 => (Stream m a -> Stream m b) -> Array a -> m (Array b)
453 => (Stream m a -> Stream m b) -> Array a -> m (Array b)
489streamTransform f arr =
454streamTransform f arr =
490− P.fold (A.writeWith (length arr)) $ Stream.toStreamK $ f (A.read arr)
455+ Stream.fold (createWith (length arr)) $ f (read arr)
491
456
492-------------------------------------------------------------------------------
457-------------------------------------------------------------------------------
493-- Casts
458-- Casts
@@ -502,11 +467,11 @@ streamTransform f arr =
502--
467--
503castUnsafe ::
468castUnsafe ::
504#ifdef DEVBUILD
469#ifdef DEVBUILD
505− Unboxed b =>
470+ Unbox b =>
506#endif
471#endif
507 Array a -> Array b
472 Array a -> Array b
508castUnsafe (Array contents start end) =
473castUnsafe (Array contents start end) =
509− Array (castContents contents) start end
474+ Array contents start end
510
475
511-- | Cast an @Array a@ into an @Array Word8@.
476-- | Cast an @Array a@ into an @Array Word8@.
512--
477--
@@ -521,13 +486,15 @@ asBytes = castUnsafe
521--
486--
522cast :: forall a b. (Unbox b) => Array a -> Maybe (Array b)
487cast :: forall a b. (Unbox b) => Array a -> Maybe (Array b)
523cast arr =
488cast arr =
524− let len = A.byteLength arr
489+ let len = byteLength arr
525 r = len `mod` SIZE_OF(b)
490 r = len `mod` SIZE_OF(b)
526 in if r /= 0
491 in if r /= 0
527 then Nothing
492 then Nothing
528 else Just $ castUnsafe arr
493 else Just $ castUnsafe arr
529
494
530−-- | Convert an array of any type into a null terminated CString Ptr.
495+-- | Convert an array of any type into a null terminated CString Ptr. If the
496+-- array is unpinned it is first converted to a pinned array which requires a
497+-- copy.
531--
498--
532-- /Unsafe/
499-- /Unsafe/
533--
500--
@@ -537,9 +504,9 @@ cast arr =
537--
504--
538asCStringUnsafe :: Array a -> (CString -> IO b) -> IO b
505asCStringUnsafe :: Array a -> (CString -> IO b) -> IO b
539asCStringUnsafe arr act = do
506asCStringUnsafe arr act = do
540− -- XXX Ensure a pinned allocation here.
507+ let arr1 = asBytes arr <> fromList [0]
541− let arr1 = asBytes arr <> A.fromList [0]
508+ -- unsafePinnedAsPtr makes sure the array is pinned
542− asPtrUnsafe arr1 $ \ptr -> act (castPtr ptr)
509+ unsafePinnedAsPtr arr1 $ \ptr -> act (castPtr ptr)
543
510
544-------------------------------------------------------------------------------
511-------------------------------------------------------------------------------
545-- Folds
512-- Folds
@@ -552,11 +519,500 @@ asCStringUnsafe arr act = do
552-- /Pre-release/
519-- /Pre-release/
553{-# INLINE fold #-}
520{-# INLINE fold #-}
554fold :: forall m a b. (Monad m, Unbox a) => Fold m a b -> Array a -> m b
521fold :: forall m a b. (Monad m, Unbox a) => Fold m a b -> Array a -> m b
555−fold f arr = P.fold f (Stream.toStreamK (A.read arr))
522+fold f arr = Stream.fold f (read arr)
556
523
557-- | Fold an array using a stream fold operation.
524-- | Fold an array using a stream fold operation.
558--
525--
559-- /Pre-release/
526-- /Pre-release/
560{-# INLINE streamFold #-}
527{-# INLINE streamFold #-}
561streamFold :: (Monad m, Unbox a) => (Stream m a -> m b) -> Array a -> m b
528streamFold :: (Monad m, Unbox a) => (Stream m a -> m b) -> Array a -> m b
562−streamFold f arr = f (A.read arr)
529+streamFold f arr = f (read arr)
530+
531+--------------------------------------------------------------------------------
532+-- Serialization
533+--------------------------------------------------------------------------------
534+
535+{-# INLINE encodeAs #-}
536+encodeAs :: forall a. Serialize a => PinnedState -> a -> Array Word8
537+encodeAs ps a =
538+ unsafeInlineIO $ do
539+ let len = Serialize.addSizeTo 0 a
540+ mbarr <- MBA.newBytesAs ps len
541+ off <- Serialize.serializeAt 0 mbarr a
542+ assertM(len == off)
543+ pure $ Array mbarr 0 off
544+
545+-- |
546+-- Properties:
547+-- 1. Identity: @deserialize . serialize == id@
548+-- 2. Encoded equivalence: @serialize a == serialize a@
549+{-# INLINE serialize #-}
550+serialize :: Serialize a => a -> Array Word8
551+serialize = encodeAs Unpinned
552+
553+-- | Serialize a Haskell type to a pinned byte array. The array is allocated
554+-- using pinned memory so that it can be used directly in OS APIs for writing
555+-- to file or sending over the network.
556+--
557+-- Properties:
558+-- 1. Identity: @deserialize . pinnedSerialize == id@
559+-- 2. Encoded equivalence: @pinnedSerialize a == pinnedSerialize a@
560+{-# INLINE pinnedSerialize #-}
561+pinnedSerialize :: Serialize a => a -> Array Word8
562+pinnedSerialize = encodeAs Pinned
563+
564+-- | Decode a Haskell type from a byte array containing its serialized
565+-- representation.
566+{-# INLINE deserialize #-}
567+deserialize :: Serialize a => Array Word8 -> a
568+deserialize arr@(Array {..}) = unsafeInlineIO $ do
569+ let lenArr = length arr
570+ (off, val) <-
571+ Serialize.deserializeAt arrStart arrContents (arrStart + lenArr)
572+ assertM(off == arrStart + lenArr)
573+ pure val
574+
575+-------------------------------------------------------------------------------
576+-- Streams of Arrays
577+-------------------------------------------------------------------------------
578+
579+-- TODO: efficiently compare two streams of arrays. Two streams can have chunks
580+-- of different sizes, we can handle that in the stream comparison abstraction.
581+-- This could be useful e.g. to fast compare whether two files differ.
582+
583+-- | Insert the given element between arrays and flatten.
584+--
585+-- >>> interpose x = Stream.interpose x Array.reader
586+--
587+{-# INLINE interpose #-}
588+interpose :: (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
589+interpose x = D.interpose x reader
590+
591+data FlattenState s =
592+ OuterLoop s
593+ | InnerLoop s !MutByteArray !Int !Int
594+
595+-- | Insert the given element after each array and flatten. This is similar to
596+-- unlines.
597+--
598+-- >>> interposeSuffix x = Stream.interposeSuffix x Array.reader
599+--
600+{-# INLINE_NORMAL interposeSuffix #-}
601+interposeSuffix :: forall m a. (Monad m, Unbox a)
602+ => a -> Stream m (Array a) -> Stream m a
603+-- This does not require MonadIO constraint.
604+-- interposeSuffix x = D.interposeSuffix x reader
605+interposeSuffix sep (D.Stream step state) = D.Stream step' (OuterLoop state)
606+
607+ where
608+
609+ {-# INLINE_LATE step' #-}
610+ step' gst (OuterLoop st) = do
611+ r <- step (adaptState gst) st
612+ return $ case r of
613+ D.Yield Array{..} s ->
614+ D.Skip (InnerLoop s arrContents arrStart arrEnd)
615+ D.Skip s -> D.Skip (OuterLoop s)
616+ D.Stop -> D.Stop
617+
618+ step' _ (InnerLoop st _ p end) | p == end =
619+ return $ D.Yield sep $ OuterLoop st
620+
621+ step' _ (InnerLoop st contents p end) = do
622+ x <- pure $ unsafeInlineIO $ peekAt p contents
623+ return $ D.Yield x (InnerLoop st contents (INDEX_NEXT(p,a)) end)
624+
625+-- | Insert the given array after each array and flatten.
626+--
627+-- >>> intercalateSuffix = Stream.intercalateSuffix Array.reader
628+--
629+{-# INLINE intercalateSuffix #-}
630+intercalateSuffix :: (Monad m, Unbox a)
631+ => Array a -> Stream m (Array a) -> Stream m a
632+intercalateSuffix = D.intercalateSuffix reader
633+
634+-- | @compactLE n@ coalesces adjacent arrays in the input stream
635+-- only if the combined size would be less than or equal to n.
636+--
637+-- Generates unpinned arrays irrespective of the pinning status of input
638+-- arrays.
639+{-# INLINE_NORMAL compactLE #-}
640+compactLE :: (MonadIO m, Unbox a)
641+ => Int -> Stream m (Array a) -> Stream m (Array a)
642+compactLE n stream =
643+ D.map unsafeFreeze $ MA.compactLE n $ D.map unsafeThaw stream
644+
645+-- | Pinned version of 'compactLE'.
646+{-# INLINE_NORMAL pinnedCompactLE #-}
647+pinnedCompactLE :: (MonadIO m, Unbox a)
648+ => Int -> Stream m (Array a) -> Stream m (Array a)
649+pinnedCompactLE n stream =
650+ D.map unsafeFreeze $ MA.pinnedCompactLE n $ D.map unsafeThaw stream
651+
652+-- | Split a stream of arrays on a given separator byte, dropping the separator
653+-- and coalescing all the arrays between two separators into a single array.
654+--
655+{-# INLINE compactOnByte #-}
656+compactOnByte
657+ :: (MonadIO m)
658+ => Word8
659+ -> Stream m (Array Word8)
660+ -> Stream m (Array Word8)
661+compactOnByte byte =
662+ fmap unsafeFreeze . MA.compactOnByte byte . fmap unsafeThaw
663+
664+-- | Like 'compactOnByte' considers the separator in suffix position instead of
665+-- infix position.
666+{-# INLINE compactOnByteSuffix #-}
667+compactOnByteSuffix
668+ :: (MonadIO m)
669+ => Word8
670+ -> Stream m (Array Word8)
671+ -> Stream m (Array Word8)
672+compactOnByteSuffix byte =
673+ fmap unsafeFreeze . MA.compactOnByteSuffix byte . fmap unsafeThaw
674+
675+-------------------------------------------------------------------------------
676+-- Folding Streams of Arrays
677+-------------------------------------------------------------------------------
678+
679+-- XXX This should not be used for breaking a stream as the D.cons used in
680+-- reconstructing the stream could be very bad for performance. This can only
681+-- be useful in folding without breaking.
682+{-# INLINE_NORMAL foldBreakChunks #-}
683+foldBreakChunks :: forall m a b. (MonadIO m, Unbox a) =>
684+ Fold m a b -> Stream m (Array a) -> m (b, Stream m (Array a))
685+foldBreakChunks (Fold fstep initial _ final) stream@(Stream step state) = do
686+ res <- initial
687+ case res of
688+ Fold.Partial fs -> go SPEC state fs
689+ Fold.Done fb -> return $! (fb, stream)
690+
691+ where
692+
693+ {-# INLINE go #-}
694+ go !_ st !fs = do
695+ r <- step defState st
696+ case r of
697+ Stream.Yield (Array contents start end) s ->
698+ let fp = Tuple' end contents
699+ in goArray SPEC s fp start fs
700+ Stream.Skip s -> go SPEC s fs
701+ Stream.Stop -> do
702+ b <- final fs
703+ return (b, D.nil)
704+
705+ goArray !_ s (Tuple' end _) !cur !fs
706+ | cur == end = do
707+ go SPEC s fs
708+ goArray !_ st fp@(Tuple' end contents) !cur !fs = do
709+ x <- liftIO $ peekAt cur contents
710+ res <- fstep fs x
711+ let next = INDEX_NEXT(cur,a)
712+ case res of
713+ Fold.Done b -> do
714+ let arr = Array contents next end
715+ return $! (b, D.cons arr (D.Stream step st))
716+ Fold.Partial fs1 -> goArray SPEC st fp next fs1
717+
718+-- This may be more robust wrt fusion compared to unfoldMany?
719+
720+-- | Fold a stream of arrays using a 'Fold'. This is equivalent to the
721+-- following:
722+--
723+-- >>> foldChunks f = Stream.fold f . Stream.unfoldMany Array.reader
724+--
725+foldChunks :: (MonadIO m, Unbox a) => Fold m a b -> Stream m (Array a) -> m b
726+foldChunks f s = fmap fst (foldBreakChunks f s)
727+-- foldStream f = Stream.fold f . Stream.unfoldMany reader
728+
729+-- | Fold a stream of arrays using a 'Fold' and return the remaining stream.
730+--
731+-- The following alternative to this function allows composing the fold using
732+-- the parser Monad:
733+--
734+-- @
735+-- foldBreakStreamK f s =
736+-- fmap (first (fromRight undefined))
737+-- $ StreamK.parseBreakChunks (ParserK.adaptC (Parser.fromFold f)) s
738+-- @
739+--
740+-- We can compare perf and remove this one or define it in terms of that.
741+--
742+foldBreakChunksK :: forall m a b. (MonadIO m, Unbox a) =>
743+ Fold m a b -> StreamK m (Array a) -> m (b, StreamK m (Array a))
744+{-
745+foldBreakChunksK f s =
746+ fmap (first (fromRight undefined))
747+ $ StreamK.parseBreakChunks (ParserK.adaptC (Parser.fromFold f)) s
748+-}
749+foldBreakChunksK (Fold fstep initial _ final) stream = do
750+ res <- initial
751+ case res of
752+ Fold.Partial fs -> go fs stream
753+ Fold.Done fb -> return (fb, stream)
754+
755+ where
756+
757+ {-# INLINE go #-}
758+ go !fs st = do
759+ let stop = (, StreamK.nil) <$> final fs
760+ single a = yieldk a StreamK.nil
761+ yieldk (Array contents start end) r =
762+ let fp = Tuple' end contents
763+ in goArray fs r fp start
764+ in StreamK.foldStream defState yieldk single stop st
765+
766+ goArray !fs st (Tuple' end _) !cur
767+ | cur == end = do
768+ go fs st
769+ goArray !fs st fp@(Tuple' end contents) !cur = do
770+ x <- liftIO $ peekAt cur contents
771+ res <- fstep fs x
772+ let next = INDEX_NEXT(cur,a)
773+ case res of
774+ Fold.Done b -> do
775+ let arr = Array contents next end
776+ return $! (b, StreamK.cons arr st)
777+ Fold.Partial fs1 -> goArray fs1 st fp next
778+
779+{-
780+-- This can be generalized to any type provided it can be unfolded to a stream
781+-- and it can be combined using a semigroup operation.
782+--
783+{-# INLINE_NORMAL parseBreakD #-}
784+parseBreakD ::
785+ forall m a b. (MonadIO m, MonadThrow m, Unbox a)
786+ => PRD.Parser a m b
787+ -> D.Stream m (Array.Array a)
788+ -> m (b, D.Stream m (Array.Array a))
789+parseBreakD
790+ (PRD.Parser pstep initial extract) stream@(D.Stream step state) = do
791+
792+ res <- initial
793+ case res of
794+ PRD.IPartial s -> go SPEC state (List []) s
795+ PRD.IDone b -> return (b, stream)
796+ PRD.IError err -> throwM $ ParseError err
797+
798+ where
799+
800+ -- "backBuf" contains last few items in the stream that we may have to
801+ -- backtrack to.
802+ --
803+ -- XXX currently we are using a dumb list based approach for backtracking
804+ -- buffer. This can be replaced by a sliding/ring buffer using Data.Array.
805+ -- That will allow us more efficient random back and forth movement.
806+ go !_ st backBuf !pst = do
807+ r <- step defState st
808+ case r of
809+ D.Yield (Array contents start end) s ->
810+ gobuf SPEC s backBuf
811+ (Tuple' end contents) start pst
812+ D.Skip s -> go SPEC s backBuf pst
813+ D.Stop -> do
814+ b <- extract pst
815+ return (b, D.nil)
816+
817+ -- Use strictness on "cur" to keep it unboxed
818+ gobuf !_ s backBuf (Tuple' end _) !cur !pst
819+ | cur == end = do
820+ go SPEC s backBuf pst
821+ gobuf !_ s backBuf fp@(Tuple' end contents) !cur !pst = do
822+ x <- liftIO $ peekByteIndex contents cur
823+ pRes <- pstep pst x
824+ let next = INDEX_NEXT(cur,a)
825+ case pRes of
826+ PR.Partial 0 pst1 ->
827+ gobuf SPEC s (List []) fp next pst1
828+ PR.Partial n pst1 -> do
829+ assert (n <= Prelude.length (x:getList backBuf)) (return ())
830+ let src0 = Prelude.take n (x:getList backBuf)
831+ arr0 = A.fromListN n (Prelude.reverse src0)
832+ arr1 = Array contents next end
833+ src = arr0 <> arr1
834+ let !(Array cont1 start end1) = src
835+ fp1 = Tuple' end1 cont1
836+ gobuf SPEC s (List []) fp1 start pst1
837+ PR.Continue 0 pst1 ->
838+ gobuf SPEC s (List (x:getList backBuf)) fp next pst1
839+ PR.Continue n pst1 -> do
840+ assert (n <= Prelude.length (x:getList backBuf)) (return ())
841+ let (src0, buf1) = splitAt n (x:getList backBuf)
842+ arr0 = A.fromListN n (Prelude.reverse src0)
843+ arr1 = Array contents next end
844+ src = arr0 <> arr1
845+ let !(Array cont1 start end1) = src
846+ fp1 = Tuple' end1 cont1
847+ gobuf SPEC s (List buf1) fp1 start pst1
848+ PR.Done 0 b -> do
849+ let arr = Array contents next end
850+ return (b, D.cons arr (D.Stream step s))
851+ PR.Done n b -> do
852+ assert (n <= Prelude.length (x:getList backBuf)) (return ())
853+ let src0 = Prelude.take n (x:getList backBuf)
854+ -- XXX create the array in reverse instead
855+ arr0 = A.fromListN n (Prelude.reverse src0)
856+ arr1 = Array contents next end
857+ -- XXX Use StreamK to avoid adding arbitrary layers of
858+ -- constructors every time.
859+ str = D.cons arr0 (D.cons arr1 (D.Stream step s))
860+ return (b, str)
861+ PR.Error err -> throwM $ ParseError err
862+-}
863+
864+-- | Parse an array stream using the supplied 'Parser'. Returns the parse
865+-- result and the unconsumed stream. Throws 'ParseError' if the parse fails.
866+--
867+-- The following alternative to this function allows composing the parser using
868+-- the parser Monad:
869+--
870+-- >>> parseBreakStreamK p = StreamK.parseBreakChunks (ParserK.adaptC p)
871+--
872+-- We can compare perf and remove this one or define it in terms of that.
873+--
874+-- /Internal/
875+--
876+{-# INLINE_NORMAL parseBreakChunksK #-}
877+parseBreakChunksK ::
878+ forall m a b. (MonadIO m, Unbox a)
879+ => Parser a m b
880+ -> StreamK m (Array a)
881+ -> m (Either ParseError b, StreamK m (Array a))
882+-- parseBreakStreamK p = StreamK.parseBreakChunks (ParserK.adaptC p)
883+parseBreakChunksK (Parser pstep initial extract) stream = do
884+ res <- initial
885+ case res of
886+ IPartial s -> go s stream []
887+ IDone b -> return (Right b, stream)
888+ IError err -> return (Left (ParseError err), stream)
889+
890+ where
891+
892+ -- "backBuf" contains last few items in the stream that we may have to
893+ -- backtrack to.
894+ --
895+ -- XXX currently we are using a dumb list based approach for backtracking
896+ -- buffer. This can be replaced by a sliding/ring buffer using Data.Array.
897+ -- That will allow us more efficient random back and forth movement.
898+ go !pst st backBuf = do
899+ let stop = goStop pst backBuf -- (, K.nil) <$> extract pst
900+ single a = yieldk a StreamK.nil
901+ yieldk arr r = goArray pst backBuf r arr
902+ in StreamK.foldStream defState yieldk single stop st
903+
904+ -- Use strictness on "cur" to keep it unboxed
905+ goArray !pst backBuf st (Array _ cur end) | cur == end = go pst st backBuf
906+ goArray !pst backBuf st (Array contents cur end) = do
907+ x <- liftIO $ peekAt cur contents
908+ pRes <- pstep pst x
909+ let next = INDEX_NEXT(cur,a)
910+ case pRes of
911+ Parser.Partial 0 s ->
912+ goArray s [] st (Array contents next end)
913+ Parser.Partial n s -> do
914+ assert (n <= Prelude.length (x:backBuf)) (return ())
915+ let src0 = Prelude.take n (x:backBuf)
916+ arr0 = fromListN n (Prelude.reverse src0)
917+ arr1 = Array contents next end
918+ src = arr0 <> arr1
919+ goArray s [] st src
920+ Parser.Continue 0 s ->
921+ goArray s (x:backBuf) st (Array contents next end)
922+ Parser.Continue n s -> do
923+ assert (n <= Prelude.length (x:backBuf)) (return ())
924+ let (src0, buf1) = Prelude.splitAt n (x:backBuf)
925+ arr0 = fromListN n (Prelude.reverse src0)
926+ arr1 = Array contents next end
927+ src = arr0 <> arr1
928+ goArray s buf1 st src
929+ Parser.Done 0 b -> do
930+ let arr = Array contents next end
931+ return (Right b, StreamK.cons arr st)
932+ Parser.Done n b -> do
933+ assert (n <= Prelude.length (x:backBuf)) (return ())
934+ let src0 = Prelude.take n (x:backBuf)
935+ -- XXX Use fromListRevN once implemented
936+ -- arr0 = A.fromListRevN n src0
937+ arr0 = fromListN n (Prelude.reverse src0)
938+ arr1 = Array contents next end
939+ str = StreamK.cons arr0 (StreamK.cons arr1 st)
940+ return (Right b, str)
941+ Parser.Error err -> do
942+ let n = Prelude.length backBuf
943+ arr0 = fromListN n (Prelude.reverse backBuf)
944+ arr1 = Array contents cur end
945+ str = StreamK.cons arr0 (StreamK.cons arr1 stream)
946+ return (Left (ParseError err), str)
947+
948+ -- This is a simplified goArray
949+ goExtract !pst backBuf (Array _ cur end)
950+ | cur == end = goStop pst backBuf
951+ goExtract !pst backBuf (Array contents cur end) = do
952+ x <- liftIO $ peekAt cur contents
953+ pRes <- pstep pst x
954+ let next = INDEX_NEXT(cur,a)
955+ case pRes of
956+ Parser.Partial 0 s ->
957+ goExtract s [] (Array contents next end)
958+ Parser.Partial n s -> do
959+ assert (n <= Prelude.length (x:backBuf)) (return ())
960+ let src0 = Prelude.take n (x:backBuf)
961+ arr0 = fromListN n (Prelude.reverse src0)
962+ arr1 = Array contents next end
963+ src = arr0 <> arr1
964+ goExtract s [] src
965+ Parser.Continue 0 s ->
966+ goExtract s backBuf (Array contents next end)
967+ Parser.Continue n s -> do
968+ assert (n <= Prelude.length (x:backBuf)) (return ())
969+ let (src0, buf1) = Prelude.splitAt n (x:backBuf)
970+ arr0 = fromListN n (Prelude.reverse src0)
971+ arr1 = Array contents next end
972+ src = arr0 <> arr1
973+ goExtract s buf1 src
974+ Parser.Done 0 b -> do
975+ let arr = Array contents next end
976+ return (Right b, StreamK.fromPure arr)
977+ Parser.Done n b -> do
978+ assert (n <= Prelude.length backBuf) (return ())
979+ let src0 = Prelude.take n backBuf
980+ -- XXX Use fromListRevN once implemented
981+ -- arr0 = A.fromListRevN n src0
982+ arr0 = fromListN n (Prelude.reverse src0)
983+ arr1 = Array contents next end
984+ str = StreamK.cons arr0 (StreamK.fromPure arr1)
985+ return (Right b, str)
986+ Parser.Error err -> do
987+ let n = Prelude.length backBuf
988+ arr0 = fromListN n (Prelude.reverse backBuf)
989+ arr1 = Array contents cur end
990+ str = StreamK.cons arr0 (StreamK.cons arr1 stream)
991+ return (Left (ParseError err), str)
992+
993+ -- This is a simplified goExtract
994+ {-# INLINE goStop #-}
995+ goStop !pst backBuf = do
996+ pRes <- extract pst
997+ case pRes of
998+ Parser.Partial _ _ -> error "Bug: parseBreak: Partial in extract"
999+ Parser.Continue 0 s ->
1000+ goStop s backBuf
1001+ Parser.Continue n s -> do
1002+ assert (n <= Prelude.length backBuf) (return ())
1003+ let (src0, buf1) = Prelude.splitAt n backBuf
1004+ arr = fromListN n (Prelude.reverse src0)
1005+ goExtract s buf1 arr
1006+ Parser.Done 0 b ->
1007+ return (Right b, StreamK.nil)
1008+ Parser.Done n b -> do
1009+ assert (n <= Prelude.length backBuf) (return ())
1010+ let src0 = Prelude.take n backBuf
1011+ -- XXX Use fromListRevN once implemented
1012+ -- arr0 = A.fromListRevN n src0
1013+ arr0 = fromListN n (Prelude.reverse src0)
1014+ return (Right b, StreamK.fromPure arr0)
1015+ Parser.Error err -> do
1016+ let n = Prelude.length backBuf
1017+ arr0 = fromListN n (Prelude.reverse backBuf)
1018+ return (Left (ParseError err), StreamK.fromPure arr0)
core/src/Streamly/Internal/Data/Array/ArrayMacros.h+13−9
@@ -1,5 +1,5 @@
1-------------------------------------------------------------------------------
1-------------------------------------------------------------------------------
2−-- Macros to access array pointers
2+-- Macros to access Storable pointers
3-------------------------------------------------------------------------------
3-------------------------------------------------------------------------------
4
4
5-- The Storable instance of () has size 0. We ensure that the size is non-zero
5-- The Storable instance of () has size 0. We ensure that the size is non-zero
@@ -8,27 +8,31 @@
8--
8--
9-- XXX Check the core to see if max can be statically eliminated. llvm can
9-- XXX Check the core to see if max can be statically eliminated. llvm can
10-- eliminate the comparison, but not sure if GHC NCG can.
10-- eliminate the comparison, but not sure if GHC NCG can.
11−#define SIZE_OF(a) max 1 (sizeOf (undefined :: a))
11+#define STORABLE_SIZE_OF(a) max 1 (sizeOf (undefined :: a))
12
12
13-- Move the pointer to ith element of specified type. Type is specified as the
13-- Move the pointer to ith element of specified type. Type is specified as the
14-- type variable in the signature of the function where this macro is used.
14-- type variable in the signature of the function where this macro is used.
15−#define PTR_NEXT(ptr,a) ptr `plusPtr` SIZE_OF(a)
15+#define PTR_NEXT(ptr,a) ptr `plusPtr` STORABLE_SIZE_OF(a)
16−#define PTR_PREV(ptr,a) ptr `plusPtr` negate (SIZE_OF(a))
16+#define PTR_PREV(ptr,a) ptr `plusPtr` negate (STORABLE_SIZE_OF(a))
17
17
18−#define PTR_INDEX(ptr,i,a) ptr `plusPtr` (SIZE_OF(a) * i)
18+#define PTR_INDEX(ptr,i,a) ptr `plusPtr` (STORABLE_SIZE_OF(a) * i)
19−#define PTR_RINDEX(ptr,i,a) ptr `plusPtr` negate (SIZE_OF(a) * (i + 1))
19+#define PTR_RINDEX(ptr,i,a) ptr `plusPtr` negate (STORABLE_SIZE_OF(a) * (i + 1))
20
20
21-- XXX If we know that the array is guaranteed to have size multiples of the
21-- XXX If we know that the array is guaranteed to have size multiples of the
22-- element size then we can use a simpler check saying "ptr < end". Since we
22-- element size then we can use a simpler check saying "ptr < end". Since we
23-- always allocate in multiples of elem we can use the simpler check and assert
23-- always allocate in multiples of elem we can use the simpler check and assert
24-- the rigorous check.
24-- the rigorous check.
25−#define PTR_VALID(ptr,end,a) ptr `plusPtr` SIZE_OF(a) <= end
25+#define PTR_VALID(ptr,end,a) ptr `plusPtr` STORABLE_SIZE_OF(a) <= end
26−#define PTR_INVALID(ptr,end,a) ptr `plusPtr` SIZE_OF(a) > end
26+#define PTR_INVALID(ptr,end,a) ptr `plusPtr` STORABLE_SIZE_OF(a) > end
27
27
28-------------------------------------------------------------------------------
28-------------------------------------------------------------------------------
29−-- Macros to access array indices
29+-- Macros to access array indices (using Unbox type class)
30-------------------------------------------------------------------------------
30-------------------------------------------------------------------------------
31
31
32+-- This macro was originally defined as a wrapper to sizeOf so that we can
33+-- avoid a sizeOf value of 0 and make it 1.
34+#define SIZE_OF(a) sizeOf (Proxy :: Proxy a)
35+
32#define INDEX_NEXT(i,a) i + SIZE_OF(a)
36#define INDEX_NEXT(i,a) i + SIZE_OF(a)
33#define INDEX_PREV(i,a) i - SIZE_OF(a)
37#define INDEX_PREV(i,a) i - SIZE_OF(a)
34
38
core/src/Streamly/Internal/Data/Array/Generic.hs+154−194
@@ -1,14 +1,9 @@
1−{-# OPTIONS_GHC -fno-warn-orphans #-}
2−
3−#include "inline.hs"
4−
5-- |
1-- |
6-- Module : Streamly.Internal.Data.Array.Generic
2-- Module : Streamly.Internal.Data.Array.Generic
7-- Copyright : (c) 2019 Composewell Technologies
3-- Copyright : (c) 2019 Composewell Technologies
8--
4--
9-- License : BSD-3-Clause
5-- License : BSD-3-Clause
10-- Maintainer : streamly@composewell.com
6-- Maintainer : streamly@composewell.com
11−-- Stability : pre-release
12-- Portability : GHC
7-- Portability : GHC
13--
8--
14module Streamly.Internal.Data.Array.Generic
9module Streamly.Internal.Data.Array.Generic
@@ -16,25 +11,26 @@ module Streamly.Internal.Data.Array.Generic
16
11
17 -- * Construction
12 -- * Construction
18 , nil
13 , nil
19− , writeN
14+ , createOf
20− , write
15+ , create
16+ , writeWith
21 , writeLastN
17 , writeLastN
22
18
23− , fromStreamDN
24− , fromStreamD
25 , fromStreamN
19 , fromStreamN
26 , fromStream
20 , fromStream
21+ , fromPureStream
22+ , fromByteStr#
27
23
28 , fromListN
24 , fromListN
29 , fromList
25 , fromList
30
26
27+ , chunksOf
28+
31 -- * Elimination
29 -- * Elimination
32 , length
30 , length
33 , reader
31 , reader
34
32
35 , toList
33 , toList
36− , readStreamD
37− , readRevStreamD
38 , read
34 , read
39 , readRev
35 , readRev
40
36
@@ -45,35 +41,42 @@ module Streamly.Internal.Data.Array.Generic
45
41
46 -- * Random Access
42 -- * Random Access
47 , getIndexUnsafe
43 , getIndexUnsafe
44+ , getIndex
45+ , getSliceUnsafe
48 , strip
46 , strip
49− , putIndices
47+
48+ -- * Deprecated
49+ , writeN
50+ , write
50 )
51 )
51where
52where
52
53
53−import Control.DeepSeq (NFData(..))
54+#include "inline.hs"
54−import Control.Monad (when, replicateM)
55+
55−import Control.Monad.IO.Class (liftIO, MonadIO)
56+import Control.Monad (replicateM)
57+import Control.Monad.IO.Class (MonadIO)
58+import Data.Functor.Identity (Identity(..))
59+import Data.Word (Word8)
56import GHC.Base (MutableArray#, RealWorld)
60import GHC.Base (MutableArray#, RealWorld)
61+import GHC.Exts (Addr#)
57import GHC.IO (unsafePerformIO)
62import GHC.IO (unsafePerformIO)
58import Text.Read (readPrec)
63import Text.Read (readPrec)
59
64
60import Streamly.Internal.Data.Fold.Type (Fold(..))
65import Streamly.Internal.Data.Fold.Type (Fold(..))
61import Streamly.Internal.Data.Stream.Type (Stream)
66import Streamly.Internal.Data.Stream.Type (Stream)
62−import Streamly.Internal.Data.Tuple.Strict (Tuple'(..), Tuple3'(..))
63import Streamly.Internal.Data.Unfold.Type (Unfold(..))
67import Streamly.Internal.Data.Unfold.Type (Unfold(..))
64import Streamly.Internal.System.IO (unsafeInlineIO)
68import Streamly.Internal.System.IO (unsafeInlineIO)
65
69
66−import qualified Streamly.Internal.Data.Array.Generic.Mut.Type as MArray
70+import qualified Streamly.Internal.Data.MutArray.Generic as MArray
67import qualified Streamly.Internal.Data.Fold.Type as FL
71import qualified Streamly.Internal.Data.Fold.Type as FL
68import qualified Streamly.Internal.Data.Producer.Type as Producer
72import qualified Streamly.Internal.Data.Producer.Type as Producer
69import qualified Streamly.Internal.Data.Producer as Producer
73import qualified Streamly.Internal.Data.Producer as Producer
70−import qualified Streamly.Internal.Data.Ring as RB
74+import qualified Streamly.Internal.Data.Ring.Generic as RB
71−import qualified Streamly.Internal.Data.Stream.StreamD as D
75+import qualified Streamly.Internal.Data.Stream.Type as D
72−import qualified Streamly.Internal.Data.Stream.Type as Stream
76+import qualified Streamly.Internal.Data.Stream.Generate as D
73import qualified Text.ParserCombinators.ReadPrec as ReadPrec
77import qualified Text.ParserCombinators.ReadPrec as ReadPrec
74
78
75−import Data.IORef
79+import Prelude hiding (Foldable(..), read)
76−import Prelude hiding (foldr, length, read)
77
80
78-------------------------------------------------------------------------------
81-------------------------------------------------------------------------------
79-- Array Data Type
82-- Array Data Type
@@ -91,81 +94,87 @@ data Array a =
91 -- ^ The length of this slice.
94 -- ^ The length of this slice.
92 }
95 }
93
96
94−unsafeFreeze :: MArray.Array a -> Array a
97+unsafeFreeze :: MArray.MutArray a -> Array a
95−unsafeFreeze (MArray.Array cont# arrS arrL _) = Array cont# arrS arrL
98+unsafeFreeze (MArray.MutArray cont# arrS arrL _) = Array cont# arrS arrL
96
99
97−unsafeThaw :: Array a -> MArray.Array a
100+unsafeThaw :: Array a -> MArray.MutArray a
98−unsafeThaw (Array cont# arrS arrL) = MArray.Array cont# arrS arrL arrL
101+unsafeThaw (Array cont# arrS arrL) = MArray.MutArray cont# arrS arrL arrL
99
102
100{-# NOINLINE nil #-}
103{-# NOINLINE nil #-}
101nil :: Array a
104nil :: Array a
102−nil = unsafePerformIO $ do
105+nil = unsafePerformIO $ unsafeFreeze <$> MArray.nil
103− marr <- MArray.newArray 0
104− return $ unsafeFreeze marr
105
106
106-------------------------------------------------------------------------------
107-------------------------------------------------------------------------------
107-- Construction - Folds
108-- Construction - Folds
108-------------------------------------------------------------------------------
109-------------------------------------------------------------------------------
109
110
110−{-# INLINE_NORMAL writeN #-}
111+{-# INLINE_NORMAL createOf #-}
112+createOf :: MonadIO m => Int -> Fold m a (Array a)
113+createOf = fmap unsafeFreeze <$> MArray.createOf
114+
115+-- XXX Deprecate in major
116+-- {-# DEPRECATED writeN "Please use createOf instead." #-}
117+{-# INLINE writeN #-}
111writeN :: MonadIO m => Int -> Fold m a (Array a)
118writeN :: MonadIO m => Int -> Fold m a (Array a)
112−writeN = fmap unsafeFreeze <$> MArray.writeN
119+writeN = createOf
120+
121+{-# INLINE_NORMAL writeWith #-}
122+writeWith :: MonadIO m => Int -> Fold m a (Array a)
123+writeWith elemCount = unsafeFreeze <$> MArray.createWith elemCount
113
124
114−{-# INLINE_NORMAL write #-}
125+-- | Fold the whole input to a single array.
126+--
127+-- /Caution! Do not use this on infinite streams./
128+--
129+{-# INLINE create #-}
130+create :: MonadIO m => Fold m a (Array a)
131+create = fmap unsafeFreeze MArray.create
132+
133+-- XXX Deprecate in major
134+-- {-# DEPRECATED write "Please use create instead." #-}
135+{-# INLINE write #-}
115write :: MonadIO m => Fold m a (Array a)
136write :: MonadIO m => Fold m a (Array a)
116−write = Fold step initial extract
137+write = create
117− where
138+
118− initial = do
139+fromPureStream :: Stream Identity a -> Array a
119− marr <- liftIO $ MArray.newArray 0
140+fromPureStream x =
120− return $ FL.Partial (Tuple3' marr 0 0)
141+ unsafePerformIO $ fmap (unsafeFreeze) (MArray.fromPureStream x)
121− step (Tuple3' marr i capacity) x
142+-- fromPureStream = runIdentity . D.fold (unsafeMakePure write)
122− | i == capacity =
143+-- fromPureStream = fromList . runIdentity . D.toList
123− let newCapacity = max (capacity * 2) 1
144+
124− in do newMarr <- liftIO $ MArray.realloc newCapacity marr
145+fromByteStr# :: Addr# -> Array Word8
125− marr1 <- liftIO $ MArray.snocUnsafe newMarr x
146+fromByteStr# addr = fromPureStream (D.fromByteStr# addr)
126− return $ FL.Partial $ Tuple3' marr1 (i + 1) newCapacity
127− | otherwise = do
128− marr1 <- liftIO $ MArray.snocUnsafe marr x
129− return $ FL.Partial $ Tuple3' marr1 (i + 1) capacity
130− extract (Tuple3' marr _ _) =
131− return $ unsafeFreeze marr
132
147
133-------------------------------------------------------------------------------
148-------------------------------------------------------------------------------
134−-- Construction - from streams
149+-- Stream Ops
135-------------------------------------------------------------------------------
150-------------------------------------------------------------------------------
136
151
137−{-# INLINE_NORMAL fromStreamDN #-}
152+{-# INLINE_NORMAL chunksOf #-}
138−fromStreamDN :: MonadIO m => Int -> D.Stream m a -> m (Array a)
153+chunksOf :: forall m a. MonadIO m
139−fromStreamDN limit str = do
154+ => Int -> Stream m a -> Stream m (Array a)
140− marr <- liftIO $ MArray.newArray (max limit 0)
155+chunksOf n strm = fmap unsafeFreeze $ MArray.chunksOf n strm
141− i <-
156+
142− D.foldlM'
157+-------------------------------------------------------------------------------
143− (\i x -> i `seq` liftIO $ MArray.putIndexUnsafe marr i x >> return (i + 1))
158+-- Construction - from streams
144− (return 0) $
159+-------------------------------------------------------------------------------
145− D.take limit str
146− return $ unsafeFreeze $ marr { MArray.arrLen = i }
147−
148−{-# INLINE fromStreamD #-}
149−fromStreamD :: MonadIO m => D.Stream m a -> m (Array a)
150−fromStreamD = D.fold write
151
160
152{-# INLINE fromStreamN #-}
161{-# INLINE fromStreamN #-}
153fromStreamN :: MonadIO m => Int -> Stream m a -> m (Array a)
162fromStreamN :: MonadIO m => Int -> Stream m a -> m (Array a)
154−fromStreamN n m = do
163+fromStreamN n = D.fold (writeN n)
155− when (n < 0) $ error "fromStreamN: negative write count specified"
156− fromStreamDN n $ Stream.toStreamD m
157
164
158{-# INLINE fromStream #-}
165{-# INLINE fromStream #-}
159fromStream :: MonadIO m => Stream m a -> m (Array a)
166fromStream :: MonadIO m => Stream m a -> m (Array a)
160−fromStream = fromStreamD . Stream.toStreamD
167+fromStream = D.fold write
168+
169+-- XXX Consider foldr/build fusion in toList/fromList
161
170
162{-# INLINABLE fromListN #-}
171{-# INLINABLE fromListN #-}
163fromListN :: Int -> [a] -> Array a
172fromListN :: Int -> [a] -> Array a
164−fromListN n xs = unsafePerformIO $ fromStreamDN n $ D.fromList xs
173+fromListN n xs = unsafePerformIO $ fromStreamN n $ D.fromList xs
165
174
166{-# INLINABLE fromList #-}
175{-# INLINABLE fromList #-}
167fromList :: [a] -> Array a
176fromList :: [a] -> Array a
168−fromList xs = unsafePerformIO $ fromStreamD $ D.fromList xs
177+fromList xs = unsafePerformIO $ fromStream $ D.fromList xs
169
178
170-------------------------------------------------------------------------------
179-------------------------------------------------------------------------------
171-- Elimination - Unfolds
180-- Elimination - Unfolds
@@ -194,25 +203,18 @@ toList arr = loop 0
194
203
195 len = length arr
204 len = length arr
196 loop i | i == len = []
205 loop i | i == len = []
197− loop i = getIndexUnsafe arr i : loop (i + 1)
206+ loop i = getIndexUnsafe i arr : loop (i + 1)
198−
199−{-# INLINE_NORMAL readStreamD #-}
200−readStreamD :: MonadIO m => Array a -> D.Stream m a
201−readStreamD = MArray.toStreamD . unsafeThaw
202
207
203−{-# INLINE_NORMAL readRevStreamD #-}
208+{-# INLINE_NORMAL read #-}
204−readRevStreamD :: Monad m => Array a -> D.Stream m a
209+read :: Monad m => Array a -> Stream m a
205−readRevStreamD arr@Array{..} =
210+read arr@Array{..} =
206− D.map (getIndexUnsafe arr)
211+ D.map (`getIndexUnsafe` arr) $ D.enumerateFromToIntegral 0 (arrLen - 1)
207− $ D.enumerateFromThenToIntegral (arrLen - 1) (arrLen - 2) 0
208−
209−{-# INLINE_EARLY read #-}
210−read :: MonadIO m => Array a -> Stream m a
211−read = Stream.fromStreamD . readStreamD
212
212
213−{-# INLINE_EARLY readRev #-}
213+{-# INLINE_NORMAL readRev #-}
214readRev :: Monad m => Array a -> Stream m a
214readRev :: Monad m => Array a -> Stream m a
215−readRev = Stream.fromStreamD . readRevStreamD
215+readRev arr@Array{..} =
216+ D.map (`getIndexUnsafe` arr)
217+ $ D.enumerateFromThenToIntegral (arrLen - 1) (arrLen - 2) 0
216
218
217-------------------------------------------------------------------------------
219-------------------------------------------------------------------------------
218-- Elimination - using Folds
220-- Elimination - using Folds
@@ -220,22 +222,18 @@ readRev = Stream.fromStreamD . readRevStreamD
220
222
221{-# INLINE_NORMAL foldl' #-}
223{-# INLINE_NORMAL foldl' #-}
222foldl' :: (b -> a -> b) -> b -> Array a -> b
224foldl' :: (b -> a -> b) -> b -> Array a -> b
223−foldl' f z arr = unsafePerformIO $ D.foldl' f z $ readStreamD arr
225+foldl' f z arr = unsafePerformIO $ D.foldl' f z $ read arr
224
226
225{-# INLINE_NORMAL foldr #-}
227{-# INLINE_NORMAL foldr #-}
226foldr :: (a -> b -> b) -> b -> Array a -> b
228foldr :: (a -> b -> b) -> b -> Array a -> b
227−foldr f z arr = unsafePerformIO $ D.foldr f z $ readStreamD arr
229+foldr f z arr = unsafePerformIO $ D.foldr f z $ read arr
228−
229−instance NFData a => NFData (Array a) where
230− {-# INLINE rnf #-}
231− rnf = foldl' (\_ x -> rnf x) ()
232
230
233{-# INLINE fold #-}
231{-# INLINE fold #-}
234−fold :: MonadIO m => Fold m a b -> Array a -> m b
232+fold :: Monad m => Fold m a b -> Array a -> m b
235−fold f arr = D.fold f (readStreamD arr)
233+fold f arr = D.fold f (read arr)
236
234
237{-# INLINE streamFold #-}
235{-# INLINE streamFold #-}
238−streamFold :: MonadIO m => (Stream m a -> m b) -> Array a -> m b
236+streamFold :: Monad m => (Stream m a -> m b) -> Array a -> m b
239streamFold f arr = f (read arr)
237streamFold f arr = f (read arr)
240
238
241-------------------------------------------------------------------------------
239-------------------------------------------------------------------------------
@@ -247,134 +245,96 @@ streamFold f arr = f (read arr)
247--
245--
248-- @since 0.8.0
246-- @since 0.8.0
249{-# INLINE getIndexUnsafe #-}
247{-# INLINE getIndexUnsafe #-}
250−getIndexUnsafe :: Array a -> Int -> a
248+getIndexUnsafe :: Int -> Array a -> a
251−getIndexUnsafe arr i =
249+getIndexUnsafe i arr =
252− unsafePerformIO $ MArray.getIndexUnsafe (unsafeThaw arr) i
250+ unsafePerformIO $ MArray.getIndexUnsafe i (unsafeThaw arr)
253
251
252+-- | Lookup the element at the given index. Index starts from 0.
253+--
254+{-# INLINE getIndex #-}
255+getIndex :: Int -> Array a -> Maybe a
256+getIndex i arr@Array {..} =
257+ if i >= 0 && i < arrLen
258+ then Just $ getIndexUnsafe i arr
259+ else Nothing
260+
261+-- >>> import qualified Streamly.Data.Stream as Stream
262+-- >>> import qualified Streamly.Data.Fold as Fold
263+-- >>> import qualified Streamly.Internal.Data.Array.Generic as Array
264+-- >>> import Data.Function ((&))
265+-- >>> :{
266+-- Stream.fromList [1,2,3,4,5::Int]
267+-- & Stream.scan (Array.writeLastN 2)
268+-- & Stream.fold Fold.toList
269+-- :}
270+-- [fromList [],fromList [1],fromList [1,2],fromList [2,3],fromList [3,4],fromList [4,5]]
271+--
254{-# INLINE writeLastN #-}
272{-# INLINE writeLastN #-}
255writeLastN :: MonadIO m => Int -> Fold m a (Array a)
273writeLastN :: MonadIO m => Int -> Fold m a (Array a)
256−writeLastN n
274+writeLastN n = FL.rmapM f (RB.writeLastN n)
257− | n <= 0 = fmap (const nil) FL.drain
258− | otherwise = Fold step initial done
259
275
260 where
276 where
261
277
262− initial = do
278+ f rb = do
263− rb <- liftIO $ RB.createRing n
279+ arr <- RB.copyToMutArray 0 n rb
264− return $ FL.Partial $ Tuple' rb (0 :: Int)
280+ return $ unsafeFreeze arr
265−
266− step (Tuple' rb rh) x = do
267− liftIO $ RB.unsafeInsertRing rb rh x
268− return $ FL.Partial $ Tuple' rb (rh + 1)
269
281
270− done (Tuple' rb rh) = do
282+{-# INLINE getSliceUnsafe #-}
271− arr' <- liftIO $ MArray.newArray (min rh n)
283+getSliceUnsafe :: Int -> Int -> Array a -> Array a
272− ref <- liftIO $ readIORef $ RB.ringHead rb
284+getSliceUnsafe offset len (Array cont off1 _) = Array cont (off1 + offset) len
273− if rh < n
274− then
275− MArray.putSliceUnsafe (RB.arr rb) 0 arr' 0 ref
276− else do
277− MArray.putSliceUnsafe (RB.arr rb) ref arr' 0 (n - ref)
278− MArray.putSliceUnsafe (RB.arr rb) 0 arr' (n - ref) ref
279− return $ unsafeFreeze arr'
280−
281−sliceUnsafe :: Int -> Int -> Array a -> Array a
282−sliceUnsafe offset len (Array cont off1 _) = Array cont (off1 + offset) len
283
285
284-- XXX This is not efficient as it copies the array. We should support array
286-- XXX This is not efficient as it copies the array. We should support array
285-- slicing so that we can just refer to the underlying array memory instead of
287-- slicing so that we can just refer to the underlying array memory instead of
286-- copying.
288-- copying.
287−--
289+
288-- | Truncate the array at the beginning and end as long as the predicate
290-- | Truncate the array at the beginning and end as long as the predicate
289−-- holds true.
291+-- holds true. Returns a slice of the original array.
292+{-# INLINE strip #-}
290strip :: (a -> Bool) -> Array a -> Array a
293strip :: (a -> Bool) -> Array a -> Array a
291−strip p arr =
294+strip p arr = unsafeFreeze $ unsafePerformIO $ MArray.strip p (unsafeThaw arr)
292− let lastIndex = length arr - 1
293− indexR = getIndexR lastIndex -- last predicate failing index
294− in if indexR == -1
295− then nil
296− else
297− let indexL = getIndexL 0 -- first predicate failing index
298− in if indexL == 0 && indexR == lastIndex
299− then arr
300− else unsafeFreeze $ unsafePerformIO $ do
301− let newLen = indexR - indexL + 1
302− arrThawed = unsafeThaw (sliceUnsafe indexL newLen arr)
303− MArray.clone arrThawed
304−
305− where
306−
307− getIndexR idx
308− | idx < 0 = idx
309− | otherwise =
310− if p (getIndexUnsafe arr idx) then getIndexR (idx - 1) else idx
311−
312− getIndexL idx = if p (getIndexUnsafe arr idx)
313− then getIndexL (idx + 1)
314− else idx
315−
316−-- | Write an input stream of (index, value) pairs to an array. Throws an
317−-- error if any index is out of bounds.
318−--
319−-- /Pre-release/
320−{-# INLINE putIndices #-}
321−putIndices :: MonadIO m
322− => Array a -> Fold m (Int, a) ()
323−putIndices arr = FL.rmapM (\ _ -> return ()) (FL.foldlM' step initial)
324−
325− where
326−
327− initial = return $ unsafeThaw arr
328−
329− step marr (i, x) = do
330− MArray.putIndexUnsafe marr i x
331− return marr
332
295
333-------------------------------------------------------------------------------
296-------------------------------------------------------------------------------
334-- Instances
297-- Instances
335-------------------------------------------------------------------------------
298-------------------------------------------------------------------------------
336
299
337instance Eq a => Eq (Array a) where
300instance Eq a => Eq (Array a) where
338− a1 == a2 = lenA1 == lenA2 && loop (lenA1 - 1)
301+ {-# INLINE (==) #-}
302+ arr1 == arr2 =
303+ unsafeInlineIO $! unsafeThaw arr1 `MArray.eq` unsafeThaw arr2
339
304
340− where
305+instance Ord a => Ord (Array a) where
306+ {-# INLINE compare #-}
307+ compare arr1 arr2 =
308+ unsafeInlineIO $! unsafeThaw arr1 `MArray.cmp` unsafeThaw arr2
341
309
342− lenA1 = length a1
310+ -- Default definitions defined in base do not have an INLINE on them, so we
343− lenA2 = length a2
311+ -- replicate them here with an INLINE.
312+ {-# INLINE (<) #-}
313+ x < y = case compare x y of { LT -> True; _ -> False }
344
314
345− loop i
315+ {-# INLINE (<=) #-}
346− | i < 0 = True
316+ x <= y = case compare x y of { GT -> False; _ -> True }
347− | otherwise =
348− let v1 = getIndexUnsafe a1 i
349− v2 = getIndexUnsafe a2 i
350− in v1 == v2 && loop (i - 1)
351
317
352−instance Ord a => Ord (Array a) where
318+ {-# INLINE (>) #-}
353− compare a1 a2 =
319+ x > y = case compare x y of { GT -> True; _ -> False }
354− case compare lenA1 lenA2 of
320+
355− LT -> LT
321+ {-# INLINE (>=) #-}
356− GT -> GT
322+ x >= y = case compare x y of { LT -> False; _ -> True }
357− EQ -> loop 0
323+
358−
324+ -- These two default methods use '<=' rather than 'compare'
359− where
325+ -- because the latter is often more expensive
360−
326+ {-# INLINE max #-}
361− lenA1 = length a1
327+ max x y = if x <= y then y else x
362− lenA2 = length a2
328+
363−
329+ {-# INLINE min #-}
364− loop i
330+ min x y = if x <= y then x else y
365− | i >= lenA1 = EQ
366− | otherwise =
367− let v1 = getIndexUnsafe a1 i
368− v2 = getIndexUnsafe a2 i
369− in case compare v1 v2 of
370− LT -> LT
371− GT -> GT
372− EQ -> loop (i + 1)
373
331
374instance Show a => Show (Array a) where
332instance Show a => Show (Array a) where
333+ {-# INLINE show #-}
375 show arr = "fromList " ++ show (toList arr)
334 show arr = "fromList " ++ show (toList arr)
376
335
377instance Read a => Read (Array a) where
336instance Read a => Read (Array a) where
337+ {-# INLINE readPrec #-}
378 readPrec = do
338 readPrec = do
379 fromListWord <- replicateM 9 ReadPrec.get
339 fromListWord <- replicateM 9 ReadPrec.get
380 if fromListWord == "fromList "
340 if fromListWord == "fromList "
core/src/Streamly/Internal/Data/Array/Generic/Mut/Type.hsdeleted−607
@@ -1,607 +0,0 @@
1−{-# LANGUAGE UnboxedTuples #-}
2−
3−-- |
4−-- Module : Streamly.Internal.Data.Array.Generic.Mut.Type
5−-- Copyright : (c) 2020 Composewell Technologies
6−-- License : BSD3-3-Clause
7−-- Maintainer : streamly@composewell.com
8−-- Stability : experimental
9−-- Portability : GHC
10−--
11−module Streamly.Internal.Data.Array.Generic.Mut.Type
12−(
13− -- * Type
14− -- $arrayNotes
15− Array (..)
16−
17− -- * Constructing and Writing
18− -- ** Construction
19− -- , nil
20−
21− -- *** Uninitialized Arrays
22− , newArray
23− -- , newArrayWith
24−
25− -- *** From streams
26− , writeNUnsafe
27− , writeN
28−
29− -- , writeWith
30− -- , write
31−
32− -- , writeRevN
33− -- , writeRev
34−
35− -- ** From containers
36− -- , fromListN
37− -- , fromList
38− -- , fromStreamDN
39− -- , fromStreamD
40−
41− -- * Random writes
42− , putIndex
43− , putIndexUnsafe
44− -- , putIndices
45− -- , putFromThenTo
46− -- , putFrom -- start writing at the given position
47− -- , putUpto -- write from beginning up to the given position
48− -- , putFromTo
49− -- , putFromRev
50− -- , putUptoRev
51− , modifyIndexUnsafe
52− , modifyIndex
53− -- , modifyIndices
54− -- , modify
55− -- , swapIndices
56−
57− -- * Growing and Shrinking
58− -- Arrays grow only at the end, though it is possible to grow on both sides
59− -- and therefore have a cons as well as snoc. But that will require two
60− -- bounds in the array representation.
61−
62− -- ** Reallocation
63− , realloc
64−
65− -- ** Appending elements
66− , snocWith
67− , snoc
68− -- , snocLinear
69− -- , snocMay
70− , snocUnsafe
71−
72− -- ** Appending streams
73− -- , writeAppendNUnsafe
74− -- , writeAppendN
75− -- , writeAppendWith
76− -- , writeAppend
77−
78− -- ** Truncation
79− -- These are not the same as slicing the array at the beginning, they may
80− -- reduce the length as well as the capacity of the array.
81− -- , truncateWith
82− -- , truncate
83− -- , truncateExp
84−
85− -- * Eliminating and Reading
86−
87− -- ** Unfolds
88− , reader
89− -- , readerRev
90− , producerWith -- experimental
91− , producer -- experimental
92−
93− -- ** To containers
94− , toStreamD
95− -- , toStreamDRev
96− , toStreamK
97− -- , toStreamKRev
98− , toList
99−
100− -- ** Random reads
101− , getIndex
102− , getIndexUnsafe
103− -- , getIndices
104− -- , getFromThenTo
105− -- , getIndexRev
106−
107− -- * In-place Mutation Algorithms
108− -- , reverse
109− -- , permute
110− -- , partitionBy
111− -- , shuffleBy
112− -- , divideBy
113− -- , mergeBy
114−
115− -- * Folding
116− -- , foldl'
117− -- , foldr
118− -- , cmp
119−
120− -- * Arrays of arrays
121− -- We can add dimensionality parameter to the array type to get
122− -- multidimensional arrays. Multidimensional arrays would just be a
123− -- convenience wrapper on top of single dimensional arrays.
124−
125− -- | Operations dealing with multiple arrays, streams of arrays or
126− -- multidimensional array representations.
127−
128− -- ** Construct from streams
129− -- , arraysOf
130− -- , arrayStreamKFromStreamD
131− -- , writeChunks
132−
133− -- ** Eliminate to streams
134− -- , flattenArrays
135− -- , flattenArraysRev
136− -- , fromArrayStreamK
137−
138− -- ** Construct from arrays
139− -- get chunks without copying
140− , getSliceUnsafe
141− , getSlice
142− -- , getSlicesFromLenN
143− -- , splitAt -- XXX should be able to express using getSlice
144− -- , breakOn
145−
146− -- ** Appending arrays
147− -- , spliceCopy
148− -- , spliceWith
149− -- , splice
150− -- , spliceExp
151− , putSliceUnsafe
152− -- , appendSlice
153− -- , appendSliceFrom
154−
155− , clone
156− )
157−where
158−
159−#include "inline.hs"
160−#include "assert.hs"
161−
162−import Control.Monad.IO.Class (MonadIO(..))
163−import GHC.Base
164− ( MutableArray#
165− , RealWorld
166− , copyMutableArray#
167− , newArray#
168− , readArray#
169− , writeArray#
170− )
171−import GHC.IO (IO(..))
172−import GHC.Int (Int(..))
173−import Streamly.Internal.Data.Fold.Type (Fold(..))
174−import Streamly.Internal.Data.Producer.Type (Producer (..))
175−import Streamly.Internal.Data.Unfold.Type (Unfold(..))
176−
177−import qualified Streamly.Internal.Data.Fold.Type as FL
178−import qualified Streamly.Internal.Data.Producer as Producer
179−import qualified Streamly.Internal.Data.Stream.StreamD as D
180−import qualified Streamly.Internal.Data.Stream.StreamK as K
181−
182−import Prelude hiding (read)
183−
184−-- $setup
185−-- >>> :m
186−-- >>> import qualified Streamly.Internal.Data.Array.Generic.Mut.Type as Array
187−-- >>> import qualified Streamly.Internal.Data.Stream as Stream
188−-- >>> import qualified Streamly.Internal.Data.Stream.StreamD as StreamD
189−-- >>> import qualified Streamly.Internal.Data.Fold as Fold
190−-- >>> import qualified Streamly.Internal.Data.Fold.Type as Fold
191−
192−-------------------------------------------------------------------------------
193−-- Array Data Type
194−-------------------------------------------------------------------------------
195−
196−data Array a =
197− Array
198− { arrContents# :: MutableArray# RealWorld a
199− -- ^ The internal contents of the array representing the entire array.
200−
201− , arrStart :: {-# UNPACK #-}!Int
202− -- ^ The starting index of this slice.
203−
204− , arrLen :: {-# UNPACK #-}!Int
205− -- ^ The length of this slice.
206−
207− , arrTrueLen :: {-# UNPACK #-}!Int
208− -- ^ This is the true length of the array. Coincidentally, this also
209− -- represents the first index beyond the maximum acceptable index of
210− -- the array. This is specific to the array contents itself and not
211− -- dependent on the slice. This value should not change and is shared
212− -- across all the slices.
213− }
214−
215−{-# INLINE bottomElement #-}
216−bottomElement :: a
217−bottomElement =
218− error
219− $ unwords
220− [ funcName
221− , "This is the bottom element of the array."
222− , "This is a place holder and should never be reached!"
223− ]
224−
225− where
226−
227− funcName = "Streamly.Internal.Data.Array.Generic.Mut.Type.bottomElement:"
228−
229−-- XXX Would be nice if GHC can provide something like newUninitializedArray# so
230−-- that we do not have to write undefined or error in the whole array.
231−-- | @newArray count@ allocates an empty array that can hold 'count' items.
232−--
233−-- /Pre-release/
234−{-# INLINE newArray #-}
235−newArray :: forall m a. MonadIO m => Int -> m (Array a)
236−newArray n@(I# n#) =
237− liftIO
238− $ IO
239− $ \s# ->
240− case newArray# n# bottomElement s# of
241− (# s1#, arr# #) ->
242− let ma = Array arr# 0 0 n
243− in (# s1#, ma #)
244−
245−-------------------------------------------------------------------------------
246−-- Random writes
247−-------------------------------------------------------------------------------
248−
249−-- | Write the given element to the given index of the array. Does not check if
250−-- the index is out of bounds of the array.
251−--
252−-- /Pre-release/
253−{-# INLINE putIndexUnsafe #-}
254−putIndexUnsafe :: forall m a. MonadIO m => Array a -> Int -> a -> m ()
255−putIndexUnsafe Array {..} i x =
256− liftIO
257− $ IO
258− $ \s# ->
259− case i + arrStart of
260− I# n# ->
261− let s1# = writeArray# arrContents# n# x s#
262− in (# s1#, () #)
263−
264−invalidIndex :: String -> Int -> a
265−invalidIndex label i =
266− error $ label ++ ": invalid array index " ++ show i
267−
268−-- | /O(1)/ Write the given element at the given index in the array.
269−-- Performs in-place mutation of the array.
270−--
271−-- >>> putIndex arr ix val = Array.modifyIndex arr ix (const (val, ()))
272−--
273−-- /Pre-release/
274−{-# INLINE putIndex #-}
275−putIndex :: MonadIO m => Array a -> Int -> a -> m ()
276−putIndex arr@Array {..} i x =
277− if i >= 0 && i < arrLen
278− then putIndexUnsafe arr i x
279− else invalidIndex "putIndex" i
280−
281−-- | Modify a given index of an array using a modifier function without checking
282−-- the bounds.
283−--
284−-- Unsafe because it does not check the bounds of the array.
285−--
286−-- /Pre-release/
287−modifyIndexUnsafe :: MonadIO m => Array a -> Int -> (a -> (a, b)) -> m b
288−modifyIndexUnsafe Array {..} i f = do
289− liftIO
290− $ IO
291− $ \s# ->
292− case i + arrStart of
293− I# n# ->
294− case readArray# arrContents# n# s# of
295− (# s1#, a #) ->
296− let (a1, b) = f a
297− s2# = writeArray# arrContents# n# a1 s1#
298− in (# s2#, b #)
299−
300−-- | Modify a given index of an array using a modifier function.
301−--
302−-- /Pre-release/
303−modifyIndex :: MonadIO m => Array a -> Int -> (a -> (a, b)) -> m b
304−modifyIndex arr@Array {..} i f = do
305− if i >= 0 && i < arrLen
306− then modifyIndexUnsafe arr i f
307− else invalidIndex "modifyIndex" i
308−
309−-------------------------------------------------------------------------------
310−-- Resizing
311−-------------------------------------------------------------------------------
312−
313−-- | Reallocates the array according to the new size. This is a safe function
314−-- that always creates a new array and copies the old array into the new one. If
315−-- the reallocated size is less than the original array it results in a
316−-- truncated version of the original array.
317−--
318−realloc :: MonadIO m => Int -> Array a -> m (Array a)
319−realloc n arr = do
320− arr1 <- newArray n
321− let !newLen@(I# newLen#) = min n (arrLen arr)
322− !(I# arrS#) = arrStart arr
323− !(I# arr1S#) = arrStart arr1
324− arrC# = arrContents# arr
325− arr1C# = arrContents# arr1
326− liftIO
327− $ IO
328− $ \s# ->
329− let s1# = copyMutableArray# arrC# arrS# arr1C# arr1S# newLen# s#
330− in (# s1#, arr1 {arrLen = newLen, arrTrueLen = n} #)
331−
332−reallocWith ::
333− MonadIO m => String -> (Int -> Int) -> Int -> Array a -> m (Array a)
334−reallocWith label sizer reqSize arr = do
335− let oldSize = arrLen arr
336− newSize = sizer oldSize
337− safeSize = max newSize (oldSize + reqSize)
338− assert (newSize >= oldSize + reqSize || error badSize) (return ())
339− realloc safeSize arr
340−
341− where
342−
343− badSize = concat
344− [ label
345− , ": new array size is less than required size "
346− , show reqSize
347− , ". Please check the sizing function passed."
348− ]
349−
350−-------------------------------------------------------------------------------
351−-- Snoc
352−-------------------------------------------------------------------------------
353−
354−-- XXX Not sure of the behavior of writeArray# if we specify an index which is
355−-- out of bounds. This comment should be rewritten based on that.
356−-- | Really really unsafe, appends the element into the first array, may
357−-- cause silent data corruption or if you are lucky a segfault if the index
358−-- is out of bounds.
359−--
360−-- /Internal/
361−{-# INLINE snocUnsafe #-}
362−snocUnsafe :: MonadIO m => Array a -> a -> m (Array a)
363−snocUnsafe arr@Array {..} a = do
364− assert (arrStart + arrLen < arrTrueLen) (return ())
365− putIndexUnsafe arr arrLen a
366− return $ arr {arrLen = arrLen + 1}
367−
368−-- NOINLINE to move it out of the way and not pollute the instruction cache.
369−{-# NOINLINE snocWithRealloc #-}
370−snocWithRealloc :: MonadIO m => (Int -> Int) -> Array a -> a -> m (Array a)
371−snocWithRealloc sizer arr x = do
372− arr1 <- reallocWith "snocWithRealloc" sizer 1 arr
373− snocUnsafe arr1 x
374−
375−-- | @snocWith sizer arr elem@ mutates @arr@ to append @elem@. The length of
376−-- the array increases by 1.
377−--
378−-- If there is no reserved space available in @arr@ it is reallocated to a size
379−-- in bytes determined by the @sizer oldSize@ function, where @oldSize@ is the
380−-- original size of the array.
381−--
382−-- Note that the returned array may be a mutated version of the original array.
383−--
384−-- /Pre-release/
385−{-# INLINE snocWith #-}
386−snocWith :: MonadIO m => (Int -> Int) -> Array a -> a -> m (Array a)
387−snocWith sizer arr@Array {..} x = do
388− if arrStart + arrLen < arrTrueLen
389− then snocUnsafe arr x
390− else snocWithRealloc sizer arr x
391−
392−-- XXX round it to next power of 2.
393−--
394−-- | The array is mutated to append an additional element to it. If there is no
395−-- reserved space available in the array then it is reallocated to double the
396−-- original size.
397−--
398−-- This is useful to reduce allocations when appending unknown number of
399−-- elements.
400−--
401−-- Note that the returned array may be a mutated version of the original array.
402−--
403−-- >>> snoc = Array.snocWith (* 2)
404−--
405−-- Performs O(n * log n) copies to grow, but is liberal with memory allocation.
406−--
407−-- /Pre-release/
408−{-# INLINE snoc #-}
409−snoc :: MonadIO m => Array a -> a -> m (Array a)
410−snoc = snocWith (* 2)
411−
412−-------------------------------------------------------------------------------
413−-- Random reads
414−-------------------------------------------------------------------------------
415−
416−-- | Return the element at the specified index without checking the bounds.
417−--
418−-- Unsafe because it does not check the bounds of the array.
419−{-# INLINE_NORMAL getIndexUnsafe #-}
420−getIndexUnsafe :: MonadIO m => Array a -> Int -> m a
421−getIndexUnsafe Array {..} n =
422− liftIO
423− $ IO
424− $ \s# ->
425− let !(I# i#) = arrStart + n
426− in readArray# arrContents# i# s#
427−
428−-- | /O(1)/ Lookup the element at the given index. Index starts from 0.
429−--
430−{-# INLINE getIndex #-}
431−getIndex :: MonadIO m => Array a -> Int -> m a
432−getIndex arr@Array {..} i =
433− if i >= 0 && i < arrLen
434− then getIndexUnsafe arr i
435− else invalidIndex "getIndex" i
436−
437−-------------------------------------------------------------------------------
438−-- Subarrays
439−-------------------------------------------------------------------------------
440−
441−-- XXX We can also get immutable slices.
442−
443−-- | /O(1)/ Slice an array in constant time.
444−--
445−-- Unsafe: The bounds of the slice are not checked.
446−--
447−-- /Unsafe/
448−--
449−-- /Pre-release/
450−{-# INLINE getSliceUnsafe #-}
451−getSliceUnsafe
452− :: Int -- ^ from index
453− -> Int -- ^ length of the slice
454− -> Array a
455− -> Array a
456−getSliceUnsafe index len arr@Array {..} =
457− assert (index >= 0 && len >= 0 && index + len <= arrLen)
458− $ arr {arrStart = arrStart + index, arrLen = len}
459−
460−
461−-- | /O(1)/ Slice an array in constant time. Throws an error if the slice
462−-- extends out of the array bounds.
463−--
464−-- /Pre-release/
465−{-# INLINE getSlice #-}
466−getSlice
467− :: Int -- ^ from index
468− -> Int -- ^ length of the slice
469− -> Array a
470− -> Array a
471−getSlice index len arr@Array{..} =
472− if index >= 0 && len >= 0 && index + len <= arrLen
473− then arr {arrStart = arrStart + index, arrLen = len}
474− else error
475− $ "getSlice: invalid slice, index "
476− ++ show index ++ " length " ++ show len
477−
478−-------------------------------------------------------------------------------
479−-- to Lists and streams
480−-------------------------------------------------------------------------------
481−
482−-- | Convert an 'Array' into a list.
483−--
484−-- /Pre-release/
485−{-# INLINE toList #-}
486−toList :: MonadIO m => Array a -> m [a]
487−toList arr@Array{..} = mapM (getIndexUnsafe arr) [0 .. (arrLen - 1)]
488−
489−-- | Use the 'read' unfold instead.
490−--
491−-- @toStreamD = D.unfold read@
492−--
493−-- We can try this if the unfold has any performance issues.
494−{-# INLINE_NORMAL toStreamD #-}
495−toStreamD :: MonadIO m => Array a -> D.Stream m a
496−toStreamD arr@Array{..} =
497− D.mapM (getIndexUnsafe arr) $ D.enumerateFromToIntegral 0 (arrLen - 1)
498−
499−{-# INLINE toStreamK #-}
500−toStreamK :: MonadIO m => Array a -> K.Stream m a
501−toStreamK arr@Array{..} = K.unfoldrM step 0
502−
503− where
504−
505− step i
506− | i == arrLen = return Nothing
507− | otherwise = do
508− x <- getIndexUnsafe arr i
509− return $ Just (x, i + 1)
510−
511−
512−-------------------------------------------------------------------------------
513−-- Folds
514−-------------------------------------------------------------------------------
515−
516−-- | Like 'writeN' but does not check the array bounds when writing. The fold
517−-- driver must not call the step function more than 'n' times otherwise it will
518−-- corrupt the memory and crash. This function exists mainly because any
519−-- conditional in the step function blocks fusion causing 10x performance
520−-- slowdown.
521−--
522−-- /Pre-release/
523−{-# INLINE_NORMAL writeNUnsafe #-}
524−writeNUnsafe :: MonadIO m => Int -> Fold m a (Array a)
525−writeNUnsafe n = Fold step initial return
526−
527− where
528−
529− initial = FL.Partial <$> newArray (max n 0)
530−
531− step arr x = FL.Partial <$> snocUnsafe arr x
532−
533−-- | @writeN n@ folds a maximum of @n@ elements from the input stream to an
534−-- 'Array'.
535−--
536−-- >>> writeN n = Fold.take n (Array.writeNUnsafe n)
537−--
538−-- /Pre-release/
539−{-# INLINE_NORMAL writeN #-}
540−writeN :: MonadIO m => Int -> Fold m a (Array a)
541−writeN n = FL.take n $ writeNUnsafe n
542−
543−-------------------------------------------------------------------------------
544−-- Unfolds
545−-------------------------------------------------------------------------------
546−
547−-- | Resumable unfold of an array.
548−--
549−{-# INLINE_NORMAL producerWith #-}
550−producerWith :: Monad m => (forall b. IO b -> m b) -> Producer m (Array a) a
551−producerWith liftio = Producer step inject extract
552−
553− where
554−
555− {-# INLINE inject #-}
556− inject arr = return (arr, 0)
557−
558− {-# INLINE extract #-}
559− extract (arr, i) =
560− return $ arr {arrStart = arrStart arr + i, arrLen = arrLen arr - i}
561−
562− {-# INLINE_LATE step #-}
563− step (arr, i)
564− | assert (arrLen arr >= 0) (i == arrLen arr) = return D.Stop
565− step (arr, i) = do
566− x <- liftio $ getIndexUnsafe arr i
567− return $ D.Yield x (arr, i + 1)
568−
569−-- | Resumable unfold of an array.
570−--
571−{-# INLINE_NORMAL producer #-}
572−producer :: MonadIO m => Producer m (Array a) a
573−producer = producerWith liftIO
574−
575−-- | Unfold an array into a stream.
576−--
577−{-# INLINE_NORMAL reader #-}
578−reader :: MonadIO m => Unfold m (Array a) a
579−reader = Producer.simplify producer
580−
581−--------------------------------------------------------------------------------
582−-- Appending arrays
583−--------------------------------------------------------------------------------
584−
585−-- | Put a sub range of a source array into a subrange of a destination array.
586−-- This is not safe as it does not check the bounds.
587−{-# INLINE putSliceUnsafe #-}
588−putSliceUnsafe :: MonadIO m => Array a -> Int -> Array a -> Int -> Int -> m ()
589−putSliceUnsafe src srcStart dst dstStart len = liftIO $ do
590− assertM(len <= arrLen dst)
591− assertM(len <= arrLen src)
592− let !(I# srcStart#) = srcStart + arrStart src
593− !(I# dstStart#) = dstStart + arrStart dst
594− !(I# len#) = len
595− let arrS# = arrContents# src
596− arrD# = arrContents# dst
597− IO $ \s# -> (# copyMutableArray#
598− arrS# srcStart# arrD# dstStart# len# s#
599− , () #)
600−
601−{-# INLINE clone #-}
602−clone :: MonadIO m => Array a -> m (Array a)
603−clone src = liftIO $ do
604− let len = arrLen src
605− dst <- newArray len
606− putSliceUnsafe src 0 dst 0 len
607− return dst
core/src/Streamly/Internal/Data/Array/Mut.hsdeleted−103
@@ -1,103 +0,0 @@
1−#include "inline.hs"
2−
3−-- |
4−-- Module : Streamly.Internal.Data.Array.Mut
5−-- Copyright : (c) 2020 Composewell Technologies
6−-- License : BSD-3-Clause
7−-- Maintainer : streamly@composewell.com
8−-- Stability : experimental
9−-- Portability : GHC
10−--
11−-- Unboxed pinned mutable array type for 'Unboxed' types with an option to use
12−-- foreign (non-GHC) memory allocators. Fulfils the following goals:
13−--
14−-- * Random access (array)
15−-- * Efficient storage (unboxed)
16−-- * Performance (unboxed access)
17−-- * Performance - in-place operations (mutable)
18−-- * Performance - GC (pinned, mutable)
19−-- * interfacing with OS (pinned)
20−-- * Fragmentation control (foreign allocators)
21−--
22−-- Stream and Fold APIs allow easy, efficient and convenient operations on
23−-- arrays.
24−
25−module Streamly.Internal.Data.Array.Mut
26− (
27− module Streamly.Internal.Data.Array.Mut.Type
28− , splitOn
29− , genSlicesFromLen
30− , getSlicesFromLen
31− , fromStream
32− )
33−where
34−
35−import Control.Monad.IO.Class (MonadIO(..))
36−import Streamly.Internal.Data.Unboxed (Unbox)
37−import Streamly.Internal.Data.Stream (Stream)
38−import Streamly.Internal.Data.Unfold.Type (Unfold(..))
39−
40−import qualified Streamly.Internal.Data.Stream.StreamD as D
41−import qualified Streamly.Internal.Data.Stream.Type as Stream
42−import qualified Streamly.Internal.Data.Unfold as Unfold
43−-- import qualified Streamly.Internal.Data.Stream.Common as P
44−
45−import Prelude hiding (foldr, length, read, splitAt)
46−import Streamly.Internal.Data.Array.Mut.Type
47−
48−-- | Split the array into a stream of slices using a predicate. The element
49−-- matching the predicate is dropped.
50−--
51−-- /Pre-release/
52−{-# INLINE splitOn #-}
53−splitOn :: (MonadIO m, Unbox a) =>
54− (a -> Bool) -> Array a -> Stream m (Array a)
55−splitOn predicate arr =
56− Stream.fromStreamD
57− $ fmap (\(i, len) -> getSliceUnsafe i len arr)
58− $ D.sliceOnSuffix predicate (toStreamD arr)
59−
60−-- | Generate a stream of array slice descriptors ((index, len)) of specified
61−-- length from an array, starting from the supplied array index. The last slice
62−-- may be shorter than the requested length depending on the array length.
63−--
64−-- /Pre-release/
65−{-# INLINE genSlicesFromLen #-}
66−genSlicesFromLen :: forall m a. (Monad m, Unbox a)
67− => Int -- ^ from index
68− -> Int -- ^ length of the slice
69− -> Unfold m (Array a) (Int, Int)
70−genSlicesFromLen from len =
71− let fromThenTo n = (from, from + len, n - 1)
72− mkSlice n i = return (i, min len (n - i))
73− in Unfold.lmap length
74− $ Unfold.mapM2 mkSlice
75− $ Unfold.lmap fromThenTo Unfold.enumerateFromThenTo
76−
77−-- | Generate a stream of slices of specified length from an array, starting
78−-- from the supplied array index. The last slice may be shorter than the
79−-- requested length depending on the array length.
80−--
81−-- /Pre-release/
82−{-# INLINE getSlicesFromLen #-}
83−getSlicesFromLen :: forall m a. (Monad m, Unbox a)
84− => Int -- ^ from index
85− -> Int -- ^ length of the slice
86− -> Unfold m (Array a) (Array a)
87−getSlicesFromLen from len =
88− let mkSlice arr (i, n) = return $ getSliceUnsafe i n arr
89− in Unfold.mapM2 mkSlice (genSlicesFromLen from len)
90−
91−-- | Create an 'Array' from a stream. This is useful when we want to create a
92−-- single array from a stream of unknown size. 'writeN' is at least twice
93−-- as efficient when the size is already known.
94−--
95−-- Note that if the input stream is too large memory allocation for the array
96−-- may fail. When the stream size is not known, `arraysOf` followed by
97−-- processing of indvidual arrays in the resulting stream should be preferred.
98−--
99−-- /Pre-release/
100−{-# INLINE fromStream #-}
101−fromStream :: (MonadIO m, Unbox a) => Stream m a -> m (Array a)
102−fromStream = fromStreamD . Stream.toStreamD
103−-- fromStream (Stream m) = P.fold write m
core/src/Streamly/Internal/Data/Array/Mut/Stream.hsdeleted−325
@@ -1,325 +0,0 @@
1−-- |
2−-- Module : Streamly.Internal.Data.Array.Mut.Stream
3−-- Copyright : (c) 2019 Composewell Technologies
4−-- License : BSD3-3-Clause
5−-- Maintainer : streamly@composewell.com
6−-- Stability : experimental
7−-- Portability : GHC
8−--
9−-- Combinators to efficiently manipulate streams of mutable arrays.
10−--
11−module Streamly.Internal.Data.Array.Mut.Stream
12− (
13− -- * Generation
14− arraysOf
15−
16− -- * Compaction
17− , packArraysChunksOf
18− , SpliceState (..)
19− , lpackArraysChunksOf
20− , compact
21− , compactLE
22− , compactEQ
23− , compactGE
24− )
25−where
26−
27−#include "inline.hs"
28−#include "ArrayMacros.h"
29−
30−import Control.Monad.IO.Class (MonadIO(..))
31−import Control.Monad (when)
32−import Control.Monad.Catch (MonadThrow)
33−import Data.Bifunctor (first)
34−import Streamly.Internal.Data.Unboxed (Unbox, sizeOf)
35−import Streamly.Internal.Data.Array.Mut.Type (Array(..))
36−import Streamly.Internal.Data.Fold.Type (Fold(..))
37−import Streamly.Internal.Data.Stream.Type (Stream)
38−import Streamly.Internal.Data.Tuple.Strict (Tuple'(..))
39−
40−import qualified Streamly.Internal.Data.Array.Mut.Type as MArray
41−import qualified Streamly.Internal.Data.Fold.Type as FL
42−import qualified Streamly.Internal.Data.Stream.StreamD as D
43−import qualified Streamly.Internal.Data.Parser.ParserD as ParserD
44−import qualified Streamly.Internal.Data.Stream.Type as Stream
45−
46−-- | @arraysOf n stream@ groups the elements in the input stream into arrays of
47−-- @n@ elements each.
48−--
49−-- Same as the following but may be more efficient:
50−--
51−-- > arraysOf n = Stream.foldMany (MArray.writeN n)
52−--
53−-- /Pre-release/
54−{-# INLINE arraysOf #-}
55−arraysOf :: (MonadIO m, Unbox a)
56− => Int -> Stream m a -> Stream m (Array a)
57−arraysOf n = Stream.fromStreamD . MArray.arraysOf n . Stream.toStreamD
58−
59−-------------------------------------------------------------------------------
60−-- Compact
61−-------------------------------------------------------------------------------
62−
63−data SpliceState s arr
64− = SpliceInitial s
65− | SpliceBuffering s arr
66− | SpliceYielding arr (SpliceState s arr)
67− | SpliceFinish
68−
69−-- XXX This can be removed once compactLEFold/compactLE are implemented.
70−--
71−-- | This mutates the first array (if it has space) to append values from the
72−-- second one. This would work for immutable arrays as well because an
73−-- immutable array never has space so a new array is allocated instead of
74−-- mutating it.
75−--
76−-- | Coalesce adjacent arrays in incoming stream to form bigger arrays of a
77−-- maximum specified size. Note that if a single array is bigger than the
78−-- specified size we do not split it to fit. When we coalesce multiple arrays
79−-- if the size would exceed the specified size we do not coalesce therefore the
80−-- actual array size may be less than the specified chunk size.
81−--
82−-- @since 0.7.0
83−{-# INLINE_NORMAL packArraysChunksOf #-}
84−packArraysChunksOf :: (MonadIO m, Unbox a)
85− => Int -> D.Stream m (Array a) -> D.Stream m (Array a)
86−packArraysChunksOf n (D.Stream step state) =
87− D.Stream step' (SpliceInitial state)
88−
89− where
90−
91− {-# INLINE_LATE step' #-}
92− step' gst (SpliceInitial st) = do
93− when (n <= 0) $
94− -- XXX we can pass the module string from the higher level API
95− error $ "Streamly.Internal.Data.Array.Mut.Type.packArraysChunksOf: the size of "
96− ++ "arrays [" ++ show n ++ "] must be a natural number"
97− r <- step gst st
98− case r of
99− D.Yield arr s -> return $
100− let len = MArray.byteLength arr
101− in if len >= n
102− then D.Skip (SpliceYielding arr (SpliceInitial s))
103− else D.Skip (SpliceBuffering s arr)
104− D.Skip s -> return $ D.Skip (SpliceInitial s)
105− D.Stop -> return D.Stop
106−
107− step' gst (SpliceBuffering st buf) = do
108− r <- step gst st
109− case r of
110− D.Yield arr s -> do
111− let len = MArray.byteLength buf + MArray.byteLength arr
112− if len > n
113− then return $
114− D.Skip (SpliceYielding buf (SpliceBuffering s arr))
115− else do
116− buf' <- if MArray.byteCapacity buf < n
117− then liftIO $ MArray.realloc n buf
118− else return buf
119− buf'' <- MArray.splice buf' arr
120− return $ D.Skip (SpliceBuffering s buf'')
121− D.Skip s -> return $ D.Skip (SpliceBuffering s buf)
122− D.Stop -> return $ D.Skip (SpliceYielding buf SpliceFinish)
123−
124− step' _ SpliceFinish = return D.Stop
125−
126− step' _ (SpliceYielding arr next) = return $ D.Yield arr next
127−
128−-- XXX Remove this once compactLEFold is implemented
129−-- lpackArraysChunksOf = Fold.many compactLEFold
130−--
131−{-# INLINE_NORMAL lpackArraysChunksOf #-}
132−lpackArraysChunksOf :: (MonadIO m, Unbox a)
133− => Int -> Fold m (Array a) () -> Fold m (Array a) ()
134−lpackArraysChunksOf n (Fold step1 initial1 extract1) =
135− Fold step initial extract
136−
137− where
138−
139− initial = do
140− when (n <= 0) $
141− -- XXX we can pass the module string from the higher level API
142− error $ "Streamly.Internal.Data.Array.Mut.Type.packArraysChunksOf: the size of "
143− ++ "arrays [" ++ show n ++ "] must be a natural number"
144−
145− r <- initial1
146− return $ first (Tuple' Nothing) r
147−
148− extract (Tuple' Nothing r1) = extract1 r1
149− extract (Tuple' (Just buf) r1) = do
150− r <- step1 r1 buf
151− case r of
152− FL.Partial rr -> extract1 rr
153− FL.Done _ -> return ()
154−
155− step (Tuple' Nothing r1) arr =
156− let len = MArray.byteLength arr
157− in if len >= n
158− then do
159− r <- step1 r1 arr
160− case r of
161− FL.Done _ -> return $ FL.Done ()
162− FL.Partial s -> do
163− extract1 s
164− res <- initial1
165− return $ first (Tuple' Nothing) res
166− else return $ FL.Partial $ Tuple' (Just arr) r1
167−
168− step (Tuple' (Just buf) r1) arr = do
169− let len = MArray.byteLength buf + MArray.byteLength arr
170− buf' <- if MArray.byteCapacity buf < len
171− then liftIO $ MArray.realloc (max n len) buf
172− else return buf
173− buf'' <- MArray.splice buf' arr
174−
175− -- XXX this is common in both the equations of step
176− if len >= n
177− then do
178− r <- step1 r1 buf''
179− case r of
180− FL.Done _ -> return $ FL.Done ()
181− FL.Partial s -> do
182− extract1 s
183− res <- initial1
184− return $ first (Tuple' Nothing) res
185− else return $ FL.Partial $ Tuple' (Just buf'') r1
186−
187−-- XXX Same as compactLE, to be removed once that is implemented.
188−--
189−-- | Coalesce adjacent arrays in incoming stream to form bigger arrays of a
190−-- maximum specified size in bytes.
191−--
192−-- /Internal/
193−{-# INLINE compact #-}
194−compact :: (MonadIO m, Unbox a)
195− => Int -> Stream m (Array a) -> Stream m (Array a)
196−compact n = Stream.fromStreamD . packArraysChunksOf n . Stream.toStreamD
197−
198−-- | Coalesce adjacent arrays in incoming stream to form bigger arrays of a
199−-- maximum specified size. Note that if a single array is bigger than the
200−-- specified size we do not split it to fit. When we coalesce multiple arrays
201−-- if the size would exceed the specified size we do not coalesce therefore the
202−-- actual array size may be less than the specified chunk size.
203−--
204−-- /Internal/
205−{-# INLINE_NORMAL compactLEParserD #-}
206−compactLEParserD ::
207− forall m a. (MonadThrow m, MonadIO m, Unbox a)
208− => Int -> ParserD.Parser (Array a) m (Array a)
209−compactLEParserD n = ParserD.Parser step initial extract
210−
211− where
212−
213− nBytes = n * SIZE_OF(a)
214−
215− initial =
216− return
217− $ if n <= 0
218− then error
219− $ functionPath
220− ++ ": the size of arrays ["
221− ++ show n ++ "] must be a natural number"
222− else ParserD.IPartial Nothing
223−
224− step Nothing arr =
225− return
226− $ let len = MArray.byteLength arr
227− in if len >= nBytes
228− then ParserD.Done 0 arr
229− else ParserD.Partial 0 (Just arr)
230− step (Just buf) arr =
231− let len = MArray.byteLength buf + MArray.byteLength arr
232− in if len > nBytes
233− then return $ ParserD.Done 1 buf
234− else do
235− buf1 <-
236− if MArray.byteCapacity buf < nBytes
237− then liftIO $ MArray.realloc nBytes buf
238− else return buf
239− buf2 <- MArray.splice buf1 arr
240− return $ ParserD.Partial 0 (Just buf2)
241−
242− extract Nothing = return $ ParserD.Done 0 MArray.nil
243− extract (Just buf) = return $ ParserD.Done 0 buf
244−
245− functionPath =
246− "Streamly.Internal.Data.Array.Mut.Stream.compactLEParserD"
247−
248−-- | Coalesce adjacent arrays in incoming stream to form bigger arrays of a
249−-- minimum specified size. Note that if all the arrays in the stream together
250−-- are smaller than the specified size the resulting array will be smaller than
251−-- the specified size. When we coalesce multiple arrays if the size would exceed
252−-- the specified size we stop coalescing further.
253−--
254−-- /Internal/
255−{-# INLINE_NORMAL compactGEFold #-}
256−compactGEFold ::
257− forall m a. (MonadIO m, Unbox a)
258− => Int -> FL.Fold m (Array a) (Array a)
259−compactGEFold n = Fold step initial extract
260−
261− where
262−
263− nBytes = n * SIZE_OF(a)
264−
265− initial =
266− return
267− $ if n < 0
268− then error
269− $ functionPath
270− ++ ": the size of arrays ["
271− ++ show n ++ "] must be a natural number"
272− else FL.Partial Nothing
273−
274− step Nothing arr =
275− return
276− $ let len = MArray.byteLength arr
277− in if len >= nBytes
278− then FL.Done arr
279− else FL.Partial (Just arr)
280− step (Just buf) arr = do
281− let len = MArray.byteLength buf + MArray.byteLength arr
282− buf1 <-
283− if MArray.byteCapacity buf < len
284− then liftIO $ MArray.realloc (max len nBytes) buf
285− else return buf
286− buf2 <- MArray.splice buf1 arr
287− if len >= n
288− then return $ FL.Done buf2
289− else return $ FL.Partial (Just buf2)
290−
291− extract Nothing = return MArray.nil
292− extract (Just buf) = return buf
293−
294− functionPath =
295− "Streamly.Internal.Data.Array.Mut.Stream.compactGEFold"
296−
297−-- | Coalesce adjacent arrays in incoming stream to form bigger arrays of a
298−-- maximum specified size in bytes.
299−--
300−-- /Internal/
301−compactLE :: (MonadThrow m, MonadIO m, Unbox a) =>
302− Int -> Stream m (Array a) -> Stream m (Array a)
303−compactLE n =
304− Stream.fromStreamD . D.parseMany (compactLEParserD n) . Stream.toStreamD
305−
306−-- | Like 'compactLE' but generates arrays of exactly equal to the size
307−-- specified except for the last array in the stream which could be shorter.
308−--
309−-- /Unimplemented/
310−{-# INLINE compactEQ #-}
311−compactEQ :: -- (MonadIO m, Unbox a) =>
312− Int -> Stream m (Array a) -> Stream m (Array a)
313−compactEQ _n _xs = undefined
314− -- IsStream.fromStreamD $ D.foldMany (compactEQFold n) (IsStream.toStreamD xs)
315−
316−-- | Like 'compactLE' but generates arrays of size greater than or equal to the
317−-- specified except for the last array in the stream which could be shorter.
318−--
319−-- /Internal/
320−{-# INLINE compactGE #-}
321−compactGE ::
322− (MonadIO m, Unbox a)
323− => Int -> Stream m (Array a) -> Stream m (Array a)
324−compactGE n =
325− Stream.fromStreamD . D.foldMany (compactGEFold n) . Stream.toStreamD
core/src/Streamly/Internal/Data/Array/Mut/Type.hsdeleted−2358

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Stream.hs+210−641

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Type.hs+675−129

This diff is too big to show here.

core/src/Streamly/Internal/Data/Binary/Decode.hs → core/src/Streamly/Internal/Data/Binary/Parser.hsrenamed+136−17

This diff is too big to show here.

core/src/Streamly/Internal/Data/Binary/Stream.hsnew file+383

This diff is too big to show here.

core/src/Streamly/Internal/Data/Builder.hsnew file+82

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold.hs+11−2442

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Fold.hs → core/src/Streamly/Internal/Data/Fold/Chunked.hsrenamed+65−73

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Combinators.hsnew file+2452

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Extra.hs → core/src/Streamly/Internal/Data/Fold/Container.hsrenamed+318−158

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+34−3

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Type.hs+454−174

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Window.hs+59−53

This diff is too big to show here.

core/src/Streamly/Internal/Data/IOFinalizer.hs+12−2

This diff is too big to show here.

core/src/Streamly/Internal/Data/IORef/Unboxed.hs+23−21

This diff is too big to show here.

src/Streamly/Internal/Data/IsMap.hs → core/src/Streamly/Internal/Data/IsMap.hsrenamed+8

This diff is too big to show here.

core/src/Streamly/Internal/Data/List.hs+104−36

This diff is too big to show here.

core/src/Streamly/Internal/Data/MutArray.hsnew file+207

This diff is too big to show here.

core/src/Streamly/Internal/Data/MutArray/Generic.hsnew file+947

This diff is too big to show here.

core/src/Streamly/Internal/Data/MutArray/Stream.hsnew file+145

This diff is too big to show here.

core/src/Streamly/Internal/Data/MutArray/Type.hsnew file+3318

This diff is too big to show here.

core/src/Streamly/Internal/Data/MutByteArray.hsnew file+251

This diff is too big to show here.

core/src/Streamly/Internal/Data/MutByteArray/Type.hsnew file+321

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser.hs+2709−630

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser/ParserD.hsdeleted−2247

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser/ParserK/Type.hsdeleted−326

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser/ParserD/Type.hs → core/src/Streamly/Internal/Data/Parser/Type.hsrenamed+213−292

This diff is too big to show here.

core/src/Streamly/Internal/Data/ParserK.hsnew file+16

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Pipe.hs+7−10

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Producer/Source.hs+57−36

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+2−2

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Ring/Generic.hsnew file+185

This diff is too big to show here.

core/src/Streamly/Internal/Data/Ring/Unboxed.hsdeleted−620

This diff is too big to show here.

core/src/Streamly/Internal/Data/Serialize/TH.hsnew file+530

This diff is too big to show here.

core/src/Streamly/Internal/Data/Serialize/TH/Bottom.hsnew file+475

This diff is too big to show here.

core/src/Streamly/Internal/Data/Serialize/TH/Common.hsnew file+70

This diff is too big to show here.

core/src/Streamly/Internal/Data/Serialize/TH/RecHeader.hsnew file+411

This diff is too big to show here.

core/src/Streamly/Internal/Data/Serialize/Type.hsnew file+317

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Bottom.hsdeleted−660

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Container.hsnew file+310

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Eliminate.hs+700−247

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Enumerate.hsdeleted−560

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Exception.hs+375−94

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Expand.hsdeleted−727

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Generate.hs+948−216

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Nesting.hs → core/src/Streamly/Internal/Data/Stream/Nesting.hsrenamed+786−349

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Reduce.hsdeleted−434

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Eliminate.hsdeleted−638

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Exception.hsdeleted−368

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Generate.hsdeleted−482

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Lift.hsdeleted−112

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Transform.hsdeleted−1129

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Type.hsdeleted−1042

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamDK.hsdeleted−156

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamK.hsdeleted−1109

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Top.hs+291−325

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Transform.hs+1262−338

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Transformer.hsnew file+183

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Type.hs+1960−279

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/TypeGen.hsdeleted−569

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Zip.hsdeleted−94

This diff is too big to show here.

core/src/Streamly/Internal/Data/StreamK.hsnew file+1730

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/StreamK/Transformer.hsnew file+79

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamK/Type.hs → core/src/Streamly/Internal/Data/StreamK/Type.hsrenamed+1035−315

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+1−4

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unbox.hsnew file+908

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unbox/TH.hsnew file+498

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unboxed.hsdeleted−357

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unfold/Enumeration.hs+14−45

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unfold/Type.hs+154−37

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/Dir.hs+128−29

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/File.hs+69−57

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/Handle.hs+40−47

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/Path.hsnew file+515

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Array/Char.hs → core/src/Streamly/Internal/Unicode/Array.hsrenamed+9−3

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Char/Parser.hsdeleted−298

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Parser.hsnew file+627

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Stream.hs+91−84

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/String.hs+27−18

This diff is too big to show here.

core/src/Streamly/Unicode/Parser.hs+26−12

This diff is too big to show here.

core/src/Streamly/Unicode/Stream.hs+15−11

This diff is too big to show here.

core/src/Streamly/Unicode/String.hs+15−1

This diff is too big to show here.

core/src/inline.hs+1−1

This diff is too big to show here.

core/streamly-core.cabal+209−105

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+1−2

This diff is too big to show here.

docs/Developer/MAINTAINING.md+8−11

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/Developer/paths.rst+25−2

This diff is too big to show here.

docs/Documentation.mdnew file+5

This diff is too big to show here.

docs/User/Explanatory/design.mdnew file+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+54−46

This diff is too big to show here.

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

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.txtnew file+175

This diff is too big to show here.

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

The content is the same.

docs/User/Project/ApiChangelogs/0.9.0-0.10.0.txtnew file+424

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/ProjectRelated/Changelog.md → docs/User/Project/Changelog.mdrenamed+119−24

This diff is too big to show here.

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

The content is the same.

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

The content is the same.

docs/User/Project/README.mdnew file+141

This diff is too big to show here.

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

The content is the same.

docs/User/Project/Upgrading-0.8-to-0.9.mdnew file+384

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/Tutorials/Introduction.mddeleted−651

This diff is too big to show here.

docs/User/Tutorials/ReactiveProgramming.hs+2

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/Tutorials/before-you-begin.mdnew file+77

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/Tutorials/haskell-lazy-evaluation.mdnew file+215

This diff is too big to show here.

docs/User/Tutorials/quick-overview.mdnew file+517

This diff is too big to show here.

docs/User/Tutorials/why-haskell-streamly.mdnew file+91

This diff is too big to show here.

docs/streamly-docs.cabal+8−6

This diff is too big to show here.

hie.yaml+32−12

This diff is too big to show here.

src/Streamly.hsdeleted−625

This diff is too big to show here.

src/Streamly/Data/Array/Foreign.hs+17−4

This diff is too big to show here.

src/Streamly/Data/Fold/Prelude.hsnew file+65

This diff is too big to show here.

src/Streamly/Data/Fold/Tee.hsnew file+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/Concurrent.hsdeleted−166

This diff is too big to show here.

src/Streamly/Data/Stream/Exception.hsdeleted−23

This diff is too big to show here.

src/Streamly/Data/Stream/MkType.hsnew file+115

This diff is too big to show here.

src/Streamly/Data/Stream/Prelude.hsnew file+232

This diff is too big to show here.

src/Streamly/Data/Unicode/Stream.hsdeleted−99

This diff is too big to show here.

src/Streamly/Internal/Control/ForkLifted.hs+17−4

This diff is too big to show here.

src/Streamly/Internal/Data/Array/ArrayMacros.hdeleted−39

This diff is too big to show here.

src/Streamly/Internal/Data/Channel.hsnew file+19

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Channel/Dispatcher.hs → src/Streamly/Internal/Data/Channel/Dispatcher.hsrenamed+3−3

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Channel/Types.hs → src/Streamly/Internal/Data/Channel/Types.hsrenamed+22−32

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Channel/Worker.hs → src/Streamly/Internal/Data/Channel/Worker.hsrenamed+3−3

This diff is too big to show here.

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

The content is the same.

src/Streamly/Internal/Data/Fold/Async.hs+18−6

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Concurrent.hs+37−48

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Concurrent/Channel.hs+36−15

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Concurrent/Channel/Type.hs+8−7

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Prelude.hsnew file+19

This diff is too big to show here.

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

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+1

This diff is too big to show here.

src/Streamly/Internal/Data/SmallArray.hs+17−18

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Ahead.hs+32−8

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Async.hs+44−10

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Common.hs → src/Streamly/Internal/Data/Stream/Common.hsrenamed+12−13

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent.hs+459−401

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel.hs+24−21

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Append.hs+115−126

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Consumer.hs+2−2

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Dispatcher.hs+3−3

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Interleave.hs+16−14

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Operations.hs+7−7

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Type.hs+5−5

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Extra.hsdeleted−164

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Instances.hs+7−10

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Common.hs+44−19

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs+128−36

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Generate.hs+9−34

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Reduce.hs+37−36

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Top.hs+20−17

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Type.hs+39−28

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Exception/Lifted.hs → src/Streamly/Internal/Data/Stream/Lifted.hsrenamed+35−21

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/MkType.hsnew file+641

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Parallel.hs+50−117

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Prelude.hsnew file+19

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/SVar.hsnew file+18

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/SVar/Generate.hs+13−10

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Serial.hs+214−24

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Time.hs+137−137

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Zip.hsnew file+174

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Zip/Concurrent.hsdeleted−48

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/ZipAsync.hs+6−5

This diff is too big to show here.

src/Streamly/Internal/Data/Unfold/Exception.hs+1−3

This diff is too big to show here.

src/Streamly/Internal/Data/Unfold/Prelude.hsnew file+17

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event.hs+5−2

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Darwin.hs+12−12

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Linux.hs+19−13

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Windows.hs+12−9

This diff is too big to show here.

src/Streamly/Internal/FileSystem/FD.hs+16−15

This diff is too big to show here.

src/Streamly/Internal/Network/Inet/TCP.hs+90−49

This diff is too big to show here.

src/Streamly/Internal/Network/Socket.hs+39−33

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/Char.hs+11−10

This diff is too big to show here.

src/Streamly/Internal/Unicode/Utf8.hs+1−4

This diff is too big to show here.

src/Streamly/Memory/Array.hsdeleted−74

This diff is too big to show here.

src/Streamly/Network/Inet/TCP.hs+41−30

This diff is too big to show here.

src/Streamly/Network/Socket.hs+18−32

This diff is too big to show here.

src/Streamly/Prelude.hs+12−6

This diff is too big to show here.

src/inline.hs+1−1

This diff is too big to show here.

stack.yaml+1−2

This diff is too big to show here.

streamly.cabal+145−114

This diff is too big to show here.

targets/Targets.hs+118−68

This diff is too big to show here.

test/Streamly/Test/Data/Array.hs+16−23

This diff is too big to show here.

test/Streamly/Test/Data/Array/Common.hs+2−11

This diff is too big to show here.

test/Streamly/Test/Data/Array/CommonImports.hs+2−3

This diff is too big to show here.

test/Streamly/Test/Data/Array/Stream.hs+15−8

This diff is too big to show here.

test/Streamly/Test/Data/Fold.hs+12−12

This diff is too big to show here.

test/Streamly/Test/Data/Fold/Window.hs+8−9

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/Array/Mut.hs → test/Streamly/Test/Data/MutArray.hsrenamed+5−5

This diff is too big to show here.

test/Streamly/Test/Data/Parser.hs+360−201

This diff is too big to show here.

test/Streamly/Test/Data/Parser/ParserD.hs → test/Streamly/Test/Data/ParserK.hsrenamed+119−97

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.hsnew file+306

This diff is too big to show here.

test/Streamly/Test/Data/Serialize/CompatV0.hsnew file+46

This diff is too big to show here.

test/Streamly/Test/Data/Serialize/CompatV1.hsnew file+48

This diff is too big to show here.

test/Streamly/Test/Data/Serialize/TH.hsnew file+82

This diff is too big to show here.

test/Streamly/Test/Data/Stream.hsnew file+33

This diff is too big to show here.

test/Streamly/Test/Data/Stream/Concurrent.hs+146−105

This diff is too big to show here.

test/Streamly/Test/Data/Unbox.hsnew file+347

This diff is too big to show here.

test/Streamly/Test/Data/Unbox/TH.hsnew file+146

This diff is too big to show here.

test/Streamly/Test/Data/Unfold.hs+2−2

This diff is too big to show here.

test/Streamly/Test/FileSystem/Event/Common.hs+5−3

This diff is too big to show here.

test/Streamly/Test/FileSystem/Event/Linux.hs+16−3

This diff is too big to show here.

test/Streamly/Test/FileSystem/Handle.hs+3−10

This diff is too big to show here.

test/Streamly/Test/Network/Inet/TCP.hs+17−12

This diff is too big to show here.

test/Streamly/Test/Network/Socket.hs+17−12

This diff is too big to show here.

test/Streamly/Test/Prelude/Serial.hs+136−99

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Serialize/Serializable.hsnew file+237

This diff is too big to show here.

test/Streamly/Test/Unicode/Char.hs+10−6

This diff is too big to show here.

test/Streamly/Test/Unicode/Parser.hsnew file+231

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/lib/Streamly/Test/Prelude/Common.hs+9−2

This diff is too big to show here.

test/streamly-tests.cabal+104−19

This diff is too big to show here.

test/test-runner/Main.hs+1

This diff is too big to show here.

test/test-runner/cabal.project+3

This diff is too big to show here.