on 0bd1586 help sign in
534 files changed+52115−135962
since splitsnapshots
unifiedsplit
.circleci/config.yml+258−87 .ghci−1 .github/workflows/haskell.yml+56−216 .github/workflows/packdiff.yml−39 .github/workflows/regression-check.yml−165 .gitignore+3−8 .hlint.ignore+35−12 .hlint.yaml+2−18 .packcheck.ignore−32 .travis.yml+242 CHANGELOG.md−1 CONTRIBUTING.md+251−1 docs/User/Project/Changelog.md → Changelog.md+81−250 INSTALL.md+298 LICENSE−68 MAINTAINING.md+256 README.md+606−1 appveyor.yml+6−7 benchmark/Chart.hs+194 benchmark/NanoBenchmarks.hs+22−27 benchmark/README.md+229−1 benchmark/Streamly/Benchmark/Data/Array.hs+140−79 benchmark/Streamly/Benchmark/Data/Array/Common.hs−185 benchmark/Streamly/Benchmark/Data/Array/CommonImports.hs−16 benchmark/Streamly/Benchmark/Data/Array/Generic.hs−119 benchmark/Streamly/Benchmark/Data/Array/SmallArray.hs−95 benchmark/Streamly/Benchmark/Data/Array/Stream.hs−309 benchmark/Streamly/Benchmark/Data/ArrayOps.hs+242 benchmark/Streamly/Benchmark/Data/Fold.hs+125−350 benchmark/Streamly/Benchmark/Data/Fold/Window.hs−191 benchmark/Streamly/Benchmark/Data/MutArray.hs−300 benchmark/Streamly/Benchmark/Data/NestedUnfoldOps.hs+126 benchmark/Streamly/Benchmark/Data/Parser.hs+134−692 benchmark/Streamly/Benchmark/Data/Parser/ParserD.hs+260 benchmark/Streamly/Benchmark/Data/Parser/ParserK.hs+165 benchmark/Streamly/Benchmark/Data/ParserK.hs−437 benchmark/Streamly/Benchmark/Data/Ring/Unboxed.hs−69 benchmark/Streamly/Benchmark/Data/Serialize.hs−591 benchmark/Streamly/Benchmark/Data/Serialize/RecCompatible.hs−24 benchmark/Streamly/Benchmark/Data/Serialize/RecNonCompatible.hs−21 benchmark/Streamly/Benchmark/Data/Serialize/TH.hs−76 benchmark/Streamly/Benchmark/Data/Stream.hs−114 benchmark/Streamly/Benchmark/Data/Stream/Common.hs−518 benchmark/Streamly/Benchmark/Data/Stream/Concurrent.hs−20 benchmark/Streamly/Benchmark/Data/Stream/ConcurrentCommon.hs−208 benchmark/Streamly/Benchmark/Data/Stream/ConcurrentEager.hs−25 benchmark/Streamly/Benchmark/Data/Stream/ConcurrentInterleaved.hs−25 benchmark/Streamly/Benchmark/Data/Stream/ConcurrentOrdered.hs−25 benchmark/Streamly/Benchmark/Data/Stream/Exceptions.hs−371 benchmark/Streamly/Benchmark/Data/Stream/Generate.hs−278 benchmark/Streamly/Benchmark/Data/Stream/Lift.hs−146 benchmark/Streamly/Benchmark/Data/Stream/Reduce.hs−588 benchmark/Streamly/Benchmark/Data/Stream/StreamD.hs+16−57 benchmark/Streamly/Benchmark/Data/Stream/StreamKAlt.hs → benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs+6−8 benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs+356−591 benchmark/Streamly/Benchmark/Data/Stream/ToStreamK.hs−938 benchmark/Streamly/Benchmark/Data/Stream/Transform.hs−687 benchmark/Streamly/Benchmark/Data/Unfold.hs+119−319 benchmark/Streamly/Benchmark/FileSystem/Handle.hs+7−2 benchmark/Streamly/Benchmark/FileSystem/Handle/Read.hs+168−88 benchmark/Streamly/Benchmark/FileSystem/Handle/ReadWrite.hs+101−54 benchmark/Streamly/Benchmark/Prelude/Adaptive.hs+39−51 benchmark/Streamly/Benchmark/Prelude/Ahead.hs+30−30 benchmark/Streamly/Benchmark/Prelude/Async.hs+36−37 benchmark/Streamly/Benchmark/Prelude/Concurrent.hs+19−28 benchmark/Streamly/Benchmark/Prelude/Merge.hs−298 benchmark/Streamly/Benchmark/Prelude/Parallel.hs+34−33 benchmark/Streamly/Benchmark/Prelude/Rate.hs+29−27 benchmark/Streamly/Benchmark/Prelude/Serial.hs+54 benchmark/Streamly/Benchmark/Data/Stream/Eliminate.hs → benchmark/Streamly/Benchmark/Prelude/Serial/Elimination.hs+126−188 benchmark/Streamly/Benchmark/Prelude/Serial/Exceptions.hs+217 benchmark/Streamly/Benchmark/Prelude/Serial/Generation.hs+179 benchmark/Streamly/Benchmark/Data/Stream/Expand.hs → benchmark/Streamly/Benchmark/Prelude/Serial/Nested.hs+158−281 benchmark/Streamly/Benchmark/Data/Stream/Split.hs → benchmark/Streamly/Benchmark/Prelude/Serial/Split.hs+21−34 benchmark/Streamly/Benchmark/Prelude/Serial/Transformation1.hs+554 benchmark/Streamly/Benchmark/Prelude/Serial/Transformation2.hs+444 benchmark/Streamly/Benchmark/Prelude/Serial/Transformation3.hs+122 benchmark/Streamly/Benchmark/Prelude/WAsync.hs+30−30 benchmark/Streamly/Benchmark/Prelude/WSerial.hs+68−218 benchmark/Streamly/Benchmark/Prelude/ZipAsync.hs+11−25 benchmark/Streamly/Benchmark/Prelude/ZipSerial.hs+10−56 benchmark/Streamly/Benchmark/Unicode/Char.hs−90 benchmark/Streamly/Benchmark/Unicode/Parser.hs−107 benchmark/Streamly/Benchmark/Unicode/Stream.hs+104−165 benchmark/Streamly/Benchmark/Unicode/Utf8.hs−55 benchmark/Streamly/Benchmark/Unicode/data/AllChars.txt−216 benchmark/Streamly/Benchmark/Unicode/data/Deutsch.txt−153 benchmark/Streamly/Benchmark/Unicode/data/Devanagari.txt−699 benchmark/Streamly/Benchmark/Unicode/data/English.txt−58 benchmark/Streamly/Benchmark/Unicode/data/Japanese.txt−855 benchmark/Streamly/Benchmark/Unicode/data/Korean.txt−493 benchmark/Streamly/Benchmark/Unicode/data/Vietnamese.txt−402 benchmark/bench-runner/Main.hs−183 benchmark/bench-runner/bench-runner.cabal−42 benchmark/bench-runner/cabal.project−4 benchmark/bench-runner/default.nix−164 benchmark/lib/Streamly/Benchmark/Common.hs+17−65 benchmark/lib/Streamly/Benchmark/Common/Handle.hs+32−47 benchmark/lib/Streamly/Benchmark/Prelude.hs+44−110 benchmark/streamly-benchmarks.cabal+168−466 bin/bench-exec-one.sh+175 bin/bench.sh+417 bin/build-lib.sh+236 bin/ghc.sh−45 bin/mk-hscope.sh+2−2 bin/repl−3 bin/run-ci.sh−334 bin/run-repl-quick.sh−113 bin/targets.sh+110 bin/test.sh+163 cabal.project+2−2 cabal.project.O0−24 cabal.project.Werror-nocode−21 cabal.project.Werror → cabal.project.ci+3−4 cabal.project.coverage+4−5 cabal.project.doctest−24 cabal.project.ghc-head−35 cabal.project.hpc-coveralls+1−1 cabal.project.packdiff−9 cabal.project.report−30 cabal.project.streamly−10 docs/User/HowTo/streamly-vs-list-time.svg → charts-0/streamly-vs-list-time.svg configure+1406−1258 configure.ac+5−1 core/Changelog.md−1 core/LICENSE−322 core/Setup.hs−6 core/configure−4349 core/configure.ac−17 core/docs/ApiChangelogs/0.1.0-0.2.0.txt−1471 core/docs/ApiChangelogs/0.1.0.txt−405 core/docs/ApiChangelogs/0.2.0-0.2.2.txt−306 core/docs/Changelog.md−97 core/docs/Readme.md−1 core/src/DocTestDataArray.hs−22 core/src/DocTestDataFold.hs−27 core/src/DocTestDataMutArray.hs−10 core/src/DocTestDataMutArrayGeneric.hs−10 core/src/DocTestDataParser.hs−20 core/src/DocTestDataParserK.hs−15 core/src/DocTestDataStream.hs−39 core/src/DocTestDataStreamK.hs−21 core/src/DocTestDataUnfold.hs−12 core/src/DocTestFileSystemHandle.hs−15 core/src/DocTestUnicodeParser.hs−9 core/src/DocTestUnicodeStream.hs−12 core/src/DocTestUnicodeString.hs−5 core/src/Streamly/Console/Stdio.hs−30 core/src/Streamly/Data/Array.hs−167 core/src/Streamly/Data/Array/Generic.hs−51 core/src/Streamly/Data/Fold.hs−415 core/src/Streamly/Data/MutArray.hs−110 core/src/Streamly/Data/MutArray/Generic.hs−70 core/src/Streamly/Data/MutByteArray.hs−106 core/src/Streamly/Data/Parser.hs−247 core/src/Streamly/Data/ParserK.hs−139 core/src/Streamly/Data/Stream.hs−746 core/src/Streamly/Data/StreamK.hs−194 core/src/Streamly/Data/Unfold.hs−233 core/src/Streamly/FileSystem/Dir.hs−23 core/src/Streamly/FileSystem/File.hs−60 core/src/Streamly/FileSystem/Handle.hs−117 core/src/Streamly/Internal/BaseCompat.hs−37 core/src/Streamly/Internal/Console/Stdio.hs−228 core/src/Streamly/Internal/Control/ForkIO.hs−50 core/src/Streamly/Internal/Data/Array.hs−1018 core/src/Streamly/Internal/Data/Array/ArrayMacros.h−43 core/src/Streamly/Internal/Data/Array/Generic.hs−342 core/src/Streamly/Internal/Data/Array/Stream.hs−725 core/src/Streamly/Internal/Data/Array/Type.hs−1148 core/src/Streamly/Internal/Data/Binary/Parser.hs−399 core/src/Streamly/Internal/Data/Binary/Stream.hs−383 core/src/Streamly/Internal/Data/Builder.hs−82 core/src/Streamly/Internal/Data/Either/Strict.hs−57 core/src/Streamly/Internal/Data/Fold.hs−33 core/src/Streamly/Internal/Data/Fold/Chunked.hs−379 core/src/Streamly/Internal/Data/Fold/Combinators.hs−2452 core/src/Streamly/Internal/Data/Fold/Container.hs−783 core/src/Streamly/Internal/Data/Fold/Step.hs−83 core/src/Streamly/Internal/Data/Fold/Tee.hs−184 core/src/Streamly/Internal/Data/Fold/Type.hs−2099 core/src/Streamly/Internal/Data/Fold/Window.hs−357 core/src/Streamly/Internal/Data/IOFinalizer.hs−101 core/src/Streamly/Internal/Data/IORef/Unboxed.hs−101 core/src/Streamly/Internal/Data/IsMap.hs−60 core/src/Streamly/Internal/Data/List.hs−234 core/src/Streamly/Internal/Data/MutArray.hs−207 core/src/Streamly/Internal/Data/MutArray/Generic.hs−947 core/src/Streamly/Internal/Data/MutArray/Stream.hs−145 core/src/Streamly/Internal/Data/MutArray/Type.hs−3318 core/src/Streamly/Internal/Data/MutByteArray.hs−251 core/src/Streamly/Internal/Data/MutByteArray/Type.hs−321 core/src/Streamly/Internal/Data/Parser.hs−3621 core/src/Streamly/Internal/Data/Parser/Type.hs−1452 core/src/Streamly/Internal/Data/ParserK.hs−16 core/src/Streamly/Internal/Data/ParserK/Type.hs−752 core/src/Streamly/Internal/Data/Pipe.hs−273 core/src/Streamly/Internal/Data/Producer.hs−81 core/src/Streamly/Internal/Data/Producer/Source.hs−303 core/src/Streamly/Internal/Data/Producer/Type.hs−186 core/src/Streamly/Internal/Data/Refold/Type.hs−251 core/src/Streamly/Internal/Data/Ring.hs−619 core/src/Streamly/Internal/Data/Ring/Generic.hs−185 core/src/Streamly/Internal/Data/SVar/Type.hs−540 core/src/Streamly/Internal/Data/Serialize/TH.hs−530 core/src/Streamly/Internal/Data/Serialize/TH/Bottom.hs−475 core/src/Streamly/Internal/Data/Serialize/TH/Common.hs−70 core/src/Streamly/Internal/Data/Serialize/TH/RecHeader.hs−411 core/src/Streamly/Internal/Data/Serialize/Type.hs−317 core/src/Streamly/Internal/Data/Stream.hs−42 core/src/Streamly/Internal/Data/Stream/Container.hs−310 core/src/Streamly/Internal/Data/Stream/Eliminate.hs−849 core/src/Streamly/Internal/Data/Stream/Exception.hs−501 core/src/Streamly/Internal/Data/Stream/Generate.hs−1191 core/src/Streamly/Internal/Data/Stream/Lift.hs−129 core/src/Streamly/Internal/Data/Stream/Nesting.hs−3024 core/src/Streamly/Internal/Data/Stream/Step.hs−39 core/src/Streamly/Internal/Data/Stream/StreamD.hs−16 core/src/Streamly/Internal/Data/Stream/Top.hs−480 core/src/Streamly/Internal/Data/Stream/Transform.hs−1971 core/src/Streamly/Internal/Data/Stream/Transformer.hs−183 core/src/Streamly/Internal/Data/Stream/Type.hs−2220 core/src/Streamly/Internal/Data/StreamK.hs−1730 core/src/Streamly/Internal/Data/StreamK/Transformer.hs−79 core/src/Streamly/Internal/Data/StreamK/Type.hs−2153 core/src/Streamly/Internal/Data/Time/Clock.hs−180 core/src/Streamly/Internal/Data/Unbox.hs−908 core/src/Streamly/Internal/Data/Unbox/TH.hs−498 core/src/Streamly/Internal/Data/Unfold.hs−1077 core/src/Streamly/Internal/Data/Unfold/Enumeration.hs−543 core/src/Streamly/Internal/Data/Unfold/Type.hs−999 core/src/Streamly/Internal/FileSystem/Path.hs−515 core/src/Streamly/Internal/System/IO.hs−58 core/src/Streamly/Internal/Unicode/Array.hs−104 core/src/Streamly/Internal/Unicode/Parser.hs−627 core/src/Streamly/Internal/Unicode/Stream.hs−1123 core/src/Streamly/Internal/Unicode/String.hs−158 core/src/Streamly/Unicode/Parser.hs−69 core/src/Streamly/Unicode/String.hs−30 core/src/assert.hs−6 core/src/config.h.in−57 core/src/inline.hs−27 core/streamly-core.cabal−534 docs/User/Project/CONTRIBUTORS.md → credits/CONTRIBUTORS.md+2−58 credits/COPYRIGHTS.md+77 docs/User/Project/Credits.md → credits/README.md+1−3 credits/Yampa-0.10.6.2.txt+29 credits/base-4.12.0.0.txt+83 credits/bjoern-2008-2009.txt+19 credits/clock-0.7.2.txt+32 credits/foldl-1.4.5.txt+24 credits/fsnotify-0.3.0.1.txt+30 credits/hfsevents-0.1.6.txt+30 credits/pipes-concurrency-2.0.8.txt+24 credits/primitive-0.7.0.0.txt+30 credits/transient-0.5.5.txt+18 credits/vector-0.12.0.2.txt+30 default.nix+8−52 docs/Developer/dfa-bytes.png → design/dfa-bytes.png docs/Developer/dfa-classes.png → design/dfa-classes.png docs/Developer/dfa-rearr.png → design/dfa-rearr.png docs/Developer/linked-lists.md → design/linked-lists.md docs/Developer/module-organization.md → design/module-organization.md+8−8 docs/Developer/optimization-guidelines.md → design/optimization-guidelines.md+3−15 docs/Developer/paths.rst → design/paths.rst+2−25 docs/Developer/unicode.md → design/unicode.md docs/Developer/utf8-decoder.md → design/utf8-decoder.md+3−3 docs/User/HowTo/optimizing.md → docs/Build.md+117−10 docs/Developer/Benchmarks.md−342 docs/Developer/Contributing.md−271 docs/Developer/Github.link−1 docs/Developer/MAINTAINING.md−422 docs/Developer/Tests.md−139 docs/Developer/ci-tests.md−64 docs/Developer/container-api.md−124 docs/Developer/cps-vs-direct.rst−328 docs/Developer/overview.md−24 docs/Developer/related-packages.md−71 docs/Developer/resources.md−45 docs/Developer/roadmap.md−36 docs/Documentation.md−5 docs/Setup.hs−6 docs/User/Explanatory/Overview.md−468 docs/User/Explanatory/design.md−42 docs/User/Explanatory/monad-transformers.md−65 docs/User/Explanatory/performance.md−7 docs/User/Explanatory/streaming-pradigms.rst−117 docs/User/Explanatory/unified-abstractions.md−275 docs/User/HowTo/Compiling.md−145 docs/User/HowTo/Examples.link−1 docs/User/HowTo/faq.md−94 docs/User/HowTo/interoperation.md−11 docs/User/Project/ApiChangelogs/0.8.3-0.9.0.txt−175 docs/User/Project/ApiChangelogs/0.8.3.txt−261 docs/User/Project/ApiChangelogs/0.9.0-0.10.0.txt−424 docs/User/Project/Github.link−1 docs/User/Project/README.md−141 docs/User/Project/Roadmap.link−1 docs/User/Project/Upgrading-0.8-to-0.9.md−384 docs/User/Tutorials/ConcurrentStreams.hs−771 docs/User/Tutorials/Examples.link−1 docs/User/Tutorials/ReactiveProgramming.hs−126 docs/User/Tutorials/Tutorial.hs−521 docs/User/Tutorials/before-you-begin.md−77 docs/User/Tutorials/getting-started.md−225 docs/User/Tutorials/haskell-lazy-evaluation.md−215 docs/User/Tutorials/quick-overview.md−517 docs/User/Tutorials/why-haskell-streamly.md−91 docs/User/resources.md−18 docs/streamly-docs.cabal−49 docs/User/HowTo/streamly-vs-async.md → docs/streamly-vs-async.md+17−19 docs/User/HowTo/streamly-vs-lists.md → docs/streamly-vs-lists.md+5−7 docs/transformers.md+32 examples/README.md+1−1 hie.yaml+55−144 core/jsbits/clock.js → jsbits/clock.js src/Streamly.hs+658 src/Streamly/Data/Array.hs+43 src/Streamly/Data/Array/Foreign.hs → src/Streamly/Data/Array/Storable/Foreign.hs+8−54 src/Streamly/Data/Fold.hs+265 src/Streamly/Data/Fold/Prelude.hs−65 src/Streamly/Data/Fold/Tee.hs−16 src/Streamly/Data/Prim/Array.hs+43 src/Streamly/Data/SmallArray.hs+2−2 src/Streamly/Data/Stream/MkType.hs−115 src/Streamly/Data/Stream/Prelude.hs−232 src/Streamly/Data/Unfold.hs+62 src/Streamly/Data/Unicode/Stream.hs+99 src/Streamly/Internal/FileSystem/FD.hs → src/Streamly/FileSystem/FD.hs+70−89 src/Streamly/Internal/FileSystem/FDIO.hs → src/Streamly/FileSystem/FDIO.hs+15−6 src/Streamly/FileSystem/Handle.hs+86 src/Streamly/Internal/System/IOVec/Type.hsc → src/Streamly/FileSystem/IOVec.hsc+4−7 src/Streamly/Internal/BaseCompat.hs+42 src/Streamly/Internal/Control/Concurrent.hs−77 core/src/Streamly/Internal/Control/Exception.hs → src/Streamly/Internal/Control/Exception.hs+15−3 src/Streamly/Internal/Control/ForkLifted.hs−66 core/src/Streamly/Internal/Control/Monad.hs → src/Streamly/Internal/Control/Monad.hs+1−1 src/Streamly/Internal/Data/Array.hs+206 src/Streamly/Internal/Data/Array/Prim.hs+110 src/Streamly/Internal/Data/Array/Prim/Mut/Types.hs+94 src/Streamly/Internal/Data/Array/Prim/MutTypesInclude.hs+406 src/Streamly/Internal/Data/Array/Prim/Pinned.hs+108 src/Streamly/Internal/Data/Array/Prim/Pinned/Mut/Types.hs+176 src/Streamly/Internal/Data/Array/Prim/Pinned/Types.hs+127 src/Streamly/Internal/Data/Array/Prim/Types.hs+98 src/Streamly/Internal/Data/Array/Prim/TypesInclude.hs+702 src/Streamly/Internal/Data/Array/PrimInclude.hs+185 src/Streamly/Internal/Data/Array/Storable/Foreign.hs+611 src/Streamly/Internal/Data/Array/Storable/Foreign/Mut/Types.hs+1365 src/Streamly/Internal/Data/Array/Storable/Foreign/Types.hs+695 src/Streamly/Internal/Data/Binary/Decode.hs+278 src/Streamly/Internal/Data/Channel.hs−19 src/Streamly/Internal/Data/Channel/Dispatcher.hs−294 src/Streamly/Internal/Data/Channel/Types.hs−817 src/Streamly/Internal/Data/Channel/Worker.hs−375 src/Streamly/Internal/Data/Cont.hs+1−1 src/Streamly/Internal/Data/Either/Strict.hs+26 src/Streamly/Internal/Data/Fold.hs+2087 src/Streamly/Internal/Data/Fold/Async.hs−133 src/Streamly/Internal/Data/Fold/Concurrent.hs−57 src/Streamly/Internal/Data/Fold/Concurrent/Channel.hs−112 src/Streamly/Internal/Data/Fold/Concurrent/Channel/Type.hs−331 src/Streamly/Internal/Data/Fold/Prelude.hs−19 src/Streamly/Internal/Data/Fold/SVar.hs−79 src/Streamly/Internal/Data/Fold/Types.hs+943 src/Streamly/Internal/Data/IOFinalizer/Lifted.hs−74 src/Streamly/Internal/Data/IORef/Prim.hs+84 src/Streamly/Internal/Data/IsMap/HashMap.hs−42 src/Streamly/Internal/Data/List.hs+188 core/src/Streamly/Internal/Data/Maybe/Strict.hs → src/Streamly/Internal/Data/Maybe/Strict.hs+1−25 src/Streamly/Internal/Data/Parser.hs+989 src/Streamly/Internal/Data/Parser/ParserD.hs+736 core/src/Streamly/Internal/Data/Parser/Tee.hs → src/Streamly/Internal/Data/Parser/ParserD/Tee.hs+20−89 src/Streamly/Internal/Data/Parser/ParserD/Types.hs+670 src/Streamly/Internal/Data/Parser/ParserK/Types.hs+456 src/Streamly/Internal/Data/Pipe.hs+1968 core/src/Streamly/Internal/Data/Pipe/Type.hs → src/Streamly/Internal/Data/Pipe/Types.hs+5−2 src/Streamly/Internal/Data/SVar.hs+2044−116 src/Streamly/Internal/Data/SVar/Dispatch.hs−739 src/Streamly/Internal/Data/SVar/Pull.hs−164 src/Streamly/Internal/Data/SVar/Worker.hs−544 src/Streamly/Internal/Data/Sink.hs+245 src/Streamly/Internal/Data/Sink/Types.hs+24 src/Streamly/Internal/Data/SmallArray.hs+35−42 src/Streamly/Internal/Data/SmallArray/Type.hs → src/Streamly/Internal/Data/SmallArray/Types.hs+76−9 src/Streamly/Internal/Data/Stream/Ahead.hs+119−149 src/Streamly/Internal/Data/Stream/Async.hs+214−268 src/Streamly/Internal/Data/Stream/IsStream/Combinators.hs → src/Streamly/Internal/Data/Stream/Combinators.hs+7−11 src/Streamly/Internal/Data/Stream/Common.hs−105 src/Streamly/Internal/Data/Stream/Concurrent.hs−903 src/Streamly/Internal/Data/Stream/Concurrent/Channel.hs−109 src/Streamly/Internal/Data/Stream/Concurrent/Channel/Append.hs−1046 src/Streamly/Internal/Data/Stream/Concurrent/Channel/Consumer.hs−127 src/Streamly/Internal/Data/Stream/Concurrent/Channel/Dispatcher.hs−417 src/Streamly/Internal/Data/Stream/Concurrent/Channel/Interleave.hs−252 src/Streamly/Internal/Data/Stream/Concurrent/Channel/Operations.hs−294 src/Streamly/Internal/Data/Stream/Concurrent/Channel/Type.hs−172 src/Streamly/Internal/Data/Stream/IsStream/Enumeration.hs → src/Streamly/Internal/Data/Stream/Enumeration.hs+48−96 src/Streamly/Internal/Data/Stream/Instances.hs+27−22 src/Streamly/Internal/Data/Stream/IsStream.hs+5418−44 src/Streamly/Internal/Data/Stream/IsStream/Common.hs−747 src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs−1035 src/Streamly/Internal/Data/Stream/IsStream/Exception.hs−284 src/Streamly/Internal/Data/Stream/IsStream/Expand.hs−1158 src/Streamly/Internal/Data/Stream/IsStream/Generate.hs−640 src/Streamly/Internal/Data/Stream/IsStream/Lift.hs−150 src/Streamly/Internal/Data/Stream/IsStream/Reduce.hs−1627 src/Streamly/Internal/Data/Stream/IsStream/Top.hs−749 src/Streamly/Internal/Data/Stream/IsStream/Transform.hs−1595 src/Streamly/Internal/Data/Stream/IsStream/Type.hs−783 src/Streamly/Internal/Data/Stream/Lifted.hs−335 src/Streamly/Internal/Data/Stream/MkType.hs−641 src/Streamly/Internal/Data/Stream/Parallel.hs+292−254 src/Streamly/Internal/Data/Stream/Prelude.hs+352−8 src/Streamly/Internal/Data/Stream/SVar.hs+233−8 src/Streamly/Internal/Data/Stream/SVar/Eliminate.hs−405 src/Streamly/Internal/Data/Stream/SVar/Generate.hs−294 src/Streamly/Internal/Data/Stream/Serial.hs+247−197 src/Streamly/Internal/Data/Stream/StreamD.hs+4951 src/Streamly/Internal/Data/Stream/StreamD/Type.hs+706 src/Streamly/Internal/Data/Stream/StreamDK.hs+156 core/src/Streamly/Internal/Data/StreamK/Alt.hs → src/Streamly/Internal/Data/Stream/StreamDK/Type.hs+4−144 src/Streamly/Internal/Data/Stream/StreamK.hs+1151 src/Streamly/Internal/Data/Stream/StreamK/Type.hs+1098 src/Streamly/Internal/Data/Stream/Time.hs−950 src/Streamly/Internal/Data/Stream/Zip.hs+178−82 src/Streamly/Internal/Data/Stream/ZipAsync.hs−134 src/Streamly/Internal/Data/Time.hs+74 core/src/Streamly/Internal/Data/Time/Clock/Type.hsc → src/Streamly/Internal/Data/Time/Clock.hsc+4−4 core/src/Streamly/Internal/Data/Time/Clock/Darwin.c → src/Streamly/Internal/Data/Time/Darwin.c core/src/Streamly/Internal/Data/Time/TimeSpec.hsc → src/Streamly/Internal/Data/Time/TimeSpec.hsc+5−4 core/src/Streamly/Internal/Data/Time/Units.hs → src/Streamly/Internal/Data/Time/Units.hs+3−11 core/src/Streamly/Internal/Data/Time/Clock/Windows.c → src/Streamly/Internal/Data/Time/Windows.c core/src/Streamly/Internal/Data/Time/Clock/config-clock.h → src/Streamly/Internal/Data/Time/config-clock.h core/src/Streamly/Internal/Data/Tuple/Strict.hs → src/Streamly/Internal/Data/Tuple/Strict.hs−11 src/Streamly/Internal/Data/Unfold.hs+1472 src/Streamly/Internal/Data/Unfold/Exception.hs−214 src/Streamly/Internal/Data/Unfold/Prelude.hs−17 src/Streamly/Internal/Data/Unfold/SVar.hs−161 src/Streamly/Internal/Data/Unfold/Types.hs+27 core/src/Streamly/Internal/FileSystem/Dir.hs → src/Streamly/Internal/FileSystem/Dir.hs+89−196 src/Streamly/Internal/FileSystem/Event.hs−245 src/Streamly/Internal/FileSystem/Event/Darwin.hs+198−254 src/Streamly/Internal/FileSystem/Event/Linux.hs+270−342 src/Streamly/Internal/FileSystem/Event/Windows.hs+167−249 core/src/Streamly/Internal/FileSystem/File.hs → src/Streamly/Internal/FileSystem/File.hs+159−257 core/src/Streamly/Internal/FileSystem/Handle.hs → src/Streamly/Internal/FileSystem/Handle.hs+290−331 src/Streamly/Internal/Foreign/Malloc.hs+49 src/Streamly/Internal/Memory/ArrayStream.hs+236 src/Streamly/Internal/Network/Inet/TCP.hs+150−190 src/Streamly/Internal/Network/Socket.hs+288−229 src/Streamly/Internal/System/IOVec.hs−132 src/Streamly/Internal/Unicode/Array/Char.hs+85 src/Streamly/Internal/Unicode/Array/Prim/Pinned.hs+85 src/Streamly/Internal/Unicode/Char.hs+4−267 src/Streamly/Internal/Unicode/Stream.hs+912 src/Streamly/Internal/Unicode/Utf8.hs−73 src/Streamly/Memory/Array.hs+74 src/Streamly/Memory/Ring.hs+250 src/Streamly/Network/Inet/TCP.hs+6−49 src/Streamly/Network/Socket.hs+56−94 src/Streamly/Prelude.hs+382−562 src/Streamly/Tutorial.hs+1730 core/src/Streamly/Unicode/Stream.hs → src/Streamly/Unicode/Stream.hs+18−32 src/assert.hs−6 src/config.h.in+36 src/inline.hs+2−2 stack.yaml+10−10 streamly.cabal+330−349 targets/Targets.hs−213 targets/cabal.project−1 targets/default.nix−163 targets/streamly-targets.cabal−12 test/README.md+80−1 test/Streamly/Test/Common/Array.hs+246 test/Streamly/Test/Data/Array.hs+3−268 test/Streamly/Test/Data/Array/Common.hs−101 test/Streamly/Test/Data/Array/CommonImports.hs−13 test/Streamly/Test/Data/Array/Generic.hs−65 test/Streamly/Test/Data/Array/Prim.hs+12 test/Streamly/Test/Data/Array/Prim/Pinned.hs+12 test/Streamly/Test/Data/Array/Storable/Foreign.hs+12 test/Streamly/Test/Data/Array/Stream.hs−113 test/Streamly/Test/Data/Fold.hs+142−497 test/Streamly/Test/Data/Fold/Window.hs−67 test/Streamly/Test/Data/List.hs+28−29 test/Streamly/Test/Data/MutArray.hs−152 test/Streamly/Test/Data/Parser.hs+210−924 test/Streamly/Test/Data/ParserK.hs → test/Streamly/Test/Data/Parser/ParserD.hs+121−264 test/Streamly/Test/Data/Ring/Unboxed.hs−53 test/Streamly/Test/Data/Serialize.hs−306 test/Streamly/Test/Data/Serialize/CompatV0.hs−46 test/Streamly/Test/Data/Serialize/CompatV1.hs−48 test/Streamly/Test/Data/Serialize/TH.hs−82 test/Streamly/Test/Data/SmallArray.hs+3−20 test/Streamly/Test/Data/Stream.hs−33 test/Streamly/Test/Data/Stream/Concurrent.hs−363 test/Streamly/Test/Data/Unbox.hs−347 test/Streamly/Test/Data/Unbox/TH.hs−146 test/Streamly/Test/Data/Unfold.hs+93−345 test/Streamly/Test/FileSystem/Event.hs+386−15 test/Streamly/Test/FileSystem/Event/Common.hs−422 test/Streamly/Test/FileSystem/Event/Darwin.hs−86 test/Streamly/Test/FileSystem/Event/Linux.hs−163 test/Streamly/Test/FileSystem/Event/Windows.hs−51 test/Streamly/Test/FileSystem/Handle.hs+52−115 test/Streamly/Test/Network/Inet/TCP.hs−144 test/Streamly/Test/Network/Socket.hs−160 test/Streamly/Test/Prelude.hs+38−40 test/Streamly/Test/Prelude/Ahead.hs+15−17 test/Streamly/Test/Prelude/Async.hs+14−51 test/Streamly/Test/Prelude/Concurrent.hs+52−58 test/Streamly/Test/Prelude/Fold.hs+13−28 test/Streamly/Test/Prelude/Parallel.hs+19−21 test/Streamly/Test/Prelude/Rate.hs+39−47 test/Streamly/Test/Prelude/Serial.hs+139−227 test/Streamly/Test/Prelude/Top.hs−224 test/Streamly/Test/Prelude/WAsync.hs+22−75 test/Streamly/Test/Prelude/WSerial.hs+18−42 test/Streamly/Test/Prelude/ZipAsync.hs+5−10 test/Streamly/Test/Prelude/ZipSerial.hs+10−12 test/Streamly/Test/Serialize/Serializable.hs−237 test/Streamly/Test/Unicode/Char.hs−133 test/Streamly/Test/Unicode/Parser.hs−231 test/Streamly/Test/Unicode/Stream.hs+41−99 test/Streamly/Test/Unicode/extra/NormalizationTest.txt−9 test/Streamly/Test/Unicode/ucd/NormalizationTest.txt−18908 test/lib/Streamly/Test/Common.hs+3−8 test/lib/Streamly/Test/Prelude/Common.hs+110−123 test/streamly-tests.cabal+89−344 test/test-runner/Main.hs−33 test/test-runner/cabal.project−4 test/test-runner/default.nix−164 test/test-runner/test-runner.cabal−41
.circleci/config.yml+258−87
@@ -1,7 +1,7 @@
11version: 2.1
22
33#-----------------------------------------------------------------------------
4−# packcheck-0.7.0
4+# packcheck-0.4.2
55# Packcheck global environment variables
66#-----------------------------------------------------------------------------
77
@@ -11,8 +11,6 @@ env: &env
1111 # Common options
1212 # ------------------------------------------------------------------------
1313 # GHC_OPTIONS: "-Werror"
14− # For updating see: https://downloads.haskell.org/~ghcup/
15− GHCUP_VERSION: 0.1.20.0
1614 CABAL_REINIT_CONFIG: "y"
1715 LC_ALL: "C.UTF-8"
1816
@@ -24,6 +22,7 @@ env: &env
2422 # DISABLE_DOCS: "y"
2523 # DISABLE_SDIST_BUILD: "y"
2624 # DISABLE_DIST_CHECKS: "y"
25+ ENABLE_INSTALL: "y"
2726
2827 # ------------------------------------------------------------------------
2928 # stack options
@@ -39,12 +38,14 @@ env: &env
3938 # cabal options
4039 # ------------------------------------------------------------------------
4140 CABAL_CHECK_RELAX: "y"
42− CABAL_BUILD_OPTIONS: "-j1 --flag limit-build-mem"
41+ CABAL_NO_SANDBOX: "y"
42+ CABAL_HACKAGE_MIRROR: "hackage.haskell.org:http://hackage.fpcomplete.com"
4343
4444 # ------------------------------------------------------------------------
4545 # Where to find the required tools
4646 # ------------------------------------------------------------------------
47− PATH: /sbin:/usr/sbin:/bin:/usr/bin
47+ PATH: /opt/ghc/bin:/opt/ghcjs/bin:/sbin:/usr/sbin:/bin:/usr/bin
48+ TOOLS_DIR: /opt
4849
4950 # ------------------------------------------------------------------------
5051 # Location of packcheck.sh (the shell script invoked to perform CI tests ).
@@ -56,16 +57,16 @@ env: &env
5657 PACKCHECK: "./packcheck.sh"
5758 # If you have not committed packcheck.sh in your repo at PACKCHECK
5859 # then it is automatically pulled from this URL.
59− PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
60− PACKCHECK_GITHUB_COMMIT: "f6cfd7b7a33b4bf6fd63cce6a3fb3d26f5031403"
60+ PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/harendra-kumar/packcheck"
61+ PACKCHECK_GITHUB_COMMIT: "563702bd02c41343dcd3dfcfef0845ca428a9240"
6162
6263executors:
6364 amd64-executor:
6465 docker:
65− - image: ubuntu:latest
66+ - image: ubuntu:xenial
6667 x86-executor:
6768 docker:
68− - image: i386/ubuntu:focal
69+ - image: i386/ubuntu:eoan
6970
7071#-----------------------------------------------------------------------------
7172# Common utility stuff, not to be modified usually
@@ -77,142 +78,312 @@ preinstall: &preinstall
7778 # required for https/cache save and restore
7879 apt-get install -y ca-certificates
7980
80− # Alternative way of installing ghc and cabal, directly from
81− # haskell.org instead of using ghcup. NOTE: this is for Debian
82− # only and is debian release specific.
81+ # required to (re)generate the configure script
82+ apt-get install -y autoconf
83+
84+ # For ghc and cabal-install packages from hvr's ppa
8385 # gnupg is required for apt-key to work
84− #apt-get install -y gnupg
85− #apt-key adv --keyserver keyserver.ubuntu.com --recv-keys BA3CBA3FFE22B574
86− #echo "deb http://downloads.haskell.org/debian buster main" >> /etc/apt/sources.list
87− #apt-get update
86+ apt-get install -y gnupg
87+ apt-get install -y apt-transport-https
88+ apt-key adv --keyserver keyserver.ubuntu.com --recv-keys BA3CBA3FFE22B574
89+ apt-get install -y software-properties-common
90+ add-apt-repository -y ppa:hvr/ghc
91+ # echo "deb http://downloads.haskell.org/debian stretch main" >> /etc/apt/sources.list
92+ echo "deb-src http://ppa.launchpad.net/hvr/ghc/ubuntu xenial main" >> /etc/apt/sources.list
93+ apt-get update
94+
95+ # required for packcheck
96+ apt-get install -y curl
8897
8998 # required for outbound https for stack and for stack setup
9099 apt-get install -y netbase xz-utils make
91− apt-get install -y zlib1g-dev
92100
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−
100− # libgmp required by ghc for linking
101− apt-get install -y libgmp-dev
102− apt-get install -y libtinfo-dev
103−
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
108− apt-get install -y curl
101+ # If a custom stack-yaml is specified, replace the default with that
102+ if test -e "$STACK_YAML"; then rm -f stack.yaml && ln -sv $STACK_YAML stack.yaml; else true; fi
103+ unset STACK_YAML
109104
110105 # Get packcheck if needed
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
117− PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
118− curl --fail -sL -o "$PACKCHECK" $PACKCHECK_URL || exit 1
119− chmod +x $PACKCHECK
120− elif test ! -x "$PACKCHECK"
121− then
122− chmod +x $PACKCHECK
123− fi
106+ CURL=$(which curl)
107+ PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
108+ if test ! -e "$PACKCHECK"; then $CURL -sL -o "$PACKCHECK" $PACKCHECK_URL; fi;
109+ chmod +x $PACKCHECK
124110
125111restore: &restore
126112 # Needs to happen after installing ca-certificates
127113 restore_cache:
128− keys:
129− - v1-{{ .Environment.CIRCLE_JOB }}-{{ .Branch }}
130− # Fallback to master branch's cache.
131− - v1-{{ .Environment.CIRCLE_JOB }}-master
132− # Fallback to any branch's cache.
133− - v1-{{ .Environment.CIRCLE_JOB }}-
114+ key: v1-{{ .Environment.CIRCLE_JOB }}-{{ .Branch }}
134115
135116save: &save
136117 save_cache:
137118 key: v1-{{ .Environment.CIRCLE_JOB }}-{{ .Branch }}
138119 paths:
139− - ~/.local
140120 - ~/.cabal
121+ - ~/.ghc
122+ - ~/.local
141123 - ~/.stack
142− - ~/.ghcup
143124
144125#-----------------------------------------------------------------------------
145126# Build matrix
146127#-----------------------------------------------------------------------------
147128
148129jobs:
130+ stack-ghc-8_8:
131+ <<: *env
132+ executor: amd64-executor
133+ steps:
134+ - checkout
135+ - *preinstall
136+ - *restore
137+ - run:
138+ name: GHC 8.8 + stack lts-16.12
139+ environment:
140+ BUILD: "stack"
141+ RESOLVER: "lts-16.12"
142+ SDIST_OPTIONS: "--ignore-check"
143+ STACK_BUILD_OPTIONS: "--flag streamly-benchmarks:-opt"
144+ command: |
145+ apt-get build-dep -y ghc-8.8.4
146+ apt-get install -y cabal-install-3.2
147+ bash -c "$PACKCHECK $BUILD"
148+ - *save
149149 cabal-ghc-8_6_5:
150150 <<: *env
151151 executor: amd64-executor
152152 steps:
153153 - checkout
154+ - *preinstall
154155 - *restore
156+ - run: |
157+ apt-get install -y ghc-8.6.3
158+ apt-get install -y cabal-install-2.4
159+ bash -c "$PACKCHECK cabal-v2"
160+ - *save
161+ cabal-ghc-8_4_4:
162+ <<: *env
163+ executor: x86-executor
164+ steps:
165+ - checkout
155166 - *preinstall
167+ - *restore
168+ - run:
169+ name: GHC 8.4.4 + x86 + debug
170+ environment:
171+ BUILD: "cabal-v2"
172+ GHCVER: "8.4.4"
173+ CABAL_BUILD_OPTIONS: "--flag debug"
174+ command: |
175+ apt-get install -y ghc-8.4.4
176+ apt-get install -y cabal-install-3.2
177+ bash -c "$PACKCHECK $BUILD"
178+ - *save
179+ cabal-ghc-8_2_2:
180+ <<: *env
181+ executor: amd64-executor
182+ steps:
183+ - checkout
184+ - *preinstall
185+ - *restore
156186 - run:
157187 environment:
158− GHCVER: "8.6.5"
159− CABAL_VERSION: "3.6.2.0"
160− CABAL_PROJECT: "cabal.project"
188+ BUILD: "cabal-v2"
189+ DISABLE_TEST: "yes"
190+ DISABLE_BENCH: "yes"
191+ DISABLE_DOCS: "yes"
161192 DISABLE_SDIST_BUILD: "yes"
162− CABAL_BUILD_OPTIONS: "--flag debug --flag -opt"
193+ DISABLE_DIST_CHECKS: "yes"
163194 command: |
164− bash -c "$PACKCHECK cabal"
195+ apt-get install -y ghc-8.2.2
196+ apt-get install -y cabal-install-3.2
197+ apt-get install libtinfo-dev
198+ bash -c "$PACKCHECK $BUILD"
165199 - *save
166− cabal-ghc-9_8_1-docspec:
200+ cabal-ghc-8_0_2:
167201 <<: *env
168202 executor: amd64-executor
169203 steps:
170204 - checkout
171− - *restore
172205 - *preinstall
206+ - *restore
173207 - run:
174208 environment:
175− GHCVER: "9.8.1"
176− CABAL_VERSION: "3.10.1.0"
177− CABAL_PROJECT: "cabal.project.doctest"
178− DISABLE_SDIST_BUILD: "y"
179− DISABLE_TEST: "y"
180− DISABLE_BENCH: "y"
181− DISABLE_DOCS: "y"
182− ENABLE_DOCSPEC: "y"
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"
209+ BUILD: "cabal-v2"
210+ DISABLE_TEST: "yes"
211+ DISABLE_BENCH: "yes"
212+ DISABLE_DOCS: "yes"
213+ DISABLE_SDIST_BUILD: "yes"
214+ DISABLE_DIST_CHECKS: "yes"
185215 command: |
186− bash -c "$PACKCHECK cabal"
216+ apt-get install -y ghc-8.0.2
217+ apt-get install -y cabal-install-3.2
218+ bash -c "$PACKCHECK $BUILD"
187219 - *save
188− hlint-trailing-spaces:
220+ cabal-ghc-7_10_3:
189221 <<: *env
190222 executor: amd64-executor
191223 steps:
192224 - checkout
225+ - *preinstall
193226 - *restore
227+ - run: |
228+ apt-get install -y ghc-7.10.3
229+ apt-get install -y cabal-install-2.4
230+ bash -c "$PACKCHECK cabal-v2"
231+ - *save
232+ stack-ghc-8_4:
233+ <<: *env
234+ executor: amd64-executor
235+ steps:
236+ - checkout
194237 - *preinstall
238+ - *restore
239+ - run: |
240+ bash -c "$PACKCHECK stack RESOLVER=lts-12"
241+ - *save
242+ stack-ghc-8_2:
243+ <<: *env
244+ executor: amd64-executor
245+ steps:
246+ - checkout
247+ - *preinstall
248+ - *restore
249+ - run: |
250+ bash -c "$PACKCHECK stack RESOLVER=lts-11"
251+ - *save
252+ cabal-ghcjs-8_4:
253+ <<: *env
254+ executor: amd64-executor
255+ steps:
256+ - checkout
257+ - *preinstall
258+ - *restore
195259 - run:
196− name: hlint and trailing spaces
260+ name: GHCJS 8.4+no-test+no-docs
197261 environment:
262+ BUILD: cabal-v2
263+ ENABLE_GHCJS: "yes"
264+ DISABLE_TEST: "yes"
265+ ENABLE_INSTALL: ""
266+ DISABLE_DOCS: "yes"
198267 DISABLE_SDIST_BUILD: "yes"
199− HLINT_VERSION: 3.6.1
200− HLINT_OPTIONS: lint
201− HLINT_TARGETS: core/src src test benchmark
202268 command: |
203− bash -c "$PACKCHECK hlint" || exit 1
204− echo "Checking trailing spaces..."
205− count=$(find . -name "*.hs" -exec grep -H '\ $' {} \; | tee /dev/tty | wc -l)
206− exit $count
269+ add-apt-repository -y ppa:hvr/ghcjs
270+ add-apt-repository -y 'deb https://deb.nodesource.com/node_11.x xenial main'
271+ curl -sSL https://deb.nodesource.com/gpgkey/nodesource.gpg.key | apt-key add -
272+ apt-get update
273+ apt-get install -y cabal-install-3.2
274+ apt-get install -y nodejs
275+ apt-get install -y ghcjs-8.4
276+ bash -c "$PACKCHECK $BUILD"
277+ - *save
278+ coveralls-ghc-8_2_2:
279+ <<: *env
280+ executor: amd64-executor
281+ steps:
282+ - checkout
283+ - *preinstall
284+ - *restore
285+ - run:
286+ environment:
287+ BUILD: cabal
288+ COVERALLS_OPTIONS: "--repo-token=\"$REPO_TOKEN\" --coverage-mode=StrictlyFullLines --exclude-dir=test test"
289+ GHC_OPTIONS: "-DCOVERAGE_BUILD"
290+ command: |
291+ apt-get install -y ghc-8.2.2
292+ apt-get install -y cabal-install-2.4
293+ # required by hpc-coveralls
294+ apt-get install -y libcurl4-gnutls-dev
295+ apt-get install -y git
296+ apt-get install libtinfo-dev
297+ bash -c "$PACKCHECK cabal-v1"
298+ - *save
299+ coveralls-ghc-8_8_3:
300+ <<: *env
301+ executor: amd64-executor
302+ steps:
303+ - checkout
304+ - *preinstall
305+ - *restore
306+ - run:
307+ environment:
308+ BUILD: cabal-v2
309+ COVERALLS_OPTIONS: "--repo-token=\"$REPO_TOKEN\" --coverage-mode=StrictlyFullLines --exclude-dir=test"
310+ CABAL_PROJECT: "cabal.project.coverage"
311+ CABAL_BUILD_TARGETS: ""
312+ command: |
313+ apt-get install -y ghc-8.8.3
314+ apt-get install -y cabal-install-3.0
315+ # required by hpc-coveralls
316+ apt-get install -y libcurl4-gnutls-dev
317+ apt-get install -y git
318+ apt-get install libtinfo-dev
319+ bash -c "$PACKCHECK cabal-v2"
320+ no_output_timeout: 25m
321+ - *save
322+ coveralls-ghc-8_10_2:
323+ <<: *env
324+ executor: amd64-executor
325+ steps:
326+ - checkout
327+ - *preinstall
328+ - *restore
329+ - run:
330+ name: Build and test with inspection, coverage, Werror
331+ command: |
332+ apt-get install -y ghc-8.10.2
333+ apt-get install -y cabal-install-3.2
334+ # required by hpc-coveralls
335+ apt-get install -y libcurl4-gnutls-dev
336+ apt-get install -y git
337+ apt-get install libtinfo-dev
338+ # Run tests with coverage
339+ cabal update
340+ cabal user-config update -a "jobs: 2"
341+ bin/test.sh --coverage --raw
342+ # Upload results to coveralls.io
343+ PATH=$HOME/.cabal/bin:$PATH
344+ export PATH
345+ which hpc-coveralls 2>/dev/null || cabal install --project-file cabal.project.hpc-coveralls hpc-coveralls
346+ hpc-coveralls --repo-token="$REPO_TOKEN" --coverage-mode=StrictlyFullLines
347+ no_output_timeout: 25m
348+ - *save
349+ hlint-src:
350+ <<: *env
351+ executor: amd64-executor
352+ steps:
353+ - checkout
354+ - *preinstall
355+ - *restore
356+ - run:
357+ name: Hlint src
358+ environment:
359+ BUILD: cabal-v2
360+ HLINT_OPTIONS: lint --cpp-include=src --cpp-include=test
361+ HLINT_TARGETS: src test benchmark
362+ command: |
363+ bash -c "$PACKCHECK $BUILD"
207364 - *save
208365
209366workflows:
210367 version: 2
211368 build:
212369 jobs:
213− #- cabal-ghc-8_6_5:
214− # name: 8.6.5-debug-unoptimized
215− - cabal-ghc-9_8_1-docspec:
216− name: ghc-9.8.1-docspec
217− - hlint-trailing-spaces:
218− name: hlint and trailing spaces
370+ #- cabal-ghc-8.6.5
371+ #- cabal-ghc-8_4_4:
372+ # name: GHC 8.4.4 + x86 + debug
373+ - cabal-ghc-8_2_2:
374+ name: GHC 8.2.2 + no-test + no-bench + no-docs
375+ - cabal-ghc-8_0_2:
376+ name: GHC 8.0.2 + no-test + no-bench + no-docs
377+ #- cabal-ghc-7.10.3
378+ - cabal-ghcjs-8_4:
379+ name: GHCJS 8.4 + no-test + no-docs
380+ - stack-ghc-8_8:
381+ name: GHC 8.8 + stack lts-16.12
382+ #- stack-ghc-8.4
383+ #- stack-ghc-8.2
384+ #- coveralls-ghc-8.2.2
385+ #- coveralls-ghc-8.8.3
386+ - coveralls-ghc-8_10_2:
387+ name: GHC 8.10.2 + inspection + coverage + Werror
388+ - hlint-src:
389+ name: Hlint src
.ghcideleted−1
@@ -1 +0,0 @@
1−:set -fobject-code
.github/workflows/haskell.yml+56−216
@@ -8,251 +8,91 @@ on:
88
99jobs:
1010 build:
11− name: GHC ${{matrix.name}}
11+ name: GHC ${{ matrix.name }}
1212 env:
13− # packcheck environment variables
13+ CABAL_REINIT_CONFIG: y
1414 LC_ALL: C.UTF-8
15− BUILD: ${{ matrix.build }}
16− # For updating see: https://downloads.haskell.org/~ghcup/
17− GHCUP_VERSION: 0.1.20.0
18− DOCSPEC_URL: https://github.com/phadej/cabal-extras/releases/download/cabal-docspec-0.0.0.20210111/cabal-docspec-0.0.0.20210111.xz
19− DOCSPEC_OPTIONS: "--timeout 60 --check-properties --property-variables xs"
20− GHCUP_GHC_OPTIONS: ${{ matrix.ghcup_ghc_options }}
21− GHCVER: ${{ matrix.ghc_version }}
22− CABALVER: ${{ matrix.cabal_version }}
23− DISABLE_DOCS: ${{ matrix.disable_docs }}
24− ENABLE_DOCSPEC: ${{ matrix.enable_docspec }}
25− DISABLE_TEST: ${{ matrix.disable_test }}
26− DISABLE_BENCH: ${{ matrix.disable_bench }}
27− DISABLE_DIST_CHECKS: ${{ matrix.disable_dist_checks }}
28− SDIST_OPTIONS: ${{ matrix.sdist_options }}
29− DISABLE_SDIST_BUILD: ${{ matrix.disable_sdist_build }}
3015
31− # Cabal options
32− CABAL_REINIT_CONFIG: y
33− # Github has machines with 2 CPUS and 6GB memory so the cabal jobs
34− # default (ncpus) is good, this can be checked from the packcheck
35− # output in case it changes.
36− CABAL_BUILD_OPTIONS: ${{ matrix.cabal_build_options }} --flag limit-build-mem
37− CABAL_BUILD_TARGETS: ${{ matrix.cabal_build_targets }}
38− CABAL_PROJECT: ${{ matrix.cabal_project }}
39− CABAL_CHECK_RELAX: y
16+ ENABLE_INSTALL: "n"
4017
41− # Stack options
4218 STACK_UPGRADE: "y"
43− RESOLVER: ${{ matrix.resolver }}
44− STACK_YAML: ${{ matrix.stack_yaml }}
45− STACK_BUILD_OPTIONS: ${{ matrix.stack_build_options }}
46−
47− # packcheck location and revision
48− PACKCHECK: "./packcheck.sh"
49− PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
50− PACKCHECK_GITHUB_COMMIT: "v0.7.0"
5119
52− # Pull token from "secrets" setting of the github repo
53− COVERALLS_TOKEN: ${{ secrets.COVERALLS_TOKEN }}
54− COVERAGE: ${{ matrix.coverage }}
20+ CABAL_CHECK_RELAX: y
21+ CABAL_NO_SANDBOX: y
22+ CABAL_HACKAGE_MIRROR: hackage.haskell.org:http://hackage.fpcomplete.com
5523
56− # hlint
57− HLINT_VERSION: 3.6.1
58− HLINT_OPTIONS: "lint"
59− HLINT_TARGETS: "core/src src test benchmark"
24+ PACKCHECK_LOCAL_PATH: "./packcheck.sh"
25+ PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/harendra-kumar/packcheck"
26+ PACKCHECK_GITHUB_COMMIT: "563702bd02c41343dcd3dfcfef0845ca428a9240"
6027
61− # Subdir
62− SUBDIR: ${{ matrix.subdir }}
28+ BUILD: ${{ matrix.build }}
29+ GHCVER: ${{ matrix.ghc_version }}
30+ CABAL_BUILD_OPTIONS: ${{ matrix.cabal_build_options }}
31+ CABAL_PROJECT: ${{ matrix.cabal_project }}
32+ DISABLE_DOCS: ${{ matrix.disable_docs }}
33+ DISABLE_SDIST_BUILD: ${{ matrix.disable_sdist_build }}
6334
6435 runs-on: ${{ matrix.runner }}
65− continue-on-error: ${{ matrix.ignore_error }}
6636 strategy:
67− fail-fast: true
37+ fail-fast: false
6838 matrix:
69− # The order is important to optimize fail-fast.
70− name:
71− - 9.8.1-Werror
72− # - 9.8.1-docspec
73− # - 8.10.7-coverage
74−
75− # Note: if cabal.project is not specified benchmarks and tests won't
76− # run. But we need at least one test where we test without
77− # cabal.project because that is how hackage would build it.
39+ name: [8.10.2+macOS, 8.8.3+inspection+fusion-plugin+Werror, 8.6.5+fusion-plugin, 8.6.5+streamk, 8.4.4+debug]
40+ cabal_version: ["3.2"]
7841 include:
79− - name: 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"
91− runner: ubuntu-latest
92− build: cabal
93− cabal_version: 3.10.2.0
94− cabal_project: cabal.project.ghc-head
42+ - name: 8.10.2+macOS
43+ ghc_version: 8.10.2
44+ build: cabal-v2
9545 disable_sdist_build: "y"
96− ignore_error: true
97− # Note: use linux for warning build for convenient dev testing
98− - name: 9.8.1-Werror
99− ghc_version: 9.8.1
100− runner: ubuntu-latest
101− build: cabal
102− cabal_version: 3.10.1.0
103− disable_sdist_build: "y"
104− cabal_project: cabal.project.Werror
105− ignore_error: false
106− #- name: 9.8.1-docspec
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
123− disable_sdist_build: "y"
124− cabal_project: cabal.project
125− cabal_build_options: "--flag fusion-plugin --flag inspection"
126− ignore_error: false
127− - name: 9.6.3-macos
128− ghc_version: 9.6.3
12946 runner: macos-latest
130− build: cabal
131− cabal_version: 3.10.1.0
132− disable_sdist_build: "y"
133− cabal_project: cabal.project
134− ignore_error: false
135− - name: 9.4.7
136− ghc_version: 9.4.7
137− runner: ubuntu-latest
138− build: cabal
139− cabal_version: 3.8.1.0
140− disable_sdist_build: "y"
141− cabal_project: cabal.project
142− ignore_error: false
143− - name: 9.2.8
144− ghc_version: 9.2.8
145− runner: ubuntu-latest
146− build: cabal
147− cabal_project: cabal.project
148− cabal_version: 3.6.2.0
149− disable_sdist_build: "y"
150− ignore_error: false
151− - name: 9.0.2-streamly-sdist
152− ghc_version: 9.0.2
47+ - name: 8.8.3+inspection+fusion-plugin+Werror
48+ ghc_version: 8.8.3
49+ build: cabal-v2
50+ cabal_project: cabal.project.ci
15351 runner: ubuntu-latest
154− build: cabal
155− cabal_version: 3.6.2.0
156− cabal_project: cabal.project.streamly
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
165− - name: 8.10.7-streamly-sdist-stack
166− runner: ubuntu-latest
167− build: stack
168− resolver: lts-20.13
169− stack_yaml: stack.yaml
170− sdist_options: "--ignore-check"
171− stack_build_options: "--flag streamly-benchmarks:-opt"
172− cabal_version: 3.6.2.0
173− ignore_error: false
174− # - name: 8.10.7-coverage
175− # ghc_version: 8.10.7
176− # runner: ubuntu-latest
177− # coverage: "y"
178− # cabal_version: 3.6.2.0
179− # ignore_error: false
180− - name: 8.8.4
181− ghc_version: 8.8.4
52+ - name: 8.6.5+streamk
53+ ghc_version: 8.6.5
54+ build: cabal-v2
55+ cabal_build_options: "--flag streamk --flag -opt"
18256 runner: ubuntu-latest
183− build: cabal
184− cabal_version: 3.6.2.0
185− cabal_project: cabal.project
186− disable_sdist_build: "y"
187− ignore_error: false
188− - name: 8.6.5-debug-unoptimized
57+ - name: 8.6.5+fusion-plugin
18958 ghc_version: 8.6.5
59+ build: cabal-v2
60+ cabal_build_options: "--flag fusion-plugin"
61+ # haddock generation does not work with 8.6.5+fusion-plugin
62+ disable_docs: "y"
19063 runner: ubuntu-latest
191− build: cabal
192− cabal_version: 3.6.2.0
193− cabal_project: cabal.project
64+ - name: 8.4.4+debug
65+ ghc_version: 8.4.4
66+ build: cabal-v2
19467 cabal_build_options: "--flag debug --flag -opt"
195− disable_sdist_build: "y"
196− ignore_error: false
197− - name: hlint
198− build: hlint
19968 runner: ubuntu-latest
200− ignore_error: true
20169
20270 steps:
20371 - uses: actions/checkout@v2
20472
73+ - uses: haskell/actions/setup@v1
74+ with:
75+ ghc-version: ${{ matrix.ghc_version }}
76+ cabal-version: ${{ matrix.cabal_version }}
77+
20578 - uses: actions/cache@v1
206− name: Cache common directories
79+ name: Cache ~/.cabal
20780 with:
208− path: |
209− ~/.local
210− ~/.cabal
211− ~/.stack
212− ~/.ghcup
213− # Bump the key version to clear the cache
214− key: ${{ runner.os }}-${{ matrix.ghc_version }}-cabal-v2
81+ path: ~/.cabal
82+ key: ${{ runner.os }}-${{ matrix.ghc_version }}-cabal
21583
21684 - name: Download packcheck
21785 run: |
218− if test ! -e "$PACKCHECK"
219− then
220− if test -z "$PACKCHECK_GITHUB_COMMIT"
221− then
222− die "PACKCHECK_GITHUB_COMMIT is not specified."
223− fi
224− PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
225− curl --fail -sL -o "$PACKCHECK" $PACKCHECK_URL || exit 1
226− chmod +x $PACKCHECK
227− elif test ! -x "$PACKCHECK"
228− then
229− chmod +x $PACKCHECK
230− fi
86+ # If a custom stack-yaml is specified, replace the default with that
87+ if test -e "$STACK_YAML"; then rm -f stack.yaml && ln -sv $STACK_YAML stack.yaml; else true; fi
88+ unset STACK_YAML
89+
90+ # Get packcheck if needed
91+ CURL=$(which curl)
92+ PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
93+ if test ! -e "$PACKCHECK_LOCAL_PATH"; then $CURL -sL -o "$PACKCHECK_LOCAL_PATH" $PACKCHECK_URL; fi;
94+ chmod +x $PACKCHECK_LOCAL_PATH
23195
232− - name: Run tests
96+ - name: Run packcheck
23397 run: |
234− if test -n "$COVERAGE"
235− then
236− # Run tests with coverage
237− cabal update
238− # Build hpc-coveralls if needed
239− sudo apt-get install -y libcurl4-gnutls-dev
240− export PATH=$HOME/.cabal/bin:$PATH
241− which hpc-coveralls 2>/dev/null || cabal install --project-file cabal.project.hpc-coveralls hpc-coveralls
242− # Run tests and upload results to coveralls.io
243− bin/test.sh --coverage --raw
244− # XXX Uncomment this and fix it properly later
245− # hpc-coveralls --repo-token="$COVERALLS_TOKEN" --coverage-mode=StrictlyFullLines
246− else
247− # /usr/local/opt/curl/bin for macOS
248− export PATH=$HOME/.local/bin:$HOME/.ghcup/bin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/local/opt/curl/bin
249− if test -n "$SUBDIR"
250− then
251− mv "$PACKCHECK" "$SUBDIR/packcheck.sh"
252− # This is required as dist-newstyle will be created on the top level
253− # directory as it is considered the working dir.
254− rm cabal.project
255− cd "$SUBDIR"
256− fi
257− bash -c "$PACKCHECK $BUILD"
258− fi
98+ bash -c "$PACKCHECK_LOCAL_PATH $BUILD"
.github/workflows/packdiff.ymldeleted−39
@@ -1,39 +0,0 @@
1−name: Packdiff
2−
3−on: pull_request
4−
5−jobs:
6− packdiff:
7−
8− runs-on: ubuntu-latest
9−
10− steps:
11−
12− - name: Download ghc
13− run: |
14− GHCUP_VER=0.1.18.0
15− curl -sL -o ./ghcup https://downloads.haskell.org/~ghcup/$GHCUP_VER/x86_64-linux-ghcup-$GHCUP_VER
16− chmod +x ./ghcup
17− GHCVER=8.10.7
18− ./ghcup install ghc $GHCVER
19− ./ghcup set ghc $GHCVER
20− cabal update
21−
22− - uses: actions/cache@v2
23− name: Cache ~/.cabal
24− with:
25− path: |
26− ~/.cabal
27− # Bump the key version to clear the cache
28− key: cache-v2
29−
30− - name: Checkout the current branch
31− uses: actions/checkout@v2
32− with:
33− fetch-depth: 0
34−
35− - name: Run packdiff on streamly-core
36− run: cabal run packdiff --project-file=cabal.project.packdiff -- streamly-core $(git rev-parse origin/master) $(git rev-parse HEAD)
37−
38− - name: Run packdiff on streamly
39− run: cabal run packdiff --project-file=cabal.project.packdiff -- streamly $(git rev-parse origin/master) $(git rev-parse HEAD)
.github/workflows/regression-check.ymldeleted−165
@@ -1,165 +0,0 @@
1−name: Regression checking
2−
3−on:
4− workflow_dispatch:
5− pull_request:
6−
7−# References:
8−# https://docs.github.com/en/actions/managing-workflow-runs/manually-running-a-workflow
9−# https://docs.github.com/en/actions/using-workflows/reusing-workflows#reusable-workflows-and-starter-workflows
10−# https://docs.github.com/en/actions/using-workflows/workflow-syntax-for-github-actions#onworkflow_call
11−# https://docs.github.com/en/actions/learn-github-actions/contexts#about-contexts-and-expressions
12−
13−# You can override the default DIFF_CUTOFF_PERCENT by specifying a cutoff along
14−# with the benchmark target.
15−# Eg, "Data.Async:12" where "Data.Async" is the benchmark target, ":" is the
16−# seperator, and "12" is the new cutoff percent
17−jobs:
18− check-regressions:
19− env:
20− CI_BENCHMARKS_WITH_CUTOFF: >-
21− Data.Array
22− Data.MutArray
23− Data.Array.Generic
24− Data.Ring.Unboxed
25− Data.Fold
26− Data.Fold.Window
27− Data.Parser
28− Data.ParserK
29− Data.StreamD
30− Data.StreamK:6
31− Data.Unfold
32− Data.Stream
33− Data.Stream.Concurrent
34− Data.Stream.ConcurrentEager
35− Data.Stream.ConcurrentInterleaved
36− Data.Stream.ConcurrentOrdered
37− FileSystem.Handle
38− Unicode.Char
39− Unicode.Stream
40− Unicode.Utf8
41− CI_FIELDS: allocated
42− CI_DIFF_CUTOFF_PERCENT: 3
43−
44− runs-on: ubuntu-latest
45−
46− steps:
47−
48− - name: Update environment
49− run: |
50− CI_BENCHMARKS=""
51− for i in $CI_BENCHMARKS_WITH_CUTOFF
52− do
53− bname=$(echo "$i" | cut -d: -f1)
54− CI_BENCHMARKS="$CI_BENCHMARKS $bname"
55− done
56− echo "CI_BENCHMARKS=$CI_BENCHMARKS" >> $GITHUB_ENV
57−
58− - name: Download ghc
59− run: |
60− GHCUP_VER=0.1.18.0
61− curl -sL -o ./ghcup https://downloads.haskell.org/~ghcup/$GHCUP_VER/x86_64-linux-ghcup-$GHCUP_VER
62− chmod +x ./ghcup
63− GHCVER=9.2.7
64− ./ghcup install ghc $GHCVER
65− ./ghcup set ghc $GHCVER
66− cabal update
67−
68− - uses: actions/cache@v2
69− name: Cache ~/.cabal
70− with:
71− path: |
72− ~/.cabal
73− # Bump the key version to clear the cache
74− key: cache-v2
75−
76− - name: Cache bench-runner from pr
77− id: cache-bench-runner-pr
78− uses: actions/cache@v2
79− with:
80− path: bench-runner
81− # Bump the key version to clear the cache
82− key: bench-runner-v1
83−
84− # -----------------------------------------------------------------
85− # -- Install bench-report in the current directory
86− # -----------------------------------------------------------------
87−
88− - name: Checkout the current branch
89− uses: actions/checkout@v2
90− with:
91− clean: false
92−
93− - name: Install bench-runner
94− run: |
95− cabal install bench-runner --project-file=cabal.project.report --installdir=./
96−
97− # -----------------------------------------------------------------
98− # -- Generate reports for the base branch and upload
99− # -----------------------------------------------------------------
100−
101− - name: Checkout the base branch
102− uses: actions/checkout@v2
103− with:
104− ref: master
105− clean: false
106−
107− - name: Run benchmarks
108− run: |
109− ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --raw
110−
111− - name: Move charts to charts-master
112− run: mv charts charts-master
113−
114− # -----------------------------------------------------------------
115− # -- Download, generate reports for the current branch and append
116− # -----------------------------------------------------------------
117−
118− - name: Checkout the current branch
119− uses: actions/checkout@v2
120− with:
121− clean: false
122−
123− - name: Copy charts-master to charts
124− run: cp -r charts-master charts
125−
126− - name: Run benchmarks and append
127− run: |
128− ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --raw --append
129−
130− # -----------------------------------------------------------------
131− # -- Compare
132− # -----------------------------------------------------------------
133−
134− - name: List all benchmarks
135− run: |
136− ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --no-measure
137−
138− - name: Compare benchmarks
139− run: |
140−
141− EXIT_STATUS=0
142−
143− for i in $CI_BENCHMARKS_WITH_CUTOFF
144− do
145− arrI=(${i//:/ })
146−
147− bname=${arrI[0]}
148− cutoff=${arrI[1]}
149−
150− test -z "$cutoff" && cutoff=$CI_DIFF_CUTOFF_PERCENT
151−
152− echo
153− echo "Checking $bname for regressions greater than $cutoff percent"
154− ! ./bench-runner \
155− --package-name streamly-benchmarks \
156− --package-version 0.0.0 \
157− --targets "$bname" \
158− --fields "$CI_FIELDS" \
159− --no-measure --silent \
160− --diff-cutoff-percent $cutoff \
161− | grep -v "^$"
162− test $? -eq 1 && EXIT_STATUS=1
163− done
164−
165− exit $EXIT_STATUS
.gitignore+3−8
@@ -1,11 +1,7 @@
11# Build files/directories
2−.stack-work/
3−dist/
4−dist-newstyle*/
5−.cabal.nix
6−autom4te.cache/
7−benchmark/bench-report/bin/bench-report
8−charts/
2+/.stack-work/
3+/dist/
4+/dist-newstyle*/
95
106# Local GHC and Cabal related files
117.ghc.environment*
@@ -18,4 +14,3 @@ cabal.project.local
1814
1915# Other
2016.log
21−_doctests/
.hlint.ignore+35−12
@@ -1,40 +1,63 @@
1−core/src/Streamly/Internal/Data/Stream/StreamK/Type.hs
2−core/src/Streamly/Internal/Data/Pipe/Type.hs
3−core/src/Streamly/Internal/Unicode/Stream.hs
4−src/Streamly/Internal/Data/SmallArray/Type.hs
5−src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs
1+src/Streamly/Internal/Data/Stream/SVar.hs
62src/Streamly/Internal/Data/Stream/Serial.hs
73src/Streamly/Internal/Data/Stream/Zip.hs
4+src/Streamly/Internal/Data/Stream/Parallel.hs
5+src/Streamly/Internal/Data/Stream/Async.hs
6+src/Streamly/Internal/Data/Stream/Enumeration.hs
7+src/Streamly/Internal/Data/Stream/StreamDK.hs
8+src/Streamly/Internal/Data/Stream/StreamK.hs
9+src/Streamly/Internal/Data/Stream/StreamK/Type.hs
10+src/Streamly/Internal/Data/Stream/Ahead.hs
11+src/Streamly/Internal/Data/Stream/StreamD/Type.hs
12+src/Streamly/Internal/Data/Stream/StreamDK/Type.hs
13+src/Streamly/Internal/Data/Stream/StreamD.hs
14+src/Streamly/Internal/Data/Pipe/Types.hs
15+src/Streamly/Internal/Data/SmallArray/Types.hs
16+src/Streamly/Internal/Unicode/Stream.hs
17+src/Streamly/Internal/Data/IORef/Prim.hs
18+src/Streamly/Internal/Data/Array/Prim/Types.hs
19+src/Streamly/Internal/Data/Array/Prim/Mut/Types.hs
20+src/Streamly/Internal/Data/Array/Prim/MutTypesInclude.hs
21+src/Streamly/Internal/Data/Array/Prim/Pinned/Mut/Types.hs
22+src/Streamly/Internal/Data/Array/Prim/Pinned/Types.hs
23+src/Streamly/Internal/Data/Array/Prim/TypesInclude.hs
24+test/Streamly/Test/Common/Array.hs
825test/Streamly/Test/Data/Array.hs
26+test/Streamly/Test/Data/Array/Prim.hs
27+test/Streamly/Test/Data/Array/Prim/Pinned.hs
28+test/Streamly/Test/Data/Array/Storable/Foreign.hs
29+test/Streamly/Test/Data/Fold.hs
930test/Streamly/Test/Data/Parser.hs
10−test/Streamly/Test/Data/ParserK.hs
31+test/Streamly/Test/Data/Parser/ParserD.hs
1132test/Streamly/Test/Data/SmallArray.hs
1233test/Streamly/Test/Data/Unfold.hs
1334test/Streamly/Test/FileSystem/Event.hs
1435test/Streamly/Test/Prelude/Concurrent.hs
15−test/Streamly/Test/Data/Stream/Concurrent.hs
16−test/lib/Streamly/Test/Prelude/Common.hs
1736test/Streamly/Test/Prelude/Fold.hs
1837test/Streamly/Test/Prelude/Rate.hs
1938test/Streamly/Test/Prelude/Serial.hs
2039test/Streamly/Test/Unicode/Stream.hs
21−test/Streamly/Test/Data/Unbox.hs
2240benchmark/lib/Streamly/Benchmark/Common.hs
2341benchmark/lib/Streamly/Benchmark/Common/Handle.hs
2442benchmark/lib/Streamly/Benchmark/Prelude.hs
2543benchmark/NanoBenchmarks.hs
2644benchmark/Streamly/Benchmark/Data/Array.hs
45+benchmark/Streamly/Benchmark/Data/ArrayOps.hs
46+benchmark/Streamly/Benchmark/Data/NestedUnfoldOps.hs
2747benchmark/Streamly/Benchmark/Data/Parser.hs
28−benchmark/Streamly/Benchmark/Data/ParserK.hs
48+benchmark/Streamly/Benchmark/Data/Parser/ParserD.hs
2949benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs
3050benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs
3151benchmark/Streamly/Benchmark/Data/Unfold.hs
3252benchmark/Streamly/Benchmark/FileSystem/Handle.hs
3353benchmark/Streamly/Benchmark/Prelude/Async.hs
34−benchmark/Streamly/Benchmark/Prelude/Concurrent.hs
35−benchmark/Streamly/Benchmark/Prelude/Merge.hs
3654benchmark/Streamly/Benchmark/Prelude/Parallel.hs
3755benchmark/Streamly/Benchmark/Prelude/Rate.hs
56+benchmark/Streamly/Benchmark/Prelude/Serial/Exceptions.hs
57+benchmark/Streamly/Benchmark/Prelude/Serial/Nested.hs
58+benchmark/Streamly/Benchmark/Prelude/Serial/Split.hs
59+benchmark/Streamly/Benchmark/Prelude/Serial/Transformation1.hs
3860benchmark/Streamly/Benchmark/Prelude/WAsync.hs
3961benchmark/Streamly/Benchmark/Prelude/ZipAsync.hs
4062benchmark/Streamly/Benchmark/Prelude/ZipSerial.hs
63+benchmark/Streamly/Benchmark/Unicode/Stream.hs
.hlint.yaml+2−18
@@ -10,8 +10,6 @@
1010- suggest: {name: "Unused LANGUAGE pragma"}
1111- suggest: {name: "Eta reduce"}
1212- suggest: {name: "Reduce duplication"}
13−
14−# Warnings currently ignored
1513- ignore: {name: "Use list literal pattern"}
1614- ignore: {name: "Use tuple-section"} # requires GHC extension
1715- ignore: {name: "Use fromMaybe"} # may want to use this suggestion, but it didn't match the common idiom of the library
@@ -23,25 +21,11 @@
2321- ignore: {name: "Use <$>"}
2422- ignore: {name: "Use uncurry"}
2523- ignore: {name: "Redundant $!"}
26−- ignore: {name: "Use fmap"}
27−- ignore: {name: "Use ++"}
2824
29−# Warnings ignored in specific places
30−- ignore: {name: "Use mapM", within: Stream.Transform}
31−- ignore: {name: "Use traverse", within: Stream.Transform}
32−- ignore: {name: "Redundant <*", within: Stream.Expand}
33−- ignore: {name: "Redundant bracket", within: Stream.Split}
34−- ignore: {name: "Use isDigit", within: Streamly.Internal.Unicode.Parser}
3525
3626# Specify additional command line arguments
3727#
38−- arguments:
39− [ --cpp-include=src
40− , --cpp-include=src/Streamly/Internal/Data/Stream
41− , --cpp-include=src/Streamly/Internal/Data/Array
42− , --cpp-include=test
43− , --cpp-define=CABAL_OS_LINUX
44− ]
28+# - arguments: [--color, --cpp-simple, -XQuasiQuotes]
4529
4630
4731# Control which extensions/flags/modules/functions can be used
@@ -71,7 +55,7 @@
7155# Turn on hints that are off by default
7256#
7357# Ban "module X(module X) where", to require a real export list
74−- warn: {name: Use explicit module export list}
58+# - warn: {name: Use explicit module export list}
7559#
7660# Replace a $ b $ c with a . b $ c
7761# - group: {name: dollar, enabled: true}
.packcheck.ignore−32
@@ -1,36 +1,4 @@
1−.circleci/config.yml
2−.ghci
3−.github/workflows/haskell.yml
4−.github/workflows/regression-check.yml
5−.github/workflows/packdiff.yml
6−.gitignore
7−.hlint.ignore
8−.hlint.yaml
91.packcheck.ignore
10−appveyor.yml
11−benchmark/bench-runner/default.nix
12−benchmark/bench-runner/cabal.project
13−bin/ghc.sh
14−bin/repl
15−bin/run-ci.sh
16−bin/run-repl-quick.sh
17−cabal.project
182cabal.project.coverage
19−cabal.project.doctest
20−cabal.project.ghc-head
213cabal.project.hpc-coveralls
22−cabal.project.O0
23−cabal.project.report
24−cabal.project.packdiff
25−cabal.project.streamly
26−cabal.project.Werror
27−cabal.project.Werror-nocode
28−core/
29−default.nix
30−examples/README.md
314hie.yaml
32−stack.yaml
33−targets/default.nix
34−targets/cabal.project
35−test/test-runner/default.nix
36−test/test-runner/cabal.project
.travis.ymlnew file+242
@@ -0,0 +1,242 @@
1+# packcheck-0.4.2
2+# You can use any of the options supported by packcheck as environment
3+# variables here. See https://github.com/harendra-kumar/packcheck for all
4+# options and their explanation.
5+
6+if: branch = master
7+
8+# dist: trusty
9+dist: xenial
10+env:
11+ # ------------------------------------------------------------------------
12+ # Global options, you can use these per build as well
13+ # ------------------------------------------------------------------------
14+ global:
15+ # ------------------------------------------------------------------------
16+ # Common options
17+ # ------------------------------------------------------------------------
18+ - GHC_OPTIONS="-Werror"
19+ - CABAL_REINIT_CONFIG=y
20+ - LC_ALL=C.UTF-8
21+
22+ # ------------------------------------------------------------------------
23+ # What to build
24+ # ------------------------------------------------------------------------
25+ # - DISABLE_TEST=y
26+ # - DISABLE_BENCH=y
27+ # - DISABLE_DOCS=y
28+ # - DISABLE_SDIST_BUILD=y
29+ # - DISABLE_DIST_CHECKS=y
30+ - ENABLE_INSTALL=y
31+
32+ # ------------------------------------------------------------------------
33+ # stack options
34+ # ------------------------------------------------------------------------
35+ # Note requiring a specific version of stack using STACKVER may fail due to
36+ # github API limit while checking and upgrading/downgrading to the specific
37+ # version.
38+ #- STACKVER="1.6.5"
39+ - STACK_UPGRADE="y"
40+
41+ # ------------------------------------------------------------------------
42+ # cabal options
43+ # ------------------------------------------------------------------------
44+ - CABAL_CHECK_RELAX=y
45+ - CABAL_NO_SANDBOX=y
46+ - CABAL_HACKAGE_MIRROR=hackage.haskell.org:http://hackage.fpcomplete.com
47+
48+ # ------------------------------------------------------------------------
49+ # Where to find the required tools
50+ # ------------------------------------------------------------------------
51+ - PATH=/bin:/usr/bin
52+ - TOOLS_DIR=/opt
53+
54+ # ------------------------------------------------------------------------
55+ # Location of packcheck.sh (the shell script invoked to perform CI tests ).
56+ # ------------------------------------------------------------------------
57+ # You can either commit the packcheck.sh script at this path in your repo or
58+ # you can use it by specifying the PACKCHECK_REPO_URL option below in which
59+ # case it will be automatically copied from the packcheck repo to this path
60+ # during CI tests. In any case it is finally invoked from this path.
61+ - PACKCHECK_LOCAL_PATH="./packcheck.sh"
62+ # If you have not committed packcheck.sh in your repo at PACKCHECK_LOCAL_PATH
63+ # then it is automatically pulled from this URL.
64+ - PACKCHECK_GITHUB_URL="https://raw.githubusercontent.com/harendra-kumar/packcheck"
65+ - PACKCHECK_GITHUB_COMMIT="563702bd02c41343dcd3dfcfef0845ca428a9240"
66+
67+notifications:
68+ email:
69+ on_success: change
70+ on_failure: always
71+
72+# This matrix has total of 6 builds enabled, we try to cover last three major
73+# GHC versions, stack, cabal, Linux and OSX with minimum number of builds
74+# possible. You can uncomment other disabled builds or comment out existing
75+# ones to your taste.
76+#
77+# We pre-install the cabal-install package to not incur the penalty of building
78+# it the first time in cached builds or every time in uncached builds.
79+matrix:
80+ include:
81+
82+ # --------------------------------------------------------------------------
83+ # (Linux) cabal builds (BUILD=cabal-v1, BUILD=cabal-v2). Common envvars are:
84+ # CABAL_CONFIGURE_OPTIONS (cabal-v1), CABAL_BUILD_OPTIONS (cabal-v2)
85+ # --------------------------------------------------------------------------
86+
87+ #- env: BUILD=cabal-v2 GHCVER=head
88+ # addons: {apt: {packages: [cabal-install-head,ghc-head], sources: [hvr-ghc]}}
89+
90+ # With coverage
91+ - name: "GHC 8.10.1+inspection+Werror+coverage"
92+ env: BUILD=cabal-v2 COVERALLS_OPTIONS=" --repo-token=9ezA743hCAcmzX3Ic273LhNlIXVdl7D1l --coverage-mode=StrictlyFullLines --exclude-dir=test" CABAL_PROJECT="cabal.project.coverage" GHC_OPTIONS=""
93+ addons: {apt: {packages: [cabal-install-3.2,ghc-8.10.1], sources: [hvr-ghc]}}
94+
95+ # Built on github ci/on travis-stack-linux/on travis-stack-macOS
96+ #- env: BUILD=cabal-v2 GHCVER=8.8.4 GHC_OPTIONS="" CABAL_BUILD_OPTIONS=""
97+ # addons: {apt: {packages: [cabal-install-3.2,ghc-8.8.4], sources: [hvr-ghc]}}
98+ # os: linux
99+ # arch: amd64
100+
101+ # Built on github ci
102+ #- env: BUILD=cabal-v2 GHCVER=8.6.5 GHC_OPTIONS="" CABAL_BUILD_OPTIONS=""
103+ # addons: {apt: {packages: [cabal-install-3.2,ghc-8.6.5], sources: [hvr-ghc]}}
104+ # os: linux
105+ # arch: amd64
106+
107+ - name: "GHC 8.4.4+x86+debug"
108+ env: BUILD=cabal-v2 GHCVER=8.4.4 GHC_OPTIONS="" CABAL_BUILD_OPTIONS="--flag debug"
109+ addons: {apt: {packages: [cabal-install-3.2,ghc-8.4.4], sources: [hvr-ghc]}}
110+ os: linux
111+ arch: x86
112+
113+ # Built on circleci
114+ # GHC-8.2.2 hogs memory leading to out-of-memory when compiling benchmarks
115+ #- env: BUILD=cabal-v2 GHCVER=8.2.2 GHC_OPTIONS="" DISABLE_BENCH=y
116+ # addons: {apt: {packages: [cabal-install-2.4,ghc-8.2.2], sources: [hvr-ghc]}}
117+
118+ - name: "GHC 8.0.2"
119+ env: BUILD=cabal-v2 GHCVER=8.0.2 GHC_OPTIONS=""
120+ addons: {apt: {packages: [cabal-install-3.2,ghc-8.0.2], sources: [hvr-ghc]}}
121+ os: linux
122+ arch: amd64
123+
124+ # You can specify build flags like this:
125+ #- env: BUILD=cabal-v2 CABAL_BUILD_OPTIONS="--flags=dev"
126+ # addons: {apt: {packages: [cabal-install-head,ghc-head], sources: [hvr-ghc]}}
127+
128+ # --------------------------------------------------------------------------
129+ # GHCJS cabal builds
130+ # --------------------------------------------------------------------------
131+
132+ # Use CABAL_BUILD_OPTIONS to pass any options to cabal e.g. project-file
133+ # DISABLE_SDIST_BUILD is set because of a cabal issue. 'cabal info'
134+ # unnecessarily requires "ghc".
135+ - name: "GHCJS 8.4+no-test+no-docs"
136+ env: BUILD=cabal-v2 ENABLE_GHCJS=y DISABLE_TEST=y ENABLE_INSTALL= DISABLE_DOCS=y DISABLE_SDIST_BUILD=y
137+ addons:
138+ apt:
139+ sources:
140+ - hvr-ghc
141+ - sourceline: 'ppa:hvr/ghcjs'
142+ - sourceline: 'deb https://deb.nodesource.com/node_11.x xenial main'
143+ key_url: 'https://deb.nodesource.com/gpgkey/nodesource.gpg.key'
144+ packages: [cabal-install-3.2,ghcjs-8.4]
145+
146+ # --------------------------------------------------------------------------
147+ # (Linux) stack builds (BUILD=stack). Some common envvars for stack builds
148+ # are: STACK_YAML, STACK_OPTIONS, STACK_BUILD_OPTIONS
149+ # --------------------------------------------------------------------------
150+ #
151+ # NOTE: cabal-install is required for some of the packcheck options to work.
152+ # We just install it so that packcheck does not build it from source
153+ # otherwise.
154+
155+ #- env: BUILD=stack RESOLVER=nightly
156+ # addons: {apt: {packages: [cabal-install-1.24], sources: [hvr-ghc]}}
157+
158+ - name: "GHC 8.8+stack lts-16.12"
159+ env: BUILD=stack RESOLVER=lts-16.12 GHCVER=8.8 SDIST_OPTIONS="--ignore-check"
160+ addons: {apt: {packages: [cabal-install-3.2], sources: [hvr-ghc]}}
161+ os: linux
162+ arch: amd64
163+
164+ #- env: BUILD=stack RESOLVER=lts-12 GHCVER=8.4
165+ # addons: {apt: {packages: [cabal-install-2.4], sources: [hvr-ghc]}}
166+
167+ # GHC-8.2.2 hogs memory leading to out-of-memory when compiling benchmarks
168+ # So disable the benchmarks for this build.
169+ #- env: BUILD=stack GHCVER=8.2.2 RESOLVER=lts-11 GHC_OPTIONS="" DISABLE_SDIST_BUILD=y DISABLE_DIST_CHECKS=y DISABLE_BENCH=y
170+ # addons: {apt: {packages: [cabal-install-2.4], sources: [hvr-ghc]}}
171+
172+ #- env: BUILD=stack RESOLVER=lts-9 GHCVER=8.0
173+ # addons: {apt: {packages: [cabal-install-2.4], sources: [hvr-ghc]}}
174+
175+ #- env: BUILD=stack RESOLVER=lts-6 GHCVER=7.10
176+ # addons: {apt: {packages: [cabal-install-2.4], sources: [hvr-ghc]}}
177+
178+ # You can keep a STACK_YAML file at any path location
179+ #- env: BUILD=stack STACK_YAML=.ci/stack-8.0.yaml
180+
181+ # You can specify build flags like this:
182+ #- env: BUILD=stack RESOLVER=lts-12 STACK_BUILD_OPTIONS="--flag packcheck:dev"
183+
184+ # --------------------------------------------------------------------------
185+ # OS X builds
186+ # --------------------------------------------------------------------------
187+
188+ # On OSX autoreconf is not installed therefore disable sdist build
189+ - name: "GHC 8.8"
190+ env: BUILD=stack RESOLVER=lts-16.12 GHCVER=8.8 GHC_OPTIONS="" DISABLE_SDIST_BUILD=y SDIST_OPTIONS="--ignore-check"
191+ os: osx
192+
193+ # --------------------------------------------------------------------------
194+ # Lint e.g. HLINT_COMMANDS="hlint lint src; hlint lint test"
195+ # --------------------------------------------------------------------------
196+
197+ - name: "hlint src"
198+ env: BUILD=cabal-v2 HLINT_OPTIONS="lint" HLINT_TARGETS="src"
199+
200+ - name: "hlint test benchmarks"
201+ env: BUILD=cabal-v2 HLINT_OPTIONS="lint" HLINT_TARGETS="test benchmarks"
202+
203+ # --------------------------------------------------------------------------
204+ # Builds that are allowed to fail
205+ # --------------------------------------------------------------------------
206+
207+ allow_failures:
208+ - env: BUILD=cabal-v2 GHCVER=head GHC_OPTIONS=""
209+ - env: BUILD=stack RESOLVER=nightly DISABLE_SDIST_BUILD=y DISABLE_DIST_CHECKS=y
210+ - env: BUILD=cabal-v2 HLINT_OPTIONS="lint" HLINT_TARGETS="test benchmarks"
211+
212+# ------------------------------------------------------------------------
213+# Settings beyond this point are advanced and normally not tweaked
214+# ------------------------------------------------------------------------
215+
216+language: generic
217+sudo: false
218+cache:
219+ directories:
220+ - $HOME/.cabal
221+ - $HOME/.ghc
222+ - $HOME/.ghcjs
223+ - $HOME/.local
224+ - $HOME/.stack
225+install: true
226+
227+script:
228+ - |
229+ # If a custom stack-yaml is specified, replace the default with that
230+ if test -e "$STACK_YAML"; then rm -f stack.yaml && ln -sv $STACK_YAML stack.yaml; else true; fi
231+ unset STACK_YAML
232+
233+ # Get packcheck if needed
234+ CURL=$(which curl)
235+ PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
236+ if test ! -e "$PACKCHECK_LOCAL_PATH"; then $CURL -sL -o "$PACKCHECK_LOCAL_PATH" $PACKCHECK_URL; fi;
237+ chmod +x $PACKCHECK_LOCAL_PATH
238+
239+ # This script is governed by various PACKCHECK envvars that are set above.
240+ # In addition, hpc-coveralls needs TRAVIS, TRAVIS_JOB_ID variables set by
241+ # the travis CI environment.
242+ - bash -c "$PACKCHECK_LOCAL_PATH $BUILD PATH=/bin:/usr/bin"
CHANGELOG.mddeleted−1
@@ -1 +0,0 @@
1−docs/User/Project/Changelog.md
CONTRIBUTING.mdmode 120000 → 100644+251−1
@@ -1 +0,0 @@
1−docs/Developer/Contributing.md
@@ -0,0 +1,251 @@
1+# Contributors' Guide
2+
3+## Bug Reports
4+
5+Please feel free to [open an
6+issue](https://github.com/composewell/streamly/issues) for any questions,
7+suggestions, issues or bugs in the library. In case you are reporting a bug
8+we will appreciate if you provide as much detail as possible to reproduce or
9+understand the problem, but nevertheless you are encouraged to open an issue
10+for any problem that you may encounter.
11+
12+## Picking Issues to Work on
13+
14+Beginners are encouraged to pick up issues that are marked `help wanted`. It is
15+a good idea to update the issue expressing your intent so that others do not
16+duplicate the effort and people with a background on the issue can help.
17+
18+## Contributing A Change
19+
20+If the feature makes significant changes to design, we encourage you to open an
21+issue as early as possible so that you do not have to redo much work because of
22+changes in design decisions. However, if you are confident, you can still go
23+ahead and take that risk as the maintainers are supposed to be reasonable
24+people.
25+
26+### Pull Requests (PR)
27+
28+Please feel free to [send a pull
29+request (PR)](https://github.com/composewell/streamly/pulls) whether it is a
30+single letter typo fix or a complex change. We will accept any PR that makes a
31+net positive change to the package. We encourage you to provide a complete,
32+consistent change with test, documentation and benchmarks. You can contact the
33+[maintainers](https://gitter.im/composewell/streamly) for any help or
34+collaboration needed in that regard. However, if due to lack of time you are
35+not able to complete the PR, you are still welcome to submit it, maintainers
36+will try their best to actively contribute and pick up your change as long as
37+the change is approved.
38+
39+### Pull Request (PR) Checklist
40+
41+Here is a quick checklist for a PR, for details please see the next section:
42+
43+* PR contains one logical changeset
44+* Each commit in the PR consists of a logical change
45+* Commits are rebased/squashed/fixup/reordered as needed
46+* Stylistic changes to irrelevant parts of the code are separated in
47+ independent commits.
48+* Code is formatted as per the style of the file or that of other files
49+* Compiler warnings are fixed
50+* Reasonable hlint suggestions are accepted
51+* Tests are added to cover the changed parts
52+* All [tests](test) pass
53+* [Performance benchmarks](benchmark) are added, where applicable
54+* No significant regressions are reported by [performance benchmarks](benchmark/README.md)
55+* Haddock documentation is added to user visible APIs and data types
56+* Tutorial module, [README](README.md), and [guides](docs) are updated if
57+ necessary.
58+* [Changelog](Changelog.md) is updated if needed
59+* The code conforms to the license, it is not stolen, credit is given,
60+ copyright notices are retained, original license is included if needed.
61+
62+### Structuring Pull Requests
63+
64+__Lean PR:__ Please keep the reviewer in mind when sending pull
65+requests. Use one PR for each logical changeset. A lean and thin
66+PR with one independent logical change is more likely to be reviewed and
67+merged quickly than a big monolithic PR with several unrelated changes.
68+
69+__PR Dependencies:__ If your change depends on an earlier PR you can
70+create a branch from the old PR's branch, and raise a new PR targeting
71+to merge into the old PR branch. Do not push the commits to the same PR
72+just because the commit depends on that PR.
73+
74+__Commits:__ You are encouraged to group a logically related set of
75+changes into a single commit. When the overall changeset is largish you
76+can divide it into multiple smaller commits, with each commit having
77+a logically grouped changeset and the title summarizing the logical
78+grouping. Always keep in mind a logical division helps reviewers
79+understand and review your code quickly, easier history tracking and
80+when required clean reversal changes.
81+
82+__Functional Changes:__ Keep the reviewer in mind when making
83+changes. Please resist the temptation to make style related changes to
84+surrounding code unless you are changing that code anyway . Whenever
85+possible, try to separate unrelated refactoring changes which do not
86+affect functionality in separate commits so that it is easier for the
87+reviewer to verify functional changes.
88+
89+__Style Changes:__ Make sure that your IDE/Editor is not automatically
90+making sweeping style changes to all the files you are editing. That
91+makes separating the signal from the noise very difficult and makes
92+everything harder. If you would like to make style related changes
93+then please send a separate PR with just those changes and no other
94+functionality changes.
95+
96+__Rebasing:__ If your commits reflect how you fixed intermediate
97+problems during testing or made random changes at different times you
98+may have to squash your changes (`git rebase -i`) into a single commit
99+or logically related set of commits.
100+
101+### Resolving Conflicts
102+
103+If during the course of development or before you send the PR you find that
104+your changes are conflicting with the master branch then use `git rebase
105+master` to rebase your changes on top of master. DO NOT MERGE MASTER INTO YOUR
106+BRANCH.
107+
108+### Testing
109+
110+It is a good idea to include tests for the changes where applicable. See the
111+existing tests [here](test).
112+
113+### Documentation
114+
115+For user visible APIs, it is a good idea to provide haddock documentation that
116+is easily understood by the end programmer and does not sound highfalutin,
117+and preferably with examples. If your change affects the tutorial or needs to
118+be mentioned in the tutorial then please update the tutorial. Check if the
119+additional [guides](docs) are affected or need to updated.
120+
121+### Performance Benchmarks
122+
123+It is a good idea to run performance benchmarks to see if your change affects
124+any of the existing performance benchmarks. If you introduced something new
125+then you may want to add benchmarks to check if it performs as well as expected
126+by the programmers to deem it usable.
127+
128+See the [README](benchmark/README) file in the `benchmark` directory for more
129+details on how to run the benchmarks.
130+
131+The first level of check is the regression in "allocations", this is
132+the most stable measure of regression. "bytesCopied" is another stable
133+measure, it gives an idea of the amount of long lived data being copied
134+across generations of GC.
135+
136+The next measure to look at is "cpuTime" this may have some variance
137+from run to run because of factors like cpu frequency scaling, load on
138+the system or the number of context switches etc. However, the variance
139+would usually be within 5-10%, anything more than that is likely to be a
140+red flag.
141+
142+Quite often an increase in "cpuTime" would correspond to an increase
143+in "allocations". Increase in "allocations" indicates an inefficiency
144+in computing due to too much GC activity e.g. due to lack of
145+fusion. However, it is also possible for the cpu time to go up without
146+the allocations going up, this indicates an inefficiency in processing
147+in general or more CPU being used for the same task. It could be because
148+of inefficient code generation, branch mis-predictions or lack of cache
149+locality etc.
150+
151+For concurrent benchmarks we can compare "cpuTime" and "time" to check
152+the degree of concurrency and total efficiency.
153+
154+### Changelog
155+
156+Any new changes that affect the user of the library in some way must be
157+documented under `Unreleased` section at the top of the `Changelog`. The
158+changes in the changelog must be organized in the following categories, in that
159+order:
160+
161+* Breaking Changes
162+* Enhancements
163+* Bug Fixes
164+* Deprecations
165+
166+If there are very few changes then you can just prefix a bullet with these
167+annotations. If there are many changes make sections to group them. A section
168+can be absent if there is nothing to add in it.
169+
170+If you make changes that are incompatible with the released versions
171+of the library please indicate that in the `Changelog` as `Breaking Changes`
172+and also write short notes regarding what the programmers need to do to adapt
173+their existing code to the new change.
174+
175+### Licensing
176+
177+If you have copied code from elsewhere you need to conform to the
178+licensing terms of the original code. Usually you would need to add a
179+copyright notice in the source header, and include the license of the
180+original code as per the terms of the license. If the code you are
181+copying does not have an associated license please do not use it.
182+
183+## Developer documentation
184+
185+To build haddock documentation for all modules, including the ones not exposed
186+to users of the library, use the following commands:
187+
188+```
189+$ cabal haddock
190+$ stack haddock --no-haddock-deps
191+```
192+
193+For design documentation see the `design` directory.
194+
195+## Coding Guidelines
196+
197+### Coding Style
198+
199+Please see [the Haskell coding style guide](https://github.com/composewell/haskell-dev/blob/master/coding-style.rst).
200+
201+### StreamD coding style
202+
203+Some conventions that we follow in the StreamD code are illustrated by the
204+following example:
205+
206+```
207+mapM f (Stream step1 state1) = Stream step state
208+ where
209+
210+ step gst st = do
211+ r <- step1 (adaptState gst) st
212+ case r of
213+ Yield x s -> f x >>= \a -> return $ Yield a s
214+ Skip s -> return $ Skip s
215+ Stop -> return Stop
216+```
217+
218+* For the input streams use numbering for `step` and `state` e.g.
219+ step1/state1. For the output stream use `step` and `state`.
220+* For state argument of `step`, use `st`.
221+* For result of executing a `step` use `r` or `res`
222+* For the yielded element use `x`
223+* For the yielded state use `s`
224+
225+In general, the rule is - the shorter the scope of a variable the shorter its
226+name can be. For example, `s` has the shortest scope in the above code, `st`
227+has a bigger scope and `state` has the biggest scope.
228+
229+## Design guides
230+
231+See [the design directory](design) for design guidelines and documents.
232+
233+### Tricky Parts
234+
235+The state-passing through each API is currently fragile. Every time we run a
236+stream we need to be careful about the state we are passing to it. In case of
237+folds where there is no incoming state, we start with the initial state
238+`defState`. When we have an incoming state passed to us there are two cases:
239+
240+1. When we are building a concurrent stream that needs to share the same `SVar`
241+ we pass the incoming state as is.
242+2. In all other cases we must not share the SVar and every time we pass on the
243+ state to run a stream we must use `adaptState` to reset the `SVar` in the
244+ state.
245+
246+When in doubt just use `adaptState` on the state before passing it on, we will at
247+most lose concurrency but the behavior will be correct.
248+
249+There is no type level enforcement about this as of now, and therefore we need
250+to be careful when coding. There are specific tests to detect and report any
251+problems due to this, all transform operations must be added to those tests.
docs/User/Project/Changelog.md → Changelog.mdrenamed+81−250
@@ -1,252 +1,83 @@
1−# Changelog
1+## Unreleased
2+
3+### Behavioral changes
4+
5+* `Streamly.Prelude.fold` can now terminate early without consuming the entire
6+ stream. For example, `fold Fold.head stream` would now terminate immediately
7+ after consuming the head element from `stream`.
8+* Change the associativity of combinators `serial`, `wSerial`,
9+ `ahead`, `async`, `wAsync`, `parallel` to be the same as `<>`.
10+* `encodeUtf8`, `decodeUtf8` now replace any invalid character encountered
11+ during encoding/decoding with the Unicode replacement character. Use
12+ `encodeUtf8'`, `decodeUtf8'` to recover the previous functionality.
13+* `encodeLatin1` now silently truncates any character beyond 255 to incorrect
14+ characters in the input stream. Use `encodeLatin1'` to recover previous
15+ functionality.
216
3−<!-- See rendered changelog at https://streamly.composewell.com -->
4−
5−## 0.10.1 (Jan 2024)
6−
7−* Fix TH macros in `Streamly.Data.Stream.MkType` for GHC 9.6 and above.
8−
9−## 0.10.0 (Nov 2023)
10−
11−See
12−[0.9.0-0.10.0 API Changelog](https://github.com/composewell/streamly/blob/streamly-0.10.0/docs/User/Project/ApiChangelogs/0.9.0-0.10.0.txt)
13−for a full list of API changes in this release. Only a few significant
14−changes are mentioned here. For changes to the core functionality
15−please see the changelog of the `streamly-core` package.
16−
17−### Breaking Changes
18−
19−* `MonadTrans` and `MonadBase` instances have been removed for `AsyncT`,
20− `ParallelT`, `AheadT` for GHC versions 9.6 onwards. This is due to a
21− breaking change in `transformers` 0.6. You can replace `lift` with
22− `fromEffect` when using these as top level monads in a monad stack.
23−
24−### Enhancements
17+### Breaking changes
2518
26−* __Concurrent Folds__: `Streamly.Data.Fold.Prelude` module added with
27− concurrent fold APIs and a container fold API to fold a key value
28− stream to a HashMap.
29−
30−## 0.9.0 (Mar 2023)
31−
32−Also see the following:
33−
34−* [streamly-0.9.0 Upgrade Guide](https://github.com/composewell/streamly/blob/streamly-0.10.0/docs/User/Project/Upgrading-0.8-to-0.9.md) or
35− https://hackage.haskell.org/package/streamly-0.9.0/docs/docs/User/ProjectRelated/Upgrading.md
36−* [streamly-0.9.0 API Changelog](https://github.com/composewell/streamly/blob/streamly-0.10.0/docs/User/Project/ApiChangelogs/0.8.3-0.9.0.txt) or
37− https://hackage.haskell.org/package/streamly-0.9.0/docs/docs/User/ProjectRelated/ApiChangelogs/0.8.3-0.9.0.txt
38−* [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
39− https://hackage.haskell.org/package/streamly-core-0.1.0/docs/docs/ApiChangelogs/0.1.0.txt
40−
41−### Package split
42−
43−`streamly` package is split into two packages, (1) `streamly-core` that
44−has only GHC boot library depdendecies, and (2) `streamly` that contains
45−higher level operations (including concurrent ones) with additional
46−dependencies. Make sure you add a dependency on `streamly-core` to keep old
47−code working.
48−
49−* Moved the following modules from `streamly` package to the
50− `streamly-core` package:
51− * Streamly.Console.Stdio
52− * Streamly.Data.Fold
53− * Streamly.Data.Unfold
54− * Streamly.FileSystem.Handle
55− * Streamly.Unicode.Stream
56−
57−### Breaking Changes
58−
59−* Unboxed arrays now require `Unbox` constraint instead of `Storable`.
60− The `Unbox` typeclass can be imported from `Streamly.Data.Array`. You
61− can use generic deriving to derive Unbox instances.
62−* Stream type in all modules has been changed to the new `Stream` type
63− replacing the existing `IsStream t` or `SerialT` types. Use `fromStream`,
64− `toStream` from `Streamly.Prelude` module to adapt the types.
65−* Signatures changed in `Streamly.Data.Unfold`:
66− * `fromStream`
67− * `replicateM`
68−
69−### Major Changes
70−
71−`Streamly.Prelude` module has been deprecated, equivalent
72−functionality is covered by the `Streamly.Data.Stream`,
73−`Streamly.Data.Stream.Prelude`, and `Streamly.Data.Fold` modules. The
74−new modules use a monomorphic `Stream` type instead of the polymorphic
75−`IsStream t` type.
76−
77−`Streamly.Data.Stream` module and the `Stream` type are meant for
78−writing high-performance fused pipelines not involving explicit
79−recursion. For writing code that may require recursive function calls,
80−`Streamly.Data.Stream.StreamK` module and the `StreamK` type have been
81−added which provide a CPS based stream implementation. `Stream` and
82−`StreamK` types can be easily interconverted.
83−
84−The old code can be adapted to use the new modules with some changes.
85−See the
86−[streamly-0.9.0 Upgrade Guide](https://github.com/composewell/streamly/blob/streamly-0.10.0/docs/User/Project/Upgrading-0.8-to-0.9.md)
87−for more details on how to adapt your existing code to the new release.
19+* Change the signature of `foldlM'` to make the initial value of the
20+ accumulator monadic.
21+* Change the signature of `scanlM'`, `postscanlM'` to make the initial value of
22+ the accumulator monadic.
23+* Change the signature of `concatMapWith` to ensure that it can be
24+ used with a wide variety of combining functions.
25+* Exception handling functions `bracket`, `handle`, `finally` now
26+ require an additional `MonadAsync` constraint. Several other
27+ functions that used these functions also now require the additional
28+ constraint.
8829
8930### Enhancements
9031
91−* Added the following new modules to the `streamly` package:
92− * Streamly.Data.Stream.MkType
93− * Streamly.Data.Stream.Prelude
94−* Added the following new modules to the `streamly-core` package:
95− * Streamly.Data.Array
96− * Streamly.Data.Array.Generic
97− * Streamly.Data.MutArray
98− * Streamly.Data.MutArray.Generic
99− * Streamly.Data.Parser
100− * Streamly.Data.ParserK
101− * Streamly.Data.Stream
102− * Streamly.Data.StreamK
103− * Streamly.FileSystem.Dir
104− * Streamly.FileSystem.File
105− * Streamly.Unicode.Parser
106− * Streamly.Unicode.String
107−
108−### Deprecations
109−
110−* Remove support for GHC 8.4.*
111−
112−Several modules and functions have been deprecated, equivalent modules or
113−functions are suggested in the deprecation warning messages by the compiler.
114−
115−### Internal module changes
116−
117−If you cannot find an internal module that you were using, it may have
118−been moved to the `streamly-core` package or may have been renamed.
119−
120−Following modules are moved to `streamly-core` package and renamed:
121− * Streamly.Internal.Data.Array.Stream.Foreign -> Streamly.Internal.Data.Stream.Chunked
122− * Streamly.Internal.Data.Array.Stream.Mut.Foreign -> Streamly.Internal.Data.Array.Mut.Stream
123−
124−## 0.8.3 (September 2022)
125−
126−* Fix build with GHC 9.4
127−
128−## 0.8.2 (Mar 2022)
129−
130−* Fix performance issues for GHC-9. These changes coupled with GHC changes
131− expected to land in 9.2.2 will bring the performance back to the same levels
132− as before.
133−
134−## 0.8.1.1 (Dec 2021)
135−
136−* Disable building FileSystem.Events where FS Events isn't supported.
137−
138−## 0.8.1 (Nov 2021)
139−
140−See ApiChangelogs/0.8.3.txt for new APIs introduced.
32+* New encoding/decoding routines, `encodeUtf8'`, `encodeLatin1'`, `decodeUtf8'`,
33+ are added, these routines fail when they encounter any invalid characters.
14134
14235### Bug Fixes
14336
144−* Several bug fixes in the Array module:
145− * Fix writeN fold eating away one element when applied multiple times
146− [#1258](https://github.com/composewell/streamly/issues/1258).
147− * Fix potentially writing beyond allocated memory when shrinking. Likely
148− cause of [#944](https://github.com/composewell/streamly/issues/944).
149− * Fix potentially writing beyond allocated memory when writing the last
150− element. Likely cause of
151− [#944](https://github.com/composewell/streamly/issues/944).
152− * Fix missing pointer touch could potentially cause use of freed memory.
153− * Fix unnecessary additional allocation due to a bug
154−* Fix a bug in classifySessionsBy, see
155− [PR #1311](https://github.com/composewell/streamly/pull/1311). The bug
156− could cause premature ejection of a session when input events with the
157− same key are split into multiple sessions.
158−
159−### Notable Internal API Changes
160−
161−* `tapAsync` from `Streamly.Internal.Data.Stream.Parallel` has been moved to
162− `Streamly.Internal.Data.Stream.IsStream` and renamed to `tapAsyncK`.
163−* `Fold2` has now been renamed to `Refold` and the corresponding `Fold2`
164− combinators have been either renamed or removed.
165−
166−## 0.8.0 (Jun 2021)
167−
168−See [API Changelog](/docs/User/Project/ApiChangelogs/0.8.3.txt) for a complete list of signature
169−changes and new APIs introduced.
170−
171−### Breaking changes
172−
173−* `Streamly.Prelude`
174− * `fold`: this function may now terminate early without consuming
175− the entire stream. For example, `fold Fold.head stream` would
176− now terminate immediately after consuming the head element from
177− `stream`. This may result in change of behavior in existing programs
178− if the program relies on the evaluation of the full stream.
179−* `Streamly.Data.Unicode.Stream`
180− * The following APIs no longer throw errors on invalid input, use new
181− APIs suffixed with a prime for strict behavior:
182− * decodeUtf8
183− * encodeLatin1
184− * encodeUtf8
185−* `Streamly.Data.Fold`:
186− * Several instances have been moved to the `Streamly.Data.Fold.Tee`
187− module, please use the `Tee` type to adapt to the changes.
188−
189−### Bug Fixes
190−
191−* Concurrent Streams: The monadic state for the stream is now propagated across
192− threads. Please refer to
193− [#369](https://github.com/composewell/streamly/issues/369) for more info.
194−* `Streamly.Prelude`:
195− * `bracket`, `handle`, and `finally` now also work correctly on streams
196− that aren't fully drained. Also, the resource acquisition and release is
197− atomic with respect to async exceptions.
198− * `iterate`, `iterateM` now consume O(1) space instead of O(n).
199− * `fromFoldableM` is fixed to be concurrent.
200−* `Streamly.Network.Inet.TCP`: `accept` and `connect` APIs now close the socket
201− if an exception is thrown.
202−* `Streamly.Network.Socket`: `accept` now closes the socket if an exception is
37+* The monadic state for the stream is now propagated across threads. Please
38+ refer to [#369](https://github.com/composewell/streamly/issues/369) for
39+ more info.
40+* `accept*` and `connect` APIs in `Streamly.Network.Inet.TCP` and the `accept`
41+ API in `Streamly.Network.Socket` now close the socket if an exception is
20342 thrown.
43+* `bracket`, `handle`, and `finally` now work on streams that aren't
44+ fully drained. Also, the resource acquisition and release is atomic with
45+ respect to async exceptions.
20446
205−### Enhancements
206−
207−* See [API Changelog](/docs/User/Project/ApiChangelogs/0.8.3.txt) for a complete list of new
208− modules and APIs introduced.
209−* The Fold type is now more powerful, the new termination behavior allows
210− to express basic parsing of streams using folds.
211−* Many new Fold and Unfold APIs are added.
212−* A new module for console IO APIs is added.
213−* Experimental modules for the following are added:
214− * Parsing
215− * Deserialization
216− * File system event handling (fsnotify/inotify)
217− * Folds for streams of arrays
218−* Experimental `use-c-malloc` build flag to use the c library `malloc` for
219− array allocations. This could be useful to avoid pinned memory fragmentation.
220−
221−
222−### Notable Internal/Pre-release API Changes
223−
224−Breaking changes:
225−
226−* The `Fold` type has changed to accommodate terminating folds.
227−* Rename: `Streamly.Internal.Prelude` => `Streamly.Internal.Data.Stream.IsStream`
228−* Several other internal modules have been renamed and re-factored.
229−
230−Bug fixes:
231−
232−* A bug was fixed in the conversion of `MicroSecond64` and `MilliSecond64`
233− (commit e5119626)
234−* Bug fix: `classifySessionsBy` now flushes sessions at the end and terminates.
235−
236−### Miscellaneous
47+### Deprecations
23748
49+* Deprecate `Streamly.Memory.Array` in favor of
50+ `Streamly.Data.Array.Storable.Foreign`
51+* Deprecate `Streamly.Data.Unicode.Stream` in favor of
52+ `Streamly.Unicode.Stream`
53+* The `Streamly` module is now deprecated, its functionality is subsumed
54+ by `Streamly.Prelude`.
55+* Some functions from `Streamly` module have been renamed in `Streamly.Prelude` module:
56+ * `foldWith` to `concatFoldableWith`
57+ * `foldMapWith` to `concatMapFoldableWith`
58+ * `forEachWith` to `concatForFoldableWith`
59+* The following encoding/decoding routines have been renamed:
60+ * `encodeUtf8Lax` to `encodeUtf8`
61+ * `encodeLatin1Lax` to `encodeLatin1`
62+ * `decodeUtf8Lenient` to `decodeUtf8`
23863* Drop support for GHC 7.10.3.
239−* The examples in this package are moved to a new github repo
240− [streamly-examples](https://github.com/composewell/streamly-examples)
241−
242−## 0.7.3 (February 2021)
24364
244−### Build Issues
245−
246−* Fix build issues with primitive package version >= 0.7.1.
247−* Fix build issues on armv7.
65+### Internal APIs
66+
67+* `Streamly.Internal.Prelude` renamed to `Streamly.Internal.Data.Stream.IsStream`
68+* Parser functionality is added via `Streamly.Internal.Data.Parser` module
69+* `Streamly.Internal.Data.Binary.Decode` module added for decoding Haskell
70+ values from binary data.
71+* FileSystem event notification (fsnotify/inotify) functionality added via
72+ `Streamly.Internal.FileSystem.Event.*` modules.
73+* The `Fold` type has changed to accomodate terminating folds.
74+* Added `use-c-malloc` build flag to use the c library `malloc` for array
75+ allocations.
76+* A bug was fixed in the conversion of MicroSecond64 and MilliSecond64
77+ (commit e5119626)
78+* Bug fix: classifySessionsBy now flushes sessions at the end and terminates.
24879
249−## 0.7.2 (April 2020)
80+## 0.7.2
25081
25182### Bug Fixes
25283
@@ -262,7 +93,7 @@ Bug fixes:
26293* Now builds with newer `QuickCheck` package version >= 2.14 && < 2.15.
26394* Now builds with GHC 8.10.
26495
265−## 0.7.1 (February 2020)
96+## 0.7.1
26697
26798### Bug Fixes
26899
@@ -291,7 +122,7 @@ Bug fixes:
291122* Significant improvement in performance of concurrent stream operations.
292123* Improved space and time performance of `Foldable` instance.
293124
294−## 0.7.0 (November 2019)
125+## 0.7.0
295126
296127### Breaking changes
297128
@@ -405,7 +236,7 @@ concurrently using this.
405236 effects
406237 * `tap` redirects a copy of the stream to a `Fold`
407238
408−## 0.6.1 (March 2019)
239+## 0.6.1
409240
410241### Bug Fixes
411242
@@ -417,7 +248,7 @@ concurrently using this.
417248* Add GHCJS support
418249* Remove dependency on "clock" package
419250
420−## 0.6.0 (December 2018)
251+## 0.6.0
421252
422253### Breaking changes
423254
@@ -445,7 +276,7 @@ concurrently using this.
445276* Performance improvements
446277* Add benchmarks to measure composed and iterated operations
447278
448−## 0.5.2 (October 2018)
279+## 0.5.2
449280
450281### Bug Fixes
451282
@@ -460,12 +291,12 @@ concurrently using this.
460291 used in a stateful monad e.g. `StateT`. Particularly, this bug cannot affect
461292 `ReaderT`.
462293
463−## 0.5.1 (September 2018)
294+## 0.5.1
464295
465296* Performance improvements, especially space consumption, for concurrent
466297 streams
467298
468−## 0.5.0 (September 2018)
299+## 0.5.0
469300
470301### Bug Fixes
471302
@@ -491,13 +322,13 @@ concurrently using this.
491322* The `Streamly.Time` module is now deprecated, its functionality is subsumed
492323 by the new rate limiting combinators.
493324
494−## 0.4.1 (July 2018)
325+## 0.4.1
495326
496327### Bug Fixes
497328
498329* foldxM was not fully strict, fixed.
499330
500−## 0.4.0 (July 2018)
331+## 0.4.0
501332
502333### Breaking changes
503334
@@ -524,7 +355,7 @@ concurrently using this.
524355* Add `takeWhileM` and `dropWhileM`
525356* Add `filterM`
526357
527−## 0.3.0 (June 2018)
358+## 0.3.0
528359
529360### Breaking changes
530361
@@ -552,14 +383,14 @@ concurrently using this.
552383 stream processing function application pipeline concurrently.
553384* Added `mapMaybe` and `mapMaybeM`.
554385
555−## 0.2.1 (June 2018)
386+## 0.2.1
556387
557388### Bug Fixes
558389* Fixed a bug that caused some transformation ops to return incorrect results
559390 when used with concurrent streams. The affected ops are `take`, `filter`,
560391 `takeWhile`, `drop`, `dropWhile`, and `reverse`.
561392
562−## 0.2.0 (May 2018)
393+## 0.2.0
563394
564395### Breaking changes
565396* Changed the semantics of the Semigroup instance for `InterleavedT`, `AsyncT`
@@ -637,7 +468,7 @@ concurrently using this.
637468* Put a bound (1500) on the output buffer used for asynchronous tasks
638469* Put a limit (1500) on the number of threads used for Async and WAsync types
639470
640−## 0.1.2 (March 2018)
471+## 0.1.2
641472
642473### Enhancements
643474* Add `iterate`, `iterateM` stream operations
@@ -646,7 +477,7 @@ concurrently using this.
646477* Fixed a bug that caused unexpected behavior when `pure` was used to inject
647478 values in Applicative composition of `ZipStream` and `ZipAsync` types.
648479
649−## 0.1.1 (March 2018)
480+## 0.1.1
650481
651482### Enhancements
652483* Make `cons` right associative and provide an operator form `.:` for it
@@ -657,6 +488,6 @@ concurrently using this.
657488* Fix the `product` operation. Earlier, it always returned 0 due to a bug
658489* Fix the `last` operation, which returned `Nothing` for singleton streams
659490
660−## 0.1.0 (December 2017)
491+## 0.1.0
661492
662493* Initial release
INSTALL.mdnew file+298
@@ -0,0 +1,298 @@
1+<!--
2+Portions (c) 2020, Google LLC.
3+SPDX-License-Identifer: BSD-3-Clause
4+-->
5+
6+# Getting started with the `streamly` package
7+
8+This guide will show you how to write a simple program that uses
9+`streamly`, using the [`cabal`](https://www.haskell.org/cabal/) build
10+manager for Haskell.
11+
12+<!-- TODO: Add instructions for `stack` and `nix`.
13+
14+If you are using `stack` or `nix` please make sure to add the latest
15+version from Hackage to your tool configuration. -->
16+
17+No prior knowledge of either Haskell or of `cabal` is needed. We do
18+however assume that you are using a command-line shell on a POSIX
19+operating system. If you are running Windows&trade; then you may need
20+to run a command-line shell under `msys` and some of the commands
21+below may also need to be changed in small ways to make them work.
22+
23+**Note**: If you are new to Haskell you may find the [Haskell Getting
24+Started
25+Guide](https://github.com/composewell/haskell-dev/blob/master/getting-started.rst)
26+to be useful.
27+
28+If you know your way around Haskell, and have an up to date toolchain
29+already installed, then you can jump straight to the section titled
30+"[_Prepare Your Build Directory_](#user-content-prepare-your-build-directory)".
31+
32+## Getting started with `streamly` using `cabal`
33+
34+To get started, you will need a recent `cabal` binary to be installed
35+on your system.
36+
37+### Installing `cabal`
38+
39+A pre-packaged `cabal` binary may already be available for your
40+operating system.
41+
42+For example, on Debian GNU/Linux, you could install `cabal` using::
43+
44+```
45+$ sudo apt install cabal-install
46+```
47+
48+### Installing `ghc`
49+
50+You would also need to install the Glasgow Haskell Compiler `ghc`. In
51+most operating systems, using the system's package manager to install
52+`cabal` would also bring in a version of `ghc` as a dependency.
53+
54+Please verify that `ghc` is present:
55+
56+```
57+$ ghc --version
58+The Glorious Glasgow Haskell Compilation System, version 8.0.2
59+```
60+
61+If `ghc` isn't present, please install it using your operating
62+system's package manager. For example, on Debian GNU/Linux, use:
63+
64+```
65+$ sudo apt install ghc
66+```
67+
68+### Update `cabal` if necessary
69+
70+Many operating systems ship an old version of `cabal`; in order to use
71+`streamly` you should use `cabal` version 3.0 (or later).
72+
73+You can check the installed version of `cabal` by using its
74+`--version` flag:
75+
76+```
77+$ which cabal
78+/usr/bin/cabal
79+$ /usr/bin/cabal --version
80+cabal-install version 1.24.0.2
81+compiled using version 1.24.2.0 of the Cabal library
82+```
83+
84+In this example, the installed `cabal` binary is too old for our
85+needs. It would need to be upgraded.
86+
87+You can ask `cabal` to upgrade itself (please see
88+<https://www.haskell.org/cabal/>):
89+
90+```
91+$ cabal install Cabal cabal-install
92+Resolving dependencies...
93+Downloading base16-bytestring-0.1.1.7...
94+... lots of build output ...
95+Building cabal-install-3.0.0.0...
96+Installed cabal-install-3.0.0.0
97+```
98+
99+`cabal` will usually place its compiled binaries inside the directory
100+`$HOME/.cabal/bin`.
101+
102+You can verify the version of your newly installed binary by using the
103+`--version` flag again:
104+
105+```
106+$ $HOME/.cabal/bin/cabal --version
107+cabal-install version 3.0.0.0
108+compiled using version 3.0.2.0 of the Cabal library
109+```
110+
111+If you have upgraded `cabal`, do be sure to specify `$HOME/.cabal/bin`
112+early in your `PATH` shell variable, so that the new binary gets used
113+instead of the older version on your system.
114+
115+```
116+$ PATH=$HOME/.cabal/bin:$PATH
117+```
118+
119+Once you have `cabal` version 3.0 (or later) successfully installed,
120+please refresh its package list by using `cabal update`.
121+
122+```
123+$ cabal update
124+Downloading the latest package list from hackage.haskell.org
125+```
126+
127+### Prepare Your Build Directory
128+
129+Next, create a build directory, so that you can use `cabal`'s isolated
130+builds feature.
131+
132+```
133+$ mkdir streamly-play
134+$ cd streamly-play
135+```
136+
137+Run `cabal init` to create an initial set of project files:
138+
139+```
140+$ cabal init --minimal --dependency base --dependency streamly
141+
142+Generating LICENSE...
143+... other messages ...
144+Generating Main.hs...
145+Generating streamly-play.cabal...
146+
147+Warning: no synopsis given. You should edit the .cabal file and add one.
148+You may want to edit the .cabal file and add a Description field.
149+```
150+
151+This invocation will set up a build with two build dependencies,
152+namely `base` and `streamly`. You can add additional dependencies
153+later, by editing the `build-depends` section of the generated cabal
154+file `streamly-play.cabal`. Please see the [Cabal User
155+Guide](https://www.haskell.org/cabal/users-guide/) for more
156+information on how to configure `cabal`.
157+
158+This invocation also creates a skeletal `Main.hs` program which we
159+will use later.
160+
161+### Try `streamly` in the GHCi REPL
162+
163+You can now try out `streamly` using the `GHCi` interpreter's
164+read-eval-print-loop (REPL) facility.
165+
166+To start up the GHCi REPL using the released `streamly` version on
167+Hackage, please use:
168+
169+```
170+$ cabal repl --build-depends streamly
171+... plenty of build messaages, the first time around ...
172+GHCi, version 8.8.3: https://www.haskell.org/ghc/ :? for help
173+[1 of 1] Compiling Main ( Main.hs, interpreted )
174+Ok, one module loaded.
175+*Main>
176+```
177+
178+Once at the `*Main>` prompt, you can import `streamly` and use it
179+directly:
180+
181+```
182+*Main> import qualified Streamly.Prelude as S
183+
184+*Main S> S.drain $ S.mapM print $ S.fromList [1..3]
185+1
186+2
187+3
188+*Main S>
189+```
190+
191+For the curious, here is a high level overview of what these lines
192+do:
193+
194+1. `import qualified Streamly.Prelude as S` imports the Streamly
195+ prelude into GHCi, and makes it available as module `S`.
196+2. `[1..3]` generates the Haskell list `[1, 2, 3]`.
197+3. `S.fromList` transforms that list into a stream of integers.
198+4. `S.mapM print` transforms the stream of integers into a stream of
199+ actions that would print those integers when executed.
200+5. `S.drain` transforms that stream of actions into an IO action that
201+ `main` or GHCi's REPL can execute.
202+
203+These concepts are explained in greater detail in the [Streamly
204+Tutorial][tutorial].
205+
206+#### Using a specific version of `streamly` in the REPL
207+
208+You can also ask `cabal` to use a specific version of `streamly` by
209+adding a version number constraint to the `--build-depends` flag:
210+
211+```
212+$ cabal repl --build-depends streamly==0.7.2
213+[1 of 1] Compiling Main ( Main.hs, interpreted )
214+Ok, modules loaded: Main.
215+*Main>
216+```
217+
218+#### (Advanced) Using the development version of `streamly` in the REPL
219+
220+To use the development version of `streamly`, we need to configure
221+`cabal` to fetch it from Github.
222+
223+Create a `cabal.project` file in the current directory with the
224+following content:
225+
226+```
227+packages: .
228+source-repository-package
229+ type: git
230+ location: https://github.com/composewell/streamly
231+ tag: master
232+```
233+
234+With this file present, `cabal` will fetch and build the current
235+version of `streamly` from Github every time it is run. For example:
236+
237+```
238+$ cabal repl
239+... fetches the 'master' branch of streamly from Github ...
240+... build messages ...
241+[1 of 1] Compiling Main v ( Main.hs, interpreted )
242+Ok, modules loaded: Main.
243+*Main>
244+```
245+
246+### Using `streamly` in a standalone program
247+
248+Let us now turn the single-line stanza above into a standalone program
249+that uses `streamly`.
250+
251+Edit `Main.hs` to contain the following:
252+
253+```haskell
254+module Main where
255+
256+import qualified Streamly.Prelude as S
257+
258+main :: IO ()
259+main = S.drain $ S.mapM print $ S.fromList [1..3]
260+```
261+
262+Build and run this program using `cabal run`:
263+
264+```
265+$ cabal run
266+... build messages ...
267+1
268+2
269+3
270+```
271+
272+## Which version of `streamly` should you use?
273+
274+If you are new to Streamly, we recommend using latest [stable release
275+of streamly][streamly-hackage] on Hackage.
276+
277+If you need access to cutting edge features (and do not mind the
278+occasional breakage), please use the [development version of
279+streamly][streamly-github] on Github.
280+
281+
282+## Next Steps
283+
284+If you got this far successfully, congratulations!
285+
286+* For an overview of the `streamly` package, please read the
287+ [Streamly Tutorial][tutorial].
288+* Please browse the code examples in the
289+ [`examples`](./examples/README.md) directory.
290+* If you would like to start on a real world project, please take a
291+ look at the [recommended compilation options](./docs/Build.md).
292+
293+
294+<!-- Markdown Links -->
295+
296+ [tutorial]: https://hackage.haskell.org/package/streamly/docs/Streamly-Tutorial.html
297+ [streamly-hackage]: https://hackage.haskell.org/package/streamly
298+ [streamly-github]: https://github.com/composewell/streamly
LICENSE−68
@@ -25,71 +25,3 @@ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2525CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
2626OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2727OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28−
29−-------------------------------------------------------------------------------
30−fsnotify-0.3.0.1 (http://hackage.haskell.org/package/fsnotify-0.3.0.1/)
31−-------------------------------------------------------------------------------
32−Copyright (c) 2012, Mark Dittmer
33−
34−All rights reserved.
35−
36−Redistribution and use in source and binary forms, with or without
37−modification, are permitted provided that the following conditions are met:
38−
39− * Redistributions of source code must retain the above copyright
40− notice, this list of conditions and the following disclaimer.
41−
42− * Redistributions in binary form must reproduce the above
43− copyright notice, this list of conditions and the following
44− disclaimer in the documentation and/or other materials provided
45− with the distribution.
46−
47− * Neither the name of Mark Dittmer nor the names of other
48− contributors may be used to endorse or promote products derived
49− from this software without specific prior written permission.
50−
51−THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
52−"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
53−LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
54−A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
55−OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
56−SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
57−LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
58−DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
59−THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
60−(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
61−OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
62−
63−-------------------------------------------------------------------------------
64−hfsevents-0.1.6 (http://hackage.haskell.org/package/hfsevents-0.1.6)
65−-------------------------------------------------------------------------------
66−Copyright (c) 2012, Luite Stegeman
67−
68−All rights reserved.
69−
70−Redistribution and use in source and binary forms, with or without
71−modification, are permitted provided that the following conditions are met:
72−
73− * Redistributions of source code must retain the above copyright
74− notice, this list of conditions and the following disclaimer.
75−
76− * Redistributions in binary form must reproduce the above
77− copyright notice, this list of conditions and the following
78− disclaimer in the documentation and/or other materials provided
79− with the distribution.
80−
81− * Neither the name of Luite Stegeman nor the names of other
82− contributors may be used to endorse or promote products derived
83− from this software without specific prior written permission.
84−
85−THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
86−"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
87−LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
88−A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
89−OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
90−SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
91−LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
92−DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
93−THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
94−(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
95−OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
MAINTAINING.mdnew file+256
@@ -0,0 +1,256 @@
1+# Maintainers' Guide
2+
3+## PR Merge Checklist
4+
5+* All the CI tests pass
6+* New tests are added where applicable
7+* Benchmarks are added where applicable
8+* Run benchmarks locally if you suspect any regressions
9+* Documentation is added for any new combinators
10+ * New combinators have time and space complexity annotations
11+ * New combinators have `since` annotation
12+* Changelog entry is added for exposed combinators.
13+* Identify breaking changes, or changes that may require depndency
14+ version bound changes. See https://pvp.haskell.org/. Also see the
15+ "Breaking changes section below".
16+* Optionally, look at hlint output if anything in that is worth fixing.
17+* Merge the PR by rebasing. Note that github always creates new commits when
18+ merged with rebase, it records the committer as well as the author in the
19+ commit. This makes the local branch diverge from master. You can rebase and
20+ merge the commit manually in your local git tree and push the resulting
21+ master branch to avoid new commits and divergence from the original tree.
22+
23+## Release Checklist
24+
25+* Check if any critical pending bugs or issues are to be included
26+* If this is a major release check if any previously deprecated features are to
27+ be removed in this release.
28+* _Documentation_:
29+
30+ * README is updated
31+ * Haddock docs are consistent with the changes in the release
32+ * Tutorial has been updated for new changes
33+ * Documents in the `docs` directory are consistent with new changes
34+ * All combinators have time and space complexity annotations
35+ * All combinators have `since` annotation
36+
37+* _Benchmarks_:
38+
39+ * Check regressions from previous release
40+ * Run benchmarks with large stream size (`bench.sh -- long`) to
41+ check for space leaks and to ensure constant memory usage for streaming
42+ operations.
43+ * Run benchmarks with `dev` flag on. Some `fileio` benchmarks are disabled
44+ in regular runs.
45+ * Check comparative benchmarks using streaming-benchmarks
46+
47+* _Tests_:
48+
49+ * Run tests with `dev` flag on. Many tests are disabled in regular runs.
50+
51+* _Examples_:
52+
53+ * Update
54+ [streamly-examples][https://github.com/composewell/streamly-examples]
55+ to make sure it runs with the latest release.
56+
57+* _Update Package Metadata:_
58+
59+ * Update `stack.yaml` to latest stable resolver, cleanup extra-deps
60+ * Make sure the description in cabal file is in sync with README and other docs
61+ * Make sure CI configs include last three major releases of GHC in CI testing.
62+ * Update `tested-with` field
63+ * Make sure all dependency bounds can use latest versions
64+ * Make sure any additional files are added to `extra-source-files` in cabal
65+ file
66+
67+* Copyrights and Contibutors
68+
69+ * Make sure contributors to the release are listed in
70+ `credits/CONTRIBUTORS.md`.
71+ * Bump the release version in `credits/CONTRIBUTORS.md`.
72+ * Make sure any third party code included in the release has been listed in
73+ `credits/COPYRIGHTS.md` and the license is added to the repo.
74+ * Change the `Unreleased` section, if exists, at the top of
75+ `credits/COPYRIGHTS.md` to the new release version number.
76+
77+* _Update changelog & Version_:
78+
79+ * Make sure all the bug fixes being included in this release are marked
80+ with a target release on github. So that users can search by release if
81+ they want.
82+ * Change the `Unreleased` section at the top of changelog file to the new
83+ release version number.
84+ * Bump the package version in cabal file or package.yaml
85+ * Bump the package version in configure.ac and run autoreconf
86+
87+* _Upload_:
88+
89+ * Wait for final CI tests to pass:
90+
91+ * Create a git tag corresponding to the release where X.Y.Z is the new
92+ package version (`git tag vX.Y.Z && git push -f origin vX.Y.Z`).
93+ * Mask out the build status lines from the README
94+ * Upload to hackage
95+ * Use a clean workspace to create source distribution
96+ by freshly cloning the git repository. The reason for
97+ doing this is that we use wild-cards in cabal file for
98+ `extra-source-files`, these wild-cards may match additional
99+ files lying around in the workspace and unintentionally ship
100+ them as well.
101+ * `cabal v2-sdist`; `cabal upload --publish <tarpath>`
102+ * `stack upload .`
103+ * Add to stackage (`build-constraints.yaml` in Stackage repo) if needed
104+ * Optionally upload `package-X.Y.Z-sdist.tar.gz` to github release page
105+ * Update release contributors on github release page
106+ (`git shortlog -s prev_tag..new_tag | sed $'s/^[0-9 \t]*/* /' | sort -f`)
107+ * Update and if needed release streaming-benchmarks package
108+ * Check https://matrix.hackage.haskell.org/package/streamly
109+ * Check haddocks on Hackage, upload if not built
110+ * Announce to haskell-cafe@haskell.org
111+
112+## Breaking Changes
113+
114+This section lists what constitutes breaking changes. See
115+https://pvp.haskell.org/ breaking changes that can be determined by the
116+API alone. We specify some additional recommendations here:
117+
118+Behavior changes, this kind of changes are nasty and should be avoided. If such
119+changes are made they should be emphasized adequately in the changelog:
120+
121+* Silent changes in the behavior of an API without any changes to the
122+ signature.
123+* Even fixing a bug could break things as users may have employed workarounds
124+ for the bug.
125+* Changes in the behavior of a dependency may also cause a change in behavior.
126+
127+Be cautious about the following:
128+
129+* Change in version bounds of dependencies may cause compilation failure for
130+ some programs because they may not be able to find a build plan.
131+* Ideally, new warnings should not be considered breaking, dependencies
132+ should never be compiled with -Werror. But packages may not be following
133+ it perfectly.
134+* Deprecating an API may issue new warnings, however the code can still be
135+ compiled if warnings are not treated as errors.
136+
137+Internal APIs:
138+
139+* Internal APIs can change without having to change the major version. However,
140+ we should try to align the Internal API changes with a major release as long
141+ as possible.
142+
143+## Managing Issues
144+
145+We label the issues in different dimensions based on the lifecyle and different
146+management aspects of the issue. The folowing sections discuss the labels used
147+to manage the issues. If a new label is required, it should be discussed before
148+creating it.
149+
150+### Disposition
151+
152+The level-1 triaging of the issue determines the current disposition
153+of the issue. If no change is required the issue must have one of the
154+following labels:
155+
156+* invalid
157+* question
158+* discussion
159+* duplicate
160+* wontfix
161+
162+If a change is required we need to do level-2 triage of the issue, see the
163+sections below.
164+
165+### Change type
166+
167+When a change is required we need to put one of the __change type__
168+labels as part of level-2 triaging:
169+
170+* performance: User visible impact on performance.
171+* usability: It is not convenient to use the library.
172+* documentation: documentation is not correct or sufficient.
173+* bug: A functionality issue, not working as expected.
174+* enhancement: A new feature or enhancement of the product.
175+* maintenance: A refactor or any other change with no user visible impact.
176+
177+### Aspect
178+
179+In addition we can put a __product aspect__ label describing a feature name or
180+any other product specific classification bucket.
181+
182+* aspect:<aspect name>
183+
184+### Severity
185+
186+Optionally we can add a severity label to indicate how severe is the
187+impact of the bug/issue, which may determine how important it is to fix it. By
188+default the severity is normal, if it is high we put a label:
189+
190+* severity:high
191+
192+### Change impact
193+
194+For a user visible issue whether it has a release/changelog impact:
195+
196+* enhancement: includes a new feature or enhancement
197+* breaking: has a breaking impact on existing deployments
198+* deprecating: deprecates an existing functionality
199+
200+__RULE__: Any commit that may affect the end user in some way MUST have
201+either a changelog entry OR MUST have an issue marked with one of the
202+above labels OR both.
203+
204+### Priority
205+
206+By default the issues are normal priority. We use a label for high priority
207+issues:
208+
209+* priority:high
210+
211+### Scheduling
212+
213+If the issue is assigned to someone then it is considered scheduled. Otherwise
214+it is unscheduled. Unassigned issues may have the following labels:
215+
216+* deferred: blocked on any other fix or a decision to be made, or deliberately
217+ deferred for some reason.
218+* help-wanted: anyone can take the issue and contribute
219+
220+## Correlating Changes, Issues and Releases
221+
222+For planning purposes, open issues may be marked with milestones or target
223+releases. However, it may not always be known which release a fix will finally
224+land in. For example, we may decide to make a minor release instead of a major
225+one if there are no breaking changes yet, so we may not always know what would
226+be the next release version.
227+
228+Trackability means that we should be able to find which issues got fixed in
229+which release. Or what all issues got fixed in a particular release. We track
230+significant changes using the changelog. However, there may be more changes
231+that can only be tracked via issues, PRs or commits. When we make a release we
232+can mark all the issues fixed in that release with a correct release target for
233+future trackability.
234+
235+For better trackability of which issue got fixed in which release we need the
236+following:
237+
238+* Before you close an issue make sure a commit or a PR fixing the issue is
239+ attached with it. In the commit message you can reference an issue like
240+ "fixes #50", you can do the same in a PR as well.
241+* Before we make a new release EVERY issue with a commit included in that
242+ release that affects the end user, especially bugs and breaking changes MUST
243+ have the target release correctly set.
244+
245+## Changelog Management
246+
247+Keep the unreleased changes in the `Unreleased` section at the top of changelog
248+file. Using `Unreleased` instead of the next release number for unreleased
249+changes is important. First, we do not know the next release number in advance,
250+it could be a major or minor release. Second, if we use the next release
251+number instead, then when adding a new change to the changelog, at one look we
252+cannot know whether the release number on top is unreleased or released.
253+
254+## TODO
255+
256+* GPG signed releases and tags
README.mdmode 120000 → 100644+606−1
@@ -1 +0,0 @@
1−docs/User/Project/README.md
@@ -0,0 +1,606 @@
1+# Streamly
2+
3+[![Hackage](https://img.shields.io/hackage/v/streamly.svg?style=flat)](https://hackage.haskell.org/package/streamly)
4+[![Gitter chat](https://badges.gitter.im/composewell/gitter.svg)](https://gitter.im/composewell/streamly)
5+[![Travis](https://travis-ci.com/composewell/streamly.svg?branch=master)](https://travis-ci.com/composewell/streamly)
6+[![Appveyor](https://ci.appveyor.com/api/projects/status/ajxg0c79raou9ned?svg=true)](https://ci.appveyor.com/project/harendra-kumar/streamly)
7+[![CircleCI](https://circleci.com/gh/composewell/streamly/tree/master.svg?style=svg)](https://circleci.com/gh/composewell/streamly/tree/master)
8+[![Coverage Status](https://coveralls.io/repos/composewell/streamly/badge.svg?branch=master&service=github)](https://coveralls.io/github/composewell/streamly?branch=master)
9+
10+## Learning Materials
11+
12+* Documentation: [Quick](#streaming-concurrently) | [Tutorial](https://hackage.haskell.org/package/streamly/docs/Streamly-Tutorial.html) | [Reference (Hackage)](https://hackage.haskell.org/package/streamly) | [Reference (Latest)](https://composewell.github.io/streamly) | [Guides](docs)
13+* Installing: [Installing](./INSTALL.md) | [Building for optimal performance](docs/Build.md)
14+* Examples: [streamly](examples) | [streamly-examples](https://github.com/composewell/streamly-examples)
15+* Benchmarks: [Streaming](https://github.com/composewell/streaming-benchmarks) | [Concurrency](https://github.com/composewell/concurrency-benchmarks)
16+* Talks: [Functional Conf 2019 Video](https://www.youtube.com/watch?v=uzsqgdMMgtk) | [Functional Conf 2019 Slides](https://www.slideshare.net/HarendraKumar10/streamly-concurrent-data-flow-programming)
17+
18+## Streaming Concurrently
19+
20+Haskell lists express pure computations using composable stream operations like
21+`:`, `unfold`, `map`, `filter`, `zip` and `fold`. Streamly is exactly like
22+lists except that it can express sequences of pure as well as monadic
23+computations aka streams. More importantly, it can express monadic sequences
24+with concurrent execution semantics without introducing any additional APIs.
25+
26+Streamly expresses concurrency using standard, well known abstractions.
27+Concurrency semantics are defined for list operations, semigroup, applicative
28+and monadic compositions. Programmer does not need to know any low level
29+notions of concurrency like threads, locking or synchronization. Concurrent
30+and non-concurrent programs are fundamentally the same. A chosen segment of
31+the program can be made concurrent by annotating it with an appropriate
32+combinator. We can choose a combinator for lookahead style or asynchronous
33+concurrency. Concurrency is automatically scaled up or down based on the
34+demand from the consumer application, we can finally say goodbye to managing
35+thread pools and associated sizing issues. The result is truly fearless
36+and declarative monadic concurrency.
37+
38+## Where to use streamly?
39+
40+Streamly is a general purpose programming framework. It can be used equally
41+efficiently from a simple `Hello World!` program to a massively concurrent
42+application. The answer to the question, "where to use streamly?" - would be
43+similar to the answer to - "Where to use Haskell lists or the IO monad?".
44+
45+Streamly simplifies streaming and makes it as intuitive as plain lists. Unlike
46+other streaming libraries, no fancy types are required. Streamly is simply a
47+generalization of Haskell lists to monadic streaming optionally with concurrent
48+composition. The basic stream type in streamly `SerialT m a` can be considered
49+as a list type `[a]` parameterized by the monad `m`. For example, `SerialT IO
50+a` is a moral equivalent of `[a]` in the IO monad. `SerialT Identity a`, is
51+equivalent to pure lists. Streams are constructed very much like lists, except
52+that they use `nil` and `cons` instead of `[]` and `:`. Unlike lists, streams
53+can be constructed from monadic effects, not just pure elements. Streams are
54+processed just like lists, with list like combinators, except that they are
55+monadic and work in a streaming fashion. In other words streamly just completes
56+what lists lack, you do not need to learn anything new. Please see [streamly vs
57+lists](docs/streamly-vs-lists.md) for a detailed comparison.
58+
59+Not surprisingly, the monad instance of streamly is a list transformer, with
60+concurrency capability.
61+
62+## Why data flow programming?
63+
64+If you need some convincing for using streaming or data flow programming
65+paradigm itself then try to answer this question - why do we use lists in
66+Haskell? It boils down to why we use functional programming in the first place.
67+Haskell is successful in enforcing the functional data flow paradigm for pure
68+computations using lists, but not for monadic computations. In the absence of a
69+standard and easy to use data flow programming paradigm for monadic
70+computations, and the IO monad providing an escape hatch to an imperative
71+model, we just love to fall into the imperative trap, and start asking the same
72+fundamental question again - why do we have to use the streaming data model?
73+
74+## Comparative Performance
75+
76+High performance and simplicity are the two primary goals of streamly.
77+`Streamly` employs two different stream representations (CPS and direct style)
78+and interconverts between the two to get the best of both worlds on different
79+operations. It uses both foldr/build (for CPS style) and stream fusion (for
80+direct style) techniques to fuse operations. In terms of performance,
81+Streamly's goal is to compete with equivalent C programs. Streamly redefines
82+"blazing fast" for streaming libraries, it competes with lists and `vector`.
83+Other streaming libraries like "streaming", "pipes" and "conduit" are orders of
84+magnitude slower on most microbenchmarks. See [streaming
85+benchmarks](https://github.com/composewell/streaming-benchmarks) for detailed
86+comparison.
87+
88+The following chart shows a comparison of those streamly and list operations
89+where performance of the two differs by more than 10%. Positive y-axis displays
90+how many times worse is a list operation compared to the same streamly
91+operation, negative y-axis shows where streamly is worse compared to lists.
92+
93+![Streamly vs Lists (time) comparison](charts-0/streamly-vs-list-time.svg)
94+
95+Streamly uses lock-free synchronization for concurrent operations. It employs
96+auto-scaling of the degree of concurrency based on demand. For CPU bound tasks
97+it tries to keep the threads close to the number of CPUs available whereas for
98+IO bound tasks more threads can be utilized. Parallelism can be utilized with
99+little overhead even if the task size is very small. See [concurrency
100+benchmarks](https://github.com/composewell/concurrency-benchmarks) for detailed
101+performance results and a comparison with the `async` package.
102+
103+## Installing and using
104+
105+Please see [INSTALL.md](./INSTALL.md) for instructions on how to use streamly
106+with your Haskell build tool or package manager. You may want to go through it
107+before jumping to run the examples below.
108+
109+The module `Streamly.Prelude` provides the core stream types and combinators
110+for type casting, controlling concurrency, stream construction, transformation,
111+folding, merging, and zipping.
112+
113+## Streaming Pipelines
114+
115+The following snippet provides a simple stream composition example that reads
116+numbers from stdin, prints the squares of even numbers and exits if an even
117+number more than 9 is entered.
118+
119+``` haskell
120+import qualified Streamly.Prelude as S
121+import Data.Function ((&))
122+
123+main = S.drain $
124+ S.repeatM getLine
125+ & fmap read
126+ & S.filter even
127+ & S.takeWhile (<= 9)
128+ & fmap (\x -> x * x)
129+ & S.mapM print
130+```
131+
132+Unlike `pipes` or `conduit` and like `vector` and `streaming`, `streamly`
133+composes stream data instead of stream processors (functions). A stream is
134+just like a list and is explicitly passed around to functions that process the
135+stream. Therefore, no special operator is needed to join stages in a streaming
136+pipeline, just the standard function application (`$`) or reverse function
137+application (`&`) operator is enough.
138+
139+## Concurrent Stream Generation
140+
141+`consM` or its operator form `|:` can be used to construct a stream from
142+monadic actions. A stream constructed with `consM` can run the monadic actions
143+in the stream concurrently when used with appropriate stream type combinator
144+(e.g. `asyncly`, `aheadly` or `parallely`).
145+
146+The following code finishes in 3 seconds (6 seconds when serial), note the
147+order of elements in the resulting output, the outputs are consumed as soon as
148+each action is finished (asyncly):
149+
150+``` haskell
151+> let p n = threadDelay (n * 1000000) >> return n
152+> S.toList $ S.asyncly $ p 3 |: p 2 |: p 1 |: S.nil
153+[1,2,3]
154+```
155+
156+Use `aheadly` if you want speculative concurrency i.e. execute the actions in
157+the stream concurrently but consume the results in the specified order:
158+
159+``` haskell
160+> S.toList $ S.aheadly $ p 3 |: p 2 |: p 1 |: S.nil
161+[3,2,1]
162+```
163+
164+Monadic stream generation functions e.g. `unfoldrM`, `replicateM`, `repeatM`,
165+`iterateM` and `fromFoldableM` etc. can work concurrently.
166+
167+The following finishes in 10 seconds (100 seconds when serial):
168+
169+``` haskell
170+S.drain $ S.asyncly $ S.replicateM 10 $ p 10
171+```
172+
173+## Concurrency Auto Scaling
174+
175+Concurrency is auto-scaled i.e. more actions are executed concurrently if the
176+consumer is consuming the stream at a higher speed. How many tasks are executed
177+concurrently can be controlled by `maxThreads` and how many results are
178+buffered ahead of consumption can be controlled by `maxBuffer`. See the
179+documentation in the `Streamly.Prelude` module.
180+
181+## Concurrent Streaming Pipelines
182+
183+Use `|&` or `|$` to apply stream processing functions concurrently. The
184+following example prints a "hello" every second; if you use `&` instead of
185+`|&` you will see that the delay doubles to 2 seconds instead because of serial
186+application.
187+
188+``` haskell
189+main = S.drain $
190+ S.repeatM (threadDelay 1000000 >> return "hello")
191+ |& S.mapM (\x -> threadDelay 1000000 >> putStrLn x)
192+```
193+
194+## Mapping Concurrently
195+
196+We can use `mapM` or `sequence` functions concurrently on a stream.
197+
198+``` haskell
199+> let p n = threadDelay (n * 1000000) >> return n
200+> S.drain $ S.aheadly $ S.mapM (\x -> p 1 >> print x) (S.serially $ S.repeatM (p 1))
201+```
202+
203+## Serial and Concurrent Merging
204+
205+Semigroup and Monoid instances can be used to fold streams serially or
206+concurrently. In the following example we compose ten actions in the
207+stream, each with a delay of 1 to 10 seconds, respectively. Since all the
208+actions are concurrent we see one output printed every second:
209+
210+``` haskell
211+import qualified Streamly.Prelude as S
212+import Control.Concurrent (threadDelay)
213+
214+main = S.toList $ S.parallely $ foldMap delay [1..10]
215+ where delay n = S.yieldM $ threadDelay (n * 1000000) >> print n
216+```
217+
218+Streams can be combined together in many ways. We provide some examples
219+below, see the tutorial for more ways. We use the following `delay`
220+function in the examples to demonstrate the concurrency aspects:
221+
222+``` haskell
223+import qualified Streamly.Prelude as S
224+import Control.Concurrent
225+
226+delay n = S.yieldM $ do
227+ threadDelay (n * 1000000)
228+ tid <- myThreadId
229+ putStrLn (show tid ++ ": Delay " ++ show n)
230+```
231+### Serial
232+
233+``` haskell
234+main = S.drain $ delay 3 <> delay 2 <> delay 1
235+```
236+```
237+ThreadId 36: Delay 3
238+ThreadId 36: Delay 2
239+ThreadId 36: Delay 1
240+```
241+
242+### Parallel
243+
244+``` haskell
245+main = S.drain . S.parallely $ delay 3 <> delay 2 <> delay 1
246+```
247+```
248+ThreadId 42: Delay 1
249+ThreadId 41: Delay 2
250+ThreadId 40: Delay 3
251+```
252+
253+## Nested Loops (aka List Transformer)
254+
255+The monad instance composes like a list monad.
256+
257+``` haskell
258+import qualified Streamly.Prelude as S
259+
260+loops = do
261+ x <- S.fromFoldable [1,2]
262+ y <- S.fromFoldable [3,4]
263+ S.yieldM $ putStrLn $ show (x, y)
264+
265+main = S.drain loops
266+```
267+```
268+(1,3)
269+(1,4)
270+(2,3)
271+(2,4)
272+```
273+
274+## Concurrent Nested Loops
275+
276+To run the above code with speculative concurrency i.e. each iteration in the
277+loop can run concurrently but the results are presented to the consumer of the
278+output in the same order as serial execution:
279+
280+``` haskell
281+main = S.drain $ S.aheadly $ loops
282+```
283+
284+Different stream types execute the loop iterations in different ways. For
285+example, `wSerially` interleaves the loop iterations. There are several
286+concurrent stream styles to execute the loop iterations concurrently in
287+different ways, see the `Streamly.Tutorial` module for a detailed treatment.
288+
289+## Magical Concurrency
290+
291+Streams can perform semigroup (<>) and monadic bind (>>=) operations
292+concurrently using combinators like `asyncly`, `parallelly`. For example,
293+to concurrently generate squares of a stream of numbers and then concurrently
294+sum the square roots of all combinations of two streams:
295+
296+``` haskell
297+import qualified Streamly.Prelude as S
298+
299+main = do
300+ s <- S.sum $ S.asyncly $ do
301+ -- Each square is performed concurrently, (<>) is concurrent
302+ x2 <- foldMap (\x -> return $ x * x) [1..100]
303+ y2 <- foldMap (\y -> return $ y * y) [1..100]
304+ -- Each addition is performed concurrently, monadic bind is concurrent
305+ return $ sqrt (x2 + y2)
306+ print s
307+```
308+
309+The concurrency facilities provided by streamly can be compared with
310+[OpenMP](https://en.wikipedia.org/wiki/OpenMP) and
311+[Cilk](https://en.wikipedia.org/wiki/Cilk) but with a more declarative
312+expression.
313+
314+## Example: Listing Directories Recursively/Concurrently
315+
316+The following code snippet lists a directory tree recursively, reading multiple
317+directories concurrently:
318+
319+```haskell
320+import Control.Monad.IO.Class (liftIO)
321+import Path.IO (listDir, getCurrentDir) -- from path-io package
322+import Streamly.Prelude (AsyncT, adapt)
323+import qualified Streamly.Prelude as S
324+
325+listDirRecursive :: AsyncT IO ()
326+listDirRecursive = getCurrentDir >>= readdir >>= liftIO . mapM_ putStrLn
327+ where
328+ readdir dir = do
329+ (dirs, files) <- listDir dir
330+ S.yield (map show dirs ++ map show files) <> foldMap readdir dirs
331+
332+main :: IO ()
333+main = S.drain $ adapt $ listDirRecursive
334+```
335+
336+`AsyncT` is a stream monad transformer. If you are familiar with a list
337+transformer, it is nothing but `ListT` with concurrency semantics. For example,
338+the semigroup operation `<>` is concurrent. This makes `foldMap` concurrent
339+too. You can replace `AsyncT` with `SerialT` and the above code will become
340+serial, exactly equivalent to a `ListT`.
341+
342+## Rate Limiting
343+
344+For bounded concurrent streams, stream yield rate can be specified. For
345+example, to print hello once every second you can simply write this:
346+
347+``` haskell
348+import Streamly.Prelude as S
349+
350+main = S.drain $ S.asyncly $ S.avgRate 1 $ S.repeatM $ putStrLn "hello"
351+```
352+
353+For some practical uses of rate control, see
354+[AcidRain.hs](https://github.com/composewell/streamly/tree/master/examples/AcidRain.hs)
355+and
356+[CirclingSquare.hs](https://github.com/composewell/streamly/tree/master/examples/CirclingSquare.hs)
357+.
358+Concurrency of the stream is automatically controlled to match the specified
359+rate. Rate control works precisely even at throughputs as high as millions of
360+yields per second. For more sophisticated rate control see the haddock
361+documentation.
362+
363+## Arrays
364+
365+The `Streamly.Data.Array.Storable.Foreign` module provides immutable arrays. Arrays are the
366+computing duals of streams. Streams are good at sequential access and immutable
367+transformations of in-transit data whereas arrays are good at random access and
368+in-place transformations of buffered data. Unlike streams which are potentially
369+infinite, arrays are necessarily finite. Arrays can be used as an efficient
370+interface between streams and external storage systems like memory, files and
371+network. Streams and arrays complete each other to provide a general purpose
372+computing system. The design of streamly as a general purpose computing
373+framework is centered around these two fundamental aspects of computing and
374+storage.
375+
376+`Streamly.Data.Array.Storable.Foreign` uses pinned memory outside GC and therefore avoid any
377+GC overhead for the storage in arrays. Streamly allows efficient
378+transformations over arrays using streams. It uses arrays to transfer data to
379+and from the operating system and to store data in memory.
380+
381+## Folds
382+
383+Folds are consumers of streams. `Streamly.Data.Fold` module provides a `Fold`
384+type that represents a `foldl'`. Such folds can be efficiently composed
385+allowing the compiler to perform stream fusion and therefore implement high
386+performance combinators for consuming streams. A stream can be distributed to
387+multiple folds, or it can be partitioned across multiple folds, or
388+demultiplexed over multiple folds, or unzipped to two folds. We can also use
389+folds to fold segments of stream generating a stream of the folded results.
390+
391+If you are familiar with the `foldl` library, these are the same composable
392+left folds but simpler and better integrated with streamly, and with many more
393+powerful ways of composing and applying them.
394+
395+## Unfolds
396+
397+Unfolds are duals of folds. Folds help us compose consumers of streams
398+efficiently and unfolds help us compose producers of streams efficiently.
399+`Streamly.Data.Unfold` provides an `Unfold` type that represents an `unfoldr`
400+or a stream generator. Such generators can be combined together efficiently
401+allowing the compiler to perform stream fusion and implement high performance
402+stream merging combinators.
403+
404+## File IO
405+
406+The following code snippets implement some common Unix command line utilities
407+using streamly. You can compile these with `ghc -O2 -fspec-constr-recursive=16
408+-fmax-worker-args=16` and compare the performance with regular GNU coreutils
409+available on your system. Though many of these are not most optimal solutions
410+to keep them short and elegant. Source file
411+[HandleIO.hs](https://github.com/composewell/streamly/tree/master/examples/HandleIO.hs)
412+in the examples directory includes these examples.
413+
414+``` haskell
415+module Main where
416+
417+import qualified Streamly.Prelude as S
418+import qualified Streamly.Data.Fold as FL
419+import qualified Streamly.Data.Array.Storable.Foreign as A
420+import qualified Streamly.FileSystem.Handle as FH
421+import qualified System.IO as FH
422+
423+import Data.Char (ord)
424+import System.Environment (getArgs)
425+import System.IO (openFile, IOMode(..), stdout)
426+
427+withArg f = do
428+ (name : _) <- getArgs
429+ src <- openFile name ReadMode
430+ f src
431+
432+withArg2 f = do
433+ (sname : dname : _) <- getArgs
434+ src <- openFile sname ReadMode
435+ dst <- openFile dname WriteMode
436+ f src dst
437+```
438+
439+### cat
440+
441+``` haskell
442+cat = S.fold (FH.writeChunks stdout) . S.unfold FH.readChunks
443+main = withArg cat
444+```
445+
446+### cp
447+
448+``` haskell
449+cp src dst = S.fold (FH.writeChunks dst) $ S.unfold FH.readChunks src
450+main = withArg2 cp
451+```
452+
453+### wc -l
454+
455+``` haskell
456+wcl = S.length . S.splitOn (== 10) FL.drain . S.unfold FH.read
457+main = withArg wcl >>= print
458+```
459+
460+### Average Line Length
461+
462+``` haskell
463+avgll =
464+ S.fold avg
465+ . S.splitOn (== 10) FL.length
466+ . S.unfold FH.read
467+
468+ where avg = (/) <$> toDouble FL.sum <*> toDouble FL.length
469+ toDouble = fmap (fromIntegral :: Int -> Double)
470+
471+main = withArg avgll >>= print
472+```
473+
474+### Line Length Histogram
475+
476+`classify` is not released yet, and is available in
477+`Streamly.Internal.Data.Fold`
478+
479+``` haskell
480+llhisto =
481+ S.fold (FL.classify FL.length)
482+ . S.map bucket
483+ . S.splitOn (== 10) FL.length
484+ . S.unfold FH.read
485+
486+ where
487+ bucket n = let i = n `mod` 10 in if i > 9 then (9,n) else (i,n)
488+
489+main = withArg llhisto >>= print
490+```
491+
492+## Socket IO
493+
494+Its easy to build concurrent client and server programs using streamly.
495+`Streamly.Network.*` modules provide easy combinators to build network servers
496+and client programs using streamly. See
497+[FromFileClient.hs](https://github.com/composewell/streamly/tree/master/examples/FromFileClient.hs),
498+[EchoServer.hs](https://github.com/composewell/streamly/tree/master/examples/EchoServer.hs),
499+[FileSinkServer.hs](https://github.com/composewell/streamly/tree/master/examples/FileSinkServer.hs)
500+in the examples directory.
501+
502+## Exceptions
503+
504+Exceptions can be thrown at any point using the `MonadThrow` instance. Standard
505+exception handling combinators like `bracket`, `finally`, `handle`,
506+`onException` are provided in `Streamly.Prelude` module.
507+
508+In presence of concurrency, synchronous exceptions work just the way they are
509+supposed to work in non-concurrent code. When concurrent streams
510+are combined together, exceptions from the constituent streams are propagated
511+to the consumer stream. When an exception occurs in any of the constituent
512+streams other concurrent streams are promptly terminated.
513+
514+There is no notion of explicit threads in streamly, therefore, no
515+asynchronous exceptions to deal with. You can just ignore the zillions of
516+blogs, talks, caveats about async exceptions. Async exceptions just don't
517+exist. Please don't use things like `myThreadId` and `throwTo` just for fun!
518+
519+## Reactive Programming (FRP)
520+
521+Streamly is a foundation for first class reactive programming as well by virtue
522+of integrating concurrency and streaming. See
523+[AcidRain.hs](https://github.com/composewell/streamly/tree/master/examples/AcidRain.hs)
524+for a console based FRP game example and
525+[CirclingSquare.hs](https://github.com/composewell/streamly/tree/master/examples/CirclingSquare.hs)
526+for an SDL based animation example.
527+
528+## Conclusion
529+
530+Streamly, short for streaming concurrently, provides monadic streams, with a
531+simple API, almost identical to standard lists, and an in-built
532+support for concurrency. By using stream-style combinators on stream
533+composition, streams can be generated, merged, chained, mapped, zipped, and
534+consumed concurrently – providing a generalized high level programming
535+framework unifying streaming and concurrency. Controlled concurrency allows
536+even infinite streams to be evaluated concurrently. Concurrency is auto scaled
537+based on feedback from the stream consumer. The programmer does not have to be
538+aware of threads, locking or synchronization to write scalable concurrent
539+programs.
540+
541+Streamly is a programmer first library, designed to be useful and friendly to
542+programmers for solving practical problems in a simple and concise manner. Some
543+key points in favor of streamly are:
544+
545+ * _Simplicity_: Simple list like streaming API, if you know how to use lists
546+ then you know how to use streamly. This library is built with simplicity
547+ and ease of use as a design goal.
548+ * _Concurrency_: Simple, powerful, and scalable concurrency. Concurrency is
549+ built-in, and not intrusive, concurrent programs are written exactly the
550+ same way as non-concurrent ones.
551+ * _Generality_: Unifies functionality provided by several disparate packages
552+ (streaming, concurrency, list transformer, logic programming, reactive
553+ programming) in a concise API.
554+ * _Performance_: Streamly is designed for high performance. It employs stream
555+ fusion optimizations for best possible performance. Serial peformance is
556+ equivalent to the venerable `vector` library in most cases and even better
557+ in some cases. Concurrent performance is unbeatable. See
558+ [streaming-benchmarks](https://github.com/composewell/streaming-benchmarks)
559+ for a comparison of popular streaming libraries on micro-benchmarks.
560+
561+The basic streaming functionality of streamly is equivalent to that provided by
562+streaming libraries like
563+[vector](https://hackage.haskell.org/package/vector),
564+[streaming](https://hackage.haskell.org/package/streaming),
565+[pipes](https://hackage.haskell.org/package/pipes), and
566+[conduit](https://hackage.haskell.org/package/conduit).
567+In addition to providing streaming functionality, streamly subsumes
568+the functionality of list transformer libraries like `pipes` or
569+[list-t](https://hackage.haskell.org/package/list-t), and also the logic
570+programming library [logict](https://hackage.haskell.org/package/logict). On
571+the concurrency side, it subsumes the functionality of the
572+[async](https://hackage.haskell.org/package/async) package, and provides even
573+higher level concurrent composition. Because it supports
574+streaming with concurrency we can write FRP applications similar in concept to
575+[Yampa](https://hackage.haskell.org/package/Yampa) or
576+[reflex](https://hackage.haskell.org/package/reflex).
577+
578+See the `Comparison with existing packages` section at the end of the
579+[tutorial](https://hackage.haskell.org/package/streamly/docs/Streamly-Tutorial.html).
580+
581+## Support
582+
583+Please feel free to ask questions on the
584+[streamly gitter channel](https://gitter.im/composewell/streamly).
585+If you require professional support, consulting, training or timely
586+enhancements to the library please contact
587+[support@composewell.com](mailto:support@composewell.com).
588+
589+## Credits
590+
591+The following authors/libraries have influenced or inspired this library in a
592+significant way:
593+
594+ * Roman Leshchinskiy ([vector](http://hackage.haskell.org/package/vector))
595+ * Gabriel Gonzalez ([foldl](https://hackage.haskell.org/package/foldl))
596+ * Alberto G. Corona ([transient](https://hackage.haskell.org/package/transient))
597+
598+See the `credits` directory for full list of contributors, credits and licenses.
599+
600+## Contributing
601+
602+The code is available under BSD-3 license
603+[on github](https://github.com/composewell/streamly). Join the [gitter
604+chat](https://gitter.im/composewell/streamly) channel for discussions. Please
605+ask any questions on the gitter channel or [contact the maintainer
606+directly](mailto:streamly@composewell.com). All contributions are welcome!
appveyor.yml+6−7
@@ -14,8 +14,6 @@ environment:
1414 # ------------------------------------------------------------------------
1515 # Common options
1616 # ------------------------------------------------------------------------
17− # GHC 9.2.7 onwards redundant constraint warnings are incompatible with
18− # older versions
1917 GHC_OPTIONS: "-Werror"
2018 CABAL_REINIT_CONFIG: "y"
2119 LC_ALL: "C.UTF-8"
@@ -36,17 +34,18 @@ environment:
3634 # Note requiring a specific version of stack using STACKVER may fail due to
3735 # github API limit while checking and upgrading/downgrading to the specific
3836 # version.
39− # STACKVER: "1.6.5"
37+ #STACKVER: "1.6.5"
4038 STACK_UPGRADE: "y"
41− # RESOLVER: "lts-18.27"
39+ RESOLVER: "lts-16.12"
4240 STACK_ROOT: "c:\\sr"
4341 STACK_BUILD_OPTIONS: "--flag streamly-benchmarks:-opt"
44− STACK_YAML: "stack.yaml"
4542
4643 # ------------------------------------------------------------------------
4744 # cabal options
4845 # ------------------------------------------------------------------------
4946 CABAL_CHECK_RELAX: "y"
47+ CABAL_NO_SANDBOX: "y"
48+ CABAL_HACKAGE_MIRROR: "hackage.haskell.org:http://hackage.fpcomplete.com"
5049
5150 # ------------------------------------------------------------------------
5251 # Where to find the required tools
@@ -64,8 +63,8 @@ environment:
6463 PACKCHECK_LOCAL_PATH: "./packcheck.sh"
6564 # If you have not committed packcheck.sh in your repo at PACKCHECK_LOCAL_PATH
6665 # then it is automatically pulled from this URL.
67− PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
68− PACKCHECK_GITHUB_COMMIT: "35efa99b2082d13722b8a0183ac6455df98e91b9"
66+ PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/harendra-kumar/packcheck"
67+ PACKCHECK_GITHUB_COMMIT: "563702bd02c41343dcd3dfcfef0845ca428a9240"
6968
7069 # Override the temp directory to avoid sed escaping issues
7170 # See https://github.com/haskell/cabal/issues/5386
benchmark/Chart.hsnew file+194
@@ -0,0 +1,194 @@
1+{-# LANGUAGE RecordWildCards #-}
2+{-# LANGUAGE ScopedTypeVariables #-}
3+
4+module Main where
5+
6+import Control.Exception (catch, ErrorCall(..))
7+import Control.Monad.Trans.State
8+import Control.Monad.Trans.Maybe
9+import Data.Char (toLower)
10+import Data.List
11+import System.Environment (getArgs)
12+import Control.Monad.IO.Class (liftIO)
13+import Control.Monad (mzero)
14+
15+import BenchShow
16+
17+------------------------------------------------------------------------------
18+-- Command line parsing
19+------------------------------------------------------------------------------
20+
21+data BenchType
22+ = Compare String
23+ | Standard String
24+ deriving Show
25+
26+data Options = Options
27+ { genGraphs :: Bool
28+ , benchType :: Maybe BenchType
29+ , fields :: [String]
30+ } deriving Show
31+
32+defaultOptions :: Options
33+defaultOptions = Options False Nothing ["time"]
34+
35+setGenGraphs :: Monad m => Bool -> StateT (a, Options) m ()
36+setGenGraphs val = do
37+ (args, opts) <- get
38+ put (args, opts { genGraphs = val })
39+
40+setBenchType :: Monad m => BenchType -> StateT (a, Options) m ()
41+setBenchType val = do
42+ (args, opts) <- get
43+ put (args, opts { benchType = Just val })
44+
45+setFields :: Monad m => [String] -> StateT (a, Options) m ()
46+setFields val = do
47+ (args, opts) <- get
48+ put (args, opts { fields = val })
49+
50+-- Like the shell "shift" to shift the command line arguments
51+shift :: StateT ([String], Options) (MaybeT IO) (Maybe String)
52+shift = do
53+ s <- get
54+ case s of
55+ ([], _) -> return Nothing
56+ (x : xs, opts) -> put (xs, opts) >> return (Just x)
57+
58+parseBench :: StateT ([String], Options) (MaybeT IO) ()
59+parseBench = do
60+ x <- shift
61+ case x of
62+ Just str | "_cmp" `isSuffixOf` str -> setBenchType (Compare str)
63+ Just str -> setBenchType (Standard str)
64+ Nothing -> do
65+ liftIO $ putStrLn "please provide a benchmark type "
66+ mzero
67+
68+parseFields :: StateT ([String], Options) (MaybeT IO) ()
69+parseFields = do
70+ x <- shift
71+ case x of
72+ Just str -> setFields (words str)
73+ Nothing -> do
74+ liftIO $ putStrLn
75+ "please provide a list of fields after --fields"
76+ mzero
77+
78+-- totally imperative style option parsing
79+parseOptions :: IO (Maybe Options)
80+parseOptions = do
81+ args <- getArgs
82+ runMaybeT $ flip evalStateT (args, defaultOptions) $ do
83+ parseLoop
84+ fmap snd get
85+
86+ where
87+
88+ parseOpt opt =
89+ case opt of
90+ "--graphs" -> setGenGraphs True
91+ "--benchmark" -> parseBench
92+ "--fields" -> parseFields
93+ str -> do
94+ liftIO $ putStrLn $ "Unrecognized option " <> str
95+ mzero
96+
97+ parseLoop = do
98+ next <- shift
99+ case next of
100+ Just opt -> parseOpt opt >> parseLoop
101+ Nothing -> return ()
102+
103+ignoringErr :: IO () -> IO ()
104+ignoringErr a = catch a (\(ErrorCall err :: ErrorCall) ->
105+ putStrLn $ "Failed with error:\n" <> err <> "\nSkipping.")
106+
107+------------------------------------------------------------------------------
108+-- Generic
109+------------------------------------------------------------------------------
110+
111+makeGraphs :: String -> Config -> String -> IO ()
112+makeGraphs name cfg@Config{..} inputFile =
113+ ignoringErr $ graph inputFile name cfg
114+
115+------------------------------------------------------------------------------
116+-- Arrays
117+------------------------------------------------------------------------------
118+
119+showComparisons :: Options -> Config -> FilePath -> FilePath -> IO ()
120+showComparisons Options{..} cfg inp out =
121+ let cfg1 = cfg { classifyBenchmark = classifyComparison }
122+ in if genGraphs
123+ then ignoringErr $ graph inp "comparison"
124+ cfg1 { outputDir = Just out
125+ , presentation = Groups Absolute
126+ }
127+ else ignoringErr $ report inp Nothing cfg1
128+
129+ where
130+
131+ dropComponent = dropWhile (== '/') . dropWhile (/= '/')
132+
133+ classifyComparison b = Just
134+ ( takeWhile (/= '/') b
135+ , dropComponent b
136+ )
137+
138+------------------------------------------------------------------------------
139+-- text reports
140+------------------------------------------------------------------------------
141+
142+selectBench
143+ :: (SortColumn -> Maybe GroupStyle -> Either String [(String, Double)])
144+ -> [String]
145+selectBench f =
146+ reverse
147+ $ fmap fst
148+ $ either
149+ (const $ either error (sortOn snd) $ f (ColumnIndex 0) (Just PercentDiff))
150+ (sortOn snd)
151+ $ f (ColumnIndex 1) (Just PercentDiff)
152+
153+benchShow ::
154+ Options
155+ -> Config
156+ -> (Config -> String -> IO ())
157+ -> String
158+ -> FilePath
159+ -> IO ()
160+benchShow Options{..} cfg func inp out =
161+ if genGraphs
162+ then func cfg {outputDir = Just out} inp
163+ else ignoringErr $ report inp Nothing cfg
164+
165+main :: IO ()
166+main = do
167+ res <- parseOptions
168+ case res of
169+ Nothing -> do
170+ putStrLn "cannot parse options"
171+ return ()
172+ Just opts@Options{fields = fs, benchType = btype} ->
173+ let cfg = defaultConfig
174+ { presentation = Groups PercentDiff
175+ , selectBenchmarks = selectBench
176+ , selectFields = filter
177+ ( flip elem fs
178+ . fmap toLower
179+ )
180+ }
181+ in case btype of
182+ Just (Compare str) ->
183+ showComparisons opts cfg
184+ { title = Just str }
185+ ("charts/" ++ str ++ "/results.csv")
186+ ("charts/" ++ str)
187+ Just (Standard str) ->
188+ benchShow opts cfg
189+ { title = Just str }
190+ (makeGraphs str)
191+ ("charts/" ++ str ++ "/results.csv")
192+ ("charts/" ++ str)
193+ Nothing ->
194+ error "Please specify a benchmark using --benchmark."
benchmark/NanoBenchmarks.hs+22−27
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
31-------------------------------------------------------------------------------
42-- Investigate specific benchmarks more closely in isolation, possibly looking
53-- at GHC generated code for optimizing specific problematic cases.
@@ -8,27 +6,30 @@
86{-# LANGUAGE FlexibleContexts #-}
97{-# LANGUAGE ScopedTypeVariables #-}
108
11−import Data.Char (ord)
12−import Streamly.Internal.Data.Stream (Stream)
13−import System.IO (hSeek, SeekMode(..), openFile, IOMode(..))
9+import Streamly.Prelude (SerialT)
10+import Streamly.Internal.Data.SVar (MonadAsync)
1411
15−import qualified Streamly.Data.Array as A
12+import qualified Streamly.Data.Array.Storable.Foreign as A
13+import qualified Streamly.FileSystem.Handle as FH
1614import qualified Streamly.Internal.FileSystem.Handle as IFH
1715import qualified Streamly.Data.Fold as FL
18−import qualified Streamly.Internal.Data.Stream as S
1916import qualified Streamly.Internal.Data.Stream.IsStream as Internal
17+import qualified Streamly.Prelude as S
18+import qualified Streamly.Internal.Data.Stream.StreamK as K
2019
21−import Test.Tasty.Bench
20+import Data.Char (ord)
21+import Gauge
22+import System.IO (hSeek, SeekMode(..), openFile, IOMode(..))
2223import System.Random
2324
2425maxValue :: Int
2526maxValue = 100000
2627
27−drain :: Monad m => S.Stream m a -> m ()
28−drain = S.fold FL.drain
28+-- type Stream = K.Stream
29+type Stream = SerialT
2930
3031{-# INLINE sourceUnfoldrM #-}
31−sourceUnfoldrM :: Monad m => Stream m Int
32+sourceUnfoldrM :: MonadAsync m => Stream m Int
3233sourceUnfoldrM = S.unfoldrM step 0
3334 where
3435 step cnt =
@@ -37,7 +38,7 @@ sourceUnfoldrM = S.unfoldrM step 0
3738 else return (Just (cnt, cnt + 1))
3839
3940{-# INLINE sourceUnfoldrMN #-}
40−sourceUnfoldrMN :: Monad m => Int -> Stream m Int
41+sourceUnfoldrMN :: MonadAsync m => Int -> Stream m Int
4142sourceUnfoldrMN n = S.unfoldrM step n
4243 where
4344 step cnt =
@@ -66,7 +67,7 @@ takeAllDropOne = S.drop 1 . S.take maxValue
6667
6768{-# INLINE takeDrop #-}
6869takeDrop :: Monad m => Stream m Int -> m ()
69−takeDrop = drain .
70+takeDrop = S.drain .
7071 takeAllDropOne . takeAllDropOne . takeAllDropOne . takeAllDropOne
7172
7273-------------------------------------------------------------------------------
@@ -81,7 +82,7 @@ dropWhileFalse = S.dropWhile (> maxValue)
8182
8283{-# INLINE dropWhileFalseX4 #-}
8384dropWhileFalseX4 :: Monad m => Stream m Int -> m ()
84−dropWhileFalseX4 = drain
85+dropWhileFalseX4 = S.drain
8586 . dropWhileFalse . dropWhileFalse . dropWhileFalse . dropWhileFalse
8687
8788-------------------------------------------------------------------------------
@@ -90,7 +91,7 @@ dropWhileFalseX4 = drain
9091
9192{-# INLINE iterateSource #-}
9293iterateSource
93− :: Monad m
94+ :: MonadAsync m
9495 => (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
9596iterateSource g i n = f i (sourceUnfoldrMN n)
9697 where
@@ -102,26 +103,20 @@ iterateSource g i n = f i (sourceUnfoldrMN n)
102103main :: IO ()
103104main = do
104105 defaultMain [bench "unfoldr" $ nfIO $
105− randomRIO (1,1) >>= \n -> drain (sourceUnfoldr n)]
106+ randomRIO (1,1) >>= \n -> S.drain (sourceUnfoldr n)]
106107 defaultMain [bench "take-drop" $ nfIO $ takeDrop sourceUnfoldrM]
107108 defaultMain [bench "dropWhileFalseX4" $
108109 nfIO $ dropWhileFalseX4 sourceUnfoldrM]
109110 defaultMain [bench "iterate-mapM" $
110− nfIO $ drain $ iterateSource (S.mapM return) 100000 10]
111+ nfIO $ S.drain $ iterateSource (S.mapM return) 100000 10]
111112
112113 inText <- openFile "benchmark/text-processing/gutenberg-500.txt" ReadMode
113114 defaultMain [mkBenchText "splitOn abc...xyz" inText $ do
114− S.fold FL.length
115− (Internal.splitOnSeq
116− (A.fromList
117− $ map (fromIntegral . ord) "abcdefghijklmnopqrstuvwxyz"
118− )
119− FL.drain
120− $ IFH.read inText
121− )
122− >>= print
115+ (S.length $ Internal.splitOnSeq (A.fromList $ map (fromIntegral . ord)
116+ "abcdefghijklmnopqrstuvwxyz") FL.drain
117+ $ IFH.toBytes inText) >>= print
123118 ]
124119 where
125120
126121 mkBenchText name h action =
127− env (hSeek h AbsoluteSeek 0) (\_ -> bench name $ nfIO action)
122+ bench name $ perRunEnv (hSeek h AbsoluteSeek 0) (\_ -> action)
benchmark/README.mdmode 120000 → 100644+229−1
@@ -1 +0,0 @@
1−../docs/Developer/Benchmarks.md
@@ -0,0 +1,229 @@
1+## Building a single benchmark suite
2+
3+```
4+$ cabal build streamly-benchmarks:Prelude.Serial
5+```
6+
7+or:
8+
9+```
10+$ cabal build --enable-benchmarks bench:Prelude.Serial
11+```
12+
13+## Building all benchmarks suites
14+
15+```
16+$ cabal build --enable-benchmarks streamly-benchmarks
17+```
18+
19+or:
20+
21+```
22+$ cabal build --enable-benchmarks all
23+```
24+
25+Disable optimization, quick build:
26+
27+```
28+$ cabal build --flag "-opt" ...
29+```
30+
31+## Build and run single benchmarks:
32+
33+For quick results you may have to use `--quick` and possibly some other
34+`gauge` options, or better use `bench.sh --quick` as described in the
35+following sections.
36+
37+```
38+$ cabal run bench:Prelude.Serial -- --quick
39+```
40+
41+`cabal bench` can be used but you cannot pass arguments (like --quick):
42+
43+```
44+$ cabal bench Prelude.Serial
45+```
46+
47+## Build and run all benchmarks
48+
49+Don't try this, it will take too long, use the `bench.sh` method instead.
50+
51+```
52+$ cabal bench all
53+```
54+
55+or:
56+
57+```
58+$ cd benchmark; cabal bench
59+```
60+
61+or this, note this command does not work from "benchmark" dir:
62+
63+```
64+$ cabal bench streamly-benchmarks
65+```
66+
67+## Building and Running Benchmarks with bench.sh
68+
69+`<streamly repo>/bin/bench.sh` script is the top level driver for
70+running benchmarks. It runs the requested benchmarks and then creates a
71+report from the results using the `bench-show` package. Try `bench.sh
72+--help` for available options to run it.
73+
74+## bench.sh: Quick start
75+
76+Run the default benchmark suites:
77+
78+```
79+$ bench.sh --quick
80+```
81+
82+You can remove the `--quick` option to run benchmark with lower speed but
83+better accuracy, or use `--slow` to even further lower the speed and increase
84+the accuracy a bit.
85+
86+Show available benchmark suites:
87+
88+```
89+$ bench.sh --benchmarks help
90+```
91+
92+Run all benchmark suites in the `serial_grp` group:
93+
94+```
95+$ bench.sh --benchmarks serial_grp
96+```
97+
98+Run `Prelude.Serial` and `Data.Parser` benchmark suites:
99+
100+```
101+$ bench.sh --benchmarks "Prelude.Serial Data.Parser"
102+```
103+
104+Run all O(1) space complexity benchmarks in `Prelude.Serial` suite:
105+
106+```
107+$ bench.sh --benchmarks Prelude.Serial -- Prelude.Serial/o-1-space
108+```
109+
110+Anything after a `--` is passed to the benchmark executable,
111+it basically selects all benchmarks starting with
112+`Prelude.Serial/o-1-space` prefix.
113+
114+Run a specific benchmark in `Prelude.Serial` suite:
115+
116+```
117+$ bench.sh --benchmarks Prelude.Serial -- Prelude.Serial/o-1-space/generation/unfoldr
118+```
119+
120+Run a benchmark directly instead of running it through `bench.sh`:
121+
122+```
123+$ cabal run bench:Prelude.Serial -- --quick Prelude.Serial/o-1-space/generation/unfoldr
124+```
125+
126+The options after `--` are the benchmark executable options.
127+
128+## Comparing results of arbitrary runs
129+
130+Note: use `--quick` and benchmark selection if you do not intend to wait for a
131+while.
132+
133+To compare two sets of results, first run the benchmarks at the baseline
134+commit:
135+
136+```
137+$ bench.sh
138+```
139+
140+And then run with the `--append` option at the commit that you want to compare
141+with the baseline. It will show the comparison with the baseline:
142+
143+```
144+$ bench.sh --append
145+```
146+
147+Append just adds the next set of results in the same results file. You can keep
148+appending more results and all of them will be compared with the baseline.
149+
150+## Comparing results of two commits
151+
152+Note: use `--quick` and benchmark selection if you do not intend to wait for a
153+while.
154+
155+You can use `--compare` to compare the previous commit with the head commit:
156+
157+```
158+$ bench.sh --compare
159+```
160+
161+To compare the head commit with some other base commit:
162+
163+```
164+$ bench.sh --compare --base d918833
165+```
166+
167+To compare two arbitrary commits:
168+
169+```
170+$ bench.sh --compare --base d918833 --candidate 38aa5f2
171+```
172+
173+Note that the above may not always work because the script and the benchmarks
174+themselves might have changed across the commits. The `--append` method is more
175+reliable to compare.
176+
177+## Comparing benchmark suites
178+
179+First see the available benchmark suites:
180+
181+```
182+$ bench.sh --benchmarks help
183+```
184+
185+You will see some benchmark suites end with `_cmp`, these are comparison
186+groups. If you run a comparison group benchmark, comparison of all the
187+benchmark suites in that group will be shown in the end. For example to compare
188+all array benchmark suites:
189+
190+```
191+$ bench.sh --benchmarks array_cmp
192+```
193+
194+## Reporting without measuring
195+
196+You can use the `--no-measure` option to report the already measured results in
197+the benchmarks results file. A results file may collect an arbitrary number of
198+results by running with `--append` multiple times. Each benchmark has its own
199+results file, for example the `Prelude.Serial` benchmark has the results file at
200+`charts/Prelude.Serial/results.csv`.
201+
202+You can also manually edit the file to remove a set of results if you like or
203+to append results from previously saved results or from some other results
204+file. After editing you can run `bench.sh` with the `--no-measure` option to
205+see the reports corresponding to the results.
206+
207+## Additional benchmark configuration
208+
209+### Stream size
210+
211+You can specify the stream size (default is 100000) to be used for
212+benchmarking:
213+
214+```
215+$ cabal run bench:Prelude.Serial -- --quick --stream-size 1000000
216+```
217+
218+### Unicode input
219+
220+In the `FileSystem.Handle` benchmark you can specify the input file as an
221+environment variable:
222+
223+```
224+$ export Benchmark_FileSystem_Handle_InputFile=./gutenberg-500.txt
225+$ cabal run FileSystem.Handle -- --quick FileSystem.Handle/o-1-space/reduce/read/S.splitOnSeq
226+```
227+
228+The automatic tests do not test unicode input, this option is useful to specify
229+a unicode text file manually.
benchmark/Streamly/Benchmark/Data/Array.hs+140−79
@@ -1,112 +1,132 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−{-# OPTIONS_GHC -Wno-orphans #-}
1+-- |
2+-- Module : Main
3+-- Copyright : (c) 2020 Composewell Technologies
4+--
5+-- License : BSD-3-Clause
6+-- Maintainer : streamly@composewell.com
37
48{-# LANGUAGE CPP #-}
9+{-# LANGUAGE FlexibleContexts #-}
510
6−#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
11+import Control.DeepSeq (NFData(..))
12+import System.Random (randomRIO)
713
8−import Control.DeepSeq (deepseq)
9−
10−import qualified Streamly.Internal.Data.Array as IA
11−import qualified GHC.Exts as GHC
14+import qualified Streamly.Benchmark.Data.ArrayOps as Ops
15+import qualified Streamly.Data.Array.Storable.Foreign as A
16+import qualified Streamly.Internal.Data.Array.Storable.Foreign as IA
17+import qualified Streamly.Prelude as S
1218
13−-- import qualified Streamly.Data.Array as A
14−import qualified Streamly.Internal.Data.Array as A
19+import Gauge
20+import Streamly.Benchmark.Common hiding (benchPureSrc)
21+import qualified Streamly.Benchmark.Prelude as P
1522
16−type Stream = A.Array
17−
18−#include "Streamly/Benchmark/Data/Array/Common.hs"
23+#ifdef MEMORY_ARRAY
24+import qualified GHC.Exts as GHC
25+import Foreign.Storable (Storable(..))
26+#endif
1927
20−instance NFData (A.Array a) where
21− {-# INLINE rnf #-}
22− rnf _ = ()
28+#if !defined(DATA_ARRAY_PRIM) && !defined(DATA_ARRAY_PRIM_PINNED)
29+import Control.DeepSeq (deepseq)
30+#endif
2331
2432-------------------------------------------------------------------------------
25−-- Benchmark helpers
33+--
2634-------------------------------------------------------------------------------
2735
36+#ifdef MEMORY_ARRAY
2837-- Drain a source that generates a pure array
2938{-# INLINE benchPureSrc #-}
30−benchPureSrc :: String -> (Int -> Stream a) -> Benchmark
39+benchPureSrc ::
40+ (NFData a, Storable a) => String -> (Int -> Ops.Stream a) -> Benchmark
3141benchPureSrc name src = benchPure name src id
42+#endif
43+
44+{-# INLINE benchIO #-}
45+benchIO :: NFData b => String -> (Int -> IO a) -> (a -> b) -> Benchmark
46+benchIO name src f = bench name $ nfIO $
47+ randomRIO (1,1) >>= src >>= return . f
3248
3349-- Drain a source that generates an array in the IO monad
3450{-# INLINE benchIOSrc #-}
35−benchIOSrc :: String -> (Int -> IO (Stream a)) -> Benchmark
36−benchIOSrc name src = benchIO name src id
37−
38−-------------------------------------------------------------------------------
39−-- Bench Ops
40−-------------------------------------------------------------------------------
41−
42−{-# INLINE sourceIntFromToFromList #-}
43−sourceIntFromToFromList :: MonadIO m => Int -> Int -> m (Stream Int)
44−sourceIntFromToFromList value n = P.return $ A.fromListN value [n..n + value]
45−
46−{-# INLINE readInstance #-}
47−readInstance :: P.String -> Stream Int
48−readInstance str =
49− let r = P.reads str
50− in case r of
51− [(x,"")] -> x
52− _ -> P.error "readInstance: no parse"
53−
54−#ifdef DEVBUILD
55−{-
56−{-# INLINE foldableFoldl' #-}
57−foldableFoldl' :: Stream Int -> Int
58−foldableFoldl' = F.foldl' (+) 0
59−
60−{-# INLINE foldableSum #-}
61−foldableSum :: Stream Int -> Int
62−foldableSum = P.sum
63−-}
51+benchIOSrc ::
52+#if !defined(DATA_ARRAY_PRIM) && !defined(DATA_ARRAY_PRIM_PINNED)
53+ NFData a =>
6454#endif
55+#ifdef MEMORY_ARRAY
56+ Storable a =>
57+#endif
58+ String -> (Int -> IO (Ops.Stream a)) -> Benchmark
59+benchIOSrc name src = benchIO name src id
6560
66−{-# INLINE sourceIsList #-}
67−sourceIsList :: Int -> Int -> Stream Int
68−sourceIsList value n = GHC.fromList [n..n+value]
69−
70−{-# INLINE sourceIsString #-}
71−sourceIsString :: Int -> Int -> Stream P.Char
72−sourceIsString value n = GHC.fromString (P.replicate (n + value) 'a')
61+{-# INLINE benchPureSink #-}
62+benchPureSink :: NFData b => Int -> String -> (Ops.Stream Int -> b) -> Benchmark
63+benchPureSink value name f = benchIO name (Ops.sourceIntFromTo value) f
7364
74−{-# INLINE sourceIntFromToFromStream #-}
75−sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
76−sourceIntFromToFromStream value n = S.fold A.write $ S.enumerateFromTo n (n + value)
65+{-# INLINE benchIO' #-}
66+benchIO' :: NFData b => String -> (Int -> IO a) -> (a -> IO b) -> Benchmark
67+benchIO' name src f = bench name $ nfIO $
68+ randomRIO (1,1) >>= src >>= f
7769
78−-------------------------------------------------------------------------------
79−-- Bench groups
80−-------------------------------------------------------------------------------
70+{-# INLINE benchIOSink #-}
71+benchIOSink :: NFData b => Int -> String -> (Ops.Stream Int -> IO b) -> Benchmark
72+benchIOSink value name f = benchIO' name (Ops.sourceIntFromTo value) f
8173
8274o_1_space_generation :: Int -> [Benchmark]
8375o_1_space_generation value =
8476 [ bgroup
8577 "generation"
86− [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
87− , let testStr = "fromList " ++ mkListString value
88− in testStr `deepseq` bench "read" (nf readInstance testStr)
89− , benchPureSrc "writeN . IsList.fromList" (sourceIsList value)
78+ [ benchIOSrc "writeN . intFromTo" (Ops.sourceIntFromTo value)
79+#ifndef DATA_SMALLARRAY
80+ , benchIOSrc "write . intFromTo" (Ops.sourceIntFromToFromStream value)
81+#endif
82+ , benchIOSrc
83+ "fromList . intFromTo"
84+ (Ops.sourceIntFromToFromList value)
85+ , benchIOSrc "writeN . unfoldr" (Ops.sourceUnfoldr value)
86+ , benchIOSrc "writeN . fromList" (Ops.sourceFromList value)
87+#ifdef MEMORY_ARRAY
88+ , benchPureSrc "writeN . IsList.fromList" (Ops.sourceIsList value)
9089 , benchPureSrc
9190 "writeN . IsString.fromString"
92− (sourceIsString value)
93−
91+ (Ops.sourceIsString value)
92+#endif
93+#if !defined(DATA_ARRAY_PRIM) && !defined(DATA_ARRAY_PRIM_PINNED)
94+#ifdef DATA_SMALLARRAY
95+ , let testStr =
96+ "fromListN " ++
97+ show (value + 1) ++
98+ "[1" ++ concat (replicate value ",1") ++ "]"
99+#else
100+ , let testStr = mkListString value
101+#endif
102+ in testStr `deepseq` (bench "read" $ nf Ops.readInstance testStr)
103+#endif
104+ , benchPureSink value "show" Ops.showInstance
94105 ]
95106 ]
96107
97108o_1_space_elimination :: Int -> [Benchmark]
98109o_1_space_elimination value =
99110 [ bgroup "elimination"
100− [ benchPureSink value "length . IsList.toList" (length . GHC.toList)
101− , benchFold "writeLastN.1"
102− (S.fold (IA.writeLastN 1)) (P.sourceUnfoldrM value)
103− , benchFold "writeLastN.10"
104− (S.fold (IA.writeLastN 10)) (P.sourceUnfoldrM value)
111+ [ benchPureSink value "id" id
112+ , benchPureSink value "==" Ops.eqInstance
113+ , benchPureSink value "/=" Ops.eqInstanceNotEq
114+ , benchPureSink value "<" Ops.ordInstance
115+ , benchPureSink value "min" Ops.ordInstanceMin
116+#ifdef MEMORY_ARRAY
117+ -- length is used to check for foldr/build fusion
118+ , benchPureSink value "length . IsList.toList" (length . GHC.toList)
119+#endif
120+ , benchIOSink value "foldl'" Ops.pureFoldl'
121+ , benchIOSink value "read" Ops.unfoldReadDrain
122+ , benchIOSink value "toStreamRev" Ops.toStreamRevDrain
123+ , benchFold "lastN.1" (S.fold (IA.lastN 1)) (P.sourceUnfoldrM value)
124+ , benchFold "lastN.10" (S.fold (IA.lastN 10)) (P.sourceUnfoldrM value)
125+#if !defined(DATA_ARRAY_PRIM) && !defined(DATA_ARRAY_PRIM_PINNED)
105126#ifdef DEVBUILD
106−{-
107− benchPureSink value "foldable/foldl'" foldableFoldl'
108− , benchPureSink value "foldable/sum" foldableSum
109−-}
127+ , benchPureSink value "foldable/foldl'" Ops.foldableFoldl'
128+ , benchPureSink value "foldable/sum" Ops.foldableSum
129+#endif
110130#endif
111131 ]
112132 ]
@@ -116,25 +136,66 @@ o_n_heap_serial value =
116136 [ bgroup "elimination"
117137 [
118138 -- Converting the stream to an array
119− benchFold "writeLastN.Max" (S.fold (IA.writeLastN (value + 1)))
139+ benchFold "lastN.Max" (S.fold (IA.lastN (value + 1)))
140+ (P.sourceUnfoldrM value)
141+ , benchFold "writeN" (S.fold (A.writeN value))
120142 (P.sourceUnfoldrM value)
121143 ]
122144 ]
123145
146+o_1_space_transformation :: Int -> [Benchmark]
147+o_1_space_transformation value =
148+ [ bgroup "transformation"
149+ [ benchIOSink value "scanl'" (Ops.scanl' value 1)
150+ , benchIOSink value "scanl1'" (Ops.scanl1' value 1)
151+ , benchIOSink value "map" (Ops.map value 1)
152+ ]
153+ ]
154+
155+o_1_space_transformationX4 :: Int -> [Benchmark]
156+o_1_space_transformationX4 value =
157+ [ bgroup "transformationX4"
158+ [ benchIOSink value "scanl'" (Ops.scanl' value 4)
159+ , benchIOSink value "scanl1'" (Ops.scanl1' value 4)
160+ , benchIOSink value "map" (Ops.map value 4)
161+ ]
162+ ]
163+
124164moduleName :: String
165+#ifdef DATA_SMALLARRAY
166+moduleName = "Data.SmallArray"
167+#elif defined(MEMORY_ARRAY)
168+moduleName = "Memory.Array"
169+#elif defined(DATA_ARRAY_PRIM)
170+moduleName = "Data.Array.Prim"
171+#elif defined(DATA_ARRAY_PRIM_PINNED)
172+moduleName = "Data.Array.Prim.Pinnned"
173+#else
125174moduleName = "Data.Array"
175+#endif
126176
177+#ifdef DATA_SMALLARRAY
178+defStreamSize :: Int
179+defStreamSize = 128
180+#else
127181defStreamSize :: Int
128182defStreamSize = defaultStreamSize
183+#endif
129184
130185main :: IO ()
131−main = runWithCLIOpts defStreamSize allBenchmarks
186+main = do
187+ (value, cfg, benches) <- parseCLIOpts defStreamSize
188+ value `seq` runMode (mode cfg) cfg benches (allBenchmarks value)
132189
133190 where
134191
135192 allBenchmarks size =
136− [ bgroup (o_1_space_prefix moduleName) $
137− o_1_space_generation size ++ o_1_space_elimination size
193+ [ bgroup (o_1_space_prefix moduleName) $ concat
194+ [ o_1_space_generation size
195+ , o_1_space_elimination size
196+ , o_1_space_transformation size
197+ , o_1_space_transformationX4 size
198+ ]
138199 , bgroup (o_n_space_prefix moduleName) $
139200 o_n_heap_serial size
140− ] ++ commonBenchmarks size
201+ ]
benchmark/Streamly/Benchmark/Data/Array/Common.hsdeleted−185
@@ -1,185 +0,0 @@
1−-------------------------------------------------------------------------------
2−-- Benchmark helpers
3−-------------------------------------------------------------------------------
4−
5−{-# INLINE benchIO #-}
6−benchIO :: NFData b => String -> (Int -> IO a) -> (a -> b) -> Benchmark
7−benchIO name src f = bench name $ nfIO $
8− (randomRIO (1,1) >>= src) <&> f
9−
10−{-# INLINE benchPureSink #-}
11−benchPureSink :: NFData b => Int -> String -> (Stream Int -> b) -> Benchmark
12−benchPureSink value name = benchIO name (sourceIntFromTo value)
13−
14−{-# INLINE benchIO' #-}
15−benchIO' :: NFData b => String -> (Int -> IO a) -> (a -> IO b) -> Benchmark
16−benchIO' name src f = bench name $ nfIO $
17− randomRIO (1,1) >>= src >>= f
18−
19−{-# INLINE benchIOSink #-}
20−benchIOSink :: NFData b => Int -> String -> (Stream Int -> IO b) -> Benchmark
21−benchIOSink value name = benchIO' name (sourceIntFromTo value)
22−
23−-------------------------------------------------------------------------------
24−-- Bench Ops
25−-------------------------------------------------------------------------------
26−
27−{-# INLINE sourceUnfoldr #-}
28−sourceUnfoldr :: MonadIO m => Int -> Int -> m (Stream Int)
29−sourceUnfoldr value n = S.fold (A.writeN value) $ S.unfoldr step n
30− where
31− step cnt =
32− if cnt > n + value
33− then Nothing
34− else Just (cnt, cnt + 1)
35−
36−{-# INLINE sourceIntFromTo #-}
37−sourceIntFromTo :: MonadIO m => Int -> Int -> m (Stream Int)
38−sourceIntFromTo value n = S.fold (A.writeN value) $ S.enumerateFromTo n (n + value)
39−
40−{-# INLINE sourceFromList #-}
41−sourceFromList :: MonadIO m => Int -> Int -> m (Stream Int)
42−sourceFromList value n = S.fold (A.writeN value) $ S.fromList [n..n+value]
43−
44−-------------------------------------------------------------------------------
45−-- Transformation
46−-------------------------------------------------------------------------------
47−
48−{-# INLINE composeN #-}
49−composeN :: P.Monad m
50− => Int -> (Stream Int -> m (Stream Int)) -> Stream Int -> m (Stream Int)
51−composeN n f x =
52− case n of
53− 1 -> f x
54− 2 -> f x P.>>= f
55− 3 -> f x P.>>= f P.>>= f
56− 4 -> f x P.>>= f P.>>= f P.>>= f
57− _ -> undefined
58−
59−{-# INLINE scanl' #-}
60−{-# INLINE scanl1' #-}
61−{-# INLINE map #-}
62−
63−scanl' , scanl1', map
64− :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
65−
66−
67−{-# INLINE onArray #-}
68−onArray
69− :: MonadIO m => Int -> (Stream.Stream m Int -> Stream.Stream m Int)
70− -> Stream Int
71− -> m (Stream Int)
72−onArray value f arr = S.fold (A.writeN value) $ f $ S.unfold A.reader arr
73−
74−scanl' value n = composeN n $ onArray value $ S.scan (Fold.foldl' (+) 0)
75−scanl1' value n = composeN n $ onArray value $ Stream.scanl1' (+)
76−map value n = composeN n $ onArray value $ fmap (+1)
77−-- map n = composeN n $ A.map (+1)
78−
79−{-# INLINE eqInstance #-}
80−eqInstance :: Stream Int -> Bool
81−eqInstance src = src == src
82−
83−{-# INLINE eqInstanceNotEq #-}
84−eqInstanceNotEq :: Stream Int -> Bool
85−eqInstanceNotEq src = src P./= src
86−
87−{-# INLINE ordInstance #-}
88−ordInstance :: Stream Int -> Bool
89−ordInstance src = src P.< src
90−
91−{-# INLINE ordInstanceMin #-}
92−ordInstanceMin :: Stream Int -> Stream Int
93−ordInstanceMin src = P.min src src
94−
95−{-# INLINE showInstance #-}
96−showInstance :: Stream Int -> P.String
97−showInstance = P.show
98−
99−{-# INLINE pureFoldl' #-}
100−pureFoldl' :: MonadIO m => Stream Int -> m Int
101−pureFoldl' = S.fold (Fold.foldl' (+) 0) . S.unfold A.reader
102−
103−-------------------------------------------------------------------------------
104−-- Elimination
105−-------------------------------------------------------------------------------
106−
107−{-# INLINE unfoldReadDrain #-}
108−unfoldReadDrain :: MonadIO m => Stream Int -> m ()
109−unfoldReadDrain = S.fold Fold.drain . S.unfold A.reader
110−
111−{-# INLINE toStreamRevDrain #-}
112−toStreamRevDrain :: MonadIO m => Stream Int -> m ()
113−toStreamRevDrain = S.fold Fold.drain . A.readRev
114−
115−-------------------------------------------------------------------------------
116−-- Bench groups
117−-------------------------------------------------------------------------------
118−
119−common_o_1_space_generation :: Int -> [Benchmark]
120−common_o_1_space_generation value =
121− [ bgroup
122− "generation"
123− [ benchIOSrc "writeN . intFromTo" (sourceIntFromTo value)
124− , benchIOSrc
125− "fromList . intFromTo"
126− (sourceIntFromToFromList value)
127− , benchIOSrc "writeN . unfoldr" (sourceUnfoldr value)
128− , benchIOSrc "writeN . fromList" (sourceFromList value)
129− , benchPureSink value "show" showInstance
130− ]
131− ]
132−
133−common_o_1_space_elimination :: Int -> [Benchmark]
134−common_o_1_space_elimination value =
135− [ bgroup "elimination"
136− [ benchPureSink value "id" id
137− , benchPureSink value "==" eqInstance
138− , benchPureSink value "/=" eqInstanceNotEq
139− , benchPureSink value "<" ordInstance
140− , benchPureSink value "min" ordInstanceMin
141− , benchIOSink value "foldl'" pureFoldl'
142− , benchIOSink value "read" unfoldReadDrain
143− , benchIOSink value "toStreamRev" toStreamRevDrain
144− ]
145− ]
146−
147−common_o_n_heap_serial :: Int -> [Benchmark]
148−common_o_n_heap_serial value =
149− [ bgroup "elimination"
150− [
151− -- Converting the stream to an array
152− benchFold "writeN" (S.fold (A.writeN value))
153− (P.sourceUnfoldrM value)
154− ]
155− ]
156−
157−common_o_1_space_transformation :: Int -> [Benchmark]
158−common_o_1_space_transformation value =
159− [ bgroup "transformation"
160− [ benchIOSink value "scanl'" (scanl' value 1)
161− , benchIOSink value "scanl1'" (scanl1' value 1)
162− , benchIOSink value "map" (map value 1)
163− ]
164− ]
165−
166−common_o_1_space_transformationX4 :: Int -> [Benchmark]
167−common_o_1_space_transformationX4 value =
168− [ bgroup "transformationX4"
169− [ benchIOSink value "scanl'" (scanl' value 4)
170− , benchIOSink value "scanl1'" (scanl1' value 4)
171− , benchIOSink value "map" (map value 4)
172− ]
173− ]
174−
175−commonBenchmarks :: Int -> [Benchmark]
176−commonBenchmarks size =
177− [ bgroup (o_1_space_prefix moduleName) $ concat
178− [ common_o_1_space_generation size
179− , common_o_1_space_elimination size
180− , common_o_1_space_transformation size
181− , common_o_1_space_transformationX4 size
182− ]
183− , bgroup (o_n_space_prefix moduleName) $
184− common_o_n_heap_serial size
185− ]
benchmark/Streamly/Benchmark/Data/Array/CommonImports.hsdeleted−16
@@ -1,16 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−
3−import Control.DeepSeq (NFData(..))
4−import Control.Monad.IO.Class (MonadIO)
5−import Data.Functor ((<&>))
6−import System.Random (randomRIO)
7−
8−import qualified Streamly.Data.Fold as Fold
9−import qualified Streamly.Data.Stream as S
10−import qualified Streamly.Internal.Data.Stream as Stream
11−
12−import Test.Tasty.Bench
13−import Streamly.Benchmark.Common hiding (benchPureSrc)
14−import qualified Stream.Common as P
15−
16−import Prelude as P hiding (map)
benchmark/Streamly/Benchmark/Data/Array/Generic.hsdeleted−119
@@ -1,119 +0,0 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−{-# OPTIONS_GHC -Wno-orphans #-}
3−
4−{-# LANGUAGE CPP #-}
5−
6−#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
7−
8−import Control.DeepSeq (deepseq)
9−
10−import qualified Streamly.Internal.Data.Array.Generic as IA
11−import qualified Streamly.Internal.Data.Array.Generic as A
12−
13−type Stream = A.Array
14−
15−#include "Streamly/Benchmark/Data/Array/Common.hs"
16−
17−instance NFData a => NFData (A.Array a) where
18− {-# INLINE rnf #-}
19− rnf = A.foldl' (\_ x -> rnf x) ()
20−
21−-------------------------------------------------------------------------------
22−-- Benchmark helpers
23−-------------------------------------------------------------------------------
24−
25−-- Drain a source that generates an array in the IO monad
26−{-# INLINE benchIOSrc #-}
27−benchIOSrc :: NFData a => String -> (Int -> IO (Stream a)) -> Benchmark
28−benchIOSrc name src = benchIO name src id
29−
30−-------------------------------------------------------------------------------
31−-- Bench Ops
32−-------------------------------------------------------------------------------
33−
34−{-# INLINE sourceIntFromToFromList #-}
35−sourceIntFromToFromList :: MonadIO m => Int -> Int -> m (Stream Int)
36−sourceIntFromToFromList value n = P.return $ A.fromListN value [n..n + value]
37−
38−{-# INLINE readInstance #-}
39−readInstance :: P.String -> Stream Int
40−readInstance str =
41− let r = P.reads str
42− in case r of
43− [(x,"")] -> x
44− _ -> P.error "readInstance: no parse"
45−
46−#ifdef DEVBUILD
47−{-
48−{-# INLINE foldableFoldl' #-}
49−foldableFoldl' :: Stream Int -> Int
50−foldableFoldl' = F.foldl' (+) 0
51−
52−{-# INLINE foldableSum #-}
53−foldableSum :: Stream Int -> Int
54−foldableSum = P.sum
55−-}
56−#endif
57−
58−{-# INLINE sourceIntFromToFromStream #-}
59−sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
60−sourceIntFromToFromStream value n =
61− S.fold A.write $ S.enumerateFromTo n (n + value)
62−
63−-------------------------------------------------------------------------------
64−-- Bench groups
65−-------------------------------------------------------------------------------
66−
67−o_1_space_generation :: Int -> [Benchmark]
68−o_1_space_generation value =
69− [ bgroup
70− "generation"
71− [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
72− , let testStr = "fromList " ++ mkListString value
73− in testStr `deepseq` bench "read" (nf readInstance testStr)
74− ]
75− ]
76−
77−o_1_space_elimination :: Int -> [Benchmark]
78−o_1_space_elimination value =
79− [ bgroup "elimination"
80− [ benchFold "writeLastN.1"
81− (S.fold (IA.writeLastN 1)) (P.sourceUnfoldrM value)
82− , benchFold "writeLastN.10"
83− (S.fold (IA.writeLastN 10)) (P.sourceUnfoldrM value)
84−#ifdef DEVBUILD
85−{-
86− benchPureSink value "foldable/foldl'" foldableFoldl'
87− , benchPureSink value "foldable/sum" foldableSum
88−-}
89−#endif
90− ]
91− ]
92−
93−o_n_heap_serial :: Int -> [Benchmark]
94−o_n_heap_serial value =
95− [ bgroup "elimination"
96− [
97− -- Converting the stream to an array
98− benchFold "writeLastN.Max" (S.fold (IA.writeLastN (value + 1)))
99− (P.sourceUnfoldrM value)
100− ]
101− ]
102−
103−moduleName :: String
104−moduleName = "Data.Array.Generic"
105−
106−defStreamSize :: Int
107−defStreamSize = defaultStreamSize
108−
109−main :: IO ()
110−main = runWithCLIOpts defStreamSize allBenchmarks
111−
112− where
113−
114− allBenchmarks size =
115− [ bgroup (o_1_space_prefix moduleName) $
116− o_1_space_generation size ++ o_1_space_elimination size
117− , bgroup (o_n_space_prefix moduleName) $
118− o_n_heap_serial size
119− ] ++ commonBenchmarks size
benchmark/Streamly/Benchmark/Data/Array/SmallArray.hsdeleted−95
@@ -1,95 +0,0 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3−{-# LANGUAGE CPP #-}
4−
5−#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
6−
7−import Control.DeepSeq (deepseq)
8−
9−import qualified Streamly.Internal.Data.SmallArray as A
10−type Stream = A.SmallArray
11−
12−#include "Streamly/Benchmark/Data/Array/Common.hs"
13−
14−-------------------------------------------------------------------------------
15−-- Benchmark helpers
16−-------------------------------------------------------------------------------
17−
18−-- Drain a source that generates an array in the IO monad
19−{-# INLINE benchIOSrc #-}
20−benchIOSrc :: NFData a => String -> (Int -> IO (Stream a)) -> Benchmark
21−benchIOSrc name src = benchIO name src id
22−
23−-------------------------------------------------------------------------------
24−-- Bench Ops
25−-------------------------------------------------------------------------------
26−
27−{-# INLINE sourceIntFromToFromList #-}
28−sourceIntFromToFromList :: MonadIO m => Int -> Int -> m (Stream Int)
29−sourceIntFromToFromList value n = P.return $ A.fromListN value [n..n + value]
30−
31−{-# INLINE readInstance #-}
32−readInstance :: P.String -> Stream Int
33−readInstance str =
34− let r = P.reads str
35− in case r of
36− [(x,"")] -> x
37− _ -> P.error "readInstance: no parse"
38−
39−#ifdef DEVBUILD
40−{-
41−{-# INLINE foldableFoldl' #-}
42−foldableFoldl' :: Stream Int -> Int
43−foldableFoldl' = F.foldl' (+) 0
44−
45−{-# INLINE foldableSum #-}
46−foldableSum :: Stream Int -> Int
47−foldableSum = P.sum
48−-}
49−#endif
50−
51−-------------------------------------------------------------------------------
52−-- Bench groups
53−-------------------------------------------------------------------------------
54−
55−o_1_space_generation :: Int -> [Benchmark]
56−o_1_space_generation value =
57− [ bgroup
58− "generation"
59− [ let testStr =
60− "fromListN " ++
61− show (value + 1) ++
62− "[1" ++ concat (replicate value ",1") ++ "]"
63− in testStr `deepseq` bench "read" (nf readInstance testStr)
64− ]
65− ]
66−
67−{-
68−o_1_space_elimination :: Int -> [Benchmark]
69−o_1_space_elimination value =
70− [ bgroup "elimination"
71− [
72−#ifdef DEVBUILD
73−{-
74− benchPureSink value "foldable/foldl'" foldableFoldl'
75− , benchPureSink value "foldable/sum" foldableSum
76−-}
77−#endif
78− ]
79− ]
80−-}
81−
82−moduleName :: String
83−moduleName = "Data.SmallArray"
84−
85−defStreamSize :: Int
86−defStreamSize = 128
87−
88−main :: IO ()
89−main = runWithCLIOpts defStreamSize allBenchmarks
90−
91− where
92−
93− allBenchmarks size =
94− bgroup (o_1_space_prefix moduleName) (o_1_space_generation size)
95− : commonBenchmarks size
benchmark/Streamly/Benchmark/Data/Array/Stream.hsdeleted−309
@@ -1,309 +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 CPP #-}
11−{-# LANGUAGE FlexibleContexts #-}
12−{-# LANGUAGE ScopedTypeVariables #-}
13−
14−#ifdef __HADDOCK_VERSION__
15−#undef INSPECTION
16−#endif
17−
18−#ifdef INSPECTION
19−{-# LANGUAGE TemplateHaskell #-}
20−{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
21−#endif
22−
23−module Main
24− (
25− main
26− ) where
27−
28−import Control.DeepSeq (NFData(..))
29−import Control.Monad (void, when)
30−import Control.Monad.Catch (MonadCatch)
31−import Data.Functor.Identity (runIdentity)
32−import Data.Maybe (isJust)
33−import Data.Word (Word8)
34−import Streamly.Internal.Data.Stream (Stream)
35−import Streamly.Internal.Data.StreamK (StreamK)
36−import System.IO (Handle)
37−import System.Random (randomRIO)
38−import Prelude hiding ()
39−
40−import qualified Streamly.Data.Stream as Stream
41−import qualified Streamly.Internal.Data.Array as Array
42−import qualified Streamly.Internal.Data.Array.Stream as ArrayStream
43−import qualified Streamly.Internal.Data.Fold as Fold
44−import qualified Streamly.Internal.Data.Parser as Parser
45−import qualified Streamly.Internal.Data.Stream as Stream
46−import qualified Streamly.Internal.Data.StreamK as StreamK
47−import qualified Streamly.Internal.FileSystem.Handle as Handle
48−import qualified Streamly.Internal.Unicode.Stream as Unicode
49−
50−import Test.Tasty.Bench hiding (env)
51−import Streamly.Benchmark.Common
52−import Streamly.Benchmark.Common.Handle
53−import Control.Monad.IO.Class (MonadIO)
54−
55−#ifdef INSPECTION
56−import Streamly.Internal.Data.MutByteArray (Unbox)
57−import Streamly.Internal.Data.Stream (Step(..))
58−import Test.Inspection
59−#endif
60−
61−-------------------------------------------------------------------------------
62−-- Utilities
63−-------------------------------------------------------------------------------
64−
65−-- XXX these can be moved to the common module
66−
67−{-# INLINE sourceUnfoldrM #-}
68−sourceUnfoldrM :: MonadIO m => Int -> Int -> Stream.Stream m Int
69−sourceUnfoldrM value n = Stream.unfoldrM step n
70− where
71− step cnt =
72− if cnt > n + value
73− then return Nothing
74− else return (Just (cnt, cnt + 1))
75−
76−{-# INLINE benchIO #-}
77−benchIO
78− :: NFData b
79− => String -> (Int -> Stream IO a) -> (Stream IO a -> IO b) -> Benchmark
80−benchIO name src sink =
81− bench name $ nfIO $ randomRIO (1,1) >>= sink . src
82−
83−-------------------------------------------------------------------------------
84−-- read chunked using toChunks
85−-------------------------------------------------------------------------------
86−
87−-- | Get the last byte from a file bytestream.
88−toChunksLast :: Handle -> IO (Maybe Word8)
89−toChunksLast inh = do
90− let s = Handle.readChunks inh
91− larr <- Stream.last s
92− return $ case larr of
93− Nothing -> Nothing
94− Just arr -> Array.getIndex (Array.length arr - 1) arr
95−
96−#ifdef INSPECTION
97−inspect $ hasNoTypeClasses 'toChunksLast
98−inspect $ 'toChunksLast `hasNoType` ''Step
99−#endif
100−
101−-- | Count the number of bytes in a file.
102−toChunksSumLengths :: Handle -> IO Int
103−toChunksSumLengths inh =
104− let s = Handle.readChunks inh
105− in Stream.fold Fold.sum (Stream.map Array.length s)
106−
107−#ifdef INSPECTION
108−inspect $ hasNoTypeClasses 'toChunksSumLengths
109−inspect $ 'toChunksSumLengths `hasNoType` ''Step
110−#endif
111−
112−-- | Sum the bytes in a file.
113−toChunksCountBytes :: Handle -> IO Word8
114−toChunksCountBytes inh = do
115− let foldlArr' f z = runIdentity . Stream.foldl' f z . Array.read
116− let s = Handle.readChunks inh
117− Stream.foldl' (\acc arr -> acc + foldlArr' (+) 0 arr) 0 s
118−
119−#ifdef INSPECTION
120−inspect $ hasNoTypeClasses 'toChunksCountBytes
121−inspect $ 'toChunksCountBytes `hasNoType` ''Step
122−#endif
123−
124−toChunksDecodeUtf8Arrays :: Handle -> IO ()
125−toChunksDecodeUtf8Arrays =
126− Stream.drain . Unicode.decodeUtf8Chunks . Handle.readChunks
127−
128−#ifdef INSPECTION
129−inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
130−-- inspect $ 'toChunksDecodeUtf8ArraysLenient `hasNoType` ''Step
131−#endif
132−
133−-------------------------------------------------------------------------------
134−-- Splitting
135−-------------------------------------------------------------------------------
136−
137−-- | Count the number of lines in a file.
138−toChunksSplitOnSuffix :: Handle -> IO Int
139−toChunksSplitOnSuffix =
140− Stream.fold Fold.length
141− . ArrayStream.splitOnSuffix 10
142− . Handle.readChunks
143−
144−#ifdef INSPECTION
145−inspect $ hasNoTypeClasses 'toChunksSplitOnSuffix
146−inspect $ 'toChunksSplitOnSuffix `hasNoType` ''Step
147−#endif
148−
149−-- XXX use a word splitting combinator instead of splitOn and test it.
150−-- | Count the number of words in a file.
151−toChunksSplitOn :: Handle -> IO Int
152−toChunksSplitOn =
153− Stream.fold Fold.length
154− . ArrayStream.splitOn 32
155− . Handle.readChunks
156−
157−#ifdef INSPECTION
158−inspect $ hasNoTypeClasses 'toChunksSplitOn
159−inspect $ 'toChunksSplitOn `hasNoType` ''Step
160−#endif
161−
162−o_1_space_read_chunked :: BenchEnv -> [Benchmark]
163−o_1_space_read_chunked env =
164− -- read using toChunks instead of read
165− [ bgroup "reduce/toChunks"
166− [ mkBench "Stream.last" env $ \inH _ ->
167− toChunksLast inH
168− -- Note: this cannot be fairly compared with GNU wc -c or wc -m as
169− -- wc uses lseek to just determine the file size rather than reading
170− -- and counting characters.
171− , mkBench "Stream.sum . Stream.map Array.length" env $ \inH _ ->
172− toChunksSumLengths inH
173− , mkBench "splitOnSuffix" env $ \inH _ ->
174− toChunksSplitOnSuffix inH
175− , mkBench "splitOn" env $ \inH _ ->
176− toChunksSplitOn inH
177− , mkBench "countBytes" env $ \inH _ ->
178− toChunksCountBytes inH
179− , mkBenchSmall "decodeUtf8Arrays" env $ \inH _ ->
180− toChunksDecodeUtf8Arrays inH
181− ]
182− ]
183−
184−-------------------------------------------------------------------------------
185−-- copy with group/ungroup transformations
186−-------------------------------------------------------------------------------
187−
188−-- | Lines and unlines
189−{-# NOINLINE copyChunksSplitInterposeSuffix #-}
190−copyChunksSplitInterposeSuffix :: Handle -> Handle -> IO ()
191−copyChunksSplitInterposeSuffix inh outh =
192− Stream.fold (Handle.write outh)
193− $ ArrayStream.interposeSuffix 10 . ArrayStream.splitOnSuffix 10
194− $ Handle.readChunks inh
195−
196−#ifdef INSPECTION
197−inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterposeSuffix [''Unbox]
198−inspect $ 'copyChunksSplitInterposeSuffix `hasNoType` ''Step
199−#endif
200−
201−-- | Words and unwords
202−{-# NOINLINE copyChunksSplitInterpose #-}
203−copyChunksSplitInterpose :: Handle -> Handle -> IO ()
204−copyChunksSplitInterpose inh outh =
205− Stream.fold (Handle.write outh)
206− -- XXX this is not correct word splitting combinator
207− $ ArrayStream.interpose 32 . ArrayStream.splitOn 32
208− $ Handle.readChunks inh
209−
210−#ifdef INSPECTION
211−inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterpose [''Unbox]
212−inspect $ 'copyChunksSplitInterpose `hasNoType` ''Step
213−#endif
214−
215−o_1_space_copy_toChunks_group_ungroup :: BenchEnv -> [Benchmark]
216−o_1_space_copy_toChunks_group_ungroup env =
217− [ bgroup "copy/toChunks/group-ungroup"
218− [ mkBench "interposeSuffix . splitOnSuffix" env $ \inh outh ->
219− copyChunksSplitInterposeSuffix inh outh
220− , mkBenchSmall "interpose . splitOn" env $ \inh outh ->
221− copyChunksSplitInterpose inh outh
222− ]
223− ]
224−
225−-------------------------------------------------------------------------------
226−-- Parsers
227−-------------------------------------------------------------------------------
228−
229−{-# INLINE drainWhile #-}
230−drainWhile :: MonadCatch m => (a -> Bool) -> Parser.Parser a m ()
231−drainWhile p = Parser.takeWhile p Fold.drain
232−
233−-------------------------------------------------------------------------------
234−-- Folds and parsers
235−-------------------------------------------------------------------------------
236−
237−{-# INLINE fold #-}
238−fold :: Stream IO (Array.Array Int) -> IO ()
239−fold s = void $ ArrayStream.foldBreak Fold.drain $ StreamK.fromStream s
240−
241−{-# INLINE parse #-}
242−parse :: Int -> Stream IO (Array.Array Int) -> IO ()
243−parse value s =
244− void $ ArrayStream.parseBreak (drainWhile (< value)) $ StreamK.fromStream s
245−
246−{-# INLINE foldBreak #-}
247−foldBreak :: StreamK IO (Array.Array Int) -> IO ()
248−foldBreak s = do
249− (r, s1) <- ArrayStream.foldBreak Fold.one s
250− when (isJust r) $ foldBreak s1
251−
252−{-# INLINE parseBreak #-}
253−parseBreak :: StreamK IO (Array.Array Int) -> IO ()
254−parseBreak s = do
255− r <- ArrayStream.parseBreak Parser.one s
256− case r of
257− (Left _, _) -> return ()
258− (Right _, s1) -> parseBreak s1
259−
260−o_1_space_serial_array ::
261− Int -> [Array.Array Int] -> [Array.Array Int] -> [Benchmark]
262−o_1_space_serial_array bound arraysSmall arraysBig =
263− [ benchIO "fold (of 100)" (\_ -> Stream.fromList arraysSmall) fold
264− , benchIO "fold (single)" (\_ -> Stream.fromList arraysBig) fold
265− , benchIO
266− "foldBreak (recursive, small arrays)"
267− (\_ -> Stream.fromList arraysSmall)
268− (foldBreak . StreamK.fromStream)
269− , benchIO "parse (of 100)" (\_ -> Stream.fromList arraysSmall)
270− $ parse bound
271− , benchIO "parse (single)" (\_ -> Stream.fromList arraysBig)
272− $ parse bound
273− , benchIO
274− "parseBreak (recursive, small arrays)"
275− (\_ -> Stream.fromList arraysSmall)
276− (parseBreak . StreamK.fromStream)
277− ]
278−
279−-------------------------------------------------------------------------------
280−-- Driver
281−-------------------------------------------------------------------------------
282−
283−moduleName :: String
284−moduleName = "Data.Array.Stream"
285−
286−main :: IO ()
287−main = do
288− env <- mkHandleBenchEnv
289− runWithCLIOptsEnv defaultStreamSize alloc (allBenchmarks env)
290−
291− where
292−
293− alloc value =
294− if value <= 0
295− then return (undefined, undefined)
296− else
297− do
298− small <- Stream.toList $ Stream.chunksOf 100 $ sourceUnfoldrM value 0
299− big <- Stream.toList $ Stream.chunksOf value $ sourceUnfoldrM value 0
300− return (small, big)
301−
302− allBenchmarks env arrays value =
303− let (arraysSmall, arraysBig) = arrays
304− in [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
305− [ o_1_space_read_chunked env
306− , o_1_space_serial_array value arraysSmall arraysBig
307− , o_1_space_copy_toChunks_group_ungroup env
308− ]
309− ]
benchmark/Streamly/Benchmark/Data/ArrayOps.hsnew file+242
@@ -0,0 +1,242 @@
1+-- |
2+-- Module : Streamly.Benchmark.Data.ArrayOps
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+
12+-- CPP:
13+-- MEMORY_ARRAY
14+-- DATA_ARRAY
15+-- DATA_ARRAY_PRIM
16+-- DATA_ARRAY_PRIM_PINNED
17+-- DATA_SMALLARRAY
18+
19+module Streamly.Benchmark.Data.ArrayOps where
20+
21+import Control.Monad.IO.Class (MonadIO)
22+import Prelude (Bool, Int, Maybe(..), ($), (+), (.), (==), (>), undefined)
23+
24+import qualified Prelude as P
25+import qualified Streamly.Prelude as S
26+
27+#if !defined(DATA_ARRAY_PRIM) && !defined(DATA_ARRAY_PRIM_PINNED)
28+#ifdef DEVBUILD
29+import qualified Data.Foldable as F
30+#endif
31+#endif
32+
33+#ifdef DATA_SMALLARRAY
34+import qualified Streamly.Internal.Data.SmallArray as A
35+type Stream = A.SmallArray
36+#elif defined(MEMORY_ARRAY)
37+import qualified GHC.Exts as GHC
38+import qualified Streamly.Data.Array.Storable.Foreign as A
39+import qualified Streamly.Internal.Data.Array.Storable.Foreign as A
40+type Stream = A.Array
41+#elif defined(DATA_ARRAY_PRIM)
42+import qualified Streamly.Internal.Data.Array.Prim as A
43+type Stream = A.Array
44+#elif defined(DATA_ARRAY_PRIM_PINNED)
45+import qualified Streamly.Internal.Data.Array.Prim.Pinned as A
46+type Stream = A.Array
47+#elif defined(DATA_ARRAY)
48+import qualified Streamly.Internal.Data.Array as A
49+type Stream = A.Array
50+#endif
51+
52+-------------------------------------------------------------------------------
53+-- Benchmark ops
54+-------------------------------------------------------------------------------
55+
56+-------------------------------------------------------------------------------
57+-- Stream generation and elimination
58+-------------------------------------------------------------------------------
59+
60+-------------------------------------------------------------------------------
61+-- CPP Common to:
62+-- MEMORY_ARRAY
63+-- DATA_ARRAY
64+-- DATA_ARRAY_PRIM
65+-- DATA_ARRAY_PRIM_PINNED
66+-- DATA_SMALLARRAY
67+-------------------------------------------------------------------------------
68+
69+{-# INLINE sourceUnfoldr #-}
70+sourceUnfoldr :: MonadIO m => Int -> Int -> m (Stream Int)
71+sourceUnfoldr value n = S.fold (A.writeN value) $ S.unfoldr step n
72+ where
73+ step cnt =
74+ if cnt > n + value
75+ then Nothing
76+ else (Just (cnt, cnt + 1))
77+
78+{-# INLINE sourceIntFromTo #-}
79+sourceIntFromTo :: MonadIO m => Int -> Int -> m (Stream Int)
80+sourceIntFromTo value n = S.fold (A.writeN value) $ S.enumerateFromTo n (n + value)
81+
82+{-# INLINE sourceFromList #-}
83+sourceFromList :: MonadIO m => Int -> Int -> m (Stream Int)
84+sourceFromList value n = S.fold (A.writeN value) $ S.fromList [n..n+value]
85+
86+-- Different defination of sourceIntFromToFromList for DATA_SMALLARRAY
87+-- CPP:
88+{-# INLINE sourceIntFromToFromList #-}
89+sourceIntFromToFromList :: MonadIO m => Int -> Int -> m (Stream Int)
90+#ifndef DATA_SMALLARRAY
91+sourceIntFromToFromList value n = P.return $ A.fromList $ [n..n + value]
92+#else
93+sourceIntFromToFromList value n = P.return $ A.fromListN value $ [n..n + value]
94+#endif
95+
96+-------------------------------------------------------------------------------
97+-- CPP Common to:
98+-- MEMORY_ARRAY
99+-- DATA_ARRAY
100+-- DATA_ARRAY_PRIM
101+-- DATA_ARRAY_PRIM_PINNED
102+-------------------------------------------------------------------------------
103+
104+-- CPP:
105+#ifndef DATA_SMALLARRAY
106+{-# INLINE sourceIntFromToFromStream #-}
107+sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
108+sourceIntFromToFromStream value n = S.fold A.write $ S.enumerateFromTo n (n + value)
109+#endif
110+
111+-------------------------------------------------------------------------------
112+-- CPP Common to:
113+-- MEMORY_ARRAY
114+-------------------------------------------------------------------------------
115+
116+-- CPP:
117+#ifdef MEMORY_ARRAY
118+{-# INLINE sourceIsList #-}
119+sourceIsList :: Int -> Int -> Stream Int
120+sourceIsList value n = GHC.fromList [n..n+value]
121+
122+{-# INLINE sourceIsString #-}
123+sourceIsString :: Int -> Int -> Stream P.Char
124+sourceIsString value n = GHC.fromString (P.replicate (n + value) 'a')
125+#endif
126+
127+-------------------------------------------------------------------------------
128+-- Transformation
129+-------------------------------------------------------------------------------
130+
131+-------------------------------------------------------------------------------
132+-- CPP Common to:
133+-- MEMORY_ARRAY
134+-- DATA_ARRAY
135+-- DATA_ARRAY_PRIM
136+-- DATA_ARRAY_PRIM_PINNED
137+-- DATA_SMALLARRAY
138+-------------------------------------------------------------------------------
139+
140+{-# INLINE composeN #-}
141+composeN :: P.Monad m
142+ => Int -> (Stream Int -> m (Stream Int)) -> Stream Int -> m (Stream Int)
143+composeN n f x =
144+ case n of
145+ 1 -> f x
146+ 2 -> f x P.>>= f
147+ 3 -> f x P.>>= f P.>>= f
148+ 4 -> f x P.>>= f P.>>= f P.>>= f
149+ _ -> undefined
150+
151+{-# INLINE scanl' #-}
152+{-# INLINE scanl1' #-}
153+{-# INLINE map #-}
154+
155+scanl' , scanl1', map
156+ :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
157+
158+
159+{-# INLINE onArray #-}
160+onArray
161+ :: MonadIO m => Int -> (S.SerialT m Int -> S.SerialT m Int)
162+ -> Stream Int
163+ -> m (Stream Int)
164+onArray value f arr = S.fold (A.writeN value) $ f $ (S.unfold A.read arr)
165+
166+scanl' value n = composeN n $ onArray value $ S.scanl' (+) 0
167+scanl1' value n = composeN n $ onArray value $ S.scanl1' (+)
168+map value n = composeN n $ onArray value $ S.map (+1)
169+-- map n = composeN n $ A.map (+1)
170+
171+{-# INLINE eqInstance #-}
172+eqInstance :: Stream Int -> Bool
173+eqInstance src = src == src
174+
175+{-# INLINE eqInstanceNotEq #-}
176+eqInstanceNotEq :: Stream Int -> Bool
177+eqInstanceNotEq src = src P./= src
178+
179+{-# INLINE ordInstance #-}
180+ordInstance :: Stream Int -> Bool
181+ordInstance src = src P.< src
182+
183+{-# INLINE ordInstanceMin #-}
184+ordInstanceMin :: Stream Int -> Stream Int
185+ordInstanceMin src = P.min src src
186+
187+{-# INLINE showInstance #-}
188+showInstance :: Stream Int -> P.String
189+showInstance src = P.show src
190+
191+{-# INLINE pureFoldl' #-}
192+pureFoldl' :: MonadIO m => Stream Int -> m Int
193+pureFoldl' = S.foldl' (+) 0 . S.unfold A.read
194+
195+-------------------------------------------------------------------------------
196+-- CPP Common to:
197+-- MEMORY_ARRAY
198+-- DATA_ARRAY
199+-- DATA_SMALLARRAY
200+-------------------------------------------------------------------------------
201+
202+-- CPP:
203+#if !defined(DATA_ARRAY_PRIM) && !defined(DATA_ARRAY_PRIM_PINNED)
204+{-# INLINE readInstance #-}
205+readInstance :: P.String -> Stream Int
206+readInstance str =
207+ let r = P.reads str
208+ in case r of
209+ [(x,"")] -> x
210+ _ -> P.error "readInstance: no parse"
211+
212+#ifdef DEVBUILD
213+{-# INLINE foldableFoldl' #-}
214+foldableFoldl' :: Stream Int -> Int
215+foldableFoldl' = F.foldl' (+) 0
216+
217+{-# INLINE foldableSum #-}
218+foldableSum :: Stream Int -> Int
219+foldableSum = P.sum
220+#endif
221+#endif
222+
223+-------------------------------------------------------------------------------
224+-- Elimination
225+-------------------------------------------------------------------------------
226+
227+-------------------------------------------------------------------------------
228+-- CPP Common to:
229+-- MEMORY_ARRAY
230+-- DATA_ARRAY
231+-- DATA_ARRAY_PRIM
232+-- DATA_ARRAY_PRIM_PINNED
233+-- DATA_SMALLARRAY
234+-------------------------------------------------------------------------------
235+
236+{-# INLINE unfoldReadDrain #-}
237+unfoldReadDrain :: MonadIO m => Stream Int -> m ()
238+unfoldReadDrain = S.drain . S.unfold A.read
239+
240+{-# INLINE toStreamRevDrain #-}
241+toStreamRevDrain :: MonadIO m => Stream Int -> m ()
242+toStreamRevDrain = S.drain . A.toStreamRev
benchmark/Streamly/Benchmark/Data/Fold.hs+125−350
@@ -6,51 +6,35 @@
66-- Maintainer : streamly@composewell.com
77
88{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE FlexibleInstances #-}
10−{-# LANGUAGE RankNTypes #-}
11−{-# LANGUAGE ScopedTypeVariables #-}
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
199
2010module Main (main) where
2111
2212import Control.DeepSeq (NFData(..))
23−import Control.Monad (when)
24−import Control.Monad.IO.Class (MonadIO(..))
25−import Data.Functor.Identity (Identity(..))
2613import Data.Map.Strict (Map)
27−import Data.Hashable (Hashable)
28−import Data.HashMap.Strict (HashMap)
29−import Data.IntMap.Strict (IntMap)
3014import Data.Monoid (Last(..), Sum(..))
3115import System.Random (randomRIO)
3216
33−import Streamly.Internal.Data.Stream (Stream)
17+import Streamly.Prelude (SerialT)
3418import Streamly.Internal.Data.Fold (Fold(..))
35−import Streamly.Internal.Data.IsMap.HashMap ()
36−import Streamly.Internal.Data.MutArray (MutArray)
3719
20+import qualified Data.Map.Strict as Map
3821import qualified Streamly.Internal.Data.Fold as FL
39−import qualified Streamly.Data.Fold.Prelude as Fold
40−import qualified Streamly.Internal.Data.Unfold as Unfold
22+import qualified Streamly.Internal.Data.Fold.Types as FL
4123import qualified Streamly.Internal.Data.Pipe as Pipe
42−import qualified Streamly.Internal.Data.Stream as Stream
24+import qualified Streamly.Internal.Data.Sink as Sink
25+import qualified Streamly.Internal.Data.Stream.IsStream as IP
26+import qualified Streamly.Prelude as S
4327
44−import Test.Tasty.Bench
28+import Gauge
4529import Streamly.Benchmark.Common
46−import Prelude hiding (all, any, take, unzip, sequence_, filter)
30+import Prelude hiding (all, any, take, unzip)
4731
4832-- We need a monadic bind here to make sure that the function f does not get
4933-- completely optimized out by the compiler in some cases.
5034
5135{-# INLINE sourceUnfoldrM #-}
52−sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
53−sourceUnfoldrM value n = Stream.unfoldrM step n
36+sourceUnfoldrM :: (S.IsStream t, S.MonadAsync m) => Int -> Int -> t m Int
37+sourceUnfoldrM value n = S.unfoldrM step n
5438 where
5539 step cnt =
5640 if cnt > n + value
@@ -58,14 +42,14 @@ sourceUnfoldrM value n = Stream.unfoldrM step n
5842 else return (Just (cnt, cnt + 1))
5943
6044{-# INLINE source #-}
61−source :: Monad m => Int -> Int -> Stream m Int
45+source :: (S.MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
6246source = sourceUnfoldrM
6347
6448-- | Takes a fold method, and uses it with a default source.
6549{-# INLINE benchIOSink #-}
6650benchIOSink
67− :: NFData b
68− => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
51+ :: (S.IsStream t, NFData b)
52+ => Int -> String -> (t IO Int -> IO b) -> Benchmark
6953benchIOSink value name f = bench name $ nfIO $ randomRIO (1,1) >>= f . source value
7054
7155-------------------------------------------------------------------------------
@@ -73,221 +57,110 @@ benchIOSink value name f = bench name $ nfIO $ randomRIO (1,1) >>= f . source va
7357-------------------------------------------------------------------------------
7458
7559{-# INLINE any #-}
76−any :: (Monad m, Ord a) => a -> Stream m a -> m Bool
77−any value = Stream.fold (FL.any (> value))
60+any :: (Monad m, Ord a) => a -> SerialT m a -> m Bool
61+any value = IP.fold (FL.any (> value))
7862
7963{-# INLINE all #-}
80−all :: (Monad m, Ord a) => a -> Stream m a -> m Bool
81−all value = Stream.fold (FL.all (<= value))
64+all :: (Monad m, Ord a) => a -> SerialT m a -> m Bool
65+all value = IP.fold (FL.all (<= value))
8266
8367{-# INLINE take #-}
84−take :: Monad m => Int -> Stream m a -> m ()
85−take value = Stream.fold (FL.take value FL.drain)
86−
87−{-# INLINE sequence_ #-}
88−sequence_ :: Monad m => Int -> Fold m a ()
89−sequence_ value =
90− foldr f (FL.fromPure ()) (Prelude.replicate value (FL.take 1 FL.drain))
91−
92− where
93−
94− {-# INLINE f #-}
95− f m k = FL.concatMap (const k) m
96−
97−-------------------------------------------------------------------------------
98−-- Filter
99−-------------------------------------------------------------------------------
100−
101−{-# INLINE filter #-}
102−filter :: Monad m => Int -> Stream m Int -> m ()
103−filter _ = Stream.fold (FL.filter even FL.drain)
104−
105−{-# INLINE scanMaybe #-}
106−scanMaybe :: Monad m => Int -> Stream m Int -> m ()
107−scanMaybe _ = Stream.fold (FL.scanMaybe (FL.filtering even) FL.drain)
108−
109−{-# INLINE scanMaybe2 #-}
110−scanMaybe2 :: Monad m => Int -> Stream m Int -> m ()
111−scanMaybe2 _ =
112− Stream.fold
113− $ FL.scanMaybe (FL.filtering even)
114− $ FL.scanMaybe (FL.filtering odd) FL.drain
68+take :: Monad m => Int -> SerialT m a -> m ()
69+take value = IP.fold (FL.ltake value FL.drain)
11570
11671-------------------------------------------------------------------------------
11772-- Splitting by serial application
11873-------------------------------------------------------------------------------
11974
120−{-# INLINE takeEndBy_ #-}
121−takeEndBy_ :: Monad m => Int -> Stream m Int -> m ()
122−takeEndBy_ value = Stream.fold (FL.takeEndBy_ (>= value) FL.drain)
75+{-# INLINE sliceSepBy #-}
76+sliceSepBy :: Monad m => Int -> SerialT m Int -> m ()
77+sliceSepBy value = IP.fold (FL.sliceSepBy (>= value) FL.drain)
12378
12479{-# INLINE many #-}
125−many :: Monad m => Stream m Int -> m ()
126−many = Stream.fold (FL.many (FL.take 1 FL.drain) FL.drain)
80+many :: Monad m => SerialT m Int -> m ()
81+many = IP.fold (FL.many FL.drain (FL.ltake 1 FL.drain))
12782
12883{-# INLINE splitAllAny #-}
129−splitAllAny :: Monad m => Int -> Stream m Int -> m (Bool, Bool)
84+splitAllAny :: Monad m => Int -> SerialT m Int -> m (Bool, Bool)
13085splitAllAny value =
131− Stream.fold
86+ IP.fold
13287 (FL.splitWith (,)
13388 (FL.all (<= (value `div` 2)))
13489 (FL.any (> value))
13590 )
13691
92+{-
13793{-# INLINE split_ #-}
138−split_ :: Monad m => Int -> Stream m Int -> m Bool
94+split_ :: Monad m
95+ => Int -> SerialT m Int -> m ()
13996split_ value =
140− Stream.fold
97+ IP.fold
14198 (FL.split_
14299 (FL.all (<= (value `div` 2)))
143100 (FL.any (> value))
144101 )
145−
146−{-# INLINE shortest #-}
147−shortest :: Monad m => Stream m Int -> m (Either Int Int)
148−shortest = Stream.fold (FL.shortest FL.sum FL.length)
149−
150−{-# INLINE longest #-}
151−longest :: Monad m => Stream m Int -> m (Either Int Int)
152−longest = Stream.fold (FL.longest FL.sum FL.length)
153−
154−{-# INLINE foldBreak #-}
155−foldBreak :: Monad m => Stream m Int -> m ()
156−foldBreak s = do
157− (r, s1) <- Stream.foldBreak (FL.take 1 FL.length) s
158− when (r /= 0) $ foldBreak s1
102+-}
159103
160104-------------------------------------------------------------------------------
161105-- Distributing by parallel application
162106-------------------------------------------------------------------------------
163107
164108{-# INLINE teeSumLength #-}
165−teeSumLength :: Monad m => Stream m Int -> m (Int, Int)
166−teeSumLength = Stream.fold (FL.teeWith (,) FL.sum FL.length)
167−
168−{-# INLINE teeAllAny #-}
169−teeAllAny :: (Monad m, Ord a) => a -> Stream m a -> m (Bool, Bool)
170−teeAllAny value = Stream.fold (FL.teeWith (,) all_ any_)
171−
172− where
173−
174− all_ = FL.all (<= value)
175− any_ = FL.any (> value)
176−
177−{-# INLINE teeWithFst #-}
178−teeWithFst :: Monad m => Stream m Int -> m (Int, Int)
179−teeWithFst = Stream.fold (FL.teeWithFst (,) FL.sum FL.length)
109+teeSumLength :: Monad m => SerialT m Int -> m (Int, Int)
110+teeSumLength = IP.fold (FL.teeWith (,) FL.sum FL.length)
180111
181−{-# INLINE teeWithMin #-}
182−teeWithMin :: Monad m => Stream m Int -> m (Int, Int)
183−teeWithMin = Stream.fold (FL.teeWithMin (,) FL.sum FL.length)
112+{-# INLINE teeApplicative #-}
113+teeApplicative :: (Monad m, Ord a) => a -> SerialT m a -> m (Bool, Bool)
114+teeApplicative value =
115+ IP.fold ((,) <$> FL.all (<= value) <*> FL.any (> value))
184116
185117{-# INLINE distribute #-}
186−distribute :: Monad m => Stream m Int -> m [Int]
187−distribute = Stream.fold (FL.distribute [FL.sum, FL.length])
118+distribute :: Monad m => SerialT m Int -> m [Int]
119+distribute = IP.fold (FL.distribute [FL.sum, FL.length])
188120
189121-------------------------------------------------------------------------------
190122-- Partitioning
191123-------------------------------------------------------------------------------
192124
193−{-# INLINE oddEven #-}
194−oddEven :: Int -> Either Int Int
195−oddEven x = if odd x then Left x else Right x
196−
197125{-# INLINE partition #-}
198−partition :: Monad m => Stream m Int -> m (Int, Int)
199−partition = Stream.fold $ FL.lmap oddEven (FL.partition FL.sum FL.length)
200−
201−{-# INLINE partitionByFstM #-}
202−partitionByFstM :: Monad m => Stream m Int -> m (Int, Int)
203−partitionByFstM =
204− Stream.fold (FL.partitionByFstM (return . oddEven) FL.sum FL.length)
205−
206−{-# INLINE partitionByMinM #-}
207−partitionByMinM :: Monad m => Stream m Int -> m (Int, Int)
208−partitionByMinM =
209− Stream.fold (FL.partitionByMinM (return . oddEven) FL.sum FL.length)
210−
211−{-# INLINE demuxToMap #-}
212−demuxToMap :: (Monad m, Ord k) =>
213− (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (Map k b)
214−demuxToMap f g = Stream.fold (FL.demuxToContainer f g)
215−
216−{-# INLINE demuxToIntMap #-}
217−demuxToIntMap :: Monad m =>
218− (a -> Int) -> (a -> m (Fold m a b)) -> Stream m a -> m (IntMap b)
219−demuxToIntMap f g = Stream.fold (FL.demuxToContainer f g)
220−
221−{-# INLINE demuxToHashMap #-}
222−demuxToHashMap :: (Monad m, Hashable k) =>
223− (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (HashMap k b)
224−demuxToHashMap f g = Stream.fold (FL.demuxToContainer f g)
225−
226−{-# INLINE demuxToMapIO #-}
227−demuxToMapIO :: (MonadIO m, Ord k) =>
228− (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (Map k b)
229−demuxToMapIO f g = Stream.fold (FL.demuxToContainerIO f g)
230−
231−{-# INLINE demuxToHashMapIO #-}
232−demuxToHashMapIO :: (MonadIO m, Hashable k) =>
233− (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (HashMap k b)
234−demuxToHashMapIO f g = Stream.fold (FL.demuxToContainerIO f g)
235−
236−{-# INLINE toMap #-}
237−toMap ::
238− (Monad m, Ord k, Num a) => (a -> k) -> Stream m a -> m (Map k a)
239−toMap f = Stream.fold (FL.toContainer f FL.sum)
240−
241−{-# INLINE toIntMap #-}
242−toIntMap ::
243− (Monad m, Num a) => (a -> Int) -> Stream m a -> m (IntMap a)
244−toIntMap f = Stream.fold (FL.toContainer f FL.sum)
245−
246−{-# INLINE toMapIO #-}
247−toMapIO ::
248− (MonadIO m, Ord k, Num a) => (a -> k) -> Stream m a -> m (Map k a)
249−toMapIO f = Stream.fold (FL.toContainerIO f FL.sum)
250−
251−{-# INLINE toIntMapIO #-}
252−toIntMapIO ::
253− (MonadIO m, Num a) => (a -> Int) -> Stream m a -> m (IntMap a)
254−toIntMapIO f = Stream.fold (FL.toContainerIO f FL.sum)
255−
256−{-# INLINE toHashMapIO #-}
257−toHashMapIO :: (MonadIO m, Ord k, Num a, Hashable k) =>
258− (a -> k) -> Stream m a -> m (HashMap k a)
259−toHashMapIO f = Stream.fold (Fold.toHashMapIO f FL.sum)
126+partition :: Monad m => SerialT m Int -> m (Int, Int)
127+partition =
128+ let f a =
129+ if odd a
130+ then Left a
131+ else Right a
132+ in IP.fold $ FL.lmap f (FL.partition FL.sum FL.length)
133+
134+{-# INLINE demuxWith #-}
135+demuxWith ::
136+ (Monad m, Ord k)
137+ => (a -> (k, a'))
138+ -> Map k (Fold m a' b)
139+ -> SerialT m a
140+ -> m (Map k b)
141+demuxWith f mp = S.fold (FL.demuxWith f mp)
142+
143+{-# INLINE demuxDefaultWith #-}
144+demuxDefaultWith ::
145+ (Monad m, Ord k, Num b)
146+ => (a -> (k, b))
147+ -> Map k (Fold m b b)
148+ -> SerialT m a
149+ -> m (Map k b, b)
150+demuxDefaultWith f mp = S.fold (FL.demuxDefaultWith f mp (FL.lmap snd FL.sum))
151+
152+{-# INLINE classifyWith #-}
153+classifyWith ::
154+ (Monad m, Ord k, Num a) => (a -> k) -> SerialT m a -> m (Map k a)
155+classifyWith f = S.fold (FL.classifyWith f FL.sum)
260156
261157-------------------------------------------------------------------------------
262158-- unzip
263159-------------------------------------------------------------------------------
264160
265161{-# INLINE unzip #-}
266−unzip :: Monad m => Stream m Int -> m (Int, Int)
267−unzip = Stream.fold $ FL.lmap (\a -> (a, a)) (FL.unzip FL.sum FL.length)
268−
269−{-# INLINE unzipWithFstM #-}
270−unzipWithFstM :: Monad m => Stream m Int -> m (Int, Int)
271−unzipWithFstM = do
272− let f a = return (a + 1, a)
273− Stream.fold (FL.unzipWithFstM f FL.sum FL.length)
274−
275−{-# INLINE unzipWithMinM #-}
276−unzipWithMinM :: Monad m => Stream m Int -> m (Int, Int)
277−unzipWithMinM = do
278− let f a = return (a + 1, a)
279− Stream.fold (FL.unzipWithMinM f FL.sum FL.length)
280−
281−-------------------------------------------------------------------------------
282−-- Nested
283−-------------------------------------------------------------------------------
284−
285−{-# INLINE unfoldMany #-}
286−unfoldMany :: Int -> Benchmarkable
287−unfoldMany val =
288− nfIO
289− $ Stream.fold (FL.unfoldMany Unfold.replicateM FL.drain)
290− $ Stream.fromPure (val, randomRIO (1, 1 :: Int))
162+unzip :: Monad m => SerialT m Int -> m (Int, Int)
163+unzip = IP.fold $ FL.lmap (\a -> (a, a)) (FL.unzip FL.sum FL.length)
291164
292165-------------------------------------------------------------------------------
293166-- Benchmarks
@@ -296,113 +169,92 @@ unfoldMany val =
296169moduleName :: String
297170moduleName = "Data.Fold"
298171
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−
307172o_1_space_serial_elimination :: Int -> [Benchmark]
308173o_1_space_serial_elimination value =
309174 [ bgroup "elimination"
310− [ benchIOSink value "drain" (Stream.fold FL.drain)
311− , benchIOSink value "drainBy" (Stream.fold (FL.drainBy return))
312− , benchIOSink value "drainN" (Stream.fold (FL.drainN value))
313− , benchIOSink value "last" (Stream.fold FL.last)
314− , benchIOSink value "length" (Stream.fold FL.length)
315− , benchIOSink value "top" (Stream.fold $ FL.top 10)
316− , benchIOSink value "bottom" (Stream.fold $ FL.bottom 10)
317− , benchIOSink value "sum" (Stream.fold FL.sum)
318− , benchIOSink value "sum (foldMap)" (Stream.fold (FL.foldMap Sum))
319− , benchIOSink value "product" (Stream.fold FL.product)
320− , benchIOSink value "maximumBy" (Stream.fold (FL.maximumBy compare))
321− , benchIOSink value "maximum" (Stream.fold FL.maximum)
322− , benchIOSink value "minimumBy" (Stream.fold (FL.minimumBy compare))
323− , benchIOSink value "minimum" (Stream.fold FL.minimum)
175+ [ benchIOSink value "drain" (S.fold FL.drain)
176+ , benchIOSink value "drainBy" (S.fold (FL.drainBy return))
177+ , benchIOSink value "drainN" (S.fold (FL.drainN value))
178+ , benchIOSink value "sink" (S.fold $ Sink.toFold Sink.drain)
179+ , benchIOSink value "last" (S.fold FL.last)
180+ , benchIOSink value "length" (S.fold FL.length)
181+ , benchIOSink value "sum" (S.fold FL.sum)
182+ , benchIOSink value "sum (foldMap)" (S.fold (FL.foldMap Sum))
183+ , benchIOSink value "product" (S.fold FL.product)
184+ , benchIOSink value "maximumBy" (S.fold (FL.maximumBy compare))
185+ , benchIOSink value "maximum" (S.fold FL.maximum)
186+ , benchIOSink value "minimumBy" (S.fold (FL.minimumBy compare))
187+ , benchIOSink value "minimum" (S.fold FL.minimum)
324188 , benchIOSink
325189 value
326190 "mean"
327− (Stream.fold FL.mean . fmap (fromIntegral :: Int -> Double))
191+ (S.fold FL.mean . S.map (fromIntegral :: Int -> Double))
328192 , benchIOSink
329193 value
330194 "variance"
331− (Stream.fold FL.variance . fmap (fromIntegral :: Int -> Double))
195+ (S.fold FL.variance . S.map (fromIntegral :: Int -> Double))
332196 , benchIOSink
333197 value
334198 "stdDev"
335− (Stream.fold FL.stdDev . fmap (fromIntegral :: Int -> Double))
199+ (S.fold FL.stdDev . S.map (fromIntegral :: Int -> Double))
336200 , benchIOSink
337201 value
338202 "mconcat"
339− (Stream.fold FL.mconcat . fmap (Last . Just))
203+ (S.fold FL.mconcat . S.map (Last . Just))
340204 , benchIOSink
341205 value
342206 "foldMap"
343− (Stream.fold (FL.foldMap (Last . Just)))
207+ (S.fold (FL.foldMap (Last . Just)))
344208 , benchIOSink
345209 value
346210 "foldMapM"
347− (Stream.fold (FL.foldMapM (return . Last . Just)))
348− , benchIOSink value "index" (Stream.fold (FL.index (value + 1)))
349− , benchIOSink value "head" (Stream.fold FL.head)
350− , benchIOSink value "find" (Stream.fold (FL.find (== (value + 1))))
211+ (S.fold (FL.foldMapM (return . Last . Just)))
212+ , benchIOSink value "index" (S.fold (FL.index (value + 1)))
213+ , benchIOSink value "head" (S.fold FL.head)
214+ , benchIOSink value "find" (S.fold (FL.find (== (value + 1))))
351215 , benchIOSink
352216 value
353217 "lookup"
354− (Stream.fold (FL.lmap (\a -> (a, a)) (FL.lookup (value + 1))))
218+ (S.fold (FL.lmap (\a -> (a, a)) (FL.lookup (value + 1))))
355219 , benchIOSink
356220 value
357221 "findIndex"
358− (Stream.fold (FL.findIndex (== (value + 1))))
222+ (S.fold (FL.findIndex (== (value + 1))))
359223 , benchIOSink
360224 value
361225 "elemIndex"
362− (Stream.fold (FL.elemIndex (value + 1)))
363− , benchIOSink value "null" (Stream.fold FL.null)
364− , benchIOSink value "elem" (Stream.fold (FL.elem (value + 1)))
365− , benchIOSink value "notElem" (Stream.fold (FL.notElem (value + 1)))
226+ (S.fold (FL.elemIndex (value + 1)))
227+ , benchIOSink value "null" (S.fold FL.null)
228+ , benchIOSink value "elem" (S.fold (FL.elem (value + 1)))
229+ , benchIOSink value "notElem" (S.fold (FL.notElem (value + 1)))
366230 , benchIOSink value "all" $ all value
367231 , benchIOSink value "any" $ any value
368232 , benchIOSink value "take" $ take value
369− , benchIOSink value "takeEndBy_" $ takeEndBy_ value
370− , benchIOSink value "and" (Stream.fold FL.and . fmap (<= (value + 1)))
371− , benchIOSink value "or" (Stream.fold FL.or . fmap (> (value + 1)))
233+ , benchIOSink value "sliceSepBy" $ sliceSepBy value
234+ , benchIOSink value "and" (S.fold FL.and . S.map (<= (value + 1)))
235+ , benchIOSink value "or" (S.fold FL.or . S.map (> (value + 1)))
372236 ]
373237 ]
374238
375239o_1_space_serial_transformation :: Int -> [Benchmark]
376240o_1_space_serial_transformation value =
377241 [ bgroup "transformation"
378− [ benchIOSink value "map" (Stream.fold (FL.lmap (+ 1) FL.drain))
242+ [ benchIOSink value "lmap" (S.fold (FL.lmap (+ 1) FL.drain))
379243 , let f x = if even x then Just x else Nothing
380244 fld = FL.mapMaybe f FL.drain
381− in benchIOSink value "mapMaybe" (Stream.fold fld)
245+ in benchIOSink value "mapMaybe" (S.fold fld)
382246 , benchIOSink
383247 value
384− "rsequence"
385− (Stream.fold (FL.rmapM id (return <$> FL.drain)))
386− , benchIOSink value "rmapM" (Stream.fold (FL.rmapM return FL.drain))
248+ "sequence"
249+ (S.fold (FL.sequence (return <$> FL.drain)))
250+ , benchIOSink value "mapM" (S.fold (FL.mapM return FL.drain))
387251 , benchIOSink
388252 value
389253 "pipe-mapM"
390− (Stream.fold
254+ (S.fold
391255 (FL.transform
392256 (Pipe.mapM (\x -> return $ x + 1))
393257 FL.drain))
394− , benchIOSink
395− value
396− "fold-scan"
397− (Stream.fold $ FL.scan FL.sum FL.drain)
398− , benchIOSink
399− value
400− "fold-scanMany"
401− (Stream.fold $ FL.scanMany (FL.take 2 FL.drain) FL.drain)
402− , benchIOSink
403− value
404− "fold-postscan"
405− (Stream.fold $ FL.postscan FL.sum FL.drain)
406258 ]
407259 ]
408260
@@ -410,34 +262,27 @@ o_1_space_serial_composition :: Int -> [Benchmark]
410262o_1_space_serial_composition value =
411263 [ bgroup
412264 "composition"
413− [ benchIOSink value "filter even" $ filter value
414− , benchIOSink value "scanMaybe even" $ scanMaybe value
415− , benchIOSink value "scanMaybe even, odd" $ scanMaybe2 value
416− , benchIOSink value "foldBreak (recursive)" foldBreak
417− , benchIOSink value "splitWith (all, any)" $ splitAllAny value
418− , benchIOSink value "split_ (all, any)" $ split_ value
419− , benchIOSink value "tee (all, any)" $ teeAllAny value
265+ [ benchIOSink value "splitWith (all, any)" $ splitAllAny value
266+ , benchIOSink value "teeApplicative (all, any)"
267+ $ teeApplicative value
420268 , benchIOSink value "many drain (take 1)" many
421− , bench "unfoldMany" $ unfoldMany value
422− , benchIOSink value "shortest (sum, length)" shortest
423− , benchIOSink value "longest (sum, length)" longest
424269 , benchIOSink value "tee (sum, length)" teeSumLength
425− , benchIOSink value "teeWithFst (sum, length)" teeWithFst
426− , benchIOSink value "teeWithMin (sum, length)" teeWithMin
427270 , benchIOSink value "distribute [sum, length]" distribute
428271 , benchIOSink value "partition (sum, length)" partition
429− , benchIOSink value "partitionByFstM (sum, length)" partitionByFstM
430− , benchIOSink value "partitionByMinM (sum, length)" partitionByMinM
431272 , benchIOSink value "unzip (sum, length)" unzip
432− , benchIOSink value "unzipWithFstM (sum, length)" unzipWithFstM
433− , benchIOSink value "unzipWithMinM (sum, length)" unzipWithMinM
273+ , benchIOSink value "demuxDefaultWith [sum, length] sum"
274+ $ demuxDefaultWith fn mp
275+ , benchIOSink value "demuxWith [sum, length]" $ demuxWith fn mp
276+ , benchIOSink value "classifyWith sum" $ classifyWith (fst . fn)
434277 ]
435278 ]
436279
437−o_n_space_serial :: Int -> [Benchmark]
438−o_n_space_serial value =
439− [ benchIOSink value "sequence_/100" $ Stream.fold (sequence_ (value `div` 100))
440− ]
280+ where
281+
282+ -- We use three keys 0, 1, and 2. 0 and 1 are mapped and 3 is unmapped.
283+ fn x = (x `mod` 3, x)
284+
285+ mp = Map.fromList [(0, FL.sum), (1, FL.length)]
441286
442287o_n_heap_serial :: Int -> [Benchmark]
443288o_n_heap_serial value =
@@ -445,71 +290,19 @@ o_n_heap_serial value =
445290 -- Left folds for building a structure are inherently non-streaming
446291 -- as the structure cannot be lazily consumed until fully built.
447292 [
448− benchIOSink value "toList" (Stream.fold FL.toList)
449− , benchIOSink value "toListRev" (Stream.fold FL.toListRev)
450− , benchIOSink value "toStream"
451− (Stream.fold FL.toStream
452− :: Stream IO a -> IO (Stream Identity a))
453− , benchIOSink value "toStreamRev"
454− (Stream.fold FL.toStreamRev
455− :: Stream IO a -> IO (Stream Identity a))
456− , benchIOSink value "nub" (Stream.fold FL.nub)
457− ]
458− , bgroup "key-value"
459− [
460− benchIOSink value "demuxToMap (64 buckets) [sum, length]"
461− $ demuxToMap (getKey 64) (getFold . getKey 64)
462− , benchIOSink value "demuxToIntMap (64 buckets) [sum, length]"
463− $ demuxToIntMap (getKey 64) (getFold . getKey 64)
464− , benchIOSink value "demuxToHashMap (64 buckets) [sum, length]"
465− $ demuxToHashMap (getKey 64) (getFold . getKey 64)
466− , benchIOSink value "demuxToMapIO (64 buckets) [sum, length]"
467− $ demuxToMapIO (getKey 64) (getFold . getKey 64)
468− , benchIOSink value "demuxToHashMapIO (64 buckets) [sum, length]"
469− $ demuxToHashMapIO (getKey 64) (getFold . getKey 64)
470−
471− -- classify: immutable
472− , benchIOSink value "toMap (64 buckets) sum"
473− $ toMap (getKey 64)
474− , benchIOSink value "toIntMap (64 buckets) sum"
475− $ toIntMap (getKey 64)
476−
477− -- classify: mutable cells
478− , benchIOSink value "toMapIO (single bucket) sum"
479− $ toMapIO (getKey 1)
480− , benchIOSink value "toMapIO (64 buckets) sum"
481− $ toMapIO (getKey 64)
482− , benchIOSink value "toMapIO (max buckets) sum"
483− $ toMapIO (getKey value)
484− , benchIOSink value "toIntMapIO (64 buckets) sum"
485− $ toIntMapIO (getKey 64)
486− , benchIOSink value "toHashMapIO (single bucket) sum"
487− $ toHashMapIO (getKey 1)
488− , benchIOSink value "toHashMapIO (64 buckets) sum"
489− $ toHashMapIO (getKey 64)
490− , benchIOSink value "toHashMapIO (max buckets) sum"
491− $ toHashMapIO (getKey value)
293+ benchIOSink value "toList" (S.fold FL.toList)
294+ , benchIOSink value "toListRevF" (S.fold FL.toListRevF)
492295 ]
493296 ]
494297
495− where
496−
497− getKey buckets = (`mod` buckets)
498−
499− getFold k =
500− return $ case k of
501− 0 -> FL.sum
502− 1 -> FL.length
503− _ -> FL.length
504−
505298-------------------------------------------------------------------------------
506299-- Driver
507300-------------------------------------------------------------------------------
508301
509302main :: IO ()
510303main = do
511−#ifndef FUSION_CHECK
512− runWithCLIOpts defaultStreamSize allBenchmarks
304+ (value, cfg, benches) <- parseCLIOpts defaultStreamSize
305+ value `seq` runMode (mode cfg) cfg benches (allBenchmarks value)
513306
514307 where
515308
@@ -519,23 +312,5 @@ main = do
519312 , o_1_space_serial_transformation value
520313 , o_1_space_serial_composition value
521314 ]
522− , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
523315 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
524316 ]
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.hsdeleted−191
@@ -1,191 +0,0 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3−module Main (main) where
4−
5−import Control.DeepSeq (NFData)
6−import Streamly.Data.Fold (Fold)
7−import Streamly.Internal.Data.Stream (Stream)
8−import System.Random (randomRIO)
9−
10−import qualified Streamly.Data.Fold as Fold
11−import qualified Streamly.Internal.Data.Fold as Window
12−import qualified Streamly.Internal.Data.Ring as Ring
13−import qualified Streamly.Internal.Data.Stream as Stream
14−
15−import Streamly.Benchmark.Common
16−import Test.Tasty.Bench
17−
18−{-# INLINE source #-}
19−source :: (Monad m, Num a, Stream.Enumerable a) =>
20− Int -> a -> Stream m a
21−source len from =
22− Stream.enumerateFromThenTo from (from + 1) (from + fromIntegral len)
23−
24−{-# INLINE sourceDescending #-}
25−sourceDescending :: (Monad m, Num a, Stream.Enumerable a) =>
26− Int -> a -> Stream m a
27−sourceDescending len from =
28− Stream.enumerateFromThenTo
29− (from + fromIntegral len)
30− (from + fromIntegral (len - 1))
31− from
32−
33−{-# INLINE sourceDescendingInt #-}
34−sourceDescendingInt :: Monad m => Int -> Int -> Stream m Int
35−sourceDescendingInt = sourceDescending
36−
37−{-# INLINE benchWith #-}
38−benchWith :: (Num a, NFData b) =>
39− (Int -> a -> Stream IO a) -> Int -> String -> Fold IO a b -> Benchmark
40−benchWith src len name f =
41− bench name
42− $ nfIO
43− $ randomRIO (1, 1 :: Int) >>= Stream.fold f . src len . fromIntegral
44−
45−{-# INLINE benchWithFold #-}
46−benchWithFold :: NFData a => Int -> String -> Fold IO Double a -> Benchmark
47−benchWithFold = benchWith source
48−
49−{-# INLINE benchWithFoldInt #-}
50−benchWithFoldInt :: Int -> String -> Fold IO Int Int -> Benchmark
51−benchWithFoldInt = benchWith source
52−
53−{-# INLINE benchScanWith #-}
54−benchScanWith :: Num a =>
55− (Int -> a -> Stream IO a) -> Int -> String -> Fold IO a b -> Benchmark
56−benchScanWith src len name f =
57− bench name
58− $ nfIO
59− $ randomRIO (1, 1 :: Int)
60− >>= Stream.fold Fold.drain
61− . Stream.postscan f
62− . src len
63− . fromIntegral
64−
65−{-# INLINE benchWithPostscan #-}
66−benchWithPostscan :: Int -> String -> Fold IO Double a -> Benchmark
67−benchWithPostscan = benchScanWith source
68−
69−o_1_space_folds :: Int -> [Benchmark]
70−o_1_space_folds numElements =
71− [ bgroup "fold"
72− [ benchWithFold numElements "minimum (window size 100)"
73− (Window.windowMinimum 100)
74− , benchWithFold numElements "minimum (window size 1000)"
75− (Window.windowMinimum 1000)
76− , benchWith sourceDescendingInt numElements
77− "minimum descending (window size 1000)"
78− (Window.windowMinimum 1000)
79−
80− , benchWithFold numElements "maximum (window size 100)"
81− (Window.windowMaximum 100)
82− , benchWithFold numElements "maximum (window size 1000)"
83− (Window.windowMaximum 1000)
84− , benchWith sourceDescendingInt numElements
85− "maximum descending (window size 1000)"
86− (Window.windowMaximum 1000)
87−
88− , benchWithFold numElements "range (window size 100)"
89− (Window.windowRange 100)
90− , benchWithFold numElements "range (window size 1000)"
91− (Window.windowRange 1000)
92− , benchWith sourceDescendingInt numElements
93− "range descending (window size 1000)"
94− (Window.windowRange 1000)
95−
96− , benchWithFoldInt numElements "sumInt (window size 100)"
97− (Ring.slidingWindow 100 Window.windowSumInt)
98− , benchWithFoldInt numElements "sum for Int (window size 100)"
99− (Ring.slidingWindow 100 Window.windowSum)
100− , benchWithFold numElements "sum (window size 100)"
101− (Ring.slidingWindow 100 Window.windowSum)
102− , benchWithFold numElements "sum (window size 1000)"
103− (Ring.slidingWindow 1000 Window.windowSum)
104− , benchWithFold numElements "sum (entire stream)"
105− (Window.cumulative Window.windowSum)
106− , benchWithFold numElements "sum (Data.Fold)"
107− Fold.sum
108−
109− , benchWithFold numElements "mean (window size 100)"
110− (Ring.slidingWindow 100 Window.windowMean)
111− , benchWithFold numElements "mean (window size 1000)"
112− (Ring.slidingWindow 1000 Window.windowMean)
113− , benchWithFold numElements "mean (entire stream)"
114− (Window.cumulative Window.windowMean)
115− , benchWithFold numElements "mean (Data.Fold)"
116− Fold.mean
117−
118− , benchWithFold numElements "powerSum 2 (window size 100)"
119− (Ring.slidingWindow 100 (Window.windowPowerSum 2))
120− , benchWithFold numElements "powerSum 2 (entire stream)"
121− (Window.cumulative (Window.windowPowerSum 2))
122−
123− ]
124− ]
125−
126−o_1_space_scans :: Int -> [Benchmark]
127−o_1_space_scans numElements =
128− [ bgroup "scan"
129− [ benchWithPostscan numElements "minimum (window size 10)"
130− (Window.windowMinimum 10)
131− -- Below window size 30 the linear search based impl performs better
132− -- than the dequeue based implementation.
133− , benchWithPostscan numElements "minimum (window size 30)"
134− (Window.windowMinimum 30)
135− , benchWithPostscan numElements "minimum (window size 1000)"
136− (Window.windowMinimum 1000)
137− , benchScanWith sourceDescendingInt numElements
138− "minimum descending (window size 1000)"
139− (Window.windowMinimum 1000)
140−
141− , benchWithPostscan numElements "maximum (window size 10)"
142− (Window.windowMaximum 10)
143− , benchWithPostscan numElements "maximum (window size 30)"
144− (Window.windowMaximum 30)
145− , benchWithPostscan numElements "maximum (window size 1000)"
146− (Window.windowMaximum 1000)
147− , benchScanWith sourceDescendingInt numElements
148− "maximum descending (window size 1000)"
149− (Window.windowMaximum 1000)
150−
151− , benchWithPostscan numElements "range (window size 10)"
152− (Window.windowRange 10)
153− , benchWithPostscan numElements "range (window size 30)"
154− (Window.windowRange 30)
155− , benchWithPostscan numElements "range (window size 1000)"
156− (Window.windowRange 1000)
157− , benchScanWith sourceDescendingInt numElements
158− "range descending (window size 1000)"
159− (Window.windowRange 1000)
160−
161− , benchWithPostscan numElements "sum (window size 100)"
162− (Ring.slidingWindow 100 Window.windowSum)
163− , benchWithPostscan numElements "sum (window size 1000)"
164− (Ring.slidingWindow 1000 Window.windowSum)
165−
166− , benchWithPostscan numElements "mean (window size 100)"
167− (Ring.slidingWindow 100 Window.windowMean)
168− , benchWithPostscan numElements "mean (window size 1000)"
169− (Ring.slidingWindow 1000 Window.windowMean)
170−
171− , benchWithPostscan numElements "powerSum 2 (window size 100)"
172− (Ring.slidingWindow 100 (Window.windowPowerSum 2))
173− , benchWithPostscan numElements "powerSum 2 (window size 1000)"
174− (Ring.slidingWindow 1000 (Window.windowPowerSum 2))
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/MutArray.hsdeleted−300
@@ -1,300 +0,0 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−{-# OPTIONS_GHC -Wno-orphans #-}
3−
4−-- |
5−-- Module : Streamly.Benchmark.Data.Array.Unboxed.Mut
6−-- Copyright : (c) 2021 Composewell Technologies
7−-- License : BSD-3-Clause
8−-- Maintainer : streamly@composewell.com
9−
10−{-# LANGUAGE CPP #-}
11−{-# LANGUAGE FlexibleContexts #-}
12−{-# LANGUAGE ScopedTypeVariables #-}
13−
14−#ifdef __HADDOCK_VERSION__
15−#undef INSPECTION
16−#endif
17−
18−#ifdef INSPECTION
19−{-# LANGUAGE TemplateHaskell #-}
20−{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
21−#endif
22−
23−import Control.DeepSeq (NFData(..))
24−import Control.Monad.IO.Class (MonadIO)
25−import Data.Functor ((<&>))
26−import System.Random (randomRIO)
27−import Prelude
28− ( IO
29− , Int
30− , Integral(..)
31− , Maybe(..)
32− , Monad(..)
33− , Num(..)
34− , Ord(..)
35− , String
36− , ($)
37− , (.)
38− , (||)
39− , concat
40− , const
41− , fmap
42− , id
43− , undefined
44− )
45−import Streamly.Internal.Data.MutArray (MutArray)
46−
47−import qualified Streamly.Internal.Data.Array as Array
48−import qualified Streamly.Internal.Data.MutArray as MArray
49−import qualified Streamly.Internal.Data.Fold as Fold
50−import qualified Streamly.Internal.Data.Stream as Stream
51−
52−import Test.Tasty.Bench
53−import Streamly.Benchmark.Common hiding (benchPureSrc)
54−
55−type Stream = MutArray
56−
57−instance NFData (MutArray a) where
58− {-# INLINE rnf #-}
59− rnf _ = ()
60−
61−-------------------------------------------------------------------------------
62−-- Benchmark helpers
63−-------------------------------------------------------------------------------
64−
65−{-# INLINE benchIO #-}
66−benchIO :: NFData b => String -> (Int -> IO a) -> (a -> b) -> Benchmark
67−benchIO name src f = bench name $ nfIO $
68− (randomRIO (1,1) >>= src) <&> f
69−
70−{-# INLINE benchPureSink #-}
71−benchPureSink :: NFData b => Int -> String -> (Stream Int -> b) -> Benchmark
72−benchPureSink value name = benchIO name (sourceIntFromTo value)
73−
74−{-# INLINE benchIO' #-}
75−benchIO' :: NFData b => String -> (Int -> IO a) -> (a -> IO b) -> Benchmark
76−benchIO' name src f = bench name $ nfIO $
77− randomRIO (1,1) >>= src >>= f
78−
79−{-# INLINE benchIOSink #-}
80−benchIOSink :: NFData b => Int -> String -> (Stream Int -> IO b) -> Benchmark
81−benchIOSink value name = benchIO' name (sourceIntFromTo value)
82−
83−-- Drain a source that generates an array in the IO monad
84−{-# INLINE benchIOSrc #-}
85−benchIOSrc :: String -> (Int -> IO (Stream a)) -> Benchmark
86−benchIOSrc name src = benchIO name src id
87−
88−drain :: Monad m => Stream.Stream m a -> m ()
89−drain = Stream.fold Fold.drain
90−
91−-------------------------------------------------------------------------------
92−-- Bench Ops
93−-------------------------------------------------------------------------------
94−
95−{-# INLINE sourceUnfoldr #-}
96−sourceUnfoldr :: MonadIO m => Int -> Int -> m (Stream Int)
97−sourceUnfoldr value n =
98− Stream.fold (MArray.writeN value) $ Stream.unfoldr step n
99−
100− where
101−
102− step cnt =
103− if cnt > n + value
104− then Nothing
105− else Just (cnt, cnt + 1)
106−
107−{-# INLINE sourceIntFromTo #-}
108−sourceIntFromTo :: MonadIO m => Int -> Int -> m (Stream Int)
109−sourceIntFromTo value n =
110− Stream.fold (MArray.writeN value) $ Stream.enumerateFromTo n (n + value)
111−
112−{-# INLINE sourceFromList #-}
113−sourceFromList :: MonadIO m => Int -> Int -> m (Stream Int)
114−sourceFromList value n =
115− Stream.fold (MArray.writeN value) $ Stream.fromList [n .. n + value]
116−
117−{-# INLINE sourceIntFromToFromList #-}
118−sourceIntFromToFromList :: MonadIO m => Int -> Int -> m (Stream Int)
119−sourceIntFromToFromList value n = MArray.fromListN value [n..n + value]
120−
121−{-# INLINE sourceIntFromToFromStream #-}
122−sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
123−sourceIntFromToFromStream value n =
124− Stream.fold MArray.write $ Stream.enumerateFromTo n (n + value)
125−
126−{-# INLINE sourceUnfoldrM #-}
127−sourceUnfoldrM :: Monad m => Int -> Int -> Stream.Stream m Int
128−sourceUnfoldrM value n = Stream.unfoldrM step n
129− where
130− step cnt =
131− if cnt > n + value
132− then return Nothing
133− else return (Just (cnt, cnt + 1))
134−
135−-------------------------------------------------------------------------------
136−-- Transformation
137−-------------------------------------------------------------------------------
138−
139−{-# INLINE composeN #-}
140−composeN :: Monad m
141− => Int -> (Stream Int -> m (Stream Int)) -> Stream Int -> m (Stream Int)
142−composeN n f x =
143− case n of
144− 1 -> f x
145− 2 -> f x >>= f
146− 3 -> f x >>= f >>= f
147− 4 -> f x >>= f >>= f >>= f
148− _ -> undefined
149−
150−{-# INLINE scanl' #-}
151−scanl' :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
152−scanl' value n = composeN n $ onArray value $ Stream.scan (Fold.foldl' (+) 0)
153−
154−{-# INLINE scanl1' #-}
155−scanl1' :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
156−scanl1' value n = composeN n $ onArray value $ Stream.scanl1' (+)
157−
158−{-# INLINE map #-}
159−map :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
160−map value n = composeN n $ onArray value $ fmap (+ 1)
161−
162−{-# INLINE onArray #-}
163−onArray
164− :: MonadIO m => Int -> (Stream.Stream m Int -> Stream.Stream m Int)
165− -> Stream Int
166− -> m (Stream Int)
167−onArray value f arr =
168− Stream.fold (MArray.writeN value) $ f $ Stream.unfold MArray.reader arr
169−
170−-------------------------------------------------------------------------------
171−-- Elimination
172−-------------------------------------------------------------------------------
173−
174−{-# INLINE unfoldReadDrain #-}
175−unfoldReadDrain :: MonadIO m => Stream Int -> m ()
176−unfoldReadDrain = drain . Stream.unfold MArray.reader
177−
178−{-# INLINE unfoldReadRevDrain #-}
179−unfoldReadRevDrain :: MonadIO m => Stream Int -> m ()
180−unfoldReadRevDrain = drain . Stream.unfold MArray.readerRev
181−
182−{-# INLINE toStreamDRevDrain #-}
183−toStreamDRevDrain :: MonadIO m => Stream Int -> m ()
184−toStreamDRevDrain = drain . MArray.readRev
185−
186−{-# INLINE toStreamDDrain #-}
187−toStreamDDrain :: MonadIO m => Stream Int -> m ()
188−toStreamDDrain = drain . MArray.read
189−
190−{-# INLINE unfoldFold #-}
191−unfoldFold :: MonadIO m => Stream Int -> m Int
192−unfoldFold = Stream.fold (Fold.foldl' (+) 0) . Stream.unfold MArray.reader
193−
194−-------------------------------------------------------------------------------
195−-- Bench groups
196−-------------------------------------------------------------------------------
197−
198−o_1_space_generation :: Int -> [Benchmark]
199−o_1_space_generation value =
200− [ bgroup
201− "generation"
202− [ benchIOSrc "writeN . intFromTo" (sourceIntFromTo value)
203− , benchIOSrc
204− "fromList . intFromTo"
205− (sourceIntFromToFromList value)
206− , benchIOSrc "writeN . unfoldr" (sourceUnfoldr value)
207− , benchIOSrc "writeN . fromList" (sourceFromList value)
208− , benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
209− ]
210− ]
211−
212−o_1_space_elimination :: Int -> [Benchmark]
213−o_1_space_elimination value =
214− [ bgroup "elimination"
215− [ benchPureSink value "id" id
216− , benchIOSink value "foldl'" unfoldFold
217− , benchIOSink value "read" unfoldReadDrain
218− , benchIOSink value "readRev" unfoldReadRevDrain
219− , benchIOSink value "toStream" toStreamDDrain
220− , benchIOSink value "toStreamRev" toStreamDRevDrain
221− ]
222− ]
223−
224−o_n_heap_serial :: Int -> [Benchmark]
225−o_n_heap_serial value =
226− [ bgroup "elimination"
227− [
228− -- Converting the stream to an array
229− benchFold "writeN" (Stream.fold (MArray.writeN value))
230− (sourceUnfoldrM value)
231− ]
232− ]
233−
234−o_1_space_transformation :: Int -> [Benchmark]
235−o_1_space_transformation value =
236− [ bgroup "transformation"
237− [ benchIOSink value "scanl'" (scanl' value 1)
238− , benchIOSink value "scanl1'" (scanl1' value 1)
239− , benchIOSink value "map" (map value 1)
240− ]
241− ]
242−
243−o_1_space_transformationX4 :: Int -> [Benchmark]
244−o_1_space_transformationX4 value =
245− [ bgroup "transformationX4"
246− [ benchIOSink value "scanl'" (scanl' value 4)
247− , benchIOSink value "scanl1'" (scanl1' value 4)
248− , benchIOSink value "map" (map value 4)
249− ]
250− ]
251−
252−o_1_space_serial_marray ::
253− Int -> (MutArray Int, Array.Array Int) -> [Benchmark]
254−o_1_space_serial_marray value ~(array, indices) =
255− [ benchIO' "partitionBy (< 0)" (const (return array))
256− $ MArray.partitionBy (< 0)
257− , benchIO' "partitionBy (> 0)" (const (return array))
258− $ MArray.partitionBy (> 0)
259− , benchIO' "partitionBy (< value/2)" (const (return array))
260− $ MArray.partitionBy (< (value `div` 2))
261− , benchIO' "partitionBy (> value/2)" (const (return array))
262− $ MArray.partitionBy (> (value `div` 2))
263− , benchIO' "strip (< value/2 || > value/2)" (const (return array))
264− $ MArray.strip (\x -> x < value `div` 2 || x > value `div` 2)
265− , benchIO' "strip (> 0)" (const (return array))
266− $ MArray.strip (> 0)
267− , benchIO' "modifyIndices (+ 1)" (const (return indices))
268− $ Stream.fold (MArray.modifyIndices array (\_idx val -> val + 1))
269− . Stream.unfold Array.reader
270− ]
271−
272−-------------------------------------------------------------------------------
273−-- Driver
274−-------------------------------------------------------------------------------
275−
276−moduleName :: String
277−moduleName = "Data.MutArray"
278−
279−main :: IO ()
280−main = do
281− runWithCLIOptsEnv defaultStreamSize alloc allBenchmarks
282−
283− where
284−
285− alloc value = do
286− marr <- MArray.fromStream (sourceUnfoldrM value 0 :: Stream.Stream IO Int)
287− indices <- Array.fromStream (sourceUnfoldrM value 0 :: Stream.Stream IO Int)
288− return (marr, indices)
289−
290− allBenchmarks array value =
291− [ bgroup (o_1_space_prefix moduleName)
292− $ concat
293− [ o_1_space_serial_marray value array
294− , o_1_space_generation value
295− , o_1_space_elimination value
296− , o_1_space_transformation value
297− , o_1_space_transformationX4 value
298− ]
299− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
300− ]
benchmark/Streamly/Benchmark/Data/NestedUnfoldOps.hsnew file+126
@@ -0,0 +1,126 @@
1+-- |
2+-- Module : NestedUnfoldOps
3+-- Copyright : (c) 2019 Composewell Technologies
4+--
5+-- License : BSD3
6+-- Maintainer : streamly@composewell.com
7+
8+module Streamly.Benchmark.Data.NestedUnfoldOps where
9+
10+import Control.Monad.IO.Class (MonadIO (..))
11+import Streamly.Internal.Data.Unfold (Unfold)
12+
13+import qualified Streamly.Internal.Data.Unfold as UF
14+import qualified Streamly.Internal.Data.Fold as FL
15+
16+-- n * (n + 1) / 2 == linearCount
17+concatCount :: Int -> Int
18+concatCount linearCount =
19+ round (((1 + 8 * fromIntegral linearCount)**(1/2::Double) - 1) / 2)
20+
21+-- double nested loop
22+nestedCount2 :: Int -> Int
23+nestedCount2 linearCount = round (fromIntegral linearCount**(1/2::Double))
24+
25+-- triple nested loop
26+nestedCount3 :: Int -> Int
27+nestedCount3 linearCount = round (fromIntegral linearCount**(1/3::Double))
28+
29+-------------------------------------------------------------------------------
30+-- Stream generation and elimination
31+-------------------------------------------------------------------------------
32+
33+-- generate numbers up to the argument value
34+{-# INLINE source #-}
35+source :: Monad m => Int -> Unfold m Int Int
36+source n = UF.enumerateFromToIntegral n
37+
38+-------------------------------------------------------------------------------
39+-- Benchmark ops
40+-------------------------------------------------------------------------------
41+
42+{-# INLINE toNull #-}
43+toNull :: MonadIO m => Int -> Int -> m ()
44+toNull linearCount start = do
45+ let end = start + nestedCount2 linearCount
46+ UF.fold
47+ (UF.map (\(x, y) -> x + y)
48+ $ UF.outerProduct (source end) (source end))
49+ FL.drain (start, start)
50+
51+{-# INLINE toNull3 #-}
52+toNull3 :: MonadIO m => Int -> Int -> m ()
53+toNull3 linearCount start = do
54+ let end = start + nestedCount3 linearCount
55+ UF.fold
56+ (UF.map (\(x, y) -> x + y)
57+ $ UF.outerProduct (source end)
58+ ((UF.map (\(x, y) -> x + y)
59+ $ UF.outerProduct (source end) (source end))))
60+ FL.drain (start, (start, start))
61+
62+{-# INLINE concat #-}
63+concat :: MonadIO m => Int -> Int -> m ()
64+concat linearCount start = do
65+ let end = start + concatCount linearCount
66+ UF.fold
67+ (UF.concat (source end) (source end))
68+ FL.drain start
69+
70+{-# INLINE toList #-}
71+toList :: MonadIO m => Int -> Int -> m [Int]
72+toList linearCount start = do
73+ let end = start + nestedCount2 linearCount
74+ UF.fold
75+ (UF.map (\(x, y) -> x + y)
76+ $ UF.outerProduct (source end) (source end))
77+ FL.toList (start, start)
78+
79+{-# INLINE toListSome #-}
80+toListSome :: MonadIO m => Int -> Int -> m [Int]
81+toListSome linearCount start = do
82+ let end = start + nestedCount2 linearCount
83+ UF.fold
84+ (UF.take 1000 $ (UF.map (\(x, y) -> x + y)
85+ $ UF.outerProduct (source end) (source end)))
86+ FL.toList (start, start)
87+
88+{-# INLINE filterAllOut #-}
89+filterAllOut :: MonadIO m => Int -> Int -> m ()
90+filterAllOut linearCount start = do
91+ let end = start + nestedCount2 linearCount
92+ UF.fold
93+ (UF.filter (< 0)
94+ $ UF.map (\(x, y) -> x + y)
95+ $ UF.outerProduct (source end) (source end))
96+ FL.drain (start, start)
97+
98+{-# INLINE filterAllIn #-}
99+filterAllIn :: MonadIO m => Int -> Int -> m ()
100+filterAllIn linearCount start = do
101+ let end = start + nestedCount2 linearCount
102+ UF.fold
103+ (UF.filter (> 0)
104+ $ UF.map (\(x, y) -> x + y)
105+ $ UF.outerProduct (source end) (source end))
106+ FL.drain (start, start)
107+
108+{-# INLINE filterSome #-}
109+filterSome :: MonadIO m => Int -> Int -> m ()
110+filterSome linearCount start = do
111+ let end = start + nestedCount2 linearCount
112+ UF.fold
113+ (UF.filter (> 1100000)
114+ $ UF.map (\(x, y) -> x + y)
115+ $ UF.outerProduct (source end) (source end))
116+ FL.drain (start, start)
117+
118+{-# INLINE breakAfterSome #-}
119+breakAfterSome :: MonadIO m => Int -> Int -> m ()
120+breakAfterSome linearCount start = do
121+ let end = start + nestedCount2 linearCount
122+ UF.fold
123+ (UF.takeWhile (<= 1100000)
124+ $ UF.map (\(x, y) -> x + y)
125+ $ UF.outerProduct (source end) (source end))
126+ FL.drain (start, start)
benchmark/Streamly/Benchmark/Data/Parser.hs+134−692
@@ -1,10 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3−#undef FUSION_CHECK
4−#ifdef FUSION_CHECK
5−{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
6−#endif
7−
81-- |
92-- Module : Streamly.Benchmark.Data.Parser
103-- Copyright : (c) 2020 Composewell Technologies
@@ -12,46 +5,33 @@
125-- License : BSD-3-Clause
136-- Maintainer : streamly@composewell.com
147
15−{-# LANGUAGE CPP #-}
168{-# LANGUAGE FlexibleContexts #-}
17−{-# LANGUAGE ScopedTypeVariables #-}
18−{-# OPTIONS_GHC -Wno-orphans #-}
199
2010module Main
2111 (
2212 main
2313 ) where
2414
25−import Control.Applicative ((<|>))
2615import Control.DeepSeq (NFData(..))
27−import Data.Function ((&))
16+import Control.Monad.Catch (MonadCatch)
17+import Data.Foldable (asum)
2818import Data.Functor (($>))
2919import Data.Monoid (Sum(..))
30−import GHC.Magic (inline)
31−import GHC.Magic (noinline)
32−import System.IO (Handle)
3320import 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)
38−import Prelude hiding
39− (any, all, take, sequence, sequence_, sequenceA, takeWhile, dropWhile, span)
21+import Prelude
22+ hiding (any, all, take, sequence, sequence_, sequenceA, takeWhile)
4023
41−import qualified Control.Applicative as AP
42−import qualified Data.Foldable as F
4324import qualified Data.Traversable as TR
44−import qualified Streamly.FileSystem.Handle as Handle
45−import qualified Streamly.Internal.Data.Array as Array
46−import qualified Streamly.Internal.Data.Fold as Fold
25+import qualified Data.Foldable as F
26+import qualified Control.Applicative as AP
27+import qualified Streamly.Prelude as S
28+import qualified Streamly.Internal.Data.Fold as FL
4729import qualified Streamly.Internal.Data.Parser as PR
48−import qualified Streamly.Data.Stream as Stream
49−import qualified Streamly.Internal.Data.Producer as Producer
50−import qualified Streamly.Internal.Data.Stream as Stream
30+import qualified Streamly.Internal.Data.Stream.IsStream as IP
5131
52−import Test.Tasty.Bench hiding (env)
32+import Gauge
33+import Streamly.Prelude (SerialT)
5334import Streamly.Benchmark.Common
54−import Streamly.Benchmark.Common.Handle
5535
5636-------------------------------------------------------------------------------
5737-- Utilities
@@ -60,59 +40,19 @@ import Streamly.Benchmark.Common.Handle
6040-- XXX these can be moved to the common module
6141
6242{-# INLINE sourceUnfoldrM #-}
63−sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
64−sourceUnfoldrM value n = Stream.unfoldrM step n
43+sourceUnfoldrM :: (S.IsStream t, S.MonadAsync m) => Int -> Int -> t m Int
44+sourceUnfoldrM value n = S.unfoldrM step n
6545 where
6646 step cnt =
6747 if cnt > n + value
6848 then return Nothing
6949 else return (Just (cnt, cnt + 1))
7050
71−-- | Generates something like this: { { \{ \{ } }. The stream consists of
72−-- three parts, the first part is contains a sequence of `{`. The second part
73−-- contains a sequence pf escaped values `\{`. The third part contains a
74−-- sequence of `}`.
75−{-# INLINE sourceEscapedFrames #-}
76−sourceEscapedFrames ::
77− Monad m
78− => Int
79− -> Int
80− -> Stream m Char
81−sourceEscapedFrames value n = Stream.unfoldrM step n
82− where
83−
84− bs = '\\'
85− cbOpen = '{'
86− cbClose = '}'
87− value1 = value `div` 4
88−
89− step cnt
90− | cnt > 4 * value1 = return Nothing
91− | cnt <= value1 = return $ Just (cbOpen, cnt + 1)
92− | cnt > 3 * value1 = return $ Just (cbClose, cnt + 1)
93− | otherwise =
94− return
95− $ Just
96− $ if (cnt - value1) `mod` 2 == 1
97− then (bs, cnt + 1)
98− else (cbOpen, cnt + 1)
99−
100−{-# INLINE benchIOSrc #-}
101−benchIOSrc
102− :: NFData b
103− => (Int -> Int -> Stream IO a)
104− -> Int
105− -> String
106− -> (Stream IO a -> IO b)
107− -> Benchmark
108−benchIOSrc src value name f =
109− bench name $ nfIO $ randomRIO (1,1) >>= f . src value
110−
11151-- | Takes a fold method, and uses it with a default source.
11252{-# INLINE benchIOSink #-}
11353benchIOSink
114− :: NFData b
115− => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
54+ :: (S.IsStream t, NFData b)
55+ => Int -> String -> (t IO Int -> IO b) -> Benchmark
11656benchIOSink value name f =
11757 bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
11858
@@ -120,452 +60,142 @@ benchIOSink value name f =
12060-- Parsers
12161-------------------------------------------------------------------------------
12262
123−{-# INLINE takeBetween #-}
124−takeBetween :: Monad m => Int -> Stream m a -> m (Either ParseError ())
125−takeBetween value = Stream.parse (PR.takeBetween 0 value Fold.drain)
126−
12763{-# INLINE takeEQ #-}
128−takeEQ :: Monad m => Int -> Stream m a -> m (Either ParseError ())
129−takeEQ value = Stream.parse (PR.takeEQ value Fold.drain)
130−
131−{-# INLINE takeGE #-}
132−takeGE :: Monad m => Int -> Stream m a -> m (Either ParseError ())
133−takeGE value = Stream.parse (PR.takeGE value Fold.drain)
134−
135−{-# INLINE dropWhile #-}
136−dropWhile :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
137−dropWhile value = Stream.parse (PR.dropWhile (<= value))
64+takeEQ :: MonadCatch m => Int -> SerialT m a -> m ()
65+takeEQ value = IP.parse (PR.takeEQ value FL.drain)
13866
139−{-# INLINE takeStartBy #-}
140−takeStartBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
141−takeStartBy value stream = do
142− let stream2 = value `Stream.cons` stream
143− Stream.parse (PR.takeStartBy (== value) Fold.drain) stream2
144−
145−takeFramedByEsc_ :: Monad m => Int -> Stream m Char -> m (Either ParseError ())
146−takeFramedByEsc_ _ = Stream.parse parser
147−
148− where
149−
150− isEsc = (== '\\')
151− isBegin = (== '{')
152− isEnd = (== '}')
153−
154− parser = PR.takeFramedByEsc_ isEsc isBegin isEnd Fold.drain
155−
156−{-# INLINE listEqBy #-}
157−listEqBy :: Int -> Stream IO Int -> IO (Either ParseError [Int])
158−listEqBy len = Stream.parse (PR.listEqBy (==) [1 .. len])
159−
160−{-# INLINE streamEqBy #-}
161−streamEqBy :: Int -> Stream IO Int -> IO (Either ParseError ())
162−streamEqBy len = Stream.parse (PR.streamEqBy (==) (Stream.enumerateFromTo 1 len))
67+{-# INLINE drainWhile #-}
68+drainWhile :: MonadCatch m => Int -> SerialT m Int -> m ()
69+drainWhile value = IP.parse (PR.drainWhile (<= value))
16370
16471{-# INLINE takeWhile #-}
165−takeWhile :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
166−takeWhile value = Stream.parse (PR.takeWhile (<= value) Fold.drain)
167−
168−takeWhileP :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
169−takeWhileP value =
170− Stream.parse (PR.takeWhileP (<= value) (PR.takeWhile (<= value - 1) Fold.drain))
171−
172−{-# INLINE takeP #-}
173−takeP :: Monad m => Int -> Stream m a -> m (Either ParseError ())
174−takeP value = Stream.parse (PR.takeP value (PR.fromFold Fold.drain))
72+takeWhile :: MonadCatch m => Int -> SerialT m Int -> m ()
73+takeWhile value = IP.parse (PR.takeWhile (<= value) FL.drain)
17574
17675{-# INLINE groupBy #-}
177−groupBy :: Monad m => Stream m Int -> m (Either ParseError ())
178−groupBy = Stream.parse (PR.groupBy (<=) Fold.drain)
179−
180−{-# INLINE groupByRolling #-}
181−groupByRolling :: Monad m => Stream m Int -> m (Either ParseError ())
182−groupByRolling = Stream.parse (PR.groupByRolling (<=) Fold.drain)
76+groupBy :: MonadCatch m => SerialT m Int -> m ()
77+groupBy = IP.parse (PR.groupBy (<=) FL.drain)
18378
18479{-# INLINE wordBy #-}
185−wordBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
186−wordBy value = Stream.parse (PR.wordBy (>= value) Fold.drain)
187−
188−{-# INLINE sepByWords #-}
189−sepByWords :: Monad m => Stream m Int -> m (Either ParseError ())
190−sepByWords = Stream.parse (wrds even Fold.drain)
191− where
192− wrds p = PR.sepBy (PR.takeWhile (not . p) Fold.drain) (PR.dropWhile p)
193−
194−{-# INLINE sepByAllWords #-}
195−sepByAllWords :: Monad m => Stream m Int -> m (Either ParseError ())
196−sepByAllWords = Stream.parse (wrds even Fold.drain)
197− where
198− wrds p = PR.sepByAll (PR.takeWhile (not . p) Fold.drain) (PR.dropWhile p)
199−
200−-- Returning a list to compare with the sepBy1 in ParserK
201−{-# INLINE sepBy1 #-}
202−sepBy1 :: Monad m => Stream m Int -> m (Either ParseError [Int])
203−sepBy1 xs = do
204− Stream.parse (PR.sepBy1 (PR.satisfy odd) (PR.satisfy even) Fold.toList) xs
205−
206−{-# INLINE sepByWords1 #-}
207−sepByWords1 :: Monad m => Stream m Int -> m (Either ParseError ())
208−sepByWords1 = Stream.parse (wrds even Fold.drain)
209− where
210− wrds p = PR.sepBy1 (PR.takeWhile (not . p) Fold.drain) (PR.dropWhile p)
211−
212−{-# INLINE deintercalate #-}
213−deintercalate :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
214−deintercalate _ = Stream.parse (partition even)
215−
216− where
217−
218− partition p =
219− PR.deintercalate
220− (PR.takeWhile (not . p) Fold.sum) (PR.takeWhile p Fold.sum) Fold.drain
221−
222−{-# INLINE deintercalate1 #-}
223−deintercalate1 :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
224−deintercalate1 _ = Stream.parse (partition even)
225−
226− where
227−
228− partition p =
229− PR.deintercalate1
230− (PR.takeWhile (not . p) Fold.sum) (PR.takeWhile p Fold.sum) Fold.drain
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
80+wordBy :: MonadCatch m => Int -> SerialT m Int -> m ()
81+wordBy value = IP.parse (PR.wordBy (>= value) FL.drain)
24182
24283{-# INLINE manyWordByEven #-}
243−manyWordByEven :: Monad m => Stream m Int -> m (Either ParseError ())
244−manyWordByEven = Stream.parse (PR.many (PR.wordBy even Fold.drain) Fold.drain)
84+manyWordByEven :: MonadCatch m => SerialT m Int -> m ()
85+manyWordByEven = IP.parse (PR.many FL.drain (PR.wordBy (Prelude.even) FL.drain))
24586
24687{-# INLINE many #-}
247−many :: Monad m => Stream m Int -> m (Either ParseError Int)
248−many = Stream.parse (PR.many (PR.satisfy (> 0)) Fold.length)
88+many :: MonadCatch m => SerialT m Int -> m Int
89+many = IP.parse (PR.many FL.length (PR.satisfy (> 0)))
24990
25091{-# INLINE manyAlt #-}
251−manyAlt :: Monad m => Stream m Int -> m Int
92+manyAlt :: MonadCatch m => SerialT m Int -> m Int
25293manyAlt xs = do
253− x <- Stream.parse (AP.many (PR.satisfy (> 0))) xs
94+ x <- IP.parse (AP.many (PR.satisfy (> 0))) xs
25495 return $ Prelude.length x
25596
25697{-# INLINE some #-}
257−some :: Monad m => Stream m Int -> m (Either ParseError Int)
258−some = Stream.parse (PR.some (PR.satisfy (> 0)) Fold.length)
98+some :: MonadCatch m => SerialT m Int -> m Int
99+some = IP.parse (PR.some FL.length (PR.satisfy (> 0)))
259100
260101{-# INLINE someAlt #-}
261−someAlt :: Monad m => Stream m Int -> m Int
102+someAlt :: MonadCatch m => SerialT m Int -> m Int
262103someAlt xs = do
263− x <- Stream.parse (AP.some (PR.satisfy (> 0))) xs
104+ x <- IP.parse (AP.some (PR.satisfy (> 0))) xs
264105 return $ Prelude.length x
265106
266107{-# INLINE manyTill #-}
267−manyTill :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
108+manyTill :: MonadCatch m => Int -> SerialT m Int -> m Int
268109manyTill value =
269− Stream.parse (PR.manyTill (PR.satisfy (> 0)) (PR.satisfy (== value)) Fold.length)
110+ IP.parse (PR.manyTill FL.length (PR.satisfy (> 0)) (PR.satisfy (== value)))
270111
271−{-# INLINE splitAp2 #-}
272−splitAp2 :: Monad m
273− => Int -> Stream m Int -> m (Either ParseError ((), ()))
274−splitAp2 value =
275− Stream.parse
112+{-# INLINE splitAp #-}
113+splitAp :: MonadCatch m
114+ => Int -> SerialT m Int -> m ((), ())
115+splitAp value =
116+ IP.parse
276117 ((,)
277− <$> PR.dropWhile (<= (value `div` 2))
278− <*> PR.dropWhile (<= value)
279− )
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)
118+ <$> PR.drainWhile (<= (value `div` 2))
119+ <*> PR.drainWhile (<= value)
307120 )
308121
309122{-# INLINE splitApBefore #-}
310−splitApBefore :: Monad m
311− => Int -> Stream m Int -> m (Either ParseError ())
123+splitApBefore :: MonadCatch m
124+ => Int -> SerialT m Int -> m ()
312125splitApBefore value =
313− Stream.parse
314− ( PR.dropWhile (<= (value `div` 2))
315− *> PR.dropWhile (<= value)
126+ IP.parse
127+ ( PR.drainWhile (<= (value `div` 2))
128+ *> PR.drainWhile (<= value)
316129 )
317130
318131{-# INLINE splitApAfter #-}
319−splitApAfter :: Monad m
320− => Int -> Stream m Int -> m (Either ParseError ())
132+splitApAfter :: MonadCatch m
133+ => Int -> SerialT m Int -> m ()
321134splitApAfter value =
322− Stream.parse
323− ( PR.dropWhile (<= (value `div` 2))
324− <* PR.dropWhile (<= value)
135+ IP.parse
136+ ( PR.drainWhile (<= (value `div` 2))
137+ <* PR.drainWhile (<= value)
325138 )
326139
327−{-# INLINE splitWith2 #-}
328−splitWith2 :: Monad m
329− => Int -> Stream m Int -> m (Either ParseError ((), ()))
330−splitWith2 value =
331− Stream.parse
140+{-# INLINE splitWith #-}
141+splitWith :: MonadCatch m
142+ => Int -> SerialT m Int -> m ((), ())
143+splitWith value =
144+ IP.parse
332145 (PR.splitWith (,)
333− (PR.dropWhile (<= (value `div` 2)))
334− (PR.dropWhile (<= value))
146+ (PR.drainWhile (<= (value `div` 2)))
147+ (PR.drainWhile (<= value))
335148 )
336149
337150{-# INLINE split_ #-}
338−split_ :: Monad m
339− => Int -> Stream m Int -> m (Either ParseError ())
151+split_ :: MonadCatch m
152+ => Int -> SerialT m Int -> m ()
340153split_ value =
341− Stream.parse
154+ IP.parse
342155 (PR.split_
343− (PR.dropWhile (<= (value `div` 2)))
344− (PR.dropWhile (<= value))
345− )
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)
156+ (PR.drainWhile (<= (value `div` 2)))
157+ (PR.drainWhile (<= value))
430158 )
431159
432−{-# INLINE altSmall #-}
433−altSmall :: Monad m
434− => Int -> Stream m Int -> m ()
435−altSmall value =
436− Stream.fold Fold.drain .
437− Stream.parseMany
438− (PR.alt
439− (PR.satisfy (>= value) *> PR.die "alt")
440− (PR.satisfy (<= value))
441− )
442−
443−{-# INLINE monad #-}
444−monad :: Monad m
445− => Int -> Stream m Int -> m (Either ParseError ())
446−monad value =
447− Stream.parse
448− $ do
449− PR.dropWhile (<= (value `div` 2))
450− PR.dropWhile (<= value)
451−
452−{-# INLINE monad4 #-}
453−monad4 :: Monad m
454− => Int -> Stream m Int -> m (Either ParseError ())
455−monad4 value =
456− Stream.parse $ do
457− PR.dropWhile (<= (value `div` 4))
458− PR.dropWhile (<= (value `div` 2))
459− PR.dropWhile (<= (value * 3 `div` 4))
460− PR.dropWhile (<= value)
461−
462−{-# INLINE monad8 #-}
463−monad8 :: Monad m
464− => Int -> Stream m Int -> m (Either ParseError ())
465−monad8 value =
466− Stream.parse $ do
467− PR.dropWhile (<= (value * 1 `div` 8))
468− PR.dropWhile (<= (value * 2 `div` 8))
469− PR.dropWhile (<= (value * 3 `div` 8))
470− PR.dropWhile (<= (value * 4 `div` 8))
471− PR.dropWhile (<= (value * 5 `div` 8))
472− PR.dropWhile (<= (value * 6 `div` 8))
473− PR.dropWhile (<= (value * 7 `div` 8))
474− PR.dropWhile (<= value)
475−
476−{-# INLINE monad16 #-}
477−monad16 :: Monad m
478− => Int -> Stream m Int -> m (Either ParseError ())
479−monad16 value =
480− Stream.parse $ do
481− PR.dropWhile (<= (value * 1 `div` 16))
482− PR.dropWhile (<= (value * 2 `div` 16))
483− PR.dropWhile (<= (value * 3 `div` 16))
484− PR.dropWhile (<= (value * 4 `div` 16))
485− PR.dropWhile (<= (value * 5 `div` 16))
486− PR.dropWhile (<= (value * 6 `div` 16))
487− PR.dropWhile (<= (value * 7 `div` 16))
488− PR.dropWhile (<= (value * 8 `div` 16))
489− PR.dropWhile (<= (value * 9 `div` 16))
490− PR.dropWhile (<= (value * 10 `div` 16))
491− PR.dropWhile (<= (value * 11 `div` 16))
492− PR.dropWhile (<= (value * 12 `div` 16))
493− PR.dropWhile (<= (value * 13 `div` 16))
494− PR.dropWhile (<= (value * 14 `div` 16))
495− PR.dropWhile (<= (value * 15 `div` 16))
496− PR.dropWhile (<= value)
497−
498−{-# INLINE takeEndBy_ #-}
499−takeEndBy_ :: Monad m
500− => Int -> Stream m Int -> m (Either ParseError ())
501−takeEndBy_ value = Stream.parse (PR.takeEndBy_ (>= value) (PR.fromFold Fold.drain))
502−
503−{-
504160{-# INLINE teeAllAny #-}
505−teeAllAny :: Monad m
506− => Int -> Stream m Int -> m ((), ())
161+teeAllAny :: MonadCatch m
162+ => Int -> SerialT m Int -> m ((), ())
507163teeAllAny value =
508− Stream.parse
164+ IP.parse
509165 (PR.teeWith (,)
510− (PR.dropWhile (<= value))
511− (PR.dropWhile (<= value))
166+ (PR.drainWhile (<= value))
167+ (PR.drainWhile (<= value))
512168 )
513169
514170{-# INLINE teeFstAllAny #-}
515−teeFstAllAny :: Monad m
516− => Int -> Stream m Int -> m ((), ())
171+teeFstAllAny :: MonadCatch m
172+ => Int -> SerialT m Int -> m ((), ())
517173teeFstAllAny value =
518− Stream.parse
174+ IP.parse
519175 (PR.teeWithFst (,)
520− (PR.dropWhile (<= value))
521− (PR.dropWhile (<= value))
176+ (PR.drainWhile (<= value))
177+ (PR.drainWhile (<= value))
522178 )
523179
524180{-# INLINE shortestAllAny #-}
525−shortestAllAny :: Monad m
526− => Int -> Stream m Int -> m (Either ParseError ())
181+shortestAllAny :: MonadCatch m
182+ => Int -> SerialT m Int -> m ()
527183shortestAllAny value =
528− Stream.parse
184+ IP.parse
529185 (PR.shortest
530− (PR.dropWhile (<= value))
531− (PR.dropWhile (<= value))
186+ (PR.drainWhile (<= value))
187+ (PR.drainWhile (<= value))
532188 )
533189
534190{-# INLINE longestAllAny #-}
535−longestAllAny :: Monad m
536− => Int -> Stream m Int -> m (Either ParseError ())
191+longestAllAny :: MonadCatch m
192+ => Int -> SerialT m Int -> m ()
537193longestAllAny value =
538− Stream.parse
194+ IP.parse
539195 (PR.longest
540− (PR.dropWhile (<= value))
541− (PR.dropWhile (<= value))
196+ (PR.drainWhile (<= value))
197+ (PR.drainWhile (<= value))
542198 )
543−-}
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−
563−parseManyChunksOfSum :: Int -> Handle -> IO Int
564−parseManyChunksOfSum n inh =
565− Stream.fold Fold.length
566− $ Stream.parseMany
567− (PR.fromFold $ Fold.take n Fold.sum)
568− (Stream.unfold Handle.reader inh)
569199
570200-------------------------------------------------------------------------------
571201-- Parsers in which -fspec-constr-recursive=16 is problematic
@@ -576,129 +206,57 @@ parseManyChunksOfSum n inh =
576206-- not have to rely on it.
577207--
578208{-# INLINE lookAhead #-}
579−lookAhead :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
209+lookAhead :: MonadCatch m => Int -> SerialT m Int -> m ()
580210lookAhead value =
581− Stream.parse (PR.lookAhead (PR.takeWhile (<= value) Fold.drain) $> ())
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)))
211+ IP.parse (PR.lookAhead (PR.takeWhile (<= value) FL.drain) $> ())
588212
589−-- quadratic complexity
590213{-# INLINE sequenceA #-}
591−sequenceA :: Monad m => Int -> Stream m Int -> m Int
214+sequenceA :: MonadCatch m => Int -> SerialT m Int -> m Int
592215sequenceA value xs = do
593− x <- Stream.parse (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
216+ x <- IP.parse (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
594217 return $ length x
595218
596−-- quadratic complexity
219+{-# INLINE sequenceA_ #-}
220+sequenceA_ :: MonadCatch m => Int -> SerialT m Int -> m ()
221+sequenceA_ value =
222+ IP.parse (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
223+
597224{-# INLINE sequence #-}
598−sequence :: Monad m => Int -> Stream m Int -> m Int
225+sequence :: MonadCatch m => Int -> SerialT m Int -> m Int
599226sequence value xs = do
600− x <- Stream.parse (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
227+ x <- IP.parse (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
601228 return $ length x
602229
603230{-# INLINE sequence_ #-}
604−sequence_ :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
605−sequence_ value xs =
606− Stream.parse (foldr f (return ()) (replicate value (PR.takeBetween 0 1 Fold.drain))) xs
607−
608− where
231+sequence_ :: MonadCatch m => Int -> SerialT m Int -> m ()
232+sequence_ value =
233+ IP.parse (F.sequence_ $ replicate value (PR.satisfy (> 0)))
609234
610− {-# INLINE f #-}
611− f m k = m >>= (\_ -> k)
612−
613−-- choice using the "Alternative" instance with direct style parser type has
614−-- quadratic performance complexity.
615−--
616−{-# INLINE choiceAsum #-}
617−choiceAsum :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
618−choiceAsum value =
619− Stream.parse (F.asum (replicate value (PR.satisfy (< 0)))
620− AP.<|> PR.satisfy (> 0))
621−
622−{-
623235{-# INLINE choice #-}
624−choice :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
236+choice :: MonadCatch m => Int -> SerialT m Int -> m Int
625237choice value =
626− Stream.parse
627− (PR.choice (replicate value (PR.satisfy (< 0))) AP.<|> PR.satisfy (> 0))
628−-}
629−
630−-------------------------------------------------------------------------------
631−-- Parsing with unfolds
632−-------------------------------------------------------------------------------
633−
634−{-# INLINE parseManyUnfoldArrays #-}
635−parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
636−parseManyUnfoldArrays count arrays = do
637− let src = Producer.source (Just (Producer.OuterLoop arrays))
638− let parser = PR.fromFold (Fold.take count Fold.drain)
639− let readSrc =
640− Producer.producer
641− $ Producer.concat Producer.fromList Array.producer
642− let streamParser =
643− Producer.simplify (Producer.parseMany parser readSrc)
644− Stream.fold Fold.drain $ Stream.unfold streamParser src
238+ IP.parse (asum (replicate value (PR.satisfy (< 0)))
239+ AP.<|> PR.satisfy (> 0))
645240
646241-------------------------------------------------------------------------------
647242-- Stream transformation
648243-------------------------------------------------------------------------------
649244
650245{-# INLINE parseMany #-}
651−parseMany :: Monad m => Int -> Stream m Int -> m ()
652−parseMany n =
653− Stream.fold Fold.drain
654− . fmap getSum
655− . Stream.catRights . Stream.parseMany (PR.fromFold $ Fold.take n Fold.mconcat)
656− . fmap Sum
657−
658−{-# INLINE parseManyGroupBy #-}
659−parseManyGroupBy :: Monad m => (Int -> Int -> Bool) -> Stream m Int -> m ()
660−parseManyGroupBy cmp =
661− Stream.fold Fold.drain . Stream.parseMany (PR.groupBy cmp Fold.drain)
662−
663−{-# INLINE parseManyGroupsRolling #-}
664−parseManyGroupsRolling :: Monad m => Bool -> Stream m Int -> m ()
665−parseManyGroupsRolling b =
666− Stream.fold Fold.drain
667− . Stream.parseMany (PR.groupByRolling (\_ _ -> b) Fold.drain)
668−
669−{-# INLINE parseManyGroupsRollingEither #-}
670−parseManyGroupsRollingEither :: Monad m =>
671− (Int -> Int -> Bool) -> Int -> m ()
672−parseManyGroupsRollingEither cmp value = do
673− sourceUnfoldrM value 1
674− & Stream.parseMany (PR.groupByRollingEither cmp Fold.drain Fold.drain)
675− & Stream.fold Fold.drain
676−
677−{-# INLINE parseManyGroupsRollingEitherAlt #-}
678−parseManyGroupsRollingEitherAlt :: Monad m =>
679− (Int -> Int -> Bool) -> Int -> m ()
680−parseManyGroupsRollingEitherAlt cmp value = do
681− sourceUnfoldrM value 1
682− -- Make the input unsorted.
683− & fmap (\x -> if even x then x + 2 else x)
684− & Stream.parseMany (PR.groupByRollingEither cmp Fold.drain Fold.drain)
685− & Stream.fold Fold.drain
246+parseMany :: MonadCatch m => SerialT m Int -> m ()
247+parseMany =
248+ S.drain
249+ . S.map getSum
250+ . IP.parseMany (PR.fromFold $ FL.ltake 2 FL.mconcat)
251+ . S.map Sum
686252
687253{-# INLINE parseIterate #-}
688−parseIterate :: Monad m => Int -> Stream m Int -> m ()
689−parseIterate n =
690− Stream.fold Fold.drain
691− . fmap getSum
692− . Stream.catRights
693− . Stream.parseIterate
694− (PR.fromFold . Fold.take n . Fold.sconcat)
695− (Sum 0)
696− . fmap Sum
697−
698−{-# INLINE concatSequence #-}
699−concatSequence :: Monad m => Stream m Int -> m (Either ParseError ())
700−concatSequence =
701− Stream.parse $ PR.sequence (Stream.repeat PR.one) Fold.drain
254+parseIterate :: MonadCatch m => SerialT m Int -> m ()
255+parseIterate =
256+ S.drain
257+ . S.map getSum
258+ . IP.parseIterate (PR.fromFold . FL.ltake 2 . FL.sconcat) (Sum 0)
259+ . S.map Sum
702260
703261-------------------------------------------------------------------------------
704262-- Benchmarks
@@ -707,141 +265,51 @@ concatSequence =
707265moduleName :: String
708266moduleName = "Data.Parser"
709267
710−instance NFData ParseError where
711− {-# INLINE rnf #-}
712− rnf (ParseError x) = rnf x
713−
714268o_1_space_serial :: Int -> [Benchmark]
715269o_1_space_serial value =
716− [ benchIOSink value "takeBetween" $ takeBetween value
270+ [ benchIOSink value "takeEQ" $ takeEQ value
717271 , benchIOSink value "takeWhile" $ takeWhile value
718− , benchIOSink value "takeWhileP" $ takeWhileP value
719− , benchIOSink value "takeP" $ takeP value
720− , benchIOSink value "dropWhile" $ dropWhile value
721− , benchIOSink value "takeStartBy" $ takeStartBy value
722− , benchIOSink value "takeEndBy_" $ takeEndBy_ value
272+ , benchIOSink value "drainWhile" $ drainWhile value
723273 , benchIOSink value "groupBy" $ groupBy
724− , benchIOSink value "groupByRolling" $ groupByRolling
725274 , benchIOSink value "wordBy" $ wordBy value
726− , benchIOSink value "sepBy (words)" sepByWords
727− , benchIOSink value "sepByAll (words)" sepByAllWords
728− , benchIOSink value "sepBy1 (words)" sepByWords1
729− , benchIOSink value "deintercalate" $ deintercalate 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
275+ , benchIOSink value "splitAp" $ splitAp value
736276 , benchIOSink value "splitApBefore" $ splitApBefore value
737277 , benchIOSink value "splitApAfter" $ splitApAfter 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
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
278+ , benchIOSink value "splitWith" $ splitWith value
751279 , benchIOSink value "many" many
752280 , benchIOSink value "many (wordBy even)" $ manyWordByEven
753281 , benchIOSink value "some" some
754282 , 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
773− {-
774283 , benchIOSink value "tee" $ teeAllAny value
775284 , benchIOSink value "teeFst" $ teeFstAllAny value
776285 , benchIOSink value "shortest" $ shortestAllAny value
777286 , benchIOSink value "longest" $ longestAllAny value
778− -}
779− , benchIOSink value "streamEqBy" (streamEqBy value)
780− ]
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−
794−o_1_space_filesystem :: BenchEnv -> [Benchmark]
795−o_1_space_filesystem env =
796− [ mkBench ("S.parseMany (Fold.take " ++ show (bigSize env) ++ " Fold.sum)") env
797− $ \inh _ -> noinline parseManyChunksOfSum (bigSize env) inh
798− , mkBench "S.parseMany (Fold.take 1 Fold.sum)" env
799− $ \inh _ -> inline parseManyChunksOfSum 1 inh
800− ]
801−
802−o_1_space_serial_unfold :: Int -> [Array.Array Int] -> [Benchmark]
803−o_1_space_serial_unfold bound arrays =
804− [ bench "parseMany/Unfold/1000 arrays/take all"
805− $ nfIO $ parseManyUnfoldArrays bound arrays
806− , bench "parseMany/Unfold/1000 arrays/take 1"
807− $ nfIO $ parseManyUnfoldArrays 1 arrays
287+ , benchIOSink value "parseMany" parseMany
288+ , benchIOSink value "parseIterate" parseIterate
808289 ]
809290
810291o_n_heap_serial :: Int -> [Benchmark]
811292o_n_heap_serial value =
812293 [
813− benchIOSink value "takeEQ" $ takeEQ value
814− , benchIOSink value "takeGE" $ takeGE value
815−
816294 -- lookahead benchmark holds the entire input till end
817− , benchIOSink value "lookAhead" $ lookAhead value
295+ benchIOSink value "lookAhead" $ lookAhead value
818296
819− -- o-n-heap because of backtracking
820− , benchIOSrc sourceEscapedFrames value "takeFramedByEsc_"
821− $ takeFramedByEsc_ value
297+ -- accumulates the results in a list
298+ , benchIOSink value "sequence" $ sequence value
299+ , benchIOSink value "sequenceA" $ sequenceA value
822300
301+ -- XXX why should this take O(n) heap, it discards the results?
302+ , benchIOSink value "sequence_" $ sequence_ value
303+ , benchIOSink value "sequenceA_" $ sequenceA_ value
823304 -- non-linear time complexity (parserD)
824305 , benchIOSink value "split_" $ split_ value
825− -- XXX Takes lot of space when run on a long stream, why?
826− , benchIOSink value "monad16" $ monad16 value
306+ -- XXX why O(n) heap?
307+ , benchIOSink value "choice" $ choice value
827308
828309 -- These show non-linear time complexity.
829310 -- They accumulate the results in a list.
830− , benchIOSink value "sepBy1" sepBy1
831311 , benchIOSink value "manyAlt" manyAlt
832312 , 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)
845313 ]
846314
847315-------------------------------------------------------------------------------
@@ -850,38 +318,12 @@ o_n_space_serial value =
850318
851319main :: IO ()
852320main = do
853−#ifndef FUSION_CHECK
854− env <- mkHandleBenchEnv
855− runWithCLIOptsEnv defaultStreamSize alloc (allBenchmarks env)
321+ (value, cfg, benches) <- parseCLIOpts defaultStreamSize
322+ value `seq` runMode (mode cfg) cfg benches (allBenchmarks value)
856323
857324 where
858325
859− alloc value = Stream.fold Fold.toList $ Stream.chunksOf 100 $ sourceUnfoldrM value 0
860−
861− allBenchmarks env arrays value =
326+ allBenchmarks value =
862327 [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
863− , bgroup
864− (o_1_space_prefix moduleName ++ "/filesystem")
865− (o_1_space_filesystem env)
866− , bgroup (o_1_space_prefix moduleName)
867− (o_1_space_serial_unfold value arrays)
868328 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
869− , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
870329 ]
871−#else
872− -- Enable FUSION_CHECK macro at the beginning of the file
873− -- Enable one benchmark below, and run the benchmark
874− -- Check the .dump-simpl output
875− let value = 100000
876− -- let input = sourceUnfoldrM value 1
877− -- manyTill value input
878− -- deintercalate value input
879− -- deintercalate1 value input
880− -- deintercalateAll value input
881− -- sepByWords input
882− -- sepByAllWords input
883− -- sepBy1 input
884− -- sepByWords1 input
885− takeFramedByEsc_ value (sourceEscapedFrames value 1)
886− return ()
887−#endif
benchmark/Streamly/Benchmark/Data/Parser/ParserD.hsnew file+260
@@ -0,0 +1,260 @@
1+-- |
2+-- Module : Streamly.Benchmark.Data.ParserD
3+-- Copyright : (c) 2020 Composewell Technologies
4+--
5+-- License : BSD-3-Clause
6+-- Maintainer : streamly@composewell.com
7+
8+{-# LANGUAGE FlexibleContexts #-}
9+{-# OPTIONS_GHC -fspec-constr-recursive=4 #-}
10+
11+module Main
12+ (
13+ main
14+ ) where
15+
16+import Control.DeepSeq (NFData(..))
17+import Control.Monad.Catch (MonadCatch, MonadThrow)
18+import Data.Foldable (asum)
19+import Data.Functor (($>))
20+import System.Random (randomRIO)
21+import Prelude hiding (any, all, take, sequence, sequenceA, takeWhile)
22+
23+import qualified Data.Traversable as TR
24+import qualified Data.Foldable as F
25+import qualified Control.Applicative as AP
26+import qualified Streamly.Prelude as S
27+import qualified Streamly.Internal.Data.Fold as FL
28+import qualified Streamly.Internal.Data.Parser.ParserD as PR
29+import qualified Streamly.Internal.Data.Stream.IsStream as IP
30+
31+import Gauge
32+import Streamly.Prelude (SerialT, MonadAsync, IsStream)
33+import Streamly.Benchmark.Common
34+
35+-------------------------------------------------------------------------------
36+-- Utilities
37+-------------------------------------------------------------------------------
38+
39+-- XXX these can be moved to the common module
40+
41+{-# INLINE sourceUnfoldrM #-}
42+sourceUnfoldrM :: (IsStream t, MonadAsync m) => Int -> Int -> t m Int
43+sourceUnfoldrM value n = S.unfoldrM step n
44+ where
45+ step cnt =
46+ if cnt > n + value
47+ then return Nothing
48+ else return (Just (cnt, cnt + 1))
49+
50+-- | Takes a fold method, and uses it with a default source.
51+{-# INLINE benchIOSink #-}
52+benchIOSink
53+ :: (IsStream t, NFData b)
54+ => Int -> String -> (t IO Int -> IO b) -> Benchmark
55+benchIOSink value name f =
56+ bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
57+
58+-------------------------------------------------------------------------------
59+-- Parsers
60+-------------------------------------------------------------------------------
61+
62+{-# INLINE drainWhile #-}
63+drainWhile :: MonadThrow m => (a -> Bool) -> PR.Parser m a ()
64+drainWhile p = PR.takeWhile p FL.drain
65+
66+{-# INLINE takeWhile #-}
67+takeWhile :: MonadThrow m => Int -> SerialT m Int -> m ()
68+takeWhile value = IP.parseD (drainWhile (<= value))
69+
70+{-# INLINE groupBy #-}
71+groupBy :: MonadThrow m => SerialT m Int -> m ()
72+groupBy = IP.parseD (PR.groupBy (<=) FL.drain)
73+
74+{-# INLINE wordBy #-}
75+wordBy :: MonadThrow m => Int -> SerialT m Int -> m ()
76+wordBy value = IP.parseD (PR.wordBy (>= value) FL.drain)
77+
78+{-# INLINE manyWordByEven #-}
79+manyWordByEven :: MonadCatch m => SerialT m Int -> m ()
80+manyWordByEven =
81+ IP.parseD (PR.many FL.drain (PR.wordBy (Prelude.even) FL.drain))
82+
83+{-# INLINE many #-}
84+many :: MonadCatch m => SerialT m Int -> m Int
85+many = IP.parseD (PR.many FL.length (PR.satisfy (> 0)))
86+
87+{-# INLINE manyAlt #-}
88+manyAlt :: MonadCatch m => SerialT m Int -> m Int
89+manyAlt xs = do
90+ x <- IP.parseD (AP.many (PR.satisfy (> 0))) xs
91+ return $ Prelude.length x
92+
93+{-# INLINE some #-}
94+some :: MonadCatch m => SerialT m Int -> m Int
95+some = IP.parseD (PR.some FL.length (PR.satisfy (> 0)))
96+
97+{-# INLINE someAlt #-}
98+someAlt :: MonadCatch m => SerialT m Int -> m Int
99+someAlt xs = do
100+ x <- IP.parseD (AP.some (PR.satisfy (> 0))) xs
101+ return $ Prelude.length x
102+
103+{-# INLINE manyTill #-}
104+manyTill :: MonadCatch m => Int -> SerialT m Int -> m Int
105+manyTill value =
106+ let p = PR.satisfy (> 0)
107+ pcond = PR.satisfy (== value)
108+ in IP.parseD (PR.manyTill FL.length p pcond)
109+
110+{-# INLINE splitAllAny #-}
111+splitAllAny :: MonadThrow m
112+ => Int -> SerialT m Int -> m ((), ())
113+splitAllAny value =
114+ IP.parseD
115+ ((,)
116+ <$> drainWhile (<= (value `div` 2))
117+ <*> drainWhile (<= value)
118+ )
119+
120+{-# INLINE teeAllAny #-}
121+teeAllAny :: MonadThrow m
122+ => Int -> SerialT m Int -> m ((), ())
123+teeAllAny value =
124+ IP.parseD
125+ (PR.teeWith (,)
126+ (drainWhile (<= value))
127+ (drainWhile (<= value))
128+ )
129+
130+{-# INLINE teeFstAllAny #-}
131+teeFstAllAny :: MonadThrow m
132+ => Int -> SerialT m Int -> m ((), ())
133+teeFstAllAny value =
134+ IP.parseD
135+ (PR.teeWithFst (,)
136+ (drainWhile (<= value))
137+ (drainWhile (<= value))
138+ )
139+
140+{-# INLINE shortestAllAny #-}
141+shortestAllAny :: MonadThrow m
142+ => Int -> SerialT m Int -> m ()
143+shortestAllAny value =
144+ IP.parseD
145+ (PR.shortest
146+ (drainWhile (<= value))
147+ (drainWhile (<= value))
148+ )
149+
150+{-# INLINE longestAllAny #-}
151+longestAllAny :: MonadCatch m
152+ => Int -> SerialT m Int -> m ()
153+longestAllAny value =
154+ IP.parseD
155+ (PR.longest
156+ (drainWhile (<= value))
157+ (drainWhile (<= value))
158+ )
159+
160+-------------------------------------------------------------------------------
161+-- Parsers in which -fspec-constr-recursive=16 is problematic
162+-------------------------------------------------------------------------------
163+
164+-- XXX -fspec-constr-recursive=16 makes GHC go beserk when compiling these.
165+-- We need to fix GHC so that we can have better control over that option or do
166+-- not have to rely on it.
167+--
168+{-# INLINE lookAhead #-}
169+lookAhead :: MonadThrow m => Int -> SerialT m Int -> m ()
170+lookAhead value =
171+ IP.parseD (PR.lookAhead (PR.takeWhile (<= value) FL.drain) $> ())
172+
173+{-# INLINE sequenceA_ #-}
174+sequenceA_ :: MonadThrow m => Int -> SerialT m Int -> m ()
175+sequenceA_ value =
176+ IP.parseD (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
177+
178+-- quadratic complexity
179+{-# INLINE sequenceA #-}
180+sequenceA :: MonadThrow m => Int -> SerialT m Int -> m Int
181+sequenceA value xs = do
182+ x <- IP.parseD (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
183+ return $ length x
184+
185+-- quadratic complexity
186+{-# INLINE sequence #-}
187+sequence :: MonadThrow m => Int -> SerialT m Int -> m Int
188+sequence value xs = do
189+ x <- IP.parseD (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
190+ return $ length x
191+
192+-- choice using the "Alternative" instance with direct style parser type has
193+-- quadratic performance complexity.
194+--
195+{-# INLINE choice #-}
196+choice :: MonadCatch m => Int -> SerialT m Int -> m Int
197+choice value =
198+ IP.parseD (asum (replicate value (PR.satisfy (< 0)))
199+ AP.<|> PR.satisfy (> 0))
200+
201+-------------------------------------------------------------------------------
202+-- Benchmarks
203+-------------------------------------------------------------------------------
204+
205+moduleName :: String
206+moduleName = "Data.Parser.ParserD"
207+
208+o_1_space_serial :: Int -> [Benchmark]
209+o_1_space_serial value =
210+ [ benchIOSink value "takeWhile" $ takeWhile value
211+ , benchIOSink value "groupBy" $ groupBy
212+ , benchIOSink value "wordBy" $ wordBy value
213+ , benchIOSink value "split (all,any)" $ splitAllAny value
214+ , benchIOSink value "many" many
215+ , benchIOSink value "many (wordBy even)" $ manyWordByEven
216+ , benchIOSink value "some" some
217+ , benchIOSink value "manyTill" $ manyTill value
218+ , benchIOSink value "tee (all,any)" $ teeAllAny value
219+ , benchIOSink value "teeFst (all,any)" $ teeFstAllAny value
220+ , benchIOSink value "shortest (all,any)" $ shortestAllAny value
221+ , benchIOSink value "longest (all,any)" $ longestAllAny value
222+ ]
223+
224+o_n_heap_serial :: Int -> [Benchmark]
225+o_n_heap_serial value =
226+ [
227+ -- lookahead benchmark holds the entire input till end
228+ benchIOSink value "lookAhead" $ lookAhead value
229+
230+ -- These show non-linear time complexity
231+ -- They accumulate the results in a list.
232+ , benchIOSink value "manyAlt" manyAlt
233+ , benchIOSink value "someAlt" someAlt
234+ ]
235+
236+-- accumulate results in a list in IO
237+o_n_space_serial :: Int -> [Benchmark]
238+o_n_space_serial value =
239+ [ benchIOSink value "sequenceA/100" $ sequenceA (value `div` 100)
240+ , benchIOSink value "sequenceA_/100" $ sequenceA_ (value `div` 100)
241+ , benchIOSink value "sequence/100" $ sequence (value `div` 100)
242+ , benchIOSink value "choice/100" $ choice (value `div` 100)
243+ ]
244+
245+-------------------------------------------------------------------------------
246+-- Driver
247+-------------------------------------------------------------------------------
248+
249+main :: IO ()
250+main = do
251+ (value, cfg, benches) <- parseCLIOpts defaultStreamSize
252+ value `seq` runMode (mode cfg) cfg benches (allBenchmarks value)
253+
254+ where
255+
256+ allBenchmarks value =
257+ [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
258+ , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
259+ , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
260+ ]
benchmark/Streamly/Benchmark/Data/Parser/ParserK.hsnew file+165
@@ -0,0 +1,165 @@
1+-- |
2+-- Module : Streamly.Benchmark.Data.ParserK
3+-- Copyright : (c) 2020 Composewell Technologies
4+--
5+-- License : BSD-3-Clause
6+-- Maintainer : streamly@composewell.com
7+
8+{-# LANGUAGE CPP #-}
9+{-# LANGUAGE FlexibleContexts #-}
10+
11+module Main
12+ (
13+ main
14+ ) where
15+
16+import Control.DeepSeq (NFData(..))
17+import Control.Monad.Catch (MonadCatch)
18+import Data.Foldable (asum)
19+import System.Random (randomRIO)
20+import Prelude hiding (any, all, take, sequence, sequenceA, takeWhile)
21+
22+import qualified Control.Applicative as AP
23+import qualified Data.Foldable as F
24+import qualified Data.Traversable as TR
25+import qualified Streamly.Prelude as S
26+import qualified Streamly.Internal.Data.Fold as FL
27+import qualified Streamly.Internal.Data.Parser.ParserK.Types as PR
28+import qualified Streamly.Internal.Data.Parser.ParserD as PRD
29+import qualified Streamly.Internal.Data.Stream.IsStream as IP
30+
31+import Gauge
32+import Streamly.Prelude (SerialT, MonadAsync, IsStream)
33+import Streamly.Benchmark.Common
34+
35+-------------------------------------------------------------------------------
36+-- Utilities
37+-------------------------------------------------------------------------------
38+
39+-- XXX these can be moved to the common module
40+
41+{-# INLINE sourceUnfoldrM #-}
42+sourceUnfoldrM :: (IsStream t, MonadAsync m) => Int -> Int -> t m Int
43+sourceUnfoldrM value n = S.unfoldrM step n
44+ where
45+ step cnt =
46+ if cnt > n + value
47+ then return Nothing
48+ else return (Just (cnt, cnt + 1))
49+
50+-- | Takes a fold method, and uses it with a default source.
51+{-# INLINE benchIOSink #-}
52+benchIOSink
53+ :: (IsStream t, NFData b)
54+ => Int -> String -> (t IO Int -> IO b) -> Benchmark
55+benchIOSink value name f =
56+ bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
57+
58+-------------------------------------------------------------------------------
59+-- Parsers
60+-------------------------------------------------------------------------------
61+
62+#ifdef FROM_PARSERK
63+#define PARSE_OP (IP.parseD . PR.fromParserK)
64+#else
65+#define PARSE_OP IP.parseK
66+#endif
67+
68+{-# INLINE satisfy #-}
69+satisfy :: MonadCatch m => (a -> Bool) -> PR.Parser m a a
70+satisfy = PR.toParserK . PRD.satisfy
71+
72+{-# INLINE takeWhile #-}
73+takeWhile :: MonadCatch m => (a -> Bool) -> PR.Parser m a ()
74+takeWhile p = PR.toParserK $ PRD.takeWhile p FL.drain
75+
76+{-# INLINE takeWhileK #-}
77+takeWhileK :: MonadCatch m => Int -> SerialT m Int -> m ()
78+takeWhileK value = PARSE_OP (takeWhile (<= value))
79+
80+{-# INLINE splitApp #-}
81+splitApp :: MonadCatch m
82+ => Int -> SerialT m Int -> m ((), ())
83+splitApp value =
84+ PARSE_OP ((,) <$> takeWhile (<= (value `div` 2)) <*> takeWhile (<= value))
85+
86+{-# INLINE sequenceA #-}
87+sequenceA :: MonadCatch m => Int -> SerialT m Int -> m Int
88+sequenceA value xs = do
89+ let parser = satisfy (> 0)
90+ list = Prelude.replicate value parser
91+ x <- PARSE_OP (TR.sequenceA list) xs
92+ return $ Prelude.length x
93+
94+{-# INLINE sequenceA_ #-}
95+sequenceA_ :: MonadCatch m => Int -> SerialT m Int -> m ()
96+sequenceA_ value xs = do
97+ let parser = satisfy (> 0)
98+ list = Prelude.replicate value parser
99+ PARSE_OP (F.sequenceA_ list) xs
100+
101+{-# INLINE sequence #-}
102+sequence :: MonadCatch m => Int -> SerialT m Int -> m Int
103+sequence value xs = do
104+ let parser = satisfy (> 0)
105+ list = Prelude.replicate value parser
106+ x <- PARSE_OP (TR.sequence list) xs
107+ return $ Prelude.length x
108+
109+{-# INLINE manyAlt #-}
110+manyAlt :: MonadCatch m => SerialT m Int -> m Int
111+manyAlt xs = do
112+ x <- PARSE_OP (AP.many (satisfy (> 0))) xs
113+ return $ Prelude.length x
114+
115+{-# INLINE someAlt #-}
116+someAlt :: MonadCatch m => SerialT m Int -> m Int
117+someAlt xs = do
118+ x <- PARSE_OP (AP.some (satisfy (> 0))) xs
119+ return $ Prelude.length x
120+
121+{-# INLINE choice #-}
122+choice :: MonadCatch m => Int -> SerialT m Int -> m Int
123+choice value =
124+ PARSE_OP (asum (replicate value (satisfy (< 0)))
125+ AP.<|> satisfy (> 0))
126+
127+-------------------------------------------------------------------------------
128+-- Benchmarks
129+-------------------------------------------------------------------------------
130+
131+moduleName :: String
132+moduleName = "Data.Parser.ParserK"
133+
134+o_1_space_serial :: Int -> [Benchmark]
135+o_1_space_serial value =
136+ [ benchIOSink value "takeWhile" $ takeWhileK value
137+ , benchIOSink value "splitApp" $ splitApp value
138+ ]
139+
140+-- O(n) heap beacuse of accumulation of the list in strict IO monad?
141+o_n_heap_serial :: Int -> [Benchmark]
142+o_n_heap_serial value =
143+ [ benchIOSink value "sequenceA" $ sequenceA value
144+ , benchIOSink value "sequenceA_" $ sequenceA_ value
145+ , benchIOSink value "sequence" $ sequence value
146+ , benchIOSink value "manyAlt" manyAlt
147+ , benchIOSink value "someAlt" someAlt
148+ , benchIOSink value "choice" $ choice value
149+ ]
150+
151+-------------------------------------------------------------------------------
152+-- Driver
153+-------------------------------------------------------------------------------
154+
155+main :: IO ()
156+main = do
157+ (value, cfg, benches) <- parseCLIOpts defaultStreamSize
158+ value `seq` runMode (mode cfg) cfg benches (allBenchmarks value)
159+
160+ where
161+
162+ allBenchmarks value =
163+ [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
164+ , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
165+ ]
benchmark/Streamly/Benchmark/Data/ParserK.hsdeleted−437
@@ -1,437 +0,0 @@
1−-- |
2−-- Module : Streamly.Benchmark.Data.ParserK
3−-- Copyright : (c) 2020 Composewell Technologies
4−--
5−-- License : BSD-3-Clause
6−-- Maintainer : streamly@composewell.com
7−
8−-- BENCH_CHUNKED -> adaptC
9−-- BENCH_CHUNKED_GENERIC -> adaptCG
10−-- BENCH_SINGULAR -> adapt
11−
12−{-# LANGUAGE CPP #-}
13−{-# LANGUAGE FlexibleContexts #-}
14−{-# OPTIONS_GHC -Wno-orphans #-}
15−
16−module Main
17− (
18− main
19− ) where
20−
21−import Control.Applicative ((<|>))
22−import Control.DeepSeq (NFData(..))
23−import Control.Monad.IO.Class (MonadIO)
24−import Data.Foldable (asum)
25−#ifdef BENCH_CHUNKED
26−import Streamly.Data.Array (Array, Unbox)
27−#endif
28−#ifdef BENCH_CHUNKED_GENERIC
29−import Streamly.Data.Array.Generic (Array)
30−import qualified Streamly.Internal.Data.Array.Generic as GenArr (chunksOf)
31−#endif
32−import Streamly.Internal.Data.Fold (Fold(..))
33−import Streamly.Data.StreamK (StreamK)
34−import Streamly.Internal.Data.Parser
35− (ParseError(..), Parser(..), Initial(..), Step(..))
36−import Streamly.Internal.Data.Stream (Stream)
37−import System.Random (randomRIO)
38−import Prelude hiding
39− (any, all, take, sequence, sequence_, sequenceA, takeWhile)
40−
41−import qualified Control.Applicative as AP
42−import qualified Data.Foldable as F
43−import qualified Data.Traversable as TR
44−import qualified Streamly.Data.Stream as Stream
45−import qualified Streamly.Data.Fold as FL
46−import qualified Streamly.Internal.Data.Fold as Fold
47−import qualified Streamly.Data.Parser as PRD
48−import qualified Streamly.Internal.Data.ParserK as PR
49−import qualified Streamly.Internal.Data.StreamK as StreamK
50−
51−import Test.Tasty.Bench
52−import Streamly.Benchmark.Common
53−
54−-------------------------------------------------------------------------------
55−-- CPP Helpers
56−-------------------------------------------------------------------------------
57−
58−#ifdef BENCH_CHUNKED
59−
60−#define PARSE_OP StreamK.parseChunks
61−#define FROM_PARSER adaptC
62−#define INPUT (Array a)
63−#define PARSE_ELEM (Array Int)
64−#define CONSTRAINT_IO (MonadIO m, Unbox a)
65−#define CONSTRAINT (Monad m, Unbox a)
66−#define MODULE_NAME "Data.ParserK.Chunked"
67−
68−#endif
69−
70−#ifdef BENCH_CHUNKED_GENERIC
71−
72−#define PARSE_OP StreamK.parseChunksGeneric
73−#define FROM_PARSER adaptCG
74−#define INPUT (Array a)
75−#define PARSE_ELEM (Array Int)
76−#define CONSTRAINT_IO (MonadIO m)
77−#define CONSTRAINT (Monad m)
78−#define MODULE_NAME "Data.ParserK.Chunked.Generic"
79−
80−#endif
81−
82−#ifdef BENCH_SINGULAR
83−
84−#define PARSE_OP StreamK.parse
85−#define FROM_PARSER adapt
86−#define INPUT a
87−#define PARSE_ELEM Int
88−#define CONSTRAINT_IO (MonadIO m)
89−#define CONSTRAINT (Monad m)
90−#define MODULE_NAME "Data.ParserK"
91−
92−#endif
93−
94−-------------------------------------------------------------------------------
95−-- Utilities
96−-------------------------------------------------------------------------------
97−
98−-- XXX these can be moved to the common module
99−
100−{-# INLINE sourceUnfoldrM #-}
101−sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
102−sourceUnfoldrM value n = Stream.unfoldrM step n
103− where
104− step cnt =
105− if cnt > n + value
106− then return Nothing
107− else return (Just (cnt, cnt + 1))
108−
109−-- | Takes a fold method, and uses it with a default source.
110−{-# INLINE benchIOSink #-}
111−benchIOSink
112− :: NFData b
113− => Int -> String -> (StreamK IO PARSE_ELEM -> IO b) -> Benchmark
114−benchIOSink value name f =
115− bench name $ nfIO $ randomRIO (1,1)
116− >>= f
117− . StreamK.fromStream
118−#ifdef BENCH_CHUNKED
119− . Stream.chunksOf 4000
120−#endif
121−#ifdef BENCH_CHUNKED_GENERIC
122− . GenArr.chunksOf 4000
123−#endif
124− . sourceUnfoldrM value
125−
126−-------------------------------------------------------------------------------
127−-- Parsers
128−-------------------------------------------------------------------------------
129−
130−{-# INLINE one #-}
131−one :: MonadIO m =>
132− Int -> StreamK m PARSE_ELEM -> m (Either ParseError (Maybe Int))
133−one value = PARSE_OP p
134−
135− where
136−
137− p = do
138− m <- PR.FROM_PARSER (PRD.fromFold FL.one)
139− case m of
140− Just i -> if i >= value then pure m else p
141− Nothing -> pure Nothing
142−
143−{-# INLINE satisfy #-}
144−satisfy :: CONSTRAINT_IO => (a -> Bool) -> PR.ParserK INPUT m a
145−satisfy = PR.FROM_PARSER . PRD.satisfy
146−
147−{-# INLINE takeWhile #-}
148−takeWhile :: CONSTRAINT_IO => (a -> Bool) -> PR.ParserK INPUT m ()
149−takeWhile p = PR.FROM_PARSER $ PRD.takeWhile p FL.drain
150−
151−{-# INLINE takeWhileK #-}
152−takeWhileK :: MonadIO m =>
153− Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
154−takeWhileK value = PARSE_OP (takeWhile (<= value))
155−
156−{-# INLINE splitAp2 #-}
157−splitAp2 :: MonadIO m
158− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ((), ()))
159−splitAp2 value =
160− PARSE_OP
161− ((,)
162− <$> takeWhile (<= (value `div` 2))
163− <*> takeWhile (<= value)
164− )
165−
166−{-# INLINE splitAp8 #-}
167−splitAp8 :: MonadIO m
168− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
169−splitAp8 value =
170− PARSE_OP
171− ( (\() () () () () () () () -> ())
172− <$> takeWhile (<= ( value `div` 8))
173− <*> takeWhile (<= ((value * 2) `div` 8))
174− <*> takeWhile (<= ((value * 3) `div` 8))
175− <*> takeWhile (<= ((value * 4) `div` 8))
176− <*> takeWhile (<= ((value * 5) `div` 8))
177− <*> takeWhile (<= ((value * 6) `div` 8))
178− <*> takeWhile (<= ((value * 7) `div` 8))
179− <*> takeWhile (<= value)
180− )
181−
182−{-# INLINE sequenceA #-}
183−sequenceA :: MonadIO m => Int -> StreamK m PARSE_ELEM -> m Int
184−sequenceA value xs = do
185− let parser = satisfy (> 0)
186− list = Prelude.replicate value parser
187− x <- PARSE_OP (TR.sequenceA list) xs
188− return $ Prelude.length x
189−
190−{-# INLINE sequenceA_ #-}
191−sequenceA_ :: MonadIO m =>
192− Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
193−sequenceA_ value xs = do
194− let parser = satisfy (> 0)
195− list = Prelude.replicate value parser
196− PARSE_OP (F.sequenceA_ list) xs
197−
198−{-# INLINE sequence #-}
199−sequence :: MonadIO m => Int -> StreamK m PARSE_ELEM -> m Int
200−sequence value xs = do
201− let parser = satisfy (> 0)
202− list = Prelude.replicate value parser
203− x <- PARSE_OP (TR.sequence list) xs
204− return $ Prelude.length x
205−
206−{-# INLINE sequence_ #-}
207−sequence_ :: MonadIO m =>
208− Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
209−sequence_ value =
210− let parser = satisfy (> 0)
211− list = Prelude.replicate value parser
212− in PARSE_OP (F.sequence_ list)
213−
214−{-# INLINE takeWhileFailD #-}
215−takeWhileFailD :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
216−takeWhileFailD predicate (Fold fstep finitial _ ffinal) =
217− Parser step initial extract
218−
219− where
220−
221− initial = do
222− res <- finitial
223− return $ case res of
224− Fold.Partial s -> IPartial s
225− Fold.Done b -> IDone b
226−
227− step s a =
228− if predicate a
229− then do
230− fres <- fstep s a
231− return
232− $ case fres of
233− Fold.Partial s1 -> Partial 0 s1
234− Fold.Done b -> Done 0 b
235− else return $ Error "fail"
236−
237− extract s = fmap (Done 0) (ffinal s)
238−
239−{-# INLINE takeWhileFail #-}
240−takeWhileFail :: CONSTRAINT =>
241− (a -> Bool) -> Fold m a b -> PR.ParserK INPUT m b
242−takeWhileFail p f = PR.FROM_PARSER (takeWhileFailD p f)
243−
244−{-# INLINE alt2 #-}
245−alt2 :: MonadIO m
246− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
247−alt2 value =
248− PARSE_OP
249− ( takeWhileFail (<= (value `div` 2)) Fold.drain
250− <|> takeWhile (<= value)
251− )
252−
253−{-# INLINE alt8 #-}
254−alt8 :: MonadIO m
255− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
256−alt8 value =
257− PARSE_OP
258− ( takeWhileFail (<= ( value `div` 8)) Fold.drain
259− <|> takeWhileFail (<= ((value * 2) `div` 8)) Fold.drain
260− <|> takeWhileFail (<= ((value * 3) `div` 8)) Fold.drain
261− <|> takeWhileFail (<= ((value * 4) `div` 8)) Fold.drain
262− <|> takeWhileFail (<= ((value * 5) `div` 8)) Fold.drain
263− <|> takeWhileFail (<= ((value * 6) `div` 8)) Fold.drain
264− <|> takeWhileFail (<= ((value * 7) `div` 8)) Fold.drain
265− <|> takeWhile (<= value)
266− )
267−
268−{-# INLINE alt16 #-}
269−alt16 :: MonadIO m
270− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
271−alt16 value =
272− PARSE_OP
273− ( takeWhileFail (<= ( value `div` 16)) Fold.drain
274− <|> takeWhileFail (<= ((value * 2) `div` 16)) Fold.drain
275− <|> takeWhileFail (<= ((value * 3) `div` 16)) Fold.drain
276− <|> takeWhileFail (<= ((value * 4) `div` 16)) Fold.drain
277− <|> takeWhileFail (<= ((value * 5) `div` 16)) Fold.drain
278− <|> takeWhileFail (<= ((value * 6) `div` 16)) Fold.drain
279− <|> takeWhileFail (<= ((value * 7) `div` 16)) Fold.drain
280− <|> takeWhileFail (<= ((value * 8) `div` 16)) Fold.drain
281− <|> takeWhileFail (<= ((value * 9) `div` 16)) Fold.drain
282− <|> takeWhileFail (<= ((value * 10) `div` 16)) Fold.drain
283− <|> takeWhileFail (<= ((value * 11) `div` 16)) Fold.drain
284− <|> takeWhileFail (<= ((value * 12) `div` 16)) Fold.drain
285− <|> takeWhileFail (<= ((value * 13) `div` 16)) Fold.drain
286− <|> takeWhileFail (<= ((value * 14) `div` 16)) Fold.drain
287− <|> takeWhileFail (<= ((value * 15) `div` 16)) Fold.drain
288− <|> takeWhile (<= value)
289− )
290−
291−{-# INLINE manyAlt #-}
292−manyAlt :: MonadIO m => StreamK m PARSE_ELEM -> m Int
293−manyAlt xs = do
294− x <- PARSE_OP (AP.many (satisfy (> 0))) xs
295− return $ Prelude.length x
296−
297−{-# INLINE someAlt #-}
298−someAlt :: MonadIO m => StreamK m PARSE_ELEM -> m Int
299−someAlt xs = do
300− x <- PARSE_OP (AP.some (satisfy (> 0))) xs
301− return $ Prelude.length x
302−
303−{-# INLINE choice #-}
304−choice :: MonadIO m =>
305− Int -> StreamK m PARSE_ELEM -> m (Either ParseError Int)
306−choice value =
307− PARSE_OP (asum (replicate value (satisfy (< 0)))
308− AP.<|> satisfy (> 0))
309−
310−{-# INLINE monad2 #-}
311−monad2 :: MonadIO m
312− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
313−monad2 value =
314− PARSE_OP $ do
315− takeWhile (<= (value `div` 2))
316− takeWhile (<= value)
317−
318−{-# INLINE monad4 #-}
319−monad4 :: MonadIO m
320− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
321−monad4 value =
322− PARSE_OP $ do
323− takeWhile (<= ( value `div` 4))
324− takeWhile (<= ((value * 2) `div` 4))
325− takeWhile (<= ((value * 3) `div` 4))
326− takeWhile (<= value)
327−
328−{-# INLINE monad8 #-}
329−monad8 :: MonadIO m
330− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
331−monad8 value =
332− PARSE_OP $ do
333− takeWhile (<= ( value `div` 8))
334− takeWhile (<= ((value * 2) `div` 8))
335− takeWhile (<= ((value * 3) `div` 8))
336− takeWhile (<= ((value * 4) `div` 8))
337− takeWhile (<= ((value * 5) `div` 8))
338− takeWhile (<= ((value * 6) `div` 8))
339− takeWhile (<= ((value * 7) `div` 8))
340− takeWhile (<= value)
341−
342−{-# INLINE monad16 #-}
343−monad16 :: MonadIO m
344− => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
345−monad16 value =
346− PARSE_OP $ do
347− takeWhile (<= ( value `div` 16))
348− takeWhile (<= ((value * 2) `div` 16))
349− takeWhile (<= ((value * 3) `div` 16))
350− takeWhile (<= ((value * 4) `div` 16))
351− takeWhile (<= ((value * 5) `div` 16))
352− takeWhile (<= ((value * 6) `div` 16))
353− takeWhile (<= ((value * 7) `div` 16))
354− takeWhile (<= ((value * 8) `div` 16))
355− takeWhile (<= ((value * 9) `div` 16))
356− takeWhile (<= ((value * 10) `div` 16))
357− takeWhile (<= ((value * 11) `div` 16))
358− takeWhile (<= ((value * 12) `div` 16))
359− takeWhile (<= ((value * 13) `div` 16))
360− takeWhile (<= ((value * 14) `div` 16))
361− takeWhile (<= ((value * 15) `div` 16))
362− takeWhile (<= value)
363−
364−-------------------------------------------------------------------------------
365−-- Benchmarks
366−-------------------------------------------------------------------------------
367−
368−moduleName :: String
369−moduleName = MODULE_NAME
370−
371−instance NFData ParseError where
372− {-# INLINE rnf #-}
373− rnf (ParseError x) = rnf x
374−
375−o_1_space_serial :: Int -> [Benchmark]
376−o_1_space_serial value =
377− [ benchIOSink value "drain" (Stream.fold Fold.drain . StreamK.toStream)
378− , benchIOSink value "takeWhile" $ takeWhileK value
379− , benchIOSink value "splitAp2" $ splitAp2 value
380− , benchIOSink value "splitAp8" $ splitAp8 value
381− , benchIOSink value "alt2" $ alt2 value
382− , benchIOSink value "alt8" $ alt8 value
383− , benchIOSink value "alt16" $ alt16 value
384− , benchIOSink value "monad2" $ monad2 value
385− , benchIOSink value "monad4" $ monad4 value
386− , benchIOSink value "monad8" $ monad8 value
387− , benchIOSink value "monad16" $ monad16 value
388− ]
389−
390−{-# INLINE sepBy1 #-}
391−sepBy1 :: MonadIO m => StreamK m PARSE_ELEM -> m Int
392−sepBy1 xs = do
393− x <- PARSE_OP (parser (satisfy odd) (satisfy even)) xs
394− return $ Prelude.length x
395−
396− where
397−
398− parser p sep = do
399− x <- p
400− fmap (x :) $ AP.many (sep >> p)
401−
402−-- O(n) heap beacuse of accumulation of the list in strict IO monad?
403−o_n_heap_serial :: Int -> [Benchmark]
404−o_n_heap_serial value =
405− [
406− -- accumulates the results in a list
407− -- XXX why should this take O(n) heap, it discards the results?
408− benchIOSink value "sequence_" $ sequence_ value
409− , benchIOSink value "sequenceA_" $ sequenceA_ value
410− , benchIOSink value "sequence" $ sequence value
411− , benchIOSink value "sequenceA" $ sequenceA value
412− , benchIOSink value "manyAlt" manyAlt
413− , benchIOSink value "sepBy1" sepBy1
414− , benchIOSink value "someAlt" someAlt
415− , benchIOSink value "choice" $ choice value
416− ]
417−
418−-- O(n) heap beacuse of accumulation of the list in strict IO monad?
419−o_1_space_recursive :: Int -> [Benchmark]
420−o_1_space_recursive value =
421− [ benchIOSink value "one (recursive)" $ one value
422− ]
423−
424−-------------------------------------------------------------------------------
425−-- Driver
426−-------------------------------------------------------------------------------
427−
428−main :: IO ()
429−main = runWithCLIOpts defaultStreamSize allBenchmarks
430−
431− where
432−
433− allBenchmarks value =
434− [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
435− , bgroup (o_1_space_prefix moduleName) (o_1_space_recursive value)
436− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
437− ]
benchmark/Streamly/Benchmark/Data/Ring/Unboxed.hsdeleted−69
@@ -1,69 +0,0 @@
1−-- |
2−-- Module : Streamly.Benchmark.Data.Ring.Unboxed
3−-- Copyright : (c) 2022 Composewell
4−-- License : BSD-3-Clause
5−-- Maintainer : streamly@composewell.com
6−
7−{-# LANGUAGE FlexibleContexts #-}
8−{-# LANGUAGE RankNTypes #-}
9−{-# LANGUAGE ScopedTypeVariables #-}
10−
11−module Main (main) where
12−
13−import Control.Monad (void)
14−import GHC.Ptr (Ptr(..))
15−import qualified Streamly.Internal.Data.Array as Array
16−import qualified Streamly.Internal.Data.Ring as Ring
17−import qualified Data.Foldable as P
18−
19−import Test.Tasty.Bench
20−import Streamly.Benchmark.Common
21−
22−import Prelude as P
23−
24−-------------------------------------------------------------------------------
25−-- Benchmark ops
26−-------------------------------------------------------------------------------
27−
28−unsafeEqArrayN :: (Int, Array.Array Int, (Ring.Ring Int, Ptr Int)) -> Bool
29−unsafeEqArrayN (value, arr, (ring, rh)) = Ring.unsafeEqArrayN ring rh arr value
30−
31−unsafeEqArray :: (Array.Array Int, (Ring.Ring Int, Ptr Int)) -> Bool
32−unsafeEqArray (arr, (ring, rh)) = Ring.unsafeEqArray ring rh arr
33−
34−-------------------------------------------------------------------------------
35−-- Benchmark groups
36−-------------------------------------------------------------------------------
37−
38−o_1_space_serial ::
39− Int -> Array.Array Int -> (Ring.Ring Int, Ptr Int) -> [Benchmark]
40−o_1_space_serial value arr (ring, rh) =
41− [ bench "unsafeEqArrayN" $ nf unsafeEqArrayN (value, arr, (ring, rh))
42− , bench "unsafeEqArray" $ nf unsafeEqArray (arr, (ring, rh))
43− ]
44−
45−-------------------------------------------------------------------------------
46−-- Main
47−-------------------------------------------------------------------------------
48−
49−moduleName :: String
50−moduleName = "Data.Ring.Unboxed"
51−
52−main :: IO ()
53−main = do
54− runWithCLIOptsEnv defaultStreamSize alloc allBenchmarks
55−
56− where
57−
58− alloc value = do
59− let input = [1 .. value] :: [Int]
60− let arr = Array.fromList input
61− (ring, rh) <- Ring.new value
62− void $ P.foldlM (Ring.unsafeInsert ring) rh input
63− return (arr, (ring, rh))
64−
65− allBenchmarks (arr, (ring, rh)) value =
66− [ bgroup
67− (o_1_space_prefix moduleName)
68− (o_1_space_serial value arr (ring, rh))
69− ]
benchmark/Streamly/Benchmark/Data/Serialize.hsdeleted−591
@@ -1,591 +0,0 @@
1−{-# LANGUAGE TemplateHaskell #-}
2−{- HLINT ignore -}
3−
4−#undef FUSION_CHECK
5−#ifdef FUSION_CHECK
6−{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
7−#endif
8−
9−-- |
10−-- Module : Streamly.Benchmark.Data.Serialize
11−-- Copyright : (c) 2023 Composewell
12−-- License : BSD-3-Clause
13−-- Maintainer : streamly@composewell.com
14−
15−module Main (main) where
16−
17−-------------------------------------------------------------------------------
18−-- Imports
19−-------------------------------------------------------------------------------
20−
21−import Control.DeepSeq (NFData(..), deepseq)
22−import Control.Monad (when, void)
23−import GHC.Generics (Generic)
24−import System.Random (randomRIO)
25−#ifndef USE_UNBOX
26−import Test.QuickCheck (Arbitrary, arbitrary)
27−#endif
28−
29−import Streamly.Internal.Data.MutByteArray
30−import qualified Streamly.Internal.Data.MutByteArray as MBA
31−#ifdef USE_UNBOX
32−import Data.Proxy (Proxy(..))
33−#else
34−import Control.DeepSeq (force)
35−import Test.QuickCheck (oneof, generate)
36−#endif
37−
38−import Test.Tasty.Bench
39−import Streamly.Benchmark.Common
40−
41−#ifndef USE_UNBOX
42−import Streamly.Benchmark.Data.Serialize.RecCompatible
43−import Streamly.Benchmark.Data.Serialize.RecNonCompatible
44−#endif
45−
46−#ifdef USE_UNBOX
47−#define SERIALIZE_CLASS Unbox
48−#define DERIVE_CLASS(typ) $(deriveUnbox [d|instance Unbox typ|])
49−#define SERIALIZE_OP pokeAt
50−#define DESERIALIZE_OP peekAt
51−#else
52−#define SERIALIZE_CLASS Serialize
53−#define DERIVE_CLASS(typ) $(deriveSerialize [d|instance Serialize typ|])
54−#define SERIALIZE_OP serializeAt
55−#define DESERIALIZE_OP deserializeAt
56−#endif
57−
58−-------------------------------------------------------------------------------
59−-- Types
60−-------------------------------------------------------------------------------
61−
62−data Unit = Unit
63− deriving (Generic, Show, Eq)
64−
65−#ifndef USE_TH
66−instance SERIALIZE_CLASS Unit
67−#else
68−DERIVE_CLASS(Unit)
69−#endif
70−
71−instance NFData Unit where
72− {-# INLINE rnf #-}
73− rnf _ = ()
74−
75−data Sum2
76− = Sum21
77− | Sum22
78− deriving (Generic, Show, Eq)
79−
80−#ifndef USE_TH
81−instance SERIALIZE_CLASS Sum2
82−#else
83−DERIVE_CLASS(Sum2)
84−#endif
85−
86−instance NFData Sum2 where
87− {-# INLINE rnf #-}
88− rnf _ = ()
89−
90−data Sum25
91− = Sum251
92− | Sum252
93− | Sum253
94− | Sum254
95− | Sum255
96− | Sum256
97− | Sum257
98− | Sum258
99− | Sum259
100− | Sum2510
101− | Sum2511
102− | Sum2512
103− | Sum2513
104− | Sum2514
105− | Sum2515
106− | Sum2516
107− | Sum2517
108− | Sum2518
109− | Sum2519
110− | Sum2520
111− | Sum2521
112− | Sum2522
113− | Sum2523
114− | Sum2524
115− | Sum2525
116− deriving (Generic, Show, Eq)
117−
118−#ifndef USE_TH
119−instance SERIALIZE_CLASS Sum25
120−#else
121−DERIVE_CLASS(Sum25)
122−#endif
123−
124−instance NFData Sum25 where
125− {-# INLINE rnf #-}
126− rnf _ = ()
127−
128−data Product25
129− = Product25
130− Int
131− Int
132− Int
133− Int
134− Int
135− Int
136− Int
137− Int
138− Int
139− Int
140− Int
141− Int
142− Int
143− Int
144− Int
145− Int
146− Int
147− Int
148− Int
149− Int
150− Int
151− Int
152− Int
153− Int
154− Int
155− deriving (Generic, Show)
156−
157−#ifndef USE_TH
158−instance SERIALIZE_CLASS Product25
159−#else
160−DERIVE_CLASS(Product25)
161−#endif
162−
163−instance NFData Product25 where
164− {-# INLINE rnf #-}
165− rnf
166− (Product25 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 a16 a17 a18 a19 a20 a21 a22 a23 a24 a25)
167− = a1
168− `seq` a2
169− `seq` a3
170− `seq` a4
171− `seq` a5
172− `seq` a6
173− `seq` a7
174− `seq` a8
175− `seq` a9
176− `seq` a10
177− `seq` a11
178− `seq` a12
179− `seq` a13
180− `seq` a14
181− `seq` a15
182− `seq` a16
183− `seq` a17
184− `seq` a18
185− `seq` a19
186− `seq` a20
187− `seq` a21
188− `seq` a22
189− `seq` a23
190− `seq` a24
191− `seq` a25
192− `seq` ()
193−
194−-- XXX derived Eq instance is not inlined
195−instance Eq Product25 where
196− {-# INLINE (==) #-}
197− (==)
198− (Product25 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 a16 a17 a18 a19 a20 a21 a22 a23 a24 a25)
199− (Product25 b1 b2 b3 b4 b5 b6 b7 b8 b9 b10 b11 b12 b13 b14 b15 b16 b17 b18 b19 b20 b21 b22 b23 b24 b25)
200− = a1 == b1
201− && a2 == b2
202− && a3 == b3
203− && a4 == b4
204− && a5 == b5
205− && a6 == b6
206− && a7 == b7
207− && a8 == b8
208− && a9 == b9
209− && a10 == b10
210− && a11 == b11
211− && a12 == b12
212− && a13 == b13
213− && a14 == b14
214− && a15 == b15
215− && a16 == b16
216− && a17 == b17
217− && a18 == b18
218− && a19 == b19
219− && a20 == b20
220− && a21 == b21
221− && a22 == b22
222− && a23 == b23
223− && a24 == b24
224− && a25 == b25
225−
226−-------------------------------------------------------------------------------
227−-- Simple non-recursive ADT
228−-------------------------------------------------------------------------------
229−
230−{-
231−data CustomDT1
232− = CDT1C1
233− | CDT1C2 Int
234− | CDT1C3 Int Int
235− deriving (Generic, Show, Eq)
236−
237−#ifndef USE_TH
238−instance SERIALIZE_CLASS CustomDT1
239−#else
240−DERIVE_CLASS(CustomDT1)
241−#endif
242−
243−instance NFData CustomDT1 where
244− {-# INLINE rnf #-}
245− rnf CDT1C1 = ()
246− rnf (CDT1C2 i) = i `seq` ()
247− rnf (CDT1C3 i1 i2) = i1 `seq` i2 `seq` ()
248−-}
249−
250−-------------------------------------------------------------------------------
251−-- Recursive ADT
252−-------------------------------------------------------------------------------
253−
254−#ifndef USE_UNBOX
255−data BinTree a
256− = Tree (BinTree a) (BinTree a)
257− | Leaf a
258− deriving (Show, Read, Eq, Generic)
259−
260−#ifndef USE_TH
261−instance Serialize (BinTree a)
262−#else
263−$(deriveSerialize [d|instance Serialize a => Serialize (BinTree a)|])
264−#endif
265−
266−instance NFData a => NFData (BinTree a) where
267− {-# INLINE rnf #-}
268− rnf (Leaf a) = rnf a `seq` ()
269− rnf (Tree l r) = rnf l `seq` rnf r
270−
271−-- XXX This may not terminate, or could become really large.
272−instance Arbitrary a => Arbitrary (BinTree a) where
273− arbitrary = oneof [Leaf <$> arbitrary, Tree <$> arbitrary <*> arbitrary]
274−
275−mkBinTree :: (Arbitrary a) => Int -> IO (BinTree a)
276−mkBinTree = go (generate arbitrary)
277−
278− where
279−
280− go r 0 = Leaf <$> r
281− go r n = Tree <$> go r (n - 1) <*> go r (n - 1)
282−
283−#endif
284−
285−-------------------------------------------------------------------------------
286−-- Size helpers
287−-------------------------------------------------------------------------------
288−
289−{-# INLINE getSize #-}
290−getSize :: forall a. SERIALIZE_CLASS a => a -> Int
291−#ifdef USE_UNBOX
292−getSize _ = sizeOf (Proxy :: Proxy a)
293−#else
294−getSize = addSizeTo 0
295−#endif
296−
297−-------------------------------------------------------------------------------
298−-- Common helpers
299−-------------------------------------------------------------------------------
300−
301−{- HLINT ignore "Eta reduce" -}
302−-- Parts of "f" that are dependent on val will not be optimized out.
303−{-# INLINE loop #-}
304−loop :: Int -> (a -> IO b) -> a -> IO ()
305−loop count f val = go count val
306− where
307−
308− go n x = when (n > 0) $ f x >> go (n-1) x
309−
310−-- The first arg of "f" is the environment which is not threaded around in the
311−-- loop.
312−{-# INLINE loopWith #-}
313−loopWith :: Int -> (e -> a -> IO b) -> e -> a -> IO ()
314−loopWith count f e val = go count val
315− where
316−
317− go n x = when (n > 0) $ f e x >> go (n-1) x
318−
319−benchSink :: NFData b => String -> Int -> (Int -> IO b) -> Benchmark
320−benchSink name times f = bench name (nfIO (randomRIO (times, times) >>= f))
321−
322−-------------------------------------------------------------------------------
323−-- Serialization Helpers
324−-------------------------------------------------------------------------------
325−
326−{-
327−{-# INLINE pokeWithSize #-}
328−pokeWithSize :: SERIALIZE_CLASS a => MutByteArray -> a -> IO ()
329−pokeWithSize arr val = do
330− let n = getSize val
331− n `seq` SERIALIZE_OP 0 arr val >> return ()
332−
333−{-# INLINE pokeTimesWithSize #-}
334−pokeTimesWithSize :: SERIALIZE_CLASS a => a -> Int -> IO ()
335−pokeTimesWithSize val times = do
336− let n = getSize val
337− arr <- MBA.new n
338− loopWith times pokeWithSize arr val
339−-}
340−
341−{-# INLINE poke #-}
342−poke :: SERIALIZE_CLASS a => MutByteArray -> a -> IO ()
343−poke arr val = void (SERIALIZE_OP 0 arr val)
344−
345−{-# INLINE pokeTimes #-}
346−pokeTimes :: SERIALIZE_CLASS a => a -> Int -> IO ()
347−pokeTimes val times = do
348− let n = getSize val
349− arr <- MBA.new n
350− loopWith times poke arr val
351−
352−{-# INLINE encode #-}
353−encode :: SERIALIZE_CLASS a => a -> IO ()
354−encode val = do
355− let n = getSize val
356− arr <- MBA.new n
357− void (SERIALIZE_OP 0 arr val)
358−
359−{-# INLINE encodeTimes #-}
360−encodeTimes :: SERIALIZE_CLASS a => a -> Int -> IO ()
361−encodeTimes val times = loop times encode val
362−
363−{-# INLINE peek #-}
364−peek :: forall a. (NFData a, SERIALIZE_CLASS a) =>
365− (a, Int) -> MutByteArray -> IO ()
366−#ifdef USE_UNBOX
367−peek (_val, _) arr = do
368− (val1 :: a) <- DESERIALIZE_OP 0 arr
369−#else
370−peek (_val, n) arr = do
371− (_, val1 :: a) <- DESERIALIZE_OP 0 arr n
372−#endif
373− -- If the datatype is not deeply strict or deepseq is not used then use
374− -- Equality.
375− -- Ensure that we are actually constructing the type and using it. This
376− -- is important, otherwise the structure is created and discarded, the
377− -- cost of creation of the structure is not accounted. Otherwise we may
378− -- just read the values and discard them. The comparison adds to the
379− -- cost though. We could use deepseq but then we need to write
380− -- instances of NFData and ensure that they are correct and perform
381− -- well. Equality check also ensures correctness.
382− {-
383− if (val1 /= val)
384− then error "peek: no match"
385− else return ()
386− -}
387− val1 `deepseq` return ()
388−
389−{-# INLINE peekTimes #-}
390−peekTimes :: (NFData a, SERIALIZE_CLASS a) => Int -> a -> Int -> IO ()
391−peekTimes n val times = do
392− arr <- MBA.new n
393− _ <- SERIALIZE_OP 0 arr val
394− loopWith times peek (val, n) arr
395−
396−{-# INLINE trip #-}
397−trip :: forall a. (NFData a, SERIALIZE_CLASS a) => a -> IO ()
398−trip val = do
399− let n = getSize val
400− arr <- MBA.new n
401− _ <- SERIALIZE_OP 0 arr val
402−#ifdef USE_UNBOX
403− (val1 :: a) <- DESERIALIZE_OP 0 arr
404−#else
405− (_, val1 :: a) <- DESERIALIZE_OP 0 arr n
406−#endif
407− -- Do not remove this or use deepseq, see the comments in peek.
408− {-
409− if (val1 /= val)
410− then error "roundtrip: no match"
411− else return ()
412− -}
413− -- Note: deepseq is not needed if the datatype is strict
414− val1 `deepseq` return ()
415−
416−{-# INLINE roundtrip #-}
417−roundtrip :: (NFData a, SERIALIZE_CLASS a) => a -> Int -> IO ()
418−roundtrip val times = loop times trip val
419−
420−-------------------------------------------------------------------------------
421−-- Benchmarks
422−-------------------------------------------------------------------------------
423−
424−{-# INLINE benchConst #-}
425−benchConst ::
426− String
427− -> (forall a. (NFData a, SERIALIZE_CLASS a) =>
428− Int -> a -> Int -> IO ())
429− -> Int
430− -> Benchmark
431−benchConst gname f times =
432− bgroup gname
433− [ let !n = getSize Unit
434− in benchSink "Unit" times (f n Unit)
435− {-
436− , let !n = getSize CDT1C1
437− in benchSink "C1" times (f n CDT1C1)
438− , let val = CDT1C2 5
439− !n = getSize val
440− in benchSink "C2" (times `div` 2) (f n val)
441− , let val = CDT1C3 5 2
442− !n = getSize val
443− in benchSink "C3" (times `div` 3) (f n val)
444− -}
445− , let !n = getSize Sum21
446− in benchSink "Sum2" times (f n Sum21)
447− , let !n = getSize Sum2525
448− in benchSink "Sum25" times (f n Sum2525)
449− , let val = Product25 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
450− !n = getSize val
451− in benchSink "Product25" (times `div` 26) (f n val)
452− ]
453−
454−#ifndef USE_UNBOX
455−{-# INLINE benchVar #-}
456−benchVar ::
457− String
458− -> (forall a. (NFData a, SERIALIZE_CLASS a) =>
459− Int -> a -> Int -> IO ())
460− -> BinTree Int
461− -> [Int]
462− -> Int
463− -> Benchmark
464−benchVar gname f tInt lInt times =
465− bgroup gname
466− [ let !n = getSize tInt
467− in benchSink "bintree-int" times (f n tInt)
468− , let !n = getSize lInt
469− in benchSink "list-int" times (f n lInt)
470− ]
471−
472−{-
473−{-# INLINE benchGeneric #-}
474−benchGeneric
475− :: (NFData b, Serialize b)
476− => String
477− -> String
478− -> (forall a. (NFData a, Serialize a) =>
479− Int -> a -> Int -> IO ())
480− -> b
481− -> Int
482− -> Benchmark
483−benchGeneric gname valId f val times =
484− bgroup gname
485− [ let !n = getSize val
486− in benchSink valId times (f n val)
487− ]
488−-}
489−
490−{-# INLINE benchLargeRec #-}
491−benchLargeRec ::
492− String
493− -> (forall a. (NFData a, Serialize a) =>
494− Int -> a -> Int -> IO ())
495− -> RecNonCompatible
496− -> RecCompatible
497− -> Int
498− -> Benchmark
499−benchLargeRec gname f recL recR times =
500− bgroup gname
501− [ let !n = getSize recL
502− in benchSink "RecNonCompatible" times (f n recL)
503− , let !n = getSize recR
504− in benchSink "RecCompatible" times (f n recR)
505− ]
506−#endif
507−
508−-- Times is scaled by the number of constructors to normalize
509−#ifdef USE_UNBOX
510−allBenchmarks :: Int -> [Benchmark]
511−allBenchmarks times =
512−#else
513−allBenchmarks ::
514− BinTree Int -> [Int] -> RecNonCompatible -> RecCompatible -> Int -> [Benchmark]
515−allBenchmarks tInt lInt recL recR times =
516−#endif
517− [ bgroup "sizeOf"
518− [
519−#ifndef USE_UNBOX
520− bench "bintree-int" $ nf getSize tInt
521− , bench "list-int" $ nf getSize lInt
522−#endif
523− ]
524− , benchConst "poke" (const pokeTimes) times
525− -- , benchConst "pokeWithSize" (const pokeTimesWithSize) times
526− , benchConst "encode" (const encodeTimes) times
527− , benchConst "peek" peekTimes times
528− , benchConst "roundtrip" (const roundtrip) times
529−#ifndef USE_UNBOX
530− , benchVar "poke" (const pokeTimes) tInt lInt 1
531− -- , benchVar "pokeWithSize" (const pokeTimesWithSize) tInt lInt 1
532− , benchVar "encode" (const encodeTimes) tInt lInt 1
533− , benchVar "peek" peekTimes tInt lInt 1
534− , benchVar "roundtrip" (const roundtrip) tInt lInt 1
535− , benchLargeRec "poke" (const pokeTimes) recL recR times
536− , benchLargeRec "encode" (const encodeTimes) recL recR times
537− , benchLargeRec "peek" peekTimes recL recR times
538− , benchLargeRec "roundtrip" (const roundtrip) recL recR times
539−#endif
540− ]
541−
542−-------------------------------------------------------------------------------
543−-- Driver
544−-------------------------------------------------------------------------------
545−
546−main :: IO ()
547−main = do
548−#ifndef USE_UNBOX
549− -- Approximately 100000 constructors
550− -- Assuming Leaf nodes constitute two constructors (Leaf, Int) and internal
551− -- nodes 1 level = log_2 (100001/3) + 1 = 16
552− !(tInt :: BinTree Int) <- force <$> mkBinTree 16
553−
554− let !recL = valRecNonCompatible
555− let !recR = valRecCompatible
556−
557− -- Approximately 100000 constructors, assuming two constructors (Cons, Int)
558− -- per element.
559− let lInt = [1..50000 :: Int]
560− let !len = length lInt -- evaluate the list
561−#endif
562−#ifndef FUSION_CHECK
563−#ifdef USE_UNBOX
564− runWithCLIOpts defaultStreamSize allBenchmarks
565−#else
566− len
567− `seq` runWithCLIOpts
568− defaultStreamSize
569− (allBenchmarks tInt lInt recL recR)
570−#endif
571−#else
572− -- Enable FUSION_CHECK macro at the beginning of the file
573− -- Enable one benchmark below, and run the benchmark
574− -- Check the .dump-simpl output
575− let value = 100000
576− -- print $ getSize (CDT1C3 4 2)
577− -- print $ getSize tInt
578− -- print $ getSize lInt
579−
580− -- pokeTimes tInt 1
581−
582− -- peekTimes ((CDT1C2 (5 :: Int)) :: CustomDT1) value
583− -- peekTimes (Sum2525) value
584− -- peekTimes (Product25 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25) value
585− -- peekTimes tInt 1
586− let !n = getSize lInt
587− peekTimes n lInt 1
588−
589− -- roundtrip ((CDT1C2 (5 :: Int)) :: CustomDT1) value
590− return ()
591−#endif
benchmark/Streamly/Benchmark/Data/Serialize/RecCompatible.hsdeleted−24
@@ -1,24 +0,0 @@
1−{-# LANGUAGE TemplateHaskell #-}
2−
3−module Streamly.Benchmark.Data.Serialize.RecCompatible
4− ( RecCompatible(..)
5− , valRecCompatible
6− ) where
7−
8−--------------------------------------------------------------------------------
9−-- Imports
10−--------------------------------------------------------------------------------
11−
12−import Streamly.Internal.Data.MutByteArray (Serialize)
13−import Streamly.Benchmark.Data.Serialize.TH (genLargeRecord)
14−
15−import qualified Streamly.Internal.Data.MutByteArray as Serialize
16−
17−--------------------------------------------------------------------------------
18−-- Code
19−--------------------------------------------------------------------------------
20−
21−$(genLargeRecord "RecCompatible" 50)
22−$(Serialize.deriveSerializeWith
23− (Serialize.encodeRecordFields True)
24− [d|instance Serialize RecCompatible|])
benchmark/Streamly/Benchmark/Data/Serialize/RecNonCompatible.hsdeleted−21
@@ -1,21 +0,0 @@
1−{-# LANGUAGE TemplateHaskell #-}
2−
3−module Streamly.Benchmark.Data.Serialize.RecNonCompatible
4− ( RecNonCompatible(..)
5− , valRecNonCompatible
6− ) where
7−
8−--------------------------------------------------------------------------------
9−-- Imports
10−--------------------------------------------------------------------------------
11−
12−import Streamly.Benchmark.Data.Serialize.TH (genLargeRecord)
13−
14−import qualified Streamly.Internal.Data.MutByteArray as Serialize
15−
16−--------------------------------------------------------------------------------
17−-- Code
18−--------------------------------------------------------------------------------
19−
20−$(genLargeRecord "RecNonCompatible" 50)
21−$(Serialize.deriveSerialize [d|instance Serialize.Serialize RecNonCompatible|])
benchmark/Streamly/Benchmark/Data/Serialize/TH.hsdeleted−76
@@ -1,76 +0,0 @@
1−{-# LANGUAGE TemplateHaskell #-}
2−
3−module Streamly.Benchmark.Data.Serialize.TH (genLargeRecord) where
4−
5−--------------------------------------------------------------------------------
6−-- Imports
7−--------------------------------------------------------------------------------
8−
9−import Language.Haskell.TH
10−
11−import Streamly.Internal.Data.MutByteArray (makeI)
12−import Control.DeepSeq (NFData(..))
13−
14−--------------------------------------------------------------------------------
15−-- Large Record
16−--------------------------------------------------------------------------------
17−
18−genLargeRecord :: String -> Int -> Q [Dec]
19−genLargeRecord tyName numFields =
20− sequence
21− [ dataD
22− (pure [])
23− (mkName tyName)
24− []
25− Nothing
26− [mkCon tyName]
27− [derivClause Nothing [conT ''Eq, conT ''Show]]
28− , mkValueSigDec
29− , mkValueDec
30− , nfDataInstance tyName
31− ]
32−
33− where
34−
35− fieldTypeChoices = [conT ''()]
36− chooseCycle i xs = xs !! (i `mod` length xs)
37− nfDataInstance nm =
38− instanceD
39− (pure [])
40− (appT (conT ''NFData) (conT (mkName nm)))
41− [ funD
42− 'rnf
43− [ clause
44− [ conP
45− (mkName nm)
46− (varP . makeI <$> [0 .. (numFields - 1)])
47− ]
48− (normalB
49− (foldl
50− (\b a -> [|rnf $(b) `seq` rnf $(a)|])
51− [|()|]
52− (varE . makeI <$> [0 .. (numFields - 1)])))
53− []
54− ]
55− ]
56− valueName = mkName $ "val" ++ tyName
57− mkValueSigDec = sigD valueName [t|$(conT (mkName tyName))|]
58− mkValueDec =
59− funD
60− valueName
61− [ clause
62− []
63− (normalB
64− (foldl
65− (\b a -> [|$(b) $(a)|])
66− (conE (mkName tyName))
67− (conE '() <$ [0 .. (numFields - 1)])))
68− []
69− ]
70− mkCon nm = recC (mkName nm) (mkField <$> [0 .. (numFields - 1)])
71− mkField i =
72− varBangType
73− (mkName ("field" ++ show i))
74− (bangType
75− (bang noSourceUnpackedness noSourceStrictness)
76− (chooseCycle i fieldTypeChoices))
benchmark/Streamly/Benchmark/Data/Stream.hsdeleted−114
@@ -1,114 +0,0 @@
1−-- |
2−-- Module : Data.Stream
3−-- Copyright : (c) 2018 Composewell Technologies
4−-- License : BSD-3-Clause
5−-- Maintainer : streamly@composewell.com
6−
7−{-# LANGUAGE CPP #-}
8−{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE ScopedTypeVariables #-}
10−{-# LANGUAGE RankNTypes #-}
11−
12−#undef FUSION_CHECK
13−#ifdef FUSION_CHECK
14−{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
15−#endif
16−
17−module Main (main) where
18−
19−import Streamly.Benchmark.Common.Handle (mkHandleBenchEnv)
20−
21−import qualified Stream.Eliminate as Elimination
22−#ifndef USE_STREAMLY_CORE
23−import qualified Stream.Exceptions as Exceptions
24−#endif
25−import qualified Stream.Expand as NestedStream
26−import qualified Stream.Generate as Generation
27−import qualified Stream.Lift as Lift
28−import qualified Stream.Reduce as NestedFold
29−#ifdef USE_PRELUDE
30−import qualified Stream.Split as Split
31−#endif
32−import qualified Stream.Transform as Transformation
33−
34−import Streamly.Benchmark.Common
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−
45−moduleName :: String
46−#ifdef USE_STREAMK
47−moduleName = "Data.Stream.StreamDK"
48−#else
49−moduleName = "Data.Stream"
50−#endif
51−
52−-------------------------------------------------------------------------------
53−-- Main
54−-------------------------------------------------------------------------------
55−
56−-- In addition to gauge options, the number of elements in the stream can be
57−-- passed using the --stream-size option.
58−--
59−main :: IO ()
60−main = do
61−#ifndef FUSION_CHECK
62− env <- mkHandleBenchEnv
63− runWithCLIOpts defaultStreamSize (allBenchmarks env)
64−
65− where
66−
67− allBenchmarks env size = Prelude.concat
68− [ Generation.benchmarks moduleName size
69− , Elimination.benchmarks moduleName size
70−#ifndef USE_STREAMLY_CORE
71− , Exceptions.benchmarks moduleName env size
72−#endif
73−#ifdef USE_PRELUDE
74− , Split.benchmarks moduleName env
75−#endif
76− , Transformation.benchmarks moduleName size
77− , NestedFold.benchmarks moduleName size
78− , Lift.benchmarks moduleName size
79− , NestedStream.benchmarks moduleName size
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.hsdeleted−518
@@ -1,518 +0,0 @@
1−{-# LANGUAGE ConstraintKinds #-}
2−{-# LANGUAGE CPP #-}
3−{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE ScopedTypeVariables #-}
5−
6−-- |
7−-- Module : Stream.Common
8−-- Copyright : (c) 2018 Composewell Technologies
9−-- License : BSD-3-Clause
10−-- Maintainer : streamly@composewell.com
11−
12−#ifdef USE_PRELUDE
13−{-# OPTIONS_GHC -Wno-deprecations #-}
14−#endif
15−
16−module Stream.Common
17− ( MonadAsync
18−
19− , fromStream
20− , toStream
21−
22− -- Generation
23− , fromListM
24− , fromFoldableM
25−
26− , append
27− , append2
28−
29− -- Elimination
30− , drain
31− , foldl'
32− , scanl'
33−
34− -- Benchmark stream generation
35− , sourceUnfoldr
36− , sourceUnfoldrM
37− , sourceUnfoldrAction
38− , sourceConcatMapId
39− , sourceFromFoldable
40−
41− -- Benchmark stream elimination
42− , benchIOSink
43− , benchIOSrc
44− , benchIO
45−
46− -- Benchmarking functions
47−#ifdef USE_STREAMK
48− , concatStreamsWith
49− , mergeMapWith
50−#endif
51− , apDiscardFst
52− , apDiscardSnd
53− , apLiftA2
54− , toNullAp
55− , monadThen
56− , toNullM
57− , toNullM3
58− , filterAllOutM
59− , filterAllInM
60− , filterSome
61− , breakAfterSome
62− , toListM
63− , toListSome
64− , composeN
65− , mapN
66− , mapM
67− , transformMapM
68− , transformComposeMapM
69− , transformTeeMapM
70− , transformZipMapM
71− )
72−where
73−
74−#if !MIN_VERSION_base(4,18,0)
75−import Control.Applicative (liftA2)
76−#endif
77−import Control.DeepSeq (NFData)
78−import Control.Exception (try)
79−import GHC.Exception (ErrorCall)
80−import System.Random (randomRIO)
81−
82−import qualified Streamly.Internal.Data.Fold as Fold
83−import qualified Streamly.Internal.Data.Pipe as Pipe
84−
85−#ifdef USE_PRELUDE
86−import Streamly.Prelude (foldl', scanl')
87−import qualified Streamly.Internal.Data.Stream.IsStream as Stream
88−import qualified Streamly.Prelude as Stream
89−import qualified Streamly.Prelude as StreamK
90−import Streamly.Benchmark.Prelude
91− ( composeN, sourceConcatMapId, benchIOSink
92− , concatStreamsWith
93− )
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
102−import qualified Streamly.Internal.Data.Stream as Stream
103−import qualified Streamly.Internal.Data.Stream as StreamK
104−#endif
105−#endif
106−
107−import Test.Tasty.Bench
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
123−
124−#ifdef USE_PRELUDE
125−type Stream = Stream.SerialT
126−type MonadAsync m = Stream.MonadAsync m
127−mkCross = id
128−unCross = id
129−#else
130−type MonadAsync = Monad
131−
132−#ifdef USE_STREAMK
133−mkCross :: StreamK m a -> StreamK.CrossStreamK m a
134−mkCross = StreamK.mkCross
135−
136−unCross :: StreamK.CrossStreamK m a -> StreamK m a
137−unCross = StreamK.unCross
138−#else
139−mkCross :: Stream m a -> Stream.CrossStream m a
140−mkCross = Stream.mkCross
141−
142−unCross :: Stream.CrossStream m a -> Stream m a
143−unCross = Stream.unCross
144−#endif
145−#endif
146−
147−#ifdef USE_PRELUDE
148−{-# INLINE append #-}
149−append :: Monad m => Stream m a -> Stream m a -> Stream m a
150−append = Stream.serial
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
157−append = Stream.append
158−#endif
159−#endif
160−
161−{-# INLINE append2 #-}
162−append2 :: Monad m => Stream m a -> Stream m a -> Stream m a
163−#ifdef USE_PRELUDE
164−append2 = Stream.append
165−#else
166−append2 = D.append
167−#endif
168−
169−{-# INLINE drain #-}
170−drain :: 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
177−drain = Stream.fold Fold.drain
178−toList = Stream.fold Fold.toList
179−#endif
180−
181−{-# INLINE fromListM #-}
182−fromListM :: MonadAsync m => [m a] -> Stream m a
183−#ifdef USE_PRELUDE
184−fromListM = Stream.fromListM
185−#else
186−fromListM = Stream.sequence . Stream.fromList
187−#endif
188−
189−{-# INLINE fromFoldableM #-}
190−fromFoldableM :: MonadAsync m => [m a] -> Stream m a
191−#ifdef USE_PRELUDE
192−fromFoldableM = Stream.fromFoldableM
193−#else
194−fromFoldableM = Stream.sequence . toStream . StreamK.fromFoldable
195−#endif
196−
197−{-# INLINE sourceUnfoldrM #-}
198−sourceUnfoldrM :: MonadAsync m => Int -> Int -> Stream m Int
199−sourceUnfoldrM count start = Stream.unfoldrM step start
200−
201− where
202−
203− step cnt =
204− if cnt > start + count
205− then return Nothing
206− else return (Just (cnt, cnt + 1))
207−
208−{-# INLINE sourceUnfoldr #-}
209−sourceUnfoldr :: Monad m => Int -> Int -> Stream m Int
210−sourceUnfoldr count start = Stream.unfoldr step start
211−
212− where
213−
214− step cnt =
215− if cnt > start + count
216− then Nothing
217− else Just (cnt, cnt + 1)
218−
219−{-# INLINE sourceUnfoldrAction #-}
220−sourceUnfoldrAction :: (Monad m1, Monad m) => Int -> Int -> Stream m (m1 Int)
221−sourceUnfoldrAction value n = Stream.unfoldr step n
222−
223− where
224−
225− step cnt =
226− if cnt > n + value
227− then Nothing
228− else Just (return cnt, cnt + 1)
229−
230−{-# INLINE sourceFromFoldable #-}
231−sourceFromFoldable :: Monad m => Int -> Int -> Stream m Int
232−sourceFromFoldable value n = toStream $ StreamK.fromFoldable [n..n+value]
233−
234−#ifndef USE_PRELUDE
235−{-# INLINE benchIOSink #-}
236−benchIOSink
237− :: (NFData b)
238− => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
239−benchIOSink value name f =
240− bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
241−#endif
242−
243−-- | Takes a source, and uses it with a default drain/fold method.
244−{-# INLINE benchIOSrc #-}
245−benchIOSrc
246− :: String
247− -> (Int -> Stream IO a)
248− -> Benchmark
249−benchIOSrc name f =
250− bench name $ nfIO $ randomRIO (1,1) >>= drain . f
251−
252−{-# NOINLINE benchIO #-}
253−benchIO :: (NFData b) => String -> (Int -> IO b) -> Benchmark
254−benchIO name f = bench name $ nfIO $ randomRIO (1,1) >>= f
255−
256−#ifndef USE_PRELUDE
257−#ifdef USE_STREAMK
258−{-# INLINE concatStreamsWith #-}
259−concatStreamsWith
260− :: (StreamK IO Int -> StreamK IO Int -> StreamK IO Int)
261− -> Int
262− -> Int
263− -> Int
264− -> IO ()
265−concatStreamsWith op outer inner n =
266− drain $ toStream $ StreamK.concatMapWith op
267− (fromStream . sourceUnfoldrM inner)
268− (fromStream $ sourceUnfoldrM outer n)
269−
270−{-# INLINE mergeMapWith #-}
271−mergeMapWith
272− :: (StreamK IO Int -> StreamK IO Int -> StreamK IO Int)
273− -> Int
274− -> Int
275− -> Int
276− -> IO ()
277−mergeMapWith op outer inner n =
278− drain $ toStream $ StreamK.mergeMapWith op
279− (fromStream . sourceUnfoldrM inner)
280− (fromStream $ sourceUnfoldrM outer n)
281−#endif
282−
283−{-# INLINE sourceConcatMapId #-}
284−sourceConcatMapId :: (Monad m)
285− => Int -> Int -> Stream m (Stream m Int)
286−sourceConcatMapId value n =
287− Stream.fromList $ fmap (D.fromEffect . return) [n..n+value]
288−#endif
289−
290−{-# INLINE apDiscardFst #-}
291−apDiscardFst :: MonadAsync m =>
292− Int -> Int -> m ()
293−apDiscardFst linearCount start = drain $ toStream $ unCross $
294− mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
295− *> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
296−
297− where
298−
299− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
300−
301−{-# INLINE apDiscardSnd #-}
302−apDiscardSnd :: MonadAsync m => Int -> Int -> m ()
303−apDiscardSnd linearCount start = drain $ toStream $ unCross $
304− mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
305− <* mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
306−
307− where
308−
309− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
310−
311−{-# INLINE apLiftA2 #-}
312−apLiftA2 :: MonadAsync m => Int -> Int -> m ()
313−apLiftA2 linearCount start = drain $ toStream $ unCross $
314− liftA2 (+) (mkCross (fromStream $ sourceUnfoldrM nestedCount2 start))
315− (mkCross (fromStream $ sourceUnfoldrM nestedCount2 start))
316−
317− where
318−
319− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
320−
321−{-# INLINE toNullAp #-}
322−toNullAp :: MonadAsync m => Int -> Int -> m ()
323−toNullAp linearCount start = drain $ toStream $ unCross $
324− (+) <$> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
325− <*> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
326−
327− where
328−
329− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
330−
331−{-# INLINE monadThen #-}
332−monadThen :: MonadAsync m => Int -> Int -> m ()
333−monadThen linearCount start = drain $ toStream $ unCross $ do
334− mkCross (fromStream $ sourceUnfoldrM nestedCount2 start) >>
335− mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
336−
337− where
338−
339− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
340−
341−{-# INLINE toNullM #-}
342−toNullM :: MonadAsync m => Int -> Int -> m ()
343−toNullM linearCount start = drain $ toStream $ unCross $ do
344− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
345− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
346− return $ x + y
347−
348− where
349−
350− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
351−
352−{-# INLINE toNullM3 #-}
353−toNullM3 :: MonadAsync m => Int -> Int -> m ()
354−toNullM3 linearCount start = drain $ toStream $ unCross $ do
355− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount3 start)
356− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount3 start)
357− z <- mkCross (fromStream $ sourceUnfoldrM nestedCount3 start)
358− return $ x + y + z
359− where
360− nestedCount3 = round (fromIntegral linearCount**(1/3::Double))
361−
362−{-# INLINE filterAllOutM #-}
363−filterAllOutM :: MonadAsync m => Int -> Int -> m ()
364−filterAllOutM linearCount start = drain $ toStream $ unCross $ do
365− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
366− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
367− let s = x + y
368− if s < 0
369− then return s
370− else mkCross StreamK.nil
371− where
372− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
373−
374−{-# INLINE filterAllInM #-}
375−filterAllInM :: MonadAsync m => Int -> Int -> m ()
376−filterAllInM linearCount start = drain $ toStream $ unCross $ do
377− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
378− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
379− let s = x + y
380− if s > 0
381− then return s
382− else mkCross StreamK.nil
383− where
384− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
385−
386−{-# INLINE filterSome #-}
387−filterSome :: MonadAsync m => Int -> Int -> m ()
388−filterSome linearCount start = drain $ toStream $ unCross $ do
389− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
390− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
391− let s = x + y
392− if s > 1100000
393− then return s
394− else mkCross StreamK.nil
395− where
396− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
397−
398−{-# INLINE breakAfterSome #-}
399−breakAfterSome :: Int -> Int -> IO ()
400−breakAfterSome linearCount start = do
401− (_ :: Either ErrorCall ()) <- try $ drain $ toStream $ unCross $ do
402− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
403− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
404− let s = x + y
405− if s > 1100000
406− then error "break"
407− else return s
408− return ()
409− where
410− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
411−
412−{-# INLINE toListM #-}
413−toListM :: MonadAsync m => Int -> Int -> m [Int]
414−toListM linearCount start = toList $ toStream $ unCross $ do
415− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
416− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
417− return $ x + y
418− where
419− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
420−
421−-- Taking a specified number of elements is very expensive in logict so we have
422−-- a test to measure the same.
423−{-# INLINE toListSome #-}
424−toListSome :: MonadAsync m => Int -> Int -> m [Int]
425−toListSome linearCount start =
426− toList $ Stream.take 10000 $ toStream $ unCross $ do
427− x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
428− y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
429− return $ x + y
430− where
431− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
432−
433−#ifndef USE_PRELUDE
434−{-# INLINE composeN #-}
435−composeN ::
436− (Monad m)
437− => Int
438− -> (Stream m Int -> Stream m Int)
439− -> Stream m Int
440− -> m ()
441−composeN n f =
442− case n of
443− 1 -> drain . f
444− 2 -> drain . f . f
445− 3 -> drain . f . f . f
446− 4 -> drain . f . f . f . f
447− _ -> undefined
448−#endif
449−
450−{-# INLINE mapN #-}
451−mapN ::
452− Monad m
453− => Int
454− -> Stream m Int
455− -> m ()
456−mapN n = composeN n $ fmap (+ 1)
457−
458−{-# INLINE mapM #-}
459−mapM ::
460− MonadAsync m
461− => Int
462− -> Stream m Int
463− -> m ()
464−mapM n = composeN n $ Stream.mapM return
465−
466−#ifndef USE_PRELUDE
467−foldl' :: Monad m => (b -> a -> b) -> b -> Stream m a -> m b
468−foldl' f z = Stream.fold (Fold.foldl' f z)
469−
470−scanl' :: Monad m => (b -> a -> b) -> b -> Stream m a -> Stream m b
471−scanl' f z = Stream.scan (Fold.foldl' f z)
472−#endif
473−
474−{-# INLINE transformMapM #-}
475−transformMapM ::
476− (Monad m)
477− => Int
478− -> Stream m Int
479− -> m ()
480−transformMapM n = composeN n $ Stream.transform (Pipe.mapM return)
481−
482−{-# INLINE transformComposeMapM #-}
483−transformComposeMapM ::
484− (Monad m)
485− => Int
486− -> Stream m Int
487− -> m ()
488−transformComposeMapM n =
489− composeN n $
490− Stream.transform
491− (Pipe.mapM (\x -> return (x + 1)) `Pipe.compose`
492− Pipe.mapM (\x -> return (x + 2)))
493−
494−{-# INLINE transformTeeMapM #-}
495−transformTeeMapM ::
496− (Monad m)
497− => Int
498− -> Stream m Int
499− -> m ()
500−transformTeeMapM n =
501− composeN n $
502− Stream.transform
503− (Pipe.mapM (\x -> return (x + 1)) `Pipe.tee`
504− Pipe.mapM (\x -> return (x + 2)))
505−
506−{-# INLINE transformZipMapM #-}
507−transformZipMapM ::
508− (Monad m)
509− => Int
510− -> Stream m Int
511− -> m ()
512−transformZipMapM n =
513− composeN n $
514− Stream.transform
515− (Pipe.zipWith
516− (+)
517− (Pipe.mapM (\x -> return (x + 1)))
518− (Pipe.mapM (\x -> return (x + 2))))
benchmark/Streamly/Benchmark/Data/Stream/Concurrent.hsdeleted−20
@@ -1,20 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−-- |
3−-- Module : Main
4−-- Copyright : (c) 2018 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−
9−import Stream.ConcurrentCommon (allBenchmarks)
10−import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
11−
12−moduleName :: String
13−moduleName = "Data.Stream.Concurrent"
14−
15−-------------------------------------------------------------------------------
16−-- Main
17−-------------------------------------------------------------------------------
18−
19−main :: IO ()
20−main = runWithCLIOpts defaultStreamSize (allBenchmarks moduleName False id)
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentCommon.hsdeleted−208
@@ -1,208 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−-- |
3−-- Module : Main
4−-- Copyright : (c) 2018 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−
9−module Stream.ConcurrentCommon
10− ( allBenchmarks
11− )
12−where
13−
14−import Stream.Common
15− (composeN, benchIO, benchIOSink, benchIOSrc, sourceUnfoldrM)
16−import Streamly.Data.Stream (Stream)
17−import Streamly.Internal.Data.Stream.Prelude (MonadAsync, Config)
18−
19−import qualified Data.List as List
20−import qualified Streamly.Data.Fold as Fold
21−import qualified Streamly.Data.Stream as Stream
22−import qualified Streamly.Internal.Data.Stream.Prelude as Async
23−
24−import Test.Tasty.Bench
25−import Prelude hiding (mapM)
26−import Streamly.Benchmark.Common
27−
28−-- XXX Write inspection tests to make sure no dictionaries are being passed
29−-- around to find specialization issues. Could be really bad for perf.
30−
31−-------------------------------------------------------------------------------
32−-- Mapping
33−-------------------------------------------------------------------------------
34−
35−{-# INLINE mapM #-}
36−mapM ::
37− MonadAsync m
38− => (Config -> Config)
39− -> Int
40− -> Stream m Int
41− -> m ()
42−mapM f n = composeN n $ Async.parMapM f return
43−
44−o_1_space_mapping :: Int -> (Config -> Config) -> [Benchmark]
45−o_1_space_mapping value f =
46− [ bgroup "mapping"
47− [ benchIOSink value "mapM" $ mapM f 1
48− ]
49− ]
50−
51−-------------------------------------------------------------------------------
52−-- Size conserving transformations (reordering, buffering, etc.)
53−-------------------------------------------------------------------------------
54−
55−o_n_heap_buffering :: Int -> (Config -> Config) -> [Benchmark]
56−o_n_heap_buffering value f =
57− [ bgroup "buffered"
58− [ benchIOSink value "mkAsync"
59− (Stream.fold Fold.drain . Async.parEval f)
60− ]
61− ]
62−
63−-------------------------------------------------------------------------------
64−-- Joining
65−-------------------------------------------------------------------------------
66−
67−{-# INLINE async2 #-}
68−async2 :: (Config -> Config) -> Int -> Int -> IO ()
69−async2 f count n =
70− Stream.fold Fold.drain
71− $ Async.parTwo f
72− (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
73−
74−{-# INLINE concatAsync2 #-}
75−concatAsync2 :: (Config -> Config) -> Int -> Int -> IO ()
76−concatAsync2 f count n =
77− Stream.fold Fold.drain
78− $ Async.parConcat f
79− $ Stream.fromList
80− [sourceUnfoldrM count n, sourceUnfoldrM count (n + 1)]
81−
82−o_1_space_joining :: Int -> (Config -> Config) -> [Benchmark]
83−o_1_space_joining value f =
84− [ bgroup "joining"
85− [ benchIOSrc1 "async (2 of n/2)" (async2 f (value `div` 2))
86− , benchIOSrc1 "concat async (2 of n/2)" (concatAsync2 f (value `div` 2))
87− ]
88− ]
89−
90−-------------------------------------------------------------------------------
91−-- Concat
92−-------------------------------------------------------------------------------
93−
94−{-# INLINE sourceFoldMapWith #-}
95−sourceFoldMapWith :: (Config -> Config) -> Int -> Int -> Stream IO Int
96−sourceFoldMapWith f value n =
97− Async.parConcatMap f Stream.fromPure $ Stream.fromList [n..n+value]
98−
99−{-# INLINE sourceFoldMapWithStream #-}
100−sourceFoldMapWithStream :: (Config -> Config) -> Int -> Int -> Stream IO Int
101−sourceFoldMapWithStream f value n =
102− Async.parConcatMap f Stream.fromPure
103− $ Stream.enumerateFromTo n (n + value)
104−
105−{-# INLINE concatFoldableWith #-}
106−concatFoldableWith :: (Config -> Config) -> Int -> Int -> Stream IO Int
107−concatFoldableWith f value n =
108− let step x =
109− if x <= n + value
110− then Just (Stream.fromPure x, x + 1)
111− else Nothing
112− list = List.unfoldr step n
113− in Async.parConcat f (Stream.fromList list)
114−
115−o_1_space_concatFoldable :: Int -> (Config -> Config) -> [Benchmark]
116−o_1_space_concatFoldable value f =
117− [ bgroup "concat-foldable"
118− [ benchIOSrc "foldMapWith (<>) (List)"
119− (sourceFoldMapWith f value)
120− , benchIOSrc "foldMapWith (<>) (Stream)"
121− (sourceFoldMapWithStream f value)
122− , benchIOSrc "S.concatFoldableWith (<>) (List)"
123− (concatFoldableWith f value)
124− ]
125− ]
126−
127−{-# INLINE concatMapStreamsWith #-}
128−concatMapStreamsWith
129− :: (Config -> Config)
130− -> Int
131− -> Int
132− -> Int
133− -> IO ()
134−concatMapStreamsWith f outer inner n =
135− Stream.fold Fold.drain
136− $ Async.parConcatMap f (sourceUnfoldrM inner) (sourceUnfoldrM outer n)
137−
138−{-# INLINE concatFmapStreamsWith #-}
139−concatFmapStreamsWith
140− :: (Config -> Config)
141− -> Int
142− -> Int
143− -> Int
144− -> IO ()
145−concatFmapStreamsWith f outer inner n =
146− Stream.fold Fold.drain
147− $ Async.parConcat f
148− $ fmap (sourceUnfoldrM inner) (sourceUnfoldrM outer n)
149−
150−o_1_space_concatMap :: Int -> (Config -> Config) -> [Benchmark]
151−o_1_space_concatMap value f =
152− value2 `seq`
153− [ bgroup "concat"
154− [ benchIO "parConcatMap (n of 1)"
155− (concatMapStreamsWith f value 1)
156− , benchIO "parConcatMap (sqrt x of sqrt x)"
157− (concatMapStreamsWith f value2 value2)
158− , benchIO "parConcatMap (1 of n)"
159− (concatMapStreamsWith f 1 value)
160− , benchIO "concat . fmap (n of 1)"
161− (concatFmapStreamsWith f value 1)
162− ]
163− ]
164−
165− where
166−
167− value2 = round $ sqrt (fromIntegral value :: Double)
168−
169−-------------------------------------------------------------------------------
170−-- Monadic outer product
171−-------------------------------------------------------------------------------
172−
173−{-# INLINE toNullAp #-}
174−toNullAp :: (Config -> Config) -> Int -> Int -> IO ()
175−toNullAp f linearCount start =
176− Stream.fold Fold.drain
177− $ Async.parApply f
178− (fmap (+) (sourceUnfoldrM nestedCount2 start))
179− (sourceUnfoldrM nestedCount2 start)
180−
181− where
182−
183− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
184−
185−o_1_space_outerProduct :: Int -> (Config -> Config) -> [Benchmark]
186−o_1_space_outerProduct value f =
187− [ bgroup "monad-outer-product"
188− [ benchIO "toNullAp" $ toNullAp f value
189− ]
190− ]
191−
192−-------------------------------------------------------------------------------
193−-- Benchmark sets
194−-------------------------------------------------------------------------------
195−
196−allBenchmarks :: String -> Bool -> (Config -> Config) -> Int -> [Benchmark]
197−allBenchmarks moduleName wide modifier value =
198− [ bgroup (o_1_space_prefix moduleName) $ concat
199− [ o_1_space_mapping value modifier
200− , o_1_space_concatFoldable value modifier
201− , o_1_space_concatMap value modifier
202− , o_1_space_joining value modifier
203− ] ++ if wide then [] else o_1_space_outerProduct value modifier
204− , bgroup (o_n_heap_prefix moduleName) $ concat
205− [ if wide then o_1_space_outerProduct value modifier else []
206− , o_n_heap_buffering value modifier
207− ]
208− ]
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentEager.hsdeleted−25
@@ -1,25 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−-- |
3−-- Module : Main
4−-- Copyright : (c) 2018 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−
9−import Stream.ConcurrentCommon (allBenchmarks)
10−import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
11−
12−import qualified Streamly.Internal.Data.Stream.Prelude as Async
13−
14−moduleName :: String
15−moduleName = "Data.Stream.ConcurrentEager"
16−
17−-------------------------------------------------------------------------------
18−-- Main
19−-------------------------------------------------------------------------------
20−
21−main :: IO ()
22−main =
23− runWithCLIOpts
24− defaultStreamSize
25− (allBenchmarks moduleName True (Async.eager True))
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentInterleaved.hsdeleted−25
@@ -1,25 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−-- |
3−-- Module : Main
4−-- Copyright : (c) 2022 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−
9−import Stream.ConcurrentCommon (allBenchmarks)
10−import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
11−
12−import qualified Streamly.Internal.Data.Stream.Prelude as Async
13−
14−moduleName :: String
15−moduleName = "Data.Stream.ConcurrentInterleaved"
16−
17−-------------------------------------------------------------------------------
18−-- Main
19−-------------------------------------------------------------------------------
20−
21−main :: IO ()
22−main =
23− runWithCLIOpts
24− defaultStreamSize
25− (allBenchmarks moduleName True (Async.interleaved True))
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentOrdered.hsdeleted−25
@@ -1,25 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−-- |
3−-- Module : Main
4−-- Copyright : (c) 2018 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−
9−import Stream.ConcurrentCommon (allBenchmarks)
10−import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
11−
12−import qualified Streamly.Internal.Data.Stream.Prelude as Async
13−
14−moduleName :: String
15−moduleName = "Data.Stream.ConcurrentOrdered"
16−
17−-------------------------------------------------------------------------------
18−-- Main
19−-------------------------------------------------------------------------------
20−
21−main :: IO ()
22−main =
23− runWithCLIOpts
24− defaultStreamSize
25− (allBenchmarks moduleName False (Async.ordered True))
benchmark/Streamly/Benchmark/Data/Stream/Exceptions.hsdeleted−371
@@ -1,371 +0,0 @@
1−-- |
2−-- Module : Stream.Exceptions
3−-- Copyright : (c) 2019 Composewell Technologies
4−-- License : BSD-3-Clause
5−-- Maintainer : streamly@composewell.com
6−-- Stability : experimental
7−-- Portability : GHC
8−
9−{-# LANGUAGE CPP #-}
10−{-# LANGUAGE FlexibleContexts #-}
11−{-# LANGUAGE ScopedTypeVariables #-}
12−
13−#ifdef USE_PRELUDE
14−{-# OPTIONS_GHC -Wno-deprecations #-}
15−#endif
16−
17−#ifdef __HADDOCK_VERSION__
18−#undef INSPECTION
19−#endif
20−
21−#ifdef INSPECTION
22−{-# LANGUAGE TemplateHaskell #-}
23−{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
24−#endif
25−
26−module Stream.Exceptions (benchmarks) where
27−
28−import Control.Exception (Exception, throwIO)
29−import Stream.Common (drain)
30−
31−import qualified Data.IORef as Ref
32−import qualified Data.Map.Strict as Map
33−
34−import Control.Exception (SomeException)
35−import System.IO (Handle, hClose, hPutChar)
36−import qualified Streamly.FileSystem.Handle as FH
37−import qualified Streamly.Internal.FileSystem.Handle as IFH
38−import qualified Streamly.Internal.Data.Unfold as IUF
39−import qualified Streamly.Internal.Data.Unfold.Prelude as IUF
40−
41−#ifdef USE_PRELUDE
42−import qualified Streamly.Internal.Data.Stream.IsStream as Stream
43−#else
44−import qualified Streamly.Internal.Data.Stream as Stream
45−import qualified Streamly.Internal.Data.Stream.Prelude as Stream
46−#endif
47−
48−import Test.Tasty.Bench hiding (env)
49−import Prelude hiding (last, length)
50−import Streamly.Benchmark.Common
51−import Streamly.Benchmark.Common.Handle
52−
53−#ifdef INSPECTION
54−import Control.Monad.Catch (MonadCatch)
55−import Test.Inspection
56−
57−import qualified Streamly.Internal.Data.Stream as D
58−#endif
59−
60−#ifdef USE_PRELUDE
61−type Stream = Stream.SerialT
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
71−
72−afterUnsafe :: IO b -> Stream IO a -> Stream IO 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
75−#ifdef USE_PRELUDE
76−afterUnsafe = Stream.after_
77−finallyUnsafe = Stream.finally_
78−bracketUnsafe = Stream.bracket_
79−#else
80−afterUnsafe = Stream.afterUnsafe
81−finallyUnsafe = Stream.finallyUnsafe
82−bracketUnsafe = Stream.bracketUnsafe
83−#endif
84−
85−-------------------------------------------------------------------------------
86−-- stream exceptions
87−-------------------------------------------------------------------------------
88−
89−data BenchException
90− = BenchException1
91− | BenchException2
92− deriving (Show, Eq, Ord)
93−
94−instance Exception BenchException
95−
96−retryNoneSimple :: Int -> Int -> IO ()
97−retryNoneSimple length from =
98− drain
99− $ Stream.retry
100− (Map.singleton BenchException1 length)
101− (const Stream.nil)
102− source
103−
104− where
105−
106− source = Stream.enumerateFromTo from (from + length)
107−
108−retryNone :: Int -> Int -> IO ()
109−retryNone length from = do
110− ref <- Ref.newIORef (0 :: Int)
111− drain
112− $ Stream.retry (Map.singleton BenchException1 length) (const Stream.nil)
113− $ source ref
114−
115− where
116−
117− source ref =
118− Stream.replicateM (from + length)
119− $ Ref.modifyIORef' ref (+ 1) >> Ref.readIORef ref
120−
121−retryAll :: Int -> Int -> IO ()
122−retryAll length from = do
123− ref <- Ref.newIORef 0
124− drain
125− $ Stream.retry
126− (Map.singleton BenchException1 (length + from)) (const Stream.nil)
127− $ source ref
128−
129− where
130−
131− source ref =
132− Stream.fromEffect
133− $ do
134− Ref.modifyIORef' ref (+ 1)
135− val <- Ref.readIORef ref
136− if val >= length
137− then return length
138− else throwIO BenchException1
139−
140−retryUnknown :: Int -> Int -> IO ()
141−retryUnknown length from = do
142− drain
143− $ Stream.retry (Map.singleton BenchException1 length) (const source)
144− $ throwIO BenchException2 `Stream.before` Stream.nil
145−
146− where
147−
148− source = Stream.enumerateFromTo from (from + length)
149−
150−
151−o_1_space_serial_exceptions :: Int -> [Benchmark]
152−o_1_space_serial_exceptions length =
153− [ bgroup
154− "exceptions/serial"
155− [ benchIOSrc1 "retryNoneSimple" (retryNoneSimple length)
156− , benchIOSrc1 "retryNone" (retryNone length)
157− , benchIOSrc1 "retryAll" (retryAll length)
158− , benchIOSrc1 "retryUnknown" (retryUnknown length)
159− ]
160− ]
161−
162−-- XXX Move these to FileSystem.Handle benchmarks
163−
164−-------------------------------------------------------------------------------
165−-- copy stream exceptions
166−-------------------------------------------------------------------------------
167−
168−-- | Send the file contents to /dev/null with exception handling
169−readWriteOnExceptionStream :: Handle -> Handle -> IO ()
170−readWriteOnExceptionStream inh devNull =
171− let readEx = Stream.onException (hClose inh) (Stream.unfold FH.reader inh)
172− in Stream.fold (FH.write devNull) readEx
173−
174−#ifdef INSPECTION
175−inspect $ hasNoTypeClasses 'readWriteOnExceptionStream
176−#endif
177−
178−-- | Send the file contents to /dev/null with exception handling
179−readWriteHandleExceptionStream :: Handle -> Handle -> IO ()
180−readWriteHandleExceptionStream inh devNull =
181− let handler (_e :: SomeException) =
182− return $ Stream.fromEffect (hClose inh >> return 10)
183− readEx = Stream.handle handler (Stream.unfold FH.reader inh)
184− in Stream.fold (FH.write devNull) readEx
185−
186−#ifdef INSPECTION
187−inspect $ hasNoTypeClasses 'readWriteHandleExceptionStream
188−#endif
189−
190−-- | Send the file contents to /dev/null with exception handling
191−readWriteFinally_Stream :: Handle -> Handle -> IO ()
192−readWriteFinally_Stream inh devNull =
193− let readEx =
194− finallyUnsafe (hClose inh) (Stream.unfold FH.reader inh)
195− in Stream.fold (FH.write devNull) readEx
196−
197−#ifdef INSPECTION
198−inspect $ hasNoTypeClasses 'readWriteFinally_Stream
199−#endif
200−
201−readWriteFinallyStream :: Handle -> Handle -> IO ()
202−readWriteFinallyStream inh devNull =
203− let readEx = Stream.finally (hClose inh) (Stream.unfold FH.reader inh)
204− in Stream.fold (FH.write devNull) readEx
205−
206−-- | Send the file contents to /dev/null with exception handling
207−fromToBytesBracket_Stream :: Handle -> Handle -> IO ()
208−fromToBytesBracket_Stream inh devNull =
209− let readEx = bracketUnsafe (return ()) (\_ -> hClose inh)
210− (\_ -> fromStreamD $ IFH.read inh)
211− in IFH.putBytes devNull (toStreamD readEx)
212−
213−#ifdef INSPECTION
214−inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
215−#endif
216−
217−fromToBytesBracketStream :: Handle -> Handle -> IO ()
218−fromToBytesBracketStream inh devNull =
219− let readEx = Stream.bracket (return ()) (\_ -> hClose inh)
220− (\_ -> fromStreamD $ IFH.read inh)
221− in IFH.putBytes devNull (toStreamD readEx)
222−
223−readWriteBeforeAfterStream :: Handle -> Handle -> IO ()
224−readWriteBeforeAfterStream inh devNull =
225− let readEx =
226− Stream.after (hClose inh)
227− $ Stream.before (hPutChar devNull 'A') (Stream.unfold FH.reader inh)
228− in Stream.fold (FH.write devNull) readEx
229−
230−#ifdef INSPECTION
231−inspect $ 'readWriteBeforeAfterStream `hasNoType` ''D.Step
232−#endif
233−
234−readWriteAfterStream :: Handle -> Handle -> IO ()
235−readWriteAfterStream inh devNull =
236− let readEx = Stream.after (hClose inh) (Stream.unfold FH.reader inh)
237− in Stream.fold (FH.write devNull) readEx
238−
239−#ifdef INSPECTION
240−inspect $ 'readWriteAfterStream `hasNoType` ''D.Step
241−#endif
242−
243−readWriteAfter_Stream :: Handle -> Handle -> IO ()
244−readWriteAfter_Stream inh devNull =
245− let readEx = afterUnsafe (hClose inh) (Stream.unfold FH.reader inh)
246− in Stream.fold (FH.write devNull) readEx
247−
248−#ifdef INSPECTION
249−inspect $ hasNoTypeClasses 'readWriteAfter_Stream
250−inspect $ 'readWriteAfter_Stream `hasNoType` ''D.Step
251−#endif
252−
253−o_1_space_copy_stream_exceptions :: BenchEnv -> [Benchmark]
254−o_1_space_copy_stream_exceptions env =
255− [ bgroup "exceptions"
256− [ mkBenchSmall "Stream.onException" env $ \inh _ ->
257− readWriteOnExceptionStream inh (nullH env)
258− , mkBenchSmall "Stream.handle" env $ \inh _ ->
259− readWriteHandleExceptionStream inh (nullH env)
260− , mkBenchSmall "Stream.finally_" env $ \inh _ ->
261− readWriteFinally_Stream inh (nullH env)
262− , mkBenchSmall "Stream.finally" env $ \inh _ ->
263− readWriteFinallyStream inh (nullH env)
264− , mkBenchSmall "Stream.after . Stream.before" env $ \inh _ ->
265− readWriteBeforeAfterStream inh (nullH env)
266− , mkBenchSmall "Stream.after" env $ \inh _ ->
267− readWriteAfterStream inh (nullH env)
268− , mkBenchSmall "Stream.after_" env $ \inh _ ->
269− readWriteAfter_Stream inh (nullH env)
270− ]
271− , bgroup "exceptions/fromToBytes"
272− [ mkBenchSmall "Stream.bracket_" env $ \inh _ ->
273− fromToBytesBracket_Stream inh (nullH env)
274− , mkBenchSmall "Stream.bracket" env $ \inh _ ->
275− fromToBytesBracketStream inh (nullH env)
276− ]
277− ]
278−
279− -------------------------------------------------------------------------------
280−-- Exceptions readChunks
281−-------------------------------------------------------------------------------
282−
283−-- | Send the file contents to /dev/null with exception handling
284−readChunksOnException :: Handle -> Handle -> IO ()
285−readChunksOnException inh devNull =
286− let readEx = IUF.onException (\_ -> hClose inh) FH.chunkReader
287− in IUF.fold (IFH.writeChunks devNull) readEx inh
288−
289−#ifdef INSPECTION
290−#if __GLASGOW_HASKELL__ >= 906
291−inspect $ hasNoTypeClassesExcept 'readChunksOnException [''MonadCatch]
292−#else
293−inspect $ hasNoTypeClasses 'readChunksOnException
294−#endif
295−#endif
296−
297−-- | Send the file contents to /dev/null with exception handling
298−readChunksBracket_ :: Handle -> Handle -> IO ()
299−readChunksBracket_ inh devNull =
300− let readEx = IUF.bracket_ return (\_ -> hClose inh) FH.chunkReader
301− in IUF.fold (IFH.writeChunks devNull) readEx inh
302−
303−#ifdef INSPECTION
304−#if __GLASGOW_HASKELL__ >= 906
305−inspect $ hasNoTypeClassesExcept 'readChunksBracket_ [''MonadCatch]
306−#else
307−inspect $ hasNoTypeClasses 'readChunksBracket_
308−#endif
309−#endif
310−
311−readChunksBracket :: Handle -> Handle -> IO ()
312−readChunksBracket inh devNull =
313− let readEx = IUF.bracket return (\_ -> hClose inh) FH.chunkReader
314− in IUF.fold (IFH.writeChunks devNull) readEx inh
315−
316−o_1_space_copy_exceptions_readChunks :: BenchEnv -> [Benchmark]
317−o_1_space_copy_exceptions_readChunks env =
318− [ bgroup "exceptions/readChunks"
319− [ mkBench "UF.onException" env $ \inH _ ->
320− readChunksOnException inH (nullH env)
321− , mkBench "UF.bracket_" env $ \inH _ ->
322− readChunksBracket_ inH (nullH env)
323− , mkBench "UF.bracket" env $ \inH _ ->
324− readChunksBracket inH (nullH env)
325− ]
326− ]
327−
328−-------------------------------------------------------------------------------
329−-- Exceptions toChunks
330−-------------------------------------------------------------------------------
331−
332−-- | Send the file contents to /dev/null with exception handling
333−toChunksBracket_ :: Handle -> Handle -> IO ()
334−toChunksBracket_ inh devNull =
335− let readEx = bracketUnsafe
336− (return ())
337− (\_ -> hClose inh)
338− (\_ -> fromStreamD $ IFH.readChunks inh)
339− in Stream.fold (IFH.writeChunks devNull) readEx
340−
341−#ifdef INSPECTION
342−inspect $ hasNoTypeClasses 'toChunksBracket_
343−#endif
344−
345−toChunksBracket :: Handle -> Handle -> IO ()
346−toChunksBracket inh devNull =
347− let readEx = Stream.bracket
348− (return ())
349− (\_ -> hClose inh)
350− (\_ -> fromStreamD $ IFH.readChunks inh)
351− in Stream.fold (IFH.writeChunks devNull) readEx
352−
353−o_1_space_copy_exceptions_toChunks :: BenchEnv -> [Benchmark]
354−o_1_space_copy_exceptions_toChunks env =
355− [ bgroup "exceptions/toChunks"
356− [ mkBench "Stream.bracket_" env $ \inH _ ->
357− toChunksBracket_ inH (nullH env)
358− , mkBench "Stream.bracket" env $ \inH _ ->
359− toChunksBracket inH (nullH env)
360− ]
361− ]
362−
363−benchmarks :: String -> BenchEnv -> Int -> [Benchmark]
364−benchmarks moduleName _env size =
365− [ bgroup (o_1_space_prefix moduleName) $ concat
366− [ o_1_space_serial_exceptions size
367− , o_1_space_copy_exceptions_readChunks _env
368− , o_1_space_copy_exceptions_toChunks _env
369− , o_1_space_copy_stream_exceptions _env
370− ]
371− ]
benchmark/Streamly/Benchmark/Data/Stream/Generate.hsdeleted−278
@@ -1,278 +0,0 @@
1−-- |
2−-- Module : Stream.Generate
3−-- Copyright : (c) 2018 Composewell Technologies
4−-- License : BSD-3-Clause
5−-- Maintainer : streamly@composewell.com
6−
7−{-# LANGUAGE CPP #-}
8−{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE FlexibleInstances #-}
10−{-# LANGUAGE ScopedTypeVariables #-}
11−{-# LANGUAGE RankNTypes #-}
12−
13−{-# OPTIONS_GHC -Wno-orphans #-}
14−#ifdef USE_PRELUDE
15−{-# OPTIONS_GHC -Wno-deprecations #-}
16−#endif
17−
18−module Stream.Generate (benchmarks) where
19−
20−import Control.DeepSeq (NFData(..))
21−import Data.Functor.Identity (Identity(..))
22−
23−import qualified GHC.Exts as GHC
24−import qualified Streamly.Internal.Data.Fold as Fold
25−
26−#ifdef USE_PRELUDE
27−import Streamly.Prelude (MonadAsync)
28−import Stream.Common hiding (MonadAsync)
29−import Streamly.Benchmark.Prelude (sourceFromFoldableM, absTimes)
30−import qualified Streamly.Prelude as S
31−import qualified Streamly.Internal.Data.Stream.IsStream as Stream
32−#else
33−import Stream.Common
34−import Streamly.Internal.Data.Stream (Stream)
35−import qualified Streamly.Internal.Data.Stream as Stream
36−#ifdef USE_STREAMK
37−import System.IO.Unsafe (unsafeInterleaveIO)
38−import qualified Streamly.Internal.Data.StreamK as StreamK
39−import qualified Stream.Common as Common
40−#endif
41−#endif
42−
43−import Test.Tasty.Bench
44−import Streamly.Benchmark.Common
45−import qualified Prelude
46−
47−import Prelude hiding (repeat, replicate, iterate)
48−
49−-------------------------------------------------------------------------------
50−-- Generation
51−-------------------------------------------------------------------------------
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−
61−-------------------------------------------------------------------------------
62−-- fromList
63−-------------------------------------------------------------------------------
64−
65−{-# INLINE sourceFromList #-}
66−sourceFromList :: Monad m => Int -> Int -> Stream m Int
67−sourceFromList value n = Stream.fromList [n..n+value]
68−
69−{-# INLINE sourceFromListM #-}
70−sourceFromListM :: MonadAsync m => Int -> Int -> Stream m Int
71−sourceFromListM value n = fromListM (fmap return [n..n+value])
72−
73−{-# INLINE sourceIsList #-}
74−sourceIsList :: Int -> Int -> Stream Identity Int
75−sourceIsList value n = GHC.fromList [n..n+value]
76−
77−{-# INLINE sourceIsString #-}
78−sourceIsString :: Int -> Int -> Stream Identity Char
79−sourceIsString value n = GHC.fromString (Prelude.replicate (n + value) 'a')
80−
81−{-# INLINE readInstance #-}
82−readInstance :: String -> Stream Identity Int
83−readInstance str =
84− let r = reads str
85− in case r of
86− [(x,"")] -> x
87− _ -> error "readInstance: no parse"
88−
89−-- For comparisons
90−{-# INLINE readInstanceList #-}
91−readInstanceList :: String -> [Int]
92−readInstanceList str =
93− let r = reads str
94− in case r of
95− [(x,"")] -> x
96− _ -> error "readInstance: no parse"
97−
98−{-# INLINE repeat #-}
99−repeat :: Monad m => Int -> Int -> Stream m Int
100−repeat count = Stream.take count . Stream.repeat
101−
102−{-# INLINE replicate #-}
103−replicate :: Monad m => Int -> Int -> Stream m Int
104−replicate = Stream.replicate
105−
106−-------------------------------------------------------------------------------
107−-- enumerate
108−-------------------------------------------------------------------------------
109−
110−{-# INLINE sourceIntFromTo #-}
111−sourceIntFromTo :: Monad m => Int -> Int -> Stream m Int
112−sourceIntFromTo value n = Stream.enumerateFromTo n (n + value)
113−
114−{-# INLINE sourceIntFromThenTo #-}
115−sourceIntFromThenTo :: Monad m => Int -> Int -> Stream m Int
116−sourceIntFromThenTo value n = Stream.enumerateFromThenTo n (n + 1) (n + value)
117−
118−{-# INLINE sourceFracFromTo #-}
119−sourceFracFromTo :: Monad m => Int -> Int -> Stream m Double
120−sourceFracFromTo value n =
121− Stream.enumerateFromTo (fromIntegral n) (fromIntegral (n + value))
122−
123−{-# INLINE sourceFracFromThenTo #-}
124−sourceFracFromThenTo :: Monad m => Int -> Int -> Stream m Double
125−sourceFracFromThenTo value n = Stream.enumerateFromThenTo (fromIntegral n)
126− (fromIntegral n + 1.0001) (fromIntegral (n + value))
127−
128−{-# INLINE sourceIntegerFromStep #-}
129−sourceIntegerFromStep :: Monad m => Int -> Int -> Stream m Integer
130−sourceIntegerFromStep value n =
131− Stream.take value $ Stream.enumerateFromThen (fromIntegral n) (fromIntegral n + 1)
132−
133−{-# INLINE enumerateFrom #-}
134−enumerateFrom :: Monad m => Int -> Int -> Stream m Int
135−enumerateFrom count = Stream.take count . Stream.enumerateFrom
136−
137−{-# INLINE enumerateFromTo #-}
138−enumerateFromTo :: Monad m => Int -> Int -> Stream m Int
139−enumerateFromTo = sourceIntFromTo
140−
141−{-# INLINE enumerateFromThen #-}
142−enumerateFromThen :: Monad m => Int -> Int -> Stream m Int
143−enumerateFromThen count inp = Stream.take count $ Stream.enumerateFromThen inp (inp + 1)
144−
145−{-# INLINE enumerateFromThenTo #-}
146−enumerateFromThenTo :: Monad m => Int -> Int -> Stream m Int
147−enumerateFromThenTo = sourceIntFromThenTo
148−
149−-- n ~ 1
150−{-# INLINE enumerate #-}
151−enumerate :: Monad m => Int -> Int -> Stream m Int
152−enumerate count n = Stream.take (count + n) Stream.enumerate
153−
154−-- n ~ 1
155−{-# INLINE enumerateTo #-}
156−enumerateTo :: Monad m => Int -> Int -> Stream m Int
157−enumerateTo count n = Stream.enumerateTo (minBound + count + n)
158−
159−{-# INLINE iterate #-}
160−iterate :: Monad m => Int -> Int -> Stream m Int
161−iterate count = Stream.take count . Stream.iterate (+1)
162−
163−{-# INLINE iterateM #-}
164−iterateM :: MonadAsync m => Int -> Int -> Stream m Int
165−iterateM count = Stream.take count . Stream.iterateM (return . (+1)) . return
166−
167−{-# INLINE repeatM #-}
168−repeatM :: MonadAsync m => Int -> Int -> Stream m Int
169−repeatM count = Stream.take count . Stream.repeatM . return
170−
171−{-# INLINE replicateM #-}
172−replicateM :: MonadAsync m => Int -> Int -> Stream m Int
173−replicateM count = Stream.replicateM count . return
174−
175−#ifdef USE_PRELUDE
176−{-# INLINE fromIndices #-}
177−fromIndices :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
178−fromIndices value n = S.take value $ S.fromIndices (+ n)
179−
180−{-# INLINE fromIndicesM #-}
181−fromIndicesM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
182−fromIndicesM value n = S.take value $ S.fromIndicesM (return <$> (+ n))
183−#endif
184−
185−#ifdef USE_STREAMK
186−{-# INLINE mfixUnfold #-}
187−mfixUnfold :: Int -> Int -> Stream IO (Int, Int)
188−mfixUnfold count start = toStream $ StreamK.mfix f
189− where
190− f action = StreamK.unCross $ do
191− let incr n act = fmap ((+n) . snd) $ unsafeInterleaveIO act
192− x <- StreamK.mkCross (fromStream $ Common.fromListM [incr 1 action, incr 2 action])
193− y <- StreamK.mkCross (fromStream $ Common.sourceUnfoldr count start)
194− return (x, y)
195−#endif
196−
197−o_1_space_generation :: Int -> [Benchmark]
198−o_1_space_generation value =
199− [ bgroup "generation"
200− [ benchIOSrc "unfoldr" (sourceUnfoldr value)
201− , benchIOSrc "unfoldrM" (sourceUnfoldrM value)
202− , benchIOSrc "repeat" (repeat value)
203− , benchIOSrc "replicate" (replicate value)
204− , benchIOSrc "iterate" (iterate value)
205− , benchIOSrc "iterateM" (iterateM value)
206− , benchIOSrc "intFromTo" (sourceIntFromTo value)
207− , benchIOSrc "intFromThenTo" (sourceIntFromThenTo value)
208− , benchIOSrc "integerFromStep" (sourceIntegerFromStep value)
209− , benchIOSrc "fracFromThenTo" (sourceFracFromThenTo value)
210− , benchIOSrc "fracFromTo" (sourceFracFromTo value)
211− , benchIOSrc "fromList" (sourceFromList value)
212− , benchIOSrc "fromListM" (sourceFromListM value)
213− , benchPureSrc "IsList.fromList" (toStreamD . sourceIsList value)
214− , benchPureSrc "IsString.fromString" (toStreamD . sourceIsString value)
215− , benchIOSrc "enumerateFrom" (enumerateFrom value)
216− , benchIOSrc "enumerateFromTo" (enumerateFromTo value)
217− , benchIOSrc "enumerateFromThen" (enumerateFromThen value)
218− , benchIOSrc "enumerateFromThenTo" (enumerateFromThenTo value)
219− , benchIOSrc "enumerate" (enumerate value)
220− , benchIOSrc "enumerateTo" (enumerateTo value)
221− , benchIOSrc "repeatM" (repeatM value)
222− , benchIOSrc "replicateM" (replicateM value)
223−#ifdef USE_PRELUDE
224− , benchIOSrc "fromIndices" (fromIndices value)
225− , benchIOSrc "fromIndicesM" (fromIndicesM value)
226−#endif
227−
228− -- These essentially test cons and consM
229−#ifdef USE_STREAMK
230− , benchIOSrc "fromFoldable" (sourceFromFoldable value)
231− -- , benchIOSrc "fromFoldable 16" (sourceFromFoldable 16)
232−#else
233− -- , benchIOSrc "fromFoldable 16" (sourceFromFoldable 16)
234−#endif
235−
236−#ifdef USE_PRELUDE
237− , benchIOSrc "fromFoldableM" (sourceFromFoldableM value)
238− , benchIOSrc "absTimes" $ absTimes value
239−#endif
240−#ifdef USE_STREAMK
241− , Common.benchIOSrc "mfix_10" (mfixUnfold 10)
242− , Common.benchIOSrc "mfix_100" (mfixUnfold 100)
243− , Common.benchIOSrc "mfix_1000" (mfixUnfold 1000)
244−#endif
245− ]
246− ]
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−
254−o_n_heap_generation :: Int -> [Benchmark]
255−o_n_heap_generation value =
256− [ bgroup "buffered"
257− -- Buffers the output of show/read.
258− -- XXX can the outputs be streaming? Can we have special read/show
259− -- style type classes, readM/showM supporting streaming effects?
260− [ bench "readsPrec pure streams" $
261− nf readInstance (mkString value)
262− , bench "readsPrec Haskell lists" $
263− nf readInstanceList (mkListString value)
264− ]
265− ]
266−
267−-------------------------------------------------------------------------------
268−-- Main
269−-------------------------------------------------------------------------------
270−
271−-- In addition to gauge options, the number of elements in the stream can be
272−-- passed using the --stream-size option.
273−--
274−benchmarks :: String -> Int -> [Benchmark]
275−benchmarks moduleName size =
276− [ bgroup (o_1_space_prefix moduleName) (o_1_space_generation size)
277− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_generation size)
278− ]
benchmark/Streamly/Benchmark/Data/Stream/Lift.hsdeleted−146
@@ -1,146 +0,0 @@
1−-- |
2−-- Module : Stream.Lift
3−-- Copyright : (c) 2018 Composewell Technologies
4−-- License : BSD-3-Clause
5−-- Maintainer : streamly@composewell.com
6−
7−{-# LANGUAGE CPP #-}
8−{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE ScopedTypeVariables #-}
10−{-# LANGUAGE RankNTypes #-}
11−
12−#ifdef USE_PRELUDE
13−{-# OPTIONS_GHC -Wno-deprecations #-}
14−#endif
15−
16−module Stream.Lift (benchmarks) where
17−
18−import Control.DeepSeq (NFData(..))
19−import Control.Monad.State.Strict (StateT, get, put)
20−import Data.Functor.Identity (Identity)
21−import Stream.Common (sourceUnfoldr, sourceUnfoldrM, benchIOSrc)
22−import System.Random (randomRIO)
23−
24−import qualified Stream.Common as Common
25−import qualified Streamly.Internal.Data.Fold as Fold
26−
27−#ifdef USE_PRELUDE
28−import qualified Streamly.Internal.Data.Stream.IsStream as Stream
29−#else
30−import Streamly.Internal.Data.Stream (Stream)
31−import qualified Streamly.Internal.Data.Stream as Stream
32−#ifdef USE_STREAMK
33−import Stream.Common (benchIO, drain)
34−import Streamly.Internal.Data.StreamK (StreamK)
35−import qualified Streamly.Internal.Data.StreamK as StreamK
36−import qualified Control.Monad.State.Strict as State
37−#endif
38−#endif
39−
40−import Test.Tasty.Bench
41−import Streamly.Benchmark.Common
42−import Prelude hiding (reverse, tail)
43−
44−#ifdef USE_PRELUDE
45−type Stream = Stream.SerialT
46−#endif
47−
48−-------------------------------------------------------------------------------
49−-- Monad transformation (hoisting etc.)
50−-------------------------------------------------------------------------------
51−
52−{-# INLINE sourceUnfoldrState #-}
53−sourceUnfoldrState :: Common.MonadAsync m =>
54− Int -> Int -> Stream (StateT Int m) Int
55−sourceUnfoldrState value n = Stream.unfoldrM step n
56− where
57− step cnt =
58− if cnt > n + value
59− then return Nothing
60− else do
61− s <- get
62− put (s + 1)
63− return (Just (s, cnt + 1))
64−
65−{-# INLINE evalStateT #-}
66−evalStateT :: Common.MonadAsync m => Int -> Int -> Stream m Int
67−evalStateT value n =
68− Stream.evalStateT (return 0) (sourceUnfoldrState value n)
69−
70−{-# INLINE withState #-}
71−withState :: Common.MonadAsync m => Int -> Int -> Stream m Int
72−withState value n =
73− Stream.evalStateT
74− (return (0 :: Int)) (Stream.liftInner (sourceUnfoldrM value n))
75−
76−{-# INLINE benchHoistSink #-}
77−benchHoistSink
78− :: (NFData b)
79− => Int -> String -> (Stream Identity Int -> IO b) -> Benchmark
80−benchHoistSink value name f =
81− bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldr value
82−
83−o_1_space_hoisting :: Int -> [Benchmark]
84−o_1_space_hoisting value =
85− [ bgroup "hoisting"
86− [ benchIOSrc "evalState" (evalStateT value)
87− , benchIOSrc "withState" (withState value)
88−#ifndef USE_PRELUDE
89− , benchHoistSink value "generalizeInner"
90− ((\xs -> Stream.fold Fold.length xs :: IO Int)
91− . Stream.generalizeInner)
92−#endif
93− ]
94− ]
95−
96−#ifdef USE_STREAMK
97−{-# INLINE iterateStateIO #-}
98−iterateStateIO ::
99− Monad m
100− => Int
101− -> StateT Int m Int
102−iterateStateIO n = do
103− x <- get
104− if x > n
105− then do
106− put (x - 1)
107− iterateStateIO n
108− else return x
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.
112−{-# INLINE iterateStateT #-}
113−iterateStateT :: Int -> StreamK (StateT Int IO) Int
114−iterateStateT n = StreamK.concatEffect $ do
115− x <- get
116− if x > n
117− then do
118− put (x - 1)
119− return $ iterateStateT n
120− else return $ StreamK.fromPure x
121−
122−o_n_heap_transformer :: Int -> [Benchmark]
123−o_n_heap_transformer value =
124− [ bgroup "transformer"
125− [ benchIO "StateT Int IO (n times) (baseline)" $ \n ->
126− State.evalStateT (iterateStateIO n) value
127− , benchIO "Stream (StateT Int IO) (n times)" $ \n ->
128− State.evalStateT (drain $ Common.toStream (iterateStateT n)) value
129− ]
130− ]
131−#endif
132−
133−-------------------------------------------------------------------------------
134−-- Main
135−-------------------------------------------------------------------------------
136−
137−-- In addition to gauge options, the number of elements in the stream can be
138−-- passed using the --stream-size option.
139−--
140−benchmarks :: String -> Int -> [Benchmark]
141−benchmarks moduleName 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)
145−#endif
146− ]
benchmark/Streamly/Benchmark/Data/Stream/Reduce.hsdeleted−588
@@ -1,588 +0,0 @@
1−-- |
2−-- Module : Stream.Reduce
3−-- Copyright : (c) 2018 Composewell Technologies
4−-- License : BSD-3-Clause
5−-- Maintainer : streamly@composewell.com
6−
7−{-# LANGUAGE CPP #-}
8−{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE ScopedTypeVariables #-}
10−{-# LANGUAGE DeriveAnyClass #-}
11−{-# LANGUAGE DeriveGeneric #-}
12−{-# LANGUAGE RankNTypes #-}
13−
14−#ifdef USE_PRELUDE
15−{-# OPTIONS_GHC -Wno-deprecations #-}
16−#endif
17−
18−module Stream.Reduce (benchmarks) where
19−
20−import Control.DeepSeq (NFData(..))
21−import Control.Monad.IO.Class (MonadIO(..))
22−import Data.Monoid (Sum(..))
23−import GHC.Generics (Generic)
24−
25−import qualified Streamly.Internal.Data.Refold.Type as Refold
26−import qualified Streamly.Internal.Data.Fold as FL
27−import qualified Stream.Common as Common
28−
29−#ifndef USE_STREAMLY_CORE
30−import Data.HashMap.Strict (HashMap)
31−import Data.Proxy (Proxy(..))
32−import Streamly.Internal.Data.IsMap.HashMap ()
33−#endif
34−
35−#ifdef USE_PRELUDE
36−import Control.Monad (when)
37−import qualified Streamly.Internal.Data.Stream.IsStream as S
38−import qualified Streamly.Prelude as S
39−import Streamly.Prelude (fromSerial)
40−import Streamly.Benchmark.Prelude hiding
41− ( benchIO, benchIOSrc, sourceUnfoldrM, apDiscardFst, apDiscardSnd, apLiftA2
42− , toNullAp, monadThen, toNullM, toNullM3, filterAllInM, filterAllOutM
43− , filterSome, breakAfterSome, toListM, toListSome, transformMapM
44− , transformComposeMapM, transformTeeMapM, transformZipMapM)
45−#else
46−
47−import Streamly.Internal.Data.Stream (Stream)
48−import qualified Streamly.Internal.Data.Stream as S
49−#ifndef USE_STREAMLY_CORE
50−import qualified Streamly.Data.Stream.Prelude as S
51−import qualified Streamly.Internal.Data.Stream.Prelude as S
52−#endif
53−
54−#ifdef USE_STREAMK
55−import Streamly.Internal.Data.StreamK (StreamK)
56−import qualified Streamly.Internal.Data.Parser as PR
57−import qualified Streamly.Internal.Data.StreamK as K
58−#else
59−import qualified Streamly.Internal.Data.Stream as K
60−#endif
61−
62−#endif
63−
64−import Test.Tasty.Bench
65−import Streamly.Benchmark.Common
66−import Stream.Common
67−import Prelude hiding (reverse, tail)
68−
69−#ifdef USE_PRELUDE
70−type Stream = S.SerialT
71−#endif
72−
73−-- Apply transformation g count times on a stream of length len
74−#ifdef USE_STREAMK
75−{-# INLINE iterateSource #-}
76−iterateSource ::
77− MonadAsync m
78− => (StreamK m Int -> StreamK m Int)
79− -> Int
80− -> Int
81− -> Int
82− -> StreamK m Int
83−iterateSource g count len n = f count (fromStream $ sourceUnfoldrM len n)
84−
85− where
86−
87− f (0 :: Int) stream = stream
88− f i stream = f (i - 1) (g stream)
89−#else
90−{-# INLINE iterateSource #-}
91−iterateSource ::
92− MonadAsync m
93− => (Stream m Int -> Stream m Int)
94− -> Int
95− -> Int
96− -> Int
97− -> Stream m Int
98−iterateSource g count len n = f count (sourceUnfoldrM len n)
99−
100− where
101−
102− f (0 :: Int) stream = stream
103− f i stream = f (i - 1) (g stream)
104−#endif
105−
106−-------------------------------------------------------------------------------
107−-- Grouping transformations
108−-------------------------------------------------------------------------------
109−
110−{-# INLINE groups #-}
111−groups :: MonadIO m => Stream m Int -> m ()
112−groups =
113−#ifdef USE_PRELUDE
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
127−
128−{-# INLINE groupsWhileEq #-}
129−groupsWhileEq :: MonadIO m => Stream m Int -> m ()
130−groupsWhileEq =
131−#ifdef USE_PRELUDE
132− Common.drain . S.groupsBy (==) FL.drain
133−#else
134− Common.drain . S.groupsWhile (==) FL.drain
135−#endif
136−
137−
138−{-# INLINE groupsByRollingLT #-}
139−groupsByRollingLT :: MonadIO m => Stream m Int -> m ()
140−groupsByRollingLT =
141−#ifdef USE_PRELUDE
142− Common.drain . S.groupsByRolling (<) FL.drain
143−#else
144− Common.drain . S.groupsRollingBy (<) FL.drain
145−#endif
146−
147−{-# INLINE groupsByRollingEq #-}
148−groupsByRollingEq :: MonadIO m => Stream m Int -> m ()
149−groupsByRollingEq =
150−#ifdef USE_PRELUDE
151− Common.drain . S.groupsByRolling (==) FL.drain
152−#else
153− Common.drain . S.groupsRollingBy (==) FL.drain
154−#endif
155−
156−{-# INLINE foldMany #-}
157−foldMany :: Monad m => Stream m Int -> m ()
158−foldMany =
159− Common.drain
160− . fmap getSum
161− . S.foldMany (FL.take 2 FL.mconcat)
162− . fmap Sum
163−
164−{-# INLINE foldManyPost #-}
165−foldManyPost :: Monad m => Stream m Int -> m ()
166−foldManyPost =
167− Common.drain
168− . fmap getSum
169− . S.foldManyPost (FL.take 2 FL.mconcat)
170− . fmap Sum
171−
172−{-# INLINE refoldMany #-}
173−refoldMany :: Monad m => Stream m Int -> m ()
174−refoldMany =
175− Common.drain
176− . fmap getSum
177− . S.refoldMany (Refold.take 2 Refold.sconcat) (return mempty)
178− . fmap Sum
179−
180−{-# INLINE foldIterateM #-}
181−foldIterateM :: Monad m => Stream m Int -> m ()
182−foldIterateM =
183− Common.drain
184− . fmap getSum
185− . S.foldIterateM
186− (return . FL.take 2 . FL.sconcat) (return (Sum 0))
187− . fmap Sum
188−
189−{-# INLINE refoldIterateM #-}
190−refoldIterateM :: Monad m => Stream m Int -> m ()
191−refoldIterateM =
192− Common.drain
193− . fmap getSum
194− . S.refoldIterateM
195− (Refold.take 2 Refold.sconcat) (return (Sum 0))
196− . fmap Sum
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−
208−o_1_space_grouping :: Int -> [Benchmark]
209−o_1_space_grouping value =
210− -- Buffering operations using heap proportional to group/window sizes.
211− [ bgroup "grouping"
212− [
213− benchIOSink value "groups" groups
214− , benchIOSink value "groupsWhileLT" groupsWhileLT
215− , benchIOSink value "groupsWhileEq" groupsWhileEq
216− , benchIOSink value "groupsByRollingLT" groupsByRollingLT
217− , benchIOSink value "groupsByRollingEq" groupsByRollingEq
218− ,
219−
220− -- XXX parseMany/parseIterate benchmarks are in the Parser/ParserD
221− -- modules we can bring those here. chunksOf benchmarks are in
222− -- Parser/ParserD/Array.Stream/FileSystem.Handle.
223− benchIOSink value "foldMany" foldMany
224− , benchIOSink value "foldManyPost" foldManyPost
225− , benchIOSink value "refoldMany" refoldMany
226− , benchIOSink value "foldIterateM" foldIterateM
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
242− ]
243− ]
244−
245−#ifndef USE_STREAMLY_CORE
246− where
247−
248− getKey :: Int -> Int -> Int
249− getKey n = (`mod` n)
250−#endif
251−
252−-------------------------------------------------------------------------------
253−-- Size conserving transformations (reordering, buffering, etc.)
254−-------------------------------------------------------------------------------
255−
256−#ifndef USE_PRELUDE
257−{-# INLINE reverse #-}
258−reverse :: MonadIO m => Int -> Stream m Int -> m ()
259−reverse n = composeN n (toStream . K.reverse . fromStream)
260−
261−{-# INLINE reverse' #-}
262−reverse' :: MonadIO m => Int -> Stream m Int -> m ()
263−reverse' n = composeN n S.reverseUnbox
264−#endif
265−
266−o_n_heap_buffering :: Int -> [Benchmark]
267−o_n_heap_buffering value =
268− [ bgroup "buffered"
269− [
270−#ifndef USE_PRELUDE
271− -- Reversing a stream
272− benchIOSink value "reverse" (reverse 1)
273− , benchIOSink value "reverse'" (reverse' 1)
274−#else
275− benchIOSink value "mkAsync" (mkAsync fromSerial)
276−#endif
277− ]
278− ]
279−
280−-------------------------------------------------------------------------------
281−-- Grouping/Splitting
282−-------------------------------------------------------------------------------
283−
284−#ifndef USE_STREAMLY_CORE
285−{-# INLINE classifySessionsOf #-}
286−classifySessionsOf :: S.MonadAsync m => (Int -> Int) -> Stream m Int -> m ()
287−classifySessionsOf getKey =
288− Common.drain
289− . S.classifySessionsOf
290− (const (return False)) 3 (FL.take 10 FL.sum)
291− . S.timestamped
292− . fmap (\x -> (getKey x, x))
293−
294−{-# INLINE classifySessionsOfHash #-}
295−classifySessionsOfHash :: S.MonadAsync m =>
296− (Int -> Int) -> Stream m Int -> m ()
297−classifySessionsOfHash getKey =
298− Common.drain
299− . S.classifySessionsByGeneric
300− (Proxy :: Proxy (HashMap k))
301− 1 False (const (return False)) 3 (FL.take 10 FL.sum)
302− . S.timestamped
303− . fmap (\x -> (getKey x, x))
304−#endif
305−
306−-------------------------------------------------------------------------------
307−-- Mixed Transformation
308−-------------------------------------------------------------------------------
309−
310−{-# INLINE scanMap #-}
311−scanMap :: MonadIO m => Int -> Stream m Int -> m ()
312−scanMap n = composeN n $ fmap (subtract 1) . Common.scanl' (+) 0
313−
314−{-# INLINE dropMap #-}
315−dropMap :: MonadIO m => Int -> Stream m Int -> m ()
316−dropMap n = composeN n $ fmap (subtract 1) . S.drop 1
317−
318−{-# INLINE dropScan #-}
319−dropScan :: MonadIO m => Int -> Stream m Int -> m ()
320−dropScan n = composeN n $ Common.scanl' (+) 0 . S.drop 1
321−
322−{-# INLINE takeDrop #-}
323−takeDrop :: MonadIO m => Int -> Int -> Stream m Int -> m ()
324−takeDrop value n = composeN n $ S.drop 1 . S.take (value + 1)
325−
326−{-# INLINE takeScan #-}
327−takeScan :: MonadIO m => Int -> Int -> Stream m Int -> m ()
328−takeScan value n = composeN n $ Common.scanl' (+) 0 . S.take (value + 1)
329−
330−{-# INLINE takeMap #-}
331−takeMap :: MonadIO m => Int -> Int -> Stream m Int -> m ()
332−takeMap value n = composeN n $ fmap (subtract 1) . S.take (value + 1)
333−
334−{-# INLINE filterDrop #-}
335−filterDrop :: MonadIO m => Int -> Int -> Stream m Int -> m ()
336−filterDrop value n = composeN n $ S.drop 1 . S.filter (<= (value + 1))
337−
338−{-# INLINE filterTake #-}
339−filterTake :: MonadIO m => Int -> Int -> Stream m Int -> m ()
340−filterTake value n = composeN n $ S.take (value + 1) . S.filter (<= (value + 1))
341−
342−{-# INLINE filterScan #-}
343−filterScan :: MonadIO m => Int -> Stream m Int -> m ()
344−filterScan n = composeN n $ Common.scanl' (+) 0 . S.filter (<= maxBound)
345−
346−#ifdef USE_PRELUDE
347−{-# INLINE filterScanl1 #-}
348−filterScanl1 :: MonadIO m => Int -> Stream m Int -> m ()
349−filterScanl1 n = composeN n $ S.scanl1' (+) . S.filter (<= maxBound)
350−#endif
351−
352−{-# INLINE filterMap #-}
353−filterMap :: MonadIO m => Int -> Int -> Stream m Int -> m ()
354−filterMap value n = composeN n $ fmap (subtract 1) . S.filter (<= (value + 1))
355−
356−-------------------------------------------------------------------------------
357−-- Scan and fold
358−-------------------------------------------------------------------------------
359−
360−data Pair a b =
361− Pair !a !b
362− deriving (Generic, NFData)
363−
364−{-# INLINE sumProductFold #-}
365−sumProductFold :: Monad m => Stream m Int -> m (Pair Int Int)
366−sumProductFold =
367− Common.foldl' (\(Pair s p) x -> Pair (s + x) (p * x)) (Pair 0 1)
368−
369−{-# INLINE sumProductScan #-}
370−sumProductScan :: Monad m => Stream m Int -> m (Pair Int Int)
371−sumProductScan =
372− Common.foldl' (\(Pair _ p) (s0, x) -> Pair s0 (p * x)) (Pair 0 1) .
373− Common.scanl' (\(s, _) x -> (s + x, x)) (0, 0)
374−
375−{-# INLINE foldl'ReduceMap #-}
376−foldl'ReduceMap :: Monad m => Stream m Int -> m Int
377−foldl'ReduceMap = fmap (+ 1) . Common.foldl' (+) 0
378−
379−o_1_space_transformations_mixed :: Int -> [Benchmark]
380−o_1_space_transformations_mixed value =
381− -- scanl-map and foldl-map are equivalent to the scan and fold in the foldl
382− -- library. If scan/fold followed by a map is efficient enough we may not
383− -- need monolithic implementations of these.
384− [ bgroup "mixed"
385− [ benchIOSink value "scanl-map" (scanMap 1)
386− , benchIOSink value "foldl-map" foldl'ReduceMap
387− , benchIOSink value "sum-product-fold" sumProductFold
388− , benchIOSink value "sum-product-scan" sumProductScan
389− ]
390− ]
391−
392−o_1_space_transformations_mixedX4 :: Int -> [Benchmark]
393−o_1_space_transformations_mixedX4 value =
394− [ bgroup "mixedX4"
395− [ benchIOSink value "scan-map" (scanMap 4)
396− , benchIOSink value "drop-map" (dropMap 4)
397− , benchIOSink value "drop-scan" (dropScan 4)
398− , benchIOSink value "take-drop" (takeDrop value 4)
399− , benchIOSink value "take-scan" (takeScan value 4)
400− , benchIOSink value "take-map" (takeMap value 4)
401− , benchIOSink value "filter-drop" (filterDrop value 4)
402− , benchIOSink value "filter-take" (filterTake value 4)
403− , benchIOSink value "filter-scan" (filterScan 4)
404−#ifdef USE_PRELUDE
405− , benchIOSink value "filter-scanl1" (filterScanl1 4)
406−#endif
407− , benchIOSink value "filter-map" (filterMap value 4)
408− ]
409− ]
410−
411−-------------------------------------------------------------------------------
412−-- Iterating a transformation over and over again
413−-------------------------------------------------------------------------------
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−
455−-- this is quadratic
456−{-# INLINE iterateScan #-}
457−iterateScan :: MonadAsync m => Int -> Int -> Int -> Stream m Int
458−iterateScan = iterateSource (Common.scanl' (+) 0)
459−
460−#ifdef USE_PRELUDE
461−-- this is quadratic
462−{-# INLINE iterateScanl1 #-}
463−iterateScanl1 :: MonadAsync m => Int -> Int -> Int -> Stream m Int
464−iterateScanl1 = iterateSource (S.scanl1' (+))
465−#endif
466−
467−{-# INLINE iterateMapM #-}
468−iterateMapM :: MonadAsync m => Int -> Int -> Int -> Stream m Int
469−iterateMapM = iterateSource (S.mapM return)
470−
471−{-# INLINE iterateFilterEven #-}
472−iterateFilterEven :: MonadAsync m => Int -> Int -> Int -> Stream m Int
473−iterateFilterEven = iterateSource (S.filter even)
474−
475−{-# INLINE iterateTakeAll #-}
476−iterateTakeAll :: MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
477−iterateTakeAll value = iterateSource (S.take (value + 1))
478−
479−{-# INLINE iterateDropOne #-}
480−iterateDropOne :: MonadAsync m => Int -> Int -> Int -> Stream m Int
481−iterateDropOne = iterateSource (S.drop 1)
482−
483−{-# INLINE iterateDropWhileTrue #-}
484−iterateDropWhileTrue :: MonadAsync m
485− => Int -> Int -> Int -> Int -> Stream m Int
486−iterateDropWhileTrue value = iterateSource (S.dropWhile (<= (value + 1)))
487−#endif
488−
489−#ifdef USE_PRELUDE
490−{-# INLINE tail #-}
491−tail :: Monad m => Stream m a -> m ()
492−tail s = S.tail s >>= mapM_ tail
493−
494−{-# INLINE nullHeadTail #-}
495−nullHeadTail :: Monad m => Stream m Int -> m ()
496−nullHeadTail s = do
497− r <- S.null s
498− when (not r) $ do
499− _ <- S.head s
500− S.tail s >>= mapM_ nullHeadTail
501−#endif
502−
503−-- Head recursive operations.
504−o_n_stack_iterated :: Int -> [Benchmark]
505−o_n_stack_iterated value = by10 `seq` by100 `seq`
506− [ bgroup "iterated"
507− [ benchIOSrc "mapM (n/10 x 10)" $ iterateMapM by10 10
508−#ifndef USE_STREAMK
509− , benchIOSrc "scanl' (quadratic) (n/100 x 100)" $
510− iterateScan by100 100
511−#endif
512−#ifdef USE_PRELUDE
513− , benchIOSrc "scanl1' (n/10 x 10)" $ iterateScanl1 by10 10
514−#endif
515− , benchIOSrc "filterEven (n/10 x 10)" $
516− iterateFilterEven by10 10
517− , benchIOSrc "takeAll (n/10 x 10)" $
518− iterateTakeAll value by10 10
519− , benchIOSrc "dropOne (n/10 x 10)" $ iterateDropOne by10 10
520−#ifdef USE_STREAMK
521− , benchIOSrc "dropWhileFalse (n/10 x 10)" $
522− iterateDropWhileFalse value by10 10
523−#endif
524− , benchIOSrc "dropWhileTrue (n/10 x 10)" $
525− iterateDropWhileTrue value by10 10
526−#ifdef USE_PRELUDE
527− , benchIOSink value "tail" tail
528− , benchIOSink value "nullHeadTail" nullHeadTail
529−#endif
530− ]
531− ]
532−
533− where
534−
535− by10 = value `div` 10
536− by100 = value `div` 100
537−
538−-------------------------------------------------------------------------------
539−-- Pipes
540−-------------------------------------------------------------------------------
541−
542−o_1_space_pipes :: Int -> [Benchmark]
543−o_1_space_pipes value =
544− [ bgroup "pipes"
545− [ benchIOSink value "mapM" (transformMapM 1)
546− , benchIOSink value "compose" (transformComposeMapM 1)
547− , benchIOSink value "tee" (transformTeeMapM 1)
548−#ifdef DEVBUILD
549− -- XXX this take 1 GB memory to compile
550− , benchIOSink value "zip" (transformZipMapM 1)
551−#endif
552− ]
553− ]
554−
555−o_1_space_pipesX4 :: Int -> [Benchmark]
556−o_1_space_pipesX4 value =
557− [ bgroup "pipesX4"
558− [ benchIOSink value "mapM" (transformMapM 4)
559− , benchIOSink value "compose" (transformComposeMapM 4)
560− , benchIOSink value "tee" (transformTeeMapM 4)
561−#ifdef DEVBUILD
562− -- XXX this take 1 GB memory to compile
563− , benchIOSink value "zip" (transformZipMapM 4)
564−#endif
565− ]
566− ]
567−
568−-------------------------------------------------------------------------------
569−-- Main
570−-------------------------------------------------------------------------------
571−
572−-- In addition to gauge options, the number of elements in the stream can be
573−-- passed using the --stream-size option.
574−--
575−benchmarks :: String -> Int -> [Benchmark]
576−benchmarks moduleName size =
577− [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
578− [ o_1_space_grouping size
579− , o_1_space_transformations_mixed size
580− , o_1_space_transformations_mixedX4 size
581−
582− -- pipes
583− , o_1_space_pipes size
584− , o_1_space_pipesX4 size
585− ]
586− , bgroup (o_n_stack_prefix moduleName) (o_n_stack_iterated size)
587− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_buffering size)
588− ]
benchmark/Streamly/Benchmark/Data/Stream/StreamD.hs+16−57
@@ -8,8 +8,6 @@
88{-# LANGUAGE CPP #-}
99{-# LANGUAGE FlexibleContexts #-}
1010{-# LANGUAGE ScopedTypeVariables #-}
11−{-# LANGUAGE TupleSections #-}
12−{-# OPTIONS_GHC -Wno-orphans #-}
1311
1412#ifdef __HADDOCK_VERSION__
1513#undef INSPECTION
@@ -22,19 +20,15 @@
2220
2321module Main (main) where
2422
25−#if !MIN_VERSION_base(4,18,0)
26−import Control.Applicative (liftA2)
27−#endif
2823import Control.Monad (when)
2924import Data.Maybe (isJust)
30−import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
25+import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
3126import System.Random (randomRIO)
3227import Prelude hiding (tail, mapM_, foldl, last, map, mapM, concatMap, zip)
3328
3429import qualified Prelude as P
35−import qualified Streamly.Internal.Data.Stream as S
30+import qualified Streamly.Internal.Data.Stream.StreamD as S
3631import qualified Streamly.Internal.Data.Unfold as UF
37−import qualified Streamly.Internal.Data.Fold as FL
3832
3933import Streamly.Benchmark.Common
4034
@@ -131,12 +125,6 @@ uncons s = do
131125 Nothing -> return ()
132126 Just (_, t) -> uncons t
133127
134−{-# INLINE foldBreak #-}
135−foldBreak :: Monad m => Stream m Int -> m ()
136−foldBreak s = do
137− (r, s1) <- S.foldBreak (FL.take 1 FL.length) s
138− when (r /= 0) $ foldBreak s1
139−
140128{-# INLINE tail #-}
141129tail :: Monad m => Stream m a -> m ()
142130tail s = S.tail s >>= P.mapM_ tail
@@ -326,34 +314,6 @@ filterMap n = composeN n $ S.map (subtract 1) . S.filter (<= maxValue)
326314-- Nested Composition
327315-------------------------------------------------------------------------------
328316
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−
357317{-# INLINE toNullApNested #-}
358318toNullApNested :: Monad m => Stream m Int -> m ()
359319toNullApNested s = runStream $ do
@@ -442,20 +402,20 @@ inspect $ hasNoTypeClasses 'concatMapRepl
442402inspect $ 'concatMapRepl `hasNoType` ''SPEC
443403#endif
444404
445−-- unfoldMany replicate/unfoldrM
405+-- concatUnfold replicate/unfoldrM
446406
447−{-# INLINE unfoldManyRepl #-}
448−unfoldManyRepl :: Int -> Int -> Int -> IO ()
449−unfoldManyRepl outer inner n =
407+{-# INLINE concatUnfoldRepl #-}
408+concatUnfoldRepl :: Int -> Int -> Int -> IO ()
409+concatUnfoldRepl outer inner n =
450410 S.drain
451− $ S.unfoldMany
452− UF.replicateM
453− (S.map ((inner,) . return) (sourceUnfoldrMN outer n))
411+ $ S.concatMapU
412+ (UF.lmap return (UF.replicateM inner))
413+ (sourceUnfoldrMN outer n)
454414
455415#ifdef INSPECTION
456−inspect $ hasNoTypeClasses 'unfoldManyRepl
457−inspect $ 'unfoldManyRepl `hasNoType` ''S.ConcatMapUState
458−inspect $ 'unfoldManyRepl `hasNoType` ''SPEC
416+inspect $ hasNoTypeClasses 'concatUnfoldRepl
417+inspect $ 'concatUnfoldRepl `hasNoType` ''S.ConcatMapUState
418+inspect $ 'concatUnfoldRepl `hasNoType` ''SPEC
459419#endif
460420
461421-------------------------------------------------------------------------------
@@ -463,7 +423,7 @@ inspect $ 'unfoldManyRepl `hasNoType` ''SPEC
463423-------------------------------------------------------------------------------
464424
465425moduleName :: String
466−moduleName = "Data.StreamD"
426+moduleName = "Data.Stream.StreamD"
467427
468428o_1_space :: [Benchmark]
469429o_1_space =
@@ -479,7 +439,6 @@ o_1_space =
479439 [ benchFold "toNull" toNull sourceUnfoldrM
480440 , benchFold "mapM_" mapM_ sourceUnfoldrM
481441 , benchFold "uncons" uncons sourceUnfoldrM
482− , benchFold "foldBreak" foldBreak sourceUnfoldrM
483442 , benchFold "foldl'" foldl sourceUnfoldrM
484443 , benchFold "last" last sourceUnfoldrM
485444 ]
@@ -529,11 +488,11 @@ o_1_space =
529488 , benchIOSrc1 "concatMap (1 of n)"
530489 (concatMap 1 value)
531490
532− -- concatMap vs unfoldMany
491+ -- concatMap vs concatUnfold
533492 , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
534493 (concatMapRepl value2 value2)
535− , benchIOSrc1 "unfoldManyRepl (sqrt n of sqrt n)"
536− (unfoldManyRepl value2 value2)
494+ , benchIOSrc1 "concatUnfoldRepl (sqrt n of sqrt n)"
495+ (concatUnfoldRepl value2 value2)
537496 ]
538497 , bgroup "filtering"
539498 [ benchFold "filter-even" (filterEven 1) sourceUnfoldrM
benchmark/Streamly/Benchmark/Data/Stream/StreamKAlt.hs → benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hsrenamed+6−8
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
31-- |
42-- Module : Streamly.Benchmark.Data.Stream.StreamDK
53-- Copyright : (c) 2018 Composewell Technologies
@@ -18,12 +16,12 @@ import Prelude hiding ()
1816-- import qualified Prelude as P
1917-- import qualified Data.List as List
2018
21−import qualified Streamly.Internal.Data.StreamK.Alt as S
22−-- import qualified Streamly.Internal.Data.Stream.Common as SP
19+import qualified Streamly.Internal.Data.Stream.StreamDK as S
20+-- import qualified Streamly.Internal.Data.Stream.Prelude as SP
2321-- import qualified Streamly.Internal.Data.SVar as S
2422
2523import Streamly.Benchmark.Common
26−import Test.Tasty.Bench (bgroup, Benchmark, defaultMain)
24+import Gauge (bgroup, Benchmark, defaultMain)
2725
2826value :: Int
2927value = 100000
@@ -106,11 +104,11 @@ sourceFromFoldableM n = S.fromFoldableM (Prelude.fmap return [n..n+value])
106104{-
107105{-# INLINE sourceFoldMapWith #-}
108106sourceFoldMapWith :: Int -> Stream m Int
109−sourceFoldMapWith n = SP.foldMapWith S.serial S.fromPure [n..n+value]
107+sourceFoldMapWith n = SP.foldMapWith S.serial S.yield [n..n+value]
110108
111109{-# INLINE sourceFoldMapWithM #-}
112110sourceFoldMapWithM :: Monad m => Int -> Stream m Int
113−sourceFoldMapWithM n = SP.foldMapWith S.serial (S.fromEffect . return) [n..n+value]
111+sourceFoldMapWithM n = SP.foldMapWith S.serial (S.yieldM . return) [n..n+value]
114112-}
115113
116114-------------------------------------------------------------------------------
@@ -452,4 +450,4 @@ o_1_space =
452450 ]
453451
454452main :: IO ()
455−main = defaultMain [o_1_space]
453+main = defaultMain $ concat [o_1_space]
benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs+356−591
@@ -8,7 +8,6 @@
88{-# LANGUAGE CPP #-}
99{-# LANGUAGE FlexibleContexts #-}
1010{-# LANGUAGE ScopedTypeVariables #-}
11−{-# OPTIONS_GHC -Wno-orphans #-}
1211
1312#ifdef __HADDOCK_VERSION__
1413#undef INSPECTION
@@ -21,23 +20,20 @@
2120
2221module Main (main) where
2322
24−#if !MIN_VERSION_base(4,18,0)
25−import Control.Applicative (liftA2)
26−#endif
2723import Control.Monad (when)
2824import Data.Maybe (isJust)
2925import System.Random (randomRIO)
3026import Prelude hiding
31− ( Foldable(..), tail, mapM_, last, map, mapM, concatMap, zipWith, init, iterate
32− , repeat, replicate
33− )
27+ (tail, mapM_, foldl, last, map, mapM, concatMap, zip, init)
3428
3529import qualified Prelude as P
3630import qualified Data.List as List
3731
38−import qualified Streamly.Internal.Data.StreamK as S
32+import qualified Streamly.Internal.Data.Stream.StreamK as S
33+import qualified Streamly.Internal.Data.Stream.Prelude as SP
34+import qualified Streamly.Internal.Data.SVar as S
3935
40−import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
36+import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
4137
4238import Streamly.Benchmark.Common
4339
@@ -45,163 +41,106 @@ import Streamly.Benchmark.Common
4541import Test.Inspection
4642#endif
4743
48−{-
49−
50−Benchmarks that need to be added
51−
52−-- fromList
53−
54−-- bindWith
55−-- concatPairsWith
56−-- apWith
57−-- apSerial
58−-- apSerialDiscardFst
59−-- apSerialDiscardSnd
60−
61−-- the
62−-- serial
63−-- consMStream
64−-- withLocal
65−-- mfix
66−
67−-- elem
68−-- notElem
69−-- all
70−-- any
71−-- minimum
72−-- minimumBy
73−-- maximum
74−-- maximumBy
75−-- findIndices
76−-- lookup
77−-- findM
78−-- find
79−-- (!!)
80−
81−-- foldlM'
82−-- foldlT
83−-- foldlx'
84−-- foldlMx'
85−-- fold
86−
87−-- sequence
88−
89−-- foldrSM
90−-- buildS
91−-- buildM
92−-- augmentS
93−-- augmentSM
94−-- foldr
95−-- foldr1
96−-- foldrM
97−-- foldrT
98−
99−-- intersperseM
100−-- insertBy
101−-- deleteBy
102−-- reverse
103−-- mapMaybe
104−
105−-- zipWithM
106−-- mergeBy
107−-- mergeByM
108−
109−-- toStreamK (Probably can be skipped)
110−-- hoist
111−
112−-- scanlx'
113−
114−-}
44+value, value2, value3, value16, maxValue :: Int
45+value = 100000
46+value2 = round (P.fromIntegral value**(1/2::P.Double)) -- double nested loop
47+value3 = round (P.fromIntegral value**(1/3::P.Double)) -- triple nested loop
48+value16 = round (P.fromIntegral value**(1/16::P.Double)) -- triple nested loop
49+maxValue = value
50+
51+-------------------------------------------------------------------------------
52+-- Benchmark ops
53+-------------------------------------------------------------------------------
54+
55+{-# INLINE toNull #-}
56+{-# INLINE uncons #-}
57+{-# INLINE nullTail #-}
58+{-# INLINE headTail #-}
59+{-# INLINE zip #-}
60+toNull, uncons, nullTail, headTail, zip
61+ :: Monad m
62+ => Stream m Int -> m ()
63+
64+{-# INLINE toList #-}
65+toList :: Monad m => Stream m Int -> m [Int]
66+{-# INLINE foldl #-}
67+foldl :: Monad m => Stream m Int -> m Int
68+{-# INLINE last #-}
69+last :: Monad m => Stream m Int -> m (Maybe Int)
11570
11671-------------------------------------------------------------------------------
11772-- Stream generation and elimination
11873-------------------------------------------------------------------------------
11974
120−type Stream m a = S.StreamK m a
75+type Stream m a = S.Stream m a
12176
122−{-# INLINE unfoldr #-}
123−unfoldr :: Int -> Int -> Stream m Int
124−unfoldr streamLen n = S.unfoldr step n
77+{-# INLINE sourceUnfoldr #-}
78+sourceUnfoldr :: Int -> Stream m Int
79+sourceUnfoldr n = S.unfoldr step n
12580 where
12681 step cnt =
127− if cnt > n + streamLen
82+ if cnt > n + value
12883 then Nothing
12984 else Just (cnt, cnt + 1)
13085
131−{-# INLINE unfoldrM #-}
132−unfoldrM :: Monad m => Int -> Int -> Stream m Int
133−unfoldrM streamLen n = S.unfoldrMWith S.consM step n
86+{-# INLINE sourceUnfoldrN #-}
87+sourceUnfoldrN :: Int -> Int -> Stream m Int
88+sourceUnfoldrN m n = S.unfoldr step n
13489 where
13590 step cnt =
136− if cnt > n + streamLen
91+ if cnt > n + m
92+ then Nothing
93+ else Just (cnt, cnt + 1)
94+
95+{-# INLINE sourceUnfoldrM #-}
96+sourceUnfoldrM :: S.MonadAsync m => Int -> Stream m Int
97+sourceUnfoldrM n = S.unfoldrM step n
98+ where
99+ step cnt =
100+ if cnt > n + value
101+ then return Nothing
102+ else return (Just (cnt, cnt + 1))
103+
104+{-# INLINE sourceUnfoldrMN #-}
105+sourceUnfoldrMN :: S.MonadAsync m => Int -> Int -> Stream m Int
106+sourceUnfoldrMN m n = S.unfoldrM step n
107+ where
108+ step cnt =
109+ if cnt > n + m
137110 then return Nothing
138111 else return (Just (cnt, cnt + 1))
139112
140−{-# INLINE repeat #-}
141−repeat :: Int -> Int -> Stream m Int
142−repeat streamLen = S.take streamLen . S.repeat
143−
144−{-# INLINE repeatM #-}
145−repeatM :: Monad m => Int -> Int -> Stream m Int
146−repeatM streamLen = S.take streamLen . S.repeatM . return
147−
148−{-# INLINE replicate #-}
149−replicate :: Int -> Int -> Stream m Int
150−replicate = S.replicate
151−
152−{-# INLINE replicateM #-}
153−replicateM :: Monad m => Int -> Int -> Stream m Int
154−replicateM streamLen = S.replicateMWith S.consM streamLen . return
155−
156−{-# INLINE iterate #-}
157−iterate :: Int -> Int -> Stream m Int
158−iterate streamLen = S.take streamLen . S.iterate (+1)
159−
160−{-# INLINE iterateM #-}
161−iterateM :: Monad m => Int -> Int -> Stream m Int
162−iterateM streamLen = S.take streamLen . S.iterateM (return . (+1)) . return
163−
164−{-# INLINE fromFoldable #-}
165−fromFoldable :: Int -> Int -> Stream m Int
166−fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
167−
168−{-# INLINE fromFoldableM #-}
169−fromFoldableM :: Monad m => Int -> Int -> Stream m Int
170−fromFoldableM streamLen n =
171− List.foldr S.consM S.nil (Prelude.fmap return [n..n+streamLen])
172−
173−{-# INLINABLE concatMapFoldableWith #-}
174−concatMapFoldableWith :: P.Foldable f
175− => (Stream m b -> Stream m b -> Stream m b)
176− -> (a -> Stream m b)
177− -> f a
178− -> Stream m b
179−concatMapFoldableWith f g = P.foldr (f . g) S.nil
180−
181−{-# INLINE concatMapFoldableSerial #-}
182−concatMapFoldableSerial :: Int -> Int -> Stream m Int
183−concatMapFoldableSerial streamLen n =
184− concatMapFoldableWith S.append S.fromPure [n..n+streamLen]
185−
186−{-# INLINE concatMapFoldableSerialM #-}
187−concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
188−concatMapFoldableSerialM streamLen n =
189− concatMapFoldableWith S.append (S.fromEffect . return) [n..n+streamLen]
113+{-# INLINE sourceFromFoldable #-}
114+sourceFromFoldable :: Int -> Stream m Int
115+sourceFromFoldable n = S.fromFoldable [n..n+value]
116+
117+{-# INLINE sourceFromFoldableM #-}
118+sourceFromFoldableM :: S.MonadAsync m => Int -> Stream m Int
119+sourceFromFoldableM n =
120+ Prelude.foldr S.consM S.nil (Prelude.fmap return [n..n+value])
121+
122+{-# INLINE sourceFoldMapWith #-}
123+sourceFoldMapWith :: Int -> Stream m Int
124+sourceFoldMapWith n = SP.concatMapFoldableWith S.serial S.yield [n..n+value]
125+
126+{-# INLINE sourceFoldMapWithM #-}
127+sourceFoldMapWithM :: Monad m => Int -> Stream m Int
128+sourceFoldMapWithM n = SP.concatMapFoldableWith S.serial (S.yieldM . return) [n..n+value]
190129
191130-------------------------------------------------------------------------------
192131-- Elimination
193132-------------------------------------------------------------------------------
194133
195−{-# INLINE drain #-}
196−drain :: Monad m => Stream m a -> m ()
197−drain = S.drain
134+{-# INLINE runStream #-}
135+runStream :: Monad m => Stream m a -> m ()
136+runStream = S.drain
137+-- runStream = S.mapM_ (\_ -> return ())
198138
199139{-# INLINE mapM_ #-}
200140mapM_ :: Monad m => Stream m a -> m ()
201141mapM_ = S.mapM_ (\_ -> return ())
202142
203−{-# INLINE uncons #-}
204−uncons :: Monad m => Stream m Int -> m ()
143+toNull = runStream
205144uncons s = do
206145 r <- S.uncons s
207146 case r of
@@ -209,238 +148,167 @@ uncons s = do
209148 Just (_, t) -> uncons t
210149
211150{-# INLINE init #-}
212−init :: Monad m => Stream m a -> m ()
151+init :: (Monad m, S.IsStream t) => t m a -> m ()
213152init s = do
214153 t <- S.init s
215154 P.mapM_ S.drain t
216155
217156{-# INLINE tail #-}
218−tail :: Monad m => Stream m a -> m ()
157+tail :: (Monad m, S.IsStream t) => t m a -> m ()
219158tail s = S.tail s >>= P.mapM_ tail
220159
221−{-# INLINE nullTail #-}
222−nullTail :: Monad m => Stream m Int -> m ()
223160nullTail s = do
224161 r <- S.null s
225162 when (not r) $ S.tail s >>= P.mapM_ nullTail
226163
227−{-# INLINE headTail #-}
228−headTail :: Monad m => Stream m Int -> m ()
229164headTail s = do
230165 h <- S.head s
231166 when (isJust h) $ S.tail s >>= P.mapM_ headTail
232167
233−{-# INLINE toList #-}
234−toList :: Monad m => Stream m Int -> m [Int]
235168toList = S.toList
236−
237−{-# INLINE foldl' #-}
238−foldl' :: Monad m => Stream m Int -> m Int
239−foldl' = S.foldl' (+) 0
240−
241−{-# INLINE last #-}
242−last :: Monad m => Stream m Int -> m (Maybe Int)
243−last = S.last
169+foldl = S.foldl' (+) 0
170+last = S.last
244171
245172-------------------------------------------------------------------------------
246173-- Transformation
247174-------------------------------------------------------------------------------
248175
176+{-# INLINE transform #-}
177+transform :: Monad m => Stream m a -> m ()
178+transform = runStream
179+
249180{-# INLINE composeN #-}
250181composeN
251182 :: Monad m
252183 => Int -> (Stream m Int -> Stream m Int) -> Stream m Int -> m ()
253184composeN n f =
254185 case n of
255− 1 -> drain . f
256− 2 -> drain . f . f
257− 3 -> drain . f . f . f
258− 4 -> drain . f . f . f . f
186+ 1 -> transform . f
187+ 2 -> transform . f . f
188+ 3 -> transform . f . f . f
189+ 4 -> transform . f . f . f . f
259190 _ -> undefined
260191
261−{-# INLINE scanl' #-}
262−scanl' :: Monad m => Int -> Stream m Int -> m ()
263−scanl' n = composeN n $ S.scanl' (+) 0
264−
192+{-# INLINE scan #-}
265193{-# INLINE map #-}
266−map :: Monad m => Int -> Stream m Int -> m ()
267−map n = composeN n $ S.map (+ 1)
268−
269194{-# INLINE fmapK #-}
270−fmapK :: Monad m => Int -> Stream m Int -> m ()
271−fmapK n = composeN n $ P.fmap (+ 1)
272−
273−{-# INLINE mapM #-}
274−mapM :: Monad m => Int -> Stream m Int -> m ()
275−mapM n = composeN n $ S.mapMWith S.consM return
276−
277−{-# INLINE mapMSerial #-}
278−mapMSerial :: Monad m => Int -> Stream m Int -> m ()
279−mapMSerial n = composeN n $ S.mapMSerial return
280−
281195{-# INLINE filterEven #-}
282−filterEven :: Monad m => Int -> Stream m Int -> m ()
283−filterEven n = composeN n $ S.filter even
284−
285196{-# INLINE filterAllOut #-}
286−filterAllOut :: Monad m => Int -> Int -> Stream m Int -> m ()
287−filterAllOut streamLen n = composeN n $ S.filter (> streamLen)
288−
289197{-# INLINE filterAllIn #-}
290−filterAllIn :: Monad m => Int -> Int -> Stream m Int -> m ()
291−filterAllIn streamLen n = composeN n $ S.filter (<= streamLen)
292−
293198{-# INLINE _takeOne #-}
294−_takeOne :: Monad m => Int -> Stream m Int -> m ()
295−_takeOne n = composeN n $ S.take 1
296−
297199{-# INLINE takeAll #-}
298−takeAll :: Monad m => Int -> Int -> Stream m Int -> m ()
299−takeAll streamLen n = composeN n $ S.take streamLen
300−
301200{-# INLINE takeWhileTrue #-}
302−takeWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
303−takeWhileTrue streamLen n = composeN n $ S.takeWhile (<= streamLen)
304−
305201{-# INLINE dropOne #-}
306−dropOne :: Monad m => Int -> Stream m Int -> m ()
307−dropOne n = composeN n $ S.drop 1
308−
309202{-# INLINE dropAll #-}
310−dropAll :: Monad m => Int -> Int -> Stream m Int -> m ()
311−dropAll streamLen n = composeN n $ S.drop streamLen
312−
313203{-# INLINE dropWhileTrue #-}
314−dropWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
315−dropWhileTrue streamLen n = composeN n $ S.dropWhile (<= streamLen)
316−
317204{-# INLINE dropWhileFalse #-}
318−dropWhileFalse :: Monad m => Int -> Stream m Int -> m ()
319−dropWhileFalse n = composeN n $ S.dropWhile (<= 1)
320−
321205{-# INLINE foldrS #-}
322−foldrS :: Monad m => Int -> Stream m Int -> m ()
323−foldrS n = composeN n $ S.foldrS S.cons S.nil
324−
325206{-# INLINE foldlS #-}
326−foldlS :: Monad m => Int -> Stream m Int -> m ()
327−foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
207+scan, map, fmapK, filterEven, filterAllOut,
208+ filterAllIn, _takeOne, takeAll, takeWhileTrue, dropAll, dropOne,
209+ dropWhileTrue, dropWhileFalse, foldrS, foldlS
210+ :: Monad m
211+ => Int -> Stream m Int -> m ()
328212
213+{-# INLINE mapM #-}
214+{-# INLINE mapMSerial #-}
329215{-# INLINE intersperse #-}
330−intersperse :: Monad m => Int -> Int -> Stream m Int -> m ()
331−intersperse streamLen n = composeN n $ S.intersperse streamLen
216+mapM, mapMSerial, intersperse
217+ :: S.MonadAsync m => Int -> Stream m Int -> m ()
218+
219+scan n = composeN n $ S.scanl' (+) 0
220+map n = composeN n $ P.fmap (+1)
221+fmapK n = composeN n $ P.fmap (+1)
222+mapM n = composeN n $ S.mapM return
223+mapMSerial n = composeN n $ S.mapMSerial return
224+filterEven n = composeN n $ S.filter even
225+filterAllOut n = composeN n $ S.filter (> maxValue)
226+filterAllIn n = composeN n $ S.filter (<= maxValue)
227+_takeOne n = composeN n $ S.take 1
228+takeAll n = composeN n $ S.take maxValue
229+takeWhileTrue n = composeN n $ S.takeWhile (<= maxValue)
230+dropOne n = composeN n $ S.drop 1
231+dropAll n = composeN n $ S.drop maxValue
232+dropWhileTrue n = composeN n $ S.dropWhile (<= maxValue)
233+dropWhileFalse n = composeN n $ S.dropWhile (<= 1)
234+foldrS n = composeN n $ S.foldrS S.cons S.nil
235+foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
236+intersperse n = composeN n $ S.intersperse maxValue
332237
333238-------------------------------------------------------------------------------
334239-- Iteration
335240-------------------------------------------------------------------------------
336241
242+iterStreamLen, maxIters :: Int
243+iterStreamLen = 10
244+maxIters = 10000
245+
337246{-# INLINE iterateSource #-}
338247iterateSource
339− :: Monad m => Int -> (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
340−iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
248+ :: S.MonadAsync m
249+ => (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
250+iterateSource g i n = f i (sourceUnfoldrMN iterStreamLen n)
341251 where
342252 f (0 :: Int) m = g m
343253 f x m = g (f (x P.- 1) m)
344254
345−-- this is quadratic
346−{-# INLINE iterateScan #-}
347−iterateScan :: Monad m => Int -> Int -> Int -> Stream m Int
348−iterateScan iterStreamLen maxIters =
349− iterateSource iterStreamLen (S.scanl' (+) 0) (maxIters `div` 10)
350−
351−-- this is quadratic
352−{-# INLINE iterateDropWhileFalse #-}
353−iterateDropWhileFalse :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
354−iterateDropWhileFalse streamLen iterStreamLen maxIters =
355− iterateSource iterStreamLen (S.dropWhile (> streamLen)) (maxIters `div` 10)
356−
357255{-# INLINE iterateMapM #-}
358−iterateMapM :: Monad m => Int -> Int -> Int -> Stream m Int
359−iterateMapM iterStreamLen =
360− iterateSource iterStreamLen (S.mapMWith S.consM return)
361−
256+{-# INLINE iterateScan #-}
362257{-# INLINE iterateFilterEven #-}
363−iterateFilterEven :: Monad m => Int -> Int -> Int -> Stream m Int
364−iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
365−
366258{-# INLINE iterateTakeAll #-}
367−iterateTakeAll :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
368−iterateTakeAll streamLen iterStreamLen =
369− iterateSource iterStreamLen (S.take streamLen)
370−
371259{-# INLINE iterateDropOne #-}
372−iterateDropOne :: Monad m => Int -> Int -> Int -> Stream m Int
373−iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
374−
260+{-# INLINE iterateDropWhileFalse #-}
375261{-# INLINE iterateDropWhileTrue #-}
376−iterateDropWhileTrue ::
377− Monad m => Int -> Int -> Int -> Int -> Stream m Int
378−iterateDropWhileTrue streamLen iterStreamLen =
379− iterateSource iterStreamLen (S.dropWhile (<= streamLen))
262+iterateMapM, iterateScan, iterateFilterEven, iterateTakeAll, iterateDropOne,
263+ iterateDropWhileFalse, iterateDropWhileTrue
264+ :: S.MonadAsync m
265+ => Int -> Stream m Int
266+
267+-- this is quadratic
268+iterateScan = iterateSource (S.scanl' (+) 0) (maxIters `div` 10)
269+iterateDropWhileFalse = iterateSource (S.dropWhile (> maxValue))
270+ (maxIters `div` 10)
271+
272+iterateMapM = iterateSource (S.mapM return) maxIters
273+iterateFilterEven = iterateSource (S.filter even) maxIters
274+iterateTakeAll = iterateSource (S.take maxValue) maxIters
275+iterateDropOne = iterateSource (S.drop 1) maxIters
276+iterateDropWhileTrue = iterateSource (S.dropWhile (<= maxValue)) maxIters
380277
381278-------------------------------------------------------------------------------
382279-- Zipping
383280-------------------------------------------------------------------------------
384281
385−{-# INLINE zipWith #-}
386−zipWith :: Monad m => Stream m Int -> m ()
387−zipWith src = drain $ S.zipWith (,) src src
388−
389−{-# INLINE zipWithM #-}
390−zipWithM :: Monad m => Stream m Int -> m ()
391−zipWithM src = drain $ S.zipWithM (curry return) src src
392−
393−{-# INLINE sortByK #-}
394−sortByK :: (a -> a -> Ordering) -> Stream m a -> Stream m a
395−sortByK f = S.mergeMapWith (S.mergeBy f) S.fromPure
396−
397−{-# INLINE sortBy #-}
398−sortBy :: Monad m => Stream m Int -> m ()
399−sortBy = drain . sortByK compare
282+zip src = transform $ S.zipWith (,) src src
400283
401284-------------------------------------------------------------------------------
402285-- Mixed Composition
403286-------------------------------------------------------------------------------
404287
405288{-# INLINE scanMap #-}
406−scanMap :: Monad m => Int -> Stream m Int -> m ()
407−scanMap n = composeN n $ S.map (subtract 1) . S.scanl' (+) 0
408−
409289{-# INLINE dropMap #-}
410−dropMap :: Monad m => Int -> Stream m Int -> m ()
411−dropMap n = composeN n $ S.map (subtract 1) . S.drop 1
412−
413290{-# INLINE dropScan #-}
414−dropScan :: Monad m => Int -> Stream m Int -> m ()
415−dropScan n = composeN n $ S.scanl' (+) 0 . S.drop 1
416−
417291{-# INLINE takeDrop #-}
418−takeDrop :: Monad m => Int -> Int -> Stream m Int -> m ()
419−takeDrop streamLen n = composeN n $ S.drop 1 . S.take streamLen
420−
421292{-# INLINE takeScan #-}
422−takeScan :: Monad m => Int -> Int -> Stream m Int -> m ()
423−takeScan streamLen n = composeN n $ S.scanl' (+) 0 . S.take streamLen
424−
425293{-# INLINE takeMap #-}
426−takeMap :: Monad m => Int -> Int -> Stream m Int -> m ()
427−takeMap streamLen n = composeN n $ S.map (subtract 1) . S.take streamLen
428−
429294{-# INLINE filterDrop #-}
430−filterDrop :: Monad m => Int -> Int -> Stream m Int -> m ()
431−filterDrop streamLen n = composeN n $ S.drop 1 . S.filter (<= streamLen)
432−
433295{-# INLINE filterTake #-}
434−filterTake :: Monad m => Int -> Int -> Stream m Int -> m ()
435−filterTake streamLen n = composeN n $ S.take streamLen . S.filter (<= streamLen)
436−
437296{-# INLINE filterScan #-}
438−filterScan :: Monad m => Int -> Stream m Int -> m ()
439−filterScan n = composeN n $ S.scanl' (+) 0 . S.filter (<= maxBound)
440−
441297{-# INLINE filterMap #-}
442−filterMap :: Monad m => Int -> Int -> Stream m Int -> m ()
443−filterMap streamLen n = composeN n $ S.map (subtract 1) . S.filter (<= streamLen)
298+scanMap, dropMap, dropScan, takeDrop, takeScan, takeMap, filterDrop,
299+ filterTake, filterScan, filterMap
300+ :: Monad m => Int -> Stream m Int -> m ()
301+
302+scanMap n = composeN n $ S.map (subtract 1) . S.scanl' (+) 0
303+dropMap n = composeN n $ S.map (subtract 1) . S.drop 1
304+dropScan n = composeN n $ S.scanl' (+) 0 . S.drop 1
305+takeDrop n = composeN n $ S.drop 1 . S.take maxValue
306+takeScan n = composeN n $ S.scanl' (+) 0 . S.take maxValue
307+takeMap n = composeN n $ S.map (subtract 1) . S.take maxValue
308+filterDrop n = composeN n $ S.drop 1 . S.filter (<= maxValue)
309+filterTake n = composeN n $ S.take maxValue . S.filter (<= maxValue)
310+filterScan n = composeN n $ S.scanl' (+) 0 . S.filter (<= maxBound)
311+filterMap n = composeN n $ S.map (subtract 1) . S.filter (<= maxValue)
444312
445313-------------------------------------------------------------------------------
446314-- ConcatMap
@@ -452,8 +320,8 @@ filterMap streamLen n = composeN n $ S.map (subtract 1) . S.filter (<= streamLen
452320concatMap :: Int -> Int -> Int -> IO ()
453321concatMap outer inner n =
454322 S.drain $ S.concatMap
455− (\_ -> unfoldrM inner n)
456− (unfoldrM outer n)
323+ (\_ -> sourceUnfoldrMN inner n)
324+ (sourceUnfoldrMN outer n)
457325
458326#ifdef INSPECTION
459327inspect $ hasNoTypeClasses 'concatMap
@@ -465,8 +333,8 @@ inspect $ hasNoTypeClasses 'concatMap
465333concatMapPure :: Int -> Int -> Int -> IO ()
466334concatMapPure outer inner n =
467335 S.drain $ S.concatMap
468− (\_ -> unfoldr inner n)
469− (unfoldr outer n)
336+ (\_ -> sourceUnfoldrN inner n)
337+ (sourceUnfoldrN outer n)
470338
471339#ifdef INSPECTION
472340inspect $ hasNoTypeClasses 'concatMapPure
@@ -477,7 +345,7 @@ inspect $ hasNoTypeClasses 'concatMapPure
477345{-# INLINE concatMapRepl #-}
478346concatMapRepl :: Int -> Int -> Int -> IO ()
479347concatMapRepl outer inner n =
480− S.drain $ S.concatMap (S.replicate inner) (unfoldrM outer n)
348+ S.drain $ S.concatMap (S.replicate inner) (sourceUnfoldrMN outer n)
481349
482350#ifdef INSPECTION
483351inspect $ hasNoTypeClasses 'concatMapRepl
@@ -489,70 +357,44 @@ inspect $ hasNoTypeClasses 'concatMapRepl
489357sourceConcatMapId :: Monad m
490358 => Int -> Int -> Stream m (Stream m Int)
491359sourceConcatMapId val n =
492− S.fromFoldable $ fmap (S.fromEffect . return) [n..n+val]
360+ S.fromFoldable $ fmap (S.yieldM . return) [n..n+val]
493361
494−{-# INLINE concatMapBySerial #-}
495−concatMapBySerial :: Int -> Int -> Int -> IO ()
496−concatMapBySerial outer inner n =
497− S.drain $ S.concatMapWith S.append
498− (unfoldrM inner)
499− (unfoldrM outer n)
362+{-# INLINE concatStreamsWith #-}
363+concatStreamsWith :: Int -> Int -> Int -> IO ()
364+concatStreamsWith outer inner n =
365+ S.drain $ S.concatMapBy S.serial
366+ (sourceUnfoldrMN inner)
367+ (sourceUnfoldrMN outer n)
500368
501369-------------------------------------------------------------------------------
502370-- Nested Composition
503371-------------------------------------------------------------------------------
504372
505−instance Monad m => Applicative (S.StreamK m) where
506− {-# INLINE pure #-}
507− pure = S.fromPure
508−
509− {-# INLINE (<*>) #-}
510− (<*>) = S.crossApply
511−
512− {-# INLINE liftA2 #-}
513− liftA2 f x = (<*>) (fmap f x)
514−
515− {-# INLINE (*>) #-}
516− (*>) = S.crossApplySnd
517−
518− {-# INLINE (<*) #-}
519− (<*) = S.crossApplyFst
520−
521−-- NOTE: even though concatMap for StreamD is 3x faster compared to StreamK,
522−-- the monad instance of StreamD is slower than StreamK after foldr/build
523−-- fusion.
524−instance Monad m => Monad (S.StreamK m) where
525− {-# INLINE return #-}
526− return = pure
527−
528− {-# INLINE (>>=) #-}
529− (>>=) = flip S.concatMap
530−
531−{-# INLINE drainApplicative #-}
532−drainApplicative :: Monad m => Stream m Int -> m ()
533−drainApplicative s = drain $ do
373+{-# INLINE toNullApNested #-}
374+toNullApNested :: Monad m => Stream m Int -> m ()
375+toNullApNested s = runStream $ do
534376 (+) <$> s <*> s
535377
536−{-# INLINE drainMonad #-}
537−drainMonad :: Monad m => Stream m Int -> m ()
538−drainMonad s = drain $ do
378+{-# INLINE toNullNested #-}
379+toNullNested :: Monad m => Stream m Int -> m ()
380+toNullNested s = runStream $ do
539381 x <- s
540382 y <- s
541383 return $ x + y
542384
543−{-# INLINE drainMonad3 #-}
544−drainMonad3 :: Monad m => Stream m Int -> m ()
545−drainMonad3 s = drain $ do
385+{-# INLINE toNullNested3 #-}
386+toNullNested3 :: Monad m => Stream m Int -> m ()
387+toNullNested3 s = runStream $ do
546388 x <- s
547389 y <- s
548390 z <- s
549391 return $ x + y + z
550392
551−{-# INLINE filterAllOutMonad #-}
552−filterAllOutMonad
393+{-# INLINE filterAllOutNested #-}
394+filterAllOutNested
553395 :: Monad m
554396 => Stream m Int -> m ()
555−filterAllOutMonad str = drain $ do
397+filterAllOutNested str = runStream $ do
556398 x <- str
557399 y <- str
558400 let s = x + y
@@ -560,11 +402,11 @@ filterAllOutMonad str = drain $ do
560402 then return s
561403 else S.nil
562404
563−{-# INLINE filterAllInMonad #-}
564−filterAllInMonad
405+{-# INLINE filterAllInNested #-}
406+filterAllInNested
565407 :: Monad m
566408 => Stream m Int -> m ()
567−filterAllInMonad str = drain $ do
409+filterAllInNested str = runStream $ do
568410 x <- str
569411 y <- str
570412 let s = x + y
@@ -576,14 +418,9 @@ filterAllInMonad str = drain $ do
576418-- Nested Composition Pure lists
577419-------------------------------------------------------------------------------
578420
579−-- There are several list benchmarks here for comparison with lists. It is easy
580−-- and convenient to see the comparisons when they are here, otherwise we'll
581−-- have to add a separate module for list benchmarks with the same names and
582−-- then add a comparison in bench.sh.
583−
584−{-# INLINE unfoldrList #-}
585−unfoldrList :: Int -> Int -> [Int]
586−unfoldrList maxval n = List.unfoldr step n
421+{-# INLINE sourceUnfoldrList #-}
422+sourceUnfoldrList :: Int -> Int -> [Int]
423+sourceUnfoldrList maxval n = List.unfoldr step n
587424 where
588425 step cnt =
589426 if cnt > n + maxval
@@ -634,301 +471,229 @@ filterAllInNestedList str = do
634471-------------------------------------------------------------------------------
635472
636473moduleName :: String
637−moduleName = "Data.StreamK"
638−
639−o_1_space_generation :: Int -> Benchmark
640−o_1_space_generation streamLen =
641− bgroup "generation"
642− [ benchFold "unfoldr" drain (unfoldr streamLen)
643− , benchFold "unfoldrM" drain (unfoldrM streamLen)
644− , benchFold "repeat" drain (repeat streamLen)
645− , benchFold "repeatM" drain (repeatM streamLen)
646− , benchFold "replicate" drain (replicate streamLen)
647− , benchFold "replicateM" drain (replicateM streamLen)
648− , benchFold "iterate" drain (iterate streamLen)
649− , benchFold "iterateM" drain (iterateM streamLen)
650−
651− , benchFold "fromFoldable" drain (fromFoldable streamLen)
652− , benchFold "fromFoldableM" drain (fromFoldableM streamLen)
474+moduleName = "Data.Stream.StreamK"
475+
476+o_1_space :: [Benchmark]
477+o_1_space =
478+ [ bgroup (o_1_space_prefix moduleName)
479+ [ bgroup "generation"
480+ [ benchFold "unfoldr" toNull sourceUnfoldr
481+ , benchFold "unfoldrM" toNull sourceUnfoldrM
482+
483+ , benchFold "fromFoldable" toNull sourceFromFoldable
484+ , benchFold "fromFoldableM" toNull sourceFromFoldableM
653485
654486 -- appends
655− , benchFold "concatMapFoldableWith" drain (concatMapFoldableSerial streamLen)
656− , benchFold "concatMapFoldableWithM" drain (concatMapFoldableSerialM streamLen)
487+ , benchFold "concatMapFoldableWith" toNull sourceFoldMapWith
488+ , benchFold "concatMapFoldableWithM" toNull sourceFoldMapWithM
657489 ]
658−
659−o_1_space_elimination :: Int -> Benchmark
660−o_1_space_elimination streamLen =
661− bgroup "elimination"
662− [ benchFold "toNull" drain (unfoldrM streamLen)
663− , benchFold "mapM_" mapM_ (unfoldrM streamLen)
664− , benchFold "uncons" uncons (unfoldrM streamLen)
665− , benchFold "init" init (unfoldrM streamLen)
666− , benchFold "foldl'" foldl' (unfoldrM streamLen)
667− , benchFold "last" last (unfoldrM streamLen)
490+ , bgroup "elimination"
491+ [ benchFold "toNull" toNull sourceUnfoldrM
492+ , benchFold "mapM_" mapM_ sourceUnfoldrM
493+ , benchFold "uncons" uncons sourceUnfoldrM
494+ , benchFold "init" init sourceUnfoldrM
495+ , benchFold "foldl'" foldl sourceUnfoldrM
496+ , benchFold "last" last sourceUnfoldrM
668497 ]
669−
670−o_1_space_nested :: Int -> Benchmark
671−o_1_space_nested streamLen =
672− bgroup "nested"
673− [ benchFold "drainApplicative" drainApplicative (unfoldrM streamLen2)
674− , benchFold "drainMonad" drainMonad (unfoldrM streamLen2)
675− , benchFold "drainMonad3" drainMonad3 (unfoldrM streamLen3)
676− , benchFold "filterAllInMonad" filterAllInMonad (unfoldrM streamLen2)
677− , benchFold "filterAllOutMonad" filterAllOutMonad (unfoldrM streamLen2)
678− , benchFold "drainApplicative (pure)" drainApplicative (unfoldr streamLen2)
679− , benchFold "drainMonad (pure)" drainMonad (unfoldr streamLen2)
680− , benchFold "drainMonad3 (pure)" drainMonad3 (unfoldr streamLen3)
681− , benchFold "filterAllInMonad (pure)" filterAllInMonad (unfoldr streamLen2)
682− , benchFold "filterAllOutMonad (pure)" filterAllOutMonad (unfoldr streamLen2)
498+ , bgroup "nested"
499+ [ benchFold "toNullAp" toNullApNested (sourceUnfoldrMN value2)
500+ , benchFold "toNull" toNullNested (sourceUnfoldrMN value2)
501+ , benchFold "toNull3" toNullNested3 (sourceUnfoldrMN value3)
502+ , benchFold "filterAllIn" filterAllInNested (sourceUnfoldrMN value2)
503+ , benchFold "filterAllOut" filterAllOutNested (sourceUnfoldrMN value2)
504+ , benchFold "toNullApPure" toNullApNested (sourceUnfoldrN value2)
505+ , benchFold "toNullPure" toNullNested (sourceUnfoldrN value2)
506+ , benchFold "toNull3Pure" toNullNested3 (sourceUnfoldrN value3)
507+ , benchFold "filterAllInPure" filterAllInNested (sourceUnfoldrN value2)
508+ , benchFold "filterAllOutPure" filterAllOutNested (sourceUnfoldrN value2)
683509 ]
684− where
685− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
686− streamLen3 = round (P.fromIntegral streamLen**(1/3::P.Double)) -- triple nested loop
687−
688−o_1_space_transformation :: Int -> Benchmark
689−o_1_space_transformation streamLen =
690− bgroup "transformation"
691− [ benchFold "foldrS" (foldrS 1) (unfoldrM streamLen)
692− , benchFold "scanl'" (scanl' 1) (unfoldrM streamLen)
693− , benchFold "map" (map 1) (unfoldrM streamLen)
694− , benchFold "fmap" (fmapK 1) (unfoldrM streamLen)
695− , benchFold "mapM" (mapM 1) (unfoldrM streamLen)
696− , benchFold "mapMSerial" (mapMSerial 1) (unfoldrM streamLen)
510+ , bgroup "transformation"
511+ [ benchFold "foldrS" (foldrS 1) sourceUnfoldrM
512+ , benchFold "scan" (scan 1) sourceUnfoldrM
513+ , benchFold "map" (map 1) sourceUnfoldrM
514+ , benchFold "fmap" (fmapK 1) sourceUnfoldrM
515+ , benchFold "mapM" (mapM 1) sourceUnfoldrM
516+ , benchFold "mapMSerial" (mapMSerial 1) sourceUnfoldrM
697517 ]
698−
699−o_1_space_transformationX4 :: Int -> Benchmark
700−o_1_space_transformationX4 streamLen =
701− bgroup "transformationX4"
702− [ benchFold "scanl'" (scanl' 4) (unfoldrM streamLen)
703− , benchFold "map" (map 4) (unfoldrM streamLen)
704− , benchFold "fmap" (fmapK 4) (unfoldrM streamLen)
705− , benchFold "mapM" (mapM 4) (unfoldrM streamLen)
706− , benchFold "mapMSerial" (mapMSerial 4) (unfoldrM streamLen)
518+ , bgroup "transformationX4"
519+ [ benchFold "scan" (scan 4) sourceUnfoldrM
520+ , benchFold "map" (map 4) sourceUnfoldrM
521+ , benchFold "fmap" (fmapK 4) sourceUnfoldrM
522+ , benchFold "mapM" (mapM 4) sourceUnfoldrM
523+ , benchFold "mapMSerial" (mapMSerial 4) sourceUnfoldrM
707524 -- XXX this is horribly slow
708− -- , benchFold "concatMap" (concatMap 4) (unfoldrM streamLen16)
525+ -- , benchFold "concatMap" (concatMap 4) (sourceUnfoldrMN value16)
709526 ]
710−
711−o_1_space_concat :: Int -> Benchmark
712−o_1_space_concat streamLen =
713− bgroup "concat"
527+ , bgroup "concat"
714528 [ benchIOSrc1 "concatMapPure (n of 1)"
715− (concatMapPure streamLen 1)
529+ (concatMapPure value 1)
716530 , benchIOSrc1 "concatMapPure (sqrt n of sqrt n)"
717− (concatMapPure streamLen2 streamLen2)
531+ (concatMapPure value2 value2)
718532 , benchIOSrc1 "concatMapPure (1 of n)"
719− (concatMapPure 1 streamLen)
533+ (concatMapPure 1 value)
720534
721535 , benchIOSrc1 "concatMap (n of 1)"
722− (concatMap streamLen 1)
536+ (concatMap value 1)
723537 , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
724− (concatMap streamLen2 streamLen2)
538+ (concatMap value2 value2)
725539 , benchIOSrc1 "concatMap (1 of n)"
726− (concatMap 1 streamLen)
540+ (concatMap 1 value)
727541
728542 , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
729− (concatMapRepl streamLen2 streamLen2)
543+ (concatMapRepl value2 value2)
730544
731545 -- This is for comparison with concatMapFoldableWith
732546 , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
733− (S.drain
734− . S.concatMapWith S.append id
735− . sourceConcatMapId streamLen)
736−
737− , benchIOSrc1 "concatMapBy serial (n of 1)"
738− (concatMapBySerial streamLen 1)
739− , benchIOSrc1 "concatMapBy serial (sqrt n of sqrt n)"
740− (concatMapBySerial streamLen2 streamLen2)
741− , benchIOSrc1 "concatMapBy serial (1 of n)"
742− (concatMapBySerial 1 streamLen)
743− , benchFold "sortBy" sortBy (unfoldrM streamLen)
547+ (S.drain . S.concatMapBy S.serial id . sourceConcatMapId value)
548+
549+ , benchIOSrc1 "concatMapWith (n of 1)"
550+ (concatStreamsWith value 1)
551+ , benchIOSrc1 "concatMapWith (sqrt n of sqrt n)"
552+ (concatStreamsWith value2 value2)
553+ , benchIOSrc1 "concatMapWith (1 of n)"
554+ (concatStreamsWith 1 value)
744555 ]
745− where
746− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
747−
748−o_1_space_filtering :: Int -> Benchmark
749−o_1_space_filtering streamLen =
750− bgroup "filtering"
751− [ benchFold "filter-even" (filterEven 1) (unfoldrM streamLen)
752− , benchFold "filter-all-out" (filterAllOut streamLen 1) (unfoldrM streamLen)
753− , benchFold "filter-all-in" (filterAllIn streamLen 1) (unfoldrM streamLen)
754− , benchFold "take-all" (takeAll streamLen 1) (unfoldrM streamLen)
755− , benchFold "takeWhile-true" (takeWhileTrue streamLen 1) (unfoldrM streamLen)
756− , benchFold "drop-one" (dropOne 1) (unfoldrM streamLen)
757− , benchFold "drop-all" (dropAll streamLen 1) (unfoldrM streamLen)
758− , benchFold "dropWhile-true" (dropWhileTrue streamLen 1) (unfoldrM streamLen)
759− , benchFold "dropWhile-false" (dropWhileFalse 1) (unfoldrM streamLen)
556+ , bgroup "filtering"
557+ [ benchFold "filter-even" (filterEven 1) sourceUnfoldrM
558+ , benchFold "filter-all-out" (filterAllOut 1) sourceUnfoldrM
559+ , benchFold "filter-all-in" (filterAllIn 1) sourceUnfoldrM
560+ , benchFold "take-all" (takeAll 1) sourceUnfoldrM
561+ , benchFold "takeWhile-true" (takeWhileTrue 1) sourceUnfoldrM
562+ , benchFold "drop-one" (dropOne 1) sourceUnfoldrM
563+ , benchFold "drop-all" (dropAll 1) sourceUnfoldrM
564+ , benchFold "dropWhile-true" (dropWhileTrue 1) sourceUnfoldrM
565+ , benchFold "dropWhile-false" (dropWhileFalse 1) sourceUnfoldrM
760566 ]
761−
762−o_1_space_filteringX4 :: Int -> Benchmark
763−o_1_space_filteringX4 streamLen =
764− bgroup "filteringX4"
765− [ benchFold "filter-even" (filterEven 4) (unfoldrM streamLen)
766− , benchFold "filter-all-out" (filterAllOut streamLen 4) (unfoldrM streamLen)
767− , benchFold "filter-all-in" (filterAllIn streamLen 4) (unfoldrM streamLen)
768− , benchFold "take-all" (takeAll streamLen 4) (unfoldrM streamLen)
769− , benchFold "takeWhile-true" (takeWhileTrue streamLen 4) (unfoldrM streamLen)
770− , benchFold "drop-one" (dropOne 4) (unfoldrM streamLen)
771− , benchFold "drop-all" (dropAll streamLen 4) (unfoldrM streamLen)
772− , benchFold "dropWhile-true" (dropWhileTrue streamLen 4) (unfoldrM streamLen)
773− , benchFold "dropWhile-false" (dropWhileFalse 4) (unfoldrM streamLen)
567+ , bgroup "filteringX4"
568+ [ benchFold "filter-even" (filterEven 4) sourceUnfoldrM
569+ , benchFold "filter-all-out" (filterAllOut 4) sourceUnfoldrM
570+ , benchFold "filter-all-in" (filterAllIn 4) sourceUnfoldrM
571+ , benchFold "take-all" (takeAll 4) sourceUnfoldrM
572+ , benchFold "takeWhile-true" (takeWhileTrue 4) sourceUnfoldrM
573+ , benchFold "drop-one" (dropOne 4) sourceUnfoldrM
574+ , benchFold "drop-all" (dropAll 4) sourceUnfoldrM
575+ , benchFold "dropWhile-true" (dropWhileTrue 4) sourceUnfoldrM
576+ , benchFold "dropWhile-false" (dropWhileFalse 4) sourceUnfoldrM
774577 ]
775−
776−o_1_space_zipping :: Int -> Benchmark
777−o_1_space_zipping streamLen =
778− bgroup "zipping"
779− [ benchFold "zipWith" zipWith (unfoldrM streamLen)
780− , benchFold "zipWithM" zipWithM (unfoldrM streamLen)
578+ , bgroup "zipping"
579+ [ benchFold "zip" zip sourceUnfoldrM
781580 ]
782−
783−o_1_space_mixed :: Int -> Benchmark
784−o_1_space_mixed streamLen =
785− bgroup "mixed"
786− [ benchFold "scan-map" (scanMap 1) (unfoldrM streamLen)
787− , benchFold "drop-map" (dropMap 1) (unfoldrM streamLen)
788− , benchFold "drop-scan" (dropScan 1) (unfoldrM streamLen)
789− , benchFold "take-drop" (takeDrop streamLen 1) (unfoldrM streamLen)
790− , benchFold "take-scan" (takeScan streamLen 1) (unfoldrM streamLen)
791− , benchFold "take-map" (takeMap streamLen 1) (unfoldrM streamLen)
792− , benchFold "filter-drop" (filterDrop streamLen 1) (unfoldrM streamLen)
793− , benchFold "filter-take" (filterTake streamLen 1) (unfoldrM streamLen)
794− , benchFold "filter-scan" (filterScan 1) (unfoldrM streamLen)
795− , benchFold "filter-map" (filterMap streamLen 1) (unfoldrM streamLen)
581+ , bgroup "mixed"
582+ [ benchFold "scan-map" (scanMap 1) sourceUnfoldrM
583+ , benchFold "drop-map" (dropMap 1) sourceUnfoldrM
584+ , benchFold "drop-scan" (dropScan 1) sourceUnfoldrM
585+ , benchFold "take-drop" (takeDrop 1) sourceUnfoldrM
586+ , benchFold "take-scan" (takeScan 1) sourceUnfoldrM
587+ , benchFold "take-map" (takeMap 1) sourceUnfoldrM
588+ , benchFold "filter-drop" (filterDrop 1) sourceUnfoldrM
589+ , benchFold "filter-take" (filterTake 1) sourceUnfoldrM
590+ , benchFold "filter-scan" (filterScan 1) sourceUnfoldrM
591+ , benchFold "filter-map" (filterMap 1) sourceUnfoldrM
796592 ]
797−
798−o_1_space_mixedX2 :: Int -> Benchmark
799−o_1_space_mixedX2 streamLen =
800− bgroup "mixedX2"
801− [ benchFold "scan-map" (scanMap 2) (unfoldrM streamLen)
802− , benchFold "drop-map" (dropMap 2) (unfoldrM streamLen)
803− , benchFold "drop-scan" (dropScan 2) (unfoldrM streamLen)
804− , benchFold "take-drop" (takeDrop streamLen 2) (unfoldrM streamLen)
805− , benchFold "take-scan" (takeScan streamLen 2) (unfoldrM streamLen)
806− , benchFold "take-map" (takeMap streamLen 2) (unfoldrM streamLen)
807− , benchFold "filter-drop" (filterDrop streamLen 2) (unfoldrM streamLen)
808− , benchFold "filter-take" (filterTake streamLen 2) (unfoldrM streamLen)
809− , benchFold "filter-scan" (filterScan 2) (unfoldrM streamLen)
810− , benchFold "filter-map" (filterMap streamLen 2) (unfoldrM streamLen)
593+ , bgroup "mixedX2"
594+ [ benchFold "scan-map" (scanMap 2) sourceUnfoldrM
595+ , benchFold "drop-map" (dropMap 2) sourceUnfoldrM
596+ , benchFold "drop-scan" (dropScan 2) sourceUnfoldrM
597+ , benchFold "take-drop" (takeDrop 2) sourceUnfoldrM
598+ , benchFold "take-scan" (takeScan 2) sourceUnfoldrM
599+ , benchFold "take-map" (takeMap 2) sourceUnfoldrM
600+ , benchFold "filter-drop" (filterDrop 2) sourceUnfoldrM
601+ , benchFold "filter-take" (filterTake 2) sourceUnfoldrM
602+ , benchFold "filter-scan" (filterScan 2) sourceUnfoldrM
603+ , benchFold "filter-map" (filterMap 2) sourceUnfoldrM
811604 ]
812−
813−o_1_space_mixedX4 :: Int -> Benchmark
814−o_1_space_mixedX4 streamLen =
815− bgroup "mixedX4"
816− [ benchFold "scan-map" (scanMap 4) (unfoldrM streamLen)
817− , benchFold "drop-map" (dropMap 4) (unfoldrM streamLen)
818− , benchFold "drop-scan" (dropScan 4) (unfoldrM streamLen)
819− , benchFold "take-drop" (takeDrop streamLen 4) (unfoldrM streamLen)
820− , benchFold "take-scan" (takeScan streamLen 4) (unfoldrM streamLen)
821− , benchFold "take-map" (takeMap streamLen 4) (unfoldrM streamLen)
822− , benchFold "filter-drop" (filterDrop streamLen 4) (unfoldrM streamLen)
823− , benchFold "filter-take" (filterTake streamLen 4) (unfoldrM streamLen)
824− , benchFold "filter-scan" (filterScan 4) (unfoldrM streamLen)
825− , benchFold "filter-map" (filterMap streamLen 4) (unfoldrM streamLen)
826− ]
827−
828−o_1_space_list :: Int -> Benchmark
829−o_1_space_list streamLen =
830− bgroup "list"
831− [ bgroup "elimination"
832− [ benchList "last" (\xs -> [List.last xs]) (unfoldrList streamLen)
833− ]
834− , bgroup "nested"
835− [ benchList "toNullAp" toNullApNestedList (unfoldrList streamLen2)
836− , benchList "toNull" toNullNestedList (unfoldrList streamLen2)
837− , benchList "toNull3" toNullNestedList3 (unfoldrList streamLen3)
838− , benchList "filterAllIn" filterAllInNestedList (unfoldrList streamLen2)
839− , benchList "filterAllOut" filterAllOutNestedList (unfoldrList streamLen2)
605+ , bgroup "mixedX4"
606+ [ benchFold "scan-map" (scanMap 4) sourceUnfoldrM
607+ , benchFold "drop-map" (dropMap 4) sourceUnfoldrM
608+ , benchFold "drop-scan" (dropScan 4) sourceUnfoldrM
609+ , benchFold "take-drop" (takeDrop 4) sourceUnfoldrM
610+ , benchFold "take-scan" (takeScan 4) sourceUnfoldrM
611+ , benchFold "take-map" (takeMap 4) sourceUnfoldrM
612+ , benchFold "filter-drop" (filterDrop 4) sourceUnfoldrM
613+ , benchFold "filter-take" (filterTake 4) sourceUnfoldrM
614+ , benchFold "filter-scan" (filterScan 4) sourceUnfoldrM
615+ , benchFold "filter-map" (filterMap 4) sourceUnfoldrM
840616 ]
841617 ]
842− where
843−
844− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
845− streamLen3 = round (P.fromIntegral streamLen**(1/3::P.Double)) -- triple nested loop
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− ]
618+ ]
864619
865−o_n_heap :: Int -> Benchmark
866−o_n_heap streamLen =
867− bgroup (o_n_heap_prefix moduleName)
620+o_n_heap :: [Benchmark]
621+o_n_heap =
622+ [ bgroup (o_n_heap_prefix moduleName)
868623 [ bgroup "transformation"
869− [ benchFold "foldlS" (foldlS 1) (unfoldrM streamLen)
624+ [ benchFold "foldlS" (foldlS 1) sourceUnfoldrM
870625 ]
871626 ]
627+ ]
872628
873629{-# INLINE benchK #-}
874630benchK :: P.String -> (Int -> Stream P.IO Int) -> Benchmark
875−benchK name f = bench name $ nfIO $ randomRIO (1,1) >>= drain . f
631+benchK name f = bench name $ nfIO $ randomRIO (1,1) >>= toNull . f
876632
877−o_n_stack :: Int -> Int -> Int -> Benchmark
878−o_n_stack streamLen iterStreamLen maxIters =
879− bgroup (o_n_stack_prefix moduleName)
633+o_n_stack :: [Benchmark]
634+o_n_stack =
635+ [ bgroup (o_n_stack_prefix moduleName)
880636 [ bgroup "elimination"
881− [ benchFold "tail" tail (unfoldrM streamLen)
882− , benchFold "nullTail" nullTail (unfoldrM streamLen)
883− , benchFold "headTail" headTail (unfoldrM streamLen)
637+ [ benchFold "tail" tail sourceUnfoldrM
638+ , benchFold "nullTail" nullTail sourceUnfoldrM
639+ , benchFold "headTail" headTail sourceUnfoldrM
884640 ]
885641 , bgroup "transformation"
886642 [
887643 -- XXX why do these need so much stack
888− benchFold "intersperse" (intersperse streamLen 1) (unfoldrM streamLen2)
889− , benchFold "interspersePure" (intersperse streamLen 1) (unfoldr streamLen2)
644+ benchFold "intersperse" (intersperse 1) (sourceUnfoldrMN value2)
645+ , benchFold "interspersePure" (intersperse 1) (sourceUnfoldrN value2)
890646 ]
891647 , bgroup "transformationX4"
892648 [
893− benchFold "intersperse" (intersperse streamLen 4) (unfoldrM streamLen16)
649+ benchFold "intersperse" (intersperse 4) (sourceUnfoldrMN value16)
894650 ]
895651 , bgroup "iterated"
896− [ benchK "mapM" (iterateMapM iterStreamLen maxIters)
897− , benchK "scan(1/10)" (iterateScan iterStreamLen maxIters)
898− , benchK "filterEven" (iterateFilterEven iterStreamLen maxIters)
899− , benchK "takeAll" (iterateTakeAll streamLen iterStreamLen maxIters)
900− , benchK "dropOne" (iterateDropOne iterStreamLen maxIters)
901− , benchK "dropWhileFalse(1/10)" (iterateDropWhileFalse streamLen iterStreamLen maxIters)
902− , benchK "dropWhileTrue" (iterateDropWhileTrue streamLen iterStreamLen maxIters)
652+ [ benchK "mapM" iterateMapM
653+ , benchK "scan(1/10)" iterateScan
654+ , benchK "filterEven" iterateFilterEven
655+ , benchK "takeAll" iterateTakeAll
656+ , benchK "dropOne" iterateDropOne
657+ , benchK "dropWhileFalse(1/10)" iterateDropWhileFalse
658+ , benchK "dropWhileTrue" iterateDropWhileTrue
903659 ]
904660 ]
905− where
906− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
907− streamLen16 = round (P.fromIntegral streamLen**(1/16::P.Double)) -- triple nested loop
661+ ]
908662
909−o_n_space :: Int -> Benchmark
910−o_n_space streamLen =
911− bgroup (o_n_space_prefix moduleName)
663+o_n_space :: [Benchmark]
664+o_n_space =
665+ [ bgroup (o_n_space_prefix moduleName)
912666 [ bgroup "elimination"
913− [ benchFold "toList" toList (unfoldrM streamLen)
667+ [ benchFold "toList" toList sourceUnfoldrM
914668 ]
915669 ]
670+ ]
916671
917672{-# INLINE benchList #-}
918673benchList :: P.String -> ([Int] -> [Int]) -> (Int -> [Int]) -> Benchmark
919674benchList name run f = bench name $ nfIO $ randomRIO (1,1) >>= return . run . f
920675
921−main :: IO ()
922−main =
923− defaultMain
924− [ o_1_space streamLen
925− , o_n_stack streamLen iterStreamLen maxIters
926− , o_n_heap streamLen
927− , o_n_space streamLen
676+o_1_space_list :: [Benchmark]
677+o_1_space_list =
678+ [ bgroup "list"
679+ [ bgroup "elimination"
680+ [ benchList "last" (\xs -> [List.last xs]) (sourceUnfoldrList value)
928681 ]
682+ , bgroup "nested"
683+ [ benchList "toNullAp" toNullApNestedList (sourceUnfoldrList value2)
684+ , benchList "toNull" toNullNestedList (sourceUnfoldrList value2)
685+ , benchList "toNull3" toNullNestedList3 (sourceUnfoldrList value3)
686+ , benchList "filterAllIn" filterAllInNestedList (sourceUnfoldrList value2)
687+ , benchList "filterAllOut" filterAllOutNestedList (sourceUnfoldrList value2)
688+ ]
689+ ]
690+ ]
929691
930− where
931−
932− streamLen = 100000
933− maxIters = 10000
934− iterStreamLen = 10
692+main :: IO ()
693+main = defaultMain $ concat
694+ [ o_1_space
695+ , [bgroup (o_1_space_prefix moduleName) o_1_space_list]
696+ , o_n_stack
697+ , o_n_heap
698+ , o_n_space
699+ ]
benchmark/Streamly/Benchmark/Data/Stream/ToStreamK.hsdeleted−938
@@ -1,938 +0,0 @@
1−-- |
2−-- Module : Streamly.Benchmark.Data.StreamK
3−-- Copyright : (c) 2018 Composewell Technologies
4−--
5−-- License : BSD3
6−-- Maintainer : streamly@composewell.com
7−
8−{-# LANGUAGE CPP #-}
9−{-# LANGUAGE FlexibleContexts #-}
10−{-# LANGUAGE ScopedTypeVariables #-}
11−{-# OPTIONS_GHC -Wno-orphans #-}
12−
13−#ifdef __HADDOCK_VERSION__
14−#undef INSPECTION
15−#endif
16−
17−#ifdef INSPECTION
18−{-# LANGUAGE TemplateHaskell #-}
19−{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
20−#endif
21−
22−module Main (main) where
23−
24−-- import Control.Applicative (liftA2)
25−-- import Control.Monad (when)
26−-- import Data.Maybe (isJust)
27−-- import System.Random (randomRIO)
28−import Prelude hiding
29− ( tail, mapM_, foldl, last, map, mapM, concatMap, zipWith, init, iterate
30− , repeat, replicate
31− )
32−
33−import qualified Prelude as P
34−-- import qualified Data.List as List
35−
36−import qualified Streamly.Internal.Data.StreamK as S
37−import qualified Streamly.Internal.Data.Stream as D
38−import qualified Streamly.Internal.Data.Fold as Fold
39−
40−import Test.Tasty.Bench (bgroup, Benchmark, defaultMain)
41−
42−import Streamly.Benchmark.Common
43−
44−#ifdef INSPECTION
45−import Test.Inspection
46−#endif
47−
48−-------------------------------------------------------------------------------
49−-- Stream generation and elimination
50−-------------------------------------------------------------------------------
51−
52−type Stream m a = S.Stream m a
53−
54−{-# INLINE unfoldrD #-}
55−unfoldrD :: Monad m => Int -> Int -> Stream m Int
56−unfoldrD streamLen n = D.toStreamK (D.unfoldr step n)
57− where
58− step cnt =
59− if cnt > n + streamLen
60− then Nothing
61− else Just (cnt, cnt + 1)
62−
63−{-# INLINE unfoldrMD #-}
64−unfoldrMD :: Monad m => Int -> Int -> Stream m Int
65−unfoldrMD streamLen n = D.toStreamK (D.unfoldrM step n)
66− where
67− step cnt =
68− if cnt > n + streamLen
69− then return Nothing
70− else return (Just (cnt, cnt + 1))
71−
72−{-
73−{-# INLINE unfoldrK #-}
74−unfoldrK :: Int -> Int -> Stream m Int
75−unfoldrK streamLen n = S.unfoldr step n
76− where
77− step cnt =
78− if cnt > n + streamLen
79− then Nothing
80− else Just (cnt, cnt + 1)
81−-}
82−
83−{-# INLINE unfoldrMK #-}
84−unfoldrMK :: Monad m => Int -> Int -> Stream m Int
85−unfoldrMK streamLen n = S.unfoldrMWith S.consM step n
86− where
87− step cnt =
88− if cnt > n + streamLen
89− then return Nothing
90− else return (Just (cnt, cnt + 1))
91−
92−{-# INLINE repeat #-}
93−repeat :: Monad m => Int -> Int -> Stream m Int
94−repeat streamLen = S.take streamLen . D.toStreamK . D.repeat
95−
96−{-# INLINE repeatM #-}
97−repeatM :: Monad m => Int -> Int -> Stream m Int
98−repeatM streamLen = S.take streamLen . D.toStreamK . D.repeatM . return
99−
100−{-# INLINE replicate #-}
101−replicate :: Monad m => Int -> Int -> Stream m Int
102−replicate x y = D.toStreamK $ D.replicate x y
103−
104−{-# INLINE replicateM #-}
105−replicateM :: Monad m => Int -> Int -> Stream m Int
106−replicateM streamLen = D.toStreamK . D.replicateM streamLen . return
107−
108−{-# INLINE iterate #-}
109−iterate :: Monad m => Int -> Int -> Stream m Int
110−iterate streamLen = S.take streamLen . D.toStreamK . D.iterate (+1)
111−
112−{-# INLINE iterateM #-}
113−iterateM :: Monad m => Int -> Int -> Stream m Int
114−iterateM streamLen = S.take streamLen . D.toStreamK . D.iterateM (return . (+1)) . return
115−
116−{-# INLINE fromFoldable #-}
117−fromFoldable :: Int -> Int -> Stream m Int
118−fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
119−
120−{-# INLINE fromFoldableM #-}
121−fromFoldableM :: Monad m => Int -> Int -> Stream m Int
122−fromFoldableM streamLen n =
123− Prelude.foldr (S.consM . return) S.nil [n .. n + streamLen]
124−
125−{-
126−{-# INLINABLE concatMapFoldableWith #-}
127−concatMapFoldableWith :: Foldable f
128− => (Stream m b -> Stream m b -> Stream m b)
129− -> (a -> Stream m b)
130− -> f a
131− -> Stream m b
132−concatMapFoldableWith f g = Prelude.foldr (f . g) S.nil
133−-}
134−
135−{-# INLINE concatMapFoldableSerial #-}
136−concatMapFoldableSerial :: Monad m => Int -> Int -> Stream m Int
137−concatMapFoldableSerial streamLen n =
138− D.toStreamK $ D.concatMap D.fromPure $ D.fromStreamK $ S.fromList [n..n+streamLen]
139−
140−{-# INLINE concatMapFoldableSerialM #-}
141−concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
142−concatMapFoldableSerialM streamLen n =
143− -- concatMapFoldableWith S.serial (S.fromEffect . return) [n..n+streamLen]
144− D.toStreamK $ D.concatMap (D.fromEffect . return) $ D.fromStreamK $ S.fromList [n..n+streamLen]
145−
146−-------------------------------------------------------------------------------
147−-- Elimination
148−-------------------------------------------------------------------------------
149−
150−{-# INLINE drainD #-}
151−drainD :: Monad m => Stream m a -> m ()
152−drainD = D.drain . D.fromStreamK
153−
154−{-# INLINE drain #-}
155−drain :: Monad m => Stream m a -> m ()
156−drain = S.drain
157−
158−{-# INLINE mapM_ #-}
159−mapM_ :: Monad m => Stream m a -> m ()
160−mapM_ s = D.mapM_ (\_ -> return ()) $ D.fromStreamK s
161−
162−{-
163−{-# INLINE uncons #-}
164−uncons :: Monad m => Stream m Int -> m ()
165−uncons s = do
166− r <- D.uncons $ D.fromStreamK s
167− case r of
168− Nothing -> return ()
169− Just (_, t) -> uncons (D.toStreamK t)
170−
171−{-# INLINE init #-}
172−init :: Monad m => Stream m a -> m ()
173−init s = do
174− t <- S.init s
175− P.mapM_ S.drain t
176−
177−{-# INLINE tail #-}
178−tail :: Monad m => Stream m a -> m ()
179−tail s = S.tail s >>= P.mapM_ tail
180−
181−{-# INLINE nullTail #-}
182−nullTail :: Monad m => Stream m Int -> m ()
183−nullTail s = do
184− r <- S.null s
185− when (not r) $ S.tail s >>= P.mapM_ nullTail
186−
187−{-# INLINE headTail #-}
188−headTail :: Monad m => Stream m Int -> m ()
189−headTail s = do
190− h <- S.head s
191− when (isJust h) $ S.tail s >>= P.mapM_ headTail
192−-}
193−
194−{-# INLINE toList #-}
195−toList :: Monad m => Stream m Int -> m [Int]
196−toList = D.fold Fold.toList . D.fromStreamK
197−
198−{-# INLINE foldl' #-}
199−foldl' :: Monad m => Stream m Int -> m Int
200−foldl' = D.fold (Fold.foldl' (+) 0) . D.fromStreamK
201−
202−{-# INLINE last #-}
203−last :: Monad m => Stream m Int -> m (Maybe Int)
204−last = D.fold Fold.latest . D.fromStreamK
205−
206−-------------------------------------------------------------------------------
207−-- Transformation
208−-------------------------------------------------------------------------------
209−
210−{-# INLINE composeN #-}
211−composeN
212− :: Monad m
213− => Int -> (Stream m Int -> Stream m Int) -> Stream m Int -> m ()
214−composeN n f =
215− case n of
216− 1 -> drain . f
217− 2 -> drain . f . f
218− 3 -> drain . f . f . f
219− 4 -> drain . f . f . f . f
220− _ -> undefined
221−
222−{-# INLINE scanl' #-}
223−scanl' :: Monad m => Int -> Stream m Int -> m ()
224−scanl' n =
225− composeN n (D.toStreamK . D.scan (Fold.foldl' (+) 0) . D.fromStreamK)
226−
227−{-# INLINE map #-}
228−map :: Monad m => Int -> Stream m Int -> m ()
229−map n = composeN n (D.toStreamK . D.map (+ 1) . D.fromStreamK)
230−
231−{-
232−{-# INLINE fmapK #-}
233−fmapK :: Monad m => Int -> Stream m Int -> m ()
234−fmapK n = composeN n $ P.fmap (+ 1)
235−-}
236−
237−{-# INLINE mapM #-}
238−mapM :: Monad m => Int -> Stream m Int -> m ()
239−mapM n = composeN n (D.toStreamK . D.mapM return . D.fromStreamK)
240−
241−{-
242−{-# INLINE mapMSerial #-}
243−mapMSerial :: S.MonadAsync m => Int -> Stream m Int -> m ()
244−mapMSerial n = composeN n $ S.mapMSerial return
245−-}
246−
247−{-# INLINE filterEven #-}
248−filterEven :: Monad m => Int -> Stream m Int -> m ()
249−filterEven n = composeN n (D.toStreamK . D.filter even . D.fromStreamK)
250−
251−{-
252−{-# INLINE filterAllOut #-}
253−filterAllOut :: Monad m => Int -> Int -> Stream m Int -> m ()
254−filterAllOut streamLen n = composeN n $ S.filter (> streamLen)
255−
256−{-# INLINE filterAllIn #-}
257−filterAllIn :: Monad m => Int -> Int -> Stream m Int -> m ()
258−filterAllIn streamLen n = composeN n $ S.filter (<= streamLen)
259−
260−{-# INLINE _takeOne #-}
261−_takeOne :: Monad m => Int -> Stream m Int -> m ()
262−_takeOne n = composeN n $ S.take 1
263−
264−{-# INLINE takeAll #-}
265−takeAll :: Monad m => Int -> Int -> Stream m Int -> m ()
266−takeAll streamLen n = composeN n $ S.take streamLen
267−
268−{-# INLINE takeWhileTrue #-}
269−takeWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
270−takeWhileTrue streamLen n = composeN n $ S.takeWhile (<= streamLen)
271−
272−{-# INLINE dropOne #-}
273−dropOne :: Monad m => Int -> Stream m Int -> m ()
274−dropOne n = composeN n $ S.drop 1
275−
276−{-# INLINE dropAll #-}
277−dropAll :: Monad m => Int -> Int -> Stream m Int -> m ()
278−dropAll streamLen n = composeN n $ S.drop streamLen
279−
280−{-# INLINE dropWhileTrue #-}
281−dropWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
282−dropWhileTrue streamLen n = composeN n $ S.dropWhile (<= streamLen)
283−
284−{-# INLINE dropWhileFalse #-}
285−dropWhileFalse :: Monad m => Int -> Stream m Int -> m ()
286−dropWhileFalse n = composeN n $ S.dropWhile (<= 1)
287−-}
288−
289−{-
290−{-# INLINE foldrS #-}
291−foldrS :: Monad m => Int -> Stream m Int -> m ()
292−foldrS n = composeN n $ S.foldrS S.cons S.nil
293−
294−{-# INLINE foldlS #-}
295−foldlS :: Monad m => Int -> Stream m Int -> m ()
296−foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
297−-}
298−
299−{-
300−{-# INLINE intersperse #-}
301−intersperse :: S.MonadAsync m => Int -> Int -> Stream m Int -> m ()
302−intersperse streamLen n = composeN n $ S.intersperse streamLen
303−-}
304−
305−-------------------------------------------------------------------------------
306−-- Iteration
307−-------------------------------------------------------------------------------
308−
309−{-
310−{-# INLINE iterateSource #-}
311−iterateSource
312− :: S.MonadAsync m
313− => Int -> (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
314−iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
315− where
316− f (0 :: Int) m = g m
317− f x m = g (f (x P.- 1) m)
318−
319−-- this is quadratic
320−{-# INLINE iterateScan #-}
321−iterateScan :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
322−iterateScan iterStreamLen maxIters =
323− iterateSource iterStreamLen (S.scanl' (+) 0) (maxIters `div` 10)
324−
325−-- this is quadratic
326−{-# INLINE iterateDropWhileFalse #-}
327−iterateDropWhileFalse :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
328−iterateDropWhileFalse streamLen iterStreamLen maxIters =
329− iterateSource iterStreamLen (S.dropWhile (> streamLen)) (maxIters `div` 10)
330−
331−{-# INLINE iterateMapM #-}
332−iterateMapM :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
333−iterateMapM iterStreamLen =
334− iterateSource iterStreamLen (S.mapMWith S.consM return)
335−
336−{-# INLINE iterateFilterEven #-}
337−iterateFilterEven :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
338−iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
339−
340−{-# INLINE iterateTakeAll #-}
341−iterateTakeAll :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
342−iterateTakeAll streamLen iterStreamLen =
343− iterateSource iterStreamLen (S.take streamLen)
344−
345−{-# INLINE iterateDropOne #-}
346−iterateDropOne :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
347−iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
348−
349−{-# INLINE iterateDropWhileTrue #-}
350−iterateDropWhileTrue :: S.MonadAsync m =>
351− Int -> Int -> Int -> Int -> Stream m Int
352−iterateDropWhileTrue streamLen iterStreamLen =
353− iterateSource iterStreamLen (S.dropWhile (<= streamLen))
354−-}
355−
356−-------------------------------------------------------------------------------
357−-- Zipping
358−-------------------------------------------------------------------------------
359−
360−{-
361−{-# INLINE zipWith #-}
362−zipWith :: Monad m => Stream m Int -> m ()
363−zipWith src = drain $ S.zipWith (,) src src
364−
365−{-# INLINE zipWithM #-}
366−zipWithM :: Monad m => Stream m Int -> m ()
367−zipWithM src = drain $ S.zipWithM (curry return) src src
368−
369−{-# INLINE sortByK #-}
370−sortByK :: (a -> a -> Ordering) -> Stream m a -> Stream m a
371−sortByK f = S.concatPairsWith (S.mergeBy f) S.fromPure
372−
373−{-# INLINE sortBy #-}
374−sortBy :: Monad m => Stream m Int -> m ()
375−sortBy = drain . sortByK compare
376−
377−-------------------------------------------------------------------------------
378−-- Mixed Composition
379−-------------------------------------------------------------------------------
380−
381−{-# INLINE scanMap #-}
382−scanMap :: Monad m => Int -> Stream m Int -> m ()
383−scanMap n = composeN n $ S.map (subtract 1) . S.scanl' (+) 0
384−
385−{-# INLINE dropMap #-}
386−dropMap :: Monad m => Int -> Stream m Int -> m ()
387−dropMap n = composeN n $ S.map (subtract 1) . S.drop 1
388−
389−{-# INLINE dropScan #-}
390−dropScan :: Monad m => Int -> Stream m Int -> m ()
391−dropScan n = composeN n $ S.scanl' (+) 0 . S.drop 1
392−
393−{-# INLINE takeDrop #-}
394−takeDrop :: Monad m => Int -> Int -> Stream m Int -> m ()
395−takeDrop streamLen n = composeN n $ S.drop 1 . S.take streamLen
396−
397−{-# INLINE takeScan #-}
398−takeScan :: Monad m => Int -> Int -> Stream m Int -> m ()
399−takeScan streamLen n = composeN n $ S.scanl' (+) 0 . S.take streamLen
400−
401−{-# INLINE takeMap #-}
402−takeMap :: Monad m => Int -> Int -> Stream m Int -> m ()
403−takeMap streamLen n = composeN n $ S.map (subtract 1) . S.take streamLen
404−
405−{-# INLINE filterDrop #-}
406−filterDrop :: Monad m => Int -> Int -> Stream m Int -> m ()
407−filterDrop streamLen n = composeN n $ S.drop 1 . S.filter (<= streamLen)
408−
409−{-# INLINE filterTake #-}
410−filterTake :: Monad m => Int -> Int -> Stream m Int -> m ()
411−filterTake streamLen n = composeN n $ S.take streamLen . S.filter (<= streamLen)
412−
413−{-# INLINE filterScan #-}
414−filterScan :: Monad m => Int -> Stream m Int -> m ()
415−filterScan n = composeN n $ S.scanl' (+) 0 . S.filter (<= maxBound)
416−
417−{-# INLINE filterMap #-}
418−filterMap :: Monad m => Int -> Int -> Stream m Int -> m ()
419−filterMap streamLen n = composeN n $ S.map (subtract 1) . S.filter (<= streamLen)
420−-}
421−
422−-------------------------------------------------------------------------------
423−-- ConcatMap
424−-------------------------------------------------------------------------------
425−
426−-- concatMap unfoldrM/unfoldrM
427−
428−{-# INLINE concatMap #-}
429−concatMap :: Int -> Int -> Int -> IO ()
430−concatMap outer inner n =
431− S.drain $ D.toStreamK $ D.concatMap
432− (\_ -> D.fromStreamK $ unfoldrMK inner n)
433− (D.fromStreamK $ unfoldrMK outer n)
434−
435−#ifdef INSPECTION
436−inspect $ hasNoTypeClasses 'concatMap
437−#endif
438−
439−-- concatMap unfoldr/unfoldr
440−
441−{-
442−{-# INLINE concatMapPure #-}
443−concatMapPure :: Int -> Int -> Int -> IO ()
444−concatMapPure outer inner n =
445− S.drain $ S.concatMap
446− (\_ -> unfoldr inner n)
447− (unfoldr outer n)
448−
449−#ifdef INSPECTION
450−inspect $ hasNoTypeClasses 'concatMapPure
451−#endif
452−
453−-- concatMap replicate/unfoldrM
454−
455−{-# INLINE concatMapRepl #-}
456−concatMapRepl :: Int -> Int -> Int -> IO ()
457−concatMapRepl outer inner n =
458− S.drain $ S.concatMap (S.replicate inner) (unfoldrM outer n)
459−
460−#ifdef INSPECTION
461−inspect $ hasNoTypeClasses 'concatMapRepl
462−#endif
463−
464−-- concatMapWith
465−
466−{-# INLINE sourceConcatMapId #-}
467−sourceConcatMapId :: Monad m
468− => Int -> Int -> Stream m (Stream m Int)
469−sourceConcatMapId val n =
470− S.fromFoldable $ fmap (S.fromEffect . return) [n..n+val]
471−
472−{-# INLINE concatMapBySerial #-}
473−concatMapBySerial :: Int -> Int -> Int -> IO ()
474−concatMapBySerial outer inner n =
475− S.drain $ S.concatMapWith S.serial
476− (unfoldrM inner)
477− (unfoldrM outer n)
478−-}
479−
480−{-
481−-------------------------------------------------------------------------------
482−-- Nested Composition
483−-------------------------------------------------------------------------------
484−
485−instance Monad m => Applicative (S.Stream m) where
486− {-# INLINE pure #-}
487− pure = S.fromPure
488−
489− {-# INLINE (<*>) #-}
490− (<*>) = S.crossApply
491−
492− {-# INLINE liftA2 #-}
493− liftA2 f x = (<*>) (fmap f x)
494−
495− {-# INLINE (*>) #-}
496− (*>) = S.crossApplySnd
497−
498− {-# INLINE (<*) #-}
499− (<*) = S.crossApplyFst
500−
501−-- NOTE: even though concatMap for StreamD is 3x faster compared to StreamK,
502−-- the monad instance of StreamD is slower than StreamK after foldr/build
503−-- fusion.
504−instance Monad m => Monad (S.Stream m) where
505− {-# INLINE return #-}
506− return = pure
507−
508− {-# INLINE (>>=) #-}
509− (>>=) = flip S.concatMap
510−
511−{-# INLINE drainApplicative #-}
512−drainApplicative :: Monad m => Stream m Int -> m ()
513−drainApplicative s = drain $ do
514− (+) <$> s <*> s
515−
516−{-# INLINE drainMonad #-}
517−drainMonad :: Monad m => Stream m Int -> m ()
518−drainMonad s = drain $ do
519− x <- s
520− y <- s
521− return $ x + y
522−
523−{-# INLINE drainMonad3 #-}
524−drainMonad3 :: Monad m => Stream m Int -> m ()
525−drainMonad3 s = drain $ do
526− x <- s
527− y <- s
528− z <- s
529− return $ x + y + z
530−
531−{-# INLINE filterAllOutMonad #-}
532−filterAllOutMonad
533− :: Monad m
534− => Stream m Int -> m ()
535−filterAllOutMonad str = drain $ do
536− x <- str
537− y <- str
538− let s = x + y
539− if s < 0
540− then return s
541− else S.nil
542−
543−{-# INLINE filterAllInMonad #-}
544−filterAllInMonad
545− :: Monad m
546− => Stream m Int -> m ()
547−filterAllInMonad str = drain $ do
548− x <- str
549− y <- str
550− let s = x + y
551− if s > 0
552− then return s
553− else S.nil
554−
555−-------------------------------------------------------------------------------
556−-- Nested Composition Pure lists
557−-------------------------------------------------------------------------------
558−
559−-- There are several list benchmarks here for comparison with lists. It is easy
560−-- and convenient to see the comparisons when they are here, otherwise we'll
561−-- have to add a separate module for list benchmarks with the same names and
562−-- then add a comparison in bench.sh.
563−
564−{-# INLINE unfoldrList #-}
565−unfoldrList :: Int -> Int -> [Int]
566−unfoldrList maxval n = List.unfoldr step n
567− where
568− step cnt =
569− if cnt > n + maxval
570− then Nothing
571− else Just (cnt, cnt + 1)
572−
573−{-# INLINE toNullApNestedList #-}
574−toNullApNestedList :: [Int] -> [Int]
575−toNullApNestedList s = (+) <$> s <*> s
576−
577−{-# INLINE toNullNestedList #-}
578−toNullNestedList :: [Int] -> [Int]
579−toNullNestedList s = do
580− x <- s
581− y <- s
582− return $ x + y
583−
584−{-# INLINE toNullNestedList3 #-}
585−toNullNestedList3 :: [Int] -> [Int]
586−toNullNestedList3 s = do
587− x <- s
588− y <- s
589− z <- s
590− return $ x + y + z
591−
592−{-# INLINE filterAllOutNestedList #-}
593−filterAllOutNestedList :: [Int] -> [Int]
594−filterAllOutNestedList str = do
595− x <- str
596− y <- str
597− let s = x + y
598− if s < 0
599− then return s
600− else []
601−
602−{-# INLINE filterAllInNestedList #-}
603−filterAllInNestedList :: [Int] -> [Int]
604−filterAllInNestedList str = do
605− x <- str
606− y <- str
607− let s = x + y
608− if s > 0
609− then return s
610− else []
611− -}
612−
613−-------------------------------------------------------------------------------
614−-- Benchmarks
615−-------------------------------------------------------------------------------
616−
617−moduleName :: String
618−moduleName = "Data.Stream.ToStreamK"
619−
620−-- Generation of StreamK using StreamD generation functions and eleminating
621−-- using StreamK drain.
622−o_1_space_generation :: Int -> Benchmark
623−o_1_space_generation streamLen =
624− bgroup "generation"
625− [ benchFold "unfoldr" drain (unfoldrD streamLen)
626− , benchFold "unfoldrM" drain (unfoldrMD streamLen)
627− , benchFold "repeat" drain (repeat streamLen)
628− , benchFold "repeatM" drain (repeatM streamLen)
629− , benchFold "replicate" drain (replicate streamLen)
630− , benchFold "replicateM" drain (replicateM streamLen)
631− , benchFold "iterate" drain (iterate streamLen)
632− , benchFold "iterateM" drain (iterateM streamLen)
633−
634− , benchFold "fromFoldable" drain (fromFoldable streamLen)
635− , benchFold "fromFoldableM" drain (fromFoldableM streamLen)
636−
637− -- appends
638− , benchFold "concatMapFoldableWith" drain (concatMapFoldableSerial streamLen)
639− , benchFold "concatMapFoldableWithM" drain (concatMapFoldableSerialM streamLen)
640− ]
641−
642−-- Generating using StreamK and eliminating using StreamD folds.
643−o_1_space_elimination :: Int -> Benchmark
644−o_1_space_elimination streamLen =
645− bgroup "elimination"
646− [ benchFold "toNull" drainD (unfoldrMK streamLen)
647− , benchFold "mapM_" mapM_ (unfoldrMK streamLen)
648− -- , benchFold "uncons" uncons (unfoldrMK streamLen)
649− -- , benchFold "init" init (unfoldrM streamLen)
650− , benchFold "foldl'" foldl' (unfoldrMK streamLen)
651− , benchFold "last" last (unfoldrMK streamLen)
652− ]
653−
654−{-
655−o_1_space_nested :: Int -> Benchmark
656−o_1_space_nested streamLen =
657− bgroup "nested"
658− [ benchFold "drainApplicative" drainApplicative (unfoldrM streamLen2)
659− , benchFold "drainMonad" drainMonad (unfoldrM streamLen2)
660− , benchFold "drainMonad3" drainMonad3 (unfoldrM streamLen3)
661− , benchFold "filterAllInMonad" filterAllInMonad (unfoldrM streamLen2)
662− , benchFold "filterAllOutMonad" filterAllOutMonad (unfoldrM streamLen2)
663− , benchFold "drainApplicative (pure)" drainApplicative (unfoldr streamLen2)
664− , benchFold "drainMonad (pure)" drainMonad (unfoldr streamLen2)
665− , benchFold "drainMonad3 (pure)" drainMonad3 (unfoldr streamLen3)
666− , benchFold "filterAllInMonad (pure)" filterAllInMonad (unfoldr streamLen2)
667− , benchFold "filterAllOutMonad (pure)" filterAllOutMonad (unfoldr streamLen2)
668− ]
669− where
670− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
671− streamLen3 = round (P.fromIntegral streamLen**(1/3::P.Double)) -- triple nested loop
672−-}
673−
674−-- Generate using StreamK and transform using StreamD transformation functions
675−-- and then drain using StreamK.
676−o_1_space_transformation :: Int -> Benchmark
677−o_1_space_transformation streamLen =
678− bgroup "transformation"
679− [ -- benchFold "foldrS" (foldrS 1) (unfoldrM streamLen)
680− benchFold "scanl'" (scanl' 1) (unfoldrMK streamLen)
681− , benchFold "map" (map 1) (unfoldrMK streamLen)
682− -- , benchFold "fmap" (fmapK 1) (unfoldrM streamLen)
683− , benchFold "mapM" (mapM 1) (unfoldrMK streamLen)
684− -- , benchFold "mapMSerial" (mapMSerial 1) (unfoldrM streamLen)
685− ]
686−
687−o_1_space_transformationX4 :: Int -> Benchmark
688−o_1_space_transformationX4 streamLen =
689− bgroup "transformationX4"
690− [ benchFold "scanl'" (scanl' 4) (unfoldrMK streamLen)
691− , benchFold "map" (map 4) (unfoldrMK streamLen)
692− -- , benchFold "fmap" (fmapK 4) (unfoldrMK streamLen)
693− , benchFold "mapM" (mapM 4) (unfoldrMK streamLen)
694− -- , benchFold "mapMSerial" (mapMSerial 4) (unfoldrM streamLen)
695− -- XXX this is horribly slow
696− -- , benchFold "concatMap" (concatMap 4) (unfoldrM streamLen16)
697− ]
698−
699−-- Generate using K, fold using K, concat using D.concatMap
700−o_1_space_concat :: Int -> Benchmark
701−o_1_space_concat streamLen =
702− bgroup "concat"
703− [ {- benchIOSrc1 "concatMapPure (n of 1)"
704− (concatMapPure streamLen 1)
705− , benchIOSrc1 "concatMapPure (sqrt n of sqrt n)"
706− (concatMapPure streamLen2 streamLen2)
707− , benchIOSrc1 "concatMapPure (1 of n)"
708− (concatMapPure 1 streamLen)
709− -}
710−
711− benchIOSrc1 "concatMap (n of 1)"
712− (concatMap streamLen 1)
713− , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
714− (concatMap streamLen2 streamLen2)
715− , benchIOSrc1 "concatMap (1 of n)"
716− (concatMap 1 streamLen)
717−
718−{-
719− , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
720− (concatMapRepl streamLen2 streamLen2)
721−
722− -- This is for comparison with concatMapFoldableWith
723− , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
724− (S.drain
725− . S.concatMapWith S.serial id
726− . sourceConcatMapId streamLen)
727−
728− , benchIOSrc1 "concatMapBy serial (n of 1)"
729− (concatMapBySerial streamLen 1)
730− , benchIOSrc1 "concatMapBy serial (sqrt n of sqrt n)"
731− (concatMapBySerial streamLen2 streamLen2)
732− , benchIOSrc1 "concatMapBy serial (1 of n)"
733− (concatMapBySerial 1 streamLen)
734− , benchFold "sortBy" sortBy (unfoldrM streamLen)
735− -}
736− ]
737− where
738− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
739−
740−o_1_space_filtering :: Int -> Benchmark
741−o_1_space_filtering streamLen =
742− bgroup "filtering"
743− [ benchFold "filter-even" (filterEven 1) (unfoldrMK streamLen)
744− {-
745− , benchFold "filter-all-out" (filterAllOut streamLen 1) (unfoldrM streamLen)
746− , benchFold "filter-all-in" (filterAllIn streamLen 1) (unfoldrM streamLen)
747− , benchFold "take-all" (takeAll streamLen 1) (unfoldrM streamLen)
748− , benchFold "takeWhile-true" (takeWhileTrue streamLen 1) (unfoldrM streamLen)
749− , benchFold "drop-one" (dropOne 1) (unfoldrM streamLen)
750− , benchFold "drop-all" (dropAll streamLen 1) (unfoldrM streamLen)
751− , benchFold "dropWhile-true" (dropWhileTrue streamLen 1) (unfoldrM streamLen)
752− , benchFold "dropWhile-false" (dropWhileFalse 1) (unfoldrM streamLen)
753− -}
754− ]
755−
756−o_1_space_filteringX4 :: Int -> Benchmark
757−o_1_space_filteringX4 streamLen =
758− bgroup "filteringX4"
759− [ benchFold "filter-even" (filterEven 4) (unfoldrMK streamLen)
760− {-
761− , benchFold "filter-all-out" (filterAllOut streamLen 4) (unfoldrM streamLen)
762− , benchFold "filter-all-in" (filterAllIn streamLen 4) (unfoldrM streamLen)
763− , benchFold "take-all" (takeAll streamLen 4) (unfoldrM streamLen)
764− , benchFold "takeWhile-true" (takeWhileTrue streamLen 4) (unfoldrM streamLen)
765− , benchFold "drop-one" (dropOne 4) (unfoldrM streamLen)
766− , benchFold "drop-all" (dropAll streamLen 4) (unfoldrM streamLen)
767− , benchFold "dropWhile-true" (dropWhileTrue streamLen 4) (unfoldrM streamLen)
768− , benchFold "dropWhile-false" (dropWhileFalse 4) (unfoldrM streamLen)
769− -}
770− ]
771−
772−{-
773−o_1_space_zipping :: Int -> Benchmark
774−o_1_space_zipping streamLen =
775− bgroup "zipping"
776− [ benchFold "zipWith" zipWith (unfoldrM streamLen)
777− , benchFold "zipWithM" zipWithM (unfoldrM streamLen)
778− ]
779−
780−o_1_space_mixed :: Int -> Benchmark
781−o_1_space_mixed streamLen =
782− bgroup "mixed"
783− [ benchFold "scan-map" (scanMap 1) (unfoldrM streamLen)
784− , benchFold "drop-map" (dropMap 1) (unfoldrM streamLen)
785− , benchFold "drop-scan" (dropScan 1) (unfoldrM streamLen)
786− , benchFold "take-drop" (takeDrop streamLen 1) (unfoldrM streamLen)
787− , benchFold "take-scan" (takeScan streamLen 1) (unfoldrM streamLen)
788− , benchFold "take-map" (takeMap streamLen 1) (unfoldrM streamLen)
789− , benchFold "filter-drop" (filterDrop streamLen 1) (unfoldrM streamLen)
790− , benchFold "filter-take" (filterTake streamLen 1) (unfoldrM streamLen)
791− , benchFold "filter-scan" (filterScan 1) (unfoldrM streamLen)
792− , benchFold "filter-map" (filterMap streamLen 1) (unfoldrM streamLen)
793− ]
794−
795−o_1_space_mixedX2 :: Int -> Benchmark
796−o_1_space_mixedX2 streamLen =
797− bgroup "mixedX2"
798− [ benchFold "scan-map" (scanMap 2) (unfoldrM streamLen)
799− , benchFold "drop-map" (dropMap 2) (unfoldrM streamLen)
800− , benchFold "drop-scan" (dropScan 2) (unfoldrM streamLen)
801− , benchFold "take-drop" (takeDrop streamLen 2) (unfoldrM streamLen)
802− , benchFold "take-scan" (takeScan streamLen 2) (unfoldrM streamLen)
803− , benchFold "take-map" (takeMap streamLen 2) (unfoldrM streamLen)
804− , benchFold "filter-drop" (filterDrop streamLen 2) (unfoldrM streamLen)
805− , benchFold "filter-take" (filterTake streamLen 2) (unfoldrM streamLen)
806− , benchFold "filter-scan" (filterScan 2) (unfoldrM streamLen)
807− , benchFold "filter-map" (filterMap streamLen 2) (unfoldrM streamLen)
808− ]
809−
810−o_1_space_mixedX4 :: Int -> Benchmark
811−o_1_space_mixedX4 streamLen =
812− bgroup "mixedX4"
813− [ benchFold "scan-map" (scanMap 4) (unfoldrM streamLen)
814− , benchFold "drop-map" (dropMap 4) (unfoldrM streamLen)
815− , benchFold "drop-scan" (dropScan 4) (unfoldrM streamLen)
816− , benchFold "take-drop" (takeDrop streamLen 4) (unfoldrM streamLen)
817− , benchFold "take-scan" (takeScan streamLen 4) (unfoldrM streamLen)
818− , benchFold "take-map" (takeMap streamLen 4) (unfoldrM streamLen)
819− , benchFold "filter-drop" (filterDrop streamLen 4) (unfoldrM streamLen)
820− , benchFold "filter-take" (filterTake streamLen 4) (unfoldrM streamLen)
821− , benchFold "filter-scan" (filterScan 4) (unfoldrM streamLen)
822− , benchFold "filter-map" (filterMap streamLen 4) (unfoldrM streamLen)
823− ]
824− -}
825−
826−{-
827−o_1_space_list :: Int -> Benchmark
828−o_1_space_list streamLen =
829− bgroup "list"
830− [ bgroup "elimination"
831− [ benchList "last" (\xs -> [List.last xs]) (unfoldrList streamLen)
832− ]
833− , bgroup "nested"
834− [ benchList "toNullAp" toNullApNestedList (unfoldrList streamLen2)
835− , benchList "toNull" toNullNestedList (unfoldrList streamLen2)
836− , benchList "toNull3" toNullNestedList3 (unfoldrList streamLen3)
837− , benchList "filterAllIn" filterAllInNestedList (unfoldrList streamLen2)
838− , benchList "filterAllOut" filterAllOutNestedList (unfoldrList streamLen2)
839− ]
840− ]
841− where
842−
843− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
844− streamLen3 = round (P.fromIntegral streamLen**(1/3::P.Double)) -- triple nested loop
845−-}
846−
847−o_1_space :: Int -> Benchmark
848−o_1_space streamLen =
849− bgroup (o_1_space_prefix moduleName)
850− [ o_1_space_generation streamLen
851− , o_1_space_elimination streamLen
852− -- , o_1_space_nested streamLen
853− , o_1_space_transformation streamLen
854− , o_1_space_transformationX4 streamLen
855− , o_1_space_concat streamLen
856− , o_1_space_filtering streamLen
857− , o_1_space_filteringX4 streamLen
858− -- , o_1_space_zipping streamLen
859− -- , o_1_space_mixed streamLen
860− -- , o_1_space_mixedX2 streamLen
861− -- , o_1_space_mixedX4 streamLen
862− -- , o_1_space_list streamLen
863− ]
864−
865−{-
866−o_n_heap :: Int -> Benchmark
867−o_n_heap streamLen =
868− bgroup (o_n_heap_prefix moduleName)
869− [ bgroup "transformation"
870− [ benchFold "foldlS" (foldlS 1) (unfoldrM streamLen)
871− ]
872− ]
873−
874−{-# INLINE benchK #-}
875−benchK :: P.String -> (Int -> Stream P.IO Int) -> Benchmark
876−benchK name f = bench name $ nfIO $ randomRIO (1,1) >>= drain . f
877−
878−o_n_stack :: Int -> Int -> Int -> Benchmark
879−o_n_stack streamLen iterStreamLen maxIters =
880− bgroup (o_n_stack_prefix moduleName)
881− [ bgroup "elimination"
882− [ benchFold "tail" tail (unfoldrM streamLen)
883− , benchFold "nullTail" nullTail (unfoldrM streamLen)
884− , benchFold "headTail" headTail (unfoldrM streamLen)
885− ]
886− , bgroup "transformation"
887− [
888− -- XXX why do these need so much stack
889− benchFold "intersperse" (intersperse streamLen 1) (unfoldrM streamLen2)
890− , benchFold "interspersePure" (intersperse streamLen 1) (unfoldr streamLen2)
891− ]
892− , bgroup "transformationX4"
893− [
894− benchFold "intersperse" (intersperse streamLen 4) (unfoldrM streamLen16)
895− ]
896− , bgroup "iterated"
897− [ benchK "mapM" (iterateMapM iterStreamLen maxIters)
898− , benchK "scan(1/10)" (iterateScan iterStreamLen maxIters)
899− , benchK "filterEven" (iterateFilterEven iterStreamLen maxIters)
900− , benchK "takeAll" (iterateTakeAll streamLen iterStreamLen maxIters)
901− , benchK "dropOne" (iterateDropOne iterStreamLen maxIters)
902− , benchK "dropWhileFalse(1/10)" (iterateDropWhileFalse streamLen iterStreamLen maxIters)
903− , benchK "dropWhileTrue" (iterateDropWhileTrue streamLen iterStreamLen maxIters)
904− ]
905− ]
906− where
907− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
908− streamLen16 = round (P.fromIntegral streamLen**(1/16::P.Double)) -- triple nested loop
909−-}
910−
911−o_n_space :: Int -> Benchmark
912−o_n_space streamLen =
913− bgroup (o_n_space_prefix moduleName)
914− [ bgroup "elimination"
915− [ benchFold "toList" toList (unfoldrMK streamLen)
916− ]
917− ]
918−
919−{-
920−{-# INLINE benchList #-}
921−benchList :: P.String -> ([Int] -> [Int]) -> (Int -> [Int]) -> Benchmark
922−benchList name run f = bench name $ nfIO $ randomRIO (1,1) >>= return . run . f
923−-}
924−
925−main :: IO ()
926−main =
927− defaultMain
928− [ o_1_space streamLen
929− -- , o_n_stack streamLen iterStreamLen maxIters
930− -- , o_n_heap streamLen
931− , o_n_space streamLen
932− ]
933−
934− where
935−
936− streamLen = 100000
937− -- maxIters = 10000
938− -- iterStreamLen = 10
benchmark/Streamly/Benchmark/Data/Stream/Transform.hsdeleted−687
@@ -1,687 +0,0 @@
1−-- |
2−-- Module : Stream.Transform
3−-- Copyright : (c) 2018 Composewell Technologies
4−-- License : BSD-3-Clause
5−-- Maintainer : streamly@composewell.com
6−
7−{-# LANGUAGE CPP #-}
8−{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE FlexibleInstances #-}
10−{-# LANGUAGE ScopedTypeVariables #-}
11−{-# LANGUAGE RankNTypes #-}
12−
13−{-# OPTIONS_GHC -Wno-orphans #-}
14−#ifdef USE_PRELUDE
15−{-# OPTIONS_GHC -Wno-deprecations #-}
16−#endif
17−
18−#ifdef __HADDOCK_VERSION__
19−#undef INSPECTION
20−#endif
21−
22−#ifdef INSPECTION
23−{-# LANGUAGE TemplateHaskell #-}
24−{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
25−#endif
26−
27−module Stream.Transform (benchmarks) where
28−
29−import Control.Monad.IO.Class (MonadIO(..))
30−
31−import System.Random (randomRIO)
32−
33−import qualified Streamly.Internal.Data.Fold as FL
34−
35−import qualified Stream.Common as Common
36−import qualified Streamly.Internal.Data.Unfold as Unfold
37−
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
43−import qualified Streamly.Internal.Data.Stream.IsStream as Stream
44−import Streamly.Internal.Data.Time.Units
45−#else
46−import Streamly.Internal.Data.Stream (Stream)
47−import qualified Streamly.Internal.Data.Stream as Stream
48−#ifndef USE_STREAMLY_CORE
49−import qualified Streamly.Internal.Data.Stream.Prelude as Stream
50−#endif
51−#ifdef USE_STREAMK
52−import Control.DeepSeq (NFData(..))
53−import Data.Functor.Identity (Identity(..))
54−import qualified Prelude
55−import qualified Streamly.Internal.Data.Fold as Fold
56−import Streamly.Internal.Data.StreamK (StreamK)
57−import qualified Streamly.Internal.Data.StreamK as StreamK
58−#endif
59−#endif
60−
61−import Test.Tasty.Bench
62−import Stream.Common hiding (scanl')
63−import Streamly.Benchmark.Common
64−import Prelude hiding (sequence, mapM)
65−
66−#ifdef USE_PRELUDE
67−type Stream = Stream.SerialT
68−#endif
69−
70−-------------------------------------------------------------------------------
71−-- Pipelines (stream-to-stream transformations)
72−-------------------------------------------------------------------------------
73−
74−-------------------------------------------------------------------------------
75−-- one-to-one transformations
76−-------------------------------------------------------------------------------
77−
78−-------------------------------------------------------------------------------
79−-- Traversable Instance
80−-------------------------------------------------------------------------------
81−
82−#ifdef USE_STREAMK
83−{-# INLINE traversableTraverse #-}
84−traversableTraverse :: StreamK Identity Int -> IO (StreamK Identity Int)
85−traversableTraverse = traverse return
86−
87−{-# INLINE traversableSequenceA #-}
88−traversableSequenceA :: StreamK Identity Int -> IO (StreamK Identity Int)
89−traversableSequenceA = sequenceA . Prelude.fmap return
90−
91−{-# INLINE traversableMapM #-}
92−traversableMapM :: StreamK Identity Int -> IO (StreamK Identity Int)
93−traversableMapM = Prelude.mapM return
94−
95−{-# INLINE traversableSequence #-}
96−traversableSequence :: StreamK Identity Int -> IO (StreamK Identity Int)
97−traversableSequence = Prelude.sequence . Prelude.fmap return
98−
99−{-# INLINE benchPureSinkIO #-}
100−benchPureSinkIO
101− :: NFData b
102− => Int -> String -> (StreamK Identity Int -> IO b) -> Benchmark
103−benchPureSinkIO value name f =
104− bench name
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)
112−
113−o_n_space_traversable :: Int -> [Benchmark]
114−o_n_space_traversable value =
115− -- Buffering operations using heap proportional to number of elements.
116− [ bgroup "traversable"
117− -- Traversable instance
118− [ benchPureSinkIO value "traverse" traversableTraverse
119− , benchPureSinkIO value "sequenceA" traversableSequenceA
120− , benchPureSinkIO value "mapM" traversableMapM
121− , benchPureSinkIO value "sequence" traversableSequence
122− ]
123− ]
124−#endif
125−
126−-------------------------------------------------------------------------------
127−-- maps and scans
128−-------------------------------------------------------------------------------
129−
130−#ifdef USE_PRELUDE
131−{-# INLINE scanl' #-}
132−scanl' :: MonadIO m => Int -> Stream m Int -> m ()
133−scanl' n = composeN n $ Stream.scanl' (+) 0
134−
135−{-# INLINE scanlM' #-}
136−scanlM' :: MonadIO m => Int -> Stream m Int -> m ()
137−scanlM' n = composeN n $ Stream.scanlM' (\b a -> return $ b + a) (return 0)
138−
139−{-# INLINE scanl1' #-}
140−scanl1' :: MonadIO m => Int -> Stream m Int -> m ()
141−scanl1' n = composeN n $ Stream.scanl1' (+)
142−
143−{-# INLINE scanl1M' #-}
144−scanl1M' :: MonadIO m => Int -> Stream m Int -> m ()
145−scanl1M' n = composeN n $ Stream.scanl1M' (\b a -> return $ b + a)
146−#endif
147−
148−{-# INLINE scan #-}
149−scan :: MonadIO m => Int -> Stream m Int -> m ()
150−scan n = composeN n $ Stream.scan FL.sum
151−
152−#ifdef USE_PRELUDE
153−{-# INLINE postscanl' #-}
154−postscanl' :: MonadIO m => Int -> Stream m Int -> m ()
155−postscanl' n = composeN n $ Stream.postscanl' (+) 0
156−
157−{-# INLINE postscanlM' #-}
158−postscanlM' :: MonadIO m => Int -> Stream m Int -> m ()
159−postscanlM' n = composeN n $ Stream.postscanlM' (\b a -> return $ b + a) (return 0)
160−#endif
161−
162−{-# INLINE postscan #-}
163−postscan :: MonadIO m => Int -> Stream m Int -> m ()
164−postscan n = composeN n $ Stream.postscan FL.sum
165−
166−{-# INLINE sequence #-}
167−sequence :: MonadAsync m => Stream m (m Int) -> m ()
168−sequence = Common.drain . Stream.sequence
169−
170−{-# INLINE tap #-}
171−tap :: MonadIO m => Int -> Stream m Int -> m ()
172−tap n = composeN n $ Stream.tap FL.sum
173−
174−#ifdef USE_PRELUDE
175−{-# INLINE pollCounts #-}
176−pollCounts :: Int -> Stream IO Int -> IO ()
177−pollCounts n =
178− composeN n (Stream.pollCounts (const True) f)
179−
180− where
181−
182− f = Stream.drain . Stream.rollingMap2 (-) . Stream.delayPost 1
183−
184−{-# INLINE timestamped #-}
185−timestamped :: (MonadAsync m) => Stream m Int -> m ()
186−timestamped = Stream.drain . Stream.timestamped
187−#endif
188−
189−#ifdef USE_STREAMK
190−{-# INLINE foldrS #-}
191−foldrS :: MonadIO m => Int -> Stream m Int -> m ()
192−foldrS n =
193− composeN n (toStream . StreamK.foldrS StreamK.cons StreamK.nil . fromStream)
194−
195−{-# INLINE foldrSMap #-}
196−foldrSMap :: MonadIO m => Int -> Stream m Int -> m ()
197−foldrSMap n =
198− composeN n
199− ( toStream
200− . StreamK.foldrS (\x xs -> x + 1 `StreamK.cons` xs) StreamK.nil
201− . fromStream
202− )
203−#endif
204−
205−{-
206−{-# INLINE foldrT #-}
207−foldrT :: MonadIO m => Int -> Stream m Int -> m ()
208−foldrT n = composeN n (unCrossStream . Stream.foldrT cns (CrossStream Stream.nil))
209−
210− where cns x (CrossStream xs) = CrossStream (Stream.cons x xs)
211−
212−{-# INLINE foldrTMap #-}
213−foldrTMap :: MonadIO m => Int -> Stream m Int -> m ()
214−foldrTMap n = composeN n $ Stream.foldrT (\x xs -> x + 1 `Stream.cons` xs) Stream.nil
215−-}
216−
217−{-# INLINE trace #-}
218−trace :: MonadAsync m => Int -> Stream m Int -> m ()
219−trace n = composeN n $ Stream.trace return
220−
221−o_1_space_mapping :: Int -> [Benchmark]
222−o_1_space_mapping value =
223− [ bgroup
224− "mapping"
225− [
226−#ifdef USE_STREAMK
227− -- Right folds
228− benchIOSink value "foldrS" (foldrS 1)
229− , benchIOSink value "foldrSMap" (foldrSMap 1)
230− ,
231−#endif
232− -- , benchIOSink value "foldrT" (foldrT 1)
233− -- , benchIOSink value "foldrTMap" (foldrTMap 1)
234−
235− -- Mapping
236− benchIOSink value "map" (mapN 1)
237− , bench "sequence" $ nfIO $ randomRIO (1, 1000) >>= \n ->
238− sequence (sourceUnfoldrAction value n)
239− , benchIOSink value "mapM" (mapM 1)
240− , benchIOSink value "tap" (tap 1)
241−#ifdef USE_PRELUDE
242− , benchIOSink value "pollCounts 1 second" (pollCounts 1)
243− , benchIOSink value "timestamped" timestamped
244−
245− -- Scanning
246− , benchIOSink value "scanl'" (scanl' 1)
247− , benchIOSink value "scanl1'" (scanl1' 1)
248− , benchIOSink value "scanlM'" (scanlM' 1)
249− , benchIOSink value "scanl1M'" (scanl1M' 1)
250− , benchIOSink value "postscanl'" (postscanl' 1)
251− , benchIOSink value "postscanlM'" (postscanlM' 1)
252−#endif
253− , benchIOSink value "scan" (scan 1)
254− , benchIOSink value "postscan" (postscan 1)
255− ]
256− ]
257−
258−o_1_space_mappingX4 :: Int -> [Benchmark]
259−o_1_space_mappingX4 value =
260− [ bgroup "mappingX4"
261− [ benchIOSink value "map" (mapN 4)
262− , benchIOSink value "mapM" (mapM 4)
263− , benchIOSink value "trace" (trace 4)
264−
265−#ifdef USE_PRELUDE
266− , benchIOSink value "scanl'" (scanl' 4)
267− , benchIOSink value "scanl1'" (scanl1' 4)
268− , benchIOSink value "scanlM'" (scanlM' 4)
269− , benchIOSink value "scanl1M'" (scanl1M' 4)
270− , benchIOSink value "postscanl'" (postscanl' 4)
271− , benchIOSink value "postscanlM'" (postscanlM' 4)
272−#endif
273− ]
274− ]
275−
276−{-# INLINE sieveScan #-}
277−sieveScan :: Monad m => Stream m Int -> Stream m Int
278−sieveScan =
279− Stream.mapMaybe snd
280− . Stream.scan (FL.foldlM' (\(primes, _) n -> do
281− return $
282− let ps = takeWhile (\p -> p * p <= n) primes
283− in if all (\p -> n `mod` p /= 0) ps
284− then (primes ++ [n], Just n)
285− else (primes, Nothing)) (return ([2], Just 2)))
286−
287−o_n_space_mapping :: Int -> [Benchmark]
288−o_n_space_mapping value =
289− [ bgroup "mapping"
290− [ benchIO "naive prime sieve"
291− (\n -> Stream.fold FL.sum $ sieveScan $ Stream.enumerateFromTo 2 (value + n))
292− ]
293− ]
294−
295−-------------------------------------------------------------------------------
296−-- Functor
297−-------------------------------------------------------------------------------
298−
299−o_1_space_functor :: Int -> [Benchmark]
300−o_1_space_functor value =
301− [ bgroup "Functor"
302− [ benchIOSink value "fmap" (mapN 1)
303− , benchIOSink value "fmap x 4" (mapN 4)
304− ]
305− ]
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−
374−-------------------------------------------------------------------------------
375−-- Size reducing transformations (filtering)
376−-------------------------------------------------------------------------------
377−
378−{-# INLINE filterEven #-}
379−filterEven :: MonadIO m => Int -> Stream m Int -> m ()
380−filterEven n = composeN n $ Stream.filter even
381−
382−{-# INLINE filterAllOut #-}
383−filterAllOut :: MonadIO m => Int -> Int -> Stream m Int -> m ()
384−filterAllOut value n = composeN n $ Stream.filter (> (value + 1))
385−
386−{-# INLINE filterAllIn #-}
387−filterAllIn :: MonadIO m => Int -> Int -> Stream m Int -> m ()
388−filterAllIn value n = composeN n $ Stream.filter (<= (value + 1))
389−
390−{-# INLINE filterMEven #-}
391−filterMEven :: MonadIO m => Int -> Stream m Int -> m ()
392−filterMEven n = composeN n $ Stream.filterM (return . even)
393−
394−{-# INLINE filterMAllOut #-}
395−filterMAllOut :: MonadIO m => Int -> Int -> Stream m Int -> m ()
396−filterMAllOut value n = composeN n $ Stream.filterM (\x -> return $ x > (value + 1))
397−
398−{-# INLINE filterMAllIn #-}
399−filterMAllIn :: MonadIO m => Int -> Int -> Stream m Int -> m ()
400−filterMAllIn value n = composeN n $ Stream.filterM (\x -> return $ x <= (value + 1))
401−
402−{-# INLINE _takeOne #-}
403−_takeOne :: MonadIO m => Int -> Stream m Int -> m ()
404−_takeOne n = composeN n $ Stream.take 1
405−
406−{-# INLINE takeAll #-}
407−takeAll :: MonadIO m => Int -> Int -> Stream m Int -> m ()
408−takeAll value n = composeN n $ Stream.take (value + 1)
409−
410−{-# INLINE takeWhileTrue #-}
411−takeWhileTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
412−takeWhileTrue value n = composeN n $ Stream.takeWhile (<= (value + 1))
413−
414−{-# INLINE takeWhileMTrue #-}
415−takeWhileMTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
416−takeWhileMTrue value n = composeN n $ Stream.takeWhileM (return . (<= (value + 1)))
417−
418−#if !defined(USE_STREAMLY_CORE) && !defined(USE_PRELUDE)
419−{-# INLINE takeInterval #-}
420−takeInterval :: Double -> Int -> Stream IO Int -> IO ()
421−takeInterval i n = composeN n (Stream.takeInterval i)
422−
423−-- Inspection testing is disabled for takeInterval
424−-- Enable it when looking at it throughly
425−#ifdef INSPECTION
426−-- inspect $ hasNoType 'takeInterval ''SPEC
427−-- inspect $ hasNoTypeClasses 'takeInterval
428−-- inspect $ 'takeInterval `hasNoType` ''D.Step
429−#endif
430−
431−{-# INLINE dropInterval #-}
432−dropInterval :: Double -> Int -> Stream IO Int -> IO ()
433−dropInterval i n = composeN n (Stream.dropInterval i)
434−
435−-- Inspection testing is disabled for dropInterval
436−-- Enable it when looking at it throughly
437−#ifdef INSPECTION
438−-- inspect $ hasNoTypeClasses 'dropInterval
439−-- inspect $ 'dropInterval `hasNoType` ''D.Step
440−#endif
441−#endif
442−
443−{-# INLINE dropOne #-}
444−dropOne :: MonadIO m => Int -> Stream m Int -> m ()
445−dropOne n = composeN n $ Stream.drop 1
446−
447−{-# INLINE dropAll #-}
448−dropAll :: MonadIO m => Int -> Int -> Stream m Int -> m ()
449−dropAll value n = composeN n $ Stream.drop (value + 1)
450−
451−{-# INLINE dropWhileTrue #-}
452−dropWhileTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
453−dropWhileTrue value n = composeN n $ Stream.dropWhile (<= (value + 1))
454−
455−{-# INLINE dropWhileMTrue #-}
456−dropWhileMTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
457−dropWhileMTrue value n = composeN n $ Stream.dropWhileM (return . (<= (value + 1)))
458−
459−{-# INLINE dropWhileFalse #-}
460−dropWhileFalse :: MonadIO m => Int -> Int -> Stream m Int -> m ()
461−dropWhileFalse value n = composeN n $ Stream.dropWhile (> (value + 1))
462−
463−#ifdef USE_PRELUDE
464−-- XXX Decide on the time interval
465−{-# INLINE _intervalsOfSum #-}
466−_intervalsOfSum :: MonadAsync m => Double -> Int -> Stream m Int -> m ()
467−_intervalsOfSum i n = composeN n (Stream.intervalsOf i FL.sum)
468−#endif
469−
470−{-# INLINE findIndices #-}
471−findIndices :: MonadIO m => Int -> Int -> Stream m Int -> m ()
472−findIndices value n = composeN n $ Stream.findIndices (== (value + 1))
473−
474−{-# INLINE elemIndices #-}
475−elemIndices :: MonadIO m => Int -> Int -> Stream m Int -> m ()
476−elemIndices value n = composeN n $ Stream.elemIndices (value + 1)
477−
478−{-# INLINE deleteBy #-}
479−deleteBy :: MonadIO m => Int -> Int -> Stream m Int -> m ()
480−deleteBy value n = composeN n $ Stream.deleteBy (>=) (value + 1)
481−
482−-- uniq . uniq == uniq, composeN 2 ~ composeN 1
483−{-# INLINE uniq #-}
484−uniq :: MonadIO m => Int -> Stream m Int -> m ()
485−uniq n = composeN n Stream.uniq
486−
487−{-# INLINE mapMaybe #-}
488−mapMaybe :: MonadIO m => Int -> Stream m Int -> m ()
489−mapMaybe n =
490− composeN n $
491− Stream.mapMaybe
492− (\x ->
493− if odd x
494− then Nothing
495− else Just x)
496−
497−{-# INLINE mapMaybeM #-}
498−mapMaybeM :: MonadAsync m => Int -> Stream m Int -> m ()
499−mapMaybeM n =
500− composeN n $
501− Stream.mapMaybeM
502− (\x ->
503− if odd x
504− then return Nothing
505− else return $ Just x)
506−
507−o_1_space_filtering :: Int -> [Benchmark]
508−o_1_space_filtering value =
509− [ bgroup "filtering"
510− [ benchIOSink value "filter-even" (filterEven 1)
511− , benchIOSink value "filter-all-out" (filterAllOut value 1)
512− , benchIOSink value "filter-all-in" (filterAllIn value 1)
513−
514− , benchIOSink value "filterM-even" (filterMEven 1)
515− , benchIOSink value "filterM-all-out" (filterMAllOut value 1)
516− , benchIOSink value "filterM-all-in" (filterMAllIn value 1)
517−
518− -- Trimming
519− , benchIOSink value "take-all" (takeAll value 1)
520− , benchIOSink value "takeWhile-true" (takeWhileTrue value 1)
521− -- , benchIOSink value "takeWhileM-true" (_takeWhileMTrue value 1)
522− , benchIOSink value "drop-one" (dropOne 1)
523− , benchIOSink value "drop-all" (dropAll value 1)
524−#if !defined(USE_STREAMLY_CORE) && !defined(USE_PRELUDE)
525− , benchIOSink value "takeInterval-all" (takeInterval 10000 1)
526− , benchIOSink value "dropInterval-all" (dropInterval 10000 1)
527−#endif
528− , benchIOSink value "dropWhile-true" (dropWhileTrue value 1)
529− -- , benchIOSink value "dropWhileM-true" (_dropWhileMTrue value 1)
530− , benchIOSink
531− value
532− "dropWhile-false"
533− (dropWhileFalse value 1)
534− , benchIOSink value "deleteBy" (deleteBy value 1)
535−
536− , benchIOSink value "uniq" (uniq 1)
537−
538− -- Map and filter
539− , benchIOSink value "mapMaybe" (mapMaybe 1)
540− , benchIOSink value "mapMaybeM" (mapMaybeM 1)
541−
542− -- Searching (stateful map and filter)
543− , benchIOSink value "findIndices" (findIndices value 1)
544− , benchIOSink value "elemIndices" (elemIndices value 1)
545− ]
546− ]
547−
548−o_1_space_filteringX4 :: Int -> [Benchmark]
549−o_1_space_filteringX4 value =
550− [ bgroup "filteringX4"
551− [ benchIOSink value "filter-even" (filterEven 4)
552− , benchIOSink value "filter-all-out" (filterAllOut value 4)
553− , benchIOSink value "filter-all-in" (filterAllIn value 4)
554−
555− , benchIOSink value "filterM-even" (filterMEven 4)
556− , benchIOSink value "filterM-all-out" (filterMAllOut value 4)
557− , benchIOSink value "filterM-all-in" (filterMAllIn value 4)
558−
559− -- trimming
560− , benchIOSink value "take-all" (takeAll value 4)
561− , benchIOSink value "takeWhile-true" (takeWhileTrue value 4)
562− , benchIOSink value "takeWhileM-true" (takeWhileMTrue value 4)
563− , benchIOSink value "drop-one" (dropOne 4)
564− , benchIOSink value "drop-all" (dropAll value 4)
565− , benchIOSink value "dropWhile-true" (dropWhileTrue value 4)
566− , benchIOSink value "dropWhileM-true" (dropWhileMTrue value 4)
567− , benchIOSink
568− value
569− "dropWhile-false"
570− (dropWhileFalse value 4)
571− , benchIOSink value "deleteBy" (deleteBy value 4)
572−
573− , benchIOSink value "uniq" (uniq 4)
574−
575− -- map and filter
576− , benchIOSink value "mapMaybe" (mapMaybe 4)
577− , benchIOSink value "mapMaybeM" (mapMaybeM 4)
578−
579− -- searching
580− , benchIOSink value "findIndices" (findIndices value 4)
581− , benchIOSink value "elemIndices" (elemIndices value 4)
582− ]
583− ]
584−
585−-------------------------------------------------------------------------------
586−-- Size increasing transformations (insertions)
587−-------------------------------------------------------------------------------
588−
589−{-# INLINE intersperse #-}
590−intersperse :: MonadAsync m => Int -> Int -> Stream m Int -> m ()
591−intersperse value n = composeN n $ Stream.intersperse (value + 1)
592−
593−{-# INLINE intersperseM #-}
594−intersperseM :: MonadAsync m => Int -> Int -> Stream m Int -> m ()
595−intersperseM value n = composeN n $ Stream.intersperseM (return $ value + 1)
596−
597−{-# INLINE insertBy #-}
598−insertBy :: MonadIO m => Int -> Int -> Stream m Int -> m ()
599−insertBy value n = composeN n $ Stream.insertBy compare (value + 1)
600−
601−{-# INLINE interposeSuffix #-}
602−interposeSuffix :: Monad m => Int -> Int -> Stream m Int -> m ()
603−interposeSuffix value n =
604− composeN n $ Stream.interposeSuffix (value + 1) Unfold.identity
605−
606−{-# INLINE intercalateSuffix #-}
607−intercalateSuffix :: Monad m => Int -> Int -> Stream m Int -> m ()
608−intercalateSuffix value n =
609− composeN n $ Stream.intercalateSuffix Unfold.identity (value + 1)
610−
611−o_1_space_inserting :: Int -> [Benchmark]
612−o_1_space_inserting value =
613− [ bgroup "inserting"
614− [ benchIOSink value "intersperse" (intersperse value 1)
615− , benchIOSink value "intersperseM" (intersperseM value 1)
616− , benchIOSink value "insertBy" (insertBy value 1)
617− , benchIOSink value "interposeSuffix" (interposeSuffix value 1)
618− , benchIOSink value "intercalateSuffix" (intercalateSuffix value 1)
619− ]
620− ]
621−
622−o_1_space_insertingX4 :: Int -> [Benchmark]
623−o_1_space_insertingX4 value =
624− [ bgroup "insertingX4"
625− [ benchIOSink value "intersperse" (intersperse value 4)
626− , benchIOSink value "insertBy" (insertBy value 4)
627− ]
628− ]
629−
630−-------------------------------------------------------------------------------
631−-- Indexing
632−-------------------------------------------------------------------------------
633−
634−{-# INLINE indexed #-}
635−indexed :: MonadIO m => Int -> Stream m Int -> m ()
636−indexed n = composeN n (fmap snd . Stream.indexed)
637−
638−{-# INLINE indexedR #-}
639−indexedR :: MonadIO m => Int -> Int -> Stream m Int -> m ()
640−indexedR value n = composeN n (fmap snd . Stream.indexedR value)
641−
642−o_1_space_indexing :: Int -> [Benchmark]
643−o_1_space_indexing value =
644− [ bgroup "indexing"
645− [ benchIOSink value "indexed" (indexed 1)
646− , benchIOSink value "indexedR" (indexedR value 1)
647− ]
648− ]
649−
650−o_1_space_indexingX4 :: Int -> [Benchmark]
651−o_1_space_indexingX4 value =
652− [ bgroup "indexingx4"
653− [ benchIOSink value "indexed" (indexed 4)
654− , benchIOSink value "indexedR" (indexedR value 4)
655− ]
656− ]
657−
658−-------------------------------------------------------------------------------
659−-- Main
660−-------------------------------------------------------------------------------
661−
662−-- In addition to gauge options, the number of elements in the stream can be
663−-- passed using the --stream-size option.
664−--
665−benchmarks :: String -> Int -> [Benchmark]
666−benchmarks moduleName size =
667− [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
668− [ o_1_space_functor size
669− , o_1_space_mapping size
670− , o_1_space_mappingX4 size
671− , o_1_space_filtering size
672− , o_1_space_filteringX4 size
673− , o_1_space_inserting size
674− , o_1_space_insertingX4 size
675− , o_1_space_indexing size
676− , o_1_space_indexingX4 size
677− ]
678− , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
679− [
680−#ifdef USE_STREAMK
681− o_n_space_traversable size
682− ,
683−#endif
684− o_n_space_mapping size
685− , o_n_space_iterated size
686− ]
687− ]
benchmark/Streamly/Benchmark/Data/Unfold.hs+119−319
@@ -20,29 +20,27 @@
2020module Main (main) where
2121
2222import Control.DeepSeq (NFData(..))
23−import Control.Exception (SomeException, ErrorCall, try)
24−import Data.Char (ord)
25−import Data.Word (Word8)
23+import Control.Exception (SomeException)
2624import Streamly.Internal.Data.Unfold (Unfold)
2725import System.IO (Handle, hClose)
2826import System.Random (randomRIO)
2927
3028import qualified Prelude
29+import qualified Streamly.Benchmark.Data.NestedUnfoldOps as Nested
3130import qualified Streamly.FileSystem.Handle as FH
3231import qualified Streamly.Internal.Data.Fold as FL
3332import qualified Streamly.Internal.Data.Unfold as UF
34−import qualified Streamly.Internal.Data.Unfold.Prelude as UF
35−import qualified Streamly.Internal.Data.Stream as S
36−import qualified Streamly.Internal.Data.Stream as D
37−import qualified Streamly.Internal.Data.StreamK as K
33+import qualified Streamly.Internal.Data.Stream.IsStream as S
34+import qualified Streamly.Internal.Data.Stream.StreamD as D
35+import qualified Streamly.Internal.Data.Stream.StreamK as K
36+import qualified Streamly.Prelude as SP
3837
39−import Test.Tasty.Bench hiding (env)
40−import Prelude hiding (take, filter, zipWith, map, mapM, takeWhile)
38+import Gauge hiding (env)
39+import Prelude hiding (concat, take, filter, zipWith, map, mapM, takeWhile)
4140import Streamly.Benchmark.Common
4241import Streamly.Benchmark.Common.Handle
4342
4443#ifdef INSPECTION
45−import Control.Monad.Catch (MonadCatch)
4644import Test.Inspection
4745#endif
4846
@@ -50,22 +48,13 @@ import Test.Inspection
5048benchIO :: (NFData b) => String -> (Int -> IO b) -> Benchmark
5149benchIO name f = bench name $ nfIO $ randomRIO (1,1) >>= f
5250
53−-------------------------------------------------------------------------------
54−-- Stream generation and elimination
55−-------------------------------------------------------------------------------
56−
57−-- generate numbers up to the argument value
58−{-# INLINE source #-}
59−source :: Monad m => Int -> Unfold m Int Int
60−source n = UF.second n UF.enumerateFromToIntegral
61−
6251-------------------------------------------------------------------------------
6352-- Benchmark helpers
6453-------------------------------------------------------------------------------
6554
6655{-# INLINE drainGeneration #-}
6756drainGeneration :: Monad m => Unfold m a b -> a -> m ()
68−drainGeneration unf seed = UF.fold FL.drain unf seed
57+drainGeneration unf seed = UF.fold unf FL.drain seed
6958
7059{-# INLINE drainTransformation #-}
7160drainTransformation ::
@@ -76,7 +65,7 @@ drainTransformation unf f seed = drainGeneration (f unf) seed
7665drainTransformationDefault ::
7766 Monad m => Int -> (Unfold m Int Int -> Unfold m c d) -> c -> m ()
7867drainTransformationDefault to =
79− drainTransformation (UF.second to UF.enumerateFromToIntegral)
68+ drainTransformation (UF.enumerateFromToIntegral to)
8069
8170{-# INLINE drainProduct #-}
8271drainProduct ::
@@ -99,7 +88,7 @@ drainProductDefault to = drainProduct src src
9988
10089 where
10190
102− src = UF.second to UF.enumerateFromToIntegral
91+ src = UF.enumerateFromToIntegral to
10392
10493-------------------------------------------------------------------------------
10594-- Operations on input
@@ -115,26 +104,26 @@ lmapM :: Monad m => Int -> Int -> m ()
115104lmapM size start =
116105 drainTransformationDefault (size + start) (UF.lmapM (return . (+) 1)) start
117106
118−{-# INLINE both #-}
119−both :: Monad m => Int -> Int -> m ()
120−both size start =
121− drainTransformationDefault (size + start) (UF.both start) undefined
107+{-# INLINE supply #-}
108+supply :: Monad m => Int -> Int -> m ()
109+supply size start =
110+ drainTransformationDefault (size + start) (flip UF.supply start) undefined
122111
123112
124−{-# INLINE first #-}
125−first :: Monad m => Int -> Int -> m ()
126−first size start =
113+{-# INLINE supplyFirst #-}
114+supplyFirst :: Monad m => Int -> Int -> m ()
115+supplyFirst size start =
127116 drainTransformation
128− (UF.take size UF.enumerateFromThenIntegral)
129− (UF.first start)
117+ (UF.take size UF.enumerateFromStepIntegral)
118+ (flip UF.supplyFirst start)
130119 1
131120
132−{-# INLINE second #-}
133−second :: Monad m => Int -> Int -> m ()
134−second size start =
121+{-# INLINE supplySecond #-}
122+supplySecond :: Monad m => Int -> Int -> m ()
123+supplySecond size start =
135124 drainTransformation
136− (UF.take size UF.enumerateFromThenIntegral)
137− (UF.second 1)
125+ (UF.take size UF.enumerateFromStepIntegral)
126+ (flip UF.supplySecond 1)
138127 start
139128
140129{-# INLINE discardFirst #-}
@@ -151,7 +140,7 @@ discardSecond size start =
151140swap :: Monad m => Int -> Int -> m ()
152141swap size start =
153142 drainTransformation
154− (UF.take size UF.enumerateFromThenIntegral)
143+ (UF.take size UF.enumerateFromStepIntegral)
155144 UF.swap
156145 (1, start)
157146
@@ -162,7 +151,7 @@ swap size start =
162151{-# INLINE fromStream #-}
163152fromStream :: Int -> Int -> IO ()
164153fromStream size start =
165− drainGeneration UF.fromStream (S.replicate size start :: S.Stream IO Int)
154+ drainGeneration UF.fromStream (S.replicate size start :: S.SerialT IO Int)
166155
167156-- XXX INVESTIGATE: Although the performance of this should be equivalant to
168157-- fromStream, this is considerably worse. More than 4x worse.
@@ -184,13 +173,18 @@ consM :: Monad m => Int -> Int -> m ()
184173consM size start =
185174 drainTransformationDefault (size + start) (UF.consM return) start
186175
187−{-# INLINE _functionM #-}
188−_functionM :: Monad m => Int -> Int -> m ()
189−_functionM _ start = drainGeneration (UF.functionM return) start
176+{-# INLINE _effect #-}
177+_effect :: Monad m => Int -> Int -> m ()
178+_effect _ start =
179+ drainGeneration (UF.effect (return start)) undefined
180+
181+{-# INLINE _singletonM #-}
182+_singletonM :: Monad m => Int -> Int -> m ()
183+_singletonM _ start = drainGeneration (UF.singletonM return) start
190184
191−{-# INLINE _function #-}
192−_function :: Monad m => Int -> Int -> m ()
193−_function _ start = drainGeneration (UF.function id) start
185+{-# INLINE _singleton #-}
186+_singleton :: Monad m => Int -> Int -> m ()
187+_singleton _ start = drainGeneration (UF.singleton id) start
194188
195189{-# INLINE _identity #-}
196190_identity :: Monad m => Int -> Int -> m ()
@@ -199,7 +193,7 @@ _identity _ start = drainGeneration UF.identity start
199193{-# INLINE _const #-}
200194_const :: Monad m => Int -> Int -> m ()
201195_const size start =
202− drainGeneration (UF.take size (UF.fromEffect (return start))) undefined
196+ drainGeneration (UF.take size (UF.const (return start))) undefined
203197
204198{-# INLINE unfoldrM #-}
205199unfoldrM :: Monad m => Int -> Int -> m ()
@@ -232,7 +226,7 @@ _fromProducer = undefined
232226
233227{-# INLINE replicateM #-}
234228replicateM :: Monad m => Int -> Int -> m ()
235−replicateM size start = drainGeneration UF.replicateM (size, return start)
229+replicateM size start = drainGeneration (UF.replicateM size) (return start)
236230
237231{-# INLINE repeatM #-}
238232repeatM :: Monad m => Int -> Int -> m ()
@@ -248,19 +242,15 @@ fromIndicesM :: Monad m => Int -> Int -> m ()
248242fromIndicesM size start =
249243 drainGeneration (UF.take size (UF.fromIndicesM return)) start
250244
251−{-# INLINE enumerateFromThenIntegral #-}
252−enumerateFromThenIntegral :: Monad m => Int -> Int -> m ()
253−enumerateFromThenIntegral size start =
254− drainGeneration (UF.take size UF.enumerateFromThenIntegral) (start, 1)
245+{-# INLINE enumerateFromStepIntegral #-}
246+enumerateFromStepIntegral :: Monad m => Int -> Int -> m ()
247+enumerateFromStepIntegral size start =
248+ drainGeneration (UF.take size UF.enumerateFromStepIntegral) (start, 1)
255249
256250{-# INLINE enumerateFromToIntegral #-}
257251enumerateFromToIntegral :: Monad m => Int -> Int -> m ()
258252enumerateFromToIntegral size start =
259− drainGeneration
260− ( UF.second
261− (size + start)
262− UF.enumerateFromToIntegral
263− ) start
253+ drainGeneration (UF.enumerateFromToIntegral (size + start)) start
264254
265255{-# INLINE enumerateFromIntegral #-}
266256enumerateFromIntegral :: Monad m => Int -> Int -> m ()
@@ -270,32 +260,24 @@ enumerateFromIntegral size start =
270260{-# INLINE enumerateFromStepNum #-}
271261enumerateFromStepNum :: Monad m => Int -> Int -> m ()
272262enumerateFromStepNum size start =
273− drainGeneration (UF.take size (UF.enumerateFromThenNum)) (start, 1)
263+ drainGeneration (UF.take size (UF.enumerateFromStepNum 1)) start
274264
275−{-# INLINE enumerateFromNum #-}
276−enumerateFromNum :: Monad m => Int -> Int -> m ()
277−enumerateFromNum size start = drainGeneration (UF.take size UF.enumerateFromNum) start
265+{-# INLINE numFrom #-}
266+numFrom :: Monad m => Int -> Int -> m ()
267+numFrom size start = drainGeneration (UF.take size UF.numFrom) start
278268
279269{-# INLINE enumerateFromToFractional #-}
280270enumerateFromToFractional :: Monad m => Int -> Int -> m ()
281271enumerateFromToFractional size start =
282272 let intToDouble x = (fromInteger (fromIntegral x)) :: Double
283273 in drainGeneration
284− ( UF.second
285− (intToDouble $ start + size)
286− UF.enumerateFromToFractional
287− )
274+ (UF.enumerateFromToFractional (intToDouble $ start + size))
288275 (intToDouble start)
289276
290277-------------------------------------------------------------------------------
291278-- Stream transformation
292279-------------------------------------------------------------------------------
293280
294−{-# INLINE postscan #-}
295−postscan :: Monad m => Int -> Int -> m ()
296−postscan size start =
297− drainTransformationDefault (size + start) (UF.postscan FL.sum) start
298−
299281{-# INLINE map #-}
300282map :: Monad m => Int -> Int -> m ()
301283map size start = drainTransformationDefault (size + start) (UF.map (+1)) start
@@ -305,12 +287,12 @@ mapM :: Monad m => Int -> Int -> m ()
305287mapM size start =
306288 drainTransformationDefault (size + start) (UF.mapM (return . (+) 1)) start
307289
308−{-# INLINE mapM2 #-}
309−mapM2 :: Monad m => Int -> Int -> m ()
310−mapM2 size start =
290+{-# INLINE mapMWithInput #-}
291+mapMWithInput :: Monad m => Int -> Int -> m ()
292+mapMWithInput size start =
311293 drainTransformationDefault
312294 size
313− (UF.mapM2 (\a b -> return $ a + b))
295+ (UF.mapMWithInput (\a b -> return $ a + b))
314296 start
315297
316298-------------------------------------------------------------------------------
@@ -399,7 +381,7 @@ dropWhileMFalse size start =
399381{-# INLINE zipWith #-}
400382zipWith :: Monad m => Int -> Int -> m ()
401383zipWith size start =
402− drainProductDefault (size + start) (UF.zipWith (+)) start
384+ drainProductDefault (size + start) (UF.zipWith (+)) (start, start + 1)
403385
404386{-# INLINE zipWithM #-}
405387zipWithM :: Monad m => Int -> Int -> m ()
@@ -407,27 +389,36 @@ zipWithM size start =
407389 drainProductDefault
408390 (size + start)
409391 (UF.zipWithM (\a b -> return $ a + b))
410− start
392+ (start, start + 1)
411393
412394{-# INLINE teeZipWith #-}
413395teeZipWith :: Monad m => Int -> Int -> m ()
414396teeZipWith size start =
415− drainProductDefault (size + start) (UF.zipWith (+)) start
397+ drainProductDefault (size + start) (UF.teeZipWith (+)) start
416398
417399-------------------------------------------------------------------------------
418−-- Applicative
400+-- Nested
419401-------------------------------------------------------------------------------
420402
421−nthRoot :: Double -> Int -> Int
422−nthRoot n value = round (fromIntegral value**(1/n))
403+{-# INLINE concatMapM #-}
404+concatMapM :: Monad m => Int -> Int -> m ()
405+concatMapM size start =
406+ drainGeneration (UF.concatMapM unfoldInGen unfoldOut) start
423407
424−{-# INLINE toNullAp #-}
425−toNullAp :: Monad m => Int -> Int -> m ()
426−toNullAp value start =
427− let end = start + nthRoot 2 value
428− s = source end
429− -- in UF.fold ((+) <$> s <*> s) FL.drain start
430− in UF.fold FL.drain ((+) `fmap` s `UF.crossApply` s) start
408+ where
409+
410+ sizeOuter = 100
411+ sizeInner = size `div` sizeOuter
412+
413+ unfoldInGen i =
414+ return
415+ $ UF.supply (UF.enumerateFromToIntegral (i + sizeInner)) i
416+
417+ unfoldOut = UF.enumerateFromToIntegral (start + sizeOuter)
418+
419+{-# INLINE _ap #-}
420+_ap :: Int -> Int -> m ()
421+_ap = undefined
431422
432423{-# INLINE _apDiscardFst #-}
433424_apDiscardFst :: Int -> Int -> m ()
@@ -437,176 +428,6 @@ _apDiscardFst = undefined
437428_apDiscardSnd :: Int -> Int -> m ()
438429_apDiscardSnd = undefined
439430
440−-------------------------------------------------------------------------------
441−-- Monad
442−-------------------------------------------------------------------------------
443−
444−{-# INLINE concatMapM #-}
445−concatMapM :: Monad m => Int -> Int -> m ()
446−concatMapM value start =
447− val `seq` drainGeneration (UF.concatMapM unfoldInGen unfoldOut) start
448−
449− where
450−
451− val = nthRoot 2 value
452− unfoldInGen i = return (UF.second (i + val) UF.enumerateFromToIntegral)
453− unfoldOut = UF.second (start + val) UF.enumerateFromToIntegral
454−
455−{-# INLINE toNull #-}
456−toNull :: Monad m => Int -> Int -> m ()
457−toNull value start =
458− let end = start + nthRoot 2 value
459− src = source end
460− {-
461− u = do
462− x <- src
463− y <- src
464− return (x + y)
465− -}
466− u = src `UF.bind` \x ->
467− src `UF.bind` \y ->
468− UF.fromPure (x + y)
469− in UF.fold FL.drain u start
470−
471−
472−{-# INLINE toNull3 #-}
473−toNull3 :: Monad m => Int -> Int -> m ()
474−toNull3 value start =
475− let end = start + nthRoot 3 value
476− src = source end
477− {-
478− u = do
479− x <- src
480− y <- src
481− z <- src
482− return (x + y + z)
483− -}
484− u = src `UF.bind` \x ->
485− src `UF.bind` \y ->
486− UF.fromPure (x + y)
487− in UF.fold FL.drain u start
488−
489−{-# INLINE toList #-}
490−toList :: Monad m => Int -> Int -> m [Int]
491−toList value start = do
492− let end = start + nthRoot 2 value
493− src = source end
494− {-
495− u = do
496− x <- src
497− y <- src
498− return (x + y)
499− -}
500− u = src `UF.bind` \x ->
501− src `UF.bind` \y ->
502− UF.fromPure (x + y)
503− in UF.fold FL.toList u start
504−
505−{-# INLINE toListSome #-}
506−toListSome :: Monad m => Int -> Int -> m [Int]
507−toListSome value start = do
508− let end = start + nthRoot 2 value
509− src = source end
510− {-
511− u = do
512− x <- src
513− y <- src
514− return (x + y)
515− -}
516− u = src `UF.bind` \x ->
517− src `UF.bind` \y ->
518− UF.fromPure (x + y)
519− in UF.fold FL.toList (UF.take 1000 u) start
520−
521−{-# INLINE filterAllOut #-}
522−filterAllOut :: Monad m => Int -> Int -> m ()
523−filterAllOut value start = do
524− let end = start + nthRoot 2 value
525− src = source end
526− {-
527− u = do
528− x <- src
529− y <- src
530− -}
531− u = src `UF.bind` \x ->
532− src `UF.bind` \y ->
533− let s = x + y
534− in if s < 0
535− then UF.fromPure s
536− else UF.nilM (return . const ())
537− in UF.fold FL.drain u start
538−
539−{-# INLINE filterAllIn #-}
540−filterAllIn :: Monad m => Int -> Int -> m ()
541−filterAllIn value start = do
542− let end = start + nthRoot 2 value
543− src = source end
544− {-
545− u = do
546− x <- src
547− y <- src
548− -}
549− u = src `UF.bind` \x ->
550− src `UF.bind` \y ->
551− let s = x + y
552− in if s > 0
553− then UF.fromPure s
554− else UF.nilM (return . const ())
555− in UF.fold FL.drain u start
556−
557−{-# INLINE filterSome #-}
558−filterSome :: Monad m => Int -> Int -> m ()
559−filterSome value start = do
560− let end = start + nthRoot 2 value
561− src = source end
562− {-
563− u = do
564− x <- src
565− y <- src
566− -}
567− u = src `UF.bind` \x ->
568− src `UF.bind` \y ->
569− let s = x + y
570− in if s > 1100000
571− then UF.fromPure s
572− else UF.nilM (return . const ())
573− in UF.fold FL.drain u start
574−
575−{-# INLINE breakAfterSome #-}
576−breakAfterSome :: Int -> Int -> IO ()
577−breakAfterSome value start =
578− let end = start + nthRoot 2 value
579− src = source end
580− {-
581− u = do
582− x <- src
583− y <- src
584− -}
585− u = src `UF.bind` \x ->
586− src `UF.bind` \y ->
587− let s = x + y
588− in if s > 1100000
589− then error "break"
590− else UF.fromPure s
591− in do
592− (_ :: Either ErrorCall ()) <- try $ UF.fold FL.drain u start
593− return ()
594−
595−-------------------------------------------------------------------------------
596−-- Benchmark ops
597−-------------------------------------------------------------------------------
598−
599−-- n * (n + 1) / 2 == linearCount
600−concatCount :: Int -> Int
601−concatCount linearCount =
602− round (((1 + 8 * fromIntegral linearCount)**(1/2::Double) - 1) / 2)
603−
604−{-# INLINE many #-}
605−many :: Monad m => Int -> Int -> m ()
606−many linearCount start = do
607− let end = start + concatCount linearCount
608− UF.fold FL.drain (UF.many (source end) (source end)) start
609−
610431-------------------------------------------------------------------------------
611432-- Benchmarks
612433-------------------------------------------------------------------------------
@@ -620,9 +441,9 @@ o_1_space_transformation_input size =
620441 "transformation/input"
621442 [ benchIO "lmap" $ lmap size
622443 , benchIO "lmapM" $ lmapM size
623− , benchIO "both" $ both size
624− , benchIO "first" $ first size
625− , benchIO "second" $ second size
444+ , benchIO "supply" $ supply size
445+ , benchIO "supplyFirst" $ supplyFirst size
446+ , benchIO "supplySecond" $ supplySecond size
626447 , benchIO "discardFirst" $ discardFirst size
627448 , benchIO "discardSecond" $ discardSecond size
628449 , benchIO "swap" $ swap size
@@ -635,12 +456,13 @@ o_1_space_generation size =
635456 "generation"
636457 [ benchIO "fromStream" $ fromStream size
637458 , benchIO "fromStreamK" $ fromStreamK size
638− , benchIO "fromStreamD" $ fromStreamD size
459+ , benchIO "fromStreamD (n/100)" $ fromStreamD (size `div` 100)
639460 -- Very small benchmarks, reporting in ns
640461 -- , benchIO "nilM" $ nilM size
641462 , benchIO "consM" $ consM size
642− -- , benchIO "functionM" $ functionM size
643− -- , benchIO "function" $ function size
463+ -- , benchIO "effect" $ effect size
464+ -- , benchIO "singletonM" $ singletonM size
465+ -- , benchIO "singleton" $ singleton size
644466 -- , benchIO "identity" $ identity size
645467 -- , benchIO "const" $ const size
646468 , benchIO "unfoldrM" $ unfoldrM size
@@ -653,11 +475,11 @@ o_1_space_generation size =
653475 , benchIO "repeatM" $ repeatM size
654476 , benchIO "iterateM" $ iterateM size
655477 , benchIO "fromIndicesM" $ fromIndicesM size
656− , benchIO "enumerateFromThenIntegral" $ enumerateFromThenIntegral size
478+ , benchIO "enumerateFromStepIntegral" $ enumerateFromStepIntegral size
657479 , benchIO "enumerateFromToIntegral" $ enumerateFromToIntegral size
658480 , benchIO "enumerateFromIntegral" $ enumerateFromIntegral size
659481 , benchIO "enumerateFromStepNum" $ enumerateFromStepNum size
660− , benchIO "enumerateFromNum" $ enumerateFromNum size
482+ , benchIO "numFrom" $ numFrom size
661483 , benchIO "enumerateFromToFractional" $ enumerateFromToFractional size
662484 ]
663485 ]
@@ -668,8 +490,7 @@ o_1_space_transformation size =
668490 "transformation"
669491 [ benchIO "map" $ map size
670492 , benchIO "mapM" $ mapM size
671− , benchIO "mapM2" $ mapM2 size
672− , benchIO "postscan" $ postscan size
493+ , benchIO "mapMWithInput" $ mapMWithInput size
673494 ]
674495 ]
675496
@@ -702,44 +523,31 @@ o_1_space_zip size =
702523 ]
703524 ]
704525
705−lf :: Word8
706−lf = fromIntegral (ord '\n')
707−
708−-- | Split on line feed.
709−foldManySepBy :: Handle -> IO Int
710−foldManySepBy =
711− let u = UF.foldMany (FL.takeEndBy_ (== lf) FL.drain) FH.reader
712− in UF.fold FL.length u
713−
714−o_1_space_nested :: BenchEnv -> Int -> [Benchmark]
715−o_1_space_nested env size =
526+o_1_space_nested :: Int -> [Benchmark]
527+o_1_space_nested size =
716528 [ bgroup
717− "nested"
718− [ benchIO "(<*>) (sqrt n x sqrt n)" $ toNullAp size
529+ "outer-product"
530+ [ benchIO "toNull" $ Nested.toNull size
531+ , benchIO "toNull3" $ Nested.toNull3 size
532+ , benchIO "concat" $ Nested.concat size
533+ , benchIO "breakAfterSome" $ Nested.breakAfterSome size
534+ , benchIO "filterAllOut" $ Nested.filterAllOut size
535+ , benchIO "filterAllIn" $ Nested.filterAllIn size
536+ , benchIO "filterSome" $ Nested.filterSome size
537+ , benchIO "concatMapM (100 x n/100)" $ concatMapM size
719538 -- Unimplemented
539+ -- , benchIO "ap" $ ap size
720540 -- , benchIO "apDiscardFst" $ apDiscardFst size
721541 -- , benchIO "apDiscardSnd" $ apDiscardSnd size
722−
723− , benchIO "concatMapM (sqrt n x sqrt n)" $ concatMapM size
724− , benchIO "(>>=) (sqrt n x sqrt n)" $ toNull size
725− , benchIO "(>>=) (cubert n x cubert n x cubert n)" $ toNull3 size
726− , benchIO "breakAfterSome" $ breakAfterSome size
727− , benchIO "filterAllOut" $ filterAllOut size
728− , benchIO "filterAllIn" $ filterAllIn size
729− , benchIO "filterSome" $ filterSome size
730−
731− , benchIO "many" $ many size
732− , mkBench "foldMany (Fold.takeEndBy_ (== lf) Fold.drain)" env
733− $ \inh _ -> foldManySepBy inh
734542 ]
735543 ]
736544
737545o_n_space_nested :: Int -> [Benchmark]
738546o_n_space_nested size =
739547 [ bgroup
740− "nested"
741− [ benchIO "toList" $ toList size
742− , benchIO "toListSome" $ toListSome size
548+ "outer-product"
549+ [ benchIO "toList" $ Nested.toList size
550+ , benchIO "toListSome" $ Nested.toListSome size
743551 ]
744552 ]
745553
@@ -749,11 +557,11 @@ o_n_space_nested size =
749557-- | Send the file contents to /dev/null with exception handling
750558readWriteOnExceptionUnfold :: Handle -> Handle -> IO ()
751559readWriteOnExceptionUnfold inh devNull =
752− let readEx = UF.onException (\_ -> hClose inh) FH.reader
753− in S.fold (FH.write devNull) $ S.unfold readEx inh
560+ let readEx = UF.onException (\_ -> hClose inh) FH.read
561+ in SP.fold (FH.write devNull) $ SP.unfold readEx inh
754562
755563#ifdef INSPECTION
756−-- inspect $ hasNoTypeClasses 'readWriteOnExceptionUnfold
564+inspect $ hasNoTypeClasses 'readWriteOnExceptionUnfold
757565-- inspect $ 'readWriteOnExceptionUnfold `hasNoType` ''Step
758566#endif
759567
@@ -761,54 +569,45 @@ readWriteOnExceptionUnfold inh devNull =
761569readWriteHandleExceptionUnfold :: Handle -> Handle -> IO ()
762570readWriteHandleExceptionUnfold inh devNull =
763571 let handler (_e :: SomeException) = hClose inh >> return 10
764− readEx = UF.handle (UF.functionM handler) FH.reader
765− in S.fold (FH.write devNull) $ S.unfold readEx inh
572+ readEx = UF.handle (UF.singletonM handler) FH.read
573+ in SP.fold (FH.write devNull) $ SP.unfold readEx inh
766574
767575#ifdef INSPECTION
768−-- hasNoTypeClasses started failing in GHC 9.4.4
769−-- inspect $ hasNoTypeClasses 'readWriteHandleExceptionUnfold
576+inspect $ hasNoTypeClasses 'readWriteHandleExceptionUnfold
770577-- inspect $ 'readWriteHandleExceptionUnfold `hasNoType` ''Step
771578#endif
772579
773580-- | Send the file contents to /dev/null with exception handling
774581readWriteFinally_Unfold :: Handle -> Handle -> IO ()
775582readWriteFinally_Unfold inh devNull =
776− let readEx = UF.finally_ (\_ -> hClose inh) FH.reader
777− in S.fold (FH.write devNull) $ S.unfold readEx inh
583+ let readEx = UF.finally_ (\_ -> hClose inh) FH.read
584+ in SP.fold (FH.write devNull) $ SP.unfold readEx inh
778585
779586#ifdef INSPECTION
780−#if __GLASGOW_HASKELL__ >= 906
781−inspect $ hasNoTypeClassesExcept 'readWriteFinally_Unfold [''MonadCatch]
782−#else
783587inspect $ hasNoTypeClasses 'readWriteFinally_Unfold
784−#endif
785588-- inspect $ 'readWriteFinallyUnfold `hasNoType` ''Step
786589#endif
787590
788591readWriteFinallyUnfold :: Handle -> Handle -> IO ()
789592readWriteFinallyUnfold inh devNull =
790− let readEx = UF.finally (\_ -> hClose inh) FH.reader
791− in S.fold (FH.write devNull) $ S.unfold readEx inh
593+ let readEx = UF.finally (\_ -> hClose inh) FH.read
594+ in SP.fold (FH.write devNull) $ SP.unfold readEx inh
792595
793596-- | Send the file contents to /dev/null with exception handling
794597readWriteBracket_Unfold :: Handle -> Handle -> IO ()
795598readWriteBracket_Unfold inh devNull =
796− let readEx = UF.bracket_ return (\_ -> hClose inh) FH.reader
797− in S.fold (FH.write devNull) $ S.unfold readEx inh
599+ let readEx = UF.bracket_ return (\_ -> hClose inh) FH.read
600+ in SP.fold (FH.write devNull) $ SP.unfold readEx inh
798601
799602#ifdef INSPECTION
800−#if __GLASGOW_HASKELL__ >= 906
801−inspect $ hasNoTypeClassesExcept 'readWriteBracket_Unfold [''MonadCatch]
802−#else
803603inspect $ hasNoTypeClasses 'readWriteBracket_Unfold
804−#endif
805604-- inspect $ 'readWriteBracketUnfold `hasNoType` ''Step
806605#endif
807606
808607readWriteBracketUnfold :: Handle -> Handle -> IO ()
809608readWriteBracketUnfold inh devNull =
810− let readEx = UF.bracket return (\_ -> hClose inh) FH.reader
811− in S.fold (FH.write devNull) $ S.unfold readEx inh
609+ let readEx = UF.bracket return (\_ -> hClose inh) FH.read
610+ in SP.fold (FH.write devNull) $ S.unfold readEx inh
812611
813612o_1_space_copy_read_exceptions :: BenchEnv -> [Benchmark]
814613o_1_space_copy_read_exceptions env =
@@ -835,12 +634,13 @@ o_1_space_copy_read_exceptions env =
835634
836635main :: IO ()
837636main = do
637+ (size, cfg, benches) <- parseCLIOpts defaultStreamSize
838638 env <- mkHandleBenchEnv
839− runWithCLIOpts defaultStreamSize (allBenchmarks env)
639+ size `seq` runMode (mode cfg) cfg benches (allBenchmarks size env)
840640
841641 where
842642
843− allBenchmarks env size =
643+ allBenchmarks size env =
844644 [ bgroup (o_1_space_prefix moduleName)
845645 $ Prelude.concat
846646 [ o_1_space_transformation_input size
@@ -848,7 +648,7 @@ main = do
848648 , o_1_space_transformation size
849649 , o_1_space_filtering size
850650 , o_1_space_zip size
851− , o_1_space_nested env size
651+ , o_1_space_nested size
852652 , o_1_space_copy_read_exceptions env
853653 ]
854654 , bgroup (o_n_space_prefix moduleName)
benchmark/Streamly/Benchmark/FileSystem/Handle.hs+7−2
@@ -17,12 +17,16 @@
1717{-# LANGUAGE TemplateHaskell #-}
1818{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
1919#endif
20+
21+#if __GLASGOW_HASKELL__ >= 800
22+#endif
23+
2024import Streamly.Benchmark.Common.Handle (mkHandleBenchEnv)
2125
2226import qualified Handle.ReadWrite as RW
2327import qualified Handle.Read as RO
2428
25−import Test.Tasty.Bench hiding (env)
29+import Gauge hiding (env)
2630import Prelude hiding (last, length)
2731import Streamly.Benchmark.Common
2832
@@ -39,8 +43,9 @@ moduleName = "FileSystem.Handle"
3943
4044main :: IO ()
4145main = do
46+ (_, cfg, benches) <- parseCLIOpts defaultStreamSize
4247 env <- mkHandleBenchEnv
43− defaultMain (allBenchmarks env)
48+ runMode (mode cfg) cfg benches (allBenchmarks env)
4449
4550 where
4651
benchmark/Streamly/Benchmark/FileSystem/Handle/Read.hs+168−88
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
31-- |
42-- Module : Streamly.Benchmark.FileSystem.Handle
53-- Copyright : (c) 2019 Composewell Technologies
@@ -24,36 +22,132 @@ module Handle.Read
2422 (allBenchmarks)
2523where
2624
25+import Data.Functor.Identity (runIdentity)
2726import Data.Word (Word8)
2827import GHC.Magic (inline)
28+#if __GLASGOW_HASKELL__ >= 802
2929import GHC.Magic (noinline)
30+#else
31+#define noinline
32+#endif
3033import System.IO (Handle)
3134
32−import qualified Streamly.Data.Stream as Stream
33−import qualified Streamly.Data.Fold as Fold
3435import qualified Streamly.FileSystem.Handle as FH
35−import qualified Streamly.Internal.Data.Array as A
36+import qualified Streamly.Internal.Data.Array.Storable.Foreign as A
37+import qualified Streamly.Internal.Data.Array.Storable.Foreign.Types as AT
3638import qualified Streamly.Internal.Data.Fold as FL
37−import qualified Streamly.Internal.Data.Stream as IP
39+import qualified Streamly.Internal.Data.Parser as PR
40+import qualified Streamly.Internal.Data.Stream.IsStream as IP
3841import qualified Streamly.Internal.FileSystem.Handle as IFH
42+import qualified Streamly.Internal.Memory.ArrayStream as AS
3943import qualified Streamly.Internal.Unicode.Stream as IUS
40−import qualified Streamly.Data.Stream.Prelude as S
44+import qualified Streamly.Prelude as S
4145import qualified Streamly.Unicode.Stream as SS
4246
43−import Test.Tasty.Bench hiding (env)
47+import Gauge hiding (env)
4448import Prelude hiding (last, length)
4549import Streamly.Benchmark.Common.Handle
4650
4751#ifdef INSPECTION
48−import Streamly.Internal.Data.Stream (Step(..), FoldMany)
52+import Streamly.Internal.Data.Stream.StreamD.Type (Step(..), GroupState)
4953
50−import qualified Streamly.Internal.Data.MutArray as MutArray
51−import qualified Streamly.Internal.Data.Stream as D
54+import qualified Streamly.Internal.Data.Stream.StreamD as D
5255import qualified Streamly.Internal.Data.Unfold as IUF
5356
5457import Test.Inspection
5558#endif
5659
60+-------------------------------------------------------------------------------
61+-- read chunked using toChunks
62+-------------------------------------------------------------------------------
63+
64+-- | Get the last byte from a file bytestream.
65+toChunksLast :: Handle -> IO (Maybe Word8)
66+toChunksLast inh = do
67+ let s = IFH.toChunks inh
68+ larr <- S.last s
69+ return $ case larr of
70+ Nothing -> Nothing
71+ Just arr -> A.readIndex arr (A.length arr - 1)
72+
73+#ifdef INSPECTION
74+inspect $ hasNoTypeClasses 'toChunksLast
75+inspect $ 'toChunksLast `hasNoType` ''Step
76+#endif
77+
78+-- | Count the number of bytes in a file.
79+toChunksSumLengths :: Handle -> IO Int
80+toChunksSumLengths inh =
81+ let s = IFH.toChunks inh
82+ in S.sum (S.map A.length s)
83+
84+#ifdef INSPECTION
85+inspect $ hasNoTypeClasses 'toChunksSumLengths
86+inspect $ 'toChunksSumLengths `hasNoType` ''Step
87+#endif
88+
89+-- | Count the number of lines in a file.
90+toChunksSplitOnSuffix :: Handle -> IO Int
91+toChunksSplitOnSuffix = S.length . AS.splitOnSuffix 10 . IFH.toChunks
92+
93+#ifdef INSPECTION
94+inspect $ hasNoTypeClasses 'toChunksSplitOnSuffix
95+inspect $ 'toChunksSplitOnSuffix `hasNoType` ''Step
96+#endif
97+
98+-- XXX use a word splitting combinator instead of splitOn and test it.
99+-- | Count the number of words in a file.
100+toChunksSplitOn :: Handle -> IO Int
101+toChunksSplitOn = S.length . AS.splitOn 32 . IFH.toChunks
102+
103+#ifdef INSPECTION
104+inspect $ hasNoTypeClasses 'toChunksSplitOn
105+inspect $ 'toChunksSplitOn `hasNoType` ''Step
106+#endif
107+
108+-- | Sum the bytes in a file.
109+toChunksCountBytes :: Handle -> IO Word8
110+toChunksCountBytes inh = do
111+ let foldlArr' f z = runIdentity . S.foldl' f z . A.toStream
112+ let s = IFH.toChunks inh
113+ S.foldl' (\acc arr -> acc + foldlArr' (+) 0 arr) 0 s
114+
115+#ifdef INSPECTION
116+inspect $ hasNoTypeClasses 'toChunksCountBytes
117+inspect $ 'toChunksCountBytes `hasNoType` ''Step
118+#endif
119+
120+toChunksDecodeUtf8Arrays :: Handle -> IO ()
121+toChunksDecodeUtf8Arrays =
122+ S.drain . IUS.decodeUtf8Arrays . IFH.toChunks
123+
124+#ifdef INSPECTION
125+inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
126+-- inspect $ 'toChunksDecodeUtf8ArraysLenient `hasNoType` ''Step
127+#endif
128+
129+o_1_space_read_chunked :: BenchEnv -> [Benchmark]
130+o_1_space_read_chunked env =
131+ -- read using toChunks instead of read
132+ [ bgroup "reduce/toChunks"
133+ [ mkBench "S.last" env $ \inH _ ->
134+ toChunksLast inH
135+ -- Note: this cannot be fairly compared with GNU wc -c or wc -m as
136+ -- wc uses lseek to just determine the file size rather than reading
137+ -- and counting characters.
138+ , mkBench "S.sum . S.map A.length" env $ \inH _ ->
139+ toChunksSumLengths inH
140+ , mkBench "AS.splitOnSuffix" env $ \inH _ ->
141+ toChunksSplitOnSuffix inH
142+ , mkBench "AS.splitOn" env $ \inH _ ->
143+ toChunksSplitOn inH
144+ , mkBench "countBytes" env $ \inH _ ->
145+ toChunksCountBytes inH
146+ , mkBenchSmall "US.decodeUtf8Arrays" env $ \inH _ ->
147+ toChunksDecodeUtf8Arrays inH
148+ ]
149+ ]
150+
57151-- TBD reading with unfold
58152
59153-------------------------------------------------------------------------------
@@ -62,49 +156,49 @@ import Test.Inspection
62156
63157-- | Get the last byte from a file bytestream.
64158readLast :: Handle -> IO (Maybe Word8)
65−readLast = S.fold Fold.last . S.unfold FH.reader
159+readLast = S.last . S.unfold FH.read
66160
67161#ifdef INSPECTION
68162inspect $ hasNoTypeClasses 'readLast
69163inspect $ 'readLast `hasNoType` ''Step -- S.unfold
70−inspect $ 'readLast `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
71−inspect $ 'readLast `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
164+inspect $ 'readLast `hasNoType` ''IUF.ConcatState -- FH.read/UF.concat
165+inspect $ 'readLast `hasNoType` ''A.ReadUState -- FH.read/A.read
72166#endif
73167
74168-- assert that flattenArrays constructors are not present
75169-- | Count the number of bytes in a file.
76170readCountBytes :: Handle -> IO Int
77−readCountBytes = S.fold Fold.length . S.unfold FH.reader
171+readCountBytes = S.length . S.unfold FH.read
78172
79173#ifdef INSPECTION
80174inspect $ hasNoTypeClasses 'readCountBytes
81175inspect $ 'readCountBytes `hasNoType` ''Step -- S.unfold
82−inspect $ 'readCountBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
83−inspect $ 'readCountBytes `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
176+inspect $ 'readCountBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.concat
177+inspect $ 'readCountBytes `hasNoType` ''A.ReadUState -- FH.read/A.read
84178#endif
85179
86180-- | Count the number of lines in a file.
87181readCountLines :: Handle -> IO Int
88182readCountLines =
89− S.fold Fold.length
183+ S.length
90184 . IUS.lines FL.drain
91185 . SS.decodeLatin1
92− . S.unfold FH.reader
186+ . S.unfold FH.read
93187
94188#ifdef INSPECTION
95189inspect $ hasNoTypeClasses 'readCountLines
96190inspect $ 'readCountLines `hasNoType` ''Step
97−inspect $ 'readCountLines `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
98−inspect $ 'readCountLines `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
191+inspect $ 'readCountLines `hasNoType` ''IUF.ConcatState -- FH.read/UF.concat
192+inspect $ 'readCountLines `hasNoType` ''A.ReadUState -- FH.read/A.read
99193#endif
100194
101195-- | Count the number of words in a file.
102196readCountWords :: Handle -> IO Int
103197readCountWords =
104− S.fold Fold.length
198+ S.length
105199 . IUS.words FL.drain
106200 . SS.decodeLatin1
107− . S.unfold FH.reader
201+ . S.unfold FH.read
108202
109203#ifdef INSPECTION
110204inspect $ hasNoTypeClasses 'readCountWords
@@ -113,13 +207,13 @@ inspect $ hasNoTypeClasses 'readCountWords
113207
114208-- | Sum the bytes in a file.
115209readSumBytes :: Handle -> IO Word8
116−readSumBytes = S.fold Fold.sum . S.unfold FH.reader
210+readSumBytes = S.sum . S.unfold FH.read
117211
118212#ifdef INSPECTION
119213inspect $ hasNoTypeClasses 'readSumBytes
120214inspect $ 'readSumBytes `hasNoType` ''Step
121−inspect $ 'readSumBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
122−inspect $ 'readSumBytes `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
215+inspect $ 'readSumBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.concat
216+inspect $ 'readSumBytes `hasNoType` ''A.ReadUState -- FH.read/A.read
123217#endif
124218
125219-- XXX When we mark this with INLINE and we have two benchmarks using S.drain
@@ -133,21 +227,21 @@ inspect $ 'readSumBytes `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
133227-- fusion-plugin to propagate INLINE phase information such that this problem
134228-- does not occur.
135229readDrain :: Handle -> IO ()
136−readDrain inh = S.fold Fold.drain $ S.unfold FH.reader inh
230+readDrain inh = S.drain $ S.unfold FH.read inh
137231
138232-- XXX investigate why we need an INLINE in this case (GHC)
139233{-# INLINE readDecodeLatin1 #-}
140234readDecodeLatin1 :: Handle -> IO ()
141235readDecodeLatin1 inh =
142− S.fold Fold.drain
236+ S.drain
143237 $ SS.decodeLatin1
144− $ S.unfold FH.reader inh
238+ $ S.unfold FH.read inh
145239
146240readDecodeUtf8 :: Handle -> IO ()
147241readDecodeUtf8 inh =
148− S.fold Fold.drain
242+ S.drain
149243 $ SS.decodeUtf8
150− $ S.unfold FH.reader inh
244+ $ S.unfold FH.read inh
151245
152246#ifdef INSPECTION
153247inspect $ hasNoTypeClasses 'readDecodeUtf8
@@ -172,7 +266,7 @@ o_1_space_reduce_read env =
172266 readCountBytes inh
173267 , mkBench "US.lines . SS.decodeLatin1" env $ \inh _ ->
174268 readCountLines inh
175− , mkBench "US.words . SS.decodeLatin1" env $ \inh _ ->
269+ , mkBenchSmall "US.words . SS.decodeLatin1" env $ \inh _ ->
176270 readCountWords inh
177271
178272 -- read with utf8 decoding
@@ -186,25 +280,25 @@ o_1_space_reduce_read env =
186280-------------------------------------------------------------------------------
187281
188282-- | Count the number of lines in a file.
189−getChunksConcatUnfoldCountLines :: Handle -> IO Int
190−getChunksConcatUnfoldCountLines inh =
191− S.fold Fold.length
283+toChunksConcatUnfoldCountLines :: Handle -> IO Int
284+toChunksConcatUnfoldCountLines inh =
285+ S.length
192286 $ IUS.lines FL.drain
193287 $ SS.decodeLatin1
194288 -- XXX replace with toBytes
195− $ S.unfoldMany A.reader (IFH.readChunks inh)
289+ $ S.concatUnfold A.read (IFH.toChunks inh)
196290
197291#ifdef INSPECTION
198−inspect $ hasNoTypeClasses 'getChunksConcatUnfoldCountLines
199−inspect $ 'getChunksConcatUnfoldCountLines `hasNoType` ''Step
200−inspect $ 'getChunksConcatUnfoldCountLines `hasNoType` ''D.ConcatMapUState
292+inspect $ hasNoTypeClasses 'toChunksConcatUnfoldCountLines
293+inspect $ 'toChunksConcatUnfoldCountLines `hasNoType` ''Step
294+inspect $ 'toChunksConcatUnfoldCountLines `hasNoType` ''D.ConcatMapUState
201295#endif
202296
203297o_1_space_reduce_toBytes :: BenchEnv -> [Benchmark]
204298o_1_space_reduce_toBytes env =
205299 [ bgroup "reduce/toBytes"
206300 [ mkBench "US.lines . SS.decodeLatin1" env $ \inh _ ->
207− getChunksConcatUnfoldCountLines inh
301+ toChunksConcatUnfoldCountLines inh
208302 ]
209303 ]
210304
@@ -213,64 +307,49 @@ o_1_space_reduce_toBytes env =
213307-------------------------------------------------------------------------------
214308
215309chunksOfSum :: Int -> Handle -> IO Int
216−chunksOfSum n inh =
217− S.fold Fold.length $ IP.groupsOf n FL.sum (S.unfold FH.reader inh)
218−
219−foldManyPostChunksOfSum :: Int -> Handle -> IO Int
220−foldManyPostChunksOfSum n inh =
221− S.fold Fold.length
222− $ IP.foldManyPost (FL.take n FL.sum) (S.unfold FH.reader inh)
310+chunksOfSum n inh = S.length $ S.chunksOf n FL.sum (S.unfold FH.read inh)
223311
224312foldManyChunksOfSum :: Int -> Handle -> IO Int
225313foldManyChunksOfSum n inh =
226− S.fold Fold.length
227− $ IP.foldMany (FL.take n FL.sum) (S.unfold FH.reader inh)
314+ S.length $ IP.foldMany (FL.ltake n FL.sum) (S.unfold FH.read inh)
315+
316+parseManyChunksOfSum :: Int -> Handle -> IO Int
317+parseManyChunksOfSum n inh =
318+ S.length
319+ $ IP.parseMany (PR.fromFold $ FL.ltake n FL.sum) (S.unfold FH.read inh)
228320
229321-- XXX investigate why we need an INLINE in this case (GHC)
230322-- Even though allocations remain the same in both cases inlining improves time
231323-- by 4x.
232324-- | Slice in chunks of size n and get the count of chunks.
233−{-# INLINE groupsOf #-}
234−groupsOf :: Int -> Handle -> IO Int
235−groupsOf n inh =
325+{-# INLINE chunksOf #-}
326+chunksOf :: Int -> Handle -> IO Int
327+chunksOf n inh =
236328 -- writeNUnsafe gives 2.5x boost here over writeN.
237− S.fold Fold.length
238− $ IP.groupsOf n (A.writeNUnsafe n) (S.unfold FH.reader inh)
329+ -- XXX replace with S.arraysOf
330+ S.length $ S.chunksOf n (AT.writeNUnsafe n) (S.unfold FH.read inh)
239331
240332#ifdef INSPECTION
241−inspect $ hasNoTypeClasses 'groupsOf
242−inspect $ 'groupsOf `hasNoType` ''Step
243−inspect $ 'groupsOf `hasNoType` ''FoldMany
244−inspect $ 'groupsOf `hasNoType` ''MutArray.ArrayUnsafe -- AT.writeNUnsafe
245− -- FH.read/A.read
246−inspect $ 'groupsOf `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
333+inspect $ hasNoTypeClasses 'chunksOf
334+inspect $ 'chunksOf `hasNoType` ''Step
335+inspect $ 'chunksOf `hasNoType` ''GroupState
336+inspect $ 'chunksOf `hasNoType` ''AT.ArrayUnsafe -- AT.writeNUnsafe
337+inspect $ 'chunksOf `hasNoType` ''IUF.ConcatState -- FH.read/UF.concat
338+inspect $ 'chunksOf `hasNoType` ''A.ReadUState -- FH.read/A.read
247339#endif
248340
249−{-# INLINE chunksOf #-}
250−chunksOf :: Int -> Handle -> IO Int
251−chunksOf n inh =
252− S.fold Fold.length $ Stream.chunksOf n (S.unfold FH.reader inh)
253−
254341o_1_space_reduce_read_grouped :: BenchEnv -> [Benchmark]
255342o_1_space_reduce_read_grouped env =
256343 [ bgroup "reduce/read/chunks"
257− [ mkBench ("S.groupsOf " ++ show (bigSize env) ++ " FL.sum") env $
344+ [ mkBench ("S.chunksOf " ++ show (bigSize env) ++ " FL.sum") env $
258345 \inh _ ->
259346 chunksOfSum (bigSize env) inh
260− , mkBench "S.groupsOf 1 FL.sum" env $ \inh _ ->
347+ , mkBench "S.chunksOf 1 FL.sum" env $ \inh _ ->
261348 chunksOfSum 1 inh
262349
263350 -- XXX investigate why we need inline/noinline in these cases (GHC)
264351 -- Chunk using parsers
265− , mkBench
266− ("S.foldManyPost (FL.take " ++ show (bigSize env) ++ " FL.sum)")
267− env
268− $ \inh _ -> noinline foldManyPostChunksOfSum (bigSize env) inh
269− , mkBench
270− "S.foldManyPost (FL.take 1 FL.sum)"
271− env
272− $ \inh _ -> inline foldManyPostChunksOfSum 1 inh
273− , mkBench
352+ , mkBenchSmall
274353 ("S.foldMany (FL.take " ++ show (bigSize env) ++ " FL.sum)")
275354 env
276355 $ \inh _ -> noinline foldManyChunksOfSum (bigSize env) inh
@@ -278,28 +357,29 @@ o_1_space_reduce_read_grouped env =
278357 "S.foldMany (FL.take 1 FL.sum)"
279358 env
280359 $ \inh _ -> inline foldManyChunksOfSum 1 inh
360+ , mkBenchSmall
361+ ("S.parseMany (FL.take " ++ show (bigSize env) ++ " FL.sum)")
362+ env
363+ $ \inh _ -> noinline parseManyChunksOfSum (bigSize env) inh
364+ , mkBench
365+ "S.parseMany (FL.take 1 FL.sum)"
366+ env
367+ $ \inh _ -> inline parseManyChunksOfSum 1 inh
281368
282369 -- folding chunks to arrays
283− , mkBenchSmall "S.groupsOf 1" env $ \inh _ ->
284− groupsOf 1 inh
285− , mkBench "S.groupsOf 10" env $ \inh _ ->
286− groupsOf 10 inh
287− , mkBench "S.groupsOf 1000" env $ \inh _ ->
288− groupsOf 1000 inh
289−
290− -- chunksOf may use a different impl than groupsOf
291− , mkBenchSmall "S.chunksOf 1" env $ \inh _ ->
370+ , mkBenchSmall "S.arraysOf 1" env $ \inh _ ->
292371 chunksOf 1 inh
293− , mkBench "S.chunksOf 10" env $ \inh _ ->
372+ , mkBench "S.arraysOf 10" env $ \inh _ ->
294373 chunksOf 10 inh
295− , mkBench "S.chunksOf 1000" env $ \inh _ ->
374+ , mkBench "S.arraysOf 1000" env $ \inh _ ->
296375 chunksOf 1000 inh
297376 ]
298377 ]
299378
300379allBenchmarks :: BenchEnv -> [Benchmark]
301380allBenchmarks env = Prelude.concat
302− [ o_1_space_reduce_read env
381+ [ o_1_space_read_chunked env
382+ , o_1_space_reduce_read env
303383 , o_1_space_reduce_toBytes env
304384 , o_1_space_reduce_read_grouped env
305385 ]
benchmark/Streamly/Benchmark/FileSystem/Handle/ReadWrite.hs+101−54
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
31-- |
42-- Module : Streamly.Benchmark.FileSystem.Handle
53-- Copyright : (c) 2019 Composewell Technologies
@@ -26,23 +24,26 @@ where
2624
2725import System.IO (Handle)
2826import Prelude hiding (last, length)
29−import Streamly.Internal.System.IO (defaultChunkSize)
27+import Streamly.Internal.Data.Array.Storable.Foreign.Types (defaultChunkSize)
3028
3129import qualified Streamly.FileSystem.Handle as FH
3230import qualified Streamly.Internal.Data.Unfold as IUF
3331import qualified Streamly.Internal.FileSystem.Handle as IFH
34−import qualified Streamly.Data.Array as A
35−import qualified Streamly.Data.Stream.Prelude as S
32+import qualified Streamly.Internal.Memory.ArrayStream as AS
33+import qualified Streamly.Data.Array.Storable.Foreign as A
34+import qualified Streamly.Prelude as S
3635
37−import Test.Tasty.Bench hiding (env)
36+import Gauge hiding (env)
3837import Streamly.Benchmark.Common.Handle
3938
4039#ifdef INSPECTION
41−import Streamly.Internal.Data.Stream (Step(..))
40+import Foreign.Storable (Storable)
41+import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
4242
43−import qualified Streamly.Internal.Data.Stream as D
43+import qualified Streamly.Internal.Data.Stream.StreamD.Type as D
4444import qualified Streamly.Internal.Data.Tuple.Strict as Strict
45−import qualified Streamly.Internal.Data.MutArray as MutArray
45+import qualified Streamly.Internal.Data.Array.Storable.Foreign as A
46+import qualified Streamly.Internal.Data.Array.Storable.Foreign.Types as AT
4647
4748import Test.Inspection
4849#endif
@@ -53,7 +54,7 @@ import Test.Inspection
5354
5455-- | Copy file
5556copyChunks :: Handle -> Handle -> IO ()
56−copyChunks inh outh = S.fold (IFH.writeChunks outh) $ IFH.readChunks inh
57+copyChunks inh outh = S.fold (IFH.writeChunks outh) $ IFH.toChunks inh
5758
5859#ifdef INSPECTION
5960inspect $ hasNoTypeClasses 'copyChunks
@@ -62,7 +63,7 @@ inspect $ 'copyChunks `hasNoType` ''Step
6263
6364o_1_space_copy_chunked :: BenchEnv -> [Benchmark]
6465o_1_space_copy_chunked env =
65− [ bgroup "copy/getChunks"
66+ [ bgroup "copy/toChunks"
6667 [ mkBench "toNull" env $ \inH _ ->
6768 copyChunks inH (nullH env)
6869 , mkBench "raw" env $ \inH outH ->
@@ -76,15 +77,15 @@ o_1_space_copy_chunked env =
7677
7778-- | Copy file
7879copyStream :: Handle -> Handle -> IO ()
79−copyStream inh outh = S.fold (FH.write outh) (S.unfold FH.reader inh)
80+copyStream inh outh = S.fold (FH.write outh) (S.unfold FH.read inh)
8081
8182#ifdef INSPECTION
8283inspect $ hasNoTypeClasses 'copyStream
8384inspect $ 'copyStream `hasNoType` ''Step -- S.unfold
84−inspect $ 'copyStream `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
85−inspect $ 'copyStream `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
86− -- FH.read/A.read
87−inspect $ 'copyStream `hasNoType` ''Strict.Tuple3' -- FH.write/chunksOf
85+inspect $ 'copyStream `hasNoType` ''IUF.ConcatState -- FH.read/UF.concat
86+inspect $ 'copyStream `hasNoType` ''A.ReadUState -- FH.read/A.read
87+inspect $ 'copyStream `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
88+inspect $ 'copyStream `hasNoType` ''Strict.Tuple3' -- FH.write/lchunksOf
8889#endif
8990
9091o_1_space_copy_read :: BenchEnv -> [Benchmark]
@@ -103,92 +104,95 @@ o_1_space_copy_read env =
103104
104105-- | Send the file contents to /dev/null
105106readFromBytesNull :: Handle -> Handle -> IO ()
106−readFromBytesNull inh devNull = IFH.putBytes devNull $ S.unfold FH.reader inh
107+readFromBytesNull inh devNull = IFH.fromBytes devNull $ S.unfold FH.read inh
107108
108109#ifdef INSPECTION
109110inspect $ hasNoTypeClasses 'readFromBytesNull
110111inspect $ 'readFromBytesNull `hasNoType` ''Step
111−inspect $ 'readFromBytesNull `hasNoType` ''MutArray.SpliceState
112−inspect $ 'readFromBytesNull `hasNoType` ''MutArray.ArrayUnsafe -- FH.fromBytes/S.chunksOf
113−inspect $ 'readFromBytesNull `hasNoType` ''D.FoldMany
112+inspect $ 'readFromBytesNull `hasNoType` ''AT.SpliceState
113+inspect $ 'readFromBytesNull `hasNoType` ''AT.ArrayUnsafe -- FH.fromBytes/S.arraysOf
114+inspect $ 'readFromBytesNull `hasNoType` ''D.GroupState
114115#endif
115116
116117-- | Send the file contents ('defaultChunkSize') to /dev/null
117−readWithFromBytesNull :: Handle -> Handle -> IO ()
118−readWithFromBytesNull inh devNull =
119− IFH.putBytes devNull
120− $ S.unfold FH.readerWith (defaultChunkSize, inh)
118+readWithBufferOfFromBytesNull :: Handle -> Handle -> IO ()
119+readWithBufferOfFromBytesNull inh devNull =
120+ IFH.fromBytes devNull
121+ $ S.unfold FH.readWithBufferOf (defaultChunkSize, inh)
121122
122123#ifdef INSPECTION
123−inspect $ hasNoTypeClasses 'readWithFromBytesNull
124−inspect $ 'readWithFromBytesNull `hasNoType` ''Step
125−inspect $ 'readWithFromBytesNull `hasNoType` ''MutArray.SpliceState
126−inspect $ 'readWithFromBytesNull `hasNoType` ''MutArray.ArrayUnsafe -- FH.fromBytes/S.chunksOf
127−inspect $ 'readWithFromBytesNull `hasNoType` ''D.FoldMany
124+inspect $ hasNoTypeClasses 'readWithBufferOfFromBytesNull
125+inspect $ 'readWithBufferOfFromBytesNull `hasNoType` ''Step
126+inspect $ 'readWithBufferOfFromBytesNull `hasNoType` ''AT.SpliceState
127+inspect $ 'readWithBufferOfFromBytesNull `hasNoType` ''AT.ArrayUnsafe -- FH.fromBytes/S.arraysOf
128+inspect $ 'readWithBufferOfFromBytesNull `hasNoType` ''D.GroupState
128129#endif
129130
130131-- | Send the chunk content ('defaultChunkSize') to /dev/null
131132-- Implicitly benchmarked via 'readFromBytesNull'
132133_readChunks :: Handle -> Handle -> IO ()
133−_readChunks inh devNull = IUF.fold fld unf inh
134+_readChunks inh devNull = IUF.fold unf fld inh
134135
135136 where
136137
137138 fld = FH.write devNull
138− unf = IUF.many A.reader FH.chunkReader
139+ unf = IUF.concat FH.readChunks A.read
139140
140141-- | Send the chunk content to /dev/null
141−-- Implicitly benchmarked via 'readWithFromBytesNull'
142−_readChunksWith :: Handle -> Handle -> IO ()
143−_readChunksWith inh devNull = IUF.fold fld unf (defaultChunkSize, inh)
142+-- Implicitly benchmarked via 'readWithBufferOfFromBytesNull'
143+_readChunksWithBufferOf :: Handle -> Handle -> IO ()
144+_readChunksWithBufferOf inh devNull = IUF.fold unf fld (defaultChunkSize, inh)
144145
145146 where
146147
147148 fld = FH.write devNull
148− unf = IUF.many A.reader FH.chunkReaderWith
149+ unf = IUF.concat FH.readChunksWithBufferOf A.read
150+
149151
150152o_1_space_copy_fromBytes :: BenchEnv -> [Benchmark]
151153o_1_space_copy_fromBytes env =
152− [ bgroup "copy/putBytes"
154+ [ bgroup "copy/fromBytes"
153155 [ mkBench "rawToNull" env $ \inh _ ->
154156 readFromBytesNull inh (nullH env)
155− , mkBench "FH.readWith" env $ \inh _ ->
156− readWithFromBytesNull inh (nullH env)
157+ , mkBench "FH.readWithBufferOf" env $ \inh _ ->
158+ readWithBufferOfFromBytesNull inh (nullH env)
157159 ]
158160 ]
159161
160162-- | Send the file contents ('defaultChunkSize') to /dev/null
161−writeReadWith :: Handle -> Handle -> IO ()
162−writeReadWith inh devNull = IUF.fold fld unf (defaultChunkSize, inh)
163+{-# NOINLINE writeReadWithBufferOf #-}
164+writeReadWithBufferOf :: Handle -> Handle -> IO ()
165+writeReadWithBufferOf inh devNull = IUF.fold unf fld (defaultChunkSize, inh)
163166
164167 where
165168
166− fld = FH.writeWith defaultChunkSize devNull
167− unf = FH.readerWith
169+ fld = FH.writeWithBufferOf defaultChunkSize devNull
170+ unf = FH.readWithBufferOf
168171
169172#ifdef INSPECTION
170−inspect $ hasNoTypeClasses 'writeReadWith
171−inspect $ 'writeReadWith `hasNoType` ''Step
172−inspect $ 'writeReadWith `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
173−inspect $ 'writeReadWith `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
174− -- FH.read/A.read
173+inspect $ hasNoTypeClasses 'writeReadWithBufferOf
174+inspect $ 'writeReadWithBufferOf `hasNoType` ''Step
175+inspect $ 'writeReadWithBufferOf `hasNoType` ''IUF.ConcatState -- FH.read/UF.concat
176+inspect $ 'writeReadWithBufferOf `hasNoType` ''A.ReadUState -- FH.read/A.read
177+inspect $ 'writeReadWithBufferOf `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
175178#endif
176179
177180-- | Send the file contents ('AT.defaultChunkSize') to /dev/null
181+{-# NOINLINE writeRead #-}
178182writeRead :: Handle -> Handle -> IO ()
179−writeRead inh devNull = IUF.fold fld unf inh
183+writeRead inh devNull = IUF.fold unf fld inh
180184
181185 where
182186
183187 fld = FH.write devNull
184− unf = FH.reader
188+ unf = FH.read
185189
186190#ifdef INSPECTION
187191inspect $ hasNoTypeClasses 'writeRead
188192inspect $ 'writeRead `hasNoType` ''Step
189−inspect $ 'writeRead `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
190−inspect $ 'writeRead `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
191− -- FH.read/A.read
193+inspect $ 'writeRead `hasNoType` ''IUF.ConcatState -- FH.read/UF.concat
194+inspect $ 'writeRead `hasNoType` ''A.ReadUState -- FH.read/A.read
195+inspect $ 'writeRead `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
192196#endif
193197
194198o_1_space_copy :: BenchEnv -> [Benchmark]
@@ -196,11 +200,53 @@ o_1_space_copy env =
196200 [ bgroup "copy"
197201 [ mkBench "FH.write . FH.read" env $ \inh _ ->
198202 writeRead inh (nullH env)
199− , mkBench "FH.writeWith . FH.readWith" env $ \inh _ ->
200− writeReadWith inh (nullH env)
203+ , mkBench "FH.writeWithBufferOf . FH.readWithBufferOf" env $ \inh _ ->
204+ writeReadWithBufferOf inh (nullH env)
201205 ]
202206 ]
203207
208+-------------------------------------------------------------------------------
209+-- copy with group/ungroup transformations
210+-------------------------------------------------------------------------------
211+
212+-- | Lines and unlines
213+copyChunksSplitInterposeSuffix :: Handle -> Handle -> IO ()
214+copyChunksSplitInterposeSuffix inh outh =
215+ S.fold (IFH.write outh)
216+ $ AS.interposeSuffix 10
217+ $ AS.splitOnSuffix 10
218+ $ IFH.toChunks inh
219+
220+#ifdef INSPECTION
221+inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterposeSuffix [''Storable]
222+inspect $ 'copyChunksSplitInterposeSuffix `hasNoType` ''Step
223+#endif
224+
225+-- | Words and unwords
226+copyChunksSplitInterpose :: Handle -> Handle -> IO ()
227+copyChunksSplitInterpose inh outh =
228+ S.fold (IFH.write outh)
229+ $ AS.interpose 32
230+ -- XXX this is not correct word splitting combinator
231+ $ AS.splitOn 32
232+ $ IFH.toChunks inh
233+
234+#ifdef INSPECTION
235+inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterpose [''Storable]
236+inspect $ 'copyChunksSplitInterpose `hasNoType` ''Step
237+#endif
238+
239+o_1_space_copy_toChunks_group_ungroup :: BenchEnv -> [Benchmark]
240+o_1_space_copy_toChunks_group_ungroup env =
241+ [ bgroup "copy/toChunks/group-ungroup"
242+ [ mkBench "AS.interposeSuffix . AS.splitOnSuffix" env $ \inh outh ->
243+ copyChunksSplitInterposeSuffix inh outh
244+ , mkBenchSmall "AS.interpose . AS.splitOn" env $ \inh outh ->
245+ copyChunksSplitInterpose inh outh
246+ ]
247+ ]
248+
249+
204250-------------------------------------------------------------------------------
205251--
206252-------------------------------------------------------------------------------
@@ -211,4 +257,5 @@ allBenchmarks env = Prelude.concat
211257 , o_1_space_copy_read env
212258 , o_1_space_copy_fromBytes env
213259 , o_1_space_copy env
260+ , o_1_space_copy_toChunks_group_ungroup env
214261 ]
benchmark/Streamly/Benchmark/Prelude/Adaptive.hs+39−51
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
31-- |
42-- Module : Main
53-- Copyright : (c) 2018 Composewell Technologies
@@ -10,7 +8,7 @@
108import Control.Concurrent (threadDelay)
119import Control.Monad (when)
1210import Control.Monad.IO.Class (liftIO)
13−import Test.Tasty.Bench
11+import Gauge
1412import Streamly.Prelude as S
1513import System.Random (randomRIO)
1614
@@ -21,9 +19,6 @@ import System.Random (randomRIO)
2119-- Also, the worker dispatch depends on the worker dispatch latency which is
2220-- set to fixed 200 us. We need to keep that in mind when designing tests.
2321
24−moduleName :: String
25−moduleName = "Prelude.Adaptive"
26−
2722value :: Int
2823value = 1000
2924
@@ -36,14 +31,11 @@ source range = S.replicateM value $ do
3631
3732{-# INLINE run #-}
3833run :: IsStream t => (Int, Int) -> (Int, Int) -> (t IO Int -> SerialT IO Int) -> IO ()
39−run srange crange t = S.drain $ S.mapM action (t $ source srange)
40−
41− where
42−
43− action x = liftIO $ do
44− d <- randomRIO crange
45− when (d /= 0) $ threadDelay d
46− return x
34+run srange crange t = S.drain $ do
35+ n <- t $ source srange
36+ d <- liftIO (randomRIO crange)
37+ when (d /= 0) $ liftIO $ threadDelay d
38+ return n
4739
4840low, medium, high :: Int
4941low = 10
@@ -86,58 +78,54 @@ randomVar = run (low,high) (low,high)
8678
8779main :: IO ()
8880main =
89− defaultMain [bgroup moduleName allBenchmarks]
90−
91− where
92−
93− allBenchmarks =
81+ defaultMain
9482 [
9583 bgroup "serialConstantSlowConsumer"
96− [ bench "serially" $ nfIO $ alwaysConstSlowSerial fromSerial
97− , bench "wSerially" $ nfIO $ alwaysConstSlowSerial fromWSerial
84+ [ bench "serially" $ nfIO $ alwaysConstSlowSerial serially
85+ , bench "wSerially" $ nfIO $ alwaysConstSlowSerial wSerially
9886 ]
9987 , bgroup "default"
100− [ bench "serially" $ nfIO $ noDelay fromSerial
101− , bench "wSerially" $ nfIO $ noDelay fromWSerial
102− , bench "aheadly" $ nfIO $ noDelay fromAhead
103− , bench "asyncly" $ nfIO $ noDelay fromAsync
104− , bench "wAsyncly" $ nfIO $ noDelay fromWAsync
105− , bench "parallely" $ nfIO $ noDelay fromParallel
88+ [ bench "serially" $ nfIO $ noDelay serially
89+ , bench "wSerially" $ nfIO $ noDelay wSerially
90+ , bench "aheadly" $ nfIO $ noDelay aheadly
91+ , bench "asyncly" $ nfIO $ noDelay asyncly
92+ , bench "wAsyncly" $ nfIO $ noDelay wAsyncly
93+ , bench "parallely" $ nfIO $ noDelay parallely
10694 ]
10795 , bgroup "constantSlowConsumer"
108− [ bench "aheadly" $ nfIO $ alwaysConstSlow fromAhead
109− , bench "asyncly" $ nfIO $ alwaysConstSlow fromAsync
110− , bench "wAsyncly" $ nfIO $ alwaysConstSlow fromWAsync
111− , bench "parallely" $ nfIO $ alwaysConstSlow fromParallel
96+ [ bench "aheadly" $ nfIO $ alwaysConstSlow aheadly
97+ , bench "asyncly" $ nfIO $ alwaysConstSlow asyncly
98+ , bench "wAsyncly" $ nfIO $ alwaysConstSlow wAsyncly
99+ , bench "parallely" $ nfIO $ alwaysConstSlow parallely
112100 ]
113101 , bgroup "constantFastConsumer"
114− [ bench "aheadly" $ nfIO $ alwaysConstFast fromAhead
115− , bench "asyncly" $ nfIO $ alwaysConstFast fromAsync
116− , bench "wAsyncly" $ nfIO $ alwaysConstFast fromWAsync
117− , bench "parallely" $ nfIO $ alwaysConstFast fromParallel
102+ [ bench "aheadly" $ nfIO $ alwaysConstFast aheadly
103+ , bench "asyncly" $ nfIO $ alwaysConstFast asyncly
104+ , bench "wAsyncly" $ nfIO $ alwaysConstFast wAsyncly
105+ , bench "parallely" $ nfIO $ alwaysConstFast parallely
118106 ]
119107 , bgroup "variableSlowConsumer"
120− [ bench "aheadly" $ nfIO $ alwaysVarSlow fromAhead
121− , bench "asyncly" $ nfIO $ alwaysVarSlow fromAsync
122− , bench "wAsyncly" $ nfIO $ alwaysVarSlow fromWAsync
123− , bench "parallely" $ nfIO $ alwaysVarSlow fromParallel
108+ [ bench "aheadly" $ nfIO $ alwaysVarSlow aheadly
109+ , bench "asyncly" $ nfIO $ alwaysVarSlow asyncly
110+ , bench "wAsyncly" $ nfIO $ alwaysVarSlow wAsyncly
111+ , bench "parallely" $ nfIO $ alwaysVarSlow parallely
124112 ]
125113 , bgroup "variableFastConsumer"
126− [ bench "aheadly" $ nfIO $ alwaysVarFast fromAhead
127− , bench "asyncly" $ nfIO $ alwaysVarFast fromAsync
128− , bench "wAsyncly" $ nfIO $ alwaysVarFast fromWAsync
129− , bench "parallely" $ nfIO $ alwaysVarFast fromParallel
114+ [ bench "aheadly" $ nfIO $ alwaysVarFast aheadly
115+ , bench "asyncly" $ nfIO $ alwaysVarFast asyncly
116+ , bench "wAsyncly" $ nfIO $ alwaysVarFast wAsyncly
117+ , bench "parallely" $ nfIO $ alwaysVarFast parallely
130118 ]
131119 , bgroup "variableSometimesFastConsumer"
132− [ bench "aheadly" $ nfIO $ runVarSometimesFast fromAhead
133− , bench "asyncly" $ nfIO $ runVarSometimesFast fromAsync
134− , bench "wAsyncly" $ nfIO $ runVarSometimesFast fromWAsync
135− , bench "parallely" $ nfIO $ runVarSometimesFast fromParallel
120+ [ bench "aheadly" $ nfIO $ runVarSometimesFast aheadly
121+ , bench "asyncly" $ nfIO $ runVarSometimesFast asyncly
122+ , bench "wAsyncly" $ nfIO $ runVarSometimesFast wAsyncly
123+ , bench "parallely" $ nfIO $ runVarSometimesFast parallely
136124 ]
137125 , bgroup "variableFullOverlap"
138− [ bench "aheadly" $ nfIO $ randomVar fromAhead
139− , bench "asyncly" $ nfIO $ randomVar fromAsync
140− , bench "wAsyncly" $ nfIO $ randomVar fromWAsync
141− , bench "parallely" $ nfIO $ randomVar fromParallel
126+ [ bench "aheadly" $ nfIO $ randomVar aheadly
127+ , bench "asyncly" $ nfIO $ randomVar asyncly
128+ , bench "wAsyncly" $ nfIO $ randomVar wAsyncly
129+ , bench "parallely" $ nfIO $ randomVar parallely
142130 ]
143131 ]
benchmark/Streamly/Benchmark/Prelude/Ahead.hs+30−30
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
31-- |
42-- Module : Main
53-- Copyright : (c) 2018 Composewell Technologies
@@ -9,13 +7,13 @@
97
108import Prelude hiding (mapM)
119
12−import Streamly.Prelude (fromAhead, fromSerial, ahead, maxBuffer, maxThreads)
10+import Streamly.Prelude (aheadly, serially, ahead, maxBuffer, maxThreads)
1311import qualified Streamly.Prelude as S
1412
1513import Streamly.Benchmark.Common
1614import Streamly.Benchmark.Prelude
1715
18−import Test.Tasty.Bench
16+import Gauge
1917
2018moduleName :: String
2119moduleName = "Prelude.Ahead"
@@ -29,13 +27,13 @@ moduleName = "Prelude.Ahead"
2927o_1_space_generation :: Int -> [Benchmark]
3028o_1_space_generation value =
3129 [ bgroup "generation"
32− [ benchIOSrc fromAhead "unfoldr" (sourceUnfoldr value)
33− , benchIOSrc fromAhead "unfoldrM" (sourceUnfoldrM value)
34− , benchIOSrc fromAhead "fromFoldable" (sourceFromFoldable value)
35− , benchIOSrc fromAhead "fromFoldableM" (sourceFromFoldableM value)
36− , benchIOSrc fromAhead "unfoldrM maxThreads 1"
30+ [ benchIOSrc aheadly "unfoldr" (sourceUnfoldr value)
31+ , benchIOSrc aheadly "unfoldrM" (sourceUnfoldrM value)
32+ , benchIOSrc aheadly "fromFoldable" (sourceFromFoldable value)
33+ , benchIOSrc aheadly "fromFoldableM" (sourceFromFoldableM value)
34+ , benchIOSrc aheadly "unfoldrM maxThreads 1"
3735 (maxThreads 1 . sourceUnfoldrM value)
38− , benchIOSrc fromAhead "unfoldrM maxBuffer 1 (x/10 ops)"
36+ , benchIOSrc aheadly "unfoldrM maxBuffer 1 (x/10 ops)"
3937 (maxBuffer 1 . sourceUnfoldrM (value `div` 10))
4038 ]
4139 ]
@@ -43,9 +41,9 @@ o_1_space_generation value =
4341o_1_space_mapping :: Int -> [Benchmark]
4442o_1_space_mapping value =
4543 [ bgroup "mapping"
46− [ benchIOSink value "map" $ mapN fromAhead 1
47− , benchIOSink value "fmap" $ fmapN fromAhead 1
48− , benchIOSink value "mapM" $ mapM fromAhead 1 . fromSerial
44+ [ benchIOSink value "map" $ mapN aheadly 1
45+ , benchIOSink value "fmap" $ fmapN aheadly 1
46+ , benchIOSink value "mapM" $ mapM aheadly 1 . serially
4947 ]
5048 ]
5149
@@ -53,17 +51,17 @@ o_1_space_concatFoldable :: Int -> [Benchmark]
5351o_1_space_concatFoldable value =
5452 [ bgroup
5553 "concat-foldable"
56− [ benchIOSrc fromAhead "foldMapWith (<>) (List)"
54+ [ benchIOSrc aheadly "foldMapWith (<>) (List)"
5755 (sourceFoldMapWith value)
58− , benchIOSrc fromAhead "foldMapWith (<>) (Stream)"
56+ , benchIOSrc aheadly "foldMapWith (<>) (Stream)"
5957 (sourceFoldMapWithStream value)
60− , benchIOSrc fromAhead "foldMapWithM (<>) (List)"
58+ , benchIOSrc aheadly "foldMapWithM (<>) (List)"
6159 (sourceFoldMapWithM value)
62− , benchIOSrc fromSerial "S.concatFoldableWith (<>) (List)"
60+ , benchIOSrc serially "S.concatFoldableWith (<>) (List)"
6361 (concatFoldableWith value)
64− , benchIOSrc fromSerial "S.concatForFoldableWith (<>) (List)"
62+ , benchIOSrc serially "S.concatForFoldableWith (<>) (List)"
6563 (concatForFoldableWith value)
66− , benchIOSrc fromAhead "foldMapM (List)" (sourceFoldMapM value)
64+ , benchIOSrc aheadly "foldMapM (List)" (sourceFoldMapM value)
6765 ]
6866 ]
6967
@@ -72,7 +70,7 @@ o_1_space_concatMap value =
7270 value2 `seq`
7371 [ bgroup "concat"
7472 -- This is for comparison with foldMapWith
75− [ benchIOSrc fromSerial "concatMapWithId (n of 1) (fromFoldable)"
73+ [ benchIOSrc serially "concatMapWithId (n of 1) (fromFoldable)"
7674 (S.concatMapWith ahead id . sourceConcatMapId value)
7775
7876 , benchIO "concatMapWith (n of 1)"
@@ -95,13 +93,13 @@ o_1_space_concatMap value =
9593o_1_space_outerProduct :: Int -> [Benchmark]
9694o_1_space_outerProduct value =
9795 [ bgroup "monad-outer-product"
98− [ benchIO "toNullAp" $ toNullAp value fromAhead
99− , benchIO "toNull" $ toNullM value fromAhead
100− , benchIO "toNull3" $ toNullM3 value fromAhead
101− , benchIO "filterAllOut" $ filterAllOutM value fromAhead
102− , benchIO "filterAllIn" $ filterAllInM value fromAhead
103− , benchIO "filterSome" $ filterSome value fromAhead
104− , benchIO "breakAfterSome" $ breakAfterSome value fromAhead
96+ [ benchIO "toNullAp" $ toNullAp value aheadly
97+ , benchIO "toNull" $ toNullM value aheadly
98+ , benchIO "toNull3" $ toNullM3 value aheadly
99+ , benchIO "filterAllOut" $ filterAllOutM value aheadly
100+ , benchIO "filterAllIn" $ filterAllInM value aheadly
101+ , benchIO "filterSome" $ filterSome value aheadly
102+ , benchIO "breakAfterSome" $ breakAfterSome value aheadly
105103
106104 ]
107105 ]
@@ -109,8 +107,8 @@ o_1_space_outerProduct value =
109107o_n_space_outerProduct :: Int -> [Benchmark]
110108o_n_space_outerProduct value =
111109 [ bgroup "monad-outer-product"
112− [ benchIO "toList" $ toListM value fromAhead
113− , benchIO "toListSome" $ toListSome value fromAhead
110+ [ benchIO "toList" $ toListM value aheadly
111+ , benchIO "toListSome" $ toListSome value aheadly
114112 ]
115113 ]
116114
@@ -119,7 +117,9 @@ o_n_space_outerProduct value =
119117-------------------------------------------------------------------------------
120118
121119main :: IO ()
122−main = runWithCLIOpts defaultStreamSize allBenchmarks
120+main = do
121+ (value, cfg, benches) <- parseCLIOpts defaultStreamSize
122+ value `seq` runMode (mode cfg) cfg benches (allBenchmarks value)
123123
124124 where
125125
benchmark/Streamly/Benchmark/Prelude/Async.hs+36−37
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
31-- |
42-- Module : Main
53-- Copyright : (c) 2018 Composewell Technologies
@@ -9,14 +7,14 @@
97
108import Prelude hiding (mapM)
119
12−import Streamly.Prelude (fromAsync, async, maxBuffer, maxThreads, fromSerial)
10+import Streamly.Prelude (asyncly, async, maxBuffer, maxThreads, serially)
1311import qualified Streamly.Prelude as S
14−import qualified Streamly.Internal.Data.Stream.IsStream.Transform as Transform
12+import qualified Streamly.Internal.Data.Stream.StreamK.Type as Internal
1513
1614import Streamly.Benchmark.Common
1715import Streamly.Benchmark.Prelude
1816
19−import Test.Tasty.Bench
17+import Gauge
2018
2119moduleName :: String
2220moduleName = "Prelude.Async"
@@ -29,14 +27,14 @@ o_1_space_generation :: Int -> [Benchmark]
2927o_1_space_generation value =
3028 -- These basically test the performance of consMAsync
3129 [ bgroup "generation"
32− [ benchIOSrc fromAsync "unfoldr" (sourceUnfoldr value)
33− , benchIOSrc fromAsync "unfoldrM" (sourceUnfoldrM value)
34− , benchIOSrc fromAsync "fromListM" (sourceFromListM value)
35− , benchIOSrc fromAsync "fromFoldable (List)" (sourceFromFoldable value)
36− , benchIOSrc fromAsync "fromFoldableM (List)" (sourceFromFoldableM value)
37− , benchIOSrc fromAsync "unfoldrM maxThreads 1"
30+ [ benchIOSrc asyncly "unfoldr" (sourceUnfoldr value)
31+ , benchIOSrc asyncly "unfoldrM" (sourceUnfoldrM value)
32+ , benchIOSrc asyncly "fromListM" (sourceFromListM value)
33+ , benchIOSrc asyncly "fromFoldable (List)" (sourceFromFoldable value)
34+ , benchIOSrc asyncly "fromFoldableM (List)" (sourceFromFoldableM value)
35+ , benchIOSrc asyncly "unfoldrM maxThreads 1"
3836 (maxThreads 1 . sourceUnfoldrM value)
39− , benchIOSrc fromAsync "unfoldrM maxBuffer 1 (x/10 ops)"
37+ , benchIOSrc asyncly "unfoldrM maxBuffer 1 (x/10 ops)"
4038 (maxBuffer 1 . sourceUnfoldrM (value `div` 10))
4139 ]
4240 ]
@@ -49,19 +47,19 @@ o_1_space_generation value =
4947foldrSShared :: Int -> Int -> IO ()
5048foldrSShared count n =
5149 S.drain
52− $ fromAsync
53− $ Transform.foldrSShared (\x xs -> S.consM (return x) xs) S.nil
54− $ fromSerial
50+ $ asyncly
51+ $ Internal.foldrSShared (\x xs -> S.consM (return x) xs) S.nil
52+ $ serially
5553 $ sourceUnfoldrM count n
5654
5755o_1_space_mapping :: Int -> [Benchmark]
5856o_1_space_mapping value =
5957 [ bgroup "mapping"
60− [ benchIOSink value "map" $ mapN fromAsync 1
61− , benchIOSink value "fmap" $ fmapN fromAsync 1
58+ [ benchIOSink value "map" $ mapN asyncly 1
59+ , benchIOSink value "fmap" $ fmapN asyncly 1
6260 , benchIOSrc1 "foldrSShared" (foldrSShared value)
6361 -- This basically tests the performance of consMAsync
64− , benchIOSink value "mapM" $ mapM fromAsync 1 . fromSerial
62+ , benchIOSink value "mapM" $ mapM asyncly 1 . serially
6563 ]
6664 ]
6765
@@ -71,7 +69,7 @@ o_1_space_mapping value =
7169
7270o_n_heap_buffering :: Int -> [Benchmark]
7371o_n_heap_buffering value =
74− [bgroup "buffered" [benchIOSink value "mkAsync" (mkAsync fromAsync)]]
72+ [bgroup "buffered" [benchIOSink value "mkAsync" (mkAsync asyncly)]]
7573
7674-------------------------------------------------------------------------------
7775-- Joining
@@ -118,17 +116,17 @@ o_1_space_joining value =
118116o_1_space_concatFoldable :: Int -> [Benchmark]
119117o_1_space_concatFoldable value =
120118 [ bgroup "concat-foldable"
121− [ benchIOSrc fromAsync "foldMapWith (<>) (List)"
119+ [ benchIOSrc asyncly "foldMapWith (<>) (List)"
122120 (sourceFoldMapWith value)
123− , benchIOSrc fromAsync "foldMapWith (<>) (Stream)"
121+ , benchIOSrc asyncly "foldMapWith (<>) (Stream)"
124122 (sourceFoldMapWithStream value)
125− , benchIOSrc fromAsync "foldMapWithM (<>) (List)"
123+ , benchIOSrc asyncly "foldMapWithM (<>) (List)"
126124 (sourceFoldMapWithM value)
127− , benchIOSrc fromAsync "S.concatFoldableWith (<>) (List)"
125+ , benchIOSrc serially "S.concatFoldableWith (<>) (List)"
128126 (concatFoldableWith value)
129− , benchIOSrc fromAsync "S.concatForFoldableWith (<>) (List)"
127+ , benchIOSrc serially "S.concatForFoldableWith (<>) (List)"
130128 (concatForFoldableWith value)
131− , benchIOSrc fromAsync "foldMapM (List)" (sourceFoldMapM value)
129+ , benchIOSrc asyncly "foldMapM (List)" (sourceFoldMapM value)
132130 ]
133131 ]
134132
@@ -138,7 +136,7 @@ o_1_space_concatMap value =
138136 value2 `seq`
139137 [ bgroup "concat"
140138 -- This is for comparison with foldMapWith
141− [ benchIOSrc fromSerial "concatMapWithId (n of 1) (fromFoldable)"
139+ [ benchIOSrc serially "concatMapWithId (n of 1) (fromFoldable)"
142140 (S.concatMapWith async id . sourceConcatMapId value)
143141
144142 , benchIO "concatMapWith (n of 1)"
@@ -161,13 +159,13 @@ o_1_space_concatMap value =
161159o_1_space_outerProduct :: Int -> [Benchmark]
162160o_1_space_outerProduct value =
163161 [ bgroup "monad-outer-product"
164− [ benchIO "toNullAp" $ toNullAp value fromAsync
165− , benchIO "toNull" $ toNullM value fromAsync
166− , benchIO "toNull3" $ toNullM3 value fromAsync
167− , benchIO "filterAllOut" $ filterAllOutM value fromAsync
168− , benchIO "filterAllIn" $ filterAllInM value fromAsync
169− , benchIO "filterSome" $ filterSome value fromAsync
170− , benchIO "breakAfterSome" $ breakAfterSome value fromAsync
162+ [ benchIO "toNullAp" $ toNullAp value asyncly
163+ , benchIO "toNull" $ toNullM value asyncly
164+ , benchIO "toNull3" $ toNullM3 value asyncly
165+ , benchIO "filterAllOut" $ filterAllOutM value asyncly
166+ , benchIO "filterAllIn" $ filterAllInM value asyncly
167+ , benchIO "filterSome" $ filterSome value asyncly
168+ , benchIO "breakAfterSome" $ breakAfterSome value asyncly
171169
172170 ]
173171 ]
@@ -175,8 +173,8 @@ o_1_space_outerProduct value =
175173o_n_space_outerProduct :: Int -> [Benchmark]
176174o_n_space_outerProduct value =
177175 [ bgroup "monad-outer-product"
178− [ benchIO "toList" $ toListM value fromAsync
179− , benchIO "toListSome" $ toListSome value fromAsync
176+ [ benchIO "toList" $ toListM value asyncly
177+ , benchIO "toListSome" $ toListSome value asyncly
180178 ]
181179 ]
182180
@@ -185,8 +183,9 @@ o_n_space_outerProduct value =
185183-------------------------------------------------------------------------------
186184
187185main :: IO ()
188−main = runWithCLIOpts defaultStreamSize allBenchmarks
189−
186+main = do
187+ (value, cfg, benches) <- parseCLIOpts defaultStreamSize
188+ value `seq` runMode (mode cfg) cfg benches (allBenchmarks value)
190189
191190 where
192191
benchmark/Streamly/Benchmark/Prelude/Concurrent.hs+19−28
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−{-# LANGUAGE CPP #-}
31{-# LANGUAGE RankNTypes #-}
42-- |
53-- Module : Main
@@ -10,12 +8,9 @@
108
119import Control.Concurrent
1210import Control.Monad (when, replicateM)
13−import Streamly.Prelude
14− ( IsStream, SerialT, serial, async, fromAsync, ahead, fromAhead, wAsync
15− , fromWAsync, parallel, fromParallel
16− )
1711
18−import Test.Tasty.Bench
12+import Gauge
13+import Streamly.Prelude hiding (mapM_, replicateM)
1914import qualified Streamly.Prelude as S
2015
2116-------------------------------------------------------------------------------
@@ -33,8 +28,8 @@ append buflen tcount d t =
3328 let work = (\i -> when (d /= 0) (threadDelay d) >> return i)
3429 in S.drain
3530 $ t
36− $ S.maxBuffer buflen
37− $ S.maxThreads (-1)
31+ $ maxBuffer buflen
32+ $ maxThreads (-1)
3833 $ S.fromFoldableM $ fmap work [1..tcount]
3934
4035-- | Run @threads@ concurrently, each producing streams of @elems@ elements
@@ -53,33 +48,32 @@ concated
5348concated buflen threads d elems t =
5449 let work = \i -> S.replicateM i (when (d /= 0) (threadDelay d) >> return i)
5550 in S.drain
56− $ S.adapt
57− $ S.maxThreads (-1)
58− $ S.maxBuffer buflen
51+ $ adapt
52+ $ maxThreads (-1)
53+ $ maxBuffer buflen
5954 $ S.concatMapWith t work
6055 $ S.replicate threads elems
6156
6257appendGroup :: Int -> Int -> Int -> [Benchmark]
63−appendGroup buflen threads usec =
64− [ -- bench "serial" $ nfIO $ append buflen threads delay fromSerial
65− bench "ahead" $ nfIO $ append buflen threads usec fromAhead
66− , bench "async" $ nfIO $ append buflen threads usec fromAsync
67− , bench "wAsync" $ nfIO $ append buflen threads usec fromWAsync
68− , bench "parallel" $ nfIO $ append buflen threads usec fromParallel
58+appendGroup buflen threads delay =
59+ [ -- bench "serial" $ nfIO $ append buflen threads delay serially
60+ bench "ahead" $ nfIO $ append buflen threads delay aheadly
61+ , bench "async" $ nfIO $ append buflen threads delay asyncly
62+ , bench "wAsync" $ nfIO $ append buflen threads delay wAsyncly
63+ , bench "parallel" $ nfIO $ append buflen threads delay parallely
6964 ]
7065
7166concatGroup :: Int -> Int -> Int -> Int -> [Benchmark]
72−concatGroup buflen threads usec n =
73− [ bench "serial" $ nfIO $ concated buflen threads usec n serial
74− , bench "ahead" $ nfIO $ concated buflen threads usec n ahead
75− , bench "async" $ nfIO $ concated buflen threads usec n async
76− , bench "wAsync" $ nfIO $ concated buflen threads usec n wAsync
77− , bench "parallel" $ nfIO $ concated buflen threads usec n parallel
67+concatGroup buflen threads delay n =
68+ [ bench "serial" $ nfIO $ concated buflen threads delay n serial
69+ , bench "ahead" $ nfIO $ concated buflen threads delay n ahead
70+ , bench "async" $ nfIO $ concated buflen threads delay n async
71+ , bench "wAsync" $ nfIO $ concated buflen threads delay n wAsync
72+ , bench "parallel" $ nfIO $ concated buflen threads delay n parallel
7873 ]
7974
8075main :: IO ()
8176main =
82−#ifdef MIN_VERSION_gauge
8377 defaultMainWith (defaultConfig
8478 { timeLimit = Just 0
8579 , minSamples = Just 1
@@ -87,9 +81,6 @@ main =
8781 , includeFirstIter = True
8882 , quickMode = True
8983 })
90−#else
91− defaultMain
92−#endif
9384
9485 [ -- bgroup "append/buf-1-threads-10k-0sec" (appendGroup 1 10000 0)
9586 -- , bgroup "append/buf-100-threads-100k-0sec" (appendGroup 100 100000 0)
benchmark/Streamly/Benchmark/Prelude/Merge.hsdeleted−298
@@ -1,298 +0,0 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3−-- |
4−-- Module : Main
5−-- Copyright : (c) 2018 Composewell Technologies
6−--
7−-- License : BSD3
8−-- Maintainer : streamly@composewell.com
9−
10−{-# LANGUAGE BangPatterns #-}
11−{-# LANGUAGE CPP #-}
12−{-# LANGUAGE FlexibleContexts #-}
13−{-# LANGUAGE ScopedTypeVariables #-}
14−{-# LANGUAGE RankNTypes #-}
15−
16−#ifdef __HADDOCK_VERSION__
17−#undef INSPECTION
18−#endif
19−
20−#ifdef INSPECTION
21−{-# LANGUAGE TemplateHaskell #-}
22−{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
23−#endif
24−
25−import Streamly.Internal.Data.Stream.IsStream (SerialT)
26−import qualified Data.List as List
27−import qualified Streamly.Internal.Data.Stream.IsStream as Stream
28−-- import qualified Streamly.Internal.Data.Unfold as Unfold
29−
30−import Streamly.Benchmark.Common
31−import Streamly.Benchmark.Prelude
32−
33−import Test.Tasty.Bench
34−
35−#ifdef INSPECTION
36−import GHC.Types (SPEC(..))
37−import Test.Inspection
38−
39−import qualified Streamly.Internal.Data.Stream as D
40−#endif
41−
42−moduleName :: String
43−moduleName = "Prelude.Merge"
44−
45−-------------------------------------------------------------------------------
46−-- Merging
47−-------------------------------------------------------------------------------
48−
49−{-# INLINE mergeWith #-}
50−mergeWith ::
51− ( (Int -> Int -> Ordering)
52− -> SerialT IO Int
53− -> SerialT IO Int
54− -> SerialT IO Int
55− )
56− -> (Int -> Int -> Ordering)
57− -> Int -> Int -> IO ()
58−mergeWith g cmp count n =
59− Stream.drain
60− $ g
61− cmp
62− (sourceUnfoldrM count n)
63− (sourceUnfoldrM count (n + 1))
64−
65−{-# INLINE mergeWithM #-}
66−mergeWithM ::
67− ( (Int -> Int -> IO Ordering)
68− -> SerialT IO Int
69− -> SerialT IO Int
70− -> SerialT IO Int
71− )
72− -> (Int -> Int -> Ordering)
73− -> Int -> Int -> IO ()
74−mergeWithM g cmp count n =
75− Stream.drain
76− $ g
77− (\a b -> return $ cmp a b)
78− (sourceUnfoldrM count n)
79− (sourceUnfoldrM count (n + 1))
80−
81−{-# INLINE mergeBy #-}
82−mergeBy :: (Int -> Int -> Ordering) -> Int -> Int -> IO ()
83−mergeBy = mergeWith Stream.mergeBy
84−
85−{-# INLINE mergeByM #-}
86−mergeByM :: (Int -> Int -> Ordering) -> Int -> Int -> IO ()
87−mergeByM = mergeWithM Stream.mergeByM
88−
89−{-# INLINE mergeByMFused #-}
90−mergeByMFused :: (Int -> Int -> Ordering) -> Int -> Int -> IO ()
91−mergeByMFused = mergeWithM Stream.mergeByMFused
92−
93−#ifdef INSPECTION
94−inspect $ hasNoTypeClasses 'mergeBy
95−inspect $ 'mergeBy `hasNoType` ''SPEC
96−inspect $ 'mergeBy `hasNoType` ''D.Step
97−
98−inspect $ hasNoTypeClasses 'mergeByM
99−inspect $ 'mergeByM `hasNoType` ''SPEC
100−inspect $ 'mergeByM `hasNoType` ''D.Step
101−
102−{-# INLINE _mergeByMFusedCheck #-}
103−_mergeByMFusedCheck :: IO ()
104−_mergeByMFusedCheck = mergeWithM Stream.mergeByMFused compare 0 0
105−
106−inspect $ hasNoTypeClasses '_mergeByMFusedCheck
107−inspect $ '_mergeByMFusedCheck `hasNoType` ''SPEC
108−inspect $ '_mergeByMFusedCheck `hasNoType` ''D.Step
109−#endif
110−
111−{-# INLINE concatPairsWithMergeBy #-}
112−concatPairsWithMergeBy :: (Int -> Int -> Ordering) -> Int -> Int -> Int -> IO ()
113−concatPairsWithMergeBy cmp = concatPairsWith (Stream.mergeBy cmp)
114−
115−{-# INLINE concatPairsWithMergeByFused #-}
116−concatPairsWithMergeByFused ::
117− (Int -> Int -> Ordering) -> Int -> Int -> Int -> IO ()
118−concatPairsWithMergeByFused cmp =
119− concatPairsWith (Stream.mergeByMFused (\x y -> return $ cmp x y))
120−
121−-------------------------------------------------------------------------------
122−-- Interleaving
123−-------------------------------------------------------------------------------
124−
125−o_1_space_joining :: Int -> [Benchmark]
126−o_1_space_joining value =
127− [ bgroup "joining (2 of n/2)"
128− [ benchIOSrc1
129− "mergeBy compare"
130− (mergeBy compare (value `div` 2))
131− , benchIOSrc1
132− "mergeByM compare"
133− (mergeByM compare (value `div` 2))
134− , benchIOSrc1
135− "mergeByMFused compare"
136− (mergeByMFused compare (value `div` 2))
137−
138− , benchIOSrc1
139− "mergeBy (flip compare)"
140− (mergeBy (flip compare) (value `div` 2))
141− , benchIOSrc1
142− "mergeByM (flip compare)"
143− (mergeByM (flip compare) (value `div` 2))
144− , benchIOSrc1
145− "mergeByMFused (flip compare)"
146− (mergeByMFused (flip compare) (value `div` 2))
147−
148− , benchIOSrc1
149− "concatPairsWithMergeBy compare"
150− (concatPairsWithMergeBy compare 2 (value `div` 2))
151− , benchIOSrc1
152− "concatPairsWithMergeBy (flip compare)"
153− (concatPairsWithMergeBy (flip compare) 2 (value `div` 2))
154−
155− , benchIOSrc1
156− "concatPairsWithMergeByFused compare"
157− (concatPairsWithMergeByFused compare 2 (value `div` 2))
158− , benchIOSrc1
159− "concatPairsWithMergeByFused (flip compare)"
160− (concatPairsWithMergeByFused (flip compare) 2 (value `div` 2))
161− ]
162− ]
163−
164−-------------------------------------------------------------------------------
165−-- Concat
166−-------------------------------------------------------------------------------
167−
168−{-
169−{-# INLINE sourceUnfoldrMUF #-}
170−-- (count, value)
171−sourceUnfoldrMUF :: Monad m => Int -> UF.Unfold m (Int, Int) Int
172−sourceUnfoldrMUF count = UF.unfoldrM step
173− where
174− step (cnt, start) =
175− return $
176− if cnt > start + count
177− then Nothing
178− else Just (cnt, (cnt + 1, start))
179−
180−{-# INLINE unfoldManyMergeBy #-}
181−unfoldManyMergeBy :: Int -> Int -> Int -> IO ()
182−unfoldManyMergeBy outer inner n =
183− S.drain $ (Internal.unfoldManyMergeBy compare)
184− -- (UF.lmap return (UF.replicateM inner))
185− (UF.lmap (\x -> (x,x)) (sourceUnfoldrMUF inner))
186− (sourceUnfoldrM outer n)
187−
188−#ifdef INSPECTION
189−inspect $ hasNoTypeClasses 'unfoldManyMergeBy
190−-- inspect $ 'unfoldManyMergeBy `hasNoType` ''SPEC
191−-- inspect $ 'unfoldManyMergeBy `hasNoType`
192−-- ''D.ConcatUnfoldMergeState
193−#endif
194−-}
195−
196−{-# INLINE sortBy #-}
197−sortBy :: (Int -> Int -> Ordering) -> SerialT IO Int -> IO ()
198−sortBy cmp = Stream.drain . Stream.sortBy cmp
199−
200−{-
201−-- For fair comparison with concatPairs, removed sorted segmentation
202−{-# INLINE listSortBy #-}
203−listSortBy :: (a -> a -> Ordering) -> [a] -> [a]
204−listSortBy cmp = mergeAll . sequences
205− where
206− sequences = fmap (: [])
207−
208− mergeAll [x] = x
209− mergeAll xs = mergeAll (mergePairs xs)
210−
211− mergePairs (a:b:xs) = let !x = merge a b
212− in x : mergePairs xs
213− mergePairs xs = xs
214−
215− merge as@(a:as') bs@(b:bs')
216− | a `cmp` b == GT = b:merge as bs'
217− | otherwise = a:merge as' bs
218− merge [] bs = bs
219− merge as [] = as
220−-}
221−
222−o_n_heap_concat :: Int -> [Benchmark]
223−o_n_heap_concat value =
224− [ bgroup "concatPairsWith"
225− [ benchIOSrc1
226− "concatPairsWithMergeBy compare (n of 1)"
227− (concatPairsWithMergeBy compare value 1)
228− , benchIOSrc1
229− "concatPairsWithMergeBy compare (sqrtVal of sqrtVal)"
230− (concatPairsWithMergeBy compare sqrtVal sqrtVal)
231−
232− , benchIOSrc1
233− "concatPairsWithMergeBy (flip compare) (n of 1)"
234− (concatPairsWithMergeBy (flip compare) value 1)
235− , benchIOSrc1
236− "concatPairsWithMergeBy (flip compare) (sqrtVal of sqrtVal)"
237− (concatPairsWithMergeBy (flip compare) sqrtVal sqrtVal)
238−
239− , benchIOSrc1
240− "concatPairsWithMergeByFused compare (n of 1)"
241− (concatPairsWithMergeByFused compare value 1)
242− , benchIOSrc1
243− "concatPairsWithMergeByFused compare (sqrtVal of sqrtVal)"
244− (concatPairsWithMergeByFused compare sqrtVal sqrtVal)
245− ]
246− -- TODO: change sourceUnfoldrM to generate alternating bigger and lower
247− -- numbers to simulate a random input for a worst case sort benchmark. We
248− -- can use 0 and value as two ints in the state and alternate each in the
249− -- output streams, incrementing the lower number of decrementing the higher
250− -- number.
251− , bgroup "sorting"
252− [ benchIOSink value "sortBy compare" (sortBy compare)
253− , benchIOSink value "sortBy (flip compare)" (sortBy (flip compare))
254− , benchIOSink value "sortBy compare randomized"
255− (sortBy compare . Stream.map (\x -> if even x then x + 2 else x))
256− {-
257− , bench "sortByLists compare"
258− $ nf (\x -> listSortBy compare [1..x]) value
259− , bench "sortByLists (flip compare)"
260− $ nf (\x -> listSortBy (flip compare) [1..x]) value
261− , bench "sortByLists compare randomized"
262− $ nf (\x -> listSortBy compare
263− (map (\n -> if even n then n + 2 else n) [1..x])
264− )
265− value
266− -}
267− , bench "sortByLists compare"
268− $ nf (\x -> List.sortBy compare [1..x]) value
269− , bench "sortByLists (flip compare)"
270− $ nf (\x -> List.sortBy (flip compare) [1..x]) value
271− , bench "sortByLists compare randomized"
272− $ nf (\x -> List.sortBy compare
273− (map (\n -> if even n then n + 2 else n) [1..x])
274− )
275− value
276− ]
277− ]
278−
279− where
280−
281− sqrtVal = round $ sqrt (fromIntegral value :: Double)
282−
283−-------------------------------------------------------------------------------
284−-- Main
285−-------------------------------------------------------------------------------
286−
287−-- In addition to gauge options, the number of elements in the stream can be
288−-- passed using the --stream-size option.
289−--
290−main :: IO ()
291−main = runWithCLIOpts defaultStreamSize allBenchmarks
292−
293− where
294−
295− allBenchmarks size =
296− [ bgroup (o_1_space_prefix moduleName) (o_1_space_joining size)
297− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_concat size)
298− ]
benchmark/Streamly/Benchmark/Prelude/Parallel.hs+34−33
@@ -1,5 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
31-- |
42-- Module : Main
53-- Copyright : (c) 2018 Composewell Technologies
@@ -13,16 +11,17 @@ import Prelude hiding (mapM)
1311
1412import Data.Function ((&))
1513import Streamly.Prelude
16− ( SerialT, fromParallel, parallel, fromSerial, maxBuffer, maxThreads)
14+ ( SerialT, parallely, parallel, serially, maxBuffer, maxThreads)
1715
1816import qualified Streamly.Prelude as S
1917import qualified Streamly.Internal.Data.Fold as FL
18+import qualified Streamly.Internal.Data.Stream.Parallel as Par
2019import qualified Streamly.Internal.Data.Stream.IsStream as Internal
2120
2221import Streamly.Benchmark.Common
2322import Streamly.Benchmark.Prelude
2423
25−import Test.Tasty.Bench
24+import Gauge
2625
2726moduleName :: String
2827moduleName = "Prelude.Parallel"
@@ -73,7 +72,7 @@ parAppSum src = (S.sum S.|$. src) >>= \x -> seq x (return ())
7372
7473{-# INLINE tapAsyncS #-}
7574tapAsyncS :: S.MonadAsync m => Int -> SerialT m Int -> m ()
76−tapAsyncS n = composeN n $ Internal.tapAsyncK S.sum
75+tapAsyncS n = composeN n $ Par.tapAsync S.sum
7776
7877{-# INLINE tapAsync #-}
7978tapAsync :: S.MonadAsync m => Int -> SerialT m Int -> m ()
@@ -82,9 +81,9 @@ tapAsync n = composeN n $ Internal.tapAsync FL.sum
8281o_1_space_merge_app_tap :: Int -> [Benchmark]
8382o_1_space_merge_app_tap value =
8483 [ bgroup "merge-app-tap"
85− [ benchIOSrc fromSerial "mergeAsyncBy (2,x/2)"
84+ [ benchIOSrc serially "mergeAsyncBy (2,x/2)"
8685 (mergeAsyncBy (value `div` 2))
87− , benchIOSrc fromSerial "mergeAsyncByM (2,x/2)"
86+ , benchIOSrc serially "mergeAsyncByM (2,x/2)"
8887 (mergeAsyncByM (value `div` 2))
8988 -- Parallel stages in a pipeline
9089 , benchIOSink value "parAppMap" parAppMap
@@ -104,13 +103,13 @@ o_n_heap_generation :: Int -> [Benchmark]
104103o_n_heap_generation value =
105104 [ bgroup
106105 "generation"
107− [ benchIOSrc fromParallel "unfoldr" (sourceUnfoldr value)
108− , benchIOSrc fromParallel "unfoldrM" (sourceUnfoldrM value)
109− , benchIOSrc fromParallel "fromFoldable" (sourceFromFoldable value)
110− , benchIOSrc fromParallel "fromFoldableM" (sourceFromFoldableM value)
111− , benchIOSrc fromParallel "unfoldrM maxThreads 1"
106+ [ benchIOSrc parallely "unfoldr" (sourceUnfoldr value)
107+ , benchIOSrc parallely "unfoldrM" (sourceUnfoldrM value)
108+ , benchIOSrc parallely "fromFoldable" (sourceFromFoldable value)
109+ , benchIOSrc parallely "fromFoldableM" (sourceFromFoldableM value)
110+ , benchIOSrc parallely "unfoldrM maxThreads 1"
112111 (maxThreads 1 . sourceUnfoldrM value)
113− , benchIOSrc fromParallel "unfoldrM maxBuffer 1 (x/10 ops)"
112+ , benchIOSrc parallely "unfoldrM maxBuffer 1 (x/10 ops)"
114113 (maxBuffer 1 . sourceUnfoldrM (value `div` 10))
115114 ]
116115 ]
@@ -122,9 +121,9 @@ o_n_heap_generation value =
122121o_n_heap_mapping :: Int -> [Benchmark]
123122o_n_heap_mapping value =
124123 [ bgroup "mapping"
125− [ benchIOSink value "map" $ mapN fromParallel 1
126− , benchIOSink value "fmap" $ fmapN fromParallel 1
127− , benchIOSink value "mapM" $ mapM fromParallel 1 . fromSerial
124+ [ benchIOSink value "map" $ mapN parallely 1
125+ , benchIOSink value "fmap" $ fmapN parallely 1
126+ , benchIOSink value "mapM" $ mapM parallely 1 . serially
128127 ]
129128 ]
130129
@@ -154,17 +153,17 @@ o_n_heap_concatFoldable :: Int -> [Benchmark]
154153o_n_heap_concatFoldable value =
155154 [ bgroup
156155 "concat-foldable"
157− [ benchIOSrc fromParallel "foldMapWith (<>) (List)"
156+ [ benchIOSrc parallely "foldMapWith (<>) (List)"
158157 (sourceFoldMapWith value)
159− , benchIOSrc fromParallel "foldMapWith (<>) (Stream)"
158+ , benchIOSrc parallely "foldMapWith (<>) (Stream)"
160159 (sourceFoldMapWithStream value)
161− , benchIOSrc fromParallel "foldMapWithM (<>) (List)"
160+ , benchIOSrc parallely "foldMapWithM (<>) (List)"
162161 (sourceFoldMapWithM value)
163− , benchIOSrc fromSerial "S.concatFoldableWith (<>) (List)"
162+ , benchIOSrc serially "S.concatFoldableWith (<>) (List)"
164163 (concatFoldableWith value)
165− , benchIOSrc fromSerial "S.concatForFoldableWith (<>) (List)"
164+ , benchIOSrc serially "S.concatForFoldableWith (<>) (List)"
166165 (concatForFoldableWith value)
167− , benchIOSrc fromParallel "foldMapM (List)" (sourceFoldMapM value)
166+ , benchIOSrc parallely "foldMapM (List)" (sourceFoldMapM value)
168167 ]
169168 ]
170169
@@ -173,7 +172,7 @@ o_n_heap_concat value =
173172 value2 `seq`
174173 [ bgroup "concat"
175174 -- This is for comparison with foldMapWith
176− [ benchIOSrc fromSerial "concatMapWithId (n of 1) (fromFoldable)"
175+ [ benchIOSrc serially "concatMapWithId (n of 1) (fromFoldable)"
177176 (S.concatMapWith parallel id . sourceConcatMapId value)
178177
179178 , benchIO "concatMapWith (n of 1)"
@@ -196,22 +195,22 @@ o_n_heap_concat value =
196195o_n_heap_outerProduct :: Int -> [Benchmark]
197196o_n_heap_outerProduct value =
198197 [ bgroup "monad-outer-product"
199− [ benchIO "toNullAp" $ toNullAp value fromParallel
200− , benchIO "toNull" $ toNullM value fromParallel
201− , benchIO "toNull3" $ toNullM3 value fromParallel
202− , benchIO "filterAllOut" $ filterAllOutM value fromParallel
203− , benchIO "filterAllIn" $ filterAllInM value fromParallel
204− , benchIO "filterSome" $ filterSome value fromParallel
205− , benchIO "breakAfterSome" $ breakAfterSome value fromParallel
198+ [ benchIO "toNullAp" $ toNullAp value parallely
199+ , benchIO "toNull" $ toNullM value parallely
200+ , benchIO "toNull3" $ toNullM3 value parallely
201+ , benchIO "filterAllOut" $ filterAllOutM value parallely
202+ , benchIO "filterAllIn" $ filterAllInM value parallely
203+ , benchIO "filterSome" $ filterSome value parallely
204+ , benchIO "breakAfterSome" $ breakAfterSome value parallely
206205 ]
207206 ]
208207
209208o_n_space_outerProduct :: Int -> [Benchmark]
210209o_n_space_outerProduct value =
211210 [ bgroup "monad-outer-product"
212− [ benchIO "toList" $ toListM value fromParallel
211+ [ benchIO "toList" $ toListM value parallely
213212 -- XXX disabled due to a bug for now
214− -- , benchIO "toListSome" $ toListSome value fromParallel
213+ -- , benchIO "toListSome" $ toListSome value parallely
215214 ]
216215 ]
217216
@@ -220,7 +219,9 @@ o_n_space_outerProduct value =
220219-------------------------------------------------------------------------------
221220
222221main :: IO ()
223−main = runWithCLIOpts defaultStreamSize allBenchmarks
222+main = do
223+ (value, cfg, benches) <- parseCLIOpts defaultStreamSize
224+ value `seq` runMode (mode cfg) cfg benches (allBenchmarks value)
224225
225226 where
226227
benchmark/Streamly/Benchmark/Prelude/Rate.hs+29−27
@@ -1,4 +1,3 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
21{-# LANGUAGE FlexibleContexts #-}
32
43-- |
@@ -8,13 +7,13 @@
87-- License : BSD3
98-- Maintainer : streamly@composewell.com
109
11−import Streamly.Prelude (fromAsync, fromAhead, maxThreads, IsStream, MonadAsync)
10+import Streamly.Prelude (asyncly, aheadly, maxThreads, IsStream, MonadAsync)
1211import qualified Streamly.Prelude as S
1312
1413import Streamly.Benchmark.Common
1514import Streamly.Benchmark.Prelude
1615
17−import Test.Tasty.Bench
16+import Gauge
1817
1918moduleName :: String
2019moduleName = "Prelude.Rate"
@@ -55,32 +54,32 @@ o_1_space_async value =
5554 "asyncly"
5655 [ bgroup
5756 "avgRate"
58− -- benchIO "unfoldr" $ toNull fromAsync
59− -- benchIOSrc fromAsync "unfoldrM" (sourceUnfoldrM value)
60− [ benchIOSrc fromAsync "Nothing" $ rateNothing value
61− , benchIOSrc fromAsync "1M" $ avgRate value 1000000
62− , benchIOSrc fromAsync "3M" $ avgRate value 3000000
63− , benchIOSrc fromAsync "10M/maxThreads1"
57+ -- benchIO "unfoldr" $ toNull asyncly
58+ -- benchIOSrc asyncly "unfoldrM" (sourceUnfoldrM value)
59+ [ benchIOSrc asyncly "Nothing" $ rateNothing value
60+ , benchIOSrc asyncly "1M" $ avgRate value 1000000
61+ , benchIOSrc asyncly "3M" $ avgRate value 3000000
62+ , benchIOSrc asyncly "10M/maxThreads1"
6463 $ avgRateThreads1 value 10000000
65− , benchIOSrc fromAsync "10M" $ avgRate value 10000000
66− , benchIOSrc fromAsync "20M" $ avgRate value 20000000
64+ , benchIOSrc asyncly "10M" $ avgRate value 10000000
65+ , benchIOSrc asyncly "20M" $ avgRate value 20000000
6766 ]
6867 , bgroup
6968 "minRate"
70− [ benchIOSrc fromAsync "1M" $ minRate value 1000000
71− , benchIOSrc fromAsync "10M" $ minRate value 10000000
72− , benchIOSrc fromAsync "20M" $ minRate value 20000000
69+ [ benchIOSrc asyncly "1M" $ minRate value 1000000
70+ , benchIOSrc asyncly "10M" $ minRate value 10000000
71+ , benchIOSrc asyncly "20M" $ minRate value 20000000
7372 ]
7473 , bgroup
7574 "maxRate"
76− [ -- benchIOSrc fromAsync "10K" $ maxRate value 10000
77− benchIOSrc fromAsync "10M" $ maxRate value 10000000
75+ [ -- benchIOSrc asyncly "10K" $ maxRate value 10000
76+ benchIOSrc asyncly "10M" $ maxRate value 10000000
7877 ]
7978 , bgroup
8079 "constRate"
81− [ -- benchIOSrc fromAsync "10K" $ constRate value 10000
82− benchIOSrc fromAsync "1M" $ constRate value 1000000
83− , benchIOSrc fromAsync "10M" $ constRate value 10000000
80+ [ -- benchIOSrc asyncly "10K" $ constRate value 10000
81+ benchIOSrc asyncly "1M" $ constRate value 1000000
82+ , benchIOSrc asyncly "10M" $ constRate value 10000000
8483 ]
8584 ]
8685 ]
@@ -88,12 +87,12 @@ o_1_space_async value =
8887o_1_space_ahead :: Int -> [Benchmark]
8988o_1_space_ahead value =
9089 [ bgroup
91− "aheadly"
92− [ benchIOSrc fromAhead "avgRate/1M" $ avgRate value 1000000
93− , benchIOSrc fromAhead "minRate/1M" $ minRate value 1000000
94− , benchIOSrc fromAhead "maxRate/1M" $ maxRate value 1000000
95− , benchIOSrc fromAsync "constRate/1M" $ constRate value 1000000
96− ]
90+ "aheadly"
91+ [ benchIOSrc aheadly "avgRate/1M" $ avgRate value 1000000
92+ , benchIOSrc aheadly "minRate/1M" $ minRate value 1000000
93+ , benchIOSrc aheadly "maxRate/1M" $ maxRate value 1000000
94+ , benchIOSrc asyncly "constRate/1M" $ constRate value 1000000
95+ ]
9796 ]
9897
9998-------------------------------------------------------------------------------
@@ -101,10 +100,13 @@ o_1_space_ahead value =
101100-------------------------------------------------------------------------------
102101
103102main :: IO ()
104−main = runWithCLIOpts defaultStreamSize allBenchmarks
103+main = do
104+ (value, cfg, benches) <- parseCLIOpts defaultStreamSize
105+ value `seq` runMode (mode cfg) cfg benches (allBenchmarks value)
105106
106107 where
107108
108109 allBenchmarks value =
109110 [ bgroup (o_1_space_prefix moduleName)
110− $ concat [o_1_space_async value, o_1_space_ahead value]]
111+ $ concat [o_1_space_async value, o_1_space_ahead value]
112+ ]
benchmark/Streamly/Benchmark/Prelude/Serial.hsnew file+54
@@ -0,0 +1,54 @@
1+-- |
2+-- Module : Serial
3+-- Copyright : (c) 2018 Composewell Technologies
4+-- License : BSD-3-Clause
5+-- Maintainer : streamly@composewell.com
6+
7+{-# LANGUAGE CPP #-}
8+{-# LANGUAGE FlexibleContexts #-}
9+{-# LANGUAGE ScopedTypeVariables #-}
10+{-# LANGUAGE RankNTypes #-}
11+
12+module Main (main) where
13+
14+import Streamly.Benchmark.Common.Handle (mkHandleBenchEnv)
15+
16+import qualified Serial.Elimination as Elimination
17+import qualified Serial.Exceptions as Exceptions
18+import qualified Serial.Generation as Generation
19+import qualified Serial.Nested as Nested
20+import qualified Serial.Split as Split
21+import qualified Serial.Transformation1 as Transformation1
22+import qualified Serial.Transformation2 as Transformation2
23+import qualified Serial.Transformation3 as Transformation3
24+
25+import Gauge hiding (env)
26+import Streamly.Benchmark.Common
27+
28+moduleName :: String
29+moduleName = "Prelude.Serial"
30+
31+-------------------------------------------------------------------------------
32+-- Main
33+-------------------------------------------------------------------------------
34+
35+-- In addition to gauge options, the number of elements in the stream can be
36+-- passed using the --stream-size option.
37+--
38+main :: IO ()
39+main = do
40+ (value, cfg, benches) <- parseCLIOpts defaultStreamSize
41+ env <- mkHandleBenchEnv
42+ value `seq` runMode (mode cfg) cfg benches (allBenchmarks value env)
43+ where
44+
45+ allBenchmarks size env = Prelude.concat
46+ [ Generation.benchmarks moduleName size
47+ , Elimination.benchmarks moduleName size
48+ , Exceptions.benchmarks moduleName env
49+ , Split.benchmarks moduleName env
50+ , Transformation1.benchmarks moduleName size
51+ , Transformation2.benchmarks moduleName size
52+ , Transformation3.benchmarks moduleName size
53+ , Nested.benchmarks moduleName size
54+ ]
benchmark/Streamly/Benchmark/Data/Stream/Eliminate.hs → benchmark/Streamly/Benchmark/Prelude/Serial/Elimination.hsrenamed+126−188
@@ -1,20 +1,14 @@
11-- |
2−-- Module : Stream.Eliminate
2+-- Module : Serial.Elimination
33-- Copyright : (c) 2018 Composewell Technologies
44-- License : BSD-3-Clause
55-- Maintainer : streamly@composewell.com
66
77{-# LANGUAGE CPP #-}
88{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE FlexibleInstances #-}
109{-# LANGUAGE ScopedTypeVariables #-}
1110{-# LANGUAGE RankNTypes #-}
1211
13−{-# OPTIONS_GHC -Wno-orphans #-}
14−#ifdef USE_PRELUDE
15−{-# OPTIONS_GHC -Wno-deprecations #-}
16−#endif
17−
1812#ifdef __HADDOCK_VERSION__
1913#undef INSPECTION
2014#endif
@@ -24,7 +18,7 @@
2418{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
2519#endif
2620
27−module Stream.Eliminate (benchmarks) where
21+module Serial.Elimination (benchmarks) where
2822
2923import Control.DeepSeq (NFData(..))
3024import Data.Functor.Identity (Identity, runIdentity)
@@ -32,45 +26,29 @@ import System.Random (randomRIO)
3226
3327import qualified Data.Foldable as F
3428import qualified GHC.Exts as GHC
35−import qualified Streamly.Internal.Data.Fold as Fold
3629
3730#ifdef INSPECTION
3831import GHC.Types (SPEC(..))
3932import Test.Inspection
40−import qualified Streamly.Internal.Data.Stream as D
41−#endif
4233
43−#ifdef USE_PRELUDE
44−import Streamly.Prelude (fromSerial)
45−import Streamly.Benchmark.Prelude
46−import qualified Streamly.Internal.Data.Stream.IsStream as S
47−import qualified Streamly.Internal.Data.Stream.IsStream as StreamK
48−#else
49−import Stream.Common
50−import Streamly.Internal.Data.Stream (Stream)
51−import qualified Streamly.Internal.Data.Stream as S
52−#ifdef USE_STREAMK
53−import Streamly.Internal.Data.StreamK (StreamK)
54−import qualified Streamly.Data.StreamK as StreamK
55−#else
56−import qualified Streamly.Internal.Data.Stream as StreamK
57−#endif
34+import qualified Streamly.Internal.Data.Stream.StreamD as D
5835#endif
5936
60−import Test.Tasty.Bench
37+import qualified Streamly.Prelude as S
38+import qualified Streamly.Internal.Data.Stream.IsStream as Internal
39+
40+import Gauge
41+import Streamly.Prelude (SerialT, IsStream, serially)
6142import Streamly.Benchmark.Common
43+import Streamly.Benchmark.Prelude
44+import qualified Streamly.Internal.Data.Stream.IsStream as IP
6245import Prelude hiding (length, sum, or, and, any, all, notElem, elem, (!!),
6346 lookup, repeat, minimum, maximum, product, last, mapM_, init)
6447import qualified Prelude
6548
66−#ifdef USE_PRELUDE
67−type Stream = S.SerialT
68−fromStream = id
69−
7049{-# INLINE repeat #-}
7150repeat :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
7251repeat count = S.take count . S.repeat
73−#endif
7452
7553-------------------------------------------------------------------------------
7654-- Elimination
@@ -83,92 +61,90 @@ repeat count = S.take count . S.repeat
8361{-# INLINE foldableFoldl' #-}
8462foldableFoldl' :: Int -> Int -> Int
8563foldableFoldl' value n =
86− F.foldl' (+) 0 (sourceUnfoldr value n :: Stream Identity Int)
64+ F.foldl' (+) 0 (sourceUnfoldr value n :: S.SerialT Identity Int)
8765
8866{-# INLINE foldableFoldrElem #-}
8967foldableFoldrElem :: Int -> Int -> Bool
9068foldableFoldrElem value n =
9169 F.foldr (\x xs -> x == value || xs)
9270 False
93− (sourceUnfoldr value n :: Stream Identity Int)
71+ (sourceUnfoldr value n :: S.SerialT Identity Int)
9472
9573{-# INLINE foldableSum #-}
9674foldableSum :: Int -> Int -> Int
9775foldableSum value n =
98− Prelude.sum (sourceUnfoldr value n :: Stream Identity Int)
76+ Prelude.sum (sourceUnfoldr value n :: S.SerialT Identity Int)
9977
10078{-# INLINE foldableProduct #-}
10179foldableProduct :: Int -> Int -> Int
10280foldableProduct value n =
103− Prelude.product (sourceUnfoldr value n :: Stream Identity Int)
81+ Prelude.product (sourceUnfoldr value n :: S.SerialT Identity Int)
10482
10583{-# INLINE _foldableNull #-}
10684_foldableNull :: Int -> Int -> Bool
10785_foldableNull value n =
108− Prelude.null (sourceUnfoldr value n :: Stream Identity Int)
86+ Prelude.null (sourceUnfoldr value n :: S.SerialT Identity Int)
10987
11088{-# INLINE foldableElem #-}
11189foldableElem :: Int -> Int -> Bool
11290foldableElem value n =
113− value `Prelude.elem` (sourceUnfoldr value n :: Stream Identity Int)
91+ value `Prelude.elem` (sourceUnfoldr value n :: S.SerialT Identity Int)
11492
11593{-# INLINE foldableNotElem #-}
11694foldableNotElem :: Int -> Int -> Bool
11795foldableNotElem value n =
118− value `Prelude.notElem` (sourceUnfoldr value n :: Stream Identity Int)
96+ value `Prelude.notElem` (sourceUnfoldr value n :: S.SerialT Identity Int)
11997
12098{-# INLINE foldableFind #-}
12199foldableFind :: Int -> Int -> Maybe Int
122100foldableFind value n =
123− F.find (== (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
101+ F.find (== (value + 1)) (sourceUnfoldr value n :: S.SerialT Identity Int)
124102
125103{-# INLINE foldableAll #-}
126104foldableAll :: Int -> Int -> Bool
127105foldableAll value n =
128− Prelude.all (<= (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
106+ Prelude.all (<= (value + 1)) (sourceUnfoldr value n :: S.SerialT Identity Int)
129107
130108{-# INLINE foldableAny #-}
131109foldableAny :: Int -> Int -> Bool
132110foldableAny value n =
133− Prelude.any (> (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
111+ Prelude.any (> (value + 1)) (sourceUnfoldr value n :: S.SerialT Identity Int)
134112
135−{- HLINT ignore "Use all"-}
136113{-# INLINE foldableAnd #-}
137114foldableAnd :: Int -> Int -> Bool
138115foldableAnd value n =
139− Prelude.and $ fmap
140− (<= (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
116+ Prelude.and $ S.map
117+ (<= (value + 1)) (sourceUnfoldr value n :: S.SerialT Identity Int)
141118
142−{- HLINT ignore "Use any"-}
143119{-# INLINE foldableOr #-}
144120foldableOr :: Int -> Int -> Bool
145121foldableOr value n =
146− Prelude.or $ fmap
147− (> (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
122+ Prelude.or $ S.map
123+ (> (value + 1)) (sourceUnfoldr value n :: S.SerialT Identity Int)
148124
149125{-# INLINE foldableLength #-}
150126foldableLength :: Int -> Int -> Int
151127foldableLength value n =
152− Prelude.length (sourceUnfoldr value n :: Stream Identity Int)
128+ Prelude.length (sourceUnfoldr value n :: S.SerialT Identity Int)
153129
154130{-# INLINE foldableMin #-}
155131foldableMin :: Int -> Int -> Int
156132foldableMin value n =
157− Prelude.minimum (sourceUnfoldr value n :: Stream Identity Int)
133+ Prelude.minimum (sourceUnfoldr value n :: S.SerialT Identity Int)
158134
159135{-# INLINE ordInstanceMin #-}
160−ordInstanceMin :: Stream Identity Int -> Stream Identity Int
136+ordInstanceMin :: SerialT Identity Int -> SerialT Identity Int
161137ordInstanceMin src = min src src
162138
163139{-# INLINE foldableMax #-}
164140foldableMax :: Int -> Int -> Int
165141foldableMax value n =
166− Prelude.maximum (sourceUnfoldr value n :: Stream Identity Int)
142+ Prelude.maximum (sourceUnfoldr value n :: S.SerialT Identity Int)
167143
168144{-# INLINE foldableMinBy #-}
169145foldableMinBy :: Int -> Int -> Int
170146foldableMinBy value n =
171− F.minimumBy compare (sourceUnfoldr value n :: Stream Identity Int)
147+ F.minimumBy compare (sourceUnfoldr value n :: S.SerialT Identity Int)
172148
173149{-# INLINE foldableListMinBy #-}
174150foldableListMinBy :: Int -> Int -> Int
@@ -177,30 +153,30 @@ foldableListMinBy value n = F.minimumBy compare [1..value+n]
177153{-# INLINE foldableMaxBy #-}
178154foldableMaxBy :: Int -> Int -> Int
179155foldableMaxBy value n =
180− F.maximumBy compare (sourceUnfoldr value n :: Stream Identity Int)
156+ F.maximumBy compare (sourceUnfoldr value n :: S.SerialT Identity Int)
181157
182158{-# INLINE foldableToList #-}
183159foldableToList :: Int -> Int -> [Int]
184160foldableToList value n =
185− F.toList (sourceUnfoldr value n :: Stream Identity Int)
161+ F.toList (sourceUnfoldr value n :: S.SerialT Identity Int)
186162
187163{-# INLINE foldableMapM_ #-}
188164foldableMapM_ :: Monad m => Int -> Int -> m ()
189165foldableMapM_ value n =
190− F.mapM_ (\_ -> return ()) (sourceUnfoldr value n :: Stream Identity Int)
166+ F.mapM_ (\_ -> return ()) (sourceUnfoldr value n :: S.SerialT Identity Int)
191167
192168{-# INLINE foldableSequence_ #-}
193169foldableSequence_ :: Int -> Int -> IO ()
194170foldableSequence_ value n =
195− F.sequence_ (sourceUnfoldrAction value n :: Stream Identity (IO Int))
171+ F.sequence_ (sourceUnfoldrAction value n :: S.SerialT Identity (IO Int))
196172
197173{-# INLINE _foldableMsum #-}
198174_foldableMsum :: Int -> Int -> IO Int
199175_foldableMsum value n =
200− F.msum (sourceUnfoldrAction value n :: Stream Identity (IO Int))
176+ F.msum (sourceUnfoldrAction value n :: S.SerialT Identity (IO Int))
201177
202178{-# INLINE showInstance #-}
203−showInstance :: Stream Identity Int -> String
179+showInstance :: SerialT Identity Int -> String
204180showInstance = show
205181
206182o_1_space_elimination_foldable :: Int -> [Benchmark]
@@ -217,9 +193,6 @@ o_1_space_elimination_foldable value =
217193 , bench "minimum" $ nf (foldableMin value) 1
218194 , benchPureSink value "min (ord)" ordInstanceMin
219195 , 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
223196 , bench "length . toList"
224197 $ nf (Prelude.length . foldableToList value) 1
225198 , bench "notElem" $ nf (foldableNotElem value) 1
@@ -242,25 +215,34 @@ o_1_space_elimination_foldable value =
242215 ]
243216 ]
244217
218+o_n_space_elimination_foldable :: Int -> [Benchmark]
219+o_n_space_elimination_foldable value =
220+ -- Head recursive strict right folds.
221+ [ bgroup "foldl"
222+ -- XXX the definitions of minimumBy and maximumBy in Data.Foldable use
223+ -- foldl1 which does not work in constant memory for our
224+ -- implementation. It works in constant memory for lists but even for
225+ -- lists it takes 15x more time compared to our foldl' based
226+ -- implementation.
227+ [ bench "minimumBy" $ nf (`foldableMinBy` 1) value
228+ , bench "maximumBy" $ nf (`foldableMaxBy` 1) value
229+ , bench "minimumByList" $ nf (`foldableListMinBy` 1) value
230+ ]
231+ ]
232+
245233-------------------------------------------------------------------------------
246234-- Stream folds
247235-------------------------------------------------------------------------------
248236
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−
255237{-# INLINE benchPureSink #-}
256238benchPureSink :: NFData b
257− => Int -> String -> (Stream Identity Int -> b) -> Benchmark
239+ => Int -> String -> (SerialT Identity Int -> b) -> Benchmark
258240benchPureSink value name = benchPure name (sourceUnfoldr value)
259241
260242{-# INLINE benchHoistSink #-}
261243benchHoistSink
262− :: (NFData b)
263− => Int -> String -> (Stream Identity Int -> IO b) -> Benchmark
244+ :: (IsStream t, NFData b)
245+ => Int -> String -> (t Identity Int -> IO b) -> Benchmark
264246benchHoistSink value name f =
265247 bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldr value
266248
@@ -268,8 +250,8 @@ benchHoistSink value name f =
268250-- we can't use it as it requires MonadAsync constraint.
269251{-# INLINE benchIdentitySink #-}
270252benchIdentitySink
271− :: (NFData b)
272− => Int -> String -> (Stream Identity Int -> Identity b) -> Benchmark
253+ :: (IsStream t, NFData b)
254+ => Int -> String -> (t Identity Int -> Identity b) -> Benchmark
273255benchIdentitySink value name f = bench name $ nf (f . sourceUnfoldr value) 1
274256
275257-------------------------------------------------------------------------------
@@ -277,29 +259,23 @@ benchIdentitySink value name f = bench name $ nf (f . sourceUnfoldr value) 1
277259-------------------------------------------------------------------------------
278260
279261{-# INLINE uncons #-}
280−#ifdef USE_STREAMK
281−uncons :: Monad m => StreamK m Int -> m ()
282−#else
283−uncons :: Monad m => Stream m Int -> m ()
284−#endif
262+uncons :: Monad m => SerialT m Int -> m ()
285263uncons s = do
286− r <- StreamK.uncons s
264+ r <- S.uncons s
287265 case r of
288266 Nothing -> return ()
289267 Just (_, t) -> uncons t
290268
291−#ifdef USE_PRELUDE
292269{-# INLINE init #-}
293−init :: Monad m => Stream m a -> m ()
270+init :: Monad m => SerialT m a -> m ()
294271init s = S.init s >>= Prelude.mapM_ S.drain
295272
296273{-# INLINE mapM_ #-}
297−mapM_ :: Monad m => Stream m Int -> m ()
274+mapM_ :: Monad m => SerialT m Int -> m ()
298275mapM_ = S.mapM_ (\_ -> return ())
299−#endif
300276
301277{-# INLINE foldrMElem #-}
302−foldrMElem :: Monad m => Int -> Stream m Int -> m Bool
278+foldrMElem :: Monad m => Int -> SerialT m Int -> m Bool
303279foldrMElem e =
304280 S.foldrM
305281 (\x xs ->
@@ -308,191 +284,159 @@ foldrMElem e =
308284 else xs)
309285 (return False)
310286
311−#ifdef USE_STREAMK
312287{-# INLINE foldrToStream #-}
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)
318−-- foldrToStream = S.foldr S.cons S.nil
319−#endif
288+foldrToStream :: Monad m => SerialT m Int -> m (SerialT Identity Int)
289+foldrToStream = S.foldr S.cons S.nil
320290
321291{-# INLINE foldrMBuild #-}
322−foldrMBuild :: Monad m => Stream m Int -> m [Int]
292+foldrMBuild :: Monad m => SerialT m Int -> m [Int]
323293foldrMBuild = S.foldrM (\x xs -> (x :) <$> xs) (return [])
324294
325−#ifdef USE_PRELUDE
326295{-# INLINE foldl'Reduce #-}
327−foldl'Reduce :: Monad m => Stream m Int -> m Int
296+foldl'Reduce :: Monad m => SerialT m Int -> m Int
328297foldl'Reduce = S.foldl' (+) 0
329298
330299{-# INLINE foldl1'Reduce #-}
331−foldl1'Reduce :: Monad m => Stream m Int -> m (Maybe Int)
300+foldl1'Reduce :: Monad m => SerialT m Int -> m (Maybe Int)
332301foldl1'Reduce = S.foldl1' (+)
333302
334303{-# INLINE foldlM'Reduce #-}
335−foldlM'Reduce :: Monad m => Stream m Int -> m Int
304+foldlM'Reduce :: Monad m => SerialT m Int -> m Int
336305foldlM'Reduce = S.foldlM' (\xs a -> return $ a + xs) (return 0)
337306
338307{-# INLINE last #-}
339−last :: Monad m => Stream m Int -> m (Maybe Int)
308+last :: Monad m => SerialT m Int -> m (Maybe Int)
340309last = S.last
341310
342311{-# INLINE _head #-}
343−_head :: Monad m => Stream m Int -> m (Maybe Int)
312+_head :: Monad m => SerialT m Int -> m (Maybe Int)
344313_head = S.head
345314
346315{-# INLINE elem #-}
347−elem :: Monad m => Int -> Stream m Int -> m Bool
316+elem :: Monad m => Int -> SerialT m Int -> m Bool
348317elem value = S.elem (value + 1)
349318
350319{-# INLINE notElem #-}
351−notElem :: Monad m => Int -> Stream m Int -> m Bool
320+notElem :: Monad m => Int -> SerialT m Int -> m Bool
352321notElem value = S.notElem (value + 1)
353322
354323{-# INLINE length #-}
355−length :: Monad m => Stream m Int -> m Int
324+length :: Monad m => SerialT m Int -> m Int
356325length = S.length
357326
358327{-# INLINE all #-}
359−all :: Monad m => Int -> Stream m Int -> m Bool
328+all :: Monad m => Int -> SerialT m Int -> m Bool
360329all value = S.all (<= (value + 1))
361330
362331{-# INLINE any #-}
363−any :: Monad m => Int -> Stream m Int -> m Bool
332+any :: Monad m => Int -> SerialT m Int -> m Bool
364333any value = S.any (> (value + 1))
365334
366335{-# INLINE and #-}
367−and :: Monad m => Int -> Stream m Int -> m Bool
336+and :: Monad m => Int -> SerialT m Int -> m Bool
368337and value = S.and . S.map (<= (value + 1))
369338
370339{-# INLINE or #-}
371−or :: Monad m => Int -> Stream m Int -> m Bool
340+or :: Monad m => Int -> SerialT m Int -> m Bool
372341or value = S.or . S.map (> (value + 1))
373342
374343{-# INLINE find #-}
375−find :: Monad m => Int -> Stream m Int -> m (Maybe Int)
344+find :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
376345find value = S.find (== (value + 1))
377346
378347{-# INLINE findM #-}
379−findM :: Monad m => Int -> Stream m Int -> m (Maybe Int)
348+findM :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
380349findM value = S.findM (\z -> return $ z == (value + 1))
381350
382351{-# INLINE findIndex #-}
383−findIndex :: Monad m => Int -> Stream m Int -> m (Maybe Int)
352+findIndex :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
384353findIndex value = S.findIndex (== (value + 1))
385354
386355{-# INLINE elemIndex #-}
387−elemIndex :: Monad m => Int -> Stream m Int -> m (Maybe Int)
356+elemIndex :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
388357elemIndex value = S.elemIndex (value + 1)
389358
390359{-# INLINE maximum #-}
391−maximum :: Monad m => Stream m Int -> m (Maybe Int)
360+maximum :: Monad m => SerialT m Int -> m (Maybe Int)
392361maximum = S.maximum
393362
394363{-# INLINE minimum #-}
395−minimum :: Monad m => Stream m Int -> m (Maybe Int)
364+minimum :: Monad m => SerialT m Int -> m (Maybe Int)
396365minimum = S.minimum
397366
398367{-# INLINE sum #-}
399−sum :: Monad m => Stream m Int -> m Int
368+sum :: Monad m => SerialT m Int -> m Int
400369sum = S.sum
401370
402371{-# INLINE product #-}
403−product :: Monad m => Stream m Int -> m Int
372+product :: Monad m => SerialT m Int -> m Int
404373product = S.product
405374
406375{-# INLINE minimumBy #-}
407−minimumBy :: Monad m => Stream m Int -> m (Maybe Int)
376+minimumBy :: Monad m => SerialT m Int -> m (Maybe Int)
408377minimumBy = S.minimumBy compare
409378
410379{-# INLINE maximumBy #-}
411−maximumBy :: Monad m => Stream m Int -> m (Maybe Int)
380+maximumBy :: Monad m => SerialT m Int -> m (Maybe Int)
412381maximumBy = S.maximumBy compare
413382
414383{-# INLINE the #-}
415−the :: Monad m => Stream m Int -> m (Maybe Int)
384+the :: Monad m => SerialT m Int -> m (Maybe Int)
416385the = S.the
417386
418387{-# INLINE drainN #-}
419−drainN :: Monad m => Int -> Stream m Int -> m ()
388+drainN :: Monad m => Int -> SerialT m Int -> m ()
420389drainN = S.drainN
421390
422391{-# INLINE drainWhile #-}
423−drainWhile :: Monad m => Stream m Int -> m ()
392+drainWhile :: Monad m => SerialT m Int -> m ()
424393drainWhile = S.drainWhile (const True)
425394
426395{-# INLINE (!!) #-}
427−(!!) :: Monad m => Int -> Stream m Int -> m (Maybe Int)
428−(!!) = flip (S.!!)
396+(!!) :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
397+(!!) = flip (Internal.!!)
429398
430399{-# INLINE lookup #-}
431−lookup :: Monad m => Int -> Stream m Int -> m (Maybe Int)
400+lookup :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
432401lookup val = S.lookup val . S.map (\x -> (x, x))
433−#endif
434402
435403o_1_space_elimination_folds :: Int -> [Benchmark]
436404o_1_space_elimination_folds value =
437405 [ bgroup "elimination"
438406 -- Basic folds
439− [
440−#ifdef USE_PRELUDE
441− bgroup "reduce"
407+ [ bgroup "reduce"
442408 [ bgroup
443409 "IO"
444410 [ benchIOSink value "foldl'" foldl'Reduce
445411 , benchIOSink value "foldl1'" foldl1'Reduce
446412 , benchIOSink value "foldlM'" foldlM'Reduce
447413 ]
448−
449414 , bgroup
450415 "Identity"
451416 [ benchIdentitySink value "foldl'" foldl'Reduce
452417 , benchIdentitySink value "foldl1'" foldl1'Reduce
453418 , benchIdentitySink value "foldlM'" foldlM'Reduce
454419 ]
455− ] ,
456−#endif
457− bgroup "build"
420+ ]
421+ , bgroup "build"
458422 [ bgroup "IO"
459423 [ benchIOSink value "foldrMElem" (foldrMElem value)
460424 ]
461425 , bgroup "Identity"
462426 [ benchIdentitySink value "foldrMElem" (foldrMElem value)
463−#ifdef USE_STREAMK
464427 , benchIdentitySink value "foldrToStreamLength"
465− (S.fold Fold.length . toStream . runIdentity . foldrToStream)
466− {-
467− , benchIdentitySink 16 "foldrToStreamLength (16)"
468− (S.fold Fold.length . toStream . runIdentity . foldrToStream)
469− -}
470−#else
471− {-
472− , benchIdentitySink 16 "foldrToStreamLength (16)"
473− (S.fold Fold.length . runIdentity . foldrToStream)
474− -}
475−#endif
476− {-
477− , benchPureSink 16 "foldrMToListLength (16)"
478− (Prelude.length . runIdentity . foldrMBuild)
479− -}
428+ (S.length . runIdentity . foldrToStream)
480429 , benchPureSink value "foldrMToListLength"
481430 (Prelude.length . runIdentity . foldrMBuild)
482431 ]
483432 ]
484433
485434 -- deconstruction
486− , benchIOSink value "uncons" (uncons . fromStream)
487−#ifndef USE_PRELUDE
488− , benchHoistSink value "length . generalizeInner"
489− (S.fold Fold.length . S.generalizeInner)
490−#endif
491−#ifdef USE_PRELUDE
435+ , benchIOSink value "uncons" uncons
492436 , benchIOSink value "init" init
493437
494438 -- draining
495− , benchIOSink value "drain" $ toNull fromSerial
439+ , benchIOSink value "drain" $ toNull serially
496440 , benchIOSink value "drainN" $ drainN value
497441 , benchIOSink value "drainWhile" drainWhile
498442 , benchPureSink value "drain (pure)" id
@@ -502,6 +446,8 @@ o_1_space_elimination_folds value =
502446 -- , benchIOSink value "head" head
503447 , benchIOSink value "last" last
504448 , benchIOSink value "length" length
449+ , benchHoistSink value "length . generally"
450+ (length . Internal.generally)
505451 , benchIOSink value "sum" sum
506452 , benchIOSink value "product" product
507453 , benchIOSink value "maximumBy" maximumBy
@@ -525,8 +471,8 @@ o_1_space_elimination_folds value =
525471 , benchIOSink value "any" (any value)
526472 , benchIOSink value "and" (and value)
527473 , benchIOSink value "or" (or value)
528−#endif
529474
475+ , benchPureSink value "showsPrec pure streams" showInstance
530476 -- length is used to check for foldr/build fusion
531477 , benchPureSink value "length . IsList.toList" (Prelude.length . GHC.toList)
532478 ]
@@ -536,13 +482,12 @@ o_1_space_elimination_folds value =
536482-- Buffered Transformations by fold
537483-------------------------------------------------------------------------------
538484
539−#ifdef USE_PRELUDE
540485{-# INLINE foldl'Build #-}
541−foldl'Build :: Monad m => Stream m Int -> m [Int]
486+foldl'Build :: Monad m => SerialT m Int -> m [Int]
542487foldl'Build = S.foldl' (flip (:)) []
543488
544489{-# INLINE foldlM'Build #-}
545−foldlM'Build :: Monad m => Stream m Int -> m [Int]
490+foldlM'Build :: Monad m => SerialT m Int -> m [Int]
546491foldlM'Build = S.foldlM' (\xs x -> return $ x : xs) (return [])
547492
548493o_n_heap_elimination_foldl :: Int -> [Benchmark]
@@ -556,7 +501,6 @@ o_n_heap_elimination_foldl value =
556501 , benchIdentitySink value "foldlM'/build/Identity" foldlM'Build
557502 ]
558503 ]
559−#endif
560504
561505-- For comparisons
562506{-# INLINE showInstanceList #-}
@@ -570,13 +514,11 @@ o_n_heap_elimination_buffered value =
570514 -- XXX can the outputs be streaming? Can we have special read/show
571515 -- style type classes, readM/showM supporting streaming effects?
572516 [ bench "showPrec Haskell lists" $ nf showInstanceList (mkList value)
573− -- XXX This is not o-1-space for GHC-8.10
574− , benchPureSink value "showsPrec pure streams" showInstance
575517 ]
576518 ]
577519
578520{-# INLINE foldrMReduce #-}
579−foldrMReduce :: Monad m => Stream m Int -> m Int
521+foldrMReduce :: Monad m => SerialT m Int -> m Int
580522foldrMReduce = S.foldrM (\x xs -> (x +) <$> xs) (return 0)
581523
582524o_n_space_elimination_foldr :: Int -> [Benchmark]
@@ -592,14 +534,14 @@ o_n_space_elimination_foldr value =
592534 ]
593535 ]
594536
595−#ifdef USE_PRELUDE
596537o_n_heap_elimination_toList :: Int -> [Benchmark]
597538o_n_heap_elimination_toList value =
598539 [ bgroup "toList"
599540 -- Converting the stream to a list or pure stream in a strict monad
600− [ benchIOSink value "toListRev" S.toListRev
601− , benchIOSink value "toStreamRev"
602− (S.toStreamRev :: (Stream IO Int -> IO (Stream Identity Int)))
541+ [ benchIOSink value "toListRev" Internal.toListRev
542+ , benchIOSink value "toPureRev" Internal.toPureRev
543+ , benchIOSink value "toStream" (S.fold IP.toStream)
544+ , benchIOSink value "toStreamRev" (S.fold IP.toStreamRev)
603545 ]
604546 ]
605547
@@ -608,13 +550,9 @@ o_n_space_elimination_toList value =
608550 [ bgroup "toList"
609551 -- Converting the stream to a list or pure stream in a strict monad
610552 [ benchIOSink value "toList" S.toList
611−#ifndef USE_PRELUDE
612− , benchIOSink value "toStream"
613− (S.toStream :: (Stream IO Int -> IO (Stream Identity Int)))
614−#endif
553+ , benchIOSink value "toPure" Internal.toPure
615554 ]
616555 ]
617−#endif
618556
619557-------------------------------------------------------------------------------
620558-- Multi-stream folds
@@ -625,7 +563,7 @@ o_n_space_elimination_toList value =
625563-------------------------------------------------------------------------------
626564
627565{-# INLINE eqBy' #-}
628−eqBy' :: (Monad m, Eq a) => Stream m a -> m Bool
566+eqBy' :: (Monad m, Eq a) => SerialT m a -> m Bool
629567eqBy' src = S.eqBy (==) src src
630568
631569{-# INLINE eqByPure #-}
@@ -639,15 +577,15 @@ inspect $ 'eqByPure `hasNoType` ''D.Step
639577#endif
640578
641579{-# INLINE eqInstance #-}
642−eqInstance :: Stream Identity Int -> Bool
580+eqInstance :: SerialT Identity Int -> Bool
643581eqInstance src = src == src
644582
645583{-# INLINE eqInstanceNotEq #-}
646−eqInstanceNotEq :: Stream Identity Int -> Bool
584+eqInstanceNotEq :: SerialT Identity Int -> Bool
647585eqInstanceNotEq src = src /= src
648586
649587{-# INLINE cmpBy' #-}
650−cmpBy' :: (Monad m, Ord a) => Stream m a -> m Ordering
588+cmpBy' :: (Monad m, Ord a) => SerialT m a -> m Ordering
651589cmpBy' src = S.cmpBy compare src src
652590
653591{-# INLINE cmpByPure #-}
@@ -661,7 +599,7 @@ inspect $ 'cmpByPure `hasNoType` ''D.Step
661599#endif
662600
663601{-# INLINE ordInstance #-}
664−ordInstance :: Stream Identity Int -> Bool
602+ordInstance :: SerialT Identity Int -> Bool
665603ordInstance src = src < src
666604
667605o_1_space_elimination_multi_stream_pure :: Int -> [Benchmark]
@@ -676,15 +614,15 @@ o_1_space_elimination_multi_stream_pure value =
676614 ]
677615
678616{-# INLINE isPrefixOf #-}
679−isPrefixOf :: Monad m => Stream m Int -> m Bool
617+isPrefixOf :: Monad m => SerialT m Int -> m Bool
680618isPrefixOf src = S.isPrefixOf src src
681619
682620{-# INLINE isSubsequenceOf #-}
683−isSubsequenceOf :: Monad m => Stream m Int -> m Bool
621+isSubsequenceOf :: Monad m => SerialT m Int -> m Bool
684622isSubsequenceOf src = S.isSubsequenceOf src src
685623
686624{-# INLINE stripPrefix #-}
687−stripPrefix :: Monad m => Stream m Int -> m ()
625+stripPrefix :: Monad m => SerialT m Int -> m ()
688626stripPrefix src = do
689627 _ <- S.stripPrefix src src
690628 return ()
@@ -735,14 +673,14 @@ benchmarks moduleName size =
735673 , o_1_space_elimination_multi_stream_pure size
736674 , o_1_space_elimination_multi_stream size
737675 ]
738−
739− , bgroup (o_n_heap_prefix moduleName) $
740− o_n_heap_elimination_buffered size
741−#ifdef USE_PRELUDE
742− ++ o_n_heap_elimination_foldl size
743− ++ o_n_heap_elimination_toList size
744− ++ o_n_space_elimination_toList size
745−#endif
746− , bgroup (o_n_space_prefix moduleName) $
747− o_n_space_elimination_foldr size
676+ , bgroup (o_n_heap_prefix moduleName) $ concat
677+ [ o_n_heap_elimination_foldl size
678+ , o_n_heap_elimination_toList size
679+ , o_n_heap_elimination_buffered size
680+ ]
681+ , bgroup (o_n_space_prefix moduleName) $ concat
682+ [ o_n_space_elimination_foldable size
683+ , o_n_space_elimination_toList size
684+ , o_n_space_elimination_foldr size
685+ ]
748686 ]
benchmark/Streamly/Benchmark/Prelude/Serial/Exceptions.hsnew file+217
@@ -0,0 +1,217 @@
1+-- |
2+-- Module : Streamly.Benchmark.Prelude.Serial.Exceptions
3+-- Copyright : (c) 2019 Composewell Technologies
4+-- License : BSD-3-Clause
5+-- Maintainer : streamly@composewell.com
6+-- Stability : experimental
7+-- Portability : GHC
8+
9+{-# LANGUAGE CPP #-}
10+{-# LANGUAGE ScopedTypeVariables #-}
11+
12+#ifdef __HADDOCK_VERSION__
13+#undef INSPECTION
14+#endif
15+
16+#ifdef INSPECTION
17+{-# LANGUAGE TemplateHaskell #-}
18+{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
19+#endif
20+
21+module Serial.Exceptions (benchmarks) where
22+
23+import Control.Exception (SomeException)
24+import System.IO (Handle, hClose, hPutChar)
25+
26+import qualified Streamly.FileSystem.Handle as FH
27+import qualified Streamly.Internal.Data.Unfold as IUF
28+import qualified Streamly.Internal.FileSystem.Handle as IFH
29+import qualified Streamly.Internal.Data.Stream.IsStream as IP
30+import qualified Streamly.Prelude as S
31+
32+import Gauge hiding (env)
33+import Prelude hiding (last, length)
34+import Streamly.Benchmark.Common
35+import Streamly.Benchmark.Common.Handle
36+
37+#ifdef INSPECTION
38+import Test.Inspection
39+#endif
40+
41+-------------------------------------------------------------------------------
42+-- stream exceptions
43+-------------------------------------------------------------------------------
44+
45+-- | Send the file contents to /dev/null with exception handling
46+readWriteOnExceptionStream :: Handle -> Handle -> IO ()
47+readWriteOnExceptionStream inh devNull =
48+ let readEx = S.onException (hClose inh) (S.unfold FH.read inh)
49+ in S.fold (FH.write devNull) $ readEx
50+
51+-- | Send the file contents to /dev/null with exception handling
52+readWriteHandleExceptionStream :: Handle -> Handle -> IO ()
53+readWriteHandleExceptionStream inh devNull =
54+ let handler (_e :: SomeException) = S.yieldM (hClose inh >> return 10)
55+ readEx = S.handle handler (S.unfold FH.read inh)
56+ in S.fold (FH.write devNull) $ readEx
57+
58+-- | Send the file contents to /dev/null with exception handling
59+readWriteFinally_Stream :: Handle -> Handle -> IO ()
60+readWriteFinally_Stream inh devNull =
61+ let readEx = IP.finally_ (hClose inh) (S.unfold FH.read inh)
62+ in S.fold (FH.write devNull) readEx
63+
64+readWriteFinallyStream :: Handle -> Handle -> IO ()
65+readWriteFinallyStream inh devNull =
66+ let readEx = S.finally (hClose inh) (S.unfold FH.read inh)
67+ in S.fold (FH.write devNull) readEx
68+
69+-- | Send the file contents to /dev/null with exception handling
70+fromToBytesBracket_Stream :: Handle -> Handle -> IO ()
71+fromToBytesBracket_Stream inh devNull =
72+ let readEx = IP.bracket_ (return ()) (\_ -> hClose inh)
73+ (\_ -> IFH.toBytes inh)
74+ in IFH.fromBytes devNull $ readEx
75+
76+#ifdef INSPECTION
77+inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
78+-- inspect $ 'fromToBytesBracketStream `hasNoType` ''Step
79+#endif
80+
81+fromToBytesBracketStream :: Handle -> Handle -> IO ()
82+fromToBytesBracketStream inh devNull =
83+ let readEx = S.bracket (return ()) (\_ -> hClose inh)
84+ (\_ -> IFH.toBytes inh)
85+ in IFH.fromBytes devNull $ readEx
86+
87+readWriteBeforeAfterStream :: Handle -> Handle -> IO ()
88+readWriteBeforeAfterStream inh devNull =
89+ let readEx =
90+ IP.after (hClose inh)
91+ $ IP.before (hPutChar devNull 'A') (S.unfold FH.read inh)
92+ in S.fold (FH.write devNull) readEx
93+
94+readWriteAfterStream :: Handle -> Handle -> IO ()
95+readWriteAfterStream inh devNull =
96+ let readEx = IP.after (hClose inh) (S.unfold FH.read inh)
97+ in S.fold (FH.write devNull) readEx
98+
99+readWriteAfter_Stream :: Handle -> Handle -> IO ()
100+readWriteAfter_Stream inh devNull =
101+ let readEx = IP.after_ (hClose inh) (S.unfold FH.read inh)
102+ in S.fold (FH.write devNull) readEx
103+
104+o_1_space_copy_stream_exceptions :: BenchEnv -> [Benchmark]
105+o_1_space_copy_stream_exceptions env =
106+ [ bgroup "exceptions"
107+ [ mkBenchSmall "S.onException" env $ \inh _ ->
108+ readWriteOnExceptionStream inh (nullH env)
109+ , mkBenchSmall "S.handle" env $ \inh _ ->
110+ readWriteHandleExceptionStream inh (nullH env)
111+ , mkBenchSmall "S.finally_" env $ \inh _ ->
112+ readWriteFinally_Stream inh (nullH env)
113+ , mkBenchSmall "S.finally" env $ \inh _ ->
114+ readWriteFinallyStream inh (nullH env)
115+ , mkBenchSmall "S.after . S.before" env $ \inh _ ->
116+ readWriteBeforeAfterStream inh (nullH env)
117+ , mkBenchSmall "S.after" env $ \inh _ ->
118+ readWriteAfterStream inh (nullH env)
119+ , mkBenchSmall "S.after_" env $ \inh _ ->
120+ readWriteAfter_Stream inh (nullH env)
121+ ]
122+ , bgroup "exceptions/fromToBytes"
123+ [ mkBenchSmall "S.bracket_" env $ \inh _ ->
124+ fromToBytesBracket_Stream inh (nullH env)
125+ , mkBenchSmall "S.bracket" env $ \inh _ ->
126+ fromToBytesBracketStream inh (nullH env)
127+ ]
128+ ]
129+
130+ -------------------------------------------------------------------------------
131+-- Exceptions readChunks
132+-------------------------------------------------------------------------------
133+
134+-- | Send the file contents to /dev/null with exception handling
135+readChunksOnException :: Handle -> Handle -> IO ()
136+readChunksOnException inh devNull =
137+ let readEx = IUF.onException (\_ -> hClose inh) FH.readChunks
138+ in IUF.fold readEx (IFH.writeChunks devNull) inh
139+
140+#ifdef INSPECTION
141+inspect $ hasNoTypeClasses 'readChunksOnException
142+-- inspect $ 'readChunksOnException `hasNoType` ''Step
143+#endif
144+
145+-- | Send the file contents to /dev/null with exception handling
146+readChunksBracket_ :: Handle -> Handle -> IO ()
147+readChunksBracket_ inh devNull =
148+ let readEx = IUF.bracket_ return (\_ -> hClose inh) FH.readChunks
149+ in IUF.fold readEx (IFH.writeChunks devNull) inh
150+
151+#ifdef INSPECTION
152+inspect $ hasNoTypeClasses 'readChunksBracket_
153+-- inspect $ 'readChunksBracket `hasNoType` ''Step
154+#endif
155+
156+readChunksBracket :: Handle -> Handle -> IO ()
157+readChunksBracket inh devNull =
158+ let readEx = IUF.bracket return (\_ -> hClose inh) FH.readChunks
159+ in IUF.fold readEx (IFH.writeChunks devNull) inh
160+
161+o_1_space_copy_exceptions_readChunks :: BenchEnv -> [Benchmark]
162+o_1_space_copy_exceptions_readChunks env =
163+ [ bgroup "exceptions/readChunks"
164+ [ mkBench "UF.onException" env $ \inH _ ->
165+ readChunksOnException inH (nullH env)
166+ , mkBench "UF.bracket_" env $ \inH _ ->
167+ readChunksBracket_ inH (nullH env)
168+ , mkBench "UF.bracket" env $ \inH _ ->
169+ readChunksBracket inH (nullH env)
170+ ]
171+ ]
172+
173+-------------------------------------------------------------------------------
174+-- Exceptions toChunks
175+-------------------------------------------------------------------------------
176+
177+-- | Send the file contents to /dev/null with exception handling
178+toChunksBracket_ :: Handle -> Handle -> IO ()
179+toChunksBracket_ inh devNull =
180+ let readEx = IP.bracket_
181+ (return ())
182+ (\_ -> hClose inh)
183+ (\_ -> IFH.toChunks inh)
184+ in S.fold (IFH.writeChunks devNull) $ readEx
185+
186+#ifdef INSPECTION
187+inspect $ hasNoTypeClasses 'toChunksBracket_
188+-- inspect $ 'toChunksBracket `hasNoType` ''Step
189+#endif
190+
191+toChunksBracket :: Handle -> Handle -> IO ()
192+toChunksBracket inh devNull =
193+ let readEx = S.bracket
194+ (return ())
195+ (\_ -> hClose inh)
196+ (\_ -> IFH.toChunks inh)
197+ in S.fold (IFH.writeChunks devNull) $ readEx
198+
199+o_1_space_copy_exceptions_toChunks :: BenchEnv -> [Benchmark]
200+o_1_space_copy_exceptions_toChunks env =
201+ [ bgroup "exceptions/toChunks"
202+ [ mkBench "S.bracket_" env $ \inH _ ->
203+ toChunksBracket_ inH (nullH env)
204+ , mkBench "S.bracket" env $ \inH _ ->
205+ toChunksBracket inH (nullH env)
206+ ]
207+ ]
208+
209+
210+benchmarks :: String -> BenchEnv -> [Benchmark]
211+benchmarks moduleName env =
212+ [ bgroup (o_1_space_prefix moduleName) $ concat
213+ [ o_1_space_copy_exceptions_readChunks env
214+ , o_1_space_copy_exceptions_toChunks env
215+ , o_1_space_copy_stream_exceptions env
216+ ]
217+ ]
benchmark/Streamly/Benchmark/Prelude/Serial/Generation.hsnew file+179
@@ -0,0 +1,179 @@
1+-- |
2+-- Module : Serial.Generation
3+-- Copyright : (c) 2018 Composewell Technologies
4+-- License : BSD-3-Clause
5+-- Maintainer : streamly@composewell.com
6+
7+{-# LANGUAGE CPP #-}
8+{-# LANGUAGE FlexibleContexts #-}
9+{-# LANGUAGE ScopedTypeVariables #-}
10+{-# LANGUAGE RankNTypes #-}
11+
12+module Serial.Generation (benchmarks) where
13+
14+import Data.Functor.Identity (Identity)
15+
16+import qualified Prelude
17+import qualified GHC.Exts as GHC
18+
19+import qualified Streamly.Prelude as S
20+
21+import Gauge
22+import Streamly.Prelude (SerialT, serially, MonadAsync)
23+import Streamly.Benchmark.Common
24+import Streamly.Benchmark.Prelude
25+import Prelude hiding (repeat, replicate, iterate)
26+
27+-------------------------------------------------------------------------------
28+-- Generation
29+-------------------------------------------------------------------------------
30+
31+-------------------------------------------------------------------------------
32+-- fromList
33+-------------------------------------------------------------------------------
34+
35+{-# INLINE sourceIsList #-}
36+sourceIsList :: Int -> Int -> SerialT Identity Int
37+sourceIsList value n = GHC.fromList [n..n+value]
38+
39+{-# INLINE sourceIsString #-}
40+sourceIsString :: Int -> Int -> SerialT Identity Char
41+sourceIsString value n = GHC.fromString (Prelude.replicate (n + value) 'a')
42+
43+{-# INLINE readInstance #-}
44+readInstance :: String -> SerialT Identity Int
45+readInstance str =
46+ let r = reads str
47+ in case r of
48+ [(x,"")] -> x
49+ _ -> error "readInstance: no parse"
50+
51+-- For comparisons
52+{-# INLINE readInstanceList #-}
53+readInstanceList :: String -> [Int]
54+readInstanceList str =
55+ let r = reads str
56+ in case r of
57+ [(x,"")] -> x
58+ _ -> error "readInstance: no parse"
59+
60+{-# INLINE repeat #-}
61+repeat :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
62+repeat count = S.take count . S.repeat
63+
64+{-# INLINE repeatM #-}
65+repeatM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
66+repeatM count = S.take count . S.repeatM . return
67+
68+{-# INLINE replicate #-}
69+replicate :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
70+replicate = S.replicate
71+
72+{-# INLINE replicateM #-}
73+replicateM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
74+replicateM count = S.replicateM count . return
75+
76+{-# INLINE enumerateFrom #-}
77+enumerateFrom :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
78+enumerateFrom count = S.take count . S.enumerateFrom
79+
80+{-# INLINE enumerateFromTo #-}
81+enumerateFromTo :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
82+enumerateFromTo = sourceIntFromTo
83+
84+{-# INLINE enumerateFromThen #-}
85+enumerateFromThen :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
86+enumerateFromThen count inp = S.take count $ S.enumerateFromThen inp (inp + 1)
87+
88+{-# INLINE enumerateFromThenTo #-}
89+enumerateFromThenTo :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
90+enumerateFromThenTo = sourceIntFromThenTo
91+
92+-- n ~ 1
93+{-# INLINE enumerate #-}
94+enumerate :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
95+enumerate count n = S.take (count + n) S.enumerate
96+
97+-- n ~ 1
98+{-# INLINE enumerateTo #-}
99+enumerateTo :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
100+enumerateTo count n = S.enumerateTo (minBound + count + n)
101+
102+{-# INLINE iterate #-}
103+iterate :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
104+iterate count = S.take count . S.iterate (+1)
105+
106+{-# INLINE iterateM #-}
107+iterateM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
108+iterateM count = S.take count . S.iterateM (return . (+1)) . return
109+
110+{-# INLINE fromIndices #-}
111+fromIndices :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
112+fromIndices value n = S.take value $ S.fromIndices (+ n)
113+
114+{-# INLINE fromIndicesM #-}
115+fromIndicesM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
116+fromIndicesM value n = S.take value $ S.fromIndicesM (return <$> (+ n))
117+
118+o_1_space_generation :: Int -> [Benchmark]
119+o_1_space_generation value =
120+ [ bgroup "generation"
121+ [ benchIOSrc serially "unfoldr" (sourceUnfoldr value)
122+ , benchIOSrc serially "unfoldrM" (sourceUnfoldrM value)
123+ , benchIOSrc serially "repeat" (repeat value)
124+ , benchIOSrc serially "repeatM" (repeatM value)
125+ , benchIOSrc serially "replicate" (replicate value)
126+ , benchIOSrc serially "replicateM" (replicateM value)
127+ , benchIOSrc serially "iterate" (iterate value)
128+ , benchIOSrc serially "iterateM" (iterateM value)
129+ , benchIOSrc serially "fromIndices" (fromIndices value)
130+ , benchIOSrc serially "fromIndicesM" (fromIndicesM value)
131+ , benchIOSrc serially "intFromTo" (sourceIntFromTo value)
132+ , benchIOSrc serially "intFromThenTo" (sourceIntFromThenTo value)
133+ , benchIOSrc serially "integerFromStep" (sourceIntegerFromStep value)
134+ , benchIOSrc serially "fracFromThenTo" (sourceFracFromThenTo value)
135+ , benchIOSrc serially "fracFromTo" (sourceFracFromTo value)
136+ , benchIOSrc serially "fromList" (sourceFromList value)
137+ , benchPureSrc "IsList.fromList" (sourceIsList value)
138+ , benchPureSrc "IsString.fromString" (sourceIsString value)
139+ , benchIOSrc serially "fromListM" (sourceFromListM value)
140+ , benchIOSrc serially "enumerateFrom" (enumerateFrom value)
141+ , benchIOSrc serially "enumerateFromTo" (enumerateFromTo value)
142+ , benchIOSrc serially "enumerateFromThen" (enumerateFromThen value)
143+ , benchIOSrc serially "enumerateFromThenTo" (enumerateFromThenTo value)
144+ , benchIOSrc serially "enumerate" (enumerate value)
145+ , benchIOSrc serially "enumerateTo" (enumerateTo value)
146+
147+ -- These essentially test cons and consM
148+ , benchIOSrc serially "fromFoldable" (sourceFromFoldable value)
149+ , benchIOSrc serially "fromFoldableM" (sourceFromFoldableM value)
150+
151+ , benchIOSrc serially "absTimes" $ absTimes value
152+ ]
153+ ]
154+
155+o_n_heap_generation :: Int -> [Benchmark]
156+o_n_heap_generation value =
157+ [ bgroup "buffered"
158+ -- Buffers the output of show/read.
159+ -- XXX can the outputs be streaming? Can we have special read/show
160+ -- style type classes, readM/showM supporting streaming effects?
161+ [ bench "readsPrec pure streams" $
162+ nf readInstance (mkString value)
163+ , bench "readsPrec Haskell lists" $
164+ nf readInstanceList (mkListString value)
165+ ]
166+ ]
167+
168+-------------------------------------------------------------------------------
169+-- Main
170+-------------------------------------------------------------------------------
171+
172+-- In addition to gauge options, the number of elements in the stream can be
173+-- passed using the --stream-size option.
174+--
175+benchmarks :: String -> Int -> [Benchmark]
176+benchmarks moduleName size =
177+ [ bgroup (o_1_space_prefix moduleName) (o_1_space_generation size)
178+ , bgroup (o_n_heap_prefix moduleName) (o_n_heap_generation size)
179+ ]
benchmark/Streamly/Benchmark/Data/Stream/Expand.hs → benchmark/Streamly/Benchmark/Prelude/Serial/Nested.hsrenamed+158−281
@@ -1,5 +1,5 @@
11-- |
2−-- Module : Stream.Expand
2+-- Module : Serial.Nested
33-- Copyright : (c) 2018 Composewell Technologies
44-- License : BSD-3-Clause
55-- Maintainer : streamly@composewell.com
@@ -8,11 +8,6 @@
88{-# LANGUAGE FlexibleContexts #-}
99{-# LANGUAGE ScopedTypeVariables #-}
1010{-# LANGUAGE RankNTypes #-}
11−{-# LANGUAGE TupleSections #-}
12−
13−#ifdef USE_PRELUDE
14−{-# OPTIONS_GHC -Wno-deprecations #-}
15−#endif
1611
1712#ifdef __HADDOCK_VERSION__
1813#undef INSPECTION
@@ -23,47 +18,33 @@
2318{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
2419#endif
2520
26−module Stream.Expand (benchmarks) where
21+module Serial.Nested (benchmarks) where
22+
23+import Control.Monad.Trans.Class (lift)
24+
25+import qualified Control.Applicative as AP
2726
2827#ifdef INSPECTION
2928import GHC.Types (SPEC(..))
3029import Test.Inspection
3130
32−import qualified Streamly.Internal.Data.Stream as D
31+import qualified Streamly.Internal.Data.Stream.StreamD as D
3332#endif
3433
35−import qualified Stream.Common as Common
34+import qualified Streamly.Prelude as S
35+import qualified Streamly.Internal.Data.Stream.IsStream as Internal
3636import qualified Streamly.Internal.Data.Unfold as UF
3737
38−#ifdef USE_PRELUDE
39−import qualified Streamly.Internal.Data.Stream.IsStream as S
40−import qualified Streamly.Internal.Data.Stream.IsStream as StreamK
41−import Streamly.Benchmark.Prelude
42− ( sourceFoldMapM, sourceFoldMapWith, sourceFoldMapWithM
43− , sourceFoldMapWithStream, concatFoldableWith, concatForFoldableWith)
44−#else
45−import qualified Streamly.Internal.Data.Stream as S
46−#ifdef USE_STREAMK
47−import Streamly.Internal.Data.Stream (Stream)
48−import Streamly.Internal.Data.StreamK (StreamK, CrossStreamK)
49−import qualified Control.Applicative as AP
50−import qualified Streamly.Internal.Data.Fold as Fold
51−import qualified Streamly.Internal.Data.StreamK as StreamK
52−#else
53−import qualified Streamly.Internal.Data.Stream as StreamK
54−#endif
55−#endif
56−
57−import Test.Tasty.Bench
58−import Stream.Common
38+import Gauge
39+import Streamly.Prelude (SerialT, serially, serial)
5940import Streamly.Benchmark.Common
41+import Streamly.Benchmark.Prelude
6042import Prelude hiding (concatMap)
6143
6244-------------------------------------------------------------------------------
6345-- Iteration/looping utilities
6446-------------------------------------------------------------------------------
6547
66−#ifdef USE_STREAMK
6748{-# INLINE iterateN #-}
6849iterateN :: (Int -> a -> a) -> a -> Int -> a
6950iterateN g initial count = f count initial
@@ -75,18 +56,13 @@ iterateN g initial count = f count initial
7556
7657-- Iterate a transformation over a singleton stream
7758{-# INLINE iterateSingleton #-}
78−iterateSingleton :: Applicative m =>
79− (Int -> CrossStreamK m Int -> CrossStreamK m Int)
59+iterateSingleton :: S.MonadAsync m
60+ => (Int -> SerialT m Int -> SerialT m Int)
8061 -> Int
8162 -> Int
82− -> Stream m Int
83−iterateSingleton g count n =
84− toStream
85− $ StreamK.unCross
86− $ iterateN g (StreamK.mkCross (StreamK.fromPure n)) count
87−#endif
63+ -> SerialT m Int
64+iterateSingleton g count n = iterateN g (return n) count
8865
89−{-
9066-- XXX need to check why this is slower than the explicit recursion above, even
9167-- if the above code is written in a foldr like head recursive way. We also
9268-- need to try this with foldlM' once #150 is fixed.
@@ -94,13 +70,12 @@ iterateSingleton g count n =
9470-- foldrM and any related fusion issues.
9571{-# INLINE _iterateSingleton #-}
9672_iterateSingleton ::
97− Monad m
98− => (Int -> Stream m Int -> Stream m Int)
73+ S.MonadAsync m
74+ => (Int -> SerialT m Int -> SerialT m Int)
9975 -> Int
10076 -> Int
101− -> Stream m Int
77+ -> SerialT m Int
10278_iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
103−-}
10479
10580-------------------------------------------------------------------------------
10681-- Multi-Stream
@@ -113,28 +88,84 @@ _iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
11388{-# INLINE serial2 #-}
11489serial2 :: Int -> Int -> IO ()
11590serial2 count n =
116− drain $ toStream $
117− Common.append
118− (fromStream $ sourceUnfoldrM count n)
119− (fromStream $ sourceUnfoldrM count (n + 1))
91+ S.drain $
92+ S.serial (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
12093
12194{-# INLINE serial4 #-}
12295serial4 :: Int -> Int -> IO ()
12396serial4 count n =
124− drain $ toStream $
125− Common.append
126− (Common.append
127− (fromStream $ sourceUnfoldrM count n)
128− (fromStream $ sourceUnfoldrM count (n + 1)))
129− (Common.append
130− (fromStream $ sourceUnfoldrM count (n + 2))
131− (fromStream $ sourceUnfoldrM count (n + 3)))
97+ S.drain $
98+ S.serial
99+ (S.serial (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1)))
100+ (S.serial
101+ (sourceUnfoldrM count (n + 2))
102+ (sourceUnfoldrM count (n + 3)))
103+
104+{-# INLINE append2 #-}
105+append2 :: Int -> Int -> IO ()
106+append2 count n =
107+ S.drain $
108+ Internal.append (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
109+
110+{-# INLINE append4 #-}
111+append4 :: Int -> Int -> IO ()
112+append4 count n =
113+ S.drain $
114+ Internal.append
115+ (Internal.append
116+ (sourceUnfoldrM count n)
117+ (sourceUnfoldrM count (n + 1)))
118+ (Internal.append
119+ (sourceUnfoldrM count (n + 2))
120+ (sourceUnfoldrM count (n + 3)))
121+
122+#ifdef INSPECTION
123+inspect $ hasNoTypeClasses 'append2
124+inspect $ 'append2 `hasNoType` ''SPEC
125+inspect $ 'append2 `hasNoType` ''D.AppendState
126+#endif
127+
128+-------------------------------------------------------------------------------
129+-- Merging
130+-------------------------------------------------------------------------------
131+
132+{-# INLINE mergeBy #-}
133+mergeBy :: Int -> Int -> IO ()
134+mergeBy count n =
135+ S.drain $
136+ S.mergeBy
137+ compare
138+ (sourceUnfoldrM count n)
139+ (sourceUnfoldrM count (n + 1))
140+
141+{-# INLINE mergeByM #-}
142+mergeByM :: Int -> Int -> IO ()
143+mergeByM count n =
144+ S.drain $
145+ S.mergeByM
146+ (\a b -> return $ compare a b)
147+ (sourceUnfoldrM count n)
148+ (sourceUnfoldrM count (n + 1))
149+
150+#ifdef INSPECTION
151+inspect $ hasNoTypeClasses 'mergeBy
152+inspect $ 'mergeBy `hasNoType` ''SPEC
153+inspect $ 'mergeBy `hasNoType` ''D.Step
154+
155+inspect $ hasNoTypeClasses 'mergeByM
156+inspect $ 'mergeByM `hasNoType` ''SPEC
157+inspect $ 'mergeByM `hasNoType` ''D.Step
158+#endif
132159
133160o_1_space_joining :: Int -> [Benchmark]
134161o_1_space_joining value =
135162 [ bgroup "joining"
136163 [ benchIOSrc1 "serial (2,x/2)" (serial2 (value `div` 2))
164+ , benchIOSrc1 "append (2,x/2)" (append2 (value `div` 2))
137165 , benchIOSrc1 "serial (2,2,x/4)" (serial4 (value `div` 4))
166+ , benchIOSrc1 "append (2,2,x/4)" (append4 (value `div` 4))
167+ , benchIOSrc1 "mergeBy (2,x/2)" (mergeBy (value `div` 2))
168+ , benchIOSrc1 "mergeByM (2,x/2)" (mergeByM (value `div` 2))
138169 ]
139170 ]
140171
@@ -142,24 +173,22 @@ o_1_space_joining value =
142173-- Concat Foldable containers
143174-------------------------------------------------------------------------------
144175
145−#ifdef USE_PRELUDE
146176o_1_space_concatFoldable :: Int -> [Benchmark]
147177o_1_space_concatFoldable value =
148178 [ bgroup "concat-foldable"
149− [ benchIOSrc "foldMapWith (<>) (List)"
179+ [ benchIOSrc serially "foldMapWith (<>) (List)"
150180 (sourceFoldMapWith value)
151− , benchIOSrc "foldMapWith (<>) (Stream)"
181+ , benchIOSrc serially "foldMapWith (<>) (Stream)"
152182 (sourceFoldMapWithStream value)
153− , benchIOSrc "foldMapWithM (<>) (List)"
183+ , benchIOSrc serially "foldMapWithM (<>) (List)"
154184 (sourceFoldMapWithM value)
155− , benchIOSrc "S.concatFoldableWith (<>) (List)"
185+ , benchIOSrc serially "S.concatFoldableWith (<>) (List)"
156186 (concatFoldableWith value)
157− , benchIOSrc "S.concatForFoldableWith (<>) (List)"
187+ , benchIOSrc serially "S.concatForFoldableWith (<>) (List)"
158188 (concatForFoldableWith value)
159− , benchIOSrc "foldMapM (List)" (sourceFoldMapM value)
189+ , benchIOSrc serially "foldMapM (List)" (sourceFoldMapM value)
160190 ]
161191 ]
162−#endif
163192
164193-------------------------------------------------------------------------------
165194-- Concat
@@ -170,15 +199,14 @@ o_1_space_concatFoldable value =
170199{-# INLINE concatMap #-}
171200concatMap :: Int -> Int -> Int -> IO ()
172201concatMap outer inner n =
173− drain $ toStream $ StreamK.concatMap
174− (\_ -> fromStream $ sourceUnfoldrM inner n)
175− (fromStream $ sourceUnfoldrM outer n)
202+ S.drain $ S.concatMap
203+ (\_ -> sourceUnfoldrM inner n)
204+ (sourceUnfoldrM outer n)
176205
177−#ifndef USE_STREAMK
178206{-# INLINE concatMapM #-}
179207concatMapM :: Int -> Int -> Int -> IO ()
180208concatMapM outer inner n =
181− drain $ S.concatMapM
209+ S.drain $ S.concatMapM
182210 (\_ -> return $ sourceUnfoldrM inner n)
183211 (sourceUnfoldrM outer n)
184212
@@ -186,23 +214,18 @@ concatMapM outer inner n =
186214inspect $ hasNoTypeClasses 'concatMap
187215inspect $ 'concatMap `hasNoType` ''SPEC
188216#endif
189−#endif
190217
191218-- concatMap unfoldr/unfoldr
192219
193220{-# INLINE concatMapPure #-}
194221concatMapPure :: Int -> Int -> Int -> IO ()
195222concatMapPure outer inner n =
196− drain $ toStream $ StreamK.concatMap
197− (\_ -> fromStream $ sourceUnfoldr inner n)
198− (fromStream $ sourceUnfoldr outer n)
223+ S.drain $ S.concatMap
224+ (\_ -> sourceUnfoldr inner n)
225+ (sourceUnfoldr outer n)
199226
200227#ifdef INSPECTION
201−#if __GLASGOW_HASKELL__ >= 906
202−inspect $ hasNoTypeClassesExcept 'concatMapPure [''Applicative]
203−#else
204228inspect $ hasNoTypeClasses 'concatMapPure
205−#endif
206229inspect $ 'concatMapPure `hasNoType` ''SPEC
207230#endif
208231
@@ -211,71 +234,49 @@ inspect $ 'concatMapPure `hasNoType` ''SPEC
211234{-# INLINE concatMapRepl #-}
212235concatMapRepl :: Int -> Int -> Int -> IO ()
213236concatMapRepl outer inner n =
214− drain $ toStream $ StreamK.concatMap
215− (fromStream . S.replicate inner) (fromStream $ sourceUnfoldrM outer n)
237+ S.drain $ S.concatMap (S.replicate inner) (sourceUnfoldrM outer n)
216238
217239#ifdef INSPECTION
218−#if __GLASGOW_HASKELL__ >= 906
219−inspect $ hasNoTypeClassesExcept 'concatMapRepl [''Applicative]
220−#else
221240inspect $ hasNoTypeClasses 'concatMapRepl
222−#endif
223241inspect $ 'concatMapRepl `hasNoType` ''SPEC
224242#endif
225243
226244-- concatMapWith
227245
228−#ifdef USE_STREAMK
229246{-# INLINE concatMapWithSerial #-}
230247concatMapWithSerial :: Int -> Int -> Int -> IO ()
231−concatMapWithSerial = concatStreamsWith Common.append
248+concatMapWithSerial = concatStreamsWith S.serial
232249
233250#ifdef INSPECTION
234251inspect $ hasNoTypeClasses 'concatMapWithSerial
235252inspect $ 'concatMapWithSerial `hasNoType` ''SPEC
236253#endif
237254
238−{-
239255{-# INLINE concatMapWithAppend #-}
240256concatMapWithAppend :: Int -> Int -> Int -> IO ()
241−concatMapWithAppend = concatStreamsWith Common.append2
257+concatMapWithAppend = concatStreamsWith Internal.append
242258
243259#ifdef INSPECTION
244260inspect $ hasNoTypeClasses 'concatMapWithAppend
245261inspect $ 'concatMapWithAppend `hasNoType` ''SPEC
246262#endif
247−-}
248−
249−-- mergeMapWith
250−
251−{-# INLINE mergeMapWithSerial #-}
252−mergeMapWithSerial :: Int -> Int -> Int -> IO ()
253−mergeMapWithSerial = mergeMapWith Common.append
254−
255−{-
256−{-# INLINE mergeMapWithAppend #-}
257−mergeMapWithAppend :: Int -> Int -> Int -> IO ()
258−mergeMapWithAppend = mergeMapWith Common.append2
259−-}
260−#endif
261−
262−-- unfoldMany
263263
264−-- unfoldMany replicate/unfoldrM
264+-- concatUnfold
265265
266−{-# INLINE unfoldManyRepl #-}
267−unfoldManyRepl :: Int -> Int -> Int -> IO ()
268−unfoldManyRepl outer inner n =
269− drain
270− $ S.unfoldMany
271− UF.replicateM
272− (fmap ((inner,) . return) (sourceUnfoldrM outer n))
266+-- concatUnfold replicate/unfoldrM
273267
268+{-# INLINE concatUnfoldRepl #-}
269+concatUnfoldRepl :: Int -> Int -> Int -> IO ()
270+concatUnfoldRepl outer inner n =
271+ S.drain
272+ $ S.concatUnfold
273+ (UF.lmap return (UF.replicateM inner))
274+ (sourceUnfoldrM outer n)
274275
275276#ifdef INSPECTION
276−inspect $ hasNoTypeClasses 'unfoldManyRepl
277−inspect $ 'unfoldManyRepl `hasNoType` ''D.ConcatMapUState
278−inspect $ 'unfoldManyRepl `hasNoType` ''SPEC
277+inspect $ hasNoTypeClasses 'concatUnfoldRepl
278+inspect $ 'concatUnfoldRepl `hasNoType` ''D.ConcatMapUState
279+inspect $ 'concatUnfoldRepl `hasNoType` ''SPEC
279280#endif
280281
281282o_1_space_concat :: Int -> [Benchmark]
@@ -288,6 +289,10 @@ o_1_space_concat value = sqrtVal `seq`
288289 , benchIOSrc1 "concatMapPure (1 of n)"
289290 (concatMapPure 1 value)
290291
292+ -- This is for comparison with foldMapWith
293+ , benchIOSrc serially "concatMapId (n of 1) (fromFoldable)"
294+ (S.concatMap id . sourceConcatMapId value)
295+
291296 , benchIOSrc1 "concatMap (n of 1)"
292297 (concatMap value 1)
293298 , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
@@ -295,25 +300,16 @@ o_1_space_concat value = sqrtVal `seq`
295300 , benchIOSrc1 "concatMap (1 of n)"
296301 (concatMap 1 value)
297302
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−
303303 , benchIOSrc1 "concatMapM (n of 1)"
304304 (concatMapM value 1)
305305 , benchIOSrc1 "concatMapM (sqrt n of sqrt n)"
306306 (concatMapM sqrtVal sqrtVal)
307307 , benchIOSrc1 "concatMapM (1 of n)"
308308 (concatMapM 1 value)
309−#endif
310309
311−#ifdef USE_STREAMK
312− {-
313310 -- This is for comparison with foldMapWith
314− , benchIOSrc "concatMapWithId (n of 1) (fromFoldable)"
315− (toStream . S.concatMapWith Common.append id . sourceConcatMapId value)
316− -}
311+ , benchIOSrc serially "concatMapWithId (n of 1) (fromFoldable)"
312+ (S.concatMapWith serial id . sourceConcatMapId value)
317313
318314 , benchIOSrc1 "concatMapWith (n of 1)"
319315 (concatMapWithSerial value 1)
@@ -322,54 +318,21 @@ o_1_space_concat value = sqrtVal `seq`
322318 , benchIOSrc1 "concatMapWith (1 of n)"
323319 (concatMapWithSerial 1 value)
324320
325− {-
326321 -- quadratic with number of outer streams
327322 , benchIOSrc1 "concatMapWithAppend (2 of n/2)"
328323 (concatMapWithAppend 2 (value `div` 2))
329− -}
330−#endif
331324
332− -- concatMap vs unfoldMany
325+ -- concatMap vs concatUnfold
333326 , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
334327 (concatMapRepl sqrtVal sqrtVal)
335− , benchIOSrc1 "unfoldManyRepl (sqrt n of sqrt n)"
336− (unfoldManyRepl sqrtVal sqrtVal)
337− ]
338− ]
339−
340− where
341−
342− sqrtVal = round $ sqrt (fromIntegral value :: Double)
343−
344−#ifdef USE_STREAMK
345−o_n_space_merge :: Int -> [Benchmark]
346−o_n_space_merge value = sqrtVal `seq`
347− [ bgroup "concat"
348− [
349− -------------------mergeMapWith-----------------
350−
351− -- Use large number of streams to check scalability
352−
353− benchIOSrc1 "mergeMapWithSerial (n of 1)"
354− (mergeMapWithSerial value 1)
355− , benchIOSrc1 "mergeMapWithSerial (sqrtVal of sqrtVal)"
356− (mergeMapWithSerial sqrtVal sqrtVal)
357− , benchIOSrc1 "mergeMapWithSerial (2 of n/2)"
358− (mergeMapWithSerial 2 (value `div` 2))
359−
360− {-
361− , benchIOSrc1 "mergeMapWithAppend (n of 1)"
362− (mergeMapWithAppend value 1)
363− , benchIOSrc1 "mergeMapWithAppend (sqrtVal of sqrtVal)"
364− (mergeMapWithAppend sqrtVal sqrtVal)
365− -}
328+ , benchIOSrc1 "concatUnfoldRepl (sqrt n of sqrt n)"
329+ (concatUnfoldRepl sqrtVal sqrtVal)
366330 ]
367331 ]
368332
369333 where
370334
371335 sqrtVal = round $ sqrt (fromIntegral value :: Double)
372−#endif
373336
374337-------------------------------------------------------------------------------
375338-- Applicative
@@ -378,28 +341,26 @@ o_n_space_merge value = sqrtVal `seq`
378341o_1_space_applicative :: Int -> [Benchmark]
379342o_1_space_applicative value =
380343 [ bgroup "Applicative"
381− [ benchIO "(*>) (sqrt n x sqrt n)" $ apDiscardFst value
382− , benchIO "(<*) (sqrt n x sqrt n)" $ apDiscardSnd value
383− , benchIO "(<*>) (sqrt n x sqrt n)" $ toNullAp value
384− , benchIO "liftA2 (sqrt n x sqrt n)" $ apLiftA2 value
344+ [ benchIO "(*>) (sqrt n x sqrt n)" $ apDiscardFst value serially
345+ , benchIO "(<*) (sqrt n x sqrt n)" $ apDiscardSnd value serially
346+ , benchIO "(<*>) (sqrt n x sqrt n)" $ toNullAp value serially
347+ , benchIO "liftA2 (sqrt n x sqrt n)" $ apLiftA2 value serially
385348 ]
386349 ]
387350
388−#ifdef USE_STREAMK
389351o_n_space_applicative :: Int -> [Benchmark]
390352o_n_space_applicative value =
391− [ bgroup "iterated"
392− [ benchIOSrc "(*>) (n times)" $
353+ [ bgroup "Applicative"
354+ [ benchIOSrc serially "(*>) (n times)" $
393355 iterateSingleton ((*>) . pure) value
394− , benchIOSrc "(<*) (n times)" $
356+ , benchIOSrc serially "(<*) (n times)" $
395357 iterateSingleton (\x xs -> xs <* pure x) value
396− , benchIOSrc "(<*>) (n times)" $
358+ , benchIOSrc serially "(<*>) (n times)" $
397359 iterateSingleton (\x xs -> pure (+ x) <*> xs) value
398− , benchIOSrc "liftA2 (n times)" $
360+ , benchIOSrc serially "liftA2 (n times)" $
399361 iterateSingleton (AP.liftA2 (+) . pure) value
400362 ]
401363 ]
402−#endif
403364
404365-------------------------------------------------------------------------------
405366-- Monad
@@ -408,122 +369,48 @@ o_n_space_applicative value =
408369o_1_space_monad :: Int -> [Benchmark]
409370o_1_space_monad value =
410371 [ bgroup "Monad"
411− [ benchIO "(>>) (sqrt n x sqrt n)" $ monadThen value
412− , benchIO "(>>=) (sqrt n x sqrt n)" $ toNullM value
372+ [ benchIO "(>>) (sqrt n x sqrt n)" $ monadThen value serially
373+ , benchIO "(>>=) (sqrt n x sqrt n)" $ toNullM value serially
413374 , benchIO "(>>=) (sqrt n x sqrt n) (filterAllOut)" $
414− filterAllOutM value
375+ filterAllOutM value serially
415376 , benchIO "(>>=) (sqrt n x sqrt n) (filterAllIn)" $
416− filterAllInM value
377+ filterAllInM value serially
417378 , benchIO "(>>=) (sqrt n x sqrt n) (filterSome)" $
418− filterSome value
379+ filterSome value serially
419380 , benchIO "(>>=) (sqrt n x sqrt n) (breakAfterSome)" $
420− breakAfterSome value
381+ breakAfterSome value serially
421382 , benchIO "(>>=) (cubert n x cubert n x cubert n)" $
422− toNullM3 value
383+ toNullM3 value serially
423384 ]
424385 ]
425386
426−#ifdef USE_STREAMK
427387-- This is a good benchmark but inefficient way to compute primes. As we see a
428388-- new prime we keep appending a division filter for all the future numbers.
429389{-# INLINE sieve #-}
430−sieve :: Monad m => StreamK m Int -> StreamK m Int
431−sieve s = StreamK.concatEffect $ do
432− r <- StreamK.uncons s
390+sieve :: Monad m => SerialT m Int -> SerialT m Int
391+sieve s = do
392+ r <- lift $ S.uncons s
433393 case r of
434394 Just (prime, rest) ->
435− -- XXX Use K.filter or rewrite to K.filter
436− let f = S.filter (\n -> n `mod` prime /= 0)
437− in pure $ prime `StreamK.cons` sieve (fromStream $ f $ toStream rest)
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
395+ prime `S.cons` sieve (S.filter (\n -> n `mod` prime /= 0) rest)
396+ Nothing -> S.nil
458397
459398o_n_space_monad :: Int -> [Benchmark]
460399o_n_space_monad value =
461400 [ bgroup "Monad"
462− [ benchIO "(>>=) (sqrt n x sqrt n) (toList)" $
463− toListM value
401+ [ benchIOSrc serially "(>>) (n times)" $
402+ iterateSingleton ((>>) . pure) value
403+ , benchIOSrc serially "(>>=) (n times)" $
404+ iterateSingleton (\x xs -> xs >>= \y -> return (x + y)) value
405+ , benchIO "(>>=) (sqrt n x sqrt n) (toList)" $
406+ toListM value serially
464407 , benchIO "(>>=) (sqrt n x sqrt n) (toListSome)" $
465− toListSome value
466− ]
467− ]
468−
469−-------------------------------------------------------------------------------
470−-- Joining
471−-------------------------------------------------------------------------------
472−
473−{-
474−toKv :: Int -> (Int, Int)
475−toKv p = (p, p)
476−
477−{-# INLINE joinWith #-}
478−joinWith :: Common.MonadAsync m =>
479− ((Int -> Int -> Bool) -> Stream m Int -> Stream m Int -> Stream m b)
480− -> Int
481− -> Int
482− -> m ()
483−joinWith j val i =
484− drain $ j (==) (sourceUnfoldrM val i) (sourceUnfoldrM val (val `div` 2))
485−
486−{-# INLINE joinMapWith #-}
487−joinMapWith :: Common.MonadAsync m =>
488− (Stream m (Int, Int) -> Stream m (Int, Int) -> Stream m b)
489− -> Int
490− -> Int
491− -> m ()
492−joinMapWith j val i =
493− drain
494− $ j
495− (fmap toKv (sourceUnfoldrM val i))
496− (fmap toKv (sourceUnfoldrM val (val `div` 2)))
497−
498−o_n_heap_buffering :: Int -> [Benchmark]
499−o_n_heap_buffering value =
500− [ bgroup "buffered"
501− [
502− benchIOSrc1 "joinInnerGeneric (sqrtVal)"
503− $ joinWith S.joinInnerGeneric sqrtVal
504− , benchIOSrc1 "joinInner"
505− $ joinMapWith S.joinInner halfVal
506− , benchIOSrc1 "joinLeftGeneric (sqrtVal)"
507− $ joinWith S.joinLeftGeneric sqrtVal
508− , benchIOSrc1 "joinLeft "
509− $ joinMapWith S.joinLeft halfVal
510− , benchIOSrc1 "joinOuterGeneric (sqrtVal)"
511− $ joinWith S.joinOuterGeneric sqrtVal
512− , benchIOSrc1 "joinOuter"
513− $ joinMapWith S.joinOuter halfVal
514− , benchIOSrc1 "filterInStreamGenericBy (sqrtVal)"
515− $ joinWith S.filterInStreamGenericBy sqrtVal
516− , benchIOSrc1 "filterInStreamAscBy"
517− $ joinMapWith (S.filterInStreamAscBy compare) halfVal
408+ toListSome value serially
409+ , benchIO "naive prime sieve (n/4)"
410+ (\n -> S.sum $ sieve $ S.enumerateFromTo 2 (value `div` 4 + n))
518411 ]
519412 ]
520413
521− where
522−
523− halfVal = value `div` 2
524− sqrtVal = round $ sqrt (fromIntegral value :: Double)
525−-}
526−
527414-------------------------------------------------------------------------------
528415-- Main
529416-------------------------------------------------------------------------------
@@ -531,33 +418,23 @@ o_n_heap_buffering value =
531418-- In addition to gauge options, the number of elements in the stream can be
532419-- passed using the --stream-size option.
533420--
534−{-# ANN benchmarks "HLint: ignore" #-}
535421benchmarks :: String -> Int -> [Benchmark]
536422benchmarks moduleName size =
537423 [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
538424 [
539425 -- multi-stream
540426 o_1_space_joining size
541−#ifdef USE_PRELUDE
542427 , o_1_space_concatFoldable size
543−#endif
544428 , o_1_space_concat size
429+
545430 , o_1_space_applicative size
546431 , o_1_space_monad size
432+
547433 ]
548434 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
549435 [
550436 -- multi-stream
551− o_n_space_monad size
552−#ifdef USE_STREAMK
553− , o_n_space_merge size
554− , o_n_space_iterated size
555− , o_n_space_applicative size
556−#endif
437+ o_n_space_applicative size
438+ , o_n_space_monad size
557439 ]
558− {-
559− , bgroup (o_n_heap_prefix moduleName) $
560− -- multi-stream
561− o_n_heap_buffering size
562− -}
563440 ]
benchmark/Streamly/Benchmark/Data/Stream/Split.hs → benchmark/Streamly/Benchmark/Prelude/Serial/Split.hsrenamed+21−34
@@ -1,7 +1,5 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3−-- |
4−-- Module : Stream.Split
1+ -- |
2+-- Module : Streamly.Benchmark.Prelude.Serial.Split
53-- Copyright : (c) 2019 Composewell Technologies
64-- License : BSD-3-Clause
75-- Maintainer : streamly@composewell.com
@@ -20,14 +18,14 @@
2018{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
2119#endif
2220
23−module Stream.Split (benchmarks) where
21+module Serial.Split (benchmarks) where
2422
2523import Data.Char (ord)
2624import Data.Word (Word8)
2725import System.IO (Handle)
2826
2927import qualified Streamly.FileSystem.Handle as FH
30−import qualified Streamly.Internal.Data.Array as A
28+import qualified Streamly.Internal.Data.Array.Storable.Foreign as A
3129import qualified Streamly.Internal.Data.Fold as FL
3230import qualified Streamly.Internal.Data.Parser as PR
3331import qualified Streamly.Internal.Data.Stream.IsStream as IP
@@ -35,15 +33,14 @@ import qualified Streamly.Internal.FileSystem.Handle as IFH
3533import qualified Streamly.Internal.Unicode.Stream as IUS
3634import qualified Streamly.Prelude as S
3735
38−import Test.Tasty.Bench hiding (env)
36+import Gauge hiding (env)
3937import Prelude hiding (last, length)
4038import Streamly.Benchmark.Common
4139import Streamly.Benchmark.Common.Handle
4240
4341#ifdef INSPECTION
44−import Streamly.Internal.Data.Stream (Step(..))
42+import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
4543
46−import qualified Streamly.Internal.Data.MutArray as MA
4744import qualified Streamly.Internal.Data.Unfold as IUF
4845
4946import Test.Inspection
@@ -68,8 +65,8 @@ splitOn inh =
6865#ifdef INSPECTION
6966inspect $ hasNoTypeClasses 'splitOn
7067inspect $ 'splitOn `hasNoType` ''Step
71−inspect $ 'splitOn `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
72−inspect $ 'splitOn `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
68+inspect $ 'splitOn `hasNoType` ''IUF.ConcatState -- FH.read/UF.concat
69+inspect $ 'splitOn `hasNoType` ''A.ReadUState -- FH.read/A.read
7370#endif
7471
7572-- | Split suffix on line feed.
@@ -81,8 +78,8 @@ splitOnSuffix inh =
8178#ifdef INSPECTION
8279inspect $ hasNoTypeClasses 'splitOnSuffix
8380inspect $ 'splitOnSuffix `hasNoType` ''Step
84−inspect $ 'splitOnSuffix `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
85−inspect $ 'splitOnSuffix `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
81+inspect $ 'splitOnSuffix `hasNoType` ''IUF.ConcatState -- FH.read/UF.concat
82+inspect $ 'splitOnSuffix `hasNoType` ''A.ReadUState -- FH.read/A.read
8683#endif
8784
8885-- | Split suffix with line feed.
@@ -94,8 +91,8 @@ splitWithSuffix inh =
9491#ifdef INSPECTION
9592inspect $ hasNoTypeClasses 'splitWithSuffix
9693inspect $ 'splitWithSuffix `hasNoType` ''Step
97−inspect $ 'splitWithSuffix `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
98−inspect $ 'splitWithSuffix `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
94+inspect $ 'splitWithSuffix `hasNoType` ''IUF.ConcatState -- FH.read/UF.concat
95+inspect $ 'splitWithSuffix `hasNoType` ''A.ReadUState -- FH.read/A.read
9996#endif
10097
10198-- | Split on line feed.
@@ -103,7 +100,7 @@ foldManySepBy :: Handle -> IO Int
103100foldManySepBy inh =
104101 (S.length
105102 $ IP.foldMany
106− (FL.takeEndBy_ (== lf) FL.drain)
103+ (FL.sliceSepBy (== lf) FL.drain)
107104 (S.unfold FH.read inh)
108105 ) -- >>= print
109106
@@ -112,7 +109,7 @@ parseManySepBy :: Handle -> IO Int
112109parseManySepBy inh =
113110 (S.length
114111 $ IP.parseMany
115− (PR.fromFold $ FL.takeEndBy_ (== lf) FL.drain)
112+ (PR.fromFold $ FL.sliceSepBy (== lf) FL.drain)
116113 (S.unfold FH.read inh)
117114 ) -- >>= print
118115
@@ -125,8 +122,8 @@ wordsBy inh =
125122#ifdef INSPECTION
126123inspect $ hasNoTypeClasses 'wordsBy
127124inspect $ 'wordsBy `hasNoType` ''Step
128−inspect $ 'wordsBy `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
129−inspect $ 'wordsBy `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
125+inspect $ 'wordsBy `hasNoType` ''IUF.ConcatState -- FH.read/UF.concat
126+inspect $ 'wordsBy `hasNoType` ''A.ReadUState -- FH.read/A.read
130127#endif
131128
132129-- | Split on a word8 sequence.
@@ -143,7 +140,7 @@ splitOnSeq str inh =
143140-- | Split on a word8 sequence.
144141splitOnSeq100k :: Handle -> IO Int
145142splitOnSeq100k inh = do
146− arr <- A.fromStream $ IP.toStream $ S.fromSerial $ S.replicate 100000 123
143+ arr <- A.fromStream $ S.replicate 100000 123
147144 (S.length $ IP.splitOnSeq arr FL.drain
148145 $ S.unfold FH.read inh) -- >>= print
149146
@@ -158,18 +155,12 @@ splitOnSuffixSeq str inh =
158155-- inspect $ 'splitOnSuffixSeq `hasNoType` ''Step
159156#endif
160157
161−-- | Split on suffix sequence.
162−splitWithSuffixSeq :: String -> Handle -> IO Int
163−splitWithSuffixSeq str inh =
164− S.length $ IP.splitWithSuffixSeq (toarr str) FL.drain
165− $ S.unfold FH.read inh -- >>= print
166−
167158o_1_space_reduce_read_split :: BenchEnv -> [Benchmark]
168159o_1_space_reduce_read_split env =
169160 [ bgroup "split"
170− [ mkBench "S.foldMany (FL.takeEndBy_ (== lf) FL.drain)" env
161+ [ mkBench "S.foldMany (FL.sliceSepBy (== lf) FL.drain)" env
171162 $ \inh _ -> foldManySepBy inh
172− , mkBench "S.parseMany (FL.takeEndBy_ (== lf) FL.drain)" env
163+ , mkBench "S.parseMany (FL.sliceSepBy (== lf) FL.drain)" env
173164 $ \inh _ -> parseManySepBy inh
174165 , mkBench "S.wordsBy isSpace FL.drain" env $ \inh _ ->
175166 wordsBy inh
@@ -193,8 +184,6 @@ o_1_space_reduce_read_split env =
193184 splitOnSeq "\r\n" inh
194185 , mkBench "S.splitOnSuffixSeq \"\\r\\n\" FL.drain" env $ \inh _ ->
195186 splitOnSuffixSeq "\r\n" inh
196− , mkBench "S.splitWithSuffixSeq \"\\r\\n\" FL.drain" env $ \inh _ ->
197− splitWithSuffixSeq "\r\n" inh
198187 , mkBench "S.splitOnSeq \"aa\" FL.drain" env $ \inh _ ->
199188 splitOnSeq "aa" inh
200189 , mkBench "S.splitOnSeq \"aaaa\" FL.drain" env $ \inh _ ->
@@ -211,8 +200,6 @@ o_1_space_reduce_read_split env =
211200 env $ \inh _ -> splitOnSeq100k inh
212201 , mkBenchSmall "S.splitOnSuffixSeq \"abcdefghijklmnopqrstuvwxyz\" FL.drain"
213202 env $ \inh _ -> splitOnSuffixSeq "abcdefghijklmnopqrstuvwxyz" inh
214− , mkBenchSmall "S.splitWithSuffixSeq \"abcdefghijklmnopqrstuvwxyz\" FL.drain"
215− env $ \inh _ -> splitWithSuffixSeq "abcdefghijklmnopqrstuvwxyz" inh
216203 ]
217204 ]
218205
@@ -220,9 +207,8 @@ o_1_space_reduce_read_split env =
220207splitOnSeqUtf8 :: String -> Handle -> IO Int
221208splitOnSeqUtf8 str inh =
222209 (S.length $ IP.splitOnSeq (A.fromList str) FL.drain
223− $ IP.fromStream
224210 $ IUS.decodeUtf8Arrays
225− $ IFH.readChunks inh) -- >>= print
211+ $ IFH.toChunks inh) -- >>= print
226212
227213o_1_space_reduce_toChunks_split :: BenchEnv -> [Benchmark]
228214o_1_space_reduce_toChunks_split env =
@@ -242,3 +228,4 @@ benchmarks moduleName env =
242228 , o_1_space_reduce_toChunks_split env
243229 ]
244230 ]
231+
benchmark/Streamly/Benchmark/Prelude/Serial/Transformation1.hsnew file+554
@@ -0,0 +1,554 @@
1+-- |
2+-- Module : Serial.Transformation1
3+-- Copyright : (c) 2018 Composewell Technologies
4+-- License : BSD-3-Clause
5+-- Maintainer : streamly@composewell.com
6+
7+{-# LANGUAGE CPP #-}
8+{-# LANGUAGE FlexibleContexts #-}
9+{-# LANGUAGE ScopedTypeVariables #-}
10+{-# LANGUAGE RankNTypes #-}
11+
12+#ifdef __HADDOCK_VERSION__
13+#undef INSPECTION
14+#endif
15+
16+#ifdef INSPECTION
17+{-# LANGUAGE TemplateHaskell #-}
18+{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
19+#endif
20+
21+module Serial.Transformation1 (benchmarks) where
22+
23+import Control.DeepSeq (NFData(..))
24+import Control.Monad.IO.Class (MonadIO(..))
25+import Data.Functor.Identity (Identity)
26+import Data.IORef (newIORef, modifyIORef')
27+import System.Random (randomRIO)
28+
29+#ifdef INSPECTION
30+import Test.Inspection
31+#endif
32+
33+import qualified Streamly.Prelude as S
34+import qualified Streamly.Internal.Data.Stream.IsStream as Internal
35+import qualified Streamly.Internal.Data.Fold as FL
36+import qualified Prelude
37+
38+import Gauge
39+import Streamly.Prelude (SerialT, serially, MonadAsync)
40+import Streamly.Benchmark.Common
41+import Streamly.Benchmark.Prelude
42+import Streamly.Internal.Data.Time.Units
43+import Prelude hiding (sequence, mapM, fmap)
44+
45+-------------------------------------------------------------------------------
46+-- Pipelines (stream-to-stream transformations)
47+-------------------------------------------------------------------------------
48+
49+-------------------------------------------------------------------------------
50+-- one-to-one transformations
51+-------------------------------------------------------------------------------
52+
53+-------------------------------------------------------------------------------
54+-- Traversable Instance
55+-------------------------------------------------------------------------------
56+
57+{-# INLINE traversableTraverse #-}
58+traversableTraverse :: SerialT Identity Int -> IO (SerialT Identity Int)
59+traversableTraverse = traverse return
60+
61+{-# INLINE traversableSequenceA #-}
62+traversableSequenceA :: SerialT Identity Int -> IO (SerialT Identity Int)
63+traversableSequenceA = sequenceA . Prelude.fmap return
64+
65+{-# INLINE traversableMapM #-}
66+traversableMapM :: SerialT Identity Int -> IO (SerialT Identity Int)
67+traversableMapM = Prelude.mapM return
68+
69+{-# INLINE traversableSequence #-}
70+traversableSequence :: SerialT Identity Int -> IO (SerialT Identity Int)
71+traversableSequence = Prelude.sequence . Prelude.fmap return
72+
73+{-# INLINE benchPureSinkIO #-}
74+benchPureSinkIO
75+ :: NFData b
76+ => Int -> String -> (SerialT Identity Int -> IO b) -> Benchmark
77+benchPureSinkIO value name f =
78+ bench name $ nfIO $ randomRIO (1, 1) >>= f . sourceUnfoldr value
79+
80+o_n_space_traversable :: Int -> [Benchmark]
81+o_n_space_traversable value =
82+ -- Buffering operations using heap proportional to number of elements.
83+ [ bgroup "traversable"
84+ -- Traversable instance
85+ [ benchPureSinkIO value "traverse" traversableTraverse
86+ , benchPureSinkIO value "sequenceA" traversableSequenceA
87+ , benchPureSinkIO value "mapM" traversableMapM
88+ , benchPureSinkIO value "sequence" traversableSequence
89+ ]
90+ ]
91+
92+-------------------------------------------------------------------------------
93+-- maps and scans
94+-------------------------------------------------------------------------------
95+
96+{-# INLINE scanl' #-}
97+scanl' :: MonadIO m => Int -> SerialT m Int -> m ()
98+scanl' n = composeN n $ S.scanl' (+) 0
99+
100+{-# INLINE scanlM' #-}
101+scanlM' :: MonadIO m => Int -> SerialT m Int -> m ()
102+scanlM' n = composeN n $ S.scanlM' (\b a -> return $ b + a) (return 0)
103+
104+{-# INLINE scanl1' #-}
105+scanl1' :: MonadIO m => Int -> SerialT m Int -> m ()
106+scanl1' n = composeN n $ S.scanl1' (+)
107+
108+{-# INLINE scanl1M' #-}
109+scanl1M' :: MonadIO m => Int -> SerialT m Int -> m ()
110+scanl1M' n = composeN n $ S.scanl1M' (\b a -> return $ b + a)
111+
112+{-# INLINE scan #-}
113+scan :: MonadIO m => Int -> SerialT m Int -> m ()
114+scan n = composeN n $ S.scan FL.sum
115+
116+{-# INLINE postscanl' #-}
117+postscanl' :: MonadIO m => Int -> SerialT m Int -> m ()
118+postscanl' n = composeN n $ S.postscanl' (+) 0
119+
120+{-# INLINE postscanlM' #-}
121+postscanlM' :: MonadIO m => Int -> SerialT m Int -> m ()
122+postscanlM' n = composeN n $ S.postscanlM' (\b a -> return $ b + a) (return 0)
123+
124+{-# INLINE postscan #-}
125+postscan :: MonadIO m => Int -> SerialT m Int -> m ()
126+postscan n = composeN n $ S.postscan FL.sum
127+
128+{-# INLINE sequence #-}
129+sequence ::
130+ (S.IsStream t, S.MonadAsync m)
131+ => (t m Int -> S.SerialT m Int)
132+ -> t m (m Int)
133+ -> m ()
134+sequence t = S.drain . t . S.sequence
135+
136+{-# INLINE tap #-}
137+tap :: MonadIO m => Int -> SerialT m Int -> m ()
138+tap n = composeN n $ S.tap FL.sum
139+
140+{-# INLINE tapRate #-}
141+tapRate :: Int -> SerialT IO Int -> IO ()
142+tapRate n str = do
143+ cref <- newIORef 0
144+ composeN n (Internal.tapRate 1 (\c -> modifyIORef' cref (c +))) str
145+
146+{-# INLINE pollCounts #-}
147+pollCounts :: Int -> SerialT IO Int -> IO ()
148+pollCounts n =
149+ composeN n (Internal.pollCounts (const True) f FL.drain)
150+
151+ where
152+
153+ f = Internal.rollingMap (-) . Internal.delayPost 1
154+
155+{-# INLINE timestamped #-}
156+timestamped :: (S.MonadAsync m) => SerialT m Int -> m ()
157+timestamped = S.drain . Internal.timestamped
158+
159+{-# INLINE foldrS #-}
160+foldrS :: MonadIO m => Int -> SerialT m Int -> m ()
161+foldrS n = composeN n $ Internal.foldrS S.cons S.nil
162+
163+{-# INLINE foldrSMap #-}
164+foldrSMap :: MonadIO m => Int -> SerialT m Int -> m ()
165+foldrSMap n = composeN n $ Internal.foldrS (\x xs -> x + 1 `S.cons` xs) S.nil
166+
167+{-# INLINE foldrT #-}
168+foldrT :: MonadIO m => Int -> SerialT m Int -> m ()
169+foldrT n = composeN n $ Internal.foldrT S.cons S.nil
170+
171+{-# INLINE foldrTMap #-}
172+foldrTMap :: MonadIO m => Int -> SerialT m Int -> m ()
173+foldrTMap n = composeN n $ Internal.foldrT (\x xs -> x + 1 `S.cons` xs) S.nil
174+
175+
176+{-# INLINE trace #-}
177+trace :: MonadAsync m => Int -> SerialT m Int -> m ()
178+trace n = composeN n $ Internal.trace return
179+
180+o_1_space_mapping :: Int -> [Benchmark]
181+o_1_space_mapping value =
182+ [ bgroup
183+ "mapping"
184+ [
185+ -- Right folds
186+ benchIOSink value "foldrS" (foldrS 1)
187+ , benchIOSink value "foldrSMap" (foldrSMap 1)
188+ , benchIOSink value "foldrT" (foldrT 1)
189+ , benchIOSink value "foldrTMap" (foldrTMap 1)
190+
191+ -- Mapping
192+ , benchIOSink value "map" (mapN serially 1)
193+ , bench "sequence" $ nfIO $ randomRIO (1, 1000) >>= \n ->
194+ sequence serially (sourceUnfoldrAction value n)
195+ , benchIOSink value "mapM" (mapM serially 1)
196+ , benchIOSink value "tap" (tap 1)
197+ , benchIOSink value "tapRate 1 second" (tapRate 1)
198+ , benchIOSink value "pollCounts 1 second" (pollCounts 1)
199+ , benchIOSink value "timestamped" timestamped
200+
201+ -- Scanning
202+ , benchIOSink value "scanl'" (scanl' 1)
203+ , benchIOSink value "scanl1'" (scanl1' 1)
204+ , benchIOSink value "scanlM'" (scanlM' 1)
205+ , benchIOSink value "scanl1M'" (scanl1M' 1)
206+ , benchIOSink value "postscanl'" (postscanl' 1)
207+ , benchIOSink value "postscanlM'" (postscanlM' 1)
208+
209+ , benchIOSink value "scan" (scan 1)
210+ , benchIOSink value "postscan" (postscan 1)
211+ ]
212+ ]
213+
214+o_1_space_mappingX4 :: Int -> [Benchmark]
215+o_1_space_mappingX4 value =
216+ [ bgroup "mappingX4"
217+ [ benchIOSink value "map" (mapN serially 4)
218+ , benchIOSink value "mapM" (mapM serially 4)
219+ , benchIOSink value "trace" (trace 4)
220+
221+ , benchIOSink value "scanl'" (scanl' 4)
222+ , benchIOSink value "scanl1'" (scanl1' 4)
223+ , benchIOSink value "scanlM'" (scanlM' 4)
224+ , benchIOSink value "scanl1M'" (scanl1M' 4)
225+ , benchIOSink value "postscanl'" (postscanl' 4)
226+ , benchIOSink value "postscanlM'" (postscanlM' 4)
227+
228+ ]
229+ ]
230+
231+{-# INLINE sieveScan #-}
232+sieveScan :: Monad m => SerialT m Int -> SerialT m Int
233+sieveScan =
234+ S.mapMaybe snd
235+ . S.scanlM' (\(primes, _) n -> do
236+ return $
237+ let ps = takeWhile (\p -> p * p <= n) primes
238+ in if all (\p -> n `mod` p /= 0) ps
239+ then (primes ++ [n], Just n)
240+ else (primes, Nothing)) (return ([2], Just 2))
241+
242+o_n_space_mapping :: Int -> [Benchmark]
243+o_n_space_mapping value =
244+ [ bgroup "mapping"
245+ [ benchIO "naive prime sieve"
246+ (\n -> S.sum $ sieveScan $ S.enumerateFromTo 2 (value + n))
247+ ]
248+ ]
249+
250+-------------------------------------------------------------------------------
251+-- Functor
252+-------------------------------------------------------------------------------
253+
254+o_1_space_functor :: Int -> [Benchmark]
255+o_1_space_functor value =
256+ [ bgroup "Functor"
257+ [ benchIOSink value "fmap" (fmapN serially 1)
258+ , benchIOSink value "fmap x 4" (fmapN serially 4)
259+ ]
260+ ]
261+
262+-------------------------------------------------------------------------------
263+-- Size reducing transformations (filtering)
264+-------------------------------------------------------------------------------
265+
266+{-# INLINE filterEven #-}
267+filterEven :: MonadIO m => Int -> SerialT m Int -> m ()
268+filterEven n = composeN n $ S.filter even
269+
270+{-# INLINE filterAllOut #-}
271+filterAllOut :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
272+filterAllOut value n = composeN n $ S.filter (> (value + 1))
273+
274+{-# INLINE filterAllIn #-}
275+filterAllIn :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
276+filterAllIn value n = composeN n $ S.filter (<= (value + 1))
277+
278+{-# INLINE filterMEven #-}
279+filterMEven :: MonadIO m => Int -> SerialT m Int -> m ()
280+filterMEven n = composeN n $ S.filterM (return . even)
281+
282+{-# INLINE filterMAllOut #-}
283+filterMAllOut :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
284+filterMAllOut value n = composeN n $ S.filterM (\x -> return $ x > (value + 1))
285+
286+{-# INLINE filterMAllIn #-}
287+filterMAllIn :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
288+filterMAllIn value n = composeN n $ S.filterM (\x -> return $ x <= (value + 1))
289+
290+{-# INLINE _takeOne #-}
291+_takeOne :: MonadIO m => Int -> SerialT m Int -> m ()
292+_takeOne n = composeN n $ S.take 1
293+
294+{-# INLINE takeAll #-}
295+takeAll :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
296+takeAll value n = composeN n $ S.take (value + 1)
297+
298+{-# INLINE takeWhileTrue #-}
299+takeWhileTrue :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
300+takeWhileTrue value n = composeN n $ S.takeWhile (<= (value + 1))
301+
302+{-# INLINE takeWhileMTrue #-}
303+takeWhileMTrue :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
304+takeWhileMTrue value n = composeN n $ S.takeWhileM (return . (<= (value + 1)))
305+
306+{-# INLINE takeByTime #-}
307+takeByTime :: NanoSecond64 -> Int -> SerialT IO Int -> IO ()
308+takeByTime i n = composeN n (Internal.takeByTime i)
309+
310+#ifdef INSPECTION
311+-- inspect $ hasNoType 'takeByTime ''SPEC
312+inspect $ hasNoTypeClasses 'takeByTime
313+-- inspect $ 'takeByTime `hasNoType` ''D.Step
314+#endif
315+
316+{-# INLINE dropOne #-}
317+dropOne :: MonadIO m => Int -> SerialT m Int -> m ()
318+dropOne n = composeN n $ S.drop 1
319+
320+{-# INLINE dropAll #-}
321+dropAll :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
322+dropAll value n = composeN n $ S.drop (value + 1)
323+
324+{-# INLINE dropWhileTrue #-}
325+dropWhileTrue :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
326+dropWhileTrue value n = composeN n $ S.dropWhile (<= (value + 1))
327+
328+{-# INLINE dropWhileMTrue #-}
329+dropWhileMTrue :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
330+dropWhileMTrue value n = composeN n $ S.dropWhileM (return . (<= (value + 1)))
331+
332+{-# INLINE dropWhileFalse #-}
333+dropWhileFalse :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
334+dropWhileFalse value n = composeN n $ S.dropWhile (> (value + 1))
335+
336+-- XXX Decide on the time interval
337+{-# INLINE _intervalsOfSum #-}
338+_intervalsOfSum :: MonadAsync m => Double -> Int -> SerialT m Int -> m ()
339+_intervalsOfSum i n = composeN n (S.intervalsOf i FL.sum)
340+
341+{-# INLINE dropByTime #-}
342+dropByTime :: NanoSecond64 -> Int -> SerialT IO Int -> IO ()
343+dropByTime i n = composeN n (Internal.dropByTime i)
344+
345+#ifdef INSPECTION
346+inspect $ hasNoTypeClasses 'dropByTime
347+-- inspect $ 'dropByTime `hasNoType` ''D.Step
348+#endif
349+
350+{-# INLINE findIndices #-}
351+findIndices :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
352+findIndices value n = composeN n $ S.findIndices (== (value + 1))
353+
354+{-# INLINE elemIndices #-}
355+elemIndices :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
356+elemIndices value n = composeN n $ S.elemIndices (value + 1)
357+
358+{-# INLINE deleteBy #-}
359+deleteBy :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
360+deleteBy value n = composeN n $ S.deleteBy (>=) (value + 1)
361+
362+-- uniq . uniq == uniq, composeN 2 ~ composeN 1
363+{-# INLINE uniq #-}
364+uniq :: MonadIO m => Int -> SerialT m Int -> m ()
365+uniq n = composeN n S.uniq
366+
367+{-# INLINE mapMaybe #-}
368+mapMaybe :: MonadIO m => Int -> SerialT m Int -> m ()
369+mapMaybe n =
370+ composeN n $
371+ S.mapMaybe
372+ (\x ->
373+ if odd x
374+ then Nothing
375+ else Just x)
376+
377+{-# INLINE mapMaybeM #-}
378+mapMaybeM :: S.MonadAsync m => Int -> SerialT m Int -> m ()
379+mapMaybeM n =
380+ composeN n $
381+ S.mapMaybeM
382+ (\x ->
383+ if odd x
384+ then return Nothing
385+ else return $ Just x)
386+
387+o_1_space_filtering :: Int -> [Benchmark]
388+o_1_space_filtering value =
389+ [ bgroup "filtering"
390+ [ benchIOSink value "filter-even" (filterEven 1)
391+ , benchIOSink value "filter-all-out" (filterAllOut value 1)
392+ , benchIOSink value "filter-all-in" (filterAllIn value 1)
393+
394+ , benchIOSink value "filterM-even" (filterMEven 1)
395+ , benchIOSink value "filterM-all-out" (filterMAllOut value 1)
396+ , benchIOSink value "filterM-all-in" (filterMAllIn value 1)
397+
398+ -- Trimming
399+ , benchIOSink value "take-all" (takeAll value 1)
400+ , benchIOSink
401+ value
402+ "takeByTime-all"
403+ (takeByTime (NanoSecond64 maxBound) 1)
404+ , benchIOSink value "takeWhile-true" (takeWhileTrue value 1)
405+ -- , benchIOSink value "takeWhileM-true" (_takeWhileMTrue value 1)
406+ , benchIOSink value "drop-one" (dropOne 1)
407+ , benchIOSink value "drop-all" (dropAll value 1)
408+ , benchIOSink
409+ value
410+ "dropByTime-all"
411+ (dropByTime (NanoSecond64 maxBound) 1)
412+ , benchIOSink value "dropWhile-true" (dropWhileTrue value 1)
413+ -- , benchIOSink value "dropWhileM-true" (_dropWhileMTrue value 1)
414+ , benchIOSink
415+ value
416+ "dropWhile-false"
417+ (dropWhileFalse value 1)
418+ , benchIOSink value "deleteBy" (deleteBy value 1)
419+
420+ , benchIOSink value "uniq" (uniq 1)
421+
422+ -- Map and filter
423+ , benchIOSink value "mapMaybe" (mapMaybe 1)
424+ , benchIOSink value "mapMaybeM" (mapMaybeM 1)
425+
426+ -- Searching (stateful map and filter)
427+ , benchIOSink value "findIndices" (findIndices value 1)
428+ , benchIOSink value "elemIndices" (elemIndices value 1)
429+ ]
430+ ]
431+
432+o_1_space_filteringX4 :: Int -> [Benchmark]
433+o_1_space_filteringX4 value =
434+ [ bgroup "filteringX4"
435+ [ benchIOSink value "filter-even" (filterEven 4)
436+ , benchIOSink value "filter-all-out" (filterAllOut value 4)
437+ , benchIOSink value "filter-all-in" (filterAllIn value 4)
438+
439+ , benchIOSink value "filterM-even" (filterMEven 4)
440+ , benchIOSink value "filterM-all-out" (filterMAllOut value 4)
441+ , benchIOSink value "filterM-all-in" (filterMAllIn value 4)
442+
443+ -- trimming
444+ , benchIOSink value "take-all" (takeAll value 4)
445+ , benchIOSink value "takeWhile-true" (takeWhileTrue value 4)
446+ , benchIOSink value "takeWhileM-true" (takeWhileMTrue value 4)
447+ , benchIOSink value "drop-one" (dropOne 4)
448+ , benchIOSink value "drop-all" (dropAll value 4)
449+ , benchIOSink value "dropWhile-true" (dropWhileTrue value 4)
450+ , benchIOSink value "dropWhileM-true" (dropWhileMTrue value 4)
451+ , benchIOSink
452+ value
453+ "dropWhile-false"
454+ (dropWhileFalse value 4)
455+ , benchIOSink value "deleteBy" (deleteBy value 4)
456+
457+ , benchIOSink value "uniq" (uniq 4)
458+
459+ -- map and filter
460+ , benchIOSink value "mapMaybe" (mapMaybe 4)
461+ , benchIOSink value "mapMaybeM" (mapMaybeM 4)
462+
463+ -- searching
464+ , benchIOSink value "findIndices" (findIndices value 4)
465+ , benchIOSink value "elemIndices" (elemIndices value 4)
466+ ]
467+ ]
468+
469+-------------------------------------------------------------------------------
470+-- Size increasing transformations (insertions)
471+-------------------------------------------------------------------------------
472+
473+{-# INLINE intersperse #-}
474+intersperse :: S.MonadAsync m => Int -> Int -> SerialT m Int -> m ()
475+intersperse value n = composeN n $ S.intersperse (value + 1)
476+
477+{-# INLINE intersperseM #-}
478+intersperseM :: S.MonadAsync m => Int -> Int -> SerialT m Int -> m ()
479+intersperseM value n = composeN n $ S.intersperseM (return $ value + 1)
480+
481+{-# INLINE insertBy #-}
482+insertBy :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
483+insertBy value n = composeN n $ S.insertBy compare (value + 1)
484+
485+o_1_space_inserting :: Int -> [Benchmark]
486+o_1_space_inserting value =
487+ [ bgroup "filtering"
488+ [ benchIOSink value "intersperse" (intersperse value 1)
489+ , benchIOSink value "intersperseM" (intersperseM value 1)
490+ , benchIOSink value "insertBy" (insertBy value 1)
491+ ]
492+ ]
493+
494+o_1_space_insertingX4 :: Int -> [Benchmark]
495+o_1_space_insertingX4 value =
496+ [ bgroup "insertingX4"
497+ [ benchIOSink value "intersperse" (intersperse value 4)
498+ , benchIOSink value "insertBy" (insertBy value 4)
499+ ]
500+ ]
501+
502+-------------------------------------------------------------------------------
503+-- Indexing
504+-------------------------------------------------------------------------------
505+
506+{-# INLINE indexed #-}
507+indexed :: MonadIO m => Int -> SerialT m Int -> m ()
508+indexed n = composeN n (S.map snd . S.indexed)
509+
510+{-# INLINE indexedR #-}
511+indexedR :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
512+indexedR value n = composeN n (S.map snd . S.indexedR value)
513+
514+o_1_space_indexing :: Int -> [Benchmark]
515+o_1_space_indexing value =
516+ [ bgroup "indexing"
517+ [ benchIOSink value "indexed" (indexed 1)
518+ , benchIOSink value "indexedR" (indexedR value 1)
519+ ]
520+ ]
521+
522+o_1_space_indexingX4 :: Int -> [Benchmark]
523+o_1_space_indexingX4 value =
524+ [ bgroup "indexingx4"
525+ [ benchIOSink value "indexed" (indexed 4)
526+ , benchIOSink value "indexedR" (indexedR value 4)
527+ ]
528+ ]
529+
530+-------------------------------------------------------------------------------
531+-- Main
532+-------------------------------------------------------------------------------
533+
534+-- In addition to gauge options, the number of elements in the stream can be
535+-- passed using the --stream-size option.
536+--
537+benchmarks :: String -> Int -> [Benchmark]
538+benchmarks moduleName size =
539+ [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
540+ [ o_1_space_functor size
541+ , o_1_space_mapping size
542+ , o_1_space_mappingX4 size
543+ , o_1_space_filtering size
544+ , o_1_space_filteringX4 size
545+ , o_1_space_inserting size
546+ , o_1_space_insertingX4 size
547+ , o_1_space_indexing size
548+ , o_1_space_indexingX4 size
549+ ]
550+ , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
551+ [ o_n_space_traversable size
552+ , o_n_space_mapping size
553+ ]
554+ ]
benchmark/Streamly/Benchmark/Prelude/Serial/Transformation2.hsnew file+444
@@ -0,0 +1,444 @@
1+-- |
2+-- Module : Serial.Transformation2
3+-- Copyright : (c) 2018 Composewell Technologies
4+-- License : BSD-3-Clause
5+-- Maintainer : streamly@composewell.com
6+
7+{-# LANGUAGE CPP #-}
8+{-# LANGUAGE FlexibleContexts #-}
9+{-# LANGUAGE ScopedTypeVariables #-}
10+{-# LANGUAGE DeriveAnyClass #-}
11+{-# LANGUAGE DeriveGeneric #-}
12+{-# LANGUAGE RankNTypes #-}
13+{-# LANGUAGE TupleSections #-}
14+
15+module Serial.Transformation2 (benchmarks) where
16+
17+import Control.DeepSeq (NFData(..))
18+import Control.Monad (when)
19+import Control.Monad.IO.Class (MonadIO(..))
20+import Data.Monoid (Sum(..))
21+import GHC.Generics (Generic)
22+
23+import qualified Streamly.Internal.Data.Fold as FL
24+import qualified Streamly.Internal.Data.Stream.IsStream as Internal
25+import qualified Streamly.Prelude as S
26+
27+import Gauge
28+import Streamly.Prelude (SerialT, serially)
29+import Streamly.Benchmark.Common
30+import Streamly.Benchmark.Prelude
31+import Prelude hiding (reverse, tail)
32+
33+-------------------------------------------------------------------------------
34+-- Iteration/looping utilities
35+-------------------------------------------------------------------------------
36+
37+{-# INLINE iterateN #-}
38+iterateN :: (Int -> a -> a) -> a -> Int -> a
39+iterateN g initial count = f count initial
40+
41+ where
42+
43+ f (0 :: Int) x = x
44+ f i x = f (i - 1) (g i x)
45+
46+-- Iterate a transformation over a singleton stream
47+{-# INLINE iterateSingleton #-}
48+iterateSingleton :: S.MonadAsync m
49+ => (Int -> SerialT m Int -> SerialT m Int)
50+ -> Int
51+ -> Int
52+ -> SerialT m Int
53+iterateSingleton g count n = iterateN g (return n) count
54+
55+-- XXX need to check why this is slower than the explicit recursion above, even
56+-- if the above code is written in a foldr like head recursive way. We also
57+-- need to try this with foldlM' once #150 is fixed.
58+-- However, it is perhaps best to keep the iteration benchmarks independent of
59+-- foldrM and any related fusion issues.
60+{-# INLINE _iterateSingleton #-}
61+_iterateSingleton ::
62+ S.MonadAsync m
63+ => (Int -> SerialT m Int -> SerialT m Int)
64+ -> Int
65+ -> Int
66+ -> SerialT m Int
67+_iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
68+
69+-- Apply transformation g count times on a stream of length len
70+{-# INLINE iterateSource #-}
71+iterateSource ::
72+ S.MonadAsync m
73+ => (SerialT m Int -> SerialT m Int)
74+ -> Int
75+ -> Int
76+ -> Int
77+ -> SerialT m Int
78+iterateSource g count len n = f count (sourceUnfoldrM len n)
79+
80+ where
81+
82+ f (0 :: Int) stream = stream
83+ f i stream = f (i - 1) (g stream)
84+
85+-------------------------------------------------------------------------------
86+-- Functor
87+-------------------------------------------------------------------------------
88+
89+o_n_space_functor :: Int -> [Benchmark]
90+o_n_space_functor value =
91+ [ bgroup "Functor"
92+ [ benchIO "(+) (n times) (baseline)" $ \i0 ->
93+ iterateN (\i acc -> acc >>= \n -> return $ i + n) (return i0) value
94+ , benchIOSrc serially "(<$) (n times)" $
95+ iterateSingleton (<$) value
96+ , benchIOSrc serially "fmap (n times)" $
97+ iterateSingleton (fmap . (+)) value
98+ {-
99+ , benchIOSrc serially "_(<$) (n times)" $
100+ _iterateSingleton (<$) value
101+ , benchIOSrc serially "_fmap (n times)" $
102+ _iterateSingleton (fmap . (+)) value
103+ -}
104+ ]
105+ ]
106+
107+-------------------------------------------------------------------------------
108+-- Grouping transformations
109+-------------------------------------------------------------------------------
110+
111+{-# INLINE groups #-}
112+groups :: MonadIO m => SerialT m Int -> m ()
113+groups = S.drain . S.groups FL.drain
114+
115+-- XXX Change this test when the order of comparison is later changed
116+{-# INLINE groupsByGT #-}
117+groupsByGT :: MonadIO m => SerialT m Int -> m ()
118+groupsByGT = S.drain . S.groupsBy (>) FL.drain
119+
120+{-# INLINE groupsByEq #-}
121+groupsByEq :: MonadIO m => SerialT m Int -> m ()
122+groupsByEq = S.drain . S.groupsBy (==) FL.drain
123+
124+-- XXX Change this test when the order of comparison is later changed
125+{-# INLINE groupsByRollingLT #-}
126+groupsByRollingLT :: MonadIO m => SerialT m Int -> m ()
127+groupsByRollingLT =
128+ S.drain . S.groupsByRolling (<) FL.drain
129+
130+{-# INLINE groupsByRollingEq #-}
131+groupsByRollingEq :: MonadIO m => SerialT m Int -> m ()
132+groupsByRollingEq =
133+ S.drain . S.groupsByRolling (==) FL.drain
134+
135+{-# INLINE foldMany #-}
136+foldMany :: Monad m => SerialT m Int -> m ()
137+foldMany =
138+ S.drain
139+ . S.map getSum
140+ . Internal.foldMany (FL.ltake 2 FL.mconcat)
141+ . S.map Sum
142+
143+{-# INLINE _foldIterate #-}
144+_foldIterate :: Monad m => SerialT m Int -> m ()
145+_foldIterate =
146+ S.drain
147+ . S.map getSum
148+ . Internal.foldIterate (FL.ltake 2 . FL.sconcat) (Sum 0)
149+ . S.map Sum
150+
151+o_1_space_grouping :: Int -> [Benchmark]
152+o_1_space_grouping value =
153+ -- Buffering operations using heap proportional to group/window sizes.
154+ [ bgroup "grouping"
155+ [ benchIOSink value "groups" groups
156+ , benchIOSink value "groupsByGT" groupsByGT
157+ , benchIOSink value "groupsByEq" groupsByEq
158+ , benchIOSink value "groupsByRollingLT" groupsByRollingLT
159+ , benchIOSink value "groupsByRollingEq" groupsByRollingEq
160+ , benchIOSink value "foldMany" foldMany
161+ -- , benchIOSink value "foldIterate" foldIterate
162+ ]
163+ ]
164+
165+-------------------------------------------------------------------------------
166+-- Size conserving transformations (reordering, buffering, etc.)
167+-------------------------------------------------------------------------------
168+
169+{-# INLINE reverse #-}
170+reverse :: MonadIO m => Int -> SerialT m Int -> m ()
171+reverse n = composeN n S.reverse
172+
173+{-# INLINE reverse' #-}
174+reverse' :: MonadIO m => Int -> SerialT m Int -> m ()
175+reverse' n = composeN n Internal.reverse'
176+
177+o_n_heap_buffering :: Int -> [Benchmark]
178+o_n_heap_buffering value =
179+ [ bgroup "buffered"
180+ [
181+ -- Reversing/sorting a stream
182+ benchIOSink value "reverse" (reverse 1)
183+ , benchIOSink value "reverse'" (reverse' 1)
184+
185+ , benchIOSink value "mkAsync" (mkAsync serially)
186+ ]
187+ ]
188+
189+-------------------------------------------------------------------------------
190+-- Grouping/Splitting
191+-------------------------------------------------------------------------------
192+
193+{-# INLINE classifySessionsOf #-}
194+classifySessionsOf :: (S.MonadAsync m) => SerialT m Int -> m ()
195+classifySessionsOf =
196+ S.drain
197+ . Internal.classifySessionsOf
198+ 3 (const (return False)) (fmap Right FL.drain)
199+ . S.map (\(ts,(k,a)) -> (k, a, ts))
200+ . Internal.timestamped
201+ . S.concatMap (\x -> S.map (x,) (S.enumerateFromTo 1 (10 :: Int)))
202+
203+o_n_space_grouping :: Int -> [Benchmark]
204+o_n_space_grouping value =
205+ -- Buffering operations using heap proportional to group/window sizes.
206+ [ bgroup "grouping"
207+ [ benchIOSink (value `div` 10) "classifySessionsOf" classifySessionsOf
208+ ]
209+ ]
210+
211+-------------------------------------------------------------------------------
212+-- Mixed Transformation
213+-------------------------------------------------------------------------------
214+
215+{-# INLINE scanMap #-}
216+scanMap :: MonadIO m => Int -> SerialT m Int -> m ()
217+scanMap n = composeN n $ S.map (subtract 1) . S.scanl' (+) 0
218+
219+{-# INLINE dropMap #-}
220+dropMap :: MonadIO m => Int -> SerialT m Int -> m ()
221+dropMap n = composeN n $ S.map (subtract 1) . S.drop 1
222+
223+{-# INLINE dropScan #-}
224+dropScan :: MonadIO m => Int -> SerialT m Int -> m ()
225+dropScan n = composeN n $ S.scanl' (+) 0 . S.drop 1
226+
227+{-# INLINE takeDrop #-}
228+takeDrop :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
229+takeDrop value n = composeN n $ S.drop 1 . S.take (value + 1)
230+
231+{-# INLINE takeScan #-}
232+takeScan :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
233+takeScan value n = composeN n $ S.scanl' (+) 0 . S.take (value + 1)
234+
235+{-# INLINE takeMap #-}
236+takeMap :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
237+takeMap value n = composeN n $ S.map (subtract 1) . S.take (value + 1)
238+
239+{-# INLINE filterDrop #-}
240+filterDrop :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
241+filterDrop value n = composeN n $ S.drop 1 . S.filter (<= (value + 1))
242+
243+{-# INLINE filterTake #-}
244+filterTake :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
245+filterTake value n = composeN n $ S.take (value + 1) . S.filter (<= (value + 1))
246+
247+{-# INLINE filterScan #-}
248+filterScan :: MonadIO m => Int -> SerialT m Int -> m ()
249+filterScan n = composeN n $ S.scanl' (+) 0 . S.filter (<= maxBound)
250+
251+{-# INLINE filterScanl1 #-}
252+filterScanl1 :: MonadIO m => Int -> SerialT m Int -> m ()
253+filterScanl1 n = composeN n $ S.scanl1' (+) . S.filter (<= maxBound)
254+
255+{-# INLINE filterMap #-}
256+filterMap :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
257+filterMap value n = composeN n $ S.map (subtract 1) . S.filter (<= (value + 1))
258+
259+-------------------------------------------------------------------------------
260+-- Scan and fold
261+-------------------------------------------------------------------------------
262+
263+data Pair a b =
264+ Pair !a !b
265+ deriving (Generic, NFData)
266+
267+{-# INLINE sumProductFold #-}
268+sumProductFold :: Monad m => SerialT m Int -> m (Int, Int)
269+sumProductFold = S.foldl' (\(s, p) x -> (s + x, p * x)) (0, 1)
270+
271+{-# INLINE sumProductScan #-}
272+sumProductScan :: Monad m => SerialT m Int -> m (Pair Int Int)
273+sumProductScan =
274+ S.foldl' (\(Pair _ p) (s0, x) -> Pair s0 (p * x)) (Pair 0 1) .
275+ S.scanl' (\(s, _) x -> (s + x, x)) (0, 0)
276+
277+{-# INLINE foldl'ReduceMap #-}
278+foldl'ReduceMap :: Monad m => SerialT m Int -> m Int
279+foldl'ReduceMap = fmap (+ 1) . S.foldl' (+) 0
280+
281+o_1_space_transformations_mixed :: Int -> [Benchmark]
282+o_1_space_transformations_mixed value =
283+ -- scanl-map and foldl-map are equivalent to the scan and fold in the foldl
284+ -- library. If scan/fold followed by a map is efficient enough we may not
285+ -- need monolithic implementations of these.
286+ [ bgroup "mixed"
287+ [ benchIOSink value "scanl-map" (scanMap 1)
288+ , benchIOSink value "foldl-map" foldl'ReduceMap
289+ , benchIOSink value "sum-product-fold" sumProductFold
290+ , benchIOSink value "sum-product-scan" sumProductScan
291+ ]
292+ ]
293+
294+o_1_space_transformations_mixedX4 :: Int -> [Benchmark]
295+o_1_space_transformations_mixedX4 value =
296+ [ bgroup "mixedX4"
297+ [ benchIOSink value "scan-map" (scanMap 4)
298+ , benchIOSink value "drop-map" (dropMap 4)
299+ , benchIOSink value "drop-scan" (dropScan 4)
300+ , benchIOSink value "take-drop" (takeDrop value 4)
301+ , benchIOSink value "take-scan" (takeScan value 4)
302+ , benchIOSink value "take-map" (takeMap value 4)
303+ , benchIOSink value "filter-drop" (filterDrop value 4)
304+ , benchIOSink value "filter-take" (filterTake value 4)
305+ , benchIOSink value "filter-scan" (filterScan 4)
306+ , benchIOSink value "filter-scanl1" (filterScanl1 4)
307+ , benchIOSink value "filter-map" (filterMap value 4)
308+ ]
309+ ]
310+
311+-------------------------------------------------------------------------------
312+-- Iterating a transformation over and over again
313+-------------------------------------------------------------------------------
314+
315+-- this is quadratic
316+{-# INLINE iterateScan #-}
317+iterateScan :: S.MonadAsync m => Int -> Int -> Int -> SerialT m Int
318+iterateScan = iterateSource (S.scanl' (+) 0)
319+
320+-- this is quadratic
321+{-# INLINE iterateScanl1 #-}
322+iterateScanl1 :: S.MonadAsync m => Int -> Int -> Int -> SerialT m Int
323+iterateScanl1 = iterateSource (S.scanl1' (+))
324+
325+{-# INLINE iterateMapM #-}
326+iterateMapM :: S.MonadAsync m => Int -> Int -> Int -> SerialT m Int
327+iterateMapM = iterateSource (S.mapM return)
328+
329+{-# INLINE iterateFilterEven #-}
330+iterateFilterEven :: S.MonadAsync m => Int -> Int -> Int -> SerialT m Int
331+iterateFilterEven = iterateSource (S.filter even)
332+
333+{-# INLINE iterateTakeAll #-}
334+iterateTakeAll :: S.MonadAsync m => Int -> Int -> Int -> Int -> SerialT m Int
335+iterateTakeAll value = iterateSource (S.take (value + 1))
336+
337+{-# INLINE iterateDropOne #-}
338+iterateDropOne :: S.MonadAsync m => Int -> Int -> Int -> SerialT m Int
339+iterateDropOne = iterateSource (S.drop 1)
340+
341+{-# INLINE iterateDropWhileFalse #-}
342+iterateDropWhileFalse :: S.MonadAsync m
343+ => Int -> Int -> Int -> Int -> SerialT m Int
344+iterateDropWhileFalse value = iterateSource (S.dropWhile (> (value + 1)))
345+
346+{-# INLINE iterateDropWhileTrue #-}
347+iterateDropWhileTrue :: S.MonadAsync m
348+ => Int -> Int -> Int -> Int -> SerialT m Int
349+iterateDropWhileTrue value = iterateSource (S.dropWhile (<= (value + 1)))
350+
351+{-# INLINE tail #-}
352+tail :: Monad m => SerialT m a -> m ()
353+tail s = S.tail s >>= mapM_ tail
354+
355+{-# INLINE nullHeadTail #-}
356+nullHeadTail :: Monad m => SerialT m Int -> m ()
357+nullHeadTail s = do
358+ r <- S.null s
359+ when (not r) $ do
360+ _ <- S.head s
361+ S.tail s >>= mapM_ nullHeadTail
362+
363+-- Head recursive operations.
364+o_n_stack_iterated :: Int -> [Benchmark]
365+o_n_stack_iterated value = by10 `seq` by100 `seq`
366+ [ bgroup "iterated"
367+ [ benchIOSrc serially "mapM (n/10 x 10)" $ iterateMapM by10 10
368+ , benchIOSrc serially "scanl' (quadratic) (n/100 x 100)" $
369+ iterateScan by100 100
370+ , benchIOSrc serially "scanl1' (n/10 x 10)" $ iterateScanl1 by10 10
371+ , benchIOSrc serially "filterEven (n/10 x 10)" $
372+ iterateFilterEven by10 10
373+ , benchIOSrc serially "takeAll (n/10 x 10)" $
374+ iterateTakeAll value by10 10
375+ , benchIOSrc serially "dropOne (n/10 x 10)" $ iterateDropOne by10 10
376+ , benchIOSrc serially "dropWhileFalse (n/10 x 10)" $
377+ iterateDropWhileFalse value by10 10
378+ , benchIOSrc serially "dropWhileTrue (n/10 x 10)" $
379+ iterateDropWhileTrue value by10 10
380+ , benchIOSink value "tail" tail
381+ , benchIOSink value "nullHeadTail" nullHeadTail
382+ ]
383+ ]
384+
385+ where
386+
387+ by10 = value `div` 10
388+ by100 = value `div` 100
389+
390+-------------------------------------------------------------------------------
391+-- Pipes
392+-------------------------------------------------------------------------------
393+
394+o_1_space_pipes :: Int -> [Benchmark]
395+o_1_space_pipes value =
396+ [ bgroup "pipes"
397+ [ benchIOSink value "mapM" (transformMapM serially 1)
398+ , benchIOSink value "compose" (transformComposeMapM serially 1)
399+ , benchIOSink value "tee" (transformTeeMapM serially 1)
400+#ifdef DEVBUILD
401+ -- XXX this take 1 GB memory to compile
402+ , benchIOSink value "zip" (transformZipMapM serially 1)
403+#endif
404+ ]
405+ ]
406+
407+o_1_space_pipesX4 :: Int -> [Benchmark]
408+o_1_space_pipesX4 value =
409+ [ bgroup "pipesX4"
410+ [ benchIOSink value "mapM" (transformMapM serially 4)
411+ , benchIOSink value "compose" (transformComposeMapM serially 4)
412+ , benchIOSink value "tee" (transformTeeMapM serially 4)
413+#ifdef DEVBUILD
414+ -- XXX this take 1 GB memory to compile
415+ , benchIOSink value "zip" (transformZipMapM serially 4)
416+#endif
417+ ]
418+ ]
419+
420+-------------------------------------------------------------------------------
421+-- Main
422+-------------------------------------------------------------------------------
423+
424+-- In addition to gauge options, the number of elements in the stream can be
425+-- passed using the --stream-size option.
426+--
427+benchmarks :: String -> Int -> [Benchmark]
428+benchmarks moduleName size =
429+ [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
430+ [ o_1_space_grouping size
431+ , o_1_space_transformations_mixed size
432+ , o_1_space_transformations_mixedX4 size
433+
434+ -- pipes
435+ , o_1_space_pipes size
436+ , o_1_space_pipesX4 size
437+ ]
438+ , bgroup (o_n_stack_prefix moduleName) (o_n_stack_iterated size)
439+ , bgroup (o_n_heap_prefix moduleName) $ Prelude.concat
440+ [ o_n_space_grouping size
441+ , o_n_space_functor size
442+ , o_n_heap_buffering size
443+ ]
444+ ]
benchmark/Streamly/Benchmark/Prelude/Serial/Transformation3.hsnew file+122
@@ -0,0 +1,122 @@
1+-- |
2+-- Module : Serial.Transformation3
3+-- Copyright : (c) 2018 Composewell Technologies
4+-- License : BSD-3-Clause
5+-- Maintainer : streamly@composewell.com
6+
7+{-# LANGUAGE CPP #-}
8+{-# LANGUAGE FlexibleContexts #-}
9+{-# LANGUAGE ScopedTypeVariables #-}
10+{-# LANGUAGE RankNTypes #-}
11+
12+module Serial.Transformation3 (benchmarks) where
13+
14+import Control.Monad.State.Strict (StateT, get, put, MonadState)
15+import qualified Control.Monad.State.Strict as State
16+import Control.Monad.Trans.Class (lift)
17+
18+import qualified Streamly.Prelude as S
19+import qualified Streamly.Internal.Data.Stream.IsStream as Internal
20+
21+import Gauge
22+import Streamly.Prelude (SerialT, serially)
23+import Streamly.Benchmark.Common
24+import Streamly.Benchmark.Prelude
25+import Prelude hiding (reverse, tail)
26+
27+-------------------------------------------------------------------------------
28+-- Monad transformation (hoisting etc.)
29+-------------------------------------------------------------------------------
30+
31+{-# INLINE sourceUnfoldrState #-}
32+sourceUnfoldrState :: (S.IsStream t, S.MonadAsync m)
33+ => Int -> Int -> t (StateT Int m) Int
34+sourceUnfoldrState value n = S.unfoldrM step n
35+ where
36+ step cnt =
37+ if cnt > n + value
38+ then return Nothing
39+ else do
40+ s <- get
41+ put (s + 1)
42+ return (Just (s, cnt + 1))
43+
44+{-# INLINE evalStateT #-}
45+evalStateT :: S.MonadAsync m => Int -> Int -> SerialT m Int
46+evalStateT value n =
47+ Internal.evalStateT (return 0) (sourceUnfoldrState value n)
48+
49+{-# INLINE withState #-}
50+withState :: S.MonadAsync m => Int -> Int -> SerialT m Int
51+withState value n =
52+ Internal.evalStateT
53+ (return (0 :: Int)) (Internal.liftInner (sourceUnfoldrM value n))
54+
55+o_1_space_hoisting :: Int -> [Benchmark]
56+o_1_space_hoisting value =
57+ [ bgroup "hoisting"
58+ [ benchIOSrc serially "evalState" (evalStateT value)
59+ , benchIOSrc serially "withState" (withState value)
60+ ]
61+ ]
62+
63+{-# INLINE iterateStateIO #-}
64+iterateStateIO ::
65+ (S.MonadAsync m)
66+ => Int
67+ -> StateT Int m Int
68+iterateStateIO n = do
69+ x <- get
70+ if x > n
71+ then do
72+ put (x - 1)
73+ iterateStateIO n
74+ else return x
75+
76+{-# INLINE iterateStateT #-}
77+iterateStateT :: Int -> SerialT (StateT Int IO) Int
78+iterateStateT n = do
79+ x <- lift get
80+ if x > n
81+ then do
82+ lift $ put (x - 1)
83+ iterateStateT n
84+ else return x
85+
86+{-# INLINE iterateState #-}
87+iterateState ::
88+ (S.MonadAsync m, MonadState Int m)
89+ => Int
90+ -> SerialT m Int
91+iterateState n = do
92+ x <- get
93+ if x > n
94+ then do
95+ put (x - 1)
96+ iterateState n
97+ else return x
98+
99+o_n_heap_transformer :: Int -> [Benchmark]
100+o_n_heap_transformer value =
101+ [ bgroup "transformer"
102+ [ benchIO "StateT Int IO (n times) (baseline)" $ \n ->
103+ State.evalStateT (iterateStateIO n) value
104+ , benchIO "SerialT (StateT Int IO) (n times)" $ \n ->
105+ State.evalStateT (S.drain (iterateStateT n)) value
106+ , benchIO "MonadState Int m => SerialT m Int" $ \n ->
107+ State.evalStateT (S.drain (iterateState n)) value
108+ ]
109+ ]
110+
111+-------------------------------------------------------------------------------
112+-- Main
113+-------------------------------------------------------------------------------
114+
115+-- In addition to gauge options, the number of elements in the stream can be
116+-- passed using the --stream-size option.
117+--
118+benchmarks :: String -> Int -> [Benchmark]
119+benchmarks moduleName size =
120+ [ bgroup (o_1_space_prefix moduleName) (o_1_space_hoisting size)
121+ , bgroup (o_n_heap_prefix moduleName) (o_n_heap_transformer size)
122+ ]
benchmark/Streamly/Benchmark/Prelude/WAsync.hs+30−30

This diff is too big to show here.

benchmark/Streamly/Benchmark/Prelude/WSerial.hs+68−218

This diff is too big to show here.

benchmark/Streamly/Benchmark/Prelude/ZipAsync.hs+11−25

This diff is too big to show here.

benchmark/Streamly/Benchmark/Prelude/ZipSerial.hs+10−56

This diff is too big to show here.

benchmark/Streamly/Benchmark/Unicode/Char.hsdeleted−90

This diff is too big to show here.

benchmark/Streamly/Benchmark/Unicode/Parser.hsdeleted−107

This diff is too big to show here.

benchmark/Streamly/Benchmark/Unicode/Stream.hs+104−165

This diff is too big to show here.

benchmark/Streamly/Benchmark/Unicode/Utf8.hsdeleted−55

This diff is too big to show here.

benchmark/Streamly/Benchmark/Unicode/data/AllChars.txtdeleted−216

This diff is too big to show here.

benchmark/Streamly/Benchmark/Unicode/data/Deutsch.txtdeleted−153

This diff is too big to show here.

benchmark/Streamly/Benchmark/Unicode/data/Devanagari.txtdeleted−699

This diff is too big to show here.

benchmark/Streamly/Benchmark/Unicode/data/English.txtdeleted−58

This diff is too big to show here.

benchmark/Streamly/Benchmark/Unicode/data/Japanese.txtdeleted−855

This diff is too big to show here.

benchmark/Streamly/Benchmark/Unicode/data/Korean.txtdeleted−493

This diff is too big to show here.

benchmark/Streamly/Benchmark/Unicode/data/Vietnamese.txtdeleted−402

This diff is too big to show here.

benchmark/bench-runner/Main.hsdeleted−183

This diff is too big to show here.

benchmark/bench-runner/bench-runner.cabaldeleted−42

This diff is too big to show here.

benchmark/bench-runner/cabal.projectdeleted−4

This diff is too big to show here.

benchmark/bench-runner/default.nixdeleted−164

This diff is too big to show here.

benchmark/lib/Streamly/Benchmark/Common.hs+17−65

This diff is too big to show here.

benchmark/lib/Streamly/Benchmark/Common/Handle.hs+32−47

This diff is too big to show here.

benchmark/lib/Streamly/Benchmark/Prelude.hs+44−110

This diff is too big to show here.

benchmark/streamly-benchmarks.cabal+168−466

This diff is too big to show here.

bin/bench-exec-one.shnew file+175

This diff is too big to show here.

bin/bench.shnew file+417

This diff is too big to show here.

bin/build-lib.shnew file+236

This diff is too big to show here.

bin/ghc.shdeleted−45

This diff is too big to show here.

bin/mk-hscope.sh+2−2

This diff is too big to show here.

bin/repldeleted−3

This diff is too big to show here.

bin/run-ci.shdeleted−334

This diff is too big to show here.

bin/run-repl-quick.shdeleted−113

This diff is too big to show here.

bin/targets.shnew file+110

This diff is too big to show here.

bin/test.shnew file+163

This diff is too big to show here.

cabal.project+2−2

This diff is too big to show here.

cabal.project.O0deleted−24

This diff is too big to show here.

cabal.project.Werror-nocodedeleted−21

This diff is too big to show here.

cabal.project.Werror → cabal.project.cirenamed+3−4

This diff is too big to show here.

cabal.project.coverage+4−5

This diff is too big to show here.

cabal.project.doctestdeleted−24

This diff is too big to show here.

cabal.project.ghc-headdeleted−35

This diff is too big to show here.

cabal.project.hpc-coveralls+1−1

This diff is too big to show here.

cabal.project.packdiffdeleted−9

This diff is too big to show here.

cabal.project.reportdeleted−30

This diff is too big to show here.

cabal.project.streamlydeleted−10

This diff is too big to show here.

docs/User/HowTo/streamly-vs-list-time.svg → charts-0/streamly-vs-list-time.svgrenamed

The content is the same.

configure+1406−1258

This diff is too big to show here.

configure.ac+5−1

This diff is too big to show here.

core/Changelog.mddeleted−1

This diff is too big to show here.

core/LICENSEdeleted−322

This diff is too big to show here.

core/Setup.hsdeleted−6

This diff is too big to show here.

core/configuredeleted−4349

This diff is too big to show here.

core/configure.acdeleted−17

This diff is too big to show here.

core/docs/ApiChangelogs/0.1.0-0.2.0.txtdeleted−1471

This diff is too big to show here.

core/docs/ApiChangelogs/0.1.0.txtdeleted−405

This diff is too big to show here.

core/docs/ApiChangelogs/0.2.0-0.2.2.txtdeleted−306

This diff is too big to show here.

core/docs/Changelog.mddeleted−97

This diff is too big to show here.

core/docs/Readme.mddeleted−1

This diff is too big to show here.

core/src/DocTestDataArray.hsdeleted−22

This diff is too big to show here.

core/src/DocTestDataFold.hsdeleted−27

This diff is too big to show here.

core/src/DocTestDataMutArray.hsdeleted−10

This diff is too big to show here.

core/src/DocTestDataMutArrayGeneric.hsdeleted−10

This diff is too big to show here.

core/src/DocTestDataParser.hsdeleted−20

This diff is too big to show here.

core/src/DocTestDataParserK.hsdeleted−15

This diff is too big to show here.

core/src/DocTestDataStream.hsdeleted−39

This diff is too big to show here.

core/src/DocTestDataStreamK.hsdeleted−21

This diff is too big to show here.

core/src/DocTestDataUnfold.hsdeleted−12

This diff is too big to show here.

core/src/DocTestFileSystemHandle.hsdeleted−15

This diff is too big to show here.

core/src/DocTestUnicodeParser.hsdeleted−9

This diff is too big to show here.

core/src/DocTestUnicodeStream.hsdeleted−12

This diff is too big to show here.

core/src/DocTestUnicodeString.hsdeleted−5

This diff is too big to show here.

core/src/Streamly/Console/Stdio.hsdeleted−30

This diff is too big to show here.

core/src/Streamly/Data/Array.hsdeleted−167

This diff is too big to show here.

core/src/Streamly/Data/Array/Generic.hsdeleted−51

This diff is too big to show here.

core/src/Streamly/Data/Fold.hsdeleted−415

This diff is too big to show here.

core/src/Streamly/Data/MutArray.hsdeleted−110

This diff is too big to show here.

core/src/Streamly/Data/MutArray/Generic.hsdeleted−70

This diff is too big to show here.

core/src/Streamly/Data/MutByteArray.hsdeleted−106

This diff is too big to show here.

core/src/Streamly/Data/Parser.hsdeleted−247

This diff is too big to show here.

core/src/Streamly/Data/ParserK.hsdeleted−139

This diff is too big to show here.

core/src/Streamly/Data/Stream.hsdeleted−746

This diff is too big to show here.

core/src/Streamly/Data/StreamK.hsdeleted−194

This diff is too big to show here.

core/src/Streamly/Data/Unfold.hsdeleted−233

This diff is too big to show here.

core/src/Streamly/FileSystem/Dir.hsdeleted−23

This diff is too big to show here.

core/src/Streamly/FileSystem/File.hsdeleted−60

This diff is too big to show here.

core/src/Streamly/FileSystem/Handle.hsdeleted−117

This diff is too big to show here.

core/src/Streamly/Internal/BaseCompat.hsdeleted−37

This diff is too big to show here.

core/src/Streamly/Internal/Console/Stdio.hsdeleted−228

This diff is too big to show here.

core/src/Streamly/Internal/Control/ForkIO.hsdeleted−50

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array.hsdeleted−1018

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/ArrayMacros.hdeleted−43

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Binary/Parser.hsdeleted−399

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Either/Strict.hsdeleted−57

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold.hsdeleted−33

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Chunked.hsdeleted−379

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Step.hsdeleted−83

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Tee.hsdeleted−184

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Type.hsdeleted−2099

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Window.hsdeleted−357

This diff is too big to show here.

core/src/Streamly/Internal/Data/IOFinalizer.hsdeleted−101

This diff is too big to show here.

core/src/Streamly/Internal/Data/IORef/Unboxed.hsdeleted−101

This diff is too big to show here.

core/src/Streamly/Internal/Data/IsMap.hsdeleted−60

This diff is too big to show here.

core/src/Streamly/Internal/Data/List.hsdeleted−234

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser.hsdeleted−3621

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser/Type.hsdeleted−1452

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Pipe.hsdeleted−273

This diff is too big to show here.

core/src/Streamly/Internal/Data/Producer.hsdeleted−81

This diff is too big to show here.

core/src/Streamly/Internal/Data/Producer/Source.hsdeleted−303

This diff is too big to show here.

core/src/Streamly/Internal/Data/Producer/Type.hsdeleted−186

This diff is too big to show here.

core/src/Streamly/Internal/Data/Refold/Type.hsdeleted−251

This diff is too big to show here.

core/src/Streamly/Internal/Data/Ring.hsdeleted−619

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/SVar/Type.hsdeleted−540

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream.hsdeleted−42

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Eliminate.hsdeleted−849

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Exception.hsdeleted−501

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Generate.hsdeleted−1191

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Lift.hsdeleted−129

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Nesting.hsdeleted−3024

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Step.hsdeleted−39

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD.hsdeleted−16

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Top.hsdeleted−480

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Transform.hsdeleted−1971

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Type.hsdeleted−2220

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Time/Clock.hsdeleted−180

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unfold.hsdeleted−1077

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unfold/Enumeration.hsdeleted−543

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unfold/Type.hsdeleted−999

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/System/IO.hsdeleted−58

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Stream.hsdeleted−1123

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/String.hsdeleted−158

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/assert.hsdeleted−6

This diff is too big to show here.

core/src/config.h.indeleted−57

This diff is too big to show here.

core/src/inline.hsdeleted−27

This diff is too big to show here.

core/streamly-core.cabaldeleted−534

This diff is too big to show here.

docs/User/Project/CONTRIBUTORS.md → credits/CONTRIBUTORS.mdrenamed+2−58

This diff is too big to show here.

credits/COPYRIGHTS.mdnew file+77

This diff is too big to show here.

docs/User/Project/Credits.md → credits/README.mdrenamed+1−3

This diff is too big to show here.

credits/Yampa-0.10.6.2.txtnew file+29

This diff is too big to show here.

credits/base-4.12.0.0.txtnew file+83

This diff is too big to show here.

credits/bjoern-2008-2009.txtnew file+19

This diff is too big to show here.

credits/clock-0.7.2.txtnew file+32

This diff is too big to show here.

credits/foldl-1.4.5.txtnew file+24

This diff is too big to show here.

credits/fsnotify-0.3.0.1.txtnew file+30

This diff is too big to show here.

credits/hfsevents-0.1.6.txtnew file+30

This diff is too big to show here.

credits/pipes-concurrency-2.0.8.txtnew file+24

This diff is too big to show here.

credits/primitive-0.7.0.0.txtnew file+30

This diff is too big to show here.

credits/transient-0.5.5.txtnew file+18

This diff is too big to show here.

credits/vector-0.12.0.2.txtnew file+30

This diff is too big to show here.

default.nix+8−52

This diff is too big to show here.

docs/Developer/dfa-bytes.png → design/dfa-bytes.pngrenamed

Binary file not shown.

docs/Developer/dfa-classes.png → design/dfa-classes.pngrenamed

Binary file not shown.

docs/Developer/dfa-rearr.png → design/dfa-rearr.pngrenamed

Binary file not shown.

docs/Developer/linked-lists.md → design/linked-lists.mdrenamed

The content is the same.

docs/Developer/module-organization.md → design/module-organization.mdrenamed+8−8

This diff is too big to show here.

docs/Developer/optimization-guidelines.md → design/optimization-guidelines.mdrenamed+3−15

This diff is too big to show here.

docs/Developer/paths.rst → design/paths.rstrenamed+2−25

This diff is too big to show here.

docs/Developer/unicode.md → design/unicode.mdrenamed

The content is the same.

docs/Developer/utf8-decoder.md → design/utf8-decoder.mdrenamed+3−3

This diff is too big to show here.

docs/User/HowTo/optimizing.md → docs/Build.mdrenamed+117−10

This diff is too big to show here.

docs/Developer/Benchmarks.mddeleted−342

This diff is too big to show here.

docs/Developer/Contributing.mddeleted−271

This diff is too big to show here.

docs/Developer/Github.linkdeleted−1

This diff is too big to show here.

docs/Developer/MAINTAINING.mddeleted−422

This diff is too big to show here.

docs/Developer/Tests.mddeleted−139

This diff is too big to show here.

docs/Developer/ci-tests.mddeleted−64

This diff is too big to show here.

docs/Developer/container-api.mddeleted−124

This diff is too big to show here.

docs/Developer/cps-vs-direct.rstdeleted−328

This diff is too big to show here.

docs/Developer/overview.mddeleted−24

This diff is too big to show here.

docs/Developer/related-packages.mddeleted−71

This diff is too big to show here.

docs/Developer/resources.mddeleted−45

This diff is too big to show here.

docs/Developer/roadmap.mddeleted−36

This diff is too big to show here.

docs/Documentation.mddeleted−5

This diff is too big to show here.

docs/Setup.hsdeleted−6

This diff is too big to show here.

docs/User/Explanatory/Overview.mddeleted−468

This diff is too big to show here.

docs/User/Explanatory/design.mddeleted−42

This diff is too big to show here.

docs/User/Explanatory/monad-transformers.mddeleted−65

This diff is too big to show here.

docs/User/Explanatory/performance.mddeleted−7

This diff is too big to show here.

docs/User/Explanatory/streaming-pradigms.rstdeleted−117

This diff is too big to show here.

docs/User/Explanatory/unified-abstractions.mddeleted−275

This diff is too big to show here.

docs/User/HowTo/Compiling.mddeleted−145

This diff is too big to show here.

docs/User/HowTo/Examples.linkdeleted−1

This diff is too big to show here.

docs/User/HowTo/faq.mddeleted−94

This diff is too big to show here.

docs/User/HowTo/interoperation.mddeleted−11

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/Project/ApiChangelogs/0.8.3.txtdeleted−261

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/Project/Github.linkdeleted−1

This diff is too big to show here.

docs/User/Project/README.mddeleted−141

This diff is too big to show here.

docs/User/Project/Roadmap.linkdeleted−1

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/Tutorials/ConcurrentStreams.hsdeleted−771

This diff is too big to show here.

docs/User/Tutorials/Examples.linkdeleted−1

This diff is too big to show here.

docs/User/Tutorials/ReactiveProgramming.hsdeleted−126

This diff is too big to show here.

docs/User/Tutorials/Tutorial.hsdeleted−521

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/Tutorials/getting-started.mddeleted−225

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/resources.mddeleted−18

This diff is too big to show here.

docs/streamly-docs.cabaldeleted−49

This diff is too big to show here.

docs/User/HowTo/streamly-vs-async.md → docs/streamly-vs-async.mdrenamed+17−19

This diff is too big to show here.

docs/User/HowTo/streamly-vs-lists.md → docs/streamly-vs-lists.mdrenamed+5−7

This diff is too big to show here.

docs/transformers.mdnew file+32

This diff is too big to show here.

examples/README.md+1−1

This diff is too big to show here.

hie.yaml+55−144

This diff is too big to show here.

core/jsbits/clock.js → jsbits/clock.jsrenamed

The content is the same.

src/Streamly.hsnew file+658

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Data/Array/Foreign.hs → src/Streamly/Data/Array/Storable/Foreign.hsrenamed+8−54

This diff is too big to show here.

src/Streamly/Data/Fold.hsnew file+265

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Data/Unfold.hsnew file+62

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/FileSystem/FD.hs → src/Streamly/FileSystem/FD.hsrenamed+70−89

This diff is too big to show here.

src/Streamly/Internal/FileSystem/FDIO.hs → src/Streamly/FileSystem/FDIO.hsrenamed+15−6

This diff is too big to show here.

src/Streamly/FileSystem/Handle.hsnew file+86

This diff is too big to show here.

src/Streamly/Internal/System/IOVec/Type.hsc → src/Streamly/FileSystem/IOVec.hscrenamed+4−7

This diff is too big to show here.

src/Streamly/Internal/BaseCompat.hsnew file+42

This diff is too big to show here.

src/Streamly/Internal/Control/Concurrent.hsdeleted−77

This diff is too big to show here.

core/src/Streamly/Internal/Control/Exception.hs → src/Streamly/Internal/Control/Exception.hsrenamed+15−3

This diff is too big to show here.

src/Streamly/Internal/Control/ForkLifted.hsdeleted−66

This diff is too big to show here.

core/src/Streamly/Internal/Control/Monad.hs → src/Streamly/Internal/Control/Monad.hsrenamed+1−1

This diff is too big to show here.

src/Streamly/Internal/Data/Array.hsnew file+206

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim.hsnew file+110

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/Mut/Types.hsnew file+94

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/MutTypesInclude.hsnew file+406

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/Pinned.hsnew file+108

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/Pinned/Mut/Types.hsnew file+176

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/Pinned/Types.hsnew file+127

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/Types.hsnew file+98

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/TypesInclude.hsnew file+702

This diff is too big to show here.

src/Streamly/Internal/Data/Array/PrimInclude.hsnew file+185

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Storable/Foreign.hsnew file+611

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Storable/Foreign/Mut/Types.hsnew file+1365

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Storable/Foreign/Types.hsnew file+695

This diff is too big to show here.

src/Streamly/Internal/Data/Binary/Decode.hsnew file+278

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Cont.hs+1−1

This diff is too big to show here.

src/Streamly/Internal/Data/Either/Strict.hsnew file+26

This diff is too big to show here.

src/Streamly/Internal/Data/Fold.hsnew file+2087

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Async.hsdeleted−133

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/SVar.hsdeleted−79

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Types.hsnew file+943

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/IORef/Prim.hsnew file+84

This diff is too big to show here.

src/Streamly/Internal/Data/IsMap/HashMap.hsdeleted−42

This diff is too big to show here.

src/Streamly/Internal/Data/List.hsnew file+188

This diff is too big to show here.

core/src/Streamly/Internal/Data/Maybe/Strict.hs → src/Streamly/Internal/Data/Maybe/Strict.hsrenamed+1−25

This diff is too big to show here.

src/Streamly/Internal/Data/Parser.hsnew file+989

This diff is too big to show here.

src/Streamly/Internal/Data/Parser/ParserD.hsnew file+736

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Parser/ParserD/Types.hsnew file+670

This diff is too big to show here.

src/Streamly/Internal/Data/Parser/ParserK/Types.hsnew file+456

This diff is too big to show here.

src/Streamly/Internal/Data/Pipe.hsnew file+1968

This diff is too big to show here.

core/src/Streamly/Internal/Data/Pipe/Type.hs → src/Streamly/Internal/Data/Pipe/Types.hsrenamed+5−2

This diff is too big to show here.

src/Streamly/Internal/Data/SVar.hs+2044−116

This diff is too big to show here.

src/Streamly/Internal/Data/SVar/Dispatch.hsdeleted−739

This diff is too big to show here.

src/Streamly/Internal/Data/SVar/Pull.hsdeleted−164

This diff is too big to show here.

src/Streamly/Internal/Data/SVar/Worker.hsdeleted−544

This diff is too big to show here.

src/Streamly/Internal/Data/Sink.hsnew file+245

This diff is too big to show here.

src/Streamly/Internal/Data/Sink/Types.hsnew file+24

This diff is too big to show here.

src/Streamly/Internal/Data/SmallArray.hs+35−42

This diff is too big to show here.

src/Streamly/Internal/Data/SmallArray/Type.hs → src/Streamly/Internal/Data/SmallArray/Types.hsrenamed+76−9

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Ahead.hs+119−149

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Async.hs+214−268

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Combinators.hs → src/Streamly/Internal/Data/Stream/Combinators.hsrenamed+7−11

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Common.hsdeleted−105

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Enumeration.hs → src/Streamly/Internal/Data/Stream/Enumeration.hsrenamed+48−96

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Instances.hs+27−22

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Common.hsdeleted−747

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hsdeleted−1035

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Exception.hsdeleted−284

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Expand.hsdeleted−1158

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Generate.hsdeleted−640

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Lift.hsdeleted−150

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Reduce.hsdeleted−1627

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Top.hsdeleted−749

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Transform.hsdeleted−1595

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Type.hsdeleted−783

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Parallel.hs+292−254

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Prelude.hs+352−8

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/SVar/Eliminate.hsdeleted−405

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/SVar/Generate.hsdeleted−294

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Serial.hs+247−197

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/StreamD.hsnew file+4951

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/StreamK.hsnew file+1151

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Zip.hs+178−82

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/ZipAsync.hsdeleted−134

This diff is too big to show here.

src/Streamly/Internal/Data/Time.hsnew file+74

This diff is too big to show here.

core/src/Streamly/Internal/Data/Time/Clock/Type.hsc → src/Streamly/Internal/Data/Time/Clock.hscrenamed+4−4

This diff is too big to show here.

core/src/Streamly/Internal/Data/Time/Clock/Darwin.c → src/Streamly/Internal/Data/Time/Darwin.crenamed

The content is the same.

core/src/Streamly/Internal/Data/Time/TimeSpec.hsc → src/Streamly/Internal/Data/Time/TimeSpec.hscrenamed+5−4

This diff is too big to show here.

core/src/Streamly/Internal/Data/Time/Units.hs → src/Streamly/Internal/Data/Time/Units.hsrenamed+3−11

This diff is too big to show here.

core/src/Streamly/Internal/Data/Time/Clock/Windows.c → src/Streamly/Internal/Data/Time/Windows.crenamed

The content is the same.

core/src/Streamly/Internal/Data/Time/Clock/config-clock.h → src/Streamly/Internal/Data/Time/config-clock.hrenamed

The content is the same.

core/src/Streamly/Internal/Data/Tuple/Strict.hs → src/Streamly/Internal/Data/Tuple/Strict.hsrenamed−11

This diff is too big to show here.

src/Streamly/Internal/Data/Unfold.hsnew file+1472

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Unfold/SVar.hsdeleted−161

This diff is too big to show here.

src/Streamly/Internal/Data/Unfold/Types.hsnew file+27

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/Dir.hs → src/Streamly/Internal/FileSystem/Dir.hsrenamed+89−196

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event.hsdeleted−245

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Darwin.hs+198−254

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Linux.hs+270−342

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Windows.hs+167−249

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/File.hs → src/Streamly/Internal/FileSystem/File.hsrenamed+159−257

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/Handle.hs → src/Streamly/Internal/FileSystem/Handle.hsrenamed+290−331

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Memory/ArrayStream.hsnew file+236

This diff is too big to show here.

src/Streamly/Internal/Network/Inet/TCP.hs+150−190

This diff is too big to show here.

src/Streamly/Internal/Network/Socket.hs+288−229

This diff is too big to show here.

src/Streamly/Internal/System/IOVec.hsdeleted−132

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Unicode/Array/Prim/Pinned.hsnew file+85

This diff is too big to show here.

src/Streamly/Internal/Unicode/Char.hs+4−267

This diff is too big to show here.

src/Streamly/Internal/Unicode/Stream.hsnew file+912

This diff is too big to show here.

src/Streamly/Internal/Unicode/Utf8.hsdeleted−73

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Memory/Ring.hsnew file+250

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Network/Socket.hs+56−94

This diff is too big to show here.

src/Streamly/Prelude.hs+382−562

This diff is too big to show here.

src/Streamly/Tutorial.hsnew file+1730

This diff is too big to show here.

core/src/Streamly/Unicode/Stream.hs → src/Streamly/Unicode/Stream.hsrenamed+18−32

This diff is too big to show here.

src/assert.hsdeleted−6

This diff is too big to show here.

src/config.h.in+36

This diff is too big to show here.

src/inline.hs+2−2

This diff is too big to show here.

stack.yaml+10−10

This diff is too big to show here.

streamly.cabal+330−349

This diff is too big to show here.

targets/Targets.hsdeleted−213

This diff is too big to show here.

targets/cabal.projectdeleted−1

This diff is too big to show here.

targets/default.nixdeleted−163

This diff is too big to show here.

targets/streamly-targets.cabaldeleted−12

This diff is too big to show here.

test/README.mdmode 120000 → 100644+80−1

This diff is too big to show here.

test/Streamly/Test/Common/Array.hsnew file+246

This diff is too big to show here.

test/Streamly/Test/Data/Array.hs+3−268

This diff is too big to show here.

test/Streamly/Test/Data/Array/Common.hsdeleted−101

This diff is too big to show here.

test/Streamly/Test/Data/Array/CommonImports.hsdeleted−13

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/Array/Prim.hsnew file+12

This diff is too big to show here.

test/Streamly/Test/Data/Array/Prim/Pinned.hsnew file+12

This diff is too big to show here.

test/Streamly/Test/Data/Array/Storable/Foreign.hsnew file+12

This diff is too big to show here.

test/Streamly/Test/Data/Array/Stream.hsdeleted−113

This diff is too big to show here.

test/Streamly/Test/Data/Fold.hs+142−497

This diff is too big to show here.

test/Streamly/Test/Data/Fold/Window.hsdeleted−67

This diff is too big to show here.

test/Streamly/Test/Data/List.hs+28−29

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/Parser.hs+210−924

This diff is too big to show here.

test/Streamly/Test/Data/ParserK.hs → test/Streamly/Test/Data/Parser/ParserD.hsrenamed+121−264

This diff is too big to show here.

test/Streamly/Test/Data/Ring/Unboxed.hsdeleted−53

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/SmallArray.hs+3−20

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/Unfold.hs+93−345

This diff is too big to show here.

test/Streamly/Test/FileSystem/Event.hs+386−15

This diff is too big to show here.

test/Streamly/Test/FileSystem/Event/Common.hsdeleted−422

This diff is too big to show here.

test/Streamly/Test/FileSystem/Event/Darwin.hsdeleted−86

This diff is too big to show here.

test/Streamly/Test/FileSystem/Event/Linux.hsdeleted−163

This diff is too big to show here.

test/Streamly/Test/FileSystem/Event/Windows.hsdeleted−51

This diff is too big to show here.

test/Streamly/Test/FileSystem/Handle.hs+52−115

This diff is too big to show here.

test/Streamly/Test/Network/Inet/TCP.hsdeleted−144

This diff is too big to show here.

test/Streamly/Test/Network/Socket.hsdeleted−160

This diff is too big to show here.

test/Streamly/Test/Prelude.hs+38−40

This diff is too big to show here.

test/Streamly/Test/Prelude/Ahead.hs+15−17

This diff is too big to show here.

test/Streamly/Test/Prelude/Async.hs+14−51

This diff is too big to show here.

test/Streamly/Test/Prelude/Concurrent.hs+52−58

This diff is too big to show here.

test/Streamly/Test/Prelude/Fold.hs+13−28

This diff is too big to show here.

test/Streamly/Test/Prelude/Parallel.hs+19−21

This diff is too big to show here.

test/Streamly/Test/Prelude/Rate.hs+39−47

This diff is too big to show here.

test/Streamly/Test/Prelude/Serial.hs+139−227

This diff is too big to show here.

test/Streamly/Test/Prelude/Top.hsdeleted−224

This diff is too big to show here.

test/Streamly/Test/Prelude/WAsync.hs+22−75

This diff is too big to show here.

test/Streamly/Test/Prelude/WSerial.hs+18−42

This diff is too big to show here.

test/Streamly/Test/Prelude/ZipAsync.hs+5−10

This diff is too big to show here.

test/Streamly/Test/Prelude/ZipSerial.hs+10−12

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Unicode/Char.hsdeleted−133

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Unicode/Stream.hs+41−99

This diff is too big to show here.

test/Streamly/Test/Unicode/extra/NormalizationTest.txtdeleted−9

This diff is too big to show here.

test/Streamly/Test/Unicode/ucd/NormalizationTest.txt−18908

This diff is too big to show here.

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

This diff is too big to show here.

test/lib/Streamly/Test/Prelude/Common.hs+110−123

This diff is too big to show here.

test/streamly-tests.cabal+89−344

This diff is too big to show here.

test/test-runner/Main.hs−33

This diff is too big to show here.

test/test-runner/cabal.project−4

This diff is too big to show here.

test/test-runner/default.nix−164

This diff is too big to show here.

test/test-runner/test-runner.cabal−41

This diff is too big to show here.